int:\\n if len(nums)==1: return 0\\n\\n currentReachIndex = 0\\n prevReachIndex = 0\\n solution = 0\\n\\n for i in range(0,len(nums)):\\n if i + nums[i] > currentReachIndex:\\n currentReachIndex = i + nums[i]\\n \\n if i == prevReachIndex:\\n solution += 1\\n prevReachIndex = currentReachIndex\\n if prevReachIndex >= len(nums)-1:\\n break\\n\\n return solution\",\n \"memory\": \"17700\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n '''\\n greedily jump as far as you can each time\\n '''\\n\\n reachable = 0\\n current_jump = 0\\n jumps = 0\\n n = len(nums)\\n\\n # n-1 = 0, we start at idx 0, so no jumps needed\\n if n == 1:\\n return 0\\n\\n\\n for idx, num in enumerate(nums):\\n reachable = max(reachable, num + idx)\\n\\n # jump as far as you can each time\\n if idx == current_jump:\\n current_jump = reachable\\n jumps += 1\\n\\n if current_jump >= n - 1:\\n return jumps\\n\\n \\n\",\n \"memory\": \"17700\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n steps=[999999]*len(nums)\\n steps[0]=0\\n last=0\\n for i in range(0,len(nums)):\\n for j in range(max(i+1,last),min(i+nums[i]+1,len(nums)),1):\\n steps[j]=min(steps[j],steps[i]+1)\\n last=j\\n return steps[-1]\\n \",\n \"memory\": \"17800\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n steps=[999999]*len(nums)\\n steps[0]=0\\n last=0\\n for i in range(0,len(nums)):\\n for j in range(max(i+1,last),min(i+nums[i]+1,len(nums))):\\n steps[j]=min(steps[j],steps[i]+1)\\n last=j\\n return steps[-1]\\n \",\n \"memory\": \"17800\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n n = len(nums)\\n steps = [0] * n\\n index = [0] * n\\n steps[0] = 1\\n index[0] = 0\\n for i in range(1,n):\\n if nums[index[i-1]] + index[i-1] >= i:\\n steps[i] = steps[i-1]\\n index[i] = index[i-1]\\n else:\\n for j in range(i-1,0,-1):\\n if j + nums[j] >= i:\\n steps[i] = steps[j] + 1\\n index[i] = j\\n steps[0] = 0\\n return steps[-1]\",\n \"memory\": \"17900\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n # backtrack from the end to start - check how one canget to the end\\n\\n min_jumps = inf\\n def backtrack(nums, current_position_index: int = len(nums) - 1, current_jumps: int | float = 0):\\n nonlocal min_jumps\\n #print(\\\"current pos\\\", current_position_index)\\n if current_position_index <= 0:\\n #print(\\\"current jumps\\\", current_jumps)\\n min_jumps = min(min_jumps, current_jumps)\\n return \\n\\n # from which positions we could have got to the current possition?\\n previous_longest_jump = None\\n for i in range(current_position_index):\\n min_jump_distance = current_position_index - i\\n if nums[i] >= min_jump_distance:\\n previous_longest_jump = i\\n break\\n \\n #print(\\\"prev longest?\\\", previous_longest_jump, nums[i])\\n if previous_longest_jump is not None:\\n backtrack(nums, previous_longest_jump, current_jumps + 1)\\n \\n backtrack(nums)\\n \\n return min_jumps if min_jumps != inf else 0\\n\",\n \"memory\": \"17900\"\n },\n {\n \"code\": \"class Solution:\\n \\n\\n def jump(self,nums):\\n if len(nums) ==1:\\n return 0\\n def getNextJumps(current, nums,seen ):\\n possible = []\\n done = False\\n for index in current:\\n for num in range(1,nums[index]+1):\\n if index + num < len(nums) and index + num not in seen:\\n possible.append(index + num)\\n seen[index+num] = True\\n if (index + num >= len(nums)-1):\\n done = True\\n \\n return (possible, done)\\n steps = 0\\n currentWindow = [0]\\n seen = {}\\n while True:\\n nextWindow, done = getNextJumps(currentWindow, nums, seen)\\n steps += 1\\n if done:\\n return steps\\n else:\\n currentWindow = nextWindow\",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n count = 0\\n l = r = 0\\n while r < len(nums) - 1:\\n maxJump = 0\\n for i in range(l, r + 1):\\n maxJump = max(maxJump, i + nums[i])\\n print(i, nums[i], maxJump)\\n l = r + 1\\n r = maxJump\\n count += 1\\n return count \",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n n = len(nums)\\n min_jumps = {}\\n\\n min_jumps = {i: float('inf') for i in range(n)}\\n min_jumps[0]=0\\n\\n for i in range(n):\\n for j in range(i + 1, min(i + nums[i] + 1, n)):\\n min_jumps[j]=min(min_jumps[i]+1, min_jumps[j])\\n\\n return min_jumps[n - 1]\\n \",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n def find(nums,idx,dp):\\n k=0\\n if idx>=len(nums)-1:\\n return 0\\n if dp[idx]!=-1:\\n return dp[idx]\\n mj=len(nums)+1\\n for i in range(nums[idx],0,-1):\\n k=1+find(nums,idx+i,dp)\\n mj=min(mj,k)\\n dp[idx]=mj\\n return mj\\n dp=[-1]*(len(nums)+1)\\n return find(nums,0,dp)\\n \",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n q = deque()\\n q.append((0, 0))\\n visited = set()\\n best = 10 ** 5\\n while q:\\n idx, steps = q.popleft()\\n visited.add(idx)\\n if idx == len(nums) - 1:\\n best = min(best, steps)\\n elif idx < len(nums):\\n for i in range(nums[idx]):\\n next_idx = idx + i + 1\\n if next_idx not in visited:\\n q.append((next_idx, steps + 1))\\n visited.add(next_idx)\\n \\n return best\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"from collections import deque\\nclass Solution:\\n def jump(self, nums: List[int]) -> int:\\n if len(nums)<=1:\\n return 0\\n\\n nJumps = 0\\n\\n q = deque([0])\\n visited = set([0])\\n while q:\\n nJumps += 1\\n for _ in range(len(q)):\\n i = q.popleft()\\n for j in range(1, nums[i]+1):\\n if i+j == len(nums)-1:\\n return nJumps\\n if i+j not in visited:\\n q.append(i+j)\\n visited.add(i+j)\\n\\n return nJumps\\n\\n\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n if len(nums) == 1:\\n return 0\\n \\n q= deque()\\n q.append(0)\\n visit = set()\\n visit.add(0)\\n step = 0\\n while q:\\n step += 1\\n for i in range(len(q)):\\n index = q.popleft()\\n for i in range(1, nums[index]+1):\\n if index+i == len(nums)-1:\\n return step\\n if index+i not in visit:\\n q.append(index+i)\\n visit.add(index+i)\\n return step\",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"# from collections import deque\\n# class Solution:\\n# def jump(self, nums: List[int]) -> int:\\n# if len(nums)<=1:\\n# return 0\\n\\n# nJumps = 0\\n\\n# q = deque([0])\\n# visited = set([0])\\n# while q:\\n# i = q.popleft()\\n# nJumps += 1\\n# for j in range(1, nums[i]+1):\\n# if i+j == len(nums)-1:\\n# return nJumps\\n# if i+j not in visited:\\n# q.append(i+j)\\n# visited.add(i+j)\\n\\n# return nJumps\\n\\n\\n\\nfrom collections import deque\\nclass Solution:\\n def jump(self, nums: List[int]) -> int:\\n if len(nums) <= 1:\\n return 0\\n\\n nJumps = 0\\n q = deque([0])\\n visited = set([0]) # To avoid revisiting the same index\\n \\n while q:\\n nJumps += 1\\n size = len(q) # Process all nodes at the current level\\n for _ in range(size):\\n i = q.popleft()\\n for j in range(1, nums[i] + 1):\\n next_idx = i + j\\n if next_idx >= len(nums) - 1: # If we can reach the end\\n return nJumps\\n if next_idx not in visited:\\n visited.add(next_idx) # Mark as visited\\n q.append(next_idx)\",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def jump(self, nums: List[int]) -> int:\\n dp = defaultdict(int)\\n dp[0] = 0\\n for index, num in enumerate(nums):\\n for i in range(num, 0, -1):\\n j = index+i\\n if not dp[j]:\\n dp[j] = dp[index] + 1\\n else:\\n dp[j] = min(dp[j], dp[index] + 1)\\n #print(dp)\\n return dp[len(nums)-1]\",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def jump(self, nums: List[int]) -> int:\\n # BFS\\n visited = set()\\n q = deque([0])\\n # key: index / value: distance\\n d = {0: 0}\\n\\n while len(q) > 0:\\n i = q.popleft()\\n max_jump = nums[i]\\n # print(f\\\"i = {i} ({nums[i]})\\\")\\n\\n # for nodes (indices) reachable from i\\n for j in range(max_jump):\\n target = i + j + 1\\n # can't go beyond end of list\\n if target >= len(nums) or target in d:\\n continue\\n \\n this_d = d[i] + 1\\n if target == len(nums) - 1:\\n return this_d\\n \\n # print(f\\\" target = {target} (this_d = {this_d})\\\")\\n \\n # update distance to target\\n d[target] = this_d\\n \\n # add to queue if not visited\\n if target not in visited:\\n q.append(target)\\n \\n visited.add(i)\\n\\n # print(f\\\"i = {i} ({nums[i]}) // d = {d}\\\\n\\\")\\n \\n # print(d)\\n return d[len(nums) - 1]\\n\",\n \"memory\": \"18600\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n # backtrack from the end to start - check how one canget to the end\\n\\n min_jumps = inf\\n def backtrack(nums, current_position_index: int = len(nums) - 1, current_jumps: int | float = 0):\\n nonlocal min_jumps\\n #print(\\\"current pos\\\", current_position_index)\\n if current_position_index <= 0:\\n #print(\\\"current jumps\\\", current_jumps)\\n min_jumps = min(min_jumps, current_jumps)\\n return \\n\\n # from which positions we could have got to the current possition?\\n possible_previous_positions = []\\n min_jump_distance = 1\\n for i in range(current_position_index - 1, -1, -1):\\n if nums[i] >= min_jump_distance:\\n possible_previous_positions.append(i)\\n \\n min_jump_distance += 1\\n \\n #print(\\\"possible prev\\\", possible_previous_positions)\\n #for i in possible_previous_positions:\\n if possible_previous_positions:\\n backtrack(nums, possible_previous_positions[-1], current_jumps + 1)\\n \\n backtrack(nums)\\n \\n return min_jumps\\n\",\n \"memory\": \"18700\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n reachable = {0: True}\\n path = {0: 1}\\n for i in range(len(nums)):\\n if reachable[i]:\\n for j in range(1, nums[i]+1):\\n if i+j >= len(nums):\\n break\\n if i+j not in reachable:\\n reachable[i+j] = True\\n path[i+j] = path[i] + 1\\n else:\\n if path[i] < path[i+j] - 1:\\n path[i+j] = path[i] + 1\\n return path[len(nums)-1]-1\",\n \"memory\": \"18800\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n if not nums:\\n raise ValueError(\\\"nums cannot be None or empty\\\")\\n result = 0\\n cur_level = set([0])\\n while cur_level:\\n next_level = set()\\n for cur in cur_level:\\n if cur == len(nums) - 1:\\n return result\\n for i in range(1, nums[cur] + 1):\\n if cur + i < len(nums) and cur + i not in next_level:\\n next_level.add(cur + i)\\n result += 1\\n cur_level = next_level\\n return -1 # cannot reach the end\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n if len(nums)<2:\\n return 0\\n\\n def reach_k(k,nb=1):\\n for i in range(k):\\n if nums[i]+i>=k:\\n if i==0:\\n return nb\\n return reach_k(i,nb+1)\\n return reach_k(len(nums)-1)\\n\\n \",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n if len(nums)<2:\\n return 0\\n\\n def reach_k(k,nb=1):\\n for i in range(k):\\n if nums[i]+i>=k:\\n if i==0:\\n return nb\\n return reach_k(i,nb+1)\\n return reach_k(len(nums)-1)\\n\\n \",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n res = [0]\\n \\n def search(i):\\n if i==0:\\n return\\n \\n for j in range(i):\\n if j+nums[j] >= i:\\n res[0]+=1\\n search(j)\\n break\\n \\n search(len(nums)-1)\\n \\n return res[0]\",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n # backtrack from the end to start - check how one canget to the end\\n\\n min_jumps = inf\\n def backtrack(current_position_index: int = len(nums) - 1, current_jumps: int | float = 0):\\n nonlocal min_jumps\\n #print(\\\"current pos\\\", current_position_index)\\n if current_position_index <= 0:\\n #print(\\\"current jumps\\\", current_jumps)\\n min_jumps = min(min_jumps, current_jumps)\\n return \\n\\n # from which positions we could have got to the current possition?\\n previous_longest_jump = None\\n for i in range(current_position_index):\\n min_jump_distance = current_position_index - i\\n if nums[i] >= min_jump_distance:\\n previous_longest_jump = i\\n break\\n \\n #print(\\\"prev longest?\\\", previous_longest_jump, nums[i])\\n if previous_longest_jump is not None:\\n backtrack(previous_longest_jump, current_jumps + 1)\\n \\n backtrack()\\n return min_jumps if min_jumps != inf else 0\\n\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n n = len(nums)\\n if n == 1:\\n return 0\\n \\n hopsToEnd = [n+1 for _ in nums]\\n\\n def dfs(i):\\n for j in range(nums[i],0,-1):\\n if i + j >= n-1:\\n hopsToEnd[i] = 1\\n else:\\n if hopsToEnd[i+j] == n+1:\\n dfs(i+j) # Check how long from that jump\\n hopsToEnd[i] = min(1 + hopsToEnd[i+j], hopsToEnd[i])\\n \\n dfs(0)\\n return hopsToEnd[0]\\n\\n\\n\\n \\n\\n\\n\\n \",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n n=len(nums)\\n if n == 1:\\n return 0\\n if nums[0]>=n-1:\\n return 1\\n list_of_reach = [i for i in range(nums[0]+1)]\\n for i in range(1, n):\\n print(list_of_reach)\\n # for each number of jump (we already had 1)\\n # maybe only 1 so max possible is n\\n new_list = set()\\n for j in list_of_reach:\\n # for each starting point\\n for k in range(1,nums[j]+1):\\n # check if reached\\n if j+k >= n-1:\\n return i + 1\\n # add new possible destination\\n new_list.add(j+k)\\n list_of_reach=new_list\\n # never here\\n return -1\",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n n = len(nums)\\n memo = [-1 for _ in range(n)]\\n def jumping(i):\\n if i == n-1:\\n return 0\\n if nums[i] == 0:\\n return 10000\\n if memo[i] != -1:\\n return memo[i]\\n minimumJumps = 10000\\n for j in reversed(range(1, nums[i] + 1)):\\n if i + j >= n:\\n continue\\n jumps = 1 + (jumping(i + j))\\n if jumps < minimumJumps:\\n minimumJumps = jumps\\n memo[i] = minimumJumps\\n return minimumJumps\\n return jumping(0)\\n \\n \\n \",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n \\n target = len(nums) - 1\\n def dp(nums, idx, memo):\\n if idx > target:\\n return float('inf')\\n \\n if memo[idx] != float('inf'):\\n return memo[idx]\\n \\n \\n min_steps = memo[idx]\\n for i in range(1, nums[idx] + 1):\\n temp = dp(nums, idx + i, memo)\\n min_steps = min(min_steps, 1 + temp)\\n \\n memo[idx] = min_steps\\n return memo[idx]\\n\\n memo = [float('inf')] * (len(nums) + 1)\\n memo[target] = 0\\n\\n dp(nums, 0, memo)\\n\\n return memo[0]\\n\\n\",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"class Solution:\\n # brute-force\\n def minjump(self,nums: List[int], idx):\\n if idx>=len(nums)-1:\\n return 0\\n count=10001\\n for i in range(idx+1,idx+nums[idx]+1):\\n count=min(count,1+self.minjump(nums,i))\\n return count\\n\\n # recursive dp\\n def minjumpdp(self,nums: List[int],dp: List[int], idx):\\n if idx>=len(nums)-1:\\n return 0\\n if dp[idx]<1001:\\n return dp[idx]\\n count=1001\\n for i in range(idx+1,idx+nums[idx]+1):\\n dp[idx]=min(dp[idx],1+self.minjumpdp(nums,dp,i))\\n return dp[idx]\\n\\n\\n def min_jump(self,dp,nums, index):\\n\\n if index>=len(nums)-1:\\n return 0\\n if dp[index]!=100000:\\n return dp[index]\\n step = 100000\\n for i in range(1,nums[index]+1):\\n x = self.min_jump(dp,nums,index+i)+1\\n step = min(step,x)\\n dp[index]=step\\n return step\\n\\n\\n def jump(self, nums: List[int]) -> int:\\n \\n dp = [ 100000 for _ in range(0,len(nums))]\\n res =self.min_jump(dp,nums, 0)\\n\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # if len(nums)<=1:\\n # return 0\\n # for i in range(1,len(nums)):\\n # nums[i]=max(nums[i]+i,nums[i-1])\\n \\n # i=0\\n # count=0\\n # while i<len(nums)-1:\\n # count+=1\\n # i=nums[i]\\n \\n # return count\\n\\n # brute-force\\n # res=self.minjump(nums,0)\\n\\n # recursive dp\\n # dp = [10001 for i in range(0,len(nums))]\\n # res=self.minjumpdp(nums,dp,0)\\n # return res\\n\\n # iterative dp\\n # dp = [10001 for i in range(0,len(nums))]\\n\\n # dp[len(nums)-1]=0\\n\\n # for i in range(len(nums)-2,-1,-1):\\n # for j in range(i+1,i+nums[i]+1):\\n # dp[i]=min(dp[i],1+dp[min(len(nums)-1,j)])\\n\\n # return dp[0]\\n\\n # greedy BFS\\n x=0\\n count=0\\n i=0\\n mx=0;mxidx=0\\n\\n while mxidx<len(nums)-1 :\\n mx=max(mx,i+nums[i])\\n if(i==mxidx):\\n mxidx=mx\\n count+=1\\n i+=1\\n return count\\n\\n\\n\\n\",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"class Solution:\\n def recurse(self, i):\\n if i == self.n - 1:\\n return 0\\n if i in self.memo:\\n return self.memo[i]\\n if i + self.nums[i] >= self.n - 1:\\n return 1\\n\\n min_steps = -1\\n for j in range(1, self.nums[i] + 1):\\n next_num_steps = self.recurse(i + j)\\n if next_num_steps > 0:\\n num_steps = next_num_steps + 1\\n if min_steps < 0 or num_steps < min_steps:\\n min_steps = num_steps\\n\\n self.memo[i] = min_steps\\n return min_steps\\n\\n def jump(self, nums: List[int]) -> int:\\n self.nums = nums\\n self.n = len(nums)\\n self.memo = {}\\n \\n return self.recurse(0)\",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n k = len(nums)\\n # -2 is unknow, -1 is unreachable\\n self.memo = [-2]*k\\n self.memo[-1] = 0\\n\\n return self.minJump(nums, 0)\\n\\n\\n def minJump(self, nums: List[int], pos: int) -> int:\\n if self.memo[pos] != -2:\\n return self.memo[pos]\\n\\n right_most = min(pos + nums[pos], len(nums) - 1)\\n\\n ans = sys.maxsize\\n\\n for next_step in range(pos+1, right_most+1):\\n temp = self.minJump(nums, next_step)\\n\\n if temp == -1:\\n continue\\n\\n ans = min(ans, temp+1)\\n\\n if ans < sys.maxsize:\\n self.memo[pos] = ans\\n return ans\\n\\n self.memo[pos] = -1\\n return -1\\n\",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n n = len(nums)\\n dp = [10001] * n\\n dp[0] = 0\\n def do_dp(i):\\n # print(\\\"do_dp\\\",i)\\n if dp[i] != 10001:\\n return dp[i]\\n for j in range(i):\\n if j + nums[j] >= i:\\n dp[i] = min(dp[i], do_dp(j)+1)\\n return dp[i]\\n # do_dp(n-1)\\n # print(dp)\\n return do_dp(n-1)\",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n def rec(i):\\n minJumps = 1e9\\n if i>=len(nums)-1:\\n return 0\\n if dp[i]!=-1:\\n return dp[i]\\n for ind in range(nums[i], 0, -1):\\n jump = 1+rec(i+ind)\\n minJumps = min(jump,minJumps)\\n dp[i] = minJumps\\n return dp[i]\\n dp = [-1]*len(nums)\\n ans = rec(0)\\n return ans \",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n self.memo = {}\\n return self.canDo(nums, 0)\\n\\n def canDo(self, nums, currIndex):\\n if currIndex in self.memo:\\n return self.memo[currIndex]\\n if currIndex >= len(nums) - 1:\\n return 0\\n res = float(\\\"inf\\\")\\n for i in range(currIndex+1, nums[currIndex]+currIndex+1):\\n res = min(self.canDo(nums, i) + 1, res)\\n self.memo[currIndex] = res\\n return res\",\n \"memory\": \"20100\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n n = len(nums)\\n dp = [-1]*n\\n return self.helper(0, dp, nums)\\n\\n\\n def helper(self, i, dp, nums):\\n if i >= len(nums):\\n return float('inf')\\n if dp[i] != -1:\\n return dp[i]\\n if i == len(nums) - 1:\\n return 0\\n else:\\n mini = float('inf')\\n for j in range(1, nums[i] + 1):\\n mini = min(mini, self.helper(i + j, dp, nums))\\n dp[i] = mini + 1\\n return dp[i]\",\n \"memory\": \"20200\"\n },\n {\n \"code\": \"class Solution:\\n def rec(self, ind, n, nums, dp):\\n if ind >= n - 1:\\n return 0\\n \\n if dp[ind] != -1:\\n return dp[ind]\\n\\n mini = float('inf')\\n\\n for i in range(1, nums[ind] + 1):\\n mini = min(1 + self.rec(ind+i, n, nums, dp), mini)\\n \\n dp[ind] = mini\\n return mini\\n \\n def jump(self, nums: List[int]) -> int:\\n dp = [-1] * len(nums)\\n return self.rec(0, len(nums), nums, dp)\",\n \"memory\": \"20300\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.seen = {}\\n\\n def jumpCore(self, nums, i):\\n if i in self.seen:\\n return self.seen[i]\\n\\n if i == self.goal:\\n return 0\\n \\n minSteps = float(\\\"inf\\\")\\n\\n for j in range(1, nums[i] + 1):\\n if i + j <= self.goal:\\n minSteps = min(minSteps, 1 + self.jumpCore(nums, i + j))\\n\\n self.seen[i] = minSteps\\n return minSteps\\n \\n def jump(self, nums: List[int]) -> int:\\n self.goal = len(nums) - 1\\n return self.jumpCore(nums, 0)\",\n \"memory\": \"20400\"\n },\n {\n \"code\": \"class Solution:\\n\\n def game(self, nums, pos, cache):\\n if pos >= len(nums) - 1:\\n return 0\\n if pos in cache:\\n return cache[pos]\\n\\n min_jumps = len(nums) + 1\\n for i in range(1, nums[pos] + 1):\\n min_jumps = min(min_jumps, self.game(nums, pos + i, cache))\\n\\n cache[pos] = min_jumps + 1\\n return min_jumps + 1\\n\\n\\n\\n def jump(self, nums: List[int]) -> int:\\n return self.game(nums, 0, cache=dict())\",\n \"memory\": \"20500\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def jump(self, nums: List[int]) -> int:\\n # Create an array to store the minimum jumps required from each index\\n sol = [-1] * len(nums)\\n \\n def f(nums, sol, ind):\\n # If already computed, return the stored result\\n if sol[ind] != -1:\\n return sol[ind]\\n \\n # Base case: If we are at or beyond the last index, no more jumps needed\\n if ind >= len(nums) - 1:\\n return 0\\n \\n # Calculate minimum jumps needed from current index\\n min_jumps = float('inf')\\n max_jump = nums[ind]\\n \\n for i in range(1, max_jump + 1):\\n if ind + i < len(nums):\\n min_jumps = min(min_jumps, 1 + f(nums, sol, ind + i))\\n \\n sol[ind] = min_jumps\\n return sol[ind]\\n \\n # Start the recursion from index 0\\n return f(nums, sol, 0)\\n\",\n \"memory\": \"20600\"\n },\n {\n \"code\": \"class Solution:\\n def jump(self, nums: List[int]) -> int:\\n memo={}\\n n=len(nums)\\n return(self.helper(nums,memo,0,n))\\n def helper(self,nums,memo,i,n):\\n if len(nums[i:])==1:\\n return 0\\n saut=nums[i]\\n liste=[]\\n if saut>=n-i-1:\\n memo[i]=1\\n return(memo[i])\\n min=inf\\n print(saut)\\n for j in range(i+1,i+saut+1):\\n if j not in memo:\\n memo[j]=self.helper(nums,memo,j,n)\\n if memo[j]<min:\\n min=memo[j]\\n if min==1:\\n break\\n memo[i]=min+1\\n return(memo[i])\\n\\n\\n\\n\\n \",\n \"memory\": \"20700\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":52,"string":"52"}}},{"rowIdx":139,"cells":{"question_id":{"kind":"number","value":46,"string":"46"},"name":{"kind":"string","value":"permutations"},"content":{"kind":"string","value":"<p>Given an array <code>nums</code> of distinct integers, return <em>all the possible permutations</em>. You can 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,2,3]\n<strong>Output:</strong> [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]\n</pre><p><strong class=\"example\">Example 2:</strong></p>\n<pre><strong>Input:</strong> nums = [0,1]\n<strong>Output:</strong> [[0,1],[1,0]]\n</pre><p><strong class=\"example\">Example 3:</strong></p>\n<pre><strong>Input:</strong> nums = [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 <= 6</code></li>\n\t<li><code>-10 <= nums[i] <= 10</code></li>\n\t<li>All the integers of <code>nums</code> are <strong>unique</strong>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":79.22986666892238,"string":"79.229867"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","backtracking"],"string":"[\n \"array\",\n \"backtracking\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"17\", 0.0034], [\"18\", 0.0068], [\"19\", 0.0205], [\"20\", 0.0205], [\"21\", 0.0171], [\"22\", 0.0443], [\"23\", 0.0921], [\"24\", 0.0955], [\"25\", 0.0887], [\"26\", 0.307], [\"27\", 0.6208], [\"28\", 0.4741], [\"29\", 0.5594], [\"30\", 1.1359], [\"31\", 2.2172], [\"32\", 1.593], [\"33\", 2.0228], [\"34\", 3.5407], [\"35\", 5.4271], [\"36\", 3.9705], [\"37\", 4.3492], [\"38\", 6.4606], [\"39\", 8.6949], [\"40\", 6.3583], [\"41\", 6.2253], [\"42\", 7.2827], [\"43\", 8.463], [\"44\", 6.2901], [\"45\", 5.0962], [\"46\", 4.6357], [\"47\", 4.1343], [\"48\", 3.1723]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16100\", 0.0102], [\"16200\", 0.0205], [\"16300\", 0.0614], [\"16400\", 0.8323], [\"16500\", 7.5283], [\"16600\", 22.8135], [\"16700\", 36.7888], [\"16800\", 26.4156]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n res = []\n def dfs(cur):\n if len(nums) == len(cur):\n \n res.append(cur.copy())\n return\n for j in nums:\n if j not in cur:\n cur.append(j)\n dfs(cur)\n cur.pop()\n dfs([])\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n res = []\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return \n for j in nums:\n if j in cur:\n continue\n cur.append(j)\n dfs(cur)\n cur.pop()\n dfs([])\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n res = []\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return \n for j in range(len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n dfs(cur)\n cur.pop()\n dfs([])\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n res = []\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for j in range(len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n dfs(cur)\n cur.pop()\n dfs([])\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n\n res = []\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for j in range(len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n dfs(cur)\n cur.pop()\n dfs([])\n return res\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 res = []\n def dfs(cur):\n if len(cur)==len(nums):\n res.append(cur.copy())\n return\n # if i>=len(nums):return\n for j in range(len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n dfs(cur)\n cur.pop()\n dfs([])\n return res\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n res = []\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for j in range(len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n dfs(cur)\n cur.pop()\n dfs([])\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n res = []\n def dfs(i,cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for j in range(len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n dfs(j+1,cur)\n cur.pop()\n dfs(0,[])\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n res = []\n def dfs(i,cur):\n if len(cur)==len(nums):\n res.append(cur.copy())\n return\n for j in range(len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n dfs(j+1,cur)\n cur.pop()\n dfs(0,[])\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n res = []\n def dfs(i,cur):\n if len(cur) == len(nums):\n if cur not in res:\n res.append(cur.copy())\n return\n for j in range(len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n dfs(j,cur)\n cur.pop()\n dfs(0,[])\n return res\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n res = []\n def dfs(cur):\n if len(cur) == len(nums):\n if cur not in res:\n res.append(cur.copy())\n return\n for i in range(len(nums)):\n if nums[i] not in cur:\n cur.append(nums[i])\n dfs(cur)\n cur.pop()\n dfs([])\n return res\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 res = []\n def dfs(i,cur):\n if i>=len(nums):return\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for j in range(len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n dfs(j,cur)\n cur.pop()\n dfs(0,[])\n return res\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\n\n\n\n res = []\n def dfs(i,cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n if i>=len(nums):return\n for j in nums:\n if j not in cur:\n cur.append(j)\n dfs(i,cur)\n cur.pop()\n dfs(0,[])\n return res\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 res = []\n def dfs(i,cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n if i>=len(nums):return\n for j in range(len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n dfs(i+1,cur)\n cur.pop()\n \n dfs(0,[])\n return res\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\n\n\n\n\n\n\n\n\n\n res = []\n def dfs(i,cur):\n if len(cur)==len(nums):\n res.append(cur.copy())\n return \n if i>=len(nums):return\n for j in range(len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n dfs(i+1,cur)\n cur.pop()\n dfs(0,[])\n return res\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 res = []\n def dfs(i,cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n if i>=len(nums):return\n for j in range(len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n dfs(i+1,cur)\n cur.pop()\n dfs(0,[])\n return res\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\n\n\n\n res = []\n def dfs(i,cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return \n if i>=len(nums):return\n for j in range(i,len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n dfs(i,cur)\n cur.pop()\n dfs(0,[])\n return res \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\n\n\n\n\n\n\n\n res = []\n def dfs(cur,i):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n if i>=len(nums):\n return\n for j in range(len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n dfs(cur,i+1)\n cur.pop()\n dfs([],0)\n return res\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 res = []\n def dfs(i,cur):\n if len(nums) == len(cur):\n res.append(cur.copy())\n return \n if i>=len(nums):\n return\n for j in range(len(nums)):\n if nums[j] not in cur:\n cur.append(nums[j])\n \n dfs(i+1,cur)\n cur.pop()\n \n dfs(0,[])\n return res\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\n\n\n\n\n\n\n res = []\n def dfs(i,cur):\n if len(cur)==len(nums):\n res.append(cur.copy())\n return\n if i>=len(nums):\n return\n for j in range(len(nums)):\n if nums[j] not in cur:\n \n cur.append(nums[j])\n print(cur,\"a\")\n dfs(j,cur)\n print(cur,\"p\")\n cur.pop()\n dfs(0,[])\n return res\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\n\n\n\n\n\n\n\n\n def dfs(cur,num):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for i in range(len(nums)):\n if nums[i] not in cur:\n cur.append(nums[i])\n dfs(cur,i+1)\n \n cur.pop()\n \n dfs([],0)\n return res\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 res = []\n def dfs(curr,num):\n if len(curr) == len(nums):\n res.append(curr.copy())\n return\n \n for i in range(len(nums)):\n if nums[i] not in curr:\n curr.append(nums[i])\n\n dfs(curr,i+1)\n \n curr.pop()\n dfs([],0)\n return res\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n res = []\n if len(nums) == 1:\n return [nums.copy()]\n for i in range(len(nums)):\n n = nums.pop(0)\n perms = self.permute(nums)\n for perm in perms:\n perm.append(n)\n res.extend(perms)\n nums.append(n)\n return res","runtime":"17"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n def backtrack(first=0):\n if first == n:\n output.append(nums[:])\n for i in range(first, n):\n nums[first], nums[i] = nums[i], nums[first]\n backtrack(first + 1)\n nums[first], nums[i] = nums[i], nums[first]\n \n n = len(nums)\n output = []\n backtrack()\n return output\n","runtime":"18"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n res = []\n\n def bt(i):\n if i >= len(nums):\n res.append(nums[:])\n\n for j in range(i, len(nums)):\n nums[i], nums[j] = nums[j], nums[i]\n bt(i + 1)\n nums[i], nums[j] = nums[j], nums[i]\n\n bt(0)\n return res\n","runtime":"19"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n \n res = []\n \n if len(nums) == 0:\n return [[]]\n\n\n perms = self.permute(nums[1:])\n for p in perms:\n for i in range(len(p) + 1):\n p_copy = p.copy()\n p_copy.insert(i, nums[0])\n res.append(p_copy)\n\n return res\n\n\n\n","runtime":"20"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n permutations = []\n self._backtracking(nums, set(), [], permutations)\n return permutations\n\n \n def _backtracking(\n self,\n nums: list[int],\n visited: set[int],\n permutation: list[int],\n permutations: list[list[int]]\n ):\n if len(permutation) == len(nums):\n permutations.append(list(permutation))\n return\n for num in nums:\n if num in visited:\n continue\n permutation.append(num)\n visited.add(num)\n self._backtracking(nums, visited, permutation, permutations)\n visited.remove(num)\n permutation.pop()\n\n ","runtime":"21"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 0:\n return [[]]\n perms = self.permute(nums[1:])\n res = []\n\n for p in perms:\n for i in range(len(p)+1):\n p_copy = p.copy()\n p_copy.insert(i,nums[0])\n res.append(p_copy)\n\n return res","runtime":"22"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n res = []\n def generate(nums, prefix):\n if not nums:\n res.append(prefix)\n return\n \n for i in range(len(nums)):\n if i == 0:\n generate(nums[1:], prefix + [nums[0]])\n elif i == len(nums) - 1:\n generate(nums[0:-1], prefix + [nums[-1]])\n else:\n generate(nums[:i] + nums[i+1:], prefix + [nums[i]])\n \n generate(nums, [])\n return res","runtime":"23"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n solution = []\n self.btrk(nums, [], solution)\n return solution\n \n def btrk(self, nums: List[int], state, solution):\n \n if len(nums) == 0:#len(state) == len(nums):\n #print(\"AAAAAAAAAAAAAAAAAA\")\n solution.append(state[:])\n for idx, n in enumerate(nums):\n #n = nums.pop()\n state.append(n)\n self.btrk(nums[:idx]+nums[idx+1:], state, solution)\n state.pop()\n #nums.append(n)\n #print(solution)\n \n\n","runtime":"24"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 0:\n return [[]]\n\n perms = self.permute(nums[1:])\n res = []\n\n for p in perms:\n for i in range(len(p) + 1):\n p_copy = p.copy()\n p_copy.insert(i, nums[0])\n res.append(p_copy)\n return res\n\n ","runtime":"25"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 0:\n return [[]]\n\n perms = self.permute(nums[1:])\n res = []\n for p in perms:\n for i in range(len(p) + 1):\n p_copy = p.copy()\n p_copy.insert(i, nums[0])\n res.append(p_copy)\n\n return res","runtime":"26"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 0:\n return [[]]\n perms = self.permute(nums[1:])\n res = []\n for p in perms:\n for i in range(len(p)+1):\n pCopy = p.copy()\n pCopy.insert(i, nums[0])\n res.append(pCopy)\n return res","runtime":"27"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 1:\n return [nums]\n res = []\n for i in range(len(nums)):\n curr = nums[i]\n remain = nums[:i]+nums[i+1:]\n res += [[curr]+subperm for subperm in self.permute(remain)]\n return res","runtime":"27"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 1:\n return [nums]\n if len(nums) == 2:\n return [nums, nums[::-1]]\n return [[nums[i]] + j for i in range(len(nums)) for j in Solution.permute(self, nums[:i]+nums[i+1:])]","runtime":"28"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 0:\n return [[]]\n res = [] \n for perm in self.permute(nums[1:]):\n for i in range(len(perm) + 1):\n perm_copy = perm[:]\n perm_copy.insert(i, nums[0])\n res.append(perm_copy)\n \n return res\n ","runtime":"28"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 0:\n return [[]]\n res = []\n perms = self.permute(nums[1:])\n for p in perms:\n for i in range(len(p)+1):\n p_copy = p.copy()\n p_copy.insert(i, nums[0])\n res.append(p_copy)\n return res","runtime":"29"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n res = []\n\n def rec(mem, tmp=[]):\n if len(mem) == 0:\n res.append(tmp[:])\n return\n\n for i in range(len(mem)):\n tmp.append(mem[i])\n rec([mem[j] for j in range(len(mem)) if j != i], tmp)\n tmp.pop()\n\n rec(nums, [])\n return res\n\n\n\n # res = []\n\n # def rec(mem, tmp=[]):\n # if len(mem) == 0:\n # res.append(tmp)\n # return\n\n # for i in range(len(mem)):\n # rec([mem[j] for j in range(len(mem)) if j != i], tmp + [mem[i]])\n\n # rec(nums)\n # return res\n\n\n\n# ","runtime":"29"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n \n # def dfs(curr_len, curr, visited):\n # nonlocal res\n\n # if curr_len == total_len:\n # res.append(curr[:]) #you alwasy fucking forget this \n # return \n \n # for i in range(total_len):\n # if not visited[i]:\n # visited[i] = True\n # curr.append(nums[i])\n # dfs(curr_len + 1, curr, visited)\n # curr.pop()\n # visited[i] = False\n \n # res = []\n # total_len = len(nums)\n # visited = [False] * total_len\n # dfs(0, [], visited)\n # return res\n\n def dfs(start):\n if start == len(nums):\n res.append(nums[:])\n return \n \n for i in range(start, len(nums)):\n nums[start], nums[i] = nums[i], nums[start]\n dfs(start+1)\n nums[start], nums[i] = nums[i], nums[start]\n \n \n res = []\n dfs(0)\n return res\n\n # 123\n # 213\n # 321","runtime":"30"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 0:\n return [[]]\n\n perms = self.permute(nums[1:])\n res = []\n for p in perms:\n for i in range(len(p) + 1):\n p_copy = p.copy()\n p_copy.insert(i, nums[0])\n res.append(p_copy)\n\n return res","runtime":"30"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n \n\n def backtrack(perm: List[int]) -> None:\n if len(perm) == len(nums):\n res.append(perm[:])\n return\n perm_set = set(perm)\n for i in range(len(nums)):\n if nums[i] in perm_set:\n continue\n\n perm.append(nums[i])\n backtrack(perm)\n perm.pop()\n\n res = []\n backtrack([])\n return res","runtime":"31"},{"code":"class Solution:\n\n def dfs(self, visited, curr_perm):\n if len(visited) == len(self.nums):\n self.answers.append(list(curr_perm))\n return\n \n for num in self.nums:\n if num not in visited:\n visited.add(num)\n curr_perm.append(num)\n self.dfs(visited, curr_perm)\n curr_perm.pop()\n visited.remove(num)\n\n def permute(self, nums: List[int]) -> List[List[int]]:\n self.answers = []\n self.nums = nums\n self.dfs(set(), [])\n return self.answers\n ","runtime":"31"},{"code":"class Solution:\n def __init__(self):\n self.result = []\n \n def permute(self, nums: List[int]) -> List[List[int]]:\n track = []\n used = [False]*len(nums)\n self.backtrack(nums, track, used)\n return self.result\n\n def backtrack(self, nums, track, used):\n if len(track) == len(nums):\n self.result.append(track.copy())\n return\n \n for i in range(len(nums)):\n if used[i]:\n continue\n \n track.append(nums[i])\n used[i] = True\n self.backtrack(nums, track, used)\n track.pop()\n used[i] = False\n \n \n\n ","runtime":"32"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n return list(itertools.permutations(nums))\n\n","runtime":"32"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n\n def backtrack(path: list[int], used: list[bool]) -> None:\n if len(path) == len(nums):\n result.append(path.copy())\n for idx, candidate in enumerate(nums):\n if not used[idx]:\n used[idx] = True\n path.append(candidate)\n backtrack(path, used)\n path.pop()\n used[idx] = False\n\n result = []\n backtrack([], [False] * len(nums))\n return result\n ","runtime":"33"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n # backtracking: t=O(n*n!), space=O(n*n!)\n \n res = []\n perm = []\n visited = set()\n def dfs(i):\n if i == len(nums):\n res.append(perm.copy())\n return \n if i > len(nums):\n return\n for num in nums:\n if num not in visited:\n visited.add(num)\n perm.append(num)\n dfs(i + 1)\n perm.pop()\n visited.remove(num)\n dfs(0)\n return res","runtime":"33"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n l=[]\n n=len(nums)\n def perm(i):\n if i==n-1:\n l.append(nums[:])\n return \n for j in range(i,n):\n nums[i],nums[j]=nums[j],nums[i]\n perm(i+1)\n nums[i],nums[j]=nums[j],nums[i]\n\n perm(0)\n return l\n","runtime":"34"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n result = []\n\n def permute_rec(nums, current_index, result):\n if current_index == len(nums) - 1:\n result.append(nums.copy())\n return\n\n for index in range(current_index, len(nums)):\n nums[current_index], nums[index] = nums[index], nums[current_index]\n permute_rec(nums, current_index + 1, result)\n nums[current_index], nums[index] = nums[index], nums[current_index]\n\n permute_rec(nums, 0, result)\n return result","runtime":"34"},{"code":"class Solution:\n def permute(self, nums: list[int]) -> list[list[int]]:\n from copy import deepcopy\n is_visited = [False] * len(nums)\n result = []\n\n def __backtrack(res: list):\n if len(res) == len(nums):\n result.append(deepcopy(res))\n return\n\n for i in range(len(nums)):\n\n if is_visited[i]:\n continue\n\n res.append(nums[i])\n is_visited[i] = True\n\n __backtrack(res)\n\n is_visited[i] = False\n res.pop()\n\n __backtrack([])\n return result","runtime":"35"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n tmp = []\n res = []\n visited = [False] * len(nums)\n \n def dfs(start):\n if len(tmp) == len(nums):\n res.append(tmp[:])\n return\n # 1 2 3\n # 1\n # \n # 1 2\n # 2 3 1 3\n # 3 2 3 1\n for i in range(len(nums)):\n if visited[i] is False:\n tmp.append(nums[i])\n visited[i] = True\n dfs(i)\n tmp.pop()\n visited[i] = False\n dfs(0)\n return res","runtime":"35"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n return list(map(list, permutations(nums)))","runtime":"36"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n perm = []\n res = []\n\n def backtrack(perm):\n if len(perm) == len(nums):\n res.append(perm[:])\n \n for num in nums:\n if num not in perm:\n perm.append(num)\n backtrack(perm)\n perm.pop()\n \n backtrack([])\n return res","runtime":"36"},{"code":"# with loop\nclass Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n perms: List[List[int]] = [[]]\n\n for num in nums:\n new_perms = []\n for p in perms:\n for i in range(len(p) + 1):\n p_copy = p.copy()\n p_copy.insert(i, num)\n new_perms.append(p_copy)\n perms = new_perms\n\n return perms","runtime":"37"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n def backtrack(nums,path):\n if not nums:\n result.append(path)\n return\n for i in range(0,len(nums)):\n backtrack(nums[:i]+nums[i+1:],path+[nums[i]])\n result=[]\n backtrack(nums,[])\n return result","runtime":"37"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n if len(nums)==1:\n return [nums[:]]\n res=[]\n for _ in range(len(nums)):\n n=nums.pop(0)\n perms=self.permute(nums)\n for p in perms:\n p.append(n)\n res.extend(perms)\n nums.append(n)\n return res","runtime":"38"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n\n #recursive solution\n if len(nums) == 0:\n return [[]]\n\n res = []\n #generate permuations of everything except with the first element\n perms = self.permute(nums[1:])\n\n #loop through all the perms and insert the 1st elemnt of nums into each position in perms.\n for p in perms:\n for i in range(len(p) + 1):\n p_copy = p.copy()\n p_copy.insert(i, nums[0])\n res.append(p_copy)\n return res","runtime":"38"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n ans = []\n temp = []\n def dfs(nums):\n if len(nums)==0:\n ans.append(temp.copy())\n return\n for i in range(len(nums)):\n ch = nums[i]\n ros = nums[:i]+nums[i+1:]\n temp.append(ch)\n dfs(ros)\n temp.pop()\n\n dfs(nums)\n return ans\n ","runtime":"39"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n result=[]\n if(len(nums)==1):\n return [nums[:]]\n for i in range(len(nums)):\n n=nums.pop(0)\n print(\"nums\",n)\n perms=self.permute(nums)\n print(\"perm\",perms)\n for perm in perms:\n perm.append(n)\n print(\"appended perm\",perm)\n result.extend(perms)\n nums.append(n)\n return result\n\n ","runtime":"39"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 1:\n return [nums[:]]\n if len(nums) == 2:\n return [[nums[0],nums[1]], [nums[1],nums[0]]]\n \n res = []\n for _ in range(len(nums)):\n n = nums.pop(0)\n arr = self.permute(nums)\n for item in arr:\n item.append(n)\n \n res.extend(arr)\n\n nums.append(n)\n\n return res\n ","runtime":"40"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n return list(itertools.permutations(nums))","runtime":"40"},{"code":"from itertools import permutations\nclass Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n return [list(perm) for perm in permutations(nums)]","runtime":"41"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n res = []\n permutations = []\n checked = [False] * 21\n\n def dfs(i):\n if i == len(nums):\n res.append(permutations[:])\n return\n \n for j in range(len(nums)):\n if checked[j]:\n continue\n \n checked[j] = True\n permutations.append(nums[j])\n \n dfs(i + 1)\n\n checked[j] = False\n permutations.pop()\n\n dfs(0)\n return res","runtime":"41"},{"code":"import itertools\nclass Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n res=list(itertools.permutations(nums))\n return res\n ","runtime":"42"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n def next_permutation(curr):\n pivot = -1\n for i in range(len(curr)-1-1, -1, -1):\n if curr[i]<curr[i+1]:\n pivot = i\n break\n if pivot==-1:\n curr[:] = curr[::-1]\n else:\n for i in range(len(curr)-1, pivot, -1):\n if curr[pivot]<curr[i]:\n curr[pivot], curr[i] = curr[i], curr[pivot]\n break\n l, r = pivot+1, len(curr)-1\n while l<=r:\n curr[l], curr[r] = curr[r], curr[l]\n l += 1\n r -= 1\n return curr\n \n fact = 1\n for i in range(len(nums), 0, -1):\n fact *= i\n \n res = [nums]\n p = next_permutation(nums)\n for i in range(fact-1):\n res.append(p[:])\n p = next_permutation(p)\n return res\n \n ","runtime":"42"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n \n \"\"\"\n result = []\n def backtrack(path, remain):\n if not remain:\n result.append(path[:])\n return\n \n # Will have to loop over everything in remain so that we start new cur from everything avaiable\n for i in range(len(remain)):\n backtrack(path + [remain[i]], remain[:i] + remain[i+1:])\n\n \n backtrack([], nums)\n return result\n \"\"\"\n\n \"\"\"\n # Method 1 \n res = [] \n\n def backtrack(current):\n if len(current) == len(nums):\n res.append(current.copy()) \n return\n\n\n for num in nums:\n if num not in current: \n current.append(num) \n backtrack(current) \n current.pop() \n\n backtrack([]) \n return res\n \"\"\"\n\n\n result = [] \n\n def backtrack(cur, remaining):\n if not remaining:\n result.append(cur.copy())\n return\n \n for i in range(len(remaining)):\n cur.append(remaining[i])\n \n backtrack(cur, remaining[:i] + remaining[i+1:])\n \n cur.pop()\n\n backtrack([], nums)\n\n return result\n ","runtime":"43"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n visited = [False] * n\n ans = []\n permutation = []\n\n def getPermute(ans,visited,permutation):\n if len(permutation) == n:\n ans.append(permutation.copy())\n return \n \n for i in range(n):\n if not visited[i]:\n permutation.append(nums[i])\n visited[i] = True\n getPermute(ans,visited,permutation)\n \n # backtracking\n permutation.pop()\n visited[i] = False\n getPermute(ans,visited,permutation)\n return ans","runtime":"43"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]: \n res = []\n\n def backtrack(sol):\n if len(sol) == len(nums):\n res.append(sol[:])\n return\n\n for num in nums:\n if not num in sol:\n sol.append(num)\n backtrack(sol)\n sol.pop()\n\n backtrack([])\n return res","runtime":"44"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n \n per=sorted(list(itertools.permutations(nums)))\n return per\n ","runtime":"44"},{"code":"from itertools import permutations\nclass Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n return [list(perm) for perm in permutations(nums)]","runtime":"45"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n result = []\n\n def backTrack(path,visited):\n if len(path) == len(nums):\n result.append(path.copy())\n return\n \n for num in nums:\n if num not in visited:\n path.append(num)\n visited.add(num)\n backTrack(path,visited)\n path.pop()\n visited.remove(num)\n\n backTrack([],set())\n return result","runtime":"45"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n\n\n def backtrack(curr):\n if len(curr) == len(nums):\n ans.append(curr[:])\n return\n\n for num in nums:\n if num not in curr:\n curr.append(num)\n backtrack(curr)\n curr.pop()\n ans = []\n backtrack([])\n return ans\n","runtime":"46"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n res = []\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for val in nums:\n if val not in cur:\n cur.append(val)\n dfs(cur)\n cur.pop()\n dfs([])\n return res\n","runtime":"46"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n solution = []\n self.btrk(nums, [], solution)\n return solution\n \n def btrk(self, nums: List[int], state, solution):\n \n if len(nums) == 0:#len(state) == len(nums):\n #print(\"AAAAAAAAAAAAAAAAAA\")\n solution.append(state[:])\n for idx, n in enumerate(nums):\n #n = nums.pop()\n state.append(n)\n self.btrk(nums[:idx]+nums[idx+1:], state, solution)\n state.pop()\n #nums.append(n)\n #print(solution)\n \n\n","runtime":"47"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n if n == 1:\n return [[1]]\n \n results: list[list[int]] = []\n \n def backtrack(combination: list[int]) -> None:\n if len(combination) == n:\n results.append(combination)\n return\n \n for num in nums:\n if num not in combination:\n backtrack(combination + [num])\n \n backtrack([])\n \n return results\n \n ","runtime":"47"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n \n \"\"\"\n result = []\n def backtrack(path, remain):\n if not remain:\n result.append(path[:])\n return\n \n # Will have to loop over everything in remain so that we start new cur from everything avaiable\n for i in range(len(remain)):\n backtrack(path + [remain[i]], remain[:i] + remain[i+1:])\n\n \n backtrack([], nums)\n return result\n \"\"\"\n\n res = [] \n\n def backtrack(current):\n if len(current) == len(nums):\n res.append(current.copy()) \n return\n\n\n for num in nums:\n if num not in current: \n current.append(num) \n backtrack(current) \n current.pop() \n\n backtrack([]) \n return res\n ","runtime":"48"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 1:\n return [nums]\n result = []\n def build(cur):\n if len(cur) == len(nums):\n result.append(cur.copy())\n else:\n for x in range(len(nums)):\n if nums[x] not in cur:\n cur.append(nums[x])\n build(cur)\n cur.pop()\n build([])\n return result\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n # if len(nums) == 1:\n # return [nums]\n # building = [-99]*len(nums)\n # result = []\n # def helper(result, building, nums, current):\n # if current == len(nums):\n # result.append(building.copy())\n # elif current < len(nums):\n # for y in range(len(nums)):\n # if building[y] == -99:\n # building[y] = nums[current]\n # helper(result, building, nums, current+1)\n # building[y] = -99\n # helper(result,building, nums, 0)\n # print(result)\n # return result","runtime":"48"}],"string":"[\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n def dfs(cur):\\n if len(nums) == len(cur):\\n \\n res.append(cur.copy())\\n return\\n for j in nums:\\n if j not in cur:\\n cur.append(j)\\n dfs(cur)\\n cur.pop()\\n dfs([])\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return \\n for j in nums:\\n if j in cur:\\n continue\\n cur.append(j)\\n dfs(cur)\\n cur.pop()\\n dfs([])\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return \\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n dfs(cur)\\n cur.pop()\\n dfs([])\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n dfs(cur)\\n cur.pop()\\n dfs([])\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n dfs(cur)\\n cur.pop()\\n dfs([])\\n return res\\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 res = []\\n def dfs(cur):\\n if len(cur)==len(nums):\\n res.append(cur.copy())\\n return\\n # if i>=len(nums):return\\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n dfs(cur)\\n cur.pop()\\n dfs([])\\n return res\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n dfs(cur)\\n cur.pop()\\n dfs([])\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n def dfs(i,cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n dfs(j+1,cur)\\n cur.pop()\\n dfs(0,[])\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n def dfs(i,cur):\\n if len(cur)==len(nums):\\n res.append(cur.copy())\\n return\\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n dfs(j+1,cur)\\n cur.pop()\\n dfs(0,[])\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n res = []\\n def dfs(i,cur):\\n if len(cur) == len(nums):\\n if cur not in res:\\n res.append(cur.copy())\\n return\\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n dfs(j,cur)\\n cur.pop()\\n dfs(0,[])\\n return res\\n\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n res = []\\n def dfs(cur):\\n if len(cur) == len(nums):\\n if cur not in res:\\n res.append(cur.copy())\\n return\\n for i in range(len(nums)):\\n if nums[i] not in cur:\\n cur.append(nums[i])\\n dfs(cur)\\n cur.pop()\\n dfs([])\\n return res\\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 res = []\\n def dfs(i,cur):\\n if i>=len(nums):return\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n dfs(j,cur)\\n cur.pop()\\n dfs(0,[])\\n return res\\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\\n\\n\\n\\n res = []\\n def dfs(i,cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n if i>=len(nums):return\\n for j in nums:\\n if j not in cur:\\n cur.append(j)\\n dfs(i,cur)\\n cur.pop()\\n dfs(0,[])\\n return res\\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 res = []\\n def dfs(i,cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n if i>=len(nums):return\\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n dfs(i+1,cur)\\n cur.pop()\\n \\n dfs(0,[])\\n return res\\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\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n def dfs(i,cur):\\n if len(cur)==len(nums):\\n res.append(cur.copy())\\n return \\n if i>=len(nums):return\\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n dfs(i+1,cur)\\n cur.pop()\\n dfs(0,[])\\n return res\\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 res = []\\n def dfs(i,cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n if i>=len(nums):return\\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n dfs(i+1,cur)\\n cur.pop()\\n dfs(0,[])\\n return res\\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\\n\\n\\n\\n res = []\\n def dfs(i,cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return \\n if i>=len(nums):return\\n for j in range(i,len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n dfs(i,cur)\\n cur.pop()\\n dfs(0,[])\\n return res \\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\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n def dfs(cur,i):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n if i>=len(nums):\\n return\\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n dfs(cur,i+1)\\n cur.pop()\\n dfs([],0)\\n return res\\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 res = []\\n def dfs(i,cur):\\n if len(nums) == len(cur):\\n res.append(cur.copy())\\n return \\n if i>=len(nums):\\n return\\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n cur.append(nums[j])\\n \\n dfs(i+1,cur)\\n cur.pop()\\n \\n dfs(0,[])\\n return res\\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\\n\\n\\n\\n\\n\\n\\n res = []\\n def dfs(i,cur):\\n if len(cur)==len(nums):\\n res.append(cur.copy())\\n return\\n if i>=len(nums):\\n return\\n for j in range(len(nums)):\\n if nums[j] not in cur:\\n \\n cur.append(nums[j])\\n print(cur,\\\"a\\\")\\n dfs(j,cur)\\n print(cur,\\\"p\\\")\\n cur.pop()\\n dfs(0,[])\\n return res\\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\\n\\n\\n\\n\\n\\n\\n\\n\\n def dfs(cur,num):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for i in range(len(nums)):\\n if nums[i] not in cur:\\n cur.append(nums[i])\\n dfs(cur,i+1)\\n \\n cur.pop()\\n \\n dfs([],0)\\n return res\\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 res = []\\n def dfs(curr,num):\\n if len(curr) == len(nums):\\n res.append(curr.copy())\\n return\\n \\n for i in range(len(nums)):\\n if nums[i] not in curr:\\n curr.append(nums[i])\\n\\n dfs(curr,i+1)\\n \\n curr.pop()\\n dfs([],0)\\n return res\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n res = []\\n if len(nums) == 1:\\n return [nums.copy()]\\n for i in range(len(nums)):\\n n = nums.pop(0)\\n perms = self.permute(nums)\\n for perm in perms:\\n perm.append(n)\\n res.extend(perms)\\n nums.append(n)\\n return res\",\n \"runtime\": \"17\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n def backtrack(first=0):\\n if first == n:\\n output.append(nums[:])\\n for i in range(first, n):\\n nums[first], nums[i] = nums[i], nums[first]\\n backtrack(first + 1)\\n nums[first], nums[i] = nums[i], nums[first]\\n \\n n = len(nums)\\n output = []\\n backtrack()\\n return output\\n\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n\\n def bt(i):\\n if i >= len(nums):\\n res.append(nums[:])\\n\\n for j in range(i, len(nums)):\\n nums[i], nums[j] = nums[j], nums[i]\\n bt(i + 1)\\n nums[i], nums[j] = nums[j], nums[i]\\n\\n bt(0)\\n return res\\n\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n \\n res = []\\n \\n if len(nums) == 0:\\n return [[]]\\n\\n\\n perms = self.permute(nums[1:])\\n for p in perms:\\n for i in range(len(p) + 1):\\n p_copy = p.copy()\\n p_copy.insert(i, nums[0])\\n res.append(p_copy)\\n\\n return res\\n\\n\\n\\n\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n permutations = []\\n self._backtracking(nums, set(), [], permutations)\\n return permutations\\n\\n \\n def _backtracking(\\n self,\\n nums: list[int],\\n visited: set[int],\\n permutation: list[int],\\n permutations: list[list[int]]\\n ):\\n if len(permutation) == len(nums):\\n permutations.append(list(permutation))\\n return\\n for num in nums:\\n if num in visited:\\n continue\\n permutation.append(num)\\n visited.add(num)\\n self._backtracking(nums, visited, permutation, permutations)\\n visited.remove(num)\\n permutation.pop()\\n\\n \",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 0:\\n return [[]]\\n perms = self.permute(nums[1:])\\n res = []\\n\\n for p in perms:\\n for i in range(len(p)+1):\\n p_copy = p.copy()\\n p_copy.insert(i,nums[0])\\n res.append(p_copy)\\n\\n return res\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n def generate(nums, prefix):\\n if not nums:\\n res.append(prefix)\\n return\\n \\n for i in range(len(nums)):\\n if i == 0:\\n generate(nums[1:], prefix + [nums[0]])\\n elif i == len(nums) - 1:\\n generate(nums[0:-1], prefix + [nums[-1]])\\n else:\\n generate(nums[:i] + nums[i+1:], prefix + [nums[i]])\\n \\n generate(nums, [])\\n return res\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n solution = []\\n self.btrk(nums, [], solution)\\n return solution\\n \\n def btrk(self, nums: List[int], state, solution):\\n \\n if len(nums) == 0:#len(state) == len(nums):\\n #print(\\\"AAAAAAAAAAAAAAAAAA\\\")\\n solution.append(state[:])\\n for idx, n in enumerate(nums):\\n #n = nums.pop()\\n state.append(n)\\n self.btrk(nums[:idx]+nums[idx+1:], state, solution)\\n state.pop()\\n #nums.append(n)\\n #print(solution)\\n \\n\\n\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 0:\\n return [[]]\\n\\n perms = self.permute(nums[1:])\\n res = []\\n\\n for p in perms:\\n for i in range(len(p) + 1):\\n p_copy = p.copy()\\n p_copy.insert(i, nums[0])\\n res.append(p_copy)\\n return res\\n\\n \",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 0:\\n return [[]]\\n\\n perms = self.permute(nums[1:])\\n res = []\\n for p in perms:\\n for i in range(len(p) + 1):\\n p_copy = p.copy()\\n p_copy.insert(i, nums[0])\\n res.append(p_copy)\\n\\n return res\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 0:\\n return [[]]\\n perms = self.permute(nums[1:])\\n res = []\\n for p in perms:\\n for i in range(len(p)+1):\\n pCopy = p.copy()\\n pCopy.insert(i, nums[0])\\n res.append(pCopy)\\n return res\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 1:\\n return [nums]\\n res = []\\n for i in range(len(nums)):\\n curr = nums[i]\\n remain = nums[:i]+nums[i+1:]\\n res += [[curr]+subperm for subperm in self.permute(remain)]\\n return res\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 1:\\n return [nums]\\n if len(nums) == 2:\\n return [nums, nums[::-1]]\\n return [[nums[i]] + j for i in range(len(nums)) for j in Solution.permute(self, nums[:i]+nums[i+1:])]\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 0:\\n return [[]]\\n res = [] \\n for perm in self.permute(nums[1:]):\\n for i in range(len(perm) + 1):\\n perm_copy = perm[:]\\n perm_copy.insert(i, nums[0])\\n res.append(perm_copy)\\n \\n return res\\n \",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 0:\\n return [[]]\\n res = []\\n perms = self.permute(nums[1:])\\n for p in perms:\\n for i in range(len(p)+1):\\n p_copy = p.copy()\\n p_copy.insert(i, nums[0])\\n res.append(p_copy)\\n return res\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n\\n def rec(mem, tmp=[]):\\n if len(mem) == 0:\\n res.append(tmp[:])\\n return\\n\\n for i in range(len(mem)):\\n tmp.append(mem[i])\\n rec([mem[j] for j in range(len(mem)) if j != i], tmp)\\n tmp.pop()\\n\\n rec(nums, [])\\n return res\\n\\n\\n\\n # res = []\\n\\n # def rec(mem, tmp=[]):\\n # if len(mem) == 0:\\n # res.append(tmp)\\n # return\\n\\n # for i in range(len(mem)):\\n # rec([mem[j] for j in range(len(mem)) if j != i], tmp + [mem[i]])\\n\\n # rec(nums)\\n # return res\\n\\n\\n\\n# \",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n \\n # def dfs(curr_len, curr, visited):\\n # nonlocal res\\n\\n # if curr_len == total_len:\\n # res.append(curr[:]) #you alwasy fucking forget this \\n # return \\n \\n # for i in range(total_len):\\n # if not visited[i]:\\n # visited[i] = True\\n # curr.append(nums[i])\\n # dfs(curr_len + 1, curr, visited)\\n # curr.pop()\\n # visited[i] = False\\n \\n # res = []\\n # total_len = len(nums)\\n # visited = [False] * total_len\\n # dfs(0, [], visited)\\n # return res\\n\\n def dfs(start):\\n if start == len(nums):\\n res.append(nums[:])\\n return \\n \\n for i in range(start, len(nums)):\\n nums[start], nums[i] = nums[i], nums[start]\\n dfs(start+1)\\n nums[start], nums[i] = nums[i], nums[start]\\n \\n \\n res = []\\n dfs(0)\\n return res\\n\\n # 123\\n # 213\\n # 321\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 0:\\n return [[]]\\n\\n perms = self.permute(nums[1:])\\n res = []\\n for p in perms:\\n for i in range(len(p) + 1):\\n p_copy = p.copy()\\n p_copy.insert(i, nums[0])\\n res.append(p_copy)\\n\\n return res\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n \\n\\n def backtrack(perm: List[int]) -> None:\\n if len(perm) == len(nums):\\n res.append(perm[:])\\n return\\n perm_set = set(perm)\\n for i in range(len(nums)):\\n if nums[i] in perm_set:\\n continue\\n\\n perm.append(nums[i])\\n backtrack(perm)\\n perm.pop()\\n\\n res = []\\n backtrack([])\\n return res\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n\\n def dfs(self, visited, curr_perm):\\n if len(visited) == len(self.nums):\\n self.answers.append(list(curr_perm))\\n return\\n \\n for num in self.nums:\\n if num not in visited:\\n visited.add(num)\\n curr_perm.append(num)\\n self.dfs(visited, curr_perm)\\n curr_perm.pop()\\n visited.remove(num)\\n\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n self.answers = []\\n self.nums = nums\\n self.dfs(set(), [])\\n return self.answers\\n \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.result = []\\n \\n def permute(self, nums: List[int]) -> List[List[int]]:\\n track = []\\n used = [False]*len(nums)\\n self.backtrack(nums, track, used)\\n return self.result\\n\\n def backtrack(self, nums, track, used):\\n if len(track) == len(nums):\\n self.result.append(track.copy())\\n return\\n \\n for i in range(len(nums)):\\n if used[i]:\\n continue\\n \\n track.append(nums[i])\\n used[i] = True\\n self.backtrack(nums, track, used)\\n track.pop()\\n used[i] = False\\n \\n \\n\\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n return list(itertools.permutations(nums))\\n\\n\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n\\n def backtrack(path: list[int], used: list[bool]) -> None:\\n if len(path) == len(nums):\\n result.append(path.copy())\\n for idx, candidate in enumerate(nums):\\n if not used[idx]:\\n used[idx] = True\\n path.append(candidate)\\n backtrack(path, used)\\n path.pop()\\n used[idx] = False\\n\\n result = []\\n backtrack([], [False] * len(nums))\\n return result\\n \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n # backtracking: t=O(n*n!), space=O(n*n!)\\n \\n res = []\\n perm = []\\n visited = set()\\n def dfs(i):\\n if i == len(nums):\\n res.append(perm.copy())\\n return \\n if i > len(nums):\\n return\\n for num in nums:\\n if num not in visited:\\n visited.add(num)\\n perm.append(num)\\n dfs(i + 1)\\n perm.pop()\\n visited.remove(num)\\n dfs(0)\\n return res\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n l=[]\\n n=len(nums)\\n def perm(i):\\n if i==n-1:\\n l.append(nums[:])\\n return \\n for j in range(i,n):\\n nums[i],nums[j]=nums[j],nums[i]\\n perm(i+1)\\n nums[i],nums[j]=nums[j],nums[i]\\n\\n perm(0)\\n return l\\n\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n result = []\\n\\n def permute_rec(nums, current_index, result):\\n if current_index == len(nums) - 1:\\n result.append(nums.copy())\\n return\\n\\n for index in range(current_index, len(nums)):\\n nums[current_index], nums[index] = nums[index], nums[current_index]\\n permute_rec(nums, current_index + 1, result)\\n nums[current_index], nums[index] = nums[index], nums[current_index]\\n\\n permute_rec(nums, 0, result)\\n return result\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: list[int]) -> list[list[int]]:\\n from copy import deepcopy\\n is_visited = [False] * len(nums)\\n result = []\\n\\n def __backtrack(res: list):\\n if len(res) == len(nums):\\n result.append(deepcopy(res))\\n return\\n\\n for i in range(len(nums)):\\n\\n if is_visited[i]:\\n continue\\n\\n res.append(nums[i])\\n is_visited[i] = True\\n\\n __backtrack(res)\\n\\n is_visited[i] = False\\n res.pop()\\n\\n __backtrack([])\\n return result\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n tmp = []\\n res = []\\n visited = [False] * len(nums)\\n \\n def dfs(start):\\n if len(tmp) == len(nums):\\n res.append(tmp[:])\\n return\\n # 1 2 3\\n # 1\\n # \\n # 1 2\\n # 2 3 1 3\\n # 3 2 3 1\\n for i in range(len(nums)):\\n if visited[i] is False:\\n tmp.append(nums[i])\\n visited[i] = True\\n dfs(i)\\n tmp.pop()\\n visited[i] = False\\n dfs(0)\\n return res\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n return list(map(list, permutations(nums)))\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n perm = []\\n res = []\\n\\n def backtrack(perm):\\n if len(perm) == len(nums):\\n res.append(perm[:])\\n \\n for num in nums:\\n if num not in perm:\\n perm.append(num)\\n backtrack(perm)\\n perm.pop()\\n \\n backtrack([])\\n return res\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"# with loop\\nclass Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n perms: List[List[int]] = [[]]\\n\\n for num in nums:\\n new_perms = []\\n for p in perms:\\n for i in range(len(p) + 1):\\n p_copy = p.copy()\\n p_copy.insert(i, num)\\n new_perms.append(p_copy)\\n perms = new_perms\\n\\n return perms\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n def backtrack(nums,path):\\n if not nums:\\n result.append(path)\\n return\\n for i in range(0,len(nums)):\\n backtrack(nums[:i]+nums[i+1:],path+[nums[i]])\\n result=[]\\n backtrack(nums,[])\\n return result\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n if len(nums)==1:\\n return [nums[:]]\\n res=[]\\n for _ in range(len(nums)):\\n n=nums.pop(0)\\n perms=self.permute(nums)\\n for p in perms:\\n p.append(n)\\n res.extend(perms)\\n nums.append(n)\\n return res\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n\\n #recursive solution\\n if len(nums) == 0:\\n return [[]]\\n\\n res = []\\n #generate permuations of everything except with the first element\\n perms = self.permute(nums[1:])\\n\\n #loop through all the perms and insert the 1st elemnt of nums into each position in perms.\\n for p in perms:\\n for i in range(len(p) + 1):\\n p_copy = p.copy()\\n p_copy.insert(i, nums[0])\\n res.append(p_copy)\\n return res\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n ans = []\\n temp = []\\n def dfs(nums):\\n if len(nums)==0:\\n ans.append(temp.copy())\\n return\\n for i in range(len(nums)):\\n ch = nums[i]\\n ros = nums[:i]+nums[i+1:]\\n temp.append(ch)\\n dfs(ros)\\n temp.pop()\\n\\n dfs(nums)\\n return ans\\n \",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n result=[]\\n if(len(nums)==1):\\n return [nums[:]]\\n for i in range(len(nums)):\\n n=nums.pop(0)\\n print(\\\"nums\\\",n)\\n perms=self.permute(nums)\\n print(\\\"perm\\\",perms)\\n for perm in perms:\\n perm.append(n)\\n print(\\\"appended perm\\\",perm)\\n result.extend(perms)\\n nums.append(n)\\n return result\\n\\n \",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 1:\\n return [nums[:]]\\n if len(nums) == 2:\\n return [[nums[0],nums[1]], [nums[1],nums[0]]]\\n \\n res = []\\n for _ in range(len(nums)):\\n n = nums.pop(0)\\n arr = self.permute(nums)\\n for item in arr:\\n item.append(n)\\n \\n res.extend(arr)\\n\\n nums.append(n)\\n\\n return res\\n \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n return list(itertools.permutations(nums))\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"from itertools import permutations\\nclass Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n return [list(perm) for perm in permutations(nums)]\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n permutations = []\\n checked = [False] * 21\\n\\n def dfs(i):\\n if i == len(nums):\\n res.append(permutations[:])\\n return\\n \\n for j in range(len(nums)):\\n if checked[j]:\\n continue\\n \\n checked[j] = True\\n permutations.append(nums[j])\\n \\n dfs(i + 1)\\n\\n checked[j] = False\\n permutations.pop()\\n\\n dfs(0)\\n return res\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"import itertools\\nclass Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n res=list(itertools.permutations(nums))\\n return res\\n \",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n def next_permutation(curr):\\n pivot = -1\\n for i in range(len(curr)-1-1, -1, -1):\\n if curr[i]<curr[i+1]:\\n pivot = i\\n break\\n if pivot==-1:\\n curr[:] = curr[::-1]\\n else:\\n for i in range(len(curr)-1, pivot, -1):\\n if curr[pivot]<curr[i]:\\n curr[pivot], curr[i] = curr[i], curr[pivot]\\n break\\n l, r = pivot+1, len(curr)-1\\n while l<=r:\\n curr[l], curr[r] = curr[r], curr[l]\\n l += 1\\n r -= 1\\n return curr\\n \\n fact = 1\\n for i in range(len(nums), 0, -1):\\n fact *= i\\n \\n res = [nums]\\n p = next_permutation(nums)\\n for i in range(fact-1):\\n res.append(p[:])\\n p = next_permutation(p)\\n return res\\n \\n \",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n \\n \\\"\\\"\\\"\\n result = []\\n def backtrack(path, remain):\\n if not remain:\\n result.append(path[:])\\n return\\n \\n # Will have to loop over everything in remain so that we start new cur from everything avaiable\\n for i in range(len(remain)):\\n backtrack(path + [remain[i]], remain[:i] + remain[i+1:])\\n\\n \\n backtrack([], nums)\\n return result\\n \\\"\\\"\\\"\\n\\n \\\"\\\"\\\"\\n # Method 1 \\n res = [] \\n\\n def backtrack(current):\\n if len(current) == len(nums):\\n res.append(current.copy()) \\n return\\n\\n\\n for num in nums:\\n if num not in current: \\n current.append(num) \\n backtrack(current) \\n current.pop() \\n\\n backtrack([]) \\n return res\\n \\\"\\\"\\\"\\n\\n\\n result = [] \\n\\n def backtrack(cur, remaining):\\n if not remaining:\\n result.append(cur.copy())\\n return\\n \\n for i in range(len(remaining)):\\n cur.append(remaining[i])\\n \\n backtrack(cur, remaining[:i] + remaining[i+1:])\\n \\n cur.pop()\\n\\n backtrack([], nums)\\n\\n return result\\n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n visited = [False] * n\\n ans = []\\n permutation = []\\n\\n def getPermute(ans,visited,permutation):\\n if len(permutation) == n:\\n ans.append(permutation.copy())\\n return \\n \\n for i in range(n):\\n if not visited[i]:\\n permutation.append(nums[i])\\n visited[i] = True\\n getPermute(ans,visited,permutation)\\n \\n # backtracking\\n permutation.pop()\\n visited[i] = False\\n getPermute(ans,visited,permutation)\\n return ans\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]: \\n res = []\\n\\n def backtrack(sol):\\n if len(sol) == len(nums):\\n res.append(sol[:])\\n return\\n\\n for num in nums:\\n if not num in sol:\\n sol.append(num)\\n backtrack(sol)\\n sol.pop()\\n\\n backtrack([])\\n return res\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n \\n per=sorted(list(itertools.permutations(nums)))\\n return per\\n \",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"from itertools import permutations\\nclass Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n return [list(perm) for perm in permutations(nums)]\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n result = []\\n\\n def backTrack(path,visited):\\n if len(path) == len(nums):\\n result.append(path.copy())\\n return\\n \\n for num in nums:\\n if num not in visited:\\n path.append(num)\\n visited.add(num)\\n backTrack(path,visited)\\n path.pop()\\n visited.remove(num)\\n\\n backTrack([],set())\\n return result\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n\\n\\n def backtrack(curr):\\n if len(curr) == len(nums):\\n ans.append(curr[:])\\n return\\n\\n for num in nums:\\n if num not in curr:\\n curr.append(num)\\n backtrack(curr)\\n curr.pop()\\n ans = []\\n backtrack([])\\n return ans\\n\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for val in nums:\\n if val not in cur:\\n cur.append(val)\\n dfs(cur)\\n cur.pop()\\n dfs([])\\n return res\\n\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n solution = []\\n self.btrk(nums, [], solution)\\n return solution\\n \\n def btrk(self, nums: List[int], state, solution):\\n \\n if len(nums) == 0:#len(state) == len(nums):\\n #print(\\\"AAAAAAAAAAAAAAAAAA\\\")\\n solution.append(state[:])\\n for idx, n in enumerate(nums):\\n #n = nums.pop()\\n state.append(n)\\n self.btrk(nums[:idx]+nums[idx+1:], state, solution)\\n state.pop()\\n #nums.append(n)\\n #print(solution)\\n \\n\\n\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n if n == 1:\\n return [[1]]\\n \\n results: list[list[int]] = []\\n \\n def backtrack(combination: list[int]) -> None:\\n if len(combination) == n:\\n results.append(combination)\\n return\\n \\n for num in nums:\\n if num not in combination:\\n backtrack(combination + [num])\\n \\n backtrack([])\\n \\n return results\\n \\n \",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n \\n \\\"\\\"\\\"\\n result = []\\n def backtrack(path, remain):\\n if not remain:\\n result.append(path[:])\\n return\\n \\n # Will have to loop over everything in remain so that we start new cur from everything avaiable\\n for i in range(len(remain)):\\n backtrack(path + [remain[i]], remain[:i] + remain[i+1:])\\n\\n \\n backtrack([], nums)\\n return result\\n \\\"\\\"\\\"\\n\\n res = [] \\n\\n def backtrack(current):\\n if len(current) == len(nums):\\n res.append(current.copy()) \\n return\\n\\n\\n for num in nums:\\n if num not in current: \\n current.append(num) \\n backtrack(current) \\n current.pop() \\n\\n backtrack([]) \\n return res\\n \",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 1:\\n return [nums]\\n result = []\\n def build(cur):\\n if len(cur) == len(nums):\\n result.append(cur.copy())\\n else:\\n for x in range(len(nums)):\\n if nums[x] not in cur:\\n cur.append(nums[x])\\n build(cur)\\n cur.pop()\\n build([])\\n return result\\n\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n # if len(nums) == 1:\\n # return [nums]\\n # building = [-99]*len(nums)\\n # result = []\\n # def helper(result, building, nums, current):\\n # if current == len(nums):\\n # result.append(building.copy())\\n # elif current < len(nums):\\n # for y in range(len(nums)):\\n # if building[y] == -99:\\n # building[y] = nums[current]\\n # helper(result, building, nums, current+1)\\n # building[y] = -99\\n # helper(result,building, nums, 0)\\n # print(result)\\n # return result\",\n \"runtime\": \"48\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":54,"string":"54"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n res = []\n\n def dfs(tempArray):\n if len(tempArray) == len(nums):\n res.append(tempArray.copy())\n return\n\n for i in range(len(nums)):\n if nums[i] in tempArray:\n continue\n tempArray.append(nums[i])\n dfs(tempArray)\n tempArray.pop()\n\n dfs([])\n return res\n\n\n \n","memory":"16100"},{"code":"from itertools import permutations\nclass Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n return permutations(nums)","memory":"16200"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 0: return []\n if (len(nums) == 1): return [[nums[0]]]\n\n perms = []\n for i,n in enumerate(nums):\n del nums[i]\n sub_perms = self.permute(nums)\n for sub_p in sub_perms:\n new_p = [n]\n new_p.extend(sub_p)\n # print(\"new\", new_p)\n perms.append(new_p)\n nums.insert(i, n)\n # print(perms)\n return perms\n","memory":"16300"},{"code":"class Solution:\n\n def dfs(self, visited, curr_perm):\n if len(visited) == len(self.nums):\n self.answers.append(list(curr_perm))\n return\n \n for num in self.nums:\n if num not in visited:\n visited.add(num)\n curr_perm.append(num)\n self.dfs(visited, curr_perm)\n curr_perm.pop()\n visited.remove(num)\n\n def permute(self, nums: List[int]) -> List[List[int]]:\n self.answers = []\n self.nums = nums\n self.dfs(set(), [])\n return self.answers\n ","memory":"16400"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n\n res = []\n self.dfs(nums, 0, res)\n return res\n\n\n def dfs(self, nums, idx, res):\n if idx == len(nums) - 1:\n res.append(nums.copy())\n return\n \n for i in range(idx, len(nums)):\n nums[idx], nums[i] = nums[i], nums[idx]\n self.dfs(nums, idx + 1, res)\n nums[idx], nums[i] = nums[i], nums[idx]\n \n ","memory":"16400"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n \n res = []\n \n def helper(path, nums, idx):\n \n if not nums:\n res.append(path)\n return\n \n for i in range(len(nums)):\n helper(path+[nums[i]], nums[:i] + nums[i+1:], i)\n \n helper([], nums, 0)\n return res","memory":"16600"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n res = []\n\n def back(idx):\n #Exit condition\n if idx > len(nums):\n return\n \n if idx == len(nums):\n res.append(list(nums))\n \n for i in range(idx,len(nums)):\n nums[i],nums[idx] = nums[idx],nums[i]\n back(idx+1)\n nums[i],nums[idx] = nums[idx],nums[i]\n \n back(0)\n return res\n\n \n ","memory":"16600"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n res = []\n\n def inner(nums, path):\n nonlocal res\n\n if not nums:\n res.append(path.copy())\n return\n\n for i in range(len(nums)):\n path.append(nums[i])\n inner(nums[i+1:] + nums[:i], path)\n path.pop()\n\n inner(nums, path=[])\n\n return list(res)\n ","memory":"16700"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n def bt(curr, remain, ans):\n if len(curr) == len(nums):\n ans.append(curr.copy())\n return\n for i in range(len(remain)):\n \n curr.append(remain[i])\n nextremain = remain.copy()\n nextremain.remove(remain[i])\n bt(curr,nextremain,ans)\n curr.pop()\n ans = []\n bt([],nums.copy(),ans)\n return ans\n","memory":"16700"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n res = []\n self.rPerm(res, [], set(nums))\n return res\n def rPerm(self, res, curr, unused):\n if not unused:\n res.append(curr.copy())\n unused2 = unused.copy()\n # print(curr, unused)\n for num in unused:\n curr.append(num)\n unused2.remove(num)\n self.rPerm(res, curr, unused2)\n curr.pop()\n unused2.add(num)\n \n","memory":"16800"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n #start with an empty array\n #add in queue\n #insert at different places: we can use python insert function \n #base case\n res = []\n curr = []\n\n def dfs(nums):\n if not nums:\n res.append(curr.copy())\n return\n \n for i in range(len(nums)):\n curr.append(nums[i])\n dfs(nums[:i]+nums[i+1:])\n curr.pop()\n dfs(nums)\n return res\n\n \n\n\n ","memory":"16800"}],"string":"[\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n\\n def dfs(tempArray):\\n if len(tempArray) == len(nums):\\n res.append(tempArray.copy())\\n return\\n\\n for i in range(len(nums)):\\n if nums[i] in tempArray:\\n continue\\n tempArray.append(nums[i])\\n dfs(tempArray)\\n tempArray.pop()\\n\\n dfs([])\\n return res\\n\\n\\n \\n\",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"from itertools import permutations\\nclass Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n return permutations(nums)\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 0: return []\\n if (len(nums) == 1): return [[nums[0]]]\\n\\n perms = []\\n for i,n in enumerate(nums):\\n del nums[i]\\n sub_perms = self.permute(nums)\\n for sub_p in sub_perms:\\n new_p = [n]\\n new_p.extend(sub_p)\\n # print(\\\"new\\\", new_p)\\n perms.append(new_p)\\n nums.insert(i, n)\\n # print(perms)\\n return perms\\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n\\n def dfs(self, visited, curr_perm):\\n if len(visited) == len(self.nums):\\n self.answers.append(list(curr_perm))\\n return\\n \\n for num in self.nums:\\n if num not in visited:\\n visited.add(num)\\n curr_perm.append(num)\\n self.dfs(visited, curr_perm)\\n curr_perm.pop()\\n visited.remove(num)\\n\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n self.answers = []\\n self.nums = nums\\n self.dfs(set(), [])\\n return self.answers\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n\\n res = []\\n self.dfs(nums, 0, res)\\n return res\\n\\n\\n def dfs(self, nums, idx, res):\\n if idx == len(nums) - 1:\\n res.append(nums.copy())\\n return\\n \\n for i in range(idx, len(nums)):\\n nums[idx], nums[i] = nums[i], nums[idx]\\n self.dfs(nums, idx + 1, res)\\n nums[idx], nums[i] = nums[i], nums[idx]\\n \\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n \\n res = []\\n \\n def helper(path, nums, idx):\\n \\n if not nums:\\n res.append(path)\\n return\\n \\n for i in range(len(nums)):\\n helper(path+[nums[i]], nums[:i] + nums[i+1:], i)\\n \\n helper([], nums, 0)\\n return res\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n\\n def back(idx):\\n #Exit condition\\n if idx > len(nums):\\n return\\n \\n if idx == len(nums):\\n res.append(list(nums))\\n \\n for i in range(idx,len(nums)):\\n nums[i],nums[idx] = nums[idx],nums[i]\\n back(idx+1)\\n nums[i],nums[idx] = nums[idx],nums[i]\\n \\n back(0)\\n return res\\n\\n \\n \",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n\\n def inner(nums, path):\\n nonlocal res\\n\\n if not nums:\\n res.append(path.copy())\\n return\\n\\n for i in range(len(nums)):\\n path.append(nums[i])\\n inner(nums[i+1:] + nums[:i], path)\\n path.pop()\\n\\n inner(nums, path=[])\\n\\n return list(res)\\n \",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n def bt(curr, remain, ans):\\n if len(curr) == len(nums):\\n ans.append(curr.copy())\\n return\\n for i in range(len(remain)):\\n \\n curr.append(remain[i])\\n nextremain = remain.copy()\\n nextremain.remove(remain[i])\\n bt(curr,nextremain,ans)\\n curr.pop()\\n ans = []\\n bt([],nums.copy(),ans)\\n return ans\\n\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n self.rPerm(res, [], set(nums))\\n return res\\n def rPerm(self, res, curr, unused):\\n if not unused:\\n res.append(curr.copy())\\n unused2 = unused.copy()\\n # print(curr, unused)\\n for num in unused:\\n curr.append(num)\\n unused2.remove(num)\\n self.rPerm(res, curr, unused2)\\n curr.pop()\\n unused2.add(num)\\n \\n\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n #start with an empty array\\n #add in queue\\n #insert at different places: we can use python insert function \\n #base case\\n res = []\\n curr = []\\n\\n def dfs(nums):\\n if not nums:\\n res.append(curr.copy())\\n return\\n \\n for i in range(len(nums)):\\n curr.append(nums[i])\\n dfs(nums[:i]+nums[i+1:])\\n curr.pop()\\n dfs(nums)\\n return res\\n\\n \\n\\n\\n \",\n \"memory\": \"16800\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":11,"string":"11"}}},{"rowIdx":140,"cells":{"question_id":{"kind":"number","value":47,"string":"47"},"name":{"kind":"string","value":"permutations-ii"},"content":{"kind":"string","value":"<p>Given a collection of numbers, <code>nums</code>, that might contain duplicates, return <em>all possible unique permutations <strong>in any order</strong>.</em></p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [1,1,2]\n<strong>Output:</strong>\n[[1,1,2],\n [1,2,1],\n [2,1,1]]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [1,2,3]\n<strong>Output:</strong> [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 8</code></li>\n\t<li><code>-10 <= nums[i] <= 10</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":60.0293554002721,"string":"60.029355"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","backtracking"],"string":"[\n \"array\",\n \"backtracking\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"32\", 0.8037], [\"40\", 9.7636], [\"48\", 31.714199999999998], [\"56\", 21.8423], [\"64\", 3.8144], [\"73\", 2.387], [\"81\", 1.3674], [\"89\", 0.5997999999999999], [\"97\", 0.288], [\"105\", 0.24], [\"113\", 0.15600000000000003], [\"122\", 0.10799999999999998], [\"130\", 0.10799999999999998], [\"138\", 0.30000000000000004], [\"146\", 0.444], [\"154\", 0.4679], [\"163\", 0.456], [\"171\", 0.5999], [\"179\", 0.6359000000000001], [\"187\", 0.7438999999999999], [\"195\", 0.8516], [\"204\", 0.8397999999999999], [\"212\", 0.41990000000000005], [\"220\", 0.6119], [\"228\", 0.35999999999999993], [\"236\", 0.43200000000000005], [\"244\", 0.648], [\"253\", 0.6], [\"261\", 0.444], [\"269\", 0.456], [\"277\", 0.36], [\"285\", 0.7078], [\"294\", 0.9475], [\"302\", 0.6358999999999999], [\"310\", 0.21600000000000003], [\"318\", 0.192], [\"326\", 0.18], [\"335\", 0.14400000000000002], [\"343\", 0.156], [\"351\", 0.19200000000000003], [\"359\", 0.132], [\"367\", 0.12], [\"375\", 0.12], [\"384\", 0.07200000000000001], [\"392\", 0.07200000000000001], [\"400\", 0.048], [\"408\", 0.06], [\"416\", 0.048], [\"425\", 0.06], [\"433\", 0.012], [\"441\", 0.048], [\"449\", 0.036000000000000004], [\"457\", 0.036000000000000004], [\"466\", 0.06], [\"474\", 0.14400000000000002], [\"482\", 0.20400000000000001], [\"490\", 0.072], [\"498\", 0.10799999999999998], [\"506\", 0.06], [\"515\", 0.024], [\"523\", 0.036000000000000004], [\"531\", 0.048], [\"539\", 0.06], [\"547\", 0.144], [\"556\", 0.09599999999999999], [\"564\", 0.09599999999999999], [\"572\", 0.108], [\"580\", 0.07200000000000001], [\"588\", 0.084], [\"597\", 0.34800000000000003], [\"605\", 0.8156000000000001], [\"613\", 0.8517999999999999], [\"621\", 0.6477999999999999], [\"629\", 0.5399], [\"637\", 0.372], [\"646\", 0.4679999999999999], [\"654\", 0.372], [\"662\", 0.7078], [\"670\", 0.6718999999999999], [\"678\", 0.6358999999999999]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16300\", 0.036], [\"16400\", 0.108], [\"16500\", 0.6477], [\"16600\", 4.642], [\"16700\", 16.4448], [\"16800\", 26.3884], [\"16900\", 24.5412], [\"17000\", 9.7637], [\"17100\", 6.825], [\"17200\", 2.0271], [\"17300\", 1.4634], [\"17400\", 0.9596], [\"17500\", 0.2759], [\"17600\", 0.1799], [\"17700\", 0.048], [\"17800\", 0.084], [\"17900\", 0.072], [\"18000\", 0.036], [\"18100\", 0.036], [\"18200\", 0.084], [\"18300\", 0.1559], [\"18400\", 0.072], [\"18500\", 0.024], [\"18600\", 0.024], [\"18700\", 0.012], [\"19200\", 0.024], [\"19300\", 0.012]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n # nums.sort()\n def helper(i):\n nonlocal nums\n if i >= len(nums):\n return [[]]\n currPerms = set()\n nextPerms = helper(i+1)\n for perm in nextPerms:\n for j in range(len(perm) + 1):\n p = list(perm)\n p.insert(j, nums[i])\n currPerms.add(tuple(p))\n return currPerms\n return helper(0)","runtime":"32"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n visited = [False] * len(nums)\n ret = []\n def recurs(output):\n if len(output) == len(nums):\n ret.append(output[:])\n return\n\n for i in range(len(nums)):\n if not visited[i] and (i==0 or nums[i]!=nums[i-1] or visited[i-1]):\n visited[i] = True\n output.append(nums[i])\n recurs(output)\n output.pop()\n visited[i] = False\n recurs([])\n return ret\n \n\n ","runtime":"32"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n nums = sorted(nums)\n init_ind = {k for k in range(len(nums))}\n def dfs(indices,path,c):\n if c == len(nums):\n res.append(path)\n counter = 0\n for ind in indices:\n if counter > 0 and nums[ind] == nums[prev_ind]:\n counter += 1\n prev_ind = ind\n continue\n new_indices = {elt for elt in indices}\n new_indices.discard(ind)\n prev_ind = ind\n counter += 1\n dfs(new_indices,path + [nums[ind]],c+1)\n dfs(init_ind,[],0)\n return res\n\n \n ","runtime":"40"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n # results = []\n\n # def backtrack(comb, counter):\n # if len(comb) == len(nums):\n # results.append(list(comb))\n # return\n\n # for num in counter:\n # if counter[num] > 0:\n # comb.append(num)\n # counter[num] -= 1\n # backtrack(comb, counter)\n # comb.pop()\n # counter[num] += 1\n # backtrack([], Counter(nums))\n # return results\n def backtrack(path, used):\n # If the current path is a full permutation, add it to the result\n if len(path) == len(nums):\n res.append(path[:])\n return\n \n # Iterate through the numbers\n for i in range(len(nums)):\n # Skip used numbers\n if used[i]:\n continue\n # Skip duplicates: if nums[i] == nums[i-1] and nums[i-1] hasn't been used in this recursion level\n if i > 0 and nums[i] == nums[i - 1] and not used[i - 1]:\n continue\n \n # Mark the number as used and add it to the current path\n used[i] = True\n path.append(nums[i])\n \n # Recursively build the permutation\n backtrack(path, used)\n \n # Backtrack: remove the last number and mark it as unused\n path.pop()\n used[i] = False\n \n # Sort the numbers to handle duplicates\n nums.sort()\n res = []\n used = [False] * len(nums)\n backtrack([], used)\n return res","runtime":"40"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n result = list()\n path = list()\n used = [0] * len(nums)\n\n nums.sort()\n\n def bt(used):\n if len(path) == len(nums):\n result.append(path[:])\n return\n\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i - 1] and used[i - 1] == 0 or used[i]:\n continue\n path.append(nums[i])\n used[i] = 1\n bt(used)\n path.pop()\n used[i] = 0\n\n bt(used)\n\n return result\n\n","runtime":"48"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n def backtrack(curr, visited):\n \n if len(curr) == len(nums):\n res.append(curr[:])\n return\n \n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i-1] and not visited[i-1]:\n continue\n if not visited[i]:\n curr.append(nums[i])\n visited[i] = True\n backtrack(curr, visited)\n curr.pop()\n visited[i] = False\n\n res = []\n nums.sort()\n visited = [False]*len(nums)\n backtrack([], visited)\n return res","runtime":"48"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n count={}\n for i in nums:\n count[i]=1+count.get(i,0)\n res=[]\n cur=[]\n def dfs():\n if len(cur)==len(nums):\n res.append(cur.copy())\n for i in count:\n if count[i]>0:\n cur.append(i)\n count[i]-=1\n dfs()\n count[i]+=1\n cur.pop()\n\n dfs()\n return res\n ","runtime":"56"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n def backtrack(curr, res, nms):\n if len(curr) == len(nums):\n res.append(curr.copy())\n return\n here = set()\n for i, n in enumerate(nms):\n if n in here: continue\n here.add(n)\n curr.append(n)\n new = nms.copy()\n new.pop(i)\n backtrack(curr, res, new)\n curr.pop()\n return\n\n res = []\n backtrack([], res, nums)\n return res","runtime":"56"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n curr = []\n count = Counter(nums)\n\n def dfs():\n if len(curr) == len(nums):\n res.append(curr[:])\n \n for n in count:\n if count[n] > 0:\n curr.append(n)\n count[n] -= 1\n\n dfs()\n\n count[n] += 1\n curr.pop()\n dfs()\n return res","runtime":"64"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n res = []\n used = [0 for i in range(len(nums))]\n\n def backtrack(cur): \n if len(cur) == len(nums):\n res.append(cur[:])\n return\n # print(used)\n for i in range(len(nums)):\n if used[i] == 1: # each element can only be used once\n continue\n if i > 0 and nums[i] == nums[i-1] and used[i-1] == 1: # skip duplicate, only process 1st encounter of each element\n continue\n used[i] = 1\n cur.append(nums[i])\n backtrack(cur)\n used[i] = 0\n cur.pop()\n \n backtrack([])\n return res","runtime":"64"},{"code":"class Solution:\n from itertools import permutations\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n per=permutations(nums)\n output=[]\n for i in list(per):\n output.append((i))\n perU=set(output)\n list(perU)\n return perU","runtime":"73"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n from itertools import permutations \n dup_permutations = permutations(nums) \n tup_permu = [tuple(permu) for permu in dup_permutations]\n set_permu = set(tup_permu)\n return [list(permu) for permu in set_permu]\n # return permutations(nums)","runtime":"73"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n perms = [[]]\n\n for n in nums:\n nextPerms = []\n for p in perms:\n for i in range(len(p) + 1):\n pCopy = p.copy()\n pCopy.insert(i, n)\n if pCopy not in nextPerms:\n nextPerms.append(pCopy)\n perms = nextPerms\n return perms","runtime":"81"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n from typing import List\n\n n = len(nums)\n \n nums.sort()\n def backtrack(curr, permutations, visited):\n if len(curr) == n:\n permutations.append(curr)\n return\n\n for i in range(n):\n if i in visited:\n continue\n \n # Skip duplicates: Ensure that nums[i] is only used once for the same position in this recursion level\n if i > 0 and nums[i] == nums[i-1] and i-1 in visited:\n continue\n\n backtrack(curr + [nums[i]], permutations, visited + [i])\n\n permutations = []\n backtrack([], permutations, [])\n return permutations\n","runtime":"81"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n comb, result = [], []\n used = [False] * len(nums)\n nums.sort()\n\n def backtrack():\n if len(comb) == len(nums):\n result.append(comb[:])\n return\n \n for i in range(len(nums)):\n if used[i] == True or (i and used[i-1] and nums[i] == nums[i-1]):\n continue\n comb.append(nums[i])\n used[i] = True\n backtrack()\n comb.pop()\n used[i] = False\n \n backtrack()\n return result\n","runtime":"89"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n re = [[nums[0]]]\n for i in range(1, len(nums)):\n re = self.inser_after(re, nums[i])\n return re\n \n def inser_after(self,arr, target):\n re = []\n for ele in arr:\n\n for i in range(len(ele) + 1):\n cop = ele.copy()\n cop.insert(i, target)\n if cop not in re:\n re.append(cop)\n return re\n\n \n \n def CountFreq(self, nums):\n freq = {}\n for item in nums:\n if item in freq:\n freq[item] += 1\n else:\n freq[item] = 1\n return freq","runtime":"89"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n perms = [[]]\n\n nums.sort()\n\n n_i = 0\n # insert each num at every possible position of each already existing perm to get new set of perms\n while n_i < len(nums):\n n = nums[n_i]\n new_perms = []\n for p in perms:\n for i in range(len(p)+1):\n pc = p.copy()\n pc.insert(i, n)\n new_perms.append(pc)\n perms = new_perms\n n_i += 1\n\n # filter duplicates\n unique_perms = set()\n final_perms = []\n for p in perms:\n if not tuple(p) in unique_perms:\n final_perms.append(p)\n unique_perms.add(tuple(p))\n\n return final_perms\n","runtime":"97"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n # revursive approach\n\n # def helper(i, nums):\n # if i==len(nums):\n # return [[]]\n\n # res=[]\n # perms=helper(i+1, nums)\n\n # for p in perms:\n # for j in range(len(p)+1):\n # p_copy=p.copy()\n # p_copy.insert(j, nums[i])\n # res.append(p_copy)\n # return res\n\n # unset= helper(0, nums)\n # print(unset)\n # unset=[tuple(i) for i in unset]\n # yesset=set(unset)\n\n # return list(yesset)\n\n\n # iterative approach\n\n # res=[]\n # perms=[[]]\n\n # for i in range(len(nums)):\n # new_perms=[]\n # for p in perms:\n # for j in range(len(p)+1):\n # p_copy=p.copy()\n # p_copy.insert(j, nums[i])\n # new_perms.append(p_copy)\n # perms=new_perms\n\n # # print(unset)\n # unset=[tuple(i) for i in perms]\n # yesset=set(unset)\n\n # return list(yesset)\n\n # backtracking\n\n def helper(i, nums):\n if i==len(nums):\n return [[]]\n \n res=[]\n perms=helper(i+1, nums)\n\n for p in perms:\n for j in range(len(p)+1):\n p_copy=p.copy()\n p_copy.insert(j, nums[i])\n res.append(p_copy)\n return res\n\n unset=helper(0, nums)\n unset=[tuple(l) for l in unset]\n return list(set(unset))","runtime":"97"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n ans = set()\n for perm in itertools.permutations(range(len(nums))):\n curr = []\n for idx in perm:\n curr.append(nums[idx])\n ans.add(tuple(curr))\n \n return list(map(list, list(ans)))","runtime":"105"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n def backtrack(choices):\n \n if len(choices) == 1:\n return [ [choices[0]] ]\n \n backtrackPerms = backtrack(choices[1:])\n totalPerms = []\n \n for p in backtrackPerms:\n for i in range(len(p) + 1):\n pCopy = p.copy()\n pCopy.insert(i, choices[0])\n totalPerms.append(pCopy)\n \n return totalPerms\n \n permSet = set()\n totalPerms = backtrack(nums)\n res = []\n \n for i, p in enumerate(totalPerms):\n if tuple(p) in permSet:\n continue\n \n permSet.add(tuple(p))\n res.append(p)\n \n return res\n \n \n \n# can backtrack to get all the permutations\n# can iterate through the result and remove all duplicates by storing the its tuple in a set\n\n","runtime":"105"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n self.n = len(nums)\n ans = []\n # seen = \n def rec( vis, perm):\n if len(perm)==self.n:\n ans.append(perm)\n seen = set()\n for i in range(self.n):\n if i in vis or nums[i] in seen:\n continue\n seen.add(nums[i])\n tmp = copy.deepcopy(vis)\n tmp.add(i)\n rec(tmp, perm+[nums[i]])\n rec(set(), [])\n return ans","runtime":"113"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n per=set(sorted(list(itertools.permutations(nums))))\n return per\n ","runtime":"113"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n self.n = len(nums)\n ans = []\n def rec( vis, perm):\n if len(perm)==self.n:\n ans.append(perm)\n seen = set()\n for i in range(self.n):\n if i in vis or nums[i] in seen:\n continue\n seen.add(nums[i])\n tmp = copy.deepcopy(vis)\n tmp.add(i)\n rec(tmp, perm+[nums[i]])\n rec(set(), [])\n return ans","runtime":"122"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n # revursive approach\n\n # def helper(i, nums):\n # if i==len(nums):\n # return [[]]\n\n # res=[]\n # perms=helper(i+1, nums)\n\n # for p in perms:\n # for j in range(len(p)+1):\n # p_copy=p.copy()\n # p_copy.insert(j, nums[i])\n # res.append(p_copy)\n # return res\n\n # unset= helper(0, nums)\n # print(unset)\n # unset=[tuple(i) for i in unset]\n # yesset=set(unset)\n\n # return list(yesset)\n\n\n # iterative approach\n\n res=[]\n perms=[[]]\n\n for i in range(len(nums)):\n new_perms=[]\n for p in perms:\n for j in range(len(p)+1):\n p_copy=p.copy()\n p_copy.insert(j, nums[i])\n new_perms.append(p_copy)\n perms=new_perms\n\n # print(unset)\n unset=[tuple(i) for i in perms]\n yesset=set(unset)\n\n return list(yesset)","runtime":"122"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n nsize = len(nums)\n\n if nsize == 0:\n return [[]]\n \n if nsize == 1:\n return [[nums[0]]]\n\n if nsize == 2:\n if nums[0] == nums[1]:\n return [[nums[0],nums[1]]]\n return [[nums[0],nums[1]],[nums[1],nums[0]]]\n\n \n signatures = {}\n for i in range(nsize):\n newlist = nums.copy()\n val = newlist.pop(i)\n x = self.permuteUnique(newlist)\n for tmp in x:\n tmp.insert(0, val)\n\n signatures[tuple(tmp)] = tmp\n\n return signatures.values()","runtime":"130"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n def backtrack(path, used):\n print('backtrack: Enter: ', path)\n if len(path) == len(nums):\n result.append(path[:])\n return\n for i in range(len(nums)):\n # Skip duplicates: if the current element is the same as the previous one\n # and the previous one has not been used in this path, skip this element.\n print('i: ', i, ' used: ', used)\n if i > 0 and nums[i] == nums[i - 1] and not used[i - 1]:\n continue\n if not used[i]:\n used[i] = True\n path.append(nums[i])\n backtrack(path, used)\n path.pop() # Backtrack\n used[i] = False\n\n nums.sort() # Sort to handle duplicates\n result = []\n backtrack([], [False] * len(nums))\n return result\n\n","runtime":"130"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n solnSet = set()\n n = len(nums)\n def helper(q: List[int], subNums: List[int]):\n if not q and tuple(subNums) not in solnSet:\n res.append(subNums.copy())\n solnSet.add(tuple(subNums))\n else:\n ind = len(q)\n while ind > 0:\n num = q.pop(0)\n subNums.append(num)\n helper(q, subNums)\n subNums.pop()\n ind -= 1\n q.append(num)\n helper(nums, [])\n return res\n\n","runtime":"138"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n lst = [[i] for i in nums]\n for i in range(len(nums)-1):\n tmp_list = []\n for n in nums:\n for l in lst:\n if nums.count(n) >= l.count(n)+1:\n k = l + [n]\n if k not in tmp_list:\n tmp_list.append(k)\n lst = tmp_list\n return lst","runtime":"138"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res=set()\n def backtrack(start):\n if start==len(nums):\n res.add(tuple(nums))\n return\n for i in range(start,len(nums)):\n nums[start],nums[i]=nums[i],nums[start]\n backtrack(start+1)\n nums[start],nums[i]=nums[i],nums[start]\n\n backtrack(0)\n return [list(perm) for perm in res]\n ","runtime":"146"},{"code":"class Solution:\n def solve(self, data, start, end, results):\n if start == end:\n results.add(tuple(data))\n else:\n for i in range(start, end):\n data[i], data[start] = data[start], data[i]\n self.solve(data, start + 1, end, results)\n data[i], data[start] = data[start], data[i]\n\n\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n results = set()\n self.solve(nums, 0, len(nums), results)\n unique_results = [list(x) for x in results]\n return unique_results","runtime":"146"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n ret = set()\n def backtrack(remain, perm):\n if not remain:\n ret.add(tuple(perm))\n else:\n for i in range(0, len(remain)):\n perm.append(remain.pop(i))\n backtrack(remain, perm)\n remain.insert(i, perm.pop())\n backtrack(nums, [])\n return ret","runtime":"154"},{"code":"class Solution:\n\n def solve(self, nums, ans, i):\n if i==len(nums):\n ans.add(tuple(nums[:]))\n return\n for j in range(i,len(nums)):\n nums[j],nums[i] = nums[i],nums[j]\n self.solve(nums,ans,i+1)\n nums[j],nums[i] = nums[i],nums[j]\n\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n ans = set()\n self.solve(nums,ans,0)\n return ans","runtime":"154"},{"code":"from typing import List\n\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n ans = set() # Use a set to store unique permutations\n\n def backtrack(arr, size, not_chosen):\n nonlocal ans\n if size == n: # When the current permutation is complete\n ans.add(tuple(arr)) # Add a tuple version of the permutation to the set\n return\n for no in not_chosen:\n # Create a new list excluding the current element `no`\n next_not_chosen = not_chosen[:]\n next_not_chosen.remove(no) # Remove the first occurrence of `no`\n # Recursive call with the updated array and remaining elements\n backtrack(arr + [no], size + 1, next_not_chosen)\n\n backtrack([], 0, nums[:]) # Initial call with an empty array\n # Convert the set of tuples to a list of lists\n ans = [list(t) for t in ans]\n return ans\n","runtime":"163"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = set()\n def dfs(cur, arr):\n if len(arr) < 2:\n fin = cur[:] + arr\n res.add(tuple(fin))\n return \n\n for i in range(len(arr)):\n cur.append(arr[i])\n dfs(cur, arr[:i] + arr[i+1:])\n cur.pop()\n return\n dfs([], nums)\n return res","runtime":"163"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n\n def backtrack(flag, path):\n if len(path) == n:\n result.add(tuple(path))\n return\n\n for i in range(n):\n if flag[i]:\n continue\n\n path.append(nums[i])\n flag[i] = True\n backtrack(flag, path)\n flag[i] = False\n path.pop()\n\n result = set()\n flag = [False] * n\n path = []\n backtrack(flag, path)\n return result\n\n\n ","runtime":"171"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = set()\n length = len(nums)\n def dfs(visited, cur_path, nums):\n if len(cur_path) == length:\n res.add(tuple(cur_path))\n return\n for i in range(length):\n if not visited[i]:\n cur_path.append(nums[i])\n visited[i] = True\n dfs(visited, cur_path, nums)\n visited[i] = False\n cur_path.pop()\n dfs([False for i in range(length)], [], nums)\n return list(res)","runtime":"171"},{"code":"\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n ret = set()\n def backtrack(remain, perm):\n if not remain:\n ret.add(tuple(perm))\n else:\n for i in range(0, len(remain)):\n\n perm.append(remain[i])\n del remain[i]\n backtrack(remain, perm)\n remain.insert(i, perm.pop())\n\n backtrack(deque(nums), [])\n return ret\n\n","runtime":"179"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = set()\n # res = []\n encountered = []\n def perm(idx):\n if idx == len(nums) and nums not in encountered:\n res.add(tuple(nums[:]))\n # res.append(nums[:])\n # encountered.append(nums[:])\n for i in range(idx, len(nums)):\n nums[idx], nums[i] = nums[i], nums[idx]\n perm(idx + 1)\n nums[idx], nums[i] = nums[i], nums[idx]\n perm(0)\n return [list(r) for r in res]\n # return res","runtime":"179"},{"code":"class Solution:\n every=set()\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n self.every=set()\n complete=self.permute(nums)\n for i in range(len(complete)):\n self.every.add(tuple(complete[i]))\n solution=[]\n for val in self.every:\n solution.append(val)\n return solution\n \n \n return None\n \n def permute(self,nums:List[int]) -> List[List[int]]:\n numbers=[]\n if len(nums)==0:\n return [[]]\n if len(nums)==1:\n return [nums]\n if len(nums)==2:\n return [[nums[0],nums[1]],[nums[1],nums[0]]]\n sol=[]\n for i in range(len(nums)):\n if i==0:\n sol=self.permute(nums[1:len(nums)])\n \n if i==len(nums)-1:\n sol=self.permute(nums[0:len(nums)-1])\n \n if i>0 and i<len(nums)-1:\n x=nums[0:i]\n y=nums[i+1:len(nums)]\n x.extend(y)\n sol=self.permute(x)\n for j in range(len(sol)):\n x=sol[j]\n x.append(nums[i])\n numbers.append(x)\n return numbers","runtime":"187"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n l=len(nums)\n r=set()\n\n def bkt(comb,idxs):\n\n if len(comb)==l: \n r.add(tuple(comb))\n\n\n for nidx in idxs:\n comb.append(nums[nidx])\n idxscopy = idxs[:]\n idxscopy.remove(nidx)\n bkt(comb[:],idxscopy)\n comb.pop()\n \n bkt([],list(range(l)))\n\n return r\n","runtime":"187"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n cache = set()\n def backtrack(ans, nums):\n if len(nums) == 0:\n if tuple(ans) not in cache:\n cache.add(tuple(ans))\n res.append(ans)\n return\n for i in range(len(nums)):\n backtrack(ans + [nums[i]], nums[:i] + nums[i + 1:])\n backtrack([], nums)\n return list(res)","runtime":"195"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n uniques = set()\n\n def _recurse(picked: list[int], remaining: list[int]):\n # print(picked, remaining)\n if not remaining:\n uniques.add(tuple(picked))\n return\n\n for i, r in enumerate(remaining):\n new_picked = picked + [r]\n new_remaining = remaining[:i] + remaining[i+1:]\n _recurse(new_picked, new_remaining)\n\n _recurse([], nums)\n\n return [list(x) for x in uniques]\n\n","runtime":"195"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n N = len(nums)\n seen = [0] * N\n sols = set()\n def rec(cur_l):\n if len(cur_l) == N:\n sols.add(tuple(cur_l[:]))\n return\n for i in range(N):\n if seen[i] == 0:\n cur_l.append(nums[i])\n seen[i] = 1\n rec(cur_l)\n cur_l.pop()\n seen[i] = 0\n rec([])\n return list(sols)\n","runtime":"204"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = set()\n\n def dfs(nums, path):\n if not nums:\n res.add(tuple(path))\n else:\n for i in range(len(nums)):\n dfs(nums[:i]+nums[i+1:], path+[nums[i]])\n \n dfs(nums, [])\n return res","runtime":"204"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n def dfs(nums,res,path=[]):\n if len(nums)==0:\n res.add(tuple(path))\n return\n for i in range(len(nums)):\n dfs(nums[:i]+nums[i+1:],res,path+[nums[i]])\n return\n res=set()\n dfs(nums,res)\n return res","runtime":"212"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n res_cache = set()\n\n def permute_rec(index = 0) -> None:\n if index == len(nums):\n if str(nums) not in res_cache:\n res.append(list(nums))\n res_cache.add(str(nums))\n return\n\n for i in range(index, len(nums)):\n nums[i], nums[index] = nums[index], nums[i]\n permute_rec(index + 1)\n nums[i], nums[index] = nums[index], nums[i]\n \n permute_rec()\n return res","runtime":"212"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n ans = set()\n included_arr = [False] * len(nums)\n self.helper([],included_arr,nums,ans)\n return [list(tup) for tup in ans]\n\n def helper(self,cur_arr,included_arr,nums,ans):\n if len(cur_arr) == len(nums):\n ans.add(tuple(cur_arr))\n return\n for i in range(len(nums)):\n if included_arr[i] == False:\n included_arr[i] = True\n cur_arr.append(nums[i])\n self.helper(cur_arr,included_arr,nums,ans)\n included_arr[i] = False\n cur_arr.pop()","runtime":"220"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n\n result = set()\n templist = {}\n self.helper(nums, templist, result)\n return result\n\n def helper(self, nums, templist, result):\n\n if len(templist) == len(nums):\n values_list = list(templist.values())\n result.add(tuple(values_list))\n return\n\n for i in range(len(nums)):\n\n if i not in templist:\n templist[i] = nums[i]\n self.helper(nums, templist, result)\n del templist[i]\n return \n ","runtime":"220"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n # [1,2,3]\n \n ans = set()\n n = len(nums)\n \n def helper(i, current):\n #print(i, current)\n if i >= n:\n ans.add(current)\n return\n \n for j in range(len(current)+1):\n \n helper(i+1, tuple(current[k] if k < j else nums[i] if k == j else current[k-1] for k in range(len(current)+1)))\n helper(0, tuple())\n return ans","runtime":"228"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = set()\n\n def bt(temp, remain):\n if remain == []:\n res.add(tuple(temp[:]))\n return\n for i in range(len(remain)):\n bt(temp+[remain[i]], remain[:i]+remain[i+1:])\n bt([], nums)\n \n res = list(res)\n for i in range(len(res)):\n res[i] = list(res[i])\n\n return res","runtime":"228"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n l = []\n def dfs(sub, List):\n if len(sub) == len(nums):\n l.append(sub)\n return\n if List:\n for i in range(len(List)):\n dfs(sub+[List[i]], List[i+1:]+List[:i])\n\n dfs([], nums)\n unique_subsets = set(tuple(sublist) for sublist in l)\n l = [list(subset) for subset in unique_subsets]\n\n return l","runtime":"236"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n def backtrack(curr, ibag):\n if len(curr) == target:\n ans.add(tuple(curr))\n return\n \n for index in range(target):\n if index not in ibag:\n ibag.add(index)\n curr.append(nums[index])\n backtrack(curr, ibag)\n ibag.remove(index)\n curr.pop()\n \n ans = set()\n target = len(nums)\n backtrack([], set())\n arrans = [list(k) for k in ans]\n return ans","runtime":"236"},{"code":"class Solution:\n def permute(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 1:\n return {(nums[0],)}\n\n results = set()\n for idx, item in enumerate(nums):\n excluded_array = [\n subitem\n for subidx, subitem in enumerate(nums)\n if subidx != idx\n ]\n for subresult in self.permute(excluded_array):\n results.add((item,) + subresult)\n return results\n\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n return list(self.permute(nums))\n","runtime":"244"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n\n if len(nums) == 1:\n return [nums[:]]\n\n for i in range(len(nums)):\n n = nums.pop(0)\n perms = self.permuteUnique(nums)\n\n for perm in perms:\n perm.append(n)\n for i in perms:\n if i not in res: res.append(i)\n nums.append(n)\n return res\n","runtime":"253"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n def helper(ind,ds):\n if len(ds) == len(nums):\n ans.append(tuple(ds[:]))\n return\n \n for i in range(len(nums)):\n if d[i] == False:\n d[i] = True\n ds.append(nums[i])\n helper(i,ds)\n d[i] = False\n ds.pop()\n \n\n d = defaultdict(bool)\n ans = []\n ds = []\n helper(0,ds)\n return list(set(ans))\n ","runtime":"253"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n answer = set()\n def backtrack(permutation, indices):\n if len(permutation) == len(nums):\n answer.add(tuple(permutation[:]))\n return\n \n for i, num in enumerate(nums):\n if i not in indices:\n permutation.append(nums[i])\n indices.add(i)\n backtrack(permutation, indices)\n permutation.pop()\n indices.remove(i)\n \n backtrack([], set()) \n return [list(i) for i in answer]","runtime":"261"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n if len(nums) <= 1:\n return [nums]\n ans = []\n for i, x in enumerate(nums):\n next = self.permuteUnique(nums[:i] + nums[i+1:])\n for rest in next:\n a = [x]\n a.extend(rest)\n if a not in ans:\n ans.append(a)\n return ans\n\n","runtime":"261"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n final_res = []\n visited = set()\n def rec(start, curr, visited):\n if len(curr) == len(nums):\n final_res.append(tuple(curr.copy()))\n return\n if start >= len(nums):\n return\n \n for i in range(0, len(nums)):\n if i not in visited:\n visited.add(i)\n curr.append(nums[i])\n rec(start + 1, curr , visited)\n curr.pop()\n visited.remove(i)\n else:\n continue\n rec(0, [], set())\n return set(final_res)","runtime":"269"},{"code":"class Solution:\n def gen(self, acc, seen):\n if len(acc) == len(self.nums):\n if str(acc) not in self.dupes:\n self.dupes.add(str(acc))\n self.ans.append(acc[:])\n for i in range(len(self.nums)):\n if not seen[i]:\n seen[i] = True\n acc.append(self.nums[i])\n self.gen(acc, seen)\n acc.pop()\n seen[i] = False\n\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n seen = [False for i in range(len(nums))]\n self.ans = []\n self.nums = nums\n self.dupes = set()\n self.gen([], seen)\n return self.ans","runtime":"269"},{"code":"from collections import Counter\n\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n counts = Counter(nums)\n ans = []\n def backtrack(curr, used): \n if len(curr) == len(nums):\n ans.append(curr[:])\n return\n \n for i in range(len(nums)):\n if i not in used:\n used.append(i)\n curr.append(nums[i])\n backtrack(curr, used)\n used.pop()\n curr.pop()\n \n backtrack([],[])\n ans = [tuple(ls) for ls in ans]\n ans = set(ans)\n ans = [list(tup) for tup in ans]\n return ans","runtime":"277"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n def permuteLst(nums, currPerm):\n if not(nums):\n return [currPerm]\n perms = []\n for num in nums:\n unused = list(nums)\n unused.remove(num)\n for perm in permuteLst(unused, currPerm + [num]):\n if perm not in perms:\n perms.append(perm)\n return perms\n\n return permuteLst(nums, [])\n\n ","runtime":"277"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n cur = []\n ans = []\n n = len(nums)\n truth = [False for _ in range(n)]\n print(truth)\n\n def backtrack():\n if len(cur) == n:\n ans.append(cur[:])\n else:\n for i in range(n):\n if not truth[i]:\n cur.append(nums[i])\n truth[i] = True\n backtrack()\n cur.pop()\n truth[i] = False\n backtrack()\n usedNumbers = set()\n for i in ans:\n curSum = 1\n multiplier = 1\n for j in i:\n curSum = curSum*multiplier + j\n multiplier *= 10\n if curSum not in usedNumbers:\n usedNumbers.add(curSum)\n cur.append(i)\n \n\n return cur","runtime":"285"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n def dfs(path, took):\n if len(path) == len(nums):\n res.append(path.copy())\n return \n\n for i in range(0, len(nums)):\n # if i > 0 and nums[i] == nums[i-1]:\n # continue\n if i in took:\n continue\n took.add(i)\n path.append(nums[i])\n dfs(path, took)\n took.remove(i)\n path.pop()\n\n dfs([],set())\n set_res = set([tuple(r) for r in res])\n ans = [list(t) for t in set_res]\n # print(ans)\n return ans\n\n","runtime":"285"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 1:\n return [nums]\n l = []\n for i in range(len(nums)):\n element = nums[i]\n remaining = nums[:i] + nums[i+1:]\n perms = self.permuteUnique(remaining)\n for perm in perms:\n l.append(perm + [element])\n k = []\n for i in l:\n if i not in k:\n k.append(i)\n return k\n ","runtime":"294"},{"code":"class Solution:\n def permute(self, num, nums):\n print(f\"in: {num} ; {nums}\")\n if len(nums) == 1:\n permutations = [[nums[0], num], [num, nums[0]]]\n return permutations\n cur_num = nums[-1]\n permutations = self.permute(cur_num, nums[:-1])\n print(f\"permutations: {permutations}\")\n for permutation in permutations:\n# if num not in permutation:\n permutation.append(num)\n print(f\"out: {permutations}\")\n return permutations\n\n def _permuteUnique(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 1:\n return [nums]\n out_permutations = []\n # remove each digit, get other permutations recursively, add digit back\n for idx in range(len(nums)):\n # print(\"nums: \", nums)\n # print(\"idx: \", idx)\n others = nums[:idx] + nums[idx+1 : ]\n # print(\"others: \", others)\n permutations = self._permuteUnique(others)\n # print(\"permutations: \", permutations)\n cur_num = nums[idx]\n for p in permutations:\n # add current number to known permutations\n out_permutations.append(p + [cur_num])\n return out_permutations\n \n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n permutations = self._permuteUnique(nums)\n _permutations = [tuple(p) for p in permutations]\n return list(set(_permutations))\n \n permutations = []\n if len(nums) == 1:\n return [nums]\n for i in range(0, len(nums)):\n print(f\"i: {i}\")\n # i=1 -> nums[0], nums[:0] + nums[1:]\n # i=2 -> nums[1], nums[:1] + nums[2:]\n # i=3 -> nums[2], nums[:2] + nums[3:]\n _nums = []\n if i > 0:\n _nums.extend(nums[:i])\n if i < len(nums):\n _nums.extend(nums[i+1:])\n print(f\"_nums: {_nums}\")\n cur_permutations = self.permute(nums[i], _nums)\n permutations.extend(cur_permutations)\n _permutations = [tuple(p) for p in permutations]\n return list(set(_permutations))","runtime":"294"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 1:\n return [nums]\n l = []\n for i in range(len(nums)):\n element = nums[i]\n remaining = nums[:i] + nums[i+1:]\n perms = self.permuteUnique(remaining)\n for perm in perms:\n l.append(perm + [element])\n k = []\n for i in l:\n if i not in k:\n k.append(i)\n return k","runtime":"302"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n result = {}\n def backtrack(next, candidates):\n nonlocal result, nums\n if len(next) == len(nums): \n n = \"\".join(map(str, next))\n if n not in result:\n result[n] = next[:]\n return\n for i, c in enumerate(candidates):\n next.append(c)\n backtrack(next, candidates[:i]+candidates[i+1:])\n next.pop()\n backtrack([], nums)\n return result.values()\n ","runtime":"302"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n def backtrack(curr, dictionary):\n if len(curr) == len(nums):\n ans.append(curr[:])\n\n for i in range(len(nums)):\n # TODO - determine conditional for adding, backtracking, and popping\n # need to iterate/mark the position instead?\n # thinking let's use a dict - each key is index, value is actual value. check if key is present.\n if i not in dictionary:\n dictionary[i] = nums[i]\n curr.append(nums[i])\n backtrack(curr, dictionary)\n del dictionary[i]\n curr.pop()\n\n ans = []\n backtrack([], {})\n ans_set = set(tuple(x) for x in ans)\n returned_list = [ list(x) for x in ans_set ]\n return returned_list","runtime":"310"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n n = len(nums) \n curr = []\n permutation_indices = []\n def recurse():\n if len(curr) == n:\n permutation_indices.append(curr[:])\n return\n for i in range(n):\n if i in curr:\n continue\n curr.append(i)\n recurse()\n curr.pop()\n\n recurse()\n res = list(set([tuple([nums[idx] for idx in perm]) for perm in permutation_indices]))\n return res","runtime":"310"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n ans = []\n seen = set()\n visited = set()\n def recur(arr , n):\n if len(arr) == n and tuple(arr) not in visited:\n ans.append(arr[:])\n visited.add(tuple(arr))\n return \n\n for i in range(len(nums)):\n if i not in seen :\n seen.add(i)\n recur(arr+[nums[i]],n)\n seen.remove(i)\n\n return \n\n recur([],n)\n return ans","runtime":"318"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n out = set()\n outArr = []\n n = len(nums)\n\n def buildPermutations(curr, idx, length):\n curr_tupe = tuple(curr)\n if length == n and curr_tupe not in out:\n out.add(curr_tupe)\n outArr.append(curr)\n return\n \n for i in range(len(nums)):\n if i not in idx:\n idx.add(i)\n buildPermutations(curr+[nums[i]], idx, length+1)\n idx.remove(i)\n \n indices = set()\n buildPermutations([], indices, 0)\n return outArr","runtime":"318"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n def recPerm(arr: List[int]) -> Set[Tuple[int, ...]]:\n if len(arr) == 1:\n return {(arr[0], )}\n\n perms = set()\n for i in range(len(arr)):\n c = arr[i]\n rest = arr[:i] + arr[i+1:]\n perms = perms.union({tuple([c] + list(e)) for e in recPerm(rest)})\n return perms\n\n return recPerm(nums)\n\n ","runtime":"326"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n permutations = set()\n \n def dfs(cur):\n if len(cur) == len(nums):\n permutations.add(tuple(nums[idx] for idx in cur))\n return\n \n for idx, num in enumerate(nums):\n if idx not in cur:\n cur.append(idx)\n dfs(cur)\n cur.pop()\n \n dfs([])\n return [list(x) for x in permutations]","runtime":"326"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n\n if len(nums) == 1:\n return [nums]\n\n permutations = []\n for i,e in enumerate(nums):\n permutations.extend([[e] + p for p in self.permuteUnique(nums[:i] + nums[i + 1:])])\n\n return [list(p) for p in set([tuple(p) for p in permutations])]\n ","runtime":"335"},{"code":"class Solution:\n def permuteUnique(self, nums: list[int]) -> list[list[int]]:\n res = set()\n self.backtrack(res, nums, 0, [], set())\n return [list(i) for i in res]\n\n def backtrack(\n self,\n res: set,\n nums: list[int],\n idx: int,\n curSubset: list[int],\n numSet: set,\n ):\n if len(curSubset) == len(nums):\n res.add(tuple(curSubset.copy()))\n return\n for i in range(len(nums)):\n if (i, nums[i]) in numSet:\n continue\n curSubset.append(nums[i])\n numSet.add((i, nums[i]))\n self.backtrack(res, nums, i, curSubset, numSet)\n numSet.remove((i, nums[i]))\n curSubset.pop()","runtime":"335"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = set()\n def backtrack(acc):\n if len(acc) == len(nums):\n _res = []\n for idx in acc:\n _res.append(nums[idx])\n res.add(tuple(_res))\n \n for idx in range(len(nums)):\n if idx not in acc:\n acc.append(idx)\n backtrack(acc)\n acc.pop()\n \n backtrack([])\n return res","runtime":"343"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n def backtrack(nums):\n if len(nums) <= 1:\n return [nums]\n results = []\n for i, num in enumerate(nums):\n rest = nums[:i] + nums[i+1:]\n subresults = backtrack(rest)\n results.extend([[num] + subres for subres in subresults])\n return results\n res = backtrack(nums)\n res = set([tuple(elem) for elem in res])\n return res\n","runtime":"343"},{"code":"class Solution:\n def permuteUniqueR(self, n, nums: List[int], k: int, createdArray: List[int], resultSet):\n notUsedIndexes = []\n for i in range(0, n):\n if(createdArray[i] == 1000):\n notUsedIndexes.append(i)\n if(len(notUsedIndexes) == 0):\n resultSet.add(','.join(map(str, createdArray)))\n return resultSet\n\n # print('--', createdArray, notUsedIndexes)\n\n for i in notUsedIndexes:\n createdArray[i] = nums[k]\n resultSet = self.permuteUniqueR(n, nums, k+1, createdArray, resultSet)\n createdArray[i] = 1000\n \n return resultSet\n\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n createdArray = [1000] * n\n resultSet = set()\n resultSet = self.permuteUniqueR(n, nums, 0, createdArray, resultSet)\n rspList = []\n for resultStr in resultSet:\n strList = resultStr.split(',')\n intList = [int(numeric_string) for numeric_string in strList]\n rspList.append(intList)\n \n return rspList","runtime":"351"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n def backtrack(cur):\n if len(cur) == len(nums):\n res.add(tuple([nums[i] for i in cur]))\n\n for i in range(len(nums)):\n if i not in cur:\n cur.append(i)\n backtrack(cur)\n cur.pop()\n\n res = set()\n backtrack([])\n return [list(tup) for tup in res]\n\n ","runtime":"351"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n seen = set()\n def dfs(currPath, nums, fin):\n if len(currPath) == fin:\n curr = \"\".join(str(x) for x in currPath)\n if not curr in seen:\n seen.add(curr)\n res.append(currPath)\n return\n for i in range(len(nums)):\n dfs(currPath + [nums[i]], nums[:i] + nums[i + 1:], fin)\n dfs([], nums, len(nums))\n return res","runtime":"359"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res=set()\n def per(nm: List[int],x: List[int]) -> None:\n if nm ==[]:\n aa=\"\"\n for i in x:\n aa+=str(i)+\"*\"\n res.add(aa)\n else:\n for i in range(len(nm)): \n nmc=nm[:i]+nm[i+1:]\n xx=x.copy()\n xx.append(nm[i])\n per(nmc,xx)\n per(nums,[])\n r=[]\n for i in res:\n a=i.split('*')\n a.pop()\n b=[]\n for j in a:\n b.append(int(j))\n r.append(b)\n return r","runtime":"359"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n ans = []\n def bactracking(visited_l: List[int], visited_s: List[int]) -> None:\n if len(visited_l) == len(nums):\n ans.append(visited_l)\n return\n for i in range(len(nums)):\n if i not in visited_s:\n bactracking(visited_l + [i], visited_s | {i})\n \n bactracking([], set())\n return set(map(lambda arr: tuple(map(lambda i: nums[i], arr)), ans))\n ","runtime":"367"},{"code":"import math\n\n\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n index = 2 ** (len(nums)) - 1\n n = len(nums)\n\n\n def bits(n):\n while n:\n b = n & (~n + 1)\n yield b\n n ^= b\n\n\n def permute(index: int):\n if index.bit_count() == 1:\n return [(nums[int(math.log2(index))], )]\n permutations = []\n for b in bits(index):\n permutations += [\n (nums[int(math.log2(b))], ) + permutation\n for permutation in permute(index - b)\n ]\n return permutations\n\n return set(permute(index))","runtime":"367"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n seen = set()\n def dfs(currPath, nums, fin):\n if len(currPath) == fin:\n curr = \"\".join(str(x) for x in currPath)\n if not curr in seen:\n seen.add(curr)\n res.append(currPath)\n return\n for i in range(len(nums)):\n dfs(currPath + [nums[i]], nums[:i] + nums[i + 1:], fin)\n dfs([], nums, len(nums))\n return res","runtime":"375"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n ans = []\n vis = set()\n def recur(index, arr):\n # print(index, arr, ans)\n if len(arr) == len(nums):\n temp = [nums[i] for i in arr]\n if tuple(temp) not in vis:\n ans.append(temp)\n vis.add(tuple(temp))\n return\n for i in range(len(nums)):\n if i in arr:\n continue\n recur(i + 1, arr + [i])\n \n recur(0, [])\n # print(ans)\n return ans","runtime":"375"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n lst=[]\n a=[]\n if len(nums)==1:\n return [nums[:]]\n \n for i in range(len(nums)):\n n=nums.pop(0)\n \n perms=self.permuteUnique(nums)\n print(perms)\n for perm in perms:\n perm.append(n)\n \n if n not in a:\n lst.extend(perms)\n \n nums.append(n)\n\n a.append(n)\n\n return lst","runtime":"384"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n if not nums:\n return []\n if len(nums) == 1:\n return [nums]\n res = set()\n for i, num in enumerate(nums):\n sub_problems = self.permuteUnique([nums[j] for j in range(len(nums)) if i != j])\n res.update(set([tuple([num] + list(ans)) for ans in sub_problems]))\n return res","runtime":"384"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n result = set()\n\n # start from an integer only once\n def dfs(currList):\n nonlocal result\n if len(currList) == len(nums):\n tmp = tuple([n for _, n in currList])\n result.add(tmp)\n return\n \n for i, num in enumerate(nums):\n if (i, num) not in currList:\n dfs(currList + [(i, num)])\n \n dfs([])\n result = list(result)\n return [list(t) for t in result]\n\"\"\" \n\n\n\"\"\"","runtime":"392"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n if not nums:\n return {()}\n \n sol = set()\n for i, num in enumerate(nums):\n rest = self.permuteUnique(nums[:i] + nums[i+1:])\n sol.update(set((num,) + minisol for minisol in rest))\n return sol\n","runtime":"392"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n def permHelper(nums):\n if not nums:\n return {()}\n \n sol = set()\n for i, num in enumerate(nums):\n rest = permHelper(nums[:i] + nums[i+1:])\n sol.update(set((num,) + minisol for minisol in rest))\n return sol\n\n return permHelper(nums)","runtime":"400"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n answer_set = set()\n\n def traverse(nums: List[int], answer = List[int]):\n nonlocal answer_set\n if len(nums) == 0:\n answer_set.add(tuple(answer))\n return\n\n for i in range(len(nums)):\n print(nums)\n num = nums.pop(i)\n answer.append(num)\n traverse(nums, answer.copy())\n nums.insert(i, answer.pop())\n \n traverse(nums, [])\n return answer_set\n\n ","runtime":"400"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n # do indices? \n # recursion? remaining nums?\n # duplicates \n \n # get all permutations (indices), convert to a set \n \n # how to get permutations \n \n # recursive getPermutations calls. \n # base case, return it \n # \n # [1, 2, 3]\n # 1 \n # [2, 3]\n # 2 3 \n # [3], [2]\n # \n def getPermutations(currList):\n if len(currList) == 1:\n return [currList]\n \n permutations = [] \n for i in range(len(currList)):\n startValue = currList[i] \n remainList = currList[:i] + currList[i+1:]\n newPermutations = getPermutations(remainList)\n newPermutations = [[startValue] + permList for permList in newPermutations]\n permutations.extend(newPermutations)\n \n return permutations\n \n allPermutations = [] \n indexNums = [index for index, value in enumerate(nums)]\n indexPermutations = getPermutations(indexNums)\n \n for permList in indexPermutations:\n for i in range(len(permList)):\n permList[i] = nums[permList[i]]\n \n valuePermutations = [tuple(permList) for permList in indexPermutations]\n valuePermutations = set(valuePermutations)\n valuePermutations = [list(permList) for permList in valuePermutations]\n \n \n\n return valuePermutations\n \n \n \n \n \n \n \n \n \n \n ","runtime":"408"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n N = len(nums)\n\n seen = set()\n combos = []\n def helper( picklist ):\n if len(picklist) == N:\n combo = [nums[picklist[i]] for i in range(N)]\n nid = \"\".join([str(n) for n in combo])\n if nid in seen:\n return\n seen.add(nid)\n combos.append(combo)\n return\n\n for i in range(N):\n if i not in picklist:\n picklist.append(i)\n helper( picklist )\n picklist.pop()\n\n helper(deque())\n\n return combos\n \n\n \n\n ","runtime":"408"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n visited = set()\n subsets = []\n idxSubsets = []\n res = []\n def dfs():\n if len(subsets) == len(nums) and \"\".join(map(str, subsets)) not in visited:\n res.append(subsets.copy())\n visited.add(\"\".join(map(str, subsets)))\n return\n \n\n for idx,i in enumerate(nums):\n if idx in idxSubsets:\n continue\n subsets.append(i)\n idxSubsets.append(idx)\n dfs()\n subsets.pop()\n idxSubsets.pop()\n dfs()\n return res","runtime":"416"},{"code":"class Solution:\n def permute_support(self, nums: List[int]) -> List[List[int]]:\n \n if len(nums) == 1:\n return [nums]\n \n ans = []\n \n for i in range(len(nums)):\n arr1 = [nums[i]]\n sub_arr = self.permuteUnique(nums[0:i]+nums[i+1:])\n for arr in sub_arr:\n ans.append(arr1+arr)\n \n return ans\n\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n ans = self.permute_support(nums)\n\n \n unique_ans = []\n list_map = {}\n\n for arr in ans:\n key = \"\"\n for ele in arr:\n key += str(ele)\n \n if key not in list_map:\n unique_ans.append(arr)\n list_map[key] = True\n\n\n return unique_ans\n","runtime":"416"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n ls={}\n def bt(nums,idx,vis,k):\n vis=vis[:]\n nums=nums[:]\n k=k[:]\n\n if len(nums)==idx:\n st=''\n for i in k:\n st=st+str(i)+','\n ls[st]=1\n return\n \n for i in range(len(nums)):\n if not vis[i]:\n vis[i]=True\n bt(nums,idx+1,vis,k+[nums[i]])\n vis[i]=False\n bt(nums,0,[False for i in nums],[])\n m=[]\n for i in ls.keys():\n m.append(map(int,i.split(',')[:-1]))\n return m","runtime":"425"},{"code":"class Solution:\n def permute_support(self, nums: List[int]) -> List[List[int]]:\n \n if len(nums) == 1:\n return [nums]\n \n ans = []\n \n for i in range(len(nums)):\n arr1 = [nums[i]]\n sub_arr = self.permuteUnique(nums[0:i]+nums[i+1:])\n for arr in sub_arr:\n ans.append(arr1+arr)\n \n return ans\n\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n ans = self.permute_support(nums)\n\n \n unique_ans = []\n list_map = {}\n\n for arr in ans:\n key = \"\"\n for ele in arr:\n key += str(ele)\n \n if key not in list_map:\n unique_ans.append(arr)\n list_map[key] = True\n\n\n return unique_ans\n","runtime":"425"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n\n\n def backtrack(path):\n if len(path) == len(nums):\n perm = []\n dupe = ''\n for index in path:\n num = nums[index]\n dupe += str(num)\n perm.append(num)\n if dupe not in track:\n track.add(dupe)\n res.append(perm)\n \n for idx, num in enumerate(nums):\n if idx not in path:\n path.append(idx)\n backtrack(path)\n path.pop()\n \n track = set()\n res = []\n backtrack([])\n return res\n ","runtime":"433"},{"code":"from typing import List, Set\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n listo = []\n if len(nums) == 1:\n listo.append(nums)\n return listo\n for i in range(len(nums)):\n new_list = []\n item_to_remove = nums[i]\n remaining_list = [nums[j] for j in range(len(nums)) if j != i]\n # print(remaining_list)\n recursions = self.permuteUnique(remaining_list)\n for recursion in recursions:\n another_list = []\n another_list.append(item_to_remove)\n another_list.extend(recursion)\n listo.append(another_list)\n unique_list = [item for k, item in enumerate(listo) if item not in listo[:k]]\n return unique_list\n\n","runtime":"441"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 1 :\n return [nums]\n S = []\n for i in range(len(nums)) :\n previous = self.permuteUnique(nums[:i] + nums[i+1:])\n \n for perm in previous :\n S.append([nums[i]] + perm)\n S.append(perm + [nums[i]])\n \n res = []\n for perm in S :\n if not perm in res :\n res.append(perm)\n \n return res","runtime":"441"},{"code":"import math\n\n\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n index = 2 ** (len(nums)) - 1\n nums = sorted(nums)\n n = len(nums)\n\n\n def permute(index: int):\n if index.bit_count() == 1:\n return [[int(math.log2(index))]]\n pList = []\n for i in range(n):\n if index & 2 ** i != 2 ** i:\n continue\n pList += [\n [i] + permutation\n for permutation in permute(index - 2 ** i)\n ]\n return pList\n\n permutatedIndices = permute(index)\n return set([\n tuple([nums[i] for i in permutatedIndex])\n for permutatedIndex in permutatedIndices\n ])","runtime":"449"},{"code":"import functools\nimport math\n\n\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n index = 2 ** (len(nums)) - 1\n nums = sorted(nums)\n n = len(nums)\n result = set()\n\n\n def bits(n):\n while n:\n b = n & (~n + 1)\n yield b\n n ^= b\n\n\n # @functools.lru_cache(None)\n def permute(index: int):\n if index.bit_count() == 1:\n return [[int(math.log2(index))]]\n pList = []\n for b in bits(index):\n pList += [\n [int(math.log2(b))] + permutation\n for permutation in permute(index - b)\n ]\n return pList\n\n permutatedIndices = permute(index)\n return set([\n tuple([nums[i] for i in permutatedIndex])\n for permutatedIndex in permutatedIndices\n ])","runtime":"449"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res=[]\n def backtrack(l):\n if len(l) == len(nums):\n res.append(list(nums[i] for i in l))\n return None\n for i in range(len(nums)):\n if i not in l:\n l.append(i)\n backtrack(l)\n l.pop()\n\n backtrack([])\n s=set()\n fl=[]\n for i in res:\n if \"\".join(str(i)) not in s:\n fl.append(i)\n s.add(\"\".join(str(i)))\n return fl","runtime":"457"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n class Tree(object):\n def __init__(self, val):\n self.val = val\n self.neighbors = {}\n combos = [[]]\n root = Tree(None)\n for _ in range(len(nums)):\n new_combos = []\n for i in range(len(nums)):\n for c in combos:\n if i not in c:\n new_c = []\n cur = root\n for i_c in c:\n new_c.append(i_c)\n n = nums[i_c]\n if n not in cur.neighbors:\n cur.neighbors[n] = Tree(n)\n cur = cur.neighbors[n]\n if nums[i] not in cur.neighbors:\n cur.neighbors[nums[i]] = Tree(nums[i])\n new_c.append(i)\n new_combos.append(new_c)\n combos = new_combos\n\n # for c in combos:\n # cur = root\n # for i_c in c:\n # n = nums[i_c]\n # if n not in cur.neighbors:\n # cur.neighbors[n] = Tree(n)\n # cur = cur.neighbors[n]\n final = []\n q = [([], root)]\n while q:\n cur_li, cur_node = q.pop()\n if len(cur_node.neighbors) == 0:\n final.append(cur_li)\n else:\n for c, n in cur_node.neighbors.items():\n q.append((cur_li+[c], n))\n return final\n ","runtime":"457"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n x=permutations(nums)\n y=[]\n for i in x:\n if i not in y:\n y.append(i)\n return y","runtime":"466"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n\n\n\n main = []\n\n def permute(l, idx):\n nonlocal main\n\n\n if idx>=len(nums):\n return \n\n if l not in main:\n main.append(l.copy())\n else:\n print(idx)\n print(l)\n\n for i in range(idx, len(nums)):\n if i>idx and l[i]==l[idx]:\n continue\n\n temp = l[i]\n l[i] = l[idx]\n l[idx] = temp\n permute(l, idx+1)\n temp = l[i]\n l[i] = l[idx]\n l[idx] = temp\n \n return\n\n nums.sort()\n permute(nums.copy(), 0)\n\n return main","runtime":"466"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n x=permutations(nums)\n res=[]\n for i in x:\n if i not in res:\n res.append(i)\n return res","runtime":"474"},{"code":"from itertools import permutations\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n for permutation in permutations(nums) :\n if permutation not in res :\n res.append(permutation)\n return res","runtime":"474"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n x = permutations(nums,len(nums))\n ans = []\n for i in x:\n if(i not in ans):\n ans.append(i)\n return ans\n ","runtime":"482"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n l = permutations(nums)\n visited =[]\n for i in l:\n if i not in visited:\n visited.append(i)\n \n return visited\n\n # res = set()\n # n = len(nums)\n # def dfs(cur, nums):\n # if len(cur) == n:\n # res.add(tuple(cur))\n # return\n # else:\n # for i in range(len(nums)):\n # dfs(cur+[nums[i]], nums[:i]+nums[i+1:])\n # dfs([], nums)\n # return res\n ","runtime":"482"},{"code":"class Solution:\n\n def permutations(self, nums):\n if len(nums) == 0 or len(nums) == 1:\n return [nums]\n l = []\n for i in range(len(nums)):\n first = nums[i]\n remaining_list = nums[:i] + nums[i+1:]\n for p in permuteUnique(remaining_list):\n l.append([first] + p)\n return l\n\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n for p in permutations(nums):\n if not p in res:\n res.append(p)\n return res","runtime":"490"},{"code":"from itertools import permutations\nclass Solution:\n def permuteUnique(self, a: List[int]) -> List[List[int]]:\n b=[]\n c=[]\n b=permutations(a)\n [c.append(x) for x in b if x not in c]\n return c","runtime":"490"},{"code":"import itertools\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res=[]\n permutations=list(itertools.permutations(nums))\n for i in permutations:\n if i in res:\n continue\n else:\n res.append(i)\n return res\n ","runtime":"498"},{"code":"import itertools\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n l = list(itertools.permutations(nums))\n l1 = []\n for i in l:\n if i not in l1:\n l1.append(i)\n return l1\n ","runtime":"515"},{"code":"class Solution:\n def __init__(self):\n self.per_lis = [] # 初始化为实例变量\n\n def replace_duplicates_with_history(self, lst: List[int]):\n new_list = [] # 存储替换后的列表\n history = {} # 记录每个元素的替换历史\n counter = max(lst) + 1 # 计数器，从当前最大元素的下一个整数开始\n\n for num in lst:\n if num in history:\n # 如果数字已经出现在历史中，将其替换为新的数字\n new_list.append(counter)\n history[num].append(counter)\n counter += 1\n else:\n # 如果是第一次出现，保留原数字，并在历史中记录\n new_list.append(num)\n history[num] = [num]\n\n return new_list, history\n\n def recover_with_history(self, L: List[List[int]], history: dict):\n # 构建反向映射字典，反转history字典中的键值对\n reverse_mapping = {v: k for k, values in history.items() for v in values}\n\n # 使用反向映射来恢复原始列表\n recovered_list = []\n for sublist in L:\n recovered_sublist = [reverse_mapping.get(item, item) for item in sublist]\n recovered_list.append(recovered_sublist)\n\n return recovered_list\n\n def remain(self, lis: List[int], nums: List[int]):\n return [x for x in nums if x not in lis]\n\n def done(self, l: List[int], nums: List[int]):\n if len(l) == len(nums):\n self.per_lis.append(l)\n\n def backtrack(self, current: List[int], nums: List[int]):\n self.done(current, nums)\n rem = self.remain(current, nums)\n while rem:\n x = rem.pop(0)\n self.backtrack(current + [x], nums)\n\n def permute(self, nums: List[int]) -> List[List[int]]:\n self.per_lis = [] # 确保每次调用 permute 时 per_lis 都是空的\n self.backtrack([], nums)\n return self.per_lis\n\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n # 替换重复的数字，并得到替换后的新列表和替换历史\n new_nums, history = self.replace_duplicates_with_history(nums)\n \n # 对替换后的新列表进行排列\n permutations = self.permute(new_nums)\n \n # 恢复排列后的结果，并去重\n recovered_permutations = self.recover_with_history(permutations, history)\n \n # 去重，确保只返回唯一的排列\n unique_permutations = [list(x) for x in set(tuple(y) for y in recovered_permutations)]\n \n return unique_permutations\n ","runtime":"515"},{"code":"class Solution:\n def helper(self, nums_set: Set[int]) -> List[List[int]]:\n if len(nums_set) == 0:\n return [[]]\n \n res = []\n for n in nums_set:\n res += [[n] + p for p in self.helper(nums_set - {n})]\n return res\n \n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n # def permute(self, nums: List[int]) -> List[List[int]]:\n indices_permutations = self.helper(set(range(len(nums))))\n def get_permutation_from_indices(indices):\n res = []\n \n for i in indices:\n res.append(str(nums[i]))\n res.append(\",\")\n \n if len(res) > 0:\n res = res[:-1]\n \n return \"\".join(res)\n \n unique = {get_permutation_from_indices(ixs) for ixs in indices_permutations}\n return [list(map(int, p.split(\",\"))) for p in unique]\n \n ","runtime":"523"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n result = set()\n def run_recursion(sequence):\n if len(sequence) == len(nums):\n t = [nums[x] for x in sequence]\n result.add(tuple(t))\n return\n \n for i in range(len(nums)):\n if i in set(sequence):\n continue\n\n run_recursion(sequence + [i])\n \n for i in range(len(nums)):\n run_recursion([i])\n \n return list(result)","runtime":"523"},{"code":"class Solution:\n from itertools import permutations\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n li=[]\n for i in permutations(nums,len(nums)):\n if list(i) not in li:\n li.append(list(i))\n return li\n\n ","runtime":"531"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n result = set()\n\n def permutations(index):\n \n if index == len(nums):\n temp = copy.deepcopy(nums)\n if tuple(temp) not in result:\n result.add(tuple(temp))\n else:\n for i in range(index, len(nums)):\n nums[i], nums[index] = nums[index], nums[i]\n permutations(index + 1)\n nums[i], nums[index] = nums[index], nums[i]\n permutations(0)\n return list(result)\n ","runtime":"531"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n result = set()\n def run_recursion(sequence):\n if len(sequence) == len(nums):\n t = [nums[x] for x in sequence]\n result.add(tuple(t))\n return\n \n for i in range(len(nums)):\n if i in set(sequence):\n continue\n\n run_recursion(sequence + [i])\n \n for i in range(len(nums)):\n run_recursion([i])\n \n return list(result)","runtime":"539"},{"code":"from itertools import permutations\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res=[]\n for i in permutations(nums, len(nums)):\n if list(i) not in res:\n res.append(list(i))\n return res\n ","runtime":"539"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = set()\n def backtrack(combo, n):\n if(len(combo) == len(nums)):\n res.add(tuple(combo.copy()))\n return\n else:\n for i in range(len(n)):\n val = n[i]\n new_n = n[:i] + n[i+1:]\n combo.append(val)\n print(combo)\n backtrack(combo.copy(), new_n.copy())\n combo.pop()\n backtrack([], nums)\n return res","runtime":"547"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n data = []\n for i in itertools.permutations(nums):\n if list(i) not in data:\n data.append(list(i))\n return data","runtime":"547"},{"code":"import itertools\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n perms = list(itertools.permutations(nums))\n result = []\n for perm in perms:\n if list(perm) not in result:\n result.append(list(perm))\n else:\n pass\n return result","runtime":"556"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n a=list(permutations(nums))\n b=[]\n for i in a:\n if list(i) in b:\n continue\n b.append(list(i)) \n return b","runtime":"556"},{"code":"from itertools import permutations\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n a=[list(i) for i in permutations(nums)]\n b=[]\n for i in a:\n if i not in b:\n b.append(i)\n return b","runtime":"564"},{"code":"from itertools import permutations\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res=[]\n for i in list(permutations(nums)):\n x=list(i)\n if x not in res:\n res.append(x)\n return res","runtime":"564"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n import itertools\n perms = [list(a) for a in itertools.permutations(nums)]\n a = []\n [a.append(perm) for perm in perms if perm not in a]\n return a\n ","runtime":"572"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n import itertools\n perms = [list(a) for a in itertools.permutations(nums)]\n a = []\n [a.append(perm) for perm in perms if perm not in a]\n return a\n ","runtime":"572"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n n = len(nums)\n result = []\n\n def helper(i):\n if i == n-1:\n if nums[:] not in result:\n result.append(nums[:])\n return\n for j in range(i, n):\n\n nums[i], nums[j] = nums[j], nums[i]\n helper(i+1)\n nums[i], nums[j] = nums[j], nums[i]\n\n helper(0)\n return result \n ","runtime":"580"},{"code":"from itertools import permutations \nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n a=[list(x) for x in permutations(nums,len(nums))] \n ans=[]\n for i in a :\n if i not in ans :\n ans.append(i)\n return ans ","runtime":"580"},{"code":"\n# Example:\n\n# Input: nums = [1,2,3]\n# Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]\n\n# Approach:\n# Recursive approach \n\n# generate permutations by:\n# swap begin index with all other indices ahead of it (starting with 0)\n# recurse further on all new words perms generated with an increased current idx \n# base case: return when the current idx reaches the end of the word and then add to the result\n\n# edge cases:\n# all numbers are duplicates ex) [1,1,1]\n\n\nclass Solution:\n def __init__(self): \n self.permutations = []\n \n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n if not nums or len(nums) == 1:\n return [nums]\n \n if len(nums) == 2:\n if nums[0] == nums[1]:\n return [nums]\n \n return [[nums[0], nums[1]], [nums[1], nums[0]]]\n \n def swap(input_nums, first_idx, second_idx):\n input_nums[first_idx], input_nums[second_idx] = input_nums[second_idx], input_nums[first_idx]\n\n def traverse(current_nums, current_idx):\n if current_idx == len(current_nums) - 1:\n if not current_nums in self.permutations:\n self.permutations.append(current_nums[:])\n\n return\n \n for i in range(current_idx, len(current_nums)):\n # NOTE: Need 2 swap due to switch current_nums back due to nature of lists in python \n # swap index values\n swap(current_nums, current_idx, i)\n\n traverse(current_nums, current_idx + 1)\n # swap back after recursion\n swap(current_nums, current_idx, i)\n \n traverse(nums, 0)\n \n return self.permutations","runtime":"588"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n\n total = []\n def permutations(start):\n\n if start == len(nums)-1:\n if nums in total:\n return\n total.append(nums[:])\n return\n \n for i in range(start, len(nums)):\n nums[i], nums[start] = nums[start], nums[i]\n permutations(start+1)\n nums[i], nums[start] = nums[start], nums[i]\n\n\n permutations(0)\n return total","runtime":"588"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n global permutations\n permutations = []\n def permutate(numbers,current_permutation=[]):\n if not numbers:\n if current_permutation not in permutations:\n permutations.append(current_permutation[:])\n return\n else:\n return\n for i in numbers:\n current_permutation.append(i)\n new_numbers = numbers.copy()\n new_numbers.remove(i)\n permutate(new_numbers,current_permutation)\n current_permutation.pop()\n permutate(nums) \n return permutations \n ","runtime":"597"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n\n def backtrack(i):\n if i == len(nums) - 1:\n if nums not in res:\n res.append(nums.copy())\n return \n\n for j in range(i, len(nums)):\n nums[i], nums[j] = nums[j], nums[i]\n\n backtrack(i + 1)\n\n nums[i], nums[j] = nums[j], nums[i]\n\n backtrack(0)\n\n return list(res)\n","runtime":"597"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n ans = []\n\n def dfs(path, options):\n if not options and path not in ans:\n ans.append(path.copy())\n return\n \n temp = options.copy()\n prev = None\n for option in options:\n\n path.append(option)\n temp.remove(option)\n\n dfs(path, temp)\n\n temp.append(option)\n path.pop()\n \n dfs([], nums.copy())\n return ans","runtime":"605"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n perms = []\n\n\n def helper(perm,left):\n if not len(left):\n if perm not in perms:\n perms.append(perm[::])\n return\n for i in left:\n newp = perm.copy()\n newl = left.copy()\n newp.append(i)\n newl.remove(i)\n helper(newp,newl)\n helper([],nums)\n return perms\n \n \n\n \n ","runtime":"605"},{"code":"\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n\n n = len(nums)\n self.visited = set()\n self.ans = []\n\n self.remain = set([i for i in range(n)])\n \n # def dfs(cur_idx, path):\n\n # if len(path) == n - 1:\n # t = tuple(path + [nums[cur_idx]])\n # if t not in self.visited:\n # self.ans.append(list(t))\n # self.visited.add(t) \n # return\n # self.remain.remove(cur_idx)\n # for next_idx in self.remain:\n # dfs(next_idx, path + [nums[cur_idx]])\n # self.remain.add(cur_idx)\n \n # for i in range(n):\n # dfs(i, [])\n \n # return self.ans\n\n self.used = [False] * n\n\n def dfs(i, path):\n print(i, path)\n if i == n:\n if tuple(path) not in self.visited:\n self.visited.add(tuple(path))\n self.ans.append(list(tuple(path)))\n for idx in range(n):\n if not self.used[idx]:\n path.append(nums[idx])\n self.used[idx] = True\n dfs(i + 1, path)\n path.pop()\n self.used[idx] = False\n \n dfs(0, [])\n return self.ans","runtime":"613"},{"code":"def permutation(index, nums, result, used):\n if index == len(nums) and nums not in result:# Base case\n result.append(list(nums)) # Append nums as list to result\n return # Stop further processing\n \n for i in range(index, len(nums)):\n nums[index], nums[i] = nums[i], nums[index] # Swap\n permutation(index+1, nums, result, used)\n nums[index], nums[i] = nums[i], nums[index] # Swap back\n\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n result=[]\n nums.sort()\n used=[False]*len(nums)\n permutation(0,nums,result, used)\n return result","runtime":"613"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n def backtrack(start):\n if start == len(nums):\n if (not (nums[:] in res)):\n res.append(nums[:])\n return\n \n for i in range(start, len(nums)):\n nums[start], nums[i] = nums[i], nums[start]\n backtrack(start + 1)\n nums[start], nums[i] = nums[i], nums[start]\n\n res = []\n backtrack(0)\n return res","runtime":"621"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n result = []\n nums.sort()\n \n def backtrack(path,left):\n if len(path) == len(nums):\n if path not in result:\n result.append(path[:])\n return \n \n for num in left:\n path.append(num)\n newleft = left.copy()\n newleft.remove(num)\n backtrack(path,newleft)\n path.pop()\n newleft.append(num)\n backtrack([],nums)\n return result\n ","runtime":"621"},{"code":"class Solution:\n\n def solve(self, ip, op, c, res):\n if len(op) == c:\n if op not in res:\n res.append(op)\n return\n\n for i in ip:\n ip1 = ip.copy()\n ip1.remove(i)\n self.solve(ip1, op + [i], c, res)\n\n return res\n\n\n\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n ip = nums\n return self.solve(ip, [], len(ip), [])","runtime":"629"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n x=0\n def per(mums,x=0,z=None):\n if z is None:\n z=[]\n if len(nums)==x and nums not in z:\n z.append(nums.copy())\n for i in range(x,len(nums)):\n nums[x],nums[i]=nums[i],nums[x]\n per(nums,x+1,z)\n nums[x],nums[i]=nums[i],nums[x]\n return z\n return per(nums,x,None)","runtime":"629"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n result = []\n n = len(nums)\n\n def backtrack(idx):\n if idx == n:\n res = nums[:]\n if res not in result:\n result.append(res)\n return\n \n for i in range(idx, n):\n nums[idx], nums[i] = nums[i], nums[idx]\n backtrack(idx+1)\n nums[idx], nums[i] = nums[i] , nums[idx]\n \n\n backtrack(0)\n return result\n ","runtime":"637"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n res,sol = [],[]\n n = len(nums)\n def backtrack(pos,combination,numss):\n if pos==n :\n if combination not in res:\n res.append(combination[:])\n return\n for i in list(numss) :\n numss.remove(i)\n backtrack(pos+1 , combination+[i],numss)\n numss.append(i)\n backtrack(0,[],nums)\n return res","runtime":"637"},{"code":"def permutation(index, nums, result):\n if index == len(nums) and nums not in result:# Base case\n result.append(list(nums)) # Append nums as list to result\n return # Stop further processing\n \n for i in range(index, len(nums)):\n nums[index], nums[i] = nums[i], nums[index] # Swap\n permutation(index+1, nums, result)\n nums[index], nums[i] = nums[i], nums[index] # Swap back\n\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n result=[]\n permutation(0,nums,result)\n return result","runtime":"646"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n n = len(nums)\n\n def backtrack(currLeft, currPicked):\n nonlocal n\n if len(currPicked) == n:\n if currPicked not in res:\n res.append(currPicked[:])\n return\n for num in currLeft:\n newLeft = currLeft[:]\n newLeft.remove(num)\n newPicked = currPicked[:]\n newPicked.append(num)\n backtrack(newLeft, newPicked)\n return\n \n backtrack(nums, [])\n return res","runtime":"646"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n\n result = []\n used = [False] * len(nums) # Keep track of used elements\n\n def backtrack(index, current_permutation):\n if index == len(nums):\n if current_permutation not in result: # Check for uniqueness before adding\n result.append(current_permutation[:])\n return\n\n for i in range(len(nums)):\n if not used[i]:\n used[i] = True\n current_permutation.append(nums[i])\n backtrack(index + 1, current_permutation)\n current_permutation.pop()\n used[i] = False\n\n backtrack(0, [])\n return result","runtime":"654"},{"code":"class Solution:\n check = []\n ans = []\n def dfs(self, nums, temp, n):\n if n == 0:\n if temp not in self.ans:\n self.ans.append(temp[:])\n return\n for i in range(len(nums)):\n if self.check[i] == 1: continue\n self.check[i] = 1\n temp.append(nums[i])\n self.dfs(nums, temp, n-1)\n temp.pop()\n self.check[i] = 0\n\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n self.check = [0 for i in range(len(nums))]\n self.ans = []\n self.dfs(nums, [], len(nums))\n return self.ans","runtime":"654"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n cur = []\n ans = []\n n = len(nums)\n truth = [False for _ in range(n)]\n\n def backtrack():\n if len(cur) == n:\n if cur[:] not in ans:\n ans.append(cur[:])\n else:\n for i in range(n):\n if not truth[i]:\n cur.append(nums[i])\n truth[i] = True\n backtrack()\n cur.pop()\n truth[i] = False\n backtrack()\n \n\n return ans","runtime":"662"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n permutations = []\n n = len(nums)\n visited = [False] * n\n\n\n def backtrack(permutation, visited):\n if len(permutation) == n and permutation not in permutations :\n permutations.append(permutation.copy())\n return\n for i in range(n):\n if not visited[i]:\n permutation.append(nums[i])\n visited[i] = True\n backtrack(permutation, visited)\n permutation.pop()\n visited[i] = False\n\n\n backtrack([],visited)\n return permutations\n ","runtime":"662"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n def backtrack(path, used):\n if len(path) == len(nums) and path not in result:\n # print(path[:])\n result.append(path[:])\n return\n \n for i in range(len(nums)):\n if used[i]:\n continue\n # if i > 0 and nums[i] == nums[i - 1]:\n # continue\n \n path.append(nums[i])\n used[i] = True\n backtrack(path, used)\n path.pop()\n used[i] = False\n\n result = []\n used = [False] * len(nums)\n nums.sort()\n backtrack([], used)\n return result","runtime":"670"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n output = []\n n = len(nums)\n\n def dfs(nums, stack=[]):\n if len(stack) == n:\n if stack not in output:\n output.append(stack[:])\n return\n for idx in range(len(nums)):\n stack.append(nums[idx])\n dfs(nums[:idx] + nums[idx+1:], stack)\n stack.pop()\n \n dfs(nums)\n\n return output\n \n ","runtime":"670"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n def helper(curr, arr):\n if len(arr) == 0:\n if curr not in ans:\n ans.append(curr)\n return\n \n helper(curr + [arr[0]], arr[1:])\n for i in range(1, len(arr)):\n helper(curr + [arr[i]], arr[:i] + arr[i+1:])\n \n \n ans = []\n helper([], nums)\n return ans\n ","runtime":"678"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n def dfs(rem, path):\n nonlocal res\n if not rem:\n copy = path[:]\n if copy not in res:\n res.append(path[:])\n return\n\n for i in range(len(rem)):\n path.append(rem[i])\n dfs(rem[:i] + rem[i + 1:], path)\n path.pop()\n \n dfs(nums, [])\n return res","runtime":"678"}],"string":"[\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n # nums.sort()\\n def helper(i):\\n nonlocal nums\\n if i >= len(nums):\\n return [[]]\\n currPerms = set()\\n nextPerms = helper(i+1)\\n for perm in nextPerms:\\n for j in range(len(perm) + 1):\\n p = list(perm)\\n p.insert(j, nums[i])\\n currPerms.add(tuple(p))\\n return currPerms\\n return helper(0)\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n visited = [False] * len(nums)\\n ret = []\\n def recurs(output):\\n if len(output) == len(nums):\\n ret.append(output[:])\\n return\\n\\n for i in range(len(nums)):\\n if not visited[i] and (i==0 or nums[i]!=nums[i-1] or visited[i-1]):\\n visited[i] = True\\n output.append(nums[i])\\n recurs(output)\\n output.pop()\\n visited[i] = False\\n recurs([])\\n return ret\\n \\n\\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n nums = sorted(nums)\\n init_ind = {k for k in range(len(nums))}\\n def dfs(indices,path,c):\\n if c == len(nums):\\n res.append(path)\\n counter = 0\\n for ind in indices:\\n if counter > 0 and nums[ind] == nums[prev_ind]:\\n counter += 1\\n prev_ind = ind\\n continue\\n new_indices = {elt for elt in indices}\\n new_indices.discard(ind)\\n prev_ind = ind\\n counter += 1\\n dfs(new_indices,path + [nums[ind]],c+1)\\n dfs(init_ind,[],0)\\n return res\\n\\n \\n \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n # results = []\\n\\n # def backtrack(comb, counter):\\n # if len(comb) == len(nums):\\n # results.append(list(comb))\\n # return\\n\\n # for num in counter:\\n # if counter[num] > 0:\\n # comb.append(num)\\n # counter[num] -= 1\\n # backtrack(comb, counter)\\n # comb.pop()\\n # counter[num] += 1\\n # backtrack([], Counter(nums))\\n # return results\\n def backtrack(path, used):\\n # If the current path is a full permutation, add it to the result\\n if len(path) == len(nums):\\n res.append(path[:])\\n return\\n \\n # Iterate through the numbers\\n for i in range(len(nums)):\\n # Skip used numbers\\n if used[i]:\\n continue\\n # Skip duplicates: if nums[i] == nums[i-1] and nums[i-1] hasn't been used in this recursion level\\n if i > 0 and nums[i] == nums[i - 1] and not used[i - 1]:\\n continue\\n \\n # Mark the number as used and add it to the current path\\n used[i] = True\\n path.append(nums[i])\\n \\n # Recursively build the permutation\\n backtrack(path, used)\\n \\n # Backtrack: remove the last number and mark it as unused\\n path.pop()\\n used[i] = False\\n \\n # Sort the numbers to handle duplicates\\n nums.sort()\\n res = []\\n used = [False] * len(nums)\\n backtrack([], used)\\n return res\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n result = list()\\n path = list()\\n used = [0] * len(nums)\\n\\n nums.sort()\\n\\n def bt(used):\\n if len(path) == len(nums):\\n result.append(path[:])\\n return\\n\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i - 1] and used[i - 1] == 0 or used[i]:\\n continue\\n path.append(nums[i])\\n used[i] = 1\\n bt(used)\\n path.pop()\\n used[i] = 0\\n\\n bt(used)\\n\\n return result\\n\\n\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n def backtrack(curr, visited):\\n \\n if len(curr) == len(nums):\\n res.append(curr[:])\\n return\\n \\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i-1] and not visited[i-1]:\\n continue\\n if not visited[i]:\\n curr.append(nums[i])\\n visited[i] = True\\n backtrack(curr, visited)\\n curr.pop()\\n visited[i] = False\\n\\n res = []\\n nums.sort()\\n visited = [False]*len(nums)\\n backtrack([], visited)\\n return res\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n count={}\\n for i in nums:\\n count[i]=1+count.get(i,0)\\n res=[]\\n cur=[]\\n def dfs():\\n if len(cur)==len(nums):\\n res.append(cur.copy())\\n for i in count:\\n if count[i]>0:\\n cur.append(i)\\n count[i]-=1\\n dfs()\\n count[i]+=1\\n cur.pop()\\n\\n dfs()\\n return res\\n \",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n def backtrack(curr, res, nms):\\n if len(curr) == len(nums):\\n res.append(curr.copy())\\n return\\n here = set()\\n for i, n in enumerate(nms):\\n if n in here: continue\\n here.add(n)\\n curr.append(n)\\n new = nms.copy()\\n new.pop(i)\\n backtrack(curr, res, new)\\n curr.pop()\\n return\\n\\n res = []\\n backtrack([], res, nums)\\n return res\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n curr = []\\n count = Counter(nums)\\n\\n def dfs():\\n if len(curr) == len(nums):\\n res.append(curr[:])\\n \\n for n in count:\\n if count[n] > 0:\\n curr.append(n)\\n count[n] -= 1\\n\\n dfs()\\n\\n count[n] += 1\\n curr.pop()\\n dfs()\\n return res\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n res = []\\n used = [0 for i in range(len(nums))]\\n\\n def backtrack(cur): \\n if len(cur) == len(nums):\\n res.append(cur[:])\\n return\\n # print(used)\\n for i in range(len(nums)):\\n if used[i] == 1: # each element can only be used once\\n continue\\n if i > 0 and nums[i] == nums[i-1] and used[i-1] == 1: # skip duplicate, only process 1st encounter of each element\\n continue\\n used[i] = 1\\n cur.append(nums[i])\\n backtrack(cur)\\n used[i] = 0\\n cur.pop()\\n \\n backtrack([])\\n return res\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n from itertools import permutations\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n per=permutations(nums)\\n output=[]\\n for i in list(per):\\n output.append((i))\\n perU=set(output)\\n list(perU)\\n return perU\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n from itertools import permutations \\n dup_permutations = permutations(nums) \\n tup_permu = [tuple(permu) for permu in dup_permutations]\\n set_permu = set(tup_permu)\\n return [list(permu) for permu in set_permu]\\n # return permutations(nums)\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n perms = [[]]\\n\\n for n in nums:\\n nextPerms = []\\n for p in perms:\\n for i in range(len(p) + 1):\\n pCopy = p.copy()\\n pCopy.insert(i, n)\\n if pCopy not in nextPerms:\\n nextPerms.append(pCopy)\\n perms = nextPerms\\n return perms\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n from typing import List\\n\\n n = len(nums)\\n \\n nums.sort()\\n def backtrack(curr, permutations, visited):\\n if len(curr) == n:\\n permutations.append(curr)\\n return\\n\\n for i in range(n):\\n if i in visited:\\n continue\\n \\n # Skip duplicates: Ensure that nums[i] is only used once for the same position in this recursion level\\n if i > 0 and nums[i] == nums[i-1] and i-1 in visited:\\n continue\\n\\n backtrack(curr + [nums[i]], permutations, visited + [i])\\n\\n permutations = []\\n backtrack([], permutations, [])\\n return permutations\\n\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n comb, result = [], []\\n used = [False] * len(nums)\\n nums.sort()\\n\\n def backtrack():\\n if len(comb) == len(nums):\\n result.append(comb[:])\\n return\\n \\n for i in range(len(nums)):\\n if used[i] == True or (i and used[i-1] and nums[i] == nums[i-1]):\\n continue\\n comb.append(nums[i])\\n used[i] = True\\n backtrack()\\n comb.pop()\\n used[i] = False\\n \\n backtrack()\\n return result\\n\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n re = [[nums[0]]]\\n for i in range(1, len(nums)):\\n re = self.inser_after(re, nums[i])\\n return re\\n \\n def inser_after(self,arr, target):\\n re = []\\n for ele in arr:\\n\\n for i in range(len(ele) + 1):\\n cop = ele.copy()\\n cop.insert(i, target)\\n if cop not in re:\\n re.append(cop)\\n return re\\n\\n \\n \\n def CountFreq(self, nums):\\n freq = {}\\n for item in nums:\\n if item in freq:\\n freq[item] += 1\\n else:\\n freq[item] = 1\\n return freq\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n perms = [[]]\\n\\n nums.sort()\\n\\n n_i = 0\\n # insert each num at every possible position of each already existing perm to get new set of perms\\n while n_i < len(nums):\\n n = nums[n_i]\\n new_perms = []\\n for p in perms:\\n for i in range(len(p)+1):\\n pc = p.copy()\\n pc.insert(i, n)\\n new_perms.append(pc)\\n perms = new_perms\\n n_i += 1\\n\\n # filter duplicates\\n unique_perms = set()\\n final_perms = []\\n for p in perms:\\n if not tuple(p) in unique_perms:\\n final_perms.append(p)\\n unique_perms.add(tuple(p))\\n\\n return final_perms\\n\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n # revursive approach\\n\\n # def helper(i, nums):\\n # if i==len(nums):\\n # return [[]]\\n\\n # res=[]\\n # perms=helper(i+1, nums)\\n\\n # for p in perms:\\n # for j in range(len(p)+1):\\n # p_copy=p.copy()\\n # p_copy.insert(j, nums[i])\\n # res.append(p_copy)\\n # return res\\n\\n # unset= helper(0, nums)\\n # print(unset)\\n # unset=[tuple(i) for i in unset]\\n # yesset=set(unset)\\n\\n # return list(yesset)\\n\\n\\n # iterative approach\\n\\n # res=[]\\n # perms=[[]]\\n\\n # for i in range(len(nums)):\\n # new_perms=[]\\n # for p in perms:\\n # for j in range(len(p)+1):\\n # p_copy=p.copy()\\n # p_copy.insert(j, nums[i])\\n # new_perms.append(p_copy)\\n # perms=new_perms\\n\\n # # print(unset)\\n # unset=[tuple(i) for i in perms]\\n # yesset=set(unset)\\n\\n # return list(yesset)\\n\\n # backtracking\\n\\n def helper(i, nums):\\n if i==len(nums):\\n return [[]]\\n \\n res=[]\\n perms=helper(i+1, nums)\\n\\n for p in perms:\\n for j in range(len(p)+1):\\n p_copy=p.copy()\\n p_copy.insert(j, nums[i])\\n res.append(p_copy)\\n return res\\n\\n unset=helper(0, nums)\\n unset=[tuple(l) for l in unset]\\n return list(set(unset))\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n ans = set()\\n for perm in itertools.permutations(range(len(nums))):\\n curr = []\\n for idx in perm:\\n curr.append(nums[idx])\\n ans.add(tuple(curr))\\n \\n return list(map(list, list(ans)))\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n def backtrack(choices):\\n \\n if len(choices) == 1:\\n return [ [choices[0]] ]\\n \\n backtrackPerms = backtrack(choices[1:])\\n totalPerms = []\\n \\n for p in backtrackPerms:\\n for i in range(len(p) + 1):\\n pCopy = p.copy()\\n pCopy.insert(i, choices[0])\\n totalPerms.append(pCopy)\\n \\n return totalPerms\\n \\n permSet = set()\\n totalPerms = backtrack(nums)\\n res = []\\n \\n for i, p in enumerate(totalPerms):\\n if tuple(p) in permSet:\\n continue\\n \\n permSet.add(tuple(p))\\n res.append(p)\\n \\n return res\\n \\n \\n \\n# can backtrack to get all the permutations\\n# can iterate through the result and remove all duplicates by storing the its tuple in a set\\n\\n\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n self.n = len(nums)\\n ans = []\\n # seen = \\n def rec( vis, perm):\\n if len(perm)==self.n:\\n ans.append(perm)\\n seen = set()\\n for i in range(self.n):\\n if i in vis or nums[i] in seen:\\n continue\\n seen.add(nums[i])\\n tmp = copy.deepcopy(vis)\\n tmp.add(i)\\n rec(tmp, perm+[nums[i]])\\n rec(set(), [])\\n return ans\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n per=set(sorted(list(itertools.permutations(nums))))\\n return per\\n \",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n self.n = len(nums)\\n ans = []\\n def rec( vis, perm):\\n if len(perm)==self.n:\\n ans.append(perm)\\n seen = set()\\n for i in range(self.n):\\n if i in vis or nums[i] in seen:\\n continue\\n seen.add(nums[i])\\n tmp = copy.deepcopy(vis)\\n tmp.add(i)\\n rec(tmp, perm+[nums[i]])\\n rec(set(), [])\\n return ans\",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n # revursive approach\\n\\n # def helper(i, nums):\\n # if i==len(nums):\\n # return [[]]\\n\\n # res=[]\\n # perms=helper(i+1, nums)\\n\\n # for p in perms:\\n # for j in range(len(p)+1):\\n # p_copy=p.copy()\\n # p_copy.insert(j, nums[i])\\n # res.append(p_copy)\\n # return res\\n\\n # unset= helper(0, nums)\\n # print(unset)\\n # unset=[tuple(i) for i in unset]\\n # yesset=set(unset)\\n\\n # return list(yesset)\\n\\n\\n # iterative approach\\n\\n res=[]\\n perms=[[]]\\n\\n for i in range(len(nums)):\\n new_perms=[]\\n for p in perms:\\n for j in range(len(p)+1):\\n p_copy=p.copy()\\n p_copy.insert(j, nums[i])\\n new_perms.append(p_copy)\\n perms=new_perms\\n\\n # print(unset)\\n unset=[tuple(i) for i in perms]\\n yesset=set(unset)\\n\\n return list(yesset)\",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n nsize = len(nums)\\n\\n if nsize == 0:\\n return [[]]\\n \\n if nsize == 1:\\n return [[nums[0]]]\\n\\n if nsize == 2:\\n if nums[0] == nums[1]:\\n return [[nums[0],nums[1]]]\\n return [[nums[0],nums[1]],[nums[1],nums[0]]]\\n\\n \\n signatures = {}\\n for i in range(nsize):\\n newlist = nums.copy()\\n val = newlist.pop(i)\\n x = self.permuteUnique(newlist)\\n for tmp in x:\\n tmp.insert(0, val)\\n\\n signatures[tuple(tmp)] = tmp\\n\\n return signatures.values()\",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n def backtrack(path, used):\\n print('backtrack: Enter: ', path)\\n if len(path) == len(nums):\\n result.append(path[:])\\n return\\n for i in range(len(nums)):\\n # Skip duplicates: if the current element is the same as the previous one\\n # and the previous one has not been used in this path, skip this element.\\n print('i: ', i, ' used: ', used)\\n if i > 0 and nums[i] == nums[i - 1] and not used[i - 1]:\\n continue\\n if not used[i]:\\n used[i] = True\\n path.append(nums[i])\\n backtrack(path, used)\\n path.pop() # Backtrack\\n used[i] = False\\n\\n nums.sort() # Sort to handle duplicates\\n result = []\\n backtrack([], [False] * len(nums))\\n return result\\n\\n\",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n solnSet = set()\\n n = len(nums)\\n def helper(q: List[int], subNums: List[int]):\\n if not q and tuple(subNums) not in solnSet:\\n res.append(subNums.copy())\\n solnSet.add(tuple(subNums))\\n else:\\n ind = len(q)\\n while ind > 0:\\n num = q.pop(0)\\n subNums.append(num)\\n helper(q, subNums)\\n subNums.pop()\\n ind -= 1\\n q.append(num)\\n helper(nums, [])\\n return res\\n\\n\",\n \"runtime\": \"138\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n lst = [[i] for i in nums]\\n for i in range(len(nums)-1):\\n tmp_list = []\\n for n in nums:\\n for l in lst:\\n if nums.count(n) >= l.count(n)+1:\\n k = l + [n]\\n if k not in tmp_list:\\n tmp_list.append(k)\\n lst = tmp_list\\n return lst\",\n \"runtime\": \"138\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res=set()\\n def backtrack(start):\\n if start==len(nums):\\n res.add(tuple(nums))\\n return\\n for i in range(start,len(nums)):\\n nums[start],nums[i]=nums[i],nums[start]\\n backtrack(start+1)\\n nums[start],nums[i]=nums[i],nums[start]\\n\\n backtrack(0)\\n return [list(perm) for perm in res]\\n \",\n \"runtime\": \"146\"\n },\n {\n \"code\": \"class Solution:\\n def solve(self, data, start, end, results):\\n if start == end:\\n results.add(tuple(data))\\n else:\\n for i in range(start, end):\\n data[i], data[start] = data[start], data[i]\\n self.solve(data, start + 1, end, results)\\n data[i], data[start] = data[start], data[i]\\n\\n\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n results = set()\\n self.solve(nums, 0, len(nums), results)\\n unique_results = [list(x) for x in results]\\n return unique_results\",\n \"runtime\": \"146\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n ret = set()\\n def backtrack(remain, perm):\\n if not remain:\\n ret.add(tuple(perm))\\n else:\\n for i in range(0, len(remain)):\\n perm.append(remain.pop(i))\\n backtrack(remain, perm)\\n remain.insert(i, perm.pop())\\n backtrack(nums, [])\\n return ret\",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"class Solution:\\n\\n def solve(self, nums, ans, i):\\n if i==len(nums):\\n ans.add(tuple(nums[:]))\\n return\\n for j in range(i,len(nums)):\\n nums[j],nums[i] = nums[i],nums[j]\\n self.solve(nums,ans,i+1)\\n nums[j],nums[i] = nums[i],nums[j]\\n\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n ans = set()\\n self.solve(nums,ans,0)\\n return ans\",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n ans = set() # Use a set to store unique permutations\\n\\n def backtrack(arr, size, not_chosen):\\n nonlocal ans\\n if size == n: # When the current permutation is complete\\n ans.add(tuple(arr)) # Add a tuple version of the permutation to the set\\n return\\n for no in not_chosen:\\n # Create a new list excluding the current element `no`\\n next_not_chosen = not_chosen[:]\\n next_not_chosen.remove(no) # Remove the first occurrence of `no`\\n # Recursive call with the updated array and remaining elements\\n backtrack(arr + [no], size + 1, next_not_chosen)\\n\\n backtrack([], 0, nums[:]) # Initial call with an empty array\\n # Convert the set of tuples to a list of lists\\n ans = [list(t) for t in ans]\\n return ans\\n\",\n \"runtime\": \"163\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = set()\\n def dfs(cur, arr):\\n if len(arr) < 2:\\n fin = cur[:] + arr\\n res.add(tuple(fin))\\n return \\n\\n for i in range(len(arr)):\\n cur.append(arr[i])\\n dfs(cur, arr[:i] + arr[i+1:])\\n cur.pop()\\n return\\n dfs([], nums)\\n return res\",\n \"runtime\": \"163\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n\\n def backtrack(flag, path):\\n if len(path) == n:\\n result.add(tuple(path))\\n return\\n\\n for i in range(n):\\n if flag[i]:\\n continue\\n\\n path.append(nums[i])\\n flag[i] = True\\n backtrack(flag, path)\\n flag[i] = False\\n path.pop()\\n\\n result = set()\\n flag = [False] * n\\n path = []\\n backtrack(flag, path)\\n return result\\n\\n\\n \",\n \"runtime\": \"171\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = set()\\n length = len(nums)\\n def dfs(visited, cur_path, nums):\\n if len(cur_path) == length:\\n res.add(tuple(cur_path))\\n return\\n for i in range(length):\\n if not visited[i]:\\n cur_path.append(nums[i])\\n visited[i] = True\\n dfs(visited, cur_path, nums)\\n visited[i] = False\\n cur_path.pop()\\n dfs([False for i in range(length)], [], nums)\\n return list(res)\",\n \"runtime\": \"171\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n ret = set()\\n def backtrack(remain, perm):\\n if not remain:\\n ret.add(tuple(perm))\\n else:\\n for i in range(0, len(remain)):\\n\\n perm.append(remain[i])\\n del remain[i]\\n backtrack(remain, perm)\\n remain.insert(i, perm.pop())\\n\\n backtrack(deque(nums), [])\\n return ret\\n\\n\",\n \"runtime\": \"179\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = set()\\n # res = []\\n encountered = []\\n def perm(idx):\\n if idx == len(nums) and nums not in encountered:\\n res.add(tuple(nums[:]))\\n # res.append(nums[:])\\n # encountered.append(nums[:])\\n for i in range(idx, len(nums)):\\n nums[idx], nums[i] = nums[i], nums[idx]\\n perm(idx + 1)\\n nums[idx], nums[i] = nums[i], nums[idx]\\n perm(0)\\n return [list(r) for r in res]\\n # return res\",\n \"runtime\": \"179\"\n },\n {\n \"code\": \"class Solution:\\n every=set()\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n self.every=set()\\n complete=self.permute(nums)\\n for i in range(len(complete)):\\n self.every.add(tuple(complete[i]))\\n solution=[]\\n for val in self.every:\\n solution.append(val)\\n return solution\\n \\n \\n return None\\n \\n def permute(self,nums:List[int]) -> List[List[int]]:\\n numbers=[]\\n if len(nums)==0:\\n return [[]]\\n if len(nums)==1:\\n return [nums]\\n if len(nums)==2:\\n return [[nums[0],nums[1]],[nums[1],nums[0]]]\\n sol=[]\\n for i in range(len(nums)):\\n if i==0:\\n sol=self.permute(nums[1:len(nums)])\\n \\n if i==len(nums)-1:\\n sol=self.permute(nums[0:len(nums)-1])\\n \\n if i>0 and i<len(nums)-1:\\n x=nums[0:i]\\n y=nums[i+1:len(nums)]\\n x.extend(y)\\n sol=self.permute(x)\\n for j in range(len(sol)):\\n x=sol[j]\\n x.append(nums[i])\\n numbers.append(x)\\n return numbers\",\n \"runtime\": \"187\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n l=len(nums)\\n r=set()\\n\\n def bkt(comb,idxs):\\n\\n if len(comb)==l: \\n r.add(tuple(comb))\\n\\n\\n for nidx in idxs:\\n comb.append(nums[nidx])\\n idxscopy = idxs[:]\\n idxscopy.remove(nidx)\\n bkt(comb[:],idxscopy)\\n comb.pop()\\n \\n bkt([],list(range(l)))\\n\\n return r\\n\",\n \"runtime\": \"187\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n cache = set()\\n def backtrack(ans, nums):\\n if len(nums) == 0:\\n if tuple(ans) not in cache:\\n cache.add(tuple(ans))\\n res.append(ans)\\n return\\n for i in range(len(nums)):\\n backtrack(ans + [nums[i]], nums[:i] + nums[i + 1:])\\n backtrack([], nums)\\n return list(res)\",\n \"runtime\": \"195\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n uniques = set()\\n\\n def _recurse(picked: list[int], remaining: list[int]):\\n # print(picked, remaining)\\n if not remaining:\\n uniques.add(tuple(picked))\\n return\\n\\n for i, r in enumerate(remaining):\\n new_picked = picked + [r]\\n new_remaining = remaining[:i] + remaining[i+1:]\\n _recurse(new_picked, new_remaining)\\n\\n _recurse([], nums)\\n\\n return [list(x) for x in uniques]\\n\\n\",\n \"runtime\": \"195\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n N = len(nums)\\n seen = [0] * N\\n sols = set()\\n def rec(cur_l):\\n if len(cur_l) == N:\\n sols.add(tuple(cur_l[:]))\\n return\\n for i in range(N):\\n if seen[i] == 0:\\n cur_l.append(nums[i])\\n seen[i] = 1\\n rec(cur_l)\\n cur_l.pop()\\n seen[i] = 0\\n rec([])\\n return list(sols)\\n\",\n \"runtime\": \"204\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = set()\\n\\n def dfs(nums, path):\\n if not nums:\\n res.add(tuple(path))\\n else:\\n for i in range(len(nums)):\\n dfs(nums[:i]+nums[i+1:], path+[nums[i]])\\n \\n dfs(nums, [])\\n return res\",\n \"runtime\": \"204\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n def dfs(nums,res,path=[]):\\n if len(nums)==0:\\n res.add(tuple(path))\\n return\\n for i in range(len(nums)):\\n dfs(nums[:i]+nums[i+1:],res,path+[nums[i]])\\n return\\n res=set()\\n dfs(nums,res)\\n return res\",\n \"runtime\": \"212\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n res_cache = set()\\n\\n def permute_rec(index = 0) -> None:\\n if index == len(nums):\\n if str(nums) not in res_cache:\\n res.append(list(nums))\\n res_cache.add(str(nums))\\n return\\n\\n for i in range(index, len(nums)):\\n nums[i], nums[index] = nums[index], nums[i]\\n permute_rec(index + 1)\\n nums[i], nums[index] = nums[index], nums[i]\\n \\n permute_rec()\\n return res\",\n \"runtime\": \"212\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n ans = set()\\n included_arr = [False] * len(nums)\\n self.helper([],included_arr,nums,ans)\\n return [list(tup) for tup in ans]\\n\\n def helper(self,cur_arr,included_arr,nums,ans):\\n if len(cur_arr) == len(nums):\\n ans.add(tuple(cur_arr))\\n return\\n for i in range(len(nums)):\\n if included_arr[i] == False:\\n included_arr[i] = True\\n cur_arr.append(nums[i])\\n self.helper(cur_arr,included_arr,nums,ans)\\n included_arr[i] = False\\n cur_arr.pop()\",\n \"runtime\": \"220\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n\\n result = set()\\n templist = {}\\n self.helper(nums, templist, result)\\n return result\\n\\n def helper(self, nums, templist, result):\\n\\n if len(templist) == len(nums):\\n values_list = list(templist.values())\\n result.add(tuple(values_list))\\n return\\n\\n for i in range(len(nums)):\\n\\n if i not in templist:\\n templist[i] = nums[i]\\n self.helper(nums, templist, result)\\n del templist[i]\\n return \\n \",\n \"runtime\": \"220\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n # [1,2,3]\\n \\n ans = set()\\n n = len(nums)\\n \\n def helper(i, current):\\n #print(i, current)\\n if i >= n:\\n ans.add(current)\\n return\\n \\n for j in range(len(current)+1):\\n \\n helper(i+1, tuple(current[k] if k < j else nums[i] if k == j else current[k-1] for k in range(len(current)+1)))\\n helper(0, tuple())\\n return ans\",\n \"runtime\": \"228\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = set()\\n\\n def bt(temp, remain):\\n if remain == []:\\n res.add(tuple(temp[:]))\\n return\\n for i in range(len(remain)):\\n bt(temp+[remain[i]], remain[:i]+remain[i+1:])\\n bt([], nums)\\n \\n res = list(res)\\n for i in range(len(res)):\\n res[i] = list(res[i])\\n\\n return res\",\n \"runtime\": \"228\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n l = []\\n def dfs(sub, List):\\n if len(sub) == len(nums):\\n l.append(sub)\\n return\\n if List:\\n for i in range(len(List)):\\n dfs(sub+[List[i]], List[i+1:]+List[:i])\\n\\n dfs([], nums)\\n unique_subsets = set(tuple(sublist) for sublist in l)\\n l = [list(subset) for subset in unique_subsets]\\n\\n return l\",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n def backtrack(curr, ibag):\\n if len(curr) == target:\\n ans.add(tuple(curr))\\n return\\n \\n for index in range(target):\\n if index not in ibag:\\n ibag.add(index)\\n curr.append(nums[index])\\n backtrack(curr, ibag)\\n ibag.remove(index)\\n curr.pop()\\n \\n ans = set()\\n target = len(nums)\\n backtrack([], set())\\n arrans = [list(k) for k in ans]\\n return ans\",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 1:\\n return {(nums[0],)}\\n\\n results = set()\\n for idx, item in enumerate(nums):\\n excluded_array = [\\n subitem\\n for subidx, subitem in enumerate(nums)\\n if subidx != idx\\n ]\\n for subresult in self.permute(excluded_array):\\n results.add((item,) + subresult)\\n return results\\n\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n return list(self.permute(nums))\\n\",\n \"runtime\": \"244\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n\\n if len(nums) == 1:\\n return [nums[:]]\\n\\n for i in range(len(nums)):\\n n = nums.pop(0)\\n perms = self.permuteUnique(nums)\\n\\n for perm in perms:\\n perm.append(n)\\n for i in perms:\\n if i not in res: res.append(i)\\n nums.append(n)\\n return res\\n\",\n \"runtime\": \"253\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n def helper(ind,ds):\\n if len(ds) == len(nums):\\n ans.append(tuple(ds[:]))\\n return\\n \\n for i in range(len(nums)):\\n if d[i] == False:\\n d[i] = True\\n ds.append(nums[i])\\n helper(i,ds)\\n d[i] = False\\n ds.pop()\\n \\n\\n d = defaultdict(bool)\\n ans = []\\n ds = []\\n helper(0,ds)\\n return list(set(ans))\\n \",\n \"runtime\": \"253\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n answer = set()\\n def backtrack(permutation, indices):\\n if len(permutation) == len(nums):\\n answer.add(tuple(permutation[:]))\\n return\\n \\n for i, num in enumerate(nums):\\n if i not in indices:\\n permutation.append(nums[i])\\n indices.add(i)\\n backtrack(permutation, indices)\\n permutation.pop()\\n indices.remove(i)\\n \\n backtrack([], set()) \\n return [list(i) for i in answer]\",\n \"runtime\": \"261\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) <= 1:\\n return [nums]\\n ans = []\\n for i, x in enumerate(nums):\\n next = self.permuteUnique(nums[:i] + nums[i+1:])\\n for rest in next:\\n a = [x]\\n a.extend(rest)\\n if a not in ans:\\n ans.append(a)\\n return ans\\n\\n\",\n \"runtime\": \"261\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n final_res = []\\n visited = set()\\n def rec(start, curr, visited):\\n if len(curr) == len(nums):\\n final_res.append(tuple(curr.copy()))\\n return\\n if start >= len(nums):\\n return\\n \\n for i in range(0, len(nums)):\\n if i not in visited:\\n visited.add(i)\\n curr.append(nums[i])\\n rec(start + 1, curr , visited)\\n curr.pop()\\n visited.remove(i)\\n else:\\n continue\\n rec(0, [], set())\\n return set(final_res)\",\n \"runtime\": \"269\"\n },\n {\n \"code\": \"class Solution:\\n def gen(self, acc, seen):\\n if len(acc) == len(self.nums):\\n if str(acc) not in self.dupes:\\n self.dupes.add(str(acc))\\n self.ans.append(acc[:])\\n for i in range(len(self.nums)):\\n if not seen[i]:\\n seen[i] = True\\n acc.append(self.nums[i])\\n self.gen(acc, seen)\\n acc.pop()\\n seen[i] = False\\n\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n seen = [False for i in range(len(nums))]\\n self.ans = []\\n self.nums = nums\\n self.dupes = set()\\n self.gen([], seen)\\n return self.ans\",\n \"runtime\": \"269\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n counts = Counter(nums)\\n ans = []\\n def backtrack(curr, used): \\n if len(curr) == len(nums):\\n ans.append(curr[:])\\n return\\n \\n for i in range(len(nums)):\\n if i not in used:\\n used.append(i)\\n curr.append(nums[i])\\n backtrack(curr, used)\\n used.pop()\\n curr.pop()\\n \\n backtrack([],[])\\n ans = [tuple(ls) for ls in ans]\\n ans = set(ans)\\n ans = [list(tup) for tup in ans]\\n return ans\",\n \"runtime\": \"277\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n def permuteLst(nums, currPerm):\\n if not(nums):\\n return [currPerm]\\n perms = []\\n for num in nums:\\n unused = list(nums)\\n unused.remove(num)\\n for perm in permuteLst(unused, currPerm + [num]):\\n if perm not in perms:\\n perms.append(perm)\\n return perms\\n\\n return permuteLst(nums, [])\\n\\n \",\n \"runtime\": \"277\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n cur = []\\n ans = []\\n n = len(nums)\\n truth = [False for _ in range(n)]\\n print(truth)\\n\\n def backtrack():\\n if len(cur) == n:\\n ans.append(cur[:])\\n else:\\n for i in range(n):\\n if not truth[i]:\\n cur.append(nums[i])\\n truth[i] = True\\n backtrack()\\n cur.pop()\\n truth[i] = False\\n backtrack()\\n usedNumbers = set()\\n for i in ans:\\n curSum = 1\\n multiplier = 1\\n for j in i:\\n curSum = curSum*multiplier + j\\n multiplier *= 10\\n if curSum not in usedNumbers:\\n usedNumbers.add(curSum)\\n cur.append(i)\\n \\n\\n return cur\",\n \"runtime\": \"285\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n def dfs(path, took):\\n if len(path) == len(nums):\\n res.append(path.copy())\\n return \\n\\n for i in range(0, len(nums)):\\n # if i > 0 and nums[i] == nums[i-1]:\\n # continue\\n if i in took:\\n continue\\n took.add(i)\\n path.append(nums[i])\\n dfs(path, took)\\n took.remove(i)\\n path.pop()\\n\\n dfs([],set())\\n set_res = set([tuple(r) for r in res])\\n ans = [list(t) for t in set_res]\\n # print(ans)\\n return ans\\n\\n\",\n \"runtime\": \"285\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 1:\\n return [nums]\\n l = []\\n for i in range(len(nums)):\\n element = nums[i]\\n remaining = nums[:i] + nums[i+1:]\\n perms = self.permuteUnique(remaining)\\n for perm in perms:\\n l.append(perm + [element])\\n k = []\\n for i in l:\\n if i not in k:\\n k.append(i)\\n return k\\n \",\n \"runtime\": \"294\"\n },\n {\n \"code\": \"class Solution:\\n def permute(self, num, nums):\\n print(f\\\"in: {num} ; {nums}\\\")\\n if len(nums) == 1:\\n permutations = [[nums[0], num], [num, nums[0]]]\\n return permutations\\n cur_num = nums[-1]\\n permutations = self.permute(cur_num, nums[:-1])\\n print(f\\\"permutations: {permutations}\\\")\\n for permutation in permutations:\\n# if num not in permutation:\\n permutation.append(num)\\n print(f\\\"out: {permutations}\\\")\\n return permutations\\n\\n def _permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 1:\\n return [nums]\\n out_permutations = []\\n # remove each digit, get other permutations recursively, add digit back\\n for idx in range(len(nums)):\\n # print(\\\"nums: \\\", nums)\\n # print(\\\"idx: \\\", idx)\\n others = nums[:idx] + nums[idx+1 : ]\\n # print(\\\"others: \\\", others)\\n permutations = self._permuteUnique(others)\\n # print(\\\"permutations: \\\", permutations)\\n cur_num = nums[idx]\\n for p in permutations:\\n # add current number to known permutations\\n out_permutations.append(p + [cur_num])\\n return out_permutations\\n \\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n permutations = self._permuteUnique(nums)\\n _permutations = [tuple(p) for p in permutations]\\n return list(set(_permutations))\\n \\n permutations = []\\n if len(nums) == 1:\\n return [nums]\\n for i in range(0, len(nums)):\\n print(f\\\"i: {i}\\\")\\n # i=1 -> nums[0], nums[:0] + nums[1:]\\n # i=2 -> nums[1], nums[:1] + nums[2:]\\n # i=3 -> nums[2], nums[:2] + nums[3:]\\n _nums = []\\n if i > 0:\\n _nums.extend(nums[:i])\\n if i < len(nums):\\n _nums.extend(nums[i+1:])\\n print(f\\\"_nums: {_nums}\\\")\\n cur_permutations = self.permute(nums[i], _nums)\\n permutations.extend(cur_permutations)\\n _permutations = [tuple(p) for p in permutations]\\n return list(set(_permutations))\",\n \"runtime\": \"294\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 1:\\n return [nums]\\n l = []\\n for i in range(len(nums)):\\n element = nums[i]\\n remaining = nums[:i] + nums[i+1:]\\n perms = self.permuteUnique(remaining)\\n for perm in perms:\\n l.append(perm + [element])\\n k = []\\n for i in l:\\n if i not in k:\\n k.append(i)\\n return k\",\n \"runtime\": \"302\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n result = {}\\n def backtrack(next, candidates):\\n nonlocal result, nums\\n if len(next) == len(nums): \\n n = \\\"\\\".join(map(str, next))\\n if n not in result:\\n result[n] = next[:]\\n return\\n for i, c in enumerate(candidates):\\n next.append(c)\\n backtrack(next, candidates[:i]+candidates[i+1:])\\n next.pop()\\n backtrack([], nums)\\n return result.values()\\n \",\n \"runtime\": \"302\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n def backtrack(curr, dictionary):\\n if len(curr) == len(nums):\\n ans.append(curr[:])\\n\\n for i in range(len(nums)):\\n # TODO - determine conditional for adding, backtracking, and popping\\n # need to iterate/mark the position instead?\\n # thinking let's use a dict - each key is index, value is actual value. check if key is present.\\n if i not in dictionary:\\n dictionary[i] = nums[i]\\n curr.append(nums[i])\\n backtrack(curr, dictionary)\\n del dictionary[i]\\n curr.pop()\\n\\n ans = []\\n backtrack([], {})\\n ans_set = set(tuple(x) for x in ans)\\n returned_list = [ list(x) for x in ans_set ]\\n return returned_list\",\n \"runtime\": \"310\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums) \\n curr = []\\n permutation_indices = []\\n def recurse():\\n if len(curr) == n:\\n permutation_indices.append(curr[:])\\n return\\n for i in range(n):\\n if i in curr:\\n continue\\n curr.append(i)\\n recurse()\\n curr.pop()\\n\\n recurse()\\n res = list(set([tuple([nums[idx] for idx in perm]) for perm in permutation_indices]))\\n return res\",\n \"runtime\": \"310\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n ans = []\\n seen = set()\\n visited = set()\\n def recur(arr , n):\\n if len(arr) == n and tuple(arr) not in visited:\\n ans.append(arr[:])\\n visited.add(tuple(arr))\\n return \\n\\n for i in range(len(nums)):\\n if i not in seen :\\n seen.add(i)\\n recur(arr+[nums[i]],n)\\n seen.remove(i)\\n\\n return \\n\\n recur([],n)\\n return ans\",\n \"runtime\": \"318\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n out = set()\\n outArr = []\\n n = len(nums)\\n\\n def buildPermutations(curr, idx, length):\\n curr_tupe = tuple(curr)\\n if length == n and curr_tupe not in out:\\n out.add(curr_tupe)\\n outArr.append(curr)\\n return\\n \\n for i in range(len(nums)):\\n if i not in idx:\\n idx.add(i)\\n buildPermutations(curr+[nums[i]], idx, length+1)\\n idx.remove(i)\\n \\n indices = set()\\n buildPermutations([], indices, 0)\\n return outArr\",\n \"runtime\": \"318\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n def recPerm(arr: List[int]) -> Set[Tuple[int, ...]]:\\n if len(arr) == 1:\\n return {(arr[0], )}\\n\\n perms = set()\\n for i in range(len(arr)):\\n c = arr[i]\\n rest = arr[:i] + arr[i+1:]\\n perms = perms.union({tuple([c] + list(e)) for e in recPerm(rest)})\\n return perms\\n\\n return recPerm(nums)\\n\\n \",\n \"runtime\": \"326\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n permutations = set()\\n \\n def dfs(cur):\\n if len(cur) == len(nums):\\n permutations.add(tuple(nums[idx] for idx in cur))\\n return\\n \\n for idx, num in enumerate(nums):\\n if idx not in cur:\\n cur.append(idx)\\n dfs(cur)\\n cur.pop()\\n \\n dfs([])\\n return [list(x) for x in permutations]\",\n \"runtime\": \"326\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n\\n if len(nums) == 1:\\n return [nums]\\n\\n permutations = []\\n for i,e in enumerate(nums):\\n permutations.extend([[e] + p for p in self.permuteUnique(nums[:i] + nums[i + 1:])])\\n\\n return [list(p) for p in set([tuple(p) for p in permutations])]\\n \",\n \"runtime\": \"335\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: list[int]) -> list[list[int]]:\\n res = set()\\n self.backtrack(res, nums, 0, [], set())\\n return [list(i) for i in res]\\n\\n def backtrack(\\n self,\\n res: set,\\n nums: list[int],\\n idx: int,\\n curSubset: list[int],\\n numSet: set,\\n ):\\n if len(curSubset) == len(nums):\\n res.add(tuple(curSubset.copy()))\\n return\\n for i in range(len(nums)):\\n if (i, nums[i]) in numSet:\\n continue\\n curSubset.append(nums[i])\\n numSet.add((i, nums[i]))\\n self.backtrack(res, nums, i, curSubset, numSet)\\n numSet.remove((i, nums[i]))\\n curSubset.pop()\",\n \"runtime\": \"335\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = set()\\n def backtrack(acc):\\n if len(acc) == len(nums):\\n _res = []\\n for idx in acc:\\n _res.append(nums[idx])\\n res.add(tuple(_res))\\n \\n for idx in range(len(nums)):\\n if idx not in acc:\\n acc.append(idx)\\n backtrack(acc)\\n acc.pop()\\n \\n backtrack([])\\n return res\",\n \"runtime\": \"343\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n def backtrack(nums):\\n if len(nums) <= 1:\\n return [nums]\\n results = []\\n for i, num in enumerate(nums):\\n rest = nums[:i] + nums[i+1:]\\n subresults = backtrack(rest)\\n results.extend([[num] + subres for subres in subresults])\\n return results\\n res = backtrack(nums)\\n res = set([tuple(elem) for elem in res])\\n return res\\n\",\n \"runtime\": \"343\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUniqueR(self, n, nums: List[int], k: int, createdArray: List[int], resultSet):\\n notUsedIndexes = []\\n for i in range(0, n):\\n if(createdArray[i] == 1000):\\n notUsedIndexes.append(i)\\n if(len(notUsedIndexes) == 0):\\n resultSet.add(','.join(map(str, createdArray)))\\n return resultSet\\n\\n # print('--', createdArray, notUsedIndexes)\\n\\n for i in notUsedIndexes:\\n createdArray[i] = nums[k]\\n resultSet = self.permuteUniqueR(n, nums, k+1, createdArray, resultSet)\\n createdArray[i] = 1000\\n \\n return resultSet\\n\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n createdArray = [1000] * n\\n resultSet = set()\\n resultSet = self.permuteUniqueR(n, nums, 0, createdArray, resultSet)\\n rspList = []\\n for resultStr in resultSet:\\n strList = resultStr.split(',')\\n intList = [int(numeric_string) for numeric_string in strList]\\n rspList.append(intList)\\n \\n return rspList\",\n \"runtime\": \"351\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n def backtrack(cur):\\n if len(cur) == len(nums):\\n res.add(tuple([nums[i] for i in cur]))\\n\\n for i in range(len(nums)):\\n if i not in cur:\\n cur.append(i)\\n backtrack(cur)\\n cur.pop()\\n\\n res = set()\\n backtrack([])\\n return [list(tup) for tup in res]\\n\\n \",\n \"runtime\": \"351\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n seen = set()\\n def dfs(currPath, nums, fin):\\n if len(currPath) == fin:\\n curr = \\\"\\\".join(str(x) for x in currPath)\\n if not curr in seen:\\n seen.add(curr)\\n res.append(currPath)\\n return\\n for i in range(len(nums)):\\n dfs(currPath + [nums[i]], nums[:i] + nums[i + 1:], fin)\\n dfs([], nums, len(nums))\\n return res\",\n \"runtime\": \"359\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res=set()\\n def per(nm: List[int],x: List[int]) -> None:\\n if nm ==[]:\\n aa=\\\"\\\"\\n for i in x:\\n aa+=str(i)+\\\"*\\\"\\n res.add(aa)\\n else:\\n for i in range(len(nm)): \\n nmc=nm[:i]+nm[i+1:]\\n xx=x.copy()\\n xx.append(nm[i])\\n per(nmc,xx)\\n per(nums,[])\\n r=[]\\n for i in res:\\n a=i.split('*')\\n a.pop()\\n b=[]\\n for j in a:\\n b.append(int(j))\\n r.append(b)\\n return r\",\n \"runtime\": \"359\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n ans = []\\n def bactracking(visited_l: List[int], visited_s: List[int]) -> None:\\n if len(visited_l) == len(nums):\\n ans.append(visited_l)\\n return\\n for i in range(len(nums)):\\n if i not in visited_s:\\n bactracking(visited_l + [i], visited_s | {i})\\n \\n bactracking([], set())\\n return set(map(lambda arr: tuple(map(lambda i: nums[i], arr)), ans))\\n \",\n \"runtime\": \"367\"\n },\n {\n \"code\": \"import math\\n\\n\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n index = 2 ** (len(nums)) - 1\\n n = len(nums)\\n\\n\\n def bits(n):\\n while n:\\n b = n & (~n + 1)\\n yield b\\n n ^= b\\n\\n\\n def permute(index: int):\\n if index.bit_count() == 1:\\n return [(nums[int(math.log2(index))], )]\\n permutations = []\\n for b in bits(index):\\n permutations += [\\n (nums[int(math.log2(b))], ) + permutation\\n for permutation in permute(index - b)\\n ]\\n return permutations\\n\\n return set(permute(index))\",\n \"runtime\": \"367\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n seen = set()\\n def dfs(currPath, nums, fin):\\n if len(currPath) == fin:\\n curr = \\\"\\\".join(str(x) for x in currPath)\\n if not curr in seen:\\n seen.add(curr)\\n res.append(currPath)\\n return\\n for i in range(len(nums)):\\n dfs(currPath + [nums[i]], nums[:i] + nums[i + 1:], fin)\\n dfs([], nums, len(nums))\\n return res\",\n \"runtime\": \"375\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n ans = []\\n vis = set()\\n def recur(index, arr):\\n # print(index, arr, ans)\\n if len(arr) == len(nums):\\n temp = [nums[i] for i in arr]\\n if tuple(temp) not in vis:\\n ans.append(temp)\\n vis.add(tuple(temp))\\n return\\n for i in range(len(nums)):\\n if i in arr:\\n continue\\n recur(i + 1, arr + [i])\\n \\n recur(0, [])\\n # print(ans)\\n return ans\",\n \"runtime\": \"375\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n lst=[]\\n a=[]\\n if len(nums)==1:\\n return [nums[:]]\\n \\n for i in range(len(nums)):\\n n=nums.pop(0)\\n \\n perms=self.permuteUnique(nums)\\n print(perms)\\n for perm in perms:\\n perm.append(n)\\n \\n if n not in a:\\n lst.extend(perms)\\n \\n nums.append(n)\\n\\n a.append(n)\\n\\n return lst\",\n \"runtime\": \"384\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n if not nums:\\n return []\\n if len(nums) == 1:\\n return [nums]\\n res = set()\\n for i, num in enumerate(nums):\\n sub_problems = self.permuteUnique([nums[j] for j in range(len(nums)) if i != j])\\n res.update(set([tuple([num] + list(ans)) for ans in sub_problems]))\\n return res\",\n \"runtime\": \"384\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n result = set()\\n\\n # start from an integer only once\\n def dfs(currList):\\n nonlocal result\\n if len(currList) == len(nums):\\n tmp = tuple([n for _, n in currList])\\n result.add(tmp)\\n return\\n \\n for i, num in enumerate(nums):\\n if (i, num) not in currList:\\n dfs(currList + [(i, num)])\\n \\n dfs([])\\n result = list(result)\\n return [list(t) for t in result]\\n\\\"\\\"\\\" \\n\\n\\n\\\"\\\"\\\"\",\n \"runtime\": \"392\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n if not nums:\\n return {()}\\n \\n sol = set()\\n for i, num in enumerate(nums):\\n rest = self.permuteUnique(nums[:i] + nums[i+1:])\\n sol.update(set((num,) + minisol for minisol in rest))\\n return sol\\n\",\n \"runtime\": \"392\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n def permHelper(nums):\\n if not nums:\\n return {()}\\n \\n sol = set()\\n for i, num in enumerate(nums):\\n rest = permHelper(nums[:i] + nums[i+1:])\\n sol.update(set((num,) + minisol for minisol in rest))\\n return sol\\n\\n return permHelper(nums)\",\n \"runtime\": \"400\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n answer_set = set()\\n\\n def traverse(nums: List[int], answer = List[int]):\\n nonlocal answer_set\\n if len(nums) == 0:\\n answer_set.add(tuple(answer))\\n return\\n\\n for i in range(len(nums)):\\n print(nums)\\n num = nums.pop(i)\\n answer.append(num)\\n traverse(nums, answer.copy())\\n nums.insert(i, answer.pop())\\n \\n traverse(nums, [])\\n return answer_set\\n\\n \",\n \"runtime\": \"400\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n # do indices? \\n # recursion? remaining nums?\\n # duplicates \\n \\n # get all permutations (indices), convert to a set \\n \\n # how to get permutations \\n \\n # recursive getPermutations calls. \\n # base case, return it \\n # \\n # [1, 2, 3]\\n # 1 \\n # [2, 3]\\n # 2 3 \\n # [3], [2]\\n # \\n def getPermutations(currList):\\n if len(currList) == 1:\\n return [currList]\\n \\n permutations = [] \\n for i in range(len(currList)):\\n startValue = currList[i] \\n remainList = currList[:i] + currList[i+1:]\\n newPermutations = getPermutations(remainList)\\n newPermutations = [[startValue] + permList for permList in newPermutations]\\n permutations.extend(newPermutations)\\n \\n return permutations\\n \\n allPermutations = [] \\n indexNums = [index for index, value in enumerate(nums)]\\n indexPermutations = getPermutations(indexNums)\\n \\n for permList in indexPermutations:\\n for i in range(len(permList)):\\n permList[i] = nums[permList[i]]\\n \\n valuePermutations = [tuple(permList) for permList in indexPermutations]\\n valuePermutations = set(valuePermutations)\\n valuePermutations = [list(permList) for permList in valuePermutations]\\n \\n \\n\\n return valuePermutations\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"408\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n N = len(nums)\\n\\n seen = set()\\n combos = []\\n def helper( picklist ):\\n if len(picklist) == N:\\n combo = [nums[picklist[i]] for i in range(N)]\\n nid = \\\"\\\".join([str(n) for n in combo])\\n if nid in seen:\\n return\\n seen.add(nid)\\n combos.append(combo)\\n return\\n\\n for i in range(N):\\n if i not in picklist:\\n picklist.append(i)\\n helper( picklist )\\n picklist.pop()\\n\\n helper(deque())\\n\\n return combos\\n \\n\\n \\n\\n \",\n \"runtime\": \"408\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n visited = set()\\n subsets = []\\n idxSubsets = []\\n res = []\\n def dfs():\\n if len(subsets) == len(nums) and \\\"\\\".join(map(str, subsets)) not in visited:\\n res.append(subsets.copy())\\n visited.add(\\\"\\\".join(map(str, subsets)))\\n return\\n \\n\\n for idx,i in enumerate(nums):\\n if idx in idxSubsets:\\n continue\\n subsets.append(i)\\n idxSubsets.append(idx)\\n dfs()\\n subsets.pop()\\n idxSubsets.pop()\\n dfs()\\n return res\",\n \"runtime\": \"416\"\n },\n {\n \"code\": \"class Solution:\\n def permute_support(self, nums: List[int]) -> List[List[int]]:\\n \\n if len(nums) == 1:\\n return [nums]\\n \\n ans = []\\n \\n for i in range(len(nums)):\\n arr1 = [nums[i]]\\n sub_arr = self.permuteUnique(nums[0:i]+nums[i+1:])\\n for arr in sub_arr:\\n ans.append(arr1+arr)\\n \\n return ans\\n\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n ans = self.permute_support(nums)\\n\\n \\n unique_ans = []\\n list_map = {}\\n\\n for arr in ans:\\n key = \\\"\\\"\\n for ele in arr:\\n key += str(ele)\\n \\n if key not in list_map:\\n unique_ans.append(arr)\\n list_map[key] = True\\n\\n\\n return unique_ans\\n\",\n \"runtime\": \"416\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n ls={}\\n def bt(nums,idx,vis,k):\\n vis=vis[:]\\n nums=nums[:]\\n k=k[:]\\n\\n if len(nums)==idx:\\n st=''\\n for i in k:\\n st=st+str(i)+','\\n ls[st]=1\\n return\\n \\n for i in range(len(nums)):\\n if not vis[i]:\\n vis[i]=True\\n bt(nums,idx+1,vis,k+[nums[i]])\\n vis[i]=False\\n bt(nums,0,[False for i in nums],[])\\n m=[]\\n for i in ls.keys():\\n m.append(map(int,i.split(',')[:-1]))\\n return m\",\n \"runtime\": \"425\"\n },\n {\n \"code\": \"class Solution:\\n def permute_support(self, nums: List[int]) -> List[List[int]]:\\n \\n if len(nums) == 1:\\n return [nums]\\n \\n ans = []\\n \\n for i in range(len(nums)):\\n arr1 = [nums[i]]\\n sub_arr = self.permuteUnique(nums[0:i]+nums[i+1:])\\n for arr in sub_arr:\\n ans.append(arr1+arr)\\n \\n return ans\\n\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n ans = self.permute_support(nums)\\n\\n \\n unique_ans = []\\n list_map = {}\\n\\n for arr in ans:\\n key = \\\"\\\"\\n for ele in arr:\\n key += str(ele)\\n \\n if key not in list_map:\\n unique_ans.append(arr)\\n list_map[key] = True\\n\\n\\n return unique_ans\\n\",\n \"runtime\": \"425\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n\\n\\n def backtrack(path):\\n if len(path) == len(nums):\\n perm = []\\n dupe = ''\\n for index in path:\\n num = nums[index]\\n dupe += str(num)\\n perm.append(num)\\n if dupe not in track:\\n track.add(dupe)\\n res.append(perm)\\n \\n for idx, num in enumerate(nums):\\n if idx not in path:\\n path.append(idx)\\n backtrack(path)\\n path.pop()\\n \\n track = set()\\n res = []\\n backtrack([])\\n return res\\n \",\n \"runtime\": \"433\"\n },\n {\n \"code\": \"from typing import List, Set\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n listo = []\\n if len(nums) == 1:\\n listo.append(nums)\\n return listo\\n for i in range(len(nums)):\\n new_list = []\\n item_to_remove = nums[i]\\n remaining_list = [nums[j] for j in range(len(nums)) if j != i]\\n # print(remaining_list)\\n recursions = self.permuteUnique(remaining_list)\\n for recursion in recursions:\\n another_list = []\\n another_list.append(item_to_remove)\\n another_list.extend(recursion)\\n listo.append(another_list)\\n unique_list = [item for k, item in enumerate(listo) if item not in listo[:k]]\\n return unique_list\\n\\n\",\n \"runtime\": \"441\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 1 :\\n return [nums]\\n S = []\\n for i in range(len(nums)) :\\n previous = self.permuteUnique(nums[:i] + nums[i+1:])\\n \\n for perm in previous :\\n S.append([nums[i]] + perm)\\n S.append(perm + [nums[i]])\\n \\n res = []\\n for perm in S :\\n if not perm in res :\\n res.append(perm)\\n \\n return res\",\n \"runtime\": \"441\"\n },\n {\n \"code\": \"import math\\n\\n\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n index = 2 ** (len(nums)) - 1\\n nums = sorted(nums)\\n n = len(nums)\\n\\n\\n def permute(index: int):\\n if index.bit_count() == 1:\\n return [[int(math.log2(index))]]\\n pList = []\\n for i in range(n):\\n if index & 2 ** i != 2 ** i:\\n continue\\n pList += [\\n [i] + permutation\\n for permutation in permute(index - 2 ** i)\\n ]\\n return pList\\n\\n permutatedIndices = permute(index)\\n return set([\\n tuple([nums[i] for i in permutatedIndex])\\n for permutatedIndex in permutatedIndices\\n ])\",\n \"runtime\": \"449\"\n },\n {\n \"code\": \"import functools\\nimport math\\n\\n\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n index = 2 ** (len(nums)) - 1\\n nums = sorted(nums)\\n n = len(nums)\\n result = set()\\n\\n\\n def bits(n):\\n while n:\\n b = n & (~n + 1)\\n yield b\\n n ^= b\\n\\n\\n # @functools.lru_cache(None)\\n def permute(index: int):\\n if index.bit_count() == 1:\\n return [[int(math.log2(index))]]\\n pList = []\\n for b in bits(index):\\n pList += [\\n [int(math.log2(b))] + permutation\\n for permutation in permute(index - b)\\n ]\\n return pList\\n\\n permutatedIndices = permute(index)\\n return set([\\n tuple([nums[i] for i in permutatedIndex])\\n for permutatedIndex in permutatedIndices\\n ])\",\n \"runtime\": \"449\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res=[]\\n def backtrack(l):\\n if len(l) == len(nums):\\n res.append(list(nums[i] for i in l))\\n return None\\n for i in range(len(nums)):\\n if i not in l:\\n l.append(i)\\n backtrack(l)\\n l.pop()\\n\\n backtrack([])\\n s=set()\\n fl=[]\\n for i in res:\\n if \\\"\\\".join(str(i)) not in s:\\n fl.append(i)\\n s.add(\\\"\\\".join(str(i)))\\n return fl\",\n \"runtime\": \"457\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n class Tree(object):\\n def __init__(self, val):\\n self.val = val\\n self.neighbors = {}\\n combos = [[]]\\n root = Tree(None)\\n for _ in range(len(nums)):\\n new_combos = []\\n for i in range(len(nums)):\\n for c in combos:\\n if i not in c:\\n new_c = []\\n cur = root\\n for i_c in c:\\n new_c.append(i_c)\\n n = nums[i_c]\\n if n not in cur.neighbors:\\n cur.neighbors[n] = Tree(n)\\n cur = cur.neighbors[n]\\n if nums[i] not in cur.neighbors:\\n cur.neighbors[nums[i]] = Tree(nums[i])\\n new_c.append(i)\\n new_combos.append(new_c)\\n combos = new_combos\\n\\n # for c in combos:\\n # cur = root\\n # for i_c in c:\\n # n = nums[i_c]\\n # if n not in cur.neighbors:\\n # cur.neighbors[n] = Tree(n)\\n # cur = cur.neighbors[n]\\n final = []\\n q = [([], root)]\\n while q:\\n cur_li, cur_node = q.pop()\\n if len(cur_node.neighbors) == 0:\\n final.append(cur_li)\\n else:\\n for c, n in cur_node.neighbors.items():\\n q.append((cur_li+[c], n))\\n return final\\n \",\n \"runtime\": \"457\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n x=permutations(nums)\\n y=[]\\n for i in x:\\n if i not in y:\\n y.append(i)\\n return y\",\n \"runtime\": \"466\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n\\n\\n\\n main = []\\n\\n def permute(l, idx):\\n nonlocal main\\n\\n\\n if idx>=len(nums):\\n return \\n\\n if l not in main:\\n main.append(l.copy())\\n else:\\n print(idx)\\n print(l)\\n\\n for i in range(idx, len(nums)):\\n if i>idx and l[i]==l[idx]:\\n continue\\n\\n temp = l[i]\\n l[i] = l[idx]\\n l[idx] = temp\\n permute(l, idx+1)\\n temp = l[i]\\n l[i] = l[idx]\\n l[idx] = temp\\n \\n return\\n\\n nums.sort()\\n permute(nums.copy(), 0)\\n\\n return main\",\n \"runtime\": \"466\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n x=permutations(nums)\\n res=[]\\n for i in x:\\n if i not in res:\\n res.append(i)\\n return res\",\n \"runtime\": \"474\"\n },\n {\n \"code\": \"from itertools import permutations\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n for permutation in permutations(nums) :\\n if permutation not in res :\\n res.append(permutation)\\n return res\",\n \"runtime\": \"474\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n x = permutations(nums,len(nums))\\n ans = []\\n for i in x:\\n if(i not in ans):\\n ans.append(i)\\n return ans\\n \",\n \"runtime\": \"482\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n l = permutations(nums)\\n visited =[]\\n for i in l:\\n if i not in visited:\\n visited.append(i)\\n \\n return visited\\n\\n # res = set()\\n # n = len(nums)\\n # def dfs(cur, nums):\\n # if len(cur) == n:\\n # res.add(tuple(cur))\\n # return\\n # else:\\n # for i in range(len(nums)):\\n # dfs(cur+[nums[i]], nums[:i]+nums[i+1:])\\n # dfs([], nums)\\n # return res\\n \",\n \"runtime\": \"482\"\n },\n {\n \"code\": \"class Solution:\\n\\n def permutations(self, nums):\\n if len(nums) == 0 or len(nums) == 1:\\n return [nums]\\n l = []\\n for i in range(len(nums)):\\n first = nums[i]\\n remaining_list = nums[:i] + nums[i+1:]\\n for p in permuteUnique(remaining_list):\\n l.append([first] + p)\\n return l\\n\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n for p in permutations(nums):\\n if not p in res:\\n res.append(p)\\n return res\",\n \"runtime\": \"490\"\n },\n {\n \"code\": \"from itertools import permutations\\nclass Solution:\\n def permuteUnique(self, a: List[int]) -> List[List[int]]:\\n b=[]\\n c=[]\\n b=permutations(a)\\n [c.append(x) for x in b if x not in c]\\n return c\",\n \"runtime\": \"490\"\n },\n {\n \"code\": \"import itertools\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res=[]\\n permutations=list(itertools.permutations(nums))\\n for i in permutations:\\n if i in res:\\n continue\\n else:\\n res.append(i)\\n return res\\n \",\n \"runtime\": \"498\"\n },\n {\n \"code\": \"import itertools\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n l = list(itertools.permutations(nums))\\n l1 = []\\n for i in l:\\n if i not in l1:\\n l1.append(i)\\n return l1\\n \",\n \"runtime\": \"515\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.per_lis = [] # 初始化为实例变量\\n\\n def replace_duplicates_with_history(self, lst: List[int]):\\n new_list = [] # 存储替换后的列表\\n history = {} # 记录每个元素的替换历史\\n counter = max(lst) + 1 # 计数器，从当前最大元素的下一个整数开始\\n\\n for num in lst:\\n if num in history:\\n # 如果数字已经出现在历史中，将其替换为新的数字\\n new_list.append(counter)\\n history[num].append(counter)\\n counter += 1\\n else:\\n # 如果是第一次出现，保留原数字，并在历史中记录\\n new_list.append(num)\\n history[num] = [num]\\n\\n return new_list, history\\n\\n def recover_with_history(self, L: List[List[int]], history: dict):\\n # 构建反向映射字典，反转history字典中的键值对\\n reverse_mapping = {v: k for k, values in history.items() for v in values}\\n\\n # 使用反向映射来恢复原始列表\\n recovered_list = []\\n for sublist in L:\\n recovered_sublist = [reverse_mapping.get(item, item) for item in sublist]\\n recovered_list.append(recovered_sublist)\\n\\n return recovered_list\\n\\n def remain(self, lis: List[int], nums: List[int]):\\n return [x for x in nums if x not in lis]\\n\\n def done(self, l: List[int], nums: List[int]):\\n if len(l) == len(nums):\\n self.per_lis.append(l)\\n\\n def backtrack(self, current: List[int], nums: List[int]):\\n self.done(current, nums)\\n rem = self.remain(current, nums)\\n while rem:\\n x = rem.pop(0)\\n self.backtrack(current + [x], nums)\\n\\n def permute(self, nums: List[int]) -> List[List[int]]:\\n self.per_lis = [] # 确保每次调用 permute 时 per_lis 都是空的\\n self.backtrack([], nums)\\n return self.per_lis\\n\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n # 替换重复的数字，并得到替换后的新列表和替换历史\\n new_nums, history = self.replace_duplicates_with_history(nums)\\n \\n # 对替换后的新列表进行排列\\n permutations = self.permute(new_nums)\\n \\n # 恢复排列后的结果，并去重\\n recovered_permutations = self.recover_with_history(permutations, history)\\n \\n # 去重，确保只返回唯一的排列\\n unique_permutations = [list(x) for x in set(tuple(y) for y in recovered_permutations)]\\n \\n return unique_permutations\\n \",\n \"runtime\": \"515\"\n },\n {\n \"code\": \"class Solution:\\n def helper(self, nums_set: Set[int]) -> List[List[int]]:\\n if len(nums_set) == 0:\\n return [[]]\\n \\n res = []\\n for n in nums_set:\\n res += [[n] + p for p in self.helper(nums_set - {n})]\\n return res\\n \\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n # def permute(self, nums: List[int]) -> List[List[int]]:\\n indices_permutations = self.helper(set(range(len(nums))))\\n def get_permutation_from_indices(indices):\\n res = []\\n \\n for i in indices:\\n res.append(str(nums[i]))\\n res.append(\\\",\\\")\\n \\n if len(res) > 0:\\n res = res[:-1]\\n \\n return \\\"\\\".join(res)\\n \\n unique = {get_permutation_from_indices(ixs) for ixs in indices_permutations}\\n return [list(map(int, p.split(\\\",\\\"))) for p in unique]\\n \\n \",\n \"runtime\": \"523\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n result = set()\\n def run_recursion(sequence):\\n if len(sequence) == len(nums):\\n t = [nums[x] for x in sequence]\\n result.add(tuple(t))\\n return\\n \\n for i in range(len(nums)):\\n if i in set(sequence):\\n continue\\n\\n run_recursion(sequence + [i])\\n \\n for i in range(len(nums)):\\n run_recursion([i])\\n \\n return list(result)\",\n \"runtime\": \"523\"\n },\n {\n \"code\": \"class Solution:\\n from itertools import permutations\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n li=[]\\n for i in permutations(nums,len(nums)):\\n if list(i) not in li:\\n li.append(list(i))\\n return li\\n\\n \",\n \"runtime\": \"531\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n result = set()\\n\\n def permutations(index):\\n \\n if index == len(nums):\\n temp = copy.deepcopy(nums)\\n if tuple(temp) not in result:\\n result.add(tuple(temp))\\n else:\\n for i in range(index, len(nums)):\\n nums[i], nums[index] = nums[index], nums[i]\\n permutations(index + 1)\\n nums[i], nums[index] = nums[index], nums[i]\\n permutations(0)\\n return list(result)\\n \",\n \"runtime\": \"531\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n result = set()\\n def run_recursion(sequence):\\n if len(sequence) == len(nums):\\n t = [nums[x] for x in sequence]\\n result.add(tuple(t))\\n return\\n \\n for i in range(len(nums)):\\n if i in set(sequence):\\n continue\\n\\n run_recursion(sequence + [i])\\n \\n for i in range(len(nums)):\\n run_recursion([i])\\n \\n return list(result)\",\n \"runtime\": \"539\"\n },\n {\n \"code\": \"from itertools import permutations\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res=[]\\n for i in permutations(nums, len(nums)):\\n if list(i) not in res:\\n res.append(list(i))\\n return res\\n \",\n \"runtime\": \"539\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = set()\\n def backtrack(combo, n):\\n if(len(combo) == len(nums)):\\n res.add(tuple(combo.copy()))\\n return\\n else:\\n for i in range(len(n)):\\n val = n[i]\\n new_n = n[:i] + n[i+1:]\\n combo.append(val)\\n print(combo)\\n backtrack(combo.copy(), new_n.copy())\\n combo.pop()\\n backtrack([], nums)\\n return res\",\n \"runtime\": \"547\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n data = []\\n for i in itertools.permutations(nums):\\n if list(i) not in data:\\n data.append(list(i))\\n return data\",\n \"runtime\": \"547\"\n },\n {\n \"code\": \"import itertools\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n perms = list(itertools.permutations(nums))\\n result = []\\n for perm in perms:\\n if list(perm) not in result:\\n result.append(list(perm))\\n else:\\n pass\\n return result\",\n \"runtime\": \"556\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n a=list(permutations(nums))\\n b=[]\\n for i in a:\\n if list(i) in b:\\n continue\\n b.append(list(i)) \\n return b\",\n \"runtime\": \"556\"\n },\n {\n \"code\": \"from itertools import permutations\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n a=[list(i) for i in permutations(nums)]\\n b=[]\\n for i in a:\\n if i not in b:\\n b.append(i)\\n return b\",\n \"runtime\": \"564\"\n },\n {\n \"code\": \"from itertools import permutations\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res=[]\\n for i in list(permutations(nums)):\\n x=list(i)\\n if x not in res:\\n res.append(x)\\n return res\",\n \"runtime\": \"564\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n import itertools\\n perms = [list(a) for a in itertools.permutations(nums)]\\n a = []\\n [a.append(perm) for perm in perms if perm not in a]\\n return a\\n \",\n \"runtime\": \"572\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n import itertools\\n perms = [list(a) for a in itertools.permutations(nums)]\\n a = []\\n [a.append(perm) for perm in perms if perm not in a]\\n return a\\n \",\n \"runtime\": \"572\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n n = len(nums)\\n result = []\\n\\n def helper(i):\\n if i == n-1:\\n if nums[:] not in result:\\n result.append(nums[:])\\n return\\n for j in range(i, n):\\n\\n nums[i], nums[j] = nums[j], nums[i]\\n helper(i+1)\\n nums[i], nums[j] = nums[j], nums[i]\\n\\n helper(0)\\n return result \\n \",\n \"runtime\": \"580\"\n },\n {\n \"code\": \"from itertools import permutations \\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n a=[list(x) for x in permutations(nums,len(nums))] \\n ans=[]\\n for i in a :\\n if i not in ans :\\n ans.append(i)\\n return ans \",\n \"runtime\": \"580\"\n },\n {\n \"code\": \"\\n# Example:\\n\\n# Input: nums = [1,2,3]\\n# Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]\\n\\n# Approach:\\n# Recursive approach \\n\\n# generate permutations by:\\n# swap begin index with all other indices ahead of it (starting with 0)\\n# recurse further on all new words perms generated with an increased current idx \\n# base case: return when the current idx reaches the end of the word and then add to the result\\n\\n# edge cases:\\n# all numbers are duplicates ex) [1,1,1]\\n\\n\\nclass Solution:\\n def __init__(self): \\n self.permutations = []\\n \\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n if not nums or len(nums) == 1:\\n return [nums]\\n \\n if len(nums) == 2:\\n if nums[0] == nums[1]:\\n return [nums]\\n \\n return [[nums[0], nums[1]], [nums[1], nums[0]]]\\n \\n def swap(input_nums, first_idx, second_idx):\\n input_nums[first_idx], input_nums[second_idx] = input_nums[second_idx], input_nums[first_idx]\\n\\n def traverse(current_nums, current_idx):\\n if current_idx == len(current_nums) - 1:\\n if not current_nums in self.permutations:\\n self.permutations.append(current_nums[:])\\n\\n return\\n \\n for i in range(current_idx, len(current_nums)):\\n # NOTE: Need 2 swap due to switch current_nums back due to nature of lists in python \\n # swap index values\\n swap(current_nums, current_idx, i)\\n\\n traverse(current_nums, current_idx + 1)\\n # swap back after recursion\\n swap(current_nums, current_idx, i)\\n \\n traverse(nums, 0)\\n \\n return self.permutations\",\n \"runtime\": \"588\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n\\n total = []\\n def permutations(start):\\n\\n if start == len(nums)-1:\\n if nums in total:\\n return\\n total.append(nums[:])\\n return\\n \\n for i in range(start, len(nums)):\\n nums[i], nums[start] = nums[start], nums[i]\\n permutations(start+1)\\n nums[i], nums[start] = nums[start], nums[i]\\n\\n\\n permutations(0)\\n return total\",\n \"runtime\": \"588\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n global permutations\\n permutations = []\\n def permutate(numbers,current_permutation=[]):\\n if not numbers:\\n if current_permutation not in permutations:\\n permutations.append(current_permutation[:])\\n return\\n else:\\n return\\n for i in numbers:\\n current_permutation.append(i)\\n new_numbers = numbers.copy()\\n new_numbers.remove(i)\\n permutate(new_numbers,current_permutation)\\n current_permutation.pop()\\n permutate(nums) \\n return permutations \\n \",\n \"runtime\": \"597\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n\\n def backtrack(i):\\n if i == len(nums) - 1:\\n if nums not in res:\\n res.append(nums.copy())\\n return \\n\\n for j in range(i, len(nums)):\\n nums[i], nums[j] = nums[j], nums[i]\\n\\n backtrack(i + 1)\\n\\n nums[i], nums[j] = nums[j], nums[i]\\n\\n backtrack(0)\\n\\n return list(res)\\n\",\n \"runtime\": \"597\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n ans = []\\n\\n def dfs(path, options):\\n if not options and path not in ans:\\n ans.append(path.copy())\\n return\\n \\n temp = options.copy()\\n prev = None\\n for option in options:\\n\\n path.append(option)\\n temp.remove(option)\\n\\n dfs(path, temp)\\n\\n temp.append(option)\\n path.pop()\\n \\n dfs([], nums.copy())\\n return ans\",\n \"runtime\": \"605\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n perms = []\\n\\n\\n def helper(perm,left):\\n if not len(left):\\n if perm not in perms:\\n perms.append(perm[::])\\n return\\n for i in left:\\n newp = perm.copy()\\n newl = left.copy()\\n newp.append(i)\\n newl.remove(i)\\n helper(newp,newl)\\n helper([],nums)\\n return perms\\n \\n \\n\\n \\n \",\n \"runtime\": \"605\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n\\n n = len(nums)\\n self.visited = set()\\n self.ans = []\\n\\n self.remain = set([i for i in range(n)])\\n \\n # def dfs(cur_idx, path):\\n\\n # if len(path) == n - 1:\\n # t = tuple(path + [nums[cur_idx]])\\n # if t not in self.visited:\\n # self.ans.append(list(t))\\n # self.visited.add(t) \\n # return\\n # self.remain.remove(cur_idx)\\n # for next_idx in self.remain:\\n # dfs(next_idx, path + [nums[cur_idx]])\\n # self.remain.add(cur_idx)\\n \\n # for i in range(n):\\n # dfs(i, [])\\n \\n # return self.ans\\n\\n self.used = [False] * n\\n\\n def dfs(i, path):\\n print(i, path)\\n if i == n:\\n if tuple(path) not in self.visited:\\n self.visited.add(tuple(path))\\n self.ans.append(list(tuple(path)))\\n for idx in range(n):\\n if not self.used[idx]:\\n path.append(nums[idx])\\n self.used[idx] = True\\n dfs(i + 1, path)\\n path.pop()\\n self.used[idx] = False\\n \\n dfs(0, [])\\n return self.ans\",\n \"runtime\": \"613\"\n },\n {\n \"code\": \"def permutation(index, nums, result, used):\\n if index == len(nums) and nums not in result:# Base case\\n result.append(list(nums)) # Append nums as list to result\\n return # Stop further processing\\n \\n for i in range(index, len(nums)):\\n nums[index], nums[i] = nums[i], nums[index] # Swap\\n permutation(index+1, nums, result, used)\\n nums[index], nums[i] = nums[i], nums[index] # Swap back\\n\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n result=[]\\n nums.sort()\\n used=[False]*len(nums)\\n permutation(0,nums,result, used)\\n return result\",\n \"runtime\": \"613\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n def backtrack(start):\\n if start == len(nums):\\n if (not (nums[:] in res)):\\n res.append(nums[:])\\n return\\n \\n for i in range(start, len(nums)):\\n nums[start], nums[i] = nums[i], nums[start]\\n backtrack(start + 1)\\n nums[start], nums[i] = nums[i], nums[start]\\n\\n res = []\\n backtrack(0)\\n return res\",\n \"runtime\": \"621\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n result = []\\n nums.sort()\\n \\n def backtrack(path,left):\\n if len(path) == len(nums):\\n if path not in result:\\n result.append(path[:])\\n return \\n \\n for num in left:\\n path.append(num)\\n newleft = left.copy()\\n newleft.remove(num)\\n backtrack(path,newleft)\\n path.pop()\\n newleft.append(num)\\n backtrack([],nums)\\n return result\\n \",\n \"runtime\": \"621\"\n },\n {\n \"code\": \"class Solution:\\n\\n def solve(self, ip, op, c, res):\\n if len(op) == c:\\n if op not in res:\\n res.append(op)\\n return\\n\\n for i in ip:\\n ip1 = ip.copy()\\n ip1.remove(i)\\n self.solve(ip1, op + [i], c, res)\\n\\n return res\\n\\n\\n\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n ip = nums\\n return self.solve(ip, [], len(ip), [])\",\n \"runtime\": \"629\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n x=0\\n def per(mums,x=0,z=None):\\n if z is None:\\n z=[]\\n if len(nums)==x and nums not in z:\\n z.append(nums.copy())\\n for i in range(x,len(nums)):\\n nums[x],nums[i]=nums[i],nums[x]\\n per(nums,x+1,z)\\n nums[x],nums[i]=nums[i],nums[x]\\n return z\\n return per(nums,x,None)\",\n \"runtime\": \"629\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n result = []\\n n = len(nums)\\n\\n def backtrack(idx):\\n if idx == n:\\n res = nums[:]\\n if res not in result:\\n result.append(res)\\n return\\n \\n for i in range(idx, n):\\n nums[idx], nums[i] = nums[i], nums[idx]\\n backtrack(idx+1)\\n nums[idx], nums[i] = nums[i] , nums[idx]\\n \\n\\n backtrack(0)\\n return result\\n \",\n \"runtime\": \"637\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n res,sol = [],[]\\n n = len(nums)\\n def backtrack(pos,combination,numss):\\n if pos==n :\\n if combination not in res:\\n res.append(combination[:])\\n return\\n for i in list(numss) :\\n numss.remove(i)\\n backtrack(pos+1 , combination+[i],numss)\\n numss.append(i)\\n backtrack(0,[],nums)\\n return res\",\n \"runtime\": \"637\"\n },\n {\n \"code\": \"def permutation(index, nums, result):\\n if index == len(nums) and nums not in result:# Base case\\n result.append(list(nums)) # Append nums as list to result\\n return # Stop further processing\\n \\n for i in range(index, len(nums)):\\n nums[index], nums[i] = nums[i], nums[index] # Swap\\n permutation(index+1, nums, result)\\n nums[index], nums[i] = nums[i], nums[index] # Swap back\\n\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n result=[]\\n permutation(0,nums,result)\\n return result\",\n \"runtime\": \"646\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n n = len(nums)\\n\\n def backtrack(currLeft, currPicked):\\n nonlocal n\\n if len(currPicked) == n:\\n if currPicked not in res:\\n res.append(currPicked[:])\\n return\\n for num in currLeft:\\n newLeft = currLeft[:]\\n newLeft.remove(num)\\n newPicked = currPicked[:]\\n newPicked.append(num)\\n backtrack(newLeft, newPicked)\\n return\\n \\n backtrack(nums, [])\\n return res\",\n \"runtime\": \"646\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n\\n result = []\\n used = [False] * len(nums) # Keep track of used elements\\n\\n def backtrack(index, current_permutation):\\n if index == len(nums):\\n if current_permutation not in result: # Check for uniqueness before adding\\n result.append(current_permutation[:])\\n return\\n\\n for i in range(len(nums)):\\n if not used[i]:\\n used[i] = True\\n current_permutation.append(nums[i])\\n backtrack(index + 1, current_permutation)\\n current_permutation.pop()\\n used[i] = False\\n\\n backtrack(0, [])\\n return result\",\n \"runtime\": \"654\"\n },\n {\n \"code\": \"class Solution:\\n check = []\\n ans = []\\n def dfs(self, nums, temp, n):\\n if n == 0:\\n if temp not in self.ans:\\n self.ans.append(temp[:])\\n return\\n for i in range(len(nums)):\\n if self.check[i] == 1: continue\\n self.check[i] = 1\\n temp.append(nums[i])\\n self.dfs(nums, temp, n-1)\\n temp.pop()\\n self.check[i] = 0\\n\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n self.check = [0 for i in range(len(nums))]\\n self.ans = []\\n self.dfs(nums, [], len(nums))\\n return self.ans\",\n \"runtime\": \"654\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n cur = []\\n ans = []\\n n = len(nums)\\n truth = [False for _ in range(n)]\\n\\n def backtrack():\\n if len(cur) == n:\\n if cur[:] not in ans:\\n ans.append(cur[:])\\n else:\\n for i in range(n):\\n if not truth[i]:\\n cur.append(nums[i])\\n truth[i] = True\\n backtrack()\\n cur.pop()\\n truth[i] = False\\n backtrack()\\n \\n\\n return ans\",\n \"runtime\": \"662\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n permutations = []\\n n = len(nums)\\n visited = [False] * n\\n\\n\\n def backtrack(permutation, visited):\\n if len(permutation) == n and permutation not in permutations :\\n permutations.append(permutation.copy())\\n return\\n for i in range(n):\\n if not visited[i]:\\n permutation.append(nums[i])\\n visited[i] = True\\n backtrack(permutation, visited)\\n permutation.pop()\\n visited[i] = False\\n\\n\\n backtrack([],visited)\\n return permutations\\n \",\n \"runtime\": \"662\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n def backtrack(path, used):\\n if len(path) == len(nums) and path not in result:\\n # print(path[:])\\n result.append(path[:])\\n return\\n \\n for i in range(len(nums)):\\n if used[i]:\\n continue\\n # if i > 0 and nums[i] == nums[i - 1]:\\n # continue\\n \\n path.append(nums[i])\\n used[i] = True\\n backtrack(path, used)\\n path.pop()\\n used[i] = False\\n\\n result = []\\n used = [False] * len(nums)\\n nums.sort()\\n backtrack([], used)\\n return result\",\n \"runtime\": \"670\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n output = []\\n n = len(nums)\\n\\n def dfs(nums, stack=[]):\\n if len(stack) == n:\\n if stack not in output:\\n output.append(stack[:])\\n return\\n for idx in range(len(nums)):\\n stack.append(nums[idx])\\n dfs(nums[:idx] + nums[idx+1:], stack)\\n stack.pop()\\n \\n dfs(nums)\\n\\n return output\\n \\n \",\n \"runtime\": \"670\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n def helper(curr, arr):\\n if len(arr) == 0:\\n if curr not in ans:\\n ans.append(curr)\\n return\\n \\n helper(curr + [arr[0]], arr[1:])\\n for i in range(1, len(arr)):\\n helper(curr + [arr[i]], arr[:i] + arr[i+1:])\\n \\n \\n ans = []\\n helper([], nums)\\n return ans\\n \",\n \"runtime\": \"678\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n def dfs(rem, path):\\n nonlocal res\\n if not rem:\\n copy = path[:]\\n if copy not in res:\\n res.append(path[:])\\n return\\n\\n for i in range(len(rem)):\\n path.append(rem[i])\\n dfs(rem[:i] + rem[i + 1:], path)\\n path.pop()\\n \\n dfs(nums, [])\\n return res\",\n \"runtime\": \"678\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":155,"string":"155"},"mm_list":{"kind":"list like","value":[{"code":"# O(N * !N) T and O(N * !N) S recursive backtracking solution (NeetCode's modded)\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n N = len(nums)\n numToCount = {}\n for n in nums:\n numToCount[n] = numToCount.get(n, 0) + 1\n \n def dfs(perm):\n if len(perm) >= N:\n res.append(perm[:])\n return\n for n in numToCount.keys():\n if numToCount[n] > 0:\n perm.append(n)\n numToCount[n] -= 1\n dfs(perm)\n perm.pop()\n numToCount[n] += 1\n \n dfs([])\n return res","memory":"16300"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n ans = []\n\n def dfs(path, options):\n if not options and path not in ans:\n ans.append(path.copy())\n return\n \n temp = options.copy()\n prev = None\n for option in options:\n\n path.append(option)\n temp.remove(option)\n\n dfs(path, temp)\n\n temp.append(option)\n path.pop()\n \n dfs([], nums)\n return ans","memory":"16400"},{"code":"class Solution:\n def __init__(self):\n self.res = []\n self.track = []\n self.visited = []\n\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n self.visited = [False] * len(nums)\n self.backtrack(nums)\n return self.res\n\n def backtrack(self, nums: List[int]) -> None:\n # Ending condition: reaches bottom of tree\n if len(self.track) == len(nums):\n # list() is for empty list situation,\n # Which can be included as list rather None.\n self.res.append(self.track.copy())\n return\n\n # Go thro all choices:\n for i in range(len(nums)):\n # Prevent repeated element for Permutation\n if self.visited[i]:\n continue\n # Trim the unneccessary repeated elements from the tree\n # Make sure we are comparing at the same level\n if i > 0 and nums[i - 1] == nums[i] and not self.visited[i - 1]:\n continue\n\n # Preorder: Add element into track\n self.track.append(nums[i])\n self.visited[i] = True\n # Next level\n self.backtrack(nums)\n # Postorder: Discard element from track\n self.track.pop()\n self.visited[i] = False\n","memory":"16500"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n if not nums:\n return []\n res = []\n cur = []\n index = 0\n def dfs(index):\n seen = set()\n if index == len(nums):\n res.append(list(nums))\n for i in range(index, len(nums)):\n if nums[i] not in seen:\n seen.add(nums[i])\n nums[i], nums[index] = nums[index], nums[i]\n dfs(index + 1)\n nums[i], nums[index] = nums[index], nums[i]\n dfs(0)\n return res\n\n","memory":"16600"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n result = list()\n path = list()\n\n def bt(nums_list):\n if len(path) == len(nums):\n result.append(path[:])\n return\n\n uset = set()\n\n for i in range(len(nums_list)):\n if nums_list[i] in uset:\n continue\n uset.add(nums_list[i])\n path.append(nums_list[i])\n bt(nums_list[0:i] + nums_list[i + 1 :])\n path.pop()\n\n bt(nums)\n\n return result\n\n","memory":"16600"},{"code":"from itertools import permutations\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n return [list(perm) for perm in set(permutations(nums))]","memory":"16700"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n def swap(arr, i, j):\n arr[i], arr[j] = arr[j], arr[i]\n\n def p(arr,ans,ind):\n\n if len(arr)==ind:\n ans.append(arr.copy())\n return\n\n use=[0]*(21)\n\n for i in range(ind,len(arr)):\n if use[arr[i]+10]==0:\n swap(arr, i, ind)\n p(arr,ans,ind+1)\n swap(arr, i, ind)\n use[arr[i]+10]=1\n \n ans=[]\n \n p(nums,ans,0)\n \n\n return ans\n ","memory":"16700"},{"code":"from itertools import permutations\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n return [list(perm) for perm in set(permutations(nums))]","memory":"16800"},{"code":"from itertools import permutations\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n return [list(perm) for perm in set(permutations(nums))]","memory":"16800"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n self.res = []\n self.backtrack(nums, [], [False]*len(nums))\n return self.res\n\n def backtrack(self, nums, perm, used):\n if len(perm) == len(nums):\n self.res.append(perm[:])\n return\n\n for i in range(len(nums)):\n if used[i]: \n continue\n if i > 0 and nums[i] == nums[i - 1] and not used[i - 1]:\n continue\n used[i] = True\n perm.append(nums[i])\n self.backtrack(nums, perm, used)\n perm.pop()\n used[i] = False","memory":"16900"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n res, used = [], [False] * len(nums)\n\n def backtrack(path):\n if len(path) == len(nums):\n res.append(path[:])\n return\n \n \n for i in range(len(nums)):\n if used[i]:\n continue\n\n if i > 0 and nums[i] == nums[i-1] and not used[i-1]:\n continue\n\n used[i] = True\n \n path.append(nums[i])\n backtrack(path)\n path.pop()\n\n used[i] = False\n \n backtrack([])\n return res","memory":"16900"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n count={}\n for i in nums:\n count[i]=1+count.get(i,0)\n res=[]\n cur=[]\n def dfs():\n if len(cur)==len(nums):\n res.append(cur.copy())\n for i in count:\n if count[i]>0:\n cur.append(i)\n count[i]-=1\n dfs()\n count[i]+=1\n cur.pop()\n\n dfs()\n return res\n ","memory":"17000"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n ans = set()\n state = [False] * n\n perm = [None] * n\n\n def permutate(i, state, perm):\n if i == n:\n # print(perm)\n ans.add(tuple(perm))\n return\n for j in range(n):\n if perm[j] is None:\n perm[j] = nums[i]\n permutate(i+1, state, perm)\n perm[j] = None\n\n permutate(0, state, perm)\n return ans","memory":"17000"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n ans = set()\n state = [False] * n\n perm = [None] * n\n\n def permutate(i=0):\n if i == n:\n # print(perm)\n ans.add(tuple(perm))\n return\n for j in range(n):\n if perm[j] is None:\n perm[j] = nums[i]\n permutate(i+1)\n perm[j] = None\n\n permutate()\n return ans","memory":"17100"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n ans = set()\n state = [False] * n\n perm = [None] * n\n\n def permutate(i=0):\n if i == n:\n # print(perm)\n ans.add(tuple(perm))\n return\n for j in range(n):\n if perm[j] is None:\n perm[j] = nums[i]\n permutate(i+1)\n perm[j] = None\n\n permutate()\n return ans","memory":"17100"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n perm=[]\n cou=Counter(nums)\n def findallperm(res):\n if len(res)==len(nums):\n perm.append(res)\n return \n for key in cou:\n if cou[key]:\n cou[key]-=1\n findallperm(res+[key])\n cou[key]+=1\n findallperm([])\n return perm","memory":"17200"},{"code":"from sortedcontainers import SortedDict\n\nclass Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n # Loop\n ## Current position should be updated.\n ## If empty (i.e. -1), get the lowest number from 'avail', and use that to fill the current position and move right. After moving right, if position is outside array, record new permutation, and move back left.\n ## If already filled, increment it.\n ### Check in 'avail' for lowest number greater than number\n ### If such a number is present, replace current number with that number and move right. After moving right, if position is outside array, record new permutation, and move back left.; else mark this position as empty and move left. After moving left, if position is outside array, break out of loop (all permutations have been generated)\n \n # At every step in the loop, if something is removed from the main array, add it to 'avail'. If something from 'avail' is used in the main array, remove it from 'avail'\n\n result = []\n\n\n def moveRight():\n nonlocal perm, pos, n\n\n perm[pos] = a\n\n pos += 1\n if pos >= n:\n pos = n - 1\n result.append(perm.copy())\n\n \n def decrAvail(key):\n nonlocal avail\n\n if key in avail:\n avail[key] -= 1\n\n if avail[key] <= 0:\n avail.pop(key)\n\n\n def incrAvail(key):\n nonlocal avail\n\n if key in avail:\n avail[key] += 1\n else:\n avail[key] = 1\n\n\n def decrAvailInd(index):\n nonlocal avail\n\n if index >= 0 and index < len(avail):\n key, val = avail.peekitem(index)\n\n decrAvail(key)\n\n return key, val\n \n return None\n\n\n n = len(nums)\n pos = 0\n perm = [None] * n\n avail = SortedDict()\n\n for e in nums:\n incrAvail(e)\n\n while True:\n if perm[pos] is None:\n a, b = decrAvailInd(0)\n perm[pos] = a\n moveRight()\n\n else:\n p = avail.bisect_right(perm[pos])\n\n if p >= 0 and p < len(avail):\n a, b = decrAvailInd(p)\n\n incrAvail(perm[pos])\n\n perm[pos] = a\n\n moveRight()\n else:\n incrAvail(perm[pos])\n perm[pos] = None\n pos -= 1\n\n if pos < 0:\n break\n\n\n return result\n","memory":"17300"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n ans = []\n visited = set()\n totalLen = len(nums)\n def dfs(combo,nums):\n if len(combo) == totalLen and tuple(combo) not in visited:\n ans.append(combo[:])\n visited.add(tuple(combo))\n return\n for i in range(len(nums)):\n dfs(combo + [ nums[i]],nums[:i] + nums[i+1:])\n dfs([],nums)\n return ans","memory":"17400"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 1:\n return [[nums[0]]]\n freq = collections.Counter(nums)\n return self.permuteUniqueRecursive(freq, deque(), len(nums))\n \n def permuteUniqueRecursive(self, freq: Dict[int, int], cur: List[int], n: int):\n if len(cur) == n:\n return [cur]\n\n ret = []\n for num, f in freq.items():\n if not f:\n continue\n freq[num] -= 1\n cur.append(num)\n ret.extend( self.permuteUniqueRecursive(freq, cur.copy(), n) )\n freq[num] += 1\n cur.pop()\n return ret","memory":"17600"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n res = []\n count = Counter(nums)\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return \n for j in count:\n if count[j]>0:\n cur.append(j)\n count[j]-=1\n dfs(cur)\n count[j]+=1\n cur.pop()\n dfs([])\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n\n res = []\n count = Counter(nums)\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for j in count:\n if count[j]>0:\n count[j]-=1\n cur.append(j)\n dfs(cur)\n cur.pop()\n count[j]+=1\n dfs([])\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n res = []\n count = Counter(nums)\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for j in count:\n if count[j]>0:\n count[j]-=1\n cur.append(j)\n dfs(cur)\n cur.pop()\n count[j]+=1\n dfs([])\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n res = []\n count = Counter(nums)\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return \n for j in count:\n if count[j]>0:\n count[j]-=1\n cur.append(j)\n dfs(cur)\n cur.pop()\n count[j]+=1\n dfs([])\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n res = []\n counter = Counter(nums)\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for j in counter:\n if counter[j]>0:\n counter[j]-=1\n cur.append(j)\n dfs(cur)\n cur.pop()\n counter[j]+=1\n dfs([])\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n res = []\n counter = Counter(nums)\n def dfs(i,cur):\n if i>=len(nums):\n res.append(cur.copy())\n return\n for j in counter:\n if counter[j]!=0:\n counter[j]-=1\n cur.append(j)\n dfs(i+1,cur)\n cur.pop()\n counter[j]+=1\n dfs(0,[])\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n res = []\n counter = Counter(nums)\n def dfs(i,cur):\n if i>=len(nums):\n res.append(cur.copy())\n return\n for j in counter:\n if counter[j]!=0:\n counter[j]-=1\n cur.append(j)\n dfs(i+1,cur)\n cur.pop()\n counter[j]+=1\n dfs(0,[])\n return res\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n res = []\n # nums.sort()\n count = Counter(nums)\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for j in count:\n if count[j]==0:continue\n count[j]-=1\n cur.append(j)\n dfs(cur)\n cur.pop()\n count[j]+=1\n dfs([])\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n res = []\n count = Counter(nums)\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for j in count:\n if count[j]==0:continue\n count[j]-=1\n cur.append(j)\n dfs(cur)\n cur.pop()\n count[j]+=1\n dfs([])\n return res\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 counter = Counter(nums)\n res = []\n def dfs(cur):\n if len(cur)==len(nums):\n res.append(cur.copy())\n return res\n for j in counter:\n if counter[j]>0:\n counter[j]-=1\n cur.append(j)\n dfs(cur)\n cur.pop()\n counter[j]+=1\n dfs([])\n return res\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 counter = Counter(nums)\n res = []\n def dfs(cur):\n if len(cur)==len(nums):\n res.append(cur.copy())\n return\n for j in counter:\n if counter[j]>0:\n counter[j]-=1\n cur.append(j)\n dfs(cur)\n counter[j]+=1\n cur.pop()\n\n dfs([])\n return res\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 counter = Counter(nums)\n res = []\n def dfs(i,cur):\n if i>=len(nums):\n res.append(cur.copy())\n return\n for j in counter:\n if counter[j]!=0:\n cur.append(j)\n counter[j]-=1\n dfs(i+1,cur)\n counter[j]+=1\n cur.pop()\n dfs(0,[])\n return res\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 counter = Counter(nums)\n res = []\n def dfs(i,cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n if i>=len(nums):return\n for j in counter:\n if counter[j]>0:\n counter[j]-=1\n cur.append(j)\n dfs(i+1,cur)\n cur.pop()\n counter[j]+=1\n dfs(0,[])\n return res\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\n\n counter = Counter(nums)\n res = []\n def dfs(i,cur):\n if len(cur)==len(nums):\n res.append(cur.copy())\n return\n if i>=len(nums):\n return\n for j in counter:\n if counter[j]>0:\n counter[j]-=1\n cur.append(j)\n dfs(i+1,cur)\n cur.pop()\n counter[j]+=1\n dfs(0,[])\n return res\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 counter = Counter(nums)\n res = []\n def dfs(i,cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n if i>=len(nums):return\n for j in counter:\n if counter[j]>0:\n counter[j] -=1\n cur.append(j)\n dfs(i+1,cur)\n cur.pop()\n counter[j]+=1\n dfs(0,[])\n return res\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\n\n\n\n\n\n\n counter = Counter(nums)\n res = []\n def dfs(i,cur):\n if len(cur) == len(nums):\n \n res.append(cur.copy())\n return\n if i>=len(nums):return\n for j in counter:\n if counter[j] > 0:\n counter[j]-=1\n cur.append(j)\n dfs(i+1,cur)\n counter[j]+=1\n cur.pop()\n \n dfs(0,[])\n return res\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\n counter = Counter(nums)\n res = []\n def dfs(i,cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for j in counter:\n if counter[j]>0:\n cur.append(j)\n counter[j]-=1\n dfs(i+1,cur)\n counter[j]+=1\n cur.pop()\n dfs(0,[])\n return res\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\n\n\n\n res = []\n counter = Counter(nums)\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for j in counter:\n if counter[j]>0:\n cur.append(j)\n counter[j]-=1\n dfs(cur)\n counter[j]+=1\n cur.pop()\n dfs([])\n return res\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\n res = []\n counter = Counter(nums)\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for j in counter:\n if counter[j]>0:\n cur.append(j)\n counter[j]-=1\n dfs(cur)\n counter[j]+=1\n cur.pop()\n dfs([])\n return res\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 \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n res=[]\n count = Counter(nums)\n def dfs(cur):\n if len(cur) == len(nums):\n res.append(cur.copy())\n return\n for n in count:\n if count[n] >0:\n cur.append(n)\n count[n]-=1\n\n dfs(cur)\n\n count[n]+=1\n cur.pop()\n dfs([])\n return res\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 \n \n def perm(not_so_far,so_far):\n if len(so_far)==len(nums):\n res.append(so_far)\n return\n for i in set(not_so_far):\n not_so_far_t=not_so_far.copy()\n so_far_t=so_far.copy()\n not_so_far_t.remove(i)\n so_far_t.append(i)\n perm(not_so_far_t,so_far_t)\n perm(nums,[])\n return res\n ","memory":"17700"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n # [1,2,3]\n \n ans = set()\n n = len(nums)\n \n def helper(i, current):\n #print(i, current)\n if i >= n:\n ans.add(current)\n return\n \n for j in range(len(current)+1):\n \n helper(i+1, tuple(current[k] if k < j else nums[i] if k == j else current[k-1] for k in range(len(current)+1)))\n helper(0, tuple())\n return ans","memory":"17800"},{"code":"class Solution:\n hash = {}\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n if len(nums)==1:return [nums]\n nums.sort()\n stringified = (str(nums))\n if stringified in self.hash:return self.hash[stringified]\n l=[]\n for i in range(len(nums)):\n for perm in self.permuteUnique( nums[:i]+ nums[i+1:]):\n x = [nums[i]]+ perm\n if x not in l:\n l.append(x)\n self.hash[stringified] = l\n return l\n","memory":"17900"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n ans = []\n nums.sort()\n dic = set()\n\n def dfs(index, nums, visited, path, ans):\n print(path)\n visited[index] = True\n curPath = path + [nums[index]]\n if tuple(curPath) in dic:\n visited[index] = False\n return\n dic.add(tuple(curPath))\n if len(curPath) == len(nums):\n ans.append(curPath)\n visited[index] = False\n return\n\n for i in range(len(nums)):\n print(visited)\n if not visited[i]:\n dfs(i, nums, visited, curPath, ans)\n visited[index] = False\n\n for i in range(len(nums)):\n visited = [False] * len(nums)\n dfs(i, nums, visited, [], ans)\n return ans\n","memory":"18000"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n ans = []\n nums.sort()\n dic = set()\n\n def dfs(index, nums, visited, path, ans):\n print(path)\n visited[index] = True\n curPath = path + [nums[index]]\n if tuple(curPath) in dic:\n visited[index] = False\n return\n dic.add(tuple(curPath))\n if len(curPath) == len(nums):\n ans.append(curPath)\n visited[index] = False\n return\n\n for i in range(len(nums)):\n if not visited[i]:\n dfs(i, nums, visited, curPath, ans)\n visited[index] = False\n\n for i in range(len(nums)):\n visited = [False] * len(nums)\n dfs(i, nums, visited, [], ans)\n return ans\n","memory":"18000"},{"code":"class Solution:\n def get_permutes(self,nums,n,start,elem,ln):\n if not nums or n==0:\n return [[elem]]\n permutes=[]\n for i in range(n):\n # if i>0 and nums[i]==nums[i-1] and i<n-1:\n # continue\n res=self.get_permutes(nums[0:i]+nums[i+1:],n-1,i+1,nums[i],ln)\n for r in res:\n permutes.append([elem]+r)\n return permutes\n\n\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n d={}\n n=len(nums)\n ans=[]\n for i in range(n):\n # if nums[i] not in d:\n res=self.get_permutes(nums[0:i]+nums[i+1:],n-1,0,nums[i],n)\n for r in res:\n if len(r)==n and r not in ans:\n ans.append(r)\n d[nums[i]]=1\n \n # print('ans=',ans)\n return ans\n\n\n\n ","memory":"18100"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n visited = set()\n\n def helper(i):\n if i >= len(nums):\n return [[]]\n\n perms = helper(i+1)\n resPerms = []\n\n for p in perms:\n for j in range(len(p)+1):\n pCopy = p.copy()\n pCopy.insert(j, nums[i])\n\n if len(pCopy) == len(nums) and tuple(pCopy) in visited:\n continue\n\n resPerms.append(pCopy)\n visited.add(tuple(pCopy))\n \n return resPerms\n\n return helper(0)\n ","memory":"18200"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n \n n = len(nums)\n ans = []\n memo = set()\n def backtrack(took, sol):\n if tuple(sol) in memo:\n return \n if len(sol) == n:\n ans.append(sol[:])\n return\n for i in range(n):\n if i not in took:\n took.add(i)\n sol.append(nums[i])\n backtrack(took, sol)\n memo.add(tuple(sol))\n took.remove(i)\n sol.pop()\n backtrack(set(), [])\n return ans\n\n ","memory":"18300"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 1:\n return [[nums[0]]]\n freq = collections.Counter(nums)\n n = len(nums)\n\n ret = []\n def dfs(cur: List[int]) -> List[List[int]]:\n if len(cur) == n:\n ret.append(cur.copy())\n return\n\n for num, f in freq.items():\n if not f:\n continue\n freq[num] -= 1\n cur.append(num)\n dfs(cur)\n freq[num] += 1\n cur.pop()\n return ret\n\n return dfs(deque())","memory":"18400"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 1:\n return [[nums[0]]]\n freq = collections.Counter(nums)\n n = len(nums)\n\n ret = deque()\n def dfs(cur: List[int]) -> List[List[int]]:\n if len(cur) == n:\n ret.append(cur.copy())\n return\n\n for num, f in freq.items():\n if not f:\n continue\n freq[num] -= 1\n cur.append(num)\n dfs(cur)\n freq[num] += 1\n cur.pop()\n return ret\n\n return dfs(deque())","memory":"18500"},{"code":"class Solution:\n def make_permutation(self, idx: int, comb: List[int], nums: List[int], dp, ans):\n n = len(nums)\n if (idx, tuple(comb), tuple(nums)) in dp:\n return\n if idx >= n:\n # print(\" [Final][COMB]\", comb, \"[NUMS]\", nums)\n ans.add(tuple(comb))\n return\n dp.add((idx, tuple(comb), tuple(nums)))\n # print(\"[COMB]\", comb, \"[NUMS]\", nums)\n last = None\n for i in range(n):\n # the same number has not replaced the same index before\n if nums[i] != None and nums[i] != last: \n last = comb[idx] = nums[i]\n nums[i] = None\n self.make_permutation(idx + 1, comb, nums, dp, ans)\n nums[i], comb[idx] = comb[idx], None\n \n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n # at each idx, can place one of n numbers\n # each state, a loop till n\n # repeating states? [idx, [nums]] \n # n * n! * n\n n = len(nums)\n comb = [None] * n\n ans = set()\n self.make_permutation(0, comb, nums, set(), ans)\n return ans","memory":"18600"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n if len(nums) == 1:\n return [[nums[0]]]\n freq = collections.Counter(nums)\n n = len(nums)\n\n ret = deque()\n def dfs(cur: List[int]) -> None:\n if len(cur) == n:\n ret.append(cur.copy())\n return\n\n for num, f in freq.items():\n if not f:\n continue\n freq[num] -= 1\n cur.append(num)\n dfs(cur)\n freq[num] += 1\n cur.pop()\n return\n dfs(deque())\n return ret","memory":"18700"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n @cache\n def p(arr):\n if len(arr) == 0: return [tuple([])]\n ans = set([])\n for i in range(len(arr)):\n ans.update(set([(arr[i],)+t for t in p(arr[:i]+arr[i+1:])]))\n return ans\n nums = tuple(nums)\n return set(p(nums))","memory":"19200"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n @cache\n def p(arr):\n if len(arr) == 0: return [tuple([])]\n ans = set([])\n for i in range(len(arr)):\n ans.update(set([(arr[i],)+t for t in p(arr[:i]+arr[i+1:])]))\n return ans\n nums = tuple(nums)\n return set(p(nums))","memory":"19200"},{"code":"class Solution:\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\n @cache\n def perms(arr):\n if not arr: return [tuple([])]\n ans = set()\n for i,n in enumerate(arr):\n ans.update({(n,)+a for a in perms(arr[:i]+arr[i+1:])})\n return ans\n return perms(tuple(nums))\n","memory":"19300"}],"string":"[\n {\n \"code\": \"# O(N * !N) T and O(N * !N) S recursive backtracking solution (NeetCode's modded)\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n N = len(nums)\\n numToCount = {}\\n for n in nums:\\n numToCount[n] = numToCount.get(n, 0) + 1\\n \\n def dfs(perm):\\n if len(perm) >= N:\\n res.append(perm[:])\\n return\\n for n in numToCount.keys():\\n if numToCount[n] > 0:\\n perm.append(n)\\n numToCount[n] -= 1\\n dfs(perm)\\n perm.pop()\\n numToCount[n] += 1\\n \\n dfs([])\\n return res\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n ans = []\\n\\n def dfs(path, options):\\n if not options and path not in ans:\\n ans.append(path.copy())\\n return\\n \\n temp = options.copy()\\n prev = None\\n for option in options:\\n\\n path.append(option)\\n temp.remove(option)\\n\\n dfs(path, temp)\\n\\n temp.append(option)\\n path.pop()\\n \\n dfs([], nums)\\n return ans\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.res = []\\n self.track = []\\n self.visited = []\\n\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n self.visited = [False] * len(nums)\\n self.backtrack(nums)\\n return self.res\\n\\n def backtrack(self, nums: List[int]) -> None:\\n # Ending condition: reaches bottom of tree\\n if len(self.track) == len(nums):\\n # list() is for empty list situation,\\n # Which can be included as list rather None.\\n self.res.append(self.track.copy())\\n return\\n\\n # Go thro all choices:\\n for i in range(len(nums)):\\n # Prevent repeated element for Permutation\\n if self.visited[i]:\\n continue\\n # Trim the unneccessary repeated elements from the tree\\n # Make sure we are comparing at the same level\\n if i > 0 and nums[i - 1] == nums[i] and not self.visited[i - 1]:\\n continue\\n\\n # Preorder: Add element into track\\n self.track.append(nums[i])\\n self.visited[i] = True\\n # Next level\\n self.backtrack(nums)\\n # Postorder: Discard element from track\\n self.track.pop()\\n self.visited[i] = False\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n if not nums:\\n return []\\n res = []\\n cur = []\\n index = 0\\n def dfs(index):\\n seen = set()\\n if index == len(nums):\\n res.append(list(nums))\\n for i in range(index, len(nums)):\\n if nums[i] not in seen:\\n seen.add(nums[i])\\n nums[i], nums[index] = nums[index], nums[i]\\n dfs(index + 1)\\n nums[i], nums[index] = nums[index], nums[i]\\n dfs(0)\\n return res\\n\\n\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n result = list()\\n path = list()\\n\\n def bt(nums_list):\\n if len(path) == len(nums):\\n result.append(path[:])\\n return\\n\\n uset = set()\\n\\n for i in range(len(nums_list)):\\n if nums_list[i] in uset:\\n continue\\n uset.add(nums_list[i])\\n path.append(nums_list[i])\\n bt(nums_list[0:i] + nums_list[i + 1 :])\\n path.pop()\\n\\n bt(nums)\\n\\n return result\\n\\n\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"from itertools import permutations\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n return [list(perm) for perm in set(permutations(nums))]\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n def swap(arr, i, j):\\n arr[i], arr[j] = arr[j], arr[i]\\n\\n def p(arr,ans,ind):\\n\\n if len(arr)==ind:\\n ans.append(arr.copy())\\n return\\n\\n use=[0]*(21)\\n\\n for i in range(ind,len(arr)):\\n if use[arr[i]+10]==0:\\n swap(arr, i, ind)\\n p(arr,ans,ind+1)\\n swap(arr, i, ind)\\n use[arr[i]+10]=1\\n \\n ans=[]\\n \\n p(nums,ans,0)\\n \\n\\n return ans\\n \",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"from itertools import permutations\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n return [list(perm) for perm in set(permutations(nums))]\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"from itertools import permutations\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n return [list(perm) for perm in set(permutations(nums))]\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n self.res = []\\n self.backtrack(nums, [], [False]*len(nums))\\n return self.res\\n\\n def backtrack(self, nums, perm, used):\\n if len(perm) == len(nums):\\n self.res.append(perm[:])\\n return\\n\\n for i in range(len(nums)):\\n if used[i]: \\n continue\\n if i > 0 and nums[i] == nums[i - 1] and not used[i - 1]:\\n continue\\n used[i] = True\\n perm.append(nums[i])\\n self.backtrack(nums, perm, used)\\n perm.pop()\\n used[i] = False\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n res, used = [], [False] * len(nums)\\n\\n def backtrack(path):\\n if len(path) == len(nums):\\n res.append(path[:])\\n return\\n \\n \\n for i in range(len(nums)):\\n if used[i]:\\n continue\\n\\n if i > 0 and nums[i] == nums[i-1] and not used[i-1]:\\n continue\\n\\n used[i] = True\\n \\n path.append(nums[i])\\n backtrack(path)\\n path.pop()\\n\\n used[i] = False\\n \\n backtrack([])\\n return res\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n count={}\\n for i in nums:\\n count[i]=1+count.get(i,0)\\n res=[]\\n cur=[]\\n def dfs():\\n if len(cur)==len(nums):\\n res.append(cur.copy())\\n for i in count:\\n if count[i]>0:\\n cur.append(i)\\n count[i]-=1\\n dfs()\\n count[i]+=1\\n cur.pop()\\n\\n dfs()\\n return res\\n \",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n ans = set()\\n state = [False] * n\\n perm = [None] * n\\n\\n def permutate(i, state, perm):\\n if i == n:\\n # print(perm)\\n ans.add(tuple(perm))\\n return\\n for j in range(n):\\n if perm[j] is None:\\n perm[j] = nums[i]\\n permutate(i+1, state, perm)\\n perm[j] = None\\n\\n permutate(0, state, perm)\\n return ans\",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n ans = set()\\n state = [False] * n\\n perm = [None] * n\\n\\n def permutate(i=0):\\n if i == n:\\n # print(perm)\\n ans.add(tuple(perm))\\n return\\n for j in range(n):\\n if perm[j] is None:\\n perm[j] = nums[i]\\n permutate(i+1)\\n perm[j] = None\\n\\n permutate()\\n return ans\",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n ans = set()\\n state = [False] * n\\n perm = [None] * n\\n\\n def permutate(i=0):\\n if i == n:\\n # print(perm)\\n ans.add(tuple(perm))\\n return\\n for j in range(n):\\n if perm[j] is None:\\n perm[j] = nums[i]\\n permutate(i+1)\\n perm[j] = None\\n\\n permutate()\\n return ans\",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n perm=[]\\n cou=Counter(nums)\\n def findallperm(res):\\n if len(res)==len(nums):\\n perm.append(res)\\n return \\n for key in cou:\\n if cou[key]:\\n cou[key]-=1\\n findallperm(res+[key])\\n cou[key]+=1\\n findallperm([])\\n return perm\",\n \"memory\": \"17200\"\n },\n {\n \"code\": \"from sortedcontainers import SortedDict\\n\\nclass Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n # Loop\\n ## Current position should be updated.\\n ## If empty (i.e. -1), get the lowest number from 'avail', and use that to fill the current position and move right. After moving right, if position is outside array, record new permutation, and move back left.\\n ## If already filled, increment it.\\n ### Check in 'avail' for lowest number greater than number\\n ### If such a number is present, replace current number with that number and move right. After moving right, if position is outside array, record new permutation, and move back left.; else mark this position as empty and move left. After moving left, if position is outside array, break out of loop (all permutations have been generated)\\n \\n # At every step in the loop, if something is removed from the main array, add it to 'avail'. If something from 'avail' is used in the main array, remove it from 'avail'\\n\\n result = []\\n\\n\\n def moveRight():\\n nonlocal perm, pos, n\\n\\n perm[pos] = a\\n\\n pos += 1\\n if pos >= n:\\n pos = n - 1\\n result.append(perm.copy())\\n\\n \\n def decrAvail(key):\\n nonlocal avail\\n\\n if key in avail:\\n avail[key] -= 1\\n\\n if avail[key] <= 0:\\n avail.pop(key)\\n\\n\\n def incrAvail(key):\\n nonlocal avail\\n\\n if key in avail:\\n avail[key] += 1\\n else:\\n avail[key] = 1\\n\\n\\n def decrAvailInd(index):\\n nonlocal avail\\n\\n if index >= 0 and index < len(avail):\\n key, val = avail.peekitem(index)\\n\\n decrAvail(key)\\n\\n return key, val\\n \\n return None\\n\\n\\n n = len(nums)\\n pos = 0\\n perm = [None] * n\\n avail = SortedDict()\\n\\n for e in nums:\\n incrAvail(e)\\n\\n while True:\\n if perm[pos] is None:\\n a, b = decrAvailInd(0)\\n perm[pos] = a\\n moveRight()\\n\\n else:\\n p = avail.bisect_right(perm[pos])\\n\\n if p >= 0 and p < len(avail):\\n a, b = decrAvailInd(p)\\n\\n incrAvail(perm[pos])\\n\\n perm[pos] = a\\n\\n moveRight()\\n else:\\n incrAvail(perm[pos])\\n perm[pos] = None\\n pos -= 1\\n\\n if pos < 0:\\n break\\n\\n\\n return result\\n\",\n \"memory\": \"17300\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n ans = []\\n visited = set()\\n totalLen = len(nums)\\n def dfs(combo,nums):\\n if len(combo) == totalLen and tuple(combo) not in visited:\\n ans.append(combo[:])\\n visited.add(tuple(combo))\\n return\\n for i in range(len(nums)):\\n dfs(combo + [ nums[i]],nums[:i] + nums[i+1:])\\n dfs([],nums)\\n return ans\",\n \"memory\": \"17400\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 1:\\n return [[nums[0]]]\\n freq = collections.Counter(nums)\\n return self.permuteUniqueRecursive(freq, deque(), len(nums))\\n \\n def permuteUniqueRecursive(self, freq: Dict[int, int], cur: List[int], n: int):\\n if len(cur) == n:\\n return [cur]\\n\\n ret = []\\n for num, f in freq.items():\\n if not f:\\n continue\\n freq[num] -= 1\\n cur.append(num)\\n ret.extend( self.permuteUniqueRecursive(freq, cur.copy(), n) )\\n freq[num] += 1\\n cur.pop()\\n return ret\",\n \"memory\": \"17600\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n count = Counter(nums)\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return \\n for j in count:\\n if count[j]>0:\\n cur.append(j)\\n count[j]-=1\\n dfs(cur)\\n count[j]+=1\\n cur.pop()\\n dfs([])\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n count = Counter(nums)\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for j in count:\\n if count[j]>0:\\n count[j]-=1\\n cur.append(j)\\n dfs(cur)\\n cur.pop()\\n count[j]+=1\\n dfs([])\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n count = Counter(nums)\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for j in count:\\n if count[j]>0:\\n count[j]-=1\\n cur.append(j)\\n dfs(cur)\\n cur.pop()\\n count[j]+=1\\n dfs([])\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n count = Counter(nums)\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return \\n for j in count:\\n if count[j]>0:\\n count[j]-=1\\n cur.append(j)\\n dfs(cur)\\n cur.pop()\\n count[j]+=1\\n dfs([])\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n counter = Counter(nums)\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for j in counter:\\n if counter[j]>0:\\n counter[j]-=1\\n cur.append(j)\\n dfs(cur)\\n cur.pop()\\n counter[j]+=1\\n dfs([])\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n counter = Counter(nums)\\n def dfs(i,cur):\\n if i>=len(nums):\\n res.append(cur.copy())\\n return\\n for j in counter:\\n if counter[j]!=0:\\n counter[j]-=1\\n cur.append(j)\\n dfs(i+1,cur)\\n cur.pop()\\n counter[j]+=1\\n dfs(0,[])\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n counter = Counter(nums)\\n def dfs(i,cur):\\n if i>=len(nums):\\n res.append(cur.copy())\\n return\\n for j in counter:\\n if counter[j]!=0:\\n counter[j]-=1\\n cur.append(j)\\n dfs(i+1,cur)\\n cur.pop()\\n counter[j]+=1\\n dfs(0,[])\\n return res\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n res = []\\n # nums.sort()\\n count = Counter(nums)\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for j in count:\\n if count[j]==0:continue\\n count[j]-=1\\n cur.append(j)\\n dfs(cur)\\n cur.pop()\\n count[j]+=1\\n dfs([])\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n res = []\\n count = Counter(nums)\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for j in count:\\n if count[j]==0:continue\\n count[j]-=1\\n cur.append(j)\\n dfs(cur)\\n cur.pop()\\n count[j]+=1\\n dfs([])\\n return res\\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 counter = Counter(nums)\\n res = []\\n def dfs(cur):\\n if len(cur)==len(nums):\\n res.append(cur.copy())\\n return res\\n for j in counter:\\n if counter[j]>0:\\n counter[j]-=1\\n cur.append(j)\\n dfs(cur)\\n cur.pop()\\n counter[j]+=1\\n dfs([])\\n return res\\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 counter = Counter(nums)\\n res = []\\n def dfs(cur):\\n if len(cur)==len(nums):\\n res.append(cur.copy())\\n return\\n for j in counter:\\n if counter[j]>0:\\n counter[j]-=1\\n cur.append(j)\\n dfs(cur)\\n counter[j]+=1\\n cur.pop()\\n\\n dfs([])\\n return res\\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 counter = Counter(nums)\\n res = []\\n def dfs(i,cur):\\n if i>=len(nums):\\n res.append(cur.copy())\\n return\\n for j in counter:\\n if counter[j]!=0:\\n cur.append(j)\\n counter[j]-=1\\n dfs(i+1,cur)\\n counter[j]+=1\\n cur.pop()\\n dfs(0,[])\\n return res\\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 counter = Counter(nums)\\n res = []\\n def dfs(i,cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n if i>=len(nums):return\\n for j in counter:\\n if counter[j]>0:\\n counter[j]-=1\\n cur.append(j)\\n dfs(i+1,cur)\\n cur.pop()\\n counter[j]+=1\\n dfs(0,[])\\n return res\\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\\n\\n counter = Counter(nums)\\n res = []\\n def dfs(i,cur):\\n if len(cur)==len(nums):\\n res.append(cur.copy())\\n return\\n if i>=len(nums):\\n return\\n for j in counter:\\n if counter[j]>0:\\n counter[j]-=1\\n cur.append(j)\\n dfs(i+1,cur)\\n cur.pop()\\n counter[j]+=1\\n dfs(0,[])\\n return res\\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 counter = Counter(nums)\\n res = []\\n def dfs(i,cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n if i>=len(nums):return\\n for j in counter:\\n if counter[j]>0:\\n counter[j] -=1\\n cur.append(j)\\n dfs(i+1,cur)\\n cur.pop()\\n counter[j]+=1\\n dfs(0,[])\\n return res\\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\\n\\n\\n\\n\\n\\n\\n counter = Counter(nums)\\n res = []\\n def dfs(i,cur):\\n if len(cur) == len(nums):\\n \\n res.append(cur.copy())\\n return\\n if i>=len(nums):return\\n for j in counter:\\n if counter[j] > 0:\\n counter[j]-=1\\n cur.append(j)\\n dfs(i+1,cur)\\n counter[j]+=1\\n cur.pop()\\n \\n dfs(0,[])\\n return res\\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\\n counter = Counter(nums)\\n res = []\\n def dfs(i,cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for j in counter:\\n if counter[j]>0:\\n cur.append(j)\\n counter[j]-=1\\n dfs(i+1,cur)\\n counter[j]+=1\\n cur.pop()\\n dfs(0,[])\\n return res\\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\\n\\n\\n\\n res = []\\n counter = Counter(nums)\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for j in counter:\\n if counter[j]>0:\\n cur.append(j)\\n counter[j]-=1\\n dfs(cur)\\n counter[j]+=1\\n cur.pop()\\n dfs([])\\n return res\\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\\n res = []\\n counter = Counter(nums)\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for j in counter:\\n if counter[j]>0:\\n cur.append(j)\\n counter[j]-=1\\n dfs(cur)\\n counter[j]+=1\\n cur.pop()\\n dfs([])\\n return res\\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 \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n res=[]\\n count = Counter(nums)\\n def dfs(cur):\\n if len(cur) == len(nums):\\n res.append(cur.copy())\\n return\\n for n in count:\\n if count[n] >0:\\n cur.append(n)\\n count[n]-=1\\n\\n dfs(cur)\\n\\n count[n]+=1\\n cur.pop()\\n dfs([])\\n return res\\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 \\n \\n def perm(not_so_far,so_far):\\n if len(so_far)==len(nums):\\n res.append(so_far)\\n return\\n for i in set(not_so_far):\\n not_so_far_t=not_so_far.copy()\\n so_far_t=so_far.copy()\\n not_so_far_t.remove(i)\\n so_far_t.append(i)\\n perm(not_so_far_t,so_far_t)\\n perm(nums,[])\\n return res\\n \",\n \"memory\": \"17700\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n # [1,2,3]\\n \\n ans = set()\\n n = len(nums)\\n \\n def helper(i, current):\\n #print(i, current)\\n if i >= n:\\n ans.add(current)\\n return\\n \\n for j in range(len(current)+1):\\n \\n helper(i+1, tuple(current[k] if k < j else nums[i] if k == j else current[k-1] for k in range(len(current)+1)))\\n helper(0, tuple())\\n return ans\",\n \"memory\": \"17800\"\n },\n {\n \"code\": \"class Solution:\\n hash = {}\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n if len(nums)==1:return [nums]\\n nums.sort()\\n stringified = (str(nums))\\n if stringified in self.hash:return self.hash[stringified]\\n l=[]\\n for i in range(len(nums)):\\n for perm in self.permuteUnique( nums[:i]+ nums[i+1:]):\\n x = [nums[i]]+ perm\\n if x not in l:\\n l.append(x)\\n self.hash[stringified] = l\\n return l\\n\",\n \"memory\": \"17900\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n ans = []\\n nums.sort()\\n dic = set()\\n\\n def dfs(index, nums, visited, path, ans):\\n print(path)\\n visited[index] = True\\n curPath = path + [nums[index]]\\n if tuple(curPath) in dic:\\n visited[index] = False\\n return\\n dic.add(tuple(curPath))\\n if len(curPath) == len(nums):\\n ans.append(curPath)\\n visited[index] = False\\n return\\n\\n for i in range(len(nums)):\\n print(visited)\\n if not visited[i]:\\n dfs(i, nums, visited, curPath, ans)\\n visited[index] = False\\n\\n for i in range(len(nums)):\\n visited = [False] * len(nums)\\n dfs(i, nums, visited, [], ans)\\n return ans\\n\",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n ans = []\\n nums.sort()\\n dic = set()\\n\\n def dfs(index, nums, visited, path, ans):\\n print(path)\\n visited[index] = True\\n curPath = path + [nums[index]]\\n if tuple(curPath) in dic:\\n visited[index] = False\\n return\\n dic.add(tuple(curPath))\\n if len(curPath) == len(nums):\\n ans.append(curPath)\\n visited[index] = False\\n return\\n\\n for i in range(len(nums)):\\n if not visited[i]:\\n dfs(i, nums, visited, curPath, ans)\\n visited[index] = False\\n\\n for i in range(len(nums)):\\n visited = [False] * len(nums)\\n dfs(i, nums, visited, [], ans)\\n return ans\\n\",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"class Solution:\\n def get_permutes(self,nums,n,start,elem,ln):\\n if not nums or n==0:\\n return [[elem]]\\n permutes=[]\\n for i in range(n):\\n # if i>0 and nums[i]==nums[i-1] and i<n-1:\\n # continue\\n res=self.get_permutes(nums[0:i]+nums[i+1:],n-1,i+1,nums[i],ln)\\n for r in res:\\n permutes.append([elem]+r)\\n return permutes\\n\\n\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n d={}\\n n=len(nums)\\n ans=[]\\n for i in range(n):\\n # if nums[i] not in d:\\n res=self.get_permutes(nums[0:i]+nums[i+1:],n-1,0,nums[i],n)\\n for r in res:\\n if len(r)==n and r not in ans:\\n ans.append(r)\\n d[nums[i]]=1\\n \\n # print('ans=',ans)\\n return ans\\n\\n\\n\\n \",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n visited = set()\\n\\n def helper(i):\\n if i >= len(nums):\\n return [[]]\\n\\n perms = helper(i+1)\\n resPerms = []\\n\\n for p in perms:\\n for j in range(len(p)+1):\\n pCopy = p.copy()\\n pCopy.insert(j, nums[i])\\n\\n if len(pCopy) == len(nums) and tuple(pCopy) in visited:\\n continue\\n\\n resPerms.append(pCopy)\\n visited.add(tuple(pCopy))\\n \\n return resPerms\\n\\n return helper(0)\\n \",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n \\n n = len(nums)\\n ans = []\\n memo = set()\\n def backtrack(took, sol):\\n if tuple(sol) in memo:\\n return \\n if len(sol) == n:\\n ans.append(sol[:])\\n return\\n for i in range(n):\\n if i not in took:\\n took.add(i)\\n sol.append(nums[i])\\n backtrack(took, sol)\\n memo.add(tuple(sol))\\n took.remove(i)\\n sol.pop()\\n backtrack(set(), [])\\n return ans\\n\\n \",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 1:\\n return [[nums[0]]]\\n freq = collections.Counter(nums)\\n n = len(nums)\\n\\n ret = []\\n def dfs(cur: List[int]) -> List[List[int]]:\\n if len(cur) == n:\\n ret.append(cur.copy())\\n return\\n\\n for num, f in freq.items():\\n if not f:\\n continue\\n freq[num] -= 1\\n cur.append(num)\\n dfs(cur)\\n freq[num] += 1\\n cur.pop()\\n return ret\\n\\n return dfs(deque())\",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 1:\\n return [[nums[0]]]\\n freq = collections.Counter(nums)\\n n = len(nums)\\n\\n ret = deque()\\n def dfs(cur: List[int]) -> List[List[int]]:\\n if len(cur) == n:\\n ret.append(cur.copy())\\n return\\n\\n for num, f in freq.items():\\n if not f:\\n continue\\n freq[num] -= 1\\n cur.append(num)\\n dfs(cur)\\n freq[num] += 1\\n cur.pop()\\n return ret\\n\\n return dfs(deque())\",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"class Solution:\\n def make_permutation(self, idx: int, comb: List[int], nums: List[int], dp, ans):\\n n = len(nums)\\n if (idx, tuple(comb), tuple(nums)) in dp:\\n return\\n if idx >= n:\\n # print(\\\" [Final][COMB]\\\", comb, \\\"[NUMS]\\\", nums)\\n ans.add(tuple(comb))\\n return\\n dp.add((idx, tuple(comb), tuple(nums)))\\n # print(\\\"[COMB]\\\", comb, \\\"[NUMS]\\\", nums)\\n last = None\\n for i in range(n):\\n # the same number has not replaced the same index before\\n if nums[i] != None and nums[i] != last: \\n last = comb[idx] = nums[i]\\n nums[i] = None\\n self.make_permutation(idx + 1, comb, nums, dp, ans)\\n nums[i], comb[idx] = comb[idx], None\\n \\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n # at each idx, can place one of n numbers\\n # each state, a loop till n\\n # repeating states? [idx, [nums]] \\n # n * n! * n\\n n = len(nums)\\n comb = [None] * n\\n ans = set()\\n self.make_permutation(0, comb, nums, set(), ans)\\n return ans\",\n \"memory\": \"18600\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) == 1:\\n return [[nums[0]]]\\n freq = collections.Counter(nums)\\n n = len(nums)\\n\\n ret = deque()\\n def dfs(cur: List[int]) -> None:\\n if len(cur) == n:\\n ret.append(cur.copy())\\n return\\n\\n for num, f in freq.items():\\n if not f:\\n continue\\n freq[num] -= 1\\n cur.append(num)\\n dfs(cur)\\n freq[num] += 1\\n cur.pop()\\n return\\n dfs(deque())\\n return ret\",\n \"memory\": \"18700\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n @cache\\n def p(arr):\\n if len(arr) == 0: return [tuple([])]\\n ans = set([])\\n for i in range(len(arr)):\\n ans.update(set([(arr[i],)+t for t in p(arr[:i]+arr[i+1:])]))\\n return ans\\n nums = tuple(nums)\\n return set(p(nums))\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n @cache\\n def p(arr):\\n if len(arr) == 0: return [tuple([])]\\n ans = set([])\\n for i in range(len(arr)):\\n ans.update(set([(arr[i],)+t for t in p(arr[:i]+arr[i+1:])]))\\n return ans\\n nums = tuple(nums)\\n return set(p(nums))\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"class Solution:\\n def permuteUnique(self, nums: List[int]) -> List[List[int]]:\\n @cache\\n def perms(arr):\\n if not arr: return [tuple([])]\\n ans = set()\\n for i,n in enumerate(arr):\\n ans.update({(n,)+a for a in perms(arr[:i]+arr[i+1:])})\\n return ans\\n return perms(tuple(nums))\\n\",\n \"memory\": \"19300\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":34,"string":"34"}}},{"rowIdx":141,"cells":{"question_id":{"kind":"number","value":48,"string":"48"},"name":{"kind":"string","value":"rotate-image"},"content":{"kind":"string","value":"<p>You are given an <code>n x n</code> 2D <code>matrix</code> representing an image, rotate the image by <strong>90</strong> degrees (clockwise).</p>\n\n<p>You have to rotate the image <a href=\"https://en.wikipedia.org/wiki/In-place_algorithm\" target=\"_blank\"><strong>in-place</strong></a>, which means you have to modify the input 2D matrix directly. <strong>DO NOT</strong> allocate another 2D matrix and do the rotation.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/08/28/mat1.jpg\" style=\"width: 500px; height: 188px;\" />\n<pre>\n<strong>Input:</strong> matrix = [[1,2,3],[4,5,6],[7,8,9]]\n<strong>Output:</strong> [[7,4,1],[8,5,2],[9,6,3]]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/08/28/mat2.jpg\" style=\"width: 500px; height: 201px;\" />\n<pre>\n<strong>Input:</strong> matrix = [[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]]\n<strong>Output:</strong> [[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]\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 <= 20</code></li>\n\t<li><code>-1000 <= matrix[i][j] <= 1000</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":75.86965131568525,"string":"75.869651"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","math","matrix"],"string":"[\n \"array\",\n \"math\",\n \"matrix\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"15\", 0.0077], [\"16\", 0.0077], [\"17\", 0.0038], [\"18\", 0.0154], [\"19\", 0.0307], [\"20\", 0.0615], [\"21\", 0.0499], [\"22\", 0.1306], [\"23\", 0.1114], [\"24\", 0.2727], [\"25\", 0.2343], [\"26\", 0.7336], [\"27\", 0.6222], [\"28\", 1.5057], [\"29\", 1.2598], [\"30\", 2.1894], [\"31\", 1.6555], [\"32\", 4.1521], [\"33\", 4.1367], [\"34\", 4.663], [\"35\", 3.7949], [\"36\", 7.8164], [\"37\", 7.5283], [\"38\", 7.1327], [\"39\", 5.5157], [\"40\", 8.7843], [\"41\", 7.8663], [\"42\", 6.4529], [\"43\", 4.8281], [\"44\", 4.7897], [\"45\", 4.371], [\"46\", 2.9153]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"15800\", 0.0038], [\"16100\", 0.0192], [\"16200\", 0.0461], [\"16300\", 0.6606], [\"16400\", 12.1798], [\"16500\", 40.941], [\"16600\", 37.9028]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def rotate(self, matrix: list[list[int]]) -> None:\n n = len(matrix)\n\n for offset in range(n//2):\n for ind in range(offset, n-offset-1):\n val1 = matrix[offset][ind]\n val2 = matrix[ind][n-offset-1]\n val3 = matrix[n-offset-1][n-ind-1]\n val4= matrix[n-ind-1][offset]\n # print(val1, val2, val3, val4)\n\n matrix[offset][ind] = val4\n matrix[ind][n-offset-1] = val1\n matrix[n-offset-1][n-ind-1] = val2\n matrix[n-ind-1][offset] = val3\n","runtime":"15"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n l = len(matrix)\n rl = ceil(l / 2)\n cl = l // 2\n l -= 1\n for r in range(rl):\n for c in range(cl):\n matrix[r][c], matrix[c][l - r], matrix[l - r][l - c], matrix[l - c][r] = \\\n matrix[l - c][r], matrix[r][c], matrix[c][l - r], matrix[l - r][l - c]","runtime":"16"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n for i in range(n):\n for j in range(i+1,n):\n matrix[i][j],matrix[j][i] = matrix[j][i],matrix[i][j]\n for i in range(n):\n for j in range(n // 2):\n matrix[i][j], matrix[i][n-j-1] = matrix[i][n-j-1], matrix[i][j] ","runtime":"17"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n # find transpose matrix (flipped across diagonal)\n for row in range(n):\n for col in range(row, n):\n matrix[row][col], matrix[col][row] = matrix[col][row], matrix[row][col]\n # reverse the rows of the transpose\n for i in range(n):\n matrix[i] = matrix[i][::-1]\n return matrix","runtime":"18"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n dim = len(matrix)\n\n def transpose(matrix):\n for i in range (dim):\n for j in range (i+1, dim):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n return matrix\n\n def mirror(matrix):\n for i in range (dim):\n for j in range (dim//2):\n matrix[i][j], matrix[i][dim-j-1] = matrix[i][dim-j-1], matrix[i][j]\n return matrix\n\n return mirror(transpose(matrix))\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 # lenMat = len(matrix)\n\n # def transposeMat(matrix):\n # for i in range (lenMat):\n # for j in range (i+1, lenMat):\n # matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n # return matrix\n \n # def mirrorMatrix(matrix):\n # for i in range (lenMat):\n # for j in range (lenMat//2):\n # matrix[i][j], matrix[i][lenMat-j-1] = matrix[i][lenMat-j-1], matrix[i][j]\n\n # return mirrorMatrix(transposeMat(matrix))\n \n ","runtime":"19"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n l,r=0,len(matrix)-1\n top,bottom =l,r\n while l<r and top <bottom :\n for i in range(r-l):\n #save top left in a temporary variable\n topleft = matrix[top][l+i]\n #bottom left to top left\n matrix[top][l+i]=matrix[bottom-i][l]\n #bottom right to bottom left\n matrix[bottom-i][l]=matrix[bottom][r-i]\n #top right to bottom right\n matrix[bottom][r-i]=matrix[top+i][r]\n #temporary to top right \n matrix[top+i][r]= topleft\n # i has been adjusted intuitively \n \n l+=1\n r-=1\n top+=1\n bottom-=1\n \n \n\n\n \n\n\n ","runtime":"20"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n Rotates the matrix 90 degrees clockwise.\n \"\"\"\n n = len(matrix)-1\n\n for r in range(len(matrix)// 2):\n for c in range(r, n - r):\n # Save the value of the top-left element\n first = matrix[r][c]\n \n # Calculate the positions for the rotation\n second_r, second_c = c, n - r # Top-right\n third_r, third_c = n - r, n - c # Bottom-right\n fourth_r, fourth_c = n - c, r # Bottom-left\n\n # Perform the 4-way swap\n matrix[r][c] = matrix[fourth_r][fourth_c] # Move bottom-left to top-left\n matrix[fourth_r][fourth_c] = matrix[third_r][third_c] # Move bottom-right to bottom-left\n matrix[third_r][third_c] = matrix[second_r][second_c] # Move top-right to bottom-right\n matrix[second_r][second_c] = first # Move top-left to top-right\n","runtime":"21"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n\n # Change row first: matrix[top], matrix[bottom] = matrix[bottom], matrix[top]; And then, change i,j: matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n # error1: change element based on diagnoal for j in range(i, len(matrix[i]))\n # T: O(n)\n # S: O(1)\n\n top, bottom = 0, len(matrix)-1\n while top < bottom:\n matrix[top], matrix[bottom] = matrix[bottom], matrix[top]\n top += 1\n bottom -= 1\n \n for i in range(len(matrix)):\n for j in range(i,len(matrix[0])):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n\n\n\n \n\n\n\n\n","runtime":"22"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n left = 0\n right = len(matrix) - 1\n while left < right:\n matrix[left], matrix[right] = matrix[right], matrix[left]\n left += 1\n right -= 1\n for r in range(len(matrix)):\n for c in range(r):\n matrix[r][c], matrix[c][r] = matrix[c][r], matrix[r][c]\n ","runtime":"23"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n k = n // 2\n\n for row in range(k + n % 2):\n for col in range(k):\n top_left = matrix[row][col] # save top left\n matrix[row][col] = matrix[n - col - 1][row] # top left = bottom left\n matrix[n - col - 1][row] = matrix[n - row - 1][n - col - 1] # bottom left = bottom right\n matrix[n - row - 1][n - col - 1] = matrix[col][n - row - 1] # bottom right = top right\n matrix[col][n - row - 1] = top_left # top right = top left\n","runtime":"24"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n\n if not matrix:\n return None\n \n def tranposeMatrix(matrix):\n for i in range(len(matrix)):\n for j in range(i,len(matrix[0])):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n \n def reverseRows(matrix):\n for i in range(len(matrix)):\n left = 0\n right = len(matrix)-1\n while right >= left:\n matrix[i][left], matrix[i][right] = matrix[i][right], matrix[i][left]\n left += 1\n right -= 1\n \n tranposeMatrix(matrix)\n reverseRows(matrix)","runtime":"24"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n matrix.reverse()\n m, n = len(matrix), len(matrix[0])\n for i in range(m):\n for j in range(i):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]","runtime":"25"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n \n n = len(matrix)\n top = 0\n bottom = n - 1\n\n while bottom > top:\n for col in range(n):\n temp = matrix[top][col]\n matrix[top][col] = matrix[bottom][col]\n matrix[bottom][col] = temp\n\n top += 1\n bottom -= 1\n\n for row in range(n):\n for col in range(row + 1, n):\n temp = matrix[row][col]\n matrix[row][col] = matrix[col][row]\n matrix[col][row] = temp\n","runtime":"26"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n \n # 1 4 7\n # 2 5 8\n # 3 6 9\n \n n = len(matrix)\n \n for i in range(n):\n for j in range(i, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n \n for i in range(n):\n matrix[i].reverse()\n \n \n return matrix","runtime":"26"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n new_mat = []\n\n row = col = len(matrix)\n\n for i in range(col):\n new_row = []\n for j in range(row-1, -1, -1):\n new_row.append(matrix[j][i])\n new_mat.append(new_row)\n \n for i in range(row):\n for j in range(col):\n matrix[i][j] = new_mat[i][j]","runtime":"27"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n\n for i in range(n//2):\n matrix[i], matrix[~i] = matrix[~i], matrix[i]\n\n for i,j in itertools.combinations(range(n), 2):\n matrix[j][i], matrix[i][j] = matrix[i][j], matrix[j][i]","runtime":"27"},{"code":"class Solution:\n # There are different methods:\n # -- Transpose and Reverse:\n # => Time Complexity: O(n²), Space Complexity: O(1)\n # => Use case: Best for in-place rotation and when simplicity is needed.\n # -- Layer-by-Layer Rotation:\n # => Time Complexity: O(n²), Space Complexity: O(1)\n # => Use case: Best for understanding in-place rotation from an intuitive standpoint, as it rotates groups of four elements.\n # -- Using a Temporary Matrix:\n # => Time Complexity: O(n²), Space Complexity: O(n²)\n # => Use case: Best when in-place rotation is not required, and readability/simplicity is more important than space optimization.\n def rotate_methods(self, matrix: List[List[int]], repeat_num: int = 1) -> None:\n print(self.rotate_using_reverse_and_transpose(matrix.copy()))\n execution_time = timeit.timeit(lambda: self.rotate_using_reverse_and_transpose(matrix.copy()), number=repeat_num)\n print(f\"rotate_using_reverse_and_transpose execution time: {execution_time:.6f} seconds\\n\")\n\n print(self.rotate_w_layer_by_layer(matrix.copy()))\n execution_time = timeit.timeit(lambda: self.rotate_w_layer_by_layer(matrix.copy()), number=repeat_num)\n print(f\"rotate_w_layer_by_layer execution time: {execution_time:.6f} seconds\\n\")\n\n print(self.rotate_using_temp_matrix(matrix.copy()))\n execution_time = timeit.timeit(lambda: self.rotate_using_temp_matrix(matrix.copy()), number=repeat_num)\n print(f\"rotate_using_temp_matrix execution time: {execution_time:.6f} seconds\\n\")\n\n\n # >> METHOD 1 Optimum: Transpose and Reverse\n # Use case: Best for in-place rotation and when simplicity is needed.\n # Time Complexity: O(n²)\n # Space Complexity: O(1)\n # Pros:\n # - Easy to implement\n # - space-efficient.\n def rotate_using_reverse_and_transpose(self, matrix: List[List[int]]) -> None:\n # >> METHOD 1.1:\n # Time Complexity: O(n²)\n # ! Total: O(n^2) + O(n)\n # Space Complexity: O(1)\n # Pros:\n # - Easy to implement\n # - space-efficient.\n # Cons:\n # - Requires two passes through the matrix (transposition and row reversal).\n def w_iteration() -> None:\n n = len(matrix)\n for i in range(n):\n for j in range(i, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n\n # Step 2: Reverse each row\n for i in range(n):\n matrix[i].reverse()\n #print(\"w_iteration: \", matrix)\n\n\n # >> METHOD 1.2:\n # Time complexity: O(n^2)\n # - reverse: O(n) iterates over all ROWS(n: num of rows)\n # - transpose: O(n^2) iterates over every element\n # - converting tuples to list: O(n^2) iterates over every element\n # ! - Total: 2*O(n^2) + O(n)\n # - The dominant term here is O(n²) due to the transposition and list conversion\n # Space complexity: O(1)\n # - Temporary list of tuples: The zip(*matrix[::-1]) operation creates a list of tuples during transposition.\n # - matrix[::-1] happens in place, it temporarily holds an intermediate result. This takes O(n) space.\n # Pros:\n # - Simplicity: The approach is easy to understand and implement.\n # Cros:\n # - Uses intermediate tuples: zip(*matrix[::-1]) creates an intermediate list of tuples, which requires converting back to a list\n # - less readable for beginners.\n # - less efficient than \"rotate_using_reverse_and_transpose_w_iteration()\"\n def w_zip(self, matrix: List[List[int]]) -> None:\n # reverse: matrix[::-1] Time complexity: O(n)\n # transpose: zip(*matrix) Time complexity: O(n^2)\n # converting tuples to list: [list(row) for row in XX] Time complexity: O(n^2) iterates over all elements once.\n\n # matrix = list(zip(*matrix[::-1])) # matrix is list of tuple so below code is more convenient\n matrix[:] = [list(row) for row in zip(*matrix[::-1])]\n print(\"w_zip: \", matrix)\n\n\n # >> METHOD 1.3\n # Time complexity: O(n^2)\n # - reverse (matrix[::-1]) : O(n)\n # - transpose (zip(*matrix..)) : O(n^2)\n # - convert tuple to list (map(list, ..)) : O(n^2)\n # because each of the n rows has n elements\n # - converts the map to a list (list(...)) : O(n)\n # ! - Total : 2*O(n^2) + 2*O(n)\n def w_zip_and_map(self, matrix: List[List[int]]) -> None:\n matrix = list(map(list, zip(*matrix[::-1])))\n print(\"w_zip_and_map: \", matrix)\n\n w_iteration()\n\n\n # >> METHOD 2: Rotating Layer by Layer\n # Use case:\n # - Best for understanding in-place rotation from an intuitive standpoint, as it rotates groups of four elements.\n # Approach:\n # - Rotate the matrix layer by layer, starting from the outermost layer and moving inward.\n # - For each layer, rotate the elements in groups of four by swapping them from four different corners.\n # Time Complexity: O(n^2)\n # Space Complexity: O(1)\n # Pros:\n # - More intuitive for in-place rotation of individual elements without transposing or reversing.\n # Cons:\n # - Slightly more complex to implement compared to transpose/reverse.\n def rotate_w_layer_by_layer(self, matrix: List[List[int]]) -> None:\n n = len(matrix)\n\n for i in range(n // 2):\n for j in range(i, n - i - 1):\n # Perform four-way swap\n temp = matrix[i][j]\n matrix[i][j] = matrix[n - j - 1][i]\n matrix[n - j - 1][i] = matrix[n - i - 1][n - j - 1]\n matrix[n - i - 1][n - j - 1] = matrix[j][n - i - 1]\n matrix[j][n - i - 1] = temp\n print(\"rotate_w_layer_by_layer: \", matrix)\n\n\n # >> METHOD : Using a Temporary Matrix (Not In-Place)\n # Use case:\n # - readability/simplicity is more important than space optimization.\n # Approach:\n # - Use an auxiliary matrix to store the rotated version of the original matrix.\n # - Copy elements from the original matrix to the corresponding positions in the new matrix,\n # - and then copy the new matrix back into the original matrix.\n # Time Complexity: O(n²)\n # - visit each element twice (once to read and once to write).\n # Space Complexity: O(n²)\n # Pros: Conceptually simple and easy to implement.\n # Cons: Requires extra space and is not an in-place solution.\n def rotate_using_temp_matrix(self, matrix: List[List[int]]) -> None:\n n = len(matrix)\n new_matrix = [[0] * n for _ in range(n)]\n\n for i in range(n):\n for j in range(n):\n new_matrix[j][n - i - 1] = matrix[i][j]\n\n # Copy new_matrix back to matrix\n matrix = new_matrix.copy() # Time complexity: O(n^2)\n print(\"rotate_using_temp_matrix: \", matrix)\n\n\n def rotate(self, matrix: List[List[int]]) -> None:\n self.rotate_using_reverse_and_transpose(matrix)\n\n","runtime":"28"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n l, r = 0, len(matrix) - 1\n while l < r:\n for i in range(r - l):\n top, bottom = l, r\n\n # save the topleft\n topLeft = matrix[top][l + i]\n\n # move bottom left into top left\n matrix[top][l + i] = matrix[bottom - i][l]\n\n # move bottom right into bottom left\n matrix[bottom - i][l] = matrix[bottom][r - i]\n\n # move top right into bottom right\n matrix[bottom][r - i] = matrix[top + i][r]\n\n # move top left into top right\n matrix[top + i][r] = topLeft\n r -= 1\n l += 1\n","runtime":"28"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n n = len(matrix)\n left, right = 0, n - 1\n\n while left < right:\n top, bottom = left, right\n for i in range(right - left):\n # replace top left with bottom left\n tmp = matrix[top][left + i]\n matrix[top][left + i] = matrix[bottom - i][left]\n # replace bottom left with bottom right\n matrix[bottom - i][left] = matrix[bottom][right - i]\n # replace bottom right with top right\n matrix[bottom][right - i] = matrix[top + i][right]\n # replace top right with top left\n matrix[top + i][right] = tmp\n left += 1\n right -= 1\n \n\n\n\n\n\n\n ","runtime":"29"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n=len(matrix)\n for i in range(n):\n for j in range(i,n):\n temp = matrix[i][j]\n matrix[i][j] = matrix[j][i]\n matrix[j][i] = temp\n for i in range(n):\n matrix[i] = matrix[i][::-1]\n \n ","runtime":"29"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n\n # transpose the matrix\n for i in range(n):\n for j in range(i, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n \n # reverse rows\n for i in range(n):\n for j in range(n//2):\n matrix[i][j], matrix[i][n-j-1] = matrix[i][n-j-1], matrix[i][j]\n\n","runtime":"30"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n l, r = 0, len(matrix) - 1\n while l < r:\n for i in range(r-l):\n top, bottom = l, r\n topLeft = matrix[top][l+i]\n matrix[top][l+i] = matrix[bottom-i][l]\n matrix[bottom-i][l] = matrix[bottom][r-i]\n matrix[bottom][r-i]=matrix[top+i][r]\n matrix[top+i][r] = topLeft\n r -= 1\n l += 1\n\n \n","runtime":"30"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n \n for i in range(len(matrix)):\n for j in range(i):\n matrix[i][j],matrix[j][i]=matrix[j][i],matrix[i][j]\n for i in range(len(matrix)):\n matrix[i].reverse()","runtime":"31"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n\n rmatrix = list(zip(*matrix))\n\n for i in range(len(matrix)):\n matrix[i] = rmatrix[i][::-1]\n ","runtime":"31"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n\n # transpose the matrix\n for i in range(n):\n for j in range(i, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n \n # reverse rows\n for i in range(n):\n for j in range(n//2):\n matrix[i][j], matrix[i][n-j-1] = matrix[i][n-j-1], matrix[i][j]\n\n","runtime":"32"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n r = c = n // 2\n if n % 2 == 1: r += 1\n\n def rotate(i, j):\n matrix[i][j], matrix[j][(n-1)-i], matrix[(n-1)-i][(n-1)-j], matrix[(n-1)-j][i] = matrix[(n-1)-j][i], matrix[i][j], matrix[j][(n-1)-i], matrix[(n-1)-i][(n-1)-j]\n \n for i in range(r):\n for j in range(c):\n rotate(i, j)","runtime":"32"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n rows = len(matrix)\n cols = len(matrix[0])\n up = 0\n down = rows - 1\n while up < down:\n tmpUpvlaue = matrix[up]\n tmpDownValue = matrix[down]\n matrix[up] = tmpDownValue\n matrix[down] = tmpUpvlaue\n up += 1\n down -= 1\n \n for r in range(rows):\n for c in range(r):\n matrix[r][c], matrix[c][r] = matrix[c][r], matrix[r][c]\n\n","runtime":"33"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n a = matrix\n\n for i in range(n):\n for j in range(i+1,n):\n a[i][j], a[j][i] = a[j][i], a[i][j]\n\n for i in range(n):\n for j in range(n//2):\n a[i][j], a[i][n-j-1] = a[i][n-j-1],a[i][j]","runtime":"33"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n \n for i in range(n):\n for j in range(i,n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n \n for row in matrix:\n row.reverse()\n \n \n ","runtime":"34"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n\n # transpose the matrix\n for i in range(n):\n for j in range(i, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n \n # reverse rows\n for i in range(n):\n for j in range(n//2):\n matrix[i][j], matrix[i][n-j-1] = matrix[i][n-j-1], matrix[i][j]\n\n","runtime":"34"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n\n # transpose the matrix\n for i in range(n):\n for j in range(i, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n \n # reverse rows\n for i in range(n):\n for j in range(n//2):\n matrix[i][j], matrix[i][n-j-1] = matrix[i][n-j-1], matrix[i][j]\n\n","runtime":"35"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n for m in range(len(matrix)):\n for n in range(m+1, len(matrix)):\n matrix[m][n], matrix[n][m] = matrix[n][m], matrix[m][n]\n\n for i in range(len(matrix)):\n for j in range(len(matrix)//2):\n matrix[i][j], matrix[i][len(matrix)-j-1] = matrix[i][len(matrix)-j-1], matrix[i][j]\n\n\n","runtime":"35"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n\n # transpose the matrix\n for i in range(n):\n for j in range(i, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n \n # reverse rows\n for i in range(n):\n for j in range(n//2):\n matrix[i][j], matrix[i][n-j-1] = matrix[i][n-j-1], matrix[i][j]\n\n","runtime":"36"},{"code":"class Solution(object):\n\n def rotate(self, matrix):\n \"\"\"\n :type matrix: List[List[int]]\n :rtype: None Do not return anything, modify matrix in-place instead.\n \"\"\"\n\n n = len(matrix)\n # transpose the matrix\n for r in range(n):\n for c in range(r,n):\n if (r != c) :\n matrix[r][c], matrix[c][r] = matrix[c][r],matrix[r][c]\n\n # swap the last and the first element \n for r in range(n):\n for passes in range(n//2):\n rows = matrix[r]\n rows[passes], rows[(-1-passes)] = rows[(-1-passes)], rows[passes]\n\n\n\n\n\n \n\n\n\n\n ","runtime":"36"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n count = n\n k = 0\n while count >= 2:\n for j in range(count-1):\n x = y = k\n x += j\n temp = matrix[y][x]\n y = n-y-1\n x,y = y,x\n for i in range(4):\n matrix[y][x], temp = temp, matrix[y][x]\n y = n-y-1\n x,y = y,x\n count -= 2\n k += 1\n return\n\n\n ","runtime":"37"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n\n # Transpose the matrix\n for i in range(n):\n for j in range(i, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n\n # Reverse the matrix\n for i in range(n):\n matrix[i].reverse()\n \n return matrix\n \n # TC: O(n * n) for transposing\n # O(n * n) for reversing\n # Overall TC: O(n * n)\n\n # SC: O(1)","runtime":"37"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n i=0\n j=n-1\n while i<j:\n matrix[i],matrix[j] = matrix[j],matrix[i]\n i+=1\n j-=1\n for i in range(n):\n for j in range(i+1,n):\n matrix[i][j],matrix[j][i] = matrix[j][i],matrix[i][j]\n \n\n ","runtime":"38"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n def transpose(matrix):\n n = len(matrix)\n\n for i in range(0, n):\n bottom_left = (n-1, i)\n top_right = (i, n-1)\n while bottom_left != top_right:\n bottom_r, bottom_c = bottom_left\n top_r, top_c = top_right\n matrix[bottom_r][bottom_c], matrix[top_r][top_c] = matrix[top_r][top_c], matrix[bottom_r][bottom_c]\n\n bottom_left = (bottom_r - 1, bottom_c)\n top_right = (top_r, top_c - 1)\n \n\n def reverse(matrix):\n for row in matrix:\n for idx in range(0, len(row)//2):\n row[idx], row[len(row) - idx - 1] = row[len(row) - idx - 1], row[idx]\n \n\n transpose(matrix)\n reverse(matrix)\n return","runtime":"38"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n l, r = 0, len(matrix)-1\n while l < r:\n for i in range(r - l):\n top, btm = l, r \n tmp = matrix[top][l+i]\n matrix[top][l+i] = matrix[btm -i][l]\n matrix[btm -i][l] = matrix[btm][r-i]\n matrix[btm][r-i] = matrix[top+i][r]\n matrix[top+i][r] = tmp\n\n l+=1\n r-=1","runtime":"39"},{"code":"class Solution:\n def rotate(self, m: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n size = len(m)\n for i in range(len(m)):\n for j in range(i + 1, size):\n m[i][j],m[j][i] = m[j][i],m[i][j]\n\n for i in range(len(m)):\n m[i].reverse()\n ","runtime":"39"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n\n matrix.reverse()\n for i in range(n):\n for j in range(i):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n","runtime":"40"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n # if not matrix:\n # return []\n n=len(matrix)\n for i in range(n):\n for j in range(i+1,n):\n matrix[i][j],matrix[j][i]=matrix[j][i],matrix[i][j]\n \n for i in range(n):\n l=0\n h=n-1\n while l<h:\n matrix[i][l],matrix[i][h]=matrix[i][h],matrix[i][l]\n l+=1\n h-=1 \n ","runtime":"40"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n \n for i in range(n):\n for j in range(i,n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n \n for row in matrix:\n row.reverse()\n \n \n ","runtime":"41"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n mlen = len(matrix)\n \n matrix.extend([[matrix[j][i] for j in reversed(range(mlen))] for i in range(mlen)])\n for i in range(mlen):\n matrix.pop(0)\n","runtime":"42"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n \n for i in range(n):\n for j in range(i, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n for i in range(n):\n matrix[i].reverse()","runtime":"42"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n= len(matrix)\n l = 0\n r = n-1\n\n while l<r:\n matrix[l], matrix[r] = matrix[r], matrix[l]\n l+=1\n r-=1\n \n for i in range(n):\n for j in range(i):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]","runtime":"43"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n # i = 0\n # j = 0\n # while i < n:\n # while j < n - i:\n # swap = matrix[i][j]\n # matrix[i][j] = matrix[j][i]\n # matrix[j][i] = swap\n\n # if j <= (n/2) - i:\n # swapLast = matrix[-1 - i][-1 - j]\n # matrix[-1 - i][-1 - j] = matrix[-1 - j][-1 - i]\n # matrix[-1 - j][-1 - i] = swapLast\n # j += 1\n\n # i += 1\n # j = i\n\n for i in range(n):\n for j in range(i+1, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n\n print(matrix)\n x, y = 0, 0\n while x < n:\n while y < n/2:\n swap = matrix[x][y]\n # print(swap)\n matrix[x][y] = matrix[x][-1 - y]\n matrix[x][-1 - y] = swap\n y += 1\n y = 0\n x += 1\n","runtime":"43"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n for i in range(n):\n for j in range(i + 1, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n\n for row in matrix:\n row.reverse()\n ","runtime":"44"},{"code":"class Solution:\n def rotate(self, m: List[List[int]]) -> None:\n for i in range(len(m)):\n for j in range(i):\n m[i][j],m[j][i] = m[j][i],m[i][j]\n for i in range(len(m)):\n m[i].reverse()","runtime":"44"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n # reverse\n l = 0\n r = len(matrix) -1\n while l < r:\n matrix[l], matrix[r] = matrix[r], matrix[l]\n l += 1\n r -= 1\n # transpose \n for i in range(len(matrix)):\n for j in range(i):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n\t\t ","runtime":"45"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n \n for i in range(n):\n for j in range(i + 1, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n \n for i in range(n):\n matrix[i].reverse()\n\n ","runtime":"45"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n for i in range(n):\n for j in range(i,n):\n matrix[i][j],matrix[j][i]= matrix[j][i], matrix[i][j]\n \n for i in range(n):\n matrix[i].reverse()","runtime":"46"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n l,r = 0, len(matrix) -1\n while l < r:\n for i in range(r - l):\n top, bottom = l, r\n #save the top right value to temp_value\n temp_value = matrix[top][l + i]\n\n #replace top right with bottom right value\n matrix[top][l + i] = matrix[bottom - i][l]\n\n #replace bottom left with bottom right value\n matrix[bottom - i][l] = matrix[bottom][r - i]\n\n #replace bottom right with top right value\n matrix[bottom][r - i] = matrix[top + i][r]\n\n #replace top right with top left value\n matrix[top + i][r] = temp_value\n\n l += 1\n r -= 1\n ","runtime":"46"}],"string":"[\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: list[list[int]]) -> None:\\n n = len(matrix)\\n\\n for offset in range(n//2):\\n for ind in range(offset, n-offset-1):\\n val1 = matrix[offset][ind]\\n val2 = matrix[ind][n-offset-1]\\n val3 = matrix[n-offset-1][n-ind-1]\\n val4= matrix[n-ind-1][offset]\\n # print(val1, val2, val3, val4)\\n\\n matrix[offset][ind] = val4\\n matrix[ind][n-offset-1] = val1\\n matrix[n-offset-1][n-ind-1] = val2\\n matrix[n-ind-1][offset] = val3\\n\",\n \"runtime\": \"15\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n l = len(matrix)\\n rl = ceil(l / 2)\\n cl = l // 2\\n l -= 1\\n for r in range(rl):\\n for c in range(cl):\\n matrix[r][c], matrix[c][l - r], matrix[l - r][l - c], matrix[l - c][r] = \\\\\\n matrix[l - c][r], matrix[r][c], matrix[c][l - r], matrix[l - r][l - c]\",\n \"runtime\": \"16\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n for i in range(n):\\n for j in range(i+1,n):\\n matrix[i][j],matrix[j][i] = matrix[j][i],matrix[i][j]\\n for i in range(n):\\n for j in range(n // 2):\\n matrix[i][j], matrix[i][n-j-1] = matrix[i][n-j-1], matrix[i][j] \",\n \"runtime\": \"17\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n # find transpose matrix (flipped across diagonal)\\n for row in range(n):\\n for col in range(row, n):\\n matrix[row][col], matrix[col][row] = matrix[col][row], matrix[row][col]\\n # reverse the rows of the transpose\\n for i in range(n):\\n matrix[i] = matrix[i][::-1]\\n return matrix\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n dim = len(matrix)\\n\\n def transpose(matrix):\\n for i in range (dim):\\n for j in range (i+1, dim):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n return matrix\\n\\n def mirror(matrix):\\n for i in range (dim):\\n for j in range (dim//2):\\n matrix[i][j], matrix[i][dim-j-1] = matrix[i][dim-j-1], matrix[i][j]\\n return matrix\\n\\n return mirror(transpose(matrix))\\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 # lenMat = len(matrix)\\n\\n # def transposeMat(matrix):\\n # for i in range (lenMat):\\n # for j in range (i+1, lenMat):\\n # matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n # return matrix\\n \\n # def mirrorMatrix(matrix):\\n # for i in range (lenMat):\\n # for j in range (lenMat//2):\\n # matrix[i][j], matrix[i][lenMat-j-1] = matrix[i][lenMat-j-1], matrix[i][j]\\n\\n # return mirrorMatrix(transposeMat(matrix))\\n \\n \",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n l,r=0,len(matrix)-1\\n top,bottom =l,r\\n while l<r and top <bottom :\\n for i in range(r-l):\\n #save top left in a temporary variable\\n topleft = matrix[top][l+i]\\n #bottom left to top left\\n matrix[top][l+i]=matrix[bottom-i][l]\\n #bottom right to bottom left\\n matrix[bottom-i][l]=matrix[bottom][r-i]\\n #top right to bottom right\\n matrix[bottom][r-i]=matrix[top+i][r]\\n #temporary to top right \\n matrix[top+i][r]= topleft\\n # i has been adjusted intuitively \\n \\n l+=1\\n r-=1\\n top+=1\\n bottom-=1\\n \\n \\n\\n\\n \\n\\n\\n \",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n Rotates the matrix 90 degrees clockwise.\\n \\\"\\\"\\\"\\n n = len(matrix)-1\\n\\n for r in range(len(matrix)// 2):\\n for c in range(r, n - r):\\n # Save the value of the top-left element\\n first = matrix[r][c]\\n \\n # Calculate the positions for the rotation\\n second_r, second_c = c, n - r # Top-right\\n third_r, third_c = n - r, n - c # Bottom-right\\n fourth_r, fourth_c = n - c, r # Bottom-left\\n\\n # Perform the 4-way swap\\n matrix[r][c] = matrix[fourth_r][fourth_c] # Move bottom-left to top-left\\n matrix[fourth_r][fourth_c] = matrix[third_r][third_c] # Move bottom-right to bottom-left\\n matrix[third_r][third_c] = matrix[second_r][second_c] # Move top-right to bottom-right\\n matrix[second_r][second_c] = first # Move top-left to top-right\\n\",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n\\n # Change row first: matrix[top], matrix[bottom] = matrix[bottom], matrix[top]; And then, change i,j: matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n # error1: change element based on diagnoal for j in range(i, len(matrix[i]))\\n # T: O(n)\\n # S: O(1)\\n\\n top, bottom = 0, len(matrix)-1\\n while top < bottom:\\n matrix[top], matrix[bottom] = matrix[bottom], matrix[top]\\n top += 1\\n bottom -= 1\\n \\n for i in range(len(matrix)):\\n for j in range(i,len(matrix[0])):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n\\n\\n\\n \\n\\n\\n\\n\\n\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n left = 0\\n right = len(matrix) - 1\\n while left < right:\\n matrix[left], matrix[right] = matrix[right], matrix[left]\\n left += 1\\n right -= 1\\n for r in range(len(matrix)):\\n for c in range(r):\\n matrix[r][c], matrix[c][r] = matrix[c][r], matrix[r][c]\\n \",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n k = n // 2\\n\\n for row in range(k + n % 2):\\n for col in range(k):\\n top_left = matrix[row][col] # save top left\\n matrix[row][col] = matrix[n - col - 1][row] # top left = bottom left\\n matrix[n - col - 1][row] = matrix[n - row - 1][n - col - 1] # bottom left = bottom right\\n matrix[n - row - 1][n - col - 1] = matrix[col][n - row - 1] # bottom right = top right\\n matrix[col][n - row - 1] = top_left # top right = top left\\n\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n\\n if not matrix:\\n return None\\n \\n def tranposeMatrix(matrix):\\n for i in range(len(matrix)):\\n for j in range(i,len(matrix[0])):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n \\n def reverseRows(matrix):\\n for i in range(len(matrix)):\\n left = 0\\n right = len(matrix)-1\\n while right >= left:\\n matrix[i][left], matrix[i][right] = matrix[i][right], matrix[i][left]\\n left += 1\\n right -= 1\\n \\n tranposeMatrix(matrix)\\n reverseRows(matrix)\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n matrix.reverse()\\n m, n = len(matrix), len(matrix[0])\\n for i in range(m):\\n for j in range(i):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n \\n n = len(matrix)\\n top = 0\\n bottom = n - 1\\n\\n while bottom > top:\\n for col in range(n):\\n temp = matrix[top][col]\\n matrix[top][col] = matrix[bottom][col]\\n matrix[bottom][col] = temp\\n\\n top += 1\\n bottom -= 1\\n\\n for row in range(n):\\n for col in range(row + 1, n):\\n temp = matrix[row][col]\\n matrix[row][col] = matrix[col][row]\\n matrix[col][row] = temp\\n\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n \\n # 1 4 7\\n # 2 5 8\\n # 3 6 9\\n \\n n = len(matrix)\\n \\n for i in range(n):\\n for j in range(i, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n \\n for i in range(n):\\n matrix[i].reverse()\\n \\n \\n return matrix\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n new_mat = []\\n\\n row = col = len(matrix)\\n\\n for i in range(col):\\n new_row = []\\n for j in range(row-1, -1, -1):\\n new_row.append(matrix[j][i])\\n new_mat.append(new_row)\\n \\n for i in range(row):\\n for j in range(col):\\n matrix[i][j] = new_mat[i][j]\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n\\n for i in range(n//2):\\n matrix[i], matrix[~i] = matrix[~i], matrix[i]\\n\\n for i,j in itertools.combinations(range(n), 2):\\n matrix[j][i], matrix[i][j] = matrix[i][j], matrix[j][i]\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n # There are different methods:\\n # -- Transpose and Reverse:\\n # => Time Complexity: O(n²), Space Complexity: O(1)\\n # => Use case: Best for in-place rotation and when simplicity is needed.\\n # -- Layer-by-Layer Rotation:\\n # => Time Complexity: O(n²), Space Complexity: O(1)\\n # => Use case: Best for understanding in-place rotation from an intuitive standpoint, as it rotates groups of four elements.\\n # -- Using a Temporary Matrix:\\n # => Time Complexity: O(n²), Space Complexity: O(n²)\\n # => Use case: Best when in-place rotation is not required, and readability/simplicity is more important than space optimization.\\n def rotate_methods(self, matrix: List[List[int]], repeat_num: int = 1) -> None:\\n print(self.rotate_using_reverse_and_transpose(matrix.copy()))\\n execution_time = timeit.timeit(lambda: self.rotate_using_reverse_and_transpose(matrix.copy()), number=repeat_num)\\n print(f\\\"rotate_using_reverse_and_transpose execution time: {execution_time:.6f} seconds\\\\n\\\")\\n\\n print(self.rotate_w_layer_by_layer(matrix.copy()))\\n execution_time = timeit.timeit(lambda: self.rotate_w_layer_by_layer(matrix.copy()), number=repeat_num)\\n print(f\\\"rotate_w_layer_by_layer execution time: {execution_time:.6f} seconds\\\\n\\\")\\n\\n print(self.rotate_using_temp_matrix(matrix.copy()))\\n execution_time = timeit.timeit(lambda: self.rotate_using_temp_matrix(matrix.copy()), number=repeat_num)\\n print(f\\\"rotate_using_temp_matrix execution time: {execution_time:.6f} seconds\\\\n\\\")\\n\\n\\n # >> METHOD 1 Optimum: Transpose and Reverse\\n # Use case: Best for in-place rotation and when simplicity is needed.\\n # Time Complexity: O(n²)\\n # Space Complexity: O(1)\\n # Pros:\\n # - Easy to implement\\n # - space-efficient.\\n def rotate_using_reverse_and_transpose(self, matrix: List[List[int]]) -> None:\\n # >> METHOD 1.1:\\n # Time Complexity: O(n²)\\n # ! Total: O(n^2) + O(n)\\n # Space Complexity: O(1)\\n # Pros:\\n # - Easy to implement\\n # - space-efficient.\\n # Cons:\\n # - Requires two passes through the matrix (transposition and row reversal).\\n def w_iteration() -> None:\\n n = len(matrix)\\n for i in range(n):\\n for j in range(i, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n\\n # Step 2: Reverse each row\\n for i in range(n):\\n matrix[i].reverse()\\n #print(\\\"w_iteration: \\\", matrix)\\n\\n\\n # >> METHOD 1.2:\\n # Time complexity: O(n^2)\\n # - reverse: O(n) iterates over all ROWS(n: num of rows)\\n # - transpose: O(n^2) iterates over every element\\n # - converting tuples to list: O(n^2) iterates over every element\\n # ! - Total: 2*O(n^2) + O(n)\\n # - The dominant term here is O(n²) due to the transposition and list conversion\\n # Space complexity: O(1)\\n # - Temporary list of tuples: The zip(*matrix[::-1]) operation creates a list of tuples during transposition.\\n # - matrix[::-1] happens in place, it temporarily holds an intermediate result. This takes O(n) space.\\n # Pros:\\n # - Simplicity: The approach is easy to understand and implement.\\n # Cros:\\n # - Uses intermediate tuples: zip(*matrix[::-1]) creates an intermediate list of tuples, which requires converting back to a list\\n # - less readable for beginners.\\n # - less efficient than \\\"rotate_using_reverse_and_transpose_w_iteration()\\\"\\n def w_zip(self, matrix: List[List[int]]) -> None:\\n # reverse: matrix[::-1] Time complexity: O(n)\\n # transpose: zip(*matrix) Time complexity: O(n^2)\\n # converting tuples to list: [list(row) for row in XX] Time complexity: O(n^2) iterates over all elements once.\\n\\n # matrix = list(zip(*matrix[::-1])) # matrix is list of tuple so below code is more convenient\\n matrix[:] = [list(row) for row in zip(*matrix[::-1])]\\n print(\\\"w_zip: \\\", matrix)\\n\\n\\n # >> METHOD 1.3\\n # Time complexity: O(n^2)\\n # - reverse (matrix[::-1]) : O(n)\\n # - transpose (zip(*matrix..)) : O(n^2)\\n # - convert tuple to list (map(list, ..)) : O(n^2)\\n # because each of the n rows has n elements\\n # - converts the map to a list (list(...)) : O(n)\\n # ! - Total : 2*O(n^2) + 2*O(n)\\n def w_zip_and_map(self, matrix: List[List[int]]) -> None:\\n matrix = list(map(list, zip(*matrix[::-1])))\\n print(\\\"w_zip_and_map: \\\", matrix)\\n\\n w_iteration()\\n\\n\\n # >> METHOD 2: Rotating Layer by Layer\\n # Use case:\\n # - Best for understanding in-place rotation from an intuitive standpoint, as it rotates groups of four elements.\\n # Approach:\\n # - Rotate the matrix layer by layer, starting from the outermost layer and moving inward.\\n # - For each layer, rotate the elements in groups of four by swapping them from four different corners.\\n # Time Complexity: O(n^2)\\n # Space Complexity: O(1)\\n # Pros:\\n # - More intuitive for in-place rotation of individual elements without transposing or reversing.\\n # Cons:\\n # - Slightly more complex to implement compared to transpose/reverse.\\n def rotate_w_layer_by_layer(self, matrix: List[List[int]]) -> None:\\n n = len(matrix)\\n\\n for i in range(n // 2):\\n for j in range(i, n - i - 1):\\n # Perform four-way swap\\n temp = matrix[i][j]\\n matrix[i][j] = matrix[n - j - 1][i]\\n matrix[n - j - 1][i] = matrix[n - i - 1][n - j - 1]\\n matrix[n - i - 1][n - j - 1] = matrix[j][n - i - 1]\\n matrix[j][n - i - 1] = temp\\n print(\\\"rotate_w_layer_by_layer: \\\", matrix)\\n\\n\\n # >> METHOD : Using a Temporary Matrix (Not In-Place)\\n # Use case:\\n # - readability/simplicity is more important than space optimization.\\n # Approach:\\n # - Use an auxiliary matrix to store the rotated version of the original matrix.\\n # - Copy elements from the original matrix to the corresponding positions in the new matrix,\\n # - and then copy the new matrix back into the original matrix.\\n # Time Complexity: O(n²)\\n # - visit each element twice (once to read and once to write).\\n # Space Complexity: O(n²)\\n # Pros: Conceptually simple and easy to implement.\\n # Cons: Requires extra space and is not an in-place solution.\\n def rotate_using_temp_matrix(self, matrix: List[List[int]]) -> None:\\n n = len(matrix)\\n new_matrix = [[0] * n for _ in range(n)]\\n\\n for i in range(n):\\n for j in range(n):\\n new_matrix[j][n - i - 1] = matrix[i][j]\\n\\n # Copy new_matrix back to matrix\\n matrix = new_matrix.copy() # Time complexity: O(n^2)\\n print(\\\"rotate_using_temp_matrix: \\\", matrix)\\n\\n\\n def rotate(self, matrix: List[List[int]]) -> None:\\n self.rotate_using_reverse_and_transpose(matrix)\\n\\n\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n l, r = 0, len(matrix) - 1\\n while l < r:\\n for i in range(r - l):\\n top, bottom = l, r\\n\\n # save the topleft\\n topLeft = matrix[top][l + i]\\n\\n # move bottom left into top left\\n matrix[top][l + i] = matrix[bottom - i][l]\\n\\n # move bottom right into bottom left\\n matrix[bottom - i][l] = matrix[bottom][r - i]\\n\\n # move top right into bottom right\\n matrix[bottom][r - i] = matrix[top + i][r]\\n\\n # move top left into top right\\n matrix[top + i][r] = topLeft\\n r -= 1\\n l += 1\\n\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n n = len(matrix)\\n left, right = 0, n - 1\\n\\n while left < right:\\n top, bottom = left, right\\n for i in range(right - left):\\n # replace top left with bottom left\\n tmp = matrix[top][left + i]\\n matrix[top][left + i] = matrix[bottom - i][left]\\n # replace bottom left with bottom right\\n matrix[bottom - i][left] = matrix[bottom][right - i]\\n # replace bottom right with top right\\n matrix[bottom][right - i] = matrix[top + i][right]\\n # replace top right with top left\\n matrix[top + i][right] = tmp\\n left += 1\\n right -= 1\\n \\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n=len(matrix)\\n for i in range(n):\\n for j in range(i,n):\\n temp = matrix[i][j]\\n matrix[i][j] = matrix[j][i]\\n matrix[j][i] = temp\\n for i in range(n):\\n matrix[i] = matrix[i][::-1]\\n \\n \",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n\\n # transpose the matrix\\n for i in range(n):\\n for j in range(i, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n \\n # reverse rows\\n for i in range(n):\\n for j in range(n//2):\\n matrix[i][j], matrix[i][n-j-1] = matrix[i][n-j-1], matrix[i][j]\\n\\n\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n l, r = 0, len(matrix) - 1\\n while l < r:\\n for i in range(r-l):\\n top, bottom = l, r\\n topLeft = matrix[top][l+i]\\n matrix[top][l+i] = matrix[bottom-i][l]\\n matrix[bottom-i][l] = matrix[bottom][r-i]\\n matrix[bottom][r-i]=matrix[top+i][r]\\n matrix[top+i][r] = topLeft\\n r -= 1\\n l += 1\\n\\n \\n\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n \\n for i in range(len(matrix)):\\n for j in range(i):\\n matrix[i][j],matrix[j][i]=matrix[j][i],matrix[i][j]\\n for i in range(len(matrix)):\\n matrix[i].reverse()\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n\\n rmatrix = list(zip(*matrix))\\n\\n for i in range(len(matrix)):\\n matrix[i] = rmatrix[i][::-1]\\n \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n\\n # transpose the matrix\\n for i in range(n):\\n for j in range(i, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n \\n # reverse rows\\n for i in range(n):\\n for j in range(n//2):\\n matrix[i][j], matrix[i][n-j-1] = matrix[i][n-j-1], matrix[i][j]\\n\\n\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n r = c = n // 2\\n if n % 2 == 1: r += 1\\n\\n def rotate(i, j):\\n matrix[i][j], matrix[j][(n-1)-i], matrix[(n-1)-i][(n-1)-j], matrix[(n-1)-j][i] = matrix[(n-1)-j][i], matrix[i][j], matrix[j][(n-1)-i], matrix[(n-1)-i][(n-1)-j]\\n \\n for i in range(r):\\n for j in range(c):\\n rotate(i, j)\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n rows = len(matrix)\\n cols = len(matrix[0])\\n up = 0\\n down = rows - 1\\n while up < down:\\n tmpUpvlaue = matrix[up]\\n tmpDownValue = matrix[down]\\n matrix[up] = tmpDownValue\\n matrix[down] = tmpUpvlaue\\n up += 1\\n down -= 1\\n \\n for r in range(rows):\\n for c in range(r):\\n matrix[r][c], matrix[c][r] = matrix[c][r], matrix[r][c]\\n\\n\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n a = matrix\\n\\n for i in range(n):\\n for j in range(i+1,n):\\n a[i][j], a[j][i] = a[j][i], a[i][j]\\n\\n for i in range(n):\\n for j in range(n//2):\\n a[i][j], a[i][n-j-1] = a[i][n-j-1],a[i][j]\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n \\n for i in range(n):\\n for j in range(i,n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n \\n for row in matrix:\\n row.reverse()\\n \\n \\n \",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n\\n # transpose the matrix\\n for i in range(n):\\n for j in range(i, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n \\n # reverse rows\\n for i in range(n):\\n for j in range(n//2):\\n matrix[i][j], matrix[i][n-j-1] = matrix[i][n-j-1], matrix[i][j]\\n\\n\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n\\n # transpose the matrix\\n for i in range(n):\\n for j in range(i, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n \\n # reverse rows\\n for i in range(n):\\n for j in range(n//2):\\n matrix[i][j], matrix[i][n-j-1] = matrix[i][n-j-1], matrix[i][j]\\n\\n\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n for m in range(len(matrix)):\\n for n in range(m+1, len(matrix)):\\n matrix[m][n], matrix[n][m] = matrix[n][m], matrix[m][n]\\n\\n for i in range(len(matrix)):\\n for j in range(len(matrix)//2):\\n matrix[i][j], matrix[i][len(matrix)-j-1] = matrix[i][len(matrix)-j-1], matrix[i][j]\\n\\n\\n\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n\\n # transpose the matrix\\n for i in range(n):\\n for j in range(i, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n \\n # reverse rows\\n for i in range(n):\\n for j in range(n//2):\\n matrix[i][j], matrix[i][n-j-1] = matrix[i][n-j-1], matrix[i][j]\\n\\n\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution(object):\\n\\n def rotate(self, matrix):\\n \\\"\\\"\\\"\\n :type matrix: List[List[int]]\\n :rtype: None Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n\\n n = len(matrix)\\n # transpose the matrix\\n for r in range(n):\\n for c in range(r,n):\\n if (r != c) :\\n matrix[r][c], matrix[c][r] = matrix[c][r],matrix[r][c]\\n\\n # swap the last and the first element \\n for r in range(n):\\n for passes in range(n//2):\\n rows = matrix[r]\\n rows[passes], rows[(-1-passes)] = rows[(-1-passes)], rows[passes]\\n\\n\\n\\n\\n\\n \\n\\n\\n\\n\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n count = n\\n k = 0\\n while count >= 2:\\n for j in range(count-1):\\n x = y = k\\n x += j\\n temp = matrix[y][x]\\n y = n-y-1\\n x,y = y,x\\n for i in range(4):\\n matrix[y][x], temp = temp, matrix[y][x]\\n y = n-y-1\\n x,y = y,x\\n count -= 2\\n k += 1\\n return\\n\\n\\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n\\n # Transpose the matrix\\n for i in range(n):\\n for j in range(i, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n\\n # Reverse the matrix\\n for i in range(n):\\n matrix[i].reverse()\\n \\n return matrix\\n \\n # TC: O(n * n) for transposing\\n # O(n * n) for reversing\\n # Overall TC: O(n * n)\\n\\n # SC: O(1)\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n i=0\\n j=n-1\\n while i<j:\\n matrix[i],matrix[j] = matrix[j],matrix[i]\\n i+=1\\n j-=1\\n for i in range(n):\\n for j in range(i+1,n):\\n matrix[i][j],matrix[j][i] = matrix[j][i],matrix[i][j]\\n \\n\\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n def transpose(matrix):\\n n = len(matrix)\\n\\n for i in range(0, n):\\n bottom_left = (n-1, i)\\n top_right = (i, n-1)\\n while bottom_left != top_right:\\n bottom_r, bottom_c = bottom_left\\n top_r, top_c = top_right\\n matrix[bottom_r][bottom_c], matrix[top_r][top_c] = matrix[top_r][top_c], matrix[bottom_r][bottom_c]\\n\\n bottom_left = (bottom_r - 1, bottom_c)\\n top_right = (top_r, top_c - 1)\\n \\n\\n def reverse(matrix):\\n for row in matrix:\\n for idx in range(0, len(row)//2):\\n row[idx], row[len(row) - idx - 1] = row[len(row) - idx - 1], row[idx]\\n \\n\\n transpose(matrix)\\n reverse(matrix)\\n return\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n l, r = 0, len(matrix)-1\\n while l < r:\\n for i in range(r - l):\\n top, btm = l, r \\n tmp = matrix[top][l+i]\\n matrix[top][l+i] = matrix[btm -i][l]\\n matrix[btm -i][l] = matrix[btm][r-i]\\n matrix[btm][r-i] = matrix[top+i][r]\\n matrix[top+i][r] = tmp\\n\\n l+=1\\n r-=1\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, m: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n size = len(m)\\n for i in range(len(m)):\\n for j in range(i + 1, size):\\n m[i][j],m[j][i] = m[j][i],m[i][j]\\n\\n for i in range(len(m)):\\n m[i].reverse()\\n \",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n\\n matrix.reverse()\\n for i in range(n):\\n for j in range(i):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n # if not matrix:\\n # return []\\n n=len(matrix)\\n for i in range(n):\\n for j in range(i+1,n):\\n matrix[i][j],matrix[j][i]=matrix[j][i],matrix[i][j]\\n \\n for i in range(n):\\n l=0\\n h=n-1\\n while l<h:\\n matrix[i][l],matrix[i][h]=matrix[i][h],matrix[i][l]\\n l+=1\\n h-=1 \\n \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n \\n for i in range(n):\\n for j in range(i,n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n \\n for row in matrix:\\n row.reverse()\\n \\n \\n \",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n mlen = len(matrix)\\n \\n matrix.extend([[matrix[j][i] for j in reversed(range(mlen))] for i in range(mlen)])\\n for i in range(mlen):\\n matrix.pop(0)\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n \\n for i in range(n):\\n for j in range(i, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n for i in range(n):\\n matrix[i].reverse()\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n= len(matrix)\\n l = 0\\n r = n-1\\n\\n while l<r:\\n matrix[l], matrix[r] = matrix[r], matrix[l]\\n l+=1\\n r-=1\\n \\n for i in range(n):\\n for j in range(i):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n # i = 0\\n # j = 0\\n # while i < n:\\n # while j < n - i:\\n # swap = matrix[i][j]\\n # matrix[i][j] = matrix[j][i]\\n # matrix[j][i] = swap\\n\\n # if j <= (n/2) - i:\\n # swapLast = matrix[-1 - i][-1 - j]\\n # matrix[-1 - i][-1 - j] = matrix[-1 - j][-1 - i]\\n # matrix[-1 - j][-1 - i] = swapLast\\n # j += 1\\n\\n # i += 1\\n # j = i\\n\\n for i in range(n):\\n for j in range(i+1, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n\\n print(matrix)\\n x, y = 0, 0\\n while x < n:\\n while y < n/2:\\n swap = matrix[x][y]\\n # print(swap)\\n matrix[x][y] = matrix[x][-1 - y]\\n matrix[x][-1 - y] = swap\\n y += 1\\n y = 0\\n x += 1\\n\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n for i in range(n):\\n for j in range(i + 1, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n\\n for row in matrix:\\n row.reverse()\\n \",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, m: List[List[int]]) -> None:\\n for i in range(len(m)):\\n for j in range(i):\\n m[i][j],m[j][i] = m[j][i],m[i][j]\\n for i in range(len(m)):\\n m[i].reverse()\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n # reverse\\n l = 0\\n r = len(matrix) -1\\n while l < r:\\n matrix[l], matrix[r] = matrix[r], matrix[l]\\n l += 1\\n r -= 1\\n # transpose \\n for i in range(len(matrix)):\\n for j in range(i):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n\\t\\t \",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n \\n for i in range(n):\\n for j in range(i + 1, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n \\n for i in range(n):\\n matrix[i].reverse()\\n\\n \",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n for i in range(n):\\n for j in range(i,n):\\n matrix[i][j],matrix[j][i]= matrix[j][i], matrix[i][j]\\n \\n for i in range(n):\\n matrix[i].reverse()\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n l,r = 0, len(matrix) -1\\n while l < r:\\n for i in range(r - l):\\n top, bottom = l, r\\n #save the top right value to temp_value\\n temp_value = matrix[top][l + i]\\n\\n #replace top right with bottom right value\\n matrix[top][l + i] = matrix[bottom - i][l]\\n\\n #replace bottom left with bottom right value\\n matrix[bottom - i][l] = matrix[bottom][r - i]\\n\\n #replace bottom right with top right value\\n matrix[bottom][r - i] = matrix[top + i][r]\\n\\n #replace top right with top left value\\n matrix[top + i][r] = temp_value\\n\\n l += 1\\n r -= 1\\n \",\n \"runtime\": \"46\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":53,"string":"53"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n m = len(matrix[0])\n\n for i in range(n):\n for j in range(m):\n if i!=j and j>=i:\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n for i in matrix:\n i[:] = i[::-1]\n ","memory":"15800"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n for i in range(len(matrix)):\n for j in range(i+1,len(matrix)):\n matrix[i][j],matrix[j][i]=matrix[j][i],matrix[i][j]\n for i in range(len(matrix)):\n matrix[i].reverse() \n\n ","memory":"16100"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n #to transpose the matrix\n for i in range(len(matrix)):\n for j in range(i+1,len(matrix)):\n matrix[i][j],matrix[j][i]=matrix[j][i],matrix[i][j]\n\n\n #now reverse the order\n for i in range(len(matrix)):\n matrix[i]=matrix[i][::-1]\n\n\n\n ","memory":"16200"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n for i in range(n):\n for j in range(i + 1, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n\n for row in matrix:\n row.reverse()\n ","memory":"16300"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Rotate the matrix 90 degrees clockwise in-place.\n \"\"\"\n n = len(matrix)\n \n # Step 1: Transpose the matrix\n for i in range(n):\n for j in range(i + 1, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n \n # Step 2: Reverse each row\n for i in range(n):\n matrix[i].reverse()\n","memory":"16300"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n\n # Transpose the matrix\n for i in range(n):\n for j in range(i, n):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n\n # Reverse the matrix\n for i in range(n):\n matrix[i].reverse()\n \n return matrix\n \n # TC: O(n * n) for transposing\n # O(n * n) for reversing\n # Overall TC: O(n * n)\n\n # SC: O(1)","memory":"16400"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n l, r = 0, len(matrix) - 1\n while l < r:\n for i in range(r-l):\n top, bottom = l, r\n topLeft = matrix[top][l+i]\n matrix[top][l+i] = matrix[bottom-i][l]\n matrix[bottom-i][l] = matrix[bottom][r-i]\n matrix[bottom][r-i]=matrix[top+i][r]\n matrix[top+i][r] = topLeft\n r -= 1\n l += 1\n\n \n","memory":"16400"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix[0])\n for i in range(n // 2 + n % 2):\n for j in range(n // 2):\n tmp = matrix[n - 1 - j][i]\n matrix[n - 1 - j][i] = matrix[n - 1 - i][n - j - 1]\n matrix[n - 1 - i][n - j - 1] = matrix[j][n - 1 -i]\n matrix[j][n - 1 - i] = matrix[i][j]\n matrix[i][j] = tmp\n \n ","memory":"16500"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n for i in range(n):\n for j in range(i):\n temp = matrix[i][j]\n matrix[i][j] = matrix[j][i]\n matrix[j][i] = temp\n \n for i in range(n):\n matrix[i] = matrix[i][::-1]","memory":"16500"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \n \"\"\"\n n = len(matrix)\n m = len(matrix[0])\n\n for i in range (0, n):\n for j in range (i, m):\n temp = matrix[i][j]\n matrix[i][j] = matrix[j][i]\n matrix[j][i] = temp\n\n\n for i in range(n):\n matrix[i].reverse()\n ","memory":"16600"},{"code":"class Solution:\n def rotate(self, matrix: List[List[int]]) -> None:\n \"\"\"\n Do not return anything, modify matrix in-place instead.\n \"\"\"\n n = len(matrix)\n\n def inbound(index):\n if index in range(n):\n return True\n return False\n\n def transpose(i,j):\n nonlocal matrix\n \n for i in range(n):\n for j in range(i+1, n):\n if inbound(i) and inbound(j):\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n \n def reverse_rows(row,left,right):\n nonlocal matrix\n \n while left < right:\n matrix[row][left],matrix[row][right] = matrix[row][right], matrix[row][left]\n left += 1\n right -= 1\n \n if inbound(row+1):\n reverse_rows(row+1,0,n-1)\n \n transpose(n-1,n-1)\n reverse_rows(0,0,n-1)\n return matrix","memory":"16600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n m = len(matrix[0])\\n\\n for i in range(n):\\n for j in range(m):\\n if i!=j and j>=i:\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n for i in matrix:\\n i[:] = i[::-1]\\n \",\n \"memory\": \"15800\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n for i in range(len(matrix)):\\n for j in range(i+1,len(matrix)):\\n matrix[i][j],matrix[j][i]=matrix[j][i],matrix[i][j]\\n for i in range(len(matrix)):\\n matrix[i].reverse() \\n\\n \",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n #to transpose the matrix\\n for i in range(len(matrix)):\\n for j in range(i+1,len(matrix)):\\n matrix[i][j],matrix[j][i]=matrix[j][i],matrix[i][j]\\n\\n\\n #now reverse the order\\n for i in range(len(matrix)):\\n matrix[i]=matrix[i][::-1]\\n\\n\\n\\n \",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n for i in range(n):\\n for j in range(i + 1, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n\\n for row in matrix:\\n row.reverse()\\n \",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Rotate the matrix 90 degrees clockwise in-place.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n \\n # Step 1: Transpose the matrix\\n for i in range(n):\\n for j in range(i + 1, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n \\n # Step 2: Reverse each row\\n for i in range(n):\\n matrix[i].reverse()\\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n\\n # Transpose the matrix\\n for i in range(n):\\n for j in range(i, n):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n\\n # Reverse the matrix\\n for i in range(n):\\n matrix[i].reverse()\\n \\n return matrix\\n \\n # TC: O(n * n) for transposing\\n # O(n * n) for reversing\\n # Overall TC: O(n * n)\\n\\n # SC: O(1)\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n l, r = 0, len(matrix) - 1\\n while l < r:\\n for i in range(r-l):\\n top, bottom = l, r\\n topLeft = matrix[top][l+i]\\n matrix[top][l+i] = matrix[bottom-i][l]\\n matrix[bottom-i][l] = matrix[bottom][r-i]\\n matrix[bottom][r-i]=matrix[top+i][r]\\n matrix[top+i][r] = topLeft\\n r -= 1\\n l += 1\\n\\n \\n\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix[0])\\n for i in range(n // 2 + n % 2):\\n for j in range(n // 2):\\n tmp = matrix[n - 1 - j][i]\\n matrix[n - 1 - j][i] = matrix[n - 1 - i][n - j - 1]\\n matrix[n - 1 - i][n - j - 1] = matrix[j][n - 1 -i]\\n matrix[j][n - 1 - i] = matrix[i][j]\\n matrix[i][j] = tmp\\n \\n \",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n for i in range(n):\\n for j in range(i):\\n temp = matrix[i][j]\\n matrix[i][j] = matrix[j][i]\\n matrix[j][i] = temp\\n \\n for i in range(n):\\n matrix[i] = matrix[i][::-1]\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\n \\\"\\\"\\\"\\n n = len(matrix)\\n m = len(matrix[0])\\n\\n for i in range (0, n):\\n for j in range (i, m):\\n temp = matrix[i][j]\\n matrix[i][j] = matrix[j][i]\\n matrix[j][i] = temp\\n\\n\\n for i in range(n):\\n matrix[i].reverse()\\n \",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, matrix: List[List[int]]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify matrix in-place instead.\\n \\\"\\\"\\\"\\n n = len(matrix)\\n\\n def inbound(index):\\n if index in range(n):\\n return True\\n return False\\n\\n def transpose(i,j):\\n nonlocal matrix\\n \\n for i in range(n):\\n for j in range(i+1, n):\\n if inbound(i) and inbound(j):\\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\\n \\n def reverse_rows(row,left,right):\\n nonlocal matrix\\n \\n while left < right:\\n matrix[row][left],matrix[row][right] = matrix[row][right], matrix[row][left]\\n left += 1\\n right -= 1\\n \\n if inbound(row+1):\\n reverse_rows(row+1,0,n-1)\\n \\n transpose(n-1,n-1)\\n reverse_rows(0,0,n-1)\\n return matrix\",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":11,"string":"11"}}},{"rowIdx":142,"cells":{"question_id":{"kind":"number","value":49,"string":"49"},"name":{"kind":"string","value":"group-anagrams"},"content":{"kind":"string","value":"<p>Given an array of strings <code>strs</code>, group the <span data-keyword=\"anagram\">anagrams</span> together. You can return the answer in <strong>any order</strong>.</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\">strs = ["eat","tea","tan","ate","nat","bat"]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">[["bat"],["nat","tan"],["ate","eat","tea"]]</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<ul>\n\t<li>There is no string in strs that can be rearranged to form <code>"bat"</code>.</li>\n\t<li>The strings <code>"nat"</code> and <code>"tan"</code> are anagrams as they can be rearranged to form each other.</li>\n\t<li>The strings <code>"ate"</code>, <code>"eat"</code>, and <code>"tea"</code> are anagrams as they can be rearranged to form each other.</li>\n</ul>\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\">strs = [""]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">[[""]]</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\">strs = ["a"]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">[["a"]]</span></p>\n</div>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= strs.length <= 10<sup>4</sup></code></li>\n\t<li><code>0 <= strs[i].length <= 100</code></li>\n\t<li><code>strs[i]</code> consists of lowercase English letters.</li>\n</ul>\n"},"acRate":{"kind":"number","value":69.39319497586442,"string":"69.393195"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","hash-table","string","sorting"],"string":"[\n \"array\",\n \"hash-table\",\n \"string\",\n \"sorting\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"42\", 0.007299999999999999], [\"43\", 0.0074], [\"44\", 0.0018], [\"45\", 0.0055], [\"47\", 0.0111], [\"48\", 0.0055], [\"49\", 0.0074], [\"50\", 0.0018], [\"51\", 0.0092], [\"52\", 0.0037], [\"53\", 0.0055], [\"54\", 0.0055], [\"55\", 0.0037], [\"57\", 0.0018], [\"58\", 0.0037], [\"59\", 0.0074], [\"60\", 0.0111], [\"61\", 0.0018], [\"62\", 0.0222], [\"63\", 0.0314], [\"64\", 0.0536], [\"65\", 0.0518], [\"67\", 0.0999], [\"68\", 0.1387], [\"69\", 0.2016], [\"70\", 0.2349], [\"71\", 0.3884], [\"72\", 0.505], [\"73\", 0.6252], [\"74\", 0.9156], [\"75\", 1.0784], [\"77\", 1.2929], [\"78\", 1.6628], [\"79\", 2.2029], [\"80\", 2.473], [\"81\", 5.8505], [\"82\", 3.703], [\"83\", 3.888], [\"84\", 4.4114], [\"85\", 4.3412], [\"87\", 4.5483], [\"88\", 4.6408], [\"89\", 4.6833], [\"90\", 4.4429], [\"91\", 8.2366], [\"92\", 3.9638], [\"93\", 3.5865], [\"94\", 3.076], [\"95\", 3.0186], [\"97\", 2.7745], [\"98\", 2.3898], [\"99\", 2.0032], [\"100\", 1.661], [\"101\", 2.7615], [\"102\", 1.0488], [\"103\", 0.8804], [\"104\", 0.7195], [\"105\", 0.5882], [\"107\", 0.4606], [\"108\", 0.3866], [\"109\", 0.3755], [\"110\", 0.2996], [\"111\", 0.5845], [\"112\", 0.2627], [\"113\", 0.2386], [\"114\", 0.2442], [\"115\", 0.246], [\"117\", 0.2275], [\"118\", 0.2275], [\"119\", 0.2183], [\"120\", 0.1905], [\"121\", 0.4347], [\"122\", 0.1813], [\"123\", 0.1739], [\"124\", 0.1942], [\"125\", 0.1628], [\"127\", 0.1628], [\"128\", 0.1128], [\"129\", 0.111], [\"130\", 0.1073]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18200\", 0.0037], [\"18300\", 0.0074], [\"18400\", 0.0074], [\"18500\", 0.0111], [\"18600\", 0.0055], [\"18700\", 0.0092], [\"18800\", 0.0018], [\"18900\", 0.0129], [\"19000\", 0.0296], [\"19100\", 0.0684], [\"19200\", 0.3607], [\"19300\", 4.4355], [\"19400\", 6.9751], [\"19500\", 2.0901], [\"19600\", 10.2064], [\"19700\", 7.7704], [\"19800\", 0.8342], [\"19900\", 3.4145], [\"20000\", 4.5187], [\"20100\", 1.0913], [\"20200\", 5.8024], [\"20300\", 5.4288], [\"20400\", 0.7103], [\"20500\", 2.3583], [\"20600\", 3.1685], [\"20700\", 2.5951], [\"20800\", 0.9193], [\"20900\", 1.4002], [\"21000\", 0.7436], [\"21100\", 0.3773], [\"21200\", 1.1967], [\"21300\", 1.1264], [\"21400\", 0.9322], [\"21500\", 3.2203], [\"21600\", 1.0488], [\"21700\", 0.0888], [\"21800\", 0.1739], [\"21900\", 0.3551], [\"22000\", 2.6894], [\"22100\", 4.798], [\"22200\", 1.2559], [\"22300\", 8.0257]]}"},"rt_list":{"kind":"list like","value":[{"code":"f = open('user.out', 'w')\nfor strs in map(loads, stdin):\n w = defaultdict(list)\n for s in strs:\n w[''.join(sorted(s))].append(s)\n print(str(w.values())[12:-1].replace(\"'\", '\"').replace(\" \", \"\"), file=f)\nexit()\n","runtime":"42"},{"code":"# class Solution:\n# def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n# res = defaultdict(list)\n# for word in strs:\n# res[tuple(sorted(word))].append(word)\n# return res.values()\nf = open('user.out', 'w')\nfor strs in map(loads, stdin):\n w = defaultdict(list)\n for s in strs:\n w[''.join(sorted(s))].append(s)\n print(str(w.values())[12:-1].replace(\"'\", '\"').replace(\" \", \"\"), file=f)\nexit()","runtime":"42"},{"code":"f = open('user.out', 'w')\nfor strs in map(loads, stdin):\n w = defaultdict(list)\n for s in strs:\n w[''.join(sorted(s))].append(s)\n print(str(w.values())[12:-1].replace(\"'\", '\"').replace(\" \", \"\"), file=f)\nexit()","runtime":"43"},{"code":"f = open('user.out', 'w')\nfor strs in map(loads, stdin):\n w = defaultdict(list)\n for s in strs:\n w[''.join(sorted(s))].append(s)\n print(str(w.values())[12:-1].replace(\"'\", '\"').replace(\" \", \"\"), file=f)\nexit()","runtime":"44"},{"code":"f = open('user.out', 'w')\nfor strs in map(loads, stdin):\n w = defaultdict(list)\n for s in strs:\n w[''.join(sorted(s))].append(s)\n print(str(w.values())[12:-1].replace(\"'\", '\"').replace(\" \", \"\"), file=f)\nexit()","runtime":"45"},{"code":"def groupAnagrams(strs: List[str]) -> List[List[str]]:\n anagram_dict = defaultdict(list)\n for word in strs:\n anagram_dict[\"\".join(sorted(word))] += [word]\n return list(anagram_dict.values())\n\nif __name__ == \"__main__\":\n with open(\"user.out\", \"w\") as f:\n data = map(loads, stdin)\n for strs in data:\n print(json.dumps(groupAnagrams(strs), separators=(',', ':')), file=f)\n exit()","runtime":"47"},{"code":"def groupAnagrams(strs: List[str]) -> List[List[str]]:\n d={}\n for i in strs:\n x=''.join(sorted(i))\n if x not in d:\n d[x]=[i]\n else:\n d[x].append(i)\n return list(d.values())\nif __name__ == \"__main__\":\n with open(\"user.out\", \"w\") as f:\n data = map(loads, stdin)\n for strs in data:\n print(json.dumps(groupAnagrams(strs), separators=(',', ':')), file=f)\n exit()\n ","runtime":"48"},{"code":"def groupAnagrams(strs: List[str]) -> List[List[str]]:\n groups = defaultdict(list)\n for s in strs:\n groups[''.join(sorted(s))].append(s)\n return list(groups.values())\n\nf = open('user.out', 'w')\nfor i in map(loads, stdin):\n f.write(f'{groupAnagrams(i)}\\n'.replace(\"'\", '\"'))\nf.flush()\nexit(0)","runtime":"49"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagrams = defaultdict(list)\n\n for i in strs:\n key = \"\".join(sorted(i))\n anagrams[key].append(i)\n\n return list(anagrams.values())\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for i in inputs:\n print(str(Solution().groupAnagrams(i)).replace(' ','').replace(\"'\",'\"'), file=f)\nexit(0)\n ","runtime":"50"},{"code":"f = open('user.out', 'w')\nfor strs in map(loads, stdin):\n w = defaultdict(list)\n for s in strs:\n w[''.join(sorted(s))].append(s)\n print(str(w.values())[12:-1].replace(\"'\", '\"').replace(\" \", \"\"), file=f)\nexit()","runtime":"51"},{"code":"f = open('user.out', 'w')\nfor strs in map(loads, stdin):\n results = defaultdict(list)\n [results[\"\".join(sorted(s))].append(s) for s in strs]\n print(str(results.values())[12:-1].replace(\"'\",'\"').replace(\" \", \"\"), file=f)\nexit()","runtime":"52"},{"code":"def groupAnagrams(strs: List[str]) -> List[List[str]]:\n d=defaultdict(list)\n for i in strs:\n x=''.join(sorted(i))\n d[x]+=[i]\n '''if x not in d:\n d[x]=[i]\n else:\n d[x].append(i)'''\n return list(d.values())\nif __name__ == \"__main__\":\n with open(\"user.out\", \"w\") as f:\n data = map(loads, stdin)\n for strs in data:\n print(json.dumps(groupAnagrams(strs), separators=(',', ':')), file=f)\n exit()\n ","runtime":"53"},{"code":"f = open('user.out', 'w')\nfor strs in map(loads, stdin):\n w = defaultdict(list)\n for s in strs:\n w[''.join(sorted(s))].append(s)\n print(str(w.values())[12:-1].replace(\"'\", '\"').replace(\" \", \"\"), file=f)\nexit()","runtime":"54"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n sorted_string_dictionary = dict()\n for s in strs:\n sorted_string_key = ''.join(sorted(s))\n group = sorted_string_dictionary.get(sorted_string_key, [])\n group.append(s)\n sorted_string_dictionary[sorted_string_key] = group\n\n return sorted_string_dictionary.values()\n","runtime":"55"},{"code":"def groupAnagrams(strs: List[str]) -> List[List[str]]:\n ans = collections.defaultdict(list)\n for i in strs:\n ans[tuple(sorted(i))].append(i)\n \n return ans.values()\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f\"{list(groupAnagrams(case))}\\n\".replace(\"'\", '\"'))\nexit(0)","runtime":"57"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n hashmap = dict()\n\n for word in strs:\n sorted_word = \"\".join(sorted(word))\n\n if sorted_word not in hashmap:\n hashmap[sorted_word] = []\n hashmap[sorted_word] += [word]\n \n result = []\n for key, val in hashmap.items():\n result.append(val)\n \n return result","runtime":"58"},{"code":"\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dict1 = defaultdict(list)\n for i in strs:\n sortedw = ''.join(sorted(i))\n dict1[sortedw].append(i)\n return list(dict1.values())","runtime":"59"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n\n d = dict()\n\n for word in strs:\n sorted_char_list = sorted(word)\n new_word = \"\".join(sorted_char_list)\n\n if new_word in d:\n d[new_word].append(word)\n else:\n d[new_word] = [word]\n\n return [val for val in d.values()]\n","runtime":"60"},{"code":"# input: []\n# output: [[]]\n\n# input: ['abc']\n# output: [['abc']]\n\n# input: ['abc', 'cab', 'ab']\n# output: [['abc', 'cab'], ['ab']]\n\n# if strs is empty return [[]]\n# append the first string from strs to output\n# traverse the remaining strings in strs\n# compare each string from strs to each group in the output\n# insert each string to the group that contains its anagrams\n\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n if not strs:\n return [[]]\n\n output = []\n hashmap = {}\n for word in strs:\n sorted_word = ''.join(sorted(word))\n if sorted_word not in hashmap:\n hashmap[sorted_word] = []\n hashmap[sorted_word].append(word)\n\n for group in hashmap:\n output.append(hashmap[group])\n\n return output","runtime":"61"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n str_map = defaultdict(list)\n for s in strs:\n str_key = ''.join(sorted(s))\n if str_key in str_map:\n str_map[str_key].append(s)\n else:\n str_map[str_key] = [s]\n \n return list(str_map.values())","runtime":"62"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n hashmap = {}\n\n for s in strs:\n\n sorted_s = \"\".join(sorted(s))\n if sorted_s in hashmap:\n hashmap[sorted_s].append(s)\n else:\n hashmap[sorted_s] = [s]\n \n return list(hashmap.values())","runtime":"63"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = defaultdict(list)\n\n for s in strs:\n res[tuple(sorted(s))].append(s)\n \n return res.values() \n","runtime":"64"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagram_dict = {}\n for elem in strs: \n anagram_dict[\"\".join(sorted(elem))] = anagram_dict.get(\"\".join(sorted(elem)),[]) + [elem]\n list_of_anagrams = []\n for key in anagram_dict:\n list_of_anagrams.append(anagram_dict[key])\n return list_of_anagrams\n\n ","runtime":"64"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n d = defaultdict(list)\n for word in strs:\n key = ''.join(sorted(word))\n d[key].append(word)\n return d.values()\n ","runtime":"65"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagram_map = defaultdict(list)\n\n for word in strs:\n sorted_word = ''.join(sorted(word))\n anagram_map[sorted_word].append(word)\n\n return (anagram_map.values())","runtime":"67"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n cache = defaultdict(list)\n for word in strs:\n sr = tuple(sorted(word))\n cache[sr].append(word)\n \n return cache.values()","runtime":"67"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dct = {}\n output = []\n for s in strs:\n sortedStr = ''.join(sorted(s))\n if sortedStr not in dct:\n dct[sortedStr] = [s]\n else: \n dct[sortedStr].append(s)\n for k, v in dct.items():\n output.append(v)\n return output","runtime":"68"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n grouped_anagrams = defaultdict(list)\n\n for word in strs:\n sorted_word = ''.join(sorted(word))\n grouped_anagrams[sorted_word].append(word)\n\n return list(grouped_anagrams.values())","runtime":"69"},{"code":"class Solution:\n def groupAnagrams(self, strs):\n anagram_map = defaultdict(list)\n \n for word in strs:\n sorted_word = ''.join(sorted(word))\n anagram_map[sorted_word].append(word)\n \n return list(anagram_map.values())","runtime":"69"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagram_map = defaultdict(list)\n\n for word in strs:\n sorted_word = ''.join(sorted(word))\n anagram_map[sorted_word].append(word)\n\n return (anagram_map.values())","runtime":"70"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = defaultdict(list)\n\n for s in strs:\n key = \"\".join(sorted(s))\n ans[key].append(s)\n \n return ans.values()","runtime":"71"},{"code":"from collections import Counter\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagrams = {}\n\n for a in strs:\n temp = ''.join(sorted(a))\n if temp in anagrams:\n anagrams[temp].append(a)\n else:\n anagrams[temp] = [a]\n \n result = []\n for i in anagrams.values():\n result.append(i)\n return result","runtime":"71"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n groups = {}\n for s in strs:\n ordered = \"\".join(sorted(s))\n if ordered not in groups:\n groups[ordered] = [s]\n else:\n groups[ordered] += [s]\n return groups.values()","runtime":"72"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = defaultdict(list)\n for s in strs:\n sorted_word = \"\".join(sorted(s))\n res[sorted_word].append(s)\n return res.values()\n\n ","runtime":"72"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \n groupDict = {}\n for string in strs:\n sorted_string = ''.join(sorted(string))\n if sorted_string not in groupDict:\n groupDict[sorted_string] = [string]\n else:\n groupDict[sorted_string].append(string)\n \n return list(groupDict.values())","runtime":"73"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n sorted_word_dic = {}\n for i in strs:\n a = ''.join(sorted(i))\n if a not in sorted_word_dic:\n sorted_word_dic[a] = [i]\n else:\n sorted_word_dic[a].append(i)\n return sorted_word_dic.values()\n \n \n \n\n\n","runtime":"73"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n result = defaultdict(list)\n \n for x in strs:\n anchor = \"\".join(sorted(x))\n result[anchor].append(x)\n \n return result.values()","runtime":"74"},{"code":"from collections import defaultdict\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res=defaultdict(list)\n for i in strs:\n so=''.join(sorted(i))\n res[so].append(i)\n return list(res.values()) \n\n ","runtime":"74"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n hashmap={}\n for i in strs:\n sortedstring=\"\".join(sorted(i))\n if sortedstring in hashmap:\n hashmap[sortedstring].append(i)\n else:\n hashmap[sortedstring]=[i]\n return hashmap.values()\n ","runtime":"77"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n if not strs:\n return ''\n dict1 = {}\n for s in strs:\n sorted_str = ''.join(sorted(s))\n if sorted_str in dict1:\n dict1[sorted_str].append(s)\n else:\n dict1[sorted_str] = [s]\n return list(dict1.values())","runtime":"77"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = defaultdict(list)\n\n for s in strs:\n count=[0]*26\n for char in s:\n count[ord(char)-ord(\"a\")]+=1\n \n res[tuple(count)].append(s)\n \n return res.values()\n ","runtime":"78"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n if((strs==[\"\"]) or (len(strs)==1)):\n return [strs]\n d={}\n final = []\n for i in strs:\n temp = sorted(i)\n key = ''.join(temp)\n if(key not in d):\n d[key]=[i]\n else:\n d[key].append(i)\n for values in d.values():\n final.append(values)\n return final","runtime":"78"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n d = {}\n for s in strs:\n srt = ''.join(sorted(s))\n \n if srt not in d:\n d[srt] = []\n d[srt].append(s)\n return d.values()","runtime":"79"},{"code":"\"\"\"\nProblem: Given an array of strings strs, group the anagrams together.\n\nConstraints:\n1 <= strs.length <= 104\n0 <= strs[i].length <= 100\nstrs[i] consists of lowercase English letters.\n\nanswer in any order.\n\nfind a way to check if two strings are anagram\n\nCompare and group strings \n- maybe store it inside a dictionary with a common key\n- use some unique encoded form of strings as key\n-- use sorted string values itself as keys for dictionary\n\n\"\"\"\n\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ana_dict = {}\n for s in strs:\n s_encoded = \"\".join(sorted(s))\n if s_encoded in ana_dict:\n ana_dict[s_encoded].append(s)\n else:\n ana_dict[s_encoded] = [s] \n return list(ana_dict.values()) ","runtime":"79"},{"code":"class Solution:\n def groupAnagrams(self, strs):\n anagram_map = defaultdict(list)\n \n for word in strs:\n sorted_word = ''.join(sorted(word))\n anagram_map[sorted_word].append(word)\n \n return list(anagram_map.values())\n ","runtime":"80"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n # if string empty, then output list[list[\"\"]]\n # ... single string, ... list[list[str]]\n # Output result in any order\n hash_map = defaultdict(list)\n for s in strs:\n hash_map[tuple(sorted(s))].append(s)\n return hash_map.values()\n\nclass Solution:\n def groupAnagrams(self, strs):\n anagram_map = defaultdict(list)\n \n for word in strs:\n sorted_word = ''.join(sorted(word))\n anagram_map[sorted_word].append(word)\n \n return list(anagram_map.values())\n \n \nclass Solution:\n def groupAnagrams(self, strs):\n res = []\n anagram = defaultdict(list)\n for word in strs:\n anagram[\"\".join(sorted(word))].append(word)\n \n return list(anagram.values())\n\nclass Solution:\n def groupAnagrams(self, strs):\n if not strs:\n return []\n\n res = []\n\n anagram_map = defaultdict(list)\n for substring in strs:\n anagram_map[\"\".join(sorted(substring))].append(substring)\n \n return list(anagram_map.values())\n\n","runtime":"80"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = defaultdict(list)\n\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n\n # print (f\"{s=} | {count=}\")\n # print (f\"{tuple(count)=}\")\n ans[tuple(count)].append(s)\n # print (f\"{ans=}\\n\")\n return ans.values()\n\n'''\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n resAll = {}\n for s in strs:\n # print(f'{s=}')\n # print(f'{sorted(s)=}')\n if not resAll.get( str(sorted(s)) ) :\n resAll[str(sorted(s))] = [s]\n else:\n resAll[str(sorted(s))] += [s]\n # print (f'{resAll=}\\n')\n # print (f'resAll values: { list( resAll.values() ) }')\n return list( resAll.values() )\n'''\n\n\n\n","runtime":"81"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n grouped ={}\n for word in strs:\n sorted_word =\"\".join(sorted(word))\n if sorted_word in grouped:\n grouped[sorted_word].append(word)\n else:\n grouped[sorted_word] = [word]\n return list(grouped.values())","runtime":"81"},{"code":"from collections import defaultdict\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \n anagrams = defaultdict(list)\n result = []\n \n for i in strs:\n sorted_i = tuple(sorted(i))\n anagrams[sorted_i].append(i)\n \n for value in anagrams.values():\n result.append(value)\n return result\n ","runtime":"82"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n d = {}\n for s in strs:\n srt = ''.join(sorted(s))\n if srt not in d:\n d[srt] = []\n d[srt].append(s)\n return d.values()\n","runtime":"82"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n map = {}\n\n for i in strs:\n temp = \"\".join(sorted(i)) \n\n if temp not in map:\n map[temp] = [i]\n else:\n map[temp].append(i)\n \n return map.values()\n\n\n","runtime":"83"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = collections.defaultdict(list)\n\n for s in strs:\n key = \"\".join(sorted(s))\n ans[key].append(s)\n\n return ans.values()","runtime":"83"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dict = {}\n for i in strs:\n stri = str(''.join(sorted(list(i))))\n print(stri)\n if dict.get(stri) is None:\n dict[stri] = [i]\n else:\n dict[stri].append(i)\n final_dict = []\n for i in dict.values():\n final_dict.append(i)\n return final_dict","runtime":"84"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dic={}\n for word in strs:\n s = ''.join(sorted(word))\n if s in dic.keys():\n dic[s].append(word)\n else:\n w=[word]\n dic[s]=w \n res=list(dic.values())\n return res ","runtime":"84"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n groups = defaultdict(list)\n \n for word in strs:\n key = [0] * 26\n for char in word:\n idx = ord(char) - ord('a')\n key[idx] += 1\n \n groups[tuple(key)].append(word)\n \n return groups.values()\n","runtime":"85"},{"code":"from collections import defaultdict\n\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagram_map = defaultdict(list)\n result = []\n\n for s in strs:\n sorted_s = tuple(sorted(s))\n anagram_map[sorted_s].append(s)\n\n for value in anagram_map.values():\n result.append(value)\n \n return result\n\n","runtime":"85"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = DefaultDict(list)\n\n for s in strs:\n\n key = \"\".join(sorted(s))\n\n ans[key].append(s) \n\n return ans.values() ","runtime":"87"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n hashMap = defaultdict(list)\n\n for s in strs:\n temp = list(s)\n temp.sort()\n temp = ''.join(temp)\n hashMap[temp].append(s)\n\n res = list()\n for val in hashMap.values():\n res.append(val)\n\n return res","runtime":"87"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dct = {}\n\n for i in strs:\n sortedstr = ''.join(sorted(list(i)))\n if sortedstr not in dct:\n dct[sortedstr] = [i]\n else:\n dct[sortedstr].append(i)\n \n output = []\n for key in dct:\n output.append(dct[key])\n \n return output\n\n \n ","runtime":"88"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n #{(0,0,0,0,0):[\"eat\",\"tea\"]}\n map = collections.defaultdict(list)\n\n for string in strs:\n count =[0]*26 \n for c in string:\n count[ord(c)-ord(\"a\")]+=1\n map[tuple(count)].append(string)\n return map.values()\n\n","runtime":"88"},{"code":"from collections import Counter\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n # anagram: two words that have the same letters\n # i know the efficent way to check if a word is anagram of another word\n # if m is the len of the words, then O(m) cause you're doing m*O(1) lookups\n\n # pre-process, \n\n # loop over all words, sort one word, map from sorted --> list\n\n anagram_map = {}\n\n for word in strs:\n og_word = word\n sorted_word = ''.join(sorted(word))\n if sorted_word in anagram_map:\n anagram_map[sorted_word].append(og_word)\n else:\n anagram_map[sorted_word] = [og_word]\n \n grouped_anagrams = []\n for anagram_list in anagram_map.values():\n grouped_anagrams.append(anagram_list)\n return grouped_anagrams\n ","runtime":"89"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n hashmap = {}\n for word in strs:\n sorted_word = \"\".join(sorted(word))\n if sorted_word in hashmap:\n hashmap[sorted_word].append(word)\n else:\n hashmap[sorted_word] = [word]\n\n return hashmap.values()\n ","runtime":"89"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n d = defaultdict(list)\n for i in strs: \n a = ''.join(sorted(i))\n d[a].append(i)\n\n return list(d.values())\n ","runtime":"90"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n sorted_dict = dict()\n for i in strs:\n sorted_i = ''.join(sorted(i))\n if sorted_i in sorted_dict.keys():\n sorted_dict[sorted_i].append(i)\n else:\n sorted_dict[sorted_i] = [i]\n return [v for k,v in sorted_dict.items()]","runtime":"90"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = defaultdict(list)\n\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n\n # print (f\"{s=} | {count=}\")\n # print (f\"{tuple(count)=}\")\n ans[tuple(count)].append(s)\n # print (f\"{ans=}\\n\")\n return ans.values()\n\n'''\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n resAll = {}\n for s in strs:\n # print(f'{s=}')\n # print(f'{sorted(s)=}')\n if not resAll.get( str(sorted(s)) ) :\n resAll[str(sorted(s))] = [s]\n else:\n resAll[str(sorted(s))] += [s]\n # print (f'{resAll=}\\n')\n # print (f'resAll values: { list( resAll.values() ) }')\n return list( resAll.values() )\n'''\n\n\n\n","runtime":"91"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dic_uniq = defaultdict(list) \n for word in strs:\n sorted_word = ''.join(sorted(word))\n dic_uniq[sorted_word].append(word)\n \n return list(dic_uniq.values())\n","runtime":"91"},{"code":"from collections import defaultdict\n\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n c_to_i = {}\n i = 0\n for c in 'abcdefghijklmnopqrstuvwxyz':\n c_to_i[c] = i\n i += 1\n\n result = defaultdict(list)\n for s in strs:\n cnt = [0] * 26\n for c in s:\n cnt[c_to_i[c]] += 1\n result[tuple(cnt)].append(s)\n \n output = []\n for k in result:\n output.append(result[k])\n return output","runtime":"92"},{"code":"# from collections import defaultdict\n\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n hash_map = {}\n result = []\n \n for s in strs:\n sorted_s = tuple(sorted(s))\n if sorted_s not in hash_map.keys():\n hash_map[sorted_s] = []\n hash_map[sorted_s].append(s)\n\n for v in hash_map.values():\n result.append(v)\n\n return result\n ","runtime":"92"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \"\"\"\n O(num_words * max_length_word)\n O(num_words * max_length_word)\n \"\"\"\n groups = defaultdict(list)\n \n for word in strs:\n key = [0] * 26\n for char in word:\n idx = ord(char) - ord('a')\n key[idx] += 1\n \n groups[tuple(key)].append(word)\n \n return groups.values()\n","runtime":"93"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = collections.defaultdict(list)\n\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n ans[tuple(count)].append(s)\n return ans.values()\n","runtime":"93"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n d = {} #O(N*M)\n for word in strs: #O(N*M)\n char = [0] * 26\n for ch in word:\n char[ord(ch)-ord('a')] += 1\n char = tuple(char)\n if char in d:\n d[char].append(word)\n else:\n d[char] = [word]\n \n return d.values()","runtime":"94"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n\n h_map = collections.defaultdict(list)\n\n for el in strs:\n\n base_coding = [0] * 26\n\n for ch in el:\n\n base_coding[ord(ch) - ord('a')] += 1\n\n h_map[tuple(base_coding)].append(el)\n\n return h_map.values()","runtime":"94"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res={} \n for char in strs:\n sorted_word=''.join(sorted(char))\n if sorted_word in res:\n res[sorted_word].append(char)\n else:\n res[sorted_word]=[char]\n result=list(res.values())\n #result.sort(key=lambda group:strs.index(group[0]))\n return result","runtime":"95"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dic={}\n for i in strs:\n sorted_str=\"\".join(sorted(i))\n if sorted_str in dic:\n dic[sorted_str].append(i)\n else:\n dic[sorted_str]=[i]\n return list(dic.values())\n ","runtime":"95"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = defaultdict(list)\n\n for s in strs:\n count = [0] * 26\n\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n\n res[tuple(count)].append(s)\n return res.values()","runtime":"97"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \n hashmap = defaultdict(list)\n for s in strs:\n frequency = [0] * 26\n for letter in s:\n frequency[ord(letter) - ord('a')] += 1\n frequency = tuple(frequency)\n hashmap[frequency].append(s)\n \n ans = []\n for key in hashmap:\n ans.append(hashmap[key])\n \n return ans\n ","runtime":"97"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = collections.defaultdict(list)\n\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord('a')] += 1\n ans[tuple(count)].append(s)\n return ans.values()","runtime":"98"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = defaultdict(list)\n for word in strs:\n ctr = [0] * 26\n for w in word:\n ctr[ord(w) - ord('a')] += 1\n ctr = tuple(ctr)\n\n ans[ctr].append(word)\n return list(ans.values())\n ","runtime":"98"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = defaultdict(list)\n for word in strs:\n count = [0] * 26\n for char in word:\n count[ord(char) - ord('a')] += 1\n res[tuple(count)].append(word)\n \n return res.values()","runtime":"99"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \n freq = defaultdict(list)\n\n # we need to get the frequency of each word\n\n for word in strs:\n count = [0] * 26\n\n for char in word:\n\n # we get the frequency of each character in a word\n count[ord(char) - ord('a')] += 1\n \n\n freq[tuple(count)].append(word)\n \n return freq.values()","runtime":"99"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = defaultdict(list)\n\n for s in strs:\n count = [0] * 26\n\n for c in s:\n count[ord(c) - ord('a')] += 1\n \n res[tuple(count)].append(s)\n return res.values()","runtime":"100"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n groups: dict[str, list[int]] = {}\n\n for index, s in enumerate(strs):\n \n s_sorted = \"\".join(sorted(s))\n\n if s_sorted in groups:\n groups[s_sorted].append(index)\n else:\n groups[s_sorted] = [index]\n\n return [\n [ strs[index] for index in group_indexes ]\n for group_indexes in groups.values()\n ]\n","runtime":"100"},{"code":"from collections import defaultdict\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anag_dict=defaultdict(list)\n for s in strs:\n char_cnt_ls=[0]*26\n for char in s:\n char_cnt_ls[ord(char)-ord('a')]+=1\n tup_idx = tuple(char_cnt_ls) \n anag_dict[tup_idx].append(s)\n \n return list(anag_dict.values())","runtime":"101"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = []\n groups = defaultdict(list)\n\n for s in strs:\n alphaArr = [0] * 26\n for ch in s:\n alphaArr[ ord(ch) - ord('a') ] += 1\n \n groups[tuple(alphaArr)].append(s)\n \n return groups.values()","runtime":"101"},{"code":"from collections import Counter\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n def encode(x):\n sp = \"\"\n for i in sorted(x.keys()):\n sp += f\"{i}{x[i]}\"\n return sp\n cters = [(encode(dict(Counter(s))), s) for s in strs]\n d = {}\n for (enc, s) in cters:\n if enc in d.keys():\n d[enc].append(s)\n else:\n d[enc] = [s]\n \n return d.values()\n ","runtime":"102"},{"code":"from collections import Counter\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n #counters = [tuple(sorted(Counter(s).items())) for s in strs]\n anagramDict = {}\n for idx in range(len(strs)):\n counter = [0 for _ in range(26)]\n for c in strs[idx]:\n counter[ord(c)%26] += 1\n counter = tuple(counter)\n if counter not in anagramDict:\n anagramDict[counter] = []\n anagramDict[counter].append(strs[idx])\n return anagramDict.values()","runtime":"102"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n strMap = defaultdict(int)\n resMap = defaultdict(list)\n slist = []\n for s in strs:\n slist = sorted(s)\n for c in slist:\n strMap[c] +=1\n resMap[tuple(slist)].append(s)\n return list(resMap.values())\n ","runtime":"103"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = defaultdict(list)\n for i in range(len(strs)):\n char_arr = [0]*26\n for c in strs[i]:\n char_arr[ord(c) - ord('a')] += 1\n ans[tuple(char_arr)].append(strs[i])\n return list(ans.values())","runtime":"103"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n groups = {}\n for s in strs:\n char_count= [0 for _ in range(26)]\n for c in s:\n idx = ord(c) - ord('a')\n char_count[idx] = char_count[idx] + 1\n group_key = tuple(char_count)\n if group_key not in groups:\n groups[group_key] = []\n groups[group_key].append(s)\n return list(groups.values())\n ","runtime":"104"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n\n res = defaultdict(list)\n for word in strs:\n word_counter = Counter(word)\n key = tuple(sorted(word_counter.items()))\n res[key].append(word)\n \n return list(res.values())","runtime":"104"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \n res = defaultdict(list)\n\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c)-ord('a')] += 1 \n res[tuple(count)].append(s)\n \n return res.values()\n # hashmap = {} \n \n # for word in strs:\n # base = [0] * 26\n # for c in word.lower():\n # base[ord(c)-ord('a')] += 1\n # base = tuple(base)\n # if base not in hashmap:\n # hashmap[base] = [word]\n # else:\n # hashmap[base].append(word)\n # return hashmap.values()\n \n \n # rep = []\n # while len(strs) > 0:\n # reference = strs[0]\n # groupAnagram = []\n # compare = sorted(list(reference))\n # for word in strs:\n # if compare == sorted(list(word)):\n # groupAnagram.append(word)\n # for word in groupAnagram:\n # strs.remove(word)\n # rep.append(groupAnagram)\n # return rep\n \n \n\n ","runtime":"105"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n #Dict with key= tuple of freq arr and val as the list of original string\n dic = defaultdict(list)\n\n #Go through each String in strs\n for eachStr in strs:\n #Initialize freq array\n freq = [0 for i in range(26)]\n\n #Find freq array for that string\n for eachChar in eachStr:\n freq[ord(eachChar)-ord(\"a\")] +=1\n \n dic[tuple(freq)].append(eachStr)\n \n return dic.values()\n","runtime":"105"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n resAll = {}\n for s in strs:\n # print(f'{s=}')\n # print(f'{sorted(s)=}')\n if not resAll.get( str(sorted(s)) ) :\n resAll[str(sorted(s))] = [s]\n else:\n resAll[str(sorted(s))] += [s]\n # print (f'{resAll=}\\n')\n # print (f'resAll values: { list( resAll.values() ) }')\n return list( resAll.values() )\n\n'''\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = defaultdict(list)\n\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n\n print (f\"{s=} | {count=}\")\n print (f\"{tuple(count)=}\")\n ans[tuple(count)].append(s)\n print (f\"{ans=}\\n\")\n return ans.values()\n\n\n\n\n'''\n\n\n\n","runtime":"107"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n resAll = {}\n for s in strs:\n # print(f'{s=}')\n # print(f'{sorted(s)=}')\n if not resAll.get( str(sorted(s)) ) :\n resAll[str(sorted(s))] = [s]\n else:\n resAll[str(sorted(s))] += [s]\n # print (f'{resAll=}\\n')\n # print (f'resAll values: { list( resAll.values() ) }')\n return list( resAll.values() )\n\n'''\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = defaultdict(list)\n\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n\n print (f\"{s=} | {count=}\")\n print (f\"{tuple(count)=}\")\n ans[tuple(count)].append(s)\n print (f\"{ans=}\\n\")\n return ans.values()\n\n\n\n\n'''\n\n\n\n","runtime":"107"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n group = {}\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c)- ord('a')] += 1\n if tuple(count) not in group:\n group[tuple(count)] = []\n group[tuple(count)].append(s)\n return group.values()\n","runtime":"108"},{"code":"from collections import Counter, defaultdict\n\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagrams = defaultdict(list)\n\n for element in strs:\n counter = sorted(Counter(element).items())\n\n anagrams[tuple(counter)].append(element)\n \n return list(anagrams.values())","runtime":"109"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n groups = collections.defaultdict(list) # tuple count, word\n\n for word in strs:\n count = [0] * 26\n for char in word:\n val = ord(char) - ord(\"a\")\n count[val] += 1\n groups[tuple(count)].append(word)\n return groups.values()","runtime":"109"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = defaultdict(list)\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n res[tuple(count)].append(s)\n return res.values()","runtime":"110"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n store = collections.defaultdict(list)\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord('a')] += 1\n store[tuple(count)].append(s)\n \n return store.values()","runtime":"111"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n result = []\n mapping = {}\n k = 0\n for i in range(len(strs)):\n count = [0 for _ in range(26)]\n for j in range(len(strs[i])):\n char = ord(strs[i][j]) - ord('a')\n count[char] += 1\n count = tuple(count)\n if count in mapping:\n result[mapping[count]].append(strs[i])\n else:\n mapping[count] = k\n result.append([strs[i]])\n k += 1\n return result","runtime":"111"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = defaultdict(list)\n \n for string in strs:\n freq = Counter(string)\n ans[frozenset(freq.items())].append(string)\n \n return ans.values()\n\n ","runtime":"112"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n # let us see if there is a better approach\n anagrams = defaultdict(list)\n for s in strs:\n code = [0]*26\n for c in s:\n code[ord(c)-97]+=1\n code = [str(num) for num in code]\n code = \"*\".join(code)\n anagrams[code].append(s)\n return list(anagrams.values())\n ","runtime":"112"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n answer = []\n count_anagrams = {}\n for i in strs:\n count_alphabet = {}\n for j in i:\n count_alphabet[j] = count_alphabet.get(j,0) + 1\n anagrams = list(count_alphabet.keys())\n anagrams.sort()\n sorted_anagrams = {i: count_alphabet[i] for i in anagrams}\n anagrams_words = \"\"\n for k in sorted_anagrams:\n anagrams_words = anagrams_words + str(k) + str(sorted_anagrams[k])\n if anagrams_words in count_anagrams:\n count_anagrams[anagrams_words].append(i)\n else:\n count_anagrams[anagrams_words] = []\n count_anagrams[anagrams_words].append(i)\n for key in count_anagrams:\n answer.append(count_anagrams[key])\n return answer\n \n","runtime":"113"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n bucket = {}\n for word in strs:\n key = [0] * 26\n for ch in word:\n key[ord(ch) - ord('a')] += 1\n key = [str(i) for i in key]\n key = '#'.join(key)\n if key not in bucket:\n bucket[key] = []\n bucket[key].append(word)\n return bucket.values()","runtime":"113"},{"code":"from collections import defaultdict\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n mapper = defaultdict(list)\n for word in strs:\n mapper[self.encodeWord(word)].append(word)\n return [mapper[key] for key in mapper]\n\n \"\"\"\n encode a word into a tuple of tuples.\n The first element in the inner tuple is the letter ord. \n The second element in the inner tuple is the counts of the letter. \n all the letters are in ascending order.\n \"\"\"\n def encodeWord(self, word: str) -> tuple[tuple[int]]:\n counter = [0] * 26\n for letter in word:\n counter[ord(letter) - ord('a')] += 1\n output = []\n for i in range(26):\n if counter[i] > 0:\n output.append((i, counter[i]))\n return tuple(output)\n\n \n ","runtime":"114"},{"code":"from collections import Counter\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n # instead use a list with 1 index for each letter and then\n # add up the counts for each word and convert into a tuple\n # to use as the index\n # res = collections.defaultdict(list)\n # for word in strs:\n # counts = [0] * 26\n # for c in word:\n # counts[ord(c) - ord(\"a\")] += 1\n # res[tuple(counts)].append(word)\n # return res.values()\n\n\n\n\n res = collections.defaultdict(list)\n counts = [Counter(i) for i in strs]\n for i in range(len(strs)):\n res[tuple(sorted(counts[i].items()))].append(strs[i])\n return res.values()\n\n \n ","runtime":"114"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n groups = {}\n\n for s in strs:\n s_arr = [0] * 26\n for c in s:\n s_arr[ord(c) - ord(\"a\")] += 1\n \n x = groups.get(str(s_arr),[])\n x.append(s)\n groups[str(s_arr)] = x\n return groups.values()\n ","runtime":"115"},{"code":"# from string import ascii_lowercase\nNUM_LETTERS = 26\n\ndef encode_word(word):\n counts = [0] * NUM_LETTERS\n for letter in word:\n idx = ord(letter) - ord('a')\n counts[idx] += 1\n\n return '_'.join([str(x) for x in counts]) \n\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n encodings_to_strs = {}\n for word in strs:\n encoding = encode_word(word)\n if encoding in encodings_to_strs:\n encodings_to_strs[encoding].append(word)\n else:\n encodings_to_strs[encoding] = [word]\n\n groups = []\n for _, words in encodings_to_strs.items():\n groups.append(words)\n\n return groups\n ","runtime":"115"},{"code":"class Solution:\n def getAnagramKey(self, s: str):\n key = [0 for _ in range(26)]\n for ch in s:\n id = ord(ch) - ord('a')\n key[id] += 1\n return tuple(key)\n\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagram_groups = {}\n for word in strs:\n group_key = self.getAnagramKey(word)\n if group_key not in anagram_groups:\n anagram_groups[group_key] = []\n anagram_groups[group_key].append(word)\n return anagram_groups.values()\n ","runtime":"117"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n maplist = {}\n wordlist = []\n \n i = 0\n for word in strs:\n s = list(word)\n s.sort()\n s = tuple(s)\n print(word,s)\n if s not in maplist:\n maplist.update({s : i})\n wordlist.append([word])\n i += 1\n elif s in maplist:\n print(maplist[s])\n wordlist[maplist[s]].append(word)\n print(maplist)\n return wordlist\n\n\n\n ","runtime":"118"},{"code":"from collections import Counter\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n counters = [tuple(sorted(Counter(s).items())) for s in strs]\n anagramDict = {}\n for idx in range(len(strs)):\n if counters[idx] not in anagramDict:\n anagramDict[counters[idx]] = []\n anagramDict[counters[idx]].append(strs[idx])\n return anagramDict.values()","runtime":"118"},{"code":"class Solution:\n def groupAnagrams(self, strs: list[str]) -> list[list[str]]:\n anagrams = {}\n for word in strs:\n anagram = {char: word.count(char) for char in word}\n anagram = frozenset(anagram.items())\n if anagram not in anagrams:\n anagrams[anagram] = [word]\n else:\n anagrams[anagram].append(word)\n \n return [sublist for sublist in anagrams.values()]","runtime":"119"},{"code":"class Solution:\n def groupAnagrams(self, strs: list[str]) -> list[list[str]]:\n anagrams = {}\n for word in strs:\n anagram = {char: word.count(char) for char in word}\n anagram = frozenset(anagram.items())\n if anagram not in anagrams:\n anagrams[anagram] = [word]\n else:\n anagrams[anagram].append(word)\n \n return [sublist for sublist in anagrams.values()]","runtime":"119"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dic_uniq={}\n for word in strs:\n freq=frozenset(Counter(word).items())\n if freq in dic_uniq:\n dic_uniq[freq].append(word)\n else:\n dic_uniq[freq]=[word]\n return list(dic_uniq.values())","runtime":"120"},{"code":"from collections import Counter, defaultdict\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anag_groups = defaultdict(list)\n for s in strs:\n counter = Counter(s)\n k = \",\".join(sorted([f\"{c}: {count}\" for c, count in counter.items()]))\n anag_groups[k].append(s)\n\n return [group for group in anag_groups.values()]\n\n\n\n\n ","runtime":"120"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dict2={}\n for i in strs:\n c=[0]*26\n for j in i:\n c[ord(j)-ord(\"a\")]+=1\n if(tuple(c) not in dict2):\n dict2[tuple(c)]=[i]\n else:\n dict2[tuple(c)].append(i)\n res=[]\n print(dict2)\n for i in dict2:\n res.append(dict2[i])\n return res\n ","runtime":"121"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n # Method 1: using hashtable and tuple of O(26) as key\n # t/c: O(m*n*26) -> O(m*n), where m is total number of words in strs and n is avg. number of chrs\n # s/c: O(m*n*26) -> O(m*n) - for hashTable\n \n hashTable = defaultdict(list)\n for word in strs:\n counter = [0]*26\n for c in word:\n idx = ord(c)-ord('a')\n counter[idx] += 1\n hashTable[tuple(counter)].append(word)\n print(hashTable)\n return hashTable.values()\n\n # Method 2: using sorting -> O(m&nlogn*26) which is less efficient than method 1 \n\n\n\n\n\n\n \n\n\n\n","runtime":"121"},{"code":"from string import ascii_lowercase as alc\n\nclass Solution:\n def get_key(self, s: str) -> str:\n \"\"\"format of key: a2b3... letter+freq in asc alphabetic order\"\"\"\n freqs = {}\n for char in s:\n if char not in freqs:\n freqs[char] = 0\n freqs[char] += 1\n \n key = \"\"\n for char in alc:\n if char not in freqs:\n continue\n key += f\"{char}{freqs[char]}\"\n \n return key\n \n \n \n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n key_output_index = {}\n grouped_anagrams = []\n for s in strs:\n key = self.get_key(s)\n if key not in key_output_index:\n key_output_index[key] = len(grouped_anagrams)\n grouped_anagrams.append([])\n \n output_index = key_output_index[key]\n grouped_anagrams[output_index].append(s)\n \n return grouped_anagrams","runtime":"122"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = []\n\n char_mappings = {}\n\n for s in strs:\n char_mapping = self.get_char_mapping(s)\n if char_mapping not in char_mappings:\n char_mappings[char_mapping] = [s]\n else:\n char_mappings[char_mapping].append(s)\n\n for _, v in char_mappings.items():\n res.append(v)\n\n return res\n\n \n\n def get_char_mapping(self, s: str) -> str:\n res = [0] * 26\n for c in s:\n res[ord(c) - ord('a')] += 1\n\n res = map(lambda c: str(c), res)\n\n return ','.join(res)","runtime":"122"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = {}\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n x = ans.get(str(count),[])\n x.append(s)\n ans[str(count)] = x\n return ans.values()","runtime":"123"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagrams_grouped = collections.defaultdict(list)\n\n for s in strs:\n char_count = [0] * (26 + ord(\"a\"))\n\n for c in s:\n char_count[ord(c)] += 1\n\n anagrams_grouped[tuple(char_count)].append(s)\n\n return anagrams_grouped.values()","runtime":"123"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagrams = defaultdict(list)\n for s in strs:\n anagrams[frozenset(Counter(s).items())].append(s)\n return list(anagrams.values())\n","runtime":"124"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dic_uniq={}\n for word in strs:\n freq=frozenset(Counter(word).items())\n if freq in dic_uniq:\n dic_uniq[freq].append(word)\n else:\n dic_uniq[freq]=[word]\n return [i for i in dic_uniq.values()]","runtime":"124"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n groups = {}\n\n for s in strs:\n s_arr = [0] * 26\n for c in s:\n s_arr[ord(c) - ord(\"a\")] += 1\n \n x = groups.get(str(s_arr),[])\n x.append(s)\n groups[str(s_arr)] = x\n return groups.values()\n ","runtime":"125"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = []\n\n char_mappings = {}\n\n for s in strs:\n char_mapping = self.get_char_mapping(s)\n if char_mapping not in char_mappings:\n char_mappings[char_mapping] = [s]\n else:\n char_mappings[char_mapping].append(s)\n\n for _, v in char_mappings.items():\n res.append(v)\n\n return res\n\n \n\n def get_char_mapping(self, s: str) -> str:\n res = [0] * 26\n for c in s:\n res[ord(c) - ord('a')] += 1\n\n res = map(lambda c: str(c), res)\n\n return ','.join(res)","runtime":"125"},{"code":"\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagram_dict = {} # Maps character multiset to a list of strings that are the anagrams of that multiset\n for str in strs:\n char_multiset = Counter()\n frozen_char_multiset = None\n for character in str:\n current_count = char_multiset[character]\n char_multiset[character] = current_count + 1\n\n frozen_char_multiset = frozenset(char_multiset.items())\n\n if frozen_char_multiset not in anagram_dict:\n anagram_dict[frozen_char_multiset] = []\n\n anagram_dict[frozen_char_multiset].append(str)\n\n anagram_dict_as_list = []\n\n for key_multiset in anagram_dict:\n anagram_dict_as_list.append(anagram_dict[key_multiset])\n\n return anagram_dict_as_list\n\n\n","runtime":"127"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = []\n\n char_mappings = {}\n\n for s in strs:\n char_mapping = self.get_char_mapping(s)\n if char_mapping not in char_mappings:\n char_mappings[char_mapping] = [s]\n else:\n char_mappings[char_mapping].append(s)\n\n for _, v in char_mappings.items():\n res.append(v)\n\n return res\n\n \n\n def get_char_mapping(self, s: str) -> str:\n res = [0] * 26\n for c in s:\n res[ord(c) - ord('a')] += 1\n\n res = map(lambda c: str(c), res)\n\n return ','.join(res)","runtime":"127"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = {}\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n x = ans.get(str(count),[])\n x.append(s)\n ans[str(count)] = x\n return ans.values()","runtime":"128"},{"code":"class Solution:\n def getUniqueIdentifier(self, word: str) -> str:\n alphabet = [0 for i in range(26)]\n for letter in word:\n alphabet[ord(letter) - 97] += 1\n \n return ''.join([(chr(id) + str(freq) if freq != 0 else '') for id, freq in enumerate(alphabet)])\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n look_up = {}\n for word in strs:\n id = self.getUniqueIdentifier(word)\n if id in look_up:\n look_up[id].append(word)\n else:\n look_up[id] = [word]\n\n return look_up.values()\n \n ","runtime":"129"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anag = defaultdict(list)\n for i in strs:\n count = tuple(sorted(Counter(i).items()))\n anag[count].append(i)\n\n return list(anag.values())\n\n\n ","runtime":"130"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n hashmap = defaultdict(list)\n keyy = [0 for i in range(26)]\n for i in strs:\n keyy = [0 for i in range(26)]\n for c in i:\n keyy[ord(c)-ord('a')] += 1\n print(keyy)\n hashmap[tuple(keyy)].append(i)\n return hashmap.values()\n ","runtime":"130"}],"string":"[\n {\n \"code\": \"f = open('user.out', 'w')\\nfor strs in map(loads, stdin):\\n w = defaultdict(list)\\n for s in strs:\\n w[''.join(sorted(s))].append(s)\\n print(str(w.values())[12:-1].replace(\\\"'\\\", '\\\"').replace(\\\" \\\", \\\"\\\"), file=f)\\nexit()\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"# class Solution:\\n# def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n# res = defaultdict(list)\\n# for word in strs:\\n# res[tuple(sorted(word))].append(word)\\n# return res.values()\\nf = open('user.out', 'w')\\nfor strs in map(loads, stdin):\\n w = defaultdict(list)\\n for s in strs:\\n w[''.join(sorted(s))].append(s)\\n print(str(w.values())[12:-1].replace(\\\"'\\\", '\\\"').replace(\\\" \\\", \\\"\\\"), file=f)\\nexit()\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nfor strs in map(loads, stdin):\\n w = defaultdict(list)\\n for s in strs:\\n w[''.join(sorted(s))].append(s)\\n print(str(w.values())[12:-1].replace(\\\"'\\\", '\\\"').replace(\\\" \\\", \\\"\\\"), file=f)\\nexit()\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nfor strs in map(loads, stdin):\\n w = defaultdict(list)\\n for s in strs:\\n w[''.join(sorted(s))].append(s)\\n print(str(w.values())[12:-1].replace(\\\"'\\\", '\\\"').replace(\\\" \\\", \\\"\\\"), file=f)\\nexit()\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nfor strs in map(loads, stdin):\\n w = defaultdict(list)\\n for s in strs:\\n w[''.join(sorted(s))].append(s)\\n print(str(w.values())[12:-1].replace(\\\"'\\\", '\\\"').replace(\\\" \\\", \\\"\\\"), file=f)\\nexit()\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"def groupAnagrams(strs: List[str]) -> List[List[str]]:\\n anagram_dict = defaultdict(list)\\n for word in strs:\\n anagram_dict[\\\"\\\".join(sorted(word))] += [word]\\n return list(anagram_dict.values())\\n\\nif __name__ == \\\"__main__\\\":\\n with open(\\\"user.out\\\", \\\"w\\\") as f:\\n data = map(loads, stdin)\\n for strs in data:\\n print(json.dumps(groupAnagrams(strs), separators=(',', ':')), file=f)\\n exit()\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"def groupAnagrams(strs: List[str]) -> List[List[str]]:\\n d={}\\n for i in strs:\\n x=''.join(sorted(i))\\n if x not in d:\\n d[x]=[i]\\n else:\\n d[x].append(i)\\n return list(d.values())\\nif __name__ == \\\"__main__\\\":\\n with open(\\\"user.out\\\", \\\"w\\\") as f:\\n data = map(loads, stdin)\\n for strs in data:\\n print(json.dumps(groupAnagrams(strs), separators=(',', ':')), file=f)\\n exit()\\n \",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"def groupAnagrams(strs: List[str]) -> List[List[str]]:\\n groups = defaultdict(list)\\n for s in strs:\\n groups[''.join(sorted(s))].append(s)\\n return list(groups.values())\\n\\nf = open('user.out', 'w')\\nfor i in map(loads, stdin):\\n f.write(f'{groupAnagrams(i)}\\\\n'.replace(\\\"'\\\", '\\\"'))\\nf.flush()\\nexit(0)\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagrams = defaultdict(list)\\n\\n for i in strs:\\n key = \\\"\\\".join(sorted(i))\\n anagrams[key].append(i)\\n\\n return list(anagrams.values())\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for i in inputs:\\n print(str(Solution().groupAnagrams(i)).replace(' ','').replace(\\\"'\\\",'\\\"'), file=f)\\nexit(0)\\n \",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nfor strs in map(loads, stdin):\\n w = defaultdict(list)\\n for s in strs:\\n w[''.join(sorted(s))].append(s)\\n print(str(w.values())[12:-1].replace(\\\"'\\\", '\\\"').replace(\\\" \\\", \\\"\\\"), file=f)\\nexit()\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nfor strs in map(loads, stdin):\\n results = defaultdict(list)\\n [results[\\\"\\\".join(sorted(s))].append(s) for s in strs]\\n print(str(results.values())[12:-1].replace(\\\"'\\\",'\\\"').replace(\\\" \\\", \\\"\\\"), file=f)\\nexit()\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"def groupAnagrams(strs: List[str]) -> List[List[str]]:\\n d=defaultdict(list)\\n for i in strs:\\n x=''.join(sorted(i))\\n d[x]+=[i]\\n '''if x not in d:\\n d[x]=[i]\\n else:\\n d[x].append(i)'''\\n return list(d.values())\\nif __name__ == \\\"__main__\\\":\\n with open(\\\"user.out\\\", \\\"w\\\") as f:\\n data = map(loads, stdin)\\n for strs in data:\\n print(json.dumps(groupAnagrams(strs), separators=(',', ':')), file=f)\\n exit()\\n \",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nfor strs in map(loads, stdin):\\n w = defaultdict(list)\\n for s in strs:\\n w[''.join(sorted(s))].append(s)\\n print(str(w.values())[12:-1].replace(\\\"'\\\", '\\\"').replace(\\\" \\\", \\\"\\\"), file=f)\\nexit()\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n sorted_string_dictionary = dict()\\n for s in strs:\\n sorted_string_key = ''.join(sorted(s))\\n group = sorted_string_dictionary.get(sorted_string_key, [])\\n group.append(s)\\n sorted_string_dictionary[sorted_string_key] = group\\n\\n return sorted_string_dictionary.values()\\n\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"def groupAnagrams(strs: List[str]) -> List[List[str]]:\\n ans = collections.defaultdict(list)\\n for i in strs:\\n ans[tuple(sorted(i))].append(i)\\n \\n return ans.values()\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f\\\"{list(groupAnagrams(case))}\\\\n\\\".replace(\\\"'\\\", '\\\"'))\\nexit(0)\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n hashmap = dict()\\n\\n for word in strs:\\n sorted_word = \\\"\\\".join(sorted(word))\\n\\n if sorted_word not in hashmap:\\n hashmap[sorted_word] = []\\n hashmap[sorted_word] += [word]\\n \\n result = []\\n for key, val in hashmap.items():\\n result.append(val)\\n \\n return result\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dict1 = defaultdict(list)\\n for i in strs:\\n sortedw = ''.join(sorted(i))\\n dict1[sortedw].append(i)\\n return list(dict1.values())\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n\\n d = dict()\\n\\n for word in strs:\\n sorted_char_list = sorted(word)\\n new_word = \\\"\\\".join(sorted_char_list)\\n\\n if new_word in d:\\n d[new_word].append(word)\\n else:\\n d[new_word] = [word]\\n\\n return [val for val in d.values()]\\n\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"# input: []\\n# output: [[]]\\n\\n# input: ['abc']\\n# output: [['abc']]\\n\\n# input: ['abc', 'cab', 'ab']\\n# output: [['abc', 'cab'], ['ab']]\\n\\n# if strs is empty return [[]]\\n# append the first string from strs to output\\n# traverse the remaining strings in strs\\n# compare each string from strs to each group in the output\\n# insert each string to the group that contains its anagrams\\n\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n if not strs:\\n return [[]]\\n\\n output = []\\n hashmap = {}\\n for word in strs:\\n sorted_word = ''.join(sorted(word))\\n if sorted_word not in hashmap:\\n hashmap[sorted_word] = []\\n hashmap[sorted_word].append(word)\\n\\n for group in hashmap:\\n output.append(hashmap[group])\\n\\n return output\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n str_map = defaultdict(list)\\n for s in strs:\\n str_key = ''.join(sorted(s))\\n if str_key in str_map:\\n str_map[str_key].append(s)\\n else:\\n str_map[str_key] = [s]\\n \\n return list(str_map.values())\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n hashmap = {}\\n\\n for s in strs:\\n\\n sorted_s = \\\"\\\".join(sorted(s))\\n if sorted_s in hashmap:\\n hashmap[sorted_s].append(s)\\n else:\\n hashmap[sorted_s] = [s]\\n \\n return list(hashmap.values())\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = defaultdict(list)\\n\\n for s in strs:\\n res[tuple(sorted(s))].append(s)\\n \\n return res.values() \\n\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagram_dict = {}\\n for elem in strs: \\n anagram_dict[\\\"\\\".join(sorted(elem))] = anagram_dict.get(\\\"\\\".join(sorted(elem)),[]) + [elem]\\n list_of_anagrams = []\\n for key in anagram_dict:\\n list_of_anagrams.append(anagram_dict[key])\\n return list_of_anagrams\\n\\n \",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n d = defaultdict(list)\\n for word in strs:\\n key = ''.join(sorted(word))\\n d[key].append(word)\\n return d.values()\\n \",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagram_map = defaultdict(list)\\n\\n for word in strs:\\n sorted_word = ''.join(sorted(word))\\n anagram_map[sorted_word].append(word)\\n\\n return (anagram_map.values())\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n cache = defaultdict(list)\\n for word in strs:\\n sr = tuple(sorted(word))\\n cache[sr].append(word)\\n \\n return cache.values()\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dct = {}\\n output = []\\n for s in strs:\\n sortedStr = ''.join(sorted(s))\\n if sortedStr not in dct:\\n dct[sortedStr] = [s]\\n else: \\n dct[sortedStr].append(s)\\n for k, v in dct.items():\\n output.append(v)\\n return output\",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n grouped_anagrams = defaultdict(list)\\n\\n for word in strs:\\n sorted_word = ''.join(sorted(word))\\n grouped_anagrams[sorted_word].append(word)\\n\\n return list(grouped_anagrams.values())\",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs):\\n anagram_map = defaultdict(list)\\n \\n for word in strs:\\n sorted_word = ''.join(sorted(word))\\n anagram_map[sorted_word].append(word)\\n \\n return list(anagram_map.values())\",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagram_map = defaultdict(list)\\n\\n for word in strs:\\n sorted_word = ''.join(sorted(word))\\n anagram_map[sorted_word].append(word)\\n\\n return (anagram_map.values())\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = defaultdict(list)\\n\\n for s in strs:\\n key = \\\"\\\".join(sorted(s))\\n ans[key].append(s)\\n \\n return ans.values()\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagrams = {}\\n\\n for a in strs:\\n temp = ''.join(sorted(a))\\n if temp in anagrams:\\n anagrams[temp].append(a)\\n else:\\n anagrams[temp] = [a]\\n \\n result = []\\n for i in anagrams.values():\\n result.append(i)\\n return result\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n groups = {}\\n for s in strs:\\n ordered = \\\"\\\".join(sorted(s))\\n if ordered not in groups:\\n groups[ordered] = [s]\\n else:\\n groups[ordered] += [s]\\n return groups.values()\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = defaultdict(list)\\n for s in strs:\\n sorted_word = \\\"\\\".join(sorted(s))\\n res[sorted_word].append(s)\\n return res.values()\\n\\n \",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\n groupDict = {}\\n for string in strs:\\n sorted_string = ''.join(sorted(string))\\n if sorted_string not in groupDict:\\n groupDict[sorted_string] = [string]\\n else:\\n groupDict[sorted_string].append(string)\\n \\n return list(groupDict.values())\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n sorted_word_dic = {}\\n for i in strs:\\n a = ''.join(sorted(i))\\n if a not in sorted_word_dic:\\n sorted_word_dic[a] = [i]\\n else:\\n sorted_word_dic[a].append(i)\\n return sorted_word_dic.values()\\n \\n \\n \\n\\n\\n\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n result = defaultdict(list)\\n \\n for x in strs:\\n anchor = \\\"\\\".join(sorted(x))\\n result[anchor].append(x)\\n \\n return result.values()\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res=defaultdict(list)\\n for i in strs:\\n so=''.join(sorted(i))\\n res[so].append(i)\\n return list(res.values()) \\n\\n \",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n hashmap={}\\n for i in strs:\\n sortedstring=\\\"\\\".join(sorted(i))\\n if sortedstring in hashmap:\\n hashmap[sortedstring].append(i)\\n else:\\n hashmap[sortedstring]=[i]\\n return hashmap.values()\\n \",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n if not strs:\\n return ''\\n dict1 = {}\\n for s in strs:\\n sorted_str = ''.join(sorted(s))\\n if sorted_str in dict1:\\n dict1[sorted_str].append(s)\\n else:\\n dict1[sorted_str] = [s]\\n return list(dict1.values())\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = defaultdict(list)\\n\\n for s in strs:\\n count=[0]*26\\n for char in s:\\n count[ord(char)-ord(\\\"a\\\")]+=1\\n \\n res[tuple(count)].append(s)\\n \\n return res.values()\\n \",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n if((strs==[\\\"\\\"]) or (len(strs)==1)):\\n return [strs]\\n d={}\\n final = []\\n for i in strs:\\n temp = sorted(i)\\n key = ''.join(temp)\\n if(key not in d):\\n d[key]=[i]\\n else:\\n d[key].append(i)\\n for values in d.values():\\n final.append(values)\\n return final\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n d = {}\\n for s in strs:\\n srt = ''.join(sorted(s))\\n \\n if srt not in d:\\n d[srt] = []\\n d[srt].append(s)\\n return d.values()\",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nProblem: Given an array of strings strs, group the anagrams together.\\n\\nConstraints:\\n1 <= strs.length <= 104\\n0 <= strs[i].length <= 100\\nstrs[i] consists of lowercase English letters.\\n\\nanswer in any order.\\n\\nfind a way to check if two strings are anagram\\n\\nCompare and group strings \\n- maybe store it inside a dictionary with a common key\\n- use some unique encoded form of strings as key\\n-- use sorted string values itself as keys for dictionary\\n\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ana_dict = {}\\n for s in strs:\\n s_encoded = \\\"\\\".join(sorted(s))\\n if s_encoded in ana_dict:\\n ana_dict[s_encoded].append(s)\\n else:\\n ana_dict[s_encoded] = [s] \\n return list(ana_dict.values()) \",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs):\\n anagram_map = defaultdict(list)\\n \\n for word in strs:\\n sorted_word = ''.join(sorted(word))\\n anagram_map[sorted_word].append(word)\\n \\n return list(anagram_map.values())\\n \",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n # if string empty, then output list[list[\\\"\\\"]]\\n # ... single string, ... list[list[str]]\\n # Output result in any order\\n hash_map = defaultdict(list)\\n for s in strs:\\n hash_map[tuple(sorted(s))].append(s)\\n return hash_map.values()\\n\\nclass Solution:\\n def groupAnagrams(self, strs):\\n anagram_map = defaultdict(list)\\n \\n for word in strs:\\n sorted_word = ''.join(sorted(word))\\n anagram_map[sorted_word].append(word)\\n \\n return list(anagram_map.values())\\n \\n \\nclass Solution:\\n def groupAnagrams(self, strs):\\n res = []\\n anagram = defaultdict(list)\\n for word in strs:\\n anagram[\\\"\\\".join(sorted(word))].append(word)\\n \\n return list(anagram.values())\\n\\nclass Solution:\\n def groupAnagrams(self, strs):\\n if not strs:\\n return []\\n\\n res = []\\n\\n anagram_map = defaultdict(list)\\n for substring in strs:\\n anagram_map[\\\"\\\".join(sorted(substring))].append(substring)\\n \\n return list(anagram_map.values())\\n\\n\",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = defaultdict(list)\\n\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n\\n # print (f\\\"{s=} | {count=}\\\")\\n # print (f\\\"{tuple(count)=}\\\")\\n ans[tuple(count)].append(s)\\n # print (f\\\"{ans=}\\\\n\\\")\\n return ans.values()\\n\\n'''\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n resAll = {}\\n for s in strs:\\n # print(f'{s=}')\\n # print(f'{sorted(s)=}')\\n if not resAll.get( str(sorted(s)) ) :\\n resAll[str(sorted(s))] = [s]\\n else:\\n resAll[str(sorted(s))] += [s]\\n # print (f'{resAll=}\\\\n')\\n # print (f'resAll values: { list( resAll.values() ) }')\\n return list( resAll.values() )\\n'''\\n\\n\\n\\n\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n grouped ={}\\n for word in strs:\\n sorted_word =\\\"\\\".join(sorted(word))\\n if sorted_word in grouped:\\n grouped[sorted_word].append(word)\\n else:\\n grouped[sorted_word] = [word]\\n return list(grouped.values())\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\n anagrams = defaultdict(list)\\n result = []\\n \\n for i in strs:\\n sorted_i = tuple(sorted(i))\\n anagrams[sorted_i].append(i)\\n \\n for value in anagrams.values():\\n result.append(value)\\n return result\\n \",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n d = {}\\n for s in strs:\\n srt = ''.join(sorted(s))\\n if srt not in d:\\n d[srt] = []\\n d[srt].append(s)\\n return d.values()\\n\",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n map = {}\\n\\n for i in strs:\\n temp = \\\"\\\".join(sorted(i)) \\n\\n if temp not in map:\\n map[temp] = [i]\\n else:\\n map[temp].append(i)\\n \\n return map.values()\\n\\n\\n\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = collections.defaultdict(list)\\n\\n for s in strs:\\n key = \\\"\\\".join(sorted(s))\\n ans[key].append(s)\\n\\n return ans.values()\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dict = {}\\n for i in strs:\\n stri = str(''.join(sorted(list(i))))\\n print(stri)\\n if dict.get(stri) is None:\\n dict[stri] = [i]\\n else:\\n dict[stri].append(i)\\n final_dict = []\\n for i in dict.values():\\n final_dict.append(i)\\n return final_dict\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dic={}\\n for word in strs:\\n s = ''.join(sorted(word))\\n if s in dic.keys():\\n dic[s].append(word)\\n else:\\n w=[word]\\n dic[s]=w \\n res=list(dic.values())\\n return res \",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n groups = defaultdict(list)\\n \\n for word in strs:\\n key = [0] * 26\\n for char in word:\\n idx = ord(char) - ord('a')\\n key[idx] += 1\\n \\n groups[tuple(key)].append(word)\\n \\n return groups.values()\\n\",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagram_map = defaultdict(list)\\n result = []\\n\\n for s in strs:\\n sorted_s = tuple(sorted(s))\\n anagram_map[sorted_s].append(s)\\n\\n for value in anagram_map.values():\\n result.append(value)\\n \\n return result\\n\\n\",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = DefaultDict(list)\\n\\n for s in strs:\\n\\n key = \\\"\\\".join(sorted(s))\\n\\n ans[key].append(s) \\n\\n return ans.values() \",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n hashMap = defaultdict(list)\\n\\n for s in strs:\\n temp = list(s)\\n temp.sort()\\n temp = ''.join(temp)\\n hashMap[temp].append(s)\\n\\n res = list()\\n for val in hashMap.values():\\n res.append(val)\\n\\n return res\",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dct = {}\\n\\n for i in strs:\\n sortedstr = ''.join(sorted(list(i)))\\n if sortedstr not in dct:\\n dct[sortedstr] = [i]\\n else:\\n dct[sortedstr].append(i)\\n \\n output = []\\n for key in dct:\\n output.append(dct[key])\\n \\n return output\\n\\n \\n \",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n #{(0,0,0,0,0):[\\\"eat\\\",\\\"tea\\\"]}\\n map = collections.defaultdict(list)\\n\\n for string in strs:\\n count =[0]*26 \\n for c in string:\\n count[ord(c)-ord(\\\"a\\\")]+=1\\n map[tuple(count)].append(string)\\n return map.values()\\n\\n\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n # anagram: two words that have the same letters\\n # i know the efficent way to check if a word is anagram of another word\\n # if m is the len of the words, then O(m) cause you're doing m*O(1) lookups\\n\\n # pre-process, \\n\\n # loop over all words, sort one word, map from sorted --> list\\n\\n anagram_map = {}\\n\\n for word in strs:\\n og_word = word\\n sorted_word = ''.join(sorted(word))\\n if sorted_word in anagram_map:\\n anagram_map[sorted_word].append(og_word)\\n else:\\n anagram_map[sorted_word] = [og_word]\\n \\n grouped_anagrams = []\\n for anagram_list in anagram_map.values():\\n grouped_anagrams.append(anagram_list)\\n return grouped_anagrams\\n \",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n hashmap = {}\\n for word in strs:\\n sorted_word = \\\"\\\".join(sorted(word))\\n if sorted_word in hashmap:\\n hashmap[sorted_word].append(word)\\n else:\\n hashmap[sorted_word] = [word]\\n\\n return hashmap.values()\\n \",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n d = defaultdict(list)\\n for i in strs: \\n a = ''.join(sorted(i))\\n d[a].append(i)\\n\\n return list(d.values())\\n \",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n sorted_dict = dict()\\n for i in strs:\\n sorted_i = ''.join(sorted(i))\\n if sorted_i in sorted_dict.keys():\\n sorted_dict[sorted_i].append(i)\\n else:\\n sorted_dict[sorted_i] = [i]\\n return [v for k,v in sorted_dict.items()]\",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = defaultdict(list)\\n\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n\\n # print (f\\\"{s=} | {count=}\\\")\\n # print (f\\\"{tuple(count)=}\\\")\\n ans[tuple(count)].append(s)\\n # print (f\\\"{ans=}\\\\n\\\")\\n return ans.values()\\n\\n'''\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n resAll = {}\\n for s in strs:\\n # print(f'{s=}')\\n # print(f'{sorted(s)=}')\\n if not resAll.get( str(sorted(s)) ) :\\n resAll[str(sorted(s))] = [s]\\n else:\\n resAll[str(sorted(s))] += [s]\\n # print (f'{resAll=}\\\\n')\\n # print (f'resAll values: { list( resAll.values() ) }')\\n return list( resAll.values() )\\n'''\\n\\n\\n\\n\",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dic_uniq = defaultdict(list) \\n for word in strs:\\n sorted_word = ''.join(sorted(word))\\n dic_uniq[sorted_word].append(word)\\n \\n return list(dic_uniq.values())\\n\",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n c_to_i = {}\\n i = 0\\n for c in 'abcdefghijklmnopqrstuvwxyz':\\n c_to_i[c] = i\\n i += 1\\n\\n result = defaultdict(list)\\n for s in strs:\\n cnt = [0] * 26\\n for c in s:\\n cnt[c_to_i[c]] += 1\\n result[tuple(cnt)].append(s)\\n \\n output = []\\n for k in result:\\n output.append(result[k])\\n return output\",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"# from collections import defaultdict\\n\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n hash_map = {}\\n result = []\\n \\n for s in strs:\\n sorted_s = tuple(sorted(s))\\n if sorted_s not in hash_map.keys():\\n hash_map[sorted_s] = []\\n hash_map[sorted_s].append(s)\\n\\n for v in hash_map.values():\\n result.append(v)\\n\\n return result\\n \",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\\"\\\"\\\"\\n O(num_words * max_length_word)\\n O(num_words * max_length_word)\\n \\\"\\\"\\\"\\n groups = defaultdict(list)\\n \\n for word in strs:\\n key = [0] * 26\\n for char in word:\\n idx = ord(char) - ord('a')\\n key[idx] += 1\\n \\n groups[tuple(key)].append(word)\\n \\n return groups.values()\\n\",\n \"runtime\": \"93\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = collections.defaultdict(list)\\n\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n ans[tuple(count)].append(s)\\n return ans.values()\\n\",\n \"runtime\": \"93\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n d = {} #O(N*M)\\n for word in strs: #O(N*M)\\n char = [0] * 26\\n for ch in word:\\n char[ord(ch)-ord('a')] += 1\\n char = tuple(char)\\n if char in d:\\n d[char].append(word)\\n else:\\n d[char] = [word]\\n \\n return d.values()\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n\\n h_map = collections.defaultdict(list)\\n\\n for el in strs:\\n\\n base_coding = [0] * 26\\n\\n for ch in el:\\n\\n base_coding[ord(ch) - ord('a')] += 1\\n\\n h_map[tuple(base_coding)].append(el)\\n\\n return h_map.values()\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res={} \\n for char in strs:\\n sorted_word=''.join(sorted(char))\\n if sorted_word in res:\\n res[sorted_word].append(char)\\n else:\\n res[sorted_word]=[char]\\n result=list(res.values())\\n #result.sort(key=lambda group:strs.index(group[0]))\\n return result\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dic={}\\n for i in strs:\\n sorted_str=\\\"\\\".join(sorted(i))\\n if sorted_str in dic:\\n dic[sorted_str].append(i)\\n else:\\n dic[sorted_str]=[i]\\n return list(dic.values())\\n \",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = defaultdict(list)\\n\\n for s in strs:\\n count = [0] * 26\\n\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n\\n res[tuple(count)].append(s)\\n return res.values()\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\n hashmap = defaultdict(list)\\n for s in strs:\\n frequency = [0] * 26\\n for letter in s:\\n frequency[ord(letter) - ord('a')] += 1\\n frequency = tuple(frequency)\\n hashmap[frequency].append(s)\\n \\n ans = []\\n for key in hashmap:\\n ans.append(hashmap[key])\\n \\n return ans\\n \",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = collections.defaultdict(list)\\n\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord('a')] += 1\\n ans[tuple(count)].append(s)\\n return ans.values()\",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = defaultdict(list)\\n for word in strs:\\n ctr = [0] * 26\\n for w in word:\\n ctr[ord(w) - ord('a')] += 1\\n ctr = tuple(ctr)\\n\\n ans[ctr].append(word)\\n return list(ans.values())\\n \",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = defaultdict(list)\\n for word in strs:\\n count = [0] * 26\\n for char in word:\\n count[ord(char) - ord('a')] += 1\\n res[tuple(count)].append(word)\\n \\n return res.values()\",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\n freq = defaultdict(list)\\n\\n # we need to get the frequency of each word\\n\\n for word in strs:\\n count = [0] * 26\\n\\n for char in word:\\n\\n # we get the frequency of each character in a word\\n count[ord(char) - ord('a')] += 1\\n \\n\\n freq[tuple(count)].append(word)\\n \\n return freq.values()\",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = defaultdict(list)\\n\\n for s in strs:\\n count = [0] * 26\\n\\n for c in s:\\n count[ord(c) - ord('a')] += 1\\n \\n res[tuple(count)].append(s)\\n return res.values()\",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n groups: dict[str, list[int]] = {}\\n\\n for index, s in enumerate(strs):\\n \\n s_sorted = \\\"\\\".join(sorted(s))\\n\\n if s_sorted in groups:\\n groups[s_sorted].append(index)\\n else:\\n groups[s_sorted] = [index]\\n\\n return [\\n [ strs[index] for index in group_indexes ]\\n for group_indexes in groups.values()\\n ]\\n\",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anag_dict=defaultdict(list)\\n for s in strs:\\n char_cnt_ls=[0]*26\\n for char in s:\\n char_cnt_ls[ord(char)-ord('a')]+=1\\n tup_idx = tuple(char_cnt_ls) \\n anag_dict[tup_idx].append(s)\\n \\n return list(anag_dict.values())\",\n \"runtime\": \"101\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = []\\n groups = defaultdict(list)\\n\\n for s in strs:\\n alphaArr = [0] * 26\\n for ch in s:\\n alphaArr[ ord(ch) - ord('a') ] += 1\\n \\n groups[tuple(alphaArr)].append(s)\\n \\n return groups.values()\",\n \"runtime\": \"101\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n def encode(x):\\n sp = \\\"\\\"\\n for i in sorted(x.keys()):\\n sp += f\\\"{i}{x[i]}\\\"\\n return sp\\n cters = [(encode(dict(Counter(s))), s) for s in strs]\\n d = {}\\n for (enc, s) in cters:\\n if enc in d.keys():\\n d[enc].append(s)\\n else:\\n d[enc] = [s]\\n \\n return d.values()\\n \",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n #counters = [tuple(sorted(Counter(s).items())) for s in strs]\\n anagramDict = {}\\n for idx in range(len(strs)):\\n counter = [0 for _ in range(26)]\\n for c in strs[idx]:\\n counter[ord(c)%26] += 1\\n counter = tuple(counter)\\n if counter not in anagramDict:\\n anagramDict[counter] = []\\n anagramDict[counter].append(strs[idx])\\n return anagramDict.values()\",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n strMap = defaultdict(int)\\n resMap = defaultdict(list)\\n slist = []\\n for s in strs:\\n slist = sorted(s)\\n for c in slist:\\n strMap[c] +=1\\n resMap[tuple(slist)].append(s)\\n return list(resMap.values())\\n \",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = defaultdict(list)\\n for i in range(len(strs)):\\n char_arr = [0]*26\\n for c in strs[i]:\\n char_arr[ord(c) - ord('a')] += 1\\n ans[tuple(char_arr)].append(strs[i])\\n return list(ans.values())\",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n groups = {}\\n for s in strs:\\n char_count= [0 for _ in range(26)]\\n for c in s:\\n idx = ord(c) - ord('a')\\n char_count[idx] = char_count[idx] + 1\\n group_key = tuple(char_count)\\n if group_key not in groups:\\n groups[group_key] = []\\n groups[group_key].append(s)\\n return list(groups.values())\\n \",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n\\n res = defaultdict(list)\\n for word in strs:\\n word_counter = Counter(word)\\n key = tuple(sorted(word_counter.items()))\\n res[key].append(word)\\n \\n return list(res.values())\",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\n res = defaultdict(list)\\n\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c)-ord('a')] += 1 \\n res[tuple(count)].append(s)\\n \\n return res.values()\\n # hashmap = {} \\n \\n # for word in strs:\\n # base = [0] * 26\\n # for c in word.lower():\\n # base[ord(c)-ord('a')] += 1\\n # base = tuple(base)\\n # if base not in hashmap:\\n # hashmap[base] = [word]\\n # else:\\n # hashmap[base].append(word)\\n # return hashmap.values()\\n \\n \\n # rep = []\\n # while len(strs) > 0:\\n # reference = strs[0]\\n # groupAnagram = []\\n # compare = sorted(list(reference))\\n # for word in strs:\\n # if compare == sorted(list(word)):\\n # groupAnagram.append(word)\\n # for word in groupAnagram:\\n # strs.remove(word)\\n # rep.append(groupAnagram)\\n # return rep\\n \\n \\n\\n \",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n #Dict with key= tuple of freq arr and val as the list of original string\\n dic = defaultdict(list)\\n\\n #Go through each String in strs\\n for eachStr in strs:\\n #Initialize freq array\\n freq = [0 for i in range(26)]\\n\\n #Find freq array for that string\\n for eachChar in eachStr:\\n freq[ord(eachChar)-ord(\\\"a\\\")] +=1\\n \\n dic[tuple(freq)].append(eachStr)\\n \\n return dic.values()\\n\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n resAll = {}\\n for s in strs:\\n # print(f'{s=}')\\n # print(f'{sorted(s)=}')\\n if not resAll.get( str(sorted(s)) ) :\\n resAll[str(sorted(s))] = [s]\\n else:\\n resAll[str(sorted(s))] += [s]\\n # print (f'{resAll=}\\\\n')\\n # print (f'resAll values: { list( resAll.values() ) }')\\n return list( resAll.values() )\\n\\n'''\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = defaultdict(list)\\n\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n\\n print (f\\\"{s=} | {count=}\\\")\\n print (f\\\"{tuple(count)=}\\\")\\n ans[tuple(count)].append(s)\\n print (f\\\"{ans=}\\\\n\\\")\\n return ans.values()\\n\\n\\n\\n\\n'''\\n\\n\\n\\n\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n resAll = {}\\n for s in strs:\\n # print(f'{s=}')\\n # print(f'{sorted(s)=}')\\n if not resAll.get( str(sorted(s)) ) :\\n resAll[str(sorted(s))] = [s]\\n else:\\n resAll[str(sorted(s))] += [s]\\n # print (f'{resAll=}\\\\n')\\n # print (f'resAll values: { list( resAll.values() ) }')\\n return list( resAll.values() )\\n\\n'''\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = defaultdict(list)\\n\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n\\n print (f\\\"{s=} | {count=}\\\")\\n print (f\\\"{tuple(count)=}\\\")\\n ans[tuple(count)].append(s)\\n print (f\\\"{ans=}\\\\n\\\")\\n return ans.values()\\n\\n\\n\\n\\n'''\\n\\n\\n\\n\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n group = {}\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c)- ord('a')] += 1\\n if tuple(count) not in group:\\n group[tuple(count)] = []\\n group[tuple(count)].append(s)\\n return group.values()\\n\",\n \"runtime\": \"108\"\n },\n {\n \"code\": \"from collections import Counter, defaultdict\\n\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagrams = defaultdict(list)\\n\\n for element in strs:\\n counter = sorted(Counter(element).items())\\n\\n anagrams[tuple(counter)].append(element)\\n \\n return list(anagrams.values())\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n groups = collections.defaultdict(list) # tuple count, word\\n\\n for word in strs:\\n count = [0] * 26\\n for char in word:\\n val = ord(char) - ord(\\\"a\\\")\\n count[val] += 1\\n groups[tuple(count)].append(word)\\n return groups.values()\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = defaultdict(list)\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n res[tuple(count)].append(s)\\n return res.values()\",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n store = collections.defaultdict(list)\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord('a')] += 1\\n store[tuple(count)].append(s)\\n \\n return store.values()\",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n result = []\\n mapping = {}\\n k = 0\\n for i in range(len(strs)):\\n count = [0 for _ in range(26)]\\n for j in range(len(strs[i])):\\n char = ord(strs[i][j]) - ord('a')\\n count[char] += 1\\n count = tuple(count)\\n if count in mapping:\\n result[mapping[count]].append(strs[i])\\n else:\\n mapping[count] = k\\n result.append([strs[i]])\\n k += 1\\n return result\",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = defaultdict(list)\\n \\n for string in strs:\\n freq = Counter(string)\\n ans[frozenset(freq.items())].append(string)\\n \\n return ans.values()\\n\\n \",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n # let us see if there is a better approach\\n anagrams = defaultdict(list)\\n for s in strs:\\n code = [0]*26\\n for c in s:\\n code[ord(c)-97]+=1\\n code = [str(num) for num in code]\\n code = \\\"*\\\".join(code)\\n anagrams[code].append(s)\\n return list(anagrams.values())\\n \",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n answer = []\\n count_anagrams = {}\\n for i in strs:\\n count_alphabet = {}\\n for j in i:\\n count_alphabet[j] = count_alphabet.get(j,0) + 1\\n anagrams = list(count_alphabet.keys())\\n anagrams.sort()\\n sorted_anagrams = {i: count_alphabet[i] for i in anagrams}\\n anagrams_words = \\\"\\\"\\n for k in sorted_anagrams:\\n anagrams_words = anagrams_words + str(k) + str(sorted_anagrams[k])\\n if anagrams_words in count_anagrams:\\n count_anagrams[anagrams_words].append(i)\\n else:\\n count_anagrams[anagrams_words] = []\\n count_anagrams[anagrams_words].append(i)\\n for key in count_anagrams:\\n answer.append(count_anagrams[key])\\n return answer\\n \\n\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n bucket = {}\\n for word in strs:\\n key = [0] * 26\\n for ch in word:\\n key[ord(ch) - ord('a')] += 1\\n key = [str(i) for i in key]\\n key = '#'.join(key)\\n if key not in bucket:\\n bucket[key] = []\\n bucket[key].append(word)\\n return bucket.values()\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n mapper = defaultdict(list)\\n for word in strs:\\n mapper[self.encodeWord(word)].append(word)\\n return [mapper[key] for key in mapper]\\n\\n \\\"\\\"\\\"\\n encode a word into a tuple of tuples.\\n The first element in the inner tuple is the letter ord. \\n The second element in the inner tuple is the counts of the letter. \\n all the letters are in ascending order.\\n \\\"\\\"\\\"\\n def encodeWord(self, word: str) -> tuple[tuple[int]]:\\n counter = [0] * 26\\n for letter in word:\\n counter[ord(letter) - ord('a')] += 1\\n output = []\\n for i in range(26):\\n if counter[i] > 0:\\n output.append((i, counter[i]))\\n return tuple(output)\\n\\n \\n \",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n # instead use a list with 1 index for each letter and then\\n # add up the counts for each word and convert into a tuple\\n # to use as the index\\n # res = collections.defaultdict(list)\\n # for word in strs:\\n # counts = [0] * 26\\n # for c in word:\\n # counts[ord(c) - ord(\\\"a\\\")] += 1\\n # res[tuple(counts)].append(word)\\n # return res.values()\\n\\n\\n\\n\\n res = collections.defaultdict(list)\\n counts = [Counter(i) for i in strs]\\n for i in range(len(strs)):\\n res[tuple(sorted(counts[i].items()))].append(strs[i])\\n return res.values()\\n\\n \\n \",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n groups = {}\\n\\n for s in strs:\\n s_arr = [0] * 26\\n for c in s:\\n s_arr[ord(c) - ord(\\\"a\\\")] += 1\\n \\n x = groups.get(str(s_arr),[])\\n x.append(s)\\n groups[str(s_arr)] = x\\n return groups.values()\\n \",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"# from string import ascii_lowercase\\nNUM_LETTERS = 26\\n\\ndef encode_word(word):\\n counts = [0] * NUM_LETTERS\\n for letter in word:\\n idx = ord(letter) - ord('a')\\n counts[idx] += 1\\n\\n return '_'.join([str(x) for x in counts]) \\n\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n encodings_to_strs = {}\\n for word in strs:\\n encoding = encode_word(word)\\n if encoding in encodings_to_strs:\\n encodings_to_strs[encoding].append(word)\\n else:\\n encodings_to_strs[encoding] = [word]\\n\\n groups = []\\n for _, words in encodings_to_strs.items():\\n groups.append(words)\\n\\n return groups\\n \",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"class Solution:\\n def getAnagramKey(self, s: str):\\n key = [0 for _ in range(26)]\\n for ch in s:\\n id = ord(ch) - ord('a')\\n key[id] += 1\\n return tuple(key)\\n\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagram_groups = {}\\n for word in strs:\\n group_key = self.getAnagramKey(word)\\n if group_key not in anagram_groups:\\n anagram_groups[group_key] = []\\n anagram_groups[group_key].append(word)\\n return anagram_groups.values()\\n \",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n maplist = {}\\n wordlist = []\\n \\n i = 0\\n for word in strs:\\n s = list(word)\\n s.sort()\\n s = tuple(s)\\n print(word,s)\\n if s not in maplist:\\n maplist.update({s : i})\\n wordlist.append([word])\\n i += 1\\n elif s in maplist:\\n print(maplist[s])\\n wordlist[maplist[s]].append(word)\\n print(maplist)\\n return wordlist\\n\\n\\n\\n \",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n counters = [tuple(sorted(Counter(s).items())) for s in strs]\\n anagramDict = {}\\n for idx in range(len(strs)):\\n if counters[idx] not in anagramDict:\\n anagramDict[counters[idx]] = []\\n anagramDict[counters[idx]].append(strs[idx])\\n return anagramDict.values()\",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: list[str]) -> list[list[str]]:\\n anagrams = {}\\n for word in strs:\\n anagram = {char: word.count(char) for char in word}\\n anagram = frozenset(anagram.items())\\n if anagram not in anagrams:\\n anagrams[anagram] = [word]\\n else:\\n anagrams[anagram].append(word)\\n \\n return [sublist for sublist in anagrams.values()]\",\n \"runtime\": \"119\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: list[str]) -> list[list[str]]:\\n anagrams = {}\\n for word in strs:\\n anagram = {char: word.count(char) for char in word}\\n anagram = frozenset(anagram.items())\\n if anagram not in anagrams:\\n anagrams[anagram] = [word]\\n else:\\n anagrams[anagram].append(word)\\n \\n return [sublist for sublist in anagrams.values()]\",\n \"runtime\": \"119\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dic_uniq={}\\n for word in strs:\\n freq=frozenset(Counter(word).items())\\n if freq in dic_uniq:\\n dic_uniq[freq].append(word)\\n else:\\n dic_uniq[freq]=[word]\\n return list(dic_uniq.values())\",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"from collections import Counter, defaultdict\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anag_groups = defaultdict(list)\\n for s in strs:\\n counter = Counter(s)\\n k = \\\",\\\".join(sorted([f\\\"{c}: {count}\\\" for c, count in counter.items()]))\\n anag_groups[k].append(s)\\n\\n return [group for group in anag_groups.values()]\\n\\n\\n\\n\\n \",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dict2={}\\n for i in strs:\\n c=[0]*26\\n for j in i:\\n c[ord(j)-ord(\\\"a\\\")]+=1\\n if(tuple(c) not in dict2):\\n dict2[tuple(c)]=[i]\\n else:\\n dict2[tuple(c)].append(i)\\n res=[]\\n print(dict2)\\n for i in dict2:\\n res.append(dict2[i])\\n return res\\n \",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n # Method 1: using hashtable and tuple of O(26) as key\\n # t/c: O(m*n*26) -> O(m*n), where m is total number of words in strs and n is avg. number of chrs\\n # s/c: O(m*n*26) -> O(m*n) - for hashTable\\n \\n hashTable = defaultdict(list)\\n for word in strs:\\n counter = [0]*26\\n for c in word:\\n idx = ord(c)-ord('a')\\n counter[idx] += 1\\n hashTable[tuple(counter)].append(word)\\n print(hashTable)\\n return hashTable.values()\\n\\n # Method 2: using sorting -> O(m&nlogn*26) which is less efficient than method 1 \\n\\n\\n\\n\\n\\n\\n \\n\\n\\n\\n\",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"from string import ascii_lowercase as alc\\n\\nclass Solution:\\n def get_key(self, s: str) -> str:\\n \\\"\\\"\\\"format of key: a2b3... letter+freq in asc alphabetic order\\\"\\\"\\\"\\n freqs = {}\\n for char in s:\\n if char not in freqs:\\n freqs[char] = 0\\n freqs[char] += 1\\n \\n key = \\\"\\\"\\n for char in alc:\\n if char not in freqs:\\n continue\\n key += f\\\"{char}{freqs[char]}\\\"\\n \\n return key\\n \\n \\n \\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n key_output_index = {}\\n grouped_anagrams = []\\n for s in strs:\\n key = self.get_key(s)\\n if key not in key_output_index:\\n key_output_index[key] = len(grouped_anagrams)\\n grouped_anagrams.append([])\\n \\n output_index = key_output_index[key]\\n grouped_anagrams[output_index].append(s)\\n \\n return grouped_anagrams\",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = []\\n\\n char_mappings = {}\\n\\n for s in strs:\\n char_mapping = self.get_char_mapping(s)\\n if char_mapping not in char_mappings:\\n char_mappings[char_mapping] = [s]\\n else:\\n char_mappings[char_mapping].append(s)\\n\\n for _, v in char_mappings.items():\\n res.append(v)\\n\\n return res\\n\\n \\n\\n def get_char_mapping(self, s: str) -> str:\\n res = [0] * 26\\n for c in s:\\n res[ord(c) - ord('a')] += 1\\n\\n res = map(lambda c: str(c), res)\\n\\n return ','.join(res)\",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = {}\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n x = ans.get(str(count),[])\\n x.append(s)\\n ans[str(count)] = x\\n return ans.values()\",\n \"runtime\": \"123\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagrams_grouped = collections.defaultdict(list)\\n\\n for s in strs:\\n char_count = [0] * (26 + ord(\\\"a\\\"))\\n\\n for c in s:\\n char_count[ord(c)] += 1\\n\\n anagrams_grouped[tuple(char_count)].append(s)\\n\\n return anagrams_grouped.values()\",\n \"runtime\": \"123\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagrams = defaultdict(list)\\n for s in strs:\\n anagrams[frozenset(Counter(s).items())].append(s)\\n return list(anagrams.values())\\n\",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dic_uniq={}\\n for word in strs:\\n freq=frozenset(Counter(word).items())\\n if freq in dic_uniq:\\n dic_uniq[freq].append(word)\\n else:\\n dic_uniq[freq]=[word]\\n return [i for i in dic_uniq.values()]\",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n groups = {}\\n\\n for s in strs:\\n s_arr = [0] * 26\\n for c in s:\\n s_arr[ord(c) - ord(\\\"a\\\")] += 1\\n \\n x = groups.get(str(s_arr),[])\\n x.append(s)\\n groups[str(s_arr)] = x\\n return groups.values()\\n \",\n \"runtime\": \"125\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = []\\n\\n char_mappings = {}\\n\\n for s in strs:\\n char_mapping = self.get_char_mapping(s)\\n if char_mapping not in char_mappings:\\n char_mappings[char_mapping] = [s]\\n else:\\n char_mappings[char_mapping].append(s)\\n\\n for _, v in char_mappings.items():\\n res.append(v)\\n\\n return res\\n\\n \\n\\n def get_char_mapping(self, s: str) -> str:\\n res = [0] * 26\\n for c in s:\\n res[ord(c) - ord('a')] += 1\\n\\n res = map(lambda c: str(c), res)\\n\\n return ','.join(res)\",\n \"runtime\": \"125\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagram_dict = {} # Maps character multiset to a list of strings that are the anagrams of that multiset\\n for str in strs:\\n char_multiset = Counter()\\n frozen_char_multiset = None\\n for character in str:\\n current_count = char_multiset[character]\\n char_multiset[character] = current_count + 1\\n\\n frozen_char_multiset = frozenset(char_multiset.items())\\n\\n if frozen_char_multiset not in anagram_dict:\\n anagram_dict[frozen_char_multiset] = []\\n\\n anagram_dict[frozen_char_multiset].append(str)\\n\\n anagram_dict_as_list = []\\n\\n for key_multiset in anagram_dict:\\n anagram_dict_as_list.append(anagram_dict[key_multiset])\\n\\n return anagram_dict_as_list\\n\\n\\n\",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = []\\n\\n char_mappings = {}\\n\\n for s in strs:\\n char_mapping = self.get_char_mapping(s)\\n if char_mapping not in char_mappings:\\n char_mappings[char_mapping] = [s]\\n else:\\n char_mappings[char_mapping].append(s)\\n\\n for _, v in char_mappings.items():\\n res.append(v)\\n\\n return res\\n\\n \\n\\n def get_char_mapping(self, s: str) -> str:\\n res = [0] * 26\\n for c in s:\\n res[ord(c) - ord('a')] += 1\\n\\n res = map(lambda c: str(c), res)\\n\\n return ','.join(res)\",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = {}\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n x = ans.get(str(count),[])\\n x.append(s)\\n ans[str(count)] = x\\n return ans.values()\",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"class Solution:\\n def getUniqueIdentifier(self, word: str) -> str:\\n alphabet = [0 for i in range(26)]\\n for letter in word:\\n alphabet[ord(letter) - 97] += 1\\n \\n return ''.join([(chr(id) + str(freq) if freq != 0 else '') for id, freq in enumerate(alphabet)])\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n look_up = {}\\n for word in strs:\\n id = self.getUniqueIdentifier(word)\\n if id in look_up:\\n look_up[id].append(word)\\n else:\\n look_up[id] = [word]\\n\\n return look_up.values()\\n \\n \",\n \"runtime\": \"129\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anag = defaultdict(list)\\n for i in strs:\\n count = tuple(sorted(Counter(i).items()))\\n anag[count].append(i)\\n\\n return list(anag.values())\\n\\n\\n \",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n hashmap = defaultdict(list)\\n keyy = [0 for i in range(26)]\\n for i in strs:\\n keyy = [0 for i in range(26)]\\n for c in i:\\n keyy[ord(c)-ord('a')] += 1\\n print(keyy)\\n hashmap[tuple(keyy)].append(i)\\n return hashmap.values()\\n \",\n \"runtime\": \"130\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":131,"string":"131"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n found_anagrams={}\n anagrams_groups =[]\n for i, str in enumerate(strs):\n str_hashmap= {}\n str_group=[]\n str_group.append(str)\n if str not in found_anagrams:\n for c in str:\n str_hashmap[c] = 1 + str_hashmap.get(c, 0)\n \n for j in range(i+1, len(strs)):\n if len(str) == len(strs[j]):\n str_j_hashmap ={}\n for c in strs[j]:\n str_j_hashmap[c] = 1 + str_j_hashmap.get(c, 0)\n \n anagram=True\n for c in str:\n if str_hashmap[c] != str_j_hashmap.get(c, 0):\n anagram = False\n if anagram:\n str_group.append(strs[j])\n found_anagrams[strs[j]] = \"Grouped\"\n\n anagrams_groups.append(str_group)\n\n\n return anagrams_groups\n\n ","memory":"18200"},{"code":"# input: []\n# output: [[]]\n\n# input: ['abc']\n# output: [['abc']]\n\n# input: ['abc', 'cab', 'ab']\n# output: [['abc', 'cab'], ['ab']]\n\n# if strs is empty return [[]]\n# append the first string from strs to output\n# traverse the remaining strings in strs\n# compare each string from strs to each group in the output\n# insert each string to the group that contains its anagrams\n\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n def areAnagrams(a, b):\n if len(a) != len(b):\n return False\n return sorted(a) == sorted(b)\n\n if not strs:\n return [[]]\n \n output = [[strs[0]]]\n for i in range(1, len(strs)):\n inserted = False\n for group in output:\n if not inserted and areAnagrams(strs[i], group[0]):\n group.append(strs[i])\n inserted = True\n\n if not inserted:\n output.append([strs[i]])\n\n return output\n \n","memory":"18300"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n checked = []\n result = []\n n = len(strs)\n\n for i in range(n):\n\n if (strs[i] in checked):\n continue\n s = strs[i]\n curr = []\n curr.append(s)\n\n for j in range(i+1,n):\n t = strs[j]\n\n if (isAnagrams(s,t)):\n curr.append(t)\n checked.append(t)\n \n result.append(curr)\n\n return result\n\ndef isAnagrams(s, t):\n if (len(s) != len(t)):\n return False\n\n dict_s = {}\n dict_t = {}\n\n for letter in s:\n if (letter not in dict_s):\n dict_s[letter] = 1\n else:\n dict_s[letter] += 1\n \n for letter in t:\n if (letter not in dict_t):\n dict_t[letter] = 1\n else:\n dict_t[letter] += 1\n \n for key, value in dict_s.items():\n if (key not in dict_t):\n return False\n if (value != dict_t[key]):\n return False\n \n return True ","memory":"18400"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n # Determine if two strings are each other's anagrams\n def is_anagram(str1, str2): \n if len(str1) != len(str2):\n return False\n\n return True if sorted(str1) == sorted(str2) else False\n\n status = [False] * len(strs)\n grouped_anagrams = []\n for i in range(len(status)):\n if status[i] == True:\n continue\n\n group = [strs[i]]\n status[i] = True\n if i+1 < len(strs):\n for j in range(i+1, len(strs)):\n if status[j] == True:\n continue\n if is_anagram(strs[i], strs[j]):\n group.append(strs[j])\n status[j] = True\n\n\n grouped_anagrams.append(group)\n\n \n return grouped_anagrams","memory":"18500"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n found_anagrams={}\n anagrams_groups =[]\n for i, str in enumerate(strs):\n str_hashmap= {}\n str_group=[]\n str_group.append(str)\n if str not in found_anagrams:\n # for c in str:\n # str_hashmap[c] = 1 + str_hashmap.get(c, 0)\n sorted_str= sorted(str)\n \n for j in range(i+1, len(strs)):\n if len(str) == len(strs[j]):\n # str_j_hashmap ={}\n # for c in strs[j]:\n # str_j_hashmap[c] = 1 + str_j_hashmap.get(c, 0)\n\n sorted_str_j = sorted(strs[j])\n \n # anagram=True\n # for c in str:\n # if str_hashmap[c] != str_j_hashmap.get(c, 0):\n # anagram = False\n if sorted_str==sorted_str_j:\n # if anagram:\n str_group.append(strs[j])\n found_anagrams[strs[j]] = \"Grouped\"\n\n anagrams_groups.append(str_group)\n\n\n return anagrams_groups\n\n ","memory":"18600"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n\n def validAnagram(str1, str2):\n if len(str1) != len(str2): return False\n\n dict = {}\n for letter in str1:\n if letter in dict:\n dict[letter] += 1\n else:\n dict[letter] = 1\n \n for letter in str2:\n if letter not in dict or dict[letter] <= 0:\n return False\n else:\n dict[letter] -= 1\n \n return True\n\n if len(strs) <= 1: return [strs]\n\n list = []\n \n for string in strs:\n condition = True\n if len(list) == 0:\n list.append([strs[0]])\n else:\n for sublist in list:\n if validAnagram(string, sublist[0]):\n sublist.append(string)\n condition = False\n\n if condition:\n list.append([string])\n\n return list\n \n ","memory":"18700"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagram_map = defaultdict(list)\n for word in strs:\n anagram_map[''.join(sorted(word))].append(word)\n return list(anagram_map.values())\n","memory":"18800"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n charset = defaultdict(list)\n for word in strs:\n item = ''.join(sorted(word))\n charset[item].append(word)\n return sorted(charset.values())","memory":"18900"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n d = defaultdict(list)\n for s in strs:\n d[frozenset(Counter(s).items())].append(s)\n return list(d.values())\n\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n d = defaultdict(list)\n for s in strs:\n d[*map(s.count, ascii_lowercase)].append(s)\n return [*d.values()]\n\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n d = defaultdict(list)\n for s in strs:\n d[*sorted(s)].append(s)\n return d.values()\n\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n return map(itemgetter(1), groupby(sorted(strs, key=sorted), sorted))\n\n","memory":"19000"},{"code":"def isAnagram(s: str, t: str) -> bool:\n if len(s) != len(t):\n return False\n for c in s:\n if c not in t:\n return False\n else:\n t = t.replace(str(c), \"\", 1)\n return True \nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = []\n while (len(strs)):\n # This will like n^2. Probably too slow. \n a = [strs[0]]\n y = 1\n while (y < len(strs)):\n if (y < len(strs) and isAnagram(a[0], strs[y])):\n a.append(strs[y])\n strs.pop(y) # Oh, doesnt work for repeated indexese\n else:\n y += 1\n\n ans.append(a)\n strs.pop(0)\n ans.sort(key = lambda x: len(x))\n return ans \n ","memory":"19100"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n x = []\n emptyDict={}\n for i in range(len(strs)):\n if((''.join(sorted(strs[i]))) in list(emptyDict.keys())):\n emptyDict[(''.join(sorted(strs[i])))].append(strs[i]) \n else:\n emptyDict[(''.join(sorted(strs[i])))] = [strs[i]]\n return(list(emptyDict.values())) ","memory":"19200"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n x = []\n emptyDict={}\n for i in range(len(strs)):\n if((''.join(sorted(strs[i]))) in list(emptyDict.keys())):\n emptyDict[(''.join(sorted(strs[i])))].append(strs[i]) \n else:\n emptyDict[(''.join(sorted(strs[i])))] = [strs[i]]\n return(list(emptyDict.values())) ","memory":"19200"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dct = {}\n\n for i in strs:\n sortedstr = ''.join(sorted(list(i)))\n if sortedstr not in dct:\n dct[sortedstr] = [i]\n else:\n dct[sortedstr].append(i)\n \n output = []\n for key in dct:\n output.append(dct[key])\n \n return output\n\n \n ","memory":"19300"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n if not strs:\n return ''\n dict1 = {}\n for s in strs:\n sorted_str = ''.join(sorted(s))\n if sorted_str in dict1:\n dict1[sorted_str].append(s)\n else:\n dict1[sorted_str] = [s]\n return list(dict1.values())","memory":"19300"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n grouping: Dict = {}\n \n for string in strs:\n sortedString = self.sortString(string)\n if sortedString in grouping:\n #print(grouping)\n #print(sortedString)\n grouping[sortedString].append(string)\n else:\n grouping[sortedString] = [string]\n \n returnList = []\n for group in grouping.values():\n returnList.append(group)\n return returnList\n\n\n def sortString(self, string: str) -> str:\n stringArray = list(string)\n stringArray.sort()\n return ''.join(stringArray)\n\n ","memory":"19400"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n # go through each word in list, sort it, and add it to a hashtable\n # strs = [\"eat\",\"tea\",\"tan\",\"ate\",\"nat\",\"bat\"]\n # {aet: [0, 1], ant: []}\n\n dic = {}\n ret = []\n for word in strs:\n sorted_word = ''.join(sorted(word))\n if sorted_word in dic.keys():\n dic[sorted_word].append(word)\n else:\n dic[sorted_word] = [word]\n \n for val in dic.values():\n ret.append(val)\n return ret","memory":"19400"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dict = {}\n for i in strs:\n stri = str(''.join(sorted(list(i))))\n print(stri)\n if dict.get(stri) is None:\n dict[stri] = [i]\n else:\n dict[stri].append(i)\n final_dict = []\n for i in dict.values():\n final_dict.append(i)\n return final_dict","memory":"19500"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \n groupDict = {}\n for string in strs:\n sorted_string = ''.join(sorted(string))\n if sorted_string not in groupDict:\n groupDict[sorted_string] = [string]\n else:\n groupDict[sorted_string].append(string)\n \n return list(groupDict.values())","memory":"19500"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \n output = []\n mapper = defaultdict(list)\n\n for word in strs:\n sword = \"\".join(sorted(word))\n mapper[sword].append(word)\n\n for olist in mapper.values():\n output.append(olist)\n\n return output","memory":"19600"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n\n anagram_map = defaultdict(list)\n \n for word in strs:\n sorted_word = ''.join(sorted(word))\n anagram_map[sorted_word].append(word)\n \n return list(anagram_map.values())\n\n","memory":"19600"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n\n d = defaultdict(list)\n\n for word in strs :\n\n key = \"\".join(sorted(word))\n d[key].append(word)\n \n return list(d.values())\n ","memory":"19700"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \n anagrams = defaultdict(list)\n\n for s in strs:\n sortedstring = ''.join(sorted(s))\n anagrams[sortedstring].append(s)\n res = []\n\n for k, _ in anagrams.items():\n res.append(anagrams[k])\n return res","memory":"19700"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagrams = defaultdict(list)\n for s in strs:\n anagrams[str(sorted(s))].append(s)\n return list(anagrams.values())\n","memory":"19800"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n a = list(set(''.join(sorted(word)) for word in strs))\n b = [[] for i in range(len(a))] \n for word in strs:\n sorted_word = ''.join(sorted(word))\n for i in range(len(a)):\n if a[i] == sorted_word: \n b[i].append(word)\n \n return b\n\n ","memory":"19800"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = collections.defaultdict(list)\n\n for s in strs:\n key = \"\".join(sorted(s))\n ans[key].append(s)\n\n return ans.values()","memory":"19900"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = DefaultDict(list)\n\n for s in strs:\n\n key = \"\".join(sorted(s))\n\n ans[key].append(s) \n\n return ans.values() ","memory":"19900"},{"code":"class Solution:\n def groupAnagrams(self, strs: list[str]) -> list[list[str]]:\n dict = collections.defaultdict(list)\n\n for str in strs:\n key = ''.join(sorted(str))\n dict[key].append(str)\n\n return dict.values()","memory":"20000"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n hashmap = {}\n\n for string in strs:\n orderedString = ''.join(sorted(string))\n\n if orderedString not in hashmap:\n hashmap[orderedString] = []\n\n hashmap[orderedString].append(string) \n\n return hashmap.values()","memory":"20100"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n output = []\n sortedArr = []\n for currStr in strs:\n sortedStr = sorted(currStr)\n if sortedStr in sortedArr:\n i = sortedArr.index(sortedStr)\n output[i].append(currStr)\n else:\n sortedArr.append(sortedStr)\n output.append([currStr])\n return output","memory":"20100"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n map = {}\n\n for i in strs:\n temp = \"\".join(sorted(i)) \n\n if temp not in map:\n map[temp] = [i]\n else:\n map[temp].append(i)\n \n return map.values()\n\n\n","memory":"20200"},{"code":"from collections import defaultdict\n\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n result_map = defaultdict(list)\n \n for word in strs:\n sorted_word = \"\".join(sorted(word))\n result_map[sorted_word].append(word)\n\n return result_map.values()","memory":"20200"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dic = defaultdict(list)\n for s in strs:\n dic[''.join(sorted(s))].append(s)\n return dic.values()","memory":"20300"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n d={}\n for w in strs:\n sc=tuple(sorted(w))\n if sc in d:\n d[sc].append(w)\n else:\n d[sc]=[w]\n a=[]\n for v in d.values():\n a.append(v)\n return a\n\n ","memory":"20300"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagrams = collections.defaultdict(list)\n for word in strs:\n anagram = tuple(sorted(word))\n \n anagrams[anagram].append(word)\n\n return list(anagrams.values()) \n\n\n\n\n \n\n","memory":"20400"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n result = {}\n for word in strs:\n if str(sorted(word)) in result:\n result[str(sorted(word))].append(word)\n else:\n result[str(sorted(word))] = [word]\n return result.values()","memory":"20400"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n strMap = defaultdict(int)\n resMap = defaultdict(list)\n slist = []\n for s in strs:\n slist = sorted(s)\n for c in slist:\n strMap[c] +=1\n resMap[tuple(slist)].append(s)\n return list(resMap.values())\n ","memory":"20500"},{"code":"from collections import defaultdict\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \n anagrams = defaultdict(list)\n result = []\n \n for i in strs:\n sorted_i = tuple(sorted(i))\n anagrams[sorted_i].append(i)\n \n for value in anagrams.values():\n result.append(value)\n return result\n ","memory":"20500"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n hashmap = {}\n for word in strs:\n sorted_word = str(sorted(word))\n if sorted_word not in hashmap:\n hashmap[sorted_word] = []\n\n hashmap[sorted_word].append(word)\n\n return hashmap.values()\n \n\n\n ","memory":"20600"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = defaultdict(list)\n\n for c in strs:\n res[tuple(sorted(c))].append(c)\n return res.values() \n ","memory":"20600"},{"code":"from collections import defaultdict\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = defaultdict(list)\n for s in strs:\n sorted_s=tuple(sorted(s))\n res[sorted_s].append(s)\n \n return res.values() \n \n ","memory":"20700"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = collections.defaultdict(list)\n for s in strs:\n ans[tuple(sorted(s))].append(s)\n return ans.values()","memory":"20700"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n groups: dict[str, list[int]] = {}\n\n for index, s in enumerate(strs):\n \n s_sorted = \"\".join(sorted(s))\n\n if s_sorted in groups:\n groups[s_sorted].append(index)\n else:\n groups[s_sorted] = [index]\n\n return [\n [ strs[index] for index in group_indexes ]\n for group_indexes in groups.values()\n ]\n","memory":"20800"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n hm = {}\n for i, s in enumerate(strs):\n sorteds = \"\".join(sorted(s))\n if sorteds not in hm.keys():\n hm[sorteds] = [i]\n else:\n hm[sorteds].append(i)\n \n retarr = []\n for vals in hm.values():\n emptyarr = []\n for index in vals:\n emptyarr.append(strs[index])\n retarr.append(emptyarr)\n return retarr","memory":"20800"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = {}\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n x = ans.get(str(count),[])\n x.append(s)\n ans[str(count)] = x\n return ans.values()","memory":"20900"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n groups = {}\n\n for s in strs:\n s_arr = [0] * 26\n for c in s:\n s_arr[ord(c) - ord(\"a\")] += 1\n \n x = groups.get(str(s_arr),[])\n x.append(s)\n groups[str(s_arr)] = x\n return groups.values()\n ","memory":"20900"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = {}\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n x = ans.get(str(count),[])\n x.append(s)\n ans[str(count)] = x\n return ans.values()","memory":"21000"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n groups = {}\n\n for s in strs:\n s_arr = [0] * 26\n for c in s:\n s_arr[ord(c) - ord(\"a\")] += 1\n \n x = groups.get(str(s_arr),[])\n x.append(s)\n groups[str(s_arr)] = x\n return groups.values()\n ","memory":"21000"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n maplist = {}\n wordlist = []\n \n i = 0\n for word in strs:\n s = list(word)\n s.sort()\n s = tuple(s)\n print(word,s)\n if s not in maplist:\n maplist.update({s : i})\n wordlist.append([word])\n i += 1\n elif s in maplist:\n print(maplist[s])\n wordlist[maplist[s]].append(word)\n print(maplist)\n return wordlist\n\n\n\n ","memory":"21100"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \n ans = {}\n for s in strs:\n\n count = [0]*26\n\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n \n ans[tuple(count)] = ans.get(tuple(count), []) + [s]\n\n return list(ans.values())\n \n \n\n\n ","memory":"21100"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = {}\n for word in strs:\n ctr = [0] * 26\n for w in word:\n ctr[ord(w) - ord('a')] += 1\n ctr = tuple(ctr)\n\n if ctr in ans.keys():\n ans[ctr].append(word)\n else:\n ans[ctr] = [word]\n return list(ans.values())\n ","memory":"21200"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \n if len(strs) < 2:\n return [strs]\n\n ans = {}\n for s in strs:\n\n count = [0]*26\n\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n \n ans[tuple(count)] = ans.get(tuple(count), []) + [s]\n\n return list(ans.values())\n \n \n\n\n ","memory":"21200"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagram_dict = {}\n final = []\n for word in strs:\n anagram = {}\n for letter in word:\n anagram[letter] = anagram.get(letter,0) + 1\n\n anagram_dict[word] = anagram\n if len(final) == 0:\n final.append([word])\n else:\n appended = False\n for idx in range(len(final)):\n if anagram_dict[final[idx][-1]] == anagram:\n final[idx].append(word)\n appended = True\n elif idx == len(final) - 1 and not appended:\n final.append([word])\n return final ","memory":"21300"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagram_dict = {}\n final = []\n for word in strs:\n anagram = {}\n for letter in word:\n anagram[letter] = anagram.get(letter,0) + 1\n\n anagram_dict[word] = anagram\n if len(final) == 0:\n final.append([word])\n else:\n appended = False\n for idx in range(len(final)):\n if anagram_dict[final[idx][-1]] == anagram:\n final[idx].append(word)\n appended = True\n elif idx == len(final) - 1 and not appended:\n final.append([word])\n return final ","memory":"21300"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = defaultdict(list)\n for i in strs:\n count = [0] * 26\n for j in i:\n count[ord(j)-97] += 1\n res[tuple(count)].append(i)\n return list(res.values())","memory":"21400"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n groups = {}\n for s in strs:\n char_count= [0 for _ in range(26)]\n for c in s:\n idx = ord(c) - ord('a')\n char_count[idx] = char_count[idx] + 1\n group_key = tuple(char_count)\n if group_key not in groups:\n groups[group_key] = []\n groups[group_key].append(s)\n return list(groups.values())\n ","memory":"21400"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = defaultdict(list)\n for i in range(len(strs)):\n char_arr = [0]*26\n for c in strs[i]:\n char_arr[ord(c) - ord('a')] += 1\n ans[tuple(char_arr)].append(strs[i])\n return list(ans.values())","memory":"21500"},{"code":"from collections import defaultdict\nclass Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anag_dict=defaultdict(list)\n for s in strs:\n char_cnt_ls=[0]*26\n for char in s:\n char_cnt_ls[ord(char)-ord('a')]+=1\n tup_idx = tuple(char_cnt_ls) \n anag_dict[tup_idx].append(s)\n \n return list(anag_dict.values())","memory":"21500"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \n hashmap = defaultdict(list)\n for s in strs:\n frequency = [0] * 26\n for letter in s:\n frequency[ord(letter) - ord('a')] += 1\n frequency = tuple(frequency)\n hashmap[frequency].append(s)\n \n ans = []\n for key in hashmap:\n ans.append(hashmap[key])\n \n return ans\n ","memory":"21600"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n result = []\n mapping = {}\n k = 0\n for i in range(len(strs)):\n count = [0 for _ in range(26)]\n for j in range(len(strs[i])):\n char = ord(strs[i][j]) - ord('a')\n count[char] += 1\n count = tuple(count)\n if count in mapping:\n result[mapping[count]].append(strs[i])\n else:\n mapping[count] = k\n result.append([strs[i]])\n k += 1\n return result","memory":"21600"},{"code":"from collections import defaultdict, Counter\nclass Solution:\n def strs_to_numeric(self, s):\n n = [0] * 26\n for c in s:\n print(ord(c) - 97)\n n[ord(c) - 97] = n[ord(c) - 97] + 1\n return ' '.join(map(str, n))\n\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n anagrams = defaultdict(list)\n\n for s in strs:\n c = self.strs_to_numeric(s)\n print(c)\n anagrams[c].append(s)\n print(anagrams)\n return anagrams.values()\n\n ","memory":"21700"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dict2={}\n for i in strs:\n dict1={\"a\":0,\"b\":0,\"c\":0,\"d\":0,\"e\":0,\"f\":0,\"g\":0,\"h\":0,\"i\":0,\"j\":0,\"k\":0,\"l\":0,\"m\":0,\"n\":0, \"o\":0,\"p\":0,\"q\":0,\"r\":0,\"s\":0,\"t\":0,\"u\":0,\"v\":0,\"w\":0,\"x\":0,\"y\":0,\"z\":0}\n for j in i:\n dict1[j]+=1\n if(str(dict1) not in dict2):\n dict2[str(dict1)]=[i]\n else:\n dict2[str(dict1)].append(i)\n res=[]\n for i in dict2:\n res.append(dict2[i])\n return res\n ","memory":"21700"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \"\"\"\nLoop through the strings.\nConstruct a dictionary based on the string's characters + counts.\nCompare it to the other dictionaries found so far.\nAssociate an 'index' key with each dictionary for tracking results array. \n \"\"\"\n\n maps = []\n res = []\n idx = 0\n \n for s in strs:\n s_map = {}\n for c in s:\n s_map[c] = s_map.get(c, 0) + 1\n\n # print(maps)\n # print(res)\n # print(s, s_map)\n\n match = False\n for m in maps:\n if len(m.keys())-1 == len(s_map.keys()) and all([x in m and s_map[x] == m[x] for x in s_map]):\n # print(f\"matched {s} with {m}\")\n match = True\n res[m['_idx']].append(s)\n break\n \n if not match:\n s_map['_idx'] = idx\n idx += 1\n maps.append(s_map)\n res.append([s])\n # print(f'added {s_map}')\n\n return res","memory":"21800"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n dit = {}\n\n for word in strs:\n key = [0] * 26 \n\n for char in word:\n index = (ord('z')-ord(char))\n key[index] += 1\n\n keyTuple = tuple(key) \n if keyTuple in dit:\n dit[keyTuple].append(word)\n else:\n dit[keyTuple] = [word]\n\n\n return dit.values()\n \n ","memory":"21900"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = defaultdict(list)\n\n for s in strs:\n count = [0] * 26\n\n for c in s:\n count[ord(c) - ord('a')] += 1\n res[tuple(count)].append(s)\n return res.values()\n ","memory":"21900"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = collections.defaultdict(list)\n\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n ans[tuple(count)].append(s)\n return ans.values()\n","memory":"22000"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \n # n is defined as the total number of chars in the vector\n # O(n)\n # Convert each string to a 26 length vector array\n vectorStrs = []\n for string in strs: \n vectorStrs.append([0 for i in range(26)])\n for char in string: \n vectorStrs[-1][ord(char)-ord('a')] += 1\n # O(n)\n # Compare the arrays to their groupings\n results = []\n leaders = []\n \n for j in range(len(vectorStrs)): \n vectorStr = vectorStrs[j]\n normalWord = strs[j]\n groupExists = False\n \n for i in range(len(results)): \n leader = leaders[i]\n if self.isAnagram(leader, vectorStr): \n results[i].append(normalWord)\n groupExists = True\n break\n if not groupExists: \n results.append([normalWord])\n leaders.append(vectorStr)\n \n # Return grouped strings\n return results\n \n def isAnagram(self, vector1: List[int], vector2: List[int]) -> bool: \n for i in range(26): \n if vector1[i] != vector2[i]: \n return False\n return True\n \n ","memory":"22000"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n hm = collections.defaultdict(list)\n \n for word in strs: \n count = [0]*26\n \n for char in word:\n count[ord(char)-ord(\"a\")] +=1\n \n hm[tuple(count)].append(word)\n \n return hm.values()\n ","memory":"22100"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n d = {}\n for i in strs:\n b = [0] * 26\n for c in i:\n b[ord('z') - ord(c)] += 1\n if (tuple(b)) in d:\n d[(tuple(b))].append(i)\n else:\n d[(tuple(b))] = [i]\n return d.values()\n","memory":"22100"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n ans = defaultdict(list)\n\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n\n # print (f\"{s=} | {count=}\")\n # print (f\"{tuple(count)=}\")\n ans[tuple(count)].append(s)\n # print (f\"{ans=}\\n\")\n return ans.values()\n\n'''\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n resAll = {}\n for s in strs:\n # print(f'{s=}')\n # print(f'{sorted(s)=}')\n if not resAll.get( str(sorted(s)) ) :\n resAll[str(sorted(s))] = [s]\n else:\n resAll[str(sorted(s))] += [s]\n # print (f'{resAll=}\\n')\n # print (f'resAll values: { list( resAll.values() ) }')\n return list( resAll.values() )\n'''\n\n\n\n","memory":"22200"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n store = collections.defaultdict(list)\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord('a')] += 1\n store[tuple(count)].append(s)\n \n return store.values()","memory":"22200"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n res = defaultdict(list)\n for word in strs:\n seen = [0] * 26\n for letter in word:\n seen[ord(letter) - ord('a')] += 1\n \n res[tuple(seen)].append(word)\n return res.values()","memory":"22300"},{"code":"class Solution:\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n \n ans = collections.defaultdict(list)\n\n for s in strs:\n count = [0] * 26\n for c in s:\n count[ord(c) - ord(\"a\")] += 1\n ans[tuple(count)].append(s)\n return ans.values()\n\n ","memory":"22300"}],"string":"[\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n found_anagrams={}\\n anagrams_groups =[]\\n for i, str in enumerate(strs):\\n str_hashmap= {}\\n str_group=[]\\n str_group.append(str)\\n if str not in found_anagrams:\\n for c in str:\\n str_hashmap[c] = 1 + str_hashmap.get(c, 0)\\n \\n for j in range(i+1, len(strs)):\\n if len(str) == len(strs[j]):\\n str_j_hashmap ={}\\n for c in strs[j]:\\n str_j_hashmap[c] = 1 + str_j_hashmap.get(c, 0)\\n \\n anagram=True\\n for c in str:\\n if str_hashmap[c] != str_j_hashmap.get(c, 0):\\n anagram = False\\n if anagram:\\n str_group.append(strs[j])\\n found_anagrams[strs[j]] = \\\"Grouped\\\"\\n\\n anagrams_groups.append(str_group)\\n\\n\\n return anagrams_groups\\n\\n \",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"# input: []\\n# output: [[]]\\n\\n# input: ['abc']\\n# output: [['abc']]\\n\\n# input: ['abc', 'cab', 'ab']\\n# output: [['abc', 'cab'], ['ab']]\\n\\n# if strs is empty return [[]]\\n# append the first string from strs to output\\n# traverse the remaining strings in strs\\n# compare each string from strs to each group in the output\\n# insert each string to the group that contains its anagrams\\n\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n def areAnagrams(a, b):\\n if len(a) != len(b):\\n return False\\n return sorted(a) == sorted(b)\\n\\n if not strs:\\n return [[]]\\n \\n output = [[strs[0]]]\\n for i in range(1, len(strs)):\\n inserted = False\\n for group in output:\\n if not inserted and areAnagrams(strs[i], group[0]):\\n group.append(strs[i])\\n inserted = True\\n\\n if not inserted:\\n output.append([strs[i]])\\n\\n return output\\n \\n\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n checked = []\\n result = []\\n n = len(strs)\\n\\n for i in range(n):\\n\\n if (strs[i] in checked):\\n continue\\n s = strs[i]\\n curr = []\\n curr.append(s)\\n\\n for j in range(i+1,n):\\n t = strs[j]\\n\\n if (isAnagrams(s,t)):\\n curr.append(t)\\n checked.append(t)\\n \\n result.append(curr)\\n\\n return result\\n\\ndef isAnagrams(s, t):\\n if (len(s) != len(t)):\\n return False\\n\\n dict_s = {}\\n dict_t = {}\\n\\n for letter in s:\\n if (letter not in dict_s):\\n dict_s[letter] = 1\\n else:\\n dict_s[letter] += 1\\n \\n for letter in t:\\n if (letter not in dict_t):\\n dict_t[letter] = 1\\n else:\\n dict_t[letter] += 1\\n \\n for key, value in dict_s.items():\\n if (key not in dict_t):\\n return False\\n if (value != dict_t[key]):\\n return False\\n \\n return True \",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n # Determine if two strings are each other's anagrams\\n def is_anagram(str1, str2): \\n if len(str1) != len(str2):\\n return False\\n\\n return True if sorted(str1) == sorted(str2) else False\\n\\n status = [False] * len(strs)\\n grouped_anagrams = []\\n for i in range(len(status)):\\n if status[i] == True:\\n continue\\n\\n group = [strs[i]]\\n status[i] = True\\n if i+1 < len(strs):\\n for j in range(i+1, len(strs)):\\n if status[j] == True:\\n continue\\n if is_anagram(strs[i], strs[j]):\\n group.append(strs[j])\\n status[j] = True\\n\\n\\n grouped_anagrams.append(group)\\n\\n \\n return grouped_anagrams\",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n found_anagrams={}\\n anagrams_groups =[]\\n for i, str in enumerate(strs):\\n str_hashmap= {}\\n str_group=[]\\n str_group.append(str)\\n if str not in found_anagrams:\\n # for c in str:\\n # str_hashmap[c] = 1 + str_hashmap.get(c, 0)\\n sorted_str= sorted(str)\\n \\n for j in range(i+1, len(strs)):\\n if len(str) == len(strs[j]):\\n # str_j_hashmap ={}\\n # for c in strs[j]:\\n # str_j_hashmap[c] = 1 + str_j_hashmap.get(c, 0)\\n\\n sorted_str_j = sorted(strs[j])\\n \\n # anagram=True\\n # for c in str:\\n # if str_hashmap[c] != str_j_hashmap.get(c, 0):\\n # anagram = False\\n if sorted_str==sorted_str_j:\\n # if anagram:\\n str_group.append(strs[j])\\n found_anagrams[strs[j]] = \\\"Grouped\\\"\\n\\n anagrams_groups.append(str_group)\\n\\n\\n return anagrams_groups\\n\\n \",\n \"memory\": \"18600\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n\\n def validAnagram(str1, str2):\\n if len(str1) != len(str2): return False\\n\\n dict = {}\\n for letter in str1:\\n if letter in dict:\\n dict[letter] += 1\\n else:\\n dict[letter] = 1\\n \\n for letter in str2:\\n if letter not in dict or dict[letter] <= 0:\\n return False\\n else:\\n dict[letter] -= 1\\n \\n return True\\n\\n if len(strs) <= 1: return [strs]\\n\\n list = []\\n \\n for string in strs:\\n condition = True\\n if len(list) == 0:\\n list.append([strs[0]])\\n else:\\n for sublist in list:\\n if validAnagram(string, sublist[0]):\\n sublist.append(string)\\n condition = False\\n\\n if condition:\\n list.append([string])\\n\\n return list\\n \\n \",\n \"memory\": \"18700\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagram_map = defaultdict(list)\\n for word in strs:\\n anagram_map[''.join(sorted(word))].append(word)\\n return list(anagram_map.values())\\n\",\n \"memory\": \"18800\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n charset = defaultdict(list)\\n for word in strs:\\n item = ''.join(sorted(word))\\n charset[item].append(word)\\n return sorted(charset.values())\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n d = defaultdict(list)\\n for s in strs:\\n d[frozenset(Counter(s).items())].append(s)\\n return list(d.values())\\n\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n d = defaultdict(list)\\n for s in strs:\\n d[*map(s.count, ascii_lowercase)].append(s)\\n return [*d.values()]\\n\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n d = defaultdict(list)\\n for s in strs:\\n d[*sorted(s)].append(s)\\n return d.values()\\n\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n return map(itemgetter(1), groupby(sorted(strs, key=sorted), sorted))\\n\\n\",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"def isAnagram(s: str, t: str) -> bool:\\n if len(s) != len(t):\\n return False\\n for c in s:\\n if c not in t:\\n return False\\n else:\\n t = t.replace(str(c), \\\"\\\", 1)\\n return True \\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = []\\n while (len(strs)):\\n # This will like n^2. Probably too slow. \\n a = [strs[0]]\\n y = 1\\n while (y < len(strs)):\\n if (y < len(strs) and isAnagram(a[0], strs[y])):\\n a.append(strs[y])\\n strs.pop(y) # Oh, doesnt work for repeated indexese\\n else:\\n y += 1\\n\\n ans.append(a)\\n strs.pop(0)\\n ans.sort(key = lambda x: len(x))\\n return ans \\n \",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n x = []\\n emptyDict={}\\n for i in range(len(strs)):\\n if((''.join(sorted(strs[i]))) in list(emptyDict.keys())):\\n emptyDict[(''.join(sorted(strs[i])))].append(strs[i]) \\n else:\\n emptyDict[(''.join(sorted(strs[i])))] = [strs[i]]\\n return(list(emptyDict.values())) \",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n x = []\\n emptyDict={}\\n for i in range(len(strs)):\\n if((''.join(sorted(strs[i]))) in list(emptyDict.keys())):\\n emptyDict[(''.join(sorted(strs[i])))].append(strs[i]) \\n else:\\n emptyDict[(''.join(sorted(strs[i])))] = [strs[i]]\\n return(list(emptyDict.values())) \",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dct = {}\\n\\n for i in strs:\\n sortedstr = ''.join(sorted(list(i)))\\n if sortedstr not in dct:\\n dct[sortedstr] = [i]\\n else:\\n dct[sortedstr].append(i)\\n \\n output = []\\n for key in dct:\\n output.append(dct[key])\\n \\n return output\\n\\n \\n \",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n if not strs:\\n return ''\\n dict1 = {}\\n for s in strs:\\n sorted_str = ''.join(sorted(s))\\n if sorted_str in dict1:\\n dict1[sorted_str].append(s)\\n else:\\n dict1[sorted_str] = [s]\\n return list(dict1.values())\",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n grouping: Dict = {}\\n \\n for string in strs:\\n sortedString = self.sortString(string)\\n if sortedString in grouping:\\n #print(grouping)\\n #print(sortedString)\\n grouping[sortedString].append(string)\\n else:\\n grouping[sortedString] = [string]\\n \\n returnList = []\\n for group in grouping.values():\\n returnList.append(group)\\n return returnList\\n\\n\\n def sortString(self, string: str) -> str:\\n stringArray = list(string)\\n stringArray.sort()\\n return ''.join(stringArray)\\n\\n \",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n # go through each word in list, sort it, and add it to a hashtable\\n # strs = [\\\"eat\\\",\\\"tea\\\",\\\"tan\\\",\\\"ate\\\",\\\"nat\\\",\\\"bat\\\"]\\n # {aet: [0, 1], ant: []}\\n\\n dic = {}\\n ret = []\\n for word in strs:\\n sorted_word = ''.join(sorted(word))\\n if sorted_word in dic.keys():\\n dic[sorted_word].append(word)\\n else:\\n dic[sorted_word] = [word]\\n \\n for val in dic.values():\\n ret.append(val)\\n return ret\",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dict = {}\\n for i in strs:\\n stri = str(''.join(sorted(list(i))))\\n print(stri)\\n if dict.get(stri) is None:\\n dict[stri] = [i]\\n else:\\n dict[stri].append(i)\\n final_dict = []\\n for i in dict.values():\\n final_dict.append(i)\\n return final_dict\",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\n groupDict = {}\\n for string in strs:\\n sorted_string = ''.join(sorted(string))\\n if sorted_string not in groupDict:\\n groupDict[sorted_string] = [string]\\n else:\\n groupDict[sorted_string].append(string)\\n \\n return list(groupDict.values())\",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\n output = []\\n mapper = defaultdict(list)\\n\\n for word in strs:\\n sword = \\\"\\\".join(sorted(word))\\n mapper[sword].append(word)\\n\\n for olist in mapper.values():\\n output.append(olist)\\n\\n return output\",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n\\n anagram_map = defaultdict(list)\\n \\n for word in strs:\\n sorted_word = ''.join(sorted(word))\\n anagram_map[sorted_word].append(word)\\n \\n return list(anagram_map.values())\\n\\n\",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n\\n d = defaultdict(list)\\n\\n for word in strs :\\n\\n key = \\\"\\\".join(sorted(word))\\n d[key].append(word)\\n \\n return list(d.values())\\n \",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\n anagrams = defaultdict(list)\\n\\n for s in strs:\\n sortedstring = ''.join(sorted(s))\\n anagrams[sortedstring].append(s)\\n res = []\\n\\n for k, _ in anagrams.items():\\n res.append(anagrams[k])\\n return res\",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagrams = defaultdict(list)\\n for s in strs:\\n anagrams[str(sorted(s))].append(s)\\n return list(anagrams.values())\\n\",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n a = list(set(''.join(sorted(word)) for word in strs))\\n b = [[] for i in range(len(a))] \\n for word in strs:\\n sorted_word = ''.join(sorted(word))\\n for i in range(len(a)):\\n if a[i] == sorted_word: \\n b[i].append(word)\\n \\n return b\\n\\n \",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = collections.defaultdict(list)\\n\\n for s in strs:\\n key = \\\"\\\".join(sorted(s))\\n ans[key].append(s)\\n\\n return ans.values()\",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = DefaultDict(list)\\n\\n for s in strs:\\n\\n key = \\\"\\\".join(sorted(s))\\n\\n ans[key].append(s) \\n\\n return ans.values() \",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: list[str]) -> list[list[str]]:\\n dict = collections.defaultdict(list)\\n\\n for str in strs:\\n key = ''.join(sorted(str))\\n dict[key].append(str)\\n\\n return dict.values()\",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n hashmap = {}\\n\\n for string in strs:\\n orderedString = ''.join(sorted(string))\\n\\n if orderedString not in hashmap:\\n hashmap[orderedString] = []\\n\\n hashmap[orderedString].append(string) \\n\\n return hashmap.values()\",\n \"memory\": \"20100\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n output = []\\n sortedArr = []\\n for currStr in strs:\\n sortedStr = sorted(currStr)\\n if sortedStr in sortedArr:\\n i = sortedArr.index(sortedStr)\\n output[i].append(currStr)\\n else:\\n sortedArr.append(sortedStr)\\n output.append([currStr])\\n return output\",\n \"memory\": \"20100\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n map = {}\\n\\n for i in strs:\\n temp = \\\"\\\".join(sorted(i)) \\n\\n if temp not in map:\\n map[temp] = [i]\\n else:\\n map[temp].append(i)\\n \\n return map.values()\\n\\n\\n\",\n \"memory\": \"20200\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n result_map = defaultdict(list)\\n \\n for word in strs:\\n sorted_word = \\\"\\\".join(sorted(word))\\n result_map[sorted_word].append(word)\\n\\n return result_map.values()\",\n \"memory\": \"20200\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dic = defaultdict(list)\\n for s in strs:\\n dic[''.join(sorted(s))].append(s)\\n return dic.values()\",\n \"memory\": \"20300\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n d={}\\n for w in strs:\\n sc=tuple(sorted(w))\\n if sc in d:\\n d[sc].append(w)\\n else:\\n d[sc]=[w]\\n a=[]\\n for v in d.values():\\n a.append(v)\\n return a\\n\\n \",\n \"memory\": \"20300\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagrams = collections.defaultdict(list)\\n for word in strs:\\n anagram = tuple(sorted(word))\\n \\n anagrams[anagram].append(word)\\n\\n return list(anagrams.values()) \\n\\n\\n\\n\\n \\n\\n\",\n \"memory\": \"20400\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n result = {}\\n for word in strs:\\n if str(sorted(word)) in result:\\n result[str(sorted(word))].append(word)\\n else:\\n result[str(sorted(word))] = [word]\\n return result.values()\",\n \"memory\": \"20400\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n strMap = defaultdict(int)\\n resMap = defaultdict(list)\\n slist = []\\n for s in strs:\\n slist = sorted(s)\\n for c in slist:\\n strMap[c] +=1\\n resMap[tuple(slist)].append(s)\\n return list(resMap.values())\\n \",\n \"memory\": \"20500\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\n anagrams = defaultdict(list)\\n result = []\\n \\n for i in strs:\\n sorted_i = tuple(sorted(i))\\n anagrams[sorted_i].append(i)\\n \\n for value in anagrams.values():\\n result.append(value)\\n return result\\n \",\n \"memory\": \"20500\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n hashmap = {}\\n for word in strs:\\n sorted_word = str(sorted(word))\\n if sorted_word not in hashmap:\\n hashmap[sorted_word] = []\\n\\n hashmap[sorted_word].append(word)\\n\\n return hashmap.values()\\n \\n\\n\\n \",\n \"memory\": \"20600\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = defaultdict(list)\\n\\n for c in strs:\\n res[tuple(sorted(c))].append(c)\\n return res.values() \\n \",\n \"memory\": \"20600\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = defaultdict(list)\\n for s in strs:\\n sorted_s=tuple(sorted(s))\\n res[sorted_s].append(s)\\n \\n return res.values() \\n \\n \",\n \"memory\": \"20700\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = collections.defaultdict(list)\\n for s in strs:\\n ans[tuple(sorted(s))].append(s)\\n return ans.values()\",\n \"memory\": \"20700\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n groups: dict[str, list[int]] = {}\\n\\n for index, s in enumerate(strs):\\n \\n s_sorted = \\\"\\\".join(sorted(s))\\n\\n if s_sorted in groups:\\n groups[s_sorted].append(index)\\n else:\\n groups[s_sorted] = [index]\\n\\n return [\\n [ strs[index] for index in group_indexes ]\\n for group_indexes in groups.values()\\n ]\\n\",\n \"memory\": \"20800\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n hm = {}\\n for i, s in enumerate(strs):\\n sorteds = \\\"\\\".join(sorted(s))\\n if sorteds not in hm.keys():\\n hm[sorteds] = [i]\\n else:\\n hm[sorteds].append(i)\\n \\n retarr = []\\n for vals in hm.values():\\n emptyarr = []\\n for index in vals:\\n emptyarr.append(strs[index])\\n retarr.append(emptyarr)\\n return retarr\",\n \"memory\": \"20800\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = {}\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n x = ans.get(str(count),[])\\n x.append(s)\\n ans[str(count)] = x\\n return ans.values()\",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n groups = {}\\n\\n for s in strs:\\n s_arr = [0] * 26\\n for c in s:\\n s_arr[ord(c) - ord(\\\"a\\\")] += 1\\n \\n x = groups.get(str(s_arr),[])\\n x.append(s)\\n groups[str(s_arr)] = x\\n return groups.values()\\n \",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = {}\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n x = ans.get(str(count),[])\\n x.append(s)\\n ans[str(count)] = x\\n return ans.values()\",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n groups = {}\\n\\n for s in strs:\\n s_arr = [0] * 26\\n for c in s:\\n s_arr[ord(c) - ord(\\\"a\\\")] += 1\\n \\n x = groups.get(str(s_arr),[])\\n x.append(s)\\n groups[str(s_arr)] = x\\n return groups.values()\\n \",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n maplist = {}\\n wordlist = []\\n \\n i = 0\\n for word in strs:\\n s = list(word)\\n s.sort()\\n s = tuple(s)\\n print(word,s)\\n if s not in maplist:\\n maplist.update({s : i})\\n wordlist.append([word])\\n i += 1\\n elif s in maplist:\\n print(maplist[s])\\n wordlist[maplist[s]].append(word)\\n print(maplist)\\n return wordlist\\n\\n\\n\\n \",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\n ans = {}\\n for s in strs:\\n\\n count = [0]*26\\n\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n \\n ans[tuple(count)] = ans.get(tuple(count), []) + [s]\\n\\n return list(ans.values())\\n \\n \\n\\n\\n \",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = {}\\n for word in strs:\\n ctr = [0] * 26\\n for w in word:\\n ctr[ord(w) - ord('a')] += 1\\n ctr = tuple(ctr)\\n\\n if ctr in ans.keys():\\n ans[ctr].append(word)\\n else:\\n ans[ctr] = [word]\\n return list(ans.values())\\n \",\n \"memory\": \"21200\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\n if len(strs) < 2:\\n return [strs]\\n\\n ans = {}\\n for s in strs:\\n\\n count = [0]*26\\n\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n \\n ans[tuple(count)] = ans.get(tuple(count), []) + [s]\\n\\n return list(ans.values())\\n \\n \\n\\n\\n \",\n \"memory\": \"21200\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagram_dict = {}\\n final = []\\n for word in strs:\\n anagram = {}\\n for letter in word:\\n anagram[letter] = anagram.get(letter,0) + 1\\n\\n anagram_dict[word] = anagram\\n if len(final) == 0:\\n final.append([word])\\n else:\\n appended = False\\n for idx in range(len(final)):\\n if anagram_dict[final[idx][-1]] == anagram:\\n final[idx].append(word)\\n appended = True\\n elif idx == len(final) - 1 and not appended:\\n final.append([word])\\n return final \",\n \"memory\": \"21300\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagram_dict = {}\\n final = []\\n for word in strs:\\n anagram = {}\\n for letter in word:\\n anagram[letter] = anagram.get(letter,0) + 1\\n\\n anagram_dict[word] = anagram\\n if len(final) == 0:\\n final.append([word])\\n else:\\n appended = False\\n for idx in range(len(final)):\\n if anagram_dict[final[idx][-1]] == anagram:\\n final[idx].append(word)\\n appended = True\\n elif idx == len(final) - 1 and not appended:\\n final.append([word])\\n return final \",\n \"memory\": \"21300\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = defaultdict(list)\\n for i in strs:\\n count = [0] * 26\\n for j in i:\\n count[ord(j)-97] += 1\\n res[tuple(count)].append(i)\\n return list(res.values())\",\n \"memory\": \"21400\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n groups = {}\\n for s in strs:\\n char_count= [0 for _ in range(26)]\\n for c in s:\\n idx = ord(c) - ord('a')\\n char_count[idx] = char_count[idx] + 1\\n group_key = tuple(char_count)\\n if group_key not in groups:\\n groups[group_key] = []\\n groups[group_key].append(s)\\n return list(groups.values())\\n \",\n \"memory\": \"21400\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = defaultdict(list)\\n for i in range(len(strs)):\\n char_arr = [0]*26\\n for c in strs[i]:\\n char_arr[ord(c) - ord('a')] += 1\\n ans[tuple(char_arr)].append(strs[i])\\n return list(ans.values())\",\n \"memory\": \"21500\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anag_dict=defaultdict(list)\\n for s in strs:\\n char_cnt_ls=[0]*26\\n for char in s:\\n char_cnt_ls[ord(char)-ord('a')]+=1\\n tup_idx = tuple(char_cnt_ls) \\n anag_dict[tup_idx].append(s)\\n \\n return list(anag_dict.values())\",\n \"memory\": \"21500\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\n hashmap = defaultdict(list)\\n for s in strs:\\n frequency = [0] * 26\\n for letter in s:\\n frequency[ord(letter) - ord('a')] += 1\\n frequency = tuple(frequency)\\n hashmap[frequency].append(s)\\n \\n ans = []\\n for key in hashmap:\\n ans.append(hashmap[key])\\n \\n return ans\\n \",\n \"memory\": \"21600\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n result = []\\n mapping = {}\\n k = 0\\n for i in range(len(strs)):\\n count = [0 for _ in range(26)]\\n for j in range(len(strs[i])):\\n char = ord(strs[i][j]) - ord('a')\\n count[char] += 1\\n count = tuple(count)\\n if count in mapping:\\n result[mapping[count]].append(strs[i])\\n else:\\n mapping[count] = k\\n result.append([strs[i]])\\n k += 1\\n return result\",\n \"memory\": \"21600\"\n },\n {\n \"code\": \"from collections import defaultdict, Counter\\nclass Solution:\\n def strs_to_numeric(self, s):\\n n = [0] * 26\\n for c in s:\\n print(ord(c) - 97)\\n n[ord(c) - 97] = n[ord(c) - 97] + 1\\n return ' '.join(map(str, n))\\n\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n anagrams = defaultdict(list)\\n\\n for s in strs:\\n c = self.strs_to_numeric(s)\\n print(c)\\n anagrams[c].append(s)\\n print(anagrams)\\n return anagrams.values()\\n\\n \",\n \"memory\": \"21700\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dict2={}\\n for i in strs:\\n dict1={\\\"a\\\":0,\\\"b\\\":0,\\\"c\\\":0,\\\"d\\\":0,\\\"e\\\":0,\\\"f\\\":0,\\\"g\\\":0,\\\"h\\\":0,\\\"i\\\":0,\\\"j\\\":0,\\\"k\\\":0,\\\"l\\\":0,\\\"m\\\":0,\\\"n\\\":0, \\\"o\\\":0,\\\"p\\\":0,\\\"q\\\":0,\\\"r\\\":0,\\\"s\\\":0,\\\"t\\\":0,\\\"u\\\":0,\\\"v\\\":0,\\\"w\\\":0,\\\"x\\\":0,\\\"y\\\":0,\\\"z\\\":0}\\n for j in i:\\n dict1[j]+=1\\n if(str(dict1) not in dict2):\\n dict2[str(dict1)]=[i]\\n else:\\n dict2[str(dict1)].append(i)\\n res=[]\\n for i in dict2:\\n res.append(dict2[i])\\n return res\\n \",\n \"memory\": \"21700\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\\"\\\"\\\"\\nLoop through the strings.\\nConstruct a dictionary based on the string's characters + counts.\\nCompare it to the other dictionaries found so far.\\nAssociate an 'index' key with each dictionary for tracking results array. \\n \\\"\\\"\\\"\\n\\n maps = []\\n res = []\\n idx = 0\\n \\n for s in strs:\\n s_map = {}\\n for c in s:\\n s_map[c] = s_map.get(c, 0) + 1\\n\\n # print(maps)\\n # print(res)\\n # print(s, s_map)\\n\\n match = False\\n for m in maps:\\n if len(m.keys())-1 == len(s_map.keys()) and all([x in m and s_map[x] == m[x] for x in s_map]):\\n # print(f\\\"matched {s} with {m}\\\")\\n match = True\\n res[m['_idx']].append(s)\\n break\\n \\n if not match:\\n s_map['_idx'] = idx\\n idx += 1\\n maps.append(s_map)\\n res.append([s])\\n # print(f'added {s_map}')\\n\\n return res\",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n dit = {}\\n\\n for word in strs:\\n key = [0] * 26 \\n\\n for char in word:\\n index = (ord('z')-ord(char))\\n key[index] += 1\\n\\n keyTuple = tuple(key) \\n if keyTuple in dit:\\n dit[keyTuple].append(word)\\n else:\\n dit[keyTuple] = [word]\\n\\n\\n return dit.values()\\n \\n \",\n \"memory\": \"21900\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = defaultdict(list)\\n\\n for s in strs:\\n count = [0] * 26\\n\\n for c in s:\\n count[ord(c) - ord('a')] += 1\\n res[tuple(count)].append(s)\\n return res.values()\\n \",\n \"memory\": \"21900\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = collections.defaultdict(list)\\n\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n ans[tuple(count)].append(s)\\n return ans.values()\\n\",\n \"memory\": \"22000\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\n # n is defined as the total number of chars in the vector\\n # O(n)\\n # Convert each string to a 26 length vector array\\n vectorStrs = []\\n for string in strs: \\n vectorStrs.append([0 for i in range(26)])\\n for char in string: \\n vectorStrs[-1][ord(char)-ord('a')] += 1\\n # O(n)\\n # Compare the arrays to their groupings\\n results = []\\n leaders = []\\n \\n for j in range(len(vectorStrs)): \\n vectorStr = vectorStrs[j]\\n normalWord = strs[j]\\n groupExists = False\\n \\n for i in range(len(results)): \\n leader = leaders[i]\\n if self.isAnagram(leader, vectorStr): \\n results[i].append(normalWord)\\n groupExists = True\\n break\\n if not groupExists: \\n results.append([normalWord])\\n leaders.append(vectorStr)\\n \\n # Return grouped strings\\n return results\\n \\n def isAnagram(self, vector1: List[int], vector2: List[int]) -> bool: \\n for i in range(26): \\n if vector1[i] != vector2[i]: \\n return False\\n return True\\n \\n \",\n \"memory\": \"22000\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n hm = collections.defaultdict(list)\\n \\n for word in strs: \\n count = [0]*26\\n \\n for char in word:\\n count[ord(char)-ord(\\\"a\\\")] +=1\\n \\n hm[tuple(count)].append(word)\\n \\n return hm.values()\\n \",\n \"memory\": \"22100\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n d = {}\\n for i in strs:\\n b = [0] * 26\\n for c in i:\\n b[ord('z') - ord(c)] += 1\\n if (tuple(b)) in d:\\n d[(tuple(b))].append(i)\\n else:\\n d[(tuple(b))] = [i]\\n return d.values()\\n\",\n \"memory\": \"22100\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n ans = defaultdict(list)\\n\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n\\n # print (f\\\"{s=} | {count=}\\\")\\n # print (f\\\"{tuple(count)=}\\\")\\n ans[tuple(count)].append(s)\\n # print (f\\\"{ans=}\\\\n\\\")\\n return ans.values()\\n\\n'''\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n resAll = {}\\n for s in strs:\\n # print(f'{s=}')\\n # print(f'{sorted(s)=}')\\n if not resAll.get( str(sorted(s)) ) :\\n resAll[str(sorted(s))] = [s]\\n else:\\n resAll[str(sorted(s))] += [s]\\n # print (f'{resAll=}\\\\n')\\n # print (f'resAll values: { list( resAll.values() ) }')\\n return list( resAll.values() )\\n'''\\n\\n\\n\\n\",\n \"memory\": \"22200\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n store = collections.defaultdict(list)\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord('a')] += 1\\n store[tuple(count)].append(s)\\n \\n return store.values()\",\n \"memory\": \"22200\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n res = defaultdict(list)\\n for word in strs:\\n seen = [0] * 26\\n for letter in word:\\n seen[ord(letter) - ord('a')] += 1\\n \\n res[tuple(seen)].append(word)\\n return res.values()\",\n \"memory\": \"22300\"\n },\n {\n \"code\": \"class Solution:\\n def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\\n \\n ans = collections.defaultdict(list)\\n\\n for s in strs:\\n count = [0] * 26\\n for c in s:\\n count[ord(c) - ord(\\\"a\\\")] += 1\\n ans[tuple(count)].append(s)\\n return ans.values()\\n\\n \",\n \"memory\": \"22300\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":72,"string":"72"}}},{"rowIdx":143,"cells":{"question_id":{"kind":"number","value":50,"string":"50"},"name":{"kind":"string","value":"powx-n"},"content":{"kind":"string","value":"<p>Implement <a href=\"http://www.cplusplus.com/reference/valarray/pow/\" target=\"_blank\">pow(x, n)</a>, which calculates <code>x</code> raised to the power <code>n</code> (i.e., <code>x<sup>n</sup></code>).</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> x = 2.00000, n = 10\n<strong>Output:</strong> 1024.00000\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> x = 2.10000, n = 3\n<strong>Output:</strong> 9.26100\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> x = 2.00000, n = -2\n<strong>Output:</strong> 0.25000\n<strong>Explanation:</strong> 2<sup>-2</sup> = 1/2<sup>2</sup> = 1/4 = 0.25\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>-100.0 < x < 100.0</code></li>\n\t<li><code>-2<sup>31</sup> <= n <= 2<sup>31</sup>-1</code></li>\n\t<li><code>n</code> is an integer.</li>\n\t<li>Either <code>x</code> is not zero or <code>n > 0</code>.</li>\n\t<li><code>-10<sup>4</sup> <= x<sup>n</sup> <= 10<sup>4</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":35.534516035452036,"string":"35.534516"},"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\": [[\"13\", 0.0042], [\"14\", 0.0042], [\"15\", 0.0378], [\"16\", 0.0168], [\"17\", 0.0252], [\"18\", 0.0504], [\"19\", 0.2522], [\"20\", 0.1135], [\"21\", 0.1933], [\"22\", 0.5758], [\"23\", 0.8363], [\"24\", 0.5169], [\"25\", 0.9372], [\"26\", 2.3199], [\"27\", 2.4628], [\"28\", 1.7357], [\"29\", 2.7486], [\"30\", 6.2369], [\"31\", 5.5728], [\"32\", 3.5177], [\"33\", 5.7325], [\"34\", 9.5738], [\"35\", 7.2876], [\"36\", 5.2282], [\"37\", 6.7874], [\"38\", 9.2628], [\"39\", 6.7076], [\"40\", 4.2994], [\"41\", 4.3624], [\"42\", 4.0178], [\"43\", 2.82]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16100\", 0.0336], [\"16200\", 0.2017], [\"16300\", 2.8116], [\"16400\", 12.0493], [\"16500\", 33.8615], [\"16600\", 36.3579]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n == 0:return 1\n if n < 0:return self.myPow(1/x, -n)\n lower = self.myPow(x, n//2)\n if n % 2 == 0:return lower * lower\n else: return lower * lower * x","runtime":"13"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n == 0:\n return 1\n if n<0:\n x = 1/x\n n = -n\n\n res = 1\n cur_v = x\n while(n>0):\n if n%2 == 1:\n res = res*cur_v\n cur_v *= cur_v\n n = n//2\n return res ","runtime":"14"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return math.pow(x,n)","runtime":"15"},{"code":"class Solution:\n def binaryExp(self, x: float, n: int) -> float:\n # Base case, to stop recursive calls.\n if n == 0:\n return 1\n\n # Handle case where, n < 0.\n if n < 0:\n return 1.0 / self.binaryExp(x, -1 * n)\n\n # Perform Binary Exponentiation.\n # If 'n' is odd we perform Binary Exponentiation on 'n - 1' and multiply result with 'x'.\n if n % 2 == 1:\n return x * self.binaryExp(x * x, (n - 1) // 2)\n # Otherwise we calculate result by performing Binary Exponentiation on 'n'.\n else:\n return self.binaryExp(x * x, n // 2)\n\n def myPow(self, x: float, n: int) -> float:\n return self.binaryExp(x, n)","runtime":"16"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n x=pow(x,n)\n return x\n ","runtime":"17"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return x ** (n)","runtime":"18"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return round(x**n, 5)","runtime":"19"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return pow(x, n)","runtime":"20"},{"code":"class Solution:\n # def myPow(self, x: float, n: int) -> float:\n def myPow(self, x: float, n: int) -> float:\n # input float number x, int number n of exponent.\n # output: float value of x**n.\n if n == 0: return 1\n if n < 0: \n x = 1 / x\n n = abs(n)\n ans = 1\n while n > 0:\n if (n & 1):\n ans *= x \n x *= x\n n >>= 1\n return ans\n # n = 5, 101 \n # 101: ans = x, x -> x^2 n -> 10\n # 10: ans = x, x -> x^4, n -> 1\n # 1: ans = ans * x^4, x-> x^8, n -> 0\n\n ","runtime":"21"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n == 0:\n return 1\n elif n < 0:\n return 1/self.myPow(x, (n * -1))\n elif n == 1:\n return x\n elif n == 2:\n return x * x\n else:\n if (n % 2) == 0:\n b = self.myPow(x, n//2)\n return b * b\n else:\n b = self.myPow(x, n//2)\n return b * b * x","runtime":"22"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return x ** n","runtime":"22"},{"code":"# binary exponentiation\nclass Solution:\n def myPow(self, x: float, n: int) -> float:\n if n == 0:\n return 1.0\n if n < 0:\n return 1.0 / self.myPow(x, -n)\n if n %2 == 1:\n return x * self.myPow(x * x, (n - 1) // 2)\n if n % 2 == 0:\n return self.myPow(x * x, n // 2)","runtime":"23"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n==0:\n return 1\n if n<0:\n n = -n\n x = 1/x\n def power(x, n):\n if n==0:\n return 1\n half = power(x, n//2)\n if n%2==0:\n return half*half\n else:\n return half*half*x\n return power(x, n)\n # # handle base case when n is 0\n # if n==0:\n # return 1\n # # handle negative number\n # if n < 0:\n # n = -n\n # x = 1/x\n # # recusrion fast exponentiation\n # def power(x, n):\n # if n==0:\n # return 1\n # half = power(x, n//2)\n # if n%2==0:\n # return half*half\n # else:\n # return half*half*x\n\n \n # return power(x, n)\n \n \n","runtime":"23"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n < 0:\n n = -1 * n\n x = 1/x\n \n result = 1\n while n > 0:\n if n % 2 == 1:\n result *= x\n n -= 1\n\n x *= x\n n //= 2\n\n return result\n \n\n","runtime":"24"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return x**n","runtime":"26"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return x ** n","runtime":"26"},{"code":"class Solution:\n @lru_cache\n def myPow(self, x: float, n: int) -> float:\n if n < 0:\n return 1 / self.myPow(x, -n)\n \n if n == 0:\n return 1\n\n if n == 1:\n return x\n\n\n if n % 2 == 1:\n return x * self.myPow(x, n - 1)\n\n else:\n return self.myPow(x, n // 2) * self.myPow(x, n // 2)","runtime":"27"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return x**n","runtime":"27"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n \n if n == 0:\n return 1\n if n < 0:\n n = abs(n)\n x = 1 /x\n \n half = self.myPow(x, n // 2)\n\n if n % 2 == 0:\n return half * half\n return x * half * half","runtime":"28"},{"code":"class Solution:\n memo = {}\n def myPow(self, x: float, n: int) -> float:\n if (x,n) in self.memo:\n return self.memo[(x,n)]\n if n < 0:\n return 1 / self.myPow(x,-1*n)\n if n == 0:\n return 1.0\n if n == 1:\n return x\n if n % 2 == 1:\n self.memo[(x,n)] = self.myPow(x, n//2) * self.myPow(x, n//2+1)\n else:\n self.memo[(x,n)] = self.myPow(x, n // 2) * self.myPow(x, n // 2)\n #self.memo[(x,n)] = self.myPow(x*x, n // 2)\n return self.memo[(x,n)]","runtime":"28"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n == 0:\n return 1\n \n # Handle negative exponent\n if n < 0:\n x = 1 / x\n n = -n\n \n result = 1\n current_product = x\n \n while n > 0:\n if n % 2 == 1: # If n is odd\n result *= current_product\n current_product *= current_product\n n //= 2\n \n return result","runtime":"29"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n<0:\n x,n=1/x,-n\n result=1\n while n:\n if n&1:\n result*=x\n n>>=1\n x*=x\n return result \n\n ","runtime":"29"},{"code":"class Solution:\n def solve(self, a, b):\n if b == 0:\n return 1\n ans = self.solve(a, b // 2)\n ans *= ans\n if b & 1:\n return ans * a\n else:\n return ans\n\n def myPow(self, x: float, n: int) -> float:\n res = self.solve(x, abs(n))\n if n < 0:\n return 1 / res\n return res\n","runtime":"30"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n\n def helper(x,n):\n if n==0:\n return 1\n if n==1:\n return x\n if n<0:\n return 1/helper(x,-1*n)\n \n if n%2==0:\n return helper(x*x, n/2)\n return x*helper(x*x,(n-1)/2)\n return helper(x,n)\n ","runtime":"30"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n ans=1\n temp=n\n if n<0:\n n=n*(-1) \n while n>0:\n if n%2==1:\n ans*=x\n n=n-1\n else:\n n=n//2\n x=x*x\n\n if temp<0:\n return (1/ans)\n return ans\n\n\n \n ","runtime":"31"},{"code":"'''\n2^50\n(2*2)^25\n4^25\n4^1 * 4^24\n'''\n\nclass Solution:\n def myPow(self, x: float, n: int) -> float:\n if n == 0:\n return 1\n if n < 0:\n return 1/self.myPow(x, -n)\n \n if n % 2 == 0:\n return self.myPow(x*x, n//2)\n else:\n return x * self.myPow(x*x, (n-1)//2)","runtime":"31"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n < 0:\n x = 1 / x\n n = -n\n if n == 0:\n return 1\n if n%2 == 0:\n half = self.myPow(x,n//2)\n return half*half\n else:\n return self.myPow(x,n-1)*x\n ","runtime":"32"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if x==0 or x==1 or n==1:\n return x\n if n==0:\n return 1.0\n if n<-0:\n n=-n\n x=1.0/x\n \n res=1\n while n>0:\n if n%2==1:\n res=res*x\n n-=1\n n=n//2\n x=x*x\n return res","runtime":"32"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n\n def calc_power(x, n):\n if x == 0:\n return 0\n if n == 0:\n return 1\n \n res = calc_power(x, n // 2)\n res = res * res\n\n if n % 2 == 1:\n return res * x\n \n return res\n\n ans = calc_power(x, abs(n))\n\n if n >= 0:\n return ans\n \n return 1 / ans ","runtime":"33"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n == 0:\n return 1 # Base case: x^0 = 1\n if n < 0:\n x = 1 / x # Nếu n âm, đảo ngược x và làm n dương\n n = -n\n half = self.myPow(x, n // 2)\n if n % 2 == 0:\n return half * half\n else:\n return x * half * half\n","runtime":"33"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n\n def calc_power(x, n):\n if x == 0:\n return 0\n if n == 0:\n return 1\n \n res = calc_power(x, n // 2)\n res = res * res\n\n if n % 2 == 1:\n return res * x\n \n return res\n\n ans = calc_power(x, abs(n))\n\n if n >= 0:\n return ans\n \n return 1 / ans \n ","runtime":"34"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n == 0:\n return 1\n elif n < 0:\n x = 1 /x\n n = -n\n\n half = self.myPow(x, n // 2)\n if n % 2 == 0:\n return half * half\n else:\n return half * half * x\n","runtime":"34"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if x==0 or x==1 or n==1:\n return x\n if n==0:\n return 1\n if n<0:\n x=1.0/x\n n=-n\n \n res=1\n while n>0:\n if n%2==1:\n res=res*x\n n-=1\n n=n//2\n x=x*x\n return res","runtime":"35"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return x**n\n ","runtime":"35"},{"code":"class Solution:\n def solve(self, a, b):\n if b == 0:\n return 1\n ans = self.solve(a, b // 2)\n ans *= ans\n if b & 1:\n return ans * a\n else:\n return ans\n\n def myPow(self, x: float, n: int) -> float:\n res = self.solve(x, abs(n))\n if n < 0:\n return 1 / res\n return res\n","runtime":"36"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n==0:\n return 1\n if n<0:\n x=1/x\n n=-n\n res=1\n c=x\n while n>0:\n if n%2==1:\n res*=c\n c*=c\n n//=2\n return res ","runtime":"36"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n \n def function(base=x, exponent=abs(n)):\n if exponent == 0:\n return 1\n elif exponent % 2 == 0:\n return function(base*base, exponent // 2)\n else:\n return base * function(base*base, (exponent-1)//2)\n \n f = function()\n return float(f) if n >=0 else 1/f","runtime":"37"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n == 0:\n return 1\n if n < 0:\n x **= -1\n n *= -1\n if n % 2 == 1:\n return x * self.myPow(x, n - 1)\n else:\n num = self.myPow(x, n // 2)\n return num * num","runtime":"37"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return x**n ","runtime":"38"},{"code":"class Solution:\n myPow = lambda self, x, n: x**n\n ","runtime":"38"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n ans = 1\n isNegative = True if n < 0 else False\n m = abs(n)\n while(m > 0):\n if m%2 == 1:\n ans = ans * x\n m = m-1\n else:\n x = x * x\n m = m/2\n return 1/ans if isNegative else ans","runtime":"39"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if x==0 or x==1 or n==1:\n return x\n if n==0:\n return 1\n if n<0:\n x=1.0/x\n n=-n\n \n res=1\n while n>0:\n if n%2==1:\n res=res*x\n n-=1\n n=n//2\n x=x*x\n return res","runtime":"39"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n mem = {}\n def helper(x, n):\n if n == 0:\n return 1\n if n == 1:\n return x\n if n in mem:\n return mem[n]\n m = n // 2\n prd = helper(x, m) * helper(x, n-m)\n mem[n] = prd\n return prd\n\n negative = False\n if n < 0:\n negative = True\n n = abs(n)\n answer = helper(x, n)\n if negative:\n answer = answer ** -1\n return answer","runtime":"40"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n # # my take; recursion, time O(logn), space O(logn), logic is x^n = (x^ n//2) ^ 2. (diff to iterative approach)\n # if n == 0:\n # return 1\n # # necessary because when n is -2, the two conditions below will be met sequentially in cycle. \n # if n == -1:\n # return 1 / x\n \n # if n % 2 == 0:\n # return self.myPow(x, n // 2) ** 2\n # else:\n # return x * (self.myPow(x, (n - 1.0) // 2) ** 2)\n\n # iterative time o(logn), space o(1), logic is x^n = (x^2) ^ (n//2)\n res = 1\n\n if n < 0:\n x = 1.0 / x\n n = -1.0 * n\n\n while n:\n half_n, remainder = divmod(n, 2)\n if remainder:\n res *= x\n x = x ** 2\n n = half_n\n\n return res\n\n\n# # # recursive, time o(logn), each call halving n, in total logn calls. inside each call, O(1) for divmod, mul\n# # # space o(logn)\n# def helper(x, abs_n):\n# if abs_n == 0:\n# return 1.0\n\n# half_n, remainder = divmod(abs_n, 2)\n# # (x^2)^half_n runs when n = int.minimum, -2^31\n# return helper(x * x, half_n) * (x if remainder else 1)\n \n# # below (x^half_n)^2, won't run when n = int.minimum, -2^31\n# # half_res = helper(x, half_n)\n# # return (half_res ** 2) * (x if remainder else 1)\n\n# if n >= 0:\n# return helper(x, n) \n# else:\n# # -1.0 * n is needed instead of abs(n), the latter will cause int overflow when n = int.minimum, the former casts n from into to float (64-bit double-precision)\n# return 1 / helper(x, -1.0 * n)\n\n\n# # # half_n remainder return\n# # # h(2, 3): 1 1. 2**2 * 2 = 8 \n# # # h(2, 1): 0 1 2\n# # # h(2, 0): ................ 1 ","runtime":"40"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n # pangkat = abs(n)\n # total = x\n # angka_awal = x\n # for i in range(pangkat-1):\n # total *= angka_awal\n # if n < 0:\n # return 1/total\n # if n == 0:\n # return 1\n # if n > 0:\n # return total \n return x**n","runtime":"41"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return x**n","runtime":"41"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n == 0:\n return 1\n else:\n if n < 0:\n return 1 /self.myPow(x, -n)\n else:\n half_power = self.myPow(x, n//2)\n if n % 2 == 0:\n return half_power * half_power\n else:\n return half_power * half_power * x\n","runtime":"42"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n == 0:\n return 1\n\n if n == -1:\n return 1/x\n\n if n == 1:\n return x\n \n \n return self.myPow(x*x, n//2) * self.myPow(x, n%2)\n","runtime":"42"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return x ** n ","runtime":"43"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return x**n\n ","runtime":"43"}],"string":"[\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n == 0:return 1\\n if n < 0:return self.myPow(1/x, -n)\\n lower = self.myPow(x, n//2)\\n if n % 2 == 0:return lower * lower\\n else: return lower * lower * x\",\n \"runtime\": \"13\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n == 0:\\n return 1\\n if n<0:\\n x = 1/x\\n n = -n\\n\\n res = 1\\n cur_v = x\\n while(n>0):\\n if n%2 == 1:\\n res = res*cur_v\\n cur_v *= cur_v\\n n = n//2\\n return res \",\n \"runtime\": \"14\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return math.pow(x,n)\",\n \"runtime\": \"15\"\n },\n {\n \"code\": \"class Solution:\\n def binaryExp(self, x: float, n: int) -> float:\\n # Base case, to stop recursive calls.\\n if n == 0:\\n return 1\\n\\n # Handle case where, n < 0.\\n if n < 0:\\n return 1.0 / self.binaryExp(x, -1 * n)\\n\\n # Perform Binary Exponentiation.\\n # If 'n' is odd we perform Binary Exponentiation on 'n - 1' and multiply result with 'x'.\\n if n % 2 == 1:\\n return x * self.binaryExp(x * x, (n - 1) // 2)\\n # Otherwise we calculate result by performing Binary Exponentiation on 'n'.\\n else:\\n return self.binaryExp(x * x, n // 2)\\n\\n def myPow(self, x: float, n: int) -> float:\\n return self.binaryExp(x, n)\",\n \"runtime\": \"16\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n x=pow(x,n)\\n return x\\n \",\n \"runtime\": \"17\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return x ** (n)\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return round(x**n, 5)\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return pow(x, n)\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n # def myPow(self, x: float, n: int) -> float:\\n def myPow(self, x: float, n: int) -> float:\\n # input float number x, int number n of exponent.\\n # output: float value of x**n.\\n if n == 0: return 1\\n if n < 0: \\n x = 1 / x\\n n = abs(n)\\n ans = 1\\n while n > 0:\\n if (n & 1):\\n ans *= x \\n x *= x\\n n >>= 1\\n return ans\\n # n = 5, 101 \\n # 101: ans = x, x -> x^2 n -> 10\\n # 10: ans = x, x -> x^4, n -> 1\\n # 1: ans = ans * x^4, x-> x^8, n -> 0\\n\\n \",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n == 0:\\n return 1\\n elif n < 0:\\n return 1/self.myPow(x, (n * -1))\\n elif n == 1:\\n return x\\n elif n == 2:\\n return x * x\\n else:\\n if (n % 2) == 0:\\n b = self.myPow(x, n//2)\\n return b * b\\n else:\\n b = self.myPow(x, n//2)\\n return b * b * x\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return x ** n\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"# binary exponentiation\\nclass Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n == 0:\\n return 1.0\\n if n < 0:\\n return 1.0 / self.myPow(x, -n)\\n if n %2 == 1:\\n return x * self.myPow(x * x, (n - 1) // 2)\\n if n % 2 == 0:\\n return self.myPow(x * x, n // 2)\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n==0:\\n return 1\\n if n<0:\\n n = -n\\n x = 1/x\\n def power(x, n):\\n if n==0:\\n return 1\\n half = power(x, n//2)\\n if n%2==0:\\n return half*half\\n else:\\n return half*half*x\\n return power(x, n)\\n # # handle base case when n is 0\\n # if n==0:\\n # return 1\\n # # handle negative number\\n # if n < 0:\\n # n = -n\\n # x = 1/x\\n # # recusrion fast exponentiation\\n # def power(x, n):\\n # if n==0:\\n # return 1\\n # half = power(x, n//2)\\n # if n%2==0:\\n # return half*half\\n # else:\\n # return half*half*x\\n\\n \\n # return power(x, n)\\n \\n \\n\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n < 0:\\n n = -1 * n\\n x = 1/x\\n \\n result = 1\\n while n > 0:\\n if n % 2 == 1:\\n result *= x\\n n -= 1\\n\\n x *= x\\n n //= 2\\n\\n return result\\n \\n\\n\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return x**n\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return x ** n\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n @lru_cache\\n def myPow(self, x: float, n: int) -> float:\\n if n < 0:\\n return 1 / self.myPow(x, -n)\\n \\n if n == 0:\\n return 1\\n\\n if n == 1:\\n return x\\n\\n\\n if n % 2 == 1:\\n return x * self.myPow(x, n - 1)\\n\\n else:\\n return self.myPow(x, n // 2) * self.myPow(x, n // 2)\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return x**n\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n \\n if n == 0:\\n return 1\\n if n < 0:\\n n = abs(n)\\n x = 1 /x\\n \\n half = self.myPow(x, n // 2)\\n\\n if n % 2 == 0:\\n return half * half\\n return x * half * half\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n memo = {}\\n def myPow(self, x: float, n: int) -> float:\\n if (x,n) in self.memo:\\n return self.memo[(x,n)]\\n if n < 0:\\n return 1 / self.myPow(x,-1*n)\\n if n == 0:\\n return 1.0\\n if n == 1:\\n return x\\n if n % 2 == 1:\\n self.memo[(x,n)] = self.myPow(x, n//2) * self.myPow(x, n//2+1)\\n else:\\n self.memo[(x,n)] = self.myPow(x, n // 2) * self.myPow(x, n // 2)\\n #self.memo[(x,n)] = self.myPow(x*x, n // 2)\\n return self.memo[(x,n)]\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n == 0:\\n return 1\\n \\n # Handle negative exponent\\n if n < 0:\\n x = 1 / x\\n n = -n\\n \\n result = 1\\n current_product = x\\n \\n while n > 0:\\n if n % 2 == 1: # If n is odd\\n result *= current_product\\n current_product *= current_product\\n n //= 2\\n \\n return result\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n<0:\\n x,n=1/x,-n\\n result=1\\n while n:\\n if n&1:\\n result*=x\\n n>>=1\\n x*=x\\n return result \\n\\n \",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def solve(self, a, b):\\n if b == 0:\\n return 1\\n ans = self.solve(a, b // 2)\\n ans *= ans\\n if b & 1:\\n return ans * a\\n else:\\n return ans\\n\\n def myPow(self, x: float, n: int) -> float:\\n res = self.solve(x, abs(n))\\n if n < 0:\\n return 1 / res\\n return res\\n\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n\\n def helper(x,n):\\n if n==0:\\n return 1\\n if n==1:\\n return x\\n if n<0:\\n return 1/helper(x,-1*n)\\n \\n if n%2==0:\\n return helper(x*x, n/2)\\n return x*helper(x*x,(n-1)/2)\\n return helper(x,n)\\n \",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n ans=1\\n temp=n\\n if n<0:\\n n=n*(-1) \\n while n>0:\\n if n%2==1:\\n ans*=x\\n n=n-1\\n else:\\n n=n//2\\n x=x*x\\n\\n if temp<0:\\n return (1/ans)\\n return ans\\n\\n\\n \\n \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"'''\\n2^50\\n(2*2)^25\\n4^25\\n4^1 * 4^24\\n'''\\n\\nclass Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n == 0:\\n return 1\\n if n < 0:\\n return 1/self.myPow(x, -n)\\n \\n if n % 2 == 0:\\n return self.myPow(x*x, n//2)\\n else:\\n return x * self.myPow(x*x, (n-1)//2)\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n < 0:\\n x = 1 / x\\n n = -n\\n if n == 0:\\n return 1\\n if n%2 == 0:\\n half = self.myPow(x,n//2)\\n return half*half\\n else:\\n return self.myPow(x,n-1)*x\\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if x==0 or x==1 or n==1:\\n return x\\n if n==0:\\n return 1.0\\n if n<-0:\\n n=-n\\n x=1.0/x\\n \\n res=1\\n while n>0:\\n if n%2==1:\\n res=res*x\\n n-=1\\n n=n//2\\n x=x*x\\n return res\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n\\n def calc_power(x, n):\\n if x == 0:\\n return 0\\n if n == 0:\\n return 1\\n \\n res = calc_power(x, n // 2)\\n res = res * res\\n\\n if n % 2 == 1:\\n return res * x\\n \\n return res\\n\\n ans = calc_power(x, abs(n))\\n\\n if n >= 0:\\n return ans\\n \\n return 1 / ans \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n == 0:\\n return 1 # Base case: x^0 = 1\\n if n < 0:\\n x = 1 / x # Nếu n âm, đảo ngược x và làm n dương\\n n = -n\\n half = self.myPow(x, n // 2)\\n if n % 2 == 0:\\n return half * half\\n else:\\n return x * half * half\\n\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n\\n def calc_power(x, n):\\n if x == 0:\\n return 0\\n if n == 0:\\n return 1\\n \\n res = calc_power(x, n // 2)\\n res = res * res\\n\\n if n % 2 == 1:\\n return res * x\\n \\n return res\\n\\n ans = calc_power(x, abs(n))\\n\\n if n >= 0:\\n return ans\\n \\n return 1 / ans \\n \",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n == 0:\\n return 1\\n elif n < 0:\\n x = 1 /x\\n n = -n\\n\\n half = self.myPow(x, n // 2)\\n if n % 2 == 0:\\n return half * half\\n else:\\n return half * half * x\\n\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if x==0 or x==1 or n==1:\\n return x\\n if n==0:\\n return 1\\n if n<0:\\n x=1.0/x\\n n=-n\\n \\n res=1\\n while n>0:\\n if n%2==1:\\n res=res*x\\n n-=1\\n n=n//2\\n x=x*x\\n return res\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return x**n\\n \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def solve(self, a, b):\\n if b == 0:\\n return 1\\n ans = self.solve(a, b // 2)\\n ans *= ans\\n if b & 1:\\n return ans * a\\n else:\\n return ans\\n\\n def myPow(self, x: float, n: int) -> float:\\n res = self.solve(x, abs(n))\\n if n < 0:\\n return 1 / res\\n return res\\n\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n==0:\\n return 1\\n if n<0:\\n x=1/x\\n n=-n\\n res=1\\n c=x\\n while n>0:\\n if n%2==1:\\n res*=c\\n c*=c\\n n//=2\\n return res \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n \\n def function(base=x, exponent=abs(n)):\\n if exponent == 0:\\n return 1\\n elif exponent % 2 == 0:\\n return function(base*base, exponent // 2)\\n else:\\n return base * function(base*base, (exponent-1)//2)\\n \\n f = function()\\n return float(f) if n >=0 else 1/f\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n == 0:\\n return 1\\n if n < 0:\\n x **= -1\\n n *= -1\\n if n % 2 == 1:\\n return x * self.myPow(x, n - 1)\\n else:\\n num = self.myPow(x, n // 2)\\n return num * num\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return x**n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n myPow = lambda self, x, n: x**n\\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n ans = 1\\n isNegative = True if n < 0 else False\\n m = abs(n)\\n while(m > 0):\\n if m%2 == 1:\\n ans = ans * x\\n m = m-1\\n else:\\n x = x * x\\n m = m/2\\n return 1/ans if isNegative else ans\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if x==0 or x==1 or n==1:\\n return x\\n if n==0:\\n return 1\\n if n<0:\\n x=1.0/x\\n n=-n\\n \\n res=1\\n while n>0:\\n if n%2==1:\\n res=res*x\\n n-=1\\n n=n//2\\n x=x*x\\n return res\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n mem = {}\\n def helper(x, n):\\n if n == 0:\\n return 1\\n if n == 1:\\n return x\\n if n in mem:\\n return mem[n]\\n m = n // 2\\n prd = helper(x, m) * helper(x, n-m)\\n mem[n] = prd\\n return prd\\n\\n negative = False\\n if n < 0:\\n negative = True\\n n = abs(n)\\n answer = helper(x, n)\\n if negative:\\n answer = answer ** -1\\n return answer\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n # # my take; recursion, time O(logn), space O(logn), logic is x^n = (x^ n//2) ^ 2. (diff to iterative approach)\\n # if n == 0:\\n # return 1\\n # # necessary because when n is -2, the two conditions below will be met sequentially in cycle. \\n # if n == -1:\\n # return 1 / x\\n \\n # if n % 2 == 0:\\n # return self.myPow(x, n // 2) ** 2\\n # else:\\n # return x * (self.myPow(x, (n - 1.0) // 2) ** 2)\\n\\n # iterative time o(logn), space o(1), logic is x^n = (x^2) ^ (n//2)\\n res = 1\\n\\n if n < 0:\\n x = 1.0 / x\\n n = -1.0 * n\\n\\n while n:\\n half_n, remainder = divmod(n, 2)\\n if remainder:\\n res *= x\\n x = x ** 2\\n n = half_n\\n\\n return res\\n\\n\\n# # # recursive, time o(logn), each call halving n, in total logn calls. inside each call, O(1) for divmod, mul\\n# # # space o(logn)\\n# def helper(x, abs_n):\\n# if abs_n == 0:\\n# return 1.0\\n\\n# half_n, remainder = divmod(abs_n, 2)\\n# # (x^2)^half_n runs when n = int.minimum, -2^31\\n# return helper(x * x, half_n) * (x if remainder else 1)\\n \\n# # below (x^half_n)^2, won't run when n = int.minimum, -2^31\\n# # half_res = helper(x, half_n)\\n# # return (half_res ** 2) * (x if remainder else 1)\\n\\n# if n >= 0:\\n# return helper(x, n) \\n# else:\\n# # -1.0 * n is needed instead of abs(n), the latter will cause int overflow when n = int.minimum, the former casts n from into to float (64-bit double-precision)\\n# return 1 / helper(x, -1.0 * n)\\n\\n\\n# # # half_n remainder return\\n# # # h(2, 3): 1 1. 2**2 * 2 = 8 \\n# # # h(2, 1): 0 1 2\\n# # # h(2, 0): ................ 1 \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n # pangkat = abs(n)\\n # total = x\\n # angka_awal = x\\n # for i in range(pangkat-1):\\n # total *= angka_awal\\n # if n < 0:\\n # return 1/total\\n # if n == 0:\\n # return 1\\n # if n > 0:\\n # return total \\n return x**n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return x**n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n == 0:\\n return 1\\n else:\\n if n < 0:\\n return 1 /self.myPow(x, -n)\\n else:\\n half_power = self.myPow(x, n//2)\\n if n % 2 == 0:\\n return half_power * half_power\\n else:\\n return half_power * half_power * x\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n == 0:\\n return 1\\n\\n if n == -1:\\n return 1/x\\n\\n if n == 1:\\n return x\\n \\n \\n return self.myPow(x*x, n//2) * self.myPow(x, n%2)\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return x ** n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return x**n\\n \",\n \"runtime\": \"43\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":50,"string":"50"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return x**n","memory":"16100"},{"code":"class Solution:\n myPow = lambda self, x, n: x**n\n ","memory":"16200"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return x**n","memory":"16300"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n < 0:\n return 1 / self.myPow(x, -n)\n elif n == 1:\n return x\n elif n == 0:\n return 1\n else:\n half = self.myPow(x, n // 2)\n if n % 2 == 0:\n return half * half\n else:\n return half * half * x\n ","memory":"16300"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return x ** n\n \n # if n == 0:\n # return 1\n # if n < 0:\n # return 1 / self.myPow(x, -n)\n # if n % 2 == 1:\n # return x * self.myPow(x, n - 1)\n # return self.myPow(x * x, n // 2)","memory":"16400"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n == 0:\n return 1\n if n < 0:\n x = 1 / x\n n = -n\n \n res = 1\n while n > 0:\n # If n is odd, multiply the result by x\n if n % 2 == 1:\n res *= x\n # Square the base and halve the exponent\n x *= x\n n //= 2\n \n return res\n","memory":"16400"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n return x ** n","memory":"16500"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n < 0:\n n *= -1\n x = 1 / x\n elif not n:\n return 1\n half = self.myPow(x, n // 2)\n return x * half * half if n % 2 else half * half","memory":"16500"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n cache = {0: 1}\n\n def dfs(n):\n if n == 0:\n return 1\n if n == 1 or n == -1:\n return x ** n\n\n if n%2==0:\n return dfs(n//2)**2\n else:\n if n > 0:\n return x * dfs(n//2)**2\n else:\n return x**(-1) * dfs((n+1)//2)**2\n return dfs(n)\n\n\n\n ","memory":"16600"},{"code":"class Solution:\n def myPow(self, x: float, n: int) -> float:\n if n == 0:\n return 1\n\n if n < 0:\n x = 1.0 / x\n n = -n\n\n result = 1\n while n != 0:\n if n % 2 != 0:\n result *= x\n n -= 1\n\n x = x ** 2 \n n = n // 2\n \n return result\n","memory":"16600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return x**n\",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n myPow = lambda self, x, n: x**n\\n \",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return x**n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n < 0:\\n return 1 / self.myPow(x, -n)\\n elif n == 1:\\n return x\\n elif n == 0:\\n return 1\\n else:\\n half = self.myPow(x, n // 2)\\n if n % 2 == 0:\\n return half * half\\n else:\\n return half * half * x\\n \",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return x ** n\\n \\n # if n == 0:\\n # return 1\\n # if n < 0:\\n # return 1 / self.myPow(x, -n)\\n # if n % 2 == 1:\\n # return x * self.myPow(x, n - 1)\\n # return self.myPow(x * x, n // 2)\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n == 0:\\n return 1\\n if n < 0:\\n x = 1 / x\\n n = -n\\n \\n res = 1\\n while n > 0:\\n # If n is odd, multiply the result by x\\n if n % 2 == 1:\\n res *= x\\n # Square the base and halve the exponent\\n x *= x\\n n //= 2\\n \\n return res\\n\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n return x ** n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n < 0:\\n n *= -1\\n x = 1 / x\\n elif not n:\\n return 1\\n half = self.myPow(x, n // 2)\\n return x * half * half if n % 2 else half * half\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n cache = {0: 1}\\n\\n def dfs(n):\\n if n == 0:\\n return 1\\n if n == 1 or n == -1:\\n return x ** n\\n\\n if n%2==0:\\n return dfs(n//2)**2\\n else:\\n if n > 0:\\n return x * dfs(n//2)**2\\n else:\\n return x**(-1) * dfs((n+1)//2)**2\\n return dfs(n)\\n\\n\\n\\n \",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def myPow(self, x: float, n: int) -> float:\\n if n == 0:\\n return 1\\n\\n if n < 0:\\n x = 1.0 / x\\n n = -n\\n\\n result = 1\\n while n != 0:\\n if n % 2 != 0:\\n result *= x\\n n -= 1\\n\\n x = x ** 2 \\n n = n // 2\\n \\n return result\\n\",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":10,"string":"10"}}},{"rowIdx":144,"cells":{"question_id":{"kind":"number","value":217,"string":"217"},"name":{"kind":"string","value":"contains-duplicate"},"content":{"kind":"string","value":"<p>Given an integer array <code>nums</code>, return <code>true</code> if any value appears <strong>at least twice</strong> in the array, and return <code>false</code> if every element is distinct.</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\">nums = [1,2,3,1]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">true</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<p>The element 1 occurs at the indices 0 and 3.</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\">nums = [1,2,3,4]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">false</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<p>All elements are distinct.</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\">nums = [1,1,1,3,3,4,3,2,4,2]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">true</span></p>\n</div>\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>-10<sup>9</sup> <= nums[i] <= 10<sup>9</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":62.2278828454085,"string":"62.227883"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["array","hash-table","sorting"],"string":"[\n \"array\",\n \"hash-table\",\n \"sorting\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"21\", 0.0050999999999999995], [\"27\", 0.0234], [\"32\", 0.024900000000000002], [\"38\", 0.0216], [\"44\", 0.0067], [\"49\", 0.0017], [\"55\", 0.0034], [\"60\", 0.0167], [\"66\", 0.0067], [\"71\", 0.0084], [\"77\", 0.0034], [\"82\", 0.0017], [\"88\", 0.0017], [\"94\", 0.0017], [\"99\", 0.0017], [\"105\", 0.0017], [\"110\", 0.0017], [\"116\", 0.0017], [\"121\", 0.0033], [\"127\", 0.005], [\"133\", 0.0033], [\"138\", 0.0099], [\"144\", 0.0132], [\"149\", 0.0198], [\"155\", 0.0281], [\"160\", 0.0281], [\"166\", 0.0446], [\"171\", 0.0413], [\"177\", 0.0744], [\"183\", 0.0843], [\"188\", 0.1306], [\"194\", 0.1273], [\"199\", 0.2066], [\"205\", 0.2479], [\"210\", 0.3173], [\"216\", 0.3586], [\"222\", 0.4545], [\"227\", 0.5537], [\"233\", 0.6793], [\"238\", 0.8065], [\"244\", 0.9917], [\"249\", 1.2164], [\"255\", 1.304], [\"260\", 1.3321], [\"266\", 1.6842], [\"272\", 1.9007], [\"277\", 2.056], [\"283\", 2.4114], [\"288\", 2.4824], [\"294\", 2.6808], [\"299\", 2.9865], [\"305\", 2.965], [\"311\", 3.1749], [\"316\", 3.3766], [\"322\", 3.3567], [\"327\", 3.4807], [\"333\", 3.4295], [\"338\", 3.3815], [\"344\", 3.2344], [\"349\", 3.2873], [\"355\", 3.2377], [\"361\", 2.8113], [\"366\", 2.737], [\"372\", 2.5287], [\"377\", 2.3882], [\"383\", 2.0461], [\"388\", 1.8974], [\"394\", 1.8627], [\"400\", 1.5552], [\"405\", 1.3949], [\"411\", 1.1619], [\"416\", 1.0164], [\"422\", 0.9834], [\"427\", 0.8495], [\"433\", 0.757], [\"438\", 2.9468], [\"444\", 2.4164000000000003], [\"450\", 1.9981], [\"455\", 2.6559999999999997], [\"461\", 2.2427]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16300\", 0.0033], [\"16400\", 0.0182], [\"16500\", 0.0297], [\"16600\", 0.0248], [\"24000\", 0.0017], [\"24100\", 0.0033], [\"26600\", 0.0017], [\"26700\", 0.0033], [\"26800\", 0.0017], [\"27100\", 0.0017], [\"27300\", 0.0033], [\"27400\", 0.0033], [\"27500\", 0.0066], [\"27600\", 0.0248], [\"27700\", 0.0347], [\"27800\", 0.0364], [\"27900\", 0.0397], [\"28000\", 0.2049], [\"28100\", 0.476], [\"28200\", 2.8361], [\"28300\", 4.3203], [\"28400\", 0.3091], [\"28500\", 0.0876], [\"28600\", 0.0959], [\"28700\", 0.0645], [\"28800\", 0.0397], [\"28900\", 0.0826], [\"29000\", 0.0083], [\"29100\", 0.0017], [\"29300\", 0.0017], [\"29400\", 0.0017], [\"29500\", 0.0017], [\"29600\", 0.0033], [\"29700\", 0.0017], [\"29800\", 0.0017], [\"29900\", 0.0017], [\"30000\", 0.005], [\"30100\", 0.0033], [\"30200\", 0.0017], [\"30400\", 0.0033], [\"30500\", 0.0083], [\"30600\", 0.0116], [\"30700\", 0.0099], [\"30800\", 0.0132], [\"30900\", 0.0149], [\"31000\", 0.0264], [\"31100\", 0.038], [\"31200\", 0.0231], [\"31300\", 0.0496], [\"31400\", 0.0595], [\"31500\", 0.0909], [\"31600\", 0.1487], [\"31700\", 0.3256], [\"31800\", 4.3765], [\"31900\", 38.2382], [\"32000\", 23.922], [\"32100\", 0.481], [\"32200\", 0.0248], [\"32299\", 0.0198], [\"32400\", 0.0132], [\"32500\", 0.0066], [\"32600\", 0.005], [\"32700\", 0.005], [\"32800\", 0.0017], [\"33000\", 0.0149], [\"33100\", 0.0066], [\"33200\", 0.005], [\"33300\", 0.0017], [\"33400\", 0.005], [\"33500\", 0.005], [\"33600\", 0.0099], [\"33700\", 0.0149], [\"33800\", 0.0182], [\"33900\", 0.0215], [\"34000\", 0.0165], [\"34100\", 0.0281], [\"34200\", 0.0446], [\"34300\", 0.0711], [\"34400\", 0.4578], [\"34500\", 6.9564]]}"},"rt_list":{"kind":"list like","value":[{"code":"f = open('user.out', 'w')\nprint('''true\nfalse\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\ntrue\nfalse\ntrue\ntrue\n''',file=f)\nexit(0)","runtime":"21"},{"code":"f = open('user.out', 'w')\nprint('''true\nfalse\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\ntrue\nfalse\ntrue\n''',file=f)\nexit(0)\n ","runtime":"21"},{"code":"f = open('user.out', 'w')\nprint('''true\nfalse\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\ntrue\nfalse\ntrue\n''',file=f)\nexit(0)","runtime":"27"},{"code":"f = open('user.out', 'w')\nprint('''true\nfalse\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\ntrue\nfalse\ntrue\ntrue\n''',file=f)\nexit(0)","runtime":"27"},{"code":"f = open('user.out', 'w')\nprint('''true\nfalse\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\ntrue\nfalse\ntrue\ntrue\n''',file=f)\nexit(0)","runtime":"32"},{"code":"f = open('user.out', 'w')\nprint('''true\nfalse\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\ntrue\nfalse\ntrue\ntrue\n''',file=f)\nexit(0)","runtime":"32"},{"code":"f = open('user.out', 'w')\nprint('''true\nfalse\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\ntrue\nfalse\ntrue\ntrue\n''',file=f)\nexit(0)","runtime":"38"},{"code":"f = open('user.out', 'w')\nprint('''true\nfalse\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\ntrue\nfalse\ntrue\ntrue\n''',file=f)\nexit(0)","runtime":"38"},{"code":"\nf = open('user.out', 'w')\nprint('''true\nfalse\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\ntrue\nfalse\ntrue\n''',file=f)\nexit(0)","runtime":"44"},{"code":"class Solution:\n def contains_duplicate(nums: list[int]) -> bool:\n seen = set()\n for num in nums:\n if num in seen:\n return True\n seen.add(num)\n return False\n\n\n if __name__ == '__main__':\n import json, sys\n with open('user.out', 'w') as f:\n for nums in map(json.loads, sys.stdin):\n result = contains_duplicate(nums)\n print(str(result).lower(), file=f)\n sys.exit()","runtime":"44"},{"code":"def contains_duplicate(nums: list[int]) -> bool:\n seen = set()\n for num in nums:\n if num in seen:\n return True\n seen.add(num)\n return False\n\n\nif __name__ == '__main__':\n import json, sys\n with open('user.out', 'w') as f:\n for nums in map(json.loads, sys.stdin):\n result = contains_duplicate(nums)\n print(str(result).lower(), file=f)\n sys.exit() ","runtime":"49"},{"code":"def solve():\n f = open('user.out', 'w')\n for nums in map(loads, stdin):\n hashSet = set()\n found_duplicate = False\n\n for n in nums:\n if n in hashSet:\n print('true', file=f)\n found_duplicate = True\n break\n else:\n hashSet.add(n)\n\n if not found_duplicate:\n print('false', file=f)\n\nsolve()\nexit()\n","runtime":"55"},{"code":"def containsDuplicate(nums: List[int]) -> bool:\n seen = set()\n for num in nums:\n if num in seen:\n return True\n else:\n seen.add(num)\n return False\n\nif __name__ == '__main__':\n import json, sys\n with open('user.out', 'w') as f:\n for nums in map(json.loads, sys.stdin):\n result = containsDuplicate(nums)\n print(str(result).lower(), file=f)\n sys.exit()","runtime":"55"},{"code":"def solve():\n f = open('user.out', 'w')\n for nums in map(loads, stdin):\n hashSet = set()\n found_duplicate = False\n\n for n in nums:\n if n in hashSet:\n print('true', file=f)\n found_duplicate = True\n break\n else:\n hashSet.add(n)\n\n if not found_duplicate:\n print('false', file=f)\n\nsolve()\nexit()","runtime":"60"},{"code":"class Solution:\n def containsDuplicate( nums: List[int]) -> bool:\n return len(set(nums)) != len(nums)\n\nif __name__ == '__main__':\n import json, sys\n with open('user.out', 'w') as f:\n for nums in map(json.loads, sys.stdin):\n result = Solution.containsDuplicate(nums)\n print(str(result).lower(), file=f)\n sys.exit()","runtime":"60"},{"code":"def containsDuplicate(nums: List[int]) -> bool:\n _set = set()\n for num in nums:\n if num in _set:\n return True\n _set.add(num)\n\n return False\n\nif __name__ == '__main__':\n import json, sys\n with open('user.out', 'w') as f:\n for nums in map(json.loads, sys.stdin):\n result = containsDuplicate(nums)\n print(str(result).lower(), file=f)\n sys.exit()\n","runtime":"66"},{"code":"def containsDuplicate(nums: List[int]) -> bool:\n seen = set()\n for num in nums:\n if num in seen:\n return True\n else:\n seen.add(num)\n return False\n\nif __name__ == '__main__':\n import json, sys\n with open('user.out', 'w') as f:\n for nums in map(json.loads, sys.stdin):\n result = containsDuplicate(nums)\n print(str(result).lower(), file=f)\n sys.exit()","runtime":"66"},{"code":"# class Solution:\ndef dup(nums: List[int]) -> str:\n if len(nums) != len(set(nums)):\n return 'true'\n return 'false'\n\nwith open('user.out', 'w') as f:\n for nums in map(loads, stdin):\n f.write(dup(nums)+'\\n')\nexit()","runtime":"71"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n if len(nums) == len(set(nums)):\n return False\n return True\n \n # better way to store only set of seen elements (less memory)\n \n \nif __name__ == '__main__':\n import json, sys\n with open('user.out', 'w') as f:\n for nums in map(json.loads, sys.stdin):\n result = Solution().containsDuplicate(nums)\n print(str(result).lower(), file=f)\n sys.exit()","runtime":"71"},{"code":"def contains_duplicate(nums: list[int]) -> bool:\n seen = set()\n for num in nums:\n if num in seen:\n return True\n seen.add(num)\n return False\n\n\nif __name__ == '__main__':\n import json, sys\n with open('user.out', 'w') as f:\n for nums in map(json.loads, sys.stdin):\n result = contains_duplicate(nums)\n print(str(result).lower(), file=f)\n sys.exit() ","runtime":"77"},{"code":"def containsDuplicate(nums: List[int]) -> bool:\n nums.sort()\n prev = None\n for num in nums:\n if num == prev:\n return True\n prev = num\n\n return False\n\nif __name__ == '__main__':\n import json, sys\n with open('user.out', 'w') as f:\n for nums in map(json.loads, sys.stdin):\n result = containsDuplicate(nums)\n print(str(result).lower(), file=f)\n sys.exit()","runtime":"77"},{"code":"def containsDuplicate(nums: List[int]) -> bool:\n nums.sort()\n prev = None\n for num in nums:\n if num == prev:\n return True\n prev = num\n\n return False\n\nif __name__ == '__main__':\n import json, sys\n with open('user.out', 'w') as f:\n for nums in map(json.loads, sys.stdin):\n result = containsDuplicate(nums)\n print(str(result).lower(), file=f)\n sys.exit()\n","runtime":"82"},{"code":"# class Solution:\ndef dup(nums: List[int]) -> str:\n nums.sort()\n for i in range(1, len(nums)):\n if nums[i]==nums[i-1]:\n return 'true'\n return 'false'\n\n # if len(nums) != len(set(nums)):\n # return 'true'\n # return 'false'\n\nwith open('user.out', 'w') as f:\n for nums in map(loads, stdin):\n f.write(dup(nums)+'\\n')\nexit()","runtime":"88"},{"code":"def contains_duplicate(nums: List[int]) -> bool:\n sorted_nums = sorted(nums)\n new_nums = sorted(set(nums))\n if sorted_nums != new_nums:\n return True\n return False\n\nif __name__ == '__main__':\n import json, sys\n with open('user.out', 'w') as f:\n for nums in map(json.loads, sys.stdin):\n result = contains_duplicate(nums)\n print(str(result).lower(), file=f)\n sys.exit()\n","runtime":"94"},{"code":"# from collections import Counter \nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n # dict={}\n # for val in nums:\n # if val in dict:\n # return True\n # else:\n # dict[val]=1\n # # dict=Counter(nums)\n # # keys=dict.keys()\n # # for key in keys:\n # # if dict[key]>1:\n # # return True\n # return False\n\n mySet=set()\n for val in nums:\n if val in mySet:\n return True\n mySet.add(val)\n return False\n","runtime":"99"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return len(set(nums)) != len(nums) ","runtime":"105"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = set()\n for num in nums:\n if num in seen:\n return True\n seen.add(num)\n return False\n \n ","runtime":"110"},{"code":"'''\nPlan:\n 1. Define an empty set\n 2. Loop through the array (index i):\n 3. nums[i] in set:\n 4. return True\n 5. Otherwise:\n 6. nums[i] added to the set\n 7. return False\n Time Complexity: O(n)\n Space Complexity: O(n)\n'''\n\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n numset = set()\n for num in nums:\n if num in numset:\n return True\n else:\n numset.add(num)\n return False","runtime":"116"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n chars = set()\n for i in nums:\n if i in chars:\n return True\n else:\n chars.add(i)\n return False\nobj = Solution()\nobj.containsDuplicate(nums=[1,2,3,1])","runtime":"121"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n set_a = set()\n for i in nums:\n if i in set_a:\n return True\n set_a.add(i) \n return False \n ","runtime":"127"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashset = set()\n for item in nums:\n if item in hashset:\n return True\n hashset.add(item)\n return False","runtime":"133"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n s = set()\n for i in nums:\n if(i in s):\n return True\n s.add(i)\n return False","runtime":"138"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n num_set = set() \n\n for num in nums:\n if num in num_set:\n return True\n num_set.add(num)\n return False\n ","runtime":"144"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return len(nums) != len(set(nums))","runtime":"144"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n dic = set()\n\n for i in nums:\n if i in dic:\n return True\n else:\n dic.add(i)\n return False","runtime":"149"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n has_duplicate: bool = False \n seen: set[int] = set() \n for num in nums: \n if num in seen: \n has_duplicate = True \n break \n seen.add(num) \n return has_duplicate\n ","runtime":"155"},{"code":"\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashset = set()\n\n for i in nums:\n if i in hashset:\n return True\n hashset.add(i)\n return False","runtime":"160"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = set()\n \n for num in nums:\n if num in seen:\n return True\n seen.add(num)\n \n return False\n","runtime":"166"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return len(set(nums)) != len(nums)\n \n ","runtime":"171"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nset=set()\n\n for n in nums:\n if n in nset:\n return True\n nset.add(n)\n return False\n\n ","runtime":"177"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return len(set(nums)) != len(nums)","runtime":"183"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n # empty set\n # loop thru \n # chekc if number in set \n # if so return true \n # late return false\n\n duplicate = set()\n for n in nums:\n if n in duplicate:\n return True \n duplicate.add(n)\n return False \n ","runtime":"188"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n dupeSet = set()\n\n for x in nums:\n if x in dupeSet:\n return True\n else:\n dupeSet.add(x)\n return False \n \n","runtime":"194"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = set()\n for i in nums:\n if i in seen:\n return True\n seen.add(i)\n \n return False","runtime":"194"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = set()\n for num in nums:\n if num in seen:\n return True\n seen.add(num)","runtime":"199"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n s = set()\n\n for num in nums:\n if num in s:\n return True\n s.add(num)\n\n return False","runtime":"199"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n a = nums\n a = set(a)\n if len(a) == len(nums):\n return False\n return True","runtime":"205"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n mp = {}\n for num in nums:\n if num in mp:\n return True\n else:\n mp[num] = 1\n return False","runtime":"205"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n s = set()\n for i in nums:\n if i in s:\n return True\n s.add(i)\n return False\n\n ","runtime":"210"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n counts = set()\n for num in nums:\n if num in counts:\n return True\n counts.add(num)\n return False","runtime":"210"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n \n store = set()\n\n for n in nums:\n if n in store:\n return True\n else:\n store.add(n)\n \n return False","runtime":"216"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = set()\n\n for num in nums:\n if num in seen:\n return True\n seen.add(num)\n return False\n","runtime":"216"},{"code":"# Complexity\n# 1 1 ... n - O(1)\n# 1 2 3... a - O(n)\n# Space - O(n) - n keys\n# Hashset approach\n# class Solution:\n# def containsDuplicate(self, nums: List[int]) -> bool:\n# dictionary = {}\n# for i in nums:\n# dictionary[i] = dictionary[i] + 1 if dictionary.get(i) else 1\n\n# if (dictionary.get(i) and dictionary[i] >= 2):\n# return True\n \n# return False\n\n# Set approach\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n found = set()\n for i in nums:\n if (i in found):\n return True\n \n found.add(i)\n \n return False\n\n","runtime":"222"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n temp = set()\n for num in nums:\n if num in temp:\n return True\n temp.add(num)\n return False","runtime":"222"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n \n num_set = set()\n for num in nums:\n if num in num_set:\n return True\n num_set.add(num)\n return False\n ","runtime":"227"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n s = set()\n for n in nums:\n if n in s:\n return True\n s.add(n)\n return False","runtime":"227"},{"code":"from collections import Counter\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n s = set(nums)\n if len(nums) == len(s):\n return False\n else:\n return True","runtime":"233"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n sett = set()\n for x in nums:\n if x in sett:\n return True\n sett.add(x)\n return False","runtime":"233"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n storeSet = set()\n for num in nums:\n # print(f\"{num=} {storeSet=} \")\n if num in storeSet:\n # print(f\"Return True\")\n return True\n else:\n # print(f\"{storeSet.add(num)=}\")\n storeSet.add(num)\n \n # print(f\"Return False\")\n return False\n \n '''\n def containsDuplicate(self, nums: List[int]) -> bool:\n storeDict = dict()\n\n for num in nums:\n # if storeDict[num]:\n if storeDict.get(num):\n return True\n else:\n storeDict[num]=1\n \n return False\n '''\n\n\n","runtime":"238"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n # copy = []\n # for i in nums:\n # if i in copy:\n # return True\n # else: copy.append(i)\n \n # return False\n return len(nums) != len(set(nums))\n ","runtime":"238"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hash = set()\n for n in nums:\n if n in hash:\n return True\n hash.add(n)\n return False","runtime":"244"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n lookupset = set()\n for i in nums:\n if i in lookupset:\n return True\n lookupset.add(i)","runtime":"244"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums_set = set()\n for i in nums:\n if i in nums_set:\n return True\n else:\n nums_set.add(i)\n return False\n","runtime":"249"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n unique = set()\n for x in nums:\n if x not in unique:\n unique.add(x)\n else:\n return True\n return False","runtime":"249"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n # copy = set()\n # for i in nums:\n # if i in copy:\n # return True\n # else: copy.add(i) \n # return False\n\n ### ONE LINE SOLUTION !\n return len(nums) != len(set(nums))\n ","runtime":"255"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n if len(nums) <= 1:\n return False\n number_frequency = set()\n\n for num in nums:\n if num in number_frequency:\n return True\n number_frequency.add(num)\n \n return False","runtime":"255"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n \n numset = set()\n\n for num in nums:\n if num not in numset:\n numset.add(num)\n elif num in numset:\n return True\n else: return False\n","runtime":"260"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n #use 'set' option to determine the duplicate\n #return (len(nums) is not len(set(nums)))\n\n store = {}\n for n in nums:\n if n not in store:\n store[n] = 1\n else:\n return True\n return False\n ","runtime":"260"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return len(nums) != len(set(nums))","runtime":"266"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashset=set()\n for num in nums:\n if num in hashset:\n return True\n hashset.add(num)\n return False","runtime":"266"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n duplicates = set() \n for num in nums:\n if num in duplicates: \n return True \n else : \n duplicates.add(num)\n return False","runtime":"272"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n dic = {}\n for n in nums:\n if n in dic:\n return True\n dic[n] = True\n return False\n ","runtime":"272"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hs = set()\n for num in nums:\n if num in hs:\n return True\n hs.add(num)\n return False","runtime":"277"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = set()\n for num in nums:\n if num in seen:\n return True\n else:\n seen.add(num)\n return False","runtime":"277"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n s = set()\n\n for n in nums:\n if n in s:\n return True\n s.add(n)\n \n return False\n","runtime":"283"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = set()\n for num in nums:\n if num in seen:\n return True\n seen.add(num)\n return False\n ","runtime":"283"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return len(nums) != len(set(nums))\n","runtime":"288"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashset = set()\n for n in nums:\n if n in hashset:\n return True\n hashset.add(n)\n\n return False\n ","runtime":"288"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n h = set()\n for i in nums:\n if i in h:\n return True\n else:\n h.add(i)\n return False","runtime":"294"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = set()\n for num in nums:\n if num in seen:\n return True\n else:\n seen.add(num)\n return False\n\n\n\n","runtime":"294"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashset=set()\n for i in nums:\n if i in hashset:\n return True\n hashset.add(i)\n return False\n ","runtime":"299"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return len(set(nums)) != len(nums)","runtime":"299"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n x = set(nums)\n n1 = len(x)\n n = len(nums)\n if n1 == n:\n return False\n return True","runtime":"305"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n checker = set()\n for n in nums:\n if n in checker:\n return True\n else:\n checker.add(n)\n return False\n ","runtime":"305"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n s = set()\n for i in nums:\n if i in s:\n return True\n s.add(i)\n return False\n\n ","runtime":"311"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n my_set = set()\n for n in nums:\n if n in my_set:\n return True\n my_set.add(n)\n return False\n ","runtime":"311"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n d = set()\n for n in nums:\n if n in d:\n return True\n d.add(n)\n return False","runtime":"316"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n s = set()\n for n in nums:\n if n in s: return True\n s.add(n)\n return False","runtime":"316"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = set()\n for num in nums:\n if num in seen:\n return True\n seen.add(num)\n ","runtime":"322"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n n=len(nums)\n sets=set(nums)\n if(n==len(sets)):\n return False\n else:\n return True","runtime":"322"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashset = set()\n for n in nums:\n if n in hashset:\n return True\n hashset.add(n)\n return False","runtime":"327"},{"code":"class Solution:\n def containsDuplicate(self, nums: list[int]) -> bool:\n # return len(nums) != len(set(nums))\n seen = set()\n for num in nums:\n if num in seen:\n return True\n else:\n seen.add(num)\n return False","runtime":"327"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n g=set()\n\n for a in nums:\n if a in g:\n return True\n \n g.add(a)\n\n\n return False\n ","runtime":"333"},{"code":"class Solution:\n # duplicates -> True, else -> False\n def containsDuplicate(self, nums: List[int]) -> bool:\n # nested loop: t/c - O(n^2), s/c - O(1)\n # for i in range(len(nums)): # 0, 1, 2, 3\n # for j in range(i+1, len(nums)):\n # if nums[i] == nums[j]:\n # return True\n # return False\n\n # hashset - Q: 일반적으로 set 과 hashset 의 차이는?\n hashSet = set() # set: unordered but unique elements \n for num in nums:\n if num not in hashSet:\n hashSet.add(num)\n else:\n return True\n return False\n\n\n\n\n\n\n\n ","runtime":"333"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n d = set()\n for n in nums:\n if n in d:\n return True\n else:\n d.add(n)\n return False","runtime":"338"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n d = set()\n for n in nums:\n if n in d:\n return True\n else:\n d.add(n)\n return False","runtime":"338"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashset = set()\n\n for n in nums:\n if n in hashset:\n return True\n hashset.add(n)\n return False\n ","runtime":"344"},{"code":"\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n\n if len(nums) == len(set(nums)):\n return False\n return True\n ","runtime":"344"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashset=set()\n for n in nums:\n if n in hashset:\n return True\n hashset.add(n)\n return False\n ","runtime":"349"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n dic = {}\n for i in nums:\n if i in dic and dic[i] >=1:\n return True \n dic[i] = dic.get(i,0) + 1\n return False","runtime":"349"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = {}\n for item in nums:\n if(item in seen):\n seen[item]+=1\n if(seen[item]>=1):\n return True\n else:\n seen[item] = 1\n return False\n","runtime":"355"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n result_set = set()\n for num in nums:\n if num in result_set:\n return True\n result_set.add(num)\n return False","runtime":"355"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = set()\n for i in nums:\n if i in seen:\n return True\n seen.add(i)\n return False\n ","runtime":"366"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n d = set()\n for n in nums:\n if n in d:\n return True\n d.add(n)\n return False","runtime":"366"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n cnt = defaultdict(int)\n for n in nums:\n cnt[n] += 1\n if cnt[n] > 1:\n return True\n return False\n ","runtime":"372"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n #usinh sets\n seen=set()\n for i in nums :\n if i in seen:\n return True\n seen.add(i)\n return False\n\n","runtime":"372"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n if len(nums)!=len(set(nums)):\n return True\n return False\n","runtime":"377"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return not len(nums) == len(set(nums))","runtime":"377"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n x=set()\n for i in nums:\n if i in x:\n return True\n else:\n x.add(i)\n \n return False\n ","runtime":"383"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n \n from collections import Counter\n\n _dict = dict(Counter(nums))\n key_with_dupls = next((key for key in _dict if _dict[key] > 1), None)\n \n return not key_with_dupls is None\n","runtime":"383"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashmaps={}\n for i in nums:\n if i in hashmaps:\n return True\n hashmaps[i]=True\n return False\n\n","runtime":"388"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return True if len(set(nums))<len(nums) else False\n","runtime":"388"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashset=set()\n for i in nums:\n if i in hashset:\n return True\n hashset.add(i)\n return False\n ","runtime":"394"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = {}\n for num in nums:\n if num in seen:\n return True\n else:\n seen[num] = num\n return False\n ","runtime":"394"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n if len(nums) == len(set(nums)):\n return False\n else:\n return True","runtime":"400"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return len(set(nums)) != len(nums)","runtime":"400"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n d = {}\n for n in nums:\n if n in d.keys():\n return True\n else:\n d[n] = 1\n return False","runtime":"405"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n L = 0\n window = set()\n\n for n in nums:\n if n in window: return True\n window.add(n)\n\n return False","runtime":"405"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n myMap = {}\n \n for i in nums:\n if i in myMap:\n return True\n else:\n myMap[i] = 1\n \n return False","runtime":"411"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n s=set()\n for i in nums:\n if i in s:\n return True\n s.add(i)\n return False","runtime":"411"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n if len(nums) > 0:\n dic = {}\n dic[nums[0]] = 0\n for i in range(1, len(nums)):\n try:\n print(dic[nums[i]])\n return True\n except:\n dic[nums[i]] = 0\n return False\n ","runtime":"416"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = set()\n for i in nums:\n if i in seen:\n return True\n else:\n seen.add(i)\n return False","runtime":"416"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashset=set()\n for n in nums:\n if n in hashset:\n return True\n hashset.add(n)\n return False\n ","runtime":"422"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n d = set()\n for i in nums:\n if i not in d:\n d.add(i)\n else:\n return True\n \n return False","runtime":"422"},{"code":"from collections import Counter\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hmap=Counter(nums)\n for i,val in hmap.items():\n if val>1:\n return True\n return False","runtime":"427"},{"code":"# 217. Contains Duplicate - Easy\n# url: https://leetcode.com/problems/contains-duplicate/\n\nfrom typing import List\n\n\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return self.check_lenght(nums)\n # return self.check_set(nums)\n\n def check_lenght(self, nums: List[int]) -> bool:\n return len(nums) != len(set(nums))\n\n def check_set(self, nums: List[int]) -> bool:\n num_set = set()\n for num in nums:\n if num in num_set:\n return True\n num_set.add(num)\n return False\n\n\nif __name__ == \"__main__\":\n s = Solution()\n print(s.containsDuplicate([1, 2, 3, 1])) # True\n print(s.containsDuplicate([1, 2, 3, 4])) # False\n print(s.containsDuplicate([1, 1, 1, 3, 3, 4, 3, 2, 4, 2])) # True\n","runtime":"427"},{"code":"from collections import OrderedDict\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n \n result = list(OrderedDict.fromkeys(nums))\n if(len(nums)!=len(result)) :\n ans =True\n if (len(nums)==len(result)) :\n ans =False\n return ans\n \n ","runtime":"433"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n d = {}\n for i in nums:\n if i not in d:\n d[i] = 1\n else:\n d[i] += 1\n \n for i in d:\n if d[i] > 1:\n return True\n\n return False","runtime":"433"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return True if len(set(nums)) < len(nums) else False","runtime":"438"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n s = set()\n for n in nums:\n if n in s:\n return True\n s.add(n)\n return False","runtime":"438"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n d = {}\n for i in nums:\n if i not in d:\n d[i] = 1\n else:\n return True","runtime":"444"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashmap = {x: 0 for x in nums}\n for i in nums:\n hashmap[i] += 1\n if hashmap[i] == 2:\n return True\n return False\n ","runtime":"444"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n if len(nums) > 0:\n dic = {}\n dic[nums[0]] = 0\n for i in range(1, len(nums)):\n try:\n print(dic[nums[i]])\n return True\n except:\n dic[nums[i]] = 0\n return False\n ","runtime":"450"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n n=len(nums)\n nums.sort()\n for i in range(1,n):\n if nums[i]==nums[i-1]:\n return True\n break\n return False","runtime":"450"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n for i in range(1,len(nums)):\n if nums[i] == nums[i-1]:\n return True\n return False","runtime":"455"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n n = len(nums)\n for i in range(1, n):\n if nums[i] == nums[i - 1]:\n return True\n return False\n ","runtime":"455"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums = sorted(nums)\n # Check if the elements next to each other are equal which can occur as we have sorted the list\n for i in range(len(nums)-1):\n if nums[i] == nums[i+1]:\n return True\n return False","runtime":"461"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n tmp = None\n for n in nums:\n if tmp == n:\n return True\n tmp = n\n return False","runtime":"461"}],"string":"[\n {\n \"code\": \"f = open('user.out', 'w')\\nprint('''true\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\n''',file=f)\\nexit(0)\",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nprint('''true\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\nfalse\\ntrue\\n''',file=f)\\nexit(0)\\n \",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nprint('''true\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\nfalse\\ntrue\\n''',file=f)\\nexit(0)\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nprint('''true\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\n''',file=f)\\nexit(0)\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nprint('''true\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\n''',file=f)\\nexit(0)\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nprint('''true\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\n''',file=f)\\nexit(0)\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nprint('''true\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\n''',file=f)\\nexit(0)\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nprint('''true\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\n''',file=f)\\nexit(0)\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"\\nf = open('user.out', 'w')\\nprint('''true\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\nfalse\\ntrue\\n''',file=f)\\nexit(0)\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def contains_duplicate(nums: list[int]) -> bool:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n seen.add(num)\\n return False\\n\\n\\n if __name__ == '__main__':\\n import json, sys\\n with open('user.out', 'w') as f:\\n for nums in map(json.loads, sys.stdin):\\n result = contains_duplicate(nums)\\n print(str(result).lower(), file=f)\\n sys.exit()\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"def contains_duplicate(nums: list[int]) -> bool:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n seen.add(num)\\n return False\\n\\n\\nif __name__ == '__main__':\\n import json, sys\\n with open('user.out', 'w') as f:\\n for nums in map(json.loads, sys.stdin):\\n result = contains_duplicate(nums)\\n print(str(result).lower(), file=f)\\n sys.exit() \",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"def solve():\\n f = open('user.out', 'w')\\n for nums in map(loads, stdin):\\n hashSet = set()\\n found_duplicate = False\\n\\n for n in nums:\\n if n in hashSet:\\n print('true', file=f)\\n found_duplicate = True\\n break\\n else:\\n hashSet.add(n)\\n\\n if not found_duplicate:\\n print('false', file=f)\\n\\nsolve()\\nexit()\\n\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"def containsDuplicate(nums: List[int]) -> bool:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n else:\\n seen.add(num)\\n return False\\n\\nif __name__ == '__main__':\\n import json, sys\\n with open('user.out', 'w') as f:\\n for nums in map(json.loads, sys.stdin):\\n result = containsDuplicate(nums)\\n print(str(result).lower(), file=f)\\n sys.exit()\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"def solve():\\n f = open('user.out', 'w')\\n for nums in map(loads, stdin):\\n hashSet = set()\\n found_duplicate = False\\n\\n for n in nums:\\n if n in hashSet:\\n print('true', file=f)\\n found_duplicate = True\\n break\\n else:\\n hashSet.add(n)\\n\\n if not found_duplicate:\\n print('false', file=f)\\n\\nsolve()\\nexit()\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate( nums: List[int]) -> bool:\\n return len(set(nums)) != len(nums)\\n\\nif __name__ == '__main__':\\n import json, sys\\n with open('user.out', 'w') as f:\\n for nums in map(json.loads, sys.stdin):\\n result = Solution.containsDuplicate(nums)\\n print(str(result).lower(), file=f)\\n sys.exit()\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"def containsDuplicate(nums: List[int]) -> bool:\\n _set = set()\\n for num in nums:\\n if num in _set:\\n return True\\n _set.add(num)\\n\\n return False\\n\\nif __name__ == '__main__':\\n import json, sys\\n with open('user.out', 'w') as f:\\n for nums in map(json.loads, sys.stdin):\\n result = containsDuplicate(nums)\\n print(str(result).lower(), file=f)\\n sys.exit()\\n\",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"def containsDuplicate(nums: List[int]) -> bool:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n else:\\n seen.add(num)\\n return False\\n\\nif __name__ == '__main__':\\n import json, sys\\n with open('user.out', 'w') as f:\\n for nums in map(json.loads, sys.stdin):\\n result = containsDuplicate(nums)\\n print(str(result).lower(), file=f)\\n sys.exit()\",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"# class Solution:\\ndef dup(nums: List[int]) -> str:\\n if len(nums) != len(set(nums)):\\n return 'true'\\n return 'false'\\n\\nwith open('user.out', 'w') as f:\\n for nums in map(loads, stdin):\\n f.write(dup(nums)+'\\\\n')\\nexit()\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n if len(nums) == len(set(nums)):\\n return False\\n return True\\n \\n # better way to store only set of seen elements (less memory)\\n \\n \\nif __name__ == '__main__':\\n import json, sys\\n with open('user.out', 'w') as f:\\n for nums in map(json.loads, sys.stdin):\\n result = Solution().containsDuplicate(nums)\\n print(str(result).lower(), file=f)\\n sys.exit()\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"def contains_duplicate(nums: list[int]) -> bool:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n seen.add(num)\\n return False\\n\\n\\nif __name__ == '__main__':\\n import json, sys\\n with open('user.out', 'w') as f:\\n for nums in map(json.loads, sys.stdin):\\n result = contains_duplicate(nums)\\n print(str(result).lower(), file=f)\\n sys.exit() \",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"def containsDuplicate(nums: List[int]) -> bool:\\n nums.sort()\\n prev = None\\n for num in nums:\\n if num == prev:\\n return True\\n prev = num\\n\\n return False\\n\\nif __name__ == '__main__':\\n import json, sys\\n with open('user.out', 'w') as f:\\n for nums in map(json.loads, sys.stdin):\\n result = containsDuplicate(nums)\\n print(str(result).lower(), file=f)\\n sys.exit()\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"def containsDuplicate(nums: List[int]) -> bool:\\n nums.sort()\\n prev = None\\n for num in nums:\\n if num == prev:\\n return True\\n prev = num\\n\\n return False\\n\\nif __name__ == '__main__':\\n import json, sys\\n with open('user.out', 'w') as f:\\n for nums in map(json.loads, sys.stdin):\\n result = containsDuplicate(nums)\\n print(str(result).lower(), file=f)\\n sys.exit()\\n\",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"# class Solution:\\ndef dup(nums: List[int]) -> str:\\n nums.sort()\\n for i in range(1, len(nums)):\\n if nums[i]==nums[i-1]:\\n return 'true'\\n return 'false'\\n\\n # if len(nums) != len(set(nums)):\\n # return 'true'\\n # return 'false'\\n\\nwith open('user.out', 'w') as f:\\n for nums in map(loads, stdin):\\n f.write(dup(nums)+'\\\\n')\\nexit()\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"def contains_duplicate(nums: List[int]) -> bool:\\n sorted_nums = sorted(nums)\\n new_nums = sorted(set(nums))\\n if sorted_nums != new_nums:\\n return True\\n return False\\n\\nif __name__ == '__main__':\\n import json, sys\\n with open('user.out', 'w') as f:\\n for nums in map(json.loads, sys.stdin):\\n result = contains_duplicate(nums)\\n print(str(result).lower(), file=f)\\n sys.exit()\\n\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"# from collections import Counter \\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n # dict={}\\n # for val in nums:\\n # if val in dict:\\n # return True\\n # else:\\n # dict[val]=1\\n # # dict=Counter(nums)\\n # # keys=dict.keys()\\n # # for key in keys:\\n # # if dict[key]>1:\\n # # return True\\n # return False\\n\\n mySet=set()\\n for val in nums:\\n if val in mySet:\\n return True\\n mySet.add(val)\\n return False\\n\",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return len(set(nums)) != len(nums) \",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n seen.add(num)\\n return False\\n \\n \",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"'''\\nPlan:\\n 1. Define an empty set\\n 2. Loop through the array (index i):\\n 3. nums[i] in set:\\n 4. return True\\n 5. Otherwise:\\n 6. nums[i] added to the set\\n 7. return False\\n Time Complexity: O(n)\\n Space Complexity: O(n)\\n'''\\n\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n numset = set()\\n for num in nums:\\n if num in numset:\\n return True\\n else:\\n numset.add(num)\\n return False\",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n chars = set()\\n for i in nums:\\n if i in chars:\\n return True\\n else:\\n chars.add(i)\\n return False\\nobj = Solution()\\nobj.containsDuplicate(nums=[1,2,3,1])\",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n set_a = set()\\n for i in nums:\\n if i in set_a:\\n return True\\n set_a.add(i) \\n return False \\n \",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashset = set()\\n for item in nums:\\n if item in hashset:\\n return True\\n hashset.add(item)\\n return False\",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n s = set()\\n for i in nums:\\n if(i in s):\\n return True\\n s.add(i)\\n return False\",\n \"runtime\": \"138\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n num_set = set() \\n\\n for num in nums:\\n if num in num_set:\\n return True\\n num_set.add(num)\\n return False\\n \",\n \"runtime\": \"144\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return len(nums) != len(set(nums))\",\n \"runtime\": \"144\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n dic = set()\\n\\n for i in nums:\\n if i in dic:\\n return True\\n else:\\n dic.add(i)\\n return False\",\n \"runtime\": \"149\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n has_duplicate: bool = False \\n seen: set[int] = set() \\n for num in nums: \\n if num in seen: \\n has_duplicate = True \\n break \\n seen.add(num) \\n return has_duplicate\\n \",\n \"runtime\": \"155\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashset = set()\\n\\n for i in nums:\\n if i in hashset:\\n return True\\n hashset.add(i)\\n return False\",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = set()\\n \\n for num in nums:\\n if num in seen:\\n return True\\n seen.add(num)\\n \\n return False\\n\",\n \"runtime\": \"166\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return len(set(nums)) != len(nums)\\n \\n \",\n \"runtime\": \"171\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nset=set()\\n\\n for n in nums:\\n if n in nset:\\n return True\\n nset.add(n)\\n return False\\n\\n \",\n \"runtime\": \"177\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return len(set(nums)) != len(nums)\",\n \"runtime\": \"183\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n # empty set\\n # loop thru \\n # chekc if number in set \\n # if so return true \\n # late return false\\n\\n duplicate = set()\\n for n in nums:\\n if n in duplicate:\\n return True \\n duplicate.add(n)\\n return False \\n \",\n \"runtime\": \"188\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n dupeSet = set()\\n\\n for x in nums:\\n if x in dupeSet:\\n return True\\n else:\\n dupeSet.add(x)\\n return False \\n \\n\",\n \"runtime\": \"194\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = set()\\n for i in nums:\\n if i in seen:\\n return True\\n seen.add(i)\\n \\n return False\",\n \"runtime\": \"194\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n seen.add(num)\",\n \"runtime\": \"199\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n s = set()\\n\\n for num in nums:\\n if num in s:\\n return True\\n s.add(num)\\n\\n return False\",\n \"runtime\": \"199\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n a = nums\\n a = set(a)\\n if len(a) == len(nums):\\n return False\\n return True\",\n \"runtime\": \"205\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n mp = {}\\n for num in nums:\\n if num in mp:\\n return True\\n else:\\n mp[num] = 1\\n return False\",\n \"runtime\": \"205\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n s = set()\\n for i in nums:\\n if i in s:\\n return True\\n s.add(i)\\n return False\\n\\n \",\n \"runtime\": \"210\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n counts = set()\\n for num in nums:\\n if num in counts:\\n return True\\n counts.add(num)\\n return False\",\n \"runtime\": \"210\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n \\n store = set()\\n\\n for n in nums:\\n if n in store:\\n return True\\n else:\\n store.add(n)\\n \\n return False\",\n \"runtime\": \"216\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = set()\\n\\n for num in nums:\\n if num in seen:\\n return True\\n seen.add(num)\\n return False\\n\",\n \"runtime\": \"216\"\n },\n {\n \"code\": \"# Complexity\\n# 1 1 ... n - O(1)\\n# 1 2 3... a - O(n)\\n# Space - O(n) - n keys\\n# Hashset approach\\n# class Solution:\\n# def containsDuplicate(self, nums: List[int]) -> bool:\\n# dictionary = {}\\n# for i in nums:\\n# dictionary[i] = dictionary[i] + 1 if dictionary.get(i) else 1\\n\\n# if (dictionary.get(i) and dictionary[i] >= 2):\\n# return True\\n \\n# return False\\n\\n# Set approach\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n found = set()\\n for i in nums:\\n if (i in found):\\n return True\\n \\n found.add(i)\\n \\n return False\\n\\n\",\n \"runtime\": \"222\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n temp = set()\\n for num in nums:\\n if num in temp:\\n return True\\n temp.add(num)\\n return False\",\n \"runtime\": \"222\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n \\n num_set = set()\\n for num in nums:\\n if num in num_set:\\n return True\\n num_set.add(num)\\n return False\\n \",\n \"runtime\": \"227\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n s = set()\\n for n in nums:\\n if n in s:\\n return True\\n s.add(n)\\n return False\",\n \"runtime\": \"227\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n s = set(nums)\\n if len(nums) == len(s):\\n return False\\n else:\\n return True\",\n \"runtime\": \"233\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n sett = set()\\n for x in nums:\\n if x in sett:\\n return True\\n sett.add(x)\\n return False\",\n \"runtime\": \"233\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n storeSet = set()\\n for num in nums:\\n # print(f\\\"{num=} {storeSet=} \\\")\\n if num in storeSet:\\n # print(f\\\"Return True\\\")\\n return True\\n else:\\n # print(f\\\"{storeSet.add(num)=}\\\")\\n storeSet.add(num)\\n \\n # print(f\\\"Return False\\\")\\n return False\\n \\n '''\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n storeDict = dict()\\n\\n for num in nums:\\n # if storeDict[num]:\\n if storeDict.get(num):\\n return True\\n else:\\n storeDict[num]=1\\n \\n return False\\n '''\\n\\n\\n\",\n \"runtime\": \"238\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n # copy = []\\n # for i in nums:\\n # if i in copy:\\n # return True\\n # else: copy.append(i)\\n \\n # return False\\n return len(nums) != len(set(nums))\\n \",\n \"runtime\": \"238\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hash = set()\\n for n in nums:\\n if n in hash:\\n return True\\n hash.add(n)\\n return False\",\n \"runtime\": \"244\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n lookupset = set()\\n for i in nums:\\n if i in lookupset:\\n return True\\n lookupset.add(i)\",\n \"runtime\": \"244\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums_set = set()\\n for i in nums:\\n if i in nums_set:\\n return True\\n else:\\n nums_set.add(i)\\n return False\\n\",\n \"runtime\": \"249\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n unique = set()\\n for x in nums:\\n if x not in unique:\\n unique.add(x)\\n else:\\n return True\\n return False\",\n \"runtime\": \"249\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n # copy = set()\\n # for i in nums:\\n # if i in copy:\\n # return True\\n # else: copy.add(i) \\n # return False\\n\\n ### ONE LINE SOLUTION !\\n return len(nums) != len(set(nums))\\n \",\n \"runtime\": \"255\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n if len(nums) <= 1:\\n return False\\n number_frequency = set()\\n\\n for num in nums:\\n if num in number_frequency:\\n return True\\n number_frequency.add(num)\\n \\n return False\",\n \"runtime\": \"255\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n \\n numset = set()\\n\\n for num in nums:\\n if num not in numset:\\n numset.add(num)\\n elif num in numset:\\n return True\\n else: return False\\n\",\n \"runtime\": \"260\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n #use 'set' option to determine the duplicate\\n #return (len(nums) is not len(set(nums)))\\n\\n store = {}\\n for n in nums:\\n if n not in store:\\n store[n] = 1\\n else:\\n return True\\n return False\\n \",\n \"runtime\": \"260\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return len(nums) != len(set(nums))\",\n \"runtime\": \"266\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashset=set()\\n for num in nums:\\n if num in hashset:\\n return True\\n hashset.add(num)\\n return False\",\n \"runtime\": \"266\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n duplicates = set() \\n for num in nums:\\n if num in duplicates: \\n return True \\n else : \\n duplicates.add(num)\\n return False\",\n \"runtime\": \"272\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n dic = {}\\n for n in nums:\\n if n in dic:\\n return True\\n dic[n] = True\\n return False\\n \",\n \"runtime\": \"272\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hs = set()\\n for num in nums:\\n if num in hs:\\n return True\\n hs.add(num)\\n return False\",\n \"runtime\": \"277\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n else:\\n seen.add(num)\\n return False\",\n \"runtime\": \"277\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n s = set()\\n\\n for n in nums:\\n if n in s:\\n return True\\n s.add(n)\\n \\n return False\\n\",\n \"runtime\": \"283\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n seen.add(num)\\n return False\\n \",\n \"runtime\": \"283\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return len(nums) != len(set(nums))\\n\",\n \"runtime\": \"288\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashset = set()\\n for n in nums:\\n if n in hashset:\\n return True\\n hashset.add(n)\\n\\n return False\\n \",\n \"runtime\": \"288\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n h = set()\\n for i in nums:\\n if i in h:\\n return True\\n else:\\n h.add(i)\\n return False\",\n \"runtime\": \"294\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n else:\\n seen.add(num)\\n return False\\n\\n\\n\\n\",\n \"runtime\": \"294\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashset=set()\\n for i in nums:\\n if i in hashset:\\n return True\\n hashset.add(i)\\n return False\\n \",\n \"runtime\": \"299\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return len(set(nums)) != len(nums)\",\n \"runtime\": \"299\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n x = set(nums)\\n n1 = len(x)\\n n = len(nums)\\n if n1 == n:\\n return False\\n return True\",\n \"runtime\": \"305\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n checker = set()\\n for n in nums:\\n if n in checker:\\n return True\\n else:\\n checker.add(n)\\n return False\\n \",\n \"runtime\": \"305\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n s = set()\\n for i in nums:\\n if i in s:\\n return True\\n s.add(i)\\n return False\\n\\n \",\n \"runtime\": \"311\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n my_set = set()\\n for n in nums:\\n if n in my_set:\\n return True\\n my_set.add(n)\\n return False\\n \",\n \"runtime\": \"311\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n d = set()\\n for n in nums:\\n if n in d:\\n return True\\n d.add(n)\\n return False\",\n \"runtime\": \"316\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n s = set()\\n for n in nums:\\n if n in s: return True\\n s.add(n)\\n return False\",\n \"runtime\": \"316\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n seen.add(num)\\n \",\n \"runtime\": \"322\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n n=len(nums)\\n sets=set(nums)\\n if(n==len(sets)):\\n return False\\n else:\\n return True\",\n \"runtime\": \"322\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashset = set()\\n for n in nums:\\n if n in hashset:\\n return True\\n hashset.add(n)\\n return False\",\n \"runtime\": \"327\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: list[int]) -> bool:\\n # return len(nums) != len(set(nums))\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n else:\\n seen.add(num)\\n return False\",\n \"runtime\": \"327\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n g=set()\\n\\n for a in nums:\\n if a in g:\\n return True\\n \\n g.add(a)\\n\\n\\n return False\\n \",\n \"runtime\": \"333\"\n },\n {\n \"code\": \"class Solution:\\n # duplicates -> True, else -> False\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n # nested loop: t/c - O(n^2), s/c - O(1)\\n # for i in range(len(nums)): # 0, 1, 2, 3\\n # for j in range(i+1, len(nums)):\\n # if nums[i] == nums[j]:\\n # return True\\n # return False\\n\\n # hashset - Q: 일반적으로 set 과 hashset 의 차이는?\\n hashSet = set() # set: unordered but unique elements \\n for num in nums:\\n if num not in hashSet:\\n hashSet.add(num)\\n else:\\n return True\\n return False\\n\\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"333\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n d = set()\\n for n in nums:\\n if n in d:\\n return True\\n else:\\n d.add(n)\\n return False\",\n \"runtime\": \"338\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n d = set()\\n for n in nums:\\n if n in d:\\n return True\\n else:\\n d.add(n)\\n return False\",\n \"runtime\": \"338\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashset = set()\\n\\n for n in nums:\\n if n in hashset:\\n return True\\n hashset.add(n)\\n return False\\n \",\n \"runtime\": \"344\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n\\n if len(nums) == len(set(nums)):\\n return False\\n return True\\n \",\n \"runtime\": \"344\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashset=set()\\n for n in nums:\\n if n in hashset:\\n return True\\n hashset.add(n)\\n return False\\n \",\n \"runtime\": \"349\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n dic = {}\\n for i in nums:\\n if i in dic and dic[i] >=1:\\n return True \\n dic[i] = dic.get(i,0) + 1\\n return False\",\n \"runtime\": \"349\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = {}\\n for item in nums:\\n if(item in seen):\\n seen[item]+=1\\n if(seen[item]>=1):\\n return True\\n else:\\n seen[item] = 1\\n return False\\n\",\n \"runtime\": \"355\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n result_set = set()\\n for num in nums:\\n if num in result_set:\\n return True\\n result_set.add(num)\\n return False\",\n \"runtime\": \"355\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = set()\\n for i in nums:\\n if i in seen:\\n return True\\n seen.add(i)\\n return False\\n \",\n \"runtime\": \"366\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n d = set()\\n for n in nums:\\n if n in d:\\n return True\\n d.add(n)\\n return False\",\n \"runtime\": \"366\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n cnt = defaultdict(int)\\n for n in nums:\\n cnt[n] += 1\\n if cnt[n] > 1:\\n return True\\n return False\\n \",\n \"runtime\": \"372\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n #usinh sets\\n seen=set()\\n for i in nums :\\n if i in seen:\\n return True\\n seen.add(i)\\n return False\\n\\n\",\n \"runtime\": \"372\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n if len(nums)!=len(set(nums)):\\n return True\\n return False\\n\",\n \"runtime\": \"377\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return not len(nums) == len(set(nums))\",\n \"runtime\": \"377\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n x=set()\\n for i in nums:\\n if i in x:\\n return True\\n else:\\n x.add(i)\\n \\n return False\\n \",\n \"runtime\": \"383\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n \\n from collections import Counter\\n\\n _dict = dict(Counter(nums))\\n key_with_dupls = next((key for key in _dict if _dict[key] > 1), None)\\n \\n return not key_with_dupls is None\\n\",\n \"runtime\": \"383\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashmaps={}\\n for i in nums:\\n if i in hashmaps:\\n return True\\n hashmaps[i]=True\\n return False\\n\\n\",\n \"runtime\": \"388\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return True if len(set(nums))<len(nums) else False\\n\",\n \"runtime\": \"388\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashset=set()\\n for i in nums:\\n if i in hashset:\\n return True\\n hashset.add(i)\\n return False\\n \",\n \"runtime\": \"394\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = {}\\n for num in nums:\\n if num in seen:\\n return True\\n else:\\n seen[num] = num\\n return False\\n \",\n \"runtime\": \"394\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n if len(nums) == len(set(nums)):\\n return False\\n else:\\n return True\",\n \"runtime\": \"400\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return len(set(nums)) != len(nums)\",\n \"runtime\": \"400\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n d = {}\\n for n in nums:\\n if n in d.keys():\\n return True\\n else:\\n d[n] = 1\\n return False\",\n \"runtime\": \"405\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n L = 0\\n window = set()\\n\\n for n in nums:\\n if n in window: return True\\n window.add(n)\\n\\n return False\",\n \"runtime\": \"405\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n myMap = {}\\n \\n for i in nums:\\n if i in myMap:\\n return True\\n else:\\n myMap[i] = 1\\n \\n return False\",\n \"runtime\": \"411\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n s=set()\\n for i in nums:\\n if i in s:\\n return True\\n s.add(i)\\n return False\",\n \"runtime\": \"411\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n if len(nums) > 0:\\n dic = {}\\n dic[nums[0]] = 0\\n for i in range(1, len(nums)):\\n try:\\n print(dic[nums[i]])\\n return True\\n except:\\n dic[nums[i]] = 0\\n return False\\n \",\n \"runtime\": \"416\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = set()\\n for i in nums:\\n if i in seen:\\n return True\\n else:\\n seen.add(i)\\n return False\",\n \"runtime\": \"416\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashset=set()\\n for n in nums:\\n if n in hashset:\\n return True\\n hashset.add(n)\\n return False\\n \",\n \"runtime\": \"422\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n d = set()\\n for i in nums:\\n if i not in d:\\n d.add(i)\\n else:\\n return True\\n \\n return False\",\n \"runtime\": \"422\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hmap=Counter(nums)\\n for i,val in hmap.items():\\n if val>1:\\n return True\\n return False\",\n \"runtime\": \"427\"\n },\n {\n \"code\": \"# 217. Contains Duplicate - Easy\\n# url: https://leetcode.com/problems/contains-duplicate/\\n\\nfrom typing import List\\n\\n\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return self.check_lenght(nums)\\n # return self.check_set(nums)\\n\\n def check_lenght(self, nums: List[int]) -> bool:\\n return len(nums) != len(set(nums))\\n\\n def check_set(self, nums: List[int]) -> bool:\\n num_set = set()\\n for num in nums:\\n if num in num_set:\\n return True\\n num_set.add(num)\\n return False\\n\\n\\nif __name__ == \\\"__main__\\\":\\n s = Solution()\\n print(s.containsDuplicate([1, 2, 3, 1])) # True\\n print(s.containsDuplicate([1, 2, 3, 4])) # False\\n print(s.containsDuplicate([1, 1, 1, 3, 3, 4, 3, 2, 4, 2])) # True\\n\",\n \"runtime\": \"427\"\n },\n {\n \"code\": \"from collections import OrderedDict\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n \\n result = list(OrderedDict.fromkeys(nums))\\n if(len(nums)!=len(result)) :\\n ans =True\\n if (len(nums)==len(result)) :\\n ans =False\\n return ans\\n \\n \",\n \"runtime\": \"433\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n d = {}\\n for i in nums:\\n if i not in d:\\n d[i] = 1\\n else:\\n d[i] += 1\\n \\n for i in d:\\n if d[i] > 1:\\n return True\\n\\n return False\",\n \"runtime\": \"433\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return True if len(set(nums)) < len(nums) else False\",\n \"runtime\": \"438\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n s = set()\\n for n in nums:\\n if n in s:\\n return True\\n s.add(n)\\n return False\",\n \"runtime\": \"438\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n d = {}\\n for i in nums:\\n if i not in d:\\n d[i] = 1\\n else:\\n return True\",\n \"runtime\": \"444\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashmap = {x: 0 for x in nums}\\n for i in nums:\\n hashmap[i] += 1\\n if hashmap[i] == 2:\\n return True\\n return False\\n \",\n \"runtime\": \"444\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n if len(nums) > 0:\\n dic = {}\\n dic[nums[0]] = 0\\n for i in range(1, len(nums)):\\n try:\\n print(dic[nums[i]])\\n return True\\n except:\\n dic[nums[i]] = 0\\n return False\\n \",\n \"runtime\": \"450\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n n=len(nums)\\n nums.sort()\\n for i in range(1,n):\\n if nums[i]==nums[i-1]:\\n return True\\n break\\n return False\",\n \"runtime\": \"450\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n for i in range(1,len(nums)):\\n if nums[i] == nums[i-1]:\\n return True\\n return False\",\n \"runtime\": \"455\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n n = len(nums)\\n for i in range(1, n):\\n if nums[i] == nums[i - 1]:\\n return True\\n return False\\n \",\n \"runtime\": \"455\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums = sorted(nums)\\n # Check if the elements next to each other are equal which can occur as we have sorted the list\\n for i in range(len(nums)-1):\\n if nums[i] == nums[i+1]:\\n return True\\n return False\",\n \"runtime\": \"461\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n tmp = None\\n for n in nums:\\n if tmp == n:\\n return True\\n tmp = n\\n return False\",\n \"runtime\": \"461\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":138,"string":"138"},"mm_list":{"kind":"list like","value":[{"code":"f = open('user.out', 'w')\nprint('''true\nfalse\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\ntrue\nfalse\ntrue\ntrue\n''',file=f)\nexit(0)","memory":"16300"},{"code":"f = open('user.out', 'w')\nprint('''true\nfalse\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\ntrue\nfalse\ntrue\ntrue\n''',file=f)\nexit(0)","memory":"16400"},{"code":"f = open('user.out', 'w')\nprint('''true\nfalse\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\ntrue\nfalse\ntrue\ntrue\n''',file=f)\nexit(0)","memory":"16400"},{"code":"# class Solution: \n# def containsDuplicate(self, nums: List[int]) -> bool: \n# countmap = {} \n# for num in nums: \n# if num not in countmap: \n# countmap[num] = 1 \n# else: \n# countmap[num] += 1 \n \n# for count in countmap.values(): \n# if count >= 2: # Check for count greater than or equal to 2 \n# return True \n \n# return False # No duplicates found\nf = open('user.out', 'w')\nprint('''true\nfalse\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\ntrue\nfalse\ntrue\ntrue\n''',file=f)\nexit(0)","memory":"16500"},{"code":"f = open('user.out', 'w')\nprint('''true\nfalse\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\nfalse\ntrue\nfalse\nfalse\nfalse\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\ntrue\nfalse\ntrue\ntrue\ntrue\nfalse\nfalse\ntrue\ntrue\nfalse\ntrue\ntrue\n''',file=f)\nexit(0)","memory":"16600"},{"code":"def containsDuplicate(nums: List[int]) -> bool:\n nums.sort()\n prev = None\n for num in nums:\n if num == prev:\n return True\n prev = num\n\n return False\n\nif __name__ == '__main__':\n import json, sys\n with open('user.out', 'w') as f:\n for nums in map(json.loads, sys.stdin):\n result = containsDuplicate(nums)\n print(str(result).lower(), file=f)\n sys.exit()","memory":"24000"},{"code":"# class Solution:\ndef dup(nums: List[int]) -> str:\n nums.sort()\n for i in range(1, len(nums)):\n if nums[i]==nums[i-1]:\n return 'true'\n return 'false'\n\n # if len(nums) != len(set(nums)):\n # return 'true'\n # return 'false'\n\nwith open('user.out', 'w') as f:\n for nums in map(loads, stdin):\n f.write(dup(nums)+'\\n')\nexit()","memory":"24100"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n for i in range(len(nums) - 1):\n if nums[i] == nums[i + 1]:\n return True;\n return False\n","memory":"26600"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n prev = None\n for i in nums:\n if prev == None:\n prev = i\n continue\n if prev == i:\n return True\n else:\n prev = i\n return False\n","memory":"26700"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n \n\n n=len(nums) \n nums.sort()\n arr=nums[:]\n\n c=0\n for i in range(1,n):\n if arr[i-1]==arr[i]:\n nums.pop(i-c)\n c=c+1\n\n k=len(nums)\n m=len(arr)\n\n return m!=k","memory":"26800"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n res = ''\n count = 0\n nums.sort()\n for i in range(len(nums)-1):\n j = i + 1\n if nums[i] == nums[j]:\n count = count + 1\n if count > 0: res = True \n else: res = False \n return res\n\n ","memory":"27100"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n for i in range(len(nums)-1):\n if nums[i] == nums[i+1]: return True\n return False\n \n \n\n ","memory":"27300"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n n = len(nums)\n for i in range(1, n):\n if nums[i] == nums[i - 1]:\n return True\n return False\n\n \n ","memory":"27400"},{"code":"def containsDuplicate(nums: List[int]) -> bool:\n seen = set()\n for num in nums:\n if num in seen:\n return True\n else:\n seen.add(num)\n return False\n\nif __name__ == '__main__':\n import json, sys\n with open('user.out', 'w') as f:\n for nums in map(json.loads, sys.stdin):\n result = containsDuplicate(nums)\n print(str(result).lower(), file=f)\n sys.exit()","memory":"27500"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n for i in range(len(nums)):\n if i> 0 and nums[i]==nums[i-1] :\n return True\n else:\n False\n\n\n\n ","memory":"27600"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n for i in range(len(nums)-1):\n if nums[i] == nums[i+1]:\n return True\n return False","memory":"27700"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n result=True\n result1=False\n for i in range(0,len(nums)-1):\n if nums[i]==nums[i+1]:\n return result\n if result==0:\n return result1\n\n\n ","memory":"27800"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n \n nums.sort()\n b=[]\n \n for n in range(1,len(nums)):\n if nums[n] == nums[n-1]:\n b.append('true')\n else:\n b.append('false')\n \n s = 'true'\n \n if s in b:\n return True\n else:\n return False\n\n ","memory":"27900"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n for i in range(0,len(nums)-1):\n if(nums[i]==nums[i+1]):\n return True\n else:\n return False","memory":"28000"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n for i in range(1,len(nums)):\n if nums[i] == nums[i-1]:\n return True\n return False","memory":"28100"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n l =len(nums)\n for i in range(l-1):\n if nums[i]==nums[i+1]:\n return True\n else:\n return False","memory":"28100"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n n = len(nums)\n for i in range(1,n):\n if nums[i-1] == nums[i]:\n return True\n return False\n ","memory":"28200"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n for i in range(len(nums)-1):\n if nums[i] == nums[i+1]:\n return True\n return False","memory":"28200"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n for i in range(len(nums)-1):\n if nums[i]==nums[i+1]:\n return True\n return False\n ","memory":"28300"},{"code":"class Solution:\n def containsDuplicate(self, nums: list[int]) -> bool:\n \n original_length = len(nums)\n nums = sorted(nums)\n print(nums)\n previous: int = nums[0]\n for num in nums[1:original_length]:\n \n if num ==previous:\n return True\n\n previous = num\n \n return False\n \n \n\n","memory":"28500"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n \n nums.sort()\n for i in range(len(nums)-1):\n if nums[i] == nums[i+1]:\n return True\n break\n return False","memory":"28500"},{"code":"from dataclasses import dataclass\n@dataclass\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n for i in range(len(nums)):\n for j in range(i+1, len(nums)):\n if nums[i] == nums[j]:\n return True\n return False\n\n\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n for i in range(len(nums)-1):\n if nums[i] == nums[i+1]:\n return True\n return False\n","memory":"28600"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n for i in range(1,len(nums)):\n if(nums[i]==nums[i-1]):\n return True\n break\n return False\n ","memory":"28600"},{"code":"from dataclasses import dataclass\n@dataclass\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n for i in range(len(nums)):\n for j in range(i+1, len(nums)):\n if nums[i] == nums[j]:\n return True\n return False\n\n\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n return any(x == y for x, y in zip(nums, nums[1:]))\n\n","memory":"28700"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n for i in range(len(nums)-1):\n print(nums[i],nums[i+1])\n if nums[i]==nums[i+1]:\n return True\n \n return False\n\n \n\n","memory":"28700"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n pos = 1\n for num in nums[:-1]:\n if num == nums[pos]:\n return True\n pos += 1\n return False\n\n ","memory":"28800"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n for num1, num2 in zip(nums, nums[1:]):\n if num1 == num2:\n return True\n return False","memory":"28900"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n prev = nums[0]\n for num in nums[1:]:\n if prev == num:\n return True\n prev = num\n return False","memory":"29000"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n prev = nums[0]\n for num in nums[1:]:\n if prev == num:\n return True\n prev = num\n return False\n\nif __name__ == '__main__':\n sl = Solution()\n nums = [1,2,3,4]\n ans = sl.containsDuplicate(nums)\n print(ans)","memory":"29000"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n set_nums = set(nums) # By converting the list of nums to a set, the duplicates are removed\n if len(set_nums) < len(nums): # If any duplicates were removed the length of the set would be less than the length of the original list\n return True\n return False\n ","memory":"29100"},{"code":"class Solution:\n\n def quickSort(self, arr: List[int]) -> List[int]:\n if len(arr) <= 1:\n return arr\n\n pivot_index = random.randint(0, len(arr) - 1)\n pivot = arr[pivot_index]\n\n left = [x for x in arr if x < pivot]\n middle = [x for x in arr if x == pivot]\n right = [x for x in arr if x > pivot]\n\n return self.quickSort(left) + middle + self.quickSort(right) \n\n\n def containsDuplicate(self, nums: List[int]) -> bool:\n \"\"\"\n 1. Sort the array with QuickSort: O(NlogN)\n 2. Iterate over the sorted array to find duplicates: O(n)\n \"\"\"\n\n nums_size = len(nums)\n if nums_size == 1:\n return False\n\n sorted_nums = self.quickSort(nums)\n\n for index in range(1, nums_size):\n if sorted_nums[index] == sorted_nums[index - 1]:\n return True\n \n return False","memory":"29300"},{"code":"class Solution(object):\n def containsDuplicate(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: bool\n \"\"\"\n # Implement Merge Sort\n def merge_sort(arr):\n if len(arr) <= 1:\n return arr\n \n # Divide\n mid = len(arr) // 2\n left_half = merge_sort(arr[:mid])\n right_half = merge_sort(arr[mid:])\n \n # Conquer\n return merge(left_half, right_half)\n \n def merge(left, right):\n sorted_list = []\n i = j = 0\n \n # Merge the sorted halves\n while i < len(left) and j < len(right):\n if left[i] < right[j]:\n sorted_list.append(left[i])\n i += 1\n else:\n sorted_list.append(right[j])\n j += 1\n \n # Add any remaining elements from both halves\n sorted_list.extend(left[i:])\n sorted_list.extend(right[j:])\n \n return sorted_list\n \n # Sort the list using Merge Sort\n nums = merge_sort(nums)\n \n # Check for duplicates in the sorted array\n for i in range(1, len(nums)):\n if nums[i] == nums[i - 1]:\n return True\n \n return False\n","memory":"29400"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n d = set()\n for i in nums:\n if i in d:\n return True\n else:\n d.add(i)\n\n return False","memory":"29500"},{"code":"class Solution(object):\n def containsDuplicate(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: bool\n \"\"\"\n # Implement Merge Sort\n def merge_sort(arr):\n if len(arr) <= 1:\n return arr\n \n # Divide\n mid = len(arr) // 2\n left_half = merge_sort(arr[:mid])\n right_half = merge_sort(arr[mid:])\n \n # Conquer\n return merge(left_half, right_half)\n \n def merge(left, right):\n sorted_list = []\n i = j = 0\n \n # Merge the sorted halves\n while i < len(left) and j < len(right):\n if left[i] < right[j]:\n sorted_list.append(left[i])\n i += 1\n else:\n sorted_list.append(right[j])\n j += 1\n \n # Add any remaining elements from both halves\n sorted_list.extend(left[i:])\n sorted_list.extend(right[j:])\n \n return sorted_list\n \n # Sort the list using Merge Sort\n nums = merge_sort(nums)\n \n # Check for duplicates in the sorted array\n for i in range(1, len(nums)):\n if nums[i] == nums[i - 1]:\n return True\n \n return False\n","memory":"29600"},{"code":"'''\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n i = 1\n for num in nums:\n for num1 in nums[i:]:\n if (num == num1):\n return True\n i = i + 1\n return False\n'''\n\n\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n arr = nums\n \n #MergeSort\n def merge_sort(arr):\n if len(arr) <= 1:\n return arr\n \n # Step 1: Divide the array into two halves\n mid = len(arr) // 2\n left_half = merge_sort(arr[:mid])\n right_half = merge_sort(arr[mid:])\n \n # Step 2: Conquer by merging the sorted halves\n return merge(left_half, right_half)\n\n def merge(left, right):\n sorted_array = []\n i = j = 0\n \n # Step 3: Merge the two halves\n while i < len(left) and j < len(right):\n if left[i] < right[j]:\n sorted_array.append(left[i])\n i += 1\n else:\n sorted_array.append(right[j])\n j += 1\n \n # Append any remaining elements\n sorted_array.extend(left[i:])\n sorted_array.extend(right[j:])\n \n return sorted_array\n\n sorted_arr = merge_sort(arr)\n print(sorted_arr)\n\n #Check neighbor\n i = 1\n for num in sorted_arr[:len(sorted_arr)-1]:\n if (num == sorted_arr[i]):\n return True\n if(i < len(sorted_arr)-1):\n i += 1\n return False\n\n\n\n'''\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n duplicate_arr = []\n for num in nums:\n if num not in duplicate_arr:\n duplicate_arr.append(num)\n else:\n return True\n return False\n'''","memory":"29700"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n existing_num = set()\n\n for i in nums:\n if i in existing_num:\n return True\n existing_num.add(i)\n \n return False","memory":"29800"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashset = set()\n\n for n in nums:\n if n in hashset:\n return True\n hashset.add(n)\n \n return False\n ","memory":"29900"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n s = set()\n\n for x in nums:\n if x in s:\n return True\n \n s.add(x)\n \n return False","memory":"30000"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashset = set()\n for i in nums:\n if i in hashset:\n return True\n hashset.add(i)\n return False","memory":"30100"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n duplicated = set()\n for num in nums:\n if num in duplicated:\n return True\n duplicated.add(num)\n return False","memory":"30200"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n s = set()\n for i in nums:\n if i in s:\n return True\n else:\n s.add(i)\n return False","memory":"30400"},{"code":"class Solution(object):\n def containsDuplicate(self, nums):\n num_set = set()\n for i in nums:\n if i in num_set:\n return True\n else:\n num_set.add(i)\n return False\n ","memory":"30500"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashset = set()\n for n in nums:\n if n in hashset:\n return True \n hashset.add(n)\n return False \n","memory":"30600"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n s = set()\n for i in nums:\n if i in s:\n return True\n s.add(i)\n return False","memory":"30700"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n myset = set()\n for i in range(len(nums)):\n if nums[i] in myset:\n return True \n else:\n myset.add(nums[i])\n return False ","memory":"30800"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n a = set(nums)\n\n return len(a) != len(nums)","memory":"30800"},{"code":"from collections import Counter\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n # Solution with Hashmap\n # hashmap = {}\n # for element in nums:\n # if element in hashmap:\n # hashmap[element] += 1\n # else:\n # hashmap[element] = 1\n # if hashmap[element]>1:\n # return True\n \n # Solution with Set(which does not allow duplicates)\n\n hashset = set()\n for num in nums:\n if num in hashset:\n return True\n else:\n hashset.add(num)\n return False\n\n","memory":"30900"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n numSet = set(nums)\n if len(nums) == len(numSet):\n return False\n return True","memory":"31000"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n set1=set([])\n for i in nums:\n if i in set1:\n return True\n set1.add(i)\n return False","memory":"31100"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = set()\n for num in nums:\n if num in seen:\n return True\n seen.add(num)\n return False \n ","memory":"31200"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n mySet= set()\n for val in nums:\n if val in mySet:\n return True\n mySet.add(val)\n return False","memory":"31300"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return len(set(nums)) != len(nums)","memory":"31400"},{"code":"'''\nU:\n GIven an array\n Have to decide if a value is repeated\nM:\n Just have to use a hash set\nP:\n Make a set of the values\nE:\n O(n) time because we are taking the time to add each elemeent into the set then we are comparing them\n O(n) space becauyse we are creating a new set\n'''\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n \n nums_set = set(nums)\n\n return len(nums_set) != len(nums)","memory":"31500"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n visited=set()\n for num in nums:\n if num in visited:\n return True\n else:\n visited.add(num)\n return False\n ","memory":"31600"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hash = set()\n for n in nums:\n if n in hash:\n return True\n hash.add(n)\n return False","memory":"31700"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums_set = set(nums)\n return len(nums) != len(nums_set)\n ","memory":"31700"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = set()\n for num in nums:\n if num in seen:\n return True\n seen.add(num)\n return False","memory":"31800"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return len(nums) != len(set(nums))","memory":"31800"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = set()\n\n for i in nums: \n if i in seen: return True\n seen.add(i)\n\n return False","memory":"31900"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n numbers = set()\n\n for num in nums:\n if num not in numbers:\n numbers.add(num)\n else:\n return True\n return False","memory":"31900"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n my_set = set()\n for num in nums:\n if num in my_set:\n return True\n my_set.add(num)\n\n return False","memory":"32000"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashset = set()\n\n for i in range(len(nums)):\n if nums[i] in hashset:\n return True\n hashset.add(nums[i])\n\n return False\n","memory":"32000"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n return len(set(nums)) != len(nums)","memory":"32100"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n numSet = set()\n for num in nums:\n if num in numSet:\n return True\n else:\n numSet.add(num)\n return False","memory":"32100"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums.sort()\n list1 = list(set(nums))\n list1.sort() \n print(nums,list1)\n return nums != list1\n \n \n ","memory":"32200"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n num_set = set(nums)\n return len(num_set) < len(nums)","memory":"32299"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n numsSet = set()\n for i in nums:\n print(i)\n if i not in numsSet:\n numsSet.add(i)\n else:\n return True\n \n return False","memory":"32400"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n # seen = set()\n # for num in nums:\n # if num in seen:\n # return True\n # seen.add(num)\n # return False\n\n seen = {}\n for num in nums:\n if num in seen:\n return True\n seen[num] = 1\n return False","memory":"32500"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n visited = set()\n while nums:\n x = nums.pop()\n if x in visited:\n return True\n visited.add(x)\n return False","memory":"32600"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = {}\n for num in nums:\n if seen.get(num):\n return True\n else:\n seen[num] = True\n return False","memory":"32700"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n mapper = {}\n\n for num in nums:\n if num in mapper:\n return True\n mapper[num] = 69420\n return False","memory":"32800"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n once=set()\n mult=set()\n for num in nums:\n if num in once: mult.add(num)\n if num not in once: once.add(num) \n \n if mult:\n return True\n #else:\n # return True\n \n print(once)\n print(mult)","memory":"33000"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n visited = set()\n\n for num in nums:\n if num in visited:\n return True\n visited |= {num}\n \n return False\n \n def containsDuplicate2(self, nums: List[int]) -> bool:\n nums.sort()\n\n prev = nums[0]\n\n for i in range(1, len(nums)):\n if nums[i] == prev:\n return True\n prev = nums[i]\n return False\n\n\n","memory":"33100"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n s = set()\n for i in nums: \n if(i in s): \n return True\n s.update({i})\n \n return False","memory":"33100"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hm = {}\n #sl = sorted(nums)\n for i in nums:\n hm[i] = hm.get(i, 0) + 1\n if hm[i] > 1:\n return True\n return False\n \n # sl = sorted(nums)\n # for i in range(len(sl)-1):\n # if sl[i] == sl[i+1]:\n # return True\n # return False","memory":"33200"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n h = {}\n for i in nums:\n if i in h:\n return True\n h[i] = 1\n return False","memory":"33300"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n storage = {}\n for el in nums:\n if el in storage:\n return True\n else:\n storage[el] = 1\n return False","memory":"33400"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n seen = {}\n for num in nums:\n if num in seen and seen[num] >= 1:\n return True\n seen[num] = seen.get(num, 0) + 1\n return False","memory":"33500"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n bruh = {}\n for num in nums:\n try:\n bruh[num] += 1\n return True\n except:\n bruh[num] = 1\n return False\n ","memory":"33600"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n nums_dict = {}\n\n for i in range(len(nums)):\n if nums[i] in nums_dict:\n return True\n else:\n nums_dict[nums[i]] = 1\n return False","memory":"33800"},{"code":"from collections import Counter\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n count = Counter(nums)\n for k, value in count.items():\n if value > 1:\n return True\n return False\n \n ","memory":"33900"},{"code":"from collections import Counter\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n mapping = Counter(nums)\n for num in mapping.values():\n if num>1:\n return True\n return False ","memory":"34000"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n hashMap = dict()\n \n for n in nums:\n if n in hashMap:\n return True\n else:\n hashMap[n] = 1\n \n return False","memory":"34100"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n dic = {}\n for num in nums:\n if num in dic:\n return True\n else:\n dic[num] = 1\n return False\n","memory":"34100"},{"code":"from collections import Counter\n\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n # return len(set(nums)) != len(nums)\n \n # math solution\n\n # 1 + 2 + 3 + 4 = 10 % 4\n # [1, 2, 3, 1] -> \n freq = Counter(nums)\n if sum(list(freq.values())) != len(freq):\n return True\n return False\n\n\n\n\n\n ","memory":"34200"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n \n counter = defaultdict(int)\n\n for num in nums:\n if counter[num] > 0:\n return True\n else:\n counter[num] += 1\n \n return False","memory":"34300"},{"code":"class Solution:\n def containsDuplicate(self, nums: list[int]) -> bool:\n seen_dict = {}\n for i in nums:\n if i in seen_dict:\n return True\n else:\n seen_dict[i] = seen_dict.get(i, 0)\n return False\n\n\n\n ","memory":"34300"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n dic = {}\n for i in nums:\n if i in dic and dic[i] >=1:\n return True \n dic[i] = dic.get(i,0) + 1\n return False","memory":"34400"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n d = {}\n for i in nums:\n if i not in d:\n d[i] = 1\n else:\n return True","memory":"34400"},{"code":"class Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n # add value to hashmap\n prevNums = {}\n for num in nums:\n if num in prevNums.keys():\n return True\n else:\n prevNums[num] = num\n return False\n\n\n\n # if value already in hashmap, return True\n\n # return False\n ","memory":"34500"},{"code":"from collections import Counter\nclass Solution:\n def containsDuplicate(self, nums: List[int]) -> bool:\n freqs = Counter()\n for num in nums:\n freqs[num] += 1\n for num in freqs:\n if freqs[num] > 1:\n return True\n return False","memory":"34500"}],"string":"[\n {\n \"code\": \"f = open('user.out', 'w')\\nprint('''true\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\n''',file=f)\\nexit(0)\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nprint('''true\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\n''',file=f)\\nexit(0)\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nprint('''true\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\n''',file=f)\\nexit(0)\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"# class Solution: \\n# def containsDuplicate(self, nums: List[int]) -> bool: \\n# countmap = {} \\n# for num in nums: \\n# if num not in countmap: \\n# countmap[num] = 1 \\n# else: \\n# countmap[num] += 1 \\n \\n# for count in countmap.values(): \\n# if count >= 2: # Check for count greater than or equal to 2 \\n# return True \\n \\n# return False # No duplicates found\\nf = open('user.out', 'w')\\nprint('''true\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\n''',file=f)\\nexit(0)\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nprint('''true\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\ntrue\\nfalse\\nfalse\\nfalse\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\ntrue\\nfalse\\nfalse\\ntrue\\ntrue\\nfalse\\ntrue\\ntrue\\n''',file=f)\\nexit(0)\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"def containsDuplicate(nums: List[int]) -> bool:\\n nums.sort()\\n prev = None\\n for num in nums:\\n if num == prev:\\n return True\\n prev = num\\n\\n return False\\n\\nif __name__ == '__main__':\\n import json, sys\\n with open('user.out', 'w') as f:\\n for nums in map(json.loads, sys.stdin):\\n result = containsDuplicate(nums)\\n print(str(result).lower(), file=f)\\n sys.exit()\",\n \"memory\": \"24000\"\n },\n {\n \"code\": \"# class Solution:\\ndef dup(nums: List[int]) -> str:\\n nums.sort()\\n for i in range(1, len(nums)):\\n if nums[i]==nums[i-1]:\\n return 'true'\\n return 'false'\\n\\n # if len(nums) != len(set(nums)):\\n # return 'true'\\n # return 'false'\\n\\nwith open('user.out', 'w') as f:\\n for nums in map(loads, stdin):\\n f.write(dup(nums)+'\\\\n')\\nexit()\",\n \"memory\": \"24100\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n for i in range(len(nums) - 1):\\n if nums[i] == nums[i + 1]:\\n return True;\\n return False\\n\",\n \"memory\": \"26600\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n prev = None\\n for i in nums:\\n if prev == None:\\n prev = i\\n continue\\n if prev == i:\\n return True\\n else:\\n prev = i\\n return False\\n\",\n \"memory\": \"26700\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n \\n\\n n=len(nums) \\n nums.sort()\\n arr=nums[:]\\n\\n c=0\\n for i in range(1,n):\\n if arr[i-1]==arr[i]:\\n nums.pop(i-c)\\n c=c+1\\n\\n k=len(nums)\\n m=len(arr)\\n\\n return m!=k\",\n \"memory\": \"26800\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n res = ''\\n count = 0\\n nums.sort()\\n for i in range(len(nums)-1):\\n j = i + 1\\n if nums[i] == nums[j]:\\n count = count + 1\\n if count > 0: res = True \\n else: res = False \\n return res\\n\\n \",\n \"memory\": \"27100\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n for i in range(len(nums)-1):\\n if nums[i] == nums[i+1]: return True\\n return False\\n \\n \\n\\n \",\n \"memory\": \"27300\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n n = len(nums)\\n for i in range(1, n):\\n if nums[i] == nums[i - 1]:\\n return True\\n return False\\n\\n \\n \",\n \"memory\": \"27400\"\n },\n {\n \"code\": \"def containsDuplicate(nums: List[int]) -> bool:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n else:\\n seen.add(num)\\n return False\\n\\nif __name__ == '__main__':\\n import json, sys\\n with open('user.out', 'w') as f:\\n for nums in map(json.loads, sys.stdin):\\n result = containsDuplicate(nums)\\n print(str(result).lower(), file=f)\\n sys.exit()\",\n \"memory\": \"27500\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n for i in range(len(nums)):\\n if i> 0 and nums[i]==nums[i-1] :\\n return True\\n else:\\n False\\n\\n\\n\\n \",\n \"memory\": \"27600\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n for i in range(len(nums)-1):\\n if nums[i] == nums[i+1]:\\n return True\\n return False\",\n \"memory\": \"27700\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n result=True\\n result1=False\\n for i in range(0,len(nums)-1):\\n if nums[i]==nums[i+1]:\\n return result\\n if result==0:\\n return result1\\n\\n\\n \",\n \"memory\": \"27800\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n \\n nums.sort()\\n b=[]\\n \\n for n in range(1,len(nums)):\\n if nums[n] == nums[n-1]:\\n b.append('true')\\n else:\\n b.append('false')\\n \\n s = 'true'\\n \\n if s in b:\\n return True\\n else:\\n return False\\n\\n \",\n \"memory\": \"27900\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n for i in range(0,len(nums)-1):\\n if(nums[i]==nums[i+1]):\\n return True\\n else:\\n return False\",\n \"memory\": \"28000\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n for i in range(1,len(nums)):\\n if nums[i] == nums[i-1]:\\n return True\\n return False\",\n \"memory\": \"28100\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n l =len(nums)\\n for i in range(l-1):\\n if nums[i]==nums[i+1]:\\n return True\\n else:\\n return False\",\n \"memory\": \"28100\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n n = len(nums)\\n for i in range(1,n):\\n if nums[i-1] == nums[i]:\\n return True\\n return False\\n \",\n \"memory\": \"28200\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n for i in range(len(nums)-1):\\n if nums[i] == nums[i+1]:\\n return True\\n return False\",\n \"memory\": \"28200\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n for i in range(len(nums)-1):\\n if nums[i]==nums[i+1]:\\n return True\\n return False\\n \",\n \"memory\": \"28300\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: list[int]) -> bool:\\n \\n original_length = len(nums)\\n nums = sorted(nums)\\n print(nums)\\n previous: int = nums[0]\\n for num in nums[1:original_length]:\\n \\n if num ==previous:\\n return True\\n\\n previous = num\\n \\n return False\\n \\n \\n\\n\",\n \"memory\": \"28500\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n \\n nums.sort()\\n for i in range(len(nums)-1):\\n if nums[i] == nums[i+1]:\\n return True\\n break\\n return False\",\n \"memory\": \"28500\"\n },\n {\n \"code\": \"from dataclasses import dataclass\\n@dataclass\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n for i in range(len(nums)):\\n for j in range(i+1, len(nums)):\\n if nums[i] == nums[j]:\\n return True\\n return False\\n\\n\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n for i in range(len(nums)-1):\\n if nums[i] == nums[i+1]:\\n return True\\n return False\\n\",\n \"memory\": \"28600\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n for i in range(1,len(nums)):\\n if(nums[i]==nums[i-1]):\\n return True\\n break\\n return False\\n \",\n \"memory\": \"28600\"\n },\n {\n \"code\": \"from dataclasses import dataclass\\n@dataclass\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n for i in range(len(nums)):\\n for j in range(i+1, len(nums)):\\n if nums[i] == nums[j]:\\n return True\\n return False\\n\\n\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n return any(x == y for x, y in zip(nums, nums[1:]))\\n\\n\",\n \"memory\": \"28700\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n for i in range(len(nums)-1):\\n print(nums[i],nums[i+1])\\n if nums[i]==nums[i+1]:\\n return True\\n \\n return False\\n\\n \\n\\n\",\n \"memory\": \"28700\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n pos = 1\\n for num in nums[:-1]:\\n if num == nums[pos]:\\n return True\\n pos += 1\\n return False\\n\\n \",\n \"memory\": \"28800\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n for num1, num2 in zip(nums, nums[1:]):\\n if num1 == num2:\\n return True\\n return False\",\n \"memory\": \"28900\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n prev = nums[0]\\n for num in nums[1:]:\\n if prev == num:\\n return True\\n prev = num\\n return False\",\n \"memory\": \"29000\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n prev = nums[0]\\n for num in nums[1:]:\\n if prev == num:\\n return True\\n prev = num\\n return False\\n\\nif __name__ == '__main__':\\n sl = Solution()\\n nums = [1,2,3,4]\\n ans = sl.containsDuplicate(nums)\\n print(ans)\",\n \"memory\": \"29000\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n set_nums = set(nums) # By converting the list of nums to a set, the duplicates are removed\\n if len(set_nums) < len(nums): # If any duplicates were removed the length of the set would be less than the length of the original list\\n return True\\n return False\\n \",\n \"memory\": \"29100\"\n },\n {\n \"code\": \"class Solution:\\n\\n def quickSort(self, arr: List[int]) -> List[int]:\\n if len(arr) <= 1:\\n return arr\\n\\n pivot_index = random.randint(0, len(arr) - 1)\\n pivot = arr[pivot_index]\\n\\n left = [x for x in arr if x < pivot]\\n middle = [x for x in arr if x == pivot]\\n right = [x for x in arr if x > pivot]\\n\\n return self.quickSort(left) + middle + self.quickSort(right) \\n\\n\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n \\\"\\\"\\\"\\n 1. Sort the array with QuickSort: O(NlogN)\\n 2. Iterate over the sorted array to find duplicates: O(n)\\n \\\"\\\"\\\"\\n\\n nums_size = len(nums)\\n if nums_size == 1:\\n return False\\n\\n sorted_nums = self.quickSort(nums)\\n\\n for index in range(1, nums_size):\\n if sorted_nums[index] == sorted_nums[index - 1]:\\n return True\\n \\n return False\",\n \"memory\": \"29300\"\n },\n {\n \"code\": \"class Solution(object):\\n def containsDuplicate(self, nums):\\n \\\"\\\"\\\"\\n :type nums: List[int]\\n :rtype: bool\\n \\\"\\\"\\\"\\n # Implement Merge Sort\\n def merge_sort(arr):\\n if len(arr) <= 1:\\n return arr\\n \\n # Divide\\n mid = len(arr) // 2\\n left_half = merge_sort(arr[:mid])\\n right_half = merge_sort(arr[mid:])\\n \\n # Conquer\\n return merge(left_half, right_half)\\n \\n def merge(left, right):\\n sorted_list = []\\n i = j = 0\\n \\n # Merge the sorted halves\\n while i < len(left) and j < len(right):\\n if left[i] < right[j]:\\n sorted_list.append(left[i])\\n i += 1\\n else:\\n sorted_list.append(right[j])\\n j += 1\\n \\n # Add any remaining elements from both halves\\n sorted_list.extend(left[i:])\\n sorted_list.extend(right[j:])\\n \\n return sorted_list\\n \\n # Sort the list using Merge Sort\\n nums = merge_sort(nums)\\n \\n # Check for duplicates in the sorted array\\n for i in range(1, len(nums)):\\n if nums[i] == nums[i - 1]:\\n return True\\n \\n return False\\n\",\n \"memory\": \"29400\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n d = set()\\n for i in nums:\\n if i in d:\\n return True\\n else:\\n d.add(i)\\n\\n return False\",\n \"memory\": \"29500\"\n },\n {\n \"code\": \"class Solution(object):\\n def containsDuplicate(self, nums):\\n \\\"\\\"\\\"\\n :type nums: List[int]\\n :rtype: bool\\n \\\"\\\"\\\"\\n # Implement Merge Sort\\n def merge_sort(arr):\\n if len(arr) <= 1:\\n return arr\\n \\n # Divide\\n mid = len(arr) // 2\\n left_half = merge_sort(arr[:mid])\\n right_half = merge_sort(arr[mid:])\\n \\n # Conquer\\n return merge(left_half, right_half)\\n \\n def merge(left, right):\\n sorted_list = []\\n i = j = 0\\n \\n # Merge the sorted halves\\n while i < len(left) and j < len(right):\\n if left[i] < right[j]:\\n sorted_list.append(left[i])\\n i += 1\\n else:\\n sorted_list.append(right[j])\\n j += 1\\n \\n # Add any remaining elements from both halves\\n sorted_list.extend(left[i:])\\n sorted_list.extend(right[j:])\\n \\n return sorted_list\\n \\n # Sort the list using Merge Sort\\n nums = merge_sort(nums)\\n \\n # Check for duplicates in the sorted array\\n for i in range(1, len(nums)):\\n if nums[i] == nums[i - 1]:\\n return True\\n \\n return False\\n\",\n \"memory\": \"29600\"\n },\n {\n \"code\": \"'''\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n i = 1\\n for num in nums:\\n for num1 in nums[i:]:\\n if (num == num1):\\n return True\\n i = i + 1\\n return False\\n'''\\n\\n\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n arr = nums\\n \\n #MergeSort\\n def merge_sort(arr):\\n if len(arr) <= 1:\\n return arr\\n \\n # Step 1: Divide the array into two halves\\n mid = len(arr) // 2\\n left_half = merge_sort(arr[:mid])\\n right_half = merge_sort(arr[mid:])\\n \\n # Step 2: Conquer by merging the sorted halves\\n return merge(left_half, right_half)\\n\\n def merge(left, right):\\n sorted_array = []\\n i = j = 0\\n \\n # Step 3: Merge the two halves\\n while i < len(left) and j < len(right):\\n if left[i] < right[j]:\\n sorted_array.append(left[i])\\n i += 1\\n else:\\n sorted_array.append(right[j])\\n j += 1\\n \\n # Append any remaining elements\\n sorted_array.extend(left[i:])\\n sorted_array.extend(right[j:])\\n \\n return sorted_array\\n\\n sorted_arr = merge_sort(arr)\\n print(sorted_arr)\\n\\n #Check neighbor\\n i = 1\\n for num in sorted_arr[:len(sorted_arr)-1]:\\n if (num == sorted_arr[i]):\\n return True\\n if(i < len(sorted_arr)-1):\\n i += 1\\n return False\\n\\n\\n\\n'''\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n duplicate_arr = []\\n for num in nums:\\n if num not in duplicate_arr:\\n duplicate_arr.append(num)\\n else:\\n return True\\n return False\\n'''\",\n \"memory\": \"29700\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n existing_num = set()\\n\\n for i in nums:\\n if i in existing_num:\\n return True\\n existing_num.add(i)\\n \\n return False\",\n \"memory\": \"29800\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashset = set()\\n\\n for n in nums:\\n if n in hashset:\\n return True\\n hashset.add(n)\\n \\n return False\\n \",\n \"memory\": \"29900\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n s = set()\\n\\n for x in nums:\\n if x in s:\\n return True\\n \\n s.add(x)\\n \\n return False\",\n \"memory\": \"30000\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashset = set()\\n for i in nums:\\n if i in hashset:\\n return True\\n hashset.add(i)\\n return False\",\n \"memory\": \"30100\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n duplicated = set()\\n for num in nums:\\n if num in duplicated:\\n return True\\n duplicated.add(num)\\n return False\",\n \"memory\": \"30200\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n s = set()\\n for i in nums:\\n if i in s:\\n return True\\n else:\\n s.add(i)\\n return False\",\n \"memory\": \"30400\"\n },\n {\n \"code\": \"class Solution(object):\\n def containsDuplicate(self, nums):\\n num_set = set()\\n for i in nums:\\n if i in num_set:\\n return True\\n else:\\n num_set.add(i)\\n return False\\n \",\n \"memory\": \"30500\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashset = set()\\n for n in nums:\\n if n in hashset:\\n return True \\n hashset.add(n)\\n return False \\n\",\n \"memory\": \"30600\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n s = set()\\n for i in nums:\\n if i in s:\\n return True\\n s.add(i)\\n return False\",\n \"memory\": \"30700\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n myset = set()\\n for i in range(len(nums)):\\n if nums[i] in myset:\\n return True \\n else:\\n myset.add(nums[i])\\n return False \",\n \"memory\": \"30800\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n a = set(nums)\\n\\n return len(a) != len(nums)\",\n \"memory\": \"30800\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n # Solution with Hashmap\\n # hashmap = {}\\n # for element in nums:\\n # if element in hashmap:\\n # hashmap[element] += 1\\n # else:\\n # hashmap[element] = 1\\n # if hashmap[element]>1:\\n # return True\\n \\n # Solution with Set(which does not allow duplicates)\\n\\n hashset = set()\\n for num in nums:\\n if num in hashset:\\n return True\\n else:\\n hashset.add(num)\\n return False\\n\\n\",\n \"memory\": \"30900\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n numSet = set(nums)\\n if len(nums) == len(numSet):\\n return False\\n return True\",\n \"memory\": \"31000\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n set1=set([])\\n for i in nums:\\n if i in set1:\\n return True\\n set1.add(i)\\n return False\",\n \"memory\": \"31100\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n seen.add(num)\\n return False \\n \",\n \"memory\": \"31200\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n mySet= set()\\n for val in nums:\\n if val in mySet:\\n return True\\n mySet.add(val)\\n return False\",\n \"memory\": \"31300\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return len(set(nums)) != len(nums)\",\n \"memory\": \"31400\"\n },\n {\n \"code\": \"'''\\nU:\\n GIven an array\\n Have to decide if a value is repeated\\nM:\\n Just have to use a hash set\\nP:\\n Make a set of the values\\nE:\\n O(n) time because we are taking the time to add each elemeent into the set then we are comparing them\\n O(n) space becauyse we are creating a new set\\n'''\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n \\n nums_set = set(nums)\\n\\n return len(nums_set) != len(nums)\",\n \"memory\": \"31500\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n visited=set()\\n for num in nums:\\n if num in visited:\\n return True\\n else:\\n visited.add(num)\\n return False\\n \",\n \"memory\": \"31600\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hash = set()\\n for n in nums:\\n if n in hash:\\n return True\\n hash.add(n)\\n return False\",\n \"memory\": \"31700\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums_set = set(nums)\\n return len(nums) != len(nums_set)\\n \",\n \"memory\": \"31700\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return True\\n seen.add(num)\\n return False\",\n \"memory\": \"31800\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return len(nums) != len(set(nums))\",\n \"memory\": \"31800\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = set()\\n\\n for i in nums: \\n if i in seen: return True\\n seen.add(i)\\n\\n return False\",\n \"memory\": \"31900\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n numbers = set()\\n\\n for num in nums:\\n if num not in numbers:\\n numbers.add(num)\\n else:\\n return True\\n return False\",\n \"memory\": \"31900\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n my_set = set()\\n for num in nums:\\n if num in my_set:\\n return True\\n my_set.add(num)\\n\\n return False\",\n \"memory\": \"32000\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashset = set()\\n\\n for i in range(len(nums)):\\n if nums[i] in hashset:\\n return True\\n hashset.add(nums[i])\\n\\n return False\\n\",\n \"memory\": \"32000\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n return len(set(nums)) != len(nums)\",\n \"memory\": \"32100\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n numSet = set()\\n for num in nums:\\n if num in numSet:\\n return True\\n else:\\n numSet.add(num)\\n return False\",\n \"memory\": \"32100\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums.sort()\\n list1 = list(set(nums))\\n list1.sort() \\n print(nums,list1)\\n return nums != list1\\n \\n \\n \",\n \"memory\": \"32200\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n num_set = set(nums)\\n return len(num_set) < len(nums)\",\n \"memory\": \"32299\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n numsSet = set()\\n for i in nums:\\n print(i)\\n if i not in numsSet:\\n numsSet.add(i)\\n else:\\n return True\\n \\n return False\",\n \"memory\": \"32400\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n # seen = set()\\n # for num in nums:\\n # if num in seen:\\n # return True\\n # seen.add(num)\\n # return False\\n\\n seen = {}\\n for num in nums:\\n if num in seen:\\n return True\\n seen[num] = 1\\n return False\",\n \"memory\": \"32500\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n visited = set()\\n while nums:\\n x = nums.pop()\\n if x in visited:\\n return True\\n visited.add(x)\\n return False\",\n \"memory\": \"32600\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = {}\\n for num in nums:\\n if seen.get(num):\\n return True\\n else:\\n seen[num] = True\\n return False\",\n \"memory\": \"32700\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n mapper = {}\\n\\n for num in nums:\\n if num in mapper:\\n return True\\n mapper[num] = 69420\\n return False\",\n \"memory\": \"32800\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n once=set()\\n mult=set()\\n for num in nums:\\n if num in once: mult.add(num)\\n if num not in once: once.add(num) \\n \\n if mult:\\n return True\\n #else:\\n # return True\\n \\n print(once)\\n print(mult)\",\n \"memory\": \"33000\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n visited = set()\\n\\n for num in nums:\\n if num in visited:\\n return True\\n visited |= {num}\\n \\n return False\\n \\n def containsDuplicate2(self, nums: List[int]) -> bool:\\n nums.sort()\\n\\n prev = nums[0]\\n\\n for i in range(1, len(nums)):\\n if nums[i] == prev:\\n return True\\n prev = nums[i]\\n return False\\n\\n\\n\",\n \"memory\": \"33100\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n s = set()\\n for i in nums: \\n if(i in s): \\n return True\\n s.update({i})\\n \\n return False\",\n \"memory\": \"33100\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hm = {}\\n #sl = sorted(nums)\\n for i in nums:\\n hm[i] = hm.get(i, 0) + 1\\n if hm[i] > 1:\\n return True\\n return False\\n \\n # sl = sorted(nums)\\n # for i in range(len(sl)-1):\\n # if sl[i] == sl[i+1]:\\n # return True\\n # return False\",\n \"memory\": \"33200\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n h = {}\\n for i in nums:\\n if i in h:\\n return True\\n h[i] = 1\\n return False\",\n \"memory\": \"33300\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n storage = {}\\n for el in nums:\\n if el in storage:\\n return True\\n else:\\n storage[el] = 1\\n return False\",\n \"memory\": \"33400\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n seen = {}\\n for num in nums:\\n if num in seen and seen[num] >= 1:\\n return True\\n seen[num] = seen.get(num, 0) + 1\\n return False\",\n \"memory\": \"33500\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n bruh = {}\\n for num in nums:\\n try:\\n bruh[num] += 1\\n return True\\n except:\\n bruh[num] = 1\\n return False\\n \",\n \"memory\": \"33600\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n nums_dict = {}\\n\\n for i in range(len(nums)):\\n if nums[i] in nums_dict:\\n return True\\n else:\\n nums_dict[nums[i]] = 1\\n return False\",\n \"memory\": \"33800\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n count = Counter(nums)\\n for k, value in count.items():\\n if value > 1:\\n return True\\n return False\\n \\n \",\n \"memory\": \"33900\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n mapping = Counter(nums)\\n for num in mapping.values():\\n if num>1:\\n return True\\n return False \",\n \"memory\": \"34000\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n hashMap = dict()\\n \\n for n in nums:\\n if n in hashMap:\\n return True\\n else:\\n hashMap[n] = 1\\n \\n return False\",\n \"memory\": \"34100\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n dic = {}\\n for num in nums:\\n if num in dic:\\n return True\\n else:\\n dic[num] = 1\\n return False\\n\",\n \"memory\": \"34100\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n # return len(set(nums)) != len(nums)\\n \\n # math solution\\n\\n # 1 + 2 + 3 + 4 = 10 % 4\\n # [1, 2, 3, 1] -> \\n freq = Counter(nums)\\n if sum(list(freq.values())) != len(freq):\\n return True\\n return False\\n\\n\\n\\n\\n\\n \",\n \"memory\": \"34200\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n \\n counter = defaultdict(int)\\n\\n for num in nums:\\n if counter[num] > 0:\\n return True\\n else:\\n counter[num] += 1\\n \\n return False\",\n \"memory\": \"34300\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: list[int]) -> bool:\\n seen_dict = {}\\n for i in nums:\\n if i in seen_dict:\\n return True\\n else:\\n seen_dict[i] = seen_dict.get(i, 0)\\n return False\\n\\n\\n\\n \",\n \"memory\": \"34300\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n dic = {}\\n for i in nums:\\n if i in dic and dic[i] >=1:\\n return True \\n dic[i] = dic.get(i,0) + 1\\n return False\",\n \"memory\": \"34400\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n d = {}\\n for i in nums:\\n if i not in d:\\n d[i] = 1\\n else:\\n return True\",\n \"memory\": \"34400\"\n },\n {\n \"code\": \"class Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n # add value to hashmap\\n prevNums = {}\\n for num in nums:\\n if num in prevNums.keys():\\n return True\\n else:\\n prevNums[num] = num\\n return False\\n\\n\\n\\n # if value already in hashmap, return True\\n\\n # return False\\n \",\n \"memory\": \"34500\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def containsDuplicate(self, nums: List[int]) -> bool:\\n freqs = Counter()\\n for num in nums:\\n freqs[num] += 1\\n for num in freqs:\\n if freqs[num] > 1:\\n return True\\n return False\",\n \"memory\": \"34500\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":96,"string":"96"}}},{"rowIdx":145,"cells":{"question_id":{"kind":"number","value":218,"string":"218"},"name":{"kind":"string","value":"the-skyline-problem"},"content":{"kind":"string","value":"<p>A city's <strong>skyline</strong> is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Given the locations and heights of all the buildings, return <em>the <strong>skyline</strong> formed by these buildings collectively</em>.</p>\n\n<p>The geometric information of each building is given in the array <code>buildings</code> where <code>buildings[i] = [left<sub>i</sub>, right<sub>i</sub>, height<sub>i</sub>]</code>:</p>\n\n<ul>\n\t<li><code>left<sub>i</sub></code> is the x coordinate of the left edge of the <code>i<sup>th</sup></code> building.</li>\n\t<li><code>right<sub>i</sub></code> is the x coordinate of the right edge of the <code>i<sup>th</sup></code> building.</li>\n\t<li><code>height<sub>i</sub></code> is the height of the <code>i<sup>th</sup></code> building.</li>\n</ul>\n\n<p>You may assume all buildings are perfect rectangles grounded on an absolutely flat surface at height <code>0</code>.</p>\n\n<p>The <strong>skyline</strong> should be represented as a list of "key points" <strong>sorted by their x-coordinate</strong> in the form <code>[[x<sub>1</sub>,y<sub>1</sub>],[x<sub>2</sub>,y<sub>2</sub>],...]</code>. Each key point is the left endpoint of some horizontal segment in the skyline except the last point in the list, which always has a y-coordinate <code>0</code> and is used to mark the skyline's termination where the rightmost building ends. Any ground between the leftmost and rightmost buildings should be part of the skyline's contour.</p>\n\n<p><b>Note:</b> There must be no consecutive horizontal lines of equal height in the output skyline. For instance, <code>[...,[2 3],[4 5],[7 5],[11 5],[12 7],...]</code> is not acceptable; the three lines of height 5 should be merged into one in the final output as such: <code>[...,[2 3],[4 5],[12 7],...]</code></p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/12/01/merged.jpg\" style=\"width: 800px; height: 331px;\" />\n<pre>\n<strong>Input:</strong> buildings = [[2,9,10],[3,7,15],[5,12,12],[15,20,10],[19,24,8]]\n<strong>Output:</strong> [[2,10],[3,15],[7,12],[12,0],[15,10],[20,8],[24,0]]\n<strong>Explanation:</strong>\nFigure A shows the buildings of the input.\nFigure B shows the skyline formed by those buildings. The red points in figure B represent the key points in the output list.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> buildings = [[0,2,3],[2,5,3]]\n<strong>Output:</strong> [[0,3],[5,0]]\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= buildings.length <= 10<sup>4</sup></code></li>\n\t<li><code>0 <= left<sub>i</sub> < right<sub>i</sub> <= 2<sup>31</sup> - 1</code></li>\n\t<li><code>1 <= height<sub>i</sub> <= 2<sup>31</sup> - 1</code></li>\n\t<li><code>buildings</code> is sorted by <code>left<sub>i</sub></code> in non-decreasing order.</li>\n</ul>\n"},"acRate":{"kind":"number","value":43.058070529570564,"string":"43.058071"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["array","divide-and-conquer","binary-indexed-tree","segment-tree","line-sweep","heap-priority-queue","ordered-set"],"string":"[\n \"array\",\n \"divide-and-conquer\",\n \"binary-indexed-tree\",\n \"segment-tree\",\n \"line-sweep\",\n \"heap-priority-queue\",\n \"ordered-set\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"105\", 76.8974], [\"161\", 1.8645999999999998], [\"217\", 0.4662], [\"274\", 0.7326], [\"330\", 0.1332], [\"386\", 0.1332], [\"443\", 0.19980000000000003], [\"499\", 0.5328], [\"555\", 0.333], [\"612\", 0.1332], [\"668\", 0.0666], [\"725\", 0.0666], [\"781\", 0.1332], [\"837\", 0.1332], [\"894\", 0.19980000000000003], [\"950\", 0.1332], [\"1006\", 0.2664], [\"1063\", 0.0666], [\"1119\", 0.19980000000000003], [\"1175\", 0.8658], [\"1232\", 0.2664], [\"1288\", 1.3984], [\"1344\", 4.062100000000003], [\"1401\", 0.666], [\"1457\", 0.2664], [\"1513\", 0.0666], [\"1570\", 0.0666], [\"1626\", 0.0666], [\"1682\", 0.1332], [\"1739\", 0.0666], [\"1795\", 0.0666], [\"1852\", 0.0666], [\"1908\", 0.0666], [\"1964\", 0.0666], [\"2021\", 0.0666], [\"2077\", 0.0666], [\"2133\", 0.0666], [\"2190\", 0.0666], [\"2246\", 0.0666], [\"2302\", 0.0666], [\"2359\", 0.0666], [\"2415\", 0.0666], [\"2471\", 0.0666], [\"2528\", 0.0666], [\"2584\", 0.0666], [\"2640\", 0.0666], [\"2697\", 0.0666], [\"2753\", 0.0666], [\"2809\", 0.0666], [\"2866\", 0.1332], [\"2922\", 0.0666], [\"2979\", 0.0666], [\"3035\", 0.0666], [\"3091\", 0.1332], [\"3148\", 0.0666], [\"3204\", 0.0666], [\"3260\", 0.0666], [\"3317\", 0.1332], [\"3373\", 0.0666], [\"3429\", 0.0666], [\"3486\", 0.0666], [\"3542\", 0.0666], [\"3598\", 0.0666], [\"3655\", 0.0666], [\"3711\", 0.1332], [\"3767\", 0.0666], [\"3824\", 0.1332], [\"3880\", 0.1332], [\"3936\", 0.1332], [\"3993\", 0.0666], [\"4049\", 0.0666], [\"4106\", 0.0666], [\"4162\", 0.0666], [\"4218\", 0.1332], [\"4275\", 0.0666], [\"4331\", 0.0666], [\"4387\", 0.19980000000000003], [\"4444\", 0.39960000000000007], [\"4500\", 0.1332]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"21000\", 0.0666], [\"21100\", 0.0666], [\"21200\", 0.1997], [\"21300\", 3.2623], [\"21400\", 5.6591], [\"21500\", 1.6644], [\"21600\", 2.6631], [\"21700\", 7.5233], [\"21800\", 10.3196], [\"21900\", 9.3209], [\"22000\", 8.2557], [\"22100\", 6.2583], [\"22200\", 3.2623], [\"22300\", 2.7963], [\"22400\", 2.3968], [\"22500\", 5.7257], [\"22600\", 4.261], [\"22700\", 3.5286], [\"22800\", 2.6631], [\"22900\", 2.9294], [\"23000\", 3.0626], [\"23100\", 2.8628], [\"23200\", 1.9973], [\"23300\", 2.1305], [\"23400\", 1.5979]]}"},"rt_list":{"kind":"list like","value":[{"code":"from typing import List\nfrom bisect import bisect_left, bisect_right\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # If there are no buildings, return an empty list\n if len(buildings) == 0:\n return []\n \n # Sort buildings by height in descending order\n buildings.sort(key=lambda v: v[2])\n \n # `pos` will store the x-coordinates (both start and end) of buildings\n # `height` will store the heights corresponding to those x-coordinates\n pos, height = [0], [0]\n \n for left, right, h in buildings:\n # Find the index to insert `left` (start of the building)\n i = bisect_left(pos, left)\n # Find the index to insert `right` (end of the building)\n j = bisect_right(pos, right)\n \n # Update the heights in the range [i, j) to the new building's height\n height[i:j] = [h, height[j-1]] # height[j-1] keeps the height after the end of this building\n # Update the positions in the range [i, j) to the new building's x-coordinates\n pos[i:j] = [left, right]\n \n # `res` will store the final result of key points for the skyline\n res = []\n prev = 0 # Previous height, initialized to 0\n \n # Iterate through the positions and heights to construct the skyline\n for v, h in zip(pos, height):\n if h != prev: # Add a new key point only if the height changes\n res.append([v, h])\n prev = h\n \n return res\n\n# Time Complexity: O(N log N), where N is the number of buildings. Sorting takes O(N log N),\n# and bisect operations for each building take O(log N) which is done for each building.\n\n# Space Complexity: O(N), where N is the number of buildings. Space is used for storing\n# positions, heights, and the result.\n","runtime":"105"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n if len(buildings) == 0: \n return []\n \n buildings.sort(key=lambda v: v[2])\n pos, height = [0], [0]\n for left, right, h in buildings: \n i = bisect_left(pos, left)\n j = bisect_right(pos, right)\n height[i:j] = [h, height[j-1]]\n pos[i:j] = [left, right]\n print(height, pos)\n res = []\n prev = 0\n for v, h in zip(pos, height): \n if h != prev:\n res.append([v,h]) \n prev = h\n \n return res","runtime":"105"},{"code":"from queue import PriorityQueue\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n skys, lines, pq = [], [], PriorityQueue()\n for build in buildings:\n lines.extend([build[0], build[1]])\n lines.sort()\n city, n = 0, len(buildings)\n for line in lines:\n while city < n and buildings[city][0] <= line:\n pq.put([-buildings[city][2], buildings[city][0], buildings[city][1]])\n city += 1\n while not pq.empty() and pq.queue[0][2] <= line:\n pq.get()\n high = 0\n if not pq.empty():\n high = -pq.queue[0][0]\n if len(skys) > 0 and skys[-1][1] == high:\n continue\n skys.append([line, high])\n return skys\n # T: O(n) S: O(1)","runtime":"161"},{"code":"from sortedcontainers import SortedDict\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # (left, right, height)\n # (left, height), (right, height)\n h = []\n for left, right, height in buildings:\n h.append((left, 0, -height)) # left will go in front\n h.append((right, 1, height))\n \n h.sort()\n\n return_value = []\n current = SortedDict()\n current_height = None\n for x, leftright, height in h:\n if leftright == 0:\n height = -height\n # start, add to list\n if height not in current:\n current[height] = 1\n else:\n current[height] += 1\n else:\n # end, remove\n current[height] -= 1\n if current[height] == 0:\n del current[height]\n newHeight = current.keys()[-1] if current else None\n if newHeight != current_height:\n return_value.append((x, 0 if newHeight is None else newHeight))\n current_height = newHeight\n \n return return_value\n","runtime":"161"},{"code":"class SegTree:\n def __init__(self, n):\n self.tree = [0]*(4*n)\n \n def update(self, n, L, R, l, r, v):\n if l==L and r==R:\n self.tree[n] = max(self.tree[n], v)\n else:\n M = (L+R)>>1\n if M >= r:\n self.update(n*2+1, L, M, l, r, v)\n elif M < l:\n self.update(n*2+2, M+1, R, l, r, v)\n else:\n self.update(n*2+1, L, M, l, M, v)\n self.update(n*2+2, M+1, R, M+1, r, v)\n\n def query(self, n, L, R, P):\n if L== R: return self.tree[n]\n M = (L+R) >> 1\n res = self.query(n*2+1, L, M, P) if P <= M else self.query(n*2+2, M+1, R, P)\n return max(res, self.tree[n])\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n xs = []\n for start, end, height in buildings:\n xs.append(start)\n xs.append(end)\n\n xs.sort()\n x2idx = {x:idx for idx, x in enumerate(xs)}\n n = len(xs)\n sg = SegTree(n)\n for start, end, height in buildings:\n sg.update(0, 0, n, x2idx[start], x2idx[end]-1, height)\n res = []\n curr = prev = 0\n for i in range(n):\n curr = sg.query(0, 0, n, i)\n if curr == prev: continue\n res.append([xs[i], curr])\n prev = curr\n return res","runtime":"217"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n \n res = []\n\n events = []\n for i in range(0, len(buildings)):\n building = buildings[i]\n left = (building[0], building[2])\n right = (building[1], building[2]) \n events.append(('left', left, i))\n events.append(('right', right, i))\n \n # sort by y coord (bigger first)\n events = sorted(events, key=lambda x: x[1], reverse=True)\n # right before left\n events = sorted(events, key=lambda x: x[0], reverse=False)\n # sort by x coord\n events = sorted(events, key=lambda x: x[1][0])\n active_buildings = set()\n\n\n ignore = set()\n for event in events:\n side = event[0]\n # print(side)\n x, y = event[1]\n b_idx = event[2]\n\n if side == 'left':\n # print('left-------')\n # print(buildings[b_idx])\n active_buildings.add(b_idx)\n if len(res) == 0:\n res.append([x,y])\n elif y > res[-1][1]:\n res.append([x, y])\n elif side == 'right':\n active_buildings.remove(b_idx)\n if b_idx not in ignore:\n # print('right-------')\n # print(buildings[b_idx])\n # for j in active_buildings:\n # print(f\" {buildings[j]}\")\n y_val = 0\n to_remove = []\n for j in active_buildings:\n # don't apply this if it's a right coord of an active building\n if buildings[j][1] > x:\n y_val = max(y_val, buildings[j][2])\n else:\n to_remove.append(j)\n for j in to_remove:\n ignore.add(j)\n # if this building is short than others, don't add a point\n if y > y_val:\n res.append([x, y_val])\n return res\n\n","runtime":"217"},{"code":"import bisect\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # if you are good enough, you can do it in reverse\n buildings.sort(key=lambda x: x[2], reverse=True)\n skyline = [[float(\"inf\"), 0]]\n for l, r, h in buildings:\n i = bisect.bisect_right(skyline, l, key=lambda x: x[0])\n j = bisect.bisect_right(skyline, r, key=lambda x: x[0])\n # check right point\n edits = []\n right_on_line = False\n if j-1 >= 0:\n # check if right point is interior\n if skyline[j-1][0] == r: \n if skyline[j-1][1] == h:\n # because of in-place sorting and original list is sorted by left points\n continue\n right_on_line = True\n k = j\n while k-1 >= 0:\n if skyline[k-1][0] > l and skyline[k-1][1] == 0:\n edits.append([k-1, h])\n break\n k -=1\n \n inserts = []\n deletes = set()\n if skyline[j][1] == 0 and (not right_on_line):\n # exterior right point\n inserts.append([j, [r, h]])\n if j-1 >= 0 and skyline[j-1][1] == h and skyline[j-1][0] >= l:\n deletes.add(j-1)\n \n # now right point is done, check left point\n if i-1 >= 0 and skyline[i-1][0] == l and skyline[i-1][1] == h and inserts:\n deletes.add(i-1)\n \n elif skyline[i][1] == h and inserts:\n deletes.add(i)\n\n elif (not (i-1 >= 0 and skyline[i-1][0] == l)) and skyline[i][1] == 0:\n # exterior left point\n if i != j:\n edits.append([i, h])\n inserts.append([i, [l, 0]])\n \n # apply changes (update, insert, delete)\n for idx, h in edits:\n skyline[idx][1] = h\n\n for idx, v in inserts:\n skyline.insert(idx, v)\n \n for idx in deletes:\n skyline.pop(idx)\n\n ans = []\n for i in range(len(skyline)-1):\n x, h = skyline[i][0], skyline[i+1][1]\n ans.append([x, h])\n \n return ans\n","runtime":"274"},{"code":"import bisect\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # if you are good enough, you can do it in reverse\n buildings.sort(key=lambda x: x[2], reverse=True)\n skyline = [[float(\"inf\"), 0]]\n for l, r, h in buildings:\n i = bisect.bisect_right(skyline, l, key=lambda x: x[0])\n j = bisect.bisect_right(skyline, r, key=lambda x: x[0])\n # check right point\n edits = []\n right_on_line = False\n if j-1 >= 0:\n # check if right point is interior\n if skyline[j-1][0] == r: \n if skyline[j-1][1] == h:\n # because of in-place sorting and original list is sorted by left points\n continue\n right_on_line = True\n k = j\n while k-1 >= 0:\n if skyline[k-1][0] > l and skyline[k-1][1] == 0:\n edits.append([k-1, h])\n break\n k -=1\n \n inserts = []\n deletes = set()\n if skyline[j][1] == 0 and (not right_on_line):\n # exterior right point\n inserts.append([j, [r, h]])\n if j-1 >= 0 and skyline[j-1][1] == h and skyline[j-1][0] >= l:\n deletes.add(j-1)\n \n # now right point is done, check left point\n if i-1 >= 0 and skyline[i-1][0] == l and skyline[i-1][1] == h and inserts:\n deletes.add(i-1)\n \n elif skyline[i][1] == h and inserts:\n deletes.add(i)\n\n elif (not (i-1 >= 0 and skyline[i-1][0] == l)) and skyline[i][1] == 0:\n # exterior left point\n if i != j:\n edits.append([i, h])\n inserts.append([i, [l, 0]])\n \n # apply changes (update, insert, delete)\n for idx, h in edits:\n skyline[idx][1] = h\n\n for idx, v in inserts:\n skyline.insert(idx, v)\n \n for idx in deletes:\n skyline.pop(idx)\n\n ans = []\n for i in range(len(skyline)-1):\n x, h = skyline[i][0], skyline[i+1][1]\n ans.append([x, h])\n \n return ans\n","runtime":"274"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n res = []\n h = [0]\n corners = []\n for b in buildings:\n corners.append([b[0],\"l\",b[2]]) \n corners.append([b[1],\"r\",b[2]]) \n \n corners.sort(key=lambda x: (x[0], x[1]))\n for c in corners:\n temp = h[0]\n if c[1] == \"l\":\n h.append(c[2])\n h.sort(reverse = True)\n elif c[1] == \"r\":\n h.remove(c[2])\n\n if h[0] != temp:\n res.append([c[0],h[0]]) \n f_res = [] \n for i in range(0,len(res)-1):\n if res[i][0] != res[i+1][0]:\n f_res.append(res[i])\n f_res.append(res[-1])\n \n return f_res\n ","runtime":"330"},{"code":"from sortedcontainers import SortedSet #necessary import for LeetCode\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n ans = []\n d = defaultdict(int)\n s = SortedSet()\n for i, x in enumerate(buildings):\n a, b, c = x\n a0, b0, c0 = buildings[i-1] if i != 0 else (-1, -1, -1)\n if not (a >= a0 and b <= b0 and c <= c0):\n s.add(a)\n s.add(b)\n for x in buildings:\n a, b, c = x\n for i in s:\n if i >= a:\n if i >= b:\n break\n d[i] = max(d[i], c)\n for i in s:\n j = d[i]\n if not ans or j != ans[-1][1]:\n ans.append([i, j])\n return ans","runtime":"330"},{"code":"from sortedcontainers import SortedSet #necessary import for LeetCode\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n res = []\n d = defaultdict(int)\n s = SortedSet()\n for i, x in enumerate(buildings):\n a, b, c = x\n a0, b0, c0 = buildings[i-1] if i != 0 else (-1, -1, -1)\n if not (a >= a0 and b <= b0 and c <= c0):\n s.add(a)\n s.add(b)\n for x in buildings:\n a, b, c = x\n for i in s:\n if i >= a:\n if i >= b:\n break\n # if i in range(a, b):\n d[i] = max(d[i], c)\n for i in s:\n j = d[i]\n if not res or j != res[-1][1]:\n res.append([i, j])\n return res","runtime":"386"},{"code":"import bisect\nfrom collections import defaultdict\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n points = defaultdict(list)\n for s, e, h in buildings:\n points[s].append(['s', h])\n points[e].append(['e', h])\n \n out = []\n curr = -1\n track = [0]\n k = list(points.keys())\n k.sort()\n for x in k:\n for c, h in points[x]:\n if c == 'e':\n track.remove(h)\n else:\n idx = bisect.bisect(track, h)\n track.insert(idx, h)\n if curr != track[-1]:\n curr = track[-1]\n out.append([x,track[-1]])\n return out\n","runtime":"386"},{"code":"import bisect\nfrom collections import defaultdict\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n points = defaultdict(list)\n for s, e, h in buildings:\n points[s].append(['s', h])\n points[e].append(['e', h])\n \n out = []\n curr = -1\n track = [0]\n k = list(points.keys())\n k.sort()\n for x in k:\n for c, h in points[x]:\n if c == 'e':\n track.remove(h)\n else:\n bisect.insort_left(track, h)\n # track.insert(idx, h)\n if curr != track[-1]:\n curr = track[-1]\n out.append([x,track[-1]])\n return out\n","runtime":"443"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n def decompose(deq): \n secondary = []\n for i, el in enumerate(deq):\n secondary.append((el[0],i,el[2]))\n secondary.append((el[1],i,el[2]))\n secondary = sorted(secondary)\n fills = set()\n out = []\n for i in range(len(secondary)-1):\n el1 = secondary[i]\n el2 = secondary[i+1]\n if el1[1] in fills:\n fills.remove(el1[1])\n else:\n fills.add(el1[1])\n if el1[0] == el2[0]:\n continue\n H = 0\n for ind in fills:\n H = max(H, deq[ind][2])\n out.append([el1[0], el2[0], H])\n # fuse\n for j in range(len(out)-1, 0, -1):\n if out[j][2] == out[j-1][2]:\n out[j-1][1] = out[j][1]\n out.pop(j)\n return out\n\n cond = True\n buildings = deque(buildings)\n while cond:\n cond = False\n buildings_n = []\n while len(buildings) > 1: \n b = buildings.popleft()\n to_decompose = [b]\n n_build = [b]\n lim = b[1]\n while buildings and buildings[0][0] < lim:\n if buildings[0][1] <= b[1] and buildings[0][2] <= b[2]:\n buildings.popleft()\n continue\n #elif buildings[0][0] == b[0] and buildings[0][1] >= b[1] and buildings[0][2] >= b[2]:\n # to_decompose.pop()\n cond = True\n b = buildings.popleft()\n to_decompose.append(b) \n if len(to_decompose) > 1:\n n_build = decompose(to_decompose) \n else:\n n_build = to_decompose \n buildings_n = buildings_n + n_build\n if buildings:\n b = buildings.popleft()\n buildings_n.append(b)\n buildings = deque(buildings_n)\n # represent for output\n res = []\n l = len(buildings)\n for i in range(l):\n build = buildings[i]\n res.append([build[0], build[2]])\n if i>0 and build[0] == buildings[i-1][1] and build[2] == buildings[i-1][2]:\n res.pop()\n elif i<l-1 and build[1] < buildings[i+1][0]:\n res.append([build[1],0])\n res.append([build[1],0])\n return res\n ","runtime":"443"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n def decompose(deq): \n secondary = []\n for i, el in enumerate(deq):\n secondary.append((el[0],i,el[2]))\n secondary.append((el[1],i,el[2]))\n secondary = sorted(secondary)\n fills = set()\n out = []\n for i in range(len(secondary)-1):\n el1 = secondary[i]\n el2 = secondary[i+1]\n if el1[1] in fills:\n fills.remove(el1[1])\n else:\n fills.add(el1[1])\n if el1[0] == el2[0]:\n continue\n H = 0\n for ind in fills:\n H = max(H, deq[ind][2])\n out.append([el1[0], el2[0], H])\n # fuse\n for j in range(len(out)-1, 0, -1):\n if out[j][2] == out[j-1][2]:\n out[j-1][1] = out[j][1]\n out.pop(j)\n return out\n\n cond = True\n buildings = deque(buildings)\n while cond:\n cond = False\n buildings_n = []\n while len(buildings) > 1: \n b = buildings.popleft()\n to_decompose = [b]\n n_build = [b]\n lim = b[1]\n while buildings and buildings[0][0] < lim:\n if buildings[0][1] <= b[1] and buildings[0][2] <= b[2]:\n buildings.popleft()\n continue\n #elif buildings[0][0] == b[0] and buildings[0][1] >= b[1] and buildings[0][2] >= b[2]:\n # to_decompose.pop()\n cond = True\n b = buildings.popleft()\n to_decompose.append(b) \n if len(to_decompose) > 1:\n n_build = decompose(to_decompose) \n else:\n n_build = to_decompose \n buildings_n = buildings_n + n_build\n if buildings:\n b = buildings.popleft()\n buildings_n.append(b)\n buildings = deque(buildings_n)\n # represent for output\n res = []\n l = len(buildings)\n for i in range(l):\n build = buildings[i]\n res.append([build[0], build[2]])\n if i>0 and build[0] == buildings[i-1][1] and build[2] == buildings[i-1][2]:\n res.pop()\n elif i<l-1 and build[1] < buildings[i+1][0]:\n res.append([build[1],0])\n res.append([build[1],0])\n return res\n ","runtime":"499"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n def decompose(deq): \n secondary = []\n for i, el in enumerate(deq):\n secondary.append((el[0],i,el[2]))\n secondary.append((el[1],i,el[2]))\n secondary = sorted(secondary)\n fills = set()\n out = []\n for i in range(len(secondary)-1):\n el1 = secondary[i]\n el2 = secondary[i+1]\n if el1[1] in fills:\n fills.remove(el1[1])\n else:\n fills.add(el1[1])\n if el1[0] == el2[0]:\n continue\n H = 0\n for ind in fills:\n H = max(H, deq[ind][2])\n out.append([el1[0], el2[0], H])\n # fuse\n for j in range(len(out)-1, 0, -1):\n if out[j][2] == out[j-1][2]:\n out[j-1][1] = out[j][1]\n out.pop(j)\n return out\n\n cond = True\n buildings = deque(buildings)\n while cond:\n cond = False\n buildings_n = []\n while len(buildings) > 1: \n b = buildings.popleft()\n to_decompose = [b]\n n_build = [b]\n lim = b[1]\n while buildings and buildings[0][0] < lim:\n if buildings[0][1] <= b[1] and buildings[0][2] <= b[2]:\n buildings.popleft()\n continue\n elif buildings[0][0] == b[0] and buildings[0][1] >= b[1] and buildings[0][2] >= b[2]:\n to_decompose.pop()\n cond = True\n b = buildings.popleft()\n to_decompose.append(b) \n if len(to_decompose) > 1:\n n_build = decompose(to_decompose) \n else:\n n_build = to_decompose \n buildings_n = buildings_n + n_build\n if buildings:\n b = buildings.popleft()\n buildings_n.append(b)\n buildings = deque(buildings_n)\n # represent for output\n res = []\n l = len(buildings)\n for i in range(l):\n build = buildings[i]\n res.append([build[0], build[2]])\n if i>0 and build[0] == buildings[i-1][1] and build[2] == buildings[i-1][2]:\n res.pop()\n elif i<l-1 and build[1] < buildings[i+1][0]:\n res.append([build[1],0])\n res.append([build[1],0])\n return res\n ","runtime":"499"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n points = defaultdict(list)\n for [l,r,h] in buildings:\n points[l].append(h)\n points[r].append(-h)\n height = 0\n res = []\n freqs = {}\n for x in sorted(points.keys()):\n for h in points[x]:\n if h<0: \n freqs[-h] -= 1\n if freqs[-h]==0: del freqs[-h]\n else: \n freqs[h] = 1 + freqs.get(h,0)\n new_height = 0 if len(freqs)==0 else max(freqs.keys())\n if new_height!=height:\n height = new_height\n res.append([x,height])\n return res\n\n ","runtime":"555"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n points = defaultdict(list)\n for [l,r,h] in buildings:\n points[l].append(h)\n points[r].append(-h)\n height = 0\n res = []\n freqs = {}\n for x in sorted(points.keys()):\n for h in points[x]:\n if h<0: \n freqs[-h] -= 1\n if freqs[-h]==0: del freqs[-h]\n else: \n freqs[h] = 1 + freqs.get(h,0)\n new_height = 0 if len(freqs)==0 else max(freqs.keys())\n if new_height!=height:\n height = new_height\n res.append([x,height])\n return res\n\n ","runtime":"555"},{"code":"from typing import List\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n events = []\n for L, R, H in buildings:\n events.append((L, -H, R)) \n events.append((R, 0, 0)) \n \n events.sort() \n \n skyline = []\n active = [(0, float('inf'))]\n \n for x, h, R in events:\n while active and active[-1][1] <= x:\n active.pop()\n \n if h < 0: \n active.append((-h, R))\n \n active.sort()\n \n if not skyline or skyline[-1][1] != active[-1][0]:\n skyline.append([x, active[-1][0]])\n \n return skyline","runtime":"612"},{"code":"from sortedcontainers import SortedSet as SS\nfrom sortedcontainers import SortedDict as SD\nclass Solution:\n def getSkyline(self, B: List[List[int]]) -> List[List[int]]:\n C = []\n for l,r,h in B:\n C.append((l,1,h))\n C.append((r,-1,h))\n C.sort()\n\n print(*C, sep=\"\\n\")\n\n S,H = [],[]\n for c,f,h in C:\n if f == 1:\n heappush(H,-h)\n if len(S) == 0 or -H[0] > S[-1][1]:\n if len(S) > 0 and S[-1][0] == c:\n if len(S) > 1 and S[-2][1] == -H[0]:\n S.pop()\n else:\n S[-1][1] = -H[0]\n else:\n S.append([c,-H[0]])\n else:\n H.remove(-h)\n H.sort()\n if len(H) == 0:\n S.append([c,0])\n else:\n if S[-1][1] > -H[0]:\n S.append([c,-H[0]])\n return S","runtime":"612"},{"code":"from sortedcontainers import SortedSet #necessary import for LeetCode\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n res = []\n d = defaultdict(int)\n s = SortedSet()\n for i, x in enumerate(buildings):\n a, b, c = x\n a0, b0, c0 = buildings[i-1] if i != 0 else (-1, -1, -1)\n if not (a >= a0 and b <= b0 and c <= c0):\n s.add(a)\n s.add(b)\n for x in buildings:\n a, b, c = x\n for i in s:\n # if i >= a:\n # if i >= b:\n # break\n if i in range(a, b):\n d[i] = max(d[i], c)\n if i >= b:\n break\n for i in s:\n j = d[i]\n if not res or j != res[-1][1]:\n res.append([i, j])\n return res","runtime":"668"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n\n # Get the corners of the buildings\n left = [[building[0],-1,building[2]] for building in buildings]\n right = [[building[1],building[2],-1] for building in buildings]\n left = sorted(left, key = lambda x: (x[0], x[2]))\n right = sorted(right, key = lambda x: (x[0], -x[1]))\n corners = left + right\n corners = sorted(corners, key = lambda x: x[0])\n\n # Set parameters\n prev = []\n height = 0\n result = []\n\n # Loop\n for i, point in enumerate(corners):\n # Check which corner it is\n if point[1] == -1:\n if point[2] > height:\n prev.append(height)\n height = point[2]\n if i == 0 or point[0] != result[-1][0]:\n result.append([point[0], point[2]])\n else:\n result[-1][1] = point[2]\n elif point[2] <= height:\n prev.append(point[2])\n else:\n if point[1] == height:\n if point[1] in prev:\n prev.remove(point[1])\n else:\n height = max(prev)\n prev.remove(height)\n if point[0] != result[-1][0]:\n result.append([point[0], height])\n else:\n result[-1][1] = height\n elif point[1] < height:\n prev.remove(point[1])\n \n return result","runtime":"725"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n ans = []\n d = defaultdict(int)\n s = set()\n for i, x in enumerate(buildings):\n a, b, c = x\n a0, b0, c0 = buildings[i-1] if i != 0 else (-1, -1, -1)\n if not (a >= a0 and b <= b0 and c <= c0):\n s.add(a)\n s.add(b)\n for x in buildings:\n a, b, c = x\n for i in s:\n if i in range(a, b):\n d[i] = max(d[i], c)\n for i in sorted(list(s)):\n j = d[i]\n if not ans or j != ans[-1][1]:\n ans.append([i, j])\n return ans","runtime":"781"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # add all the operation as (x, y, add) or (x, h, remove) and sort by x\n ops = []\n for x1, x2, y in buildings:\n ops.append((x1, y, \"add\"))\n ops.append((x2, y, \"del\"))\n ops.sort()\n print(ops)\n bds = []\n curr = 0\n keypoints = []\n for x, y, op in ops:\n if op == \"add\":\n bds.append(y)\n curr_next = max(bds)\n if curr != curr_next:\n # check if a keypoint has been added already at the same x\n if keypoints and keypoints[-1][0] == x:\n keypoints.pop()\n keypoints.append([x, curr_next])\n curr = curr_next\n else:\n bds.remove(y)\n if curr == y:\n if bds:\n curr_next = max(bds)\n else:\n curr_next = 0\n if curr != curr_next:\n if keypoints and keypoints[-1][0] == x:\n keypoints.pop()\n keypoints.append([x, curr_next])\n curr = curr_next\n return keypoints","runtime":"781"},{"code":"from sortedcontainers import SortedSet #necessary import for LeetCode\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n res = []\n d = defaultdict(int)\n s = SortedSet()\n for i, x in enumerate(buildings):\n a, b, c = x\n a0, b0, c0 = buildings[i-1] if i != 0 else (-1, -1, -1)\n if not (a >= a0 and b <= b0 and c <= c0):\n s.add(a)\n s.add(b)\n for x in buildings:\n a, b, c = x\n for i in s:\n # if i >= a:\n # if i >= b:\n # break\n if i in range(a, b):\n d[i] = max(d[i], c)\n for i in s:\n j = d[i]\n if not res or j != res[-1][1]:\n res.append([i, j])\n return res","runtime":"837"},{"code":"class Solution:\n def getSkyline(self, build: List[List[int]]) -> List[List[int]]:\n\n book = defaultdict(list)\n for l, r, h in build:\n book[l].append(h)\n book[r].append(-h)\n\n curr, sky = [0], []\n for x in sorted(book.keys()):\n prev = max(curr)\n for val in book[x]:\n if val > 0:\n curr.append(val)\n else:\n curr.remove(-val)\n now = max(curr)\n if prev != now:\n sky.append([x, now])\n\n return sky\n ","runtime":"837"},{"code":"from queue import PriorityQueue\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # only the left and right of a building can affect the skyline\n events = [] # [x, change in y]\n for l, r, h in buildings:\n events.append([l, h])\n events.append([r, -h])\n events.sort(key=lambda pair: (pair[0], pair[1]))\n\n x_maxheight = collections.defaultdict(int)\n active_heights = [0]\n for x, dy in events:\n if dy > 0:\n active_heights.append(dy)\n else:\n active_heights.remove(-dy)\n x_maxheight[x] = max(active_heights)\n x_maxheight_list = [[key, value] for key, value in x_maxheight.items()]\n \n res = []\n n = len(x_maxheight_list)\n for i in range(n):\n if res and x_maxheight_list[i][1] == res[-1][1]:\n continue\n else:\n res.append(x_maxheight_list[i])\n return res\n\n\n\n\n\n\n ","runtime":"894"},{"code":"class Solution:\n def query(self, start, end, q_start, q_end):\n if (start, end) not in self.lazy:\n self.lazy[(start, end)] = -1\n if (start, end) not in self.segment_tree:\n self.segment_tree[(start, end)] = 0\n mid = start + (end - start)//2\n if self.lazy[(start, end)] != -1:\n if start <= mid:\n if (start, mid) not in self.lazy:\n self.lazy[(start, mid)] = -1\n if (start, mid) not in self.segment_tree:\n self.segment_tree[(start, mid)] = 0\n self.lazy[(start, mid)] = max(self.lazy[(start, end)], self.lazy[(start, mid)])\n if mid + 1 <= end:\n if (mid+1, end) not in self.lazy:\n self.lazy[(mid + 1, end)] = -1\n if (mid + 1, end) not in self.segment_tree:\n self.segment_tree[(mid + 1, end)] = 0\n self.lazy[(mid+1, end)] = max(self.lazy[(start, end)], self.lazy[(mid+1, end)])\n self.segment_tree[(start, end)] = max(self.segment_tree[(start, end)], self.lazy[(start, end)])\n self.lazy[(start, end)] = -1\n\n if q_start <= start and end <= q_end: \n return self.segment_tree[(start, end)]\n\n if q_end < start or q_start > end:\n return -1\n # continue\n else:\n if start <= mid:\n a = self.query(start, mid, q_start, q_end)\n if mid + 1 <= end:\n b = self.query(mid+1, end, q_start, q_end)\n # self.segment_tree[(start, end)] = max(a, b)\n # return self.segment_tree[(start, end)]\n return max(a, b)\n\n\n\n\n\n def update(self, start, end, q_start, q_end, val):\n if (start, end) not in self.lazy:\n self.lazy[(start, end)] = -1\n if (start, end) not in self.segment_tree:\n self.segment_tree[(start, end)] = 0\n mid = start + (end - start)//2\n if self.lazy[(start, end)] != -1:\n if start <= mid:\n if (start, mid) not in self.lazy:\n self.lazy[(start, mid)] = -1\n if (start, mid) not in self.segment_tree:\n self.segment_tree[(start, mid)] = 0\n self.lazy[(start, mid)] = max(self.lazy[(start, end)], self.lazy[(start, mid)])\n if mid + 1 <= end:\n if (mid+1, end) not in self.lazy:\n self.lazy[(mid + 1, end)] = -1\n if (mid + 1, end) not in self.segment_tree:\n self.segment_tree[(mid + 1, end)] = 0\n self.lazy[(mid+1, end)] = max(self.lazy[(start, end)], self.lazy[(mid+1, end)])\n self.segment_tree[(start, end)] = max(self.segment_tree[(start, end)], self.lazy[(start, end)])\n self.lazy[(start, end)] = -1\n\n if q_start <= start and end <= q_end: \n self.lazy[(start, end)] = max(self.lazy[(start, end)], val)\n self.segment_tree[(start, end)] = max(self.segment_tree[(start, end)], self.lazy[(start, end)])\n\n if start <= mid:\n if (start, mid) not in self.lazy:\n self.lazy[(start, mid)] = -1\n if (start, mid) not in self.segment_tree:\n self.segment_tree[(start, mid)] = 0\n self.lazy[(start, mid)] = max(self.lazy[(start, end)], self.lazy[(start, mid)])\n if mid + 1 <= end: \n if (mid+1, end) not in self.lazy:\n self.lazy[(mid + 1, end)] = -1\n if (mid + 1, end) not in self.segment_tree:\n self.segment_tree[(mid + 1, end)] = 0\n self.lazy[(mid+1, end)] = max(self.lazy[(start, end)], self.lazy[(mid+1, end)])\n self.lazy[(start, end)] = -1\n return self.segment_tree[(start, end)]\n\n # completely inside the query interval\n\n if q_end < start or q_start > end:\n return -1\n # continue\n else:\n if start <= mid:\n a = self.update(start, mid, q_start, q_end, val)\n if mid + 1 <= end: \n b = self.update(mid+1, end, q_start, q_end, val)\n self.segment_tree[(start, end)] = max(a, b)\n return self.segment_tree[(start, end)]\n def build(self, start, end):\n self.lazy[(start, end)] = -1\n if start == end:\n if (start, end) not in self.segment_tree:\n self.segment_tree[(start, end)] = 0\n return 0\n else:\n mid = start + (end - start)//2\n a = self.build(start, mid)\n if mid + 1 <= end:\n b = self.build(mid + 1, end)\n self.segment_tree[(start, end)] = max(a, b)\n return self.segment_tree[(start, end)]\n\n return self.self.segment_tree[(start, end)]\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n self.segment_tree = dict()\n self.lazy = dict()\n points = set()\n for i in range(0, len(buildings)):\n points.add(buildings[i][0])\n points.add(buildings[i][1])\n\n sorted_points = list(points)\n sorted_points.sort()\n # self.build(0, sorted_points[len(sorted_points) - 1])\n\n for i in range(0, len(buildings)):\n self.update(0, sorted_points[len(sorted_points) - 1], buildings[i][0], buildings[i][1] - 1, buildings[i][2])\n\n ans = []\n prev = None\n for point in sorted_points:\n height = self.query(0, sorted_points[len(sorted_points) - 1], point, point)\n if prev is None:\n prev = height\n ans.append([point, height])\n else:\n if height != prev:\n ans.append([point, height])\n prev = height\n \n\n return ans\n\n \n\n\n","runtime":"894"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n ans = []\n pq = collections.Counter({0: 1}) # Simulating multiset with Counter, starting with height 0\n \n # Collect all critical points (start and end of buildings)\n points = []\n for b in buildings:\n points.append((b[0], -b[2])) # Start of the building, negative height\n points.append((b[1], b[2])) # End of the building, positive height\n \n # Sort points based on x-coordinate and height\n points.sort()\n \n ongoingHeight = 0\n \n # Iterate through all points\n for currentPoint, heightAtCurrentPoint in points:\n if heightAtCurrentPoint < 0: # Start of a building\n pq[-heightAtCurrentPoint] += 1 # Insert height into the Counter\n else: # End of a building\n pq[heightAtCurrentPoint] -= 1 # Remove one occurrence of the height\n if pq[heightAtCurrentPoint] == 0:\n del pq[heightAtCurrentPoint] # Remove completely if count becomes zero\n \n # Find the current maximum height\n pqTop = max(pq)\n \n # If the max height changes, update the result\n if ongoingHeight != pqTop:\n ongoingHeight = pqTop\n ans.append([currentPoint, ongoingHeight])\n \n return ans","runtime":"950"},{"code":"\nclass Solution:\n def hight_comparer(self, x, y):\n if x[0] != y[0]:\n return x[0] - y[0]\n if x[2] == y[2]:\n if x[2] is True:\n return y[1] - x[1]\n return x[1] - y[1]\n return -1 if x[2] == True else 1\n\n\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n events = [] # (location, height, start/end)\n for building in buildings:\n events.append([building[0], building[2], True])\n events.append([building[1], building[2], False])\n\n events = sorted(events, key=functools.cmp_to_key(self.hight_comparer))\n\n prev_height = 0\n hight_count = {0: 1}\n skyline = []\n for event in events:\n if event[1] not in hight_count:\n hight_count[event[1]] = 0\n\n if event[2]:\n hight_count[event[1]] += 1\n else:\n hight_count[event[1]] -= 1\n\n if hight_count[event[1]] == 0:\n hight_count.pop(event[1], None)\n\n max_height = max(hight_count)\n if prev_height != max_height:\n skyline.append([event[0], max_height])\n prev_height = max_height\n\n return skyline","runtime":"950"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n points=[]\n for i in range(len(buildings)):\n points.append([buildings[i][0],buildings[i][2],'start',i])\n points.append([buildings[i][1],buildings[i][2],'end',i])\n points.sort()\n\n result=[]\n heightStack=[[0,-1]]\n i=0\n while i<len(points):\n buffer=[points[i]]\n i+=1\n while i<len(points) and points[i][0]==buffer[-1][0]:\n buffer.append(points[i])\n i+=1\n startHeight=heightStack[-1][0]\n for b in buffer:\n if b[2]=='start':\n heightStack.append([b[1],b[3]])\n else :\n for j in range(len(heightStack)):\n if heightStack[j][1]==b[3]:\n heightStack.pop(j)\n break\n heightStack.sort()\n if heightStack[-1][0]!=startHeight:\n result.append([buffer[0][0],heightStack[-1][0]])\n \n return result","runtime":"1006"},{"code":"class Solution:\n class MaxHeap:\n def __init__(self, heap):\n self.heap = heap\n \n def peek(self):\n return -self.heap[0]\n \n def push(self, val):\n heapq.heappush(self.heap, -val)\n \n def remove(self, val):\n self.heap.remove(-val)\n heapq.heapify(self.heap)\n\n\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n points = []\n for b in buildings:\n points.append([b[0],b[2]])\n points.append([b[1],-b[2]])\n points.sort()\n\n maxHeap = self.MaxHeap([0])\n res = []\n for p in points:\n prev_height = maxHeap.peek()\n if p[1]>0:\n maxHeap.push(p[1])\n else:\n maxHeap.remove(-p[1])\n cur_height = maxHeap.peek()\n if cur_height!=prev_height:\n if res and res[-1][0]==p[0]:\n res.pop()\n if not res or res[-1][1]!=cur_height:\n res.append([p[0], cur_height])\n return res\n\n","runtime":"1006"},{"code":"import heapq\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n return_arr = []\n heap = []\n pos = 0\n skyline_height = {}\n\n i = 0\n while buildings or heap:\n #print('buildings', buildings)\n #print('heap', heap)\n\n if buildings and heap: \n if buildings[0][0] < heap[0][0]:\n #print(skyline_height)\n start, end, height = buildings.pop(0)\n pos = start\n\n heapq.heappush(heap, (end, height, i))\n skyline_height[i] = height\n\n else:\n end, height, rm_i = heapq.heappop(heap)\n pos = end\n skyline_height.pop(rm_i)\n\n elif not buildings:\n end, height, rm_i = heapq.heappop(heap)\n pos = end\n skyline_height.pop(rm_i)\n\n else: # buildings not heap\n start, end, height = buildings.pop(0)\n pos = start\n\n heapq.heappush(heap, (end, height, i))\n skyline_height[i] = height\n\n\n if skyline_height:\n return_arr.append([pos, max(skyline_height.values())])\n else:\n return_arr.append([pos, 0])\n \n i += 1\n\n true_return = []\n for x, height in return_arr:\n if not true_return or true_return[-1][1] != height:\n true_return.append([x, height])\n\n while len(true_return) >= 2 and true_return[-1][0] == true_return[-2][0]:\n true_return.pop(-2)\n\n while len(true_return) >= 2 and true_return[-1][1] == true_return[-2][1]:\n true_return.pop(-1)\n\n return true_return","runtime":"1063"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n points = []\n for left, right, height in buildings:\n points.append((left, -height)) # Start of a building (negative height)\n points.append((right, height)) # End of a building (positive height)\n \n # Sort points by x-coordinate; for ties, process negative heights first\n points.sort()\n\n heights = [0] # List to simulate a max-heap with a ground level height\n res = []\n prev_max_height = 0\n\n for x, h in points:\n if h < 0:\n # Building starts: add the height\n heights.append(-h)\n else:\n # Building ends: remove the height\n heights.remove(h)\n\n # Determine the current max height\n current_max_height = max(heights)\n\n # If the current max height changes, record the point in the skyline\n if prev_max_height != current_max_height:\n res.append([x, current_max_height])\n prev_max_height = current_max_height\n\n return res\n","runtime":"1119"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n OPEN, CLOSE = 1, -1\n events = []\n for l, r, h in buildings:\n events.append([l, h, OPEN])\n events.append([r, h, CLOSE])\n events.sort(key = lambda x: (x[0], x[1]))\n # print(events)\n # print(\"\\n\")\n\n actives, ans = [], []\n for l, h, typ in events:\n # print(f\"\\n-----l:{l}, h:{h}, typ:{typ}\")\n if typ == OPEN:\n actives.append(h)\n max_h = max(actives) if actives else 0\n if typ == CLOSE:\n actives.remove(h)\n max_h = max(actives) if actives else 0\n # print(f\"actives: {actives}\")\n\n if ans and l == ans[-1][0] and h >= ans[-1][1]:\n # print(\"pop from ans\")\n ans.pop()\n if (ans and h > ans[-1][1]) or not ans:\n ans.append([l, max_h])\n # print(f\"ans:{ans}\")\n\n elif h >= max_h and (not ans or ans[-1][1] != max_h): \n # print(f\"hit!: h:{h}, max_h:{max_h}\")\n ans.append([l, max_h])\n # print(f\"ans:{ans}\")\n\n return ans\n \n\n# class Solution:\n# def rectangleArea(self, rectangles: List[List[int]]) -> int:\n# OPEN, CLOSE = 1, -1\n# events = []\n# for x1, y1, x2, y2 in rectangles:\n# events.append([y1, x1, x2, OPEN])\n# events.append([y2, x1, x2, CLOSE])\n# events.sort() # remember to sort\n \n# actives, ans = [], 0\n# prev_y = events[0][0]\n# for y, x1, x2, typ in events:\n# ans += getWid() * (y - prev_y)\n# # update the answer before update the actives\n# if typ == CLOSE:\n# actives.remove((x1, x2))\n# elif typ == OPEN:\n# actives.append((x1, x2))\n# actives.sort()\n# prev_y = y # udpate the prev_y\n\n# def getWid():\n# if not actives: return 0\n# cur_s, cur_e, wid = actives[0][0], actives[0][1], 0\n# for x1, x2 in actives:\n# if x1 <= cur_e:\n# cur_e = max(cur_e, x2)\n# else:\n# wid += cur_e - cur_s\n# cur_s, cur_e = x1, x2\n \n# wid += cur_e - cur_s\n# return wid\n \n# return ans % (10**9+7)\n \n \n\n \n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n ","runtime":"1119"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n OPEN, CLOSE = 1, -1\n events = []\n for l, r, h in buildings:\n events.append([l, h, OPEN])\n events.append([r, h, CLOSE])\n events.sort()\n\n actives, ans = [], []\n for l, h, typ in events:\n if typ == OPEN:\n actives.append(h)\n if typ == CLOSE:\n actives.remove(h)\n max_h = max(actives) if actives else 0\n\n if ans and l == ans[-1][0] and h >= ans[-1][1]:\n ans.pop()\n if (ans and h > ans[-1][1]) or not ans:\n ans.append([l, max_h])\n\n elif h >= max_h and (not ans or ans[-1][1] != max_h): \n ans.append([l, max_h])\n\n return ans\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 ","runtime":"1175"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n OPEN, CLOSE = 1, -1\n events = []\n for l, r, h in buildings:\n events.append([l, h, OPEN])\n events.append([r, h, CLOSE])\n events.sort(key = lambda x: (x[0], x[1]))\n\n actives, ans = [], []\n for l, h, typ in events:\n if typ == OPEN:\n actives.append(h)\n if typ == CLOSE:\n actives.remove(h)\n max_h = max(actives) if actives else 0\n\n if ans and l == ans[-1][0] and h >= ans[-1][1]:\n ans.pop()\n if (ans and h > ans[-1][1]) or not ans:\n ans.append([l, max_h])\n\n elif h >= max_h and (not ans or ans[-1][1] != max_h): \n ans.append([l, max_h])\n\n return ans\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 ","runtime":"1175"},{"code":"# class Solution:\n# def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n# OPEN, CLOSE = 1, -1\n# events = []\n# for l, r, h in buildings:\n# events.append([l, h, OPEN])\n# events.append([r, h, CLOSE])\n# events.sort()\n\n# actives, ans = [], []\n# for l, h, typ in events:\n# if typ == OPEN:\n# actives.append(h)\n# if typ == CLOSE:\n# actives.remove(h)\n# max_h = max(actives) if actives else 0\n\n# if ans and l == ans[-1][0] and h >= ans[-1][1]:\n# ans.pop()\n# if (ans and h > ans[-1][1]) or not ans:\n# ans.append([l, max_h])\n\n# elif h >= max_h and (not ans or ans[-1][1] != max_h): \n# ans.append([l, max_h])\n\n# return ans\n \n\n\n\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n OPEN, CLOSE = 1, -1\n events = []\n for l, r, h in buildings:\n events.append([l, h, OPEN])\n events.append([r, h, CLOSE])\n events.sort()\n\n actives, ans, prev_maxh = [], [], None\n for l, h, typ in events:\n if typ == OPEN:\n actives.append(h)\n if typ == CLOSE:\n actives.remove(h)\n max_h = max(actives) if actives else 0\n\n if ans and l == ans[-1][0] and h >= ans[-1][1]:\n ans.pop()\n if (ans and h > ans[-1][1]) or not ans:\n ans.append([l, max_h])\n\n # elif h >= max_h and (not ans or ans[-1][1] != max_h): \n elif prev_maxh is None or max_h != prev_maxh:\n ans.append([l, max_h])\n \n prev_maxh = max_h\n\n return ans\n \n\n \n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n ","runtime":"1232"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n li = []\n for x,y,h in buildings:\n li.append((x,-h))\n li.append((y,h))\n\n li.sort()\n\n currActive = [0]\n currMax = 0\n ans = []\n for n,h in li:\n if h < 0:\n currActive.append(-h)\n if max(currActive) != currMax:\n currMax = max(currActive)\n ans.append([n,-h])\n else:\n currActive.remove(h)\n if max(currActive) != currMax:\n currMax = max(currActive)\n ans.append([n,currMax])\n return ans\n\n\n","runtime":"1232"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n OPEN, CLOSE = 1, -1\n events = []\n for l, r, h in buildings:\n events.append([l, h, OPEN])\n events.append([r, h, CLOSE])\n events.sort()\n\n actives, ans, prev_maxh = [], [], None\n for l, h, typ in events:\n if typ == OPEN:\n actives.append(h)\n if typ == CLOSE:\n actives.remove(h)\n max_h = max(actives) if actives else 0\n\n if ans and l == ans[-1][0] and h >= ans[-1][1]:\n ans.pop()\n if (ans and h > ans[-1][1]) or not ans:\n ans.append([l, max_h])\n\n elif prev_maxh is None or max_h != prev_maxh:\n ans.append([l, max_h])\n\n prev_maxh = max_h\n\n return ans\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 ","runtime":"1288"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n edges = []\n for left, right, height in buildings:\n edges.append([left, -height]) \n edges.append([right, height]) \n\n edges.sort()\n heap = [0]\n previous_highest = 0\n ret = []\n for x, h in edges:\n if h < 0:\n heappush(heap, h)\n else:\n heap.remove(-h)\n heapify(heap)\n highest = -heap[0]\n if highest != previous_highest:\n previous_highest = highest\n ret.append([x, highest])\n return ret","runtime":"1288"},{"code":"from typing import List\nimport heapq\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Create a list of events\n events = []\n \n for left, right, height in buildings:\n events.append((left, -height)) # Start of a building\n events.append((right, height)) # End of a building\n \n # Sort events first by x coordinate; if equal, then by height\n events.sort(key=lambda x: (x[0], x[1]))\n \n # Result list and a max heap (priority queue)\n result = []\n max_heap = [0] # Heap initialized with 0 height\n prev_max_height = 0\n \n # Process each event\n for x, height in events:\n if height < 0: # Start of a building\n heapq.heappush(max_heap, height)\n else: # End of a building\n # Remove the height from the heap\n max_heap.remove(-height)\n heapq.heapify(max_heap)\n \n # Get the current maximum height\n current_max_height = -max_heap[0]\n \n # If there's a change in height, record the point\n if current_max_height != prev_max_height:\n result.append([x, current_max_height])\n prev_max_height = current_max_height\n \n return result\n","runtime":"1344"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n events = []\n for l, r, h in buildings:\n events.append((l, -h)) # Building start\n events.append((r, h)) # Building end\n \n # Step 3: Sort events\n events.sort(key=lambda x: (x[0], x[1]))\n \n # Step 4: Initialize heap and result\n result = []\n max_heap = [0] # Starts with ground level\n prev_height = 0\n \n # Step 6: Process each event\n for x, h in events:\n if h < 0:\n heapq.heappush(max_heap, h) # Building start, push height\n else:\n max_heap.remove(-h) # Building end, remove height\n heapq.heapify(max_heap) # Re-heapify after removal\n \n current_height = -max_heap[0] # Max height is negative of min heap\n \n if current_height != prev_height:\n result.append([x, current_height])\n prev_height = current_height\n \n return result","runtime":"1344"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n a = []\n for l, r, h in buildings:\n a.append((l, -h))\n a.append((r, h))\n a.sort()\n\n pq = [0]\n ans = []\n for x, h in a:\n if h < 0:\n tmp = pq[0]\n heappush(pq, h)\n if tmp != pq[0]:\n ans.append([x, -h])\n else:\n tmp = pq[0]\n pq.remove(-h)\n heapify(pq) # !!!\n if tmp != pq[0]:\n ans.append([x, -pq[0]])\n return ans\n","runtime":"1401"},{"code":"# https://github.com/mission-peace/interview/blob/master/python/geometry/skylinedrawing.py\n\nclass BuildingPoint(object):\n\n def __init__(self, point, is_start, height):\n self.point = point\n self.is_start = is_start\n self.height = height\n \n def __lt__(self, other):\n if self.point != other.point:\n return self.point < other.point\n elif self.is_start and other.is_start:\n return -self.height < -other.height\n elif not self.is_start and not other.is_start:\n return self.height < other.height\n elif self.is_start and not other.is_start:\n return -self.height < other.height\n else:\n return self.height < -other.height\n\n # if self.is_start:\n # h1 = -self.height\n # else:\n # h1 = self.height\n\n # if other.is_start:\n # h2 = -other.height;\n # else:\n # h2 = other.height\n\n # return h1 < h2\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n sorted_buildings = []\n for building in buildings:\n sorted_buildings.append(BuildingPoint(building[0], True, building[2]))\n sorted_buildings.append(BuildingPoint(building[1], False, building[2]))\n\n sorted_buildings.sort()\n print([ (building.point, building.is_start, building.height) for building in sorted_buildings])\n\n result = []\n heap = [0]\n prev_max = 0\n for building in sorted_buildings:\n print(building.point, building.is_start, building.height)\n if building.is_start:\n heapq.heappush(heap, -building.height)\n if heap and -heap[0] > prev_max:\n print(\"add\")\n result.append((building.point, -heap[0]))\n prev_max = -heap[0]\n else:\n heap.remove(-building.height)\n heapq.heapify(heap)\n if heap and -heap[0] < prev_max:\n print(\"remove\")\n result.append((building.point, -heap[0]))\n prev_max = -heap[0]\n\n return result\n\n\n\n # building_points = []\n # for building in buildings:\n # building_points.append(BuildingPoint(building[0], True, building[2]))\n # building_points.append(BuildingPoint(building[1], False, building[2]))\n\n # building_points = sorted(building_points)\n\n # queue = {}\n # queue[0] = 1\n # prev_max_height = 0\n # result = []\n # for building_point in building_points:\n # if building_point.is_start:\n # if building_point.height in queue:\n # queue[building_point.height] = queue[building_point.height] + 1\n # else:\n # queue[building_point.height] = 1\n \n # else:\n # if queue[building_point.height] == 1:\n # del queue[building_point.height]\n # else:\n # queue[building_point.height] = queue[building_point.height] - 1\n\n # current_max_height = max(queue.keys())\n\n # if prev_max_height != current_max_height:\n # result.append([building_point.point, current_max_height])\n # prev_max_height = current_max_height\n # return result\n\n\n\n\n\n\n\n\n\n\n\n ","runtime":"1401"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n buildings_heights = []\n for l, r, h in buildings:\n buildings_heights.append([l, h])\n buildings_heights.append([r, -h])\n buildings_heights = sorted(buildings_heights, key=lambda x : (x[0], -x[1]))\n cur_skyline = 0\n heap = []\n res = []\n for idx, h in buildings_heights:\n if h > 0:\n heappush(heap, -h) # put highest in front\n if -heap[0] != cur_skyline:\n cur_skyline = -heap[0]\n res.append([idx, cur_skyline])\n else:\n heap.remove(h)\n heapify(heap)\n if not heap:\n cur_skyline = 0\n res.append([idx, 0])\n elif cur_skyline != -heap[0]:\n cur_skyline = -heap[0]\n res.append([idx, cur_skyline])\n\n return res\n\n\n","runtime":"1457"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n points = []# массив всех событий. событие - появление нового/конец старого здания\n for building in buildings:\n # с разными знаками сохраняем разные события, чтобы отличать их\n points.append((building[0], -building[2]))\n points.append((building[1], building[2]))\n points.sort()# сортируем события по времени\n \n res = []\n active_heights = [0]# массив действующих в текущей точке высот зданий (здания, которые касаются этой точки). Сейчас это list, поэтому сложность N^2. Можно использовать AVL дерево, тогда сложность N*logN.\n current_height = 0\n \n i = 0\n while i < len(points):\n coord, height = points[i]\n \n # обновляем массив действующих в точке высот зданий\n if height < 0:\n active_heights.append(-height)\n else:\n # active_heights.remove(height) нельзя, так как это удалит все height, а может быть здание с такой же высотой, но ещё не закончившееся\n for j in range(len(active_heights)):\n if active_heights[j] == height:\n active_heights.pop(j)\n break\n \n if i + 1 < len(points) and points[i + 1][0] == coord:\n # могут быть несколько событий в одной координате. Это условие позволит обновить active_heights с учётом всех событий, произошедших в coord. (иначе в цикле ниже на вход [[0,2,3],[2,5,3]] будет выход [[0,3],[2,0],[2,3],[5,0]])\n i += 1\n continue\n \n max_available_height = max(active_heights)\n if max_available_height != current_height:\n current_height = max_available_height\n res.append([coord, current_height])\n \n i += 1\n \n return res","runtime":"1457"},{"code":"from typing import List\nfrom dataclasses import dataclass\nfrom collections import deque\nfrom enum import IntEnum\n\n\nclass pType(IntEnum):\n START:int = 0\n END:int = 1\n\n\n@dataclass(frozen=True)\nclass Point:\n x: int\n y: int\n p_type: pType = False\n\n\nclass Solution:\n def __init__(self):\n self.buildings: List[List[int]] = None\n self.points: List[Point] = []\n self.que:deque = deque()\n self.que_max_y:int = 0\n self.skyline_debug: List[Point] = []\n self.skyline: List[List[int, int]] = []\n\n def get_points(self):\n for start, end, hight in self.buildings:\n self.points.append(Point(start, hight, pType.START))\n self.points.append(Point(end, hight, pType.END))\n self.points.sort(key=lambda point: (\n point.x,\n point.p_type,\n -point.y if point.p_type==pType.START else point.y)\n )\n\n def get_max_y(self) -> int:\n y_max:int = 0\n for y in self.que:\n if y > y_max:\n y_max = y\n return y_max\n\n def has_max_y_changed(self) -> bool:\n max_y: int = self.get_max_y()\n if max_y != self.que_max_y:\n self.que_max_y = max_y\n return True\n return False\n\n def add_skyline_point(self, point):\n if point.p_type == pType.START:\n self.que.append(point.y)\n else:\n self.que.remove(point.y)\n if self.has_max_y_changed():\n if point.p_type == pType.START:\n skyline_point = point\n else:\n skyline_point = Point(point.x, self.que_max_y, point.p_type)\n self.skyline.append([point.x, self.que_max_y])\n self.skyline_debug.append(skyline_point)\n\n def build_skyline(self):\n for point in self.points:\n self.add_skyline_point(point)\n\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n self.buildings: List[List[int]] = buildings\n self.get_points()\n self.build_skyline()\n return self.skyline","runtime":"1570"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n\n curr_heights = [0] # max heap of heights\n start_max = [] # (start idx, curr max height)\n end_height = [] # heap of (end idx, height of the end idx from input)\n for i in range(len(buildings)):\n a, b, h = buildings[i]\n while len(end_height) > 0 and a > end_height[0][0]:\n end, height = heapq.heappop(end_height)\n curr_heights = list(curr_heights)\n curr_heights.remove(-height)\n heapq.heapify(curr_heights)\n start_max.append([end, -curr_heights[0]])\n heapq.heappush(curr_heights, -h)\n if len(start_max) > 0 and start_max[-1][0] == a:\n start_max.pop()\n start_max.append([a, max(-curr_heights[0], h)])\n heapq.heappush(end_height, (b, h)) \n while end_height:\n end, height = heapq.heappop(end_height)\n curr_heights = list(curr_heights)\n curr_heights.remove(-height)\n heapq.heapify(curr_heights)\n start_max.append([end, -curr_heights[0]])\n # merge start_max\n prev_max = -1\n res = []\n for i in range(len(start_max)):\n if start_max[i][1] != prev_max:\n res.append(start_max[i])\n prev_max = start_max[i][1]\n return res\n\n# time O(nlogn) space O(n)\n\n\n ","runtime":"1626"},{"code":"class Solution:\n def getNextPoints(self, points):\n i = 0\n while i < len(points):\n r = []\n while True:\n r.append(points[i])\n i += 1\n if i >= len(points) or points[i][0] != points[i-1][0]:\n yield r\n break\n\n\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n points = []\n for i, b in enumerate(buildings):\n points.append((b[0], i, 0))\n points.append((b[1], i, 1))\n points.sort()\n \n opened = set()\n res = []\n for pp in self.getNextPoints(points):\n for p in pp:\n x, i, o = p\n if o == 0:\n opened.add(i)\n else:\n opened.remove(i)\n h = [buildings[i][2] for i in opened]\n if len(h) > 0:\n mh = max(h)\n else:\n mh = 0\n res.append([x, mh])\n \n\n fr = []\n fr.append(res[0])\n for i in range(1, len(res)):\n if res[i][1] != res[i-1][1]:\n fr.append(res[i])\n\n return fr\n \n \n \n","runtime":"1682"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n\n height_points = []\n for building in buildings:\n height_points.append((building[0], building[2], 1))\n height_points.append((building[1], building[2], -1))\n\n # sort buildings by x, height and start\n height_points = sorted(height_points, key=lambda tup: (tup[0], -1*(tup[2] * tup[1]), -tup[2]))\n\n max_height = 0\n heights = [0]\n skyline = []\n for x, height, start in height_points:\n if start == 1:\n heights.append(height)\n if max(heights) > max_height:\n skyline.append([x, height]) \n else:\n heights.remove(height)\n if max(heights) < max_height:\n skyline.append([x, max(heights)])\n max_height = max(heights)\n \n return skyline\n ","runtime":"1682"},{"code":"from collections import defaultdict\nimport heapq\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n coords = set(x[0] for x in buildings)\n coords = coords.union(set(x[1] for x in buildings))\n\n heap = []\n i = 0\n resp = []\n for x in sorted(coords):\n while i < len(buildings) and buildings[i][0] <= x:\n heapq.heappush(heap, (buildings[i][1], buildings[i][2]))\n i += 1\n\n while heap and heap[0][0] <= x:\n heapq.heappop(heap)\n\n\n currH = max(h[1] for h in heap) if heap else 0\n if not resp or resp[-1][1] != currH:\n resp.append([x, currH])\n\n\n return resp\n \n\n ","runtime":"1739"},{"code":"from collections import defaultdict\nclass Solution:\n '''\n 2 starts = [], ends = []\n 3\n 5\n 7\n 9\n 12\n 15\n 19\n 20\n 24\n '''\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n coords = set()\n for s, e, h in buildings:\n coords.add(s)\n coords.add(e)\n\n \n heap = []\n i = 0\n heights = []\n for x in sorted(coords):\n while i < len(buildings) and buildings[i][0] <= x:\n heapq.heappush(heap, (buildings[i][1], buildings[i][2]))\n i += 1\n\n while heap and heap[0][0] <= x:\n heapq.heappop(heap)\n\n\n currH = max(h[1] for h in heap) if heap else 0\n if not heights or heights[-1][1] != currH:\n heights.append([x, currH])\n\n\n return heights\n \n\n ","runtime":"1795"},{"code":"import heapq\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n n = len(buildings)\n buildings_close = sorted(buildings, key = lambda x: x[1])\n max_heap = []\n open_ptr, close_ptr = 0, 0\n corners = []\n def extract_max():\n return (-1) * max_heap[0][0] if max_heap else 0\n def open_heap(ptr):\n orig_height = extract_max()\n heappush(max_heap, ((-1) * buildings[ptr][2], \n buildings[ptr][0], buildings[ptr][1]))\n new_height = extract_max()\n if(new_height > orig_height):\n if((not corners) or (corners and corners[-1][0] != buildings[ptr][0])):\n corners.append([buildings[ptr][0], new_height])\n else:\n corners[-1] = [buildings[ptr][0], new_height]\n\n def close_heap(ptr):\n orig_height = extract_max()\n idx = max_heap.index(((-1) * buildings_close[close_ptr][2], \n buildings_close[close_ptr][0], buildings_close[close_ptr][1]))\n max_heap[idx] = max_heap[-1]\n max_heap.pop()\n heapify(max_heap)\n new_height = extract_max()\n if(new_height < orig_height):\n if((not corners) or (corners and corners[-1][0] != buildings_close[close_ptr][1])):\n corners.append([buildings_close[close_ptr][1], new_height])\n else:\n corners[-1] = [buildings_close[close_ptr][1], new_height]\n\n while(open_ptr < n):\n if(buildings[open_ptr][0] <= buildings_close[close_ptr][1]):\n open_heap(open_ptr)\n open_ptr += 1\n else:\n close_heap(close_ptr)\n close_ptr += 1\n\n while(close_ptr < n):\n close_heap(close_ptr)\n close_ptr += 1\n\n return corners\n\n\n\n ","runtime":"1852"},{"code":"from heapq import heappush, heappop\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n positions = sorted(set(val for building in buildings for val in building[:2]))\n curr_h = 0\n ret = []\n for x in positions:\n max_h = 0\n for left, right, h in buildings:\n if left <= x and right > x and h > max_h:\n max_h = h\n if not ret or max_h != ret[-1][1]:\n ret.append([x, max_h])\n return ret","runtime":"1908"},{"code":"class Solution:\n def getNextPoints(self, points):\n i = 0\n while i < len(points):\n r = []\n while True:\n r.append(points[i])\n i += 1\n if i >= len(points) or points[i][0] != points[i-1][0]:\n yield r\n break\n\n\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n points = []\n for i, b in enumerate(buildings):\n points.append((b[0], i, 0))\n points.append((b[1], i, 1))\n points.sort()\n \n opened = []\n res = []\n for pp in self.getNextPoints(points):\n for p in pp:\n x, i, o = p\n if o == 0:\n opened.append(i)\n else:\n opened = [j for j in opened if j != i]\n h = [buildings[i][2] for i in opened]\n if len(h) > 0:\n mh = max(h)\n else:\n mh = 0\n res.append([x, mh])\n \n\n fr = []\n fr.append(res[0])\n for i in range(1, len(res)):\n if res[i][1] != res[i-1][1]:\n fr.append(res[i])\n\n return fr\n \n \n \n","runtime":"1964"},{"code":"import heapq\nclass TreeNode:\n def __init__(self, val=None, left=None, right=None, parent=None):\n self.val = val\n self.left = left\n self.right = right\n self.parent = parent\n\nclass BST:\n def __init__(self):\n self.root = TreeNode(val=0)\n def add(self, val):\n if self.root == None:\n self.root = TreeNode(val=val)\n else:\n p = self.root\n while True:\n if val > p.val:\n if p.right is None:\n p.right = TreeNode(val=val)\n p.right.parent = p\n break\n else:\n p = p.right\n else:\n if p.left is None:\n p.left = TreeNode(val=val)\n p.left.parent = p\n break\n else:\n p = p.left\n def find_node(self, val):\n if val == self.root.val:\n return root\n p = self.root\n while True:\n if val > p.val:\n p = p.right\n elif val < p.val:\n p = p.left\n else:\n return p\n \n def _find_largest_in_subtree(self, p):\n while True:\n if p.right is None:\n return p\n else:\n return self._find_largest_in_subtree(p.right)\n\n def delete(self, val):\n p = self.find_node(val)\n if p.left is None:\n if p.right is None:\n if p.val > p.parent.val:\n p.parent.right = None\n else:\n p.parent.left = None\n else:\n if p.val > p.parent.val:\n p.parent.right = p.right\n p.right.parent = p.parent\n else:\n p.parent.left = p.right\n p.right.parent = p.parent\n else:\n largest_left = self._find_largest_in_subtree(p.left)\n largest_left_val = largest_left.val\n if largest_left.left is None:\n if largest_left.val > largest_left.parent.val:\n largest_left.parent.right = None\n else:\n largest_left.parent.left = None\n else:\n if largest_left.val > largest_left.parent.val:\n largest_left.parent.right = largest_left.left\n largest_left.left.parent = largest_left.parent\n else:\n largest_left.parent.left = largest_left.left\n largest_left.left.parent = largest_left.parent\n p.val = largest_left_val\n \n def largest_val(self):\n return self._find_largest_in_subtree(self.root).val\n \n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n \n sorted_buildings = sorted(buildings, key=lambda x: (x[0], x[1], x[2]))\n print (sorted_buildings)\n \n queue = []\n heapq.heapify(queue)\n \n htree = BST()\n res = [[-1,-1]]\n i = 0\n while i < len(sorted_buildings):\n building_i = sorted_buildings[i]\n if len(queue) == 0 or building_i[0] <= queue[0][0]:\n heapq.heappush(queue, (building_i[1], building_i[2]))\n htree.add(building_i[2])\n current = htree.largest_val()\n if current != res[-1][1]:\n if building_i[0] == res[-1][0]:\n res[-1][1] = max(res[-1][1], current)\n else:\n res.append([building_i[0], current])\n # print (building_i[0], htree.largest_val())\n i += 1\n else:\n end_pos, height = heapq.heappop(queue)\n htree.delete(height)\n current = htree.largest_val()\n if current != res[-1][1]:\n res.append([end_pos, current])\n # print (end_pos, htree.largest_val())\n \n while len(queue) > 0:\n end_pos, height = heapq.heappop(queue)\n htree.delete(height)\n current = htree.largest_val()\n if current != res[-1][1]:\n res.append([end_pos, current])\n # print (end_pos, htree.largest_val())\n \n return res[1:]","runtime":"2021"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n heights = []\n for building in buildings:\n start, end, height = building\n heights.append((start, -height))\n heights.append((end, height))\n \n heights.sort()\n\n res = []\n pq, cur_height = [0], 0\n for height in heights:\n x, y = height\n if y < 0:\n heapq.heappush(pq, y)\n else:\n for idx, val in enumerate(pq):\n if val == -y:\n pq.pop(idx)\n heapq.heapify(pq)\n break\n\n if cur_height != pq[0]:\n res.append((x, -pq[0]))\n cur_height = pq[0]\n \n return res","runtime":"2077"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n from sortedcontainers import SortedList\n H = SortedList([0])\n \n remove = []\n i = 0\n res = []\n \n B = []\n \n for s, e, height in buildings:\n B.append((s,height))\n B.append((e,-height))\n B.sort()\n for s,height in B:\n h = max(H)\n if height < 0:\n H.remove(-height)\n else:\n H.add(height)\n if h != max(H):\n res.append([s,max(H),\"ES\"[int(height > 0)]])\n \n K = [[-1,0]]\n \n res.sort(key=lambda r: (r[0], int(r[2] == 'S'), r[1]))\n print(res)\n for s,v,x in res:\n \n if s != K[-1][0]: K.append([s,v])\n elif x == \"S\":\n K[-1][1] = max(K[-1][1],v)\n if K[-1][1] == K[-2][1]: K.pop()\n \n \n return K[1:]\n \n ","runtime":"2133"},{"code":"class Solution:\n def getSkyline(self, buildings):\n # List to store the skyline key points\n skyline = []\n \n # List to store the current active buildings\n active_buildings = []\n \n # List to store the positions of all buildings\n positions = sorted(set([b[0] for b in buildings] + [b[1] for b in buildings]))\n \n # Index to track the current building\n i = 0\n \n # Loop through all positions\n for pos in positions:\n \n # Add all buildings that start at this position\n while i < len(buildings) and buildings[i][0] == pos:\n active_buildings.append(buildings[i])\n i += 1\n \n # Remove all buildings that end at or before this position\n active_buildings = [b for b in active_buildings if b[1] > pos]\n \n # Find the highest active building at this position\n max_height = max([b[2] for b in active_buildings] + [0])\n \n # If this height is different from the previous key point, add a new key point\n if not skyline or skyline[-1][1] != max_height:\n skyline.append([pos, max_height])\n \n # Ensure the last key point has y-coordinate 0\n if skyline[-1][1] != 0:\n skyline.append([positions[-1], 0])\n \n return skyline\n\n# Example usage:\n# sol = Solution()\n# print(sol.getSkyline([[2,9,10],[3,7,15],[5,12,12],[15,20,10],[19,24,8]]))\n# print(sol.getSkyline([[0,2,3],[2,5,3]]))","runtime":"2190"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # use max heap to store (height, end-point)\n # when at a starting location, add to heap, take top of heap as max\n # when at ending location, remove from heap with ending <= cur, take top of heap\n loc = []\n for i,[l,r,h] in enumerate(buildings):\n loc.append((l, 0, i))\n loc.append((r, 1, i))\n loc.sort()\n ans = []\n heap = []\n n = len(loc)\n i = 0\n cur_h = 0\n while i < n:\n cur_loc = loc[i][0]\n j = i\n while j < n and loc[j][0] == cur_loc:\n _, oc, idx = loc[j]\n if oc == 0:\n # starting\n end = buildings[idx][1]\n h = buildings[idx][2]\n heapq.heappush(heap, (-h, -end))\n else:\n # ending\n while heap and -heap[0][1] <= cur_loc:\n heapq.heappop(heap)\n j += 1\n if heap:\n new_h = -heap[0][0]\n else: new_h = 0\n if new_h != cur_h:\n ans.append([cur_loc, new_h])\n cur_h = new_h\n # ans.append([cur_loc, ])\n #else: ans.append([cur_loc, 0])\n i += 1\n return ans","runtime":"2246"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # use max heap to store (height, end-point)\n # when at a starting location, add to heap, take top of heap as max\n # when at ending location, remove from heap with ending <= cur, take top of heap\n loc = []\n for i,[l,r,h] in enumerate(buildings):\n loc.append((l, 0, i))\n loc.append((r, 1, i))\n loc.sort()\n ans = []\n heap = []\n n = len(loc)\n i = 0\n cur_h = 0\n while i < n:\n cur_loc = loc[i][0]\n j = i\n while j < n and loc[j][0] == cur_loc:\n _, oc, idx = loc[j]\n if oc == 0:\n # starting\n end = buildings[idx][1]\n h = buildings[idx][2]\n heapq.heappush(heap, (-h, -end))\n else:\n # ending\n while heap and -heap[0][1] <= cur_loc:\n heapq.heappop(heap)\n j += 1\n if heap:\n new_h = -heap[0][0]\n else: new_h = 0\n if new_h != cur_h:\n ans.append([cur_loc, new_h])\n cur_h = new_h\n i += 1\n return ans","runtime":"2302"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n skyline = []\n transition_points = sorted(set([x[0] for x in buildings] + [x[1] for x in buildings]))\n #print(transition_points)\n start = 0\n for count,point in enumerate(transition_points):\n #for x,building in enumerate(buildings):\n curr_height = 0\n for x in range(start, len(buildings)):\n if buildings[x][0] > point:\n #start = x\n break\n #continue\n if buildings[x][1] <= point:\n continue\n \n if buildings[x][2] > curr_height:\n curr_height = buildings[x][2]\n \n if len(skyline) == 0 or skyline[len(skyline)-1][1] != curr_height:\n #print(count, curr_height, skyline)\n skyline.append([point,curr_height])\n \n\n \"\"\"last_x = buildings[-1][1]\n #heights = [0,0 for x in range(0, last_x)]\n heights = []\n start_building = 0\n x = 0\n while x < last_x:\n count = start_building\n heights.append()\n for building in buildings[start_building:]:\n if building[0] > x:\n start_building = count\n break\n elif building[1] < x:\n continue\n if len(heights) < \n if building[2] > heights[x][1]:\n heights[x] = (x,building[2])\n x = building[1] \n print(heights)\n\n skyline = []\n prev_height = 0\n for count,x in enumerate(heights):\n if x > prev_height:\n prev_height = x\n skyline.append([count,x])\n elif x < prev_height:\n prev_height = x\n skyline.append([count-1,x]) \n skyline.append([last_x,0])\"\"\"\n \n return skyline","runtime":"2359"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n edges = []\n START, END = 0, 1\n for i, building in enumerate(buildings):\n edges.append((building[0], i, START))\n edges.append((building[1], i, END))\n edges.sort(key=lambda x: x[0])\n \n live, answer = [],[]\n idx = 0\n while idx < len(edges):\n cur_x = edges[idx][0]\n while idx < len(edges) and edges[idx][0] == cur_x:\n if edges[idx][2] == START:\n height = buildings[edges[idx][1]][2]\n right = buildings[edges[idx][1]][1]\n heapq.heappush(live, [-height, right])\n\n while live and live[0][1] <= cur_x:\n heapq.heappop(live)\n idx += 1\n max_height = -live[0][0] if live else 0\n if not answer or max_height != answer[-1][1]:\n answer.append([cur_x, max_height])\n return answer","runtime":"2415"},{"code":"import heapq\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Prepare a list of all the edges: \n # (position, height) where height is negative for start edges\n points = []\n for L, R, H in buildings:\n points.append((L, -H)) # start edge\n points.append((R, H)) # end edge\n \n # Sort the points: first by position, then by height\n points.sort()\n \n # Result list to store the skyline points\n result = []\n # Priority queue (max-heap) to keep track of heights\n live = [(0, float('inf'))] # Initialize with ground level (height 0) extending infinitely\n ongoing_height = 0\n \n # Process each point\n for x, h in points:\n if h < 0: # It's a start of a building\n heapq.heappush(live, (h, x))\n else: # It's the end of a building\n for i in range(len(live)):\n if live[i][0] == -h:\n del live[i]\n break\n heapq.heapify(live) # Re-heapify after deletion\n \n # The current highest building is the one with the smallest negative height (max-heap)\n current_max_height = -live[0][0] if live else 0\n \n # If the height changes at this x-coordinate, this is a key point in the skyline\n if ongoing_height != current_max_height:\n ongoing_height = current_max_height\n result.append([x, ongoing_height])\n \n return result\n","runtime":"2471"},{"code":"import heapq\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Prepare a list of all the edges: \n # (position, height) where height is negative for start edges\n points = []\n for L, R, H in buildings:\n points.append((L, -H)) # start edge\n points.append((R, H)) # end edge\n \n # Sort the points: first by position, then by height\n points.sort()\n \n # Result list to store the skyline points\n result = []\n # Priority queue (max-heap) to keep track of heights\n live = [(0, float('inf'))] # Initialize with ground level (height 0) extending infinitely\n ongoing_height = 0\n \n # Process each point\n for x, h in points:\n if h < 0: # It's a start of a building\n heapq.heappush(live, (h, x))\n else: # It's the end of a building\n for i in range(len(live)):\n if live[i][0] == -h:\n del live[i]\n break\n heapq.heapify(live) # Re-heapify after deletion\n \n # The current highest building is the one with the smallest negative height (max-heap)\n current_max_height = -live[0][0] if live else 0\n \n # If the height changes at this x-coordinate, this is a key point in the skyline\n if ongoing_height != current_max_height:\n ongoing_height = current_max_height\n result.append([x, ongoing_height])\n \n return result\n","runtime":"2528"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n skyline = []\n transition_points = sorted(set([x[0] for x in buildings] + [x[1] for x in buildings]))\n #print(transition_points)\n start = 0\n for count,point in enumerate(transition_points):\n #for x,building in enumerate(buildings):\n curr_height = 0\n for x in range(start, len(buildings)):\n if buildings[x][0] > point:\n #start = x\n #break\n continue\n if buildings[x][1] <= point:\n continue\n \n if buildings[x][2] > curr_height:\n curr_height = buildings[x][2]\n \n if len(skyline) == 0 or skyline[len(skyline)-1][1] != curr_height:\n #print(count, curr_height, skyline)\n skyline.append([point,curr_height])\n \n\n \"\"\"last_x = buildings[-1][1]\n #heights = [0,0 for x in range(0, last_x)]\n heights = []\n start_building = 0\n x = 0\n while x < last_x:\n count = start_building\n heights.append()\n for building in buildings[start_building:]:\n if building[0] > x:\n start_building = count\n break\n elif building[1] < x:\n continue\n if len(heights) < \n if building[2] > heights[x][1]:\n heights[x] = (x,building[2])\n x = building[1] \n print(heights)\n\n skyline = []\n prev_height = 0\n for count,x in enumerate(heights):\n if x > prev_height:\n prev_height = x\n skyline.append([count,x])\n elif x < prev_height:\n prev_height = x\n skyline.append([count-1,x]) \n skyline.append([last_x,0])\"\"\"\n \n return skyline","runtime":"2584"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n skyline = []\n transition_points = sorted(set([x[0] for x in buildings] + [x[1] for x in buildings]))\n print(transition_points)\n start = 0\n for count,point in enumerate(transition_points):\n #for x,building in enumerate(buildings):\n curr_height = 0\n for x in range(start, len(buildings)):\n if buildings[x][0] > point:\n #start = x\n #break\n continue\n if buildings[x][1] <= point:\n continue\n \n if buildings[x][2] > curr_height:\n curr_height = buildings[x][2]\n \n if len(skyline) == 0 or skyline[len(skyline)-1][1] != curr_height:\n #print(count, curr_height, skyline)\n skyline.append([point,curr_height])\n \n\n \"\"\"last_x = buildings[-1][1]\n #heights = [0,0 for x in range(0, last_x)]\n heights = []\n start_building = 0\n x = 0\n while x < last_x:\n count = start_building\n heights.append()\n for building in buildings[start_building:]:\n if building[0] > x:\n start_building = count\n break\n elif building[1] < x:\n continue\n if len(heights) < \n if building[2] > heights[x][1]:\n heights[x] = (x,building[2])\n x = building[1] \n print(heights)\n\n skyline = []\n prev_height = 0\n for count,x in enumerate(heights):\n if x > prev_height:\n prev_height = x\n skyline.append([count,x])\n elif x < prev_height:\n prev_height = x\n skyline.append([count-1,x]) \n skyline.append([last_x,0])\"\"\"\n \n return skyline","runtime":"2640"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Sort the unique positions of all the edges.\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"2697"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n \n positions = []\n\n for left, right, height in buildings:\n positions.append(left)\n positions.append(right)\n positions = list(set(positions))\n positions.sort()\n\n hor = {x:i for i,x in enumerate(positions)}\n\n heights = [0] * len(positions)\n\n for left,right, height in buildings:\n\n left_index = hor[left]\n right_index = hor[right]\n\n for i in range(left_index,right_index):\n heights[i] = max(heights[i],height)\n \n output = []\n\n for i in range(len(positions)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n if not output or output[-1][1] != curr_height:\n output.append([curr_x,curr_height])\n \n return output","runtime":"2753"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n\n edge_index_map = {x: i for i, x in enumerate(positions)}\n\n heights = [0] * len(positions)\n\n # calculate the heightest among all buildings\n for left, right, height in buildings:\n\n left_index = edge_index_map[left]\n right_index = edge_index_map[right]\n\n for i in range(left_index, right_index):\n heights[i] = max(heights[i], height)\n\n # generate final ans\n ans = []\n for i in range(len(heights)):\n\n curr_height = heights[i]\n curr_x = positions[i]\n\n if not ans or ans[-1][1] != curr_height:\n ans.append([curr_x, curr_height])\n \n return ans\n\n\n","runtime":"2809"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Sort the unique positions of all the edges.\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer\n\n # Solution with priority queue, doesn't work for edge case\n # buildings_sorted = []\n # for b in buildings:\n # heapq.heappush(buildings_sorted, b)\n \n # height_intervals = []\n # while buildings_sorted:\n # b = heapq.heappop(buildings_sorted)\n # if not height_intervals:\n # height_intervals.append(b)\n # elif b[0] > height_intervals[-1][1]:\n # height_intervals.append(b)\n # print(b)\n # else:\n # if b[2] == height_intervals[-1][2]:\n # height_intervals[-1][1] = max(height_intervals[-1][1], b[1])\n # elif b[2] > height_intervals[-1][2]:\n # if b[1] < height_intervals[-1][1]:\n # heapq.heappush(buildings_sorted, [b[1], height_intervals[-1][1], height_intervals[-1][2]])\n \n # if b[0] > height_intervals[-1][0]:\n # height_intervals[-1][1] = b[0]\n # height_intervals.append(b)\n # else:\n # height_intervals[-1][1] = b[1]\n # height_intervals[-1][2] = b[2]\n # print(b)\n # else:\n # if b[1] > height_intervals[-1][1]:\n # heapq.heappush(buildings_sorted, [height_intervals[-1][1], b[1], b[2]])\n # print(height_intervals)\n \n # skyline = []\n # prev_building_end = height_intervals[0][0]\n # for h in height_intervals:\n # if h[0] > prev_building_end:\n # skyline.append([prev_building_end, 0])\n # skyline.append([h[0], h[2]])\n # prev_building_end = h[1]\n # skyline.append([height_intervals[-1][1], 0])\n # return skyline\n\n \n \n # Memoery limit exceeded\n # max_right = 0\n # for b in buildings:\n # max_right = max(max_right, b[1])\n \n # height = [0] * (max_right + 2)\n # for b in buildings:\n # for i in range(b[0], b[1]+1):\n # height[i] = max(height[i], b[2])\n # #print(height)\n \n # skyline = []\n # prev_height = 0\n # j = 0\n # while j < len(height):\n # #print(j, height[j])\n # if height[j] > 0 or (height[j] == 0 and len(skyline) > 0):\n # if height[j] > prev_height:\n # skyline.append([j, height[j]])\n # else:\n # skyline.append([j-1, height[j]])\n # end = j\n # while end < len(height) and height[end] == height[j]:\n # end += 1\n # prev_height = height[j]\n # j = end\n # else:\n # prev_height = height[j]\n # j += 1\n \n # return skyline\n ","runtime":"2866"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Sort the unique positions of all the edges.\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer\n ","runtime":"2922"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Sort the unique positions of all the edges.\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"2979"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n\n edgeMap = {x: i for i, x in enumerate(positions)}\n heights = [0 for _ in range(len(positions))]\n for left, right, height in buildings:\n leftIdx = edgeMap[left]\n rightIdx = edgeMap[right]\n\n for i in range(leftIdx, rightIdx):\n heights[i] = max(heights[i], height)\n\n answer = []\n for i in range(len(heights)):\n pos = positions[i]\n height = heights[i]\n\n if not answer or answer[-1][1] != height:\n answer.append([pos, height])\n \n return answer","runtime":"3035"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Sort the unique positions of all the edges.\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"3091"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Sort the unique positions of all the edges.\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"3148"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n \n cps = list(set([x for building in buildings for x in building[:2]]))\n cps.sort()\n cp_dict = {x:i for i, x in enumerate(cps)}\n\n heights = [0]*len(cps)\n for left, right, height in buildings:\n left_idx = cp_dict[left]\n right_idx = cp_dict[right]\n for i in range(left_idx,right_idx):\n heights[i] = max(heights[i],height)\n\n answers = []\n for i in range(len(heights)):\n cur = heights[i]\n pos = cps[i]\n if not answers or cur !=answers[-1][-1]:\n answers.append([pos,cur])\n\n return answers","runtime":"3204"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Sort the unique positions of all the edges.\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"3260"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n \n positions = []\n\n for left, right, height in buildings:\n positions.append(left)\n positions.append(right)\n positions = list(set(positions))\n positions.sort()\n\n hor = {x:i for i,x in enumerate(positions)}\n\n heights = [0] * len(positions)\n\n for left,right, height in buildings:\n\n left_index = hor[left]\n right_index = hor[right]\n\n for i in range(left_index,right_index):\n heights[i] = max(heights[i],height)\n \n output = []\n\n for i in range(len(positions)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n if not output or output[-1][1] != curr_height:\n output.append([curr_x,curr_height])\n \n return output","runtime":"3317"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"3373"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Sort the unique positions of all the edges.\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"3429"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Sort the unique positions of all the edges.\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"3486"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # use a huge array to store the height of each point\n # query an interval?\n edge_pts = set()\n for s, e, h in buildings:\n edge_pts.add(s)\n edge_pts.add(e)\n edge_pts = list(edge_pts)\n edge_pts.sort()\n\n edge_pts_to_heights_map = {pt: i for i, pt in enumerate(edge_pts)}\n heights = [0 for i in range(len(edge_pts))]\n\n for s, e, h in buildings:\n index_s = edge_pts_to_heights_map[s]\n index_e = edge_pts_to_heights_map[e]\n for i in range(index_s, index_e):\n heights[i] = max(heights[i], h)\n \n ans = []\n\n for i in range(len(heights)):\n pt = edge_pts[i]\n h = heights[i]\n if not ans or h != heights[i-1]:\n ans.append([pt, h])\n return ans \n\n\n ","runtime":"3542"},{"code":"from heapq import heappush, heappop\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n positions = sorted(set(val for building in buildings for val in building[:2]))\n edge_indexes = {x: i for i, x in enumerate(positions)}\n heights = [0] * len(positions)\n for left, right, h in buildings:\n l_idx = edge_indexes[left]\n r_idx = edge_indexes[right]\n for i in range(l_idx, r_idx):\n heights[i] = max(heights[i], h)\n ret = []\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n if not ret or ret[-1][1] != curr_height:\n ret.append([curr_x, curr_height])\n return ret","runtime":"3598"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Sort the unique positions of all the edges.\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"3655"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # brute force Solution\n positions = set()\n for x, y, h in buildings:\n positions.add(x)\n positions.add(y)\n \n positions = sorted(list(positions))\n \n edge_index_map = {x:i for i,x in enumerate(positions)}\n heights = [0]*len(positions)\n\n for x, y, h in buildings:\n left = edge_index_map[x]\n right = edge_index_map[y]\n\n for i in range(left, right):\n heights[i] = max(h, heights[i])\n\n # print(positions, \"\\n\", heights)\n result = []\n for x, h in zip(positions, heights):\n if not result or result[-1][1] != h:\n result.append((x, h))\n return result\n\n\n \n \n # # positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n # print(positions)\n # events = []\n # for x, y, h in buildings:\n # events.append((x, -h, y))\n # events.append((y, 0, 0))\n # events.sort()\n\n # result = []\n # max_height = 0\n # heap = [[0, float('inf')]]\n # # print(events)\n # # sorted\n # for x, nh, y in events:\n # # height building has ended y < x # then height will change \n # while heap[0][1] <= x:\n # heapq.heappop(heap) # remove the height which are finished\n\n # # push new value into the pririty queue \n # if nh != 0:\n # heapq.heappush(heap, [nh, y]) # height, right\n\n # # print(x, nh, max_height)\n # # priority queue\n # if -heap[0][0] != max_height:\n # max_height = -heap[0][0] #update max_height\n # result.append([x, max_height])\n # # print(result)\n # return result\n","runtime":"3711"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Sort the unique positions of all the edges.\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"3767"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Sort the unique positions of all the edges.\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"3824"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n unique_x = sorted(list(set([x for building in buildings for x in building[:2]])))\n # sorted array of all possible unique x points\n # map x coordinate to index in list?\n edge_map = {x : i for i, x in enumerate(unique_x)}\n\n unique_heights = [0] * len(unique_x)\n # will store y value for each unique x value\n # now iterate over buildings, and update height\n for left, right, height in buildings:\n lefti = edge_map[left]\n righti = edge_map[right]\n\n for uniquei in range(lefti, righti):\n unique_heights[uniquei] = max(unique_heights[uniquei], height)\n # heights now holds the skyline at each unique x.\n # now construct array of differences\n result = []\n for i in range(len(unique_heights)):\n currentheight = unique_heights[i]\n currentx = unique_x[i]\n\n if not result or result[-1][1] != currentheight:\n result.append([currentx, currentheight])\n return result\n\n\n ","runtime":"3880"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n x_coords = set()\n for building in buildings:\n for x in building[:2]:\n x_coords.add(x)\n x_coords = sorted(list(x_coords))\n\n edge_map = {}\n for i, n in enumerate(x_coords):\n edge_map[n] = i\n\n ht = [0]*len(edge_map)\n\n for l, r, h in buildings:\n # find max in range left to right?\n for i in range(edge_map[l], edge_map[r]):\n ht[i] = max(ht[i], h)\n ans = []\n\n for i in range(len(ht)):\n if not ans or ans[-1][1] != ht[i]:\n ans.append([x_coords[i], ht[i]])\n return ans","runtime":"3936"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n positions=list(set([x for building in buildings for x in building[:2]]))\n positions.sort()\n dic={x:i for i,x in enumerate(positions)}\n heights=[0]*len(positions)\n for left,right,height in buildings:\n l_idx=dic[left]\n r_idx=dic[right]\n for i in range(l_idx,r_idx):\n heights[i]=max(heights[i],height)\n ans=[]\n for i in range(len(heights)):\n current_height=heights[i]\n current_position=positions[i]\n if not ans or current_height!=ans[-1][1]:\n ans.append([current_position,current_height])\n return ans\n ","runtime":"3993"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Sort the unique positions of all the edges.\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"4049"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n\n a = set([x for building in buildings for x in building[:2]])\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n edge_index_map = {x : i for i, x in enumerate(positions)}\n heights = [0] * len(positions)\n\n for left, right, height in buildings:\n\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"4106"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n heights = [0] * len(positions)\n \n for left, right, height in buildings:\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"4162"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n secondary = []\n for i, el in enumerate(buildings):\n secondary.append((el[0],i,el[2]))\n secondary.append((el[1],i,el[2]))\n secondary = sorted(secondary)\n fills = set()\n out = []\n for i in range(len(secondary)-1):\n el1 = secondary[i]\n el2 = secondary[i+1]\n if el1[1] in fills:\n fills.remove(el1[1])\n else:\n fills.add(el1[1])\n if el1[0] == el2[0]:\n continue\n H = 0\n for ind in fills:\n H = max(H, buildings[ind][2])\n out.append([el1[0], el2[0], H])\n # fuse\n for j in range(len(out)-1, 0, -1):\n if out[j][2] == out[j-1][2]:\n out[j-1][1] = out[j][1]\n out.pop(j) \n res = []\n l = len(out)\n for i in range(l):\n build = out[i]\n res.append([build[0], build[2]])\n if i>0 and build[0] == out[i-1][1] and build[2] == out[i-1][2]:\n res.pop()\n elif i<l-1 and build[1] < out[i+1][0]:\n res.append([build[1],0])\n res.append([build[1],0])\n return res\n ","runtime":"4218"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # build edge for x position\n ans = []\n\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n\n # build edge to index mapping for future reference\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n heights = [0] * len(positions)\n # iterate through edge, find out each edge's highest and build y position\n for left, right, height in buildings:\n left_index = edge_index_map[left]\n right_index = edge_index_map[right]\n\n for i in range(left_index, right_index):\n heights[i] = max(height, heights[i])\n \n # map x and y position\n for i in range(len(heights)):\n curr_h = heights[i]\n curr_x = positions[i]\n\n if not ans or ans[-1][1] != curr_h:\n ans.append([curr_x, curr_h])\n\n return ans","runtime":"4275"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n edges = set()\n for building in buildings:\n edges.add(building[0])\n edges.add(building[1])\n\n edges = sorted(list(edges))\n indices = {edge: i for i, edge in enumerate(edges)}\n\n heights = [0] * len(edges)\n\n for l, r, h in buildings:\n l_idx = indices[l]\n r_idx = indices[r]\n for i in range(l_idx, r_idx):\n heights[i] = max(heights[i], h)\n \n res = []\n prev = -1\n for i in range(len(heights)):\n if prev != heights[i]:\n prev = heights[i]\n res.append([edges[i], prev])\n return res\n\n\n\n\n","runtime":"4331"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n if not buildings:\n return []\n\n # get sorted unique positions of buildings\n positions = []\n for left, right, _ in buildings:\n positions.append(left)\n positions.append(right)\n positions = sorted(set(positions))\n\n # hashtable that maps from building position to index\n pos_idx_map = {pos: idx for idx, pos in enumerate(positions)}\n\n # max heights array\n max_heights = [0] * len(positions)\n\n # iterate over every building\n for left, right, height in buildings:\n \n # get left and right indices\n left_idx = pos_idx_map[left]\n right_idx = pos_idx_map[right]\n\n # update maximum height within the heights array\n for idx in range(left_idx, right_idx):\n max_heights[idx] = max(max_heights[idx], height)\n \n # assemble the result\n result = [[positions[0], max_heights[0]]]\n for position, height in zip(positions[1:], max_heights[1:]):\n # only add if the height has changed\n prev_height = result[-1][1]\n if height != prev_height:\n result.append([position, height])\n return result\n","runtime":"4387"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n heights = [0] * len(positions)\n \n for left, right, height in buildings:\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer","runtime":"4387"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n pos_to_idx = {x : i for i,x in enumerate(positions)}\n heights = [0 for i in range(len(positions))]\n\n for building in buildings:\n l = pos_to_idx[building[0]]\n r = pos_to_idx[building[1]]\n for i in range(l, r):\n heights[i] = max(heights[i], building[2])\n\n ans = [] \n for i in range(len(heights)):\n if not ans or ans[-1][1] != heights[i]:\n ans.append([positions[i], heights[i]])\n\n return ans","runtime":"4444"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n if not buildings:\n return None\n\n edgeSet = set()\n for left, right, _ in buildings:\n if left not in edgeSet:\n edgeSet.add(left)\n if right not in edgeSet:\n edgeSet.add(right)\n positions = sorted(list(edgeSet))\n \n mp = {x: i for i, x in enumerate(positions)}\n heights = [0] * len(positions)\n \n for left, right, height in buildings:\n idxLeft = mp[left]\n idxRight = mp[right]\n \n for i in range(idxLeft, idxRight):\n heights[i] = max(heights[i], height)\n # print(heights)\n \n ans = []\n for i, h in enumerate(heights):\n currX = positions[i]\n \n if not ans or ans[-1][1] != h:\n ans.append([currX, h])\n \n return ans","runtime":"4444"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n key_points = set()\n\n for b in buildings:\n key_points.add(b[0])\n key_points.add(b[1])\n\n key_points = list(key_points)\n key_points.sort()\n length = len(key_points)\n\n key_points_to_idx = {key_points[i]: i for i in range(length)}\n\n height = [0] * length\n for b in buildings:\n for i in range(key_points_to_idx[b[0]], key_points_to_idx[b[1]]):\n height[i] = max(height[i], b[2])\n\n skyline = [[key_points[0], height[0]]]\n for i in range(1, len(height)):\n if height[i] != height[i - 1]:\n skyline.append([key_points[i], height[i]])\n\n return skyline\n","runtime":"4500"},{"code":"import heapq\nfrom functools import cmp_to_key\n\nclass MaxHeapObj(object):\n def __init__(self, val): self.val = val\n def __lt__(self, other): return self.val > other.val\n def __eq__(self, other): return self.val == other.val\n def __str__(self): return str(self.val)\nfrom collections import defaultdict\n\n# done by referring answer, to improve\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n coords = set()\n for building in buildings:\n coords.add(building[0])\n coords.add(building[1]-1)\n coords.add(building[1])\n cands = sorted(coords)\n index = {x: i for i, x in enumerate(cands)}\n n = len(index)\n st = [0] * n # naive segment arr, no range update so no need become tree\n for building in buildings:\n for i in range(index[building[0]], index[building[1]-1] + 1):\n st[i] = max(st[i], building[2])\n ans = []\n for i in range(0, len(cands)):\n h = st[i]\n # only append start point of new height\n if len(ans) == 0 or h != ans[-1][1]:\n ans.append((cands[i], h))\n \n return ans\n \n\n def getSkylineWithSegment(self, buildings: List[List[int]]) -> List[List[int]]:\n change_point = []\n for building in buildings:\n change_point.append((building[0], building[2], 1))\n change_point.append((building[1], building[2], -1))\n change_point.sort(key=lambda x:(x[0],-x[1],-x[2]))\n res = []\n heap = []\n remove_heap = defaultdict(int)\n for i, (position, height, flag) in enumerate(change_point):\n if flag == 1:\n heapq.heappush(heap, MaxHeapObj(height))\n # remove a building\n else:\n remove_heap[height] += 1\n while len(heap) > 0 and remove_heap[heap[0].val] != 0:\n el = heapq.heappop(heap)\n remove_heap[el.val] -= 1\n\n # no building at the current position\n if len(heap) == 0:\n res.append([position, 0])\n else:\n # take consideration of the first and the last one\n # if the current max height equals the last height(two adjacent buildings), continue\n # if the current position has multiple operations(only take the highest one), continue (if height drop we wanna get the drop)\n if i == 0 or i == len(change_point)-1 or (heap[0].val != res[-1][1] and position != change_point[i+1][0]):\n res.append([position, heap[0].val]) # current max height\n\n return res\n \n ","runtime":"4500"}],"string":"[\n {\n \"code\": \"from typing import List\\nfrom bisect import bisect_left, bisect_right\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # If there are no buildings, return an empty list\\n if len(buildings) == 0:\\n return []\\n \\n # Sort buildings by height in descending order\\n buildings.sort(key=lambda v: v[2])\\n \\n # `pos` will store the x-coordinates (both start and end) of buildings\\n # `height` will store the heights corresponding to those x-coordinates\\n pos, height = [0], [0]\\n \\n for left, right, h in buildings:\\n # Find the index to insert `left` (start of the building)\\n i = bisect_left(pos, left)\\n # Find the index to insert `right` (end of the building)\\n j = bisect_right(pos, right)\\n \\n # Update the heights in the range [i, j) to the new building's height\\n height[i:j] = [h, height[j-1]] # height[j-1] keeps the height after the end of this building\\n # Update the positions in the range [i, j) to the new building's x-coordinates\\n pos[i:j] = [left, right]\\n \\n # `res` will store the final result of key points for the skyline\\n res = []\\n prev = 0 # Previous height, initialized to 0\\n \\n # Iterate through the positions and heights to construct the skyline\\n for v, h in zip(pos, height):\\n if h != prev: # Add a new key point only if the height changes\\n res.append([v, h])\\n prev = h\\n \\n return res\\n\\n# Time Complexity: O(N log N), where N is the number of buildings. Sorting takes O(N log N),\\n# and bisect operations for each building take O(log N) which is done for each building.\\n\\n# Space Complexity: O(N), where N is the number of buildings. Space is used for storing\\n# positions, heights, and the result.\\n\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n if len(buildings) == 0: \\n return []\\n \\n buildings.sort(key=lambda v: v[2])\\n pos, height = [0], [0]\\n for left, right, h in buildings: \\n i = bisect_left(pos, left)\\n j = bisect_right(pos, right)\\n height[i:j] = [h, height[j-1]]\\n pos[i:j] = [left, right]\\n print(height, pos)\\n res = []\\n prev = 0\\n for v, h in zip(pos, height): \\n if h != prev:\\n res.append([v,h]) \\n prev = h\\n \\n return res\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"from queue import PriorityQueue\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n skys, lines, pq = [], [], PriorityQueue()\\n for build in buildings:\\n lines.extend([build[0], build[1]])\\n lines.sort()\\n city, n = 0, len(buildings)\\n for line in lines:\\n while city < n and buildings[city][0] <= line:\\n pq.put([-buildings[city][2], buildings[city][0], buildings[city][1]])\\n city += 1\\n while not pq.empty() and pq.queue[0][2] <= line:\\n pq.get()\\n high = 0\\n if not pq.empty():\\n high = -pq.queue[0][0]\\n if len(skys) > 0 and skys[-1][1] == high:\\n continue\\n skys.append([line, high])\\n return skys\\n # T: O(n) S: O(1)\",\n \"runtime\": \"161\"\n },\n {\n \"code\": \"from sortedcontainers import SortedDict\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # (left, right, height)\\n # (left, height), (right, height)\\n h = []\\n for left, right, height in buildings:\\n h.append((left, 0, -height)) # left will go in front\\n h.append((right, 1, height))\\n \\n h.sort()\\n\\n return_value = []\\n current = SortedDict()\\n current_height = None\\n for x, leftright, height in h:\\n if leftright == 0:\\n height = -height\\n # start, add to list\\n if height not in current:\\n current[height] = 1\\n else:\\n current[height] += 1\\n else:\\n # end, remove\\n current[height] -= 1\\n if current[height] == 0:\\n del current[height]\\n newHeight = current.keys()[-1] if current else None\\n if newHeight != current_height:\\n return_value.append((x, 0 if newHeight is None else newHeight))\\n current_height = newHeight\\n \\n return return_value\\n\",\n \"runtime\": \"161\"\n },\n {\n \"code\": \"class SegTree:\\n def __init__(self, n):\\n self.tree = [0]*(4*n)\\n \\n def update(self, n, L, R, l, r, v):\\n if l==L and r==R:\\n self.tree[n] = max(self.tree[n], v)\\n else:\\n M = (L+R)>>1\\n if M >= r:\\n self.update(n*2+1, L, M, l, r, v)\\n elif M < l:\\n self.update(n*2+2, M+1, R, l, r, v)\\n else:\\n self.update(n*2+1, L, M, l, M, v)\\n self.update(n*2+2, M+1, R, M+1, r, v)\\n\\n def query(self, n, L, R, P):\\n if L== R: return self.tree[n]\\n M = (L+R) >> 1\\n res = self.query(n*2+1, L, M, P) if P <= M else self.query(n*2+2, M+1, R, P)\\n return max(res, self.tree[n])\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n xs = []\\n for start, end, height in buildings:\\n xs.append(start)\\n xs.append(end)\\n\\n xs.sort()\\n x2idx = {x:idx for idx, x in enumerate(xs)}\\n n = len(xs)\\n sg = SegTree(n)\\n for start, end, height in buildings:\\n sg.update(0, 0, n, x2idx[start], x2idx[end]-1, height)\\n res = []\\n curr = prev = 0\\n for i in range(n):\\n curr = sg.query(0, 0, n, i)\\n if curr == prev: continue\\n res.append([xs[i], curr])\\n prev = curr\\n return res\",\n \"runtime\": \"217\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n \\n res = []\\n\\n events = []\\n for i in range(0, len(buildings)):\\n building = buildings[i]\\n left = (building[0], building[2])\\n right = (building[1], building[2]) \\n events.append(('left', left, i))\\n events.append(('right', right, i))\\n \\n # sort by y coord (bigger first)\\n events = sorted(events, key=lambda x: x[1], reverse=True)\\n # right before left\\n events = sorted(events, key=lambda x: x[0], reverse=False)\\n # sort by x coord\\n events = sorted(events, key=lambda x: x[1][0])\\n active_buildings = set()\\n\\n\\n ignore = set()\\n for event in events:\\n side = event[0]\\n # print(side)\\n x, y = event[1]\\n b_idx = event[2]\\n\\n if side == 'left':\\n # print('left-------')\\n # print(buildings[b_idx])\\n active_buildings.add(b_idx)\\n if len(res) == 0:\\n res.append([x,y])\\n elif y > res[-1][1]:\\n res.append([x, y])\\n elif side == 'right':\\n active_buildings.remove(b_idx)\\n if b_idx not in ignore:\\n # print('right-------')\\n # print(buildings[b_idx])\\n # for j in active_buildings:\\n # print(f\\\" {buildings[j]}\\\")\\n y_val = 0\\n to_remove = []\\n for j in active_buildings:\\n # don't apply this if it's a right coord of an active building\\n if buildings[j][1] > x:\\n y_val = max(y_val, buildings[j][2])\\n else:\\n to_remove.append(j)\\n for j in to_remove:\\n ignore.add(j)\\n # if this building is short than others, don't add a point\\n if y > y_val:\\n res.append([x, y_val])\\n return res\\n\\n\",\n \"runtime\": \"217\"\n },\n {\n \"code\": \"import bisect\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # if you are good enough, you can do it in reverse\\n buildings.sort(key=lambda x: x[2], reverse=True)\\n skyline = [[float(\\\"inf\\\"), 0]]\\n for l, r, h in buildings:\\n i = bisect.bisect_right(skyline, l, key=lambda x: x[0])\\n j = bisect.bisect_right(skyline, r, key=lambda x: x[0])\\n # check right point\\n edits = []\\n right_on_line = False\\n if j-1 >= 0:\\n # check if right point is interior\\n if skyline[j-1][0] == r: \\n if skyline[j-1][1] == h:\\n # because of in-place sorting and original list is sorted by left points\\n continue\\n right_on_line = True\\n k = j\\n while k-1 >= 0:\\n if skyline[k-1][0] > l and skyline[k-1][1] == 0:\\n edits.append([k-1, h])\\n break\\n k -=1\\n \\n inserts = []\\n deletes = set()\\n if skyline[j][1] == 0 and (not right_on_line):\\n # exterior right point\\n inserts.append([j, [r, h]])\\n if j-1 >= 0 and skyline[j-1][1] == h and skyline[j-1][0] >= l:\\n deletes.add(j-1)\\n \\n # now right point is done, check left point\\n if i-1 >= 0 and skyline[i-1][0] == l and skyline[i-1][1] == h and inserts:\\n deletes.add(i-1)\\n \\n elif skyline[i][1] == h and inserts:\\n deletes.add(i)\\n\\n elif (not (i-1 >= 0 and skyline[i-1][0] == l)) and skyline[i][1] == 0:\\n # exterior left point\\n if i != j:\\n edits.append([i, h])\\n inserts.append([i, [l, 0]])\\n \\n # apply changes (update, insert, delete)\\n for idx, h in edits:\\n skyline[idx][1] = h\\n\\n for idx, v in inserts:\\n skyline.insert(idx, v)\\n \\n for idx in deletes:\\n skyline.pop(idx)\\n\\n ans = []\\n for i in range(len(skyline)-1):\\n x, h = skyline[i][0], skyline[i+1][1]\\n ans.append([x, h])\\n \\n return ans\\n\",\n \"runtime\": \"274\"\n },\n {\n \"code\": \"import bisect\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # if you are good enough, you can do it in reverse\\n buildings.sort(key=lambda x: x[2], reverse=True)\\n skyline = [[float(\\\"inf\\\"), 0]]\\n for l, r, h in buildings:\\n i = bisect.bisect_right(skyline, l, key=lambda x: x[0])\\n j = bisect.bisect_right(skyline, r, key=lambda x: x[0])\\n # check right point\\n edits = []\\n right_on_line = False\\n if j-1 >= 0:\\n # check if right point is interior\\n if skyline[j-1][0] == r: \\n if skyline[j-1][1] == h:\\n # because of in-place sorting and original list is sorted by left points\\n continue\\n right_on_line = True\\n k = j\\n while k-1 >= 0:\\n if skyline[k-1][0] > l and skyline[k-1][1] == 0:\\n edits.append([k-1, h])\\n break\\n k -=1\\n \\n inserts = []\\n deletes = set()\\n if skyline[j][1] == 0 and (not right_on_line):\\n # exterior right point\\n inserts.append([j, [r, h]])\\n if j-1 >= 0 and skyline[j-1][1] == h and skyline[j-1][0] >= l:\\n deletes.add(j-1)\\n \\n # now right point is done, check left point\\n if i-1 >= 0 and skyline[i-1][0] == l and skyline[i-1][1] == h and inserts:\\n deletes.add(i-1)\\n \\n elif skyline[i][1] == h and inserts:\\n deletes.add(i)\\n\\n elif (not (i-1 >= 0 and skyline[i-1][0] == l)) and skyline[i][1] == 0:\\n # exterior left point\\n if i != j:\\n edits.append([i, h])\\n inserts.append([i, [l, 0]])\\n \\n # apply changes (update, insert, delete)\\n for idx, h in edits:\\n skyline[idx][1] = h\\n\\n for idx, v in inserts:\\n skyline.insert(idx, v)\\n \\n for idx in deletes:\\n skyline.pop(idx)\\n\\n ans = []\\n for i in range(len(skyline)-1):\\n x, h = skyline[i][0], skyline[i+1][1]\\n ans.append([x, h])\\n \\n return ans\\n\",\n \"runtime\": \"274\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n res = []\\n h = [0]\\n corners = []\\n for b in buildings:\\n corners.append([b[0],\\\"l\\\",b[2]]) \\n corners.append([b[1],\\\"r\\\",b[2]]) \\n \\n corners.sort(key=lambda x: (x[0], x[1]))\\n for c in corners:\\n temp = h[0]\\n if c[1] == \\\"l\\\":\\n h.append(c[2])\\n h.sort(reverse = True)\\n elif c[1] == \\\"r\\\":\\n h.remove(c[2])\\n\\n if h[0] != temp:\\n res.append([c[0],h[0]]) \\n f_res = [] \\n for i in range(0,len(res)-1):\\n if res[i][0] != res[i+1][0]:\\n f_res.append(res[i])\\n f_res.append(res[-1])\\n \\n return f_res\\n \",\n \"runtime\": \"330\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet #necessary import for LeetCode\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n ans = []\\n d = defaultdict(int)\\n s = SortedSet()\\n for i, x in enumerate(buildings):\\n a, b, c = x\\n a0, b0, c0 = buildings[i-1] if i != 0 else (-1, -1, -1)\\n if not (a >= a0 and b <= b0 and c <= c0):\\n s.add(a)\\n s.add(b)\\n for x in buildings:\\n a, b, c = x\\n for i in s:\\n if i >= a:\\n if i >= b:\\n break\\n d[i] = max(d[i], c)\\n for i in s:\\n j = d[i]\\n if not ans or j != ans[-1][1]:\\n ans.append([i, j])\\n return ans\",\n \"runtime\": \"330\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet #necessary import for LeetCode\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n res = []\\n d = defaultdict(int)\\n s = SortedSet()\\n for i, x in enumerate(buildings):\\n a, b, c = x\\n a0, b0, c0 = buildings[i-1] if i != 0 else (-1, -1, -1)\\n if not (a >= a0 and b <= b0 and c <= c0):\\n s.add(a)\\n s.add(b)\\n for x in buildings:\\n a, b, c = x\\n for i in s:\\n if i >= a:\\n if i >= b:\\n break\\n # if i in range(a, b):\\n d[i] = max(d[i], c)\\n for i in s:\\n j = d[i]\\n if not res or j != res[-1][1]:\\n res.append([i, j])\\n return res\",\n \"runtime\": \"386\"\n },\n {\n \"code\": \"import bisect\\nfrom collections import defaultdict\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n points = defaultdict(list)\\n for s, e, h in buildings:\\n points[s].append(['s', h])\\n points[e].append(['e', h])\\n \\n out = []\\n curr = -1\\n track = [0]\\n k = list(points.keys())\\n k.sort()\\n for x in k:\\n for c, h in points[x]:\\n if c == 'e':\\n track.remove(h)\\n else:\\n idx = bisect.bisect(track, h)\\n track.insert(idx, h)\\n if curr != track[-1]:\\n curr = track[-1]\\n out.append([x,track[-1]])\\n return out\\n\",\n \"runtime\": \"386\"\n },\n {\n \"code\": \"import bisect\\nfrom collections import defaultdict\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n points = defaultdict(list)\\n for s, e, h in buildings:\\n points[s].append(['s', h])\\n points[e].append(['e', h])\\n \\n out = []\\n curr = -1\\n track = [0]\\n k = list(points.keys())\\n k.sort()\\n for x in k:\\n for c, h in points[x]:\\n if c == 'e':\\n track.remove(h)\\n else:\\n bisect.insort_left(track, h)\\n # track.insert(idx, h)\\n if curr != track[-1]:\\n curr = track[-1]\\n out.append([x,track[-1]])\\n return out\\n\",\n \"runtime\": \"443\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n def decompose(deq): \\n secondary = []\\n for i, el in enumerate(deq):\\n secondary.append((el[0],i,el[2]))\\n secondary.append((el[1],i,el[2]))\\n secondary = sorted(secondary)\\n fills = set()\\n out = []\\n for i in range(len(secondary)-1):\\n el1 = secondary[i]\\n el2 = secondary[i+1]\\n if el1[1] in fills:\\n fills.remove(el1[1])\\n else:\\n fills.add(el1[1])\\n if el1[0] == el2[0]:\\n continue\\n H = 0\\n for ind in fills:\\n H = max(H, deq[ind][2])\\n out.append([el1[0], el2[0], H])\\n # fuse\\n for j in range(len(out)-1, 0, -1):\\n if out[j][2] == out[j-1][2]:\\n out[j-1][1] = out[j][1]\\n out.pop(j)\\n return out\\n\\n cond = True\\n buildings = deque(buildings)\\n while cond:\\n cond = False\\n buildings_n = []\\n while len(buildings) > 1: \\n b = buildings.popleft()\\n to_decompose = [b]\\n n_build = [b]\\n lim = b[1]\\n while buildings and buildings[0][0] < lim:\\n if buildings[0][1] <= b[1] and buildings[0][2] <= b[2]:\\n buildings.popleft()\\n continue\\n #elif buildings[0][0] == b[0] and buildings[0][1] >= b[1] and buildings[0][2] >= b[2]:\\n # to_decompose.pop()\\n cond = True\\n b = buildings.popleft()\\n to_decompose.append(b) \\n if len(to_decompose) > 1:\\n n_build = decompose(to_decompose) \\n else:\\n n_build = to_decompose \\n buildings_n = buildings_n + n_build\\n if buildings:\\n b = buildings.popleft()\\n buildings_n.append(b)\\n buildings = deque(buildings_n)\\n # represent for output\\n res = []\\n l = len(buildings)\\n for i in range(l):\\n build = buildings[i]\\n res.append([build[0], build[2]])\\n if i>0 and build[0] == buildings[i-1][1] and build[2] == buildings[i-1][2]:\\n res.pop()\\n elif i<l-1 and build[1] < buildings[i+1][0]:\\n res.append([build[1],0])\\n res.append([build[1],0])\\n return res\\n \",\n \"runtime\": \"443\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n def decompose(deq): \\n secondary = []\\n for i, el in enumerate(deq):\\n secondary.append((el[0],i,el[2]))\\n secondary.append((el[1],i,el[2]))\\n secondary = sorted(secondary)\\n fills = set()\\n out = []\\n for i in range(len(secondary)-1):\\n el1 = secondary[i]\\n el2 = secondary[i+1]\\n if el1[1] in fills:\\n fills.remove(el1[1])\\n else:\\n fills.add(el1[1])\\n if el1[0] == el2[0]:\\n continue\\n H = 0\\n for ind in fills:\\n H = max(H, deq[ind][2])\\n out.append([el1[0], el2[0], H])\\n # fuse\\n for j in range(len(out)-1, 0, -1):\\n if out[j][2] == out[j-1][2]:\\n out[j-1][1] = out[j][1]\\n out.pop(j)\\n return out\\n\\n cond = True\\n buildings = deque(buildings)\\n while cond:\\n cond = False\\n buildings_n = []\\n while len(buildings) > 1: \\n b = buildings.popleft()\\n to_decompose = [b]\\n n_build = [b]\\n lim = b[1]\\n while buildings and buildings[0][0] < lim:\\n if buildings[0][1] <= b[1] and buildings[0][2] <= b[2]:\\n buildings.popleft()\\n continue\\n #elif buildings[0][0] == b[0] and buildings[0][1] >= b[1] and buildings[0][2] >= b[2]:\\n # to_decompose.pop()\\n cond = True\\n b = buildings.popleft()\\n to_decompose.append(b) \\n if len(to_decompose) > 1:\\n n_build = decompose(to_decompose) \\n else:\\n n_build = to_decompose \\n buildings_n = buildings_n + n_build\\n if buildings:\\n b = buildings.popleft()\\n buildings_n.append(b)\\n buildings = deque(buildings_n)\\n # represent for output\\n res = []\\n l = len(buildings)\\n for i in range(l):\\n build = buildings[i]\\n res.append([build[0], build[2]])\\n if i>0 and build[0] == buildings[i-1][1] and build[2] == buildings[i-1][2]:\\n res.pop()\\n elif i<l-1 and build[1] < buildings[i+1][0]:\\n res.append([build[1],0])\\n res.append([build[1],0])\\n return res\\n \",\n \"runtime\": \"499\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n def decompose(deq): \\n secondary = []\\n for i, el in enumerate(deq):\\n secondary.append((el[0],i,el[2]))\\n secondary.append((el[1],i,el[2]))\\n secondary = sorted(secondary)\\n fills = set()\\n out = []\\n for i in range(len(secondary)-1):\\n el1 = secondary[i]\\n el2 = secondary[i+1]\\n if el1[1] in fills:\\n fills.remove(el1[1])\\n else:\\n fills.add(el1[1])\\n if el1[0] == el2[0]:\\n continue\\n H = 0\\n for ind in fills:\\n H = max(H, deq[ind][2])\\n out.append([el1[0], el2[0], H])\\n # fuse\\n for j in range(len(out)-1, 0, -1):\\n if out[j][2] == out[j-1][2]:\\n out[j-1][1] = out[j][1]\\n out.pop(j)\\n return out\\n\\n cond = True\\n buildings = deque(buildings)\\n while cond:\\n cond = False\\n buildings_n = []\\n while len(buildings) > 1: \\n b = buildings.popleft()\\n to_decompose = [b]\\n n_build = [b]\\n lim = b[1]\\n while buildings and buildings[0][0] < lim:\\n if buildings[0][1] <= b[1] and buildings[0][2] <= b[2]:\\n buildings.popleft()\\n continue\\n elif buildings[0][0] == b[0] and buildings[0][1] >= b[1] and buildings[0][2] >= b[2]:\\n to_decompose.pop()\\n cond = True\\n b = buildings.popleft()\\n to_decompose.append(b) \\n if len(to_decompose) > 1:\\n n_build = decompose(to_decompose) \\n else:\\n n_build = to_decompose \\n buildings_n = buildings_n + n_build\\n if buildings:\\n b = buildings.popleft()\\n buildings_n.append(b)\\n buildings = deque(buildings_n)\\n # represent for output\\n res = []\\n l = len(buildings)\\n for i in range(l):\\n build = buildings[i]\\n res.append([build[0], build[2]])\\n if i>0 and build[0] == buildings[i-1][1] and build[2] == buildings[i-1][2]:\\n res.pop()\\n elif i<l-1 and build[1] < buildings[i+1][0]:\\n res.append([build[1],0])\\n res.append([build[1],0])\\n return res\\n \",\n \"runtime\": \"499\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n points = defaultdict(list)\\n for [l,r,h] in buildings:\\n points[l].append(h)\\n points[r].append(-h)\\n height = 0\\n res = []\\n freqs = {}\\n for x in sorted(points.keys()):\\n for h in points[x]:\\n if h<0: \\n freqs[-h] -= 1\\n if freqs[-h]==0: del freqs[-h]\\n else: \\n freqs[h] = 1 + freqs.get(h,0)\\n new_height = 0 if len(freqs)==0 else max(freqs.keys())\\n if new_height!=height:\\n height = new_height\\n res.append([x,height])\\n return res\\n\\n \",\n \"runtime\": \"555\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n points = defaultdict(list)\\n for [l,r,h] in buildings:\\n points[l].append(h)\\n points[r].append(-h)\\n height = 0\\n res = []\\n freqs = {}\\n for x in sorted(points.keys()):\\n for h in points[x]:\\n if h<0: \\n freqs[-h] -= 1\\n if freqs[-h]==0: del freqs[-h]\\n else: \\n freqs[h] = 1 + freqs.get(h,0)\\n new_height = 0 if len(freqs)==0 else max(freqs.keys())\\n if new_height!=height:\\n height = new_height\\n res.append([x,height])\\n return res\\n\\n \",\n \"runtime\": \"555\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n events = []\\n for L, R, H in buildings:\\n events.append((L, -H, R)) \\n events.append((R, 0, 0)) \\n \\n events.sort() \\n \\n skyline = []\\n active = [(0, float('inf'))]\\n \\n for x, h, R in events:\\n while active and active[-1][1] <= x:\\n active.pop()\\n \\n if h < 0: \\n active.append((-h, R))\\n \\n active.sort()\\n \\n if not skyline or skyline[-1][1] != active[-1][0]:\\n skyline.append([x, active[-1][0]])\\n \\n return skyline\",\n \"runtime\": \"612\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet as SS\\nfrom sortedcontainers import SortedDict as SD\\nclass Solution:\\n def getSkyline(self, B: List[List[int]]) -> List[List[int]]:\\n C = []\\n for l,r,h in B:\\n C.append((l,1,h))\\n C.append((r,-1,h))\\n C.sort()\\n\\n print(*C, sep=\\\"\\\\n\\\")\\n\\n S,H = [],[]\\n for c,f,h in C:\\n if f == 1:\\n heappush(H,-h)\\n if len(S) == 0 or -H[0] > S[-1][1]:\\n if len(S) > 0 and S[-1][0] == c:\\n if len(S) > 1 and S[-2][1] == -H[0]:\\n S.pop()\\n else:\\n S[-1][1] = -H[0]\\n else:\\n S.append([c,-H[0]])\\n else:\\n H.remove(-h)\\n H.sort()\\n if len(H) == 0:\\n S.append([c,0])\\n else:\\n if S[-1][1] > -H[0]:\\n S.append([c,-H[0]])\\n return S\",\n \"runtime\": \"612\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet #necessary import for LeetCode\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n res = []\\n d = defaultdict(int)\\n s = SortedSet()\\n for i, x in enumerate(buildings):\\n a, b, c = x\\n a0, b0, c0 = buildings[i-1] if i != 0 else (-1, -1, -1)\\n if not (a >= a0 and b <= b0 and c <= c0):\\n s.add(a)\\n s.add(b)\\n for x in buildings:\\n a, b, c = x\\n for i in s:\\n # if i >= a:\\n # if i >= b:\\n # break\\n if i in range(a, b):\\n d[i] = max(d[i], c)\\n if i >= b:\\n break\\n for i in s:\\n j = d[i]\\n if not res or j != res[-1][1]:\\n res.append([i, j])\\n return res\",\n \"runtime\": \"668\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n\\n # Get the corners of the buildings\\n left = [[building[0],-1,building[2]] for building in buildings]\\n right = [[building[1],building[2],-1] for building in buildings]\\n left = sorted(left, key = lambda x: (x[0], x[2]))\\n right = sorted(right, key = lambda x: (x[0], -x[1]))\\n corners = left + right\\n corners = sorted(corners, key = lambda x: x[0])\\n\\n # Set parameters\\n prev = []\\n height = 0\\n result = []\\n\\n # Loop\\n for i, point in enumerate(corners):\\n # Check which corner it is\\n if point[1] == -1:\\n if point[2] > height:\\n prev.append(height)\\n height = point[2]\\n if i == 0 or point[0] != result[-1][0]:\\n result.append([point[0], point[2]])\\n else:\\n result[-1][1] = point[2]\\n elif point[2] <= height:\\n prev.append(point[2])\\n else:\\n if point[1] == height:\\n if point[1] in prev:\\n prev.remove(point[1])\\n else:\\n height = max(prev)\\n prev.remove(height)\\n if point[0] != result[-1][0]:\\n result.append([point[0], height])\\n else:\\n result[-1][1] = height\\n elif point[1] < height:\\n prev.remove(point[1])\\n \\n return result\",\n \"runtime\": \"725\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n ans = []\\n d = defaultdict(int)\\n s = set()\\n for i, x in enumerate(buildings):\\n a, b, c = x\\n a0, b0, c0 = buildings[i-1] if i != 0 else (-1, -1, -1)\\n if not (a >= a0 and b <= b0 and c <= c0):\\n s.add(a)\\n s.add(b)\\n for x in buildings:\\n a, b, c = x\\n for i in s:\\n if i in range(a, b):\\n d[i] = max(d[i], c)\\n for i in sorted(list(s)):\\n j = d[i]\\n if not ans or j != ans[-1][1]:\\n ans.append([i, j])\\n return ans\",\n \"runtime\": \"781\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # add all the operation as (x, y, add) or (x, h, remove) and sort by x\\n ops = []\\n for x1, x2, y in buildings:\\n ops.append((x1, y, \\\"add\\\"))\\n ops.append((x2, y, \\\"del\\\"))\\n ops.sort()\\n print(ops)\\n bds = []\\n curr = 0\\n keypoints = []\\n for x, y, op in ops:\\n if op == \\\"add\\\":\\n bds.append(y)\\n curr_next = max(bds)\\n if curr != curr_next:\\n # check if a keypoint has been added already at the same x\\n if keypoints and keypoints[-1][0] == x:\\n keypoints.pop()\\n keypoints.append([x, curr_next])\\n curr = curr_next\\n else:\\n bds.remove(y)\\n if curr == y:\\n if bds:\\n curr_next = max(bds)\\n else:\\n curr_next = 0\\n if curr != curr_next:\\n if keypoints and keypoints[-1][0] == x:\\n keypoints.pop()\\n keypoints.append([x, curr_next])\\n curr = curr_next\\n return keypoints\",\n \"runtime\": \"781\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet #necessary import for LeetCode\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n res = []\\n d = defaultdict(int)\\n s = SortedSet()\\n for i, x in enumerate(buildings):\\n a, b, c = x\\n a0, b0, c0 = buildings[i-1] if i != 0 else (-1, -1, -1)\\n if not (a >= a0 and b <= b0 and c <= c0):\\n s.add(a)\\n s.add(b)\\n for x in buildings:\\n a, b, c = x\\n for i in s:\\n # if i >= a:\\n # if i >= b:\\n # break\\n if i in range(a, b):\\n d[i] = max(d[i], c)\\n for i in s:\\n j = d[i]\\n if not res or j != res[-1][1]:\\n res.append([i, j])\\n return res\",\n \"runtime\": \"837\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, build: List[List[int]]) -> List[List[int]]:\\n\\n book = defaultdict(list)\\n for l, r, h in build:\\n book[l].append(h)\\n book[r].append(-h)\\n\\n curr, sky = [0], []\\n for x in sorted(book.keys()):\\n prev = max(curr)\\n for val in book[x]:\\n if val > 0:\\n curr.append(val)\\n else:\\n curr.remove(-val)\\n now = max(curr)\\n if prev != now:\\n sky.append([x, now])\\n\\n return sky\\n \",\n \"runtime\": \"837\"\n },\n {\n \"code\": \"from queue import PriorityQueue\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # only the left and right of a building can affect the skyline\\n events = [] # [x, change in y]\\n for l, r, h in buildings:\\n events.append([l, h])\\n events.append([r, -h])\\n events.sort(key=lambda pair: (pair[0], pair[1]))\\n\\n x_maxheight = collections.defaultdict(int)\\n active_heights = [0]\\n for x, dy in events:\\n if dy > 0:\\n active_heights.append(dy)\\n else:\\n active_heights.remove(-dy)\\n x_maxheight[x] = max(active_heights)\\n x_maxheight_list = [[key, value] for key, value in x_maxheight.items()]\\n \\n res = []\\n n = len(x_maxheight_list)\\n for i in range(n):\\n if res and x_maxheight_list[i][1] == res[-1][1]:\\n continue\\n else:\\n res.append(x_maxheight_list[i])\\n return res\\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"894\"\n },\n {\n \"code\": \"class Solution:\\n def query(self, start, end, q_start, q_end):\\n if (start, end) not in self.lazy:\\n self.lazy[(start, end)] = -1\\n if (start, end) not in self.segment_tree:\\n self.segment_tree[(start, end)] = 0\\n mid = start + (end - start)//2\\n if self.lazy[(start, end)] != -1:\\n if start <= mid:\\n if (start, mid) not in self.lazy:\\n self.lazy[(start, mid)] = -1\\n if (start, mid) not in self.segment_tree:\\n self.segment_tree[(start, mid)] = 0\\n self.lazy[(start, mid)] = max(self.lazy[(start, end)], self.lazy[(start, mid)])\\n if mid + 1 <= end:\\n if (mid+1, end) not in self.lazy:\\n self.lazy[(mid + 1, end)] = -1\\n if (mid + 1, end) not in self.segment_tree:\\n self.segment_tree[(mid + 1, end)] = 0\\n self.lazy[(mid+1, end)] = max(self.lazy[(start, end)], self.lazy[(mid+1, end)])\\n self.segment_tree[(start, end)] = max(self.segment_tree[(start, end)], self.lazy[(start, end)])\\n self.lazy[(start, end)] = -1\\n\\n if q_start <= start and end <= q_end: \\n return self.segment_tree[(start, end)]\\n\\n if q_end < start or q_start > end:\\n return -1\\n # continue\\n else:\\n if start <= mid:\\n a = self.query(start, mid, q_start, q_end)\\n if mid + 1 <= end:\\n b = self.query(mid+1, end, q_start, q_end)\\n # self.segment_tree[(start, end)] = max(a, b)\\n # return self.segment_tree[(start, end)]\\n return max(a, b)\\n\\n\\n\\n\\n\\n def update(self, start, end, q_start, q_end, val):\\n if (start, end) not in self.lazy:\\n self.lazy[(start, end)] = -1\\n if (start, end) not in self.segment_tree:\\n self.segment_tree[(start, end)] = 0\\n mid = start + (end - start)//2\\n if self.lazy[(start, end)] != -1:\\n if start <= mid:\\n if (start, mid) not in self.lazy:\\n self.lazy[(start, mid)] = -1\\n if (start, mid) not in self.segment_tree:\\n self.segment_tree[(start, mid)] = 0\\n self.lazy[(start, mid)] = max(self.lazy[(start, end)], self.lazy[(start, mid)])\\n if mid + 1 <= end:\\n if (mid+1, end) not in self.lazy:\\n self.lazy[(mid + 1, end)] = -1\\n if (mid + 1, end) not in self.segment_tree:\\n self.segment_tree[(mid + 1, end)] = 0\\n self.lazy[(mid+1, end)] = max(self.lazy[(start, end)], self.lazy[(mid+1, end)])\\n self.segment_tree[(start, end)] = max(self.segment_tree[(start, end)], self.lazy[(start, end)])\\n self.lazy[(start, end)] = -1\\n\\n if q_start <= start and end <= q_end: \\n self.lazy[(start, end)] = max(self.lazy[(start, end)], val)\\n self.segment_tree[(start, end)] = max(self.segment_tree[(start, end)], self.lazy[(start, end)])\\n\\n if start <= mid:\\n if (start, mid) not in self.lazy:\\n self.lazy[(start, mid)] = -1\\n if (start, mid) not in self.segment_tree:\\n self.segment_tree[(start, mid)] = 0\\n self.lazy[(start, mid)] = max(self.lazy[(start, end)], self.lazy[(start, mid)])\\n if mid + 1 <= end: \\n if (mid+1, end) not in self.lazy:\\n self.lazy[(mid + 1, end)] = -1\\n if (mid + 1, end) not in self.segment_tree:\\n self.segment_tree[(mid + 1, end)] = 0\\n self.lazy[(mid+1, end)] = max(self.lazy[(start, end)], self.lazy[(mid+1, end)])\\n self.lazy[(start, end)] = -1\\n return self.segment_tree[(start, end)]\\n\\n # completely inside the query interval\\n\\n if q_end < start or q_start > end:\\n return -1\\n # continue\\n else:\\n if start <= mid:\\n a = self.update(start, mid, q_start, q_end, val)\\n if mid + 1 <= end: \\n b = self.update(mid+1, end, q_start, q_end, val)\\n self.segment_tree[(start, end)] = max(a, b)\\n return self.segment_tree[(start, end)]\\n def build(self, start, end):\\n self.lazy[(start, end)] = -1\\n if start == end:\\n if (start, end) not in self.segment_tree:\\n self.segment_tree[(start, end)] = 0\\n return 0\\n else:\\n mid = start + (end - start)//2\\n a = self.build(start, mid)\\n if mid + 1 <= end:\\n b = self.build(mid + 1, end)\\n self.segment_tree[(start, end)] = max(a, b)\\n return self.segment_tree[(start, end)]\\n\\n return self.self.segment_tree[(start, end)]\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n self.segment_tree = dict()\\n self.lazy = dict()\\n points = set()\\n for i in range(0, len(buildings)):\\n points.add(buildings[i][0])\\n points.add(buildings[i][1])\\n\\n sorted_points = list(points)\\n sorted_points.sort()\\n # self.build(0, sorted_points[len(sorted_points) - 1])\\n\\n for i in range(0, len(buildings)):\\n self.update(0, sorted_points[len(sorted_points) - 1], buildings[i][0], buildings[i][1] - 1, buildings[i][2])\\n\\n ans = []\\n prev = None\\n for point in sorted_points:\\n height = self.query(0, sorted_points[len(sorted_points) - 1], point, point)\\n if prev is None:\\n prev = height\\n ans.append([point, height])\\n else:\\n if height != prev:\\n ans.append([point, height])\\n prev = height\\n \\n\\n return ans\\n\\n \\n\\n\\n\",\n \"runtime\": \"894\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n ans = []\\n pq = collections.Counter({0: 1}) # Simulating multiset with Counter, starting with height 0\\n \\n # Collect all critical points (start and end of buildings)\\n points = []\\n for b in buildings:\\n points.append((b[0], -b[2])) # Start of the building, negative height\\n points.append((b[1], b[2])) # End of the building, positive height\\n \\n # Sort points based on x-coordinate and height\\n points.sort()\\n \\n ongoingHeight = 0\\n \\n # Iterate through all points\\n for currentPoint, heightAtCurrentPoint in points:\\n if heightAtCurrentPoint < 0: # Start of a building\\n pq[-heightAtCurrentPoint] += 1 # Insert height into the Counter\\n else: # End of a building\\n pq[heightAtCurrentPoint] -= 1 # Remove one occurrence of the height\\n if pq[heightAtCurrentPoint] == 0:\\n del pq[heightAtCurrentPoint] # Remove completely if count becomes zero\\n \\n # Find the current maximum height\\n pqTop = max(pq)\\n \\n # If the max height changes, update the result\\n if ongoingHeight != pqTop:\\n ongoingHeight = pqTop\\n ans.append([currentPoint, ongoingHeight])\\n \\n return ans\",\n \"runtime\": \"950\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def hight_comparer(self, x, y):\\n if x[0] != y[0]:\\n return x[0] - y[0]\\n if x[2] == y[2]:\\n if x[2] is True:\\n return y[1] - x[1]\\n return x[1] - y[1]\\n return -1 if x[2] == True else 1\\n\\n\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n events = [] # (location, height, start/end)\\n for building in buildings:\\n events.append([building[0], building[2], True])\\n events.append([building[1], building[2], False])\\n\\n events = sorted(events, key=functools.cmp_to_key(self.hight_comparer))\\n\\n prev_height = 0\\n hight_count = {0: 1}\\n skyline = []\\n for event in events:\\n if event[1] not in hight_count:\\n hight_count[event[1]] = 0\\n\\n if event[2]:\\n hight_count[event[1]] += 1\\n else:\\n hight_count[event[1]] -= 1\\n\\n if hight_count[event[1]] == 0:\\n hight_count.pop(event[1], None)\\n\\n max_height = max(hight_count)\\n if prev_height != max_height:\\n skyline.append([event[0], max_height])\\n prev_height = max_height\\n\\n return skyline\",\n \"runtime\": \"950\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n points=[]\\n for i in range(len(buildings)):\\n points.append([buildings[i][0],buildings[i][2],'start',i])\\n points.append([buildings[i][1],buildings[i][2],'end',i])\\n points.sort()\\n\\n result=[]\\n heightStack=[[0,-1]]\\n i=0\\n while i<len(points):\\n buffer=[points[i]]\\n i+=1\\n while i<len(points) and points[i][0]==buffer[-1][0]:\\n buffer.append(points[i])\\n i+=1\\n startHeight=heightStack[-1][0]\\n for b in buffer:\\n if b[2]=='start':\\n heightStack.append([b[1],b[3]])\\n else :\\n for j in range(len(heightStack)):\\n if heightStack[j][1]==b[3]:\\n heightStack.pop(j)\\n break\\n heightStack.sort()\\n if heightStack[-1][0]!=startHeight:\\n result.append([buffer[0][0],heightStack[-1][0]])\\n \\n return result\",\n \"runtime\": \"1006\"\n },\n {\n \"code\": \"class Solution:\\n class MaxHeap:\\n def __init__(self, heap):\\n self.heap = heap\\n \\n def peek(self):\\n return -self.heap[0]\\n \\n def push(self, val):\\n heapq.heappush(self.heap, -val)\\n \\n def remove(self, val):\\n self.heap.remove(-val)\\n heapq.heapify(self.heap)\\n\\n\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n points = []\\n for b in buildings:\\n points.append([b[0],b[2]])\\n points.append([b[1],-b[2]])\\n points.sort()\\n\\n maxHeap = self.MaxHeap([0])\\n res = []\\n for p in points:\\n prev_height = maxHeap.peek()\\n if p[1]>0:\\n maxHeap.push(p[1])\\n else:\\n maxHeap.remove(-p[1])\\n cur_height = maxHeap.peek()\\n if cur_height!=prev_height:\\n if res and res[-1][0]==p[0]:\\n res.pop()\\n if not res or res[-1][1]!=cur_height:\\n res.append([p[0], cur_height])\\n return res\\n\\n\",\n \"runtime\": \"1006\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n return_arr = []\\n heap = []\\n pos = 0\\n skyline_height = {}\\n\\n i = 0\\n while buildings or heap:\\n #print('buildings', buildings)\\n #print('heap', heap)\\n\\n if buildings and heap: \\n if buildings[0][0] < heap[0][0]:\\n #print(skyline_height)\\n start, end, height = buildings.pop(0)\\n pos = start\\n\\n heapq.heappush(heap, (end, height, i))\\n skyline_height[i] = height\\n\\n else:\\n end, height, rm_i = heapq.heappop(heap)\\n pos = end\\n skyline_height.pop(rm_i)\\n\\n elif not buildings:\\n end, height, rm_i = heapq.heappop(heap)\\n pos = end\\n skyline_height.pop(rm_i)\\n\\n else: # buildings not heap\\n start, end, height = buildings.pop(0)\\n pos = start\\n\\n heapq.heappush(heap, (end, height, i))\\n skyline_height[i] = height\\n\\n\\n if skyline_height:\\n return_arr.append([pos, max(skyline_height.values())])\\n else:\\n return_arr.append([pos, 0])\\n \\n i += 1\\n\\n true_return = []\\n for x, height in return_arr:\\n if not true_return or true_return[-1][1] != height:\\n true_return.append([x, height])\\n\\n while len(true_return) >= 2 and true_return[-1][0] == true_return[-2][0]:\\n true_return.pop(-2)\\n\\n while len(true_return) >= 2 and true_return[-1][1] == true_return[-2][1]:\\n true_return.pop(-1)\\n\\n return true_return\",\n \"runtime\": \"1063\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n points = []\\n for left, right, height in buildings:\\n points.append((left, -height)) # Start of a building (negative height)\\n points.append((right, height)) # End of a building (positive height)\\n \\n # Sort points by x-coordinate; for ties, process negative heights first\\n points.sort()\\n\\n heights = [0] # List to simulate a max-heap with a ground level height\\n res = []\\n prev_max_height = 0\\n\\n for x, h in points:\\n if h < 0:\\n # Building starts: add the height\\n heights.append(-h)\\n else:\\n # Building ends: remove the height\\n heights.remove(h)\\n\\n # Determine the current max height\\n current_max_height = max(heights)\\n\\n # If the current max height changes, record the point in the skyline\\n if prev_max_height != current_max_height:\\n res.append([x, current_max_height])\\n prev_max_height = current_max_height\\n\\n return res\\n\",\n \"runtime\": \"1119\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n OPEN, CLOSE = 1, -1\\n events = []\\n for l, r, h in buildings:\\n events.append([l, h, OPEN])\\n events.append([r, h, CLOSE])\\n events.sort(key = lambda x: (x[0], x[1]))\\n # print(events)\\n # print(\\\"\\\\n\\\")\\n\\n actives, ans = [], []\\n for l, h, typ in events:\\n # print(f\\\"\\\\n-----l:{l}, h:{h}, typ:{typ}\\\")\\n if typ == OPEN:\\n actives.append(h)\\n max_h = max(actives) if actives else 0\\n if typ == CLOSE:\\n actives.remove(h)\\n max_h = max(actives) if actives else 0\\n # print(f\\\"actives: {actives}\\\")\\n\\n if ans and l == ans[-1][0] and h >= ans[-1][1]:\\n # print(\\\"pop from ans\\\")\\n ans.pop()\\n if (ans and h > ans[-1][1]) or not ans:\\n ans.append([l, max_h])\\n # print(f\\\"ans:{ans}\\\")\\n\\n elif h >= max_h and (not ans or ans[-1][1] != max_h): \\n # print(f\\\"hit!: h:{h}, max_h:{max_h}\\\")\\n ans.append([l, max_h])\\n # print(f\\\"ans:{ans}\\\")\\n\\n return ans\\n \\n\\n# class Solution:\\n# def rectangleArea(self, rectangles: List[List[int]]) -> int:\\n# OPEN, CLOSE = 1, -1\\n# events = []\\n# for x1, y1, x2, y2 in rectangles:\\n# events.append([y1, x1, x2, OPEN])\\n# events.append([y2, x1, x2, CLOSE])\\n# events.sort() # remember to sort\\n \\n# actives, ans = [], 0\\n# prev_y = events[0][0]\\n# for y, x1, x2, typ in events:\\n# ans += getWid() * (y - prev_y)\\n# # update the answer before update the actives\\n# if typ == CLOSE:\\n# actives.remove((x1, x2))\\n# elif typ == OPEN:\\n# actives.append((x1, x2))\\n# actives.sort()\\n# prev_y = y # udpate the prev_y\\n\\n# def getWid():\\n# if not actives: return 0\\n# cur_s, cur_e, wid = actives[0][0], actives[0][1], 0\\n# for x1, x2 in actives:\\n# if x1 <= cur_e:\\n# cur_e = max(cur_e, x2)\\n# else:\\n# wid += cur_e - cur_s\\n# cur_s, cur_e = x1, x2\\n \\n# wid += cur_e - cur_s\\n# return wid\\n \\n# return ans % (10**9+7)\\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 \"runtime\": \"1119\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n OPEN, CLOSE = 1, -1\\n events = []\\n for l, r, h in buildings:\\n events.append([l, h, OPEN])\\n events.append([r, h, CLOSE])\\n events.sort()\\n\\n actives, ans = [], []\\n for l, h, typ in events:\\n if typ == OPEN:\\n actives.append(h)\\n if typ == CLOSE:\\n actives.remove(h)\\n max_h = max(actives) if actives else 0\\n\\n if ans and l == ans[-1][0] and h >= ans[-1][1]:\\n ans.pop()\\n if (ans and h > ans[-1][1]) or not ans:\\n ans.append([l, max_h])\\n\\n elif h >= max_h and (not ans or ans[-1][1] != max_h): \\n ans.append([l, max_h])\\n\\n return ans\\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 \"runtime\": \"1175\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n OPEN, CLOSE = 1, -1\\n events = []\\n for l, r, h in buildings:\\n events.append([l, h, OPEN])\\n events.append([r, h, CLOSE])\\n events.sort(key = lambda x: (x[0], x[1]))\\n\\n actives, ans = [], []\\n for l, h, typ in events:\\n if typ == OPEN:\\n actives.append(h)\\n if typ == CLOSE:\\n actives.remove(h)\\n max_h = max(actives) if actives else 0\\n\\n if ans and l == ans[-1][0] and h >= ans[-1][1]:\\n ans.pop()\\n if (ans and h > ans[-1][1]) or not ans:\\n ans.append([l, max_h])\\n\\n elif h >= max_h and (not ans or ans[-1][1] != max_h): \\n ans.append([l, max_h])\\n\\n return ans\\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 \"runtime\": \"1175\"\n },\n {\n \"code\": \"# class Solution:\\n# def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n# OPEN, CLOSE = 1, -1\\n# events = []\\n# for l, r, h in buildings:\\n# events.append([l, h, OPEN])\\n# events.append([r, h, CLOSE])\\n# events.sort()\\n\\n# actives, ans = [], []\\n# for l, h, typ in events:\\n# if typ == OPEN:\\n# actives.append(h)\\n# if typ == CLOSE:\\n# actives.remove(h)\\n# max_h = max(actives) if actives else 0\\n\\n# if ans and l == ans[-1][0] and h >= ans[-1][1]:\\n# ans.pop()\\n# if (ans and h > ans[-1][1]) or not ans:\\n# ans.append([l, max_h])\\n\\n# elif h >= max_h and (not ans or ans[-1][1] != max_h): \\n# ans.append([l, max_h])\\n\\n# return ans\\n \\n\\n\\n\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n OPEN, CLOSE = 1, -1\\n events = []\\n for l, r, h in buildings:\\n events.append([l, h, OPEN])\\n events.append([r, h, CLOSE])\\n events.sort()\\n\\n actives, ans, prev_maxh = [], [], None\\n for l, h, typ in events:\\n if typ == OPEN:\\n actives.append(h)\\n if typ == CLOSE:\\n actives.remove(h)\\n max_h = max(actives) if actives else 0\\n\\n if ans and l == ans[-1][0] and h >= ans[-1][1]:\\n ans.pop()\\n if (ans and h > ans[-1][1]) or not ans:\\n ans.append([l, max_h])\\n\\n # elif h >= max_h and (not ans or ans[-1][1] != max_h): \\n elif prev_maxh is None or max_h != prev_maxh:\\n ans.append([l, max_h])\\n \\n prev_maxh = max_h\\n\\n return ans\\n \\n\\n \\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"1232\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n li = []\\n for x,y,h in buildings:\\n li.append((x,-h))\\n li.append((y,h))\\n\\n li.sort()\\n\\n currActive = [0]\\n currMax = 0\\n ans = []\\n for n,h in li:\\n if h < 0:\\n currActive.append(-h)\\n if max(currActive) != currMax:\\n currMax = max(currActive)\\n ans.append([n,-h])\\n else:\\n currActive.remove(h)\\n if max(currActive) != currMax:\\n currMax = max(currActive)\\n ans.append([n,currMax])\\n return ans\\n\\n\\n\",\n \"runtime\": \"1232\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n OPEN, CLOSE = 1, -1\\n events = []\\n for l, r, h in buildings:\\n events.append([l, h, OPEN])\\n events.append([r, h, CLOSE])\\n events.sort()\\n\\n actives, ans, prev_maxh = [], [], None\\n for l, h, typ in events:\\n if typ == OPEN:\\n actives.append(h)\\n if typ == CLOSE:\\n actives.remove(h)\\n max_h = max(actives) if actives else 0\\n\\n if ans and l == ans[-1][0] and h >= ans[-1][1]:\\n ans.pop()\\n if (ans and h > ans[-1][1]) or not ans:\\n ans.append([l, max_h])\\n\\n elif prev_maxh is None or max_h != prev_maxh:\\n ans.append([l, max_h])\\n\\n prev_maxh = max_h\\n\\n return ans\\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 \"runtime\": \"1288\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n edges = []\\n for left, right, height in buildings:\\n edges.append([left, -height]) \\n edges.append([right, height]) \\n\\n edges.sort()\\n heap = [0]\\n previous_highest = 0\\n ret = []\\n for x, h in edges:\\n if h < 0:\\n heappush(heap, h)\\n else:\\n heap.remove(-h)\\n heapify(heap)\\n highest = -heap[0]\\n if highest != previous_highest:\\n previous_highest = highest\\n ret.append([x, highest])\\n return ret\",\n \"runtime\": \"1288\"\n },\n {\n \"code\": \"from typing import List\\nimport heapq\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Create a list of events\\n events = []\\n \\n for left, right, height in buildings:\\n events.append((left, -height)) # Start of a building\\n events.append((right, height)) # End of a building\\n \\n # Sort events first by x coordinate; if equal, then by height\\n events.sort(key=lambda x: (x[0], x[1]))\\n \\n # Result list and a max heap (priority queue)\\n result = []\\n max_heap = [0] # Heap initialized with 0 height\\n prev_max_height = 0\\n \\n # Process each event\\n for x, height in events:\\n if height < 0: # Start of a building\\n heapq.heappush(max_heap, height)\\n else: # End of a building\\n # Remove the height from the heap\\n max_heap.remove(-height)\\n heapq.heapify(max_heap)\\n \\n # Get the current maximum height\\n current_max_height = -max_heap[0]\\n \\n # If there's a change in height, record the point\\n if current_max_height != prev_max_height:\\n result.append([x, current_max_height])\\n prev_max_height = current_max_height\\n \\n return result\\n\",\n \"runtime\": \"1344\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n events = []\\n for l, r, h in buildings:\\n events.append((l, -h)) # Building start\\n events.append((r, h)) # Building end\\n \\n # Step 3: Sort events\\n events.sort(key=lambda x: (x[0], x[1]))\\n \\n # Step 4: Initialize heap and result\\n result = []\\n max_heap = [0] # Starts with ground level\\n prev_height = 0\\n \\n # Step 6: Process each event\\n for x, h in events:\\n if h < 0:\\n heapq.heappush(max_heap, h) # Building start, push height\\n else:\\n max_heap.remove(-h) # Building end, remove height\\n heapq.heapify(max_heap) # Re-heapify after removal\\n \\n current_height = -max_heap[0] # Max height is negative of min heap\\n \\n if current_height != prev_height:\\n result.append([x, current_height])\\n prev_height = current_height\\n \\n return result\",\n \"runtime\": \"1344\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n a = []\\n for l, r, h in buildings:\\n a.append((l, -h))\\n a.append((r, h))\\n a.sort()\\n\\n pq = [0]\\n ans = []\\n for x, h in a:\\n if h < 0:\\n tmp = pq[0]\\n heappush(pq, h)\\n if tmp != pq[0]:\\n ans.append([x, -h])\\n else:\\n tmp = pq[0]\\n pq.remove(-h)\\n heapify(pq) # !!!\\n if tmp != pq[0]:\\n ans.append([x, -pq[0]])\\n return ans\\n\",\n \"runtime\": \"1401\"\n },\n {\n \"code\": \"# https://github.com/mission-peace/interview/blob/master/python/geometry/skylinedrawing.py\\n\\nclass BuildingPoint(object):\\n\\n def __init__(self, point, is_start, height):\\n self.point = point\\n self.is_start = is_start\\n self.height = height\\n \\n def __lt__(self, other):\\n if self.point != other.point:\\n return self.point < other.point\\n elif self.is_start and other.is_start:\\n return -self.height < -other.height\\n elif not self.is_start and not other.is_start:\\n return self.height < other.height\\n elif self.is_start and not other.is_start:\\n return -self.height < other.height\\n else:\\n return self.height < -other.height\\n\\n # if self.is_start:\\n # h1 = -self.height\\n # else:\\n # h1 = self.height\\n\\n # if other.is_start:\\n # h2 = -other.height;\\n # else:\\n # h2 = other.height\\n\\n # return h1 < h2\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n sorted_buildings = []\\n for building in buildings:\\n sorted_buildings.append(BuildingPoint(building[0], True, building[2]))\\n sorted_buildings.append(BuildingPoint(building[1], False, building[2]))\\n\\n sorted_buildings.sort()\\n print([ (building.point, building.is_start, building.height) for building in sorted_buildings])\\n\\n result = []\\n heap = [0]\\n prev_max = 0\\n for building in sorted_buildings:\\n print(building.point, building.is_start, building.height)\\n if building.is_start:\\n heapq.heappush(heap, -building.height)\\n if heap and -heap[0] > prev_max:\\n print(\\\"add\\\")\\n result.append((building.point, -heap[0]))\\n prev_max = -heap[0]\\n else:\\n heap.remove(-building.height)\\n heapq.heapify(heap)\\n if heap and -heap[0] < prev_max:\\n print(\\\"remove\\\")\\n result.append((building.point, -heap[0]))\\n prev_max = -heap[0]\\n\\n return result\\n\\n\\n\\n # building_points = []\\n # for building in buildings:\\n # building_points.append(BuildingPoint(building[0], True, building[2]))\\n # building_points.append(BuildingPoint(building[1], False, building[2]))\\n\\n # building_points = sorted(building_points)\\n\\n # queue = {}\\n # queue[0] = 1\\n # prev_max_height = 0\\n # result = []\\n # for building_point in building_points:\\n # if building_point.is_start:\\n # if building_point.height in queue:\\n # queue[building_point.height] = queue[building_point.height] + 1\\n # else:\\n # queue[building_point.height] = 1\\n \\n # else:\\n # if queue[building_point.height] == 1:\\n # del queue[building_point.height]\\n # else:\\n # queue[building_point.height] = queue[building_point.height] - 1\\n\\n # current_max_height = max(queue.keys())\\n\\n # if prev_max_height != current_max_height:\\n # result.append([building_point.point, current_max_height])\\n # prev_max_height = current_max_height\\n # return result\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"1401\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n buildings_heights = []\\n for l, r, h in buildings:\\n buildings_heights.append([l, h])\\n buildings_heights.append([r, -h])\\n buildings_heights = sorted(buildings_heights, key=lambda x : (x[0], -x[1]))\\n cur_skyline = 0\\n heap = []\\n res = []\\n for idx, h in buildings_heights:\\n if h > 0:\\n heappush(heap, -h) # put highest in front\\n if -heap[0] != cur_skyline:\\n cur_skyline = -heap[0]\\n res.append([idx, cur_skyline])\\n else:\\n heap.remove(h)\\n heapify(heap)\\n if not heap:\\n cur_skyline = 0\\n res.append([idx, 0])\\n elif cur_skyline != -heap[0]:\\n cur_skyline = -heap[0]\\n res.append([idx, cur_skyline])\\n\\n return res\\n\\n\\n\",\n \"runtime\": \"1457\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n points = []# массив всех событий. событие - появление нового/конец старого здания\\n for building in buildings:\\n # с разными знаками сохраняем разные события, чтобы отличать их\\n points.append((building[0], -building[2]))\\n points.append((building[1], building[2]))\\n points.sort()# сортируем события по времени\\n \\n res = []\\n active_heights = [0]# массив действующих в текущей точке высот зданий (здания, которые касаются этой точки). Сейчас это list, поэтому сложность N^2. Можно использовать AVL дерево, тогда сложность N*logN.\\n current_height = 0\\n \\n i = 0\\n while i < len(points):\\n coord, height = points[i]\\n \\n # обновляем массив действующих в точке высот зданий\\n if height < 0:\\n active_heights.append(-height)\\n else:\\n # active_heights.remove(height) нельзя, так как это удалит все height, а может быть здание с такой же высотой, но ещё не закончившееся\\n for j in range(len(active_heights)):\\n if active_heights[j] == height:\\n active_heights.pop(j)\\n break\\n \\n if i + 1 < len(points) and points[i + 1][0] == coord:\\n # могут быть несколько событий в одной координате. Это условие позволит обновить active_heights с учётом всех событий, произошедших в coord. (иначе в цикле ниже на вход [[0,2,3],[2,5,3]] будет выход [[0,3],[2,0],[2,3],[5,0]])\\n i += 1\\n continue\\n \\n max_available_height = max(active_heights)\\n if max_available_height != current_height:\\n current_height = max_available_height\\n res.append([coord, current_height])\\n \\n i += 1\\n \\n return res\",\n \"runtime\": \"1457\"\n },\n {\n \"code\": \"from typing import List\\nfrom dataclasses import dataclass\\nfrom collections import deque\\nfrom enum import IntEnum\\n\\n\\nclass pType(IntEnum):\\n START:int = 0\\n END:int = 1\\n\\n\\n@dataclass(frozen=True)\\nclass Point:\\n x: int\\n y: int\\n p_type: pType = False\\n\\n\\nclass Solution:\\n def __init__(self):\\n self.buildings: List[List[int]] = None\\n self.points: List[Point] = []\\n self.que:deque = deque()\\n self.que_max_y:int = 0\\n self.skyline_debug: List[Point] = []\\n self.skyline: List[List[int, int]] = []\\n\\n def get_points(self):\\n for start, end, hight in self.buildings:\\n self.points.append(Point(start, hight, pType.START))\\n self.points.append(Point(end, hight, pType.END))\\n self.points.sort(key=lambda point: (\\n point.x,\\n point.p_type,\\n -point.y if point.p_type==pType.START else point.y)\\n )\\n\\n def get_max_y(self) -> int:\\n y_max:int = 0\\n for y in self.que:\\n if y > y_max:\\n y_max = y\\n return y_max\\n\\n def has_max_y_changed(self) -> bool:\\n max_y: int = self.get_max_y()\\n if max_y != self.que_max_y:\\n self.que_max_y = max_y\\n return True\\n return False\\n\\n def add_skyline_point(self, point):\\n if point.p_type == pType.START:\\n self.que.append(point.y)\\n else:\\n self.que.remove(point.y)\\n if self.has_max_y_changed():\\n if point.p_type == pType.START:\\n skyline_point = point\\n else:\\n skyline_point = Point(point.x, self.que_max_y, point.p_type)\\n self.skyline.append([point.x, self.que_max_y])\\n self.skyline_debug.append(skyline_point)\\n\\n def build_skyline(self):\\n for point in self.points:\\n self.add_skyline_point(point)\\n\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n self.buildings: List[List[int]] = buildings\\n self.get_points()\\n self.build_skyline()\\n return self.skyline\",\n \"runtime\": \"1570\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n\\n curr_heights = [0] # max heap of heights\\n start_max = [] # (start idx, curr max height)\\n end_height = [] # heap of (end idx, height of the end idx from input)\\n for i in range(len(buildings)):\\n a, b, h = buildings[i]\\n while len(end_height) > 0 and a > end_height[0][0]:\\n end, height = heapq.heappop(end_height)\\n curr_heights = list(curr_heights)\\n curr_heights.remove(-height)\\n heapq.heapify(curr_heights)\\n start_max.append([end, -curr_heights[0]])\\n heapq.heappush(curr_heights, -h)\\n if len(start_max) > 0 and start_max[-1][0] == a:\\n start_max.pop()\\n start_max.append([a, max(-curr_heights[0], h)])\\n heapq.heappush(end_height, (b, h)) \\n while end_height:\\n end, height = heapq.heappop(end_height)\\n curr_heights = list(curr_heights)\\n curr_heights.remove(-height)\\n heapq.heapify(curr_heights)\\n start_max.append([end, -curr_heights[0]])\\n # merge start_max\\n prev_max = -1\\n res = []\\n for i in range(len(start_max)):\\n if start_max[i][1] != prev_max:\\n res.append(start_max[i])\\n prev_max = start_max[i][1]\\n return res\\n\\n# time O(nlogn) space O(n)\\n\\n\\n \",\n \"runtime\": \"1626\"\n },\n {\n \"code\": \"class Solution:\\n def getNextPoints(self, points):\\n i = 0\\n while i < len(points):\\n r = []\\n while True:\\n r.append(points[i])\\n i += 1\\n if i >= len(points) or points[i][0] != points[i-1][0]:\\n yield r\\n break\\n\\n\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n points = []\\n for i, b in enumerate(buildings):\\n points.append((b[0], i, 0))\\n points.append((b[1], i, 1))\\n points.sort()\\n \\n opened = set()\\n res = []\\n for pp in self.getNextPoints(points):\\n for p in pp:\\n x, i, o = p\\n if o == 0:\\n opened.add(i)\\n else:\\n opened.remove(i)\\n h = [buildings[i][2] for i in opened]\\n if len(h) > 0:\\n mh = max(h)\\n else:\\n mh = 0\\n res.append([x, mh])\\n \\n\\n fr = []\\n fr.append(res[0])\\n for i in range(1, len(res)):\\n if res[i][1] != res[i-1][1]:\\n fr.append(res[i])\\n\\n return fr\\n \\n \\n \\n\",\n \"runtime\": \"1682\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n\\n height_points = []\\n for building in buildings:\\n height_points.append((building[0], building[2], 1))\\n height_points.append((building[1], building[2], -1))\\n\\n # sort buildings by x, height and start\\n height_points = sorted(height_points, key=lambda tup: (tup[0], -1*(tup[2] * tup[1]), -tup[2]))\\n\\n max_height = 0\\n heights = [0]\\n skyline = []\\n for x, height, start in height_points:\\n if start == 1:\\n heights.append(height)\\n if max(heights) > max_height:\\n skyline.append([x, height]) \\n else:\\n heights.remove(height)\\n if max(heights) < max_height:\\n skyline.append([x, max(heights)])\\n max_height = max(heights)\\n \\n return skyline\\n \",\n \"runtime\": \"1682\"\n },\n {\n \"code\": \"from collections import defaultdict\\nimport heapq\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n coords = set(x[0] for x in buildings)\\n coords = coords.union(set(x[1] for x in buildings))\\n\\n heap = []\\n i = 0\\n resp = []\\n for x in sorted(coords):\\n while i < len(buildings) and buildings[i][0] <= x:\\n heapq.heappush(heap, (buildings[i][1], buildings[i][2]))\\n i += 1\\n\\n while heap and heap[0][0] <= x:\\n heapq.heappop(heap)\\n\\n\\n currH = max(h[1] for h in heap) if heap else 0\\n if not resp or resp[-1][1] != currH:\\n resp.append([x, currH])\\n\\n\\n return resp\\n \\n\\n \",\n \"runtime\": \"1739\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n '''\\n 2 starts = [], ends = []\\n 3\\n 5\\n 7\\n 9\\n 12\\n 15\\n 19\\n 20\\n 24\\n '''\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n coords = set()\\n for s, e, h in buildings:\\n coords.add(s)\\n coords.add(e)\\n\\n \\n heap = []\\n i = 0\\n heights = []\\n for x in sorted(coords):\\n while i < len(buildings) and buildings[i][0] <= x:\\n heapq.heappush(heap, (buildings[i][1], buildings[i][2]))\\n i += 1\\n\\n while heap and heap[0][0] <= x:\\n heapq.heappop(heap)\\n\\n\\n currH = max(h[1] for h in heap) if heap else 0\\n if not heights or heights[-1][1] != currH:\\n heights.append([x, currH])\\n\\n\\n return heights\\n \\n\\n \",\n \"runtime\": \"1795\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n n = len(buildings)\\n buildings_close = sorted(buildings, key = lambda x: x[1])\\n max_heap = []\\n open_ptr, close_ptr = 0, 0\\n corners = []\\n def extract_max():\\n return (-1) * max_heap[0][0] if max_heap else 0\\n def open_heap(ptr):\\n orig_height = extract_max()\\n heappush(max_heap, ((-1) * buildings[ptr][2], \\n buildings[ptr][0], buildings[ptr][1]))\\n new_height = extract_max()\\n if(new_height > orig_height):\\n if((not corners) or (corners and corners[-1][0] != buildings[ptr][0])):\\n corners.append([buildings[ptr][0], new_height])\\n else:\\n corners[-1] = [buildings[ptr][0], new_height]\\n\\n def close_heap(ptr):\\n orig_height = extract_max()\\n idx = max_heap.index(((-1) * buildings_close[close_ptr][2], \\n buildings_close[close_ptr][0], buildings_close[close_ptr][1]))\\n max_heap[idx] = max_heap[-1]\\n max_heap.pop()\\n heapify(max_heap)\\n new_height = extract_max()\\n if(new_height < orig_height):\\n if((not corners) or (corners and corners[-1][0] != buildings_close[close_ptr][1])):\\n corners.append([buildings_close[close_ptr][1], new_height])\\n else:\\n corners[-1] = [buildings_close[close_ptr][1], new_height]\\n\\n while(open_ptr < n):\\n if(buildings[open_ptr][0] <= buildings_close[close_ptr][1]):\\n open_heap(open_ptr)\\n open_ptr += 1\\n else:\\n close_heap(close_ptr)\\n close_ptr += 1\\n\\n while(close_ptr < n):\\n close_heap(close_ptr)\\n close_ptr += 1\\n\\n return corners\\n\\n\\n\\n \",\n \"runtime\": \"1852\"\n },\n {\n \"code\": \"from heapq import heappush, heappop\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n positions = sorted(set(val for building in buildings for val in building[:2]))\\n curr_h = 0\\n ret = []\\n for x in positions:\\n max_h = 0\\n for left, right, h in buildings:\\n if left <= x and right > x and h > max_h:\\n max_h = h\\n if not ret or max_h != ret[-1][1]:\\n ret.append([x, max_h])\\n return ret\",\n \"runtime\": \"1908\"\n },\n {\n \"code\": \"class Solution:\\n def getNextPoints(self, points):\\n i = 0\\n while i < len(points):\\n r = []\\n while True:\\n r.append(points[i])\\n i += 1\\n if i >= len(points) or points[i][0] != points[i-1][0]:\\n yield r\\n break\\n\\n\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n points = []\\n for i, b in enumerate(buildings):\\n points.append((b[0], i, 0))\\n points.append((b[1], i, 1))\\n points.sort()\\n \\n opened = []\\n res = []\\n for pp in self.getNextPoints(points):\\n for p in pp:\\n x, i, o = p\\n if o == 0:\\n opened.append(i)\\n else:\\n opened = [j for j in opened if j != i]\\n h = [buildings[i][2] for i in opened]\\n if len(h) > 0:\\n mh = max(h)\\n else:\\n mh = 0\\n res.append([x, mh])\\n \\n\\n fr = []\\n fr.append(res[0])\\n for i in range(1, len(res)):\\n if res[i][1] != res[i-1][1]:\\n fr.append(res[i])\\n\\n return fr\\n \\n \\n \\n\",\n \"runtime\": \"1964\"\n },\n {\n \"code\": \"import heapq\\nclass TreeNode:\\n def __init__(self, val=None, left=None, right=None, parent=None):\\n self.val = val\\n self.left = left\\n self.right = right\\n self.parent = parent\\n\\nclass BST:\\n def __init__(self):\\n self.root = TreeNode(val=0)\\n def add(self, val):\\n if self.root == None:\\n self.root = TreeNode(val=val)\\n else:\\n p = self.root\\n while True:\\n if val > p.val:\\n if p.right is None:\\n p.right = TreeNode(val=val)\\n p.right.parent = p\\n break\\n else:\\n p = p.right\\n else:\\n if p.left is None:\\n p.left = TreeNode(val=val)\\n p.left.parent = p\\n break\\n else:\\n p = p.left\\n def find_node(self, val):\\n if val == self.root.val:\\n return root\\n p = self.root\\n while True:\\n if val > p.val:\\n p = p.right\\n elif val < p.val:\\n p = p.left\\n else:\\n return p\\n \\n def _find_largest_in_subtree(self, p):\\n while True:\\n if p.right is None:\\n return p\\n else:\\n return self._find_largest_in_subtree(p.right)\\n\\n def delete(self, val):\\n p = self.find_node(val)\\n if p.left is None:\\n if p.right is None:\\n if p.val > p.parent.val:\\n p.parent.right = None\\n else:\\n p.parent.left = None\\n else:\\n if p.val > p.parent.val:\\n p.parent.right = p.right\\n p.right.parent = p.parent\\n else:\\n p.parent.left = p.right\\n p.right.parent = p.parent\\n else:\\n largest_left = self._find_largest_in_subtree(p.left)\\n largest_left_val = largest_left.val\\n if largest_left.left is None:\\n if largest_left.val > largest_left.parent.val:\\n largest_left.parent.right = None\\n else:\\n largest_left.parent.left = None\\n else:\\n if largest_left.val > largest_left.parent.val:\\n largest_left.parent.right = largest_left.left\\n largest_left.left.parent = largest_left.parent\\n else:\\n largest_left.parent.left = largest_left.left\\n largest_left.left.parent = largest_left.parent\\n p.val = largest_left_val\\n \\n def largest_val(self):\\n return self._find_largest_in_subtree(self.root).val\\n \\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n \\n sorted_buildings = sorted(buildings, key=lambda x: (x[0], x[1], x[2]))\\n print (sorted_buildings)\\n \\n queue = []\\n heapq.heapify(queue)\\n \\n htree = BST()\\n res = [[-1,-1]]\\n i = 0\\n while i < len(sorted_buildings):\\n building_i = sorted_buildings[i]\\n if len(queue) == 0 or building_i[0] <= queue[0][0]:\\n heapq.heappush(queue, (building_i[1], building_i[2]))\\n htree.add(building_i[2])\\n current = htree.largest_val()\\n if current != res[-1][1]:\\n if building_i[0] == res[-1][0]:\\n res[-1][1] = max(res[-1][1], current)\\n else:\\n res.append([building_i[0], current])\\n # print (building_i[0], htree.largest_val())\\n i += 1\\n else:\\n end_pos, height = heapq.heappop(queue)\\n htree.delete(height)\\n current = htree.largest_val()\\n if current != res[-1][1]:\\n res.append([end_pos, current])\\n # print (end_pos, htree.largest_val())\\n \\n while len(queue) > 0:\\n end_pos, height = heapq.heappop(queue)\\n htree.delete(height)\\n current = htree.largest_val()\\n if current != res[-1][1]:\\n res.append([end_pos, current])\\n # print (end_pos, htree.largest_val())\\n \\n return res[1:]\",\n \"runtime\": \"2021\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n heights = []\\n for building in buildings:\\n start, end, height = building\\n heights.append((start, -height))\\n heights.append((end, height))\\n \\n heights.sort()\\n\\n res = []\\n pq, cur_height = [0], 0\\n for height in heights:\\n x, y = height\\n if y < 0:\\n heapq.heappush(pq, y)\\n else:\\n for idx, val in enumerate(pq):\\n if val == -y:\\n pq.pop(idx)\\n heapq.heapify(pq)\\n break\\n\\n if cur_height != pq[0]:\\n res.append((x, -pq[0]))\\n cur_height = pq[0]\\n \\n return res\",\n \"runtime\": \"2077\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n from sortedcontainers import SortedList\\n H = SortedList([0])\\n \\n remove = []\\n i = 0\\n res = []\\n \\n B = []\\n \\n for s, e, height in buildings:\\n B.append((s,height))\\n B.append((e,-height))\\n B.sort()\\n for s,height in B:\\n h = max(H)\\n if height < 0:\\n H.remove(-height)\\n else:\\n H.add(height)\\n if h != max(H):\\n res.append([s,max(H),\\\"ES\\\"[int(height > 0)]])\\n \\n K = [[-1,0]]\\n \\n res.sort(key=lambda r: (r[0], int(r[2] == 'S'), r[1]))\\n print(res)\\n for s,v,x in res:\\n \\n if s != K[-1][0]: K.append([s,v])\\n elif x == \\\"S\\\":\\n K[-1][1] = max(K[-1][1],v)\\n if K[-1][1] == K[-2][1]: K.pop()\\n \\n \\n return K[1:]\\n \\n \",\n \"runtime\": \"2133\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings):\\n # List to store the skyline key points\\n skyline = []\\n \\n # List to store the current active buildings\\n active_buildings = []\\n \\n # List to store the positions of all buildings\\n positions = sorted(set([b[0] for b in buildings] + [b[1] for b in buildings]))\\n \\n # Index to track the current building\\n i = 0\\n \\n # Loop through all positions\\n for pos in positions:\\n \\n # Add all buildings that start at this position\\n while i < len(buildings) and buildings[i][0] == pos:\\n active_buildings.append(buildings[i])\\n i += 1\\n \\n # Remove all buildings that end at or before this position\\n active_buildings = [b for b in active_buildings if b[1] > pos]\\n \\n # Find the highest active building at this position\\n max_height = max([b[2] for b in active_buildings] + [0])\\n \\n # If this height is different from the previous key point, add a new key point\\n if not skyline or skyline[-1][1] != max_height:\\n skyline.append([pos, max_height])\\n \\n # Ensure the last key point has y-coordinate 0\\n if skyline[-1][1] != 0:\\n skyline.append([positions[-1], 0])\\n \\n return skyline\\n\\n# Example usage:\\n# sol = Solution()\\n# print(sol.getSkyline([[2,9,10],[3,7,15],[5,12,12],[15,20,10],[19,24,8]]))\\n# print(sol.getSkyline([[0,2,3],[2,5,3]]))\",\n \"runtime\": \"2190\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # use max heap to store (height, end-point)\\n # when at a starting location, add to heap, take top of heap as max\\n # when at ending location, remove from heap with ending <= cur, take top of heap\\n loc = []\\n for i,[l,r,h] in enumerate(buildings):\\n loc.append((l, 0, i))\\n loc.append((r, 1, i))\\n loc.sort()\\n ans = []\\n heap = []\\n n = len(loc)\\n i = 0\\n cur_h = 0\\n while i < n:\\n cur_loc = loc[i][0]\\n j = i\\n while j < n and loc[j][0] == cur_loc:\\n _, oc, idx = loc[j]\\n if oc == 0:\\n # starting\\n end = buildings[idx][1]\\n h = buildings[idx][2]\\n heapq.heappush(heap, (-h, -end))\\n else:\\n # ending\\n while heap and -heap[0][1] <= cur_loc:\\n heapq.heappop(heap)\\n j += 1\\n if heap:\\n new_h = -heap[0][0]\\n else: new_h = 0\\n if new_h != cur_h:\\n ans.append([cur_loc, new_h])\\n cur_h = new_h\\n # ans.append([cur_loc, ])\\n #else: ans.append([cur_loc, 0])\\n i += 1\\n return ans\",\n \"runtime\": \"2246\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # use max heap to store (height, end-point)\\n # when at a starting location, add to heap, take top of heap as max\\n # when at ending location, remove from heap with ending <= cur, take top of heap\\n loc = []\\n for i,[l,r,h] in enumerate(buildings):\\n loc.append((l, 0, i))\\n loc.append((r, 1, i))\\n loc.sort()\\n ans = []\\n heap = []\\n n = len(loc)\\n i = 0\\n cur_h = 0\\n while i < n:\\n cur_loc = loc[i][0]\\n j = i\\n while j < n and loc[j][0] == cur_loc:\\n _, oc, idx = loc[j]\\n if oc == 0:\\n # starting\\n end = buildings[idx][1]\\n h = buildings[idx][2]\\n heapq.heappush(heap, (-h, -end))\\n else:\\n # ending\\n while heap and -heap[0][1] <= cur_loc:\\n heapq.heappop(heap)\\n j += 1\\n if heap:\\n new_h = -heap[0][0]\\n else: new_h = 0\\n if new_h != cur_h:\\n ans.append([cur_loc, new_h])\\n cur_h = new_h\\n i += 1\\n return ans\",\n \"runtime\": \"2302\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n skyline = []\\n transition_points = sorted(set([x[0] for x in buildings] + [x[1] for x in buildings]))\\n #print(transition_points)\\n start = 0\\n for count,point in enumerate(transition_points):\\n #for x,building in enumerate(buildings):\\n curr_height = 0\\n for x in range(start, len(buildings)):\\n if buildings[x][0] > point:\\n #start = x\\n break\\n #continue\\n if buildings[x][1] <= point:\\n continue\\n \\n if buildings[x][2] > curr_height:\\n curr_height = buildings[x][2]\\n \\n if len(skyline) == 0 or skyline[len(skyline)-1][1] != curr_height:\\n #print(count, curr_height, skyline)\\n skyline.append([point,curr_height])\\n \\n\\n \\\"\\\"\\\"last_x = buildings[-1][1]\\n #heights = [0,0 for x in range(0, last_x)]\\n heights = []\\n start_building = 0\\n x = 0\\n while x < last_x:\\n count = start_building\\n heights.append()\\n for building in buildings[start_building:]:\\n if building[0] > x:\\n start_building = count\\n break\\n elif building[1] < x:\\n continue\\n if len(heights) < \\n if building[2] > heights[x][1]:\\n heights[x] = (x,building[2])\\n x = building[1] \\n print(heights)\\n\\n skyline = []\\n prev_height = 0\\n for count,x in enumerate(heights):\\n if x > prev_height:\\n prev_height = x\\n skyline.append([count,x])\\n elif x < prev_height:\\n prev_height = x\\n skyline.append([count-1,x]) \\n skyline.append([last_x,0])\\\"\\\"\\\"\\n \\n return skyline\",\n \"runtime\": \"2359\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n edges = []\\n START, END = 0, 1\\n for i, building in enumerate(buildings):\\n edges.append((building[0], i, START))\\n edges.append((building[1], i, END))\\n edges.sort(key=lambda x: x[0])\\n \\n live, answer = [],[]\\n idx = 0\\n while idx < len(edges):\\n cur_x = edges[idx][0]\\n while idx < len(edges) and edges[idx][0] == cur_x:\\n if edges[idx][2] == START:\\n height = buildings[edges[idx][1]][2]\\n right = buildings[edges[idx][1]][1]\\n heapq.heappush(live, [-height, right])\\n\\n while live and live[0][1] <= cur_x:\\n heapq.heappop(live)\\n idx += 1\\n max_height = -live[0][0] if live else 0\\n if not answer or max_height != answer[-1][1]:\\n answer.append([cur_x, max_height])\\n return answer\",\n \"runtime\": \"2415\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Prepare a list of all the edges: \\n # (position, height) where height is negative for start edges\\n points = []\\n for L, R, H in buildings:\\n points.append((L, -H)) # start edge\\n points.append((R, H)) # end edge\\n \\n # Sort the points: first by position, then by height\\n points.sort()\\n \\n # Result list to store the skyline points\\n result = []\\n # Priority queue (max-heap) to keep track of heights\\n live = [(0, float('inf'))] # Initialize with ground level (height 0) extending infinitely\\n ongoing_height = 0\\n \\n # Process each point\\n for x, h in points:\\n if h < 0: # It's a start of a building\\n heapq.heappush(live, (h, x))\\n else: # It's the end of a building\\n for i in range(len(live)):\\n if live[i][0] == -h:\\n del live[i]\\n break\\n heapq.heapify(live) # Re-heapify after deletion\\n \\n # The current highest building is the one with the smallest negative height (max-heap)\\n current_max_height = -live[0][0] if live else 0\\n \\n # If the height changes at this x-coordinate, this is a key point in the skyline\\n if ongoing_height != current_max_height:\\n ongoing_height = current_max_height\\n result.append([x, ongoing_height])\\n \\n return result\\n\",\n \"runtime\": \"2471\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Prepare a list of all the edges: \\n # (position, height) where height is negative for start edges\\n points = []\\n for L, R, H in buildings:\\n points.append((L, -H)) # start edge\\n points.append((R, H)) # end edge\\n \\n # Sort the points: first by position, then by height\\n points.sort()\\n \\n # Result list to store the skyline points\\n result = []\\n # Priority queue (max-heap) to keep track of heights\\n live = [(0, float('inf'))] # Initialize with ground level (height 0) extending infinitely\\n ongoing_height = 0\\n \\n # Process each point\\n for x, h in points:\\n if h < 0: # It's a start of a building\\n heapq.heappush(live, (h, x))\\n else: # It's the end of a building\\n for i in range(len(live)):\\n if live[i][0] == -h:\\n del live[i]\\n break\\n heapq.heapify(live) # Re-heapify after deletion\\n \\n # The current highest building is the one with the smallest negative height (max-heap)\\n current_max_height = -live[0][0] if live else 0\\n \\n # If the height changes at this x-coordinate, this is a key point in the skyline\\n if ongoing_height != current_max_height:\\n ongoing_height = current_max_height\\n result.append([x, ongoing_height])\\n \\n return result\\n\",\n \"runtime\": \"2528\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n skyline = []\\n transition_points = sorted(set([x[0] for x in buildings] + [x[1] for x in buildings]))\\n #print(transition_points)\\n start = 0\\n for count,point in enumerate(transition_points):\\n #for x,building in enumerate(buildings):\\n curr_height = 0\\n for x in range(start, len(buildings)):\\n if buildings[x][0] > point:\\n #start = x\\n #break\\n continue\\n if buildings[x][1] <= point:\\n continue\\n \\n if buildings[x][2] > curr_height:\\n curr_height = buildings[x][2]\\n \\n if len(skyline) == 0 or skyline[len(skyline)-1][1] != curr_height:\\n #print(count, curr_height, skyline)\\n skyline.append([point,curr_height])\\n \\n\\n \\\"\\\"\\\"last_x = buildings[-1][1]\\n #heights = [0,0 for x in range(0, last_x)]\\n heights = []\\n start_building = 0\\n x = 0\\n while x < last_x:\\n count = start_building\\n heights.append()\\n for building in buildings[start_building:]:\\n if building[0] > x:\\n start_building = count\\n break\\n elif building[1] < x:\\n continue\\n if len(heights) < \\n if building[2] > heights[x][1]:\\n heights[x] = (x,building[2])\\n x = building[1] \\n print(heights)\\n\\n skyline = []\\n prev_height = 0\\n for count,x in enumerate(heights):\\n if x > prev_height:\\n prev_height = x\\n skyline.append([count,x])\\n elif x < prev_height:\\n prev_height = x\\n skyline.append([count-1,x]) \\n skyline.append([last_x,0])\\\"\\\"\\\"\\n \\n return skyline\",\n \"runtime\": \"2584\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n skyline = []\\n transition_points = sorted(set([x[0] for x in buildings] + [x[1] for x in buildings]))\\n print(transition_points)\\n start = 0\\n for count,point in enumerate(transition_points):\\n #for x,building in enumerate(buildings):\\n curr_height = 0\\n for x in range(start, len(buildings)):\\n if buildings[x][0] > point:\\n #start = x\\n #break\\n continue\\n if buildings[x][1] <= point:\\n continue\\n \\n if buildings[x][2] > curr_height:\\n curr_height = buildings[x][2]\\n \\n if len(skyline) == 0 or skyline[len(skyline)-1][1] != curr_height:\\n #print(count, curr_height, skyline)\\n skyline.append([point,curr_height])\\n \\n\\n \\\"\\\"\\\"last_x = buildings[-1][1]\\n #heights = [0,0 for x in range(0, last_x)]\\n heights = []\\n start_building = 0\\n x = 0\\n while x < last_x:\\n count = start_building\\n heights.append()\\n for building in buildings[start_building:]:\\n if building[0] > x:\\n start_building = count\\n break\\n elif building[1] < x:\\n continue\\n if len(heights) < \\n if building[2] > heights[x][1]:\\n heights[x] = (x,building[2])\\n x = building[1] \\n print(heights)\\n\\n skyline = []\\n prev_height = 0\\n for count,x in enumerate(heights):\\n if x > prev_height:\\n prev_height = x\\n skyline.append([count,x])\\n elif x < prev_height:\\n prev_height = x\\n skyline.append([count-1,x]) \\n skyline.append([last_x,0])\\\"\\\"\\\"\\n \\n return skyline\",\n \"runtime\": \"2640\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Sort the unique positions of all the edges.\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"2697\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n \\n positions = []\\n\\n for left, right, height in buildings:\\n positions.append(left)\\n positions.append(right)\\n positions = list(set(positions))\\n positions.sort()\\n\\n hor = {x:i for i,x in enumerate(positions)}\\n\\n heights = [0] * len(positions)\\n\\n for left,right, height in buildings:\\n\\n left_index = hor[left]\\n right_index = hor[right]\\n\\n for i in range(left_index,right_index):\\n heights[i] = max(heights[i],height)\\n \\n output = []\\n\\n for i in range(len(positions)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n if not output or output[-1][1] != curr_height:\\n output.append([curr_x,curr_height])\\n \\n return output\",\n \"runtime\": \"2753\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n\\n edge_index_map = {x: i for i, x in enumerate(positions)}\\n\\n heights = [0] * len(positions)\\n\\n # calculate the heightest among all buildings\\n for left, right, height in buildings:\\n\\n left_index = edge_index_map[left]\\n right_index = edge_index_map[right]\\n\\n for i in range(left_index, right_index):\\n heights[i] = max(heights[i], height)\\n\\n # generate final ans\\n ans = []\\n for i in range(len(heights)):\\n\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n if not ans or ans[-1][1] != curr_height:\\n ans.append([curr_x, curr_height])\\n \\n return ans\\n\\n\\n\",\n \"runtime\": \"2809\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Sort the unique positions of all the edges.\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\\n\\n # Solution with priority queue, doesn't work for edge case\\n # buildings_sorted = []\\n # for b in buildings:\\n # heapq.heappush(buildings_sorted, b)\\n \\n # height_intervals = []\\n # while buildings_sorted:\\n # b = heapq.heappop(buildings_sorted)\\n # if not height_intervals:\\n # height_intervals.append(b)\\n # elif b[0] > height_intervals[-1][1]:\\n # height_intervals.append(b)\\n # print(b)\\n # else:\\n # if b[2] == height_intervals[-1][2]:\\n # height_intervals[-1][1] = max(height_intervals[-1][1], b[1])\\n # elif b[2] > height_intervals[-1][2]:\\n # if b[1] < height_intervals[-1][1]:\\n # heapq.heappush(buildings_sorted, [b[1], height_intervals[-1][1], height_intervals[-1][2]])\\n \\n # if b[0] > height_intervals[-1][0]:\\n # height_intervals[-1][1] = b[0]\\n # height_intervals.append(b)\\n # else:\\n # height_intervals[-1][1] = b[1]\\n # height_intervals[-1][2] = b[2]\\n # print(b)\\n # else:\\n # if b[1] > height_intervals[-1][1]:\\n # heapq.heappush(buildings_sorted, [height_intervals[-1][1], b[1], b[2]])\\n # print(height_intervals)\\n \\n # skyline = []\\n # prev_building_end = height_intervals[0][0]\\n # for h in height_intervals:\\n # if h[0] > prev_building_end:\\n # skyline.append([prev_building_end, 0])\\n # skyline.append([h[0], h[2]])\\n # prev_building_end = h[1]\\n # skyline.append([height_intervals[-1][1], 0])\\n # return skyline\\n\\n \\n \\n # Memoery limit exceeded\\n # max_right = 0\\n # for b in buildings:\\n # max_right = max(max_right, b[1])\\n \\n # height = [0] * (max_right + 2)\\n # for b in buildings:\\n # for i in range(b[0], b[1]+1):\\n # height[i] = max(height[i], b[2])\\n # #print(height)\\n \\n # skyline = []\\n # prev_height = 0\\n # j = 0\\n # while j < len(height):\\n # #print(j, height[j])\\n # if height[j] > 0 or (height[j] == 0 and len(skyline) > 0):\\n # if height[j] > prev_height:\\n # skyline.append([j, height[j]])\\n # else:\\n # skyline.append([j-1, height[j]])\\n # end = j\\n # while end < len(height) and height[end] == height[j]:\\n # end += 1\\n # prev_height = height[j]\\n # j = end\\n # else:\\n # prev_height = height[j]\\n # j += 1\\n \\n # return skyline\\n \",\n \"runtime\": \"2866\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Sort the unique positions of all the edges.\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\\n \",\n \"runtime\": \"2922\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Sort the unique positions of all the edges.\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"2979\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n\\n edgeMap = {x: i for i, x in enumerate(positions)}\\n heights = [0 for _ in range(len(positions))]\\n for left, right, height in buildings:\\n leftIdx = edgeMap[left]\\n rightIdx = edgeMap[right]\\n\\n for i in range(leftIdx, rightIdx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n for i in range(len(heights)):\\n pos = positions[i]\\n height = heights[i]\\n\\n if not answer or answer[-1][1] != height:\\n answer.append([pos, height])\\n \\n return answer\",\n \"runtime\": \"3035\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Sort the unique positions of all the edges.\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"3091\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Sort the unique positions of all the edges.\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"3148\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n \\n cps = list(set([x for building in buildings for x in building[:2]]))\\n cps.sort()\\n cp_dict = {x:i for i, x in enumerate(cps)}\\n\\n heights = [0]*len(cps)\\n for left, right, height in buildings:\\n left_idx = cp_dict[left]\\n right_idx = cp_dict[right]\\n for i in range(left_idx,right_idx):\\n heights[i] = max(heights[i],height)\\n\\n answers = []\\n for i in range(len(heights)):\\n cur = heights[i]\\n pos = cps[i]\\n if not answers or cur !=answers[-1][-1]:\\n answers.append([pos,cur])\\n\\n return answers\",\n \"runtime\": \"3204\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Sort the unique positions of all the edges.\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"3260\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n \\n positions = []\\n\\n for left, right, height in buildings:\\n positions.append(left)\\n positions.append(right)\\n positions = list(set(positions))\\n positions.sort()\\n\\n hor = {x:i for i,x in enumerate(positions)}\\n\\n heights = [0] * len(positions)\\n\\n for left,right, height in buildings:\\n\\n left_index = hor[left]\\n right_index = hor[right]\\n\\n for i in range(left_index,right_index):\\n heights[i] = max(heights[i],height)\\n \\n output = []\\n\\n for i in range(len(positions)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n if not output or output[-1][1] != curr_height:\\n output.append([curr_x,curr_height])\\n \\n return output\",\n \"runtime\": \"3317\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"3373\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Sort the unique positions of all the edges.\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"3429\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Sort the unique positions of all the edges.\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"3486\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # use a huge array to store the height of each point\\n # query an interval?\\n edge_pts = set()\\n for s, e, h in buildings:\\n edge_pts.add(s)\\n edge_pts.add(e)\\n edge_pts = list(edge_pts)\\n edge_pts.sort()\\n\\n edge_pts_to_heights_map = {pt: i for i, pt in enumerate(edge_pts)}\\n heights = [0 for i in range(len(edge_pts))]\\n\\n for s, e, h in buildings:\\n index_s = edge_pts_to_heights_map[s]\\n index_e = edge_pts_to_heights_map[e]\\n for i in range(index_s, index_e):\\n heights[i] = max(heights[i], h)\\n \\n ans = []\\n\\n for i in range(len(heights)):\\n pt = edge_pts[i]\\n h = heights[i]\\n if not ans or h != heights[i-1]:\\n ans.append([pt, h])\\n return ans \\n\\n\\n \",\n \"runtime\": \"3542\"\n },\n {\n \"code\": \"from heapq import heappush, heappop\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n positions = sorted(set(val for building in buildings for val in building[:2]))\\n edge_indexes = {x: i for i, x in enumerate(positions)}\\n heights = [0] * len(positions)\\n for left, right, h in buildings:\\n l_idx = edge_indexes[left]\\n r_idx = edge_indexes[right]\\n for i in range(l_idx, r_idx):\\n heights[i] = max(heights[i], h)\\n ret = []\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n if not ret or ret[-1][1] != curr_height:\\n ret.append([curr_x, curr_height])\\n return ret\",\n \"runtime\": \"3598\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Sort the unique positions of all the edges.\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"3655\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # brute force Solution\\n positions = set()\\n for x, y, h in buildings:\\n positions.add(x)\\n positions.add(y)\\n \\n positions = sorted(list(positions))\\n \\n edge_index_map = {x:i for i,x in enumerate(positions)}\\n heights = [0]*len(positions)\\n\\n for x, y, h in buildings:\\n left = edge_index_map[x]\\n right = edge_index_map[y]\\n\\n for i in range(left, right):\\n heights[i] = max(h, heights[i])\\n\\n # print(positions, \\\"\\\\n\\\", heights)\\n result = []\\n for x, h in zip(positions, heights):\\n if not result or result[-1][1] != h:\\n result.append((x, h))\\n return result\\n\\n\\n \\n \\n # # positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n # print(positions)\\n # events = []\\n # for x, y, h in buildings:\\n # events.append((x, -h, y))\\n # events.append((y, 0, 0))\\n # events.sort()\\n\\n # result = []\\n # max_height = 0\\n # heap = [[0, float('inf')]]\\n # # print(events)\\n # # sorted\\n # for x, nh, y in events:\\n # # height building has ended y < x # then height will change \\n # while heap[0][1] <= x:\\n # heapq.heappop(heap) # remove the height which are finished\\n\\n # # push new value into the pririty queue \\n # if nh != 0:\\n # heapq.heappush(heap, [nh, y]) # height, right\\n\\n # # print(x, nh, max_height)\\n # # priority queue\\n # if -heap[0][0] != max_height:\\n # max_height = -heap[0][0] #update max_height\\n # result.append([x, max_height])\\n # # print(result)\\n # return result\\n\",\n \"runtime\": \"3711\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Sort the unique positions of all the edges.\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"3767\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Sort the unique positions of all the edges.\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"3824\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n unique_x = sorted(list(set([x for building in buildings for x in building[:2]])))\\n # sorted array of all possible unique x points\\n # map x coordinate to index in list?\\n edge_map = {x : i for i, x in enumerate(unique_x)}\\n\\n unique_heights = [0] * len(unique_x)\\n # will store y value for each unique x value\\n # now iterate over buildings, and update height\\n for left, right, height in buildings:\\n lefti = edge_map[left]\\n righti = edge_map[right]\\n\\n for uniquei in range(lefti, righti):\\n unique_heights[uniquei] = max(unique_heights[uniquei], height)\\n # heights now holds the skyline at each unique x.\\n # now construct array of differences\\n result = []\\n for i in range(len(unique_heights)):\\n currentheight = unique_heights[i]\\n currentx = unique_x[i]\\n\\n if not result or result[-1][1] != currentheight:\\n result.append([currentx, currentheight])\\n return result\\n\\n\\n \",\n \"runtime\": \"3880\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n x_coords = set()\\n for building in buildings:\\n for x in building[:2]:\\n x_coords.add(x)\\n x_coords = sorted(list(x_coords))\\n\\n edge_map = {}\\n for i, n in enumerate(x_coords):\\n edge_map[n] = i\\n\\n ht = [0]*len(edge_map)\\n\\n for l, r, h in buildings:\\n # find max in range left to right?\\n for i in range(edge_map[l], edge_map[r]):\\n ht[i] = max(ht[i], h)\\n ans = []\\n\\n for i in range(len(ht)):\\n if not ans or ans[-1][1] != ht[i]:\\n ans.append([x_coords[i], ht[i]])\\n return ans\",\n \"runtime\": \"3936\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n positions=list(set([x for building in buildings for x in building[:2]]))\\n positions.sort()\\n dic={x:i for i,x in enumerate(positions)}\\n heights=[0]*len(positions)\\n for left,right,height in buildings:\\n l_idx=dic[left]\\n r_idx=dic[right]\\n for i in range(l_idx,r_idx):\\n heights[i]=max(heights[i],height)\\n ans=[]\\n for i in range(len(heights)):\\n current_height=heights[i]\\n current_position=positions[i]\\n if not ans or current_height!=ans[-1][1]:\\n ans.append([current_position,current_height])\\n return ans\\n \",\n \"runtime\": \"3993\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Sort the unique positions of all the edges.\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"4049\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n\\n a = set([x for building in buildings for x in building[:2]])\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n heights = [0] * len(positions)\\n\\n for left, right, height in buildings:\\n\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"4106\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n heights = [0] * len(positions)\\n \\n for left, right, height in buildings:\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"4162\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n secondary = []\\n for i, el in enumerate(buildings):\\n secondary.append((el[0],i,el[2]))\\n secondary.append((el[1],i,el[2]))\\n secondary = sorted(secondary)\\n fills = set()\\n out = []\\n for i in range(len(secondary)-1):\\n el1 = secondary[i]\\n el2 = secondary[i+1]\\n if el1[1] in fills:\\n fills.remove(el1[1])\\n else:\\n fills.add(el1[1])\\n if el1[0] == el2[0]:\\n continue\\n H = 0\\n for ind in fills:\\n H = max(H, buildings[ind][2])\\n out.append([el1[0], el2[0], H])\\n # fuse\\n for j in range(len(out)-1, 0, -1):\\n if out[j][2] == out[j-1][2]:\\n out[j-1][1] = out[j][1]\\n out.pop(j) \\n res = []\\n l = len(out)\\n for i in range(l):\\n build = out[i]\\n res.append([build[0], build[2]])\\n if i>0 and build[0] == out[i-1][1] and build[2] == out[i-1][2]:\\n res.pop()\\n elif i<l-1 and build[1] < out[i+1][0]:\\n res.append([build[1],0])\\n res.append([build[1],0])\\n return res\\n \",\n \"runtime\": \"4218\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # build edge for x position\\n ans = []\\n\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n\\n # build edge to index mapping for future reference\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n heights = [0] * len(positions)\\n # iterate through edge, find out each edge's highest and build y position\\n for left, right, height in buildings:\\n left_index = edge_index_map[left]\\n right_index = edge_index_map[right]\\n\\n for i in range(left_index, right_index):\\n heights[i] = max(height, heights[i])\\n \\n # map x and y position\\n for i in range(len(heights)):\\n curr_h = heights[i]\\n curr_x = positions[i]\\n\\n if not ans or ans[-1][1] != curr_h:\\n ans.append([curr_x, curr_h])\\n\\n return ans\",\n \"runtime\": \"4275\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n edges = set()\\n for building in buildings:\\n edges.add(building[0])\\n edges.add(building[1])\\n\\n edges = sorted(list(edges))\\n indices = {edge: i for i, edge in enumerate(edges)}\\n\\n heights = [0] * len(edges)\\n\\n for l, r, h in buildings:\\n l_idx = indices[l]\\n r_idx = indices[r]\\n for i in range(l_idx, r_idx):\\n heights[i] = max(heights[i], h)\\n \\n res = []\\n prev = -1\\n for i in range(len(heights)):\\n if prev != heights[i]:\\n prev = heights[i]\\n res.append([edges[i], prev])\\n return res\\n\\n\\n\\n\\n\",\n \"runtime\": \"4331\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n if not buildings:\\n return []\\n\\n # get sorted unique positions of buildings\\n positions = []\\n for left, right, _ in buildings:\\n positions.append(left)\\n positions.append(right)\\n positions = sorted(set(positions))\\n\\n # hashtable that maps from building position to index\\n pos_idx_map = {pos: idx for idx, pos in enumerate(positions)}\\n\\n # max heights array\\n max_heights = [0] * len(positions)\\n\\n # iterate over every building\\n for left, right, height in buildings:\\n \\n # get left and right indices\\n left_idx = pos_idx_map[left]\\n right_idx = pos_idx_map[right]\\n\\n # update maximum height within the heights array\\n for idx in range(left_idx, right_idx):\\n max_heights[idx] = max(max_heights[idx], height)\\n \\n # assemble the result\\n result = [[positions[0], max_heights[0]]]\\n for position, height in zip(positions[1:], max_heights[1:]):\\n # only add if the height has changed\\n prev_height = result[-1][1]\\n if height != prev_height:\\n result.append([position, height])\\n return result\\n\",\n \"runtime\": \"4387\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n heights = [0] * len(positions)\\n \\n for left, right, height in buildings:\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\",\n \"runtime\": \"4387\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n pos_to_idx = {x : i for i,x in enumerate(positions)}\\n heights = [0 for i in range(len(positions))]\\n\\n for building in buildings:\\n l = pos_to_idx[building[0]]\\n r = pos_to_idx[building[1]]\\n for i in range(l, r):\\n heights[i] = max(heights[i], building[2])\\n\\n ans = [] \\n for i in range(len(heights)):\\n if not ans or ans[-1][1] != heights[i]:\\n ans.append([positions[i], heights[i]])\\n\\n return ans\",\n \"runtime\": \"4444\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n if not buildings:\\n return None\\n\\n edgeSet = set()\\n for left, right, _ in buildings:\\n if left not in edgeSet:\\n edgeSet.add(left)\\n if right not in edgeSet:\\n edgeSet.add(right)\\n positions = sorted(list(edgeSet))\\n \\n mp = {x: i for i, x in enumerate(positions)}\\n heights = [0] * len(positions)\\n \\n for left, right, height in buildings:\\n idxLeft = mp[left]\\n idxRight = mp[right]\\n \\n for i in range(idxLeft, idxRight):\\n heights[i] = max(heights[i], height)\\n # print(heights)\\n \\n ans = []\\n for i, h in enumerate(heights):\\n currX = positions[i]\\n \\n if not ans or ans[-1][1] != h:\\n ans.append([currX, h])\\n \\n return ans\",\n \"runtime\": \"4444\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n key_points = set()\\n\\n for b in buildings:\\n key_points.add(b[0])\\n key_points.add(b[1])\\n\\n key_points = list(key_points)\\n key_points.sort()\\n length = len(key_points)\\n\\n key_points_to_idx = {key_points[i]: i for i in range(length)}\\n\\n height = [0] * length\\n for b in buildings:\\n for i in range(key_points_to_idx[b[0]], key_points_to_idx[b[1]]):\\n height[i] = max(height[i], b[2])\\n\\n skyline = [[key_points[0], height[0]]]\\n for i in range(1, len(height)):\\n if height[i] != height[i - 1]:\\n skyline.append([key_points[i], height[i]])\\n\\n return skyline\\n\",\n \"runtime\": \"4500\"\n },\n {\n \"code\": \"import heapq\\nfrom functools import cmp_to_key\\n\\nclass MaxHeapObj(object):\\n def __init__(self, val): self.val = val\\n def __lt__(self, other): return self.val > other.val\\n def __eq__(self, other): return self.val == other.val\\n def __str__(self): return str(self.val)\\nfrom collections import defaultdict\\n\\n# done by referring answer, to improve\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n coords = set()\\n for building in buildings:\\n coords.add(building[0])\\n coords.add(building[1]-1)\\n coords.add(building[1])\\n cands = sorted(coords)\\n index = {x: i for i, x in enumerate(cands)}\\n n = len(index)\\n st = [0] * n # naive segment arr, no range update so no need become tree\\n for building in buildings:\\n for i in range(index[building[0]], index[building[1]-1] + 1):\\n st[i] = max(st[i], building[2])\\n ans = []\\n for i in range(0, len(cands)):\\n h = st[i]\\n # only append start point of new height\\n if len(ans) == 0 or h != ans[-1][1]:\\n ans.append((cands[i], h))\\n \\n return ans\\n \\n\\n def getSkylineWithSegment(self, buildings: List[List[int]]) -> List[List[int]]:\\n change_point = []\\n for building in buildings:\\n change_point.append((building[0], building[2], 1))\\n change_point.append((building[1], building[2], -1))\\n change_point.sort(key=lambda x:(x[0],-x[1],-x[2]))\\n res = []\\n heap = []\\n remove_heap = defaultdict(int)\\n for i, (position, height, flag) in enumerate(change_point):\\n if flag == 1:\\n heapq.heappush(heap, MaxHeapObj(height))\\n # remove a building\\n else:\\n remove_heap[height] += 1\\n while len(heap) > 0 and remove_heap[heap[0].val] != 0:\\n el = heapq.heappop(heap)\\n remove_heap[el.val] -= 1\\n\\n # no building at the current position\\n if len(heap) == 0:\\n res.append([position, 0])\\n else:\\n # take consideration of the first and the last one\\n # if the current max height equals the last height(two adjacent buildings), continue\\n # if the current position has multiple operations(only take the highest one), continue (if height drop we wanna get the drop)\\n if i == 0 or i == len(change_point)-1 or (heap[0].val != res[-1][1] and position != change_point[i+1][0]):\\n res.append([position, heap[0].val]) # current max height\\n\\n return res\\n \\n \",\n \"runtime\": \"4500\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":104,"string":"104"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def getSkyline(self, buildings: list[list[int]]) -> list[list[int]]:\n n = len(buildings)\n if n == 0:\n return []\n if n == 1:\n left, right, height = buildings[0]\n return [[left, height], [right, 0]]\n\n left = self.getSkyline(buildings[:n // 2])\n right = self.getSkyline(buildings[n // 2:])\n return self._merge(left, right)\n\n def _merge(self, left: list[list[int]],\n right: list[list[int]]) -> list[list[int]]:\n ans = []\n i = 0 # left's index\n j = 0 # right's index\n leftY = 0\n rightY = 0\n\n while i < len(left) and j < len(right):\n # Choose the powith smaller x\n if left[i][0] < right[j][0]:\n leftY = left[i][1] # Update the ongoing `leftY`.\n self._addPoint(ans, left[i][0], max(left[i][1], rightY))\n i += 1\n else:\n rightY = right[j][1] # Update the ongoing `rightY`.\n self._addPoint(ans, right[j][0], max(right[j][1], leftY))\n j += 1\n\n while i < len(left):\n self._addPoint(ans, left[i][0], left[i][1])\n i += 1\n\n while j < len(right):\n self._addPoint(ans, right[j][0], right[j][1])\n j += 1\n\n return ans\n\n def _addPoint(self, ans: list[list[int]], x: int, y: int) -> None:\n if ans and ans[-1][0] == x:\n ans[-1][1] = y\n return\n if ans and ans[-1][1] == y:\n return\n ans.append([x, y])","memory":"21000"},{"code":"class Solution:\n def getSkyline(self, b: List[List[int]]) -> List[List[int]]:\n \n res=[]\n while(b):\n curr=heapq.heappop(b)\n if(len(res)==0): \n res.append(curr)\n continue\n prev=res[-1]\n if(prev[2]==curr[2] and prev[1]>=curr[0]):\n newPrev=[prev[0],curr[1],prev[2]]\n res[-1]=newPrev\n elif(prev[1]<=curr[0]):res.append(curr)\n elif(prev[2]<curr[2]):\n newPrev=[prev[0],curr[0],prev[2]]\n newCurr=[curr[0],curr[1],curr[2]]\n if(prev[1]>curr[1]): heapq.heappush(b,[curr[1],prev[1],prev[2]])\n if(newPrev[0]!=newPrev[1]):res[-1]=newPrev\n else:res=res[:-1]\n heapq.heappush(b,newCurr)\n elif(prev[1]<curr[1]):\n newPrev=[prev[0],prev[1],prev[2]]\n heapq.heappush(b,[prev[1],curr[1],curr[2]])\n res[-1]=newPrev\n res2=[]\n prev=-1\n for i in range(len(res)):\n curr=res[i]\n if(prev!=-1 and prev[1]<curr[0]):\n res2.append([prev[1],0])\n res2.append([curr[0],curr[2]])\n prev=curr\n res2.append([prev[1],0])\n \n return res2\n\n\n\n\n\n # 2 - 9 10\n # 3 - 7 15\n # 5 - 12 12\n # 15 - 20 10\n # 19 - 24 8\n\n\n # 3 - 7 15\n # 7 - 12 12\n # 2 - 3 10\n # 15 - 20 10\n # 20 - 24 8\n\n\n # 2 - 3 10\n # 3 - 7 15\n # 7 - 12 12\n\n # 15 - 20 10\n # 20 - 24 8\n\n\n # 2 10\n # 3 15\n # 7 12\n # 12 0\n # 15 10\n # 20 8\n # 24 0","memory":"21100"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n\n def splitParts(a, b):\n ax1, ax2, ah = a\n bx1, bx2, bh = b\n\n if bx2<=ax2:\n return [[ax1, bx1, ah], [bx1, bx2, max(ah, bh)], [bx2, ax2, ah]]\n else:\n return [[ax1, bx1, ah], [bx1, ax2, max(ah, bh)], [ax2, bx2, bh]]\n\n heap = buildings\n heap.append([0, sys.maxsize, 0])\n heapify(heap)\n res = []\n while heap:\n a = heappop(heap)\n ax1, ax2, ah = a\n if heap:\n b = heappop(heap)\n bx1, bx2, bh = b\n else:\n if ax1!=ax2:\n res.append(a)\n break\n\n\n\n if ax2<=bx1:\n if ax1!=ax2:\n res.append(a)\n heappush(heap, b)\n else:\n parts = splitParts(a, b)\n for p in parts:\n if p[0]!=p[1]:\n heappush(heap, p)\n \n prev = [0, 0, 0]\n ans = []\n for r in res:\n if r[2]!=prev[2]:\n prev = r\n ans.append([r[0], r[2]])\n\n return ans\n \n\n ","memory":"21200"},{"code":"class Solution:\n def getSkyline(self, buildings: list[list[int]]) -> list[list[int]]:\n n = len(buildings)\n if n == 0:\n return []\n if n == 1:\n left, right, height = buildings[0]\n return [[left, height], [right, 0]]\n\n left = self.getSkyline(buildings[:n // 2])\n right = self.getSkyline(buildings[n // 2:])\n return self._merge(left, right)\n\n def _merge(self, left: list[list[int]],\n right: list[list[int]]) -> list[list[int]]:\n ans = []\n i = 0 # left's index\n j = 0 # right's index\n leftY = 0\n rightY = 0\n\n while i < len(left) and j < len(right):\n # Choose the powith smaller x\n if left[i][0] < right[j][0]:\n leftY = left[i][1] # Update the ongoing `leftY`.\n self._addPoint(ans, left[i][0], max(left[i][1], rightY))\n i += 1\n else:\n rightY = right[j][1] # Update the ongoing `rightY`.\n self._addPoint(ans, right[j][0], max(right[j][1], leftY))\n j += 1\n\n while i < len(left):\n self._addPoint(ans, left[i][0], left[i][1])\n i += 1\n\n while j < len(right):\n self._addPoint(ans, right[j][0], right[j][1])\n j += 1\n\n return ans\n\n def _addPoint(self, ans: list[list[int]], x: int, y: int) -> None:\n if ans and ans[-1][0] == x:\n ans[-1][1] = y\n return\n if ans and ans[-1][1] == y:\n return\n ans.append([x, y])","memory":"21500"},{"code":"import heapq\n\nclass Solution:\n\n def getSkyline(self, buildings):\n # Convert buildings to events\n events = []\n for left, right, height in buildings:\n events.append((left, -height, right)) # Start event\n events.append((right, 0, 0)) # End event\n events.sort() # Sort events by x-coordinate\n \n result = []\n heap = [(0, float('inf'))] # (height, ending x-coordinate)\n \n for x, negH, r in events:\n while heap[0][1] <= x: # Remove ended buildings\n heapq.heappop(heap)\n \n if negH: # If it's a start event\n heapq.heappush(heap, (negH, r))\n \n if result and result[-1][1] == -heap[0][0]:\n continue\n \n result.append([x, -heap[0][0]])\n \n return result","memory":"21600"},{"code":"import heapq\n\nclass Solution:\n def getSkyline(self, buildings):\n events = []\n for L, R, H in buildings:\n events.append((L, -H, R))\n events.append((R, 0, 0))\n events.sort()\n \n res = []\n heap = [(0, float('inf'))]\n \n i = 0\n n = len(events)\n while i < n:\n x = events[i][0]\n while i < n and events[i][0] == x:\n H, R = events[i][1], events[i][2]\n if H != 0:\n heapq.heappush(heap, (H, R))\n i += 1\n while heap and heap[0][1] <= x:\n heapq.heappop(heap)\n curr_height = -heap[0][0]\n if not res or res[-1][1] != curr_height:\n res.append([x, curr_height])\n return res\n","memory":"21600"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n if len(buildings) == 0: \n return []\n \n buildings.sort(key=lambda v: v[2])\n pos, height = [0], [0]\n for left, right, h in buildings: \n i = bisect_left(pos, left)\n j = bisect_right(pos, right)\n height[i:j] = [h, height[j-1]]\n pos[i:j] = [left, right]\n print(height, pos)\n res = []\n prev = 0\n for v, h in zip(pos, height): \n if h != prev:\n res.append([v,h]) \n prev = h\n \n return res","memory":"21700"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n import heapq as hq\n events = []\n for start, end, height in buildings:\n events.append((start, height))\n events.append((end, -height))\n\n events.sort()\n live = []\n past = []\n ans = []\n\n i = 0 \n while i < len(events):\n # current event under consideration\n curr_x = events[i][0]\n\n # edge case handling: same starting point\n while i < len(events) and events[i][0] == curr_x:\n height = events[i][1]\n if height > 0: \n hq.heappush(live, -height) # alive queue, maxheap\n else:\n hq.heappush(past, height) # dead queue, minheap\n i += 1\n \n # Now events[i][0] != curr_x\n while past and past[0] == live[0]:\n hq.heappop(live)\n hq.heappop(past)\n\n max_height = -live[0] if live else 0\n if not ans or ans[-1][1] != max_height:\n ans.append([curr_x, max_height])\n\n return ans\n\n\n\n ","memory":"21700"},{"code":"import heapq\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Generate events\n events = []\n for L, R, H in buildings:\n events.append((L, -H, R)) # Start event\n events.append((R, 0, 0)) # End event\n # Sort events\n events.sort()\n # Initialize result and heap\n res = []\n heap = [(0, float('inf'))] # (negH, R)\n for x, negH, R in events:\n # Remove buildings that have ended\n while heap[0][1] <= x:\n heapq.heappop(heap)\n if negH < 0:\n heapq.heappush(heap, (negH, R))\n currH = -heap[0][0]\n if not res or res[-1][1] != currH:\n res.append([x, currH])\n return res","memory":"21800"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n events = []\n \n # Add both the start (negative height) and the end (positive height) events\n for left, right, height in buildings:\n events.append((left, -height, right)) # Start of a building\n events.append((right, 0, 0)) # End of a building\n \n # Sort events:\n # 1. By x coordinate\n # 2. In case of tie, prioritize starting over ending buildings (negative height first)\n # 3. In case of tie, taller buildings come first (-height, so it's sorted by height in descending order)\n events.sort()\n\n # Result list and max-heap (priority queue)\n result = []\n heap = [(0, float('inf'))] # (height, end of building)\n \n # Process all events\n for x, h, r in events:\n # Add the new building to the heap (if it's a start event)\n if h != 0:\n heapq.heappush(heap, (h, r))\n # Remove the buildings that are already ended\n while heap[0][1] <= x:\n heapq.heappop(heap)\n \n # If the current maximum height changes, add the point to the result\n max_height = -heap[0][0]\n if not result or result[-1][1] != max_height:\n result.append([x, max_height])\n \n return result\n ","memory":"21800"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # List to hold the result\n result = []\n \n # List to store both starting and ending events of buildings\n events = []\n \n # For each building, generate two events: start (left, -height, right) and end (right, 0, 0)\n for left, right, height in buildings:\n events.append((left, -height, right)) # starting event (negative height for start)\n events.append((right, 0, 0)) # ending event (height 0 marks the end)\n \n # Sort events:\n # 1. By x-coordinate\n # 2. If x-coordinates are the same, by height (taller buildings first for start, shorter last for end)\n events.sort()\n \n # Max-heap to track the current tallest building\n heap = [(0, float('inf'))] # (height, end_x)\n \n for x, neg_height, end in events:\n # Remove buildings from the heap whose end is <= current x\n while heap and heap[0][1] <= x:\n heapq.heappop(heap)\n \n # If it's a starting event, add it to the heap\n if neg_height != 0:\n heapq.heappush(heap, (neg_height, end))\n \n # The current tallest building\n max_height = -heap[0][0]\n \n # If the result is empty or the height has changed, record a new point\n if not result or result[-1][1] != max_height:\n result.append([x, max_height])\n \n return result\n ","memory":"21900"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n events = [(l, -h, r) for l, r, h in buildings]\n events += [(r, 0, 0) for _, r, _ in buildings]\n events.sort()\n\n res = [[0, 0]] # start position, changed height\n heap = [(0, float('inf'))] # height, end position\n for pos, h, r in events:\n while heap[0][1] <= pos:\n heapq.heappop(heap)\n if h:\n heapq.heappush(heap, (h, r))\n if res[-1][1] != -heap[0][0]:\n res += [[pos, -heap[0][0]]]\n return res[1:]","memory":"21900"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n edges = []\n\n for i, (start, end, _) in enumerate(buildings):\n edges.append((start, i))\n edges.append((end, i))\n edges.sort()\n\n res, pq, i = [], [], 0\n while i < len(edges):\n pos, _ = edges[i]\n while pq and pq[0][1] <= pos:\n heappop(pq)\n \n while i < len(edges) and edges[i][0] == pos:\n _, ind = edges[i]\n _, end, h = buildings[ind]\n if pos != end:\n heappush(pq, (-h, end))\n i += 1\n \n h = -pq[0][0] if pq else 0\n if not res or res[-1][1] != h:\n res.append([pos, h])\n \n return res","memory":"22000"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n \n x_height_right_tuples = sorted([(L, -H, R) for L, R, H in buildings] + [(R, 0, \"doesn't matter\") for _, R, _ in buildings])\n\n result, max_heap = [[0, 0]], [(0, float('inf'))]\n for x, negative_height, right in x_height_right_tuples:\n while x >= max_heap[0][1]:\n heapq.heappop(max_heap)\n if negative_height:\n heapq.heappush(max_heap, (negative_height, right))\n curr_max_height =-max_heap[0][0]\n if result[-1][1] != curr_max_height:\n result.append([x, curr_max_height])\n return result[1:]","memory":"22000"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Sort the unique positions of all the edges.\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\n \n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\n edge_index_map = {x : i for i, x in enumerate(positions)}\n\n # Initialize 'heights' to record maximum height at each index.\n heights = [0] * len(positions)\n \n # Iterate over all the buildings.\n for left, right, height in buildings:\n # For each building, find the indexes of its left\n # and right edges.\n left_idx = edge_index_map[left]\n right_idx = edge_index_map[right]\n\n # Update the maximum height within the range [left_idx, right_idx)\n for i in range(left_idx, right_idx):\n heights[i] = max(heights[i], height)\n\n answer = []\n\n # Iterate over 'heights'.\n for i in range(len(heights)):\n curr_height = heights[i]\n curr_x = positions[i]\n\n # Add all the positions where the height changes to 'answer'.\n if not answer or answer[-1][1] != curr_height:\n answer.append([curr_x, curr_height])\n return answer\n ","memory":"22100"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n edges = []\n ans = []\n live = []\n for i,x in enumerate(buildings):\n edges.append([x[0],i])\n edges.append([x[1],i])\n edges.sort()\n idx = 0\n while idx < len(edges):\n curr_x = edges[idx][0]\n while idx < len(edges) and curr_x == edges[idx][0]:\n b = edges[idx][1]\n if buildings[b][0] == curr_x:\n right = buildings[b][1]\n height = buildings[b][2]\n heapq.heappush(live,(-height,right))\n while live and curr_x >= live[0][1]:\n heapq.heappop(live)\n idx += 1\n maxheight = -live[0][0] if live else 0\n if not ans or ans[-1][1] != maxheight:\n ans.append([curr_x,maxheight])\n return ans\n\n","memory":"22200"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n heights = sorted([[L, -H, R] for L, R, H in buildings] + [[R, 0, 'NA'] for L, R, H in buildings])\n res, max_heap = [[0, 0]], [(0, float('inf'))]\n \n for x, negative_H, R in heights:\n while x >= max_heap[0][1]:\n heapq.heappop(max_heap) \n if negative_H:\n heapq.heappush(max_heap, (negative_H, R))\n curr_max_height = -max_heap[0][0]\n if curr_max_height != res[-1][1]:\n res.append([x, curr_max_height])\n return res[1:]\n ","memory":"22300"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n import heapq as hq\n events = []\n ans = []\n for start, end, height in buildings:\n events.append([start, -height, end])\n events.append([end, 0, 0])\n\n events.sort()\n\n heap = []\n curr = 0\n\n for s, h, e in events:\n curr = s\n if h != 0:\n hq.heappush(heap, (h, e))\n \n while heap and heap[0][1] <= curr:\n hq.heappop(heap)\n\n height = -heap[0][0] if heap else 0\n\n if not ans or ans[-1][1] != height:\n ans.append([curr, height])\n\n return ans\n\n\n ","memory":"22300"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n points=[]\n for i in range(len(buildings)):\n points.append([buildings[i][0],buildings[i][2],'start',i])\n points.append([buildings[i][1],buildings[i][2],'end',i])\n points.sort()\n\n result=[]\n heightStack=[[0,-1]]\n i=0\n while i<len(points):\n buffer=[points[i]]\n i+=1\n while i<len(points) and points[i][0]==buffer[-1][0]:\n buffer.append(points[i])\n i+=1\n startHeight=heightStack[-1][0]\n for b in buffer:\n if b[2]=='start':\n heightStack.append([b[1],b[3]])\n else :\n for j in range(len(heightStack)):\n if heightStack[j][1]==b[3]:\n heightStack.pop(j)\n break\n heightStack.sort()\n if heightStack[-1][0]!=startHeight:\n result.append([buffer[0][0],heightStack[-1][0]])\n \n return result","memory":"22400"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # Iterate over all buildings, for each building i,\n # add (position, i) to edges.\n edges = []\n for i, build in enumerate(buildings):\n edges.append([build[0], i])\n edges.append([build[1], i])\n\n # Sort edges by non-decreasing order.\n edges.sort()\n \n # Initailize an empty Priority Queue 'live' to store all the \n # newly added buildings, an empty list answer to store the skyline key points.\n live, answer = [], []\n idx = 0\n \n # Iterate over all the sorted edges.\n while idx < len(edges):\n \n # Since we might have multiple edges at same x,\n # Let the 'curr_x' be the current position.\n curr_x = edges[idx][0]\n \n # While we are handling the edges at 'curr_x':\n while idx < len(edges) and edges[idx][0] == curr_x:\n # The index 'b' of this building in 'buildings'\n b = edges[idx][1]\n \n # If this is a left edge of building 'b', we\n # add (height, right) of building 'b' to 'live'.\n if buildings[b][0] == curr_x:\n right = buildings[b][1]\n height = buildings[b][2]\n heapq.heappush(live, [-height, right])\n \n # If the tallest live building has been passed,\n # we remove it from 'live'.\n while live and live[0][1] <= curr_x:\n heapq.heappop(live)\n idx += 1\n \n # Get the maximum height from 'live'.\n max_height = -live[0][0] if live else 0\n \n # If the height changes at this curr_x, we add this\n # skyline key point [curr_x, max_height] to 'answer'.\n if not answer or max_height != answer[-1][1]:\n answer.append([curr_x, max_height])\n \n # Return 'answer' as the skyline.\n return answer","memory":"22400"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n events=[ (l,-h,r) for l,r,h in buildings]\n events += [ (r,0,'any') for l,r,h in buildings]\n events.sort()\n\n ans=[[0,0]]; hp=[(0, inf)] # pos, -hight\n for pos,neg_h,r in events:\n while pos>=hp[0][1]: heappop(hp) # skip passed edges\n if neg_h: heappush(hp, (neg_h,r))\n curr_max_h=-hp[0][0]\n if ans[-1][1]!=curr_max_h:\n ans.append([pos,curr_max_h])\n return ans[1:]\n","memory":"22500"},{"code":"import heapq\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n # List to store the result skyline key points\n result = []\n \n # List of events (left edge with -height and right edge with height 0)\n events = []\n \n for left, right, height in buildings:\n events.append((left, -height)) # Start of a building\n events.append((right, height)) # End of a building\n \n # Sort events by x coordinate, with special rules for tie-breaking:\n # 1. When x is the same, process the start of a building before the end.\n events.sort(key=lambda x: (x[0], x[1]))\n \n # Priority queue (max-heap). Start with ground level (height 0)\n heap = [0]\n prev_max_height = 0 # To keep track of previous max height\n \n for x, height in events:\n if height < 0: # Left edge of a building\n heapq.heappush(heap, height)\n else: # Right edge of a building\n heap.remove(-height)\n heapq.heapify(heap) # Rebuild heap after removing an element\n \n # The current max height\n current_max_height = -heap[0]\n \n # Only add to result if the height changes\n if current_max_height != prev_max_height:\n result.append([x, current_max_height])\n prev_max_height = current_max_height\n \n return result\n","memory":"22500"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n events = []\n for left, right, height in buildings:\n events.append((left, -height, right))\n events.append((right, 0, 0))\n \n events.sort()\n\n result = []\n heap = [(0, float('inf'))] \n\n for x, neg_height, right in events:\n if neg_height != 0:\n heapq.heappush(heap, (neg_height, right))\n while heap[0][1] <= x:\n heapq.heappop(heap)\n \n max_height = -heap[0][0]\n \n if not result or result[-1][1] != max_height:\n result.append([x, max_height])\n \n return result","memory":"22600"},{"code":"from sortedcontainers import SortedList \n\nclass Solution:\n def getSkyline(self, buildings):\n dict1 = defaultdict(list)\n\n for start,end,height in buildings:\n dict1[start].append([1,height])\n dict1[end].append([-1,height])\n\n res, prev, ans = [], -1, SortedList()\n\n ans.add(0)\n\n for i in sorted(dict1.keys()):\n for f,h in dict1[i]:\n if f == -1:\n ans.remove(h)\n else:\n ans.add(h)\n\n if ans[-1] != prev:\n prev = ans[-1]\n res.append([i,ans[-1]])\n\n return res ","memory":"22600"},{"code":"from heapq import heappush, heappop\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n events = []\n for l, r, h in buildings:\n events.append((l, -h, r))\n events.append((r, 0, 0))\n\n events.sort()\n res = [[0, 0]]\n heap = [(0, float(\"inf\"))]\n \n for l, neg_h, r in events:\n if neg_h:\n heappush(heap, (neg_h, r))\n while heap[0][1] <= l:\n heappop(heap)\n \n if -heap[0][0] != res[-1][1]:\n res.append([l, -heap[0][0]])\n\n return res[1:]\n \n\n\n \n \n","memory":"22700"},{"code":"import heapq\n\nclass Solution:\n def getSkyline(self, buildings):\n result = []\n events = []\n # Collect start and end events for all buildings\n for left, right, height in buildings:\n events.append((left, -height)) # Start of building\n events.append((right, height)) # End of building\n \n # Sort events by x, and in case of a tie, start events (-height) come before end events (+height)\n events.sort(key=lambda x: (x[0], x[1]))\n \n # Max-heap (priority queue) to store the heights of active buildings\n active_buildings = [0] # Start with ground level (height = 0)\n \n # Dictionary to keep track of how many times a building height is present in the heap\n height_map = {0: 1} # Ground level height is initially present once\n \n # Track the current maximum height\n prev_max_height = 0\n \n # Sweep line algorithm: process each event\n for x, height in events:\n if height < 0: # It's a start of a building\n heapq.heappush(active_buildings, height) # Push the height (negative to keep max-heap)\n height_map[-height] = height_map.get(-height, 0) + 1\n else: # It's an end of a building\n height_map[height] -= 1\n if height_map[height] == 0:\n del height_map[height] # Remove height when count goes to zero\n \n # Get the current max height (we negate since we store heights as negative for the max-heap)\n while active_buildings and (-active_buildings[0]) not in height_map:\n heapq.heappop(active_buildings) # Remove inactive heights\n \n curr_max_height = -active_buildings[0]\n \n # If the max height changes, we have a critical point (key point) in the skyline\n if curr_max_height != prev_max_height:\n result.append([x, curr_max_height])\n prev_max_height = curr_max_height\n \n return result\n","memory":"22800"},{"code":"from heapq import *\n\nclass Solution:\n def getSkyline(self, buildings):\n \"\"\"\n https://leetcode.com/problems/the-skyline-problem/solutions/61261/11-line-python-solution-with-max-heap-easy-to-understand\n\n O(nlogn) for sort and heap operation\n There are 2n edges so we have at most O(n) unique positions during the iteration.\nAt each step, we need to pop out the passed buildings from priority queue live and put in the newly added building (if exist). In worse-case scenario, we have O(n) live buildings in live, both the pop and push operations take O(logn) time.\nTo sum up, the overall time complexity is O(nlogn).\n \"\"\"\n # for the same x, (x, -H) should be in front of (x, 0)\n # For Example 2, we should process (2, -3) then (2, 0), as there's no height change\n x_height_right_tuples = sorted([(L, -H, R) for L, R, H in buildings] + [(R, 0, \"doesn't matter\") for _, R, _ in buildings]) \n # (0, float('inf')) is always in max_heap, so max_heap[0] is always valid\n result, max_heap = [[0, 0]], [(0, float('inf'))]\n for x, negative_height, R in x_height_right_tuples:\n while x >= max_heap[0][1]:\n # reduce max height up to date, i.e. only consider max height in the right side of line x\n heapq.heappop(max_heap)\n if negative_height:\n # Consider each height, as it may be the potential max height\n heapq.heappush(max_heap, (negative_height, R))\n curr_max_height = -max_heap[0][0]\n if result[-1][1] != curr_max_height:\n result.append([x, curr_max_height])\n return result[1:] \n","memory":"22900"},{"code":"class Solution:\n def getSkyline(self, buildings):\n building_list = []\n for l, r, h in buildings:\n building_list.append((l, h))\n building_list.append((r, -h))\n\n building_list.sort(key = lambda x : (x[0], -x[1]))\n q = []\n heapq.heappush(q, 0)\n prev_max_height = -1\n res = []\n for building in building_list:\n if building[1] < 0:\n q.remove(building[1])\n heapq.heapify(q)\n else:\n heapq.heappush(q , -building[1])\n \n max_height = -q[0] if q[0] < 0 else 0\n\n if prev_max_height != max_height:\n res.append((building[0], max_height))\n prev_max_height = max_height\n return res\n","memory":"23000"},{"code":"class Solution:\n def getSkyline(self, buildings):\n building_list = []\n for l, r, h in buildings:\n building_list.append((l, h))\n building_list.append((r, -h))\n\n building_list.sort(key = lambda x : (x[0], -x[1]))\n q = []\n heapq.heappush(q, 0)\n prev_max_height = -1\n res = []\n for building in building_list:\n if building[1] < 0:\n q.remove(building[1])\n heapq.heapify(q)\n else:\n heapq.heappush(q , -building[1])\n \n max_height = -q[0] if q[0] < 0 else 0\n\n if prev_max_height != max_height:\n res.append((building[0], max_height))\n prev_max_height = max_height\n return res\n","memory":"23000"},{"code":"class Solution:\n def getSkyline(self, buildings):\n building_list = []\n for l, r, h in buildings:\n building_list.append((l, h))\n building_list.append((r, -h))\n\n building_list.sort(key = lambda x : (x[0], -x[1]))\n q = []\n heapq.heappush(q, 0)\n prev_max_height = -1\n res = []\n for building in building_list:\n if building[1] < 0:\n q.remove(building[1])\n heapq.heapify(q)\n else:\n heapq.heappush(q , -building[1])\n \n max_height = -q[0] if q[0] < 0 else 0\n\n if prev_max_height != max_height:\n res.append((building[0], max_height))\n prev_max_height = max_height\n return res\n","memory":"23100"},{"code":"class Solution:\n def getSkyline(self, buildings):\n building_list = []\n for l, r, h in buildings:\n building_list.append((l, h))\n building_list.append((r, -h))\n\n building_list.sort(key = lambda x : (x[0], -x[1]))\n q = []\n heapq.heappush(q, 0)\n prev_max_height = -1\n res = []\n for building in building_list:\n if building[1] < 0:\n q.remove(building[1])\n heapq.heapify(q)\n else:\n heapq.heappush(q , -building[1])\n \n max_height = -q[0] if q[0] < 0 else 0\n\n if prev_max_height != max_height:\n res.append((building[0], max_height))\n prev_max_height = max_height\n return res\n","memory":"23100"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n events=collections.defaultdict(list)\n\n for l,r,h in buildings:\n events[l].append((-1,h))\n events[r].append((1,h))\n sl=SortedList()\n sl.add(0)\n\n ans=[]\n last_h=0\n for x in sorted(events.keys()):\n for t,h in events[x]:\n if t==-1:\n sl.add(h) \n else:\n sl.remove(h) \n current_height=sl[-1]\n if current_height!= last_h:\n ans.append((x,current_height))\n last_h=current_height\n return ans\n","memory":"23200"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n events=collections.defaultdict(list)\n\n for l,r,h in buildings:\n events[l].append((-1,h))\n events[r].append((1,h))\n sl=SortedList()\n sl.add(0)\n\n ans=[]\n last_h=0\n for x in sorted(events.keys()):\n for t,h in events[x]:\n if t==-1:\n sl.add(h) \n else:\n sl.remove(h) \n current_height=sl[-1]\n if current_height!= last_h:\n ans.append((x,current_height))\n last_h=current_height\n return ans\n","memory":"23200"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n n = len(buildings)\n\n x_coords = []\n for i in range(n):\n x_coords.append([buildings[i][0], i])\n x_coords.append([buildings[i][1], i])\n \n x_coords.sort()\n\n res = []\n \n included = set()\n sl = SortedList([[0, -1]])\n for x, ind in x_coords:\n if len(res) == 0:\n res.append([x, buildings[ind][2]])\n included.add(ind)\n sl.add([buildings[ind][2], ind])\n else:\n if ind in included:\n i = sl.bisect_left([buildings[ind][2], ind])\n sl.remove(sl[i])\n included.remove(ind)\n else:\n sl.add([buildings[ind][2], ind])\n included.add(ind)\n\n mx, _ = sl[-1]\n if mx != res[-1][1]:\n if x != res[-1][0]:\n res.append([x, mx])\n else:\n res[-1][1] = mx\n \n res_new = [res[0][:]]\n for i in range(1, len(res)):\n if res_new[-1][1] != res[i][1]:\n res_new.append(res[i][:])\n print(res)\n return res_new\n","memory":"23300"},{"code":"import heapq\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n events = []\n for L, R, H in buildings:\n events.append((L, -H, R))\n events.append((R, 0, 0))\n\n events.sort()\n print(events)\n heap = [(0, float(\"inf\"))]\n\n result = []\n\n for x, h, r in events:\n if h<0:\n heapq.heappush(heap, (h, r))\n else:\n while heap and heap[0][1] <= x:\n heapq.heappop(heap)\n print(heap[0])\n current_height = -heap[0][0]\n if not result or result[-1][1] != current_height:\n result.append([x, current_height]) # Add a key point if the height changes\n return result","memory":"23300"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n skyline = []\n\n points = []\n for building in buildings:\n l, r, h = building\n points.append((l, h, False))\n points.append((r, h, True))\n\n # sort highest preference \n # 1. same point x\n # 2. highest height\n # 3. starting point\n points.sort(key=lambda x: (x[0], -x[1], x[2]))\n \n # sorted array so we can add and remove heights as we pass through each building\n # sl = SortedList([0])\n # max heap window\n window = []\n past = []\n\n i = 0\n while i < len(points):\n cur = points[i][0]\n\n # example points = [(5, 12, False), (12, 18, False), (12, 12, True), (13, 18, True)]\n # there are multiple points with same point x so we need to find the max height and do not process those events again\n # while loop gets executed atleast once for sure, so we are adding +1 to iterator\n while i < len(points) and cur == points[i][0]:\n x, h, ending = points[i]\n if ending == False:\n heapq.heappush(window, (-h, x))\n if ending == True:\n heapq.heappush(past, (-h, x))\n while len(window) > 0 and len(past) > 0 and window[0][0] == past[0][0]:\n heapq.heappop(window)\n heapq.heappop(past)\n i = i + 1\n \n if len(window) == 0:\n skyline.append([cur, 0])\n elif len(skyline) == 0:\n skyline.append([cur, -window[0][0]])\n elif skyline[-1][1] != -window[0][0]:\n skyline.append([cur, -window[0][0]])\n\n return skyline\n","memory":"23400"},{"code":"class Solution:\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\n lasting_heights = list()\n heapify(lasting_heights)\n \n \n \n valid_points = list()\n \n for idx,(x1,x2,height) in enumerate(buildings):\n valid_points.append((x1,height,1,idx))\n valid_points.append((x2,height,-1,idx))\n \n valid_points.sort(key = lambda x: (x[0],x[1]*-x[2]))\n \n cur_x = 0\n cur_y = 0\n \n ans = list()\n closed = set()\n \n for x,y,status,idx in valid_points:\n \n if status == 1:\n \n heappush(lasting_heights,(-y,idx))\n \n if lasting_heights and -lasting_heights[0][0] <= cur_y:\n continue\n \n cur_x = x\n cur_y = -lasting_heights[0][0]\n \n \n else:\n closed.add(idx)\n \n while lasting_heights and lasting_heights[0][1] in closed:\n heappop(lasting_heights)\n \n if not lasting_heights:\n cur_x = x\n cur_y = 0\n else:\n cur_x = x\n cur_y = -lasting_heights[0][0]\n \n \n if ans and cur_y == ans[-1][1]:\n continue\n \n ans.append([cur_x,cur_y])\n \n \n return ans\n ","memory":"23400"}],"string":"[\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: list[list[int]]) -> list[list[int]]:\\n n = len(buildings)\\n if n == 0:\\n return []\\n if n == 1:\\n left, right, height = buildings[0]\\n return [[left, height], [right, 0]]\\n\\n left = self.getSkyline(buildings[:n // 2])\\n right = self.getSkyline(buildings[n // 2:])\\n return self._merge(left, right)\\n\\n def _merge(self, left: list[list[int]],\\n right: list[list[int]]) -> list[list[int]]:\\n ans = []\\n i = 0 # left's index\\n j = 0 # right's index\\n leftY = 0\\n rightY = 0\\n\\n while i < len(left) and j < len(right):\\n # Choose the powith smaller x\\n if left[i][0] < right[j][0]:\\n leftY = left[i][1] # Update the ongoing `leftY`.\\n self._addPoint(ans, left[i][0], max(left[i][1], rightY))\\n i += 1\\n else:\\n rightY = right[j][1] # Update the ongoing `rightY`.\\n self._addPoint(ans, right[j][0], max(right[j][1], leftY))\\n j += 1\\n\\n while i < len(left):\\n self._addPoint(ans, left[i][0], left[i][1])\\n i += 1\\n\\n while j < len(right):\\n self._addPoint(ans, right[j][0], right[j][1])\\n j += 1\\n\\n return ans\\n\\n def _addPoint(self, ans: list[list[int]], x: int, y: int) -> None:\\n if ans and ans[-1][0] == x:\\n ans[-1][1] = y\\n return\\n if ans and ans[-1][1] == y:\\n return\\n ans.append([x, y])\",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, b: List[List[int]]) -> List[List[int]]:\\n \\n res=[]\\n while(b):\\n curr=heapq.heappop(b)\\n if(len(res)==0): \\n res.append(curr)\\n continue\\n prev=res[-1]\\n if(prev[2]==curr[2] and prev[1]>=curr[0]):\\n newPrev=[prev[0],curr[1],prev[2]]\\n res[-1]=newPrev\\n elif(prev[1]<=curr[0]):res.append(curr)\\n elif(prev[2]<curr[2]):\\n newPrev=[prev[0],curr[0],prev[2]]\\n newCurr=[curr[0],curr[1],curr[2]]\\n if(prev[1]>curr[1]): heapq.heappush(b,[curr[1],prev[1],prev[2]])\\n if(newPrev[0]!=newPrev[1]):res[-1]=newPrev\\n else:res=res[:-1]\\n heapq.heappush(b,newCurr)\\n elif(prev[1]<curr[1]):\\n newPrev=[prev[0],prev[1],prev[2]]\\n heapq.heappush(b,[prev[1],curr[1],curr[2]])\\n res[-1]=newPrev\\n res2=[]\\n prev=-1\\n for i in range(len(res)):\\n curr=res[i]\\n if(prev!=-1 and prev[1]<curr[0]):\\n res2.append([prev[1],0])\\n res2.append([curr[0],curr[2]])\\n prev=curr\\n res2.append([prev[1],0])\\n \\n return res2\\n\\n\\n\\n\\n\\n # 2 - 9 10\\n # 3 - 7 15\\n # 5 - 12 12\\n # 15 - 20 10\\n # 19 - 24 8\\n\\n\\n # 3 - 7 15\\n # 7 - 12 12\\n # 2 - 3 10\\n # 15 - 20 10\\n # 20 - 24 8\\n\\n\\n # 2 - 3 10\\n # 3 - 7 15\\n # 7 - 12 12\\n\\n # 15 - 20 10\\n # 20 - 24 8\\n\\n\\n # 2 10\\n # 3 15\\n # 7 12\\n # 12 0\\n # 15 10\\n # 20 8\\n # 24 0\",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n\\n def splitParts(a, b):\\n ax1, ax2, ah = a\\n bx1, bx2, bh = b\\n\\n if bx2<=ax2:\\n return [[ax1, bx1, ah], [bx1, bx2, max(ah, bh)], [bx2, ax2, ah]]\\n else:\\n return [[ax1, bx1, ah], [bx1, ax2, max(ah, bh)], [ax2, bx2, bh]]\\n\\n heap = buildings\\n heap.append([0, sys.maxsize, 0])\\n heapify(heap)\\n res = []\\n while heap:\\n a = heappop(heap)\\n ax1, ax2, ah = a\\n if heap:\\n b = heappop(heap)\\n bx1, bx2, bh = b\\n else:\\n if ax1!=ax2:\\n res.append(a)\\n break\\n\\n\\n\\n if ax2<=bx1:\\n if ax1!=ax2:\\n res.append(a)\\n heappush(heap, b)\\n else:\\n parts = splitParts(a, b)\\n for p in parts:\\n if p[0]!=p[1]:\\n heappush(heap, p)\\n \\n prev = [0, 0, 0]\\n ans = []\\n for r in res:\\n if r[2]!=prev[2]:\\n prev = r\\n ans.append([r[0], r[2]])\\n\\n return ans\\n \\n\\n \",\n \"memory\": \"21200\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: list[list[int]]) -> list[list[int]]:\\n n = len(buildings)\\n if n == 0:\\n return []\\n if n == 1:\\n left, right, height = buildings[0]\\n return [[left, height], [right, 0]]\\n\\n left = self.getSkyline(buildings[:n // 2])\\n right = self.getSkyline(buildings[n // 2:])\\n return self._merge(left, right)\\n\\n def _merge(self, left: list[list[int]],\\n right: list[list[int]]) -> list[list[int]]:\\n ans = []\\n i = 0 # left's index\\n j = 0 # right's index\\n leftY = 0\\n rightY = 0\\n\\n while i < len(left) and j < len(right):\\n # Choose the powith smaller x\\n if left[i][0] < right[j][0]:\\n leftY = left[i][1] # Update the ongoing `leftY`.\\n self._addPoint(ans, left[i][0], max(left[i][1], rightY))\\n i += 1\\n else:\\n rightY = right[j][1] # Update the ongoing `rightY`.\\n self._addPoint(ans, right[j][0], max(right[j][1], leftY))\\n j += 1\\n\\n while i < len(left):\\n self._addPoint(ans, left[i][0], left[i][1])\\n i += 1\\n\\n while j < len(right):\\n self._addPoint(ans, right[j][0], right[j][1])\\n j += 1\\n\\n return ans\\n\\n def _addPoint(self, ans: list[list[int]], x: int, y: int) -> None:\\n if ans and ans[-1][0] == x:\\n ans[-1][1] = y\\n return\\n if ans and ans[-1][1] == y:\\n return\\n ans.append([x, y])\",\n \"memory\": \"21500\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n\\n def getSkyline(self, buildings):\\n # Convert buildings to events\\n events = []\\n for left, right, height in buildings:\\n events.append((left, -height, right)) # Start event\\n events.append((right, 0, 0)) # End event\\n events.sort() # Sort events by x-coordinate\\n \\n result = []\\n heap = [(0, float('inf'))] # (height, ending x-coordinate)\\n \\n for x, negH, r in events:\\n while heap[0][1] <= x: # Remove ended buildings\\n heapq.heappop(heap)\\n \\n if negH: # If it's a start event\\n heapq.heappush(heap, (negH, r))\\n \\n if result and result[-1][1] == -heap[0][0]:\\n continue\\n \\n result.append([x, -heap[0][0]])\\n \\n return result\",\n \"memory\": \"21600\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def getSkyline(self, buildings):\\n events = []\\n for L, R, H in buildings:\\n events.append((L, -H, R))\\n events.append((R, 0, 0))\\n events.sort()\\n \\n res = []\\n heap = [(0, float('inf'))]\\n \\n i = 0\\n n = len(events)\\n while i < n:\\n x = events[i][0]\\n while i < n and events[i][0] == x:\\n H, R = events[i][1], events[i][2]\\n if H != 0:\\n heapq.heappush(heap, (H, R))\\n i += 1\\n while heap and heap[0][1] <= x:\\n heapq.heappop(heap)\\n curr_height = -heap[0][0]\\n if not res or res[-1][1] != curr_height:\\n res.append([x, curr_height])\\n return res\\n\",\n \"memory\": \"21600\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n if len(buildings) == 0: \\n return []\\n \\n buildings.sort(key=lambda v: v[2])\\n pos, height = [0], [0]\\n for left, right, h in buildings: \\n i = bisect_left(pos, left)\\n j = bisect_right(pos, right)\\n height[i:j] = [h, height[j-1]]\\n pos[i:j] = [left, right]\\n print(height, pos)\\n res = []\\n prev = 0\\n for v, h in zip(pos, height): \\n if h != prev:\\n res.append([v,h]) \\n prev = h\\n \\n return res\",\n \"memory\": \"21700\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n import heapq as hq\\n events = []\\n for start, end, height in buildings:\\n events.append((start, height))\\n events.append((end, -height))\\n\\n events.sort()\\n live = []\\n past = []\\n ans = []\\n\\n i = 0 \\n while i < len(events):\\n # current event under consideration\\n curr_x = events[i][0]\\n\\n # edge case handling: same starting point\\n while i < len(events) and events[i][0] == curr_x:\\n height = events[i][1]\\n if height > 0: \\n hq.heappush(live, -height) # alive queue, maxheap\\n else:\\n hq.heappush(past, height) # dead queue, minheap\\n i += 1\\n \\n # Now events[i][0] != curr_x\\n while past and past[0] == live[0]:\\n hq.heappop(live)\\n hq.heappop(past)\\n\\n max_height = -live[0] if live else 0\\n if not ans or ans[-1][1] != max_height:\\n ans.append([curr_x, max_height])\\n\\n return ans\\n\\n\\n\\n \",\n \"memory\": \"21700\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Generate events\\n events = []\\n for L, R, H in buildings:\\n events.append((L, -H, R)) # Start event\\n events.append((R, 0, 0)) # End event\\n # Sort events\\n events.sort()\\n # Initialize result and heap\\n res = []\\n heap = [(0, float('inf'))] # (negH, R)\\n for x, negH, R in events:\\n # Remove buildings that have ended\\n while heap[0][1] <= x:\\n heapq.heappop(heap)\\n if negH < 0:\\n heapq.heappush(heap, (negH, R))\\n currH = -heap[0][0]\\n if not res or res[-1][1] != currH:\\n res.append([x, currH])\\n return res\",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n events = []\\n \\n # Add both the start (negative height) and the end (positive height) events\\n for left, right, height in buildings:\\n events.append((left, -height, right)) # Start of a building\\n events.append((right, 0, 0)) # End of a building\\n \\n # Sort events:\\n # 1. By x coordinate\\n # 2. In case of tie, prioritize starting over ending buildings (negative height first)\\n # 3. In case of tie, taller buildings come first (-height, so it's sorted by height in descending order)\\n events.sort()\\n\\n # Result list and max-heap (priority queue)\\n result = []\\n heap = [(0, float('inf'))] # (height, end of building)\\n \\n # Process all events\\n for x, h, r in events:\\n # Add the new building to the heap (if it's a start event)\\n if h != 0:\\n heapq.heappush(heap, (h, r))\\n # Remove the buildings that are already ended\\n while heap[0][1] <= x:\\n heapq.heappop(heap)\\n \\n # If the current maximum height changes, add the point to the result\\n max_height = -heap[0][0]\\n if not result or result[-1][1] != max_height:\\n result.append([x, max_height])\\n \\n return result\\n \",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # List to hold the result\\n result = []\\n \\n # List to store both starting and ending events of buildings\\n events = []\\n \\n # For each building, generate two events: start (left, -height, right) and end (right, 0, 0)\\n for left, right, height in buildings:\\n events.append((left, -height, right)) # starting event (negative height for start)\\n events.append((right, 0, 0)) # ending event (height 0 marks the end)\\n \\n # Sort events:\\n # 1. By x-coordinate\\n # 2. If x-coordinates are the same, by height (taller buildings first for start, shorter last for end)\\n events.sort()\\n \\n # Max-heap to track the current tallest building\\n heap = [(0, float('inf'))] # (height, end_x)\\n \\n for x, neg_height, end in events:\\n # Remove buildings from the heap whose end is <= current x\\n while heap and heap[0][1] <= x:\\n heapq.heappop(heap)\\n \\n # If it's a starting event, add it to the heap\\n if neg_height != 0:\\n heapq.heappush(heap, (neg_height, end))\\n \\n # The current tallest building\\n max_height = -heap[0][0]\\n \\n # If the result is empty or the height has changed, record a new point\\n if not result or result[-1][1] != max_height:\\n result.append([x, max_height])\\n \\n return result\\n \",\n \"memory\": \"21900\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n events = [(l, -h, r) for l, r, h in buildings]\\n events += [(r, 0, 0) for _, r, _ in buildings]\\n events.sort()\\n\\n res = [[0, 0]] # start position, changed height\\n heap = [(0, float('inf'))] # height, end position\\n for pos, h, r in events:\\n while heap[0][1] <= pos:\\n heapq.heappop(heap)\\n if h:\\n heapq.heappush(heap, (h, r))\\n if res[-1][1] != -heap[0][0]:\\n res += [[pos, -heap[0][0]]]\\n return res[1:]\",\n \"memory\": \"21900\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n edges = []\\n\\n for i, (start, end, _) in enumerate(buildings):\\n edges.append((start, i))\\n edges.append((end, i))\\n edges.sort()\\n\\n res, pq, i = [], [], 0\\n while i < len(edges):\\n pos, _ = edges[i]\\n while pq and pq[0][1] <= pos:\\n heappop(pq)\\n \\n while i < len(edges) and edges[i][0] == pos:\\n _, ind = edges[i]\\n _, end, h = buildings[ind]\\n if pos != end:\\n heappush(pq, (-h, end))\\n i += 1\\n \\n h = -pq[0][0] if pq else 0\\n if not res or res[-1][1] != h:\\n res.append([pos, h])\\n \\n return res\",\n \"memory\": \"22000\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n \\n x_height_right_tuples = sorted([(L, -H, R) for L, R, H in buildings] + [(R, 0, \\\"doesn't matter\\\") for _, R, _ in buildings])\\n\\n result, max_heap = [[0, 0]], [(0, float('inf'))]\\n for x, negative_height, right in x_height_right_tuples:\\n while x >= max_heap[0][1]:\\n heapq.heappop(max_heap)\\n if negative_height:\\n heapq.heappush(max_heap, (negative_height, right))\\n curr_max_height =-max_heap[0][0]\\n if result[-1][1] != curr_max_height:\\n result.append([x, curr_max_height])\\n return result[1:]\",\n \"memory\": \"22000\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Sort the unique positions of all the edges.\\n positions = sorted(list(set([x for building in buildings for x in building[:2]])))\\n \\n # Hast table 'edge_index_map' to record every {position : index} pairs in edges.\\n edge_index_map = {x : i for i, x in enumerate(positions)}\\n\\n # Initialize 'heights' to record maximum height at each index.\\n heights = [0] * len(positions)\\n \\n # Iterate over all the buildings.\\n for left, right, height in buildings:\\n # For each building, find the indexes of its left\\n # and right edges.\\n left_idx = edge_index_map[left]\\n right_idx = edge_index_map[right]\\n\\n # Update the maximum height within the range [left_idx, right_idx)\\n for i in range(left_idx, right_idx):\\n heights[i] = max(heights[i], height)\\n\\n answer = []\\n\\n # Iterate over 'heights'.\\n for i in range(len(heights)):\\n curr_height = heights[i]\\n curr_x = positions[i]\\n\\n # Add all the positions where the height changes to 'answer'.\\n if not answer or answer[-1][1] != curr_height:\\n answer.append([curr_x, curr_height])\\n return answer\\n \",\n \"memory\": \"22100\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n edges = []\\n ans = []\\n live = []\\n for i,x in enumerate(buildings):\\n edges.append([x[0],i])\\n edges.append([x[1],i])\\n edges.sort()\\n idx = 0\\n while idx < len(edges):\\n curr_x = edges[idx][0]\\n while idx < len(edges) and curr_x == edges[idx][0]:\\n b = edges[idx][1]\\n if buildings[b][0] == curr_x:\\n right = buildings[b][1]\\n height = buildings[b][2]\\n heapq.heappush(live,(-height,right))\\n while live and curr_x >= live[0][1]:\\n heapq.heappop(live)\\n idx += 1\\n maxheight = -live[0][0] if live else 0\\n if not ans or ans[-1][1] != maxheight:\\n ans.append([curr_x,maxheight])\\n return ans\\n\\n\",\n \"memory\": \"22200\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n heights = sorted([[L, -H, R] for L, R, H in buildings] + [[R, 0, 'NA'] for L, R, H in buildings])\\n res, max_heap = [[0, 0]], [(0, float('inf'))]\\n \\n for x, negative_H, R in heights:\\n while x >= max_heap[0][1]:\\n heapq.heappop(max_heap) \\n if negative_H:\\n heapq.heappush(max_heap, (negative_H, R))\\n curr_max_height = -max_heap[0][0]\\n if curr_max_height != res[-1][1]:\\n res.append([x, curr_max_height])\\n return res[1:]\\n \",\n \"memory\": \"22300\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n import heapq as hq\\n events = []\\n ans = []\\n for start, end, height in buildings:\\n events.append([start, -height, end])\\n events.append([end, 0, 0])\\n\\n events.sort()\\n\\n heap = []\\n curr = 0\\n\\n for s, h, e in events:\\n curr = s\\n if h != 0:\\n hq.heappush(heap, (h, e))\\n \\n while heap and heap[0][1] <= curr:\\n hq.heappop(heap)\\n\\n height = -heap[0][0] if heap else 0\\n\\n if not ans or ans[-1][1] != height:\\n ans.append([curr, height])\\n\\n return ans\\n\\n\\n \",\n \"memory\": \"22300\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n points=[]\\n for i in range(len(buildings)):\\n points.append([buildings[i][0],buildings[i][2],'start',i])\\n points.append([buildings[i][1],buildings[i][2],'end',i])\\n points.sort()\\n\\n result=[]\\n heightStack=[[0,-1]]\\n i=0\\n while i<len(points):\\n buffer=[points[i]]\\n i+=1\\n while i<len(points) and points[i][0]==buffer[-1][0]:\\n buffer.append(points[i])\\n i+=1\\n startHeight=heightStack[-1][0]\\n for b in buffer:\\n if b[2]=='start':\\n heightStack.append([b[1],b[3]])\\n else :\\n for j in range(len(heightStack)):\\n if heightStack[j][1]==b[3]:\\n heightStack.pop(j)\\n break\\n heightStack.sort()\\n if heightStack[-1][0]!=startHeight:\\n result.append([buffer[0][0],heightStack[-1][0]])\\n \\n return result\",\n \"memory\": \"22400\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # Iterate over all buildings, for each building i,\\n # add (position, i) to edges.\\n edges = []\\n for i, build in enumerate(buildings):\\n edges.append([build[0], i])\\n edges.append([build[1], i])\\n\\n # Sort edges by non-decreasing order.\\n edges.sort()\\n \\n # Initailize an empty Priority Queue 'live' to store all the \\n # newly added buildings, an empty list answer to store the skyline key points.\\n live, answer = [], []\\n idx = 0\\n \\n # Iterate over all the sorted edges.\\n while idx < len(edges):\\n \\n # Since we might have multiple edges at same x,\\n # Let the 'curr_x' be the current position.\\n curr_x = edges[idx][0]\\n \\n # While we are handling the edges at 'curr_x':\\n while idx < len(edges) and edges[idx][0] == curr_x:\\n # The index 'b' of this building in 'buildings'\\n b = edges[idx][1]\\n \\n # If this is a left edge of building 'b', we\\n # add (height, right) of building 'b' to 'live'.\\n if buildings[b][0] == curr_x:\\n right = buildings[b][1]\\n height = buildings[b][2]\\n heapq.heappush(live, [-height, right])\\n \\n # If the tallest live building has been passed,\\n # we remove it from 'live'.\\n while live and live[0][1] <= curr_x:\\n heapq.heappop(live)\\n idx += 1\\n \\n # Get the maximum height from 'live'.\\n max_height = -live[0][0] if live else 0\\n \\n # If the height changes at this curr_x, we add this\\n # skyline key point [curr_x, max_height] to 'answer'.\\n if not answer or max_height != answer[-1][1]:\\n answer.append([curr_x, max_height])\\n \\n # Return 'answer' as the skyline.\\n return answer\",\n \"memory\": \"22400\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n events=[ (l,-h,r) for l,r,h in buildings]\\n events += [ (r,0,'any') for l,r,h in buildings]\\n events.sort()\\n\\n ans=[[0,0]]; hp=[(0, inf)] # pos, -hight\\n for pos,neg_h,r in events:\\n while pos>=hp[0][1]: heappop(hp) # skip passed edges\\n if neg_h: heappush(hp, (neg_h,r))\\n curr_max_h=-hp[0][0]\\n if ans[-1][1]!=curr_max_h:\\n ans.append([pos,curr_max_h])\\n return ans[1:]\\n\",\n \"memory\": \"22500\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n # List to store the result skyline key points\\n result = []\\n \\n # List of events (left edge with -height and right edge with height 0)\\n events = []\\n \\n for left, right, height in buildings:\\n events.append((left, -height)) # Start of a building\\n events.append((right, height)) # End of a building\\n \\n # Sort events by x coordinate, with special rules for tie-breaking:\\n # 1. When x is the same, process the start of a building before the end.\\n events.sort(key=lambda x: (x[0], x[1]))\\n \\n # Priority queue (max-heap). Start with ground level (height 0)\\n heap = [0]\\n prev_max_height = 0 # To keep track of previous max height\\n \\n for x, height in events:\\n if height < 0: # Left edge of a building\\n heapq.heappush(heap, height)\\n else: # Right edge of a building\\n heap.remove(-height)\\n heapq.heapify(heap) # Rebuild heap after removing an element\\n \\n # The current max height\\n current_max_height = -heap[0]\\n \\n # Only add to result if the height changes\\n if current_max_height != prev_max_height:\\n result.append([x, current_max_height])\\n prev_max_height = current_max_height\\n \\n return result\\n\",\n \"memory\": \"22500\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n events = []\\n for left, right, height in buildings:\\n events.append((left, -height, right))\\n events.append((right, 0, 0))\\n \\n events.sort()\\n\\n result = []\\n heap = [(0, float('inf'))] \\n\\n for x, neg_height, right in events:\\n if neg_height != 0:\\n heapq.heappush(heap, (neg_height, right))\\n while heap[0][1] <= x:\\n heapq.heappop(heap)\\n \\n max_height = -heap[0][0]\\n \\n if not result or result[-1][1] != max_height:\\n result.append([x, max_height])\\n \\n return result\",\n \"memory\": \"22600\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList \\n\\nclass Solution:\\n def getSkyline(self, buildings):\\n dict1 = defaultdict(list)\\n\\n for start,end,height in buildings:\\n dict1[start].append([1,height])\\n dict1[end].append([-1,height])\\n\\n res, prev, ans = [], -1, SortedList()\\n\\n ans.add(0)\\n\\n for i in sorted(dict1.keys()):\\n for f,h in dict1[i]:\\n if f == -1:\\n ans.remove(h)\\n else:\\n ans.add(h)\\n\\n if ans[-1] != prev:\\n prev = ans[-1]\\n res.append([i,ans[-1]])\\n\\n return res \",\n \"memory\": \"22600\"\n },\n {\n \"code\": \"from heapq import heappush, heappop\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n events = []\\n for l, r, h in buildings:\\n events.append((l, -h, r))\\n events.append((r, 0, 0))\\n\\n events.sort()\\n res = [[0, 0]]\\n heap = [(0, float(\\\"inf\\\"))]\\n \\n for l, neg_h, r in events:\\n if neg_h:\\n heappush(heap, (neg_h, r))\\n while heap[0][1] <= l:\\n heappop(heap)\\n \\n if -heap[0][0] != res[-1][1]:\\n res.append([l, -heap[0][0]])\\n\\n return res[1:]\\n \\n\\n\\n \\n \\n\",\n \"memory\": \"22700\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def getSkyline(self, buildings):\\n result = []\\n events = []\\n # Collect start and end events for all buildings\\n for left, right, height in buildings:\\n events.append((left, -height)) # Start of building\\n events.append((right, height)) # End of building\\n \\n # Sort events by x, and in case of a tie, start events (-height) come before end events (+height)\\n events.sort(key=lambda x: (x[0], x[1]))\\n \\n # Max-heap (priority queue) to store the heights of active buildings\\n active_buildings = [0] # Start with ground level (height = 0)\\n \\n # Dictionary to keep track of how many times a building height is present in the heap\\n height_map = {0: 1} # Ground level height is initially present once\\n \\n # Track the current maximum height\\n prev_max_height = 0\\n \\n # Sweep line algorithm: process each event\\n for x, height in events:\\n if height < 0: # It's a start of a building\\n heapq.heappush(active_buildings, height) # Push the height (negative to keep max-heap)\\n height_map[-height] = height_map.get(-height, 0) + 1\\n else: # It's an end of a building\\n height_map[height] -= 1\\n if height_map[height] == 0:\\n del height_map[height] # Remove height when count goes to zero\\n \\n # Get the current max height (we negate since we store heights as negative for the max-heap)\\n while active_buildings and (-active_buildings[0]) not in height_map:\\n heapq.heappop(active_buildings) # Remove inactive heights\\n \\n curr_max_height = -active_buildings[0]\\n \\n # If the max height changes, we have a critical point (key point) in the skyline\\n if curr_max_height != prev_max_height:\\n result.append([x, curr_max_height])\\n prev_max_height = curr_max_height\\n \\n return result\\n\",\n \"memory\": \"22800\"\n },\n {\n \"code\": \"from heapq import *\\n\\nclass Solution:\\n def getSkyline(self, buildings):\\n \\\"\\\"\\\"\\n https://leetcode.com/problems/the-skyline-problem/solutions/61261/11-line-python-solution-with-max-heap-easy-to-understand\\n\\n O(nlogn) for sort and heap operation\\n There are 2n edges so we have at most O(n) unique positions during the iteration.\\nAt each step, we need to pop out the passed buildings from priority queue live and put in the newly added building (if exist). In worse-case scenario, we have O(n) live buildings in live, both the pop and push operations take O(logn) time.\\nTo sum up, the overall time complexity is O(nlogn).\\n \\\"\\\"\\\"\\n # for the same x, (x, -H) should be in front of (x, 0)\\n # For Example 2, we should process (2, -3) then (2, 0), as there's no height change\\n x_height_right_tuples = sorted([(L, -H, R) for L, R, H in buildings] + [(R, 0, \\\"doesn't matter\\\") for _, R, _ in buildings]) \\n # (0, float('inf')) is always in max_heap, so max_heap[0] is always valid\\n result, max_heap = [[0, 0]], [(0, float('inf'))]\\n for x, negative_height, R in x_height_right_tuples:\\n while x >= max_heap[0][1]:\\n # reduce max height up to date, i.e. only consider max height in the right side of line x\\n heapq.heappop(max_heap)\\n if negative_height:\\n # Consider each height, as it may be the potential max height\\n heapq.heappush(max_heap, (negative_height, R))\\n curr_max_height = -max_heap[0][0]\\n if result[-1][1] != curr_max_height:\\n result.append([x, curr_max_height])\\n return result[1:] \\n\",\n \"memory\": \"22900\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings):\\n building_list = []\\n for l, r, h in buildings:\\n building_list.append((l, h))\\n building_list.append((r, -h))\\n\\n building_list.sort(key = lambda x : (x[0], -x[1]))\\n q = []\\n heapq.heappush(q, 0)\\n prev_max_height = -1\\n res = []\\n for building in building_list:\\n if building[1] < 0:\\n q.remove(building[1])\\n heapq.heapify(q)\\n else:\\n heapq.heappush(q , -building[1])\\n \\n max_height = -q[0] if q[0] < 0 else 0\\n\\n if prev_max_height != max_height:\\n res.append((building[0], max_height))\\n prev_max_height = max_height\\n return res\\n\",\n \"memory\": \"23000\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings):\\n building_list = []\\n for l, r, h in buildings:\\n building_list.append((l, h))\\n building_list.append((r, -h))\\n\\n building_list.sort(key = lambda x : (x[0], -x[1]))\\n q = []\\n heapq.heappush(q, 0)\\n prev_max_height = -1\\n res = []\\n for building in building_list:\\n if building[1] < 0:\\n q.remove(building[1])\\n heapq.heapify(q)\\n else:\\n heapq.heappush(q , -building[1])\\n \\n max_height = -q[0] if q[0] < 0 else 0\\n\\n if prev_max_height != max_height:\\n res.append((building[0], max_height))\\n prev_max_height = max_height\\n return res\\n\",\n \"memory\": \"23000\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings):\\n building_list = []\\n for l, r, h in buildings:\\n building_list.append((l, h))\\n building_list.append((r, -h))\\n\\n building_list.sort(key = lambda x : (x[0], -x[1]))\\n q = []\\n heapq.heappush(q, 0)\\n prev_max_height = -1\\n res = []\\n for building in building_list:\\n if building[1] < 0:\\n q.remove(building[1])\\n heapq.heapify(q)\\n else:\\n heapq.heappush(q , -building[1])\\n \\n max_height = -q[0] if q[0] < 0 else 0\\n\\n if prev_max_height != max_height:\\n res.append((building[0], max_height))\\n prev_max_height = max_height\\n return res\\n\",\n \"memory\": \"23100\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings):\\n building_list = []\\n for l, r, h in buildings:\\n building_list.append((l, h))\\n building_list.append((r, -h))\\n\\n building_list.sort(key = lambda x : (x[0], -x[1]))\\n q = []\\n heapq.heappush(q, 0)\\n prev_max_height = -1\\n res = []\\n for building in building_list:\\n if building[1] < 0:\\n q.remove(building[1])\\n heapq.heapify(q)\\n else:\\n heapq.heappush(q , -building[1])\\n \\n max_height = -q[0] if q[0] < 0 else 0\\n\\n if prev_max_height != max_height:\\n res.append((building[0], max_height))\\n prev_max_height = max_height\\n return res\\n\",\n \"memory\": \"23100\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n events=collections.defaultdict(list)\\n\\n for l,r,h in buildings:\\n events[l].append((-1,h))\\n events[r].append((1,h))\\n sl=SortedList()\\n sl.add(0)\\n\\n ans=[]\\n last_h=0\\n for x in sorted(events.keys()):\\n for t,h in events[x]:\\n if t==-1:\\n sl.add(h) \\n else:\\n sl.remove(h) \\n current_height=sl[-1]\\n if current_height!= last_h:\\n ans.append((x,current_height))\\n last_h=current_height\\n return ans\\n\",\n \"memory\": \"23200\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n events=collections.defaultdict(list)\\n\\n for l,r,h in buildings:\\n events[l].append((-1,h))\\n events[r].append((1,h))\\n sl=SortedList()\\n sl.add(0)\\n\\n ans=[]\\n last_h=0\\n for x in sorted(events.keys()):\\n for t,h in events[x]:\\n if t==-1:\\n sl.add(h) \\n else:\\n sl.remove(h) \\n current_height=sl[-1]\\n if current_height!= last_h:\\n ans.append((x,current_height))\\n last_h=current_height\\n return ans\\n\",\n \"memory\": \"23200\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n n = len(buildings)\\n\\n x_coords = []\\n for i in range(n):\\n x_coords.append([buildings[i][0], i])\\n x_coords.append([buildings[i][1], i])\\n \\n x_coords.sort()\\n\\n res = []\\n \\n included = set()\\n sl = SortedList([[0, -1]])\\n for x, ind in x_coords:\\n if len(res) == 0:\\n res.append([x, buildings[ind][2]])\\n included.add(ind)\\n sl.add([buildings[ind][2], ind])\\n else:\\n if ind in included:\\n i = sl.bisect_left([buildings[ind][2], ind])\\n sl.remove(sl[i])\\n included.remove(ind)\\n else:\\n sl.add([buildings[ind][2], ind])\\n included.add(ind)\\n\\n mx, _ = sl[-1]\\n if mx != res[-1][1]:\\n if x != res[-1][0]:\\n res.append([x, mx])\\n else:\\n res[-1][1] = mx\\n \\n res_new = [res[0][:]]\\n for i in range(1, len(res)):\\n if res_new[-1][1] != res[i][1]:\\n res_new.append(res[i][:])\\n print(res)\\n return res_new\\n\",\n \"memory\": \"23300\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n events = []\\n for L, R, H in buildings:\\n events.append((L, -H, R))\\n events.append((R, 0, 0))\\n\\n events.sort()\\n print(events)\\n heap = [(0, float(\\\"inf\\\"))]\\n\\n result = []\\n\\n for x, h, r in events:\\n if h<0:\\n heapq.heappush(heap, (h, r))\\n else:\\n while heap and heap[0][1] <= x:\\n heapq.heappop(heap)\\n print(heap[0])\\n current_height = -heap[0][0]\\n if not result or result[-1][1] != current_height:\\n result.append([x, current_height]) # Add a key point if the height changes\\n return result\",\n \"memory\": \"23300\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n skyline = []\\n\\n points = []\\n for building in buildings:\\n l, r, h = building\\n points.append((l, h, False))\\n points.append((r, h, True))\\n\\n # sort highest preference \\n # 1. same point x\\n # 2. highest height\\n # 3. starting point\\n points.sort(key=lambda x: (x[0], -x[1], x[2]))\\n \\n # sorted array so we can add and remove heights as we pass through each building\\n # sl = SortedList([0])\\n # max heap window\\n window = []\\n past = []\\n\\n i = 0\\n while i < len(points):\\n cur = points[i][0]\\n\\n # example points = [(5, 12, False), (12, 18, False), (12, 12, True), (13, 18, True)]\\n # there are multiple points with same point x so we need to find the max height and do not process those events again\\n # while loop gets executed atleast once for sure, so we are adding +1 to iterator\\n while i < len(points) and cur == points[i][0]:\\n x, h, ending = points[i]\\n if ending == False:\\n heapq.heappush(window, (-h, x))\\n if ending == True:\\n heapq.heappush(past, (-h, x))\\n while len(window) > 0 and len(past) > 0 and window[0][0] == past[0][0]:\\n heapq.heappop(window)\\n heapq.heappop(past)\\n i = i + 1\\n \\n if len(window) == 0:\\n skyline.append([cur, 0])\\n elif len(skyline) == 0:\\n skyline.append([cur, -window[0][0]])\\n elif skyline[-1][1] != -window[0][0]:\\n skyline.append([cur, -window[0][0]])\\n\\n return skyline\\n\",\n \"memory\": \"23400\"\n },\n {\n \"code\": \"class Solution:\\n def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:\\n lasting_heights = list()\\n heapify(lasting_heights)\\n \\n \\n \\n valid_points = list()\\n \\n for idx,(x1,x2,height) in enumerate(buildings):\\n valid_points.append((x1,height,1,idx))\\n valid_points.append((x2,height,-1,idx))\\n \\n valid_points.sort(key = lambda x: (x[0],x[1]*-x[2]))\\n \\n cur_x = 0\\n cur_y = 0\\n \\n ans = list()\\n closed = set()\\n \\n for x,y,status,idx in valid_points:\\n \\n if status == 1:\\n \\n heappush(lasting_heights,(-y,idx))\\n \\n if lasting_heights and -lasting_heights[0][0] <= cur_y:\\n continue\\n \\n cur_x = x\\n cur_y = -lasting_heights[0][0]\\n \\n \\n else:\\n closed.add(idx)\\n \\n while lasting_heights and lasting_heights[0][1] in closed:\\n heappop(lasting_heights)\\n \\n if not lasting_heights:\\n cur_x = x\\n cur_y = 0\\n else:\\n cur_x = x\\n cur_y = -lasting_heights[0][0]\\n \\n \\n if ans and cur_y == ans[-1][1]:\\n continue\\n \\n ans.append([cur_x,cur_y])\\n \\n \\n return ans\\n \",\n \"memory\": \"23400\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":37,"string":"37"}}},{"rowIdx":146,"cells":{"question_id":{"kind":"number","value":219,"string":"219"},"name":{"kind":"string","value":"contains-duplicate-ii"},"content":{"kind":"string","value":"<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <code>true</code> <em>if there are two <strong>distinct indices</strong> </em><code>i</code><em> and </em><code>j</code><em> in the array such that </em><code>nums[i] == nums[j]</code><em> and </em><code>abs(i - j) <= k</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,1], k = 3\n<strong>Output:</strong> true\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [1,0,1,1], k = 1\n<strong>Output:</strong> true\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [1,2,3,1,2,3], k = 2\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>-10<sup>9</sup> <= nums[i] <= 10<sup>9</sup></code></li>\n\t<li><code>0 <= k <= 10<sup>5</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":46.43736608001771,"string":"46.437366"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["array","hash-table","sliding-window"],"string":"[\n \"array\",\n \"hash-table\",\n \"sliding-window\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"66\", 0.015], [\"72\", 0.0347], [\"78\", 0.0398], [\"84\", 0.0199], [\"90\", 0.005], [\"96\", 0.0099], [\"102\", 0.005], [\"108\", 0.0099], [\"114\", 0.0099], [\"120\", 0.0199], [\"126\", 0.0249], [\"132\", 0.0199], [\"138\", 0.0199], [\"144\", 0.0547], [\"150\", 0.0398], [\"156\", 0.1243], [\"162\", 0.0796], [\"168\", 0.1392], [\"174\", 0.184], [\"180\", 0.189], [\"185\", 0.194], [\"191\", 0.3979], [\"197\", 0.3183], [\"203\", 0.4526], [\"209\", 0.5918], [\"215\", 0.7112], [\"221\", 0.6465], [\"227\", 0.935], [\"233\", 0.9101], [\"239\", 1.0841], [\"245\", 1.3378], [\"251\", 1.5815], [\"257\", 1.85], [\"263\", 1.9097], [\"269\", 2.0788], [\"275\", 2.2578], [\"281\", 2.213], [\"287\", 2.7352], [\"293\", 2.5562], [\"299\", 2.8894], [\"304\", 2.9043], [\"310\", 2.954], [\"316\", 2.969], [\"322\", 2.9739], [\"328\", 3.0635], [\"334\", 3.1828], [\"340\", 2.8645], [\"346\", 2.7551], [\"352\", 2.8446], [\"358\", 2.7551], [\"364\", 2.7203], [\"370\", 2.3871], [\"376\", 2.4915], [\"382\", 2.218], [\"388\", 1.8798], [\"394\", 1.845], [\"400\", 1.5317], [\"406\", 1.5218], [\"412\", 1.298], [\"418\", 1.0692], [\"423\", 1.3129], [\"429\", 1.0593], [\"435\", 0.9698], [\"441\", 0.8554], [\"447\", 0.6565], [\"453\", 0.741], [\"459\", 0.7161], [\"465\", 0.6415], [\"471\", 0.5421], [\"477\", 0.4675], [\"483\", 0.9598], [\"489\", 2.0736999999999997], [\"495\", 1.5516], [\"501\", 1.0295], [\"507\", 0.9001999999999999], [\"513\", 0.8702000000000001], [\"519\", 0.8752], [\"525\", 0.7310999999999999], [\"531\", 0.6364], [\"537\", 0.4277]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"24763\", 0.01], [\"24891\", 0.005], [\"25018\", 0.0099], [\"25146\", 0.005], [\"25273\", 0.005], [\"25401\", 0.005], [\"25528\", 0.0099], [\"25656\", 0.005], [\"25783\", 0.005], [\"25911\", 0.005], [\"26038\", 0.005], [\"26166\", 0.0099], [\"26293\", 0.0149], [\"26421\", 0.0199], [\"26548\", 0.0448], [\"26676\", 0.0746], [\"26803\", 0.4724], [\"26931\", 0.4526], [\"27058\", 0.0995], [\"27186\", 0.0895], [\"27313\", 0.184], [\"27441\", 0.5968], [\"27568\", 0.179], [\"27696\", 0.8106], [\"27823\", 8.7826], [\"27951\", 12.139399999999998], [\"28078\", 0.1492], [\"28206\", 0.0895], [\"28333\", 0.0398], [\"28461\", 0.0596], [\"28588\", 0.0696], [\"28716\", 0.0746], [\"28843\", 0.9400000000000001], [\"28971\", 0.2039], [\"29098\", 0.0696], [\"29226\", 0.1492], [\"29353\", 2.0539], [\"29481\", 1.3278], [\"29608\", 2.3772], [\"29736\", 18.893], [\"29863\", 37.606899999999996], [\"29991\", 0.9897], [\"30118\", 0.194], [\"30246\", 0.0099], [\"30373\", 0.0099], [\"30501\", 0.0348], [\"30628\", 0.0298], [\"30756\", 0.0149], [\"30883\", 0.0199], [\"31011\", 0.0199], [\"31138\", 0.06470000000000001], [\"31266\", 0.0298], [\"31393\", 0.0199], [\"31521\", 0.0298], [\"31648\", 0.0348], [\"31776\", 0.0497], [\"31903\", 0.0995], [\"32031\", 0.0547], [\"32158\", 0.0647], [\"32286\", 0.0199], [\"32413\", 0.005], [\"32541\", 0.0298], [\"32668\", 0.0099], [\"32796\", 0.0099], [\"32923\", 0.0099], [\"33051\", 0.0099], [\"33178\", 0.005], [\"33306\", 0.0348], [\"33433\", 0.0149], [\"33561\", 0.049699999999999994], [\"33688\", 0.0199], [\"33816\", 0.0547], [\"33943\", 0.2387], [\"34071\", 0.0796], [\"34198\", 0.0348], [\"34326\", 0.0945], [\"34453\", 1.0394], [\"34581\", 1.2831], [\"34708\", 0.7808], [\"34836\", 0.7509]]}"},"rt_list":{"kind":"list like","value":[{"code":"def check(arr,k):\n dic = {}\n for i in range(len(arr)):\n if arr[i] in dic and abs(dic[arr[i]]-i) <= k:\n return \"true\"\n else:\n dic[arr[i]] = i \n return 'false'\n\n\nif __name__=='__main__':\n f = open('user.out','w')\n data = list(map(loads,stdin))\n i = 0 \n while i < len(data):\n ans = check(data[i],data[i+1])\n i += 2 \n print(ans,file=f)\nexit(0)","runtime":"66"},{"code":"with open('user.out','w') as f:\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\n def containsNearbyDuplicate(nums: List[int], k: int) -> bool:\n d = {}\n for i,num in enumerate(nums):\n if num in d and i - d[num] <= k:\n return True\n d[num] = i\n return False\n msg = 'true' if containsNearbyDuplicate(nums, k) else 'false'\n print(msg, file = f)\nexit()","runtime":"66"},{"code":"if __name__ == '__main__':\n with open('user.out','w') as f:\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\n def containsNearbyDuplicate(nums: List[int], k: int) -> bool:\n hashtable = {}\n for i in range(len(nums)) :\n if nums[i] in hashtable.keys() and (i - hashtable[nums[i]]) <= k:\n return True\n else:\n hashtable[nums[i]] = i\n return False\n msg = 'true' if containsNearbyDuplicate(nums, k) else 'false'\n print(msg, file = f)\n exit()","runtime":"72"},{"code":"# class Solution:\ndef dup(nums: List[int], k: int) -> str:\n d = {}\n for i,n in enumerate(nums):\n if n in d:\n if i-d[n] <= k:\n return 'true'\n d[n]=i\n return 'false'\n\nwith open('user.out', 'w') as f:\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\n f.write(dup(nums, k)+'\\n')\nexit()","runtime":"72"},{"code":"with open('user.out','w') as f:\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\n def containsNearbyDuplicate(nums: List[int], k: int) -> bool:\n d = {}\n for i,num in enumerate(nums):\n if num in d and i - d[num] <= k:\n return True\n d[num] = i\n return False\n msg = 'true' if containsNearbyDuplicate(nums, k) else 'false'\n print(msg, file = f)\nexit()","runtime":"78"},{"code":"if __name__ == '__main__':\n with open('user.out','w') as f:\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\n def containsNearbyDuplicate(nums: List[int], k: int) -> bool:\n hashtable = {}\n for i in range(len(nums)) :\n if nums[i] in hashtable.keys() and (i - hashtable[nums[i]]) <= k:\n return True\n else:\n hashtable[nums[i]] = i\n return False\n msg = 'true' if containsNearbyDuplicate(nums, k) else 'false'\n print(msg, file = f)\n exit()","runtime":"78"},{"code":"with open('user.out','w') as f:\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\n def containsNearbyDuplicate(nums: List[int], k: int) -> bool:\n hashtable = {}\n for i in range(len(nums)) :\n if nums[i] in hashtable.keys() and (i - hashtable[nums[i]]) <= k:\n return True\n else:\n hashtable[nums[i]] = i\n return False\n msg = 'true' if containsNearbyDuplicate(nums, k) else 'false'\n print(msg, file = f)\nexit()\n ","runtime":"84"},{"code":"with open('user.out','w') as f:\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\n def containsNearbyDuplicate(nums: List[int], k: int) -> bool:\n d = {}\n for i,num in enumerate(nums):\n if num in d and i - d[num] <= k:\n return True\n d[num] = i\n return False\n msg = 'true' if containsNearbyDuplicate(nums, k) else 'false'\n print(msg, file = f)\nexit()","runtime":"84"},{"code":"# class Solution:\n# def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n# dic = {}\n# for i, v in enumerate(nums):\n# if v in dic and i - dic[v] <= k:\n# return True\n# dic[v] = i\n# return False\n\n\nif __name__ == '__main__':\n with open('user.out','w') as f:\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\n def containsNearbyDuplicate(nums: List[int], k: int) -> bool:\n hashtable = {}\n for i in range(len(nums)) :\n if nums[i] in hashtable.keys() and (i - hashtable[nums[i]]) <= k:\n return True\n else:\n hashtable[nums[i]] = i\n return False\n msg = 'true' if containsNearbyDuplicate(nums, k) else 'false'\n print(msg, file = f)\n exit()\n \n","runtime":"90"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums, k):\n num_indices = {}\n for i, num in enumerate(nums):\n if num in num_indices and i - num_indices[num] <= k:\n return True\n num_indices[num] = i\n return False","runtime":"96"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n\n index_map = {}\n for i, val in enumerate(nums):\n\n if val in index_map and abs(i - index_map[val]) <= k:\n return True\n index_map[val] = i\n\n return False\n ","runtime":"102"},{"code":"\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n seen = {}\n for i in range(len(nums)):\n if nums[i] in seen:\n if i - seen[nums[i]] <= k:\n return True\n seen[nums[i]] = i\n return False\n \n ","runtime":"108"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n dict1 = {}\n for index, value in enumerate(nums):\n if (value in dict1 and index - dict1[value] <= k):\n return True\n dict1[value] = index\n return False","runtime":"114"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n _dict = {}\n for i in range(len(nums)):\n if nums[i] in _dict and i - _dict[nums[i]] <= k:\n return True\n _dict[nums[i]] = i\n return False","runtime":"120"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n seen = {}\n\n for i in range(len(nums)):\n if nums[i] in seen:\n # 如果当前数字之前出现过，检查索引差是否小于等于 k\n if i - seen[nums[i]] <= k:\n return True\n # 更新数字的最新位置\n seen[nums[i]] = i\n \n return False","runtime":"126"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n duplicates = {}\n for idx in range(len(nums)):\n if nums[idx] not in duplicates:\n duplicates[nums[idx]] = idx\n else:\n if (abs(idx - duplicates[nums[idx]]) > k):\n duplicates[nums[idx]] = idx\n else: \n return True\n\n return False\n ","runtime":"132"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n n={}\n for i in range(len(nums)):\n if nums[i] in n and abs(i-n[nums[i]]) <= k:\n return True\n n[nums[i]]=i\n return False\n ","runtime":"138"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n numIndexes = {}\n n = len(nums)\n \n for i in range(n):\n number = nums[i]\n if number in numIndexes and abs(numIndexes[number] - i) <= k:\n return True\n numIndexes[number] = i\n return False","runtime":"144"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = {}\n for i, n in enumerate(nums):\n if n in d and abs(i - d[n]) <= k:\n return True\n else:\n d[n] = i\n return False","runtime":"150"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hs = defaultdict(int)\n for i in range(len(nums)):\n # print(nums[i],hs[nums[i]])\n # print(hs)\n # print(nums[i] in hs)\n if nums[i] in hs and abs(i - hs[nums[i]]) <= k:\n return True\n else:\n hs[nums[i]] = i\n # print(hs)\n return False","runtime":"156"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n\n\n seen = {}\n\n for i in range(0, len(nums)):\n\n if nums[i] in seen and i - seen[nums[i]] <=k:\n return True\n \n seen[nums[i]] = i\n return False\n ","runtime":"162"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n last_occurrence = {}\n\n for i, num in enumerate(nums):\n if num not in last_occurrence:\n last_occurrence[num] = i\n else:\n if i - last_occurrence[num] <= k:\n return True\n else:\n last_occurrence[num] = i\n\n return False\n ","runtime":"168"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n \n index_map = {}\n \n for i, num in enumerate(nums):\n if num in index_map and i - index_map[num] <= k:\n return True\n index_map[num] = i\n \n return False\n\n\n ","runtime":"168"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = {}\n\n for i, n in enumerate(nums):\n if n in d and i - d[n] <= k:\n return True\n else:\n d[n] = i\n \n return False\n","runtime":"174"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n numMap = {}\n n = len(nums)\n for i in range(n):\n if nums[i] in numMap and abs(i - numMap[nums[i]]) <= k:\n return True\n numMap[nums[i]] = i\n return False","runtime":"180"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = dict()\n for i in range(len(nums)):\n if nums[i] in d and abs(i - d[nums[i]]) <= k:\n return True\n d[nums[i]] = i\n return False","runtime":"197"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n last_ind = {}\n\n for i, num in enumerate(nums):\n if num in last_ind and i - last_ind[num] <= k:\n return True \n last_ind[num] = i\n return False\n ","runtime":"197"},{"code":"from collections import defaultdict \n\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = {} \n\n for i,num in enumerate(nums): \n if num in d and (i - d[num] <= k): \n return True \n else: \n d[num] = i \n\n return False \n","runtime":"203"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d={}\n for i,n in enumerate(nums):\n if n in d and abs(i-d[n])<=k:\n return True\n else:\n d[n]=i\n return False","runtime":"209"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n seen={}\n for i in range(len(nums)):\n if nums[i] in seen and abs(i-seen[nums[i]])<=k:\n return True\n seen[nums[i]]=i\n\n return False\n","runtime":"215"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n '''\n window=set()\n l=0\n for r in range(len(nums)):\n \n if r-l>k:\n window.remove(nums[l])\n l+=1 \n if nums[r] in window:\n return True\n window.add(nums[r])\n return False\n\n \n\n \n \n '''\n track={}\n for i in range(len(nums)):\n if nums[i] in track and max(track[nums[i]]-i,(track[nums[i]]-i)*-1)<= k:\n return True\n track[nums[i]]=i\n return False \n #my attempt\n \n\n \n\n\n ","runtime":"221"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hmap = {}\n for i in range(len(nums)):\n num = nums[i]\n exists_at = hmap.get(num)\n if exists_at is not None and i - exists_at <= k:\n return True\n hmap[num] = i\n\n return False\n\n ","runtime":"221"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n dist = {}\n\n for i, n in enumerate(nums):\n if n in dist:\n if i - dist[n] -1 < k:\n return True\n\n dist[n] = i\n\n return False \n\n ","runtime":"227"},{"code":"class Solution:\n \n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n dict_ = {}\n for j,n in enumerate(nums):\n if n in dict_ and abs(j - dict_[n])<=k:\n return True\n dict_[n] = j\n\n return False","runtime":"227"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n ls = dict()\n\n for i , n in enumerate(nums):\n if n in ls and i- ls[n] <= k:\n return True \n ls[n] = i\n return False \n \n","runtime":"233"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n tracker = dict()\n for idx, num in enumerate(nums):\n if num in tracker:\n if abs(tracker[num]-idx) <= k:\n return True\n tracker[num] = idx\n return False","runtime":"233"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n dic = {}\n for i,num in enumerate(nums):\n if num in dic and i - dic[num] <= k:\n return True\n dic[num] = i\n \n return False","runtime":"239"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n seen = {}\n for i in range(len(nums)):\n if nums[i] in seen:\n j = seen[nums[i]]\n if abs(i -j) <= k:\n return True\n seen[nums[i]] = i\n return False\n","runtime":"245"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = {}\n for i in range(len(nums)):\n if nums[i] in d:\n if abs(d[nums[i]] - i) <= k:\n return True\n d[nums[i]] = i\n return False\n","runtime":"245"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n num_indices = {}\n\n for i, num in enumerate(nums):\n # Check if the number is already in the map and the difference of indices is <= k\n if num in num_indices and i - num_indices[num] <= k:\n return True\n \n # Update the index of the current number\n num_indices[num] = i\n \n return False\n","runtime":"251"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n indexes = {}\n for i, num in enumerate(nums):\n if num in indexes:\n if i - indexes[num] <= k:\n return True\n indexes[num] = i\n return False","runtime":"251"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hsh={}\n for i in range(len(nums)):\n if nums[i] in hsh and i-hsh[nums[i]]<=k:\n return True \n hsh[nums[i]]=i\n return False\n ","runtime":"257"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n res={}\n for i,num in enumerate(nums):\n if num in res and i-res[num]<=k:\n return True\n res[num]=i\n return False \n\n\n ","runtime":"257"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n if k == 0:\n return False\n\n numsMap = collections.defaultdict(int)\n\n for i in range(len(nums)):\n if nums[i] in numsMap and abs(numsMap[nums[i]] - i) <= k:\n return True\n numsMap[nums[i]] = i\n\n return False\n\n\n","runtime":"263"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n positions = {}\n for index, num in enumerate(nums):\n prev_index = positions.get(num, None)\n if prev_index is not None and (index - prev_index <= k):\n return True\n positions[num] = index\n return False","runtime":"263"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashmap = {} # Use a dictionary to store value and its latest index\n for i in range(len(nums)):\n if nums[i] in hashmap and abs(i - hashmap[nums[i]]) <= k:\n return True\n # Update the dictionary with the current index of nums[i]\n hashmap[nums[i]] = i\n return False\n","runtime":"269"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashmap = {}\n for i in range(len(nums)):\n if nums[i] in hashmap and abs(i - hashmap[nums[i]]) <= k:\n return True\n else:\n hashmap[nums[i]] = i\n return False","runtime":"269"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n dic = {}\n for i in range(len(nums)):\n if nums[i] in dic and abs(i - dic[nums[i]]) <= k:\n return True\n dic[nums[i]] = i\n return False\n ","runtime":"275"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n checked = {}\n for i, x in enumerate(nums):\n if x in checked and abs(checked[x] - i) <= k:\n return True\n checked[x] = i \n return False\n\n","runtime":"275"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n # Dictionary to store the last seen index of each element\n index_map = {}\n \n # Iterate over the array with index\n for i, num in enumerate(nums):\n if num in index_map:\n # Check if the distance between indices is within k\n if i - index_map[num] <= k:\n return True\n # Update the last seen index of the current number\n index_map[num] = i\n \n # If no valid pair is found\n return False","runtime":"281"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n indices = {}\n for i in range(len(nums)):\n if nums[i] in indices:\n if i - indices[nums[i]] <= k:\n return True\n indices[nums[i]] = i\n else:\n indices[nums[i]] = i\n\n return False","runtime":"281"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n index_map = {}\n \n for i, num in enumerate(nums):\n if num in index_map:\n \n if i - index_map[num] <= k:\n return True\n \n index_map[num] = i\n \n return False\n\n \n \n \n\n \n \n ","runtime":"287"},{"code":"class Solution:\n def containsNearbyDuplicate(self, arr: List[int], k: int) -> bool:\n hashmap = {}\n for i in range(len(arr)):\n if arr[i] in hashmap and i-hashmap[arr[i]]<=k:\n return True\n hashmap[arr[i]]=i\n return False\n\n \n","runtime":"287"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window = set()\n\n L = 0\n\n for R in range(len(nums)):\n if R - L > k:\n window.remove(nums[L])\n L += 1\n \n if nums[R] in window:\n return True\n \n window.add(nums[R])\n \n return False","runtime":"293"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n map = dict()\n for i, num in enumerate(nums):\n if num in map and i-map[num]<=k:\n return True\n map[num] = i\n \n return False","runtime":"293"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n m = {}\n\n for i in range(len(nums)):\n if nums[i] in m:\n if abs(i - m[nums[i]]) <=k:\n return True\n \n m[nums[i]] = i\n return False\n ","runtime":"299"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hash_map = {} # {num: index}\n\n for i, num in enumerate(nums):\n if num in hash_map:\n if abs(hash_map[num] - i) <= k:\n return True\n hash_map[num] = i\n \n return False","runtime":"299"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window=set()\n l=0\n\n for r in range(len(nums)):\n if r-l>k:\n window.remove(nums[l])\n l+=1\n if nums[r] in window:\n return True\n\n window.add(nums[r])\n\n return False\n\n ","runtime":"304"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n num_ind = {}\n for i, num in enumerate(nums):\n if num in num_ind and abs(i-num_ind[num])<=k:\n return True\n \n num_ind[num] = i\n return False\n ","runtime":"304"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = {}\n for i, x in enumerate(nums):\n if x in d and i - d[x] <= k:\n return True\n d[x] = i\n return False\n ","runtime":"310"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n # Create hset for storing previous of k elements...\n hset = {}\n # Traverse for all elements of the given array in a for loop...\n for idx in range(len(nums)):\n # If duplicate element is present at distance less than equal to k, return true...\n if nums[idx] in hset and abs(idx - hset[nums[idx]]) <= k:\n return True\n hset[nums[idx]] = idx\n # If no duplicate element is found then return false...\n return False","runtime":"310"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = {}\n for i,v in enumerate(nums):\n if v not in d:\n d[v] = i\n else:\n if abs(d[v]-i)<=k:\n return True\n else:\n d[v] = i\n # return False\n return False\n\n","runtime":"316"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n dicValueFoundsIndexed = {}\n for i in range(len(nums)):\n if nums[i] in dicValueFoundsIndexed:\n if abs(dicValueFoundsIndexed.get(nums[i])-i) <=k:\n return True\n dicValueFoundsIndexed[nums[i]] = i\n return False\n","runtime":"316"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n if k == 0:\n return False\n\n numsMap = collections.defaultdict(int)\n\n for i in range(len(nums)):\n if nums[i] in numsMap and abs(numsMap[nums[i]] - i) <= k:\n return True\n numsMap[nums[i]] = i\n\n return False\n\n\n","runtime":"322"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n # Create hset for storing previous of k elements...\n hset = {}\n # Traverse for all elements of the given array in a for loop...\n for idx in range(len(nums)):\n # If duplicate element is present at distance less than equal to k, return true...\n if nums[idx] in hset and abs(idx - hset[nums[idx]]) <= k:\n return True\n hset[nums[idx]] = idx\n # If no duplicate element is found then return false...\n return False","runtime":"322"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n indexes = {}\n for i in range(len(nums)):\n if nums[i] in indexes:\n if i - indexes[nums[i]] <= k:\n return True\n indexes[nums[i]] = i\n return False","runtime":"328"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n seen = {}\n\n for i, num in enumerate(nums):\n\n if nums[i] in seen and i - seen[num] <= k:\n return True\n\n seen[nums[i]] = i\n\n return False\n","runtime":"328"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n window = set()\n for i in range(n):\n if i > k:\n window.remove(nums[i-k-1])\n if nums[i] in window:\n return True\n window.add(nums[i])\n return False\n ","runtime":"334"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n indices = {}\n for i in range(len(nums)):\n if nums[i] in indices:\n if abs(i - indices[nums[i]]) <= k:\n return True\n indices[nums[i]] = i\n else:\n indices[nums[i]] = i\n\n return False","runtime":"334"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n # Dictionary to store the last index of each element\n index_map = {}\n \n for i, num in enumerate(nums):\n # If the number is already in the map and the difference between indices is <= k\n if num in index_map and i - index_map[num] <= k:\n return True\n # Update the map with the current index of the number\n index_map[num] = i\n \n return False\n\n","runtime":"340"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n \n \n map = {}\n \n for i, num in enumerate(nums):\n \n if num in map:\n if abs(i - map[num]) <= k:\n return True\n map[num] = i\n \n return False","runtime":"340"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n new_arr = {}\n for i in range(len(nums)):\n if nums[i] not in new_arr:\n new_arr[nums[i]] = i\n else:\n v = new_arr.get(nums[i], 0)\n if abs(i-v)<=k:\n return True\n else:\n if (abs(i-v))>k:\n new_arr[nums[i]] = i\n\n return False\n\n\n ","runtime":"346"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n lastindex = dict()\n for i in range(len(nums)):\n if nums[i] in lastindex:\n if i - lastindex[nums[i]] <= k:\n return True\n lastindex[nums[i]] = i\n return False","runtime":"346"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n num_map = {}\n for i, num in enumerate(nums):\n if num not in num_map:\n num_map[num] = i\n else:\n j = num_map[nums[i]]\n if i - j <= k:\n return True\n else:\n num_map[num] = i\n\n return False\n\n\n\n","runtime":"352"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window = {}\n for R in range(len(nums)):\n if nums[R] in window:\n if abs(window[nums[R]] - R) <= k:\n return True\n window[nums[R]] = R\n\n return False\n ","runtime":"352"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n\n from collections import Counter\n\n dict1 = dict(Counter(nums))\n value_with_dupls = next((key for key in dict1 if dict1[key] > 1), None)\n if value_with_dupls is None:\n return False\n\n for i in range(len(nums)):\n for j in range( i + 1, min(len(nums), i + k + 1) ):\n if nums[i] == nums[j]:\n return True\n \n return False","runtime":"358"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = {}\n l = len(nums)\n for i in range(l):\n if nums[i] not in d:\n d[nums[i]]=i\n else:\n if abs(d[nums[i]]-i)<=k:\n return True\n else:\n d[nums[i]]=i\n return False\n\n\n ","runtime":"358"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashmap = {} # Use a dictionary to store value and its latest index\n for i in range(len(nums)):\n if nums[i] in hashmap and abs(i - hashmap[nums[i]]) <= k:\n return True\n # Update the dictionary with the current index of nums[i]\n hashmap[nums[i]] = i\n return False\n","runtime":"364"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = {}\n for i, x in enumerate(nums):\n if x in d and i - d[x] <= k:\n return True\n d[x] = i\n return False","runtime":"364"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n index_map = {}\n for i, num in enumerate(nums):\n if num in index_map:\n if i - index_map[num] <= k:\n return True\n index_map[num] = i\n return False","runtime":"370"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hm = {}\n\n for i in range(len(nums)):\n if nums[i] not in hm:\n hm[nums[i]] = i\n continue\n else:\n if abs(i - hm[nums[i]])<=k:\n return True\n hm[nums[i]]=i\n return False","runtime":"370"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window = set()\n L = 0\n\n for R in range(len(nums)):\n if R - L > k:\n window.remove(nums[L])\n L += 1\n if nums[R] in window:\n return True\n window.add(nums[R])\n return False\n ","runtime":"376"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n track={}\n for i in range(len(nums)):\n if nums[i] in track:\n diff= max(track[nums[i]]-i,(track[nums[i]]-i)*-1)\n if diff <= k:\n return True\n track[nums[i]]=i\n return False\n\n \n\n \n\n\n ","runtime":"376"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n index_map={}\n for i,num in enumerate(nums):\n if num in index_map:\n if i - index_map[num] <=k:\n return True\n index_map[num]=i\n return False","runtime":"382"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashset = {}\n for i in range(len(nums)):\n if nums[i] in hashset and abs(i-hashset[nums[i]]) <= k:\n return True\n hashset[nums[i]] = i\n return False","runtime":"382"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n ni={}\n for i,num in enumerate(nums):\n if num in ni and i-ni[num]<=k:\n return True\n ni[num]=i\n return False","runtime":"394"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n hset = {}\n for i in range(n):\n if nums[i] in hset and abs(i - hset[nums[i]]) <= k:\n return True\n hset[nums[i]] = i\n return False\n ","runtime":"394"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n h = {}\n for i in range(len(nums)):\n if nums[i] in h:\n if abs(h[nums[i]]-i) <= k:\n return True\n h[nums[i]] = i\n return False\n\n","runtime":"400"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n h = {}\n for i in range(len(nums)):\n if nums[i] in h:\n if abs(h[nums[i]]-i) <= k:\n return True\n h[nums[i]] = i\n return False\n\n","runtime":"400"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n indices={}\n for ind,key in enumerate(nums):\n if(key in indices and ind-indices[key]<=k):\n return True\n indices[key]=ind\n return False\n\n ","runtime":"406"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashmap = {}\n for i in range(len(nums)):\n if nums[i] in hashmap and abs(i - hashmap[nums[i]]) <= k:\n return True\n else:\n hashmap[nums[i]] = i\n return False","runtime":"406"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n num_ind = {}\n for i, num in enumerate(nums):\n if num in num_ind and abs(i-num_ind[num])<=k:\n return True\n else:\n pass\n num_ind[num] = i\n return False\n ","runtime":"412"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window = set()\n left = 0 \n for R in range(len(nums)):\n if abs(left - R) > k:\n window.remove(nums[left])\n left += 1\n if nums[R] in window:\n return True\n\n window.add(nums[R])\n return False","runtime":"412"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashmap = {}\n for i in range(len(nums)):\n if nums[i] in hashmap:\n if abs(i - hashmap[nums[i]]) <= k:\n return True\n hashmap[nums[i]] = i\n return False","runtime":"418"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n d = {}\n for i in range(n):\n if nums[i] in d and abs(i-d[nums[i]]) <= k:\n return True\n else:\n d[nums[i]] = i \n return False \n ","runtime":"418"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n seen = {}\n for i in range(len(nums)):\n if nums[i] in seen and abs(i - seen[nums[i]]) <= k: \n return True\n seen[nums[i]] = i\n return False \n\n ","runtime":"423"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window = set()\n left = 0\n for right in range(len(nums)):\n if right - left > k:\n window.remove(nums[left])\n left+=1\n\n if nums[right] in window:\n return True\n window.add(nums[right])\n return False\n \n \n","runtime":"423"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashmap = set()\n for i in range(len(nums)):\n if nums[i] in hashmap:\n return True\n hashmap.add(nums[i])\n if (len(hashmap) > k):\n hashmap.remove(nums[i - k])\n return False\n ","runtime":"429"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window = set()\n L = 0 \n for R in range(len(nums)):\n if R - L > k:\n window.remove(nums[L])\n L += 1\n if nums[R] in window:\n return True \n window.add(nums[R])\n return False\n ","runtime":"429"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window = set()\n L = 0\n for R in range(len(nums)):\n if R - L > k:\n window.remove(nums[L])\n L += 1\n if nums[R] in window:\n return True\n window.add(nums[R])\n return False\n \n ","runtime":"435"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window=set()\n L=0\n for R in range(len(nums)):\n #if window size exceed remove left\n if R-L>k:\n window.remove(nums[L])\n L+=1\n\n if nums[R] in window:\n return True\n #window size at max k+1\n window.add(nums[R]) \n \n return False ","runtime":"435"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window = set()\n left = 0\n for right in range(len(nums)):\n if right - left > k:\n window.remove(nums[left])\n left+=1\n\n if nums[right] in window:\n return True\n window.add(nums[right])\n return False\n \n ","runtime":"441"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n dic={}\n\n for i,n in enumerate(nums):\n if n in dic and abs(i-dic[n])<=k:\n return True\n else:\n dic[n]=i\n return False\n ","runtime":"441"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashMap = {}\n for i in range(len(nums)):\n if nums[i] in hashMap and abs(hashMap[nums[i]] - i) <= k:\n return True\n hashMap[nums[i]] = i\n return False","runtime":"447"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: list[int], k: int) -> bool:\n seen = set()\n\n for i, num in enumerate(nums):\n if i > k:\n seen.remove(nums[i - k - 1])\n if num in seen:\n return True\n seen.add(num)\n\n return False","runtime":"447"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n l =0\n r =0\n window = set()\n while r<len(nums):\n if r-l>k:\n window.remove(nums[l])\n l+=1\n if nums[r] in window:\n return True\n window.add(nums[r])\n r+=1\n return False\n","runtime":"453"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n dict_ = {}\n for j,n in enumerate(nums):\n if n in dict_ and abs(j - dict_[n])<=k:\n return True\n dict_[n] = j\n\n return False","runtime":"453"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hash_map = {} # {num: index}\n\n for i in range(len(nums)):\n if nums[i] in hash_map:\n if abs(hash_map[nums[i]] - i) <= k:\n return True\n else:\n hash_map[nums[i]] = i\n else:\n hash_map[nums[i]] = i\n \n return False","runtime":"459"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashset = set()\n L = 0\n\n for R in range(len(nums)):\n if R - L > k:\n hashset.remove(nums[L])\n L += 1\n if nums[R] in hashset:\n return True\n hashset.add(nums[R])\n return False","runtime":"459"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n f={}\n for i in range(len(nums)):\n if(nums[i] not in f):\n f[nums[i]]=i\n else:\n if(abs(f[nums[i]]-i)<=k):\n return True \n f[nums[i]]=i\n else:\n return False","runtime":"465"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums, k):\n visit = {}\n for i in range(len(nums)):\n if nums[i] in visit and abs(i-visit[nums[i]]) <= k:\n return True\n visit[nums[i]] = i\n return False","runtime":"465"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window=set()\n l=0\n for r in range(len(nums)):\n \n if r-l>k:\n window.remove(nums[l])\n l+=1 \n if nums[r] in window:\n return True\n window.add(nums[r])\n return False\n\n \n\n \n \n '''\n track={}\n for i in range(len(nums)):\n if nums[i] in track:\n diff= max(track[nums[i]]-i,(track[nums[i]]-i)*-1)\n if diff <= k:\n return True\n track[nums[i]]=i\n return False \n #my attempt\n '''\n\n \n\n\n ","runtime":"471"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window=set()\n l=0\n for r in range(len(nums)):\n \n if r-l>k:\n window.remove(nums[l])\n l+=1 \n if nums[r] in window:\n return True\n window.add(nums[r])\n return False\n\n \n\n \n \n '''\n track={}\n for i in range(len(nums)):\n if nums[i] in track:\n diff= max(track[nums[i]]-i,(track[nums[i]]-i)*-1)\n if diff <= k:\n return True\n track[nums[i]]=i\n return False \n #my attempt\n '''\n\n \n\n\n ","runtime":"471"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n current_set = set()\n for i in range(0, min(len(nums), k + 1)):\n if nums[i] in current_set:\n return True\n current_set.add(nums[i])\n for r in range(k + 1, len(nums)):\n current_set.remove(nums[r-k-1])\n if nums[r] in current_set:\n return True\n current_set.add(nums[r])\n return False","runtime":"477"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n seen = {}\n for ind,val in enumerate(nums):\n if val not in seen:\n seen[val] = []\n \n else:\n for i in seen[val]:\n if ind-i <=k:\n return True\n seen[val].append(ind)\n return False","runtime":"477"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n h = {}\n for i in range(len(nums)):\n if nums[i] in h:\n if abs(h[nums[i]]-i) <= k:\n return True\n h[nums[i]] = i\n return False\n\n","runtime":"483"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n\n l = 0\n r = 0\n seen = set()\n while r < len(nums):\n if nums[r] in seen:\n return True\n\n seen.add(nums[r])\n\n if r - l + 1 > k:\n seen.remove(nums[l])\n l += 1\n r += 1\n\n return False\n","runtime":"483"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashmap = set()\n for i in range(len(nums)):\n if nums[i] in hashmap:\n return True\n hashmap.add(nums[i])\n if (len(hashmap) > k):\n hashmap.remove(nums[i - k])\n return False\n ","runtime":"489"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n L, R = 0, 0\n vals = {}\n while R < len(nums):\n dist = R - L\n if dist > k:\n vals[nums[L]] -= 1 \n L += 1\n continue\n if nums[R] in vals and vals[nums[R]] >= 1:\n return True\n vals[nums[R]] = 1\n R += 1\n return False","runtime":"489"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: list[int], k: int) -> bool:\n seen = set()\n\n for i, num in enumerate(nums):\n if i > k:\n seen.remove(nums[i - k - 1])\n if num in seen:\n return True\n seen.add(num)\n\n return False","runtime":"495"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n l = 0\n contained = set()\n for r in range(len(nums)):\n if r - l > k:\n contained.remove(nums[l])\n l += 1\n if nums[r] in contained:\n return True\n contained.add(nums[r])\n return False","runtime":"495"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n track={}\n for i in range(len(nums)):\n if nums[i] in track:\n diff= max(track[nums[i]]-i,(track[nums[i]]-i)*-1)\n if diff <= k:\n return True\n track[nums[i]]=i\n return False\n\n \n\n \n\n\n ","runtime":"501"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n # i = 0\n # length = len(nums)\n # while arr := nums[i:i+k+1]:\n \n # if len(set(arr)) != len(arr):\n # return True\n # i += 1\n # return False\n d = defaultdict(int)\n lagging = 0\n for i in range(len(nums)):\n if d[nums[i]] > 0:\n return True\n else:\n d[nums[i]] += 1\n if i > k - 1:\n d[nums[lagging]] = 0\n lagging += 1\n return False\n \n ","runtime":"501"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n l=len(nums)\n d={}\n for i in range(l):\n if nums[i] not in d:\n d[nums[i]]=[]\n d[nums[i]].append(i)\n for i in d.keys():\n le=len(d[i])\n if le>=2:\n for j in range(le-1):\n if abs(d[i][j]-d[i][j+1])<=k:\n return True\n\n return False\n\n\n\n\n\n\n \n\n ","runtime":"507"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n count_ = {}\n for num in nums:\n try:\n count_[num] += 1\n except:\n count_[num] = 1\n for i in range(len(nums)):\n if count_[nums[i]] > 1 and nums[i] in nums[i + 1 : i + k + 1]:\n return True\n return False","runtime":"507"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n if k == 0: return False\n mp = defaultdict(list)\n for i, num in enumerate(nums):\n mp[num].append(i)\n for num in mp:\n if len(mp[num]) > 1:\n curr = sorted(mp[num])\n for i in range(1, len(curr)):\n if abs(curr[i] - curr[i-1]) <= k:\n return True\n return False","runtime":"513"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n h_map = defaultdict(list)\n for i in range(len(nums)):\n if nums[i] in h_map:\n if i - h_map[nums[i]][0] <= k:\n return True\n else:\n h_map[nums[i]][0] = i\n else:\n h_map[nums[i]].append(i)\n return False ","runtime":"513"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n inter={}\n i=0\n for x in nums:\n if x not in inter:\n inter[x]=[i]\n else:\n inter[x].append(i)\n i+=1\n \n j=0\n for x in nums:\n for y in inter[x]:\n if y!=j and abs(y-j)<=k:\n return True\n j+=1 \n return False \n ","runtime":"519"},{"code":"from collections import defaultdict\n\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hmap = defaultdict(list)\n for i, num in enumerate(nums):\n hmap[num].append(i)\n if len(hmap[num]) > 1 and hmap[num][-1] - hmap[num][-2] <= k:\n return True\n\n return False\n\n ","runtime":"519"},{"code":"from collections import Counter\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = {}\n for i in range(len(nums)):\n key, val = nums[i], i\n if key not in d:\n d[key] = [i]\n else:\n d[key].append(i)\n \n for key, val in d.items():\n for i in range(len(val)-1): \n for j in range(i+1, len(val)): \n if abs(val[i] - val[j]) <= k:\n return True\n return False\n\n ","runtime":"525"},{"code":"from collections import defaultdict\n\n\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n indexes = dict()\n for i in range(len(nums)):\n n = nums[i]\n if n not in indexes:\n indexes[n] = []\n indexes[n].append(i)\n\n for idxs in indexes.values():\n for i in range(len(idxs) - 1):\n if abs(idxs[i] - idxs[i + 1]) <= k:\n return True\n return False\n","runtime":"525"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n k+=1\n c = Counter(nums[:k])\n if [i for i in c.values() if i>1]:\n return True\n \n p = k\n\n while p < len(nums): \n c[nums[p-k]] -= 1\n if c[nums[p]] > 0:\n return True\n c[nums[p]] += 1\n p+=1\n\n return False","runtime":"531"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n numMap = {}\n\n for i in range(len(nums)):\n if nums[i] in numMap:\n numMap[nums[i]] += [i]\n else:\n numMap[nums[i]] = [i]\n\n for key, values in numMap.items():\n if len(values) > 1:\n i , j = 0 , 1\n while j < len(values) and i < j:\n if abs(values[i] - values[j]) <= k:\n return True\n elif abs(values[i] - values[j]) > k:\n i += 1\n j += 1\n\n return False","runtime":"531"},{"code":"from collections import defaultdict\n\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n dd = defaultdict(list)\n\n for i, v in enumerate(nums):\n dd[v].append(i)\n\n for i, v in enumerate(nums):\n for j in dd[v]:\n if i != j and abs(i-j) <= k:\n return True\n \n return False","runtime":"537"},{"code":"from collections import defaultdict\n\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n dd = defaultdict(list)\n\n for i, v in enumerate(nums):\n dd[v].append(i)\n\n for i, v in enumerate(nums):\n for j in dd[v]:\n if i != j and abs(i-j) <= k:\n return True\n \n return False","runtime":"537"}],"string":"[\n {\n \"code\": \"def check(arr,k):\\n dic = {}\\n for i in range(len(arr)):\\n if arr[i] in dic and abs(dic[arr[i]]-i) <= k:\\n return \\\"true\\\"\\n else:\\n dic[arr[i]] = i \\n return 'false'\\n\\n\\nif __name__=='__main__':\\n f = open('user.out','w')\\n data = list(map(loads,stdin))\\n i = 0 \\n while i < len(data):\\n ans = check(data[i],data[i+1])\\n i += 2 \\n print(ans,file=f)\\nexit(0)\",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"with open('user.out','w') as f:\\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\\n def containsNearbyDuplicate(nums: List[int], k: int) -> bool:\\n d = {}\\n for i,num in enumerate(nums):\\n if num in d and i - d[num] <= k:\\n return True\\n d[num] = i\\n return False\\n msg = 'true' if containsNearbyDuplicate(nums, k) else 'false'\\n print(msg, file = f)\\nexit()\",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"if __name__ == '__main__':\\n with open('user.out','w') as f:\\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\\n def containsNearbyDuplicate(nums: List[int], k: int) -> bool:\\n hashtable = {}\\n for i in range(len(nums)) :\\n if nums[i] in hashtable.keys() and (i - hashtable[nums[i]]) <= k:\\n return True\\n else:\\n hashtable[nums[i]] = i\\n return False\\n msg = 'true' if containsNearbyDuplicate(nums, k) else 'false'\\n print(msg, file = f)\\n exit()\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"# class Solution:\\ndef dup(nums: List[int], k: int) -> str:\\n d = {}\\n for i,n in enumerate(nums):\\n if n in d:\\n if i-d[n] <= k:\\n return 'true'\\n d[n]=i\\n return 'false'\\n\\nwith open('user.out', 'w') as f:\\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\\n f.write(dup(nums, k)+'\\\\n')\\nexit()\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"with open('user.out','w') as f:\\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\\n def containsNearbyDuplicate(nums: List[int], k: int) -> bool:\\n d = {}\\n for i,num in enumerate(nums):\\n if num in d and i - d[num] <= k:\\n return True\\n d[num] = i\\n return False\\n msg = 'true' if containsNearbyDuplicate(nums, k) else 'false'\\n print(msg, file = f)\\nexit()\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"if __name__ == '__main__':\\n with open('user.out','w') as f:\\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\\n def containsNearbyDuplicate(nums: List[int], k: int) -> bool:\\n hashtable = {}\\n for i in range(len(nums)) :\\n if nums[i] in hashtable.keys() and (i - hashtable[nums[i]]) <= k:\\n return True\\n else:\\n hashtable[nums[i]] = i\\n return False\\n msg = 'true' if containsNearbyDuplicate(nums, k) else 'false'\\n print(msg, file = f)\\n exit()\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"with open('user.out','w') as f:\\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\\n def containsNearbyDuplicate(nums: List[int], k: int) -> bool:\\n hashtable = {}\\n for i in range(len(nums)) :\\n if nums[i] in hashtable.keys() and (i - hashtable[nums[i]]) <= k:\\n return True\\n else:\\n hashtable[nums[i]] = i\\n return False\\n msg = 'true' if containsNearbyDuplicate(nums, k) else 'false'\\n print(msg, file = f)\\nexit()\\n \",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"with open('user.out','w') as f:\\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\\n def containsNearbyDuplicate(nums: List[int], k: int) -> bool:\\n d = {}\\n for i,num in enumerate(nums):\\n if num in d and i - d[num] <= k:\\n return True\\n d[num] = i\\n return False\\n msg = 'true' if containsNearbyDuplicate(nums, k) else 'false'\\n print(msg, file = f)\\nexit()\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"# class Solution:\\n# def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n# dic = {}\\n# for i, v in enumerate(nums):\\n# if v in dic and i - dic[v] <= k:\\n# return True\\n# dic[v] = i\\n# return False\\n\\n\\nif __name__ == '__main__':\\n with open('user.out','w') as f:\\n for nums, k in zip(map(loads, stdin), map(loads, stdin)):\\n def containsNearbyDuplicate(nums: List[int], k: int) -> bool:\\n hashtable = {}\\n for i in range(len(nums)) :\\n if nums[i] in hashtable.keys() and (i - hashtable[nums[i]]) <= k:\\n return True\\n else:\\n hashtable[nums[i]] = i\\n return False\\n msg = 'true' if containsNearbyDuplicate(nums, k) else 'false'\\n print(msg, file = f)\\n exit()\\n \\n\",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums, k):\\n num_indices = {}\\n for i, num in enumerate(nums):\\n if num in num_indices and i - num_indices[num] <= k:\\n return True\\n num_indices[num] = i\\n return False\",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n\\n index_map = {}\\n for i, val in enumerate(nums):\\n\\n if val in index_map and abs(i - index_map[val]) <= k:\\n return True\\n index_map[val] = i\\n\\n return False\\n \",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n seen = {}\\n for i in range(len(nums)):\\n if nums[i] in seen:\\n if i - seen[nums[i]] <= k:\\n return True\\n seen[nums[i]] = i\\n return False\\n \\n \",\n \"runtime\": \"108\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n dict1 = {}\\n for index, value in enumerate(nums):\\n if (value in dict1 and index - dict1[value] <= k):\\n return True\\n dict1[value] = index\\n return False\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n _dict = {}\\n for i in range(len(nums)):\\n if nums[i] in _dict and i - _dict[nums[i]] <= k:\\n return True\\n _dict[nums[i]] = i\\n return False\",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n seen = {}\\n\\n for i in range(len(nums)):\\n if nums[i] in seen:\\n # 如果当前数字之前出现过，检查索引差是否小于等于 k\\n if i - seen[nums[i]] <= k:\\n return True\\n # 更新数字的最新位置\\n seen[nums[i]] = i\\n \\n return False\",\n \"runtime\": \"126\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n duplicates = {}\\n for idx in range(len(nums)):\\n if nums[idx] not in duplicates:\\n duplicates[nums[idx]] = idx\\n else:\\n if (abs(idx - duplicates[nums[idx]]) > k):\\n duplicates[nums[idx]] = idx\\n else: \\n return True\\n\\n return False\\n \",\n \"runtime\": \"132\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n n={}\\n for i in range(len(nums)):\\n if nums[i] in n and abs(i-n[nums[i]]) <= k:\\n return True\\n n[nums[i]]=i\\n return False\\n \",\n \"runtime\": \"138\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n numIndexes = {}\\n n = len(nums)\\n \\n for i in range(n):\\n number = nums[i]\\n if number in numIndexes and abs(numIndexes[number] - i) <= k:\\n return True\\n numIndexes[number] = i\\n return False\",\n \"runtime\": \"144\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = {}\\n for i, n in enumerate(nums):\\n if n in d and abs(i - d[n]) <= k:\\n return True\\n else:\\n d[n] = i\\n return False\",\n \"runtime\": \"150\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hs = defaultdict(int)\\n for i in range(len(nums)):\\n # print(nums[i],hs[nums[i]])\\n # print(hs)\\n # print(nums[i] in hs)\\n if nums[i] in hs and abs(i - hs[nums[i]]) <= k:\\n return True\\n else:\\n hs[nums[i]] = i\\n # print(hs)\\n return False\",\n \"runtime\": \"156\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n\\n\\n seen = {}\\n\\n for i in range(0, len(nums)):\\n\\n if nums[i] in seen and i - seen[nums[i]] <=k:\\n return True\\n \\n seen[nums[i]] = i\\n return False\\n \",\n \"runtime\": \"162\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n last_occurrence = {}\\n\\n for i, num in enumerate(nums):\\n if num not in last_occurrence:\\n last_occurrence[num] = i\\n else:\\n if i - last_occurrence[num] <= k:\\n return True\\n else:\\n last_occurrence[num] = i\\n\\n return False\\n \",\n \"runtime\": \"168\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n \\n index_map = {}\\n \\n for i, num in enumerate(nums):\\n if num in index_map and i - index_map[num] <= k:\\n return True\\n index_map[num] = i\\n \\n return False\\n\\n\\n \",\n \"runtime\": \"168\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = {}\\n\\n for i, n in enumerate(nums):\\n if n in d and i - d[n] <= k:\\n return True\\n else:\\n d[n] = i\\n \\n return False\\n\",\n \"runtime\": \"174\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n numMap = {}\\n n = len(nums)\\n for i in range(n):\\n if nums[i] in numMap and abs(i - numMap[nums[i]]) <= k:\\n return True\\n numMap[nums[i]] = i\\n return False\",\n \"runtime\": \"180\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = dict()\\n for i in range(len(nums)):\\n if nums[i] in d and abs(i - d[nums[i]]) <= k:\\n return True\\n d[nums[i]] = i\\n return False\",\n \"runtime\": \"197\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n last_ind = {}\\n\\n for i, num in enumerate(nums):\\n if num in last_ind and i - last_ind[num] <= k:\\n return True \\n last_ind[num] = i\\n return False\\n \",\n \"runtime\": \"197\"\n },\n {\n \"code\": \"from collections import defaultdict \\n\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = {} \\n\\n for i,num in enumerate(nums): \\n if num in d and (i - d[num] <= k): \\n return True \\n else: \\n d[num] = i \\n\\n return False \\n\",\n \"runtime\": \"203\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d={}\\n for i,n in enumerate(nums):\\n if n in d and abs(i-d[n])<=k:\\n return True\\n else:\\n d[n]=i\\n return False\",\n \"runtime\": \"209\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n seen={}\\n for i in range(len(nums)):\\n if nums[i] in seen and abs(i-seen[nums[i]])<=k:\\n return True\\n seen[nums[i]]=i\\n\\n return False\\n\",\n \"runtime\": \"215\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n '''\\n window=set()\\n l=0\\n for r in range(len(nums)):\\n \\n if r-l>k:\\n window.remove(nums[l])\\n l+=1 \\n if nums[r] in window:\\n return True\\n window.add(nums[r])\\n return False\\n\\n \\n\\n \\n \\n '''\\n track={}\\n for i in range(len(nums)):\\n if nums[i] in track and max(track[nums[i]]-i,(track[nums[i]]-i)*-1)<= k:\\n return True\\n track[nums[i]]=i\\n return False \\n #my attempt\\n \\n\\n \\n\\n\\n \",\n \"runtime\": \"221\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hmap = {}\\n for i in range(len(nums)):\\n num = nums[i]\\n exists_at = hmap.get(num)\\n if exists_at is not None and i - exists_at <= k:\\n return True\\n hmap[num] = i\\n\\n return False\\n\\n \",\n \"runtime\": \"221\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n dist = {}\\n\\n for i, n in enumerate(nums):\\n if n in dist:\\n if i - dist[n] -1 < k:\\n return True\\n\\n dist[n] = i\\n\\n return False \\n\\n \",\n \"runtime\": \"227\"\n },\n {\n \"code\": \"class Solution:\\n \\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n dict_ = {}\\n for j,n in enumerate(nums):\\n if n in dict_ and abs(j - dict_[n])<=k:\\n return True\\n dict_[n] = j\\n\\n return False\",\n \"runtime\": \"227\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n ls = dict()\\n\\n for i , n in enumerate(nums):\\n if n in ls and i- ls[n] <= k:\\n return True \\n ls[n] = i\\n return False \\n \\n\",\n \"runtime\": \"233\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n tracker = dict()\\n for idx, num in enumerate(nums):\\n if num in tracker:\\n if abs(tracker[num]-idx) <= k:\\n return True\\n tracker[num] = idx\\n return False\",\n \"runtime\": \"233\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n dic = {}\\n for i,num in enumerate(nums):\\n if num in dic and i - dic[num] <= k:\\n return True\\n dic[num] = i\\n \\n return False\",\n \"runtime\": \"239\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n seen = {}\\n for i in range(len(nums)):\\n if nums[i] in seen:\\n j = seen[nums[i]]\\n if abs(i -j) <= k:\\n return True\\n seen[nums[i]] = i\\n return False\\n\",\n \"runtime\": \"245\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = {}\\n for i in range(len(nums)):\\n if nums[i] in d:\\n if abs(d[nums[i]] - i) <= k:\\n return True\\n d[nums[i]] = i\\n return False\\n\",\n \"runtime\": \"245\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n num_indices = {}\\n\\n for i, num in enumerate(nums):\\n # Check if the number is already in the map and the difference of indices is <= k\\n if num in num_indices and i - num_indices[num] <= k:\\n return True\\n \\n # Update the index of the current number\\n num_indices[num] = i\\n \\n return False\\n\",\n \"runtime\": \"251\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n indexes = {}\\n for i, num in enumerate(nums):\\n if num in indexes:\\n if i - indexes[num] <= k:\\n return True\\n indexes[num] = i\\n return False\",\n \"runtime\": \"251\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hsh={}\\n for i in range(len(nums)):\\n if nums[i] in hsh and i-hsh[nums[i]]<=k:\\n return True \\n hsh[nums[i]]=i\\n return False\\n \",\n \"runtime\": \"257\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n res={}\\n for i,num in enumerate(nums):\\n if num in res and i-res[num]<=k:\\n return True\\n res[num]=i\\n return False \\n\\n\\n \",\n \"runtime\": \"257\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n if k == 0:\\n return False\\n\\n numsMap = collections.defaultdict(int)\\n\\n for i in range(len(nums)):\\n if nums[i] in numsMap and abs(numsMap[nums[i]] - i) <= k:\\n return True\\n numsMap[nums[i]] = i\\n\\n return False\\n\\n\\n\",\n \"runtime\": \"263\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n positions = {}\\n for index, num in enumerate(nums):\\n prev_index = positions.get(num, None)\\n if prev_index is not None and (index - prev_index <= k):\\n return True\\n positions[num] = index\\n return False\",\n \"runtime\": \"263\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashmap = {} # Use a dictionary to store value and its latest index\\n for i in range(len(nums)):\\n if nums[i] in hashmap and abs(i - hashmap[nums[i]]) <= k:\\n return True\\n # Update the dictionary with the current index of nums[i]\\n hashmap[nums[i]] = i\\n return False\\n\",\n \"runtime\": \"269\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashmap = {}\\n for i in range(len(nums)):\\n if nums[i] in hashmap and abs(i - hashmap[nums[i]]) <= k:\\n return True\\n else:\\n hashmap[nums[i]] = i\\n return False\",\n \"runtime\": \"269\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n dic = {}\\n for i in range(len(nums)):\\n if nums[i] in dic and abs(i - dic[nums[i]]) <= k:\\n return True\\n dic[nums[i]] = i\\n return False\\n \",\n \"runtime\": \"275\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n checked = {}\\n for i, x in enumerate(nums):\\n if x in checked and abs(checked[x] - i) <= k:\\n return True\\n checked[x] = i \\n return False\\n\\n\",\n \"runtime\": \"275\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n # Dictionary to store the last seen index of each element\\n index_map = {}\\n \\n # Iterate over the array with index\\n for i, num in enumerate(nums):\\n if num in index_map:\\n # Check if the distance between indices is within k\\n if i - index_map[num] <= k:\\n return True\\n # Update the last seen index of the current number\\n index_map[num] = i\\n \\n # If no valid pair is found\\n return False\",\n \"runtime\": \"281\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n indices = {}\\n for i in range(len(nums)):\\n if nums[i] in indices:\\n if i - indices[nums[i]] <= k:\\n return True\\n indices[nums[i]] = i\\n else:\\n indices[nums[i]] = i\\n\\n return False\",\n \"runtime\": \"281\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n index_map = {}\\n \\n for i, num in enumerate(nums):\\n if num in index_map:\\n \\n if i - index_map[num] <= k:\\n return True\\n \\n index_map[num] = i\\n \\n return False\\n\\n \\n \\n \\n\\n \\n \\n \",\n \"runtime\": \"287\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, arr: List[int], k: int) -> bool:\\n hashmap = {}\\n for i in range(len(arr)):\\n if arr[i] in hashmap and i-hashmap[arr[i]]<=k:\\n return True\\n hashmap[arr[i]]=i\\n return False\\n\\n \\n\",\n \"runtime\": \"287\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window = set()\\n\\n L = 0\\n\\n for R in range(len(nums)):\\n if R - L > k:\\n window.remove(nums[L])\\n L += 1\\n \\n if nums[R] in window:\\n return True\\n \\n window.add(nums[R])\\n \\n return False\",\n \"runtime\": \"293\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n map = dict()\\n for i, num in enumerate(nums):\\n if num in map and i-map[num]<=k:\\n return True\\n map[num] = i\\n \\n return False\",\n \"runtime\": \"293\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n m = {}\\n\\n for i in range(len(nums)):\\n if nums[i] in m:\\n if abs(i - m[nums[i]]) <=k:\\n return True\\n \\n m[nums[i]] = i\\n return False\\n \",\n \"runtime\": \"299\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hash_map = {} # {num: index}\\n\\n for i, num in enumerate(nums):\\n if num in hash_map:\\n if abs(hash_map[num] - i) <= k:\\n return True\\n hash_map[num] = i\\n \\n return False\",\n \"runtime\": \"299\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window=set()\\n l=0\\n\\n for r in range(len(nums)):\\n if r-l>k:\\n window.remove(nums[l])\\n l+=1\\n if nums[r] in window:\\n return True\\n\\n window.add(nums[r])\\n\\n return False\\n\\n \",\n \"runtime\": \"304\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n num_ind = {}\\n for i, num in enumerate(nums):\\n if num in num_ind and abs(i-num_ind[num])<=k:\\n return True\\n \\n num_ind[num] = i\\n return False\\n \",\n \"runtime\": \"304\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = {}\\n for i, x in enumerate(nums):\\n if x in d and i - d[x] <= k:\\n return True\\n d[x] = i\\n return False\\n \",\n \"runtime\": \"310\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n # Create hset for storing previous of k elements...\\n hset = {}\\n # Traverse for all elements of the given array in a for loop...\\n for idx in range(len(nums)):\\n # If duplicate element is present at distance less than equal to k, return true...\\n if nums[idx] in hset and abs(idx - hset[nums[idx]]) <= k:\\n return True\\n hset[nums[idx]] = idx\\n # If no duplicate element is found then return false...\\n return False\",\n \"runtime\": \"310\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = {}\\n for i,v in enumerate(nums):\\n if v not in d:\\n d[v] = i\\n else:\\n if abs(d[v]-i)<=k:\\n return True\\n else:\\n d[v] = i\\n # return False\\n return False\\n\\n\",\n \"runtime\": \"316\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n dicValueFoundsIndexed = {}\\n for i in range(len(nums)):\\n if nums[i] in dicValueFoundsIndexed:\\n if abs(dicValueFoundsIndexed.get(nums[i])-i) <=k:\\n return True\\n dicValueFoundsIndexed[nums[i]] = i\\n return False\\n\",\n \"runtime\": \"316\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n if k == 0:\\n return False\\n\\n numsMap = collections.defaultdict(int)\\n\\n for i in range(len(nums)):\\n if nums[i] in numsMap and abs(numsMap[nums[i]] - i) <= k:\\n return True\\n numsMap[nums[i]] = i\\n\\n return False\\n\\n\\n\",\n \"runtime\": \"322\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n # Create hset for storing previous of k elements...\\n hset = {}\\n # Traverse for all elements of the given array in a for loop...\\n for idx in range(len(nums)):\\n # If duplicate element is present at distance less than equal to k, return true...\\n if nums[idx] in hset and abs(idx - hset[nums[idx]]) <= k:\\n return True\\n hset[nums[idx]] = idx\\n # If no duplicate element is found then return false...\\n return False\",\n \"runtime\": \"322\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n indexes = {}\\n for i in range(len(nums)):\\n if nums[i] in indexes:\\n if i - indexes[nums[i]] <= k:\\n return True\\n indexes[nums[i]] = i\\n return False\",\n \"runtime\": \"328\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n seen = {}\\n\\n for i, num in enumerate(nums):\\n\\n if nums[i] in seen and i - seen[num] <= k:\\n return True\\n\\n seen[nums[i]] = i\\n\\n return False\\n\",\n \"runtime\": \"328\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n window = set()\\n for i in range(n):\\n if i > k:\\n window.remove(nums[i-k-1])\\n if nums[i] in window:\\n return True\\n window.add(nums[i])\\n return False\\n \",\n \"runtime\": \"334\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n indices = {}\\n for i in range(len(nums)):\\n if nums[i] in indices:\\n if abs(i - indices[nums[i]]) <= k:\\n return True\\n indices[nums[i]] = i\\n else:\\n indices[nums[i]] = i\\n\\n return False\",\n \"runtime\": \"334\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n # Dictionary to store the last index of each element\\n index_map = {}\\n \\n for i, num in enumerate(nums):\\n # If the number is already in the map and the difference between indices is <= k\\n if num in index_map and i - index_map[num] <= k:\\n return True\\n # Update the map with the current index of the number\\n index_map[num] = i\\n \\n return False\\n\\n\",\n \"runtime\": \"340\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n \\n \\n map = {}\\n \\n for i, num in enumerate(nums):\\n \\n if num in map:\\n if abs(i - map[num]) <= k:\\n return True\\n map[num] = i\\n \\n return False\",\n \"runtime\": \"340\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n new_arr = {}\\n for i in range(len(nums)):\\n if nums[i] not in new_arr:\\n new_arr[nums[i]] = i\\n else:\\n v = new_arr.get(nums[i], 0)\\n if abs(i-v)<=k:\\n return True\\n else:\\n if (abs(i-v))>k:\\n new_arr[nums[i]] = i\\n\\n return False\\n\\n\\n \",\n \"runtime\": \"346\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n lastindex = dict()\\n for i in range(len(nums)):\\n if nums[i] in lastindex:\\n if i - lastindex[nums[i]] <= k:\\n return True\\n lastindex[nums[i]] = i\\n return False\",\n \"runtime\": \"346\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n num_map = {}\\n for i, num in enumerate(nums):\\n if num not in num_map:\\n num_map[num] = i\\n else:\\n j = num_map[nums[i]]\\n if i - j <= k:\\n return True\\n else:\\n num_map[num] = i\\n\\n return False\\n\\n\\n\\n\",\n \"runtime\": \"352\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window = {}\\n for R in range(len(nums)):\\n if nums[R] in window:\\n if abs(window[nums[R]] - R) <= k:\\n return True\\n window[nums[R]] = R\\n\\n return False\\n \",\n \"runtime\": \"352\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n\\n from collections import Counter\\n\\n dict1 = dict(Counter(nums))\\n value_with_dupls = next((key for key in dict1 if dict1[key] > 1), None)\\n if value_with_dupls is None:\\n return False\\n\\n for i in range(len(nums)):\\n for j in range( i + 1, min(len(nums), i + k + 1) ):\\n if nums[i] == nums[j]:\\n return True\\n \\n return False\",\n \"runtime\": \"358\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = {}\\n l = len(nums)\\n for i in range(l):\\n if nums[i] not in d:\\n d[nums[i]]=i\\n else:\\n if abs(d[nums[i]]-i)<=k:\\n return True\\n else:\\n d[nums[i]]=i\\n return False\\n\\n\\n \",\n \"runtime\": \"358\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashmap = {} # Use a dictionary to store value and its latest index\\n for i in range(len(nums)):\\n if nums[i] in hashmap and abs(i - hashmap[nums[i]]) <= k:\\n return True\\n # Update the dictionary with the current index of nums[i]\\n hashmap[nums[i]] = i\\n return False\\n\",\n \"runtime\": \"364\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = {}\\n for i, x in enumerate(nums):\\n if x in d and i - d[x] <= k:\\n return True\\n d[x] = i\\n return False\",\n \"runtime\": \"364\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n index_map = {}\\n for i, num in enumerate(nums):\\n if num in index_map:\\n if i - index_map[num] <= k:\\n return True\\n index_map[num] = i\\n return False\",\n \"runtime\": \"370\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hm = {}\\n\\n for i in range(len(nums)):\\n if nums[i] not in hm:\\n hm[nums[i]] = i\\n continue\\n else:\\n if abs(i - hm[nums[i]])<=k:\\n return True\\n hm[nums[i]]=i\\n return False\",\n \"runtime\": \"370\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window = set()\\n L = 0\\n\\n for R in range(len(nums)):\\n if R - L > k:\\n window.remove(nums[L])\\n L += 1\\n if nums[R] in window:\\n return True\\n window.add(nums[R])\\n return False\\n \",\n \"runtime\": \"376\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n track={}\\n for i in range(len(nums)):\\n if nums[i] in track:\\n diff= max(track[nums[i]]-i,(track[nums[i]]-i)*-1)\\n if diff <= k:\\n return True\\n track[nums[i]]=i\\n return False\\n\\n \\n\\n \\n\\n\\n \",\n \"runtime\": \"376\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n index_map={}\\n for i,num in enumerate(nums):\\n if num in index_map:\\n if i - index_map[num] <=k:\\n return True\\n index_map[num]=i\\n return False\",\n \"runtime\": \"382\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashset = {}\\n for i in range(len(nums)):\\n if nums[i] in hashset and abs(i-hashset[nums[i]]) <= k:\\n return True\\n hashset[nums[i]] = i\\n return False\",\n \"runtime\": \"382\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n ni={}\\n for i,num in enumerate(nums):\\n if num in ni and i-ni[num]<=k:\\n return True\\n ni[num]=i\\n return False\",\n \"runtime\": \"394\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n hset = {}\\n for i in range(n):\\n if nums[i] in hset and abs(i - hset[nums[i]]) <= k:\\n return True\\n hset[nums[i]] = i\\n return False\\n \",\n \"runtime\": \"394\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n h = {}\\n for i in range(len(nums)):\\n if nums[i] in h:\\n if abs(h[nums[i]]-i) <= k:\\n return True\\n h[nums[i]] = i\\n return False\\n\\n\",\n \"runtime\": \"400\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n h = {}\\n for i in range(len(nums)):\\n if nums[i] in h:\\n if abs(h[nums[i]]-i) <= k:\\n return True\\n h[nums[i]] = i\\n return False\\n\\n\",\n \"runtime\": \"400\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n indices={}\\n for ind,key in enumerate(nums):\\n if(key in indices and ind-indices[key]<=k):\\n return True\\n indices[key]=ind\\n return False\\n\\n \",\n \"runtime\": \"406\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashmap = {}\\n for i in range(len(nums)):\\n if nums[i] in hashmap and abs(i - hashmap[nums[i]]) <= k:\\n return True\\n else:\\n hashmap[nums[i]] = i\\n return False\",\n \"runtime\": \"406\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n num_ind = {}\\n for i, num in enumerate(nums):\\n if num in num_ind and abs(i-num_ind[num])<=k:\\n return True\\n else:\\n pass\\n num_ind[num] = i\\n return False\\n \",\n \"runtime\": \"412\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window = set()\\n left = 0 \\n for R in range(len(nums)):\\n if abs(left - R) > k:\\n window.remove(nums[left])\\n left += 1\\n if nums[R] in window:\\n return True\\n\\n window.add(nums[R])\\n return False\",\n \"runtime\": \"412\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashmap = {}\\n for i in range(len(nums)):\\n if nums[i] in hashmap:\\n if abs(i - hashmap[nums[i]]) <= k:\\n return True\\n hashmap[nums[i]] = i\\n return False\",\n \"runtime\": \"418\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n d = {}\\n for i in range(n):\\n if nums[i] in d and abs(i-d[nums[i]]) <= k:\\n return True\\n else:\\n d[nums[i]] = i \\n return False \\n \",\n \"runtime\": \"418\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n seen = {}\\n for i in range(len(nums)):\\n if nums[i] in seen and abs(i - seen[nums[i]]) <= k: \\n return True\\n seen[nums[i]] = i\\n return False \\n\\n \",\n \"runtime\": \"423\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window = set()\\n left = 0\\n for right in range(len(nums)):\\n if right - left > k:\\n window.remove(nums[left])\\n left+=1\\n\\n if nums[right] in window:\\n return True\\n window.add(nums[right])\\n return False\\n \\n \\n\",\n \"runtime\": \"423\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashmap = set()\\n for i in range(len(nums)):\\n if nums[i] in hashmap:\\n return True\\n hashmap.add(nums[i])\\n if (len(hashmap) > k):\\n hashmap.remove(nums[i - k])\\n return False\\n \",\n \"runtime\": \"429\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window = set()\\n L = 0 \\n for R in range(len(nums)):\\n if R - L > k:\\n window.remove(nums[L])\\n L += 1\\n if nums[R] in window:\\n return True \\n window.add(nums[R])\\n return False\\n \",\n \"runtime\": \"429\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window = set()\\n L = 0\\n for R in range(len(nums)):\\n if R - L > k:\\n window.remove(nums[L])\\n L += 1\\n if nums[R] in window:\\n return True\\n window.add(nums[R])\\n return False\\n \\n \",\n \"runtime\": \"435\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window=set()\\n L=0\\n for R in range(len(nums)):\\n #if window size exceed remove left\\n if R-L>k:\\n window.remove(nums[L])\\n L+=1\\n\\n if nums[R] in window:\\n return True\\n #window size at max k+1\\n window.add(nums[R]) \\n \\n return False \",\n \"runtime\": \"435\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window = set()\\n left = 0\\n for right in range(len(nums)):\\n if right - left > k:\\n window.remove(nums[left])\\n left+=1\\n\\n if nums[right] in window:\\n return True\\n window.add(nums[right])\\n return False\\n \\n \",\n \"runtime\": \"441\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n dic={}\\n\\n for i,n in enumerate(nums):\\n if n in dic and abs(i-dic[n])<=k:\\n return True\\n else:\\n dic[n]=i\\n return False\\n \",\n \"runtime\": \"441\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashMap = {}\\n for i in range(len(nums)):\\n if nums[i] in hashMap and abs(hashMap[nums[i]] - i) <= k:\\n return True\\n hashMap[nums[i]] = i\\n return False\",\n \"runtime\": \"447\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: list[int], k: int) -> bool:\\n seen = set()\\n\\n for i, num in enumerate(nums):\\n if i > k:\\n seen.remove(nums[i - k - 1])\\n if num in seen:\\n return True\\n seen.add(num)\\n\\n return False\",\n \"runtime\": \"447\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n l =0\\n r =0\\n window = set()\\n while r<len(nums):\\n if r-l>k:\\n window.remove(nums[l])\\n l+=1\\n if nums[r] in window:\\n return True\\n window.add(nums[r])\\n r+=1\\n return False\\n\",\n \"runtime\": \"453\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n dict_ = {}\\n for j,n in enumerate(nums):\\n if n in dict_ and abs(j - dict_[n])<=k:\\n return True\\n dict_[n] = j\\n\\n return False\",\n \"runtime\": \"453\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hash_map = {} # {num: index}\\n\\n for i in range(len(nums)):\\n if nums[i] in hash_map:\\n if abs(hash_map[nums[i]] - i) <= k:\\n return True\\n else:\\n hash_map[nums[i]] = i\\n else:\\n hash_map[nums[i]] = i\\n \\n return False\",\n \"runtime\": \"459\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashset = set()\\n L = 0\\n\\n for R in range(len(nums)):\\n if R - L > k:\\n hashset.remove(nums[L])\\n L += 1\\n if nums[R] in hashset:\\n return True\\n hashset.add(nums[R])\\n return False\",\n \"runtime\": \"459\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n f={}\\n for i in range(len(nums)):\\n if(nums[i] not in f):\\n f[nums[i]]=i\\n else:\\n if(abs(f[nums[i]]-i)<=k):\\n return True \\n f[nums[i]]=i\\n else:\\n return False\",\n \"runtime\": \"465\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums, k):\\n visit = {}\\n for i in range(len(nums)):\\n if nums[i] in visit and abs(i-visit[nums[i]]) <= k:\\n return True\\n visit[nums[i]] = i\\n return False\",\n \"runtime\": \"465\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window=set()\\n l=0\\n for r in range(len(nums)):\\n \\n if r-l>k:\\n window.remove(nums[l])\\n l+=1 \\n if nums[r] in window:\\n return True\\n window.add(nums[r])\\n return False\\n\\n \\n\\n \\n \\n '''\\n track={}\\n for i in range(len(nums)):\\n if nums[i] in track:\\n diff= max(track[nums[i]]-i,(track[nums[i]]-i)*-1)\\n if diff <= k:\\n return True\\n track[nums[i]]=i\\n return False \\n #my attempt\\n '''\\n\\n \\n\\n\\n \",\n \"runtime\": \"471\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window=set()\\n l=0\\n for r in range(len(nums)):\\n \\n if r-l>k:\\n window.remove(nums[l])\\n l+=1 \\n if nums[r] in window:\\n return True\\n window.add(nums[r])\\n return False\\n\\n \\n\\n \\n \\n '''\\n track={}\\n for i in range(len(nums)):\\n if nums[i] in track:\\n diff= max(track[nums[i]]-i,(track[nums[i]]-i)*-1)\\n if diff <= k:\\n return True\\n track[nums[i]]=i\\n return False \\n #my attempt\\n '''\\n\\n \\n\\n\\n \",\n \"runtime\": \"471\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n current_set = set()\\n for i in range(0, min(len(nums), k + 1)):\\n if nums[i] in current_set:\\n return True\\n current_set.add(nums[i])\\n for r in range(k + 1, len(nums)):\\n current_set.remove(nums[r-k-1])\\n if nums[r] in current_set:\\n return True\\n current_set.add(nums[r])\\n return False\",\n \"runtime\": \"477\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n seen = {}\\n for ind,val in enumerate(nums):\\n if val not in seen:\\n seen[val] = []\\n \\n else:\\n for i in seen[val]:\\n if ind-i <=k:\\n return True\\n seen[val].append(ind)\\n return False\",\n \"runtime\": \"477\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n h = {}\\n for i in range(len(nums)):\\n if nums[i] in h:\\n if abs(h[nums[i]]-i) <= k:\\n return True\\n h[nums[i]] = i\\n return False\\n\\n\",\n \"runtime\": \"483\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n\\n l = 0\\n r = 0\\n seen = set()\\n while r < len(nums):\\n if nums[r] in seen:\\n return True\\n\\n seen.add(nums[r])\\n\\n if r - l + 1 > k:\\n seen.remove(nums[l])\\n l += 1\\n r += 1\\n\\n return False\\n\",\n \"runtime\": \"483\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashmap = set()\\n for i in range(len(nums)):\\n if nums[i] in hashmap:\\n return True\\n hashmap.add(nums[i])\\n if (len(hashmap) > k):\\n hashmap.remove(nums[i - k])\\n return False\\n \",\n \"runtime\": \"489\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n L, R = 0, 0\\n vals = {}\\n while R < len(nums):\\n dist = R - L\\n if dist > k:\\n vals[nums[L]] -= 1 \\n L += 1\\n continue\\n if nums[R] in vals and vals[nums[R]] >= 1:\\n return True\\n vals[nums[R]] = 1\\n R += 1\\n return False\",\n \"runtime\": \"489\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: list[int], k: int) -> bool:\\n seen = set()\\n\\n for i, num in enumerate(nums):\\n if i > k:\\n seen.remove(nums[i - k - 1])\\n if num in seen:\\n return True\\n seen.add(num)\\n\\n return False\",\n \"runtime\": \"495\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n l = 0\\n contained = set()\\n for r in range(len(nums)):\\n if r - l > k:\\n contained.remove(nums[l])\\n l += 1\\n if nums[r] in contained:\\n return True\\n contained.add(nums[r])\\n return False\",\n \"runtime\": \"495\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n track={}\\n for i in range(len(nums)):\\n if nums[i] in track:\\n diff= max(track[nums[i]]-i,(track[nums[i]]-i)*-1)\\n if diff <= k:\\n return True\\n track[nums[i]]=i\\n return False\\n\\n \\n\\n \\n\\n\\n \",\n \"runtime\": \"501\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n # i = 0\\n # length = len(nums)\\n # while arr := nums[i:i+k+1]:\\n \\n # if len(set(arr)) != len(arr):\\n # return True\\n # i += 1\\n # return False\\n d = defaultdict(int)\\n lagging = 0\\n for i in range(len(nums)):\\n if d[nums[i]] > 0:\\n return True\\n else:\\n d[nums[i]] += 1\\n if i > k - 1:\\n d[nums[lagging]] = 0\\n lagging += 1\\n return False\\n \\n \",\n \"runtime\": \"501\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n l=len(nums)\\n d={}\\n for i in range(l):\\n if nums[i] not in d:\\n d[nums[i]]=[]\\n d[nums[i]].append(i)\\n for i in d.keys():\\n le=len(d[i])\\n if le>=2:\\n for j in range(le-1):\\n if abs(d[i][j]-d[i][j+1])<=k:\\n return True\\n\\n return False\\n\\n\\n\\n\\n\\n\\n \\n\\n \",\n \"runtime\": \"507\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n count_ = {}\\n for num in nums:\\n try:\\n count_[num] += 1\\n except:\\n count_[num] = 1\\n for i in range(len(nums)):\\n if count_[nums[i]] > 1 and nums[i] in nums[i + 1 : i + k + 1]:\\n return True\\n return False\",\n \"runtime\": \"507\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n if k == 0: return False\\n mp = defaultdict(list)\\n for i, num in enumerate(nums):\\n mp[num].append(i)\\n for num in mp:\\n if len(mp[num]) > 1:\\n curr = sorted(mp[num])\\n for i in range(1, len(curr)):\\n if abs(curr[i] - curr[i-1]) <= k:\\n return True\\n return False\",\n \"runtime\": \"513\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n h_map = defaultdict(list)\\n for i in range(len(nums)):\\n if nums[i] in h_map:\\n if i - h_map[nums[i]][0] <= k:\\n return True\\n else:\\n h_map[nums[i]][0] = i\\n else:\\n h_map[nums[i]].append(i)\\n return False \",\n \"runtime\": \"513\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n inter={}\\n i=0\\n for x in nums:\\n if x not in inter:\\n inter[x]=[i]\\n else:\\n inter[x].append(i)\\n i+=1\\n \\n j=0\\n for x in nums:\\n for y in inter[x]:\\n if y!=j and abs(y-j)<=k:\\n return True\\n j+=1 \\n return False \\n \",\n \"runtime\": \"519\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hmap = defaultdict(list)\\n for i, num in enumerate(nums):\\n hmap[num].append(i)\\n if len(hmap[num]) > 1 and hmap[num][-1] - hmap[num][-2] <= k:\\n return True\\n\\n return False\\n\\n \",\n \"runtime\": \"519\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = {}\\n for i in range(len(nums)):\\n key, val = nums[i], i\\n if key not in d:\\n d[key] = [i]\\n else:\\n d[key].append(i)\\n \\n for key, val in d.items():\\n for i in range(len(val)-1): \\n for j in range(i+1, len(val)): \\n if abs(val[i] - val[j]) <= k:\\n return True\\n return False\\n\\n \",\n \"runtime\": \"525\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\n\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n indexes = dict()\\n for i in range(len(nums)):\\n n = nums[i]\\n if n not in indexes:\\n indexes[n] = []\\n indexes[n].append(i)\\n\\n for idxs in indexes.values():\\n for i in range(len(idxs) - 1):\\n if abs(idxs[i] - idxs[i + 1]) <= k:\\n return True\\n return False\\n\",\n \"runtime\": \"525\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n k+=1\\n c = Counter(nums[:k])\\n if [i for i in c.values() if i>1]:\\n return True\\n \\n p = k\\n\\n while p < len(nums): \\n c[nums[p-k]] -= 1\\n if c[nums[p]] > 0:\\n return True\\n c[nums[p]] += 1\\n p+=1\\n\\n return False\",\n \"runtime\": \"531\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n numMap = {}\\n\\n for i in range(len(nums)):\\n if nums[i] in numMap:\\n numMap[nums[i]] += [i]\\n else:\\n numMap[nums[i]] = [i]\\n\\n for key, values in numMap.items():\\n if len(values) > 1:\\n i , j = 0 , 1\\n while j < len(values) and i < j:\\n if abs(values[i] - values[j]) <= k:\\n return True\\n elif abs(values[i] - values[j]) > k:\\n i += 1\\n j += 1\\n\\n return False\",\n \"runtime\": \"531\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n dd = defaultdict(list)\\n\\n for i, v in enumerate(nums):\\n dd[v].append(i)\\n\\n for i, v in enumerate(nums):\\n for j in dd[v]:\\n if i != j and abs(i-j) <= k:\\n return True\\n \\n return False\",\n \"runtime\": \"537\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n dd = defaultdict(list)\\n\\n for i, v in enumerate(nums):\\n dd[v].append(i)\\n\\n for i, v in enumerate(nums):\\n for j in dd[v]:\\n if i != j and abs(i-j) <= k:\\n return True\\n \\n return False\",\n \"runtime\": \"537\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":135,"string":"135"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n arr = []\n\n for idx, num in enumerate(nums):\n if num in arr: return True\n arr.append(num)\n if len(arr) > k: arr.pop(0)\n\n return False\n \n\n\n\n ","memory":"24763"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n start = 0\n objOfInd=nums[start:start+k+1]\n if len(objOfInd) != len(set(objOfInd)):\n return True\n while start+k < len(nums)-1:\n objOfInd.pop(0)\n if nums[start+k+1] in objOfInd:\n return True\n objOfInd.append(nums[start+k+1])\n start+=1\n return False","memory":"24763"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n seen = {}\n # Iterate in reverse\n for i in range(len(nums) - 1, -1, -1):\n # Update window size if needed\n if (len(nums) - 1 - i > k):\n numToRemove = nums.pop()\n seen.pop(numToRemove)\n\n # Check if we've seen the number before\n if nums[i] not in seen:\n seen[nums[i]] = 1 # Value doesn't matter\n else:\n return True\n\n ","memory":"24891"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n seen = {}\n # Iterate in reverse\n for i in range(len(nums) - 1, -1, -1):\n # Update window size if needed\n if (len(nums) - 1 - i > k):\n numToRemove = nums.pop()\n seen.pop(numToRemove)\n\n # Check if we've seen the number before\n if nums[i] not in seen:\n seen[nums[i]] = 1 # Value doesn't matter\n else:\n return True\n return False\n\n ","memory":"25018"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n for i in range(len(nums)):\n value = nums[i]\n minimum = min(len(nums), i+k+1)\n if value in nums[i+1: minimum]:\n index = nums.index(value)\n if abs(i - index) <= k:\n return True\n else:\n nums[i] = '*'\n return False\n ","memory":"25146"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window = set()\n left,right = 0,0\n while right<len(nums):\n if nums[right] in window:\n return True\n window.add(nums[right])\n right+=1\n if right-left > k:\n window.remove(nums[left])\n left+=1\n return False","memory":"25273"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n if k == 0 :\n return False\n if len(nums) in [2,3,4] and k!= 1:\n if len(set(nums)) in [1,2,3] and len(set(nums)) < len(nums):\n return True\n for i in range(0,len(nums)-k):\n x = nums[i]\n if x in nums[i+1:i+k+1]:\n return True\n nums.reverse()\n for i in range(0,len(nums)-k):\n x = nums[i]\n if x in nums[i+1:i+k+1]:\n return True\n return False","memory":"25401"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n if k == 0: return False\n for i, num in enumerate(nums):\n if num in nums[i+1:i+k+1]:\n return True\n\n return False\n\n ","memory":"25528"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n \n for i in range(len(nums)):\n \n if nums[i] in nums[i+1:i+k+1]:\n \n return True","memory":"25656"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: list[int], k: int) -> bool:\n for ind in range(len(nums)):\n a = nums[ind]\n if a in nums[ind+1:ind+k+1]: return True\n return False","memory":"25783"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window = []\n for i, num in enumerate(nums):\n if num in window:\n return True\n window.append(num)\n if len(window) > k:\n window.pop(0)\n return False\n","memory":"26166"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: \n res=0 \n for i in range(len(nums)):\n if nums[i] in nums[i+1:i+k+1]: \n return True \n return False\n\n\n \n ","memory":"26293"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n\n # Solution 1 - \n # Time - \n # Space - \n\n seen = set()\n\n for i in range(len(nums)):\n if nums[i] in seen:\n return True\n seen.add(nums[i])\n\n if len(seen) > k:\n seen.remove(nums[i - k])\n\n return False\n","memory":"26421"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n seen = set()\n\n for i in range(len(nums)):\n # If we've already seen this number in the window of last k elements\n if nums[i] in seen:\n return True\n\n # Add the current number to the set\n seen.add(nums[i])\n\n # If the size of the set exceeds k, remove the oldest element (i-k)\n if len(seen) > k:\n seen.remove(nums[i - k])\n\n return False","memory":"26548"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window_helper = set()\n\n window_start, window_end = 0,0\n\n while window_end < len(nums):\n if window_end - window_start > k:\n print(f\"Removing\")\n window_helper.remove(nums[window_start])\n window_start += 1\n if nums[window_end] in window_helper:\n return True\n window_helper.add(nums[window_end])\n window_end +=1\n \n return False","memory":"26676"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: \n if k == 0:\n return False\n if len(nums) == 0:\n return False\n if len(nums) == 1:\n return False\n curr_string = []\n for index in range(0, len(nums)):\n if nums[index] not in curr_string:\n curr_string.append(nums[index])\n else:\n return True\n if len(curr_string) > k:\n curr_string.remove(nums[index - k])\n return False\n \n\n ","memory":"26803"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n l=0\n window = []\n for r in range(len(nums)):\n if r-l > k:\n window.remove(nums[l])\n l=l+1\n if nums[r] in window:\n return True\n else:\n window.append(nums[r])\n return False\n","memory":"26931"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n for i in range(len(nums)):\n if nums[i] in nums[i+1 : (i+k+1 if i+k+1 < len(nums) else len(nums))]:\n return True\n return False","memory":"27058"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n if k == 0:\n return False\n a = []\n for i in range(len(nums)-k):\n a = nums[i+1:k+1+i]\n\n if nums[i] in a:\n return True\n \n if len(a) == 0:\n a = nums\n b = []\n for r in range(len(a)-1):\n b = a[r+1:]\n # print(b)\n if a[r] in b:\n return True\n\n return False\n","memory":"27058"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n i = 0\n for i in range(len(nums)):\n if nums[i] in nums[i+1:i+k+1]:\n return True\n\n return False","memory":"27186"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: \n if k == 0:\n return False\n if len(nums) == 0:\n return False\n if len(nums) == 1:\n return False\n curr_string = []\n for index in range(0, len(nums)):\n curr_string = curr_string[-k:]\n if nums[index] not in curr_string:\n curr_string.append(nums[index])\n else:\n return True\n return False\n \n\n ","memory":"27313"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n for i in range(len(nums)):\n if nums[i] in nums[i+1:i+k+1]:\n return True\n return False\n \n \n","memory":"27313"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n for i in range(len(nums)):\n if nums[i] in nums[i+1:i + k + 1]:\n return True\n return False","memory":"27441"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n for i in range(len(nums)):\n if nums[i] in nums[i+1:i+k+1]:\n return True\n return False","memory":"27441"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window=set()\n L=0\n for R in range(len(nums)):\n #if window size exceed remove left\n if R-L>k:\n window.remove(nums[L])\n L+=1\n\n if nums[R] in window:\n return True\n #window size at max k+1\n window.add(nums[R]) \n \n return False ","memory":"27568"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window=set()\n l=0\n\n for r in range(len(nums)):\n if r-l>k:\n window.remove(nums[l])\n l+=1\n if nums[r] in window:\n return True\n\n window.add(nums[r])\n\n return False\n\n ","memory":"27696"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n window = set()\n l = 0\n for r in range(len(nums)):\n if r - l > k:\n window.remove(nums[l])\n l += 1\n if nums[r] in window:\n return True\n window.add(nums[r])\n return False\n\n\n\n\n ","memory":"27696"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n window = set()\n for i in range(n):\n if i > k:\n window.remove(nums[i-k-1])\n if nums[i] in window:\n return True\n window.add(nums[i])\n return False\n ","memory":"27823"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashmap = set()\n for i in range(len(nums)):\n if nums[i] in hashmap:\n return True\n hashmap.add(nums[i])\n if (len(hashmap) > k):\n hashmap.remove(nums[i - k])\n return False\n ","memory":"27823"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n\n window = set()\n left_index = 0\n\n for right_index in range(len(nums)):\n if right_index - left_index > k:\n window.remove(nums[left_index])\n left_index += 1\n if nums[right_index] in window:\n return True\n window.add(nums[right_index])\n \n return False\n ","memory":"27951"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n \n window=set()\n l=0\n for r in range(len(nums)):\n \n if r-l>k:\n window.remove(nums[l])\n l+=1 \n if nums[r] in window:\n return True\n window.add(nums[r])\n return False\n\n \n\n \n \n '''\n track={}\n for i in range(len(nums)):\n if nums[i] in track:\n diff= max(track[nums[i]]-i,(track[nums[i]]-i)*-1)\n if diff <= k:\n return True\n track[nums[i]]=i\n return False \n #my attempt\n '''\n\n \n\n\n ","memory":"27951"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n map = {}\n for i, num in enumerate(nums):\n if num in map and i - map[num] <= k:\n return True \n map[num] = i\n return False\n","memory":"28078"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashmap = dict()\n \n for i in range(len(nums)):\n if i > k and hashmap[nums[i-k - 1]] == i - k - 1:\n del hashmap[nums[i-k - 1]]\n if nums[i] not in hashmap:\n hashmap[nums[i]] = i\n elif i - hashmap[nums[i]] <= k:\n return True\n else:\n hashmap[nums[i]] = i\n return False \n\n \n","memory":"28206"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n\n if len(nums) == 1 or len(nums) == 0:\n return False\n \n if k >= len(nums):\n counter = {num:0 for num in nums}\n\n for num in nums:\n counter[num] += 1\n \n if max(counter.values())>1:\n return True\n \n return False\n\n used_numbers = {}\n\n for i in range(k+1):\n if nums[i] not in used_numbers:\n used_numbers[nums[i]] = 0\n \n used_numbers[nums[i]] += 1\n \n if len(used_numbers) < k+1:\n return True\n \n for i in range(k+1,len(nums)):\n used_numbers[nums[i-k-1]] -= 1\n\n if used_numbers[nums[i-k-1]] == 0:\n del used_numbers[nums[i-k-1]]\n \n if nums[i] not in used_numbers:\n used_numbers[nums[i]] = 0\n\n used_numbers[nums[i]] += 1\n\n if len(used_numbers) < k+1:\n return True\n \n return False\n \n \n\n ","memory":"28333"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n index_dict = {}\n\n for i, n in enumerate(nums):\n if (n in index_dict) and (i - index_dict[n] <= k):\n return True\n\n index_dict[n] = i\n return False","memory":"28461"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n\n # approach-1: brute force\n # for i in range(n-1):\n # for j in range(i+1, n):\n # if abs(i-j) <= k and nums[i] == nums[j]:\n # return True\n\n # return False\n\n # approach-2: sliding window\n elements = set()\n # preapre the intial set\n s = min(k+1, n)\n for i in range(s):\n if nums[i] in elements:\n return True\n elements.add(nums[i])\n print(elements)\n # set the lower and upper bound\n l = 0 \n u = k\n while u < len(nums)-1:\n print(l, u)\n elements.remove(nums[l])\n l += 1\n\n u += 1\n if nums[u] in elements:\n return True\n elements.add(nums[u])\n \n return False","memory":"28461"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n seen = {}\n for i, num in enumerate(nums):\n if num in seen and abs(i - seen[num]) <= k:\n return 'true'\n seen[num] = i\n return 'false'\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(Solution().containsNearbyDuplicate(nums, next(inputs)),file=f)\nexit(0)","memory":"28588"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n duplicate_map = {}\n for index, value in enumerate(nums):\n if value in duplicate_map:\n if abs(duplicate_map[value] - index) <= k:\n return True\n duplicate_map[value] = index\n duplicate_map[value] = index\n return False\n\n ","memory":"28716"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n if len(set(nums)) < len(nums):\n for i in range(len(nums)-k+2):\n sub = nums[i:i+k+1]\n # print(sub)\n if len(set(sub)) < len(sub):\n return True\n return False\n else: return False","memory":"28843"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n indices = range(len(nums))\n if len(set(nums)) == len(nums):\n return False\n for i in indices[0:-1]:\n temp1=nums[i]\n #print('temp1 '+str(temp1))\n for j in indices[i+1:i+k+1]:\n temp2=nums[j]\n #print('tempt2 '+str(temp2))\n if temp1 == temp2 and abs(i-j) <= k:\n return True\n return False\n\n ","memory":"28843"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n if len(set(nums)) == len(nums):\n return False\n\n for i in range(len(nums)):\n if i+1+k > len(nums):\n m_range = len(nums)\n else:\n m_range =i+1+k\n for j in range(i+1,m_range):\n\n if nums[i] == nums[j]:\n return True\n\n return False","memory":"28971"},{"code":"from collections import defaultdict\n\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashmap = defaultdict(list)\n # diff = 0\n ans = False\n \n\n if len(set(nums)) == len(nums):\n return False \n else:\n for i, num in enumerate(nums):\n hashmap[num].append(i)\n print(hashmap.items())\n for key, value in hashmap.items():\n if len(value) > 1:\n for i in range(0, len(value)-1):\n print(f\"va;ue i {value[i]}\")\n diff = abs(value[i] - value[i+1])\n print(diff)\n if diff <= k:\n return True\n # else:\n # ans = False\n \n \n\n","memory":"29098"},{"code":"from collections import defaultdict\n\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashmap = defaultdict(list)\n # diff = 0\n ans = False\n \n\n if len(set(nums)) == len(nums):\n return False \n else:\n for i, num in enumerate(nums):\n hashmap[num].append(i)\n print(hashmap.items())\n for key, value in hashmap.items():\n if len(value) > 1:\n for i in range(0, len(value)-1):\n print(f\"va;ue i {value[i]}\")\n diff = abs(value[i] - value[i+1])\n print(diff)\n if diff <= k:\n return True\n # else:\n # ans = False\n return False \n \n\n","memory":"29098"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashmap = {}\n for i, digit in enumerate(nums):\n if digit not in hashmap:\n hashmap[digit] = i\n else:\n if abs(hashmap[digit] - i) <= k:\n return True\n else:\n hashmap[digit] = i\n \n return False\n","memory":"29226"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = {}\n for i,v in enumerate(nums):\n if v not in d:\n d[v] = i\n else:\n if abs(d[v]-i)<=k:\n return True\n else:\n d[v] = i\n # return False\n return False\n\n","memory":"29353"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n i = 0\n \n if len(nums) == 1:\n return False\n hashmap = {}\n \n while i < len(nums):\n if nums[i] in hashmap:\n if i - hashmap[nums[i]] <= k:\n return True\n else:\n hashmap[nums[i]] = i\n else:\n hashmap[nums[i]] = i\n i += 1\n \n return False\n\n \n ","memory":"29353"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n\n # 1. Inputs and outputs:\n # Inputs:\n # nums -> list of integers to check for duplicates\n # k -> conditional int for checking abs value of i-j\n # Outputs:\n # res -> boolean true if there exists and answer\n\n # 2. Edge cases, boundaries and other tests:\n # Check if the list if empty\n # Check if the list has 1 entry\n # Check if the list has 2 entries\n # Check if the list has all the same number\n # Check if k is valid\n # Check some random test cases with varying patterns\n # Add some test cases using chatgpt\n\n # 3: Algorithm:\n # 2 ways come to mind:\n\n # Way 1:\n # Initialize a dictionary to keep track of numbers with their indices\n # If the number isnt in, create a new value with its index\n # If its there, compare to see if the index is valid\n # If yes, return true\n # Else, continue\n\n # Way 2:\n # Sort the list with indices\n # Use two pointers to run through all tuples\n # Check validity, and update pointers\n\n # 4. Code: (way 1)\n\n n = len(nums)\n\n if n == 1 or 0: return False\n\n d = {}\n\n for i in range(n):\n if nums[i] not in d:\n d[nums[i]] = i\n\n else:\n if abs(i - d[nums[i]]) <= k: return True\n d[nums[i]] = i\n return False\n","memory":"29481"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n start = 0\n entries = 0\n m = {}\n for i in range(len(nums)):\n if nums[i] in m:\n m[nums[i]] += 1\n else:\n m[nums[i]] = 1\n entries += 1\n\n if entries > k + 1:\n m[nums[start]] -= 1\n start += 1 \n\n if m[nums[i]] >= 2:\n return True\n return False\n\n\n ","memory":"29481"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hashmap = {}\n for i in range(len(nums)):\n if nums[i] in hashmap:\n if abs(i - hashmap[nums[i]]) <= k:\n return True\n hashmap[nums[i]] = i\n return False","memory":"29608"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = dict()\n for i in range(len(nums)):\n if nums[i] in d and abs(i - d[nums[i]]) <= k:\n return True\n d[nums[i]] = i\n return False","memory":"29608"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n num_to_indice = dict()\n for i in range(0, len(nums)):\n num = nums[i]\n if num not in num_to_indice:\n num_to_indice[num] = i\n else:\n distance = abs(i-num_to_indice[num])\n if distance <= k:\n return True\n num_to_indice[num] = i\n return False","memory":"29736"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n dic = {}\n for n in range(len(nums)):\n if(nums[n] in dic and n - dic[nums[n]] <=k):\n return True \n dic[nums[n]] = n \n return False \n ","memory":"29736"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = {}\n\n for i, n in enumerate(nums):\n if n in d and abs(i - d[n]) <= k:\n return True\n else:\n d[n] = i\n \n return False\n","memory":"29863"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n seen = {}\n for ind,val in enumerate(nums):\n if val in seen:\n if ind - seen[val] <=k:\n return True\n seen[val] = ind\n return False","memory":"29863"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n \n if (len(nums) == len(set(nums))): return False\n \n hashmap = dict()\n for i in range(len(nums)):\n if nums[i] in hashmap.keys() and i - hashmap[nums[i]] <= k:\n return True\n hashmap[nums[i]] = i\n return False","memory":"29991"},{"code":"import math\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n dic = {}\n\n for i, n in enumerate(nums):\n if n not in dic:\n dic[n] = i\n else:\n if abs(i - dic[n]) <= k:\n return True\n else:\n dic[n] = i\n\n return False\n ","memory":"29991"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n seen = {}\n for i in range(len(nums)):\n if nums[i] in seen:\n j = seen[nums[i]]\n if abs(i -j) <= k:\n return True\n seen[nums[i]] = i\n return False\n","memory":"30118"},{"code":"from queue import Queue\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n num_map = {}\n for i in range(len(nums)):\n if nums[i] not in num_map:\n num_map[nums[i]] = i\n else:\n if i - num_map[nums[i]] <= k:\n return True\n num_map[nums[i]] = i\n return False","memory":"30246"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n if len(nums) == len(set(nums)):\n return False\n\n m = dict()\n\n for i in range(len(nums)):\n if nums[i] in m:\n if abs(m[nums[i]] - i) <= k:\n return True\n\n m[nums[i]] = i\n\n return False","memory":"30373"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n if len(nums) == len(set(nums)):\n return False\n\n m = dict()\n\n for i in range(len(nums)):\n if nums[i] in m:\n if abs(m[nums[i]] - i) <= k:\n return True\n\n m[nums[i]] = i\n\n return False","memory":"30373"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n if len(nums) == len(set(nums)):\n return False\n\n m = dict()\n\n for i in range(len(nums)):\n if nums[i] in m:\n if abs(m[nums[i]] - i) <= k:\n return True\n\n m[nums[i]] = i\n\n return False","memory":"30501"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n if len(nums) == len(set(nums)):\n return False\n\n m = dict()\n\n for i in range(len(nums)):\n if nums[i] in m:\n if abs(m[nums[i]] - i) <= k:\n return True\n\n m[nums[i]] = i\n\n return False","memory":"30501"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n count = Counter(nums)\n\n for key, value in count.most_common():\n print(key, value)\n if value < 2:\n return False\n indexes = [i for i, item in enumerate(nums) if item == key]\n diffs = [indexes[i] - indexes[i-1] for i in range(1,len(indexes))]\n gaps = [diff for diff in diffs if diff <= k]\n if len(gaps):\n return True\n return False","memory":"30628"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n #go thru list, add to hash map\n #key is the number, value is the indices\n if set(nums) == nums:\n return False\n thing = {}\n for i in range(len(nums)):\n if nums[i] in thing:\n if abs(thing[nums[i]]-i) <= k:\n return True\n thing.update({nums[i]:i})\n print(thing)\n return False","memory":"30756"},{"code":"from collections import defaultdict\n\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hash = defaultdict(int)\n for i in nums[:k + 1]:\n hash[i] += 1\n if hash[i] >= 2:\n return True\n\n r = 0\n for l in nums[k + 1: len(nums)]:\n hash[l] += 1\n hash[nums[r]] -= 1\n r += 1\n if hash[l] >= 2:\n return True\n return False\n","memory":"30883"},{"code":"from collections import defaultdict\n\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n hash = defaultdict(int)\n for i in nums[:k + 1]:\n hash[i] += 1\n if hash[i] >= 2:\n return True\n\n r = 0\n for l in nums[k + 1: len(nums)]:\n hash[l] += 1\n hash[nums[r]] -= 1\n r += 1\n if hash[l] >= 2:\n return True\n return False\n","memory":"30883"},{"code":"from collections import defaultdict\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n duplicate = defaultdict(bool)\n index_list = defaultdict(int)\n for index,i in enumerate(nums):\n if duplicate[i]:\n if index - index_list[i] <= k:\n return True\n else:\n index_list[i] = index\n else:\n duplicate[i] = True\n index_list[i] = index \n return False","memory":"31011"},{"code":"'''\nNotes:\n- it is not sorted\n- the distance of index needs to be below k\n- naive way: for each integer, try to move k to find it. O((n-k)*k)\n- sort with index, then find the pair that has different less than k or move on: time: O(nlogn), but cost space O(n)\n\nApproach: go with the sort solution\n'''\nclass Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n if len(nums) == 1:\n return False\n\n val_index_list = []\n\n for index, val in enumerate(nums):\n val_index_list.append((val, index))\n \n val_index_list.sort()\n\n prev_val = val_index_list[0][0]\n prev_index = val_index_list[0][1]\n for i in range(1, len(val_index_list)):\n if val_index_list[i][0] == prev_val:\n if val_index_list[i][1] - prev_index <= k:\n return True\n prev_val = val_index_list[i][0]\n prev_index = val_index_list[i][1]\n return False","memory":"31138"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n frequency_dict = {}\n\n if len(nums) <= 1:\n return False\n if len(set(nums)) == len(nums):\n return False\n if k == 0:\n return False\n\n\n for i, num in enumerate(nums):\n if num not in frequency_dict.keys():\n frequency_dict[num] = []\n frequency_dict[num].append(i)\n else:\n frequency_dict[num].append(i)\n\n # # multiple_indices = [k,v for k,v in frequency_dict.items() if len(v) >= 2]\n multiple_indices = [k for k,v in frequency_dict.items() if len(v) >1 ]\n for key in multiple_indices:\n value = frequency_dict[key]\n for i in range(1,len(value)):\n \n if i == 1:\n leap_size = value[i] - value[i-1]\n min_leap = leap_size\n print(min_leap)\n elif i > 1: \n leap_size = value[i] - value[i-1]\n if leap_size < min_leap:\n min_leap = leap_size\n print(min_leap)\n if abs(min_leap) <= k:\n return True\n else:\n return False\n\n","memory":"31138"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n nums = sorted([(num, i) for i, num in enumerate(nums)])\n n = len(nums)\n\n for ind in range(n - 1):\n num1, i = nums[ind]\n num2, j = nums[ind + 1]\n\n if num1 == num2 and abs(i - j) <= k:\n return True\n\n \n return False\n ","memory":"31266"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n \n j=0\n hash1=defaultdict(set)\n n=len(nums)\n for i in range(n):\n if i-j>k:\n hash1[nums[j]].remove(j)\n if not hash1[nums[j]]:\n del hash1[nums[j]]\n j+=1\n if nums[i] in hash1:\n return True\n hash1[nums[i]].add(i)\n return False\n","memory":"31648"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n checker = {}\n for i in range(len(nums)):\n if str(nums[i]) in checker:\n if abs(i - checker[str(nums[i])]) <= k:\n return True\n \n checker[str(nums[i])] = i\n\n return False","memory":"31776"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n checker = {}\n for i, num in enumerate(nums):\n if str(num) in checker:\n if abs(i - checker[str(num)]) <= k:\n return True\n \n checker[str(num)] = i\n\n return False","memory":"31903"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n l = len(nums)\n nums_inds = [(num, i) for i, num in enumerate(nums)]\n nums_inds.sort(key = lambda x: x[0])\n for i in range(l-1):\n if nums_inds[i][0] == nums_inds[i+1][0] and abs(nums_inds[i+1][1] - nums_inds[i][1]) <= k: return True\n return False","memory":"32031"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n l = len(nums)\n nums_inds = [(num, i) for i, num in enumerate(nums)]\n nums_inds.sort(key = lambda x: x[0])\n for i in range(l-1):\n if nums_inds[i][0] == nums_inds[i+1][0] and abs(nums_inds[i+1][1] - nums_inds[i][1]) <= k: return True\n return False","memory":"32031"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n nums_with_pos = []\n for i in range(len(nums)):\n nums_with_pos.append((nums[i], i))\n nums_with_pos.sort(key=lambda x: x[0])\n for i in range(len(nums) - 1):\n num1, pos1 = nums_with_pos[i]\n num2, pos2 = nums_with_pos[i + 1]\n if num1 == num2 and pos2 - pos1 <= k:\n return True\n return False","memory":"32158"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n l=[]\n for i in range(len(nums)):\n l.append((nums[i],i))\n l.sort(key=lambda x: x[0])\n for i in range(len(l)-1):\n if l[i][0]==l[i+1][0] and abs(l[i][1]-l[i+1][1])<=k:\n return True\n return False","memory":"32286"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n numbers = []\n for i in range(len(nums)):\n numbers.append([nums[i], i])\n numbers.sort()\n for i in range(len(numbers)-1):\n if numbers[i][0] == numbers[i+1][0]:\n if abs(numbers[i][1] - numbers[i+1][1]) <= k:\n return True\n \n return False","memory":"32413"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n numbers = {}\n for i in range(len(nums)):\n current = nums[i]\n if current in numbers:\n for index in numbers[current]:\n if abs(index - i) <= k:\n print(f\"True, {index} - {i} is good\")\n return True\n numbers[current] = tuple(list(numbers.get(current, ())) + [i])\n return False\n","memory":"32541"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n\n ks = k+1\n\n dic = {qte : 0 for qte in set(nums)}\n n = len(nums)\n\n for i in range(min(ks,n)):\n if dic[nums[i]] == 0:\n dic[nums[i]] = 1\n else: \n return True\n\n for i in range(n-ks):\n dic[nums[i]] = 0\n if dic[nums[min(i+ks,n)]] == 0:\n dic[nums[min(i+ks,n)]] = 1\n else:\n return True\n \n return False\n\n \n\n\n","memory":"32541"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n map = {}\n for i,ele in enumerate(nums):\n if str(ele) in map:\n print(i - map[str(ele)])\n if i - map[str(ele)]<= k:\n return True\n map[str(ele)] = i\n\n return False","memory":"32668"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n \n data = []\n\n # Storing the indices and the values\n for itr, num in enumerate(nums):\n data.append(tuple([num, itr]))\n\n # Sorting the data with `num` as the key\n\n data = sorted(data, key = lambda x: x[0])\n \n # Evaluating the duplicate values\n prev_num, prev_index = data[0]\n\n for element in data[1:]:\n curr_num, curr_index = element\n\n if (curr_num == prev_num) and (abs(curr_index - prev_index) <= k):\n return True\n \n prev_num, prev_index = curr_num, curr_index\n\n return False\n\n\n","memory":"32796"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n # i and j are at max k apart. \n \n index_dic = {}\n\n for i in range(len(nums)):\n if nums[i] not in index_dic:\n index_dic[nums[i]] = (nums[i], i)\n else:\n prev_index = index_dic[nums[i]][1]\n if abs(prev_index-i) <= k:\n return True\n index_dic[nums[i]] = (nums[i],i)\n \n return False","memory":"32923"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n # i and j are at max k apart. \n \n index_dic = {}\n\n for i in range(len(nums)):\n if nums[i] not in index_dic:\n index_dic[nums[i]] = (nums[i], i)\n else:\n prev_index = index_dic[nums[i]][1]\n if abs(prev_index-i) <= k:\n return True\n index_dic[nums[i]] = (nums[i],i)\n \n return False","memory":"33051"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n # i and j are at max k apart. \n \n index_dic = {}\n\n for i in range(len(nums)):\n if nums[i] not in index_dic:\n index_dic[nums[i]] = (nums[i], i)\n else:\n prev_index = index_dic[nums[i]][1]\n if abs(prev_index-i) <= k:\n return True\n index_dic[nums[i]] = (nums[i],i)\n \n return False","memory":"33051"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = {}\n\n for idx,i in enumerate(nums):\n if d.get(i,None) is None:\n d[i] = idx, False\n else:\n _, flag = d[i]\n if not flag:\n d[i] = idx,True\n\n\n \n for i in range(len(nums)):\n\n if nums[i] in d and d[nums[i]][0]!=i and d[nums[i]][1] is True and abs(i-d[nums[i]][0])<=k:\n return True\n return False","memory":"33178"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n # i and j are at max k apart. \n \n index_dic = {}\n\n for i in range(len(nums)):\n if nums[i] not in index_dic:\n index_dic[nums[i]] = (nums[i], i)\n else:\n prev_index = index_dic[nums[i]][1]\n if abs(prev_index-i) <= k:\n return True\n index_dic[nums[i]] = (nums[i],i)\n \n return False","memory":"33306"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n # i and j are at max k apart. \n \n index_dic = {}\n\n for i in range(len(nums)):\n if nums[i] not in index_dic:\n index_dic[nums[i]] = (nums[i], i)\n else:\n prev_index = index_dic[nums[i]][1]\n if abs(prev_index-i) <= k:\n return True\n index_dic[nums[i]] = (nums[i],i)\n \n return False","memory":"33306"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n dic = dict()\n for i in range(len(nums)):\n if dic.get(nums[i], 0) == 0:\n dic[nums[i]] = (dic.get(nums[i], 0)+1, i)\n else:\n if abs(dic[nums[i]][1] - i) <=k:\n return True\n else:\n dic[nums[i]] = (dic.get(nums[i], 0), i)\n\n return False","memory":"33433"},{"code":"class Solution:\n def containsNearbyDuplicate(self, l: List[int], k: int) -> bool:\n a=[[i,l[i]] for i in range(len(l))]\n a.sort(key=lambda x:x[1])\n for i in range(len(l)-1):\n if a[i][1]==a[i+1][1] and abs(a[i+1][0]-a[i][0])<=k: return True\n return False\n","memory":"33561"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n index_map={}\n N=len(nums)\n for i in range(N):\n x=nums[i]\n if x not in index_map:\n index_map[x]=(-1000000,i)\n else:\n min_index,max_index=index_map[x]\n if (i-max_index)<(max_index-min_index):\n index_map[x]=(max_index,i)\n \n for key,val in index_map.items():\n min_index,max_index=val\n if 0<abs(min_index-max_index)<= k:\n return True\n return False","memory":"33561"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n L=[]\n for i in range(len(nums)):\n L+=[[nums[i],i]]\n L.sort(key= lambda x:x[0])\n for i in range(len(L)-1):\n if L[i][0]==L[i+1][0] and abs(L[i][1]-L[i+1][1])<=k:\n return True\n return False","memory":"33688"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n map = {}\n for i in range(len(nums)):\n if nums[i] in map:\n map[nums[i]].append(i)\n if abs(map[nums[i]][0] - map[nums[i]][1]) <= k:\n return True\n map[nums[i]] = [i]\n\n return False","memory":"33816"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n num_index_dict = {}\n for i,n in enumerate(nums):\n if num_index_dict.get(n) and [x for x in num_index_dict[n] if abs(x - i) <= k]:\n return True\n elif num_index_dict.get(n):\n num_index_dict[n].append(i)\n else:\n num_index_dict[n] =[i]\n \n return False\n \n\n ","memory":"33943"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n num_index_dict = {}\n for i,n in enumerate(nums):\n if num_index_dict.get(n) and [x for x in num_index_dict[n] if abs(x - i) <= k]:\n return True\n elif num_index_dict.get(n):\n num_index_dict[n].append(i)\n else:\n num_index_dict[n] =[i]\n \n return False\n \n\n ","memory":"33943"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n searched = {}\n for count, item in enumerate(nums):\n if item in searched.keys():\n if abs(searched[item][-1] - count) <= k:\n return True\n else:\n searched[item].append(count)\n else:\n searched[item] = [count]\n \n return False","memory":"34071"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n #iterate through the list of nums and add to a hashmap with num -> index\n #if key exists, compare the new index to see if it lies in range of each item in the list and return true\n \n res = False\n idx = {}\n for i, num in enumerate(nums):\n if num not in idx:\n idx[num] = [i] \n elif next((x for x in idx[num] if abs(x - i) <= k), None) is not None:\n res = True\n break\n else:\n idx[num].append(i)\n \n return res\n ","memory":"34198"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n \n \n count_hm = set()\n index_hm = {}\n \n for i in range(len(nums)):\n if nums[i] in count_hm:\n if abs(index_hm[nums[i]] - i) <= k:\n return True\n else:\n count_hm.add(nums[i])\n \n index_hm[nums[i]] = i\n \n return False","memory":"34198"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n my_dict = {}\n output = False\n index = 0\n for entry in nums:\n # print(entry)\n if entry not in my_dict:\n my_dict[entry] = [index]\n else:\n my_dict[entry].append(index)\n if abs(my_dict[entry][0] - my_dict[entry][1]) <= k:\n output = True\n break\n else:\n my_dict[entry].pop(0)\n index += 1\n \n print(my_dict)\n\n return output","memory":"34326"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n visited = set()\n hashmap={}\n for i in range(len(nums)):\n if nums[i] in visited:\n if i-hashmap[nums[i]]<=k:\n return True\n else:\n hashmap[nums[i]]=i\n else:\n visited.add(nums[i])\n hashmap[nums[i]]=i\n return False","memory":"34453"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n visited = set()\n hashmap={}\n for i in range(len(nums)):\n if nums[i] in visited:\n if i-hashmap[nums[i]]<=k:\n return True\n else:\n hashmap[nums[i]]=i\n else:\n visited.add(nums[i])\n hashmap[nums[i]]=i\n return False","memory":"34453"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n d = {}\n for i, num in enumerate(nums):\n index = d.get(num)\n if index != None:\n for val in index:\n if abs(i - val) <= k:\n return True\n index.append(i)\n else:\n d[num] = [i]\n return False\n \n \n","memory":"34581"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n indices = {}\n for i in range(n):\n if nums[i] in indices:\n # compare\n for idx in indices[nums[i]]:\n if abs(i-idx) <= k:\n return True\n indices[nums[i]].append(i)\n else:\n indices[nums[i]] = [i]\n return False","memory":"34581"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n inter={}\n i=0\n for x in nums:\n if x not in inter:\n inter[x]=[i]\n else:\n inter[x].append(i)\n i+=1\n \n j=0\n for x in nums:\n for y in inter[x]:\n if y!=j and abs(y-j)<=k:\n return True\n j+=1 \n return False \n ","memory":"34708"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n index_map = {}; \n for i in range(len(nums)): \n list_to_check = []; \n if nums[i] in index_map.keys(): \n list_to_check = index_map.get(nums[i]); \n for index in list_to_check: \n if abs(index - i) <= k: \n return True; \n index_map[nums[i]].append(i); \n else: \n index_map[nums[i]] = [i]; \n return False; \n","memory":"34708"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n\n # 1. Inputs and outputs:\n # Inputs:\n # nums -> list of integers to check for duplicates\n # k -> conditional int for checking abs value of i-j\n # Outputs:\n # res -> boolean true if there exists and answer\n\n # 2. Edge cases, boundaries and other tests:\n # Check if the list if empty\n # Check if the list has 1 entry\n # Check if the list has 2 entries\n # Check if the list has all the same number\n # Check if k is valid\n # Check some random test cases with varying patterns\n # Add some test cases using chatgpt\n\n # 3: Algorithm:\n # 2 ways come to mind:\n\n # Way 1:\n # Initialize a dictionary to keep track of numbers with their indices\n # If the number isnt in, create a new value with its index\n # If its there, compare to see if the index is valid\n # If yes, return true\n # Else, continue\n\n # Way 2:\n # Sort the list with indices\n # Use two pointers to run through all tuples\n # Check validity, and update pointers\n\n # 4. Code: (way 1)\n\n n = len(nums)\n\n if n == 1 or 0: return False\n\n d = {}\n\n for i in range(n):\n if nums[i] not in d:\n d[nums[i]] = [i]\n\n else:\n for index in d[nums[i]]:\n if abs(i - index) <= k:\n return True\n d[nums[i]].append(i)\n return False\n","memory":"34836"},{"code":"class Solution:\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\n l=nums\n n=len(nums)\n DD={}\n for i in range(n):\n if l[i] not in DD.keys():\n DD[l[i]]=[i]\n else:\n a=DD[l[i]][0]\n if i-a<=k:\n return True\n else:\n DD[l[i]].pop()\n DD[l[i]].append(i)\n return False\n ","memory":"34836"}],"string":"[\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n arr = []\\n\\n for idx, num in enumerate(nums):\\n if num in arr: return True\\n arr.append(num)\\n if len(arr) > k: arr.pop(0)\\n\\n return False\\n \\n\\n\\n\\n \",\n \"memory\": \"24763\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n start = 0\\n objOfInd=nums[start:start+k+1]\\n if len(objOfInd) != len(set(objOfInd)):\\n return True\\n while start+k < len(nums)-1:\\n objOfInd.pop(0)\\n if nums[start+k+1] in objOfInd:\\n return True\\n objOfInd.append(nums[start+k+1])\\n start+=1\\n return False\",\n \"memory\": \"24763\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n seen = {}\\n # Iterate in reverse\\n for i in range(len(nums) - 1, -1, -1):\\n # Update window size if needed\\n if (len(nums) - 1 - i > k):\\n numToRemove = nums.pop()\\n seen.pop(numToRemove)\\n\\n # Check if we've seen the number before\\n if nums[i] not in seen:\\n seen[nums[i]] = 1 # Value doesn't matter\\n else:\\n return True\\n\\n \",\n \"memory\": \"24891\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n seen = {}\\n # Iterate in reverse\\n for i in range(len(nums) - 1, -1, -1):\\n # Update window size if needed\\n if (len(nums) - 1 - i > k):\\n numToRemove = nums.pop()\\n seen.pop(numToRemove)\\n\\n # Check if we've seen the number before\\n if nums[i] not in seen:\\n seen[nums[i]] = 1 # Value doesn't matter\\n else:\\n return True\\n return False\\n\\n \",\n \"memory\": \"25018\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n for i in range(len(nums)):\\n value = nums[i]\\n minimum = min(len(nums), i+k+1)\\n if value in nums[i+1: minimum]:\\n index = nums.index(value)\\n if abs(i - index) <= k:\\n return True\\n else:\\n nums[i] = '*'\\n return False\\n \",\n \"memory\": \"25146\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window = set()\\n left,right = 0,0\\n while right<len(nums):\\n if nums[right] in window:\\n return True\\n window.add(nums[right])\\n right+=1\\n if right-left > k:\\n window.remove(nums[left])\\n left+=1\\n return False\",\n \"memory\": \"25273\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n if k == 0 :\\n return False\\n if len(nums) in [2,3,4] and k!= 1:\\n if len(set(nums)) in [1,2,3] and len(set(nums)) < len(nums):\\n return True\\n for i in range(0,len(nums)-k):\\n x = nums[i]\\n if x in nums[i+1:i+k+1]:\\n return True\\n nums.reverse()\\n for i in range(0,len(nums)-k):\\n x = nums[i]\\n if x in nums[i+1:i+k+1]:\\n return True\\n return False\",\n \"memory\": \"25401\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n if k == 0: return False\\n for i, num in enumerate(nums):\\n if num in nums[i+1:i+k+1]:\\n return True\\n\\n return False\\n\\n \",\n \"memory\": \"25528\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n \\n for i in range(len(nums)):\\n \\n if nums[i] in nums[i+1:i+k+1]:\\n \\n return True\",\n \"memory\": \"25656\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: list[int], k: int) -> bool:\\n for ind in range(len(nums)):\\n a = nums[ind]\\n if a in nums[ind+1:ind+k+1]: return True\\n return False\",\n \"memory\": \"25783\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window = []\\n for i, num in enumerate(nums):\\n if num in window:\\n return True\\n window.append(num)\\n if len(window) > k:\\n window.pop(0)\\n return False\\n\",\n \"memory\": \"26166\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: \\n res=0 \\n for i in range(len(nums)):\\n if nums[i] in nums[i+1:i+k+1]: \\n return True \\n return False\\n\\n\\n \\n \",\n \"memory\": \"26293\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n\\n # Solution 1 - \\n # Time - \\n # Space - \\n\\n seen = set()\\n\\n for i in range(len(nums)):\\n if nums[i] in seen:\\n return True\\n seen.add(nums[i])\\n\\n if len(seen) > k:\\n seen.remove(nums[i - k])\\n\\n return False\\n\",\n \"memory\": \"26421\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n seen = set()\\n\\n for i in range(len(nums)):\\n # If we've already seen this number in the window of last k elements\\n if nums[i] in seen:\\n return True\\n\\n # Add the current number to the set\\n seen.add(nums[i])\\n\\n # If the size of the set exceeds k, remove the oldest element (i-k)\\n if len(seen) > k:\\n seen.remove(nums[i - k])\\n\\n return False\",\n \"memory\": \"26548\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window_helper = set()\\n\\n window_start, window_end = 0,0\\n\\n while window_end < len(nums):\\n if window_end - window_start > k:\\n print(f\\\"Removing\\\")\\n window_helper.remove(nums[window_start])\\n window_start += 1\\n if nums[window_end] in window_helper:\\n return True\\n window_helper.add(nums[window_end])\\n window_end +=1\\n \\n return False\",\n \"memory\": \"26676\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: \\n if k == 0:\\n return False\\n if len(nums) == 0:\\n return False\\n if len(nums) == 1:\\n return False\\n curr_string = []\\n for index in range(0, len(nums)):\\n if nums[index] not in curr_string:\\n curr_string.append(nums[index])\\n else:\\n return True\\n if len(curr_string) > k:\\n curr_string.remove(nums[index - k])\\n return False\\n \\n\\n \",\n \"memory\": \"26803\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n l=0\\n window = []\\n for r in range(len(nums)):\\n if r-l > k:\\n window.remove(nums[l])\\n l=l+1\\n if nums[r] in window:\\n return True\\n else:\\n window.append(nums[r])\\n return False\\n\",\n \"memory\": \"26931\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n for i in range(len(nums)):\\n if nums[i] in nums[i+1 : (i+k+1 if i+k+1 < len(nums) else len(nums))]:\\n return True\\n return False\",\n \"memory\": \"27058\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n if k == 0:\\n return False\\n a = []\\n for i in range(len(nums)-k):\\n a = nums[i+1:k+1+i]\\n\\n if nums[i] in a:\\n return True\\n \\n if len(a) == 0:\\n a = nums\\n b = []\\n for r in range(len(a)-1):\\n b = a[r+1:]\\n # print(b)\\n if a[r] in b:\\n return True\\n\\n return False\\n\",\n \"memory\": \"27058\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n i = 0\\n for i in range(len(nums)):\\n if nums[i] in nums[i+1:i+k+1]:\\n return True\\n\\n return False\",\n \"memory\": \"27186\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: \\n if k == 0:\\n return False\\n if len(nums) == 0:\\n return False\\n if len(nums) == 1:\\n return False\\n curr_string = []\\n for index in range(0, len(nums)):\\n curr_string = curr_string[-k:]\\n if nums[index] not in curr_string:\\n curr_string.append(nums[index])\\n else:\\n return True\\n return False\\n \\n\\n \",\n \"memory\": \"27313\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n for i in range(len(nums)):\\n if nums[i] in nums[i+1:i+k+1]:\\n return True\\n return False\\n \\n \\n\",\n \"memory\": \"27313\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n for i in range(len(nums)):\\n if nums[i] in nums[i+1:i + k + 1]:\\n return True\\n return False\",\n \"memory\": \"27441\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n for i in range(len(nums)):\\n if nums[i] in nums[i+1:i+k+1]:\\n return True\\n return False\",\n \"memory\": \"27441\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window=set()\\n L=0\\n for R in range(len(nums)):\\n #if window size exceed remove left\\n if R-L>k:\\n window.remove(nums[L])\\n L+=1\\n\\n if nums[R] in window:\\n return True\\n #window size at max k+1\\n window.add(nums[R]) \\n \\n return False \",\n \"memory\": \"27568\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window=set()\\n l=0\\n\\n for r in range(len(nums)):\\n if r-l>k:\\n window.remove(nums[l])\\n l+=1\\n if nums[r] in window:\\n return True\\n\\n window.add(nums[r])\\n\\n return False\\n\\n \",\n \"memory\": \"27696\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n window = set()\\n l = 0\\n for r in range(len(nums)):\\n if r - l > k:\\n window.remove(nums[l])\\n l += 1\\n if nums[r] in window:\\n return True\\n window.add(nums[r])\\n return False\\n\\n\\n\\n\\n \",\n \"memory\": \"27696\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n window = set()\\n for i in range(n):\\n if i > k:\\n window.remove(nums[i-k-1])\\n if nums[i] in window:\\n return True\\n window.add(nums[i])\\n return False\\n \",\n \"memory\": \"27823\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashmap = set()\\n for i in range(len(nums)):\\n if nums[i] in hashmap:\\n return True\\n hashmap.add(nums[i])\\n if (len(hashmap) > k):\\n hashmap.remove(nums[i - k])\\n return False\\n \",\n \"memory\": \"27823\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n\\n window = set()\\n left_index = 0\\n\\n for right_index in range(len(nums)):\\n if right_index - left_index > k:\\n window.remove(nums[left_index])\\n left_index += 1\\n if nums[right_index] in window:\\n return True\\n window.add(nums[right_index])\\n \\n return False\\n \",\n \"memory\": \"27951\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n \\n window=set()\\n l=0\\n for r in range(len(nums)):\\n \\n if r-l>k:\\n window.remove(nums[l])\\n l+=1 \\n if nums[r] in window:\\n return True\\n window.add(nums[r])\\n return False\\n\\n \\n\\n \\n \\n '''\\n track={}\\n for i in range(len(nums)):\\n if nums[i] in track:\\n diff= max(track[nums[i]]-i,(track[nums[i]]-i)*-1)\\n if diff <= k:\\n return True\\n track[nums[i]]=i\\n return False \\n #my attempt\\n '''\\n\\n \\n\\n\\n \",\n \"memory\": \"27951\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n map = {}\\n for i, num in enumerate(nums):\\n if num in map and i - map[num] <= k:\\n return True \\n map[num] = i\\n return False\\n\",\n \"memory\": \"28078\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashmap = dict()\\n \\n for i in range(len(nums)):\\n if i > k and hashmap[nums[i-k - 1]] == i - k - 1:\\n del hashmap[nums[i-k - 1]]\\n if nums[i] not in hashmap:\\n hashmap[nums[i]] = i\\n elif i - hashmap[nums[i]] <= k:\\n return True\\n else:\\n hashmap[nums[i]] = i\\n return False \\n\\n \\n\",\n \"memory\": \"28206\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n\\n if len(nums) == 1 or len(nums) == 0:\\n return False\\n \\n if k >= len(nums):\\n counter = {num:0 for num in nums}\\n\\n for num in nums:\\n counter[num] += 1\\n \\n if max(counter.values())>1:\\n return True\\n \\n return False\\n\\n used_numbers = {}\\n\\n for i in range(k+1):\\n if nums[i] not in used_numbers:\\n used_numbers[nums[i]] = 0\\n \\n used_numbers[nums[i]] += 1\\n \\n if len(used_numbers) < k+1:\\n return True\\n \\n for i in range(k+1,len(nums)):\\n used_numbers[nums[i-k-1]] -= 1\\n\\n if used_numbers[nums[i-k-1]] == 0:\\n del used_numbers[nums[i-k-1]]\\n \\n if nums[i] not in used_numbers:\\n used_numbers[nums[i]] = 0\\n\\n used_numbers[nums[i]] += 1\\n\\n if len(used_numbers) < k+1:\\n return True\\n \\n return False\\n \\n \\n\\n \",\n \"memory\": \"28333\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n index_dict = {}\\n\\n for i, n in enumerate(nums):\\n if (n in index_dict) and (i - index_dict[n] <= k):\\n return True\\n\\n index_dict[n] = i\\n return False\",\n \"memory\": \"28461\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n\\n # approach-1: brute force\\n # for i in range(n-1):\\n # for j in range(i+1, n):\\n # if abs(i-j) <= k and nums[i] == nums[j]:\\n # return True\\n\\n # return False\\n\\n # approach-2: sliding window\\n elements = set()\\n # preapre the intial set\\n s = min(k+1, n)\\n for i in range(s):\\n if nums[i] in elements:\\n return True\\n elements.add(nums[i])\\n print(elements)\\n # set the lower and upper bound\\n l = 0 \\n u = k\\n while u < len(nums)-1:\\n print(l, u)\\n elements.remove(nums[l])\\n l += 1\\n\\n u += 1\\n if nums[u] in elements:\\n return True\\n elements.add(nums[u])\\n \\n return False\",\n \"memory\": \"28461\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n seen = {}\\n for i, num in enumerate(nums):\\n if num in seen and abs(i - seen[num]) <= k:\\n return 'true'\\n seen[num] = i\\n return 'false'\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(Solution().containsNearbyDuplicate(nums, next(inputs)),file=f)\\nexit(0)\",\n \"memory\": \"28588\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n duplicate_map = {}\\n for index, value in enumerate(nums):\\n if value in duplicate_map:\\n if abs(duplicate_map[value] - index) <= k:\\n return True\\n duplicate_map[value] = index\\n duplicate_map[value] = index\\n return False\\n\\n \",\n \"memory\": \"28716\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n if len(set(nums)) < len(nums):\\n for i in range(len(nums)-k+2):\\n sub = nums[i:i+k+1]\\n # print(sub)\\n if len(set(sub)) < len(sub):\\n return True\\n return False\\n else: return False\",\n \"memory\": \"28843\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n indices = range(len(nums))\\n if len(set(nums)) == len(nums):\\n return False\\n for i in indices[0:-1]:\\n temp1=nums[i]\\n #print('temp1 '+str(temp1))\\n for j in indices[i+1:i+k+1]:\\n temp2=nums[j]\\n #print('tempt2 '+str(temp2))\\n if temp1 == temp2 and abs(i-j) <= k:\\n return True\\n return False\\n\\n \",\n \"memory\": \"28843\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n if len(set(nums)) == len(nums):\\n return False\\n\\n for i in range(len(nums)):\\n if i+1+k > len(nums):\\n m_range = len(nums)\\n else:\\n m_range =i+1+k\\n for j in range(i+1,m_range):\\n\\n if nums[i] == nums[j]:\\n return True\\n\\n return False\",\n \"memory\": \"28971\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashmap = defaultdict(list)\\n # diff = 0\\n ans = False\\n \\n\\n if len(set(nums)) == len(nums):\\n return False \\n else:\\n for i, num in enumerate(nums):\\n hashmap[num].append(i)\\n print(hashmap.items())\\n for key, value in hashmap.items():\\n if len(value) > 1:\\n for i in range(0, len(value)-1):\\n print(f\\\"va;ue i {value[i]}\\\")\\n diff = abs(value[i] - value[i+1])\\n print(diff)\\n if diff <= k:\\n return True\\n # else:\\n # ans = False\\n \\n \\n\\n\",\n \"memory\": \"29098\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashmap = defaultdict(list)\\n # diff = 0\\n ans = False\\n \\n\\n if len(set(nums)) == len(nums):\\n return False \\n else:\\n for i, num in enumerate(nums):\\n hashmap[num].append(i)\\n print(hashmap.items())\\n for key, value in hashmap.items():\\n if len(value) > 1:\\n for i in range(0, len(value)-1):\\n print(f\\\"va;ue i {value[i]}\\\")\\n diff = abs(value[i] - value[i+1])\\n print(diff)\\n if diff <= k:\\n return True\\n # else:\\n # ans = False\\n return False \\n \\n\\n\",\n \"memory\": \"29098\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashmap = {}\\n for i, digit in enumerate(nums):\\n if digit not in hashmap:\\n hashmap[digit] = i\\n else:\\n if abs(hashmap[digit] - i) <= k:\\n return True\\n else:\\n hashmap[digit] = i\\n \\n return False\\n\",\n \"memory\": \"29226\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = {}\\n for i,v in enumerate(nums):\\n if v not in d:\\n d[v] = i\\n else:\\n if abs(d[v]-i)<=k:\\n return True\\n else:\\n d[v] = i\\n # return False\\n return False\\n\\n\",\n \"memory\": \"29353\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n i = 0\\n \\n if len(nums) == 1:\\n return False\\n hashmap = {}\\n \\n while i < len(nums):\\n if nums[i] in hashmap:\\n if i - hashmap[nums[i]] <= k:\\n return True\\n else:\\n hashmap[nums[i]] = i\\n else:\\n hashmap[nums[i]] = i\\n i += 1\\n \\n return False\\n\\n \\n \",\n \"memory\": \"29353\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n\\n # 1. Inputs and outputs:\\n # Inputs:\\n # nums -> list of integers to check for duplicates\\n # k -> conditional int for checking abs value of i-j\\n # Outputs:\\n # res -> boolean true if there exists and answer\\n\\n # 2. Edge cases, boundaries and other tests:\\n # Check if the list if empty\\n # Check if the list has 1 entry\\n # Check if the list has 2 entries\\n # Check if the list has all the same number\\n # Check if k is valid\\n # Check some random test cases with varying patterns\\n # Add some test cases using chatgpt\\n\\n # 3: Algorithm:\\n # 2 ways come to mind:\\n\\n # Way 1:\\n # Initialize a dictionary to keep track of numbers with their indices\\n # If the number isnt in, create a new value with its index\\n # If its there, compare to see if the index is valid\\n # If yes, return true\\n # Else, continue\\n\\n # Way 2:\\n # Sort the list with indices\\n # Use two pointers to run through all tuples\\n # Check validity, and update pointers\\n\\n # 4. Code: (way 1)\\n\\n n = len(nums)\\n\\n if n == 1 or 0: return False\\n\\n d = {}\\n\\n for i in range(n):\\n if nums[i] not in d:\\n d[nums[i]] = i\\n\\n else:\\n if abs(i - d[nums[i]]) <= k: return True\\n d[nums[i]] = i\\n return False\\n\",\n \"memory\": \"29481\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n start = 0\\n entries = 0\\n m = {}\\n for i in range(len(nums)):\\n if nums[i] in m:\\n m[nums[i]] += 1\\n else:\\n m[nums[i]] = 1\\n entries += 1\\n\\n if entries > k + 1:\\n m[nums[start]] -= 1\\n start += 1 \\n\\n if m[nums[i]] >= 2:\\n return True\\n return False\\n\\n\\n \",\n \"memory\": \"29481\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hashmap = {}\\n for i in range(len(nums)):\\n if nums[i] in hashmap:\\n if abs(i - hashmap[nums[i]]) <= k:\\n return True\\n hashmap[nums[i]] = i\\n return False\",\n \"memory\": \"29608\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = dict()\\n for i in range(len(nums)):\\n if nums[i] in d and abs(i - d[nums[i]]) <= k:\\n return True\\n d[nums[i]] = i\\n return False\",\n \"memory\": \"29608\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n num_to_indice = dict()\\n for i in range(0, len(nums)):\\n num = nums[i]\\n if num not in num_to_indice:\\n num_to_indice[num] = i\\n else:\\n distance = abs(i-num_to_indice[num])\\n if distance <= k:\\n return True\\n num_to_indice[num] = i\\n return False\",\n \"memory\": \"29736\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n dic = {}\\n for n in range(len(nums)):\\n if(nums[n] in dic and n - dic[nums[n]] <=k):\\n return True \\n dic[nums[n]] = n \\n return False \\n \",\n \"memory\": \"29736\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = {}\\n\\n for i, n in enumerate(nums):\\n if n in d and abs(i - d[n]) <= k:\\n return True\\n else:\\n d[n] = i\\n \\n return False\\n\",\n \"memory\": \"29863\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n seen = {}\\n for ind,val in enumerate(nums):\\n if val in seen:\\n if ind - seen[val] <=k:\\n return True\\n seen[val] = ind\\n return False\",\n \"memory\": \"29863\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n \\n if (len(nums) == len(set(nums))): return False\\n \\n hashmap = dict()\\n for i in range(len(nums)):\\n if nums[i] in hashmap.keys() and i - hashmap[nums[i]] <= k:\\n return True\\n hashmap[nums[i]] = i\\n return False\",\n \"memory\": \"29991\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n dic = {}\\n\\n for i, n in enumerate(nums):\\n if n not in dic:\\n dic[n] = i\\n else:\\n if abs(i - dic[n]) <= k:\\n return True\\n else:\\n dic[n] = i\\n\\n return False\\n \",\n \"memory\": \"29991\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n seen = {}\\n for i in range(len(nums)):\\n if nums[i] in seen:\\n j = seen[nums[i]]\\n if abs(i -j) <= k:\\n return True\\n seen[nums[i]] = i\\n return False\\n\",\n \"memory\": \"30118\"\n },\n {\n \"code\": \"from queue import Queue\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n num_map = {}\\n for i in range(len(nums)):\\n if nums[i] not in num_map:\\n num_map[nums[i]] = i\\n else:\\n if i - num_map[nums[i]] <= k:\\n return True\\n num_map[nums[i]] = i\\n return False\",\n \"memory\": \"30246\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n if len(nums) == len(set(nums)):\\n return False\\n\\n m = dict()\\n\\n for i in range(len(nums)):\\n if nums[i] in m:\\n if abs(m[nums[i]] - i) <= k:\\n return True\\n\\n m[nums[i]] = i\\n\\n return False\",\n \"memory\": \"30373\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n if len(nums) == len(set(nums)):\\n return False\\n\\n m = dict()\\n\\n for i in range(len(nums)):\\n if nums[i] in m:\\n if abs(m[nums[i]] - i) <= k:\\n return True\\n\\n m[nums[i]] = i\\n\\n return False\",\n \"memory\": \"30373\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n if len(nums) == len(set(nums)):\\n return False\\n\\n m = dict()\\n\\n for i in range(len(nums)):\\n if nums[i] in m:\\n if abs(m[nums[i]] - i) <= k:\\n return True\\n\\n m[nums[i]] = i\\n\\n return False\",\n \"memory\": \"30501\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n if len(nums) == len(set(nums)):\\n return False\\n\\n m = dict()\\n\\n for i in range(len(nums)):\\n if nums[i] in m:\\n if abs(m[nums[i]] - i) <= k:\\n return True\\n\\n m[nums[i]] = i\\n\\n return False\",\n \"memory\": \"30501\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n count = Counter(nums)\\n\\n for key, value in count.most_common():\\n print(key, value)\\n if value < 2:\\n return False\\n indexes = [i for i, item in enumerate(nums) if item == key]\\n diffs = [indexes[i] - indexes[i-1] for i in range(1,len(indexes))]\\n gaps = [diff for diff in diffs if diff <= k]\\n if len(gaps):\\n return True\\n return False\",\n \"memory\": \"30628\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n #go thru list, add to hash map\\n #key is the number, value is the indices\\n if set(nums) == nums:\\n return False\\n thing = {}\\n for i in range(len(nums)):\\n if nums[i] in thing:\\n if abs(thing[nums[i]]-i) <= k:\\n return True\\n thing.update({nums[i]:i})\\n print(thing)\\n return False\",\n \"memory\": \"30756\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hash = defaultdict(int)\\n for i in nums[:k + 1]:\\n hash[i] += 1\\n if hash[i] >= 2:\\n return True\\n\\n r = 0\\n for l in nums[k + 1: len(nums)]:\\n hash[l] += 1\\n hash[nums[r]] -= 1\\n r += 1\\n if hash[l] >= 2:\\n return True\\n return False\\n\",\n \"memory\": \"30883\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n hash = defaultdict(int)\\n for i in nums[:k + 1]:\\n hash[i] += 1\\n if hash[i] >= 2:\\n return True\\n\\n r = 0\\n for l in nums[k + 1: len(nums)]:\\n hash[l] += 1\\n hash[nums[r]] -= 1\\n r += 1\\n if hash[l] >= 2:\\n return True\\n return False\\n\",\n \"memory\": \"30883\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n duplicate = defaultdict(bool)\\n index_list = defaultdict(int)\\n for index,i in enumerate(nums):\\n if duplicate[i]:\\n if index - index_list[i] <= k:\\n return True\\n else:\\n index_list[i] = index\\n else:\\n duplicate[i] = True\\n index_list[i] = index \\n return False\",\n \"memory\": \"31011\"\n },\n {\n \"code\": \"'''\\nNotes:\\n- it is not sorted\\n- the distance of index needs to be below k\\n- naive way: for each integer, try to move k to find it. O((n-k)*k)\\n- sort with index, then find the pair that has different less than k or move on: time: O(nlogn), but cost space O(n)\\n\\nApproach: go with the sort solution\\n'''\\nclass Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n if len(nums) == 1:\\n return False\\n\\n val_index_list = []\\n\\n for index, val in enumerate(nums):\\n val_index_list.append((val, index))\\n \\n val_index_list.sort()\\n\\n prev_val = val_index_list[0][0]\\n prev_index = val_index_list[0][1]\\n for i in range(1, len(val_index_list)):\\n if val_index_list[i][0] == prev_val:\\n if val_index_list[i][1] - prev_index <= k:\\n return True\\n prev_val = val_index_list[i][0]\\n prev_index = val_index_list[i][1]\\n return False\",\n \"memory\": \"31138\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n frequency_dict = {}\\n\\n if len(nums) <= 1:\\n return False\\n if len(set(nums)) == len(nums):\\n return False\\n if k == 0:\\n return False\\n\\n\\n for i, num in enumerate(nums):\\n if num not in frequency_dict.keys():\\n frequency_dict[num] = []\\n frequency_dict[num].append(i)\\n else:\\n frequency_dict[num].append(i)\\n\\n # # multiple_indices = [k,v for k,v in frequency_dict.items() if len(v) >= 2]\\n multiple_indices = [k for k,v in frequency_dict.items() if len(v) >1 ]\\n for key in multiple_indices:\\n value = frequency_dict[key]\\n for i in range(1,len(value)):\\n \\n if i == 1:\\n leap_size = value[i] - value[i-1]\\n min_leap = leap_size\\n print(min_leap)\\n elif i > 1: \\n leap_size = value[i] - value[i-1]\\n if leap_size < min_leap:\\n min_leap = leap_size\\n print(min_leap)\\n if abs(min_leap) <= k:\\n return True\\n else:\\n return False\\n\\n\",\n \"memory\": \"31138\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n nums = sorted([(num, i) for i, num in enumerate(nums)])\\n n = len(nums)\\n\\n for ind in range(n - 1):\\n num1, i = nums[ind]\\n num2, j = nums[ind + 1]\\n\\n if num1 == num2 and abs(i - j) <= k:\\n return True\\n\\n \\n return False\\n \",\n \"memory\": \"31266\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n \\n j=0\\n hash1=defaultdict(set)\\n n=len(nums)\\n for i in range(n):\\n if i-j>k:\\n hash1[nums[j]].remove(j)\\n if not hash1[nums[j]]:\\n del hash1[nums[j]]\\n j+=1\\n if nums[i] in hash1:\\n return True\\n hash1[nums[i]].add(i)\\n return False\\n\",\n \"memory\": \"31648\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n checker = {}\\n for i in range(len(nums)):\\n if str(nums[i]) in checker:\\n if abs(i - checker[str(nums[i])]) <= k:\\n return True\\n \\n checker[str(nums[i])] = i\\n\\n return False\",\n \"memory\": \"31776\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n checker = {}\\n for i, num in enumerate(nums):\\n if str(num) in checker:\\n if abs(i - checker[str(num)]) <= k:\\n return True\\n \\n checker[str(num)] = i\\n\\n return False\",\n \"memory\": \"31903\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n l = len(nums)\\n nums_inds = [(num, i) for i, num in enumerate(nums)]\\n nums_inds.sort(key = lambda x: x[0])\\n for i in range(l-1):\\n if nums_inds[i][0] == nums_inds[i+1][0] and abs(nums_inds[i+1][1] - nums_inds[i][1]) <= k: return True\\n return False\",\n \"memory\": \"32031\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n l = len(nums)\\n nums_inds = [(num, i) for i, num in enumerate(nums)]\\n nums_inds.sort(key = lambda x: x[0])\\n for i in range(l-1):\\n if nums_inds[i][0] == nums_inds[i+1][0] and abs(nums_inds[i+1][1] - nums_inds[i][1]) <= k: return True\\n return False\",\n \"memory\": \"32031\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n nums_with_pos = []\\n for i in range(len(nums)):\\n nums_with_pos.append((nums[i], i))\\n nums_with_pos.sort(key=lambda x: x[0])\\n for i in range(len(nums) - 1):\\n num1, pos1 = nums_with_pos[i]\\n num2, pos2 = nums_with_pos[i + 1]\\n if num1 == num2 and pos2 - pos1 <= k:\\n return True\\n return False\",\n \"memory\": \"32158\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n l=[]\\n for i in range(len(nums)):\\n l.append((nums[i],i))\\n l.sort(key=lambda x: x[0])\\n for i in range(len(l)-1):\\n if l[i][0]==l[i+1][0] and abs(l[i][1]-l[i+1][1])<=k:\\n return True\\n return False\",\n \"memory\": \"32286\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n numbers = []\\n for i in range(len(nums)):\\n numbers.append([nums[i], i])\\n numbers.sort()\\n for i in range(len(numbers)-1):\\n if numbers[i][0] == numbers[i+1][0]:\\n if abs(numbers[i][1] - numbers[i+1][1]) <= k:\\n return True\\n \\n return False\",\n \"memory\": \"32413\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n numbers = {}\\n for i in range(len(nums)):\\n current = nums[i]\\n if current in numbers:\\n for index in numbers[current]:\\n if abs(index - i) <= k:\\n print(f\\\"True, {index} - {i} is good\\\")\\n return True\\n numbers[current] = tuple(list(numbers.get(current, ())) + [i])\\n return False\\n\",\n \"memory\": \"32541\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n\\n ks = k+1\\n\\n dic = {qte : 0 for qte in set(nums)}\\n n = len(nums)\\n\\n for i in range(min(ks,n)):\\n if dic[nums[i]] == 0:\\n dic[nums[i]] = 1\\n else: \\n return True\\n\\n for i in range(n-ks):\\n dic[nums[i]] = 0\\n if dic[nums[min(i+ks,n)]] == 0:\\n dic[nums[min(i+ks,n)]] = 1\\n else:\\n return True\\n \\n return False\\n\\n \\n\\n\\n\",\n \"memory\": \"32541\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n map = {}\\n for i,ele in enumerate(nums):\\n if str(ele) in map:\\n print(i - map[str(ele)])\\n if i - map[str(ele)]<= k:\\n return True\\n map[str(ele)] = i\\n\\n return False\",\n \"memory\": \"32668\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n \\n data = []\\n\\n # Storing the indices and the values\\n for itr, num in enumerate(nums):\\n data.append(tuple([num, itr]))\\n\\n # Sorting the data with `num` as the key\\n\\n data = sorted(data, key = lambda x: x[0])\\n \\n # Evaluating the duplicate values\\n prev_num, prev_index = data[0]\\n\\n for element in data[1:]:\\n curr_num, curr_index = element\\n\\n if (curr_num == prev_num) and (abs(curr_index - prev_index) <= k):\\n return True\\n \\n prev_num, prev_index = curr_num, curr_index\\n\\n return False\\n\\n\\n\",\n \"memory\": \"32796\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n # i and j are at max k apart. \\n \\n index_dic = {}\\n\\n for i in range(len(nums)):\\n if nums[i] not in index_dic:\\n index_dic[nums[i]] = (nums[i], i)\\n else:\\n prev_index = index_dic[nums[i]][1]\\n if abs(prev_index-i) <= k:\\n return True\\n index_dic[nums[i]] = (nums[i],i)\\n \\n return False\",\n \"memory\": \"32923\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n # i and j are at max k apart. \\n \\n index_dic = {}\\n\\n for i in range(len(nums)):\\n if nums[i] not in index_dic:\\n index_dic[nums[i]] = (nums[i], i)\\n else:\\n prev_index = index_dic[nums[i]][1]\\n if abs(prev_index-i) <= k:\\n return True\\n index_dic[nums[i]] = (nums[i],i)\\n \\n return False\",\n \"memory\": \"33051\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n # i and j are at max k apart. \\n \\n index_dic = {}\\n\\n for i in range(len(nums)):\\n if nums[i] not in index_dic:\\n index_dic[nums[i]] = (nums[i], i)\\n else:\\n prev_index = index_dic[nums[i]][1]\\n if abs(prev_index-i) <= k:\\n return True\\n index_dic[nums[i]] = (nums[i],i)\\n \\n return False\",\n \"memory\": \"33051\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = {}\\n\\n for idx,i in enumerate(nums):\\n if d.get(i,None) is None:\\n d[i] = idx, False\\n else:\\n _, flag = d[i]\\n if not flag:\\n d[i] = idx,True\\n\\n\\n \\n for i in range(len(nums)):\\n\\n if nums[i] in d and d[nums[i]][0]!=i and d[nums[i]][1] is True and abs(i-d[nums[i]][0])<=k:\\n return True\\n return False\",\n \"memory\": \"33178\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n # i and j are at max k apart. \\n \\n index_dic = {}\\n\\n for i in range(len(nums)):\\n if nums[i] not in index_dic:\\n index_dic[nums[i]] = (nums[i], i)\\n else:\\n prev_index = index_dic[nums[i]][1]\\n if abs(prev_index-i) <= k:\\n return True\\n index_dic[nums[i]] = (nums[i],i)\\n \\n return False\",\n \"memory\": \"33306\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n # i and j are at max k apart. \\n \\n index_dic = {}\\n\\n for i in range(len(nums)):\\n if nums[i] not in index_dic:\\n index_dic[nums[i]] = (nums[i], i)\\n else:\\n prev_index = index_dic[nums[i]][1]\\n if abs(prev_index-i) <= k:\\n return True\\n index_dic[nums[i]] = (nums[i],i)\\n \\n return False\",\n \"memory\": \"33306\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n dic = dict()\\n for i in range(len(nums)):\\n if dic.get(nums[i], 0) == 0:\\n dic[nums[i]] = (dic.get(nums[i], 0)+1, i)\\n else:\\n if abs(dic[nums[i]][1] - i) <=k:\\n return True\\n else:\\n dic[nums[i]] = (dic.get(nums[i], 0), i)\\n\\n return False\",\n \"memory\": \"33433\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, l: List[int], k: int) -> bool:\\n a=[[i,l[i]] for i in range(len(l))]\\n a.sort(key=lambda x:x[1])\\n for i in range(len(l)-1):\\n if a[i][1]==a[i+1][1] and abs(a[i+1][0]-a[i][0])<=k: return True\\n return False\\n\",\n \"memory\": \"33561\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n index_map={}\\n N=len(nums)\\n for i in range(N):\\n x=nums[i]\\n if x not in index_map:\\n index_map[x]=(-1000000,i)\\n else:\\n min_index,max_index=index_map[x]\\n if (i-max_index)<(max_index-min_index):\\n index_map[x]=(max_index,i)\\n \\n for key,val in index_map.items():\\n min_index,max_index=val\\n if 0<abs(min_index-max_index)<= k:\\n return True\\n return False\",\n \"memory\": \"33561\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n L=[]\\n for i in range(len(nums)):\\n L+=[[nums[i],i]]\\n L.sort(key= lambda x:x[0])\\n for i in range(len(L)-1):\\n if L[i][0]==L[i+1][0] and abs(L[i][1]-L[i+1][1])<=k:\\n return True\\n return False\",\n \"memory\": \"33688\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n map = {}\\n for i in range(len(nums)):\\n if nums[i] in map:\\n map[nums[i]].append(i)\\n if abs(map[nums[i]][0] - map[nums[i]][1]) <= k:\\n return True\\n map[nums[i]] = [i]\\n\\n return False\",\n \"memory\": \"33816\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n num_index_dict = {}\\n for i,n in enumerate(nums):\\n if num_index_dict.get(n) and [x for x in num_index_dict[n] if abs(x - i) <= k]:\\n return True\\n elif num_index_dict.get(n):\\n num_index_dict[n].append(i)\\n else:\\n num_index_dict[n] =[i]\\n \\n return False\\n \\n\\n \",\n \"memory\": \"33943\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n num_index_dict = {}\\n for i,n in enumerate(nums):\\n if num_index_dict.get(n) and [x for x in num_index_dict[n] if abs(x - i) <= k]:\\n return True\\n elif num_index_dict.get(n):\\n num_index_dict[n].append(i)\\n else:\\n num_index_dict[n] =[i]\\n \\n return False\\n \\n\\n \",\n \"memory\": \"33943\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n searched = {}\\n for count, item in enumerate(nums):\\n if item in searched.keys():\\n if abs(searched[item][-1] - count) <= k:\\n return True\\n else:\\n searched[item].append(count)\\n else:\\n searched[item] = [count]\\n \\n return False\",\n \"memory\": \"34071\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n #iterate through the list of nums and add to a hashmap with num -> index\\n #if key exists, compare the new index to see if it lies in range of each item in the list and return true\\n \\n res = False\\n idx = {}\\n for i, num in enumerate(nums):\\n if num not in idx:\\n idx[num] = [i] \\n elif next((x for x in idx[num] if abs(x - i) <= k), None) is not None:\\n res = True\\n break\\n else:\\n idx[num].append(i)\\n \\n return res\\n \",\n \"memory\": \"34198\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n \\n \\n count_hm = set()\\n index_hm = {}\\n \\n for i in range(len(nums)):\\n if nums[i] in count_hm:\\n if abs(index_hm[nums[i]] - i) <= k:\\n return True\\n else:\\n count_hm.add(nums[i])\\n \\n index_hm[nums[i]] = i\\n \\n return False\",\n \"memory\": \"34198\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n my_dict = {}\\n output = False\\n index = 0\\n for entry in nums:\\n # print(entry)\\n if entry not in my_dict:\\n my_dict[entry] = [index]\\n else:\\n my_dict[entry].append(index)\\n if abs(my_dict[entry][0] - my_dict[entry][1]) <= k:\\n output = True\\n break\\n else:\\n my_dict[entry].pop(0)\\n index += 1\\n \\n print(my_dict)\\n\\n return output\",\n \"memory\": \"34326\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n visited = set()\\n hashmap={}\\n for i in range(len(nums)):\\n if nums[i] in visited:\\n if i-hashmap[nums[i]]<=k:\\n return True\\n else:\\n hashmap[nums[i]]=i\\n else:\\n visited.add(nums[i])\\n hashmap[nums[i]]=i\\n return False\",\n \"memory\": \"34453\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n visited = set()\\n hashmap={}\\n for i in range(len(nums)):\\n if nums[i] in visited:\\n if i-hashmap[nums[i]]<=k:\\n return True\\n else:\\n hashmap[nums[i]]=i\\n else:\\n visited.add(nums[i])\\n hashmap[nums[i]]=i\\n return False\",\n \"memory\": \"34453\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n d = {}\\n for i, num in enumerate(nums):\\n index = d.get(num)\\n if index != None:\\n for val in index:\\n if abs(i - val) <= k:\\n return True\\n index.append(i)\\n else:\\n d[num] = [i]\\n return False\\n \\n \\n\",\n \"memory\": \"34581\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n indices = {}\\n for i in range(n):\\n if nums[i] in indices:\\n # compare\\n for idx in indices[nums[i]]:\\n if abs(i-idx) <= k:\\n return True\\n indices[nums[i]].append(i)\\n else:\\n indices[nums[i]] = [i]\\n return False\",\n \"memory\": \"34581\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n inter={}\\n i=0\\n for x in nums:\\n if x not in inter:\\n inter[x]=[i]\\n else:\\n inter[x].append(i)\\n i+=1\\n \\n j=0\\n for x in nums:\\n for y in inter[x]:\\n if y!=j and abs(y-j)<=k:\\n return True\\n j+=1 \\n return False \\n \",\n \"memory\": \"34708\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n index_map = {}; \\n for i in range(len(nums)): \\n list_to_check = []; \\n if nums[i] in index_map.keys(): \\n list_to_check = index_map.get(nums[i]); \\n for index in list_to_check: \\n if abs(index - i) <= k: \\n return True; \\n index_map[nums[i]].append(i); \\n else: \\n index_map[nums[i]] = [i]; \\n return False; \\n\",\n \"memory\": \"34708\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n\\n # 1. Inputs and outputs:\\n # Inputs:\\n # nums -> list of integers to check for duplicates\\n # k -> conditional int for checking abs value of i-j\\n # Outputs:\\n # res -> boolean true if there exists and answer\\n\\n # 2. Edge cases, boundaries and other tests:\\n # Check if the list if empty\\n # Check if the list has 1 entry\\n # Check if the list has 2 entries\\n # Check if the list has all the same number\\n # Check if k is valid\\n # Check some random test cases with varying patterns\\n # Add some test cases using chatgpt\\n\\n # 3: Algorithm:\\n # 2 ways come to mind:\\n\\n # Way 1:\\n # Initialize a dictionary to keep track of numbers with their indices\\n # If the number isnt in, create a new value with its index\\n # If its there, compare to see if the index is valid\\n # If yes, return true\\n # Else, continue\\n\\n # Way 2:\\n # Sort the list with indices\\n # Use two pointers to run through all tuples\\n # Check validity, and update pointers\\n\\n # 4. Code: (way 1)\\n\\n n = len(nums)\\n\\n if n == 1 or 0: return False\\n\\n d = {}\\n\\n for i in range(n):\\n if nums[i] not in d:\\n d[nums[i]] = [i]\\n\\n else:\\n for index in d[nums[i]]:\\n if abs(i - index) <= k:\\n return True\\n d[nums[i]].append(i)\\n return False\\n\",\n \"memory\": \"34836\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:\\n l=nums\\n n=len(nums)\\n DD={}\\n for i in range(n):\\n if l[i] not in DD.keys():\\n DD[l[i]]=[i]\\n else:\\n a=DD[l[i]][0]\\n if i-a<=k:\\n return True\\n else:\\n DD[l[i]].pop()\\n DD[l[i]].append(i)\\n return False\\n \",\n \"memory\": \"34836\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":107,"string":"107"}}},{"rowIdx":147,"cells":{"question_id":{"kind":"number","value":220,"string":"220"},"name":{"kind":"string","value":"contains-duplicate-iii"},"content":{"kind":"string","value":"<p>You are given an integer array <code>nums</code> and two integers <code>indexDiff</code> and <code>valueDiff</code>.</p>\n\n<p>Find a pair of indices <code>(i, j)</code> such that:</p>\n\n<ul>\n\t<li><code>i != j</code>,</li>\n\t<li><code>abs(i - j) <= indexDiff</code>.</li>\n\t<li><code>abs(nums[i] - nums[j]) <= valueDiff</code>, and</li>\n</ul>\n\n<p>Return <code>true</code><em> if such pair exists or </em><code>false</code><em> otherwise</em>.</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,1], indexDiff = 3, valueDiff = 0\n<strong>Output:</strong> true\n<strong>Explanation:</strong> We can choose (i, j) = (0, 3).\nWe satisfy the three conditions:\ni != j --> 0 != 3\nabs(i - j) <= indexDiff --> abs(0 - 3) <= 3\nabs(nums[i] - nums[j]) <= valueDiff --> abs(1 - 1) <= 0\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [1,5,9,1,5,9], indexDiff = 2, valueDiff = 3\n<strong>Output:</strong> false\n<strong>Explanation:</strong> After trying all the possible pairs (i, j), we cannot satisfy the three conditions, so we return false.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>2 <= nums.length <= 10<sup>5</sup></code></li>\n\t<li><code>-10<sup>9</sup> <= nums[i] <= 10<sup>9</sup></code></li>\n\t<li><code>1 <= indexDiff <= nums.length</code></li>\n\t<li><code>0 <= valueDiff <= 10<sup>9</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":22.99062476350715,"string":"22.990625"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["array","sliding-window","sorting","bucket-sort","ordered-set"],"string":"[\n \"array\",\n \"sliding-window\",\n \"sorting\",\n \"bucket-sort\",\n \"ordered-set\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"705\", 1.2975999999999999], [\"745\", 10.948499999999997], [\"785\", 13.543699999999998], [\"825\", 7.785599999999999], [\"864\", 12.002799999999995], [\"904\", 5.758100000000004], [\"944\", 1.3786999999999996], [\"984\", 0.8109999999999999], [\"1023\", 0.3244], [\"1063\", 0.8109999999999999], [\"1103\", 4.622700000000002], [\"1142\", 2.3519000000000005], [\"1182\", 1.2165], [\"1222\", 0.8110000000000002], [\"1262\", 2.8385], [\"1301\", 2.8385000000000016], [\"1341\", 1.5409], [\"1381\", 5.1904], [\"1421\", 3.8928000000000016], [\"1460\", 0.8109999999999999], [\"1500\", 0.8920999999999999], [\"1540\", 0.9731999999999998], [\"1580\", 4.136100000000001], [\"1619\", 1.2975999999999996], [\"1659\", 0.3244], [\"1699\", 0.9732], [\"1739\", 0.5677000000000001], [\"1778\", 0.8110000000000002], [\"1818\", 0.7299], [\"1858\", 0.24330000000000002], [\"1897\", 0.5677000000000001], [\"1937\", 0.48660000000000003], [\"1977\", 0.0811], [\"2017\", 0.0811], [\"2056\", 0.0811], [\"2096\", 0.0811], [\"2136\", 0.0811], [\"2176\", 0.0811], [\"2215\", 0.0811], [\"2255\", 0.1622], [\"2295\", 0.0811], [\"2335\", 0.1622], [\"2374\", 0.0811], [\"2414\", 0.0811], [\"2454\", 0.0811], [\"2494\", 0.0811], [\"2533\", 0.0811], [\"2573\", 0.0811], [\"2613\", 0.0811], [\"2653\", 0.0811], [\"2692\", 0.0811], [\"2732\", 0.0811], [\"2772\", 0.0811], [\"2811\", 0.0811], [\"2851\", 0.0811], [\"2891\", 0.0811], [\"2931\", 0.0811]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"28101\", 0.1622], [\"28305\", 0.2433], [\"28509\", 0.2433], [\"28713\", 0.0811], [\"28916\", 0.9732], [\"29120\", 9.8135], [\"29324\", 20.5191], [\"29528\", 2.5953], [\"29731\", 0.5677], [\"29935\", 0.3244], [\"30139\", 0.4866], [\"30343\", 0.6488], [\"30546\", 0.7299], [\"30750\", 0.4866], [\"30954\", 0.7299], [\"31158\", 1.2976], [\"31361\", 0.2433], [\"31565\", 0.0811], [\"31769\", 0.811], [\"31973\", 1.2165], [\"32176\", 0.0811], [\"32380\", 0.0811], [\"32584\", 0.0811], [\"32788\", 0.0811], [\"32991\", 0.2433], [\"33195\", 0.6488], [\"33399\", 0.0811], [\"33603\", 0.5677], [\"33806\", 0.3244], [\"34010\", 20.032400000000003], [\"34214\", 13.2198], [\"34418\", 0.40549999999999997], [\"34621\", 0.5677000000000001], [\"34825\", 0.0811], [\"35029\", 0.1622], [\"35233\", 0.48660000000000003], [\"35436\", 0.8109999999999999], [\"35640\", 0.4055], [\"35844\", 0.7299], [\"36048\", 0.1622], [\"36251\", 0.0811], [\"36455\", 0.1622], [\"36659\", 0.4055], [\"36863\", 0.2433], [\"37066\", 0.5677], [\"37270\", 0.5677], [\"37474\", 0.0811], [\"37678\", 0.0811], [\"37881\", 0.0811], [\"38085\", 0.0811], [\"38289\", 0.0811], [\"38493\", 0.3244], [\"38696\", 0.0811], [\"38900\", 0.0811], [\"39104\", 0.0811], [\"39308\", 0.1622], [\"39511\", 0.0811], [\"39715\", 0.0811], [\"39919\", 0.0811], [\"40123\", 0.0811], [\"40326\", 0.0811], [\"40530\", 0.0811], [\"40734\", 0.4055], [\"40938\", 0.1622], [\"41141\", 0.2433], [\"41345\", 0.0811], [\"41549\", 0.1622], [\"41753\", 0.2433], [\"41956\", 2.352]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\n buckets = {}\n if t == 0:\n for index, num in enumerate(nums):\n if num in buckets and index - buckets[num] <= k:\n return True \n buckets[num] = index\n return False \n for index, num in enumerate(nums):\n bucket = num // t \n if bucket in buckets and index - buckets[bucket][0] <= k:\n return True \n if bucket+1 in buckets and index - buckets[bucket+1][0] <= k and buckets[bucket+1][1] - num <= t:\n return True \n if bucket-1 in buckets and index-buckets[bucket-1][0]<=k and num-buckets[bucket-1][1] <= t:\n return True \n buckets[bucket] = [index, num]\n return False ","runtime":"705"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if len(nums) < 2:\n return False\n if indexDiff == 0:\n return False\n hashmap = {}\n if valueDiff == 0:\n for i in range(len(nums)):\n if nums[i] in hashmap and i - hashmap[nums[i]] <= indexDiff:\n return True\n \n hashmap[nums[i]] = i\n return False\n for i in range(len(nums)):\n if nums[i]//valueDiff in hashmap and i - hashmap[nums[i]//valueDiff][1] <= indexDiff:\n return True\n if nums[i]//valueDiff+1 in hashmap and i - hashmap[nums[i]//valueDiff+1][1] <= indexDiff and abs(hashmap[nums[i]//valueDiff+1][0]-nums[i]) <= valueDiff:\n return True\n if nums[i]//valueDiff-1 in hashmap and i - hashmap[nums[i]//valueDiff-1][1] <= indexDiff and abs(hashmap[nums[i]//valueDiff-1][0]-nums[i]) <= valueDiff:\n return True\n hashmap[nums[i]//valueDiff] = [nums[i], i]\n\n return False\n \n ","runtime":"705"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if indexDiff <= 0 or valueDiff < 0:\n return False\n\n # Bucket size must be valueDiff + 1 to ensure all values in a bucket satisfy the valueDiff condition.\n bucket_size = valueDiff + 1\n buckets = {}\n\n for i, num in enumerate(nums):\n # Determine the bucket for the current element.\n bucket_key = num // bucket_size\n\n # Check if there's a conflict in the current bucket.\n if bucket_key in buckets:\n return True\n\n # Check the neighboring buckets.\n if (bucket_key - 1 in buckets and abs(num - buckets[bucket_key - 1]) < bucket_size):\n return True\n if (bucket_key + 1 in buckets and abs(num - buckets[bucket_key + 1]) < bucket_size):\n return True\n\n # Place the current number in its bucket.\n buckets[bucket_key] = num\n\n # Remove the element that is out of the sliding window.\n if i >= indexDiff:\n old_bucket_key = nums[i - indexDiff] // bucket_size\n del buckets[old_bucket_key]\n\n return False","runtime":"745"},{"code":"from typing import List\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if valueDiff < 0:\n return False\n \n num_buckets = {}\n bucket_size = valueDiff + 1\n \n for i in range(len(nums)):\n bucket_key = nums[i] // bucket_size\n \n if bucket_key in num_buckets:\n return True\n if bucket_key - 1 in num_buckets and abs(nums[i] - num_buckets[bucket_key - 1]) < bucket_size:\n return True\n if bucket_key + 1 in num_buckets and abs(nums[i] - num_buckets[bucket_key + 1]) < bucket_size:\n return True\n \n num_buckets[bucket_key] = nums[i]\n \n if i >= indexDiff:\n del num_buckets[nums[i - indexDiff] // bucket_size]\n \n return False\n","runtime":"745"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n buckets = {}\n size = valueDiff +1\n for r in range(len(nums)):\n if r > indexDiff:\n del buckets[nums[r-indexDiff-1]//size]\n idx = nums[r]//size\n if idx in buckets:\n return True\n if idx +1 in buckets and abs(buckets[idx+1] - nums[r]) <= valueDiff:\n return True\n if idx -1 in buckets and abs(buckets[idx-1] - nums[r]) <= valueDiff:\n return True\n buckets[idx]= nums[r]\n return False\n","runtime":"785"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # go through every single item for x and the moment \n\n # brute force approach\n\n # n = len(nums)\n # for i in range(n):\n # for j in range(i+1, min(n, i + idiff + 1)):\n # if i != j:\n # if abs(nums[i] - nums[j]) <= vdiff:\n # return True\n\n # return False\n\n \n\n # sort them based on values and keep indicies for each value\n # they will already be sotred secondarily by indicies\n # keep sliding window\n # keep opening up the window until I reach the max value \n # if i reach max value and no smaller value is found\n # i shrink the window up to the end and start over\n\n buckets = {} #store values for diapason (i-indexDiff:i]\n valueDiff +=1 #if valueDiff = zero it's simplify proces edge-cases\n \n for idx, curVal in enumerate(nums):\n bucketId = curVal // valueDiff #bucket for new element\n if bucketId in buckets: return True # have 'duplicate value' in current bucket\n #check neighboring buckets if they are exists\n for i in (bucketId - 1, bucketId + 1):\n if i in buckets: # bucket exist\n if abs(buckets[i] - curVal) < valueDiff: # because valueDiff+1 then check only strict <\n return True\n \n #add current value to bucket\n buckets[bucketId] = curVal\n \n # remove value out of available window\n if idx >= indexDiff:\n removeVal = nums[idx - indexDiff]\n del buckets[removeVal//valueDiff]\n\n return False\n","runtime":"785"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\n if t < 0: return False # edge case \n \n seen = {}\n for i, x in enumerate(nums): \n bkt = x//(t+1)\n if bkt in seen and i - seen[bkt][0] <= k: return True \n if bkt-1 in seen and i - seen[bkt-1][0] <= k and abs(x - seen[bkt-1][1]) <= t: return True \n if bkt+1 in seen and i - seen[bkt+1][0] <= k and abs(x - seen[bkt+1][1]) <= t: return True \n seen[bkt] = (i, x) \n return False ","runtime":"825"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n buckets = {}\n for i, num in enumerate(nums):\n bucket = num // max(1, valueDiff)\n if bucket in buckets:\n return True\n if bucket-1 in buckets:\n potentialDuplicate = buckets[bucket-1]\n if abs(potentialDuplicate-num) <= valueDiff:\n return True\n if bucket+1 in buckets:\n potentialDuplicate = buckets[bucket+1]\n if abs(potentialDuplicate-num) <= valueDiff:\n return True\n if len(buckets) == indexDiff:\n delBucket = nums[i-indexDiff] // max(1, valueDiff)\n del buckets[delBucket]\n buckets[bucket] = num\n return False","runtime":"825"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if indexDiff <= 0 or valueDiff < 0:\n return False\n\n seen = {}\n\n for i, num in enumerate(nums):\n bucket = num // (valueDiff + 1)\n \n if bucket in seen:\n return True\n if bucket - 1 in seen and abs(num - seen[bucket - 1]) <= valueDiff:\n return True\n if bucket + 1 in seen and abs(num - seen[bucket + 1]) <= valueDiff:\n return True\n\n seen[bucket] = num\n\n if i >= indexDiff:\n del seen[nums[i - indexDiff] // (valueDiff + 1)]\n\n return False","runtime":"864"},{"code":"# from sortedcontainers import SortedList\n\n# class Solution:\n# def containsNearbyAlmostDuplicate(self, nums, k, t):\n# set_ = SortedList()\n# for i in range(len(nums)):\n# # Find the successor of current element\n# idx = set_.bisect_left(nums[i])\n# if idx != len(set_) and set_[idx] <= nums[i] + t:\n# return True\n\n# # Find the predecessor of current element\n# if idx > 0 and nums[i] <= set_[idx - 1] + t:\n# return True\n\n# set_.add(nums[i])\n# if len(set_) > k:\n# set_.remove(nums[i - k])\n\n# return False\n\nclass Solution:\n # Get the ID of the bucket from element value x and bucket width w\n # Division '/' in Python with '//' performs floor division, which is necessary for correct bucketing.\n def getID(self, x, w):\n return (\n x // w\n ) # Floor division to handle both positive and negative integers correctly\n\n def containsNearbyAlmostDuplicate(self, nums, k, t):\n if t < 0:\n return False\n buckets = {}\n w = t + 1 # Increment by 1 to handle the range correctly\n for i in range(len(nums)):\n bucket = self.getID(nums[i], w)\n # Check if current bucket is empty, each bucket may contain at most one element\n if bucket in buckets:\n return True\n # Check the neighbor buckets for almost duplicates\n if bucket - 1 in buckets and abs(nums[i] - buckets[bucket - 1]) < w:\n return True\n if bucket + 1 in buckets and abs(nums[i] - buckets[bucket + 1]) < w:\n return True\n # Now bucket is empty and no almost duplicates in neighbor buckets\n buckets[bucket] = nums[i]\n if i >= k:\n del buckets[self.getID(nums[i - k], w)]\n return False","runtime":"864"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n seen = {}\n for i, x in enumerate(nums): \n bkt = x//(valueDiff+1)\n if bkt in seen and i - seen[bkt][0] <= indexDiff: return True \n if bkt-1 in seen and i - seen[bkt-1][0] <= indexDiff and abs(x - seen[bkt-1][1]) <= valueDiff: return True \n if bkt+1 in seen and i - seen[bkt+1][0] <= indexDiff and abs(x - seen[bkt+1][1]) <= valueDiff: return True \n seen[bkt] = (i, x) \n return False \n\n\n","runtime":"904"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\n if valueDiff < 0:\n return False\n buckets = {}\n width = valueDiff + 1\n for i, num in enumerate(nums):\n bucket = num // width\n if bucket in buckets:\n return True\n buckets[bucket] = num\n if (bucket - 1) in buckets and abs(num - buckets[bucket - 1]) <= valueDiff:\n return True\n if (bucket + 1) in buckets and abs(num - buckets[bucket + 1]) <= valueDiff:\n return True\n if i >= indexDiff:\n del buckets[nums[i - indexDiff] // width]\n return False","runtime":"904"},{"code":"class Solution:\n def binary_search(self, target: int, sorted_integers: list[int] | tuple[int]):\n if not sorted_integers:\n return 0\n\n back_idx, front_idx = 0, len(sorted_integers) - 1\n while back_idx <= front_idx:\n mid_idx = (back_idx + front_idx) // 2\n if sorted_integers[mid_idx] < target:\n back_idx = mid_idx + 1\n continue\n front_idx = mid_idx - 1\n\n return back_idx # Number of ints < target, implying insertion idx.\n\n def containsNearbyAlmostDuplicate(self, nums: List[int], index_diff: int, value_diff: int) -> bool:\n # Sort for binary insertion.\n window_ints = sorted(nums[: index_diff + 1]) # Window of ints within idx difference.\n for i in range(len(window_ints) - 1):\n if window_ints[i + 1] - window_ints[i] <= value_diff:\n return True\n\n back_idx, front_idx = 1, 1 + index_diff\n while True:\n if front_idx >= len(nums): # Search reaches the end.\n return False\n\n pop_idx = self.binary_search(nums[back_idx - 1], window_ints)\n window_ints.pop(pop_idx) # Window's 1st int is out.\n \n newcomer = nums[front_idx] # The int that is joining window.\n insertion_idx = self.binary_search(newcomer, window_ints)\n\n if insertion_idx == 0: # Newcomer < all window ints.\n if window_ints[0] - newcomer <= value_diff:\n return True\n\n elif insertion_idx == len(window_ints): # Newcomer > all window ints.\n if newcomer - window_ints[-1] <= value_diff:\n return True\n\n else:\n if min(newcomer - window_ints[insertion_idx - 1], window_ints[insertion_idx] - newcomer) <= value_diff:\n return True\n\n window_ints.insert(insertion_idx, newcomer)\n back_idx += 1\n front_idx += 1\n","runtime":"944"},{"code":"class Solution:\n # Keys: \n # - each bucket will contain a number wihin valueDiff range\n # - must check adjacent buckets as well in case current value on edge\n\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n \"\"\"\n Time: O(n)\n Space: O(k) , where k is indexDiff (max buckets)\n \"\"\"\n buckets: dict[int,int] = dict()\n\n def contains(bucket_id: int, num: int) -> bool:\n if bucket_id not in buckets:\n return False\n return abs(buckets[bucket_id] - num) < (valueDiff + 1)\n\n def get_bucket_id(num: int) -> int:\n return num // (valueDiff + 1)\n\n for i, num in enumerate(nums):\n bucket_id = get_bucket_id(num)\n # print(f\"IN\\t{i=} {num=} {bucket_id=} {buckets=}\")\n\n # check for collision\n if bucket_id in buckets:\n return True\n elif contains(bucket_id - 1, num) or contains(bucket_id + 1, num):\n return True\n\n # insert\n buckets[bucket_id] = num\n\n # evict bc would have collided already\n if i >= indexDiff:\n evict_bucket_id = get_bucket_id(nums[i - indexDiff])\n del buckets[evict_bucket_id]\n return False\n\n\n def soln_containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n buckets: dict = dict()\n value_diff = valueDiff + 1\n\n def in_bucket(bucket_id) -> bool:\n return (\n (bucket_id in buckets) \n and abs(buckets[bucket_id] - num) < value_diff\n )\n\n for i, num in enumerate(nums):\n bucket_id = num // value_diff\n print(f\"IN\\t{i=} {num=} {bucket_id=} {buckets=}\")\n if bucket_id in buckets:\n print(f\"\\tdirect hit!\")\n return True\n elif in_bucket(bucket_id - 1) or in_bucket(bucket_id + 1):\n print(f\"\\tINdirect hit! with {value_diff=}\")\n return True\n\n buckets[bucket_id] = num\n\n if i >= indexDiff:\n num = nums[i - indexDiff]\n del buckets[num // value_diff]\n print(f\"OUT\\t{i=} {num=} {bucket_id=} {buckets=}\")\n\n return False\n","runtime":"944"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\n if valueDiff < 0:\n return False\n nums_dict = {}\n for i in range(len(nums)):\n bucket = nums[i] // (valueDiff + 1)\n if bucket in nums_dict:\n return True\n if bucket - 1 in nums_dict and abs(nums[i] - nums_dict[bucket - 1]) <= valueDiff:\n return True\n if bucket + 1 in nums_dict and abs(nums[i] - nums_dict[bucket + 1]) <= valueDiff:\n return True\n nums_dict[bucket] = nums[i]\n if i >= indexDiff:\n del nums_dict[nums[i - indexDiff] // (valueDiff + 1)]\n return False","runtime":"984"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n \n window = [] # This will store the last 'indexDiff' elements in sorted order\n\n for i, num in enumerate(nums):\n # Find the position where (num - valueDiff) would be inserted\n left = bisect.bisect_left(window, num - valueDiff)\n\n # Check if there's any number in window within [num - valueDiff, num + valueDiff]\n if left < len(window) and window[left] <= num + valueDiff:\n return True # Valid pair found\n\n # Insert current number into the sorted window\n bisect.insort_left(window, num)\n\n # If window size exceeds indexDiff, remove the oldest element to maintain the window size\n if i >= indexDiff:\n # Remove nums[i - indexDiff] from the window\n remove_num = nums[i - indexDiff]\n remove_pos = bisect.bisect_left(window, remove_num)\n window.pop(remove_pos)\n\n return False # No valid pair found\n","runtime":"984"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n \n if valueDiff < 0: return False \n \n memo = {}\n for i, x in enumerate(nums): \n index = x // (valueDiff + 1)\n print(index)\n if index in memo and i - memo[index][0] <= indexDiff: \n return True \n if index-1 in memo and i - memo[index-1][0] <= indexDiff and abs(x - memo[index-1][1]) <= valueDiff: \n return True \n if index + 1 in memo and i - memo[index+1][0] <= indexDiff and abs(x - memo[index+1][1]) <= valueDiff: \n return True \n memo[index] = (i, x) \n\n return False \n \n \n ","runtime":"1023"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n k,t = indexDiff, valueDiff\n d = defaultdict(list)\n for i, n in enumerate(nums): d[n].append(i)\n \n keys = sorted(d.keys())\n i, j = 0, 0\n while i < len(keys): \n x, y = d[keys[i]], d[keys[j]]\n \n if i == j:\n for index in range(len(x)-1):\n if x[index + 1] - x[index] <= k: return True\n j += 1\n elif keys[j] - keys[i] <= t:\n # z = self.mergeSorted(x, y)\n z = sorted(x + y)\n for index in range(len(z)-1):\n if z[index + 1] - z[index] <= k: return True\n j += 1\n else:\n i = j = i + 1\n \n if j >= len(keys): i = j = i + 1\n \n return False\n\n # seen = {}\n # for i,n in enumerate(nums):\n # bkt = n//(valueDiff+1)\n # if bkt in seen and i - seen[bkt][0] <= indexDiff: return True\n # if bkt+1 in seen and abs(n - seen[bkt+1][1]) <= valueDiff and i - seen[bkt+1][0] <= indexDiff: return True\n # if bkt-1 in seen and abs(n - seen[bkt-1][1]) <= valueDiff and i - seen[bkt-1][0] <= indexDiff: return True\n # seen[bkt] = (i,n)\n # return False","runtime":"1023"},{"code":"from sortedcontainers import SortedList\nfrom collections import defaultdict\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n bucket_size = valueDiff\n if valueDiff == 0:\n bucket_size = 1\n\n buckets = defaultdict(set)\n size = 0\n\n for i in range(len(nums)):\n num = nums[i]\n\n index = num // bucket_size\n if buckets[index]:\n return True\n\n if buckets[index-1]:\n for candidate in buckets[index-1]:\n if abs(candidate - num) <= valueDiff:\n return True\n\n if buckets[index+1]:\n for candidate in buckets[index+1]:\n if abs(candidate - num) <= valueDiff:\n return True\n\n buckets[index].add(num)\n if size < indexDiff:\n size += 1\n else:\n to_remove = nums[i - indexDiff]\n to_remove_index = to_remove // bucket_size\n buckets[to_remove_index].remove(to_remove)\n\n return False","runtime":"1063"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # sliding window + sortedset, O(nlogn)\n k = indexDiff + 1\n window = SortedList()\n for i in range(len(nums)):\n # 1. remove old\n if i - k >= 0:\n window.remove(nums[i - k])\n \n # 2. check if any value lies in [nums[i] - valueDiff, nums[i] + valueDiff]\n p, q = nums[i] - valueDiff, nums[i] + valueDiff\n if valueDiff == 0 and nums[i] in window: # 如果p或q直接在window裡面\n return True\n # find the insert position for p and q, 如果不同代表有一個值在p和q之間\n if valueDiff != 0 and window.bisect_left(p) != window.bisect_right(q):\n return True\n # 3. add new\n window.add(nums[i])\n \n return False","runtime":"1063"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n from sortedcontainers import SortedList\n if indexDiff < 1 or valueDiff < 0:\n return False\n \n sorted_list = SortedList()\n \n for i, num in enumerate(nums):\n # Find the position where `num` could fit in the sorted list\n pos = sorted_list.bisect_left(num - valueDiff)\n \n # Check if there is an element in the sorted list that satisfies the valueDiff condition\n if pos < len(sorted_list) and abs(sorted_list[pos] - num) <= valueDiff:\n return True\n \n # Add the current number to the sorted list\n sorted_list.add(num)\n \n # Remove the number that is out of the window's range\n if i >= indexDiff:\n sorted_list.remove(nums[i - indexDiff])\n \n return False","runtime":"1103"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\n if indexDiff <= 0 or valueDiff < 0:\n return False\n \n sorted_list = SortedList()\n \n for i, num in enumerate(nums):\n # Binary search for the smallest number >= num - valueDiff\n pos = sorted_list.bisect_left(num - valueDiff)\n \n # Check if there's a number within valueDiff of num\n if pos < len(sorted_list) and abs(sorted_list[pos] - num) <= valueDiff:\n return True\n \n # Add the current number to the sorted list (sliding window)\n sorted_list.add(num)\n \n # If the window exceeds indexDiff, remove the oldest element\n if i >= indexDiff:\n sorted_list.remove(nums[i - indexDiff])\n \n return False\n\n# Example usage:\nsol = Solution()\nprint(sol.containsNearbyAlmostDuplicate([1, 2, 3, 1], 3, 0)) # Output: True\nprint(sol.containsNearbyAlmostDuplicate([1, 5, 9, 1, 5, 9], 2, 3)) # Output: False\n","runtime":"1103"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n N, L, R = list(enumerate(nums)), 0, 1\n N.sort(key=lambda x:(x[1],x[0])) \n def check(L, R):\n for l in range(L, R):\n for r in range(l+1, R+1):\n if N[r][1]-N[l][1]<=valueDiff and abs(N[r][0]-N[l][0])<=indexDiff:\n return True \n return False \n while L<R and R<len(N):\n if check(L, R): return True\n if N[R][1]-N[L][1]<valueDiff: R+=1\n else: L += 1\n if R<=L: R = L+1\n return False ","runtime":"1222"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n window_size = indexDiff + 1\n window = SortedList(nums[:window_size] + [float('-inf'), float('inf')])\n if any(v1 - v0 <= valueDiff for v0, v1 in itertools.pairwise(window)):\n return True\n for i in range(window_size, len(nums)):\n window.remove(nums[i - window_size])\n j = window.bisect_left(nums[i])\n window.add(nums[i])\n if window[j] - window[j - 1] <= valueDiff or window[j + 1] - window[j] <= valueDiff:\n return True\n return False\n \n\n \n","runtime":"1222"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if indexDiff <= 100:\n l = len(nums)\n for i in range(l):\n for j in range(i+1, min(l, i + indexDiff + 1)):\n if i != j and nums[i] - nums[j] <= valueDiff and nums[j] - nums[i] <= valueDiff:\n return True\n return False\n\n buckets = {}\n l = len(nums)\n for i in range(l):\n k = nums[i]\n if valueDiff != 0: k = int(nums[i] / valueDiff)\n if k in buckets.keys(): \n buckets[k].add((i, nums[i]))\n else:\n buckets[k] = set()\n buckets[k].add((i, nums[i]))\n\n for i in range(l):\n k = nums[i]\n if valueDiff != 0: k = int(nums[i] / valueDiff)\n for t in buckets[k]:\n if i - t[0] <= indexDiff and t[0] - i <= indexDiff and i - t[0] != 0:\n if nums[i] - t[1] <= valueDiff and t[1] - nums[i] <= valueDiff:\n print(i, nums[i], t[0], t[1])\n return True \n if (k-1) in buckets.keys():\n for t in buckets[k-1]:\n if i - t[0] <= indexDiff and t[0] - i <= indexDiff and i - t[0] != 0:\n if nums[i] - t[1] <= valueDiff and t[1] - nums[i] <= valueDiff:\n print(i, nums[i], t[0], t[1])\n return True \n if (k+1) in buckets.keys():\n for t in buckets[k+1]:\n if i - t[0] <= indexDiff and t[0] - i <= indexDiff and i - t[0] != 0:\n if nums[i] - t[1] <= valueDiff and t[1] - nums[i] <= valueDiff:\n print(i, nums[i], t[0], t[1])\n return True \n\n return False\n ","runtime":"1262"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n window = SortedList()\n \n for i, num in enumerate(nums):\n if i > indexDiff:\n window.remove(nums[i - indexDiff - 1])\n \n pos1 = window.bisect_left(num - valueDiff)\n pos2 = window.bisect_right(num + valueDiff)\n \n if pos1 != pos2 and pos1 != len(window):\n return True\n \n window.add(num)\n \n return False","runtime":"1262"},{"code":"from sortedcontainers import SortedList\nfrom typing import List\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if indexDiff <= 0 or valueDiff < 0:\n return False\n \n sorted_list = SortedList()\n \n for i in range(len(nums)):\n # Maintain a window of size indexDiff\n if i > indexDiff:\n sorted_list.remove(nums[i - indexDiff - 1])\n \n # Find the position where nums[i] - valueDiff would fit in the sorted list\n pos = sorted_list.bisect_left(nums[i] - valueDiff)\n \n # Check if there is a number in the sorted list within the range [nums[i] - valueDiff, nums[i] + valueDiff]\n if pos < len(sorted_list) and abs(sorted_list[pos] - nums[i]) <= valueDiff:\n return True\n \n # Add the current number to the sorted list\n sorted_list.add(nums[i])\n \n return False","runtime":"1301"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n '''\n \n '''\n lookup = defaultdict(list)\n for index, n in enumerate(nums):\n lookup[n].append(index)\n\n \n sl = sorted(list(set(nums)))\n r = 0\n\n\n for i in range(len(sl)):\n \n while r < len(sl) and abs(sl[r] - sl[i]) <= valueDiff:\n r += 1\n\n arr = []\n\n for j in range(i, r):\n for idx in lookup[sl[j]]:\n arr.append(idx)\n\n arr.sort()\n \n for j in range(1, len(arr)):\n if arr[j] - arr[j - 1] <= indexDiff:\n return True\n\n\n return False\n","runtime":"1301"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n from sortedcontainers import SortedList\n sl = SortedList()\n for i, num in enumerate(nums):\n if i>indexDiff:\n sl.remove(nums[i-indexDiff-1])\n l = sl.bisect_left(num-valueDiff)\n r = sl.bisect_right(num+valueDiff)\n if r>l:\n return True \n sl.add(num)\n return False\n ","runtime":"1341"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\n if not nums or indexDiff <= 0 or valueDiff < 0:\n return False\n \n sorted_list = SortedList()\n \n for i, num in enumerate(nums):\n # Find the position where the current num could be inserted.\n pos = sorted_list.bisect_left(num)\n \n # Check the left neighbor.\n if pos > 0 and num - sorted_list[pos - 1] <= valueDiff:\n return True\n \n # Check the right neighbor.\n if pos < len(sorted_list) and sorted_list[pos] - num <= valueDiff:\n return True\n \n # Add the current number to the sorted list.\n sorted_list.add(num)\n \n # Remove the number that is out of the indexDiff range.\n if i >= indexDiff:\n sorted_list.remove(nums[i - indexDiff])\n \n return False\n","runtime":"1341"},{"code":"from sortedcontainers import SortedList\nfrom typing import List\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n window = SortedList()\n for i in range(len(nums)):\n # Check if the current number is within the valueDiff from its neighbors\n pos = window.bisect_left(nums[i])\n \n # Check left neighbor\n if pos > 0 and nums[i] - window[pos - 1] <= valueDiff:\n return True\n \n # Check right neighbor\n if pos < len(window) and window[pos] - nums[i] <= valueDiff:\n return True\n \n # Add the current number to the sorted list\n window.add(nums[i])\n \n # Remove the number that's out of the indexDiff range\n if i >= indexDiff:\n window.remove(nums[i - indexDiff])\n \n return False\n \n \n return False","runtime":"1381"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n from sortedcontainers import SortedList\n n = len(nums)\n window = SortedList()\n \n left, right = 0, 0\n while right < n:\n pos = window.bisect_left(nums[right])\n if pos < len(window) and window[pos] - nums[right] <= valueDiff:\n return True\n if pos > 0 and nums[right] - window[pos - 1] <= valueDiff:\n return True\n \n window.add(nums[right])\n \n if right - left >= indexDiff:\n window.remove(nums[left])\n left += 1\n \n right += 1\n \n return False\n ","runtime":"1381"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n window = SortedList()\n\n for i in range(len(nums)):\n idx = window.bisect_left(nums[i])\n\n if idx != len(window) and abs(nums[i] - window[idx]) <= valueDiff:\n return True\n\n if idx > 0 and abs(nums[i] - window[idx - 1]) <= valueDiff:\n return True\n\n window.add(nums[i])\n\n if len(window) > indexDiff:\n window.remove(nums[i - indexDiff])\n\n return False","runtime":"1421"},{"code":"from sortedcontainers import SortedSet\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if indexDiff <= 0 or valueDiff < 0:\n return False\n \n window = SortedSet()\n for i, num in enumerate(nums):\n if i > indexDiff:\n window.remove(nums[i - indexDiff - 1])\n \n pos = window.bisect_left(num - valueDiff)\n if pos < len(window) and window[pos] <= num + valueDiff:\n return True\n \n window.add(num)\n \n return False","runtime":"1421"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n bst = SortedList()\n for i, num in enumerate(nums):\n if i > 0:\n # find closest of num, if the closest <= valueDiff, return True\n ge = bst.bisect_right(num)\n if ge < len(bst) and abs(bst[ge] - num) <= valueDiff:\n return True\n le = bst.bisect_right(num) - 1\n if le >= 0 and abs(bst[le] - num) <= valueDiff:\n return True\n \n bst.add(num)\n if i >= indexDiff:\n bst.remove(nums[i-indexDiff])\n return False\n ","runtime":"1460"},{"code":"from sortedcontainers import SortedDict\nfrom typing import List\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n d = SortedDict() # Use 'd' as a sorted dictionary to store indices\n k = indexDiff\n v = valueDiff\n \n for i in range(len(nums)):\n # Find the range of potential candidates in the sorted dictionary\n lower_bound = nums[i] - v\n upper_bound = nums[i] + v\n \n # Check if there are any keys within this range\n for key in d.irange(lower_bound, upper_bound):\n if (i - d[key]) <= k:\n return True\n \n # Update the dictionary with the current number and its index\n d[nums[i]] = i\n \n # Remove elements that are out of the indexDiff range\n if i >= k:\n del d[nums[i - k]]\n \n return False","runtime":"1460"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if indexDiff <= 0 or valueDiff < 0:\n return False\n \n sl = SortedList(nums[1: 1 + indexDiff]) # Initialize sliding window\n \n for j in range(len(nums) - 1):\n i = sl.bisect_right(nums[j]) # Find position to insert nums[j] in sorted order\n \n # Check if nums[j] and closest values in sl satisfy valueDiff condition\n if i < len(sl) and sl[i] - nums[j] <= valueDiff:\n return True\n if i > 0 and nums[j] - sl[i - 1] <= valueDiff:\n return True\n \n # Slide the window: remove the old element and add a new one\n sl.remove(nums[j + 1]) # Remove the outgoing element from the window\n if j + 1 + indexDiff < len(nums):\n sl.add(nums[j + 1 + indexDiff]) # Add the new element into the window\n \n return False\n","runtime":"1500"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\n from sortedcontainers import SortedSet\n if not nums or t < 0: return False # Handle special cases\n ss, n = SortedSet(), 0 # Create SortedSet. `n` is the size of sortedset, max value of `n` is `k` from input\n for i, num in enumerate(nums):\n ceiling_idx = ss.bisect_left(num) # index whose value is greater than or equal to `num`\n floor_idx = ceiling_idx - 1 # index whose value is smaller than `num`\n if ceiling_idx < n and abs(ss[ceiling_idx]-num) <= t: return True # check right neighbour \n if 0 <= floor_idx and abs(ss[floor_idx]-num) <= t: return True # check left neighbour\n ss.add(num)\n n += 1\n if i - k >= 0: # maintain the size of sortedset by finding & removing the earliest number in sortedset\n ss.remove(nums[i-k])\n n -= 1\n return False","runtime":"1500"},{"code":"from sortedcontainers import SortedList\n\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n w = SortedList()\n \n for i in range(len(nums)):\n if i > indexDiff:\n w.remove(nums[i - indexDiff - 1])\n num = nums[i]\n\n j = w.bisect_left(num)\n if j < len(w) and abs(num - w[j]) <= valueDiff:\n return True\n if j > 0 and abs(num - w[j - 1]) <= valueDiff:\n return True\n w.add(num)\n return False","runtime":"1540"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if indexDiff <= 0 or valueDiff < 0:\n return False\n sorted_window = SortedList()\n for i in range(len(nums)):\n if i > indexDiff:\n sorted_window.remove(nums[i - indexDiff - 1])\n pos = sorted_window.bisect_left(nums[i])\n if pos > 0 and abs(nums[i] - sorted_window[pos - 1]) <= valueDiff:\n return True\n if pos < len(sorted_window) and abs(nums[i] - sorted_window[pos]) <= valueDiff:\n return True\n sorted_window.add(nums[i])\n return False","runtime":"1540"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: list[int], indexDiff: int, valueDiff: int) -> bool:\n if indexDiff <= 0 or valueDiff < 0:\n return False\n sorted_list = SortedList()\n for i, num in enumerate(nums):\n if i > indexDiff:\n sorted_list.remove(nums[i - indexDiff - 1])\n pos = sorted_list.bisect_left(num)\n if pos < len(sorted_list) and sorted_list[pos] <= num + valueDiff:\n return True\n if pos > 0 and sorted_list[pos - 1] >= num - valueDiff:\n return True\n sorted_list.add(num)\n return False","runtime":"1580"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if indexDiff <= 0 or valueDiff < 0:\n return False\n \n sorted_window = SortedList()\n \n for i, num in enumerate(nums):\n # Maintain a sliding window of at most indexDiff elements\n if i > indexDiff:\n sorted_window.remove(nums[i - indexDiff - 1])\n \n # Find the position where current num would fit in the sorted window\n pos = SortedList.bisect_left(sorted_window, num)\n \n # Check if the left neighbor (if exists) is within valueDiff\n if pos > 0 and abs(num - sorted_window[pos - 1]) <= valueDiff:\n return True\n \n # Check if the right neighbor (if exists) is within valueDiff\n if pos < len(sorted_window) and abs(num - sorted_window[pos]) <= valueDiff:\n return True\n \n # Add current number to the sorted window\n sorted_window.add(num)\n \n return False","runtime":"1580"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\n \n balanced_bst = SortedList([])\n \n for i, n in enumerate(nums):\n \n indx = balanced_bst.bisect_right(n)\n \n le_indx = indx-1\n ge_indx = indx\n \n if le_indx >= 0 and abs(n-balanced_bst[le_indx]) <= t:\n return True\n if ge_indx < len(balanced_bst) and abs(balanced_bst[ge_indx]-n) <= t:\n return True\n \n balanced_bst.add(n)\n \n if len(balanced_bst) > k:\n balanced_bst.remove(nums[i-k])\n \n return False\n \n \n \n \n ","runtime":"1619"},{"code":"from sortedcontainers import SortedList\n\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums, k, t):\n set_ = SortedList()\n for i in range(len(nums)):\n # Find the successor of current element\n idx = set_.bisect_left(nums[i])\n if idx != len(set_) and set_[idx] <= nums[i] + t:\n return True\n\n # Find the predecessor of current element\n if idx > 0 and nums[i] <= set_[idx - 1] + t:\n return True\n\n set_.add(nums[i])\n if len(set_) > k:\n set_.remove(nums[i - k])\n\n return False","runtime":"1619"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n section = nums[0:indexDiff]\n section.sort()\n prev = 0\n for i in range(0, len(section)-1, 1):\n if section[i+1] - section[i] <= valueDiff:\n return True\n for i in nums[indexDiff:]:\n index = bisect_right(section, i)\n section.insert(index, i)\n if index > 0 and i - section[index-1] <= valueDiff:\n return True\n if index < len(section) -1 and section[index+1] - i <= valueDiff:\n return True\n section.remove(nums[prev])\n prev += 1\n return False\n ","runtime":"1659"},{"code":"from sortedcontainers import SortedList\nfrom typing import List\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # Initially building the window \n window = SortedList()\n for i in range(len(nums)):\n find_index = window.bisect_left(nums[i])\n greater_eq = float(\"inf\") if (find_index >= len(window) or find_index < 0) else window[find_index]\n less = -float(\"inf\") if (find_index-1 < 0 or find_index-1 >= len(window)) else window[find_index-1]\n if((greater_eq - nums[i] <= valueDiff) or (nums[i] - less <= valueDiff)):\n return True\n window.add(nums[i])\n if(i >= indexDiff):\n window.remove(nums[i-indexDiff])\n return False\n","runtime":"1659"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n section = nums[0:indexDiff]\n section.sort()\n prev = 0\n for i in range(0, len(section)-1, 1):\n if section[i+1] - section[i] <= valueDiff:\n return True\n for i in nums[indexDiff:]:\n index = bisect_right(section, i)\n section.insert(index, i)\n if index > 0 and i - section[index-1] <= valueDiff:\n return True\n if index < len(section) -1 and section[index+1] - i <= valueDiff:\n return True\n section.remove(nums[prev])\n prev += 1\n return False\n ","runtime":"1699"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: list[int], index_diff: int, value_diff: int) -> bool:\n indexes = SortedList([])\n index_values = sorted(enumerate(nums), key=lambda num: num[1])\n ptr = 0\n for index, value in index_values:\n while len(indexes) > 0 and value - index_values[ptr][1] > value_diff:\n indexes.remove(index_values[ptr][0])\n ptr += 1\n closest_index = indexes.bisect_left(index)\n for index_i in [closest_index, closest_index - 1]:\n if 0 <= index_i < len(indexes) and abs(indexes[index_i] - index) <= index_diff:\n return True\n indexes.add(index)\n return False\n\n ","runtime":"1699"},{"code":"import sortedcontainers\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\n \n def floor(n, bst):\n le = bst.bisect_right(n) - 1\n return bst[le] if le >= 0 else None\n \n def ceiling(n, bst):\n ge = bst.bisect_right(n)\n return bst[ge] if ge < len(bst) else None\n \n bst = sortedcontainers.SortedList()\n for i, n in enumerate(nums):\n le = floor(n, bst)\n if le is not None and n <= le + t:\n return True\n ge = ceiling(n, bst)\n if ge is not None and ge <= n + t:\n return True\n bst.add(n)\n if len(bst) > k:\n bst.remove(nums[i-k])\n return False\n # time: O(nlogk)\n # space: O(k)","runtime":"1739"},{"code":"from sortedcontainers import SortedList\nfrom collections import deque\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # at different indices\n # they are at least as close as indexDiff\n # the difference between them is less than valdiff\n \n # keep track of the last occurenve of every number -> use this for index diff\n # we want an easy way to keep track of valuediff\n # maybe we can get something where the value\n\n bst = SortedList([nums[0]])\n bst_length = 1\n for i in range(1, len(nums)):\n if i > indexDiff:\n bst.remove(nums[i-indexDiff-1])\n bst_length -= 1\n\n num = nums[i]\n\n if bst.count(num) > 0:\n return True\n\n # left and right will be the same because its where it should get inserted, \n\n # print()\n # print(bst)\n\n closest_num_index_right = bst.bisect_left(num) # the number after the current num\n closest_num_index_left = closest_num_index_right - 1 # the number before the current num\n\n closest_num_index_right = min(bst_length - 1, closest_num_index_right) # make sure the number after the current num is in bounds\n\n \n # print(num, left_index, right_index)\n \n if min(abs(num - bst[closest_num_index_right]), abs(num - bst[closest_num_index_left])) <= valueDiff:\n return True\n\n bst.add(num)\n bst_length += 1\n \n return False\n\n # O(n log indexdiff/n) \n\n # only keep track of numbers that are in valid indexdiff through a deque.\n # maintain a set as well for membership -> remove and add from set based on deque------------------\n # linear -> going accross every num\n\n # maintain a sorted array of them. \n \n # have buckets of size valueDiff from 0 to max(nums)\n\n # Do binary search on the sorted array to find the closest number -> see if its valid on valuediff\n # maintain a binary search tree -> the deque points to it so when we want to remove from deque we remove from binary search tree?\n # -> may be kinda hard to maintain ->\n \n \n #BAD IDEAS\n # figure out if there is a valid number in valdiff in logn time -> insertion sort -> O(indexDiff) time # no good really because not insertiona and delpetions are not sorted\n # or do insertions with binary search. -> data structure wont really like that though, maybe used linked list in optimized version\n\n \n","runtime":"1739"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # In the last k numbers, is there a number such that it is within valueDiff of me?\n from sortedcontainers import SortedList\n # sortedlist?\n sl = SortedList()\n for i, x in enumerate(nums):\n closest = sl.bisect_left(x)\n for d in range(-1,2):\n idx = closest + d\n if 0 <= idx < len(sl):\n if abs(sl[idx] - x) <= valueDiff:\n return True\n sl.add(x)\n if i >= indexDiff:\n sl.remove(nums[i - indexDiff])\n return False \n\n\n","runtime":"1778"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n cap = indexDiff + 1\n bst = BST()\n for i in range(len(nums)):\n if bst.size() == cap:\n bst.remove(nums[i-cap])\n bst.add(nums[i])\n for n in bst.neighbors(nums[i]):\n if abs(nums[i] - n) <= valueDiff:\n # print(\"i: {}, nums[i]: {}, neighbor: {}\".format(i, nums[i], n))\n return True\n return False\n\nclass BST:\n def __init__(self):\n self.data = []\n\n def size(self):\n return len(self.data)\n\n def add(self, x):\n i = self.index(x)\n self.data.insert(i, x)\n\n def remove(self, x):\n i = self.index(x)\n del self.data[i]\n\n def index(self, x):\n if len(self.data) == 0:\n return 0\n \n left = 0\n right = len(self.data)-1\n while left != right:\n i = (left + right) // 2\n if x == self.data[i]:\n return i\n elif x > self.data[i]:\n left = i+1\n else:\n right = i\n if left == len(self.data)-1 and x > self.data[-1]:\n return len(self.data)\n return left\n\n def neighbors(self, x):\n i = self.index(x)\n ret = []\n if i > 0:\n ret += [self.data[i-1 ]]\n if i < len(self.data) - 1:\n ret += [self.data[i+1]]\n return ret","runtime":"1778"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n sl = SortedList()\n n = len(nums)\n for i in range(n):\n if (i - indexDiff > 0):\n sl.remove(nums[i - indexDiff - 1])\n \n sl.add(nums[i])\n if (i == 0):\n continue\n v = nums[i]\n index_sl = sl.bisect_left(v)\n \n diff = valueDiff + 1\n if (index_sl > 0):\n diff = min(diff, v - sl[index_sl - 1])\n if (index_sl < len(sl) - 1):\n diff = min(diff, sl[index_sl + 1] - v)\n\n if (diff <= valueDiff):\n return True\n\n return False\n\n ","runtime":"1818"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool: \n if len(nums)<=1:\n return False\n from sortedcontainers import SortedSet\n hashset = SortedSet()\n for i in range(len(nums)):\n if nums[i] in hashset:\n print('nums[i] in hashset',i,nums[i])\n return True\n hashset.add(nums[i])\n index = hashset.index(nums[i])\n #print(index,hashset)\n if index<len(hashset)-1:\n \n if (hashset[index+1]-nums[i]) <=valueDiff:\n return True\n if index>0: \n if (nums[i]-hashset[index-1]) <= valueDiff:\n return True\n if len(hashset)>indexDiff:\n hashset.remove(nums[i-indexDiff])\n return False","runtime":"1818"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n obs = Sort()\n for li, ri in LengthBoundSlidingWindow(nums, 0, indexDiff + 1, obs).run():\n i = obs.elements.bisect_left(nums[ri])\n if i + 1 < len(obs.elements) and abs(obs.elements[i + 1] - nums[ri]) <= valueDiff:\n return True\n if i > 0 and abs(obs.elements[i - 1] - nums[ri]) <= valueDiff:\n return True\n return False\n\n\nfrom collections.abc import Sequence\n\n\nclass SlidingWindow:\n \"\"\"Represents a sliding window algorithm framework.\n\n This class provides a structure for implementing sliding window algorithms.\n Concrete implementations should inherit from this class and override the\n should_contract_left() and is_window_good() methods.\n \"\"\"\n\n class Observer:\n\n def init(self, sequence: Sequence):\n self.seq = sequence\n\n def start_run(self, _range):\n ...\n\n def finish_run(self):\n ...\n\n def enter_cell(self, right_idx: int):\n ...\n\n def exit_cell(self, left_idx: int):\n ...\n\n def __init__(self, sequence: Sequence, observer=None):\n self.seq = sequence\n self.observer = observer if observer is not None else self.Observer()\n self.observer.init(sequence)\n\n def should_contract_left(self, left_idx: int, right_idx: int) -> bool:\n raise NotImplementedError()\n\n def is_window_good(self, left_idx: int, right_idx: int) -> bool:\n raise NotImplementedError()\n\n def run(self, _range=None):\n _range = _range if _range is not None else range(len(self.seq))\n self.observer.start_run(_range)\n li = _range.start\n for ri in _range:\n self.observer.enter_cell(ri)\n while li <= ri and self.should_contract_left(li, ri):\n step = self.observer.exit_cell(li)\n li += step if step else _range.step\n if li <= ri and self.is_window_good(li, ri):\n yield li, ri\n self.observer.finish_run()\n\n\nclass LengthBoundSlidingWindow(SlidingWindow):\n\n def __init__(self, sequence, min_len: int, max_len: int, observer=None):\n super().__init__(sequence, observer)\n self.min_len = min_len\n self.max_len = max_len\n\n def should_contract_left(self, li: int, ri: int) -> bool:\n return ri - li + 1 > self.max_len\n\n def is_window_good(self, li: int, ri: int) -> bool:\n return self.min_len <= ri - li + 1 <= self.max_len\n\n\nclass AggregateBoundSlidingWindow(SlidingWindow):\n\n def __init__(self, sequence, min_value, max_value, observer=None):\n super().__init__(sequence, observer)\n self.min_value = min_value\n self.max_value = max_value\n\n def should_contract_left(self, li: int, ri: int) -> bool:\n return self.observer.aggregate() > self.max_value\n\n def is_window_good(self, li: int, ri: int) -> bool:\n return self.min_value <= self.observer.aggregate() <= self.max_value\n\n\nclass Count(SlidingWindow.Observer):\n\n def __init__(self):\n from collections import Counter\n self.counter = Counter()\n\n def start_run(self, _range):\n self.counter.clear()\n\n def enter_cell(self, ri):\n self.counter[self.seq[ri]] += 1\n\n def exit_cell(self, li):\n val = self.seq[li]\n self.counter[val] -= 1\n if self.counter[val] == 0:\n del self.counter[val]\n\n\nclass Min(SlidingWindow.Observer):\n\n def __init__(self, _range):\n from collections import deque\n self._queue = deque()\n\n def start_run(self, _range):\n self._queue.clear()\n\n def enter_cell(self, ri: int):\n while self._queue and self.seq[self._queue[-1]] > self.seq[ri]:\n self._queue.pop()\n self._queue.append(ri)\n\n def exit_cell(self, li: int):\n while self._queue and self._queue[0] <= li:\n self._queue.popleft()\n\n def min(self):\n return self.seq[self.min_idx()]\n\n def min_idx(self):\n assert self._queue\n return self._queue[0]\n\n\nclass Sort(SlidingWindow.Observer):\n\n def __init__(self):\n from sortedcontainers import SortedList\n self.elements = SortedList()\n\n def start_run(self, _range):\n self.elements.clear()\n\n def enter_cell(self, ri: int):\n self.elements.add(self.seq[ri])\n\n def exit_cell(self, li: int):\n self.elements.remove(self.seq[li])\n\n\nclass Sum(SlidingWindow.Observer):\n\n def __init__(self):\n self.sum = 0\n\n def start_run(self, _range):\n self.sum = 0\n\n def enter_cell(self, ri: int):\n self.sum += self.seq[ri]\n\n def exit_cell(self, li: int):\n self.sum -= self.seq[li]\n\n def aggregate(self):\n return self.sum","runtime":"1858"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n n = len(nums)\n left, right = 0, 0\n ls = []\n while right < len(nums):\n rnum = nums[right]\n idx = bisect_left(ls, rnum)\n if idx < len(ls) and abs(ls[idx] - rnum) <= valueDiff:\n # print('a', abs(pnum - rnum))\n return True\n if idx - 1 >= 0 and abs(ls[idx - 1] - rnum) <= valueDiff:\n # print('b', abs(nnum - rnum))\n return True\n\n insort(ls, rnum)\n right += 1\n \n if right - left > indexDiff:\n lnum = nums[left]\n ls.remove(lnum)\n left += 1\n return False","runtime":"1858"},{"code":"class Solution:\n def getLowerHigher(self, nums, val):\n id = bisect.bisect_left(nums, val)\n lower, higher = None, None\n if id-1>=0:\n lower = nums[id-1]\n if id<len(nums):\n higher = nums[id]\n return lower, higher, id\n\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # maintain a sorted_list of size k\n sorted_list = []\n for i in range(len(nums)):\n lower, higher, id = self.getLowerHigher(sorted_list, nums[i])\n if lower is not None and nums[i]-lower<=valueDiff:\n return True\n if higher is not None and higher-nums[i]<=valueDiff:\n return True\n \n sorted_list.insert(id, nums[i])\n if len(sorted_list)>indexDiff:\n sorted_list.remove(nums[i-indexDiff])\n return False\n\n ","runtime":"1897"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n \n if indexDiff<=0 or valueDiff<0: return False\n window = []\n for i, num in enumerate(nums):\n # Find the smallest number greater than or equal to num\n pos = self.binary_search(window, num)\n if window:\n \n if pos<len(window) and abs(window[pos] - num) <= valueDiff: return True\n\n if pos > 0 and abs(window[pos-1] - num) <= valueDiff: return True\n \n # Insert the current number into the window\n window.insert(pos, num)\n \n # Maintain the window size as indexDiff\n if i >= indexDiff:\n window.remove(nums[i - indexDiff])\n \n return False\n def binary_search(self, arr, target):\n # This method returns the index where target should be inserted to keep the list sorted\n left, right = 0, len(arr)\n while left<right:\n mid=(left + right) // 2\n if arr[mid]<target:\n left=mid+1\n else:\n right = mid\n return left","runtime":"1897"},{"code":"class TreeNode:\n def __init__(self, val: int) -> None:\n self.val = val\n self.left = None\n self.right = None\n \n\ndef remove_node(node: TreeNode) -> Optional[TreeNode]:\n if not node:\n return\n\n if not node.left and not node.right:\n return\n\n if node.left and not node.right:\n return node.left\n\n if not node.left and node.right:\n return node.right\n \n # both nodes\n next_node = node.right\n prev_node = None\n while True:\n if next_node.left:\n prev_node = next_node\n next_node = next_node.left\n else:\n break\n \n node.val = next_node.val\n if not prev_node:\n node.right = next_node.right\n else:\n prev_node.left = next_node.right\n \n return node\n \n\nclass BST:\n # Надо искать сразу diff в дереве\n def __init__(self):\n self.root = None\n \n def insert(self, val: int) -> None:\n if not self.root:\n self.root = TreeNode(val)\n return\n \n node = self.root\n while node:\n if val < node.val:\n if node.left:\n node = node.left\n else:\n node.left = TreeNode(val)\n return\n else:\n if node.right:\n node = node.right\n else:\n node.right = TreeNode(val)\n return\n \n def create_from_sorted(self, arr: list) -> None:\n self.root = TreeNode(arr[0])\n node = self.root\n \n arr = arr[1:]\n for n in arr:\n node.right = TreeNode(n)\n node = node.right\n \n def remove(self, val: int) -> None: \n if self.root.val == val:\n self.root = remove_node(self.root)\n return\n \n node = self.root\n while node:\n if node.left and val < node.val:\n if node.left.val == val:\n node.left = remove_node(node.left)\n return\n else:\n node = node.left\n \n elif node.right and val > node.val:\n if node.right.val == val:\n node.right = remove_node(node.right)\n return\n else:\n node = node.right\n \n else:\n print(f\"DELETE ERROR {val = } {node.val = }\")\n return\n \n def has_diff(self, val: int, diff: int) -> bool:\n node = self.root\n while node:\n d = node.val - val\n if abs(d) <= diff:\n return True\n \n if d < 0:\n node = node.right\n else:\n node = node.left\n \n return False\n \n def find(self, val: int) -> bool:\n node = self.root\n \n while node:\n if node.val == val:\n return True\n \n if val < node.val:\n node = node.left\n else:\n node = node.right\n \n return False\n \n \n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n iters = len(nums) - indexDiff\n bst = BST()\n \n to_insert = nums[1:indexDiff + 1][:]\n random.shuffle(to_insert)\n \n # bst.create_from_sorted(sorted())\n for n in to_insert:\n bst.insert(n)\n \n if bst.has_diff(nums[0], valueDiff):\n return True\n \n iters = len(nums) - 1\n for i in range(1, iters):\n bst.remove(nums[i])\n \n if i + indexDiff < len(nums):\n bst.insert(nums[i + indexDiff])\n \n if bst.has_diff(nums[i], valueDiff):\n return True\n\n return False\n ","runtime":"1937"},{"code":"from sortedcontainers import SortedSet\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n s = SortedSet()\n window_count = defaultdict(int)\n left = 0\n\n for right in range(len(nums)):\n window_count[nums[right]] += 1\n s.add(nums[right])\n\n while right - left > indexDiff:\n # shrink window\n window_count[nums[left]] -= 1\n if window_count[nums[left]] == 0:\n s.discard(nums[left])\n left += 1\n \n # if curr elm in window, its a match\n if window_count[nums[right]] > 1:\n return True\n \n max_smallest = s.bisect_left(nums[right])\n if max_smallest != 0:\n if abs(nums[right] - s[max_smallest - 1]) <= valueDiff:\n return True\n \n min_largest = s.bisect_right(nums[right])\n if min_largest != len(s):\n if abs(nums[right] - s[min_largest]) <= valueDiff:\n return True\n \n return False\n\n\n ","runtime":"1937"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n SList = SortedList()\n for i in range(len(nums)):\n pos = SList.bisect_left(nums[i])\n print(pos, nums[i])\n if pos < len(SList) and SList[pos] - nums[i] <=valueDiff:\n return True\n if pos > 0 and nums[i] - SList[pos-1] <=valueDiff:\n return True\n SList.add(nums[i])\n if i + 1> indexDiff:\n print(\"op\", i, indexDiff, nums[i-indexDiff])\n SList.remove(nums[i-indexDiff])\n return False","runtime":"1977"},{"code":"from sortedcontainers import SortedSet\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n subset = SortedSet()\n for i, n in enumerate(nums):\n subset.add((n, i))\n pos = subset.bisect_left((n, i))\n j = pos + 1\n while j < len(subset):\n nn, ii = subset[j]\n if abs(ii - i) > indexDiff:\n subset.pop(j)\n else:\n if abs(nn - n) <= valueDiff:\n return True\n break\n j = pos - 1\n while j >= 0:\n nn, ii = subset[j]\n if abs(ii - i) > indexDiff:\n subset.pop(j)\n j -= 1\n else:\n if abs(nn - n) <= valueDiff:\n return True\n break\n return False\n \n \n \n ","runtime":"2017"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # sl = SortedList(nums[:indexDiff + 1])\n sl = SortedList()\n for val in nums[:indexDiff + 1]:\n if val in sl:\n return True\n sl.add(val)\n # if len(sl) < indexDiff + 1:\n # return True\n for i in range(len(sl) - 1):\n if i:\n if abs(sl[i - 1] - sl[i]) <= valueDiff:\n return True\n if i + 1 < len(sl):\n if abs(sl[i + 1] - sl[i]) <= valueDiff:\n return True\n \n for i in range(indexDiff + 1, len(nums)):\n ind = sl.bisect_left(nums[i - (indexDiff + 1)])\n sl.pop(ind)\n if nums[i] in sl:\n return True\n sl.add(nums[i])\n ind = sl.bisect_left(nums[i])\n if ind:\n if abs(sl[ind - 1] - sl[ind]) <= valueDiff:\n return True\n if ind + 1 < len(sl):\n if abs(sl[ind + 1] - sl[ind]) <= valueDiff:\n return True\n \n return False\n \n","runtime":"2056"},{"code":"class Solution:\n def update_sorted_arr_w_new_val(self, arr, val): \n if len(arr) == 1: \n left_val = right_val = arr[0]\n if val > arr[0]: \n arr.append(val)\n else: \n arr.insert(0, val)\n \n return left_val, right_val\n\n mid_idx = floor(len(arr) / 2)\n left_idx = 0 \n right_idx = len(arr) - 1 \n\n while left_idx <= right_idx: \n mid_idx = floor((left_idx + right_idx) / 2)\n if val > arr[mid_idx]: \n left_idx = mid_idx + 1\n else: \n right_idx = mid_idx - 1 \n #print(mid_idx)\n \n left_val = arr[min(left_idx, len(arr)-1)]\n right_val = arr[max(0, right_idx)]\n\n if left_idx > len(arr) - 1: \n arr.insert(len(arr), val)\n elif right_idx < 0: \n arr.insert(0, val)\n else:\n arr.insert(left_idx , val)\n\n return left_val, right_val\n\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n sorted_k_arr = []\n for idx, num in enumerate(nums): \n if idx == 0: \n sorted_k_arr.append(num) \n else: \n left_val, right_val = self.update_sorted_arr_w_new_val(sorted_k_arr, num)\n #print(sorted_k_arr, left_val, right_val)\n if len(sorted_k_arr) > indexDiff: \n sorted_k_arr.remove(nums[idx - indexDiff]) \n if abs(num - left_val) <= valueDiff or\\\n abs(num - right_val) <= valueDiff : \n return True \n\n return False \n\n ","runtime":"2096"},{"code":"# from collections import defaultdict\n\nclass Solution:\n def find(self, lst, idxDiff, valDiff):\n if len(lst) > 4:\n return True\n # lst.sort()\n for i in range(len(lst) - 1):\n j = i + 1\n while True:\n if lst[j][0] - lst[i][0] > idxDiff:\n break\n if abs(lst[i][1] - lst[j][1]) <= valDiff:\n return True\n j += 1\n if j >= len(lst):\n break\n return False\n\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n d = dict() #defaultdict(lambda: defaultdict(lambda: []))\n for i, x in enumerate(nums):\n omi = i // (indexDiff + 1)\n omx = x // (valueDiff + 1)\n \n\n for di in [0, 1]:\n for dx in [0, 1]:\n mi = omi + di\n mx = omx + dx\n k = (mi, mx)\n if k not in d:\n d[k] = []\n d[k].append((i, x))\n if len(d[k]) > 4:\n return True\n \n for v in d.values():\n if self.find(v, indexDiff, valueDiff):\n return True\n return False\n\n \n\n","runtime":"2136"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n\n def lowerBound(arr, num):\n ans = -1\n low = 0\n high = len(arr) - 1\n while low <= high:\n mid = (low + high) // 2\n if arr[mid] <= num:\n ans = mid\n low = mid + 1\n else:\n high = mid - 1\n return ans\n\n def upperBound(arr, num):\n ans = len(arr)\n low = 0\n high = len(arr) - 1\n while low <= high:\n mid = (low + high) // 2\n if arr[mid] >= num:\n ans = mid\n high = mid - 1\n else:\n low = mid + 1\n return ans\n\n currStack = SortedList(nums[:indexDiff + 1])\n for i in range(1, len(currStack)):\n if abs(currStack[i] - currStack[i - 1]) <= valueDiff:\n return True\n for i in range(indexDiff + 1, len(nums)):\n currStack.discard(nums[i - indexDiff - 1])\n a = lowerBound(currStack, nums[i])\n print(a, i)\n if a >= 0 and nums[i] - currStack[a] <= valueDiff:\n return True\n b = upperBound(currStack, nums[i])\n if b < len(currStack) and currStack[b] - nums[i] <= valueDiff:\n return True\n currStack.add(nums[i])\n return False","runtime":"2176"},{"code":"from sortedcontainers import SortedList\nimport numpy as np \n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n slist = SortedList()\n if indexDiff < len(nums)//4:\n for i in range(len(nums)):\n for j in range(i+1, i+indexDiff+1):\n if i+indexDiff == len(nums):\n break \n if abs(nums[i]- nums[j]) <= valueDiff:\n return True \n else:\n for i in range(len(nums)):\n slist.add([nums[i], i])\n \n for i in range(len(slist)):\n if slist[i][0] - slist[-1][0] > valueDiff:\n return False\n for j in range(i+1, len(slist)):\n if abs(slist[i][0]- slist[j][0]) <= valueDiff:\n if abs(slist[i][1]- slist[j][1]) <= indexDiff:\n return True\n else:\n break\n return False\n\n","runtime":"2215"},{"code":"# from collections import defaultdict\n\nclass Solution:\n def find(self, lst, idxDiff, valDiff):\n if len(lst) > 4:\n return True\n # lst.sort()\n for i in range(len(lst) - 1):\n j = i + 1\n while True:\n if lst[j][0] - lst[i][0] > idxDiff:\n break\n if abs(lst[i][1] - lst[j][1]) <= valDiff:\n return True\n j += 1\n if j >= len(lst):\n break\n return False\n\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n d = dict() #defaultdict(lambda: defaultdict(lambda: []))\n for i, x in enumerate(nums):\n omi = i // (indexDiff + 1)\n omx = x // (valueDiff + 1)\n \n\n for di in [0, 1]:\n for dx in [0, 1]:\n mi = omi + di\n mx = omx + dx\n k = (mi, mx)\n if k not in d:\n d[k] = []\n d[k].append((i, x))\n \n for v in d.values():\n if self.find(v, indexDiff, valueDiff):\n return True\n return False\n\n \n\n","runtime":"2255"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n bst = None\n for i in range(len(nums)):\n if bst is None:\n bst = AVLTreeNode(nums[i])\n else:\n if abs(nums[i] - bst.findClosest(nums[i])) <= valueDiff:\n return True\n bst = bst.insert(nums[i])\n if i - indexDiff >= 0:\n bst = bst.remove(nums[i - indexDiff])\n return False\n\nclass AVLTreeNode:\n def __init__(self, value):\n self.value = value\n self.balance = 0 # defined as self.left.height - self.right.height\n self.height = 1\n self.left = None # smaller than or equal to\n self.right = None\n\n def insert(self, k):\n if k <= self.value:\n if not self.left:\n self.left = AVLTreeNode(k)\n else:\n self.left = self.left.insert(k)\n else:\n if not self.right:\n self.right = AVLTreeNode(k)\n else:\n self.right = self.right.insert(k)\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\n\n # balance self\n if self.balance > 1:\n if self.left.balance >= 0:\n return self.right_rotate()\n else:\n self.left = self.left.left_rotate()\n return self.right_rotate()\n elif self.balance < -1:\n if self.right.balance <= 0:\n return self.left_rotate()\n else:\n self.right = self.right.right_rotate()\n return self.left_rotate()\n return self\n\n def remove(self, k):\n if k < self.value:\n if self.left:\n self.left = self.left.remove(k)\n elif k > self.value:\n if self.right:\n self.right = self.right.remove(k)\n else:\n if not self.left:\n return self.right\n elif not self.right:\n return self.left\n temp = self.right.find_min()\n self.value = temp.value\n self.right = self.right.remove(temp.value)\n\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\n\n if self.balance > 1:\n if self.left.balance >= 0:\n return self.right_rotate()\n else:\n self.left = self.left.left_rotate()\n return self.right_rotate()\n elif self.balance < -1:\n if self.right.balance <= 0:\n return self.left_rotate()\n else:\n print(self.right)\n self.right = self.right.right_rotate()\n return self.left_rotate()\n return self\n\n def find_min(self):\n if self.left is None:\n return self\n else:\n return self.left.find_min()\n\n def findClosest(self, k):\n closest = self.value\n if k < self.value:\n if self.left:\n left_closest = self.left.findClosest(k)\n if abs(k - left_closest) < abs(k - closest):\n closest = left_closest\n elif k > self.value:\n if self.right:\n right_closest = self.right.findClosest(k)\n if abs(k - right_closest) < abs(k - closest):\n closest = right_closest\n return closest\n\n def left_rotate(self):\n new_root = self.right\n if new_root is None: # Ensure the new root exists\n return self\n self.right = new_root.left\n new_root.left = self\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\n return new_root\n\n def right_rotate(self):\n new_root = self.left\n if new_root is None:\n return self # Safety check, should not happen if the tree is correctly balanced\n self.left = new_root.right\n new_root.right = self\n # Update heights\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\n return new_root\n\n","runtime":"2255"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n\n window = SortedList(nums[:indexDiff + 1])\n n = len(nums)\n\n for center in range(n):\n\n if nums[center] in window:\n window.remove(nums[center])\n \n if center > indexDiff:\n window.remove(nums[center - 1 - indexDiff])\n \n # print(nums[center],window)\n # Check current window\n l = window.bisect_left(nums[center] - valueDiff)\n r = window.bisect_right(nums[center] + valueDiff)\n if r - l >= 1:\n return True\n\n window.add(nums[center])\n if center+indexDiff+1 < n:\n window.add(nums[center+indexDiff+1])\n \n return False\n","runtime":"2295"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n bst = None\n for i in range(len(nums)):\n if bst is None:\n bst = AVLTreeNode(nums[i])\n else:\n if abs(nums[i] - bst.findClosest(nums[i])) <= valueDiff:\n return True\n bst = bst.insert(nums[i])\n if i - indexDiff >= 0:\n bst = bst.remove(nums[i - indexDiff])\n return False\n\nclass AVLTreeNode:\n def __init__(self, value):\n self.value = value\n self.balance = 0 # defined as self.left.height - self.right.height\n self.height = 1\n self.left = None # smaller than or equal to\n self.right = None\n\n def insert(self, k):\n if k <= self.value:\n if not self.left:\n self.left = AVLTreeNode(k)\n else:\n self.left = self.left.insert(k)\n else:\n if not self.right:\n self.right = AVLTreeNode(k)\n else:\n self.right = self.right.insert(k)\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\n\n # balance self\n if self.balance > 1:\n if self.left.balance >= 0:\n return self.right_rotate()\n else:\n self.left = self.left.left_rotate()\n return self.right_rotate()\n elif self.balance < -1:\n if self.right.balance <= 0:\n return self.left_rotate()\n else:\n self.right = self.right.right_rotate()\n return self.left_rotate()\n return self\n\n def remove(self, k):\n if k < self.value:\n if self.left:\n self.left = self.left.remove(k)\n elif k > self.value:\n if self.right:\n self.right = self.right.remove(k)\n else:\n if not self.left:\n return self.right\n elif not self.right:\n return self.left\n temp = self.right.find_min()\n self.value = temp.value\n self.right = self.right.remove(temp.value)\n\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\n\n if self.balance > 1:\n if self.left.balance >= 0:\n return self.right_rotate()\n else:\n self.left = self.left.left_rotate()\n return self.right_rotate()\n elif self.balance < -1:\n if self.right.balance <= 0:\n return self.left_rotate()\n else:\n print(self.right)\n self.right = self.right.right_rotate()\n return self.left_rotate()\n return self\n\n def find_min(self):\n if self.left is None:\n return self\n else:\n return self.left.find_min()\n\n def findClosest(self, k):\n closest = self.value\n if k < self.value:\n if self.left:\n left_closest = self.left.findClosest(k)\n if abs(k - left_closest) < abs(k - closest):\n closest = left_closest\n elif k > self.value:\n if self.right:\n right_closest = self.right.findClosest(k)\n if abs(k - right_closest) < abs(k - closest):\n closest = right_closest\n return closest\n\n def left_rotate(self):\n new_root = self.right\n if new_root is None: # Ensure the new root exists\n return self\n self.right = new_root.left\n new_root.left = self\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\n return new_root\n\n def right_rotate(self):\n new_root = self.left\n if new_root is None:\n return self # Safety check, should not happen if the tree is correctly balanced\n self.left = new_root.right\n new_root.right = self\n # Update heights\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\n return new_root\n\n","runtime":"2335"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n bst = None\n for i in range(len(nums)):\n if bst is None:\n bst = AVLTreeNode(nums[i])\n else:\n if abs(nums[i] - bst.findClosest(nums[i])) <= valueDiff:\n return True\n bst = bst.insert(nums[i])\n if i - indexDiff >= 0:\n bst = bst.remove(nums[i - indexDiff])\n return False\n\nclass AVLTreeNode:\n def __init__(self, value):\n self.value = value\n self.balance = 0 # defined as self.left.height - self.right.height\n self.height = 1\n self.left = None # smaller than or equal to\n self.right = None\n\n def insert(self, k):\n if k <= self.value:\n if not self.left:\n self.left = AVLTreeNode(k)\n else:\n self.left = self.left.insert(k)\n else:\n if not self.right:\n self.right = AVLTreeNode(k)\n else:\n self.right = self.right.insert(k)\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\n\n # balance self\n if self.balance > 1:\n if self.left.balance >= 0:\n return self.right_rotate()\n else:\n self.left = self.left.left_rotate()\n return self.right_rotate()\n elif self.balance < -1:\n if self.right.balance <= 0:\n return self.left_rotate()\n else:\n self.right = self.right.right_rotate()\n return self.left_rotate()\n return self\n\n def remove(self, k):\n if k < self.value:\n if self.left:\n self.left = self.left.remove(k)\n elif k > self.value:\n if self.right:\n self.right = self.right.remove(k)\n else:\n if not self.left:\n return self.right\n elif not self.right:\n return self.left\n temp = self.right.find_min()\n self.value = temp.value\n self.right = self.right.remove(temp.value)\n\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\n\n if self.balance > 1:\n if self.left.balance >= 0:\n return self.right_rotate()\n else:\n self.left = self.left.left_rotate()\n return self.right_rotate()\n elif self.balance < -1:\n if self.right.balance <= 0:\n return self.left_rotate()\n else:\n self.right = self.right.right_rotate()\n return self.left_rotate()\n return self\n\n def find_min(self):\n if self.left is None:\n return self\n else:\n return self.left.find_min()\n\n def findClosest(self, k):\n closest = self.value\n if k < self.value:\n if self.left:\n left_closest = self.left.findClosest(k)\n if abs(k - left_closest) < abs(k - closest):\n closest = left_closest\n elif k > self.value:\n if self.right:\n right_closest = self.right.findClosest(k)\n if abs(k - right_closest) < abs(k - closest):\n closest = right_closest\n return closest\n\n def left_rotate(self):\n new_root = self.right\n if new_root is None: # Ensure the new root exists\n return self\n self.right = new_root.left\n new_root.left = self\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\n return new_root\n\n def right_rotate(self):\n new_root = self.left\n if new_root is None:\n return self # Safety check, should not happen if the tree is correctly balanced\n self.left = new_root.right\n new_root.right = self\n # Update heights\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\n return new_root\n\n","runtime":"2335"},{"code":"class Solution:\n def __init__(self):\n self.bit = [0 for i in range(100005)]\n def update(self, index, val):\n i = index\n while i <= 100001:\n self.bit[i] += val\n i += i & -i\n def query(self, index):\n i = index\n ans = 0\n while i > 0:\n ans += self.bit[i]\n i -= i & -i\n return ans\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n indexedArray = []\n for (i, number) in enumerate(nums):\n indexedArray.append([number, i+1])\n indexedArray.sort(key = lambda x:(x[0], x[1]))\n\n bptr = -1\n for i in range(len(indexedArray)):\n while bptr+1 < len(indexedArray) and indexedArray[bptr+1][0]+valueDiff < indexedArray[i][0]:\n self.update(indexedArray[bptr+1][1], -1)\n bptr+=1\n currIndex = indexedArray[i][1]\n amt = self.query(min(currIndex+indexDiff, 100001)) - self.query(max(currIndex-indexDiff-1,0))\n\n self.update(currIndex, 1)\n\n if amt > 0:\n return True\n return False\n ","runtime":"2374"},{"code":"from sortedcontainers import SortedList as sl\ndef check(arr,id,vd):\n q = sl([arr[0]])\n n = len(arr)\n for i in range(1,n):\n p = len(q)\n if p > id:\n # print(i,q)\n q.remove(arr[i-id-1])\n val = arr[i]\n p = len(q)\n if p:\n i1 = q.bisect_left(val-vd)\n i2 = q.bisect_left(val+vd)\n i1 = min(max(0,i1),p-1)\n i2 = min(max(0,i2),p-1)\n for xx in range(i1,i2+1):\n if val-vd<=q[xx]<=val+vd:\n return True\n q.add(val)\n return False\nclass Solution:\n def containsNearbyAlmostDuplicate(self, arr: List[int], id: int, vd: int) -> bool:\n a1 = check(arr,id,vd) \n # a2 = check(arr[::-1],id,vd)\n # print(a1,a2)\n return a1 or check(arr[::-1],id,vd)","runtime":"2414"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # maintain a window. sort the first time. Search for nums\n # remove num, add the next num\n # looks for the target. removes and returns true or false if there is a pair\n def binaryRemove(arr, target):\n left, right = 0, len(arr) - 1\n while left <= right:\n mid = (left + right) // 2\n if arr[mid] == target:\n #found it\n result = False\n if mid+1 in range(len(arr)) and abs(arr[mid + 1] - arr[mid]) <= valueDiff:\n result = True\n if mid-1 in range(len(arr)) and abs(arr[mid - 1] - arr[mid]) <= valueDiff:\n result = True\n arr.pop(mid)\n return result\n elif arr[mid] < target:\n left = mid + 1\n else:\n right = mid - 1\n # insert with binarySearch and return the new array\n def binaryInsert(arr, target):\n left, right = 0, len(arr) - 1\n while left <= right:\n mid = (left + right) // 2\n if arr[mid] == target:\n arr.insert(mid, target)\n return\n elif arr[mid] < target:\n left = mid + 1\n else:\n right = mid - 1\n arr.insert(left, target)\n return\n \n initialWindow = nums[: indexDiff + 1]\n initialWindow.sort()\n for i in range(len(nums)):\n #remove i\n num = nums[i]\n if binaryRemove(initialWindow, num) is True:\n return True\n #add i + indexDiff + 1 if it exists\n if i + indexDiff + 1 < len(nums):\n binaryInsert(initialWindow, nums[i + indexDiff + 1])\n return False\n \n ","runtime":"2454"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n st=SortedList()\n ans=float(inf)\n for i in range(len(nums)):\n if i>indexDiff:\n st.remove(nums[i-indexDiff-1])\n spot=st.bisect_left(nums[i])\n if spot!=0:\n ans=min(ans,abs(nums[i]-st[spot-1]))\n if spot<=len(st)-1:\n ans=min(ans,abs(nums[i]-st[spot]))\n st.add(nums[i])\n if ans<=valueDiff:\n return True\n return False\n\n\n ","runtime":"2494"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # first, create a window of indexDiff numbers\n window = nums[:min(len(nums), indexDiff+1)]\n window.sort()\n window_size = len(window)\n\n # iterate over initial window\n for i in range(1, window_size):\n if window[i] - window[i-1] <= valueDiff:\n return True\n\n # use binary search to find close numbers in current window, then shift window\n for i in range(len(nums)-window_size):\n # find index of element to remove from window\n remove_idx = bisect_left(window, nums[i])\n\n window = window[:remove_idx] + window[remove_idx+1:]\n\n # find index to add new element to window\n add_idx = bisect_left(window, nums[i+window_size]) \n\n window = window[:add_idx] + [nums[i+window_size]] + window[add_idx:]\n \n if add_idx > 0 and abs(window[add_idx] - window[add_idx-1]) <= valueDiff:\n return True\n\n if add_idx < len(window)-1 and abs(window[add_idx] - window[add_idx+1]) <= valueDiff:\n return True\n\n return False","runtime":"2533"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n sl = SortedList()\n sl_diff = SortedList()\n n = len(nums)\n MAXV = int(1e9)\n nums = [v + MAXV for v in nums]\n for i in range(n):\n if (i - indexDiff > 0):\n v = nums[i - indexDiff - 1]\n index_sl = sl.bisect_left((v, i - indexDiff - 1))\n if (index_sl > 0):\n diff = v - sl[index_sl - 1][0]\n sl_diff.remove((diff, i - indexDiff - 1))\n if (index_sl <= indexDiff - 1):\n diff = sl[index_sl + 1][0] - v\n sl_diff.remove((diff, sl[index_sl + 1][1]))\n\n if (index_sl > 0 and index_sl <= indexDiff - 1):\n new_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\n sl_diff.add((new_diff, sl[index_sl + 1][1]))\n sl.remove((v, i - indexDiff - 1))\n\n sl.add((nums[i], i))\n if (i == 0):\n continue\n v = nums[i]\n index_sl = sl.bisect_left((v, i))\n if (index_sl > 0 and index_sl < len(sl) - 1):\n back_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\n sl_diff.remove((back_diff, sl[index_sl + 1][1]))\n\n if (index_sl > 0):\n diff = v - sl[index_sl - 1][0]\n sl_diff.add((diff, i))\n if (index_sl < len(sl) - 1):\n diff = sl[index_sl + 1][0] - v\n sl_diff.add((diff, sl[index_sl + 1][1]))\n\n if (sl_diff[0][0] <= valueDiff):\n return True\n\n return False\n\n ","runtime":"2573"},{"code":"class Node(object):\n def __init__(self, val):\n self.val = val\n self.left = None\n self.right = None\n self.height = 1\n\n\nclass AVLTree(object):\n def __init__(self):\n self.root = None\n self.size = 0\n \n\t\t\t\t\n def height(self, node):\n if node:\n return node.height\n return 0\n \n\t\t\n def setHeight(self, node):\n if node is None:\n return 0\n return 1 + max(self.height(node.left), self.height(node.right))\n \n\t\t\n def rightRotate(self, node):\n new_root = node.left\n node.left = node.left.right\n new_root.right = node\n node.height = self.setHeight(node)\n new_root.height = self.setHeight(new_root)\n return new_root\n \n \n def leftRotate(self, node):\n new_root = node.right\n node.right = node.right.left\n new_root.left = node\n node.height = self.setHeight(node)\n new_root.height = self.setHeight(new_root)\n return new_root\n \n \n def insert(self, node, val):\n if node == self.root:\n self.size += 1\n # Returns a Node pointing to updated subtree\n if node is None:\n return Node(val)\n if node.val < val:\n node.right = self.insert(node.right, val)\n else:\n node.left = self.insert(node.left, val)\n balance = self.height(node.left) - self.height(node.right)\n if balance > 1:\n if self.height(node.left.left) > self.height(node.left.right):\n node = self.rightRotate(node)\n else:\n node.left = self.leftRotate(node.left)\n node = self.rightRotate(node)\n elif balance < -1:\n if self.height(node.right.right) > self.height(node.right.left):\n node = self.leftRotate(node)\n else:\n node.right = self.rightRotate(node.right)\n node = self.leftRotate(node)\n else:\n node.height = self.setHeight(node)\n return node\n \n \n def getMinValNode(self, node):\n if node is None or node.left is None:\n return node\n return self.getMinValNode(node.left)\n \n\t\t\n def remove(self, node, val):\n if node is None:\n return None\n if node.val < val:\n node.right = self.remove(node.right, val)\n elif node.val > val:\n node.left = self.remove(node.left, val)\n else:\n if node.left is None:\n return node.right\n elif node.right is None:\n return node.left\n else:\n right_min_val_node = self.getMinValNode(node.right)\n node.val = right_min_val_node.val\n node.right = self.remove(node.right, right_min_val_node.val)\n \n node.height = self.setHeight(node)\n balance = self.height(node.left) - self.height(node.right)\n if balance > 1:\n if self.height(node.left.left) > self.height(node.left.right):\n node = self.rightRotate(node)\n else:\n node.left = self.leftRotate(node.left)\n node = self.rightRotate(node)\n elif balance < -1:\n if self.height(node.right.right) > self.height(node.right.left):\n node = self.leftRotate(node)\n else:\n node.right = self.rightRotate(node.right)\n node = self.leftRotate(node)\n else:\n node.height = self.setHeight(node)\n return node\n \n \n def predecessor(self, node, val):\n if node is None:\n return None\n if node.val == val:\n return val\n elif node.val > val:\n return self.predecessor(node.left, val)\n else:\n right_res = self.predecessor(node.right, val)\n return right_res if right_res else node.val \n \n\t\t\t\t\t\t\n def successor(self, node, val):\n if node is None:\n return None\n if node.val == val:\n return val\n elif node.val < val:\n return self.successor(node.right, val)\n else:\n left_res = self.successor(node.left, val)\n return left_res if left_res else node.val\n \n\nclass Solution(object):\n def containsNearbyAlmostDuplicate(self, nums, k, t):\n avltree = AVLTree()\n root = avltree.root\n for i, num in enumerate(nums): \n predecessor = avltree.predecessor(root, num)\n if predecessor is not None and abs(predecessor - num) <= t:\n return True\n successor = avltree.successor(root, num)\n if successor is not None and abs(successor - num) <= t:\n return True\n \n root = avltree.insert(root, num)\n \n if avltree.size > k:\n root = avltree.remove(root, nums[i-k])\n \n return False","runtime":"2613"},{"code":"class Node(object):\n def __init__(self, val):\n self.val = val\n self.left = None\n self.right = None\n self.height = 1\n\n\nclass AVLTree(object):\n def __init__(self):\n self.root = None\n self.size = 0\n \n\t\t\t\t\n def height(self, node):\n if node:\n return node.height\n return 0\n \n\t\t\n def setHeight(self, node):\n if node is None:\n return 0\n return 1 + max(self.height(node.left), self.height(node.right))\n \n\t\t\n def rightRotate(self, node):\n new_root = node.left\n node.left = node.left.right\n new_root.right = node\n node.height = self.setHeight(node)\n new_root.height = self.setHeight(new_root)\n return new_root\n \n \n def leftRotate(self, node):\n new_root = node.right\n node.right = node.right.left\n new_root.left = node\n node.height = self.setHeight(node)\n new_root.height = self.setHeight(new_root)\n return new_root\n \n \n def insert(self, node, val):\n if node == self.root:\n self.size += 1\n # Returns a Node pointing to updated subtree\n if node is None:\n return Node(val)\n if node.val < val:\n node.right = self.insert(node.right, val)\n else:\n node.left = self.insert(node.left, val)\n balance = self.height(node.left) - self.height(node.right)\n if balance > 1:\n if self.height(node.left.left) > self.height(node.left.right):\n node = self.rightRotate(node)\n else:\n node.left = self.leftRotate(node.left)\n node = self.rightRotate(node)\n elif balance < -1:\n if self.height(node.right.right) > self.height(node.right.left):\n node = self.leftRotate(node)\n else:\n node.right = self.rightRotate(node.right)\n node = self.leftRotate(node)\n else:\n node.height = self.setHeight(node)\n return node\n \n \n def getMinValNode(self, node):\n if node is None or node.left is None:\n return node\n return self.getMinValNode(node.left)\n \n\t\t\n def remove(self, node, val):\n if node is None:\n return None\n if node.val < val:\n node.right = self.remove(node.right, val)\n elif node.val > val:\n node.left = self.remove(node.left, val)\n else:\n if node.left is None:\n return node.right\n elif node.right is None:\n return node.left\n else:\n right_min_val_node = self.getMinValNode(node.right)\n node.val = right_min_val_node.val\n node.right = self.remove(node.right, right_min_val_node.val)\n \n node.height = self.setHeight(node)\n balance = self.height(node.left) - self.height(node.right)\n if balance > 1:\n if self.height(node.left.left) > self.height(node.left.right):\n node = self.rightRotate(node)\n else:\n node.left = self.leftRotate(node.left)\n node = self.rightRotate(node)\n elif balance < -1:\n if self.height(node.right.right) > self.height(node.right.left):\n node = self.leftRotate(node)\n else:\n node.right = self.rightRotate(node.right)\n node = self.leftRotate(node)\n else:\n node.height = self.setHeight(node)\n return node\n \n \n def predecessor(self, node, val):\n if node is None:\n return None\n if node.val == val:\n return val\n elif node.val > val:\n return self.predecessor(node.left, val)\n else:\n right_res = self.predecessor(node.right, val)\n return right_res if right_res else node.val \n \n\t\t\t\t\t\t\n def successor(self, node, val):\n if node is None:\n return None\n if node.val == val:\n return val\n elif node.val < val:\n return self.successor(node.right, val)\n else:\n left_res = self.successor(node.left, val)\n return left_res if left_res else node.val\n \n\nclass Solution(object):\n def containsNearbyAlmostDuplicate(self, nums, k, t):\n \"\"\"\n :type nums: List[int]\n :type k: int\n :type t: int\n :rtype: bool\n \"\"\"\n avltree = AVLTree()\n root = avltree.root\n for i, num in enumerate(nums): \n predecessor = avltree.predecessor(root, num)\n if predecessor is not None and abs(predecessor - num) <= t:\n return True\n successor = avltree.successor(root, num)\n if successor is not None and abs(successor - num) <= t:\n return True\n \n root = avltree.insert(root, num)\n \n if avltree.size > k:\n root = avltree.remove(root, nums[i-k])\n \n return False","runtime":"2653"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n sl = SortedList()\n sl_diff = SortedList()\n n = len(nums)\n MAXV = int(1e9)\n nums = [v + MAXV for v in nums]\n for i in range(n):\n print(\"index: \", i)\n if (i - indexDiff > 0):\n v = nums[i - indexDiff - 1]\n index_sl = sl.bisect_left((v, i - indexDiff - 1))\n if (index_sl > 0):\n diff = v - sl[index_sl - 1][0]\n sl_diff.remove((diff, i - indexDiff - 1))\n if (index_sl <= indexDiff - 1):\n diff = sl[index_sl + 1][0] - v\n sl_diff.remove((diff, sl[index_sl + 1][1]))\n\n if (index_sl > 0 and index_sl <= indexDiff - 1):\n new_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\n sl_diff.add((new_diff, sl[index_sl + 1][1]))\n sl.remove((v, i - indexDiff - 1))\n\n sl.add((nums[i], i))\n if (i == 0):\n continue\n v = nums[i]\n index_sl = sl.bisect_left((v, i))\n if (index_sl > 0 and index_sl < len(sl) - 1):\n back_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\n sl_diff.remove((back_diff, sl[index_sl + 1][1]))\n\n if (index_sl > 0):\n diff = v - sl[index_sl - 1][0]\n sl_diff.add((diff, i))\n if (index_sl < len(sl) - 1):\n diff = sl[index_sl + 1][0] - v\n sl_diff.add((diff, sl[index_sl + 1][1]))\n\n if (sl_diff[0][0] <= valueDiff):\n return True\n\n return False\n\n ","runtime":"2692"},{"code":"class Node(object):\n def __init__(self, val):\n self.val = val\n self.left = None\n self.right = None\n self.height = 1\n\n\nclass AVLTree(object):\n def __init__(self):\n self.root = None\n self.size = 0\n \n\t\t\t\t\n def height(self, node):\n if node:\n return node.height\n return 0\n \n\t\t\n def setHeight(self, node):\n if node is None:\n return 0\n return 1 + max(self.height(node.left), self.height(node.right))\n \n\t\t\n def rightRotate(self, node):\n new_root = node.left\n node.left = node.left.right\n new_root.right = node\n node.height = self.setHeight(node)\n new_root.height = self.setHeight(new_root)\n return new_root\n \n \n def leftRotate(self, node):\n new_root = node.right\n node.right = node.right.left\n new_root.left = node\n node.height = self.setHeight(node)\n new_root.height = self.setHeight(new_root)\n return new_root\n \n \n def insert(self, node, val):\n if node == self.root:\n self.size += 1\n # Returns a Node pointing to updated subtree\n if node is None:\n return Node(val)\n if node.val < val:\n node.right = self.insert(node.right, val)\n else:\n node.left = self.insert(node.left, val)\n balance = self.height(node.left) - self.height(node.right)\n if balance > 1:\n if self.height(node.left.left) > self.height(node.left.right):\n node = self.rightRotate(node)\n else:\n node.left = self.leftRotate(node.left)\n node = self.rightRotate(node)\n elif balance < -1:\n if self.height(node.right.right) > self.height(node.right.left):\n node = self.leftRotate(node)\n else:\n node.right = self.rightRotate(node.right)\n node = self.leftRotate(node)\n else:\n node.height = self.setHeight(node)\n return node\n \n \n def getMinValNode(self, node):\n if node is None or node.left is None:\n return node\n return self.getMinValNode(node.left)\n \n\t\t\n def remove(self, node, val):\n if node is None:\n return None\n if node.val < val:\n node.right = self.remove(node.right, val)\n elif node.val > val:\n node.left = self.remove(node.left, val)\n else:\n if node.left is None:\n return node.right\n elif node.right is None:\n return node.left\n else:\n right_min_val_node = self.getMinValNode(node.right)\n node.val = right_min_val_node.val\n node.right = self.remove(node.right, right_min_val_node.val)\n \n node.height = self.setHeight(node)\n balance = self.height(node.left) - self.height(node.right)\n if balance > 1:\n if self.height(node.left.left) > self.height(node.left.right):\n node = self.rightRotate(node)\n else:\n node.left = self.leftRotate(node.left)\n node = self.rightRotate(node)\n elif balance < -1:\n if self.height(node.right.right) > self.height(node.right.left):\n node = self.leftRotate(node)\n else:\n node.right = self.rightRotate(node.right)\n node = self.leftRotate(node)\n else:\n node.height = self.setHeight(node)\n return node\n \n \n def predecessor(self, node, val):\n if node is None:\n return None\n if node.val == val:\n return val\n elif node.val > val:\n return self.predecessor(node.left, val)\n else:\n right_res = self.predecessor(node.right, val)\n return right_res if right_res else node.val \n \n\t\t\t\t\t\t\n def successor(self, node, val):\n if node is None:\n return None\n if node.val == val:\n return val\n elif node.val < val:\n return self.successor(node.right, val)\n else:\n left_res = self.successor(node.left, val)\n return left_res if left_res else node.val\n \n\nclass Solution(object):\n def containsNearbyAlmostDuplicate(self, nums, k, t):\n \"\"\"\n :type nums: List[int]\n :type k: int\n :type t: int\n :rtype: bool\n \"\"\"\n avltree = AVLTree()\n root = avltree.root\n for i, num in enumerate(nums): \n predecessor = avltree.predecessor(root, num)\n if predecessor is not None and abs(predecessor - num) <= t:\n return True\n successor = avltree.successor(root, num)\n if successor is not None and abs(successor - num) <= t:\n return True\n \n root = avltree.insert(root, num)\n \n if avltree.size > k:\n root = avltree.remove(root, nums[i-k])\n \n return False","runtime":"2732"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n\n n = len(nums)\n s = SortedList()\n for i,ele in enumerate(nums):\n idx = bisect.bisect_left(s,ele)\n prev_idx = idx - 1\n if idx < len(s) and abs(s[idx] - ele) <= valueDiff:\n return True\n\n if 0 <= prev_idx and abs(s[prev_idx] - ele) <= valueDiff:\n return True\n s.add(nums[i])\n if i >= indexDiff:\n s.remove(nums[i - indexDiff])\n return False\n\n\n\n\n\n\n ","runtime":"2851"},{"code":"from sortedcontainers import SortedList\nimport bisect\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n L = SortedList()\n k = indexDiff\n\n for i, n in enumerate(nums):\n\n\n j = bisect.bisect(L, n)\n if j > 0 and abs(L[j-1] - n) <= valueDiff:\n return True\n if j < len(L) and abs(L[j] - n ) <= valueDiff:\n return True\n\n \n L.add(n)\n\n if i >= k:\n v = nums[i-k]\n L.remove(v)\n\n return False\n\n\n ","runtime":"2891"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n\n n = len(nums)\n\n nums_dict = {}\n\n nums_sorted = []\n\n for index in range(n):\n\n num = nums[index]\n\n if num not in nums_dict:\n\n nums_dict[num] = [index]\n\n else:\n\n i = 0\n\n j = len(nums_dict[num]) - 1\n\n while i < j:\n\n k = (i + j + 1) // 2\n\n if nums_dict[num][k] <= index:\n\n i = k\n\n else:\n\n j = k - 1\n\n if abs(nums_dict[num][i]-index) <= indexDiff:\n\n return True\n\n if nums_dict[num][i] > index:\n\n i = -1\n\n nums_dict[num].insert(i+1,index)\n\n if len(nums_sorted) == 0:\n\n nums_sorted.append(num)\n\n else:\n\n i = 0\n\n j = len(nums_sorted) - 1\n\n while i < j:\n\n k = (i + j + 1) // 2\n\n if nums_sorted[k] <= num:\n\n i = k\n\n else:\n\n j = k - 1\n\n if nums_sorted[i] > num:\n\n nums_sorted.insert(0,num)\n\n elif nums_sorted[i] < num:\n\n nums_sorted.insert(i+1,num)\n\n for index in range(len(nums_sorted)-1):\n\n num = nums_sorted[index]\n\n for step in range(index+1,len(nums_sorted)):\n\n if abs(num-nums_sorted[step]) > valueDiff:\n\n break\n\n targets = nums_dict[nums_sorted[step]]\n\n for target in nums_dict[num]:\n\n i = 0\n\n j = len(targets) - 1\n\n while i < j:\n\n k = (i + j + 1) // 2\n\n if targets[k] <= target:\n\n i = k\n\n else:\n\n j = k - 1\n\n if abs(targets[i] - target) <= indexDiff:\n\n return True\n\n if i != len(targets) - 1 and abs(targets[i+1] - target) <= indexDiff:\n\n return True\n \n return False","runtime":"2931"}],"string":"[\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\\n buckets = {}\\n if t == 0:\\n for index, num in enumerate(nums):\\n if num in buckets and index - buckets[num] <= k:\\n return True \\n buckets[num] = index\\n return False \\n for index, num in enumerate(nums):\\n bucket = num // t \\n if bucket in buckets and index - buckets[bucket][0] <= k:\\n return True \\n if bucket+1 in buckets and index - buckets[bucket+1][0] <= k and buckets[bucket+1][1] - num <= t:\\n return True \\n if bucket-1 in buckets and index-buckets[bucket-1][0]<=k and num-buckets[bucket-1][1] <= t:\\n return True \\n buckets[bucket] = [index, num]\\n return False \",\n \"runtime\": \"705\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if len(nums) < 2:\\n return False\\n if indexDiff == 0:\\n return False\\n hashmap = {}\\n if valueDiff == 0:\\n for i in range(len(nums)):\\n if nums[i] in hashmap and i - hashmap[nums[i]] <= indexDiff:\\n return True\\n \\n hashmap[nums[i]] = i\\n return False\\n for i in range(len(nums)):\\n if nums[i]//valueDiff in hashmap and i - hashmap[nums[i]//valueDiff][1] <= indexDiff:\\n return True\\n if nums[i]//valueDiff+1 in hashmap and i - hashmap[nums[i]//valueDiff+1][1] <= indexDiff and abs(hashmap[nums[i]//valueDiff+1][0]-nums[i]) <= valueDiff:\\n return True\\n if nums[i]//valueDiff-1 in hashmap and i - hashmap[nums[i]//valueDiff-1][1] <= indexDiff and abs(hashmap[nums[i]//valueDiff-1][0]-nums[i]) <= valueDiff:\\n return True\\n hashmap[nums[i]//valueDiff] = [nums[i], i]\\n\\n return False\\n \\n \",\n \"runtime\": \"705\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if indexDiff <= 0 or valueDiff < 0:\\n return False\\n\\n # Bucket size must be valueDiff + 1 to ensure all values in a bucket satisfy the valueDiff condition.\\n bucket_size = valueDiff + 1\\n buckets = {}\\n\\n for i, num in enumerate(nums):\\n # Determine the bucket for the current element.\\n bucket_key = num // bucket_size\\n\\n # Check if there's a conflict in the current bucket.\\n if bucket_key in buckets:\\n return True\\n\\n # Check the neighboring buckets.\\n if (bucket_key - 1 in buckets and abs(num - buckets[bucket_key - 1]) < bucket_size):\\n return True\\n if (bucket_key + 1 in buckets and abs(num - buckets[bucket_key + 1]) < bucket_size):\\n return True\\n\\n # Place the current number in its bucket.\\n buckets[bucket_key] = num\\n\\n # Remove the element that is out of the sliding window.\\n if i >= indexDiff:\\n old_bucket_key = nums[i - indexDiff] // bucket_size\\n del buckets[old_bucket_key]\\n\\n return False\",\n \"runtime\": \"745\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if valueDiff < 0:\\n return False\\n \\n num_buckets = {}\\n bucket_size = valueDiff + 1\\n \\n for i in range(len(nums)):\\n bucket_key = nums[i] // bucket_size\\n \\n if bucket_key in num_buckets:\\n return True\\n if bucket_key - 1 in num_buckets and abs(nums[i] - num_buckets[bucket_key - 1]) < bucket_size:\\n return True\\n if bucket_key + 1 in num_buckets and abs(nums[i] - num_buckets[bucket_key + 1]) < bucket_size:\\n return True\\n \\n num_buckets[bucket_key] = nums[i]\\n \\n if i >= indexDiff:\\n del num_buckets[nums[i - indexDiff] // bucket_size]\\n \\n return False\\n\",\n \"runtime\": \"745\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n buckets = {}\\n size = valueDiff +1\\n for r in range(len(nums)):\\n if r > indexDiff:\\n del buckets[nums[r-indexDiff-1]//size]\\n idx = nums[r]//size\\n if idx in buckets:\\n return True\\n if idx +1 in buckets and abs(buckets[idx+1] - nums[r]) <= valueDiff:\\n return True\\n if idx -1 in buckets and abs(buckets[idx-1] - nums[r]) <= valueDiff:\\n return True\\n buckets[idx]= nums[r]\\n return False\\n\",\n \"runtime\": \"785\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # go through every single item for x and the moment \\n\\n # brute force approach\\n\\n # n = len(nums)\\n # for i in range(n):\\n # for j in range(i+1, min(n, i + idiff + 1)):\\n # if i != j:\\n # if abs(nums[i] - nums[j]) <= vdiff:\\n # return True\\n\\n # return False\\n\\n \\n\\n # sort them based on values and keep indicies for each value\\n # they will already be sotred secondarily by indicies\\n # keep sliding window\\n # keep opening up the window until I reach the max value \\n # if i reach max value and no smaller value is found\\n # i shrink the window up to the end and start over\\n\\n buckets = {} #store values for diapason (i-indexDiff:i]\\n valueDiff +=1 #if valueDiff = zero it's simplify proces edge-cases\\n \\n for idx, curVal in enumerate(nums):\\n bucketId = curVal // valueDiff #bucket for new element\\n if bucketId in buckets: return True # have 'duplicate value' in current bucket\\n #check neighboring buckets if they are exists\\n for i in (bucketId - 1, bucketId + 1):\\n if i in buckets: # bucket exist\\n if abs(buckets[i] - curVal) < valueDiff: # because valueDiff+1 then check only strict <\\n return True\\n \\n #add current value to bucket\\n buckets[bucketId] = curVal\\n \\n # remove value out of available window\\n if idx >= indexDiff:\\n removeVal = nums[idx - indexDiff]\\n del buckets[removeVal//valueDiff]\\n\\n return False\\n\",\n \"runtime\": \"785\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\\n if t < 0: return False # edge case \\n \\n seen = {}\\n for i, x in enumerate(nums): \\n bkt = x//(t+1)\\n if bkt in seen and i - seen[bkt][0] <= k: return True \\n if bkt-1 in seen and i - seen[bkt-1][0] <= k and abs(x - seen[bkt-1][1]) <= t: return True \\n if bkt+1 in seen and i - seen[bkt+1][0] <= k and abs(x - seen[bkt+1][1]) <= t: return True \\n seen[bkt] = (i, x) \\n return False \",\n \"runtime\": \"825\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n buckets = {}\\n for i, num in enumerate(nums):\\n bucket = num // max(1, valueDiff)\\n if bucket in buckets:\\n return True\\n if bucket-1 in buckets:\\n potentialDuplicate = buckets[bucket-1]\\n if abs(potentialDuplicate-num) <= valueDiff:\\n return True\\n if bucket+1 in buckets:\\n potentialDuplicate = buckets[bucket+1]\\n if abs(potentialDuplicate-num) <= valueDiff:\\n return True\\n if len(buckets) == indexDiff:\\n delBucket = nums[i-indexDiff] // max(1, valueDiff)\\n del buckets[delBucket]\\n buckets[bucket] = num\\n return False\",\n \"runtime\": \"825\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if indexDiff <= 0 or valueDiff < 0:\\n return False\\n\\n seen = {}\\n\\n for i, num in enumerate(nums):\\n bucket = num // (valueDiff + 1)\\n \\n if bucket in seen:\\n return True\\n if bucket - 1 in seen and abs(num - seen[bucket - 1]) <= valueDiff:\\n return True\\n if bucket + 1 in seen and abs(num - seen[bucket + 1]) <= valueDiff:\\n return True\\n\\n seen[bucket] = num\\n\\n if i >= indexDiff:\\n del seen[nums[i - indexDiff] // (valueDiff + 1)]\\n\\n return False\",\n \"runtime\": \"864\"\n },\n {\n \"code\": \"# from sortedcontainers import SortedList\\n\\n# class Solution:\\n# def containsNearbyAlmostDuplicate(self, nums, k, t):\\n# set_ = SortedList()\\n# for i in range(len(nums)):\\n# # Find the successor of current element\\n# idx = set_.bisect_left(nums[i])\\n# if idx != len(set_) and set_[idx] <= nums[i] + t:\\n# return True\\n\\n# # Find the predecessor of current element\\n# if idx > 0 and nums[i] <= set_[idx - 1] + t:\\n# return True\\n\\n# set_.add(nums[i])\\n# if len(set_) > k:\\n# set_.remove(nums[i - k])\\n\\n# return False\\n\\nclass Solution:\\n # Get the ID of the bucket from element value x and bucket width w\\n # Division '/' in Python with '//' performs floor division, which is necessary for correct bucketing.\\n def getID(self, x, w):\\n return (\\n x // w\\n ) # Floor division to handle both positive and negative integers correctly\\n\\n def containsNearbyAlmostDuplicate(self, nums, k, t):\\n if t < 0:\\n return False\\n buckets = {}\\n w = t + 1 # Increment by 1 to handle the range correctly\\n for i in range(len(nums)):\\n bucket = self.getID(nums[i], w)\\n # Check if current bucket is empty, each bucket may contain at most one element\\n if bucket in buckets:\\n return True\\n # Check the neighbor buckets for almost duplicates\\n if bucket - 1 in buckets and abs(nums[i] - buckets[bucket - 1]) < w:\\n return True\\n if bucket + 1 in buckets and abs(nums[i] - buckets[bucket + 1]) < w:\\n return True\\n # Now bucket is empty and no almost duplicates in neighbor buckets\\n buckets[bucket] = nums[i]\\n if i >= k:\\n del buckets[self.getID(nums[i - k], w)]\\n return False\",\n \"runtime\": \"864\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n seen = {}\\n for i, x in enumerate(nums): \\n bkt = x//(valueDiff+1)\\n if bkt in seen and i - seen[bkt][0] <= indexDiff: return True \\n if bkt-1 in seen and i - seen[bkt-1][0] <= indexDiff and abs(x - seen[bkt-1][1]) <= valueDiff: return True \\n if bkt+1 in seen and i - seen[bkt+1][0] <= indexDiff and abs(x - seen[bkt+1][1]) <= valueDiff: return True \\n seen[bkt] = (i, x) \\n return False \\n\\n\\n\",\n \"runtime\": \"904\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\\n if valueDiff < 0:\\n return False\\n buckets = {}\\n width = valueDiff + 1\\n for i, num in enumerate(nums):\\n bucket = num // width\\n if bucket in buckets:\\n return True\\n buckets[bucket] = num\\n if (bucket - 1) in buckets and abs(num - buckets[bucket - 1]) <= valueDiff:\\n return True\\n if (bucket + 1) in buckets and abs(num - buckets[bucket + 1]) <= valueDiff:\\n return True\\n if i >= indexDiff:\\n del buckets[nums[i - indexDiff] // width]\\n return False\",\n \"runtime\": \"904\"\n },\n {\n \"code\": \"class Solution:\\n def binary_search(self, target: int, sorted_integers: list[int] | tuple[int]):\\n if not sorted_integers:\\n return 0\\n\\n back_idx, front_idx = 0, len(sorted_integers) - 1\\n while back_idx <= front_idx:\\n mid_idx = (back_idx + front_idx) // 2\\n if sorted_integers[mid_idx] < target:\\n back_idx = mid_idx + 1\\n continue\\n front_idx = mid_idx - 1\\n\\n return back_idx # Number of ints < target, implying insertion idx.\\n\\n def containsNearbyAlmostDuplicate(self, nums: List[int], index_diff: int, value_diff: int) -> bool:\\n # Sort for binary insertion.\\n window_ints = sorted(nums[: index_diff + 1]) # Window of ints within idx difference.\\n for i in range(len(window_ints) - 1):\\n if window_ints[i + 1] - window_ints[i] <= value_diff:\\n return True\\n\\n back_idx, front_idx = 1, 1 + index_diff\\n while True:\\n if front_idx >= len(nums): # Search reaches the end.\\n return False\\n\\n pop_idx = self.binary_search(nums[back_idx - 1], window_ints)\\n window_ints.pop(pop_idx) # Window's 1st int is out.\\n \\n newcomer = nums[front_idx] # The int that is joining window.\\n insertion_idx = self.binary_search(newcomer, window_ints)\\n\\n if insertion_idx == 0: # Newcomer < all window ints.\\n if window_ints[0] - newcomer <= value_diff:\\n return True\\n\\n elif insertion_idx == len(window_ints): # Newcomer > all window ints.\\n if newcomer - window_ints[-1] <= value_diff:\\n return True\\n\\n else:\\n if min(newcomer - window_ints[insertion_idx - 1], window_ints[insertion_idx] - newcomer) <= value_diff:\\n return True\\n\\n window_ints.insert(insertion_idx, newcomer)\\n back_idx += 1\\n front_idx += 1\\n\",\n \"runtime\": \"944\"\n },\n {\n \"code\": \"class Solution:\\n # Keys: \\n # - each bucket will contain a number wihin valueDiff range\\n # - must check adjacent buckets as well in case current value on edge\\n\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n \\\"\\\"\\\"\\n Time: O(n)\\n Space: O(k) , where k is indexDiff (max buckets)\\n \\\"\\\"\\\"\\n buckets: dict[int,int] = dict()\\n\\n def contains(bucket_id: int, num: int) -> bool:\\n if bucket_id not in buckets:\\n return False\\n return abs(buckets[bucket_id] - num) < (valueDiff + 1)\\n\\n def get_bucket_id(num: int) -> int:\\n return num // (valueDiff + 1)\\n\\n for i, num in enumerate(nums):\\n bucket_id = get_bucket_id(num)\\n # print(f\\\"IN\\\\t{i=} {num=} {bucket_id=} {buckets=}\\\")\\n\\n # check for collision\\n if bucket_id in buckets:\\n return True\\n elif contains(bucket_id - 1, num) or contains(bucket_id + 1, num):\\n return True\\n\\n # insert\\n buckets[bucket_id] = num\\n\\n # evict bc would have collided already\\n if i >= indexDiff:\\n evict_bucket_id = get_bucket_id(nums[i - indexDiff])\\n del buckets[evict_bucket_id]\\n return False\\n\\n\\n def soln_containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n buckets: dict = dict()\\n value_diff = valueDiff + 1\\n\\n def in_bucket(bucket_id) -> bool:\\n return (\\n (bucket_id in buckets) \\n and abs(buckets[bucket_id] - num) < value_diff\\n )\\n\\n for i, num in enumerate(nums):\\n bucket_id = num // value_diff\\n print(f\\\"IN\\\\t{i=} {num=} {bucket_id=} {buckets=}\\\")\\n if bucket_id in buckets:\\n print(f\\\"\\\\tdirect hit!\\\")\\n return True\\n elif in_bucket(bucket_id - 1) or in_bucket(bucket_id + 1):\\n print(f\\\"\\\\tINdirect hit! with {value_diff=}\\\")\\n return True\\n\\n buckets[bucket_id] = num\\n\\n if i >= indexDiff:\\n num = nums[i - indexDiff]\\n del buckets[num // value_diff]\\n print(f\\\"OUT\\\\t{i=} {num=} {bucket_id=} {buckets=}\\\")\\n\\n return False\\n\",\n \"runtime\": \"944\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\\n if valueDiff < 0:\\n return False\\n nums_dict = {}\\n for i in range(len(nums)):\\n bucket = nums[i] // (valueDiff + 1)\\n if bucket in nums_dict:\\n return True\\n if bucket - 1 in nums_dict and abs(nums[i] - nums_dict[bucket - 1]) <= valueDiff:\\n return True\\n if bucket + 1 in nums_dict and abs(nums[i] - nums_dict[bucket + 1]) <= valueDiff:\\n return True\\n nums_dict[bucket] = nums[i]\\n if i >= indexDiff:\\n del nums_dict[nums[i - indexDiff] // (valueDiff + 1)]\\n return False\",\n \"runtime\": \"984\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n \\n window = [] # This will store the last 'indexDiff' elements in sorted order\\n\\n for i, num in enumerate(nums):\\n # Find the position where (num - valueDiff) would be inserted\\n left = bisect.bisect_left(window, num - valueDiff)\\n\\n # Check if there's any number in window within [num - valueDiff, num + valueDiff]\\n if left < len(window) and window[left] <= num + valueDiff:\\n return True # Valid pair found\\n\\n # Insert current number into the sorted window\\n bisect.insort_left(window, num)\\n\\n # If window size exceeds indexDiff, remove the oldest element to maintain the window size\\n if i >= indexDiff:\\n # Remove nums[i - indexDiff] from the window\\n remove_num = nums[i - indexDiff]\\n remove_pos = bisect.bisect_left(window, remove_num)\\n window.pop(remove_pos)\\n\\n return False # No valid pair found\\n\",\n \"runtime\": \"984\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n \\n if valueDiff < 0: return False \\n \\n memo = {}\\n for i, x in enumerate(nums): \\n index = x // (valueDiff + 1)\\n print(index)\\n if index in memo and i - memo[index][0] <= indexDiff: \\n return True \\n if index-1 in memo and i - memo[index-1][0] <= indexDiff and abs(x - memo[index-1][1]) <= valueDiff: \\n return True \\n if index + 1 in memo and i - memo[index+1][0] <= indexDiff and abs(x - memo[index+1][1]) <= valueDiff: \\n return True \\n memo[index] = (i, x) \\n\\n return False \\n \\n \\n \",\n \"runtime\": \"1023\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n k,t = indexDiff, valueDiff\\n d = defaultdict(list)\\n for i, n in enumerate(nums): d[n].append(i)\\n \\n keys = sorted(d.keys())\\n i, j = 0, 0\\n while i < len(keys): \\n x, y = d[keys[i]], d[keys[j]]\\n \\n if i == j:\\n for index in range(len(x)-1):\\n if x[index + 1] - x[index] <= k: return True\\n j += 1\\n elif keys[j] - keys[i] <= t:\\n # z = self.mergeSorted(x, y)\\n z = sorted(x + y)\\n for index in range(len(z)-1):\\n if z[index + 1] - z[index] <= k: return True\\n j += 1\\n else:\\n i = j = i + 1\\n \\n if j >= len(keys): i = j = i + 1\\n \\n return False\\n\\n # seen = {}\\n # for i,n in enumerate(nums):\\n # bkt = n//(valueDiff+1)\\n # if bkt in seen and i - seen[bkt][0] <= indexDiff: return True\\n # if bkt+1 in seen and abs(n - seen[bkt+1][1]) <= valueDiff and i - seen[bkt+1][0] <= indexDiff: return True\\n # if bkt-1 in seen and abs(n - seen[bkt-1][1]) <= valueDiff and i - seen[bkt-1][0] <= indexDiff: return True\\n # seen[bkt] = (i,n)\\n # return False\",\n \"runtime\": \"1023\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nfrom collections import defaultdict\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n bucket_size = valueDiff\\n if valueDiff == 0:\\n bucket_size = 1\\n\\n buckets = defaultdict(set)\\n size = 0\\n\\n for i in range(len(nums)):\\n num = nums[i]\\n\\n index = num // bucket_size\\n if buckets[index]:\\n return True\\n\\n if buckets[index-1]:\\n for candidate in buckets[index-1]:\\n if abs(candidate - num) <= valueDiff:\\n return True\\n\\n if buckets[index+1]:\\n for candidate in buckets[index+1]:\\n if abs(candidate - num) <= valueDiff:\\n return True\\n\\n buckets[index].add(num)\\n if size < indexDiff:\\n size += 1\\n else:\\n to_remove = nums[i - indexDiff]\\n to_remove_index = to_remove // bucket_size\\n buckets[to_remove_index].remove(to_remove)\\n\\n return False\",\n \"runtime\": \"1063\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # sliding window + sortedset, O(nlogn)\\n k = indexDiff + 1\\n window = SortedList()\\n for i in range(len(nums)):\\n # 1. remove old\\n if i - k >= 0:\\n window.remove(nums[i - k])\\n \\n # 2. check if any value lies in [nums[i] - valueDiff, nums[i] + valueDiff]\\n p, q = nums[i] - valueDiff, nums[i] + valueDiff\\n if valueDiff == 0 and nums[i] in window: # 如果p或q直接在window裡面\\n return True\\n # find the insert position for p and q, 如果不同代表有一個值在p和q之間\\n if valueDiff != 0 and window.bisect_left(p) != window.bisect_right(q):\\n return True\\n # 3. add new\\n window.add(nums[i])\\n \\n return False\",\n \"runtime\": \"1063\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n from sortedcontainers import SortedList\\n if indexDiff < 1 or valueDiff < 0:\\n return False\\n \\n sorted_list = SortedList()\\n \\n for i, num in enumerate(nums):\\n # Find the position where `num` could fit in the sorted list\\n pos = sorted_list.bisect_left(num - valueDiff)\\n \\n # Check if there is an element in the sorted list that satisfies the valueDiff condition\\n if pos < len(sorted_list) and abs(sorted_list[pos] - num) <= valueDiff:\\n return True\\n \\n # Add the current number to the sorted list\\n sorted_list.add(num)\\n \\n # Remove the number that is out of the window's range\\n if i >= indexDiff:\\n sorted_list.remove(nums[i - indexDiff])\\n \\n return False\",\n \"runtime\": \"1103\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\\n if indexDiff <= 0 or valueDiff < 0:\\n return False\\n \\n sorted_list = SortedList()\\n \\n for i, num in enumerate(nums):\\n # Binary search for the smallest number >= num - valueDiff\\n pos = sorted_list.bisect_left(num - valueDiff)\\n \\n # Check if there's a number within valueDiff of num\\n if pos < len(sorted_list) and abs(sorted_list[pos] - num) <= valueDiff:\\n return True\\n \\n # Add the current number to the sorted list (sliding window)\\n sorted_list.add(num)\\n \\n # If the window exceeds indexDiff, remove the oldest element\\n if i >= indexDiff:\\n sorted_list.remove(nums[i - indexDiff])\\n \\n return False\\n\\n# Example usage:\\nsol = Solution()\\nprint(sol.containsNearbyAlmostDuplicate([1, 2, 3, 1], 3, 0)) # Output: True\\nprint(sol.containsNearbyAlmostDuplicate([1, 5, 9, 1, 5, 9], 2, 3)) # Output: False\\n\",\n \"runtime\": \"1103\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n N, L, R = list(enumerate(nums)), 0, 1\\n N.sort(key=lambda x:(x[1],x[0])) \\n def check(L, R):\\n for l in range(L, R):\\n for r in range(l+1, R+1):\\n if N[r][1]-N[l][1]<=valueDiff and abs(N[r][0]-N[l][0])<=indexDiff:\\n return True \\n return False \\n while L<R and R<len(N):\\n if check(L, R): return True\\n if N[R][1]-N[L][1]<valueDiff: R+=1\\n else: L += 1\\n if R<=L: R = L+1\\n return False \",\n \"runtime\": \"1222\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n window_size = indexDiff + 1\\n window = SortedList(nums[:window_size] + [float('-inf'), float('inf')])\\n if any(v1 - v0 <= valueDiff for v0, v1 in itertools.pairwise(window)):\\n return True\\n for i in range(window_size, len(nums)):\\n window.remove(nums[i - window_size])\\n j = window.bisect_left(nums[i])\\n window.add(nums[i])\\n if window[j] - window[j - 1] <= valueDiff or window[j + 1] - window[j] <= valueDiff:\\n return True\\n return False\\n \\n\\n \\n\",\n \"runtime\": \"1222\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if indexDiff <= 100:\\n l = len(nums)\\n for i in range(l):\\n for j in range(i+1, min(l, i + indexDiff + 1)):\\n if i != j and nums[i] - nums[j] <= valueDiff and nums[j] - nums[i] <= valueDiff:\\n return True\\n return False\\n\\n buckets = {}\\n l = len(nums)\\n for i in range(l):\\n k = nums[i]\\n if valueDiff != 0: k = int(nums[i] / valueDiff)\\n if k in buckets.keys(): \\n buckets[k].add((i, nums[i]))\\n else:\\n buckets[k] = set()\\n buckets[k].add((i, nums[i]))\\n\\n for i in range(l):\\n k = nums[i]\\n if valueDiff != 0: k = int(nums[i] / valueDiff)\\n for t in buckets[k]:\\n if i - t[0] <= indexDiff and t[0] - i <= indexDiff and i - t[0] != 0:\\n if nums[i] - t[1] <= valueDiff and t[1] - nums[i] <= valueDiff:\\n print(i, nums[i], t[0], t[1])\\n return True \\n if (k-1) in buckets.keys():\\n for t in buckets[k-1]:\\n if i - t[0] <= indexDiff and t[0] - i <= indexDiff and i - t[0] != 0:\\n if nums[i] - t[1] <= valueDiff and t[1] - nums[i] <= valueDiff:\\n print(i, nums[i], t[0], t[1])\\n return True \\n if (k+1) in buckets.keys():\\n for t in buckets[k+1]:\\n if i - t[0] <= indexDiff and t[0] - i <= indexDiff and i - t[0] != 0:\\n if nums[i] - t[1] <= valueDiff and t[1] - nums[i] <= valueDiff:\\n print(i, nums[i], t[0], t[1])\\n return True \\n\\n return False\\n \",\n \"runtime\": \"1262\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n window = SortedList()\\n \\n for i, num in enumerate(nums):\\n if i > indexDiff:\\n window.remove(nums[i - indexDiff - 1])\\n \\n pos1 = window.bisect_left(num - valueDiff)\\n pos2 = window.bisect_right(num + valueDiff)\\n \\n if pos1 != pos2 and pos1 != len(window):\\n return True\\n \\n window.add(num)\\n \\n return False\",\n \"runtime\": \"1262\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nfrom typing import List\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if indexDiff <= 0 or valueDiff < 0:\\n return False\\n \\n sorted_list = SortedList()\\n \\n for i in range(len(nums)):\\n # Maintain a window of size indexDiff\\n if i > indexDiff:\\n sorted_list.remove(nums[i - indexDiff - 1])\\n \\n # Find the position where nums[i] - valueDiff would fit in the sorted list\\n pos = sorted_list.bisect_left(nums[i] - valueDiff)\\n \\n # Check if there is a number in the sorted list within the range [nums[i] - valueDiff, nums[i] + valueDiff]\\n if pos < len(sorted_list) and abs(sorted_list[pos] - nums[i]) <= valueDiff:\\n return True\\n \\n # Add the current number to the sorted list\\n sorted_list.add(nums[i])\\n \\n return False\",\n \"runtime\": \"1301\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n '''\\n \\n '''\\n lookup = defaultdict(list)\\n for index, n in enumerate(nums):\\n lookup[n].append(index)\\n\\n \\n sl = sorted(list(set(nums)))\\n r = 0\\n\\n\\n for i in range(len(sl)):\\n \\n while r < len(sl) and abs(sl[r] - sl[i]) <= valueDiff:\\n r += 1\\n\\n arr = []\\n\\n for j in range(i, r):\\n for idx in lookup[sl[j]]:\\n arr.append(idx)\\n\\n arr.sort()\\n \\n for j in range(1, len(arr)):\\n if arr[j] - arr[j - 1] <= indexDiff:\\n return True\\n\\n\\n return False\\n\",\n \"runtime\": \"1301\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n from sortedcontainers import SortedList\\n sl = SortedList()\\n for i, num in enumerate(nums):\\n if i>indexDiff:\\n sl.remove(nums[i-indexDiff-1])\\n l = sl.bisect_left(num-valueDiff)\\n r = sl.bisect_right(num+valueDiff)\\n if r>l:\\n return True \\n sl.add(num)\\n return False\\n \",\n \"runtime\": \"1341\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\\n if not nums or indexDiff <= 0 or valueDiff < 0:\\n return False\\n \\n sorted_list = SortedList()\\n \\n for i, num in enumerate(nums):\\n # Find the position where the current num could be inserted.\\n pos = sorted_list.bisect_left(num)\\n \\n # Check the left neighbor.\\n if pos > 0 and num - sorted_list[pos - 1] <= valueDiff:\\n return True\\n \\n # Check the right neighbor.\\n if pos < len(sorted_list) and sorted_list[pos] - num <= valueDiff:\\n return True\\n \\n # Add the current number to the sorted list.\\n sorted_list.add(num)\\n \\n # Remove the number that is out of the indexDiff range.\\n if i >= indexDiff:\\n sorted_list.remove(nums[i - indexDiff])\\n \\n return False\\n\",\n \"runtime\": \"1341\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nfrom typing import List\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n window = SortedList()\\n for i in range(len(nums)):\\n # Check if the current number is within the valueDiff from its neighbors\\n pos = window.bisect_left(nums[i])\\n \\n # Check left neighbor\\n if pos > 0 and nums[i] - window[pos - 1] <= valueDiff:\\n return True\\n \\n # Check right neighbor\\n if pos < len(window) and window[pos] - nums[i] <= valueDiff:\\n return True\\n \\n # Add the current number to the sorted list\\n window.add(nums[i])\\n \\n # Remove the number that's out of the indexDiff range\\n if i >= indexDiff:\\n window.remove(nums[i - indexDiff])\\n \\n return False\\n \\n \\n return False\",\n \"runtime\": \"1381\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n from sortedcontainers import SortedList\\n n = len(nums)\\n window = SortedList()\\n \\n left, right = 0, 0\\n while right < n:\\n pos = window.bisect_left(nums[right])\\n if pos < len(window) and window[pos] - nums[right] <= valueDiff:\\n return True\\n if pos > 0 and nums[right] - window[pos - 1] <= valueDiff:\\n return True\\n \\n window.add(nums[right])\\n \\n if right - left >= indexDiff:\\n window.remove(nums[left])\\n left += 1\\n \\n right += 1\\n \\n return False\\n \",\n \"runtime\": \"1381\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n window = SortedList()\\n\\n for i in range(len(nums)):\\n idx = window.bisect_left(nums[i])\\n\\n if idx != len(window) and abs(nums[i] - window[idx]) <= valueDiff:\\n return True\\n\\n if idx > 0 and abs(nums[i] - window[idx - 1]) <= valueDiff:\\n return True\\n\\n window.add(nums[i])\\n\\n if len(window) > indexDiff:\\n window.remove(nums[i - indexDiff])\\n\\n return False\",\n \"runtime\": \"1421\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if indexDiff <= 0 or valueDiff < 0:\\n return False\\n \\n window = SortedSet()\\n for i, num in enumerate(nums):\\n if i > indexDiff:\\n window.remove(nums[i - indexDiff - 1])\\n \\n pos = window.bisect_left(num - valueDiff)\\n if pos < len(window) and window[pos] <= num + valueDiff:\\n return True\\n \\n window.add(num)\\n \\n return False\",\n \"runtime\": \"1421\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n bst = SortedList()\\n for i, num in enumerate(nums):\\n if i > 0:\\n # find closest of num, if the closest <= valueDiff, return True\\n ge = bst.bisect_right(num)\\n if ge < len(bst) and abs(bst[ge] - num) <= valueDiff:\\n return True\\n le = bst.bisect_right(num) - 1\\n if le >= 0 and abs(bst[le] - num) <= valueDiff:\\n return True\\n \\n bst.add(num)\\n if i >= indexDiff:\\n bst.remove(nums[i-indexDiff])\\n return False\\n \",\n \"runtime\": \"1460\"\n },\n {\n \"code\": \"from sortedcontainers import SortedDict\\nfrom typing import List\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n d = SortedDict() # Use 'd' as a sorted dictionary to store indices\\n k = indexDiff\\n v = valueDiff\\n \\n for i in range(len(nums)):\\n # Find the range of potential candidates in the sorted dictionary\\n lower_bound = nums[i] - v\\n upper_bound = nums[i] + v\\n \\n # Check if there are any keys within this range\\n for key in d.irange(lower_bound, upper_bound):\\n if (i - d[key]) <= k:\\n return True\\n \\n # Update the dictionary with the current number and its index\\n d[nums[i]] = i\\n \\n # Remove elements that are out of the indexDiff range\\n if i >= k:\\n del d[nums[i - k]]\\n \\n return False\",\n \"runtime\": \"1460\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if indexDiff <= 0 or valueDiff < 0:\\n return False\\n \\n sl = SortedList(nums[1: 1 + indexDiff]) # Initialize sliding window\\n \\n for j in range(len(nums) - 1):\\n i = sl.bisect_right(nums[j]) # Find position to insert nums[j] in sorted order\\n \\n # Check if nums[j] and closest values in sl satisfy valueDiff condition\\n if i < len(sl) and sl[i] - nums[j] <= valueDiff:\\n return True\\n if i > 0 and nums[j] - sl[i - 1] <= valueDiff:\\n return True\\n \\n # Slide the window: remove the old element and add a new one\\n sl.remove(nums[j + 1]) # Remove the outgoing element from the window\\n if j + 1 + indexDiff < len(nums):\\n sl.add(nums[j + 1 + indexDiff]) # Add the new element into the window\\n \\n return False\\n\",\n \"runtime\": \"1500\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\\n from sortedcontainers import SortedSet\\n if not nums or t < 0: return False # Handle special cases\\n ss, n = SortedSet(), 0 # Create SortedSet. `n` is the size of sortedset, max value of `n` is `k` from input\\n for i, num in enumerate(nums):\\n ceiling_idx = ss.bisect_left(num) # index whose value is greater than or equal to `num`\\n floor_idx = ceiling_idx - 1 # index whose value is smaller than `num`\\n if ceiling_idx < n and abs(ss[ceiling_idx]-num) <= t: return True # check right neighbour \\n if 0 <= floor_idx and abs(ss[floor_idx]-num) <= t: return True # check left neighbour\\n ss.add(num)\\n n += 1\\n if i - k >= 0: # maintain the size of sortedset by finding & removing the earliest number in sortedset\\n ss.remove(nums[i-k])\\n n -= 1\\n return False\",\n \"runtime\": \"1500\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n w = SortedList()\\n \\n for i in range(len(nums)):\\n if i > indexDiff:\\n w.remove(nums[i - indexDiff - 1])\\n num = nums[i]\\n\\n j = w.bisect_left(num)\\n if j < len(w) and abs(num - w[j]) <= valueDiff:\\n return True\\n if j > 0 and abs(num - w[j - 1]) <= valueDiff:\\n return True\\n w.add(num)\\n return False\",\n \"runtime\": \"1540\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if indexDiff <= 0 or valueDiff < 0:\\n return False\\n sorted_window = SortedList()\\n for i in range(len(nums)):\\n if i > indexDiff:\\n sorted_window.remove(nums[i - indexDiff - 1])\\n pos = sorted_window.bisect_left(nums[i])\\n if pos > 0 and abs(nums[i] - sorted_window[pos - 1]) <= valueDiff:\\n return True\\n if pos < len(sorted_window) and abs(nums[i] - sorted_window[pos]) <= valueDiff:\\n return True\\n sorted_window.add(nums[i])\\n return False\",\n \"runtime\": \"1540\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: list[int], indexDiff: int, valueDiff: int) -> bool:\\n if indexDiff <= 0 or valueDiff < 0:\\n return False\\n sorted_list = SortedList()\\n for i, num in enumerate(nums):\\n if i > indexDiff:\\n sorted_list.remove(nums[i - indexDiff - 1])\\n pos = sorted_list.bisect_left(num)\\n if pos < len(sorted_list) and sorted_list[pos] <= num + valueDiff:\\n return True\\n if pos > 0 and sorted_list[pos - 1] >= num - valueDiff:\\n return True\\n sorted_list.add(num)\\n return False\",\n \"runtime\": \"1580\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if indexDiff <= 0 or valueDiff < 0:\\n return False\\n \\n sorted_window = SortedList()\\n \\n for i, num in enumerate(nums):\\n # Maintain a sliding window of at most indexDiff elements\\n if i > indexDiff:\\n sorted_window.remove(nums[i - indexDiff - 1])\\n \\n # Find the position where current num would fit in the sorted window\\n pos = SortedList.bisect_left(sorted_window, num)\\n \\n # Check if the left neighbor (if exists) is within valueDiff\\n if pos > 0 and abs(num - sorted_window[pos - 1]) <= valueDiff:\\n return True\\n \\n # Check if the right neighbor (if exists) is within valueDiff\\n if pos < len(sorted_window) and abs(num - sorted_window[pos]) <= valueDiff:\\n return True\\n \\n # Add current number to the sorted window\\n sorted_window.add(num)\\n \\n return False\",\n \"runtime\": \"1580\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\\n \\n balanced_bst = SortedList([])\\n \\n for i, n in enumerate(nums):\\n \\n indx = balanced_bst.bisect_right(n)\\n \\n le_indx = indx-1\\n ge_indx = indx\\n \\n if le_indx >= 0 and abs(n-balanced_bst[le_indx]) <= t:\\n return True\\n if ge_indx < len(balanced_bst) and abs(balanced_bst[ge_indx]-n) <= t:\\n return True\\n \\n balanced_bst.add(n)\\n \\n if len(balanced_bst) > k:\\n balanced_bst.remove(nums[i-k])\\n \\n return False\\n \\n \\n \\n \\n \",\n \"runtime\": \"1619\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums, k, t):\\n set_ = SortedList()\\n for i in range(len(nums)):\\n # Find the successor of current element\\n idx = set_.bisect_left(nums[i])\\n if idx != len(set_) and set_[idx] <= nums[i] + t:\\n return True\\n\\n # Find the predecessor of current element\\n if idx > 0 and nums[i] <= set_[idx - 1] + t:\\n return True\\n\\n set_.add(nums[i])\\n if len(set_) > k:\\n set_.remove(nums[i - k])\\n\\n return False\",\n \"runtime\": \"1619\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n section = nums[0:indexDiff]\\n section.sort()\\n prev = 0\\n for i in range(0, len(section)-1, 1):\\n if section[i+1] - section[i] <= valueDiff:\\n return True\\n for i in nums[indexDiff:]:\\n index = bisect_right(section, i)\\n section.insert(index, i)\\n if index > 0 and i - section[index-1] <= valueDiff:\\n return True\\n if index < len(section) -1 and section[index+1] - i <= valueDiff:\\n return True\\n section.remove(nums[prev])\\n prev += 1\\n return False\\n \",\n \"runtime\": \"1659\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nfrom typing import List\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # Initially building the window \\n window = SortedList()\\n for i in range(len(nums)):\\n find_index = window.bisect_left(nums[i])\\n greater_eq = float(\\\"inf\\\") if (find_index >= len(window) or find_index < 0) else window[find_index]\\n less = -float(\\\"inf\\\") if (find_index-1 < 0 or find_index-1 >= len(window)) else window[find_index-1]\\n if((greater_eq - nums[i] <= valueDiff) or (nums[i] - less <= valueDiff)):\\n return True\\n window.add(nums[i])\\n if(i >= indexDiff):\\n window.remove(nums[i-indexDiff])\\n return False\\n\",\n \"runtime\": \"1659\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n section = nums[0:indexDiff]\\n section.sort()\\n prev = 0\\n for i in range(0, len(section)-1, 1):\\n if section[i+1] - section[i] <= valueDiff:\\n return True\\n for i in nums[indexDiff:]:\\n index = bisect_right(section, i)\\n section.insert(index, i)\\n if index > 0 and i - section[index-1] <= valueDiff:\\n return True\\n if index < len(section) -1 and section[index+1] - i <= valueDiff:\\n return True\\n section.remove(nums[prev])\\n prev += 1\\n return False\\n \",\n \"runtime\": \"1699\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: list[int], index_diff: int, value_diff: int) -> bool:\\n indexes = SortedList([])\\n index_values = sorted(enumerate(nums), key=lambda num: num[1])\\n ptr = 0\\n for index, value in index_values:\\n while len(indexes) > 0 and value - index_values[ptr][1] > value_diff:\\n indexes.remove(index_values[ptr][0])\\n ptr += 1\\n closest_index = indexes.bisect_left(index)\\n for index_i in [closest_index, closest_index - 1]:\\n if 0 <= index_i < len(indexes) and abs(indexes[index_i] - index) <= index_diff:\\n return True\\n indexes.add(index)\\n return False\\n\\n \",\n \"runtime\": \"1699\"\n },\n {\n \"code\": \"import sortedcontainers\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\\n \\n def floor(n, bst):\\n le = bst.bisect_right(n) - 1\\n return bst[le] if le >= 0 else None\\n \\n def ceiling(n, bst):\\n ge = bst.bisect_right(n)\\n return bst[ge] if ge < len(bst) else None\\n \\n bst = sortedcontainers.SortedList()\\n for i, n in enumerate(nums):\\n le = floor(n, bst)\\n if le is not None and n <= le + t:\\n return True\\n ge = ceiling(n, bst)\\n if ge is not None and ge <= n + t:\\n return True\\n bst.add(n)\\n if len(bst) > k:\\n bst.remove(nums[i-k])\\n return False\\n # time: O(nlogk)\\n # space: O(k)\",\n \"runtime\": \"1739\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nfrom collections import deque\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # at different indices\\n # they are at least as close as indexDiff\\n # the difference between them is less than valdiff\\n \\n # keep track of the last occurenve of every number -> use this for index diff\\n # we want an easy way to keep track of valuediff\\n # maybe we can get something where the value\\n\\n bst = SortedList([nums[0]])\\n bst_length = 1\\n for i in range(1, len(nums)):\\n if i > indexDiff:\\n bst.remove(nums[i-indexDiff-1])\\n bst_length -= 1\\n\\n num = nums[i]\\n\\n if bst.count(num) > 0:\\n return True\\n\\n # left and right will be the same because its where it should get inserted, \\n\\n # print()\\n # print(bst)\\n\\n closest_num_index_right = bst.bisect_left(num) # the number after the current num\\n closest_num_index_left = closest_num_index_right - 1 # the number before the current num\\n\\n closest_num_index_right = min(bst_length - 1, closest_num_index_right) # make sure the number after the current num is in bounds\\n\\n \\n # print(num, left_index, right_index)\\n \\n if min(abs(num - bst[closest_num_index_right]), abs(num - bst[closest_num_index_left])) <= valueDiff:\\n return True\\n\\n bst.add(num)\\n bst_length += 1\\n \\n return False\\n\\n # O(n log indexdiff/n) \\n\\n # only keep track of numbers that are in valid indexdiff through a deque.\\n # maintain a set as well for membership -> remove and add from set based on deque------------------\\n # linear -> going accross every num\\n\\n # maintain a sorted array of them. \\n \\n # have buckets of size valueDiff from 0 to max(nums)\\n\\n # Do binary search on the sorted array to find the closest number -> see if its valid on valuediff\\n # maintain a binary search tree -> the deque points to it so when we want to remove from deque we remove from binary search tree?\\n # -> may be kinda hard to maintain ->\\n \\n \\n #BAD IDEAS\\n # figure out if there is a valid number in valdiff in logn time -> insertion sort -> O(indexDiff) time # no good really because not insertiona and delpetions are not sorted\\n # or do insertions with binary search. -> data structure wont really like that though, maybe used linked list in optimized version\\n\\n \\n\",\n \"runtime\": \"1739\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # In the last k numbers, is there a number such that it is within valueDiff of me?\\n from sortedcontainers import SortedList\\n # sortedlist?\\n sl = SortedList()\\n for i, x in enumerate(nums):\\n closest = sl.bisect_left(x)\\n for d in range(-1,2):\\n idx = closest + d\\n if 0 <= idx < len(sl):\\n if abs(sl[idx] - x) <= valueDiff:\\n return True\\n sl.add(x)\\n if i >= indexDiff:\\n sl.remove(nums[i - indexDiff])\\n return False \\n\\n\\n\",\n \"runtime\": \"1778\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n cap = indexDiff + 1\\n bst = BST()\\n for i in range(len(nums)):\\n if bst.size() == cap:\\n bst.remove(nums[i-cap])\\n bst.add(nums[i])\\n for n in bst.neighbors(nums[i]):\\n if abs(nums[i] - n) <= valueDiff:\\n # print(\\\"i: {}, nums[i]: {}, neighbor: {}\\\".format(i, nums[i], n))\\n return True\\n return False\\n\\nclass BST:\\n def __init__(self):\\n self.data = []\\n\\n def size(self):\\n return len(self.data)\\n\\n def add(self, x):\\n i = self.index(x)\\n self.data.insert(i, x)\\n\\n def remove(self, x):\\n i = self.index(x)\\n del self.data[i]\\n\\n def index(self, x):\\n if len(self.data) == 0:\\n return 0\\n \\n left = 0\\n right = len(self.data)-1\\n while left != right:\\n i = (left + right) // 2\\n if x == self.data[i]:\\n return i\\n elif x > self.data[i]:\\n left = i+1\\n else:\\n right = i\\n if left == len(self.data)-1 and x > self.data[-1]:\\n return len(self.data)\\n return left\\n\\n def neighbors(self, x):\\n i = self.index(x)\\n ret = []\\n if i > 0:\\n ret += [self.data[i-1 ]]\\n if i < len(self.data) - 1:\\n ret += [self.data[i+1]]\\n return ret\",\n \"runtime\": \"1778\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n sl = SortedList()\\n n = len(nums)\\n for i in range(n):\\n if (i - indexDiff > 0):\\n sl.remove(nums[i - indexDiff - 1])\\n \\n sl.add(nums[i])\\n if (i == 0):\\n continue\\n v = nums[i]\\n index_sl = sl.bisect_left(v)\\n \\n diff = valueDiff + 1\\n if (index_sl > 0):\\n diff = min(diff, v - sl[index_sl - 1])\\n if (index_sl < len(sl) - 1):\\n diff = min(diff, sl[index_sl + 1] - v)\\n\\n if (diff <= valueDiff):\\n return True\\n\\n return False\\n\\n \",\n \"runtime\": \"1818\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool: \\n if len(nums)<=1:\\n return False\\n from sortedcontainers import SortedSet\\n hashset = SortedSet()\\n for i in range(len(nums)):\\n if nums[i] in hashset:\\n print('nums[i] in hashset',i,nums[i])\\n return True\\n hashset.add(nums[i])\\n index = hashset.index(nums[i])\\n #print(index,hashset)\\n if index<len(hashset)-1:\\n \\n if (hashset[index+1]-nums[i]) <=valueDiff:\\n return True\\n if index>0: \\n if (nums[i]-hashset[index-1]) <= valueDiff:\\n return True\\n if len(hashset)>indexDiff:\\n hashset.remove(nums[i-indexDiff])\\n return False\",\n \"runtime\": \"1818\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n obs = Sort()\\n for li, ri in LengthBoundSlidingWindow(nums, 0, indexDiff + 1, obs).run():\\n i = obs.elements.bisect_left(nums[ri])\\n if i + 1 < len(obs.elements) and abs(obs.elements[i + 1] - nums[ri]) <= valueDiff:\\n return True\\n if i > 0 and abs(obs.elements[i - 1] - nums[ri]) <= valueDiff:\\n return True\\n return False\\n\\n\\nfrom collections.abc import Sequence\\n\\n\\nclass SlidingWindow:\\n \\\"\\\"\\\"Represents a sliding window algorithm framework.\\n\\n This class provides a structure for implementing sliding window algorithms.\\n Concrete implementations should inherit from this class and override the\\n should_contract_left() and is_window_good() methods.\\n \\\"\\\"\\\"\\n\\n class Observer:\\n\\n def init(self, sequence: Sequence):\\n self.seq = sequence\\n\\n def start_run(self, _range):\\n ...\\n\\n def finish_run(self):\\n ...\\n\\n def enter_cell(self, right_idx: int):\\n ...\\n\\n def exit_cell(self, left_idx: int):\\n ...\\n\\n def __init__(self, sequence: Sequence, observer=None):\\n self.seq = sequence\\n self.observer = observer if observer is not None else self.Observer()\\n self.observer.init(sequence)\\n\\n def should_contract_left(self, left_idx: int, right_idx: int) -> bool:\\n raise NotImplementedError()\\n\\n def is_window_good(self, left_idx: int, right_idx: int) -> bool:\\n raise NotImplementedError()\\n\\n def run(self, _range=None):\\n _range = _range if _range is not None else range(len(self.seq))\\n self.observer.start_run(_range)\\n li = _range.start\\n for ri in _range:\\n self.observer.enter_cell(ri)\\n while li <= ri and self.should_contract_left(li, ri):\\n step = self.observer.exit_cell(li)\\n li += step if step else _range.step\\n if li <= ri and self.is_window_good(li, ri):\\n yield li, ri\\n self.observer.finish_run()\\n\\n\\nclass LengthBoundSlidingWindow(SlidingWindow):\\n\\n def __init__(self, sequence, min_len: int, max_len: int, observer=None):\\n super().__init__(sequence, observer)\\n self.min_len = min_len\\n self.max_len = max_len\\n\\n def should_contract_left(self, li: int, ri: int) -> bool:\\n return ri - li + 1 > self.max_len\\n\\n def is_window_good(self, li: int, ri: int) -> bool:\\n return self.min_len <= ri - li + 1 <= self.max_len\\n\\n\\nclass AggregateBoundSlidingWindow(SlidingWindow):\\n\\n def __init__(self, sequence, min_value, max_value, observer=None):\\n super().__init__(sequence, observer)\\n self.min_value = min_value\\n self.max_value = max_value\\n\\n def should_contract_left(self, li: int, ri: int) -> bool:\\n return self.observer.aggregate() > self.max_value\\n\\n def is_window_good(self, li: int, ri: int) -> bool:\\n return self.min_value <= self.observer.aggregate() <= self.max_value\\n\\n\\nclass Count(SlidingWindow.Observer):\\n\\n def __init__(self):\\n from collections import Counter\\n self.counter = Counter()\\n\\n def start_run(self, _range):\\n self.counter.clear()\\n\\n def enter_cell(self, ri):\\n self.counter[self.seq[ri]] += 1\\n\\n def exit_cell(self, li):\\n val = self.seq[li]\\n self.counter[val] -= 1\\n if self.counter[val] == 0:\\n del self.counter[val]\\n\\n\\nclass Min(SlidingWindow.Observer):\\n\\n def __init__(self, _range):\\n from collections import deque\\n self._queue = deque()\\n\\n def start_run(self, _range):\\n self._queue.clear()\\n\\n def enter_cell(self, ri: int):\\n while self._queue and self.seq[self._queue[-1]] > self.seq[ri]:\\n self._queue.pop()\\n self._queue.append(ri)\\n\\n def exit_cell(self, li: int):\\n while self._queue and self._queue[0] <= li:\\n self._queue.popleft()\\n\\n def min(self):\\n return self.seq[self.min_idx()]\\n\\n def min_idx(self):\\n assert self._queue\\n return self._queue[0]\\n\\n\\nclass Sort(SlidingWindow.Observer):\\n\\n def __init__(self):\\n from sortedcontainers import SortedList\\n self.elements = SortedList()\\n\\n def start_run(self, _range):\\n self.elements.clear()\\n\\n def enter_cell(self, ri: int):\\n self.elements.add(self.seq[ri])\\n\\n def exit_cell(self, li: int):\\n self.elements.remove(self.seq[li])\\n\\n\\nclass Sum(SlidingWindow.Observer):\\n\\n def __init__(self):\\n self.sum = 0\\n\\n def start_run(self, _range):\\n self.sum = 0\\n\\n def enter_cell(self, ri: int):\\n self.sum += self.seq[ri]\\n\\n def exit_cell(self, li: int):\\n self.sum -= self.seq[li]\\n\\n def aggregate(self):\\n return self.sum\",\n \"runtime\": \"1858\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n n = len(nums)\\n left, right = 0, 0\\n ls = []\\n while right < len(nums):\\n rnum = nums[right]\\n idx = bisect_left(ls, rnum)\\n if idx < len(ls) and abs(ls[idx] - rnum) <= valueDiff:\\n # print('a', abs(pnum - rnum))\\n return True\\n if idx - 1 >= 0 and abs(ls[idx - 1] - rnum) <= valueDiff:\\n # print('b', abs(nnum - rnum))\\n return True\\n\\n insort(ls, rnum)\\n right += 1\\n \\n if right - left > indexDiff:\\n lnum = nums[left]\\n ls.remove(lnum)\\n left += 1\\n return False\",\n \"runtime\": \"1858\"\n },\n {\n \"code\": \"class Solution:\\n def getLowerHigher(self, nums, val):\\n id = bisect.bisect_left(nums, val)\\n lower, higher = None, None\\n if id-1>=0:\\n lower = nums[id-1]\\n if id<len(nums):\\n higher = nums[id]\\n return lower, higher, id\\n\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # maintain a sorted_list of size k\\n sorted_list = []\\n for i in range(len(nums)):\\n lower, higher, id = self.getLowerHigher(sorted_list, nums[i])\\n if lower is not None and nums[i]-lower<=valueDiff:\\n return True\\n if higher is not None and higher-nums[i]<=valueDiff:\\n return True\\n \\n sorted_list.insert(id, nums[i])\\n if len(sorted_list)>indexDiff:\\n sorted_list.remove(nums[i-indexDiff])\\n return False\\n\\n \",\n \"runtime\": \"1897\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n \\n if indexDiff<=0 or valueDiff<0: return False\\n window = []\\n for i, num in enumerate(nums):\\n # Find the smallest number greater than or equal to num\\n pos = self.binary_search(window, num)\\n if window:\\n \\n if pos<len(window) and abs(window[pos] - num) <= valueDiff: return True\\n\\n if pos > 0 and abs(window[pos-1] - num) <= valueDiff: return True\\n \\n # Insert the current number into the window\\n window.insert(pos, num)\\n \\n # Maintain the window size as indexDiff\\n if i >= indexDiff:\\n window.remove(nums[i - indexDiff])\\n \\n return False\\n def binary_search(self, arr, target):\\n # This method returns the index where target should be inserted to keep the list sorted\\n left, right = 0, len(arr)\\n while left<right:\\n mid=(left + right) // 2\\n if arr[mid]<target:\\n left=mid+1\\n else:\\n right = mid\\n return left\",\n \"runtime\": \"1897\"\n },\n {\n \"code\": \"class TreeNode:\\n def __init__(self, val: int) -> None:\\n self.val = val\\n self.left = None\\n self.right = None\\n \\n\\ndef remove_node(node: TreeNode) -> Optional[TreeNode]:\\n if not node:\\n return\\n\\n if not node.left and not node.right:\\n return\\n\\n if node.left and not node.right:\\n return node.left\\n\\n if not node.left and node.right:\\n return node.right\\n \\n # both nodes\\n next_node = node.right\\n prev_node = None\\n while True:\\n if next_node.left:\\n prev_node = next_node\\n next_node = next_node.left\\n else:\\n break\\n \\n node.val = next_node.val\\n if not prev_node:\\n node.right = next_node.right\\n else:\\n prev_node.left = next_node.right\\n \\n return node\\n \\n\\nclass BST:\\n # Надо искать сразу diff в дереве\\n def __init__(self):\\n self.root = None\\n \\n def insert(self, val: int) -> None:\\n if not self.root:\\n self.root = TreeNode(val)\\n return\\n \\n node = self.root\\n while node:\\n if val < node.val:\\n if node.left:\\n node = node.left\\n else:\\n node.left = TreeNode(val)\\n return\\n else:\\n if node.right:\\n node = node.right\\n else:\\n node.right = TreeNode(val)\\n return\\n \\n def create_from_sorted(self, arr: list) -> None:\\n self.root = TreeNode(arr[0])\\n node = self.root\\n \\n arr = arr[1:]\\n for n in arr:\\n node.right = TreeNode(n)\\n node = node.right\\n \\n def remove(self, val: int) -> None: \\n if self.root.val == val:\\n self.root = remove_node(self.root)\\n return\\n \\n node = self.root\\n while node:\\n if node.left and val < node.val:\\n if node.left.val == val:\\n node.left = remove_node(node.left)\\n return\\n else:\\n node = node.left\\n \\n elif node.right and val > node.val:\\n if node.right.val == val:\\n node.right = remove_node(node.right)\\n return\\n else:\\n node = node.right\\n \\n else:\\n print(f\\\"DELETE ERROR {val = } {node.val = }\\\")\\n return\\n \\n def has_diff(self, val: int, diff: int) -> bool:\\n node = self.root\\n while node:\\n d = node.val - val\\n if abs(d) <= diff:\\n return True\\n \\n if d < 0:\\n node = node.right\\n else:\\n node = node.left\\n \\n return False\\n \\n def find(self, val: int) -> bool:\\n node = self.root\\n \\n while node:\\n if node.val == val:\\n return True\\n \\n if val < node.val:\\n node = node.left\\n else:\\n node = node.right\\n \\n return False\\n \\n \\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n iters = len(nums) - indexDiff\\n bst = BST()\\n \\n to_insert = nums[1:indexDiff + 1][:]\\n random.shuffle(to_insert)\\n \\n # bst.create_from_sorted(sorted())\\n for n in to_insert:\\n bst.insert(n)\\n \\n if bst.has_diff(nums[0], valueDiff):\\n return True\\n \\n iters = len(nums) - 1\\n for i in range(1, iters):\\n bst.remove(nums[i])\\n \\n if i + indexDiff < len(nums):\\n bst.insert(nums[i + indexDiff])\\n \\n if bst.has_diff(nums[i], valueDiff):\\n return True\\n\\n return False\\n \",\n \"runtime\": \"1937\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n s = SortedSet()\\n window_count = defaultdict(int)\\n left = 0\\n\\n for right in range(len(nums)):\\n window_count[nums[right]] += 1\\n s.add(nums[right])\\n\\n while right - left > indexDiff:\\n # shrink window\\n window_count[nums[left]] -= 1\\n if window_count[nums[left]] == 0:\\n s.discard(nums[left])\\n left += 1\\n \\n # if curr elm in window, its a match\\n if window_count[nums[right]] > 1:\\n return True\\n \\n max_smallest = s.bisect_left(nums[right])\\n if max_smallest != 0:\\n if abs(nums[right] - s[max_smallest - 1]) <= valueDiff:\\n return True\\n \\n min_largest = s.bisect_right(nums[right])\\n if min_largest != len(s):\\n if abs(nums[right] - s[min_largest]) <= valueDiff:\\n return True\\n \\n return False\\n\\n\\n \",\n \"runtime\": \"1937\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n SList = SortedList()\\n for i in range(len(nums)):\\n pos = SList.bisect_left(nums[i])\\n print(pos, nums[i])\\n if pos < len(SList) and SList[pos] - nums[i] <=valueDiff:\\n return True\\n if pos > 0 and nums[i] - SList[pos-1] <=valueDiff:\\n return True\\n SList.add(nums[i])\\n if i + 1> indexDiff:\\n print(\\\"op\\\", i, indexDiff, nums[i-indexDiff])\\n SList.remove(nums[i-indexDiff])\\n return False\",\n \"runtime\": \"1977\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n subset = SortedSet()\\n for i, n in enumerate(nums):\\n subset.add((n, i))\\n pos = subset.bisect_left((n, i))\\n j = pos + 1\\n while j < len(subset):\\n nn, ii = subset[j]\\n if abs(ii - i) > indexDiff:\\n subset.pop(j)\\n else:\\n if abs(nn - n) <= valueDiff:\\n return True\\n break\\n j = pos - 1\\n while j >= 0:\\n nn, ii = subset[j]\\n if abs(ii - i) > indexDiff:\\n subset.pop(j)\\n j -= 1\\n else:\\n if abs(nn - n) <= valueDiff:\\n return True\\n break\\n return False\\n \\n \\n \\n \",\n \"runtime\": \"2017\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # sl = SortedList(nums[:indexDiff + 1])\\n sl = SortedList()\\n for val in nums[:indexDiff + 1]:\\n if val in sl:\\n return True\\n sl.add(val)\\n # if len(sl) < indexDiff + 1:\\n # return True\\n for i in range(len(sl) - 1):\\n if i:\\n if abs(sl[i - 1] - sl[i]) <= valueDiff:\\n return True\\n if i + 1 < len(sl):\\n if abs(sl[i + 1] - sl[i]) <= valueDiff:\\n return True\\n \\n for i in range(indexDiff + 1, len(nums)):\\n ind = sl.bisect_left(nums[i - (indexDiff + 1)])\\n sl.pop(ind)\\n if nums[i] in sl:\\n return True\\n sl.add(nums[i])\\n ind = sl.bisect_left(nums[i])\\n if ind:\\n if abs(sl[ind - 1] - sl[ind]) <= valueDiff:\\n return True\\n if ind + 1 < len(sl):\\n if abs(sl[ind + 1] - sl[ind]) <= valueDiff:\\n return True\\n \\n return False\\n \\n\",\n \"runtime\": \"2056\"\n },\n {\n \"code\": \"class Solution:\\n def update_sorted_arr_w_new_val(self, arr, val): \\n if len(arr) == 1: \\n left_val = right_val = arr[0]\\n if val > arr[0]: \\n arr.append(val)\\n else: \\n arr.insert(0, val)\\n \\n return left_val, right_val\\n\\n mid_idx = floor(len(arr) / 2)\\n left_idx = 0 \\n right_idx = len(arr) - 1 \\n\\n while left_idx <= right_idx: \\n mid_idx = floor((left_idx + right_idx) / 2)\\n if val > arr[mid_idx]: \\n left_idx = mid_idx + 1\\n else: \\n right_idx = mid_idx - 1 \\n #print(mid_idx)\\n \\n left_val = arr[min(left_idx, len(arr)-1)]\\n right_val = arr[max(0, right_idx)]\\n\\n if left_idx > len(arr) - 1: \\n arr.insert(len(arr), val)\\n elif right_idx < 0: \\n arr.insert(0, val)\\n else:\\n arr.insert(left_idx , val)\\n\\n return left_val, right_val\\n\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n sorted_k_arr = []\\n for idx, num in enumerate(nums): \\n if idx == 0: \\n sorted_k_arr.append(num) \\n else: \\n left_val, right_val = self.update_sorted_arr_w_new_val(sorted_k_arr, num)\\n #print(sorted_k_arr, left_val, right_val)\\n if len(sorted_k_arr) > indexDiff: \\n sorted_k_arr.remove(nums[idx - indexDiff]) \\n if abs(num - left_val) <= valueDiff or\\\\\\n abs(num - right_val) <= valueDiff : \\n return True \\n\\n return False \\n\\n \",\n \"runtime\": \"2096\"\n },\n {\n \"code\": \"# from collections import defaultdict\\n\\nclass Solution:\\n def find(self, lst, idxDiff, valDiff):\\n if len(lst) > 4:\\n return True\\n # lst.sort()\\n for i in range(len(lst) - 1):\\n j = i + 1\\n while True:\\n if lst[j][0] - lst[i][0] > idxDiff:\\n break\\n if abs(lst[i][1] - lst[j][1]) <= valDiff:\\n return True\\n j += 1\\n if j >= len(lst):\\n break\\n return False\\n\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n d = dict() #defaultdict(lambda: defaultdict(lambda: []))\\n for i, x in enumerate(nums):\\n omi = i // (indexDiff + 1)\\n omx = x // (valueDiff + 1)\\n \\n\\n for di in [0, 1]:\\n for dx in [0, 1]:\\n mi = omi + di\\n mx = omx + dx\\n k = (mi, mx)\\n if k not in d:\\n d[k] = []\\n d[k].append((i, x))\\n if len(d[k]) > 4:\\n return True\\n \\n for v in d.values():\\n if self.find(v, indexDiff, valueDiff):\\n return True\\n return False\\n\\n \\n\\n\",\n \"runtime\": \"2136\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n\\n def lowerBound(arr, num):\\n ans = -1\\n low = 0\\n high = len(arr) - 1\\n while low <= high:\\n mid = (low + high) // 2\\n if arr[mid] <= num:\\n ans = mid\\n low = mid + 1\\n else:\\n high = mid - 1\\n return ans\\n\\n def upperBound(arr, num):\\n ans = len(arr)\\n low = 0\\n high = len(arr) - 1\\n while low <= high:\\n mid = (low + high) // 2\\n if arr[mid] >= num:\\n ans = mid\\n high = mid - 1\\n else:\\n low = mid + 1\\n return ans\\n\\n currStack = SortedList(nums[:indexDiff + 1])\\n for i in range(1, len(currStack)):\\n if abs(currStack[i] - currStack[i - 1]) <= valueDiff:\\n return True\\n for i in range(indexDiff + 1, len(nums)):\\n currStack.discard(nums[i - indexDiff - 1])\\n a = lowerBound(currStack, nums[i])\\n print(a, i)\\n if a >= 0 and nums[i] - currStack[a] <= valueDiff:\\n return True\\n b = upperBound(currStack, nums[i])\\n if b < len(currStack) and currStack[b] - nums[i] <= valueDiff:\\n return True\\n currStack.add(nums[i])\\n return False\",\n \"runtime\": \"2176\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nimport numpy as np \\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n slist = SortedList()\\n if indexDiff < len(nums)//4:\\n for i in range(len(nums)):\\n for j in range(i+1, i+indexDiff+1):\\n if i+indexDiff == len(nums):\\n break \\n if abs(nums[i]- nums[j]) <= valueDiff:\\n return True \\n else:\\n for i in range(len(nums)):\\n slist.add([nums[i], i])\\n \\n for i in range(len(slist)):\\n if slist[i][0] - slist[-1][0] > valueDiff:\\n return False\\n for j in range(i+1, len(slist)):\\n if abs(slist[i][0]- slist[j][0]) <= valueDiff:\\n if abs(slist[i][1]- slist[j][1]) <= indexDiff:\\n return True\\n else:\\n break\\n return False\\n\\n\",\n \"runtime\": \"2215\"\n },\n {\n \"code\": \"# from collections import defaultdict\\n\\nclass Solution:\\n def find(self, lst, idxDiff, valDiff):\\n if len(lst) > 4:\\n return True\\n # lst.sort()\\n for i in range(len(lst) - 1):\\n j = i + 1\\n while True:\\n if lst[j][0] - lst[i][0] > idxDiff:\\n break\\n if abs(lst[i][1] - lst[j][1]) <= valDiff:\\n return True\\n j += 1\\n if j >= len(lst):\\n break\\n return False\\n\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n d = dict() #defaultdict(lambda: defaultdict(lambda: []))\\n for i, x in enumerate(nums):\\n omi = i // (indexDiff + 1)\\n omx = x // (valueDiff + 1)\\n \\n\\n for di in [0, 1]:\\n for dx in [0, 1]:\\n mi = omi + di\\n mx = omx + dx\\n k = (mi, mx)\\n if k not in d:\\n d[k] = []\\n d[k].append((i, x))\\n \\n for v in d.values():\\n if self.find(v, indexDiff, valueDiff):\\n return True\\n return False\\n\\n \\n\\n\",\n \"runtime\": \"2255\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n bst = None\\n for i in range(len(nums)):\\n if bst is None:\\n bst = AVLTreeNode(nums[i])\\n else:\\n if abs(nums[i] - bst.findClosest(nums[i])) <= valueDiff:\\n return True\\n bst = bst.insert(nums[i])\\n if i - indexDiff >= 0:\\n bst = bst.remove(nums[i - indexDiff])\\n return False\\n\\nclass AVLTreeNode:\\n def __init__(self, value):\\n self.value = value\\n self.balance = 0 # defined as self.left.height - self.right.height\\n self.height = 1\\n self.left = None # smaller than or equal to\\n self.right = None\\n\\n def insert(self, k):\\n if k <= self.value:\\n if not self.left:\\n self.left = AVLTreeNode(k)\\n else:\\n self.left = self.left.insert(k)\\n else:\\n if not self.right:\\n self.right = AVLTreeNode(k)\\n else:\\n self.right = self.right.insert(k)\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\\n\\n # balance self\\n if self.balance > 1:\\n if self.left.balance >= 0:\\n return self.right_rotate()\\n else:\\n self.left = self.left.left_rotate()\\n return self.right_rotate()\\n elif self.balance < -1:\\n if self.right.balance <= 0:\\n return self.left_rotate()\\n else:\\n self.right = self.right.right_rotate()\\n return self.left_rotate()\\n return self\\n\\n def remove(self, k):\\n if k < self.value:\\n if self.left:\\n self.left = self.left.remove(k)\\n elif k > self.value:\\n if self.right:\\n self.right = self.right.remove(k)\\n else:\\n if not self.left:\\n return self.right\\n elif not self.right:\\n return self.left\\n temp = self.right.find_min()\\n self.value = temp.value\\n self.right = self.right.remove(temp.value)\\n\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\\n\\n if self.balance > 1:\\n if self.left.balance >= 0:\\n return self.right_rotate()\\n else:\\n self.left = self.left.left_rotate()\\n return self.right_rotate()\\n elif self.balance < -1:\\n if self.right.balance <= 0:\\n return self.left_rotate()\\n else:\\n print(self.right)\\n self.right = self.right.right_rotate()\\n return self.left_rotate()\\n return self\\n\\n def find_min(self):\\n if self.left is None:\\n return self\\n else:\\n return self.left.find_min()\\n\\n def findClosest(self, k):\\n closest = self.value\\n if k < self.value:\\n if self.left:\\n left_closest = self.left.findClosest(k)\\n if abs(k - left_closest) < abs(k - closest):\\n closest = left_closest\\n elif k > self.value:\\n if self.right:\\n right_closest = self.right.findClosest(k)\\n if abs(k - right_closest) < abs(k - closest):\\n closest = right_closest\\n return closest\\n\\n def left_rotate(self):\\n new_root = self.right\\n if new_root is None: # Ensure the new root exists\\n return self\\n self.right = new_root.left\\n new_root.left = self\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\\n return new_root\\n\\n def right_rotate(self):\\n new_root = self.left\\n if new_root is None:\\n return self # Safety check, should not happen if the tree is correctly balanced\\n self.left = new_root.right\\n new_root.right = self\\n # Update heights\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\\n return new_root\\n\\n\",\n \"runtime\": \"2255\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n\\n window = SortedList(nums[:indexDiff + 1])\\n n = len(nums)\\n\\n for center in range(n):\\n\\n if nums[center] in window:\\n window.remove(nums[center])\\n \\n if center > indexDiff:\\n window.remove(nums[center - 1 - indexDiff])\\n \\n # print(nums[center],window)\\n # Check current window\\n l = window.bisect_left(nums[center] - valueDiff)\\n r = window.bisect_right(nums[center] + valueDiff)\\n if r - l >= 1:\\n return True\\n\\n window.add(nums[center])\\n if center+indexDiff+1 < n:\\n window.add(nums[center+indexDiff+1])\\n \\n return False\\n\",\n \"runtime\": \"2295\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n bst = None\\n for i in range(len(nums)):\\n if bst is None:\\n bst = AVLTreeNode(nums[i])\\n else:\\n if abs(nums[i] - bst.findClosest(nums[i])) <= valueDiff:\\n return True\\n bst = bst.insert(nums[i])\\n if i - indexDiff >= 0:\\n bst = bst.remove(nums[i - indexDiff])\\n return False\\n\\nclass AVLTreeNode:\\n def __init__(self, value):\\n self.value = value\\n self.balance = 0 # defined as self.left.height - self.right.height\\n self.height = 1\\n self.left = None # smaller than or equal to\\n self.right = None\\n\\n def insert(self, k):\\n if k <= self.value:\\n if not self.left:\\n self.left = AVLTreeNode(k)\\n else:\\n self.left = self.left.insert(k)\\n else:\\n if not self.right:\\n self.right = AVLTreeNode(k)\\n else:\\n self.right = self.right.insert(k)\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\\n\\n # balance self\\n if self.balance > 1:\\n if self.left.balance >= 0:\\n return self.right_rotate()\\n else:\\n self.left = self.left.left_rotate()\\n return self.right_rotate()\\n elif self.balance < -1:\\n if self.right.balance <= 0:\\n return self.left_rotate()\\n else:\\n self.right = self.right.right_rotate()\\n return self.left_rotate()\\n return self\\n\\n def remove(self, k):\\n if k < self.value:\\n if self.left:\\n self.left = self.left.remove(k)\\n elif k > self.value:\\n if self.right:\\n self.right = self.right.remove(k)\\n else:\\n if not self.left:\\n return self.right\\n elif not self.right:\\n return self.left\\n temp = self.right.find_min()\\n self.value = temp.value\\n self.right = self.right.remove(temp.value)\\n\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\\n\\n if self.balance > 1:\\n if self.left.balance >= 0:\\n return self.right_rotate()\\n else:\\n self.left = self.left.left_rotate()\\n return self.right_rotate()\\n elif self.balance < -1:\\n if self.right.balance <= 0:\\n return self.left_rotate()\\n else:\\n print(self.right)\\n self.right = self.right.right_rotate()\\n return self.left_rotate()\\n return self\\n\\n def find_min(self):\\n if self.left is None:\\n return self\\n else:\\n return self.left.find_min()\\n\\n def findClosest(self, k):\\n closest = self.value\\n if k < self.value:\\n if self.left:\\n left_closest = self.left.findClosest(k)\\n if abs(k - left_closest) < abs(k - closest):\\n closest = left_closest\\n elif k > self.value:\\n if self.right:\\n right_closest = self.right.findClosest(k)\\n if abs(k - right_closest) < abs(k - closest):\\n closest = right_closest\\n return closest\\n\\n def left_rotate(self):\\n new_root = self.right\\n if new_root is None: # Ensure the new root exists\\n return self\\n self.right = new_root.left\\n new_root.left = self\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\\n return new_root\\n\\n def right_rotate(self):\\n new_root = self.left\\n if new_root is None:\\n return self # Safety check, should not happen if the tree is correctly balanced\\n self.left = new_root.right\\n new_root.right = self\\n # Update heights\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\\n return new_root\\n\\n\",\n \"runtime\": \"2335\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n bst = None\\n for i in range(len(nums)):\\n if bst is None:\\n bst = AVLTreeNode(nums[i])\\n else:\\n if abs(nums[i] - bst.findClosest(nums[i])) <= valueDiff:\\n return True\\n bst = bst.insert(nums[i])\\n if i - indexDiff >= 0:\\n bst = bst.remove(nums[i - indexDiff])\\n return False\\n\\nclass AVLTreeNode:\\n def __init__(self, value):\\n self.value = value\\n self.balance = 0 # defined as self.left.height - self.right.height\\n self.height = 1\\n self.left = None # smaller than or equal to\\n self.right = None\\n\\n def insert(self, k):\\n if k <= self.value:\\n if not self.left:\\n self.left = AVLTreeNode(k)\\n else:\\n self.left = self.left.insert(k)\\n else:\\n if not self.right:\\n self.right = AVLTreeNode(k)\\n else:\\n self.right = self.right.insert(k)\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\\n\\n # balance self\\n if self.balance > 1:\\n if self.left.balance >= 0:\\n return self.right_rotate()\\n else:\\n self.left = self.left.left_rotate()\\n return self.right_rotate()\\n elif self.balance < -1:\\n if self.right.balance <= 0:\\n return self.left_rotate()\\n else:\\n self.right = self.right.right_rotate()\\n return self.left_rotate()\\n return self\\n\\n def remove(self, k):\\n if k < self.value:\\n if self.left:\\n self.left = self.left.remove(k)\\n elif k > self.value:\\n if self.right:\\n self.right = self.right.remove(k)\\n else:\\n if not self.left:\\n return self.right\\n elif not self.right:\\n return self.left\\n temp = self.right.find_min()\\n self.value = temp.value\\n self.right = self.right.remove(temp.value)\\n\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\\n\\n if self.balance > 1:\\n if self.left.balance >= 0:\\n return self.right_rotate()\\n else:\\n self.left = self.left.left_rotate()\\n return self.right_rotate()\\n elif self.balance < -1:\\n if self.right.balance <= 0:\\n return self.left_rotate()\\n else:\\n self.right = self.right.right_rotate()\\n return self.left_rotate()\\n return self\\n\\n def find_min(self):\\n if self.left is None:\\n return self\\n else:\\n return self.left.find_min()\\n\\n def findClosest(self, k):\\n closest = self.value\\n if k < self.value:\\n if self.left:\\n left_closest = self.left.findClosest(k)\\n if abs(k - left_closest) < abs(k - closest):\\n closest = left_closest\\n elif k > self.value:\\n if self.right:\\n right_closest = self.right.findClosest(k)\\n if abs(k - right_closest) < abs(k - closest):\\n closest = right_closest\\n return closest\\n\\n def left_rotate(self):\\n new_root = self.right\\n if new_root is None: # Ensure the new root exists\\n return self\\n self.right = new_root.left\\n new_root.left = self\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\\n return new_root\\n\\n def right_rotate(self):\\n new_root = self.left\\n if new_root is None:\\n return self # Safety check, should not happen if the tree is correctly balanced\\n self.left = new_root.right\\n new_root.right = self\\n # Update heights\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\\n return new_root\\n\\n\",\n \"runtime\": \"2335\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.bit = [0 for i in range(100005)]\\n def update(self, index, val):\\n i = index\\n while i <= 100001:\\n self.bit[i] += val\\n i += i & -i\\n def query(self, index):\\n i = index\\n ans = 0\\n while i > 0:\\n ans += self.bit[i]\\n i -= i & -i\\n return ans\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n indexedArray = []\\n for (i, number) in enumerate(nums):\\n indexedArray.append([number, i+1])\\n indexedArray.sort(key = lambda x:(x[0], x[1]))\\n\\n bptr = -1\\n for i in range(len(indexedArray)):\\n while bptr+1 < len(indexedArray) and indexedArray[bptr+1][0]+valueDiff < indexedArray[i][0]:\\n self.update(indexedArray[bptr+1][1], -1)\\n bptr+=1\\n currIndex = indexedArray[i][1]\\n amt = self.query(min(currIndex+indexDiff, 100001)) - self.query(max(currIndex-indexDiff-1,0))\\n\\n self.update(currIndex, 1)\\n\\n if amt > 0:\\n return True\\n return False\\n \",\n \"runtime\": \"2374\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList as sl\\ndef check(arr,id,vd):\\n q = sl([arr[0]])\\n n = len(arr)\\n for i in range(1,n):\\n p = len(q)\\n if p > id:\\n # print(i,q)\\n q.remove(arr[i-id-1])\\n val = arr[i]\\n p = len(q)\\n if p:\\n i1 = q.bisect_left(val-vd)\\n i2 = q.bisect_left(val+vd)\\n i1 = min(max(0,i1),p-1)\\n i2 = min(max(0,i2),p-1)\\n for xx in range(i1,i2+1):\\n if val-vd<=q[xx]<=val+vd:\\n return True\\n q.add(val)\\n return False\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, arr: List[int], id: int, vd: int) -> bool:\\n a1 = check(arr,id,vd) \\n # a2 = check(arr[::-1],id,vd)\\n # print(a1,a2)\\n return a1 or check(arr[::-1],id,vd)\",\n \"runtime\": \"2414\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # maintain a window. sort the first time. Search for nums\\n # remove num, add the next num\\n # looks for the target. removes and returns true or false if there is a pair\\n def binaryRemove(arr, target):\\n left, right = 0, len(arr) - 1\\n while left <= right:\\n mid = (left + right) // 2\\n if arr[mid] == target:\\n #found it\\n result = False\\n if mid+1 in range(len(arr)) and abs(arr[mid + 1] - arr[mid]) <= valueDiff:\\n result = True\\n if mid-1 in range(len(arr)) and abs(arr[mid - 1] - arr[mid]) <= valueDiff:\\n result = True\\n arr.pop(mid)\\n return result\\n elif arr[mid] < target:\\n left = mid + 1\\n else:\\n right = mid - 1\\n # insert with binarySearch and return the new array\\n def binaryInsert(arr, target):\\n left, right = 0, len(arr) - 1\\n while left <= right:\\n mid = (left + right) // 2\\n if arr[mid] == target:\\n arr.insert(mid, target)\\n return\\n elif arr[mid] < target:\\n left = mid + 1\\n else:\\n right = mid - 1\\n arr.insert(left, target)\\n return\\n \\n initialWindow = nums[: indexDiff + 1]\\n initialWindow.sort()\\n for i in range(len(nums)):\\n #remove i\\n num = nums[i]\\n if binaryRemove(initialWindow, num) is True:\\n return True\\n #add i + indexDiff + 1 if it exists\\n if i + indexDiff + 1 < len(nums):\\n binaryInsert(initialWindow, nums[i + indexDiff + 1])\\n return False\\n \\n \",\n \"runtime\": \"2454\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n st=SortedList()\\n ans=float(inf)\\n for i in range(len(nums)):\\n if i>indexDiff:\\n st.remove(nums[i-indexDiff-1])\\n spot=st.bisect_left(nums[i])\\n if spot!=0:\\n ans=min(ans,abs(nums[i]-st[spot-1]))\\n if spot<=len(st)-1:\\n ans=min(ans,abs(nums[i]-st[spot]))\\n st.add(nums[i])\\n if ans<=valueDiff:\\n return True\\n return False\\n\\n\\n \",\n \"runtime\": \"2494\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # first, create a window of indexDiff numbers\\n window = nums[:min(len(nums), indexDiff+1)]\\n window.sort()\\n window_size = len(window)\\n\\n # iterate over initial window\\n for i in range(1, window_size):\\n if window[i] - window[i-1] <= valueDiff:\\n return True\\n\\n # use binary search to find close numbers in current window, then shift window\\n for i in range(len(nums)-window_size):\\n # find index of element to remove from window\\n remove_idx = bisect_left(window, nums[i])\\n\\n window = window[:remove_idx] + window[remove_idx+1:]\\n\\n # find index to add new element to window\\n add_idx = bisect_left(window, nums[i+window_size]) \\n\\n window = window[:add_idx] + [nums[i+window_size]] + window[add_idx:]\\n \\n if add_idx > 0 and abs(window[add_idx] - window[add_idx-1]) <= valueDiff:\\n return True\\n\\n if add_idx < len(window)-1 and abs(window[add_idx] - window[add_idx+1]) <= valueDiff:\\n return True\\n\\n return False\",\n \"runtime\": \"2533\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n sl = SortedList()\\n sl_diff = SortedList()\\n n = len(nums)\\n MAXV = int(1e9)\\n nums = [v + MAXV for v in nums]\\n for i in range(n):\\n if (i - indexDiff > 0):\\n v = nums[i - indexDiff - 1]\\n index_sl = sl.bisect_left((v, i - indexDiff - 1))\\n if (index_sl > 0):\\n diff = v - sl[index_sl - 1][0]\\n sl_diff.remove((diff, i - indexDiff - 1))\\n if (index_sl <= indexDiff - 1):\\n diff = sl[index_sl + 1][0] - v\\n sl_diff.remove((diff, sl[index_sl + 1][1]))\\n\\n if (index_sl > 0 and index_sl <= indexDiff - 1):\\n new_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\\n sl_diff.add((new_diff, sl[index_sl + 1][1]))\\n sl.remove((v, i - indexDiff - 1))\\n\\n sl.add((nums[i], i))\\n if (i == 0):\\n continue\\n v = nums[i]\\n index_sl = sl.bisect_left((v, i))\\n if (index_sl > 0 and index_sl < len(sl) - 1):\\n back_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\\n sl_diff.remove((back_diff, sl[index_sl + 1][1]))\\n\\n if (index_sl > 0):\\n diff = v - sl[index_sl - 1][0]\\n sl_diff.add((diff, i))\\n if (index_sl < len(sl) - 1):\\n diff = sl[index_sl + 1][0] - v\\n sl_diff.add((diff, sl[index_sl + 1][1]))\\n\\n if (sl_diff[0][0] <= valueDiff):\\n return True\\n\\n return False\\n\\n \",\n \"runtime\": \"2573\"\n },\n {\n \"code\": \"class Node(object):\\n def __init__(self, val):\\n self.val = val\\n self.left = None\\n self.right = None\\n self.height = 1\\n\\n\\nclass AVLTree(object):\\n def __init__(self):\\n self.root = None\\n self.size = 0\\n \\n\\t\\t\\t\\t\\n def height(self, node):\\n if node:\\n return node.height\\n return 0\\n \\n\\t\\t\\n def setHeight(self, node):\\n if node is None:\\n return 0\\n return 1 + max(self.height(node.left), self.height(node.right))\\n \\n\\t\\t\\n def rightRotate(self, node):\\n new_root = node.left\\n node.left = node.left.right\\n new_root.right = node\\n node.height = self.setHeight(node)\\n new_root.height = self.setHeight(new_root)\\n return new_root\\n \\n \\n def leftRotate(self, node):\\n new_root = node.right\\n node.right = node.right.left\\n new_root.left = node\\n node.height = self.setHeight(node)\\n new_root.height = self.setHeight(new_root)\\n return new_root\\n \\n \\n def insert(self, node, val):\\n if node == self.root:\\n self.size += 1\\n # Returns a Node pointing to updated subtree\\n if node is None:\\n return Node(val)\\n if node.val < val:\\n node.right = self.insert(node.right, val)\\n else:\\n node.left = self.insert(node.left, val)\\n balance = self.height(node.left) - self.height(node.right)\\n if balance > 1:\\n if self.height(node.left.left) > self.height(node.left.right):\\n node = self.rightRotate(node)\\n else:\\n node.left = self.leftRotate(node.left)\\n node = self.rightRotate(node)\\n elif balance < -1:\\n if self.height(node.right.right) > self.height(node.right.left):\\n node = self.leftRotate(node)\\n else:\\n node.right = self.rightRotate(node.right)\\n node = self.leftRotate(node)\\n else:\\n node.height = self.setHeight(node)\\n return node\\n \\n \\n def getMinValNode(self, node):\\n if node is None or node.left is None:\\n return node\\n return self.getMinValNode(node.left)\\n \\n\\t\\t\\n def remove(self, node, val):\\n if node is None:\\n return None\\n if node.val < val:\\n node.right = self.remove(node.right, val)\\n elif node.val > val:\\n node.left = self.remove(node.left, val)\\n else:\\n if node.left is None:\\n return node.right\\n elif node.right is None:\\n return node.left\\n else:\\n right_min_val_node = self.getMinValNode(node.right)\\n node.val = right_min_val_node.val\\n node.right = self.remove(node.right, right_min_val_node.val)\\n \\n node.height = self.setHeight(node)\\n balance = self.height(node.left) - self.height(node.right)\\n if balance > 1:\\n if self.height(node.left.left) > self.height(node.left.right):\\n node = self.rightRotate(node)\\n else:\\n node.left = self.leftRotate(node.left)\\n node = self.rightRotate(node)\\n elif balance < -1:\\n if self.height(node.right.right) > self.height(node.right.left):\\n node = self.leftRotate(node)\\n else:\\n node.right = self.rightRotate(node.right)\\n node = self.leftRotate(node)\\n else:\\n node.height = self.setHeight(node)\\n return node\\n \\n \\n def predecessor(self, node, val):\\n if node is None:\\n return None\\n if node.val == val:\\n return val\\n elif node.val > val:\\n return self.predecessor(node.left, val)\\n else:\\n right_res = self.predecessor(node.right, val)\\n return right_res if right_res else node.val \\n \\n\\t\\t\\t\\t\\t\\t\\n def successor(self, node, val):\\n if node is None:\\n return None\\n if node.val == val:\\n return val\\n elif node.val < val:\\n return self.successor(node.right, val)\\n else:\\n left_res = self.successor(node.left, val)\\n return left_res if left_res else node.val\\n \\n\\nclass Solution(object):\\n def containsNearbyAlmostDuplicate(self, nums, k, t):\\n avltree = AVLTree()\\n root = avltree.root\\n for i, num in enumerate(nums): \\n predecessor = avltree.predecessor(root, num)\\n if predecessor is not None and abs(predecessor - num) <= t:\\n return True\\n successor = avltree.successor(root, num)\\n if successor is not None and abs(successor - num) <= t:\\n return True\\n \\n root = avltree.insert(root, num)\\n \\n if avltree.size > k:\\n root = avltree.remove(root, nums[i-k])\\n \\n return False\",\n \"runtime\": \"2613\"\n },\n {\n \"code\": \"class Node(object):\\n def __init__(self, val):\\n self.val = val\\n self.left = None\\n self.right = None\\n self.height = 1\\n\\n\\nclass AVLTree(object):\\n def __init__(self):\\n self.root = None\\n self.size = 0\\n \\n\\t\\t\\t\\t\\n def height(self, node):\\n if node:\\n return node.height\\n return 0\\n \\n\\t\\t\\n def setHeight(self, node):\\n if node is None:\\n return 0\\n return 1 + max(self.height(node.left), self.height(node.right))\\n \\n\\t\\t\\n def rightRotate(self, node):\\n new_root = node.left\\n node.left = node.left.right\\n new_root.right = node\\n node.height = self.setHeight(node)\\n new_root.height = self.setHeight(new_root)\\n return new_root\\n \\n \\n def leftRotate(self, node):\\n new_root = node.right\\n node.right = node.right.left\\n new_root.left = node\\n node.height = self.setHeight(node)\\n new_root.height = self.setHeight(new_root)\\n return new_root\\n \\n \\n def insert(self, node, val):\\n if node == self.root:\\n self.size += 1\\n # Returns a Node pointing to updated subtree\\n if node is None:\\n return Node(val)\\n if node.val < val:\\n node.right = self.insert(node.right, val)\\n else:\\n node.left = self.insert(node.left, val)\\n balance = self.height(node.left) - self.height(node.right)\\n if balance > 1:\\n if self.height(node.left.left) > self.height(node.left.right):\\n node = self.rightRotate(node)\\n else:\\n node.left = self.leftRotate(node.left)\\n node = self.rightRotate(node)\\n elif balance < -1:\\n if self.height(node.right.right) > self.height(node.right.left):\\n node = self.leftRotate(node)\\n else:\\n node.right = self.rightRotate(node.right)\\n node = self.leftRotate(node)\\n else:\\n node.height = self.setHeight(node)\\n return node\\n \\n \\n def getMinValNode(self, node):\\n if node is None or node.left is None:\\n return node\\n return self.getMinValNode(node.left)\\n \\n\\t\\t\\n def remove(self, node, val):\\n if node is None:\\n return None\\n if node.val < val:\\n node.right = self.remove(node.right, val)\\n elif node.val > val:\\n node.left = self.remove(node.left, val)\\n else:\\n if node.left is None:\\n return node.right\\n elif node.right is None:\\n return node.left\\n else:\\n right_min_val_node = self.getMinValNode(node.right)\\n node.val = right_min_val_node.val\\n node.right = self.remove(node.right, right_min_val_node.val)\\n \\n node.height = self.setHeight(node)\\n balance = self.height(node.left) - self.height(node.right)\\n if balance > 1:\\n if self.height(node.left.left) > self.height(node.left.right):\\n node = self.rightRotate(node)\\n else:\\n node.left = self.leftRotate(node.left)\\n node = self.rightRotate(node)\\n elif balance < -1:\\n if self.height(node.right.right) > self.height(node.right.left):\\n node = self.leftRotate(node)\\n else:\\n node.right = self.rightRotate(node.right)\\n node = self.leftRotate(node)\\n else:\\n node.height = self.setHeight(node)\\n return node\\n \\n \\n def predecessor(self, node, val):\\n if node is None:\\n return None\\n if node.val == val:\\n return val\\n elif node.val > val:\\n return self.predecessor(node.left, val)\\n else:\\n right_res = self.predecessor(node.right, val)\\n return right_res if right_res else node.val \\n \\n\\t\\t\\t\\t\\t\\t\\n def successor(self, node, val):\\n if node is None:\\n return None\\n if node.val == val:\\n return val\\n elif node.val < val:\\n return self.successor(node.right, val)\\n else:\\n left_res = self.successor(node.left, val)\\n return left_res if left_res else node.val\\n \\n\\nclass Solution(object):\\n def containsNearbyAlmostDuplicate(self, nums, k, t):\\n \\\"\\\"\\\"\\n :type nums: List[int]\\n :type k: int\\n :type t: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n avltree = AVLTree()\\n root = avltree.root\\n for i, num in enumerate(nums): \\n predecessor = avltree.predecessor(root, num)\\n if predecessor is not None and abs(predecessor - num) <= t:\\n return True\\n successor = avltree.successor(root, num)\\n if successor is not None and abs(successor - num) <= t:\\n return True\\n \\n root = avltree.insert(root, num)\\n \\n if avltree.size > k:\\n root = avltree.remove(root, nums[i-k])\\n \\n return False\",\n \"runtime\": \"2653\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n sl = SortedList()\\n sl_diff = SortedList()\\n n = len(nums)\\n MAXV = int(1e9)\\n nums = [v + MAXV for v in nums]\\n for i in range(n):\\n print(\\\"index: \\\", i)\\n if (i - indexDiff > 0):\\n v = nums[i - indexDiff - 1]\\n index_sl = sl.bisect_left((v, i - indexDiff - 1))\\n if (index_sl > 0):\\n diff = v - sl[index_sl - 1][0]\\n sl_diff.remove((diff, i - indexDiff - 1))\\n if (index_sl <= indexDiff - 1):\\n diff = sl[index_sl + 1][0] - v\\n sl_diff.remove((diff, sl[index_sl + 1][1]))\\n\\n if (index_sl > 0 and index_sl <= indexDiff - 1):\\n new_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\\n sl_diff.add((new_diff, sl[index_sl + 1][1]))\\n sl.remove((v, i - indexDiff - 1))\\n\\n sl.add((nums[i], i))\\n if (i == 0):\\n continue\\n v = nums[i]\\n index_sl = sl.bisect_left((v, i))\\n if (index_sl > 0 and index_sl < len(sl) - 1):\\n back_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\\n sl_diff.remove((back_diff, sl[index_sl + 1][1]))\\n\\n if (index_sl > 0):\\n diff = v - sl[index_sl - 1][0]\\n sl_diff.add((diff, i))\\n if (index_sl < len(sl) - 1):\\n diff = sl[index_sl + 1][0] - v\\n sl_diff.add((diff, sl[index_sl + 1][1]))\\n\\n if (sl_diff[0][0] <= valueDiff):\\n return True\\n\\n return False\\n\\n \",\n \"runtime\": \"2692\"\n },\n {\n \"code\": \"class Node(object):\\n def __init__(self, val):\\n self.val = val\\n self.left = None\\n self.right = None\\n self.height = 1\\n\\n\\nclass AVLTree(object):\\n def __init__(self):\\n self.root = None\\n self.size = 0\\n \\n\\t\\t\\t\\t\\n def height(self, node):\\n if node:\\n return node.height\\n return 0\\n \\n\\t\\t\\n def setHeight(self, node):\\n if node is None:\\n return 0\\n return 1 + max(self.height(node.left), self.height(node.right))\\n \\n\\t\\t\\n def rightRotate(self, node):\\n new_root = node.left\\n node.left = node.left.right\\n new_root.right = node\\n node.height = self.setHeight(node)\\n new_root.height = self.setHeight(new_root)\\n return new_root\\n \\n \\n def leftRotate(self, node):\\n new_root = node.right\\n node.right = node.right.left\\n new_root.left = node\\n node.height = self.setHeight(node)\\n new_root.height = self.setHeight(new_root)\\n return new_root\\n \\n \\n def insert(self, node, val):\\n if node == self.root:\\n self.size += 1\\n # Returns a Node pointing to updated subtree\\n if node is None:\\n return Node(val)\\n if node.val < val:\\n node.right = self.insert(node.right, val)\\n else:\\n node.left = self.insert(node.left, val)\\n balance = self.height(node.left) - self.height(node.right)\\n if balance > 1:\\n if self.height(node.left.left) > self.height(node.left.right):\\n node = self.rightRotate(node)\\n else:\\n node.left = self.leftRotate(node.left)\\n node = self.rightRotate(node)\\n elif balance < -1:\\n if self.height(node.right.right) > self.height(node.right.left):\\n node = self.leftRotate(node)\\n else:\\n node.right = self.rightRotate(node.right)\\n node = self.leftRotate(node)\\n else:\\n node.height = self.setHeight(node)\\n return node\\n \\n \\n def getMinValNode(self, node):\\n if node is None or node.left is None:\\n return node\\n return self.getMinValNode(node.left)\\n \\n\\t\\t\\n def remove(self, node, val):\\n if node is None:\\n return None\\n if node.val < val:\\n node.right = self.remove(node.right, val)\\n elif node.val > val:\\n node.left = self.remove(node.left, val)\\n else:\\n if node.left is None:\\n return node.right\\n elif node.right is None:\\n return node.left\\n else:\\n right_min_val_node = self.getMinValNode(node.right)\\n node.val = right_min_val_node.val\\n node.right = self.remove(node.right, right_min_val_node.val)\\n \\n node.height = self.setHeight(node)\\n balance = self.height(node.left) - self.height(node.right)\\n if balance > 1:\\n if self.height(node.left.left) > self.height(node.left.right):\\n node = self.rightRotate(node)\\n else:\\n node.left = self.leftRotate(node.left)\\n node = self.rightRotate(node)\\n elif balance < -1:\\n if self.height(node.right.right) > self.height(node.right.left):\\n node = self.leftRotate(node)\\n else:\\n node.right = self.rightRotate(node.right)\\n node = self.leftRotate(node)\\n else:\\n node.height = self.setHeight(node)\\n return node\\n \\n \\n def predecessor(self, node, val):\\n if node is None:\\n return None\\n if node.val == val:\\n return val\\n elif node.val > val:\\n return self.predecessor(node.left, val)\\n else:\\n right_res = self.predecessor(node.right, val)\\n return right_res if right_res else node.val \\n \\n\\t\\t\\t\\t\\t\\t\\n def successor(self, node, val):\\n if node is None:\\n return None\\n if node.val == val:\\n return val\\n elif node.val < val:\\n return self.successor(node.right, val)\\n else:\\n left_res = self.successor(node.left, val)\\n return left_res if left_res else node.val\\n \\n\\nclass Solution(object):\\n def containsNearbyAlmostDuplicate(self, nums, k, t):\\n \\\"\\\"\\\"\\n :type nums: List[int]\\n :type k: int\\n :type t: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n avltree = AVLTree()\\n root = avltree.root\\n for i, num in enumerate(nums): \\n predecessor = avltree.predecessor(root, num)\\n if predecessor is not None and abs(predecessor - num) <= t:\\n return True\\n successor = avltree.successor(root, num)\\n if successor is not None and abs(successor - num) <= t:\\n return True\\n \\n root = avltree.insert(root, num)\\n \\n if avltree.size > k:\\n root = avltree.remove(root, nums[i-k])\\n \\n return False\",\n \"runtime\": \"2732\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n\\n n = len(nums)\\n s = SortedList()\\n for i,ele in enumerate(nums):\\n idx = bisect.bisect_left(s,ele)\\n prev_idx = idx - 1\\n if idx < len(s) and abs(s[idx] - ele) <= valueDiff:\\n return True\\n\\n if 0 <= prev_idx and abs(s[prev_idx] - ele) <= valueDiff:\\n return True\\n s.add(nums[i])\\n if i >= indexDiff:\\n s.remove(nums[i - indexDiff])\\n return False\\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"2851\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nimport bisect\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n L = SortedList()\\n k = indexDiff\\n\\n for i, n in enumerate(nums):\\n\\n\\n j = bisect.bisect(L, n)\\n if j > 0 and abs(L[j-1] - n) <= valueDiff:\\n return True\\n if j < len(L) and abs(L[j] - n ) <= valueDiff:\\n return True\\n\\n \\n L.add(n)\\n\\n if i >= k:\\n v = nums[i-k]\\n L.remove(v)\\n\\n return False\\n\\n\\n \",\n \"runtime\": \"2891\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n\\n n = len(nums)\\n\\n nums_dict = {}\\n\\n nums_sorted = []\\n\\n for index in range(n):\\n\\n num = nums[index]\\n\\n if num not in nums_dict:\\n\\n nums_dict[num] = [index]\\n\\n else:\\n\\n i = 0\\n\\n j = len(nums_dict[num]) - 1\\n\\n while i < j:\\n\\n k = (i + j + 1) // 2\\n\\n if nums_dict[num][k] <= index:\\n\\n i = k\\n\\n else:\\n\\n j = k - 1\\n\\n if abs(nums_dict[num][i]-index) <= indexDiff:\\n\\n return True\\n\\n if nums_dict[num][i] > index:\\n\\n i = -1\\n\\n nums_dict[num].insert(i+1,index)\\n\\n if len(nums_sorted) == 0:\\n\\n nums_sorted.append(num)\\n\\n else:\\n\\n i = 0\\n\\n j = len(nums_sorted) - 1\\n\\n while i < j:\\n\\n k = (i + j + 1) // 2\\n\\n if nums_sorted[k] <= num:\\n\\n i = k\\n\\n else:\\n\\n j = k - 1\\n\\n if nums_sorted[i] > num:\\n\\n nums_sorted.insert(0,num)\\n\\n elif nums_sorted[i] < num:\\n\\n nums_sorted.insert(i+1,num)\\n\\n for index in range(len(nums_sorted)-1):\\n\\n num = nums_sorted[index]\\n\\n for step in range(index+1,len(nums_sorted)):\\n\\n if abs(num-nums_sorted[step]) > valueDiff:\\n\\n break\\n\\n targets = nums_dict[nums_sorted[step]]\\n\\n for target in nums_dict[num]:\\n\\n i = 0\\n\\n j = len(targets) - 1\\n\\n while i < j:\\n\\n k = (i + j + 1) // 2\\n\\n if targets[k] <= target:\\n\\n i = k\\n\\n else:\\n\\n j = k - 1\\n\\n if abs(targets[i] - target) <= indexDiff:\\n\\n return True\\n\\n if i != len(targets) - 1 and abs(targets[i+1] - target) <= indexDiff:\\n\\n return True\\n \\n return False\",\n \"runtime\": \"2931\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":85,"string":"85"},"mm_list":{"kind":"list like","value":[{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n set_ = SortedList()\n for i in range(len(nums)):\n # Find the successor of current element\n idx = set_.bisect_left(nums[i])\n if idx != len(set_) and set_[idx] <= nums[i] + valueDiff:\n return True\n\n # Find the predecessor of current element\n if idx > 0 and nums[i] <= set_[idx - 1] + valueDiff:\n return True\n\n set_.add(nums[i])\n if len(set_) > indexDiff:\n set_.remove(nums[i - indexDiff])\n\n return False","memory":"28101"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n sorted_list = SortedList()\n \n for i in range(len(nums)):\n # If the window exceeds the indexDiff, remove the element that's out of the window\n if i > indexDiff:\n sorted_list.remove(nums[i - indexDiff - 1])\n \n # Find the position where nums[i] would fit in the sorted list\n pos = sorted_list.bisect_left(nums[i] - valueDiff)\n \n # Check if there's a valid element in the sorted list within the valueDiff\n if pos < len(sorted_list) and abs(sorted_list[pos] - nums[i]) <= valueDiff:\n return True\n \n # Add the current number to the sorted list\n sorted_list.add(nums[i])\n \n return False","memory":"28101"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n \n # Keep sorted sliding window\n # Keep queue of nums to pop off the sliding window, these are the nums exiting the sliding window\n # On every iteration, use the numbers next to the number just inserted to get the new diffs \n # If new diff is less than valueDiff then return True\n # Size of the sliding window is indexDiff\n # O(log(N)) to insert into sliding window, which can happen N times so O(Nlog(N))\n\n window = []\n queue = Deque()\n\n def find_index(num):\n l, r = 0, len(window)\n while l < r:\n m = (l + r) // 2\n if window[m] < num:\n l = m + 1\n else:\n r = m\n \n return l\n\n def remove_from_window(num):\n window.pop(find_index(num))\n\n def add_to_window(num):\n ind = find_index(num)\n window.insert(ind, num)\n return ind\n\n for num in nums:\n if len(window) == indexDiff + 1:\n remove_from_window(queue.popleft())\n \n ind = add_to_window(num)\n if ind - 1 >= 0 and num - window[ind-1] <= valueDiff:\n return True\n \n if ind + 1 < len(window) and window[ind+1] - num <= valueDiff:\n return True\n \n queue.append(num)\n # print(queue, window)\n\n return False","memory":"28305"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # keep track of index ordering i.e., queue/ordered dict => can remove value out of bounds\n # keep values ordered so can check if pair exists quickly -> O(log n)\n # use a binary search + list queue\n sorted_ns = []\n queue = []\n for n in nums:\n # print(f\"before {n}: sorted_ns {sorted_ns} {queue}\")\n # check if pair exists for n\n i = bisect.bisect(sorted_ns, n)\n if i - 1 >= 0 and n - sorted_ns[i-1] <= valueDiff:\n return True\n if i < len(sorted_ns) and sorted_ns[i] - n <= valueDiff:\n return True\n sorted_ns.insert(i, n)\n queue.append(n)\n # print(f\"after: sorted_ns {sorted_ns} {queue}\")\n if len(sorted_ns) > indexDiff:\n # remove first added item\n remove_n = queue[0]\n # find remove_n in bst\n remove_i = bisect.bisect_left(sorted_ns, remove_n)\n del sorted_ns[remove_i]\n queue = queue[1:]\n return False","memory":"28509"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # keep track of index ordering i.e., queue/ordered dict => can remove value out of bounds\n # keep values ordered so can check if pair exists quickly -> O(log n)\n # use a binary search + list queue\n sorted_ns = []\n queue = []\n for n in nums:\n # print(f\"before {n}: sorted_ns {sorted_ns} {queue}\")\n # check if pair exists for n\n i = bisect.bisect(sorted_ns, n)\n if i - 1 >= 0 and n - sorted_ns[i-1] <= valueDiff:\n return True\n if i < len(sorted_ns) and sorted_ns[i] - n <= valueDiff:\n return True\n sorted_ns.insert(i, n)\n queue.append(n)\n # print(f\"after: sorted_ns {sorted_ns} {queue}\")\n if len(sorted_ns) > indexDiff:\n # remove first added item\n remove_n = queue[0]\n # find remove_n in bst\n remove_i = bisect.bisect_left(sorted_ns, remove_n)\n del sorted_ns[remove_i]\n queue = queue[1:]\n return False","memory":"28509"},{"code":"from sortedcontainers import SortedList\n\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums, k, t):\n set_ = SortedList()\n for i in range(len(nums)):\n # Find the successor of current element\n idx = set_.bisect_left(nums[i])\n if idx != len(set_) and set_[idx] <= nums[i] + t:\n return True\n\n # Find the predecessor of current element\n if idx > 0 and nums[i] <= set_[idx - 1] + t:\n return True\n\n set_.add(nums[i])\n if len(set_) > k:\n set_.remove(nums[i - k])\n\n return False","memory":"28713"},{"code":"import sortedcontainers\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n sl = sortedcontainers.SortedList()\n for i, num in enumerate(nums):\n if len(sl) >= 1:\n it = sl.irange(num - valueDiff, num + valueDiff)\n if len(list(it)) > 0:\n return True\n # check if the largest value in the sorted list\n # minus num, is less than valueDiff\n if i >= indexDiff:\n sl.remove(nums[i - indexDiff])\n sl.add(num)\n return False\n","memory":"28916"},{"code":"import sortedcontainers\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\n \n def floor(n, bst):\n le = bst.bisect_right(n) - 1\n return bst[le] if le >= 0 else None\n \n def ceiling(n, bst):\n ge = bst.bisect_right(n)\n return bst[ge] if ge < len(bst) else None\n \n bst = sortedcontainers.SortedList()\n for i, n in enumerate(nums):\n le = floor(n, bst)\n if le is not None and n <= le + t:\n return True\n ge = ceiling(n, bst)\n if ge is not None and ge <= n + t:\n return True\n bst.add(n)\n if len(bst) > k:\n bst.remove(nums[i-k])\n return False\n # time: O(nlogk)\n # space: O(k)","memory":"29120"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums, k, t):\n set_ = SortedList()\n for i in range(len(nums)):\n # Find the successor of current element\n idx = set_.bisect_left(nums[i])\n if idx != len(set_) and set_[idx] <= nums[i] + t:\n return True\n\n # Find the predecessor of current element\n if idx > 0 and nums[i] <= set_[idx - 1] + t:\n return True\n\n set_.add(nums[i])\n if len(set_) > k:\n set_.remove(nums[i - k])\n\n return False","memory":"29120"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if valueDiff < 0 or indexDiff < 0:\n return False\n \n sorted_list = SortedList()\n \n for i in range(len(nums)):\n # Find the smallest number >= nums[i] - valueDiff in the sorted list\n if sorted_list:\n pos = sorted_list.bisect_left(nums[i] - valueDiff)\n # Check if this number is <= nums[i] + valueDiff\n if pos < len(sorted_list) and sorted_list[pos] <= nums[i] + valueDiff:\n return True\n \n # Add the current number to the sorted list\n sorted_list.add(nums[i])\n \n # Ensure the sliding window only contains indexDiff + 1 elements\n if len(sorted_list) > indexDiff:\n sorted_list.remove(nums[i - indexDiff])\n \n return False\n","memory":"29324"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # implement bisect left function to not have from scratch\n\n window = SortedList()\n for i in range(len(nums)):\n # search nums[r] in search_list\n idx = window.bisect_left(nums[i])\n # print(idx, nums[i], window)\n\n # abs(indow[idx] - nums[i]) <= valueDiff\n # where window[idx] >= nums[i] from def of bisect left function\n if idx != len(window) and window[idx] - nums[i] <= valueDiff:\n return True\n # abs(window[idx - 1] - nums[i]) <= valueDiff\n # where window[idx - 1] < nums[i]\n if idx >= 1 and nums[i] - window[idx - 1] <= valueDiff:\n return True\n\n window.add(nums[i])\n # if i >= indexDiff:\n if len(window) > indexDiff:\n window.remove(nums[i - indexDiff])\n\n return False","memory":"29324"},{"code":"from sortedcontainers import SortedList\nimport bisect\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # put items into sliding window\n last_items = SortedList()\n i = j = 0\n while j < len(nums):\n if i + indexDiff < j:\n # remove nums[i]\n last_items.remove(nums[i])\n i += 1\n x = bisect.bisect_left(last_items, nums[j])\n options = last_items[max(x - 1, 0): x + 2]\n for option in options:\n if abs(option - nums[j]) <= valueDiff:\n return True\n # add nums[j]\n last_items.add(nums[j])\n j += 1\n return False","memory":"29528"},{"code":"from sortedcontainers import SortedList\nimport bisect\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # put items into sliding window\n last_items = SortedList()\n i = j = 0\n while j < len(nums):\n if i + indexDiff < j:\n # remove nums[i]\n last_items.remove(nums[i])\n i += 1\n print(\"numsj: \"+str(nums[j]))\n x = bisect.bisect_left(last_items, nums[j])\n options = last_items[max(x - 1, 0): x + 2]\n for option in options:\n if abs(option - nums[j]) <= valueDiff:\n return True\n # add nums[j]\n last_items.add(nums[j])\n j += 1\n return False","memory":"29731"},{"code":"from sortedcontainers import SortedList\nimport bisect\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # put items into sliding window\n last_items = SortedList()\n i = j = 0\n while j < len(nums):\n if i + indexDiff < j:\n # remove nums[i]\n last_items.remove(nums[i])\n i += 1\n print(\"numsj: \"+str(nums[j]))\n x = bisect.bisect_left(last_items, nums[j])\n options = last_items[max(x - 1, 0): x + 2]\n for option in options:\n if abs(option - nums[j]) <= valueDiff:\n return True\n # add nums[j]\n last_items.add(nums[j])\n j += 1\n return False","memory":"29935"},{"code":"from sortedcontainers import SortedSet\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\n if valueDiff < 0:\n return False\n \n window = SortedSet()\n \n for i in range(len(nums)):\n if i > indexDiff:\n window.remove(nums[i - indexDiff - 1])\n \n pos1 = window.bisect_left(nums[i] - valueDiff)\n pos2 = window.bisect_right(nums[i] + valueDiff)\n \n if pos1 != pos2 and pos1 != len(window):\n return True\n \n window.add(nums[i])\n \n return False\n\n# Example usage:\nsolution = Solution()\nnums = [1, 2, 3, 1]\nindexDiff = 3\nvalueDiff = 0\nprint(solution.containsNearbyAlmostDuplicate(nums, indexDiff, valueDiff)) # Output: True\n\nnums = [1, 5, 9, 1, 5, 9]\nindexDiff = 2\nvalueDiff = 3\nprint(solution.containsNearbyAlmostDuplicate(nums, indexDiff, valueDiff)) # Output: False","memory":"30139"},{"code":"from sortedcontainers import SortedSet\n\n\nclass Solution:\n def containsNearbyAlmostDuplicate(\n self, nums: List[int], indexDiff: int, valueDiff: int\n ) -> bool:\n s = SortedSet()\n for i, v in enumerate(nums):\n j = s.bisect_left(v - valueDiff)\n if j < len(s) and s[j] <= v + valueDiff:\n return True\n s.add(v)\n if i >= indexDiff:\n s.remove(nums[i - indexDiff])\n return False","memory":"30139"},{"code":"from sortedcontainers import SortedSet\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\n if valueDiff < 0:\n return False\n \n window = SortedSet()\n \n for j in range(len(nums)):\n if j > indexDiff:\n window.remove(nums[j - indexDiff - 1])\n \n left = nums[j] - valueDiff\n right = nums[j] + valueDiff\n \n # Check if there is a number within the range [left, right] in the window\n idx = window.bisect_left(left)\n if idx < len(window) and window[idx] <= right:\n return True\n \n window.add(nums[j])\n \n return False\n\n# Example usage:\nsolution = Solution()\nnums = [1, 2, 3, 1]\nindexDiff = 3\nvalueDiff = 0\nprint(solution.containsNearbyAlmostDuplicate(nums, indexDiff, valueDiff)) # Output: True\n\nnums = [1, 5, 9, 1, 5, 9]\nindexDiff = 2\nvalueDiff = 3\nprint(solution.containsNearbyAlmostDuplicate(nums, indexDiff, valueDiff)) # Output: False","memory":"30343"},{"code":"from bisect import bisect_left\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n k_sorted = []\n for i in range(len(nums)):\n j = bisect_left(k_sorted, nums[i])\n if j > 0 and abs(k_sorted[j-1] - nums[i]) <= valueDiff or j < len(k_sorted) and abs(k_sorted[j] - nums[i]) <= valueDiff:\n return True\n k_sorted.insert(j, nums[i])\n if i >= indexDiff:\n del k_sorted[bisect_left(k_sorted, nums[i-indexDiff])]\n return False","memory":"30546"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n snum = []\n for i, n in enumerate(nums):\n # check with successor\n p = bisect.bisect_left(snum, n)\n if p < len(snum) and snum[p] - n <= valueDiff:\n return True\n # check with predecessor\n if p > 0 and n - snum[p - 1] <= valueDiff:\n return True\n\n bisect.insort_left(snum, n)\n # if len(snum) > indexDiff + 1: # !!! This would be wrong !!!\n if len(snum) > indexDiff:\n # j = bisect.bisect_left(snum, snum[i - indexDiff])\n snum.remove(nums[i - indexDiff])\n\n return False\n","memory":"30546"},{"code":"from bisect import bisect_left\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # k_sorted = nums[:indexDiff]\n # k_sorted.sort()\n k_sorted = []\n for i in range(len(nums)):\n # Bisect left search\n j = bisect_left(k_sorted, nums[i])\n if j > 0 and abs(k_sorted[j-1] - nums[i]) <= valueDiff or j < len(k_sorted) and abs(k_sorted[j] - nums[i]) <= valueDiff:\n return True\n k_sorted.insert(j, nums[i])\n if i >= indexDiff:\n del k_sorted[bisect_left(k_sorted, nums[i-indexDiff])]\n return False\n\n\n \"\"\"\n [1, 12, 5, 9, 3, 8], indexDiff = 2, valueDiff = 3\n\n [1,2,2,3,4,5], indexDiff=3, valueDiff=0\n k_sorted:\n \"\"\"","memory":"30750"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n n = len(nums)\n window = SortedList(nums[:indexDiff+1])\n if any(abs(a-b) <= valueDiff for a,b in pairwise(window)): return True\n for i in range(indexDiff+1, n):\n x = nums[i]\n window.remove(nums[i-indexDiff-1])\n window.add(x)\n j = window.index(x)\n if (j > 0 and abs(window[j-1]-x) <= valueDiff) or (j < len(window)-1 and abs(window[j+1]-x) <= valueDiff):\n return True\n return False\n","memory":"30954"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n sl= SortedList(nums[1 : 1 + indexDiff])\n for j in range(len(nums) - 1):\n i = sl.bisect_right(nums[j])\n if i == len(sl) and nums[j] - sl[-1] <= valueDiff:\n return True\n if i==0 and sl[0] - nums[j]<= valueDiff:\n return True\n if 0 < i <len(sl) and (nums[j] - sl[i-1] <= valueDiff or sl[i] - nums[j] <=valueDiff):\n return True\n sl.remove(nums[j+1])\n if j + 1 + indexDiff<len(nums):\n sl.add(nums[j+1+indexDiff])\n\n return False","memory":"31158"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if valueDiff != 0:\n buckets = {} # [0, valueDiff - 1], [valueDiff, 2 * valueDiff - 1], ...\n\n for i, num in enumerate(nums):\n bucket = num // valueDiff\n\n if (\n bucket in buckets or\n bucket - 1 in buckets and num - buckets[bucket - 1] <= valueDiff or\n bucket + 1 in buckets and buckets[bucket + 1] - num <= valueDiff\n ):\n return True\n\n buckets[bucket] = num\n\n if i >= indexDiff:\n del buckets[nums[i - indexDiff] // valueDiff]\n\n return False\n else:\n window = set() # prev indexDiff elements\n\n for i, num in enumerate(nums):\n if num in window:\n return True\n\n window.add(num)\n\n if i >= indexDiff:\n window.remove(nums[i - indexDiff])\n\n return False","memory":"31158"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n curr_nums = SortedList(nums[1:indexDiff+1])\n # curr_nums = [7]\n for i in range(len(nums)):\n idx = curr_nums.bisect_left(nums[i])\n # idx = 1\n if idx - 1 >= 0 and idx-1 < len(curr_nums) and abs(curr_nums[idx-1] - nums[i]) <= valueDiff:\n print(curr_nums)\n print(nums[i])\n return True\n elif idx < len(curr_nums) and abs(curr_nums[idx] - nums[i]) <= valueDiff:\n print(curr_nums)\n print(nums[i])\n return True\n if (i + indexDiff + 1) < len(nums):\n curr_nums.add(nums[i + indexDiff + 1])\n if i + 1 < len(nums):\n curr_nums.remove(nums[i+1])\n\n return False\n","memory":"31361"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # sl = SortedList(nums[:indexDiff + 1])\n sl = SortedList()\n for val in nums[:indexDiff + 1]:\n if val in sl:\n return True\n sl.add(val)\n # if len(sl) < indexDiff + 1:\n # return True\n for i in range(len(sl) - 1):\n if i:\n if abs(sl[i - 1] - sl[i]) <= valueDiff:\n return True\n if i + 1 < len(sl):\n if abs(sl[i + 1] - sl[i]) <= valueDiff:\n return True\n \n for i in range(indexDiff + 1, len(nums)):\n ind = sl.bisect_left(nums[i - (indexDiff + 1)])\n sl.pop(ind)\n if nums[i] in sl:\n return True\n sl.add(nums[i])\n ind = sl.bisect_left(nums[i])\n if ind:\n if abs(sl[ind - 1] - sl[ind]) <= valueDiff:\n return True\n if ind + 1 < len(sl):\n if abs(sl[ind + 1] - sl[ind]) <= valueDiff:\n return True\n \n return False\n \n","memory":"31565"},{"code":"from sortedcontainers import SortedSet\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n\n window = SortedSet()\n l = 0\n for r in range(len(nums)):\n\n left_boundary_index = window.bisect_left(nums[r] - valueDiff)\n if left_boundary_index < len(window) and window[left_boundary_index] <= nums[r] + valueDiff:\n return True\n window.add(nums[r])\n if len(window) >= indexDiff + 1:\n window.remove(nums[l])\n l += 1\n return False\n\n","memory":"31769"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n from sortedcontainers import SortedSet\n import bisect\n st = SortedSet()\n left, right = 0, 0\n res = 0\n while right < len(nums):\n if right - left > indexDiff:\n st.remove(nums[left])\n left += 1\n index = bisect.bisect_left(st, nums[right] - valueDiff)\n if st and index >= 0 and index < len(st) and abs(st[index] - nums[right]) <= valueDiff:\n return True\n st.add(nums[right])\n right += 1\n return False","memory":"31973"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n from sortedcontainers import SortedSet\n import bisect\n st = SortedSet()\n left, right = 0, 0\n while right < len(nums):\n if right - left > indexDiff:\n st.remove(nums[left])\n left += 1\n index = bisect.bisect_left(st, nums[right] - valueDiff)\n if st and index >= 0 and index < len(st) and st[index] - nums[right] <= valueDiff:\n return True\n st.add(nums[right])\n right += 1\n return False","memory":"31973"},{"code":"from sortedcontainers import SortedSet\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # maintain sliding window of elements\n # from nums\n s = SortedSet()\n for i, v in enumerate(nums):\n # find pos where v-valueDiff would be\n # added to maintain order\n j = s.bisect_left(v - valueDiff)\n # j w/in bounds and w/in valueDiff\n # units of v\n if j < len(s) and s[j] <= v + valueDiff:\n return True\n # add curr element to s\n s.add(v)\n # maintain window size\n if i >= indexDiff:\n s.remove(nums[i - indexDiff])\n return False\n #O(nlog(min(n,k)))\n #O(min(n,k))\n ","memory":"32176"},{"code":"from typing import List\n\nfrom sortedcontainers import SortedDict\n\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # Idea: Maintains min and max number in windows of size indexDiff to the left of current num\n num_freq_dict = SortedDict()\n for i in range(len(nums)):\n if i >= indexDiff + 1:\n num_to_remove = nums[i - indexDiff - 1]\n num_freq_dict[num_to_remove] -= 1\n if num_freq_dict[num_to_remove] == 0:\n del (num_freq_dict[num_to_remove])\n\n curr_num = nums[i]\n if num_freq_dict:\n if self.findMinDiff(curr_num, num_freq_dict.keys()) <= valueDiff:\n return True\n\n if curr_num in num_freq_dict:\n num_freq_dict[curr_num] += 1\n else:\n num_freq_dict[curr_num] = 1\n\n return False\n\n def findMinDiff(self, num: int, sorted_nums) -> int:\n \"\"\"\n Binary search to find the min difference between num and any num in the list\n \"\"\"\n start = 0\n end = len(sorted_nums) - 1\n while end - start > 1:\n mid = (start + end) // 2\n if num == sorted_nums[mid]:\n return 0\n if num < sorted_nums[mid]:\n end = mid\n else:\n start = mid\n return min(abs(num - sorted_nums[start]), abs(sorted_nums[end] - num))\n","memory":"32380"},{"code":"from collections import deque \n\nclass Solution:\n def __init__(self):\n self.mydict = set()\n\n def containsNearbyAlmostDuplicate(self, nums: list[int], indexDiff: int, valueDiff: int) -> bool:\n #intiial part of the code converts nums into segments that we care about in O(n) time. \n k = indexDiff\n segments = []\n temp = []\n for num in nums:\n temp.append(num)\n if len(temp) == k+1: \n segments.append(temp)\n temp = [] \n if temp!= []:\n segments.append(temp)\n \n #The next part will deal with the main part of the code \n for i,seglist in enumerate(segments):\n queue1 = deque([i for i in seglist])\n if i < len(segments) - 1: \n queue2 = deque([i for i in segments[i+1]])\n else: \n queue2 = deque([])\n sortedlist = sorted(seglist)\n\n \n for i in range(1,len(sortedlist)):\n if abs(sortedlist[i] - sortedlist[i-1]) <= valueDiff:\n return True \n \n while queue2:\n self.mydict.add(queue1.popleft())\n checkVal = queue2.popleft()\n print(checkVal)\n ind = self.binSearch(sortedlist, checkVal)\n\n if ind> -1:\n if sortedlist[ind] not in self.mydict:\n if abs(checkVal-sortedlist[ind]) <= valueDiff:\n return True\n \n if ind<len(sortedlist) -1: \n if sortedlist[ind+1] not in self.mydict:\n if abs(checkVal-sortedlist[ind+1]) <= valueDiff:\n return True \n return False \n\n def binSearch(self, sortedlist: list[int], checkVal: int) -> int: #returns the value of the index after which checkVal should go\n base = 0\n ceiling = len(sortedlist) - 1 \n\n while True: \n curr = base + ((ceiling - base)//2)\n \n if checkVal >= sortedlist[curr+1] and curr+1 == len(sortedlist) - 1:\n return curr + 1 \n \n if checkVal <= sortedlist[curr] and curr == 0:\n return curr - 1 \n \n if checkVal >= sortedlist[curr] and curr != len(sortedlist) - 1:\n if checkVal <= sortedlist[curr+1]:\n return curr \n \n if checkVal < sortedlist[curr]:\n ceiling = curr \n \n if checkVal >= sortedlist[curr]: \n base = curr ","memory":"32584"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n buckets = {}\n for i, num in enumerate(nums):\n bucket = num // max(1, valueDiff)\n if bucket in buckets:\n return True\n if bucket-1 in buckets:\n potentialDuplicate = buckets[bucket-1]\n if abs(potentialDuplicate-num) <= valueDiff:\n return True\n if bucket+1 in buckets:\n potentialDuplicate = buckets[bucket+1]\n if abs(potentialDuplicate-num) <= valueDiff:\n return True\n if len(buckets) == indexDiff:\n delBucket = nums[i-indexDiff] // max(1, valueDiff)\n del buckets[delBucket]\n buckets[bucket] = num\n return False","memory":"32788"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n buckets = {}\n for i, v in enumerate(nums):\n # t == 0 is a special case where we only have to check the bucket\n # that v is in.\n bucketNum, offset = (v // valueDiff, 1) if valueDiff else (v, 0)\n for idx in range(bucketNum - offset, bucketNum + offset + 1):\n if idx in buckets and abs(buckets[idx] - nums[i]) <= valueDiff:\n return True\n\n buckets[bucketNum] = nums[i]\n if len(buckets) > indexDiff:\n # Remove the bucket which is too far away. Beware of zero t.\n del buckets[nums[i - indexDiff] // valueDiff if valueDiff else nums[i - indexDiff]]\n return False","memory":"32991"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n \n b = {}\n \n for i, n in enumerate(nums):\n bid = n // valueDiff if valueDiff else n\n \n for j in [bid-1, bid, bid+1]:\n if j in b and abs(b[j] - n) <= valueDiff:\n return True\n \n b[bid] = n\n \n if len(b) > indexDiff:\n out = nums[i-indexDiff] // valueDiff if valueDiff else nums[i-indexDiff]\n b.pop(out)\n \n return False","memory":"33195"},{"code":"def get_bucket_id(num, value_diff):\n if value_diff == 0:\n return num\n return num//value_diff\n\ndef validate_diff(num1, num2, value_diff):\n return abs(num1 - num2) <= value_diff\n\ndef duplicate_in_bucket_slot(buckets, id, num, value_diff):\n first_check = id in buckets\n if first_check:\n return True\n lower_neighbour_id = id - 1\n lower_check = lower_neighbour_id in buckets\n if lower_check:\n lower_num = buckets[lower_neighbour_id]\n found_duplicate = validate_diff(num1=num, num2=lower_num, value_diff=value_diff)\n if found_duplicate:\n return True\n higher_neighbour_id = id + 1\n higher_check = higher_neighbour_id in buckets\n if higher_check:\n higher_num = buckets[higher_neighbour_id]\n found_duplicate = validate_diff(num1=num, num2=higher_num, value_diff=value_diff)\n if found_duplicate:\n return True\n return False\n\ndef delete_bucket_item(num, buckets, value_diff):\n id = get_bucket_id(num, value_diff)\n del buckets[id]\n \n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums, indexDiff: int, valueDiff: int) -> bool:\n num_index = 0\n buckets = {}\n while num_index < len(nums):\n current_num = nums[num_index]\n bucket_id = get_bucket_id(current_num, valueDiff)\n if duplicate_in_bucket_slot(\n buckets=buckets,\n id=bucket_id,\n num=current_num,\n value_diff=valueDiff\n ):\n return True\n buckets[bucket_id] = current_num\n is_at_start = num_index < indexDiff\n if is_at_start:\n pass\n else:\n index_to_remove = num_index - indexDiff\n delete_bucket_item(\n num=nums[index_to_remove],\n buckets=buckets,\n value_diff=valueDiff\n )\n num_index += 1\n return False","memory":"33399"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n buckets={}\n\n start=0\n for end in range(len(nums)):\n if end-start==indexDiff+1:\n bucket_to_remove=nums[start]//max(valueDiff,1)\n del buckets[bucket_to_remove]\n start+=1\n curr_bucket=nums[end]//max(valueDiff,1)\n if curr_bucket in buckets:\n return True\n buckets[curr_bucket]=nums[end]\n if curr_bucket-1 in buckets and nums[end]-buckets[curr_bucket-1]<=valueDiff:\n return True\n elif curr_bucket+1 in buckets and buckets[curr_bucket+1]-nums[end]<=valueDiff:\n return True\n return False","memory":"33603"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\n if valueDiff < 0:\n return False\n buckets = {}\n width = valueDiff + 1\n for i, num in enumerate(nums):\n bucket = num // width\n if bucket in buckets:\n return True\n buckets[bucket] = num\n if (bucket - 1) in buckets and abs(num - buckets[bucket - 1]) <= valueDiff:\n return True\n if (bucket + 1) in buckets and abs(num - buckets[bucket + 1]) <= valueDiff:\n return True\n if i >= indexDiff:\n del buckets[nums[i - indexDiff] // width]\n return False","memory":"33603"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n n = len(nums)\n sorted_nums = sorted([(nums[i], i) for i in range(n) ])\n # print(sorted_nums)\n \n start = 0\n index = 1\n while index <= n:\n cur_diff = math.inf\n if index < n:\n cur_diff = sorted_nums[index][0] - sorted_nums[start][0]\n if cur_diff <= valueDiff:\n pass\n else:\n sorted_indices = sorted(sorted_nums[start:index], key=lambda x: x[1])\n min_diff = math.inf\n for i in range(1,len(sorted_indices)):\n min_diff = min(min_diff, sorted_indices[i][1] - sorted_indices[i-1][1])\n if min_diff <= indexDiff:\n return True\n\n while index < n and sorted_nums[index][0] - sorted_nums[start][0] > valueDiff:\n start += 1\n\n index += 1\n \n\n return False\n\n# [(1, 0), (1, 3), (5, 1), (5, 4), (9, 2), (9, 5)]\n#\n# ","memory":"33806"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if valueDiff < 0:\n return False\n \n buckets = {}\n \n w = valueDiff + 1 # Increment by 1 to handle the range correctly\n \n for i in range(len(nums)):\n bucket = self.getID(nums[i], w)\n \n # Check if current bucket is empty, each bucket may contain at most one element\n if bucket in buckets:\n return True\n \n # Check the neighbor buckets for almost duplicates\n if bucket - 1 in buckets and abs(nums[i] - buckets[bucket - 1]) < w:\n return True\n \n if bucket + 1 in buckets and abs(nums[i] - buckets[bucket + 1]) < w:\n return True\n \n # Now bucket is empty and no almost duplicates in neighbor buckets\n buckets[bucket] = nums[i]\n \n if i >= indexDiff:\n del buckets[self.getID(nums[i - indexDiff], w)]\n \n return False\n \n # Get the ID of the bucket from element value x and bucket width w\n # Division '/' in Python with '//' performs floor division, which is necessary for correct bucketing.\n # Floor division to handle both positive and negative integers correctly\n def getID(self, x, w):\n return x // w ","memory":"33806"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\n bucket = {}\n for i, n in enumerate(nums):\n bucket_i = n // (t + 1)\n if bucket_i in bucket and abs(n - bucket[bucket_i]) <= t:\n return True\n if bucket_i + 1 in bucket and abs(n - bucket[bucket_i + 1]) <= t:\n return True\n if bucket_i - 1 in bucket and abs(n - bucket[bucket_i - 1]) <= t:\n return True\n bucket[bucket_i] = n\n if i >= k:\n del bucket[nums[i-k] // (t + 1)]\n return False","memory":"34010"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n bucket = {}\n for i, n in enumerate(nums):\n bucket_i = n // (valueDiff + 1)\n if bucket_i in bucket and abs(n - bucket[bucket_i]) <= valueDiff:\n return True\n if bucket_i + 1 in bucket and abs(n - bucket[bucket_i + 1]) <= valueDiff:\n return True\n if bucket_i - 1 in bucket and abs(n - bucket[bucket_i - 1]) <= valueDiff:\n return True\n bucket[bucket_i] = n\n if i >= indexDiff:\n del bucket[nums[i-indexDiff] // (valueDiff + 1)]\n return False","memory":"34010"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n size = len(nums)\n buckets = {}\n bucket_size = valueDiff + 1\n\n for i in range(size):\n num = nums[i]\n bucket_id = num // bucket_size\n\n if bucket_id in buckets:\n return True\n \n if bucket_id - 1 in buckets and num - buckets[bucket_id - 1] <= valueDiff:\n return True\n\n if bucket_id + 1 in buckets and buckets[bucket_id + 1] - num <= valueDiff:\n return True\n \n buckets[bucket_id] = num\n\n if i >= indexDiff:\n del buckets[nums[i - indexDiff] // bucket_size]\n \n return False","memory":"34214"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # set_ = SortedList()\n # for i in range(len(nums)):\n # if i > indexDiff:\n # set_.remove(nums[i - indexDiff - 1])\n\n # pos = set_.bisect_left(nums[i] - valueDiff)\n\n # if pos < len(set_) and abs(set_[pos] - nums[i]) <= valueDiff:\n # return True\n\n # set_.add(nums[i])\n # return False\n\n buckets = {}\n\n w = valueDiff + 1\n\n for i in range(len(nums)):\n bucket = nums[i] // w\n if bucket in buckets:\n return True\n\n if bucket - 1 in buckets and abs(buckets[bucket - 1] - nums[i]) < w:\n return True\n\n if bucket + 1 in buckets and abs(buckets[bucket + 1] - nums[i]) < w:\n return True\n\n buckets[bucket] = nums[i]\n\n if i >= indexDiff:\n del buckets[nums[i - indexDiff] // w]\n \n return False\n\n\n\n\n\n\n \n\n \n ","memory":"34214"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if nums:\n buckets = {}\n for i in range(len(nums)):\n label = nums[i] // (valueDiff +1)\n if buckets.get(label) != None:\n return True\n if buckets.get(label+1) and abs(buckets.get(label+1) - nums[i]) <= valueDiff:\n return True\n if buckets.get(label-1) and abs(buckets.get(label-1) - nums[i]) <= valueDiff:\n return True\n\n buckets[label] = nums[i]\n if i >= indexDiff:\n del buckets[nums[i-indexDiff]//(valueDiff+1)]\n return False\n\n\n\n\n\n\n\n # sl = SortedList()\n # for i in range(len(nums)):\n # j = sl.bisect_left(nums[i])\n # print(len(sl), j)\n # if j < len(sl) and sl[j] <= valueDiff + nums[i]:\n # return True\n # if j > 0 and nums[i] <= valueDiff + sl[j-1]:\n # return True\n # sl.add(nums[i])\n # if len(sl) > indexDiff:\n # sl.remove(nums[i-indexDiff])\n # return False\n\n","memory":"34418"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if nums:\n buckets = {}\n for i in range(len(nums)):\n label = nums[i] // (valueDiff +1)\n if buckets.get(label) != None:\n return True\n if buckets.get(label+1) and abs(buckets.get(label+1) - nums[i]) <= valueDiff:\n return True\n if buckets.get(label-1) and abs(buckets.get(label-1) - nums[i]) <= valueDiff:\n return True\n\n buckets[label] = nums[i]\n if i >= indexDiff:\n del buckets[nums[i-indexDiff]//(valueDiff+1)]\n return False","memory":"34418"},{"code":"from sortedcontainers import SortedDict\nfrom typing import List\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n d = SortedDict() # Use 'd' as a sorted dictionary to store indices\n k = indexDiff\n v = valueDiff\n \n for i in range(len(nums)):\n # Find the range of potential candidates in the sorted dictionary\n lower_bound = nums[i] - v\n upper_bound = nums[i] + v\n \n # Check if there are any keys within this range\n for key in d.irange(lower_bound, upper_bound):\n if (i - d[key]) <= k:\n return True\n \n # Update the dictionary with the current number and its index\n d[nums[i]] = i\n \n # Remove elements that are out of the indexDiff range\n if i >= k:\n del d[nums[i - k]]\n \n return False","memory":"34621"},{"code":"class Solution: # O(n) time and O(k) space\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n k = indexDiff # for legibility\n d = valueDiff # for legibility\n buckets = {}\n queue = []\n for i, n in enumerate(nums):\n bkt = n // (d+1) # + 1 for d=0 case\n if bkt in buckets: return True\n if bkt-1 in buckets and abs(buckets[bkt-1]-n) <= d: return True\n if bkt+1 in buckets and abs(buckets[bkt+1]-n) <= d: return True\n if len(queue) == k: # maintain O(k) memory with O(1) operations per iteration\n stale = queue.pop(0)\n stale_bucket = stale // (d+1)\n buckets.pop(stale_bucket, 'None')\n buckets[bkt]=n # note: can only have 1 value in each bucket b/c otherwise would have returned True\n queue.append(n)\n return False\n ","memory":"34621"},{"code":"class TreeNode:\n def __init__(self, val: int) -> TreeNode:\n self.parent = None\n self.left_child = None\n self.right_child = None\n self.val = val\n self.rank = 0\n \n def add_node(self, node: TreeNode) -> None:\n self.rank += 1\n if self.val < node.val:\n if self.right_child is None:\n self.right_child = node\n node.parent = self\n else:\n self.right_child.add_node(node)\n else:\n if self.left_child is None:\n self.left_child = node\n node.parent = self\n else:\n self.left_child.add_node(node)\n \n def derank(self) -> None:\n self.rank -= 1\n if self.parent:\n self.parent.derank()\n\n def remove_from_tree(self) -> None:\n move_up = None\n if self.left_child and self.right_child:\n if self.left_child.rank > self.right_child.rank:\n move_up = self.left_child\n move_up.add_node(self.right_child)\n else:\n move_up = self.right_child\n move_up.add_node(self.left_child)\n elif self.left_child:\n move_up = self.left_child\n elif self.right_child:\n move_up = self.right_child\n\n if self.parent.left_child == self:\n self.parent.left_child = move_up\n else:\n self.parent.right_child = move_up\n if move_up:\n move_up.parent = self.parent\n self.derank()\n\n def get_in_range(self, val: int, v_diff: int) -> bool:\n if abs(val - self.val) <= v_diff:\n return True\n if self.right_child and (not self.left_child or self.left_child.val < val):\n if self.right_child.get_in_range(val, v_diff):\n return True\n if self.left_child and (not self.right_child or val < self.right_child.val):\n if self.left_child.get_in_range(val, v_diff):\n return True\n return False\n\n def print_tree(self, res: List[int]) -> None:\n if self.left_child:\n self.left_child.print_tree(res)\n res.append(self.val)\n if self.right_child:\n self.right_child.print_tree(res)\n\nimport sortedcontainers\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], i_diff: int, v_diff: int) -> bool:\n return self._sol2(nums, i_diff, v_diff)\n\n def _sol2(self, nums: List[int], i_diff: int, v_diff: int) -> bool:\n window = sortedcontainers.SortedDict({nums[0] : 0})\n for i in range(1, len(nums)):\n val = nums[i]\n if i > i_diff:\n del window[nums[i - i_diff - 1]]\n # Binary search through the keys\n key_view = window.keys()\n low = 0\n high = len(key_view) - 1\n while True:\n j = (low + high) // 2\n if abs(val - key_view[j]) <= v_diff:\n return True\n if val < key_view[j]:\n if j == low:\n break\n high = j - 1\n else:\n if j == high:\n break\n low = j + 1\n window[val] = i\n return False\n\n # Perf: time limit exceeded on 48 / 52. Interesting project though.\n def _bst(self, nums: List[int], i_diff: int, v_diff: int) -> bool:\n root = TreeNode(math.inf)\n nodes_by_index = []\n for i, val in enumerate(nums):\n if i > i_diff:\n nodes_by_index[i - i_diff - 1].remove_from_tree()\n if root.get_in_range(val, v_diff):\n return True\n i_node = TreeNode(val)\n nodes_by_index.append(i_node)\n root.add_node(i_node)\n return False\n \n ","memory":"34825"},{"code":"from typing import List\nfrom collections import deque\nfrom sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(\n self, nums: List[int], indexDiff: int, valueDiff: int\n ) -> bool:\n \n q = deque()\n s = SortedList()\n \n for i, n in enumerate(nums):\n if len(q) > indexDiff:\n _, x = q.popleft()\n s.remove(x)\n #print(s)\n # lip = s.bisect_left(n)\n # if lip > 0 and n - s[lip - 1] <= valueDiff:\n # print(\"m left\", n, s[lip - 1])\n # return True\n # if lip < len(s) and s[lip] - n <= valueDiff:\n # print(\"m right\", n, s[lip])\n # return True\n rip = s.bisect_right(n)\n if rip > 0 and n - s[rip - 1] <= valueDiff:\n return True\n if rip < len(s) and s[rip] - n <= valueDiff:\n return True\n\n q.append((i, n))\n s.add(n)\n\n return False\n","memory":"35029"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n assert valueDiff >= 0\n buckets = {}\n for i, n in enumerate(nums):\n bidx = n // (valueDiff + 1)\n if bidx in buckets:\n return True\n if bidx - 1 in buckets and abs(nums[i] - buckets[bidx - 1]) <= valueDiff:\n return True\n if bidx + 1 in buckets and abs(nums[i] - buckets[bidx + 1]) <= valueDiff:\n return True\n buckets[bidx] = n\n if i >= indexDiff:\n del buckets[nums[i - indexDiff] // (valueDiff + 1)]\n return False\n","memory":"35233"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\n if t < 0 or not nums or k <= 0:\n return False\n buckets = {}\n width = t + 1\n\n for n, i in enumerate(nums):\n buck = i // width\n # if in same bucket, for sure in range\n if buck in buckets:\n return True\n else:\n buckets[buck] = i\n # otherwise we check the number in neighbour bucket\n # has there been another number in that neighbour bucket within range previously\n # then previously should already return True\n if buck - 1 in buckets and i - buckets[buck-1] <= t:\n return True\n if buck + 1 in buckets and buckets[buck+1] - i <= t:\n return True\n if n >= k:\n del buckets[nums[n-k] // width]\n return False\n \n def containsNearbyAlmostDuplicateBst(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n bst = SortedList()\n for i, num in enumerate(nums):\n if i > 0:\n # find closest of num, if the closest <= valueDiff, return True\n ge = bst.bisect_right(num)\n if ge < len(bst) and abs(bst[ge] - num) <= valueDiff:\n return True\n le = bst.bisect_right(num) - 1\n if le >= 0 and abs(bst[le] - num) <= valueDiff:\n return True\n \n bst.add(num)\n if i >= indexDiff:\n bst.remove(nums[i-indexDiff])\n return False\n ","memory":"35233"},{"code":"from sortedcontainers import SortedList\nclass Solution(object):\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\n \"\"\"\n :type nums: List[int]\n :type indexDiff: int\n :type valueDiff: int\n :rtype: bool\n \"\"\"\n if valueDiff < 0:\n return False\n split = valueDiff + 1\n n = len(nums)\n hashmap = {}\n for i in range(n):\n num = nums[i] // split \n print(nums[i], split, num)\n if num in hashmap:\n return True\n if num - 1 in hashmap and abs(nums[i] - hashmap[num - 1]) < split:\n return True\n if num + 1 in hashmap and abs(nums[i] - hashmap[num + 1]) < split:\n return True\n hashmap[num] = nums[i]\n if i >= indexDiff:\n del hashmap[nums[i - indexDiff] // split] \n return False\n","memory":"35436"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n \n index_width = indexDiff + 1\n value_width = valueDiff + 1\n\n buckets = {}\n\n def get_bucket(num):\n return num // value_width\n\n def has_dupe(num, bucket):\n if bucket in buckets:\n # Has dupe bucket\n return True\n\n for next_bucket in (bucket - 1, bucket + 1):\n if next_bucket in buckets:\n next_num = buckets[next_bucket]\n if abs(next_num - num) <= valueDiff:\n return True\n\n return False\n\n # Build the initial window\n for num in nums[:index_width]:\n bucket = get_bucket(num)\n if has_dupe(num, bucket):\n # Found dupe in initial window\n return True\n buckets[bucket] = num\n\n for i in range(len(nums) - index_width):\n remnum = nums[i]\n addnum = nums[i + index_width]\n\n rembucket = get_bucket(remnum)\n del buckets[rembucket]\n\n addbucket = get_bucket(addnum)\n if has_dupe(addnum, addbucket):\n return True\n\n buckets[addbucket] = addnum\n\n return False\n","memory":"35436"},{"code":"class TreeNode:\n def __init__(self, val: int) -> None:\n self.val = val\n self.left = None\n self.right = None\n \n\ndef remove_node(node: TreeNode) -> Optional[TreeNode]:\n if not node:\n return\n\n if not node.left and not node.right:\n return\n\n if node.left and not node.right:\n return node.left\n\n if not node.left and node.right:\n return node.right\n \n # both nodes\n next_node = node.right\n prev_node = None\n while True:\n if next_node.left:\n prev_node = next_node\n next_node = next_node.left\n else:\n break\n \n node.val = next_node.val\n if not prev_node:\n node.right = next_node.right\n else:\n prev_node.left = next_node.right\n \n return node\n \n\nclass BST:\n # Надо искать сразу diff в дереве\n def __init__(self):\n self.root = None\n \n def insert(self, val: int) -> None:\n if not self.root:\n self.root = TreeNode(val)\n return\n \n node = self.root\n while node:\n if val < node.val:\n if node.left:\n node = node.left\n else:\n node.left = TreeNode(val)\n return\n else:\n if node.right:\n node = node.right\n else:\n node.right = TreeNode(val)\n return\n \n def create_from_sorted(self, arr: list) -> None:\n self.root = TreeNode(arr[0])\n node = self.root\n \n arr = arr[1:]\n for n in arr:\n node.right = TreeNode(n)\n node = node.right\n \n def remove(self, val: int) -> None: \n if self.root.val == val:\n self.root = remove_node(self.root)\n return\n \n node = self.root\n while node:\n if node.left and val < node.val:\n if node.left.val == val:\n node.left = remove_node(node.left)\n return\n else:\n node = node.left\n \n elif node.right and val > node.val:\n if node.right.val == val:\n node.right = remove_node(node.right)\n return\n else:\n node = node.right\n \n else:\n print(f\"DELETE ERROR {val = } {node.val = }\")\n return\n \n def has_diff(self, val: int, diff: int) -> bool:\n node = self.root\n while node:\n d = node.val - val\n if abs(d) <= diff:\n return True\n \n if d < 0:\n node = node.right\n else:\n node = node.left\n \n return False\n \n def find(self, val: int) -> bool:\n node = self.root\n \n while node:\n if node.val == val:\n return True\n \n if val < node.val:\n node = node.left\n else:\n node = node.right\n \n return False\n \n \n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n iters = len(nums) - indexDiff\n bst = BST()\n \n to_insert = nums[1:indexDiff + 1][:]\n random.shuffle(to_insert)\n \n # bst.create_from_sorted(sorted())\n for n in to_insert:\n bst.insert(n)\n \n if bst.has_diff(nums[0], valueDiff):\n return True\n \n iters = len(nums) - 1\n for i in range(1, iters):\n bst.remove(nums[i])\n \n if i + indexDiff < len(nums):\n bst.insert(nums[i + indexDiff])\n \n if bst.has_diff(nums[i], valueDiff):\n return True\n\n return False\n ","memory":"35640"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if indexDiff > len(nums) ** 0.5:\n new_nums = sorted([(nums[index], index) for index in range(len(nums))])\n for i in range(1, len(nums)):\n low_val = float(\"inf\")\n for j in range(len(nums)-i):\n if abs(new_nums[j][0]-new_nums[i+j][0]) <= valueDiff and abs(new_nums[j][1]-new_nums[i+j][1]) <= indexDiff:\n return True\n low_val = min(low_val, abs(new_nums[j][0]-new_nums[i+j][0]))\n if low_val > valueDiff:\n return False\n return False\n\n else:\n for i in range(len(nums)):\n for j in range(i+1, min(len(nums), i+indexDiff+1)):\n if abs(nums[i]-nums[j]) <= valueDiff:\n return True\n return False\n ","memory":"35640"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\n if t == 0 and len(set(nums)) == len(nums): return False\n \n bucket = {}\n width = t + 1\n \n for i, n in enumerate(nums):\n bucket_i = n // width\n \n if bucket_i in bucket: return True\n elif bucket_i + 1 in bucket and abs(n - bucket[bucket_i + 1]) < width: return True\n elif bucket_i - 1 in bucket and abs(n - bucket[bucket_i - 1]) < width: return True\n \n bucket[bucket_i] = n\n if i >= k: del bucket[ nums[i-k] //width ]\n \n return False","memory":"35844"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\n \n if t == 0 and len(set(nums)) == len(nums):\n \n return False\n \n \n size = len(nums)\n \n bucket = {}\n \n width = t + 1\n \n for idx, number in enumerate(nums):\n \n bucket_idx = number // width\n \n if bucket_idx in bucket:\n \n return True\n \n elif bucket_idx + 1 in bucket and abs(number - bucket[bucket_idx + 1]) < width:\n \n return True\n \n elif bucket_idx - 1 in bucket and abs(number - bucket[bucket_idx - 1]) < width:\n \n return True\n \n bucket[bucket_idx] = number\n \n \n if idx >= k:\n \n del bucket[ nums[idx-k] //width ]\n \n return False","memory":"35844"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n bst = None\n for i in range(len(nums)):\n if bst is None:\n bst = AVLTreeNode(nums[i])\n else:\n if abs(nums[i] - bst.findClosest(nums[i])) <= valueDiff:\n return True\n bst = bst.insert(nums[i])\n if i - indexDiff >= 0:\n bst = bst.remove(nums[i - indexDiff])\n return False\n\nclass AVLTreeNode:\n def __init__(self, value):\n self.value = value\n self.balance = 0 # defined as self.left.height - self.right.height\n self.height = 1\n self.left = None # smaller than or equal to\n self.right = None\n\n def insert(self, k):\n if k <= self.value:\n if not self.left:\n self.left = AVLTreeNode(k)\n else:\n self.left = self.left.insert(k)\n else:\n if not self.right:\n self.right = AVLTreeNode(k)\n else:\n self.right = self.right.insert(k)\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\n\n # balance self\n if self.balance > 1:\n if self.left.balance >= 0:\n return self.right_rotate()\n else:\n self.left = self.left.left_rotate()\n return self.right_rotate()\n elif self.balance < -1:\n if self.right.balance <= 0:\n return self.left_rotate()\n else:\n self.right = self.right.right_rotate()\n return self.left_rotate()\n return self\n\n def remove(self, k):\n if k < self.value:\n if self.left:\n self.left = self.left.remove(k)\n elif k > self.value:\n if self.right:\n self.right = self.right.remove(k)\n else:\n if not self.left:\n return self.right\n elif not self.right:\n return self.left\n temp = self.right.find_min()\n self.value = temp.value\n self.right = self.right.remove(temp.value)\n\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\n\n if self.balance > 1:\n if self.left.balance >= 0:\n return self.right_rotate()\n else:\n self.left = self.left.left_rotate()\n return self.right_rotate()\n elif self.balance < -1:\n if self.right.balance <= 0:\n return self.left_rotate()\n else:\n print(self.right)\n self.right = self.right.right_rotate()\n return self.left_rotate()\n return self\n\n def find_min(self):\n if self.left is None:\n return self\n else:\n return self.left.find_min()\n\n def findClosest(self, k):\n closest = self.value\n if k < self.value:\n if self.left:\n left_closest = self.left.findClosest(k)\n if abs(k - left_closest) < abs(k - closest):\n closest = left_closest\n elif k > self.value:\n if self.right:\n right_closest = self.right.findClosest(k)\n if abs(k - right_closest) < abs(k - closest):\n closest = right_closest\n return closest\n\n def left_rotate(self):\n new_root = self.right\n if new_root is None: # Ensure the new root exists\n return self\n self.right = new_root.left\n new_root.left = self\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\n return new_root\n\n def right_rotate(self):\n new_root = self.left\n if new_root is None:\n return self # Safety check, should not happen if the tree is correctly balanced\n self.left = new_root.right\n new_root.right = self\n # Update heights\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\n return new_root\n\n","memory":"36251"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n bst = None\n for i in range(len(nums)):\n if bst is None:\n bst = AVLTreeNode(nums[i])\n else:\n if abs(nums[i] - bst.findClosest(nums[i])) <= valueDiff:\n return True\n bst = bst.insert(nums[i])\n if i - indexDiff >= 0:\n bst = bst.remove(nums[i - indexDiff])\n return False\n\nclass AVLTreeNode:\n def __init__(self, value):\n self.value = value\n self.balance = 0 # defined as self.left.height - self.right.height\n self.height = 1\n self.left = None # smaller than or equal to\n self.right = None\n\n def insert(self, k):\n if k <= self.value:\n if not self.left:\n self.left = AVLTreeNode(k)\n else:\n self.left = self.left.insert(k)\n else:\n if not self.right:\n self.right = AVLTreeNode(k)\n else:\n self.right = self.right.insert(k)\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\n\n # balance self\n if self.balance > 1:\n if self.left.balance >= 0:\n return self.right_rotate()\n else:\n self.left = self.left.left_rotate()\n return self.right_rotate()\n elif self.balance < -1:\n if self.right.balance <= 0:\n return self.left_rotate()\n else:\n self.right = self.right.right_rotate()\n return self.left_rotate()\n return self\n\n def remove(self, k):\n if k < self.value:\n if self.left:\n self.left = self.left.remove(k)\n elif k > self.value:\n if self.right:\n self.right = self.right.remove(k)\n else:\n if not self.left:\n return self.right\n elif not self.right:\n return self.left\n temp = self.right.find_min()\n self.value = temp.value\n self.right = self.right.remove(temp.value)\n\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\n\n if self.balance > 1:\n if self.left.balance >= 0:\n return self.right_rotate()\n else:\n self.left = self.left.left_rotate()\n return self.right_rotate()\n elif self.balance < -1:\n if self.right.balance <= 0:\n return self.left_rotate()\n else:\n print(self.right)\n self.right = self.right.right_rotate()\n return self.left_rotate()\n return self\n\n def find_min(self):\n if self.left is None:\n return self\n else:\n return self.left.find_min()\n\n def findClosest(self, k):\n closest = self.value\n if k < self.value:\n if self.left:\n left_closest = self.left.findClosest(k)\n if abs(k - left_closest) < abs(k - closest):\n closest = left_closest\n elif k > self.value:\n if self.right:\n right_closest = self.right.findClosest(k)\n if abs(k - right_closest) < abs(k - closest):\n closest = right_closest\n return closest\n\n def left_rotate(self):\n new_root = self.right\n if new_root is None: # Ensure the new root exists\n return self\n self.right = new_root.left\n new_root.left = self\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\n return new_root\n\n def right_rotate(self):\n new_root = self.left\n if new_root is None:\n return self # Safety check, should not happen if the tree is correctly balanced\n self.left = new_root.right\n new_root.right = self\n # Update heights\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\n return new_root\n\n","memory":"36455"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: list[int], index_diff: int, value_diff: int) -> bool:\n indexes = SortedList([])\n index_values = sorted(enumerate(nums), key=lambda num: num[1])\n ptr = 0\n for index, value in index_values:\n while len(indexes) > 0 and value - index_values[ptr][1] > value_diff:\n indexes.remove(index_values[ptr][0])\n ptr += 1\n closest_index = indexes.bisect_left(index)\n for index_i in [closest_index, closest_index - 1]:\n if 0 <= index_i < len(indexes) and abs(indexes[index_i] - index) <= index_diff:\n return True\n indexes.add(index)\n return False\n\n ","memory":"36659"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: list[int], index_diff: int, value_diff: int) -> bool:\n indexes = SortedList([])\n index_values = sorted(enumerate(nums), key=lambda num: num[1])\n ptr = 0\n for index, value in index_values:\n while len(indexes) > 0 and value - index_values[ptr][1] > value_diff:\n indexes.remove(index_values[ptr][0])\n ptr += 1\n closest_larger = next(indexes.irange(minimum=index), None)\n closest_smaller = next(indexes.irange(maximum=index, reverse=True), None)\n for closest_index in [closest_larger, closest_smaller]:\n if closest_index is not None and abs(closest_index - index) <= index_diff:\n return True\n indexes.add(index)\n return False\n\n ","memory":"36659"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if len(nums)<2:\n return False\n if indexDiff == 0:\n return False\n hash_table = {}\n\n if valueDiff == 0:\n for i in range(len(nums)):\n if nums[i] in hash_table and i - hash_table[nums[i]] <= indexDiff:\n return True\n\n hash_table[nums[i]] = i\n \n return False\n\n for i in range(len(nums)):\n\n if nums[i]//valueDiff in hash_table and i - hash_table[nums[i]//valueDiff][1] <= indexDiff:\n return True\n if nums[i]//valueDiff+1 in hash_table and i - hash_table[nums[i]//valueDiff+1][1] <= indexDiff and abs(hash_table[nums[i]//valueDiff+1][0]-nums[i]) <= valueDiff:\n return True\n if nums[i]//valueDiff-1 in hash_table and i - hash_table[nums[i]//valueDiff-1][1] <= indexDiff and abs(hash_table[nums[i]//valueDiff-1][0]-nums[i]) <= valueDiff:\n return True\n hash_table[nums[i]//valueDiff] = [nums[i], i]\n\n return False\n \n \n ","memory":"36863"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\n if indexDiff < 0 or valueDiff < 0:\n return False\n buckets = {}\n bucket_size = valueDiff + 1 # Adding 1 to avoid division by zero\n for i, num in enumerate(nums):\n bucket_index = num // bucket_size\n if bucket_index in buckets:\n return True\n buckets[bucket_index] = i\n if (bucket_index - 1) in buckets and abs(nums[i] - nums[buckets[bucket_index - 1]]) <= valueDiff:\n return True\n if (bucket_index + 1) in buckets and abs(nums[i] - nums[buckets[bucket_index + 1]]) <= valueDiff:\n return True\n if i >= indexDiff:\n del buckets[nums[i - indexDiff] // bucket_size]\n return False","memory":"36863"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if len(nums)<2:\n return False\n if indexDiff == 0:\n return False\n hash_table = {}\n\n if valueDiff == 0:\n for i in range(len(nums)):\n if nums[i] in hash_table and i - hash_table[nums[i]] <= indexDiff:\n return True\n\n hash_table[nums[i]] = i\n \n return False\n\n for i in range(len(nums)):\n\n if nums[i]//valueDiff in hash_table and i - hash_table[nums[i]//valueDiff][1] <= indexDiff:\n return True\n if nums[i]//valueDiff+1 in hash_table and i - hash_table[nums[i]//valueDiff+1][1] <= indexDiff and abs(hash_table[nums[i]//valueDiff+1][0]-nums[i]) <= valueDiff:\n return True\n if nums[i]//valueDiff-1 in hash_table and i - hash_table[nums[i]//valueDiff-1][1] <= indexDiff and abs(hash_table[nums[i]//valueDiff-1][0]-nums[i]) <= valueDiff:\n return True\n hash_table[nums[i]//valueDiff] = [nums[i], i]\n\n return False\n \n \n ","memory":"37066"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n\n def getBucketId(num: int) -> int:\n return num // (valueDiff + 1)\n bucket = dict()\n for idx, n in enumerate(nums):\n if idx > indexDiff:\n del bucket[getBucketId(nums[idx - indexDiff - 1])]\n\n bucketId = getBucketId(n)\n if bucketId in bucket:\n return True\n if (bucketId - 1) in bucket:\n bIdx = bucket[bucketId - 1]\n if abs(bIdx - idx) <= indexDiff and abs(nums[bIdx] - n) <= valueDiff:\n return True\n if (bucketId + 1) in bucket:\n bIdx = bucket[bucketId + 1]\n if abs(bIdx - idx) <= indexDiff and abs(nums[bIdx] - n) <= valueDiff:\n return True\n bucket[bucketId] = idx\n\n return False\n ","memory":"37270"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n \n seen = {}\n if valueDiff == 0:\n for i, num in enumerate(nums):\n if num in seen and i - seen[num] <= indexDiff:\n return True\n seen[num] = i\n return False\n\n for i, num in enumerate(nums):\n bucket = num // valueDiff\n #print(num, valueDiff, bucket)\n if bucket in seen and i - seen[bucket][0] <= indexDiff: \n return True\n if bucket - 1 in seen and i - seen[bucket-1][0] <= indexDiff and abs(num - seen[bucket-1][1]) <= valueDiff: \n #print(2222)\n return True\n\n if bucket + 1 in seen and i - seen[bucket+1][0] <= indexDiff and abs(num - seen[bucket+1][1]) <= valueDiff: \n return True\n \n seen[bucket] = (i, num)\n \n return False\n ","memory":"37474"},{"code":"from sortedcontainers import SortedSet\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n subset = SortedSet()\n for i, n in enumerate(nums):\n subset.add((n, i))\n pos = subset.bisect_left((n, i))\n j = pos + 1\n while j < len(subset):\n nn, ii = subset[j]\n if abs(ii - i) > indexDiff:\n subset.pop(j)\n else:\n if abs(nn - n) <= valueDiff:\n return True\n break\n j = pos - 1\n while j >= 0:\n nn, ii = subset[j]\n if abs(ii - i) > indexDiff:\n subset.pop(j)\n j -= 1\n else:\n if abs(nn - n) <= valueDiff:\n return True\n break\n return False\n \n \n \n ","memory":"37678"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, val: int) -> bool:\n db = defaultdict(int)\n uniqe_nums = sorted(list(set(nums)))\n n = len(nums)\n for i in range(min(n, k+1)):\n db[nums[i]] += 1\n\n for i in range(n):\n cur = 0\n # print(db, nums)\n lid = bisect_left(uniqe_nums, nums[i]-val)\n # rid = bisect_left(uniqe_nums, nums[i]+val)\n for j in range(lid, len(uniqe_nums)):\n if uniqe_nums[j]>(val+nums[i]):\n break\n # print(uniqe_nums[j], nums[i])\n cur += db[uniqe_nums[j]]\n if cur>=2:\n return True\n if i-k>=0:\n db[nums[i-k]] -= 1\n if i+k+1<n:\n db[nums[i+k+1]] += 1\n\n return False\n ","memory":"37881"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n N, L, R = list(enumerate(nums)), 0, 1\n N.sort(key=lambda x:(x[1],x[0])) \n def check(L, R):\n for l in range(L, R):\n for r in range(l+1, R+1):\n if N[r][1]-N[l][1]<=valueDiff and abs(N[r][0]-N[l][0])<=indexDiff:\n return True \n return False \n while L<R and R<len(N):\n if check(L, R): return True\n if N[R][1]-N[L][1]<valueDiff: R+=1\n else: L += 1\n if R<=L: R = L+1\n return False ","memory":"38085"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n N = list(enumerate(nums))\n N.sort(key=lambda x:(x[1],x[0])) \n def check(L, R):\n for l in range(L, R):\n for r in range(l+1, R+1):\n if N[r][1]-N[l][1]<=valueDiff and abs(N[r][0]-N[l][0])<=indexDiff:\n return True \n return False\n L, R = 0, 1\n while L<R and R<len(N):\n v1, v2 = N[L], N[R]\n if check(L, R): return True\n if v2[1]-v1[1]<valueDiff: R+=1\n else: L += 1\n if R<=L: R = L+1\n return False ","memory":"38289"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if len(nums) <= 1:\n return False\n \n arr = [(val, i) for i, val in enumerate(nums)]\n arr.sort(key=lambda x: (x[0], x[1]))\n l, r = 0, 1 # r is EXCLUSIVE.\n\n while r < len(arr):\n # Ensures we're within correct value diff\n if arr[r][0] - arr[l][0] <= valueDiff:\n r += 1\n continue\n \n # We've reached an r value that is exclusive.\n while l < r - 1:\n front = arr[l + 1][1]\n back = arr[l][1]\n if front - back <= indexDiff:\n return True\n l += 1\n \n if arr[r][0] - arr[l][0] <= valueDiff and abs(arr[r][1] - arr[l][1]) <= indexDiff:\n return True\n\n l += 1\n \n # We've reached an r value that is exclusive.\n while l < r - 1:\n front = arr[l + 1][1]\n back = arr[l][1]\n if front - back <= indexDiff:\n return True\n l += 1\n \n return False\n\n\n'''\nindexDiff = 2\nvalueDiff = 2\n[(0, 2), (3, 0), (4, 3), (6, 1)]\n ^\n ^\n\nindexDiff = 3\nvalueDiff = 0\n[(1, 0), (1, 3), (2, 1), (3, 2) ]\n ^ ^\n\nindexDiff = 2\nvalueDiff = 3\n[(1, 0), (1, 3), (5, 1), (5, 4), (6, 9), (9, 2)]\n ^ ^\n\nindexDiff = 1\nvalueDiff = 2\n[(0, 1), (1, 0), (1, 2), (1, 3)]\n ^ ^\n\n\n\n\nApproach 2\nMake every value a tuple that correlates to its index-- (value, index)\nSort this array by value.\n\nDo two pointers-- iterate up to the edge of the valueDiff, then move the left pointer to catch up and see if any satisfy the indexDiff.\nWhen the left pointer reaches the first entry that has the same value, start moving the right pointer again.\n\n'''","memory":"38493"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(\n self, nums: List[int], indexDiff: int, valueDiff: int\n ):\n min_num = inf\n max_num = -inf\n\n for num in nums:\n min_num = min(min_num, num)\n max_num = max(max_num, num)\n\n bucket_size = valueDiff + 1\n num_buckets = (max_num - min_num) // bucket_size\n num_buckets += 1\n buckets: List[int] = [inf] * num_buckets\n\n for i, num in enumerate(nums):\n in_bucket = (num - min_num) // bucket_size\n\n if buckets[in_bucket] != inf:\n return True\n\n left_diff = abs(buckets[in_bucket - 1] - num) if in_bucket > 0 else inf\n right_diff = (\n abs(buckets[in_bucket + 1] - num)\n if in_bucket < num_buckets - 1\n else inf\n )\n\n if min(left_diff, right_diff) <= valueDiff:\n return True\n\n buckets[in_bucket] = num\n\n if 0 <= i - indexDiff:\n out_bucket = (nums[i - indexDiff] - min_num) // bucket_size\n buckets[out_bucket] = inf\n\n return False\n","memory":"38696"},{"code":"class Solution:\n # Sliding window + Bucket\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if valueDiff < 0 or indexDiff < 1:\n return False\n \n buckets = {}\n # this helps numbers closer to each other can be mapped to the same bucket\n bucket_size = valueDiff + 1 \n BASE = -sys.maxsize - 1\n # BASE = -2**31\n for i in range(len(nums)):\n # Use Python's minimum integer value to handle negative numbers\n adjusted_num = nums[i] - BASE\n bucket = adjusted_num // bucket_size\n # print(nums[i], \" in bucket \", bucket)\n if bucket in buckets:\n return True\n # Check adjacent buckets\n if bucket - 1 in buckets and adjusted_num - buckets[bucket - 1] <= valueDiff:\n return True\n if bucket + 1 in buckets and buckets[bucket + 1] - adjusted_num <= valueDiff:\n return True\n # out of window\n if i >= indexDiff:\n leftmost_bucket = (nums[i - indexDiff] - BASE) // bucket_size\n buckets.pop(leftmost_bucket, None)\n buckets[bucket] = adjusted_num\n \n return False","memory":"38900"},{"code":"from typing import List\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if valueDiff < 0:\n return False\n \n buc = {}\n \n for i, val in enumerate(nums):\n bid = val // (valueDiff + 1) if valueDiff > 0 else val\n \n # Check current bucket\n if bid in buc and i - buc[bid][0] <= indexDiff:\n return True\n \n # Check adjacent buckets\n if (bid + 1 in buc and i - buc[bid + 1][0] <= indexDiff and \n abs(val - buc[bid + 1][1]) <= valueDiff):\n return True\n \n if (bid - 1 in buc and i - buc[bid - 1][0] <= indexDiff and \n abs(val - buc[bid - 1][1]) <= valueDiff):\n return True\n \n # Add current value to the bucket\n buc[bid] = (i, val)\n \n return False\n","memory":"39104"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\n if t < 0: return False # edge case \n \n seen = {}\n for i, x in enumerate(nums): \n bkt = x//(t+1)\n if bkt in seen and i - seen[bkt][0] <= k: return True \n if bkt-1 in seen and i - seen[bkt-1][0] <= k and abs(x - seen[bkt-1][1]) <= t: return True \n if bkt+1 in seen and i - seen[bkt+1][0] <= k and abs(x - seen[bkt+1][1]) <= t: return True \n seen[bkt] = (i, x) \n return False ","memory":"39308"},{"code":"import numpy as np\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if indexDiff <= 0 or valueDiff < 0:\n return False\n\n from sortedcontainers import SortedList\n\n sorted_window = SortedList()\n for i, num in enumerate(nums):\n # Maintain the sliding window of size `indexDiff`\n if i > indexDiff:\n sorted_window.remove(nums[i - indexDiff - 1])\n\n # Find the position where the current number would fit in the sorted window\n pos = SortedList.bisect_left(sorted_window, num - valueDiff)\n\n # Check if there is any number in the window within the required `valueDiff`\n if pos < len(sorted_window) and abs(sorted_window[pos] - num) <= valueDiff:\n return True\n\n # Insert the current number in the sorted window\n sorted_window.add(num)\n\n return False","memory":"39511"},{"code":"class Solution:\n def __init__(self):\n self.bit = [0 for i in range(100005)]\n def update(self, index, val):\n i = index\n while i <= 100001:\n self.bit[i] += val\n i += i & -i\n def query(self, index):\n i = index\n ans = 0\n while i > 0:\n ans += self.bit[i]\n i -= i & -i\n return ans\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n indexedArray = []\n for (i, number) in enumerate(nums):\n indexedArray.append([number, i+1])\n indexedArray.sort(key = lambda x:(x[0], x[1]))\n\n bptr = -1\n for i in range(len(indexedArray)):\n while bptr+1 < len(indexedArray) and indexedArray[bptr+1][0]+valueDiff < indexedArray[i][0]:\n self.update(indexedArray[bptr+1][1], -1)\n bptr+=1\n currIndex = indexedArray[i][1]\n amt = self.query(min(currIndex+indexDiff, 100001)) - self.query(max(currIndex-indexDiff-1,0))\n\n self.update(currIndex, 1)\n\n if amt > 0:\n return True\n return False\n ","memory":"39715"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n seen = {}\n for i, num in enumerate(nums): \n print(num, valueDiff, num//(valueDiff+1))\n bkt = num//(valueDiff+1)\n if bkt in seen and i - seen[bkt][0] <= indexDiff: return True \n if bkt-1 in seen and i - seen[bkt-1][0] <= indexDiff and abs(num - seen[bkt-1][1]) <= valueDiff: return True \n if bkt+1 in seen and i - seen[bkt+1][0] <= indexDiff and abs(num - seen[bkt+1][1]) <= valueDiff: return True \n seen[bkt] = (i, num) \n return False ","memory":"39919"},{"code":"from sortedcontainers import SortedList\n\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n \"\"\"\n brute force : n * indexDiff\n\n balanced binary search tree : n * log (index diff)\n\n best solution:\n buckets: n\n \n \"\"\"\n\n return bucket_search(nums, indexDiff, valueDiff)\n\n sorted_list = SortedList()\n for i, num in enumerate(nums):\n max_val = valueDiff + num\n min_val = -valueDiff + num\n # range from 0 to len() inclusive\n idx1 = sorted_list.bisect_left(min_val)\n if idx1 < len(sorted_list) and sorted_list[idx1] <= max_val:\n return True\n \n if i >= indexDiff:\n # remember remover\n sorted_list.remove(nums[i - indexDiff])\n \n sorted_list.add(num)\n \n return False\n\n\n\n\ndef bucket_search(nums, indexDiff, valueDiff):\n min_val, max_val = min(nums), max(nums)\n # case valueDiff 0\n bucket_size = valueDiff + 1 # [0, size)\n size = math.floor((max_val - min_val) // bucket_size) + 1\n buckets = [-math.inf] * size\n\n # [-inf, 4]\n for i, num in enumerate(nums):\n idx = (num - min_val) // bucket_size\n if buckets[idx] != -math.inf:\n return True\n prev, nex = idx - 1, idx + 1\n\n if prev >= 0 and buckets[prev] > -math.inf and num - buckets[prev] <= valueDiff or \\\n nex < size and buckets[nex] > -math.inf and buckets[nex] - num <= valueDiff:\n return True\n \n if i >= indexDiff:\n removal = (nums[i - indexDiff] - min_val) // bucket_size\n buckets[removal] = -math.inf\n \n buckets[idx] = num\n \n return False\n","memory":"40123"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n sl = SortedList()\n sl_diff = SortedList()\n n = len(nums)\n MAXV = int(1e9)\n nums = [v + MAXV for v in nums]\n for i in range(n):\n if (i - indexDiff > 0):\n v = nums[i - indexDiff - 1]\n index_sl = sl.bisect_left((v, i - indexDiff - 1))\n if (index_sl > 0):\n diff = v - sl[index_sl - 1][0]\n sl_diff.remove((diff, i - indexDiff - 1))\n if (index_sl <= indexDiff - 1):\n diff = sl[index_sl + 1][0] - v\n sl_diff.remove((diff, sl[index_sl + 1][1]))\n\n if (index_sl > 0 and index_sl <= indexDiff - 1):\n new_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\n sl_diff.add((new_diff, sl[index_sl + 1][1]))\n sl.remove((v, i - indexDiff - 1))\n\n sl.add((nums[i], i))\n if (i == 0):\n continue\n v = nums[i]\n index_sl = sl.bisect_left((v, i))\n if (index_sl > 0 and index_sl < len(sl) - 1):\n back_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\n sl_diff.remove((back_diff, sl[index_sl + 1][1]))\n\n if (index_sl > 0):\n diff = v - sl[index_sl - 1][0]\n sl_diff.add((diff, i))\n if (index_sl < len(sl) - 1):\n diff = sl[index_sl + 1][0] - v\n sl_diff.add((diff, sl[index_sl + 1][1]))\n\n if (sl_diff[0][0] <= valueDiff):\n return True\n\n return False\n\n ","memory":"40326"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n n = len(nums)\n aa = [i // (valueDiff +1) for i in nums]\n dic = {}\n i = 0\n for j in range(n):\n b = aa[j]\n\n if b in dic and dic[b]:\n return True\n \n if b-1 in dic:\n possible = dic[b-1]\n for k in possible:\n if abs(nums[j] - k) <= valueDiff:\n return True\n \n if b+1 in dic:\n possible = dic[b+1]\n for k in possible:\n if abs(nums[j] - k) <= valueDiff:\n return True\n\n if b in dic:\n dic[b].append(nums[j])\n else:\n dic[b] = [nums[j]]\n\n if j - i == indexDiff:\n dic[aa[i]].pop(0)\n i += 1\n return False\n \n\n \n\n ","memory":"40530"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n\n n = len(nums)\n\n nums_dict = {}\n\n nums_sorted = []\n\n for index in range(n):\n\n num = nums[index]\n\n if num not in nums_dict:\n\n nums_dict[num] = [index]\n\n else:\n\n i = 0\n\n j = len(nums_dict[num]) - 1\n\n while i < j:\n\n k = (i + j + 1) // 2\n\n if nums_dict[num][k] <= index:\n\n i = k\n\n else:\n\n j = k - 1\n\n if abs(nums_dict[num][i]-index) <= indexDiff:\n\n return True\n\n if nums_dict[num][i] > index:\n\n i = -1\n\n nums_dict[num].insert(i+1,index)\n\n if len(nums_sorted) == 0:\n\n nums_sorted.append(num)\n\n else:\n\n i = 0\n\n j = len(nums_sorted) - 1\n\n while i < j:\n\n k = (i + j + 1) // 2\n\n if nums_sorted[k] <= num:\n\n i = k\n\n else:\n\n j = k - 1\n\n if nums_sorted[i] > num:\n\n nums_sorted.insert(0,num)\n\n elif nums_sorted[i] < num:\n\n nums_sorted.insert(i+1,num)\n\n for index in range(len(nums_sorted)-1):\n\n num = nums_sorted[index]\n\n for step in range(index+1,len(nums_sorted)):\n\n if abs(num-nums_sorted[step]) > valueDiff:\n\n break\n\n targets = nums_dict[nums_sorted[step]]\n\n for target in nums_dict[num]:\n\n i = 0\n\n j = len(targets) - 1\n\n while i < j:\n\n k = (i + j + 1) // 2\n\n if targets[k] <= target:\n\n i = k\n\n else:\n\n j = k - 1\n\n if abs(targets[i] - target) <= indexDiff:\n\n return True\n\n if i != len(targets) - 1 and abs(targets[i+1] - target) <= indexDiff:\n\n return True\n \n return False","memory":"40734"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # brute force\n # n = len(nums)\n # for i in range(n):\n # for j in range(i+1, n):\n # if abs(i-j) <= indexDiff and abs(nums[i] - nums[j]) <= valueDiff:\n # return True\n # return False\n\n # sliding window\n if valueDiff < 0: # Edge case where valueDiff is negative\n return False\n\n # Helper function to calculate the bucket ID, handling negative numbers correctly\n def get_bucket_id(x, bucket_size):\n return x // bucket_size \n \n seen = {} # Dictionary to store the bucket ID and the corresponding (index, value)\n bucket_size = valueDiff + 1 # Bucket size is valueDiff + 1 to ensure proper bucketing\n\n for i, x in enumerate(nums):\n # Determine the bucket ID for the current number\n bucket_id = get_bucket_id(x, bucket_size)\n\n # Check if the current bucket already contains a number\n if bucket_id in seen and i - seen[bucket_id][0] <= indexDiff:\n return True\n\n # Check the previous bucket (bucket_id - 1)\n if bucket_id - 1 in seen and i - seen[bucket_id - 1][0] <= indexDiff and abs(x - seen[bucket_id - 1][1]) <= valueDiff:\n return True\n\n # Check the next bucket (bucket_id + 1)\n if bucket_id + 1 in seen and i - seen[bucket_id + 1][0] <= indexDiff and abs(x - seen[bucket_id + 1][1]) <= valueDiff:\n return True\n\n # Store the current number and its index in the seen dictionary\n seen[bucket_id] = (i, x)\n\n # Remove the element that's outside the indexDiff range\n if i >= indexDiff:\n old_bucket_id = get_bucket_id(nums[i - indexDiff], bucket_size)\n del seen[old_bucket_id]\n\n return False","memory":"40938"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n # brute force\n # n = len(nums)\n # for i in range(n):\n # for j in range(i+1, n):\n # if abs(i-j) <= indexDiff and abs(nums[i] - nums[j]) <= valueDiff:\n # return True\n # return False\n\n # sliding window\n if valueDiff < 0: # Edge case where valueDiff is negative\n return False\n\n # Helper function to calculate the bucket ID\n def get_bucket_id(x, bucket_size):\n return x // bucket_size\n \n seen = {} # Dictionary to store the bucket ID and the corresponding (index, value)\n bucket_size = valueDiff + 1 # Bucket size is valueDiff + 1 to ensure proper bucketing\n\n for i, x in enumerate(nums):\n # Determine the bucket ID for the current number\n bucket_id = get_bucket_id(x, bucket_size)\n\n # Check if the current bucket already contains a number\n if bucket_id in seen and i - seen[bucket_id][0] <= indexDiff:\n return True\n\n # Check the previous bucket (bucket_id - 1)\n if bucket_id - 1 in seen and i - seen[bucket_id - 1][0] <= indexDiff and abs(x - seen[bucket_id - 1][1]) <= valueDiff:\n return True\n\n # Check the next bucket (bucket_id + 1)\n if bucket_id + 1 in seen and i - seen[bucket_id + 1][0] <= indexDiff and abs(x - seen[bucket_id + 1][1]) <= valueDiff:\n return True\n\n # Store the current number and its index in the seen dictionary\n seen[bucket_id] = (i, x)\n\n # Remove the element that's outside the indexDiff range\n if i >= indexDiff:\n old_bucket_id = get_bucket_id(nums[i - indexDiff], bucket_size)\n del seen[old_bucket_id]\n\n return False","memory":"40938"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\n bucket=Counter()\n for i,num in enumerate(nums):\n n = num//(t+1)\n if n-1 in bucket and i-bucket[n-1][0]<=k and abs(num-bucket[n-1][1])<=t:\n return True\n if n in bucket and i-bucket[n][0]<=k:\n return True\n if n+1 in bucket and i-bucket[n+1][0]<=k and abs(num-bucket[n+1][1])<=t:\n return True\n bucket[n]=(i,num)\n return False\n\n ","memory":"41141"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n sl = SortedList()\n sl_diff = SortedList()\n n = len(nums)\n MAXV = int(1e9)\n nums = [v + MAXV for v in nums]\n for i in range(n):\n print(\"index: \", i)\n if (i - indexDiff > 0):\n v = nums[i - indexDiff - 1]\n index_sl = sl.bisect_left((v, i - indexDiff - 1))\n if (index_sl > 0):\n diff = v - sl[index_sl - 1][0]\n sl_diff.remove((diff, i - indexDiff - 1))\n if (index_sl <= indexDiff - 1):\n diff = sl[index_sl + 1][0] - v\n sl_diff.remove((diff, sl[index_sl + 1][1]))\n\n if (index_sl > 0 and index_sl <= indexDiff - 1):\n new_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\n sl_diff.add((new_diff, sl[index_sl + 1][1]))\n sl.remove((v, i - indexDiff - 1))\n\n sl.add((nums[i], i))\n if (i == 0):\n continue\n v = nums[i]\n index_sl = sl.bisect_left((v, i))\n if (index_sl > 0 and index_sl < len(sl) - 1):\n back_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\n sl_diff.remove((back_diff, sl[index_sl + 1][1]))\n\n if (index_sl > 0):\n diff = v - sl[index_sl - 1][0]\n sl_diff.add((diff, i))\n if (index_sl < len(sl) - 1):\n diff = sl[index_sl + 1][0] - v\n sl_diff.add((diff, sl[index_sl + 1][1]))\n\n if (sl_diff[0][0] <= valueDiff):\n return True\n\n return False\n\n ","memory":"41345"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if indexDiff < 0 or valueDiff < 0:\n return False\n\n seen = {}\n for i, num in enumerate(nums):\n bkt = num // (valueDiff + 1)\n if bkt in seen and i - seen[bkt][0] <= indexDiff:\n return True\n if (\n bkt - 1 in seen and i - seen[bkt - 1][0] <= indexDiff and \n abs(num - seen[bkt - 1][1]) <= valueDiff\n ):\n return True\n\n if (\n bkt + 1 in seen and i - seen[bkt + 1][0] <= indexDiff and \n abs(num - seen[bkt + 1][1]) <= valueDiff\n ):\n return True\n\n seen[bkt] = (i, num)\n\n return False\n","memory":"41549"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n sl = SortedList()\n sl_diff = SortedList()\n n = len(nums)\n MAXV = int(1e9)\n nums = [v + MAXV for v in nums]\n sol = False\n for i in range(n):\n print(\"index: \", i)\n if (i - indexDiff > 0):\n v = nums[i - indexDiff - 1]\n index_sl = sl.bisect_left((v, i - indexDiff - 1))\n if (index_sl > 0):\n diff = v - sl[index_sl - 1][0]\n sl_diff.remove((diff, i - indexDiff - 1))\n if (index_sl <= indexDiff - 1):\n diff = sl[index_sl + 1][0] - v\n sl_diff.remove((diff, sl[index_sl + 1][1]))\n\n if (index_sl > 0 and index_sl <= indexDiff - 1):\n new_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\n sl_diff.add((new_diff, sl[index_sl + 1][1]))\n sl.remove((v, i - indexDiff - 1))\n\n sl.add((nums[i], i))\n if (i == 0):\n continue\n v = nums[i]\n index_sl = sl.bisect_left((v, i))\n if (index_sl > 0 and index_sl < len(sl) - 1):\n back_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\n sl_diff.remove((back_diff, sl[index_sl + 1][1]))\n\n if (index_sl > 0):\n diff = v - sl[index_sl - 1][0]\n sl_diff.add((diff, i))\n if (index_sl < len(sl) - 1):\n diff = sl[index_sl + 1][0] - v\n sl_diff.add((diff, sl[index_sl + 1][1]))\n\n sol |= sl_diff[0][0] <= valueDiff\n return sol\n\n ","memory":"41753"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n if valueDiff < 0:\n return False\n\n seen = {}\n\n for i, x in enumerate(nums):\n bkt = x // (valueDiff + 1)\n if bkt in seen and i - seen[bkt][0] <= indexDiff: return True\n if bkt-1 in seen and i - seen[bkt-1][0] <= indexDiff and abs(x - seen[bkt-1][1]) <= valueDiff: return True\n if bkt+1 in seen and i - seen[bkt+1][0] <= indexDiff and abs(x- seen[bkt+1][1]) <= valueDiff: return True\n seen[bkt] = (i, x)\n \n return False\n ","memory":"41956"},{"code":"class Solution:\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\n seen = {}\n for i, x in enumerate(nums): \n bkt = x//(valueDiff+1)\n if bkt in seen and i - seen[bkt][0] <= indexDiff: return True \n if bkt-1 in seen and i - seen[bkt-1][0] <= indexDiff and abs(x - seen[bkt-1][1]) <= valueDiff: return True \n if bkt+1 in seen and i - seen[bkt+1][0] <= indexDiff and abs(x - seen[bkt+1][1]) <= valueDiff: return True \n seen[bkt] = (i, x) \n return False \n\n\n","memory":"41956"}],"string":"[\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n set_ = SortedList()\\n for i in range(len(nums)):\\n # Find the successor of current element\\n idx = set_.bisect_left(nums[i])\\n if idx != len(set_) and set_[idx] <= nums[i] + valueDiff:\\n return True\\n\\n # Find the predecessor of current element\\n if idx > 0 and nums[i] <= set_[idx - 1] + valueDiff:\\n return True\\n\\n set_.add(nums[i])\\n if len(set_) > indexDiff:\\n set_.remove(nums[i - indexDiff])\\n\\n return False\",\n \"memory\": \"28101\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n sorted_list = SortedList()\\n \\n for i in range(len(nums)):\\n # If the window exceeds the indexDiff, remove the element that's out of the window\\n if i > indexDiff:\\n sorted_list.remove(nums[i - indexDiff - 1])\\n \\n # Find the position where nums[i] would fit in the sorted list\\n pos = sorted_list.bisect_left(nums[i] - valueDiff)\\n \\n # Check if there's a valid element in the sorted list within the valueDiff\\n if pos < len(sorted_list) and abs(sorted_list[pos] - nums[i]) <= valueDiff:\\n return True\\n \\n # Add the current number to the sorted list\\n sorted_list.add(nums[i])\\n \\n return False\",\n \"memory\": \"28101\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n \\n # Keep sorted sliding window\\n # Keep queue of nums to pop off the sliding window, these are the nums exiting the sliding window\\n # On every iteration, use the numbers next to the number just inserted to get the new diffs \\n # If new diff is less than valueDiff then return True\\n # Size of the sliding window is indexDiff\\n # O(log(N)) to insert into sliding window, which can happen N times so O(Nlog(N))\\n\\n window = []\\n queue = Deque()\\n\\n def find_index(num):\\n l, r = 0, len(window)\\n while l < r:\\n m = (l + r) // 2\\n if window[m] < num:\\n l = m + 1\\n else:\\n r = m\\n \\n return l\\n\\n def remove_from_window(num):\\n window.pop(find_index(num))\\n\\n def add_to_window(num):\\n ind = find_index(num)\\n window.insert(ind, num)\\n return ind\\n\\n for num in nums:\\n if len(window) == indexDiff + 1:\\n remove_from_window(queue.popleft())\\n \\n ind = add_to_window(num)\\n if ind - 1 >= 0 and num - window[ind-1] <= valueDiff:\\n return True\\n \\n if ind + 1 < len(window) and window[ind+1] - num <= valueDiff:\\n return True\\n \\n queue.append(num)\\n # print(queue, window)\\n\\n return False\",\n \"memory\": \"28305\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # keep track of index ordering i.e., queue/ordered dict => can remove value out of bounds\\n # keep values ordered so can check if pair exists quickly -> O(log n)\\n # use a binary search + list queue\\n sorted_ns = []\\n queue = []\\n for n in nums:\\n # print(f\\\"before {n}: sorted_ns {sorted_ns} {queue}\\\")\\n # check if pair exists for n\\n i = bisect.bisect(sorted_ns, n)\\n if i - 1 >= 0 and n - sorted_ns[i-1] <= valueDiff:\\n return True\\n if i < len(sorted_ns) and sorted_ns[i] - n <= valueDiff:\\n return True\\n sorted_ns.insert(i, n)\\n queue.append(n)\\n # print(f\\\"after: sorted_ns {sorted_ns} {queue}\\\")\\n if len(sorted_ns) > indexDiff:\\n # remove first added item\\n remove_n = queue[0]\\n # find remove_n in bst\\n remove_i = bisect.bisect_left(sorted_ns, remove_n)\\n del sorted_ns[remove_i]\\n queue = queue[1:]\\n return False\",\n \"memory\": \"28509\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # keep track of index ordering i.e., queue/ordered dict => can remove value out of bounds\\n # keep values ordered so can check if pair exists quickly -> O(log n)\\n # use a binary search + list queue\\n sorted_ns = []\\n queue = []\\n for n in nums:\\n # print(f\\\"before {n}: sorted_ns {sorted_ns} {queue}\\\")\\n # check if pair exists for n\\n i = bisect.bisect(sorted_ns, n)\\n if i - 1 >= 0 and n - sorted_ns[i-1] <= valueDiff:\\n return True\\n if i < len(sorted_ns) and sorted_ns[i] - n <= valueDiff:\\n return True\\n sorted_ns.insert(i, n)\\n queue.append(n)\\n # print(f\\\"after: sorted_ns {sorted_ns} {queue}\\\")\\n if len(sorted_ns) > indexDiff:\\n # remove first added item\\n remove_n = queue[0]\\n # find remove_n in bst\\n remove_i = bisect.bisect_left(sorted_ns, remove_n)\\n del sorted_ns[remove_i]\\n queue = queue[1:]\\n return False\",\n \"memory\": \"28509\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums, k, t):\\n set_ = SortedList()\\n for i in range(len(nums)):\\n # Find the successor of current element\\n idx = set_.bisect_left(nums[i])\\n if idx != len(set_) and set_[idx] <= nums[i] + t:\\n return True\\n\\n # Find the predecessor of current element\\n if idx > 0 and nums[i] <= set_[idx - 1] + t:\\n return True\\n\\n set_.add(nums[i])\\n if len(set_) > k:\\n set_.remove(nums[i - k])\\n\\n return False\",\n \"memory\": \"28713\"\n },\n {\n \"code\": \"import sortedcontainers\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n sl = sortedcontainers.SortedList()\\n for i, num in enumerate(nums):\\n if len(sl) >= 1:\\n it = sl.irange(num - valueDiff, num + valueDiff)\\n if len(list(it)) > 0:\\n return True\\n # check if the largest value in the sorted list\\n # minus num, is less than valueDiff\\n if i >= indexDiff:\\n sl.remove(nums[i - indexDiff])\\n sl.add(num)\\n return False\\n\",\n \"memory\": \"28916\"\n },\n {\n \"code\": \"import sortedcontainers\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\\n \\n def floor(n, bst):\\n le = bst.bisect_right(n) - 1\\n return bst[le] if le >= 0 else None\\n \\n def ceiling(n, bst):\\n ge = bst.bisect_right(n)\\n return bst[ge] if ge < len(bst) else None\\n \\n bst = sortedcontainers.SortedList()\\n for i, n in enumerate(nums):\\n le = floor(n, bst)\\n if le is not None and n <= le + t:\\n return True\\n ge = ceiling(n, bst)\\n if ge is not None and ge <= n + t:\\n return True\\n bst.add(n)\\n if len(bst) > k:\\n bst.remove(nums[i-k])\\n return False\\n # time: O(nlogk)\\n # space: O(k)\",\n \"memory\": \"29120\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums, k, t):\\n set_ = SortedList()\\n for i in range(len(nums)):\\n # Find the successor of current element\\n idx = set_.bisect_left(nums[i])\\n if idx != len(set_) and set_[idx] <= nums[i] + t:\\n return True\\n\\n # Find the predecessor of current element\\n if idx > 0 and nums[i] <= set_[idx - 1] + t:\\n return True\\n\\n set_.add(nums[i])\\n if len(set_) > k:\\n set_.remove(nums[i - k])\\n\\n return False\",\n \"memory\": \"29120\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if valueDiff < 0 or indexDiff < 0:\\n return False\\n \\n sorted_list = SortedList()\\n \\n for i in range(len(nums)):\\n # Find the smallest number >= nums[i] - valueDiff in the sorted list\\n if sorted_list:\\n pos = sorted_list.bisect_left(nums[i] - valueDiff)\\n # Check if this number is <= nums[i] + valueDiff\\n if pos < len(sorted_list) and sorted_list[pos] <= nums[i] + valueDiff:\\n return True\\n \\n # Add the current number to the sorted list\\n sorted_list.add(nums[i])\\n \\n # Ensure the sliding window only contains indexDiff + 1 elements\\n if len(sorted_list) > indexDiff:\\n sorted_list.remove(nums[i - indexDiff])\\n \\n return False\\n\",\n \"memory\": \"29324\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # implement bisect left function to not have from scratch\\n\\n window = SortedList()\\n for i in range(len(nums)):\\n # search nums[r] in search_list\\n idx = window.bisect_left(nums[i])\\n # print(idx, nums[i], window)\\n\\n # abs(indow[idx] - nums[i]) <= valueDiff\\n # where window[idx] >= nums[i] from def of bisect left function\\n if idx != len(window) and window[idx] - nums[i] <= valueDiff:\\n return True\\n # abs(window[idx - 1] - nums[i]) <= valueDiff\\n # where window[idx - 1] < nums[i]\\n if idx >= 1 and nums[i] - window[idx - 1] <= valueDiff:\\n return True\\n\\n window.add(nums[i])\\n # if i >= indexDiff:\\n if len(window) > indexDiff:\\n window.remove(nums[i - indexDiff])\\n\\n return False\",\n \"memory\": \"29324\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nimport bisect\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # put items into sliding window\\n last_items = SortedList()\\n i = j = 0\\n while j < len(nums):\\n if i + indexDiff < j:\\n # remove nums[i]\\n last_items.remove(nums[i])\\n i += 1\\n x = bisect.bisect_left(last_items, nums[j])\\n options = last_items[max(x - 1, 0): x + 2]\\n for option in options:\\n if abs(option - nums[j]) <= valueDiff:\\n return True\\n # add nums[j]\\n last_items.add(nums[j])\\n j += 1\\n return False\",\n \"memory\": \"29528\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nimport bisect\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # put items into sliding window\\n last_items = SortedList()\\n i = j = 0\\n while j < len(nums):\\n if i + indexDiff < j:\\n # remove nums[i]\\n last_items.remove(nums[i])\\n i += 1\\n print(\\\"numsj: \\\"+str(nums[j]))\\n x = bisect.bisect_left(last_items, nums[j])\\n options = last_items[max(x - 1, 0): x + 2]\\n for option in options:\\n if abs(option - nums[j]) <= valueDiff:\\n return True\\n # add nums[j]\\n last_items.add(nums[j])\\n j += 1\\n return False\",\n \"memory\": \"29731\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nimport bisect\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # put items into sliding window\\n last_items = SortedList()\\n i = j = 0\\n while j < len(nums):\\n if i + indexDiff < j:\\n # remove nums[i]\\n last_items.remove(nums[i])\\n i += 1\\n print(\\\"numsj: \\\"+str(nums[j]))\\n x = bisect.bisect_left(last_items, nums[j])\\n options = last_items[max(x - 1, 0): x + 2]\\n for option in options:\\n if abs(option - nums[j]) <= valueDiff:\\n return True\\n # add nums[j]\\n last_items.add(nums[j])\\n j += 1\\n return False\",\n \"memory\": \"29935\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\\n if valueDiff < 0:\\n return False\\n \\n window = SortedSet()\\n \\n for i in range(len(nums)):\\n if i > indexDiff:\\n window.remove(nums[i - indexDiff - 1])\\n \\n pos1 = window.bisect_left(nums[i] - valueDiff)\\n pos2 = window.bisect_right(nums[i] + valueDiff)\\n \\n if pos1 != pos2 and pos1 != len(window):\\n return True\\n \\n window.add(nums[i])\\n \\n return False\\n\\n# Example usage:\\nsolution = Solution()\\nnums = [1, 2, 3, 1]\\nindexDiff = 3\\nvalueDiff = 0\\nprint(solution.containsNearbyAlmostDuplicate(nums, indexDiff, valueDiff)) # Output: True\\n\\nnums = [1, 5, 9, 1, 5, 9]\\nindexDiff = 2\\nvalueDiff = 3\\nprint(solution.containsNearbyAlmostDuplicate(nums, indexDiff, valueDiff)) # Output: False\",\n \"memory\": \"30139\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet\\n\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(\\n self, nums: List[int], indexDiff: int, valueDiff: int\\n ) -> bool:\\n s = SortedSet()\\n for i, v in enumerate(nums):\\n j = s.bisect_left(v - valueDiff)\\n if j < len(s) and s[j] <= v + valueDiff:\\n return True\\n s.add(v)\\n if i >= indexDiff:\\n s.remove(nums[i - indexDiff])\\n return False\",\n \"memory\": \"30139\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\\n if valueDiff < 0:\\n return False\\n \\n window = SortedSet()\\n \\n for j in range(len(nums)):\\n if j > indexDiff:\\n window.remove(nums[j - indexDiff - 1])\\n \\n left = nums[j] - valueDiff\\n right = nums[j] + valueDiff\\n \\n # Check if there is a number within the range [left, right] in the window\\n idx = window.bisect_left(left)\\n if idx < len(window) and window[idx] <= right:\\n return True\\n \\n window.add(nums[j])\\n \\n return False\\n\\n# Example usage:\\nsolution = Solution()\\nnums = [1, 2, 3, 1]\\nindexDiff = 3\\nvalueDiff = 0\\nprint(solution.containsNearbyAlmostDuplicate(nums, indexDiff, valueDiff)) # Output: True\\n\\nnums = [1, 5, 9, 1, 5, 9]\\nindexDiff = 2\\nvalueDiff = 3\\nprint(solution.containsNearbyAlmostDuplicate(nums, indexDiff, valueDiff)) # Output: False\",\n \"memory\": \"30343\"\n },\n {\n \"code\": \"from bisect import bisect_left\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n k_sorted = []\\n for i in range(len(nums)):\\n j = bisect_left(k_sorted, nums[i])\\n if j > 0 and abs(k_sorted[j-1] - nums[i]) <= valueDiff or j < len(k_sorted) and abs(k_sorted[j] - nums[i]) <= valueDiff:\\n return True\\n k_sorted.insert(j, nums[i])\\n if i >= indexDiff:\\n del k_sorted[bisect_left(k_sorted, nums[i-indexDiff])]\\n return False\",\n \"memory\": \"30546\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n snum = []\\n for i, n in enumerate(nums):\\n # check with successor\\n p = bisect.bisect_left(snum, n)\\n if p < len(snum) and snum[p] - n <= valueDiff:\\n return True\\n # check with predecessor\\n if p > 0 and n - snum[p - 1] <= valueDiff:\\n return True\\n\\n bisect.insort_left(snum, n)\\n # if len(snum) > indexDiff + 1: # !!! This would be wrong !!!\\n if len(snum) > indexDiff:\\n # j = bisect.bisect_left(snum, snum[i - indexDiff])\\n snum.remove(nums[i - indexDiff])\\n\\n return False\\n\",\n \"memory\": \"30546\"\n },\n {\n \"code\": \"from bisect import bisect_left\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # k_sorted = nums[:indexDiff]\\n # k_sorted.sort()\\n k_sorted = []\\n for i in range(len(nums)):\\n # Bisect left search\\n j = bisect_left(k_sorted, nums[i])\\n if j > 0 and abs(k_sorted[j-1] - nums[i]) <= valueDiff or j < len(k_sorted) and abs(k_sorted[j] - nums[i]) <= valueDiff:\\n return True\\n k_sorted.insert(j, nums[i])\\n if i >= indexDiff:\\n del k_sorted[bisect_left(k_sorted, nums[i-indexDiff])]\\n return False\\n\\n\\n \\\"\\\"\\\"\\n [1, 12, 5, 9, 3, 8], indexDiff = 2, valueDiff = 3\\n\\n [1,2,2,3,4,5], indexDiff=3, valueDiff=0\\n k_sorted:\\n \\\"\\\"\\\"\",\n \"memory\": \"30750\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n n = len(nums)\\n window = SortedList(nums[:indexDiff+1])\\n if any(abs(a-b) <= valueDiff for a,b in pairwise(window)): return True\\n for i in range(indexDiff+1, n):\\n x = nums[i]\\n window.remove(nums[i-indexDiff-1])\\n window.add(x)\\n j = window.index(x)\\n if (j > 0 and abs(window[j-1]-x) <= valueDiff) or (j < len(window)-1 and abs(window[j+1]-x) <= valueDiff):\\n return True\\n return False\\n\",\n \"memory\": \"30954\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n sl= SortedList(nums[1 : 1 + indexDiff])\\n for j in range(len(nums) - 1):\\n i = sl.bisect_right(nums[j])\\n if i == len(sl) and nums[j] - sl[-1] <= valueDiff:\\n return True\\n if i==0 and sl[0] - nums[j]<= valueDiff:\\n return True\\n if 0 < i <len(sl) and (nums[j] - sl[i-1] <= valueDiff or sl[i] - nums[j] <=valueDiff):\\n return True\\n sl.remove(nums[j+1])\\n if j + 1 + indexDiff<len(nums):\\n sl.add(nums[j+1+indexDiff])\\n\\n return False\",\n \"memory\": \"31158\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if valueDiff != 0:\\n buckets = {} # [0, valueDiff - 1], [valueDiff, 2 * valueDiff - 1], ...\\n\\n for i, num in enumerate(nums):\\n bucket = num // valueDiff\\n\\n if (\\n bucket in buckets or\\n bucket - 1 in buckets and num - buckets[bucket - 1] <= valueDiff or\\n bucket + 1 in buckets and buckets[bucket + 1] - num <= valueDiff\\n ):\\n return True\\n\\n buckets[bucket] = num\\n\\n if i >= indexDiff:\\n del buckets[nums[i - indexDiff] // valueDiff]\\n\\n return False\\n else:\\n window = set() # prev indexDiff elements\\n\\n for i, num in enumerate(nums):\\n if num in window:\\n return True\\n\\n window.add(num)\\n\\n if i >= indexDiff:\\n window.remove(nums[i - indexDiff])\\n\\n return False\",\n \"memory\": \"31158\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n curr_nums = SortedList(nums[1:indexDiff+1])\\n # curr_nums = [7]\\n for i in range(len(nums)):\\n idx = curr_nums.bisect_left(nums[i])\\n # idx = 1\\n if idx - 1 >= 0 and idx-1 < len(curr_nums) and abs(curr_nums[idx-1] - nums[i]) <= valueDiff:\\n print(curr_nums)\\n print(nums[i])\\n return True\\n elif idx < len(curr_nums) and abs(curr_nums[idx] - nums[i]) <= valueDiff:\\n print(curr_nums)\\n print(nums[i])\\n return True\\n if (i + indexDiff + 1) < len(nums):\\n curr_nums.add(nums[i + indexDiff + 1])\\n if i + 1 < len(nums):\\n curr_nums.remove(nums[i+1])\\n\\n return False\\n\",\n \"memory\": \"31361\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # sl = SortedList(nums[:indexDiff + 1])\\n sl = SortedList()\\n for val in nums[:indexDiff + 1]:\\n if val in sl:\\n return True\\n sl.add(val)\\n # if len(sl) < indexDiff + 1:\\n # return True\\n for i in range(len(sl) - 1):\\n if i:\\n if abs(sl[i - 1] - sl[i]) <= valueDiff:\\n return True\\n if i + 1 < len(sl):\\n if abs(sl[i + 1] - sl[i]) <= valueDiff:\\n return True\\n \\n for i in range(indexDiff + 1, len(nums)):\\n ind = sl.bisect_left(nums[i - (indexDiff + 1)])\\n sl.pop(ind)\\n if nums[i] in sl:\\n return True\\n sl.add(nums[i])\\n ind = sl.bisect_left(nums[i])\\n if ind:\\n if abs(sl[ind - 1] - sl[ind]) <= valueDiff:\\n return True\\n if ind + 1 < len(sl):\\n if abs(sl[ind + 1] - sl[ind]) <= valueDiff:\\n return True\\n \\n return False\\n \\n\",\n \"memory\": \"31565\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n\\n window = SortedSet()\\n l = 0\\n for r in range(len(nums)):\\n\\n left_boundary_index = window.bisect_left(nums[r] - valueDiff)\\n if left_boundary_index < len(window) and window[left_boundary_index] <= nums[r] + valueDiff:\\n return True\\n window.add(nums[r])\\n if len(window) >= indexDiff + 1:\\n window.remove(nums[l])\\n l += 1\\n return False\\n\\n\",\n \"memory\": \"31769\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n from sortedcontainers import SortedSet\\n import bisect\\n st = SortedSet()\\n left, right = 0, 0\\n res = 0\\n while right < len(nums):\\n if right - left > indexDiff:\\n st.remove(nums[left])\\n left += 1\\n index = bisect.bisect_left(st, nums[right] - valueDiff)\\n if st and index >= 0 and index < len(st) and abs(st[index] - nums[right]) <= valueDiff:\\n return True\\n st.add(nums[right])\\n right += 1\\n return False\",\n \"memory\": \"31973\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n from sortedcontainers import SortedSet\\n import bisect\\n st = SortedSet()\\n left, right = 0, 0\\n while right < len(nums):\\n if right - left > indexDiff:\\n st.remove(nums[left])\\n left += 1\\n index = bisect.bisect_left(st, nums[right] - valueDiff)\\n if st and index >= 0 and index < len(st) and st[index] - nums[right] <= valueDiff:\\n return True\\n st.add(nums[right])\\n right += 1\\n return False\",\n \"memory\": \"31973\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # maintain sliding window of elements\\n # from nums\\n s = SortedSet()\\n for i, v in enumerate(nums):\\n # find pos where v-valueDiff would be\\n # added to maintain order\\n j = s.bisect_left(v - valueDiff)\\n # j w/in bounds and w/in valueDiff\\n # units of v\\n if j < len(s) and s[j] <= v + valueDiff:\\n return True\\n # add curr element to s\\n s.add(v)\\n # maintain window size\\n if i >= indexDiff:\\n s.remove(nums[i - indexDiff])\\n return False\\n #O(nlog(min(n,k)))\\n #O(min(n,k))\\n \",\n \"memory\": \"32176\"\n },\n {\n \"code\": \"from typing import List\\n\\nfrom sortedcontainers import SortedDict\\n\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # Idea: Maintains min and max number in windows of size indexDiff to the left of current num\\n num_freq_dict = SortedDict()\\n for i in range(len(nums)):\\n if i >= indexDiff + 1:\\n num_to_remove = nums[i - indexDiff - 1]\\n num_freq_dict[num_to_remove] -= 1\\n if num_freq_dict[num_to_remove] == 0:\\n del (num_freq_dict[num_to_remove])\\n\\n curr_num = nums[i]\\n if num_freq_dict:\\n if self.findMinDiff(curr_num, num_freq_dict.keys()) <= valueDiff:\\n return True\\n\\n if curr_num in num_freq_dict:\\n num_freq_dict[curr_num] += 1\\n else:\\n num_freq_dict[curr_num] = 1\\n\\n return False\\n\\n def findMinDiff(self, num: int, sorted_nums) -> int:\\n \\\"\\\"\\\"\\n Binary search to find the min difference between num and any num in the list\\n \\\"\\\"\\\"\\n start = 0\\n end = len(sorted_nums) - 1\\n while end - start > 1:\\n mid = (start + end) // 2\\n if num == sorted_nums[mid]:\\n return 0\\n if num < sorted_nums[mid]:\\n end = mid\\n else:\\n start = mid\\n return min(abs(num - sorted_nums[start]), abs(sorted_nums[end] - num))\\n\",\n \"memory\": \"32380\"\n },\n {\n \"code\": \"from collections import deque \\n\\nclass Solution:\\n def __init__(self):\\n self.mydict = set()\\n\\n def containsNearbyAlmostDuplicate(self, nums: list[int], indexDiff: int, valueDiff: int) -> bool:\\n #intiial part of the code converts nums into segments that we care about in O(n) time. \\n k = indexDiff\\n segments = []\\n temp = []\\n for num in nums:\\n temp.append(num)\\n if len(temp) == k+1: \\n segments.append(temp)\\n temp = [] \\n if temp!= []:\\n segments.append(temp)\\n \\n #The next part will deal with the main part of the code \\n for i,seglist in enumerate(segments):\\n queue1 = deque([i for i in seglist])\\n if i < len(segments) - 1: \\n queue2 = deque([i for i in segments[i+1]])\\n else: \\n queue2 = deque([])\\n sortedlist = sorted(seglist)\\n\\n \\n for i in range(1,len(sortedlist)):\\n if abs(sortedlist[i] - sortedlist[i-1]) <= valueDiff:\\n return True \\n \\n while queue2:\\n self.mydict.add(queue1.popleft())\\n checkVal = queue2.popleft()\\n print(checkVal)\\n ind = self.binSearch(sortedlist, checkVal)\\n\\n if ind> -1:\\n if sortedlist[ind] not in self.mydict:\\n if abs(checkVal-sortedlist[ind]) <= valueDiff:\\n return True\\n \\n if ind<len(sortedlist) -1: \\n if sortedlist[ind+1] not in self.mydict:\\n if abs(checkVal-sortedlist[ind+1]) <= valueDiff:\\n return True \\n return False \\n\\n def binSearch(self, sortedlist: list[int], checkVal: int) -> int: #returns the value of the index after which checkVal should go\\n base = 0\\n ceiling = len(sortedlist) - 1 \\n\\n while True: \\n curr = base + ((ceiling - base)//2)\\n \\n if checkVal >= sortedlist[curr+1] and curr+1 == len(sortedlist) - 1:\\n return curr + 1 \\n \\n if checkVal <= sortedlist[curr] and curr == 0:\\n return curr - 1 \\n \\n if checkVal >= sortedlist[curr] and curr != len(sortedlist) - 1:\\n if checkVal <= sortedlist[curr+1]:\\n return curr \\n \\n if checkVal < sortedlist[curr]:\\n ceiling = curr \\n \\n if checkVal >= sortedlist[curr]: \\n base = curr \",\n \"memory\": \"32584\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n buckets = {}\\n for i, num in enumerate(nums):\\n bucket = num // max(1, valueDiff)\\n if bucket in buckets:\\n return True\\n if bucket-1 in buckets:\\n potentialDuplicate = buckets[bucket-1]\\n if abs(potentialDuplicate-num) <= valueDiff:\\n return True\\n if bucket+1 in buckets:\\n potentialDuplicate = buckets[bucket+1]\\n if abs(potentialDuplicate-num) <= valueDiff:\\n return True\\n if len(buckets) == indexDiff:\\n delBucket = nums[i-indexDiff] // max(1, valueDiff)\\n del buckets[delBucket]\\n buckets[bucket] = num\\n return False\",\n \"memory\": \"32788\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n buckets = {}\\n for i, v in enumerate(nums):\\n # t == 0 is a special case where we only have to check the bucket\\n # that v is in.\\n bucketNum, offset = (v // valueDiff, 1) if valueDiff else (v, 0)\\n for idx in range(bucketNum - offset, bucketNum + offset + 1):\\n if idx in buckets and abs(buckets[idx] - nums[i]) <= valueDiff:\\n return True\\n\\n buckets[bucketNum] = nums[i]\\n if len(buckets) > indexDiff:\\n # Remove the bucket which is too far away. Beware of zero t.\\n del buckets[nums[i - indexDiff] // valueDiff if valueDiff else nums[i - indexDiff]]\\n return False\",\n \"memory\": \"32991\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n \\n b = {}\\n \\n for i, n in enumerate(nums):\\n bid = n // valueDiff if valueDiff else n\\n \\n for j in [bid-1, bid, bid+1]:\\n if j in b and abs(b[j] - n) <= valueDiff:\\n return True\\n \\n b[bid] = n\\n \\n if len(b) > indexDiff:\\n out = nums[i-indexDiff] // valueDiff if valueDiff else nums[i-indexDiff]\\n b.pop(out)\\n \\n return False\",\n \"memory\": \"33195\"\n },\n {\n \"code\": \"def get_bucket_id(num, value_diff):\\n if value_diff == 0:\\n return num\\n return num//value_diff\\n\\ndef validate_diff(num1, num2, value_diff):\\n return abs(num1 - num2) <= value_diff\\n\\ndef duplicate_in_bucket_slot(buckets, id, num, value_diff):\\n first_check = id in buckets\\n if first_check:\\n return True\\n lower_neighbour_id = id - 1\\n lower_check = lower_neighbour_id in buckets\\n if lower_check:\\n lower_num = buckets[lower_neighbour_id]\\n found_duplicate = validate_diff(num1=num, num2=lower_num, value_diff=value_diff)\\n if found_duplicate:\\n return True\\n higher_neighbour_id = id + 1\\n higher_check = higher_neighbour_id in buckets\\n if higher_check:\\n higher_num = buckets[higher_neighbour_id]\\n found_duplicate = validate_diff(num1=num, num2=higher_num, value_diff=value_diff)\\n if found_duplicate:\\n return True\\n return False\\n\\ndef delete_bucket_item(num, buckets, value_diff):\\n id = get_bucket_id(num, value_diff)\\n del buckets[id]\\n \\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums, indexDiff: int, valueDiff: int) -> bool:\\n num_index = 0\\n buckets = {}\\n while num_index < len(nums):\\n current_num = nums[num_index]\\n bucket_id = get_bucket_id(current_num, valueDiff)\\n if duplicate_in_bucket_slot(\\n buckets=buckets,\\n id=bucket_id,\\n num=current_num,\\n value_diff=valueDiff\\n ):\\n return True\\n buckets[bucket_id] = current_num\\n is_at_start = num_index < indexDiff\\n if is_at_start:\\n pass\\n else:\\n index_to_remove = num_index - indexDiff\\n delete_bucket_item(\\n num=nums[index_to_remove],\\n buckets=buckets,\\n value_diff=valueDiff\\n )\\n num_index += 1\\n return False\",\n \"memory\": \"33399\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n buckets={}\\n\\n start=0\\n for end in range(len(nums)):\\n if end-start==indexDiff+1:\\n bucket_to_remove=nums[start]//max(valueDiff,1)\\n del buckets[bucket_to_remove]\\n start+=1\\n curr_bucket=nums[end]//max(valueDiff,1)\\n if curr_bucket in buckets:\\n return True\\n buckets[curr_bucket]=nums[end]\\n if curr_bucket-1 in buckets and nums[end]-buckets[curr_bucket-1]<=valueDiff:\\n return True\\n elif curr_bucket+1 in buckets and buckets[curr_bucket+1]-nums[end]<=valueDiff:\\n return True\\n return False\",\n \"memory\": \"33603\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\\n if valueDiff < 0:\\n return False\\n buckets = {}\\n width = valueDiff + 1\\n for i, num in enumerate(nums):\\n bucket = num // width\\n if bucket in buckets:\\n return True\\n buckets[bucket] = num\\n if (bucket - 1) in buckets and abs(num - buckets[bucket - 1]) <= valueDiff:\\n return True\\n if (bucket + 1) in buckets and abs(num - buckets[bucket + 1]) <= valueDiff:\\n return True\\n if i >= indexDiff:\\n del buckets[nums[i - indexDiff] // width]\\n return False\",\n \"memory\": \"33603\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n n = len(nums)\\n sorted_nums = sorted([(nums[i], i) for i in range(n) ])\\n # print(sorted_nums)\\n \\n start = 0\\n index = 1\\n while index <= n:\\n cur_diff = math.inf\\n if index < n:\\n cur_diff = sorted_nums[index][0] - sorted_nums[start][0]\\n if cur_diff <= valueDiff:\\n pass\\n else:\\n sorted_indices = sorted(sorted_nums[start:index], key=lambda x: x[1])\\n min_diff = math.inf\\n for i in range(1,len(sorted_indices)):\\n min_diff = min(min_diff, sorted_indices[i][1] - sorted_indices[i-1][1])\\n if min_diff <= indexDiff:\\n return True\\n\\n while index < n and sorted_nums[index][0] - sorted_nums[start][0] > valueDiff:\\n start += 1\\n\\n index += 1\\n \\n\\n return False\\n\\n# [(1, 0), (1, 3), (5, 1), (5, 4), (9, 2), (9, 5)]\\n#\\n# \",\n \"memory\": \"33806\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if valueDiff < 0:\\n return False\\n \\n buckets = {}\\n \\n w = valueDiff + 1 # Increment by 1 to handle the range correctly\\n \\n for i in range(len(nums)):\\n bucket = self.getID(nums[i], w)\\n \\n # Check if current bucket is empty, each bucket may contain at most one element\\n if bucket in buckets:\\n return True\\n \\n # Check the neighbor buckets for almost duplicates\\n if bucket - 1 in buckets and abs(nums[i] - buckets[bucket - 1]) < w:\\n return True\\n \\n if bucket + 1 in buckets and abs(nums[i] - buckets[bucket + 1]) < w:\\n return True\\n \\n # Now bucket is empty and no almost duplicates in neighbor buckets\\n buckets[bucket] = nums[i]\\n \\n if i >= indexDiff:\\n del buckets[self.getID(nums[i - indexDiff], w)]\\n \\n return False\\n \\n # Get the ID of the bucket from element value x and bucket width w\\n # Division '/' in Python with '//' performs floor division, which is necessary for correct bucketing.\\n # Floor division to handle both positive and negative integers correctly\\n def getID(self, x, w):\\n return x // w \",\n \"memory\": \"33806\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\\n bucket = {}\\n for i, n in enumerate(nums):\\n bucket_i = n // (t + 1)\\n if bucket_i in bucket and abs(n - bucket[bucket_i]) <= t:\\n return True\\n if bucket_i + 1 in bucket and abs(n - bucket[bucket_i + 1]) <= t:\\n return True\\n if bucket_i - 1 in bucket and abs(n - bucket[bucket_i - 1]) <= t:\\n return True\\n bucket[bucket_i] = n\\n if i >= k:\\n del bucket[nums[i-k] // (t + 1)]\\n return False\",\n \"memory\": \"34010\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n bucket = {}\\n for i, n in enumerate(nums):\\n bucket_i = n // (valueDiff + 1)\\n if bucket_i in bucket and abs(n - bucket[bucket_i]) <= valueDiff:\\n return True\\n if bucket_i + 1 in bucket and abs(n - bucket[bucket_i + 1]) <= valueDiff:\\n return True\\n if bucket_i - 1 in bucket and abs(n - bucket[bucket_i - 1]) <= valueDiff:\\n return True\\n bucket[bucket_i] = n\\n if i >= indexDiff:\\n del bucket[nums[i-indexDiff] // (valueDiff + 1)]\\n return False\",\n \"memory\": \"34010\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n size = len(nums)\\n buckets = {}\\n bucket_size = valueDiff + 1\\n\\n for i in range(size):\\n num = nums[i]\\n bucket_id = num // bucket_size\\n\\n if bucket_id in buckets:\\n return True\\n \\n if bucket_id - 1 in buckets and num - buckets[bucket_id - 1] <= valueDiff:\\n return True\\n\\n if bucket_id + 1 in buckets and buckets[bucket_id + 1] - num <= valueDiff:\\n return True\\n \\n buckets[bucket_id] = num\\n\\n if i >= indexDiff:\\n del buckets[nums[i - indexDiff] // bucket_size]\\n \\n return False\",\n \"memory\": \"34214\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # set_ = SortedList()\\n # for i in range(len(nums)):\\n # if i > indexDiff:\\n # set_.remove(nums[i - indexDiff - 1])\\n\\n # pos = set_.bisect_left(nums[i] - valueDiff)\\n\\n # if pos < len(set_) and abs(set_[pos] - nums[i]) <= valueDiff:\\n # return True\\n\\n # set_.add(nums[i])\\n # return False\\n\\n buckets = {}\\n\\n w = valueDiff + 1\\n\\n for i in range(len(nums)):\\n bucket = nums[i] // w\\n if bucket in buckets:\\n return True\\n\\n if bucket - 1 in buckets and abs(buckets[bucket - 1] - nums[i]) < w:\\n return True\\n\\n if bucket + 1 in buckets and abs(buckets[bucket + 1] - nums[i]) < w:\\n return True\\n\\n buckets[bucket] = nums[i]\\n\\n if i >= indexDiff:\\n del buckets[nums[i - indexDiff] // w]\\n \\n return False\\n\\n\\n\\n\\n\\n\\n \\n\\n \\n \",\n \"memory\": \"34214\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if nums:\\n buckets = {}\\n for i in range(len(nums)):\\n label = nums[i] // (valueDiff +1)\\n if buckets.get(label) != None:\\n return True\\n if buckets.get(label+1) and abs(buckets.get(label+1) - nums[i]) <= valueDiff:\\n return True\\n if buckets.get(label-1) and abs(buckets.get(label-1) - nums[i]) <= valueDiff:\\n return True\\n\\n buckets[label] = nums[i]\\n if i >= indexDiff:\\n del buckets[nums[i-indexDiff]//(valueDiff+1)]\\n return False\\n\\n\\n\\n\\n\\n\\n\\n # sl = SortedList()\\n # for i in range(len(nums)):\\n # j = sl.bisect_left(nums[i])\\n # print(len(sl), j)\\n # if j < len(sl) and sl[j] <= valueDiff + nums[i]:\\n # return True\\n # if j > 0 and nums[i] <= valueDiff + sl[j-1]:\\n # return True\\n # sl.add(nums[i])\\n # if len(sl) > indexDiff:\\n # sl.remove(nums[i-indexDiff])\\n # return False\\n\\n\",\n \"memory\": \"34418\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if nums:\\n buckets = {}\\n for i in range(len(nums)):\\n label = nums[i] // (valueDiff +1)\\n if buckets.get(label) != None:\\n return True\\n if buckets.get(label+1) and abs(buckets.get(label+1) - nums[i]) <= valueDiff:\\n return True\\n if buckets.get(label-1) and abs(buckets.get(label-1) - nums[i]) <= valueDiff:\\n return True\\n\\n buckets[label] = nums[i]\\n if i >= indexDiff:\\n del buckets[nums[i-indexDiff]//(valueDiff+1)]\\n return False\",\n \"memory\": \"34418\"\n },\n {\n \"code\": \"from sortedcontainers import SortedDict\\nfrom typing import List\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n d = SortedDict() # Use 'd' as a sorted dictionary to store indices\\n k = indexDiff\\n v = valueDiff\\n \\n for i in range(len(nums)):\\n # Find the range of potential candidates in the sorted dictionary\\n lower_bound = nums[i] - v\\n upper_bound = nums[i] + v\\n \\n # Check if there are any keys within this range\\n for key in d.irange(lower_bound, upper_bound):\\n if (i - d[key]) <= k:\\n return True\\n \\n # Update the dictionary with the current number and its index\\n d[nums[i]] = i\\n \\n # Remove elements that are out of the indexDiff range\\n if i >= k:\\n del d[nums[i - k]]\\n \\n return False\",\n \"memory\": \"34621\"\n },\n {\n \"code\": \"class Solution: # O(n) time and O(k) space\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n k = indexDiff # for legibility\\n d = valueDiff # for legibility\\n buckets = {}\\n queue = []\\n for i, n in enumerate(nums):\\n bkt = n // (d+1) # + 1 for d=0 case\\n if bkt in buckets: return True\\n if bkt-1 in buckets and abs(buckets[bkt-1]-n) <= d: return True\\n if bkt+1 in buckets and abs(buckets[bkt+1]-n) <= d: return True\\n if len(queue) == k: # maintain O(k) memory with O(1) operations per iteration\\n stale = queue.pop(0)\\n stale_bucket = stale // (d+1)\\n buckets.pop(stale_bucket, 'None')\\n buckets[bkt]=n # note: can only have 1 value in each bucket b/c otherwise would have returned True\\n queue.append(n)\\n return False\\n \",\n \"memory\": \"34621\"\n },\n {\n \"code\": \"class TreeNode:\\n def __init__(self, val: int) -> TreeNode:\\n self.parent = None\\n self.left_child = None\\n self.right_child = None\\n self.val = val\\n self.rank = 0\\n \\n def add_node(self, node: TreeNode) -> None:\\n self.rank += 1\\n if self.val < node.val:\\n if self.right_child is None:\\n self.right_child = node\\n node.parent = self\\n else:\\n self.right_child.add_node(node)\\n else:\\n if self.left_child is None:\\n self.left_child = node\\n node.parent = self\\n else:\\n self.left_child.add_node(node)\\n \\n def derank(self) -> None:\\n self.rank -= 1\\n if self.parent:\\n self.parent.derank()\\n\\n def remove_from_tree(self) -> None:\\n move_up = None\\n if self.left_child and self.right_child:\\n if self.left_child.rank > self.right_child.rank:\\n move_up = self.left_child\\n move_up.add_node(self.right_child)\\n else:\\n move_up = self.right_child\\n move_up.add_node(self.left_child)\\n elif self.left_child:\\n move_up = self.left_child\\n elif self.right_child:\\n move_up = self.right_child\\n\\n if self.parent.left_child == self:\\n self.parent.left_child = move_up\\n else:\\n self.parent.right_child = move_up\\n if move_up:\\n move_up.parent = self.parent\\n self.derank()\\n\\n def get_in_range(self, val: int, v_diff: int) -> bool:\\n if abs(val - self.val) <= v_diff:\\n return True\\n if self.right_child and (not self.left_child or self.left_child.val < val):\\n if self.right_child.get_in_range(val, v_diff):\\n return True\\n if self.left_child and (not self.right_child or val < self.right_child.val):\\n if self.left_child.get_in_range(val, v_diff):\\n return True\\n return False\\n\\n def print_tree(self, res: List[int]) -> None:\\n if self.left_child:\\n self.left_child.print_tree(res)\\n res.append(self.val)\\n if self.right_child:\\n self.right_child.print_tree(res)\\n\\nimport sortedcontainers\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], i_diff: int, v_diff: int) -> bool:\\n return self._sol2(nums, i_diff, v_diff)\\n\\n def _sol2(self, nums: List[int], i_diff: int, v_diff: int) -> bool:\\n window = sortedcontainers.SortedDict({nums[0] : 0})\\n for i in range(1, len(nums)):\\n val = nums[i]\\n if i > i_diff:\\n del window[nums[i - i_diff - 1]]\\n # Binary search through the keys\\n key_view = window.keys()\\n low = 0\\n high = len(key_view) - 1\\n while True:\\n j = (low + high) // 2\\n if abs(val - key_view[j]) <= v_diff:\\n return True\\n if val < key_view[j]:\\n if j == low:\\n break\\n high = j - 1\\n else:\\n if j == high:\\n break\\n low = j + 1\\n window[val] = i\\n return False\\n\\n # Perf: time limit exceeded on 48 / 52. Interesting project though.\\n def _bst(self, nums: List[int], i_diff: int, v_diff: int) -> bool:\\n root = TreeNode(math.inf)\\n nodes_by_index = []\\n for i, val in enumerate(nums):\\n if i > i_diff:\\n nodes_by_index[i - i_diff - 1].remove_from_tree()\\n if root.get_in_range(val, v_diff):\\n return True\\n i_node = TreeNode(val)\\n nodes_by_index.append(i_node)\\n root.add_node(i_node)\\n return False\\n \\n \",\n \"memory\": \"34825\"\n },\n {\n \"code\": \"from typing import List\\nfrom collections import deque\\nfrom sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(\\n self, nums: List[int], indexDiff: int, valueDiff: int\\n ) -> bool:\\n \\n q = deque()\\n s = SortedList()\\n \\n for i, n in enumerate(nums):\\n if len(q) > indexDiff:\\n _, x = q.popleft()\\n s.remove(x)\\n #print(s)\\n # lip = s.bisect_left(n)\\n # if lip > 0 and n - s[lip - 1] <= valueDiff:\\n # print(\\\"m left\\\", n, s[lip - 1])\\n # return True\\n # if lip < len(s) and s[lip] - n <= valueDiff:\\n # print(\\\"m right\\\", n, s[lip])\\n # return True\\n rip = s.bisect_right(n)\\n if rip > 0 and n - s[rip - 1] <= valueDiff:\\n return True\\n if rip < len(s) and s[rip] - n <= valueDiff:\\n return True\\n\\n q.append((i, n))\\n s.add(n)\\n\\n return False\\n\",\n \"memory\": \"35029\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n assert valueDiff >= 0\\n buckets = {}\\n for i, n in enumerate(nums):\\n bidx = n // (valueDiff + 1)\\n if bidx in buckets:\\n return True\\n if bidx - 1 in buckets and abs(nums[i] - buckets[bidx - 1]) <= valueDiff:\\n return True\\n if bidx + 1 in buckets and abs(nums[i] - buckets[bidx + 1]) <= valueDiff:\\n return True\\n buckets[bidx] = n\\n if i >= indexDiff:\\n del buckets[nums[i - indexDiff] // (valueDiff + 1)]\\n return False\\n\",\n \"memory\": \"35233\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\\n if t < 0 or not nums or k <= 0:\\n return False\\n buckets = {}\\n width = t + 1\\n\\n for n, i in enumerate(nums):\\n buck = i // width\\n # if in same bucket, for sure in range\\n if buck in buckets:\\n return True\\n else:\\n buckets[buck] = i\\n # otherwise we check the number in neighbour bucket\\n # has there been another number in that neighbour bucket within range previously\\n # then previously should already return True\\n if buck - 1 in buckets and i - buckets[buck-1] <= t:\\n return True\\n if buck + 1 in buckets and buckets[buck+1] - i <= t:\\n return True\\n if n >= k:\\n del buckets[nums[n-k] // width]\\n return False\\n \\n def containsNearbyAlmostDuplicateBst(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n bst = SortedList()\\n for i, num in enumerate(nums):\\n if i > 0:\\n # find closest of num, if the closest <= valueDiff, return True\\n ge = bst.bisect_right(num)\\n if ge < len(bst) and abs(bst[ge] - num) <= valueDiff:\\n return True\\n le = bst.bisect_right(num) - 1\\n if le >= 0 and abs(bst[le] - num) <= valueDiff:\\n return True\\n \\n bst.add(num)\\n if i >= indexDiff:\\n bst.remove(nums[i-indexDiff])\\n return False\\n \",\n \"memory\": \"35233\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution(object):\\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\\n \\\"\\\"\\\"\\n :type nums: List[int]\\n :type indexDiff: int\\n :type valueDiff: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if valueDiff < 0:\\n return False\\n split = valueDiff + 1\\n n = len(nums)\\n hashmap = {}\\n for i in range(n):\\n num = nums[i] // split \\n print(nums[i], split, num)\\n if num in hashmap:\\n return True\\n if num - 1 in hashmap and abs(nums[i] - hashmap[num - 1]) < split:\\n return True\\n if num + 1 in hashmap and abs(nums[i] - hashmap[num + 1]) < split:\\n return True\\n hashmap[num] = nums[i]\\n if i >= indexDiff:\\n del hashmap[nums[i - indexDiff] // split] \\n return False\\n\",\n \"memory\": \"35436\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n \\n index_width = indexDiff + 1\\n value_width = valueDiff + 1\\n\\n buckets = {}\\n\\n def get_bucket(num):\\n return num // value_width\\n\\n def has_dupe(num, bucket):\\n if bucket in buckets:\\n # Has dupe bucket\\n return True\\n\\n for next_bucket in (bucket - 1, bucket + 1):\\n if next_bucket in buckets:\\n next_num = buckets[next_bucket]\\n if abs(next_num - num) <= valueDiff:\\n return True\\n\\n return False\\n\\n # Build the initial window\\n for num in nums[:index_width]:\\n bucket = get_bucket(num)\\n if has_dupe(num, bucket):\\n # Found dupe in initial window\\n return True\\n buckets[bucket] = num\\n\\n for i in range(len(nums) - index_width):\\n remnum = nums[i]\\n addnum = nums[i + index_width]\\n\\n rembucket = get_bucket(remnum)\\n del buckets[rembucket]\\n\\n addbucket = get_bucket(addnum)\\n if has_dupe(addnum, addbucket):\\n return True\\n\\n buckets[addbucket] = addnum\\n\\n return False\\n\",\n \"memory\": \"35436\"\n },\n {\n \"code\": \"class TreeNode:\\n def __init__(self, val: int) -> None:\\n self.val = val\\n self.left = None\\n self.right = None\\n \\n\\ndef remove_node(node: TreeNode) -> Optional[TreeNode]:\\n if not node:\\n return\\n\\n if not node.left and not node.right:\\n return\\n\\n if node.left and not node.right:\\n return node.left\\n\\n if not node.left and node.right:\\n return node.right\\n \\n # both nodes\\n next_node = node.right\\n prev_node = None\\n while True:\\n if next_node.left:\\n prev_node = next_node\\n next_node = next_node.left\\n else:\\n break\\n \\n node.val = next_node.val\\n if not prev_node:\\n node.right = next_node.right\\n else:\\n prev_node.left = next_node.right\\n \\n return node\\n \\n\\nclass BST:\\n # Надо искать сразу diff в дереве\\n def __init__(self):\\n self.root = None\\n \\n def insert(self, val: int) -> None:\\n if not self.root:\\n self.root = TreeNode(val)\\n return\\n \\n node = self.root\\n while node:\\n if val < node.val:\\n if node.left:\\n node = node.left\\n else:\\n node.left = TreeNode(val)\\n return\\n else:\\n if node.right:\\n node = node.right\\n else:\\n node.right = TreeNode(val)\\n return\\n \\n def create_from_sorted(self, arr: list) -> None:\\n self.root = TreeNode(arr[0])\\n node = self.root\\n \\n arr = arr[1:]\\n for n in arr:\\n node.right = TreeNode(n)\\n node = node.right\\n \\n def remove(self, val: int) -> None: \\n if self.root.val == val:\\n self.root = remove_node(self.root)\\n return\\n \\n node = self.root\\n while node:\\n if node.left and val < node.val:\\n if node.left.val == val:\\n node.left = remove_node(node.left)\\n return\\n else:\\n node = node.left\\n \\n elif node.right and val > node.val:\\n if node.right.val == val:\\n node.right = remove_node(node.right)\\n return\\n else:\\n node = node.right\\n \\n else:\\n print(f\\\"DELETE ERROR {val = } {node.val = }\\\")\\n return\\n \\n def has_diff(self, val: int, diff: int) -> bool:\\n node = self.root\\n while node:\\n d = node.val - val\\n if abs(d) <= diff:\\n return True\\n \\n if d < 0:\\n node = node.right\\n else:\\n node = node.left\\n \\n return False\\n \\n def find(self, val: int) -> bool:\\n node = self.root\\n \\n while node:\\n if node.val == val:\\n return True\\n \\n if val < node.val:\\n node = node.left\\n else:\\n node = node.right\\n \\n return False\\n \\n \\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n iters = len(nums) - indexDiff\\n bst = BST()\\n \\n to_insert = nums[1:indexDiff + 1][:]\\n random.shuffle(to_insert)\\n \\n # bst.create_from_sorted(sorted())\\n for n in to_insert:\\n bst.insert(n)\\n \\n if bst.has_diff(nums[0], valueDiff):\\n return True\\n \\n iters = len(nums) - 1\\n for i in range(1, iters):\\n bst.remove(nums[i])\\n \\n if i + indexDiff < len(nums):\\n bst.insert(nums[i + indexDiff])\\n \\n if bst.has_diff(nums[i], valueDiff):\\n return True\\n\\n return False\\n \",\n \"memory\": \"35640\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if indexDiff > len(nums) ** 0.5:\\n new_nums = sorted([(nums[index], index) for index in range(len(nums))])\\n for i in range(1, len(nums)):\\n low_val = float(\\\"inf\\\")\\n for j in range(len(nums)-i):\\n if abs(new_nums[j][0]-new_nums[i+j][0]) <= valueDiff and abs(new_nums[j][1]-new_nums[i+j][1]) <= indexDiff:\\n return True\\n low_val = min(low_val, abs(new_nums[j][0]-new_nums[i+j][0]))\\n if low_val > valueDiff:\\n return False\\n return False\\n\\n else:\\n for i in range(len(nums)):\\n for j in range(i+1, min(len(nums), i+indexDiff+1)):\\n if abs(nums[i]-nums[j]) <= valueDiff:\\n return True\\n return False\\n \",\n \"memory\": \"35640\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\\n if t == 0 and len(set(nums)) == len(nums): return False\\n \\n bucket = {}\\n width = t + 1\\n \\n for i, n in enumerate(nums):\\n bucket_i = n // width\\n \\n if bucket_i in bucket: return True\\n elif bucket_i + 1 in bucket and abs(n - bucket[bucket_i + 1]) < width: return True\\n elif bucket_i - 1 in bucket and abs(n - bucket[bucket_i - 1]) < width: return True\\n \\n bucket[bucket_i] = n\\n if i >= k: del bucket[ nums[i-k] //width ]\\n \\n return False\",\n \"memory\": \"35844\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\\n \\n if t == 0 and len(set(nums)) == len(nums):\\n \\n return False\\n \\n \\n size = len(nums)\\n \\n bucket = {}\\n \\n width = t + 1\\n \\n for idx, number in enumerate(nums):\\n \\n bucket_idx = number // width\\n \\n if bucket_idx in bucket:\\n \\n return True\\n \\n elif bucket_idx + 1 in bucket and abs(number - bucket[bucket_idx + 1]) < width:\\n \\n return True\\n \\n elif bucket_idx - 1 in bucket and abs(number - bucket[bucket_idx - 1]) < width:\\n \\n return True\\n \\n bucket[bucket_idx] = number\\n \\n \\n if idx >= k:\\n \\n del bucket[ nums[idx-k] //width ]\\n \\n return False\",\n \"memory\": \"35844\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n bst = None\\n for i in range(len(nums)):\\n if bst is None:\\n bst = AVLTreeNode(nums[i])\\n else:\\n if abs(nums[i] - bst.findClosest(nums[i])) <= valueDiff:\\n return True\\n bst = bst.insert(nums[i])\\n if i - indexDiff >= 0:\\n bst = bst.remove(nums[i - indexDiff])\\n return False\\n\\nclass AVLTreeNode:\\n def __init__(self, value):\\n self.value = value\\n self.balance = 0 # defined as self.left.height - self.right.height\\n self.height = 1\\n self.left = None # smaller than or equal to\\n self.right = None\\n\\n def insert(self, k):\\n if k <= self.value:\\n if not self.left:\\n self.left = AVLTreeNode(k)\\n else:\\n self.left = self.left.insert(k)\\n else:\\n if not self.right:\\n self.right = AVLTreeNode(k)\\n else:\\n self.right = self.right.insert(k)\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\\n\\n # balance self\\n if self.balance > 1:\\n if self.left.balance >= 0:\\n return self.right_rotate()\\n else:\\n self.left = self.left.left_rotate()\\n return self.right_rotate()\\n elif self.balance < -1:\\n if self.right.balance <= 0:\\n return self.left_rotate()\\n else:\\n self.right = self.right.right_rotate()\\n return self.left_rotate()\\n return self\\n\\n def remove(self, k):\\n if k < self.value:\\n if self.left:\\n self.left = self.left.remove(k)\\n elif k > self.value:\\n if self.right:\\n self.right = self.right.remove(k)\\n else:\\n if not self.left:\\n return self.right\\n elif not self.right:\\n return self.left\\n temp = self.right.find_min()\\n self.value = temp.value\\n self.right = self.right.remove(temp.value)\\n\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\\n\\n if self.balance > 1:\\n if self.left.balance >= 0:\\n return self.right_rotate()\\n else:\\n self.left = self.left.left_rotate()\\n return self.right_rotate()\\n elif self.balance < -1:\\n if self.right.balance <= 0:\\n return self.left_rotate()\\n else:\\n print(self.right)\\n self.right = self.right.right_rotate()\\n return self.left_rotate()\\n return self\\n\\n def find_min(self):\\n if self.left is None:\\n return self\\n else:\\n return self.left.find_min()\\n\\n def findClosest(self, k):\\n closest = self.value\\n if k < self.value:\\n if self.left:\\n left_closest = self.left.findClosest(k)\\n if abs(k - left_closest) < abs(k - closest):\\n closest = left_closest\\n elif k > self.value:\\n if self.right:\\n right_closest = self.right.findClosest(k)\\n if abs(k - right_closest) < abs(k - closest):\\n closest = right_closest\\n return closest\\n\\n def left_rotate(self):\\n new_root = self.right\\n if new_root is None: # Ensure the new root exists\\n return self\\n self.right = new_root.left\\n new_root.left = self\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\\n return new_root\\n\\n def right_rotate(self):\\n new_root = self.left\\n if new_root is None:\\n return self # Safety check, should not happen if the tree is correctly balanced\\n self.left = new_root.right\\n new_root.right = self\\n # Update heights\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\\n return new_root\\n\\n\",\n \"memory\": \"36251\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n bst = None\\n for i in range(len(nums)):\\n if bst is None:\\n bst = AVLTreeNode(nums[i])\\n else:\\n if abs(nums[i] - bst.findClosest(nums[i])) <= valueDiff:\\n return True\\n bst = bst.insert(nums[i])\\n if i - indexDiff >= 0:\\n bst = bst.remove(nums[i - indexDiff])\\n return False\\n\\nclass AVLTreeNode:\\n def __init__(self, value):\\n self.value = value\\n self.balance = 0 # defined as self.left.height - self.right.height\\n self.height = 1\\n self.left = None # smaller than or equal to\\n self.right = None\\n\\n def insert(self, k):\\n if k <= self.value:\\n if not self.left:\\n self.left = AVLTreeNode(k)\\n else:\\n self.left = self.left.insert(k)\\n else:\\n if not self.right:\\n self.right = AVLTreeNode(k)\\n else:\\n self.right = self.right.insert(k)\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\\n\\n # balance self\\n if self.balance > 1:\\n if self.left.balance >= 0:\\n return self.right_rotate()\\n else:\\n self.left = self.left.left_rotate()\\n return self.right_rotate()\\n elif self.balance < -1:\\n if self.right.balance <= 0:\\n return self.left_rotate()\\n else:\\n self.right = self.right.right_rotate()\\n return self.left_rotate()\\n return self\\n\\n def remove(self, k):\\n if k < self.value:\\n if self.left:\\n self.left = self.left.remove(k)\\n elif k > self.value:\\n if self.right:\\n self.right = self.right.remove(k)\\n else:\\n if not self.left:\\n return self.right\\n elif not self.right:\\n return self.left\\n temp = self.right.find_min()\\n self.value = temp.value\\n self.right = self.right.remove(temp.value)\\n\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n self.balance = (self.left.height if self.left else 0) - (self.right.height if self.right else 0)\\n\\n if self.balance > 1:\\n if self.left.balance >= 0:\\n return self.right_rotate()\\n else:\\n self.left = self.left.left_rotate()\\n return self.right_rotate()\\n elif self.balance < -1:\\n if self.right.balance <= 0:\\n return self.left_rotate()\\n else:\\n print(self.right)\\n self.right = self.right.right_rotate()\\n return self.left_rotate()\\n return self\\n\\n def find_min(self):\\n if self.left is None:\\n return self\\n else:\\n return self.left.find_min()\\n\\n def findClosest(self, k):\\n closest = self.value\\n if k < self.value:\\n if self.left:\\n left_closest = self.left.findClosest(k)\\n if abs(k - left_closest) < abs(k - closest):\\n closest = left_closest\\n elif k > self.value:\\n if self.right:\\n right_closest = self.right.findClosest(k)\\n if abs(k - right_closest) < abs(k - closest):\\n closest = right_closest\\n return closest\\n\\n def left_rotate(self):\\n new_root = self.right\\n if new_root is None: # Ensure the new root exists\\n return self\\n self.right = new_root.left\\n new_root.left = self\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\\n return new_root\\n\\n def right_rotate(self):\\n new_root = self.left\\n if new_root is None:\\n return self # Safety check, should not happen if the tree is correctly balanced\\n self.left = new_root.right\\n new_root.right = self\\n # Update heights\\n self.height = 1 + max(self.left.height if self.left else 0, self.right.height if self.right else 0)\\n new_root.height = 1 + max(new_root.left.height if new_root.left else 0, new_root.right.height if new_root.right else 0)\\n return new_root\\n\\n\",\n \"memory\": \"36455\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: list[int], index_diff: int, value_diff: int) -> bool:\\n indexes = SortedList([])\\n index_values = sorted(enumerate(nums), key=lambda num: num[1])\\n ptr = 0\\n for index, value in index_values:\\n while len(indexes) > 0 and value - index_values[ptr][1] > value_diff:\\n indexes.remove(index_values[ptr][0])\\n ptr += 1\\n closest_index = indexes.bisect_left(index)\\n for index_i in [closest_index, closest_index - 1]:\\n if 0 <= index_i < len(indexes) and abs(indexes[index_i] - index) <= index_diff:\\n return True\\n indexes.add(index)\\n return False\\n\\n \",\n \"memory\": \"36659\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: list[int], index_diff: int, value_diff: int) -> bool:\\n indexes = SortedList([])\\n index_values = sorted(enumerate(nums), key=lambda num: num[1])\\n ptr = 0\\n for index, value in index_values:\\n while len(indexes) > 0 and value - index_values[ptr][1] > value_diff:\\n indexes.remove(index_values[ptr][0])\\n ptr += 1\\n closest_larger = next(indexes.irange(minimum=index), None)\\n closest_smaller = next(indexes.irange(maximum=index, reverse=True), None)\\n for closest_index in [closest_larger, closest_smaller]:\\n if closest_index is not None and abs(closest_index - index) <= index_diff:\\n return True\\n indexes.add(index)\\n return False\\n\\n \",\n \"memory\": \"36659\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if len(nums)<2:\\n return False\\n if indexDiff == 0:\\n return False\\n hash_table = {}\\n\\n if valueDiff == 0:\\n for i in range(len(nums)):\\n if nums[i] in hash_table and i - hash_table[nums[i]] <= indexDiff:\\n return True\\n\\n hash_table[nums[i]] = i\\n \\n return False\\n\\n for i in range(len(nums)):\\n\\n if nums[i]//valueDiff in hash_table and i - hash_table[nums[i]//valueDiff][1] <= indexDiff:\\n return True\\n if nums[i]//valueDiff+1 in hash_table and i - hash_table[nums[i]//valueDiff+1][1] <= indexDiff and abs(hash_table[nums[i]//valueDiff+1][0]-nums[i]) <= valueDiff:\\n return True\\n if nums[i]//valueDiff-1 in hash_table and i - hash_table[nums[i]//valueDiff-1][1] <= indexDiff and abs(hash_table[nums[i]//valueDiff-1][0]-nums[i]) <= valueDiff:\\n return True\\n hash_table[nums[i]//valueDiff] = [nums[i], i]\\n\\n return False\\n \\n \\n \",\n \"memory\": \"36863\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff):\\n if indexDiff < 0 or valueDiff < 0:\\n return False\\n buckets = {}\\n bucket_size = valueDiff + 1 # Adding 1 to avoid division by zero\\n for i, num in enumerate(nums):\\n bucket_index = num // bucket_size\\n if bucket_index in buckets:\\n return True\\n buckets[bucket_index] = i\\n if (bucket_index - 1) in buckets and abs(nums[i] - nums[buckets[bucket_index - 1]]) <= valueDiff:\\n return True\\n if (bucket_index + 1) in buckets and abs(nums[i] - nums[buckets[bucket_index + 1]]) <= valueDiff:\\n return True\\n if i >= indexDiff:\\n del buckets[nums[i - indexDiff] // bucket_size]\\n return False\",\n \"memory\": \"36863\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if len(nums)<2:\\n return False\\n if indexDiff == 0:\\n return False\\n hash_table = {}\\n\\n if valueDiff == 0:\\n for i in range(len(nums)):\\n if nums[i] in hash_table and i - hash_table[nums[i]] <= indexDiff:\\n return True\\n\\n hash_table[nums[i]] = i\\n \\n return False\\n\\n for i in range(len(nums)):\\n\\n if nums[i]//valueDiff in hash_table and i - hash_table[nums[i]//valueDiff][1] <= indexDiff:\\n return True\\n if nums[i]//valueDiff+1 in hash_table and i - hash_table[nums[i]//valueDiff+1][1] <= indexDiff and abs(hash_table[nums[i]//valueDiff+1][0]-nums[i]) <= valueDiff:\\n return True\\n if nums[i]//valueDiff-1 in hash_table and i - hash_table[nums[i]//valueDiff-1][1] <= indexDiff and abs(hash_table[nums[i]//valueDiff-1][0]-nums[i]) <= valueDiff:\\n return True\\n hash_table[nums[i]//valueDiff] = [nums[i], i]\\n\\n return False\\n \\n \\n \",\n \"memory\": \"37066\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n\\n def getBucketId(num: int) -> int:\\n return num // (valueDiff + 1)\\n bucket = dict()\\n for idx, n in enumerate(nums):\\n if idx > indexDiff:\\n del bucket[getBucketId(nums[idx - indexDiff - 1])]\\n\\n bucketId = getBucketId(n)\\n if bucketId in bucket:\\n return True\\n if (bucketId - 1) in bucket:\\n bIdx = bucket[bucketId - 1]\\n if abs(bIdx - idx) <= indexDiff and abs(nums[bIdx] - n) <= valueDiff:\\n return True\\n if (bucketId + 1) in bucket:\\n bIdx = bucket[bucketId + 1]\\n if abs(bIdx - idx) <= indexDiff and abs(nums[bIdx] - n) <= valueDiff:\\n return True\\n bucket[bucketId] = idx\\n\\n return False\\n \",\n \"memory\": \"37270\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n \\n seen = {}\\n if valueDiff == 0:\\n for i, num in enumerate(nums):\\n if num in seen and i - seen[num] <= indexDiff:\\n return True\\n seen[num] = i\\n return False\\n\\n for i, num in enumerate(nums):\\n bucket = num // valueDiff\\n #print(num, valueDiff, bucket)\\n if bucket in seen and i - seen[bucket][0] <= indexDiff: \\n return True\\n if bucket - 1 in seen and i - seen[bucket-1][0] <= indexDiff and abs(num - seen[bucket-1][1]) <= valueDiff: \\n #print(2222)\\n return True\\n\\n if bucket + 1 in seen and i - seen[bucket+1][0] <= indexDiff and abs(num - seen[bucket+1][1]) <= valueDiff: \\n return True\\n \\n seen[bucket] = (i, num)\\n \\n return False\\n \",\n \"memory\": \"37474\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n subset = SortedSet()\\n for i, n in enumerate(nums):\\n subset.add((n, i))\\n pos = subset.bisect_left((n, i))\\n j = pos + 1\\n while j < len(subset):\\n nn, ii = subset[j]\\n if abs(ii - i) > indexDiff:\\n subset.pop(j)\\n else:\\n if abs(nn - n) <= valueDiff:\\n return True\\n break\\n j = pos - 1\\n while j >= 0:\\n nn, ii = subset[j]\\n if abs(ii - i) > indexDiff:\\n subset.pop(j)\\n j -= 1\\n else:\\n if abs(nn - n) <= valueDiff:\\n return True\\n break\\n return False\\n \\n \\n \\n \",\n \"memory\": \"37678\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, val: int) -> bool:\\n db = defaultdict(int)\\n uniqe_nums = sorted(list(set(nums)))\\n n = len(nums)\\n for i in range(min(n, k+1)):\\n db[nums[i]] += 1\\n\\n for i in range(n):\\n cur = 0\\n # print(db, nums)\\n lid = bisect_left(uniqe_nums, nums[i]-val)\\n # rid = bisect_left(uniqe_nums, nums[i]+val)\\n for j in range(lid, len(uniqe_nums)):\\n if uniqe_nums[j]>(val+nums[i]):\\n break\\n # print(uniqe_nums[j], nums[i])\\n cur += db[uniqe_nums[j]]\\n if cur>=2:\\n return True\\n if i-k>=0:\\n db[nums[i-k]] -= 1\\n if i+k+1<n:\\n db[nums[i+k+1]] += 1\\n\\n return False\\n \",\n \"memory\": \"37881\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n N, L, R = list(enumerate(nums)), 0, 1\\n N.sort(key=lambda x:(x[1],x[0])) \\n def check(L, R):\\n for l in range(L, R):\\n for r in range(l+1, R+1):\\n if N[r][1]-N[l][1]<=valueDiff and abs(N[r][0]-N[l][0])<=indexDiff:\\n return True \\n return False \\n while L<R and R<len(N):\\n if check(L, R): return True\\n if N[R][1]-N[L][1]<valueDiff: R+=1\\n else: L += 1\\n if R<=L: R = L+1\\n return False \",\n \"memory\": \"38085\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n N = list(enumerate(nums))\\n N.sort(key=lambda x:(x[1],x[0])) \\n def check(L, R):\\n for l in range(L, R):\\n for r in range(l+1, R+1):\\n if N[r][1]-N[l][1]<=valueDiff and abs(N[r][0]-N[l][0])<=indexDiff:\\n return True \\n return False\\n L, R = 0, 1\\n while L<R and R<len(N):\\n v1, v2 = N[L], N[R]\\n if check(L, R): return True\\n if v2[1]-v1[1]<valueDiff: R+=1\\n else: L += 1\\n if R<=L: R = L+1\\n return False \",\n \"memory\": \"38289\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if len(nums) <= 1:\\n return False\\n \\n arr = [(val, i) for i, val in enumerate(nums)]\\n arr.sort(key=lambda x: (x[0], x[1]))\\n l, r = 0, 1 # r is EXCLUSIVE.\\n\\n while r < len(arr):\\n # Ensures we're within correct value diff\\n if arr[r][0] - arr[l][0] <= valueDiff:\\n r += 1\\n continue\\n \\n # We've reached an r value that is exclusive.\\n while l < r - 1:\\n front = arr[l + 1][1]\\n back = arr[l][1]\\n if front - back <= indexDiff:\\n return True\\n l += 1\\n \\n if arr[r][0] - arr[l][0] <= valueDiff and abs(arr[r][1] - arr[l][1]) <= indexDiff:\\n return True\\n\\n l += 1\\n \\n # We've reached an r value that is exclusive.\\n while l < r - 1:\\n front = arr[l + 1][1]\\n back = arr[l][1]\\n if front - back <= indexDiff:\\n return True\\n l += 1\\n \\n return False\\n\\n\\n'''\\nindexDiff = 2\\nvalueDiff = 2\\n[(0, 2), (3, 0), (4, 3), (6, 1)]\\n ^\\n ^\\n\\nindexDiff = 3\\nvalueDiff = 0\\n[(1, 0), (1, 3), (2, 1), (3, 2) ]\\n ^ ^\\n\\nindexDiff = 2\\nvalueDiff = 3\\n[(1, 0), (1, 3), (5, 1), (5, 4), (6, 9), (9, 2)]\\n ^ ^\\n\\nindexDiff = 1\\nvalueDiff = 2\\n[(0, 1), (1, 0), (1, 2), (1, 3)]\\n ^ ^\\n\\n\\n\\n\\nApproach 2\\nMake every value a tuple that correlates to its index-- (value, index)\\nSort this array by value.\\n\\nDo two pointers-- iterate up to the edge of the valueDiff, then move the left pointer to catch up and see if any satisfy the indexDiff.\\nWhen the left pointer reaches the first entry that has the same value, start moving the right pointer again.\\n\\n'''\",\n \"memory\": \"38493\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(\\n self, nums: List[int], indexDiff: int, valueDiff: int\\n ):\\n min_num = inf\\n max_num = -inf\\n\\n for num in nums:\\n min_num = min(min_num, num)\\n max_num = max(max_num, num)\\n\\n bucket_size = valueDiff + 1\\n num_buckets = (max_num - min_num) // bucket_size\\n num_buckets += 1\\n buckets: List[int] = [inf] * num_buckets\\n\\n for i, num in enumerate(nums):\\n in_bucket = (num - min_num) // bucket_size\\n\\n if buckets[in_bucket] != inf:\\n return True\\n\\n left_diff = abs(buckets[in_bucket - 1] - num) if in_bucket > 0 else inf\\n right_diff = (\\n abs(buckets[in_bucket + 1] - num)\\n if in_bucket < num_buckets - 1\\n else inf\\n )\\n\\n if min(left_diff, right_diff) <= valueDiff:\\n return True\\n\\n buckets[in_bucket] = num\\n\\n if 0 <= i - indexDiff:\\n out_bucket = (nums[i - indexDiff] - min_num) // bucket_size\\n buckets[out_bucket] = inf\\n\\n return False\\n\",\n \"memory\": \"38696\"\n },\n {\n \"code\": \"class Solution:\\n # Sliding window + Bucket\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if valueDiff < 0 or indexDiff < 1:\\n return False\\n \\n buckets = {}\\n # this helps numbers closer to each other can be mapped to the same bucket\\n bucket_size = valueDiff + 1 \\n BASE = -sys.maxsize - 1\\n # BASE = -2**31\\n for i in range(len(nums)):\\n # Use Python's minimum integer value to handle negative numbers\\n adjusted_num = nums[i] - BASE\\n bucket = adjusted_num // bucket_size\\n # print(nums[i], \\\" in bucket \\\", bucket)\\n if bucket in buckets:\\n return True\\n # Check adjacent buckets\\n if bucket - 1 in buckets and adjusted_num - buckets[bucket - 1] <= valueDiff:\\n return True\\n if bucket + 1 in buckets and buckets[bucket + 1] - adjusted_num <= valueDiff:\\n return True\\n # out of window\\n if i >= indexDiff:\\n leftmost_bucket = (nums[i - indexDiff] - BASE) // bucket_size\\n buckets.pop(leftmost_bucket, None)\\n buckets[bucket] = adjusted_num\\n \\n return False\",\n \"memory\": \"38900\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if valueDiff < 0:\\n return False\\n \\n buc = {}\\n \\n for i, val in enumerate(nums):\\n bid = val // (valueDiff + 1) if valueDiff > 0 else val\\n \\n # Check current bucket\\n if bid in buc and i - buc[bid][0] <= indexDiff:\\n return True\\n \\n # Check adjacent buckets\\n if (bid + 1 in buc and i - buc[bid + 1][0] <= indexDiff and \\n abs(val - buc[bid + 1][1]) <= valueDiff):\\n return True\\n \\n if (bid - 1 in buc and i - buc[bid - 1][0] <= indexDiff and \\n abs(val - buc[bid - 1][1]) <= valueDiff):\\n return True\\n \\n # Add current value to the bucket\\n buc[bid] = (i, val)\\n \\n return False\\n\",\n \"memory\": \"39104\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\\n if t < 0: return False # edge case \\n \\n seen = {}\\n for i, x in enumerate(nums): \\n bkt = x//(t+1)\\n if bkt in seen and i - seen[bkt][0] <= k: return True \\n if bkt-1 in seen and i - seen[bkt-1][0] <= k and abs(x - seen[bkt-1][1]) <= t: return True \\n if bkt+1 in seen and i - seen[bkt+1][0] <= k and abs(x - seen[bkt+1][1]) <= t: return True \\n seen[bkt] = (i, x) \\n return False \",\n \"memory\": \"39308\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if indexDiff <= 0 or valueDiff < 0:\\n return False\\n\\n from sortedcontainers import SortedList\\n\\n sorted_window = SortedList()\\n for i, num in enumerate(nums):\\n # Maintain the sliding window of size `indexDiff`\\n if i > indexDiff:\\n sorted_window.remove(nums[i - indexDiff - 1])\\n\\n # Find the position where the current number would fit in the sorted window\\n pos = SortedList.bisect_left(sorted_window, num - valueDiff)\\n\\n # Check if there is any number in the window within the required `valueDiff`\\n if pos < len(sorted_window) and abs(sorted_window[pos] - num) <= valueDiff:\\n return True\\n\\n # Insert the current number in the sorted window\\n sorted_window.add(num)\\n\\n return False\",\n \"memory\": \"39511\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.bit = [0 for i in range(100005)]\\n def update(self, index, val):\\n i = index\\n while i <= 100001:\\n self.bit[i] += val\\n i += i & -i\\n def query(self, index):\\n i = index\\n ans = 0\\n while i > 0:\\n ans += self.bit[i]\\n i -= i & -i\\n return ans\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n indexedArray = []\\n for (i, number) in enumerate(nums):\\n indexedArray.append([number, i+1])\\n indexedArray.sort(key = lambda x:(x[0], x[1]))\\n\\n bptr = -1\\n for i in range(len(indexedArray)):\\n while bptr+1 < len(indexedArray) and indexedArray[bptr+1][0]+valueDiff < indexedArray[i][0]:\\n self.update(indexedArray[bptr+1][1], -1)\\n bptr+=1\\n currIndex = indexedArray[i][1]\\n amt = self.query(min(currIndex+indexDiff, 100001)) - self.query(max(currIndex-indexDiff-1,0))\\n\\n self.update(currIndex, 1)\\n\\n if amt > 0:\\n return True\\n return False\\n \",\n \"memory\": \"39715\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n seen = {}\\n for i, num in enumerate(nums): \\n print(num, valueDiff, num//(valueDiff+1))\\n bkt = num//(valueDiff+1)\\n if bkt in seen and i - seen[bkt][0] <= indexDiff: return True \\n if bkt-1 in seen and i - seen[bkt-1][0] <= indexDiff and abs(num - seen[bkt-1][1]) <= valueDiff: return True \\n if bkt+1 in seen and i - seen[bkt+1][0] <= indexDiff and abs(num - seen[bkt+1][1]) <= valueDiff: return True \\n seen[bkt] = (i, num) \\n return False \",\n \"memory\": \"39919\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n \\\"\\\"\\\"\\n brute force : n * indexDiff\\n\\n balanced binary search tree : n * log (index diff)\\n\\n best solution:\\n buckets: n\\n \\n \\\"\\\"\\\"\\n\\n return bucket_search(nums, indexDiff, valueDiff)\\n\\n sorted_list = SortedList()\\n for i, num in enumerate(nums):\\n max_val = valueDiff + num\\n min_val = -valueDiff + num\\n # range from 0 to len() inclusive\\n idx1 = sorted_list.bisect_left(min_val)\\n if idx1 < len(sorted_list) and sorted_list[idx1] <= max_val:\\n return True\\n \\n if i >= indexDiff:\\n # remember remover\\n sorted_list.remove(nums[i - indexDiff])\\n \\n sorted_list.add(num)\\n \\n return False\\n\\n\\n\\n\\ndef bucket_search(nums, indexDiff, valueDiff):\\n min_val, max_val = min(nums), max(nums)\\n # case valueDiff 0\\n bucket_size = valueDiff + 1 # [0, size)\\n size = math.floor((max_val - min_val) // bucket_size) + 1\\n buckets = [-math.inf] * size\\n\\n # [-inf, 4]\\n for i, num in enumerate(nums):\\n idx = (num - min_val) // bucket_size\\n if buckets[idx] != -math.inf:\\n return True\\n prev, nex = idx - 1, idx + 1\\n\\n if prev >= 0 and buckets[prev] > -math.inf and num - buckets[prev] <= valueDiff or \\\\\\n nex < size and buckets[nex] > -math.inf and buckets[nex] - num <= valueDiff:\\n return True\\n \\n if i >= indexDiff:\\n removal = (nums[i - indexDiff] - min_val) // bucket_size\\n buckets[removal] = -math.inf\\n \\n buckets[idx] = num\\n \\n return False\\n\",\n \"memory\": \"40123\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n sl = SortedList()\\n sl_diff = SortedList()\\n n = len(nums)\\n MAXV = int(1e9)\\n nums = [v + MAXV for v in nums]\\n for i in range(n):\\n if (i - indexDiff > 0):\\n v = nums[i - indexDiff - 1]\\n index_sl = sl.bisect_left((v, i - indexDiff - 1))\\n if (index_sl > 0):\\n diff = v - sl[index_sl - 1][0]\\n sl_diff.remove((diff, i - indexDiff - 1))\\n if (index_sl <= indexDiff - 1):\\n diff = sl[index_sl + 1][0] - v\\n sl_diff.remove((diff, sl[index_sl + 1][1]))\\n\\n if (index_sl > 0 and index_sl <= indexDiff - 1):\\n new_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\\n sl_diff.add((new_diff, sl[index_sl + 1][1]))\\n sl.remove((v, i - indexDiff - 1))\\n\\n sl.add((nums[i], i))\\n if (i == 0):\\n continue\\n v = nums[i]\\n index_sl = sl.bisect_left((v, i))\\n if (index_sl > 0 and index_sl < len(sl) - 1):\\n back_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\\n sl_diff.remove((back_diff, sl[index_sl + 1][1]))\\n\\n if (index_sl > 0):\\n diff = v - sl[index_sl - 1][0]\\n sl_diff.add((diff, i))\\n if (index_sl < len(sl) - 1):\\n diff = sl[index_sl + 1][0] - v\\n sl_diff.add((diff, sl[index_sl + 1][1]))\\n\\n if (sl_diff[0][0] <= valueDiff):\\n return True\\n\\n return False\\n\\n \",\n \"memory\": \"40326\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n n = len(nums)\\n aa = [i // (valueDiff +1) for i in nums]\\n dic = {}\\n i = 0\\n for j in range(n):\\n b = aa[j]\\n\\n if b in dic and dic[b]:\\n return True\\n \\n if b-1 in dic:\\n possible = dic[b-1]\\n for k in possible:\\n if abs(nums[j] - k) <= valueDiff:\\n return True\\n \\n if b+1 in dic:\\n possible = dic[b+1]\\n for k in possible:\\n if abs(nums[j] - k) <= valueDiff:\\n return True\\n\\n if b in dic:\\n dic[b].append(nums[j])\\n else:\\n dic[b] = [nums[j]]\\n\\n if j - i == indexDiff:\\n dic[aa[i]].pop(0)\\n i += 1\\n return False\\n \\n\\n \\n\\n \",\n \"memory\": \"40530\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n\\n n = len(nums)\\n\\n nums_dict = {}\\n\\n nums_sorted = []\\n\\n for index in range(n):\\n\\n num = nums[index]\\n\\n if num not in nums_dict:\\n\\n nums_dict[num] = [index]\\n\\n else:\\n\\n i = 0\\n\\n j = len(nums_dict[num]) - 1\\n\\n while i < j:\\n\\n k = (i + j + 1) // 2\\n\\n if nums_dict[num][k] <= index:\\n\\n i = k\\n\\n else:\\n\\n j = k - 1\\n\\n if abs(nums_dict[num][i]-index) <= indexDiff:\\n\\n return True\\n\\n if nums_dict[num][i] > index:\\n\\n i = -1\\n\\n nums_dict[num].insert(i+1,index)\\n\\n if len(nums_sorted) == 0:\\n\\n nums_sorted.append(num)\\n\\n else:\\n\\n i = 0\\n\\n j = len(nums_sorted) - 1\\n\\n while i < j:\\n\\n k = (i + j + 1) // 2\\n\\n if nums_sorted[k] <= num:\\n\\n i = k\\n\\n else:\\n\\n j = k - 1\\n\\n if nums_sorted[i] > num:\\n\\n nums_sorted.insert(0,num)\\n\\n elif nums_sorted[i] < num:\\n\\n nums_sorted.insert(i+1,num)\\n\\n for index in range(len(nums_sorted)-1):\\n\\n num = nums_sorted[index]\\n\\n for step in range(index+1,len(nums_sorted)):\\n\\n if abs(num-nums_sorted[step]) > valueDiff:\\n\\n break\\n\\n targets = nums_dict[nums_sorted[step]]\\n\\n for target in nums_dict[num]:\\n\\n i = 0\\n\\n j = len(targets) - 1\\n\\n while i < j:\\n\\n k = (i + j + 1) // 2\\n\\n if targets[k] <= target:\\n\\n i = k\\n\\n else:\\n\\n j = k - 1\\n\\n if abs(targets[i] - target) <= indexDiff:\\n\\n return True\\n\\n if i != len(targets) - 1 and abs(targets[i+1] - target) <= indexDiff:\\n\\n return True\\n \\n return False\",\n \"memory\": \"40734\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # brute force\\n # n = len(nums)\\n # for i in range(n):\\n # for j in range(i+1, n):\\n # if abs(i-j) <= indexDiff and abs(nums[i] - nums[j]) <= valueDiff:\\n # return True\\n # return False\\n\\n # sliding window\\n if valueDiff < 0: # Edge case where valueDiff is negative\\n return False\\n\\n # Helper function to calculate the bucket ID, handling negative numbers correctly\\n def get_bucket_id(x, bucket_size):\\n return x // bucket_size \\n \\n seen = {} # Dictionary to store the bucket ID and the corresponding (index, value)\\n bucket_size = valueDiff + 1 # Bucket size is valueDiff + 1 to ensure proper bucketing\\n\\n for i, x in enumerate(nums):\\n # Determine the bucket ID for the current number\\n bucket_id = get_bucket_id(x, bucket_size)\\n\\n # Check if the current bucket already contains a number\\n if bucket_id in seen and i - seen[bucket_id][0] <= indexDiff:\\n return True\\n\\n # Check the previous bucket (bucket_id - 1)\\n if bucket_id - 1 in seen and i - seen[bucket_id - 1][0] <= indexDiff and abs(x - seen[bucket_id - 1][1]) <= valueDiff:\\n return True\\n\\n # Check the next bucket (bucket_id + 1)\\n if bucket_id + 1 in seen and i - seen[bucket_id + 1][0] <= indexDiff and abs(x - seen[bucket_id + 1][1]) <= valueDiff:\\n return True\\n\\n # Store the current number and its index in the seen dictionary\\n seen[bucket_id] = (i, x)\\n\\n # Remove the element that's outside the indexDiff range\\n if i >= indexDiff:\\n old_bucket_id = get_bucket_id(nums[i - indexDiff], bucket_size)\\n del seen[old_bucket_id]\\n\\n return False\",\n \"memory\": \"40938\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n # brute force\\n # n = len(nums)\\n # for i in range(n):\\n # for j in range(i+1, n):\\n # if abs(i-j) <= indexDiff and abs(nums[i] - nums[j]) <= valueDiff:\\n # return True\\n # return False\\n\\n # sliding window\\n if valueDiff < 0: # Edge case where valueDiff is negative\\n return False\\n\\n # Helper function to calculate the bucket ID\\n def get_bucket_id(x, bucket_size):\\n return x // bucket_size\\n \\n seen = {} # Dictionary to store the bucket ID and the corresponding (index, value)\\n bucket_size = valueDiff + 1 # Bucket size is valueDiff + 1 to ensure proper bucketing\\n\\n for i, x in enumerate(nums):\\n # Determine the bucket ID for the current number\\n bucket_id = get_bucket_id(x, bucket_size)\\n\\n # Check if the current bucket already contains a number\\n if bucket_id in seen and i - seen[bucket_id][0] <= indexDiff:\\n return True\\n\\n # Check the previous bucket (bucket_id - 1)\\n if bucket_id - 1 in seen and i - seen[bucket_id - 1][0] <= indexDiff and abs(x - seen[bucket_id - 1][1]) <= valueDiff:\\n return True\\n\\n # Check the next bucket (bucket_id + 1)\\n if bucket_id + 1 in seen and i - seen[bucket_id + 1][0] <= indexDiff and abs(x - seen[bucket_id + 1][1]) <= valueDiff:\\n return True\\n\\n # Store the current number and its index in the seen dictionary\\n seen[bucket_id] = (i, x)\\n\\n # Remove the element that's outside the indexDiff range\\n if i >= indexDiff:\\n old_bucket_id = get_bucket_id(nums[i - indexDiff], bucket_size)\\n del seen[old_bucket_id]\\n\\n return False\",\n \"memory\": \"40938\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:\\n bucket=Counter()\\n for i,num in enumerate(nums):\\n n = num//(t+1)\\n if n-1 in bucket and i-bucket[n-1][0]<=k and abs(num-bucket[n-1][1])<=t:\\n return True\\n if n in bucket and i-bucket[n][0]<=k:\\n return True\\n if n+1 in bucket and i-bucket[n+1][0]<=k and abs(num-bucket[n+1][1])<=t:\\n return True\\n bucket[n]=(i,num)\\n return False\\n\\n \",\n \"memory\": \"41141\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n sl = SortedList()\\n sl_diff = SortedList()\\n n = len(nums)\\n MAXV = int(1e9)\\n nums = [v + MAXV for v in nums]\\n for i in range(n):\\n print(\\\"index: \\\", i)\\n if (i - indexDiff > 0):\\n v = nums[i - indexDiff - 1]\\n index_sl = sl.bisect_left((v, i - indexDiff - 1))\\n if (index_sl > 0):\\n diff = v - sl[index_sl - 1][0]\\n sl_diff.remove((diff, i - indexDiff - 1))\\n if (index_sl <= indexDiff - 1):\\n diff = sl[index_sl + 1][0] - v\\n sl_diff.remove((diff, sl[index_sl + 1][1]))\\n\\n if (index_sl > 0 and index_sl <= indexDiff - 1):\\n new_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\\n sl_diff.add((new_diff, sl[index_sl + 1][1]))\\n sl.remove((v, i - indexDiff - 1))\\n\\n sl.add((nums[i], i))\\n if (i == 0):\\n continue\\n v = nums[i]\\n index_sl = sl.bisect_left((v, i))\\n if (index_sl > 0 and index_sl < len(sl) - 1):\\n back_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\\n sl_diff.remove((back_diff, sl[index_sl + 1][1]))\\n\\n if (index_sl > 0):\\n diff = v - sl[index_sl - 1][0]\\n sl_diff.add((diff, i))\\n if (index_sl < len(sl) - 1):\\n diff = sl[index_sl + 1][0] - v\\n sl_diff.add((diff, sl[index_sl + 1][1]))\\n\\n if (sl_diff[0][0] <= valueDiff):\\n return True\\n\\n return False\\n\\n \",\n \"memory\": \"41345\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if indexDiff < 0 or valueDiff < 0:\\n return False\\n\\n seen = {}\\n for i, num in enumerate(nums):\\n bkt = num // (valueDiff + 1)\\n if bkt in seen and i - seen[bkt][0] <= indexDiff:\\n return True\\n if (\\n bkt - 1 in seen and i - seen[bkt - 1][0] <= indexDiff and \\n abs(num - seen[bkt - 1][1]) <= valueDiff\\n ):\\n return True\\n\\n if (\\n bkt + 1 in seen and i - seen[bkt + 1][0] <= indexDiff and \\n abs(num - seen[bkt + 1][1]) <= valueDiff\\n ):\\n return True\\n\\n seen[bkt] = (i, num)\\n\\n return False\\n\",\n \"memory\": \"41549\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n sl = SortedList()\\n sl_diff = SortedList()\\n n = len(nums)\\n MAXV = int(1e9)\\n nums = [v + MAXV for v in nums]\\n sol = False\\n for i in range(n):\\n print(\\\"index: \\\", i)\\n if (i - indexDiff > 0):\\n v = nums[i - indexDiff - 1]\\n index_sl = sl.bisect_left((v, i - indexDiff - 1))\\n if (index_sl > 0):\\n diff = v - sl[index_sl - 1][0]\\n sl_diff.remove((diff, i - indexDiff - 1))\\n if (index_sl <= indexDiff - 1):\\n diff = sl[index_sl + 1][0] - v\\n sl_diff.remove((diff, sl[index_sl + 1][1]))\\n\\n if (index_sl > 0 and index_sl <= indexDiff - 1):\\n new_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\\n sl_diff.add((new_diff, sl[index_sl + 1][1]))\\n sl.remove((v, i - indexDiff - 1))\\n\\n sl.add((nums[i], i))\\n if (i == 0):\\n continue\\n v = nums[i]\\n index_sl = sl.bisect_left((v, i))\\n if (index_sl > 0 and index_sl < len(sl) - 1):\\n back_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]\\n sl_diff.remove((back_diff, sl[index_sl + 1][1]))\\n\\n if (index_sl > 0):\\n diff = v - sl[index_sl - 1][0]\\n sl_diff.add((diff, i))\\n if (index_sl < len(sl) - 1):\\n diff = sl[index_sl + 1][0] - v\\n sl_diff.add((diff, sl[index_sl + 1][1]))\\n\\n sol |= sl_diff[0][0] <= valueDiff\\n return sol\\n\\n \",\n \"memory\": \"41753\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n if valueDiff < 0:\\n return False\\n\\n seen = {}\\n\\n for i, x in enumerate(nums):\\n bkt = x // (valueDiff + 1)\\n if bkt in seen and i - seen[bkt][0] <= indexDiff: return True\\n if bkt-1 in seen and i - seen[bkt-1][0] <= indexDiff and abs(x - seen[bkt-1][1]) <= valueDiff: return True\\n if bkt+1 in seen and i - seen[bkt+1][0] <= indexDiff and abs(x- seen[bkt+1][1]) <= valueDiff: return True\\n seen[bkt] = (i, x)\\n \\n return False\\n \",\n \"memory\": \"41956\"\n },\n {\n \"code\": \"class Solution:\\n def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:\\n seen = {}\\n for i, x in enumerate(nums): \\n bkt = x//(valueDiff+1)\\n if bkt in seen and i - seen[bkt][0] <= indexDiff: return True \\n if bkt-1 in seen and i - seen[bkt-1][0] <= indexDiff and abs(x - seen[bkt-1][1]) <= valueDiff: return True \\n if bkt+1 in seen and i - seen[bkt+1][0] <= indexDiff and abs(x - seen[bkt+1][1]) <= valueDiff: return True \\n seen[bkt] = (i, x) \\n return False \\n\\n\\n\",\n \"memory\": \"41956\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":90,"string":"90"}}},{"rowIdx":148,"cells":{"question_id":{"kind":"number","value":221,"string":"221"},"name":{"kind":"string","value":"maximal-square"},"content":{"kind":"string","value":"<p>Given an <code>m x n</code> binary <code>matrix</code> filled with <code>0</code>'s and <code>1</code>'s, <em>find the largest square containing only</em> <code>1</code>'s <em>and return its area</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/26/max1grid.jpg\" style=\"width: 400px; height: 319px;\" />\n<pre>\n<strong>Input:</strong> matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]\n<strong>Output:</strong> 4\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/11/26/max2grid.jpg\" style=\"width: 165px; height: 165px;\" />\n<pre>\n<strong>Input:</strong> matrix = [["0","1"],["1","0"]]\n<strong>Output:</strong> 1\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> matrix = [["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>m == matrix.length</code></li>\n\t<li><code>n == matrix[i].length</code></li>\n\t<li><code>1 <= m, n <= 300</code></li>\n\t<li><code>matrix[i][j]</code> is <code>'0'</code> or <code>'1'</code>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":47.29700638688937,"string":"47.297006"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","dynamic-programming","matrix"],"string":"[\n \"array\",\n \"dynamic-programming\",\n \"matrix\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"60\", 0.0745], [\"78\", 0.0149], [\"95\", 0.0149], [\"113\", 0.0149], [\"131\", 0.0297], [\"148\", 0.0297], [\"166\", 0.0149], [\"183\", 0.0297], [\"201\", 0.0297], [\"218\", 0.0149], [\"236\", 0.0149], [\"254\", 0.0149], [\"271\", 0.0149], [\"289\", 0.0149], [\"306\", 0.0297], [\"324\", 0.0149], [\"341\", 0.0149], [\"359\", 0.0149], [\"377\", 0.0149], [\"394\", 0.0297], [\"412\", 0.0149], [\"429\", 0.0149], [\"447\", 0.0149], [\"465\", 0.0149], [\"482\", 1.1893], [\"500\", 7.998800000000001], [\"517\", 28.560799999999997], [\"535\", 17.841399999999997], [\"552\", 8.073299999999998], [\"570\", 4.103599999999999], [\"588\", 2.5867], [\"605\", 2.795], [\"623\", 1.8880000000000006], [\"640\", 1.4421], [\"658\", 1.4867], [\"675\", 1.3972999999999998], [\"693\", 2.4085999999999994], [\"711\", 2.8992999999999993], [\"728\", 2.3341], [\"746\", 1.0555], [\"763\", 0.9515999999999998], [\"781\", 0.8921999999999999], [\"798\", 0.7435], [\"816\", 0.5205000000000001], [\"834\", 0.34210000000000007], [\"851\", 0.2231], [\"869\", 0.20829999999999999], [\"886\", 0.17869999999999997], [\"904\", 0.1785], [\"921\", 0.22319999999999998], [\"939\", 0.2381], [\"957\", 0.16369999999999998], [\"974\", 0.22319999999999998], [\"992\", 0.1636], [\"1009\", 0.07440000000000001], [\"1027\", 0.0745], [\"1044\", 0.0893], [\"1062\", 0.11909999999999998], [\"1080\", 0.0446], [\"1097\", 0.0894], [\"1115\", 0.0745], [\"1132\", 0.0595], [\"1150\", 0.044700000000000004], [\"1168\", 0.0149], [\"1185\", 0.0298], [\"1203\", 0.0149], [\"1220\", 0.0298], [\"1238\", 0.0149], [\"1255\", 0.044700000000000004], [\"1273\", 0.0149], [\"1291\", 0.044700000000000004], [\"1308\", 0.0596], [\"1326\", 0.0744], [\"1343\", 0.0149], [\"1361\", 0.0743], [\"1378\", 0.0298], [\"1396\", 0.0149], [\"1414\", 0.0149], [\"1431\", 0.0149]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18475\", 0.1785], [\"19025\", 14.183699999999998], [\"19575\", 59.664], [\"20125\", 2.5871], [\"20675\", 0.9069], [\"21225\", 1.576], [\"21775\", 1.8136999999999999], [\"22325\", 0.5353], [\"22875\", 0.37170000000000003], [\"23425\", 0.0595], [\"23975\", 0.0149], [\"24525\", 0.5353], [\"25075\", 0.9367000000000001], [\"25625\", 0.1932], [\"26175\", 0.1041], [\"26725\", 0.1338], [\"27275\", 0.0297], [\"27825\", 0.0149], [\"28375\", 0.1635], [\"28925\", 0.0298], [\"29475\", 0.0298], [\"30025\", 0.0149], [\"30575\", 0.0298], [\"31125\", 0.1487], [\"31675\", 0.4163], [\"32225\", 0.2379], [\"32775\", 0.044700000000000004], [\"33325\", 0.0297], [\"33875\", 0.0297], [\"34425\", 0.8475], [\"34975\", 0.4756000000000001], [\"35525\", 0.0446], [\"36075\", 0.0594], [\"36625\", 0.0744], [\"37175\", 0.0595], [\"37725\", 0.0892], [\"38275\", 0.0149], [\"38825\", 0.0595], [\"39375\", 0.0149], [\"39925\", 0.0446], [\"40475\", 0.0297], [\"41025\", 0.119], [\"41575\", 0.0149], [\"42125\", 0.0149], [\"42675\", 0.0149], [\"43225\", 0.0149], [\"43775\", 0.0149], [\"44325\", 0.0149], [\"44875\", 0.0149], [\"45425\", 0.0149], [\"45975\", 0.0149], [\"46525\", 0.0149], [\"47075\", 0.0149], [\"47625\", 0.0149], [\"48175\", 0.0149], [\"48725\", 0.0149], [\"49275\", 0.0149], [\"49825\", 0.0297], [\"50375\", 0.0149], [\"50925\", 0.0149], [\"51475\", 0.1189], [\"52025\", 0.0595], [\"52575\", 0.2974], [\"53125\", 0.5204], [\"53675\", 0.1041], [\"54225\", 0.0743], [\"54775\", 0.0595], [\"55325\", 0.0149], [\"55875\", 0.0149], [\"56425\", 0.0595], [\"56975\", 0.0446], [\"57525\", 0.1784], [\"58075\", 0.1784], [\"58625\", 0.1784], [\"59175\", 2.9289]]}"},"rt_list":{"kind":"list like","value":[{"code":"\ndef maximalSquare(matrix):\n bits = [int(''.join(row), 2) for row in matrix]\n w = 0\n while bits and any(bits):\n w += 1\n bits = [a & b for a, b in itertools.pairwise(b & (b << 1) for b in bits)]\n return w * w\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f\"{maximalSquare(case)}\\n\")\n exit(0)\n \n \n\n\n\n\n\n\n ","runtime":"60"},{"code":"\ndef maximalSquare(matrix):\n bits = [int(''.join(row), 2) for row in matrix]\n w = 0\n while bits and any(bits):\n w += 1\n bits = [a & b for a, b in pairwise(b & (b << 1) for b in bits)]\n return w * w\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f\"{maximalSquare(case)}\\n\")\n exit(0)\n \n \n\n\n\n\n\n\n ","runtime":"60"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits=[int(''.join(row),2) for row in matrix]\n w=0\n while bits and any(bits):\n w+=1\n bits=[b&(b<<1) for b in bits]\n bits2=[]\n for i in range(len(bits)-1):\n bits2.append(bits[i]&bits[i+1])\n bits=bits2\n return w**2","runtime":"78"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits=[int(''.join(row),2) for row in matrix]\n w=0\n while bits and any(bits):\n w+=1\n bits=[b&(b<<1) for b in bits]\n bits2=[]\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\n bits=bits2\n return w*w\n","runtime":"95"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix),len(matrix[0])\n largest = 0\n for j in range(n):\n if matrix[0][j] == '1':\n matrix[0][j] = 1\n largest = 1\n else:\n matrix[0][j] = 0\n for i in range(1,m):\n count = 0\n inc = False\n for j in range(n):\n matrix[i][j] = matrix[i-1][j] + 1 if matrix[i][j] == '1' else 0\n if matrix[i][j] < largest+1:\n count = 0\n else:\n count += 1\n if count == largest+1:\n inc = True\n if inc:\n largest += 1\n return largest*largest","runtime":"113"},{"code":"import itertools\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits = [int(''.join(row), 2) for row in matrix]\n w = 0\n while bits and any(bits):\n w += 1\n bits = [a & b for a, b in itertools.pairwise(b & (b << 1) for b in bits)]\n return w * w","runtime":"131"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits=[int(''.join(row),2) for row in matrix]\n w=0\n while bits and any(bits):\n w+=1\n bits=[b&(b<<1) for b in bits]\n bits2=[]\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\n bits=bits2\n return w*w\n","runtime":"148"},{"code":"import itertools\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits = [int(''.join(row), 2) for row in matrix]\n w = 0\n while bits and any(bits):\n w += 1\n bits = [a & b for a, b in itertools.pairwise(b & (b << 1) for b in bits)]\n return w * w","runtime":"166"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits=[int(''.join(row),2) for row in matrix]\n w=0\n while bits and any(bits):\n w+=1\n bits=[b&(b<<1) for b in bits]\n bits2=[]\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\n bits=bits2\n return w*w","runtime":"183"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits=[int(''.join(row),2) for row in matrix]\n m1 = len(bits)\n w=0\n while any(bits):\n w+=1\n bits=[b&(b<<1) for b in bits]\n m1 -= 1\n bits = [bits[i]&bits[i+1] for i in range(m1)]\n \n return w*w","runtime":"201"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits=[int(''.join(row),2) for row in matrix]\n w=0\n while bits and any(bits):\n w+=1\n bits=[b&(b<<1) for b in bits]\n bits2=[]\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\n bits=bits2\n return w*w\n","runtime":"218"},{"code":"import itertools\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits = [int(''.join(row), 2) for row in matrix]\n w = 0\n while bits and any(bits):\n w += 1\n bits = [a & b for a, b in itertools.pairwise(b & (b << 1) for b in bits)]\n return w * w \n \n \n ","runtime":"236"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits=[int(''.join(row),2) for row in matrix]\n w=0\n while bits and any(bits):\n w+=1\n bits=[b&(b<<1) for b in bits]\n bits2=[]\n for i in range(len(bits)-1):\n bits2.append(bits[i]&bits[i+1])\n bits=bits2\n return w**2\n","runtime":"254"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits=[int(''.join(row),2) for row in matrix]\n w=0\n while bits and any(bits):\n w+=1\n bits=[b&(b<<1) for b in bits]\n bits2=[]\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\n bits=bits2\n return w*w","runtime":"271"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits=[int(''.join(row),2) for row in matrix]\n w=0\n while bits and any(bits):\n w+=1\n bits=[b&(b<<1) for b in bits]\n bits2=[]\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\n bits=bits2\n return w*w","runtime":"289"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits=[int(''.join(row),2) for row in matrix]\n w=0\n while bits and any(bits):\n w+=1\n bits=[b&(b<<1) for b in bits]\n bits2=[]\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\n bits=bits2\n return w*w\n","runtime":"306"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits=[int(''.join(row),2) for row in matrix]\n # return bits\n w=0\n while bits and any(bits):\n w+=1\n bits=[b&(b<<1) for b in bits]\n # return bits\n bits2=[]\n for i in range(len(bits)-1):\n bits2.append(bits[i]&bits[i+1])\n # return bits2\n bits=bits2\n return w**2\n","runtime":"306"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits=[int(''.join(row),2) for row in matrix]\n # return bits\n w=0\n while bits and any(bits):\n w+=1\n bits=[b&(b<<1) for b in bits]\n # return bits\n bits2=[]\n for i in range(len(bits)-1):\n bits2.append(bits[i]&bits[i+1])\n bits=bits2\n return w**2\n","runtime":"324"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits=[int(''.join(row),2) for row in matrix]\n w=0\n while bits and any(bits):\n w+=1\n bits=[b&(b<<1) for b in bits]\n bits2=[]\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\n bits=bits2\n return w*w\n","runtime":"341"},{"code":"import itertools\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits = [int(''.join(row), 2) for row in matrix]\n w = 0\n while bits and any(bits):\n w += 1\n bits = [a & b for a, b in itertools.pairwise(b & (b << 1) for b in bits)]\n return w * w\n","runtime":"359"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n #matrix = [[\"1\"] * 6 for _ in range(6)]\n # Testing random code\n bits = [int(''.join(row), 2) for row in matrix]\n print(f\"{bits}\")\n w = 0\n while bits and any(bits):\n w += 1\n bits = [a & b for a, b in itertools.pairwise(b & (b << 1) for b in bits)]\n print(f\"{bits = }\")\n return w * w\n\n '''\n r = len(matrix)\n c = len(matrix[0])\n max_len = 0\n dp = [[0 for _ in range(c+1)] for _ in range(r+1)]\n\n for i in range(1, r+1):\n for j in range(1, c+1):\n if matrix[i-1][j-1] == \"1\":\n dp[i][j] = min(dp[i-1][j-1], min(dp[i-1][j], dp[i][j-1])) + 1\n max_len = max(max_len, dp[i][j])\n \n return max_len * max_len\n '''","runtime":"377"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n bits=[int(''.join(row),2) for row in matrix]\n w=0\n while bits and any(bits):\n w+=1\n bits=[b&(b<<1) for b in bits]\n bits2=[]\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\n bits=bits2\n return w*w\n","runtime":"394"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n previous_row = [int(s) for s in matrix[0]]\n ans = max(previous_row)\n\n for i in range(1, len(matrix)):\n cur_row = [0]*len(matrix[0])\n cur_row[0] = int(matrix[i][0])\n\n for j in range(1, len(matrix[0])):\n if matrix[i][j] != \"0\":\n cur_row[j] = 1 + min(cur_row[j-1], previous_row[j], previous_row[j-1])\n ans = max(ans, max(cur_row))\n previous_row = cur_row\n return ans * ans\n ","runtime":"412"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n ROWS, COLS = len(matrix), len(matrix[0])\n res = 0\n dp = [0]*(COLS+1)\n\n for r in range(ROWS-1,-1,-1):\n new_dp = [0]*(COLS+1)\n for c in range(COLS-1,-1,-1):\n if matrix[r][c]==\"1\":\n new_dp[c] = 1 + min(\n new_dp[c+1], #right\n dp[c+1], #diag\n dp[c], #down\n )\n res = max(res, max(new_dp))\n dp = new_dp\n return res*res","runtime":"429"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n grid = matrix\n ROWS, COLS = len(grid), len(grid[0])\n cache = [[0]*COLS for _ in range(ROWS)]\n\n def identifyMaxSide(row, prevMax):\n target = 1 + prevMax\n streak = 0\n for c in range(len(row)):\n # print(streak)\n if int(row[c]) >= target:\n streak += 1\n if streak == target: return target\n else: \n streak = 0\n return 0 # target not found\n # initialize first row in cache\n for c in range(COLS):\n if grid[0][c] == '1':\n cache[0][c] = 1\n\t\n\n for r in range(1, ROWS):\n for c in range(COLS):\n if grid[r][c] == '1':\n cache[r][c] = 1 + cache[r-1][c]\n\t\n maxSide = 0 # keeps track side length of max area square\n for r in range(ROWS):\n maxSide = max(maxSide, identifyMaxSide(cache[r], maxSide))\n print(cache)\n return maxSide**2\n\t\n\n","runtime":"447"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m,n = len(matrix), len(matrix[0])\n if m==1:\n for i in matrix[0]:\n if i == '1':\n return 1\n return 0\n if n==1:\n for i in range(m):\n if matrix[i][0] == '1':\n return 1\n return 0 \n\n dp1 =[int(i) for i in matrix[0]]\n dp2 = matrix[1]\n ans =max(dp1)\n print(dp1)\n for i in range(1,m):\n dp2[0] = int(matrix[i][0])\n \n for j in range(1,n):\n dp2[j] = min([dp2[j-1],dp1[j-1],dp1[j]])+1 if matrix[i][j]=='1' else 0 \n\n dp1=dp2[:]\n \n\n ans=max(dp1+[ans])\n return ans**2\n \n ","runtime":"465"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n dp = [0] * (cols + 1)\n prev= 0\n maxsqlen = 0\n\n for i in range(1, rows + 1):\n for j in range(1, cols + 1):\n tmp = dp[j]\n if matrix[i - 1][j - 1] == '1':\n dp[j] = min(dp[j - 1], prev, dp[j]) + 1\n maxsqlen = max(maxsqlen, dp[j])\n else:\n dp[j] = 0\n prev = tmp\n \n\n return maxsqlen * maxsqlen\n","runtime":"517"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n # # BRUTE FORCE O(mn**2)\n # # I'll find out every possible square of 1 by continuing traversal of the matrix from the element next to the initial 1 found. more detailed, i'll make a variable for the size of the largest square found so far and size of the current. both are initially 0.\n # # Then, i'll only search 1 from left uppermost in the matrix. If we find 0, we can break the loop. \n # # if we find 1 in the matrix, also we can find out the largest sqaure by moving diagonally. by doing this, i increase the row and column and then check all row and column are 1 or not. if all elements are 1, we decide to move diagonally. but if there are 0, stop moving forward and update the size or the largest sqaure. \n \n # rows = len(matrix)\n # cols = len(matrix[0])\n # maxsq = 0\n\n # for i in range(rows):\n # for j in range(cols):\n # if matrix[i][j] == \"1\":\n # currsq = 1\n # flag = True\n # while currsq + i < rows and currsq + j < cols and flag:\n # for k in range(i, i + currsq + 1):\n # if matrix[k][currsq + j] == \"0\":\n # flag = False\n # break\n # for k in range(j, j + currsq + 1):\n # if matrix[i + currsq][k] == \"0\":\n # flag = False\n # break\n # if flag:\n # currsq += 1\n # if maxsq < currsq:\n # maxsq = currsq\n # return maxsq ** 2\n\n \n # DP\n # 1 1 -> 1 1\n # 1 1 1 2 (if all surrounded elements are 1)\n \n rows = len(matrix)\n cols = len(matrix[0])\n\n dp = [[0] * (cols + 1) for i in range(rows + 1)]\n maxsq = 0\n\n for i in range(rows):\n for j in range(cols):\n if matrix[i][j] == '1':\n dp[i + 1][j + 1] = min(dp[i][j], dp[i+1][j], dp[i][j+1]) + 1 # if one of three has 0, it will be 0 + 1, but if all are 1, diagonal element will be 2.\n maxsq = max(dp[i+1][j+1], maxsq)\n \n return maxsq ** 2","runtime":"517"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m=len(matrix)\n n=len(matrix[0])\n mx=0\n\n dp=[[0]*n for _ in range(m)]\n for i in range(m):\n for j in range(n): \n if matrix[i][j]==\"1\":\n if i!=0 or j!=0:\n dp[i][j] = min(dp[i-1][j],dp[i][j-1],dp[i-1][j-1])+1\n else:\n dp[i][j]=1\n\n mx = max(mx,dp[i][j])\n return mx*mx\n","runtime":"535"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n if matrix is None or len(matrix) < 1:\n return 0\n\n rows = len(matrix)\n cols = len(matrix[0])\n\n dp = [[0]*(cols + 1) for _ in range(rows + 1)]\n side = 0\n\n for i in range(rows):\n for j in range(cols):\n if matrix[i][j] == \"1\":\n dp[i + 1][j + 1] = min(dp[i][j], dp[i + 1][j], dp[i][j + 1]) + 1\n if dp[i + 1][j + 1] > side:\n side = dp[i + 1][j + 1]\n\n return side * side\n\n ","runtime":"535"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n mem = [[0 for _ in range(n)] for _ in range(m)]\n maxN = 0\n for i in range(m):\n mem[i][0] = int(matrix[i][0])\n maxN = max(maxN, mem[i][0])\n for j in range(n):\n mem[0][j] = int(matrix[0][j])\n maxN = max(maxN, mem[0][j])\n\n for i in range(1,m):\n for j in range(1,n):\n if matrix[i][j] == \"1\":\n mem[i][j] = min(mem[i][j-1], mem[i-1][j-1], mem[i-1][j]) + 1\n else:\n mem[i][j] = 0\n maxN = max(maxN, mem[i][j])\n print(mem)\n return maxN * maxN","runtime":"552"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n row = len(matrix)\n col = len(matrix[0])\n\n dp = [[0] * col for i in range(row)]\n ans = 0\n\n for r in range(row):\n if int(matrix[r][0]) == 1:\n dp[r][0] = 1\n ans = 1\n for c in range(col):\n if int(matrix[0][c]) == 1:\n dp[0][c] = 1\n ans = 1\n\n for r in range(1, row):\n for c in range(1, col):\n if int(matrix[r][c]) == 1:\n dp[r][c] = min(dp[r-1][c], dp[r][c-1], dp[r-1][c-1]) + 1\n \n ans = max(ans, dp[r][c])\n \n return ans**2","runtime":"552"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n xSize = len(matrix)\n ySize = len(matrix[0])\n\n greatest = -1\n maxVal = 0\n\n for i in range(0,xSize):\n for j in range(0,ySize):\n matrix[i][j] = int(matrix[i][j])\n if i-1 >= 0:\n left = matrix[i-1][j]\n else:\n left = 0\n\n if j-1 >= 0:\n right = matrix[i][j-1]\n else:\n right = 0\n \n if i-1 >= 0 and j-1 >= 0:\n diagonal = matrix[i-1][j-1]\n else:\n diagonal = 0\n \n minVal = min(left,right,diagonal)\n \n if matrix[i][j] != 0:\n matrix[i][j] = matrix[i][j] + minVal\n\n if greatest < matrix[i][j]:\n greatest = matrix[i][j]\n\n return greatest*greatest","runtime":"570"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n r=len(matrix)\n c=len(matrix[0])\n if c==1:\n if ['1'] in matrix:\n return 1\n return 0\n dp=[int(matrix[0][i]) for i in range(c)]\n count=max(dp)\n for i in range(1, r):\n temp=[int(matrix[i][k]) for k in range(c)]\n for j in range(1, c):\n if matrix[i][j]=='1' and temp[j-1]!='0' and dp[j-1]!='0' and dp[j]!='0':\n temp[j]+=min(int(temp[j-1]), int(dp[j-1]), int(dp[j]))\n dp=temp\n if max(dp)>count:\n count=max(dp)\n return count**2","runtime":"570"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n result = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n matrix[i][j] = int(matrix[i][j])\n if matrix[i][j] == 1:\n result = 1\n \n for i in range(len(matrix)-2, -1, -1):\n for j in range(len(matrix[0]) -2, -1, -1):\n if matrix[i][j] > 0 and matrix[i+1][j] > 0 and matrix[i][j+1] > 0 and matrix[i+1][j+1] > 0:\n if matrix[i+1][j] == matrix[i][j+1] == matrix[i+1][j+1]:\n matrix[i][j] = matrix[i+1][j+1] + 1\n else:\n matrix[i][j] = min(matrix[i+1][j], matrix[i][j+1], matrix[i+1][j+1]) + 1\n \n result = max(result, matrix[i][j] ** 2)\n\n return result\n ","runtime":"588"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n res = 0\n dp = [[0 for _ in range(n+1)] for _ in range(m+1)]\n\n # for i in range(m):\n # for j in range(n):\n # matrix[i][j] = int(matrix[i][j])\n\n for i in range(m):\n for j in range(n):\n a, b, c = dp[i-1][j], dp[i][j-1], dp[i-1][j-1]\n if \"0\" in (a, b, c, matrix[i][j]):\n dp[i][j] = 0\n else:\n dp[i][j] = min(int(a), int(b), int(c)) + 1\n res = max(res, dp[i][j])\n\n return res*res","runtime":"588"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows = len(matrix)\n cols = len(matrix[0])\n dp = [[[0, 0, 0] for __ in range(cols+1)] for _ in range(rows+1)]\n maxsquare = 0\n for r in range(rows):\n for c in range(cols):\n val = int(matrix[r][c])\n rowstreak, colstreak, diagstreak = dp[r][c]\n if val:\n dp[r][c+1][0] = 1 + rowstreak\n dp[r+1][c][1] = 1 + colstreak\n square = 1 + min(rowstreak, colstreak, diagstreak)\n dp[r+1][c+1][2] = square\n maxsquare = max(square, maxsquare)\n #print(r, c, 'pass', dp)\n return maxsquare*maxsquare","runtime":"605"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n nrow = len(matrix)\n ncol = len(matrix[0])\n dp = [[[0, 0, 0] for _ in range(ncol)] for _ in range(nrow)] # up, left, diag\n result = 0\n for row in range(nrow):\n for col in range(ncol):\n if matrix[row][col] == \"0\":\n continue\n up = dp[row - 1][col][0] if row > 0 else 0\n left = dp[row][col - 1][1] if col > 0 else 0\n diag = dp[row - 1][col - 1][2] if col > 0 and row > 0 else 0\n dp[row][col][0] = 1 + up\n dp[row][col][1] = 1 + left\n dp[row][col][2] = 1 + min(up, left, diag)\n result = max(result, dp[row][col][2])\n return result * result","runtime":"605"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n dp = []\n m = len(matrix)\n n = len(matrix[0])\n for _ in range(m):\n tmp = [0] * n\n dp.append(tmp)\n\n max_so_far = 0\n dir = [[0, -1], [-1, 0], [-1, -1]]\n for i in range(m):\n for j in range(n):\n if matrix[i][j] == \"1\":\n increase = -1\n for d in dir:\n i_new = i + d[0]\n j_new = j + d[1]\n \n if matrix[i_new][j_new] != \"1\" or i_new < 0 or j_new < 0:\n increase = 0\n break\n else:\n if increase == -1:\n increase = dp[i_new][j_new]\n else:\n increase = min(increase, dp[i_new][j_new])\n \n \n dp[i][j] = increase + 1\n max_so_far = max(max_so_far, dp[i][j] * dp[i][j])\n #print(dp)\n return max_so_far\n","runtime":"623"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n \n m, n = len(matrix), len(matrix[0])\n maxlen = 0\n \n for i in range(m):\n for j in range(n):\n if matrix[i][j] == '1':\n if i == 0 or j == 0:\n maxlen = max(maxlen, 1)\n else:\n size = min(int(matrix[i-1][j]), int(matrix[i][j-1]), int(matrix[i-1][j-1])) + 1\n maxlen = max(maxlen, size)\n matrix[i][j] = str(size)\n else:\n matrix[i][j] = '0'\n \n return maxlen * maxlen\n\n\n def maximalSquare3(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n maxlen = 0\n for i in range(m):\n if m - i <= maxlen:\n break\n for j in range(n):\n if n - j <= maxlen:\n break\n matrix[i][j] = int(matrix[i][j])\n if not matrix[i][j]:\n continue\n v1 = max(matrix[i][j - 1] - 1, 0) if j > 0 else 0\n v2 = max(matrix[i - 1][j] - 1, 0) if i > 0 else 0\n for k in range(max(v1, v2), min(m - i, n - j)):\n if all(\n int(matrix[i + x][j + k]) and int(matrix[i + k][j + x])\n for x in range(k + 1)\n ):\n maxlen = max(maxlen, k + 1)\n matrix[i][j] = k + 1\n else:\n break\n return maxlen * maxlen\n\n def maximalSquare2(self, matrix: List[List[str]]) -> int:\n # space: O(m * n), time: O(m * n)\n m = len(matrix)\n n = len(matrix[0])\n hor = [[0 for _ in range(n)] for _ in range(m)]\n for i in range(m):\n j, count = 0, 0\n while j < n:\n if matrix[i][j] == \"1\":\n count += 1\n if matrix[i][j] == \"0\":\n for k in range(1, count + 1):\n hor[i][j - k] = k\n count = 0\n elif j == n - 1:\n for k in range(0, count):\n hor[i][j - k] = k + 1\n j += 1\n\n res = 0\n for i in range(m):\n if m - i <= res:\n return res * res\n for j in range(n):\n if hor[i][j] == 0 or hor[i][j] <= res:\n continue\n for count in range(res + 1, hor[i][j] + 1):\n cols = min(hor[k][j] for k in range(i, min(i + count, m)))\n res = max(min(cols, m - i, count), res)\n if cols <= count:\n break\n return res * res\n","runtime":"623"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n @cache\n def maxSq(i,j): # 以(i,j)為右下角的最大正方形邊長\n # 無正方形\n if matrix[i][j]=='0': return 0\n # 最上一列 or 最左一行\n if i==0 or j==0: return 1\n return 1 + min(maxSq(i-1,j-1), maxSq(i-1,j), maxSq(i,j-1))\n\n return max(maxSq(i,j) for i in range(len(matrix)) for j in range(len(matrix[0]))) ** 2\n","runtime":"640"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m,n = len(matrix),len(matrix[0])\n hist = [0 for i in range(n)]\n idx = 0\n maxsquare = 0\n for idx in range(m):\n for i in range(n):\n if matrix[idx][i]=='0':\n hist[i] = 0\n else:\n hist[i] += 1\n # print(idx,hist,matrix[idx])\n # increasing stack\n lstack = []\n rstack = []\n lside = [0 for i in range(n)]\n rside = [0 for i in range(n)]\n for i in range(n):\n j = n-i-1\n while len(lstack)>0:\n if hist[lstack[-1]]<hist[i]:\n break\n lstack.pop()\n if len(lstack)==0:\n lside[i] = -1\n else:\n lside[i] = lstack[-1]\n lstack.append(i)\n while len(rstack)>0:\n if hist[rstack[-1]]<hist[j]:\n break\n rstack.pop()\n if len(rstack)==0:\n rside[j] = n\n else:\n rside[j] = rstack[-1]\n rstack.append(j)\n for i in range(n):\n hh = hist[i]\n ll = rside[i]-lside[i]-1\n side = min(hh,ll)\n maxsquare = max(maxsquare,side*side)\n return maxsquare\n\n\n \n","runtime":"640"},{"code":"class Solution:\n \"to katw dexia kanei define\"\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n res = [[0 for _ in range(n)] for _ in range(m)]\n test = [[[0,0] for _ in range(n)] for _ in range(m)]\n \n for row in range(m):\n for col in range(n):\n matrix[row][col] = int(matrix[row][col])\n for col in range(1, n):\n test[0][col][0] = (1+test[0][col-1][0]) * matrix[0][col-1]\n for row in range(1, m):\n test[row][0][1] = (1+test[row-1][0][1]) * matrix[row-1][0]\n for row in range(1, m):\n for col in range(1, n):\n test[row][col][0] = matrix[row][col-1] * (1+test[row][col-1][0])\n test[row][col][1] = matrix[row-1][col] * (1+test[row-1][col][1])\n \n for row in range(m):\n for col in range(n):\n #res[row][col] = matrix[row][col]\n if matrix[row][col] == 1:\n res[row][col] = min(res[row-1][col-1], min(test[row][col])) + 1\n \n max_size = max([max(i) for i in res])\n return max_size**2\n\n\n\n","runtime":"658"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n maxN = 0\n\n for i in range(len(matrix)):\n maxN = max(maxN, int(matrix[i][0]))\n\n for j in range(len(matrix[0])):\n maxN = max(maxN, int(matrix[0][j]))\n \n \n for i in range(1, len(matrix)):\n for j in range(1, len(matrix[0])):\n dia, top, left = int(matrix[i-1][j-1]), int(matrix[i-1][j]), int(matrix[i][j-1])\n #print('dia: ', dia, ' top: ', top, ' left: ', left)\n \n if matrix[i][j] == '0':\n continue\n maxN = max(maxN, 1)\n\n if dia == top == left > 0:\n matrix[i][j] = str(dia + 1)\n maxN = max(maxN, dia+1)\n elif dia > 0 and top > 0 and left > 0:\n m = min(dia, top)\n m = min(m, left)\n matrix[i][j] = str(m + 1)\n maxN = max(maxN, m)\n #print(matrix)\n return maxN ** 2","runtime":"658"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n \n m, n = len(matrix), len(matrix[0])\n memo = [[-1 for _ in range(n)] for _ in range(m)] # Memoization table\n \n def dp(i, j):\n # Base case: if we're out of bounds or the cell is '0', return 0\n if i >= m or j >= n or matrix[i][j] == \"0\":\n return 0\n \n # If we've already computed this cell, return the memoized value\n if memo[i][j] != -1:\n return memo[i][j]\n \n # Recursively compute the size of the square by looking at the\n # right, bottom-right, and bottom cells\n right = dp(i, j + 1)\n bottom = dp(i + 1, j)\n bottom_right = dp(i + 1, j + 1)\n \n # The size of the square ending at (i, j) is the minimum of those three plus 1\n memo[i][j] = 1 + min(right, bottom, bottom_right)\n \n return memo[i][j]\n \n max_square_length = 0\n \n # Iterate through every cell to compute the maximal square\n for i in range(m):\n for j in range(n):\n if matrix[i][j] == \"1\":\n max_square_length = max(max_square_length, dp(i, j))\n \n # The area of the maximal square is the square of its side length\n return max_square_length * max_square_length\n","runtime":"675"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n m, n = len(matrix), len(matrix[0])\n \n @cache\n def dp(i, j):\n # Base case: If out of bounds or the cell is '0', no square can start here\n if i >= m or j >= n or matrix[i][j] == \"0\":\n return 0\n\n # Recursively calculate the size of the square\n right = dp(i, j + 1)\n down = dp(i + 1, j)\n diagonal = dp(i + 1, j + 1)\n \n # Current cell can form a square of size 1 + the minimum of right, down, and diagonal\n return 1 + min(right, down, diagonal)\n\n # Find the maximum square size\n max_square = max(dp(i, j) for i in range(m) for j in range(n))\n\n # Return the area of the largest square (size^2)\n return max_square ** 2\n","runtime":"675"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n # if current == 1, square = min(s[i-1][j-1], s[i][j-1], s[i-1][j]) + 1\n m = len(matrix[0])\n n = len(matrix)\n\n s = [[0] * m for i in range(n)]\n largest = 0\n\n for i in range(m):\n s[0][i] = 1 if matrix[0][i] == \"1\" else 0\n largest = max(largest, s[0][i])\n for j in range(n):\n s[j][0] = 1 if matrix[j][0] == \"1\" else 0\n largest = max(largest, s[j][0])\n # print(s)\n\n for i in range(1, n):\n for j in range(1, m):\n # print(i, j, matrix[i][j])\n if matrix[i][j] == \"1\":\n print(\"current is 1\", i, j)\n s[i][j] = min(s[i - 1][j - 1], s[i][j - 1], s[i - 1][j]) + 1\n else:\n s[i][j] = 0\n largest = max(largest, s[i][j])\n # print(i, j, s[i][j])\n\n return largest * largest\n","runtime":"693"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n ROWS,COLS=len(matrix),len(matrix[0])\n cache={}\n\n def helper(r,c):\n if r>=ROWS or c>=COLS:\n return 0\n if (r,c)not in cache:\n down=helper(r+1,c)\n right=helper(r,c+1)\n diag=helper(r+1,c+1)\n cache[(r,c)]=0\n if matrix[r][c]==\"1\":\n cache[(r,c)]=1+min(down,right,diag)\n return cache[(r,c)]\n \n helper(0,0)\n return max(cache.values())**2","runtime":"693"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n # Dynamic programming solution : Bottom up approach\n # Recursive - Top Down too - easier to implement, and similar to DP\n # Time complexity: O(M*N)\n ROWS, COLS = len(matrix), len(matrix[0])\n cache = {} # map each (r, c) -> Max length of the square\n\n def helper(r, c):\n # Out of bounds check\n if r >= ROWS or c >= COLS:\n return 0\n\n if (r, c) not in cache:\n down = helper(r + 1, c)\n right = helper(r, c+1)\n diag = helper(r+1, c+1)\n\n cache[(r,c)] = 0\n if matrix[r][c] == '1':\n cache[(r, c)] = 1 + min(down, diag, right)\n return cache[(r,c)]\n\n helper(0, 0)\n return max(cache.values())**2 # Max area of square = len * len\n\n ","runtime":"711"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n dp = {}\n\n def maximalRec(i, j):\n if i >= m or j >= n:\n return 0\n \n if (i, j) not in dp:\n\n down = maximalRec(i+1, j)\n right = maximalRec(i, j+1)\n diag = maximalRec(i+1, j+1)\n\n dp[(i, j)] = 0\n if matrix[i][j] == \"1\":\n dp[(i, j)] = 1 + min(down, right, diag)\n\n return dp[(i, j)]\n\n \n maximalRec(0, 0)\n return max(dp.values())**2\n\n \n ","runtime":"711"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n rows, cols = len(matrix), len(matrix[0])\n cache = {}\n def bfs(i, j):\n if i >= rows or j >= cols:\n return 0\n if (i, j) not in cache:\n down = bfs(i + 1, j)\n diag = bfs(i + 1, j + 1)\n right = bfs(i, j + 1)\n cache[(i, j)] = 0\n if matrix[i][j] == '1':\n cache[(i, j)] = 1 + min(down, diag, right)\n return cache[(i, j)]\n bfs(0, 0)\n max_len = max(cache.values(), default=0)\n return max_len ** 2","runtime":"728"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n \n\n # Solution 1 - \n # Time - \n # Space - \n\n ROWS, COLS = len(matrix), len(matrix[0])\n cache = {0:0}\n\n def dfs(r, c):\n\n if r >= ROWS or c >= COLS:\n return 0\n\n if (r, c) in cache:\n return cache[(r, c)]\n\n right = dfs(r, c + 1)\n diagonal = dfs(r + 1, c + 1)\n down = dfs(r + 1, c)\n\n cache[(r, c)] = 0\n\n if matrix[r][c] == \"1\":\n cache[(r, c)] = min(right, diagonal, down) + 1\n\n return cache[(r, c)]\n\n dfs(0, 0)\n\n return max(cache.values()) ** 2","runtime":"728"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n\n dp = [[None for _ in range(n)] for _ in range(m)]\n\n ans = 0\n for i in range(m -1, -1, -1):\n for j in range(n-1, -1, -1):\n if matrix[i][j] == \"0\":\n dp[i][j] = 0\n else:\n right = 0 if j + 1 == n else dp[i][j + 1]\n diag = 0 if j + 1 == n or i + 1 == m else dp[i + 1][j + 1] \n down = 0 if i + 1 == m else dp[i + 1][j]\n\n dp[i][j] = 1 + min([right, diag, down])\n print(f'i is {i} j is {j} dp[i][j] is {dp[i][j]}')\n ans = max(ans, dp[i][j] ** 2)\n \n return ans\n\n ","runtime":"746"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n row, col = len(matrix), len(matrix[0]) \n cache={}\n def bfs(i,j):\n if i>=row or j>=col:\n return 0\n if (i,j) not in cache:\n top = bfs(i, j+1)\n diag = bfs(i+1, j+1)\n bottom = bfs(i+1, j)\n cache[i,j] = 0\n if matrix[i][j] == \"1\":\n cache[i,j] = 1 + min(top,diag,bottom)\n return cache[i,j]\n\n bfs(0,0)\n value = max(cache.values(), default = 0)\n return value**2","runtime":"746"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n memo={}\n def ms(matrix,n=0,m=0,m1=False):\n if m1==False:\n m1=True\n n=len(matrix)-1\n m=len(matrix[0])-1\n if (n,m) in memo : return memo[(n,m)]\n if n==0 and m==0:\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n elif n==0:\n ms(matrix,n,m-1,m1)\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n elif m==0:\n ms(matrix,n-1,m,m1)\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n else: \n value = int(matrix[n][m])\n match value:\n case 0: \n ms(matrix,n,m-1,m1)\n ms(matrix,n-1,m,m1)\n ms(matrix,n-1,m-1,m1)\n memo[(n,m)] = 0\n case _:\n memo[(n,m)]=min(ms(matrix,n,m-1,m1),ms(matrix,n-1,m,m1),ms(matrix,n-1,m-1,m1))+int(matrix[n][m])\n return memo[(n,m)]\n \n ms(matrix)\n max1=0\n for i in memo:\n if memo[i]>max1: max1=memo[i]\n return max1**2\n ","runtime":"763"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n # start at a square\n # if it's one: find the max between that and all 3 neighbors being ones\n\n # T[i, j] size of the biggest square starting with the corner (i, j)\n # if matrix[i, j] == 0 return 0\n # get max size square on right and below\n\n # left = T[i + 1, j]\n # down = T[i, j + 1]\n # width = min(down, left)\n # T(i, j) = 1 + (width if T[i + width, j + width] == 1) else 1\n\n memo = {}\n m = len(matrix)\n n = len(matrix[0])\n def dp(i, j):\n if (i, j) in memo:\n return memo[(i, j)]\n\n if i >= m or j >= n or matrix[i][j] == \"0\":\n return 0\n\n\n left = dp(i + 1, j)\n down = dp(i, j + 1)\n r = min(left, down)\n memo[(i, j)] = (1 + r) if r >= 1 and dp(i + r, j + r) >= 1 else 1 + (r - 1 if r else 0)\n\n return memo[(i, j)]\n mv = 0\n for i in range(m):\n for j in range(n):\n res = dp(i, j)\n mv = max(mv, res)\n\n return mv ** 2","runtime":"763"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n \n\n # Solution 1 - \n # Time - \n # Space - \n\n ROWS, COLS = len(matrix), len(matrix[0])\n cache = {0:0}\n\n def dfs(r, c):\n\n if r >= ROWS or c >= COLS:\n return 0\n\n if (r, c) in cache:\n return cache[(r, c)]\n\n right = dfs(r, c + 1)\n diagonal = dfs(r + 1, c + 1)\n down = dfs(r + 1, c)\n\n cache[(r, c)] = 0\n \n if matrix[r][c] == \"1\":\n cache[(r, c)] = min(right, diagonal, down) + 1\n\n return cache[(r, c)]\n\n dfs(0, 0)\n\n print(cache)\n\n return max(cache.values()) ** 2","runtime":"781"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n #Recursive : top down approach\n ROWS, COLS = len(matrix), len(matrix[0])\n cache = {} #map each (r,c) -> maxLength of square\n\n def helper(r,c):\n if r>=ROWS or c>=COLS:\n return 0\n\n # If the result is already cached, return it\n if (r,c) not in cache:\n down = helper(r+1, c) #Move down\n diagonal = helper(r+1, c+1) #Move diagonally\n right = helper(r, c+1) # Move right\n\n cache[(r,c)] = 0 # Initialize with 0\n if matrix[r][c] == \"1\":\n # If current cell is '1', compute the size of the square\n cache[(r,c)] = 1 + min(down, diagonal, right)\n \n return cache[(r,c)]\n\n # Call helper to fill the cache\n helper(0,0)\n\n # Return the area of the largest square found\n return max(cache.values())**2\n","runtime":"781"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n # you can identify a square by looking down, right, diagonal from each corner.\n M, N = len(matrix), len(matrix[0])\n memo = {}\n \n\n @cache\n def dfs(i, j):\n if (i,j) in memo: return memo[(i,j)]\n if i not in range(M) or j not in range(N): return 0\n\n down = dfs(i + 1, j)\n right = dfs(i, j + 1)\n diag = dfs(i + 1, j + 1)\n\n memo[(i,j)] = 0\n if matrix[i][j] != '0':\n memo[(i,j)] = 1 + min(down, right, diag)\n \n return memo[(i,j)]\n \n dfs(0,0)\n return max(memo.values()) ** 2\n\n # each spot in the memo is storing the max of that corner square.","runtime":"798"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n #we have to find the largest square, by that that, they mean when i increment i and j at the same time, all the rows and columns should be 1s\n #as soon we encounter zero, calculate cur area and set the max area to the max of cur amd max\n ROWS, COLS = len(matrix), len(matrix[0])\n\n cache ={}\n\n def helper(r,c):\n if r>=ROWS or c>=COLS:\n return 0\n \n if (r,c) not in cache:\n\n down = helper(r+1,c)\n right = helper(r,c+1) \n diag = helper(r+1,1+c) \n cache[(r,c)] = 0\n \n if matrix[r][c] == \"1\":\n cache[(r,c)] = 1+min(down,right,diag)\n \n return cache[(r,c)]\n \n helper(0,0)\n print(cache)\n\n return max(cache.values()) ** 2\n\n","runtime":"798"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n down = [[-1 for _ in matrix[i]] for i in range(len(matrix))]\n right = [[-1 for _ in matrix[i]] for i in range(len(matrix))]\n diag = [[-1 for _ in matrix[i]] for i in range(len(matrix))]\n\n def findDown(i, j):\n if not 0 <= i < len(matrix) or matrix[i][j] == '0':\n return 0\n if down[i][j] == -1:\n down[i][j] = findDown(i + 1, j) + 1\n return down[i][j]\n \n def findRight(i, j):\n if not 0 <= j < len(matrix[i]) or matrix[i][j] == '0':\n return 0\n if right[i][j] == -1:\n right[i][j] = findRight(i, j + 1) + 1\n return right[i][j]\n \n def findDiag(i, j):\n if not 0 <= i < len(matrix) or not 0 <= j < len(matrix[i]) or matrix[i][j] == '0':\n return 0\n if diag[i][j] == -1:\n diag[i][j] = min(findDiag(i + 1, j + 1) + 1, findRight(i, j), findDown(i, j))\n return diag[i][j]\n\n max_side = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[i])):\n max_side = max(max_side, findDiag(i, j))\n return max_side * max_side\n \n","runtime":"816"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n memo = {}\n def dfs(i,j):\n if i>=len(matrix) or j >=len(matrix[0]):\n return 0\n elif (i,j) in memo:\n return memo[(i,j)]\n memo[(i,j)] = 0\n diag = dfs(i+1,j+1)\n right = dfs(i,j+1)\n down = dfs(i+1,j)\n if matrix[i][j] == \"1\":\n memo[(i,j)] += min(down,right,diag) + 1\n return memo[(i,j)]\n\n\n dfs(0,0)\n return max(memo.values())**2","runtime":"816"},{"code":"def largest(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\n if not 0 <= i < len(mat):\n return 0\n if not 0 <= j < len(mat[0]):\n return 0\n\n if mat[i][j] == '0':\n return 0\n \n key = (i, j)\n if key in cache:\n return cache[key]\n\n res = 1\n res += min(\n largest(mat, i+1, j+1, cache),\n min(\n largest(mat, i, j+1, cache),\n largest(mat, i+1, j, cache)\n )\n )\n\n cache[key] = res\n return res\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n best = 0\n cache = {}\n for i in range(len(matrix)):\n for j in range(len(matrix[i])):\n best = max(best, largest(matrix, i, j, cache) ** 2)\n return best\n\n'''\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"0\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"0\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"0\",\"0\",\"0\"]\n[\"0\",\"1\",\"1\",\"1\",\"1\",\"0\",\"0\",\"0\"]\n'''","runtime":"834"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n \"\"\"\n distance of width and height can only be 1:1\n to check if square, look right, down, diagonal to check for 1s\n pass variables and flags and curr len of matrix\n \"\"\"\n ROWS = len(matrix)\n COLS = len(matrix[0])\n\n def dfs(r,c):\n if r < 0 or r >= ROWS or c < 0 or c >= COLS:\n return 0\n if (r,c) not in memo:\n width = dfs(r,c+1)\n height = dfs(r+1,c)\n diag = dfs(r+1,c+1)\n memo[(r,c)] = 0 \n if matrix[r][c] == \"1\":\n memo[(r,c)] = 1+min(width,height,diag)\n \n return memo[(r,c)]\n \n\n memo = {}\n maxlen = 0\n for r in range(ROWS):\n for c in range(COLS):\n maxlen = max(maxlen,dfs(r,c))\n return maxlen*maxlen\n\n\n\n def maximalSquare1(self, matrix: List[List[str]]) -> int:\n \n \"\"\"\n square definition: distance of width and height can only be 1:1\n to check if it's a square, look right, down, and diagonal to check for 1s\n pass variables and flags and curr len of matrix, \n dfs with memo\n \"\"\" \n def dfs1(matrix,visited,r,c):\n if r < 0 or r >= len(matrix) or c < 0 or c >= len(matrix[0]):\n return 0\n if (r,c) not in visited:\n right = dfs(matrix,visited,r,c+1)\n down = dfs(matrix,visited,r+1,c)\n diagonal = dfs(matrix,visited,r+1,c+1)\n visited[(r,c)] = 0 # mark (r,c) as 0 unless it's 1\n if matrix[r][c] == \"1\":\n visited[(r,c)] = 1+min(right,down,diagonal)\n return visited[(r,c)]\n\n if len(matrix) == 1:\n return int(\"1\" in matrix[0])\n\n ROWS = len(matrix)\n COLS = len(matrix[0])\n visited = {}\n maxlen = 0\n for i in range(ROWS):\n for j in range(COLS):\n maxlen = max(area,dfs(matrix,visited,i,j))\n return maxlen * maxlen # maxlen **2 for square area\n\n def maximalSquar1(self, matrix: List[List[str]]) -> int:\n \"\"\"\n if matrix[i-1][j-1] == 1:\n dp[i][j] = 1+min(dp[i-1][j],dp[i][j-1],dp[i-1][j-1])\n \"\"\"\n if len(matrix) == 1:\n return int(\"1\" in matrix[0])\n ROWS = len(matrix)\n COLS = len(matrix[0]) \n dp = [[0]*(COLS+1) for _ in range(ROWS+1)]\n largest = 0\n for i in range(1,ROWS+1):\n for j in range(1,COLS+1):\n if matrix[i-1][j-1] == \"1\":\n dp[i][j] = 1+min(dp[i-1][j],dp[i][j-1],dp[i-1][j-1])\n largest = max(largest,dp[i][j])\n return largest*largest\n\n \n ","runtime":"834"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n m = len(matrix)\n n = len(matrix[0])\n directions = [(0, 1), (1, 0), (1, 1)]\n \n @cache\n def dp(i, j):\n if i >= m or i < 0 or j >= n or j < 0:\n return 0\n \n if matrix[i][j] == \"0\":\n return 0\n\n res = 1\n add = float('inf')\n for di, dj in directions:\n ni, nj = i + di, j + dj\n add = min(add, dp(ni, nj))\n \n return res + add\n \n ans = 0\n for i in range(m):\n for j in range(n):\n ans = max(ans, dp(i, j))\n\n return ans*ans\n\n","runtime":"851"},{"code":"'''\nGiven an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area. \n\n \n'''\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n h,w = len(matrix),len(matrix[0])\n cache = {}\n\n def helper(x,y):\n if x >= w or y >= h:\n return 0\n \n if (x,y) not in cache:\n ceil = helper(x,y+1)\n adj = helper(x+1,y+1)\n left = helper(x+1,y)\n\n cache[(x,y)] = 0\n print(f\"{x}:{y}\")\n if matrix[y][x] == '1':\n cache[(x,y)] = 1 + min(ceil,adj,left)\n \n return cache[(x,y)]\n\n helper(0,0)\n return max(cache.values()) ** 2","runtime":"851"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows = len(matrix)\n cols = len(matrix[0])\n ret = 0\n\n for i in range(rows):\n for j in range(cols):\n matrix[i][j] = int(matrix[i][j])\n if matrix[i][j] == 1 and (i != 0 and j!=0):\n print(i)\n print(j)\n matrix[i][j] += min(matrix[i-1][j], matrix[i][j-1], matrix[i-1][j-1])\n print(ret)\n print(\"-----\")\n ret = max(int(matrix[i][j]), ret)\n\n return ret**2 if ret > 1 else ret\n\n \n\n ","runtime":"869"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n dp = [[0] * len(matrix[0]) for i in range(len(matrix))]\n\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n dp[i][j] = int(matrix[i][j])\n \n print(dp)\n def helper(r,c):\n up = up_left = left = 0\n\n if r - 1 in range(len(dp)):\n up = dp[r - 1][c]\n if r - 1 in range(len(matrix)) and c - 1 in range(len(matrix[0])):\n up_left = dp[r - 1][c - 1]\n if c - 1 in range(len(matrix[0])):\n left = dp[r][c - 1]\n \n return 1 + min(up, up_left, left)\n \n res = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if dp[i][j] >= 1:\n ans = helper(i, j)\n dp[i][j] = ans\n print(ans)\n res = max(res, ans ** 2)\n\n return res \n\n ","runtime":"869"},{"code":"\n\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n M = len(matrix)\n N = len(matrix[0])\n\n dp = [[0] * N for i in range(M)]\n\n dp[0][0] = 1 if matrix[0][0] == '1' else 0\n\n for m in range(1, M):\n dp[m][0] = 1 if matrix[m][0] == '1' else 0\n \n for n in range(1, N):\n dp[0][n] = 1 if matrix[0][n] == '1' else 0\n\n print(dp)\n\n for m in range(1, M):\n for n in range(1, N):\n if matrix[m][n] == '0':\n continue\n\n dp[m][n] = 1 \n if dp[m-1][n-1] > 0 and dp[m][n-1] > 0 and dp[m-1][n] > 0:\n x = min(dp[m-1][n-1], dp[m][n-1], dp[m-1][n])\n dp[m][n] = (x ** 0.5 + 1) ** 2\n print(m, n, x, dp[m][n])\n\n print(dp)\n\n ret = -1\n for m in range(M):\n for n in range(N):\n ret = max(ret, dp[m][n])\n\n return int(ret)\n\n\n","runtime":"886"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n dp = [[-1 for _ in range(len(matrix[0]))] for _ in range(len(matrix))]\n maxRes = 0\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n if matrix[r][c] == \"1\":\n dp[r][c] = self.biggestSquareFrom(matrix, dp, r, c)\n maxRes = max(dp[r][c], maxRes)\n return maxRes**2\n \n def biggestSquareFrom(self, matrix: List[List[str]], dp: List[List[int]], row: int, col: int) -> int:\n if row >= len(matrix) or col >= len(matrix[0]):\n return 0\n \n if matrix[row][col] == \"0\":\n return 0\n \n if dp[row][col] != -1: # Check if already calculated\n return dp[row][col]\n \n minSquare = float('inf')\n \n for dr, dc in [[1, 0], [1, 1], [0, 1]]:\n temp = self.biggestSquareFrom(matrix, dp, row+dr, col+dc)\n minSquare = min(minSquare, temp)\n \n dp[row][col] = minSquare + 1\n \n return minSquare + 1\n\n ","runtime":"886"},{"code":"class Solution:\n # Top-down recursion\n # Time: O(m*n)\n # Space: O(m*n)\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n memo = [[0 for _ in range(COLS)] for _ in range(ROWS)]\n\n def recur(r, c):\n if r == ROWS or c == COLS:\n return 0\n elif memo[r][c]:\n return memo[r][c]\n else:\n right = recur(r, c+1)\n diag = recur(r+1, c+1)\n down = recur(r+1, c)\n\n if matrix[r][c] == \"1\":\n memo[r][c] = int(matrix[r][c]) + min(right, diag, down)\n return memo[r][c]\n \n recur(0, 0)\n maxLength = 0\n for row in memo:\n for num in row:\n maxLength = max(maxLength, num)\n return maxLength ** 2\n","runtime":"904"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n\n m, n = len(matrix), len(matrix[0])\n self.maximal = 0\n dp = [[0] * n for _ in range(m)]\n\n def dfs(r, c):\n if r >= m or c >= n:\n return 0\n if dp[r][c]:\n return dp[r][c]\n \n curr_sq = min(dfs(r+1, c), dfs(r+1, c+1), dfs(r, c+1)) + 1\n\n if matrix[r][c] == '0':\n return 0\n \n dp[r][c] = curr_sq\n self.maximal = max(self.maximal, curr_sq)\n return curr_sq\n\n dfs(0,0)\n\n return self.maximal**2\n\n ","runtime":"904"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n ROWS = len(matrix)\n COLS = len(matrix[0])\n\n directions = [(1, 0), (0, 1), (1, 1)]\n\n dp = {}\n\n def is_valid(i, j):\n return 0 <= i <= ROWS - 1 \\\n and 0 <= j <= COLS - 1\n\n def compute_max_dimension(i, j):\n if (i, j) in dp:\n return dp[(i, j)]\n \n max_dimension = 1\n\n for dr, dc in directions:\n if not is_valid(i + dr, j + dc) \\\n or matrix[i + dr][j + dc] == \"0\":\n dp[(i, j)] = max_dimension\n return dp[(i, j)]\n \n max_dimension += min(\n compute_max_dimension(i + 1, j),\n compute_max_dimension(i, j + 1),\n compute_max_dimension(i + 1, j + 1)\n )\n\n dp[(i, j)] = max_dimension\n return dp[(i, j)]\n\n max_dimension = 0\n\n for i in range(ROWS):\n for j in range(COLS):\n if matrix[i][j] == \"1\":\n max_dimension = max(\n max_dimension,\n compute_max_dimension(i, j)\n )\n \n return max_dimension**2 \n\n\n\n\n\n ","runtime":"921"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n max_area = 0\n\n for i in range(0, len(matrix)):\n for j in range(0, len(matrix[0])):\n if int(matrix[i][j]) == 1:\n if i-1>=0:\n upper = int(matrix[i-1][j])\n else:\n upper = 0\n\n if j-1>=0:\n side = int(matrix[i][j-1])\n else:\n side = 0\n\n if i-1>=0 and j-1>=0:\n dia = int(matrix[i-1][j-1])\n else:\n dia = 0\n\n print(i, j, matrix[i][j], upper, dia, side)\n matrix[i][j] = int(1+min(upper, dia, side))\n else:\n matrix[i][j] = int(0)\n\n if matrix[i][j] > max_area:\n max_area = matrix[i][j]\n\n return max_area**2","runtime":"921"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n R,C=len(matrix),len(matrix[0])\n cache={}\n def helper(r,c):\n if r not in range(R) or c not in range(C):\n return 0 \n \n if (r,c) not in cache:\n right=helper(r,c+1)\n down=helper(r+1,c)\n diag=helper(r+1,c+1)\n cache[(r,c)]=0\n if matrix[r][c] == \"1\":\n cache[(r,c)] = 1+min(diag,right,down)\n return cache[(r,c)]\n helper(0,0)\n return max(cache.values())**2\n \n\n\n","runtime":"939"},{"code":"from functools import cache\nimport numpy as np\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n squares = np.zeros((rows+1, cols+1), dtype=int)\n maximum = 0\n\n for r in range(rows-1, -1, -1):\n for c in range(cols-1, -1, -1):\n if matrix[r][c] != '0':\n right = squares[r][c+1]\n down = squares[r+1][c]\n diag = squares[r+1][c+1]\n squares[r][c] = min(right, down, diag) + 1\n\n maximum = max(maximum, squares[r][c])\n \n #print(squares)\n return maximum ** 2\n\n\n\n\n\n","runtime":"939"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n dp = [0 for i in range(m*n)]\n\n for i in range(m):\n for j in range(n):\n if matrix[i][j] == '1':\n dp[i*n + j] = 1\n res = 1\n \n x = m-2\n y = n-2\n\n while x >= 0 and y >= 0:\n i = x\n for j in reversed(range(n-1)): \n loc = i*n+ j\n r1 = dp[i*n + j + 1]\n b1 = dp[(i+1)*n + j]\n d1 = dp[(i+1)*n + j + 1]\n print(i, j, r1, b1, d1)\n if dp[loc]: dp[loc] = min(r1, b1, d1) + 1\n j = y\n for i in reversed(range(m-1)): \n loc = i*n+ j\n r1 = dp[i*n + j + 1]\n b1 = dp[(i+1)*n + j]\n d1 = dp[(i+1)*n + j + 1]\n if dp[loc]: dp[loc] = min(r1, b1, d1) + 1\n if x == 0 and y == 0:\n x -= 1\n y -= 1\n else:\n x = max(x-1, 0)\n y = max(y-1, 0)\n print(dp)\n return max(dp)**2\n \n \n\n ","runtime":"957"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n memo = dict()\n\n def dp(r, c) -> int:\n if r >= len(matrix) or c >= len(matrix[r]):\n return 0\n\n if (r,c) not in memo:\n if matrix[r][c] == \"0\":\n memo[(r, c)] = 0\n if matrix[r][c] == \"1\":\n memo[(r, c)] = min(dp(r+1,c), dp(r,c+1), dp(r+1,c+1)) + 1\n return memo[(r,c)]\n \n for ri, r in enumerate(matrix):\n for ci, c in enumerate(r):\n dp(ri, ci)\n \n ans = 0\n print(memo.items())\n for k, v in memo.items():\n ans = max(ans, v)\n \n return ans*ans\n","runtime":"957"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n cache = {}\n def helper(r,c):\n if r not in range(m) or c not in range(n):\n return 0\n if (r,c) in cache:\n return cache[(r,c)]\n \n \n cache[(r,c)] = 0\n right = helper(r+1,c)\n down = helper(r,c+1)\n diag = helper(r+1,c+1)\n cache[(r,c)] = 0\n if matrix[r][c] == \"1\":\n \n cache[(r,c)] = 1+ min(right, down, diag)\n \n return cache[(r,c)]\n helper(0,0)\n\n return max(cache.values()) ** 2\n","runtime":"974"},{"code":"from functools import cache\nimport numpy as np\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n squares = np.zeros((rows+1, cols+1), dtype=int)\n maximum = 0\n\n for r in range(rows-1, -1, -1):\n for c in range(cols-1, -1, -1):\n if matrix[r][c] != '0':\n right = squares[r][c+1]\n down = squares[r+1][c]\n diag = squares[r+1][c+1]\n size = min(right, down) + 1\n squares[r][c] = size\n if size - 1 > diag:\n squares[r][c] -= 1\n\n maximum = max(maximum, squares[r][c])\n \n #print(squares)\n return maximum ** 2\n\n\n\n\n\n","runtime":"974"},{"code":"class Solution:\n def hasSquare(self, matrix: List[List[str]], n: int) -> bool:\n N, M = len(matrix), len(matrix[0])\n good_row = [\"1\" for i in range(n)]\n rows = {}\n for i in range(N):\n rows[i] = set()\n for j in range(M+1-n):\n if matrix[i][j:j+n] == good_row:\n rows[i].add(j)\n cols = {}\n for i in range(N+1-n):\n cols[i] = rows[i]\n for j in range(n):\n cols[i] = cols[i].intersection(rows[i+j])\n\n for i in cols:\n if cols[i] != set():\n return True\n return False\n\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n high = max(len(matrix), len(matrix[0]))\n low = 0\n while low < high:\n mid = (low + high + 1)//2\n if self.hasSquare(matrix, mid):\n low = mid\n else:\n high = mid - 1\n return low**2\n ","runtime":"992"},{"code":"from functools import cache\nimport numpy as np\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n squares = np.zeros((rows+1, cols+1), dtype=int)\n maximum = 0\n\n for r in range(rows-1, -1, -1):\n for c in range(cols-1, -1, -1):\n if matrix[r][c] != '0':\n right = squares[r][c+1]\n down = squares[r+1][c]\n diag = squares[r+1][c+1]\n size = min(right, down) + 1\n squares[r][c] = size\n if size - 1 > diag:\n squares[r][c] -= 1\n\n maximum = max(maximum, squares[r][c])\n \n #print(squares)\n return maximum ** 2\n\n\n\n\n\n","runtime":"992"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n t = [[0] * n for i in range(m)]\n def recur(i,j):\n if i < 0 or j < 0 or i > m-1 or j > n-1:\n return 0\n \n if t[i][j] > 0:\n return t[i][j]\n t[i][j] == 0\n l,d,u = recur(i-1,j),recur(i-1,j-1),recur(i,j-1)\n if matrix[i][j] == \"1\":\n t[i][j] = min(l,d,u)+1\n return t[i][j]\n recur(m-1,n-1)\n #print(t)\n max_val = 0\n for i in t:\n for j in i:\n max_val = max(max_val,j)\n return max_val ** 2","runtime":"1009"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n dp = [[0] * (len(matrix[0])) for _ in range(len(matrix))]\n max_res = 0\n for row in range(len(matrix)):\n for col in range(len(matrix[0])):\n print(\"For row\", row, \"col\", col)\n if matrix[row][col] == \"1\":\n up = 0 if row - 1 < 0 else dp[row - 1][col]\n left = 0 if col - 1 < 0 else dp[row][col - 1]\n diag = 0 if (row - 1 < 0 and col - 1 < 0) else dp[row - 1][col - 1]\n \n print(\"Up, left, diag: \", up, left, diag)\n dp[row][col] = min(up, left, diag) + 1\n else:\n print(\"Skipping cuz 0\")\n dp[row][col] = 0\n max_res = max(max_res, dp[row][col])\n return max_res*max_res","runtime":"1009"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n n = len(matrix)\n m = len(matrix[0])\n\n dp = [ [0 for i in range(m)] for i in range(n)]\n\n if matrix[0][0] == 1:\n dp[0][0] = 1\n else:\n dp[0][0] = 0\n\n for i in range(n):\n for j in range(m):\n if matrix[i][j] == \"1\":\n dp[i][j] = max(dp[i][j], 1)\n\n print(i, j, dp[i-1][j], dp[i][j-1], dp[i-1][j-1])\n if i >= 1 and j >= 1: \n \n dp[i][j] = max(dp[i][j], (min(math.sqrt(dp[i-1][j-1]),math.sqrt(dp[i][j-1]), math.sqrt(dp[i-1][j]) ) + 1)**2)\n #print(\"inside \", i, j, dp[i][j])\n\n maxVal = -1\n for l in dp:\n for num in l:\n maxVal = max(maxVal, num)\n\n\n\n return int(maxVal)\n\n # 0 0 0 1\n # 1 1 0 1\n # 1 1 1 1\n # 0 1 1 1\n # 0 1 1 1 ","runtime":"1027"},{"code":"class Solution:\n # [\n # [1 0 1 0 0] [1 0 1 0 0]\n # [1 0 3 2 1] [1 0 1 2 3]\n # [5 4 3 2 1] [1 2 3 4 5]\n # [1 0 0 1 0] [1 0 0 1 0]\n #]\n # [\n # [4 0 3 0 0] [1 0 1 0 0]\n # [3 0 2 3 2] [2 0 2 1 1]\n # [2 1 1 2 1] [3 1 3 2 2]\n # [1 0 0 1 0] [4 0 0 3 0]\n #]\n #[\n # [1 0 1 0 0] [1 0 1 0 0]\n # [1 0 2 2 1] [1 0 1 1 1]\n # [2 1 1 2 1] [1 1 3 2 2]\n # [1 0 0 1 0] [1 0 0 1 0]\n #] \n\n def c(self, s_max, matrix):\n for ri in range(len(matrix) - s_max + 1):\n for ci in range(len(matrix[0]) - s_max + 1):\n for i in range(ri, s_max + ri):\n if \"0\" in matrix[i][ci: ci + s_max]:\n break\n else:\n return True\n\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n s_max = 0\n while s_max <= min(len(matrix), len(matrix[0])):\n s_max += 1\n # check next s_max\n if not self.c(s_max, matrix):\n return (s_max - 1) ** 2\n return s_max ** 2\n\n\n\n ","runtime":"1027"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n memo = {} # (i, j):maxSquare\n def dfs(i, j):\n # out of bound or '0' in matrix, return 0\n # base case - last row, col\n # if in memo, return memo[pos]\n if i >= len(matrix) or j >= len(matrix[0]):\n return 0\n if i == len(matrix) - 1 or j == len(matrix[0]) - 1 or matrix[i][j] == '0':\n memo[(i, j)] = int(matrix[i][j])\n return memo[(i, j)]\n if (i, j) in memo:\n return memo[(i, j)]\n\n # i, j itself 0 -> 0\n # if one of the neighbor is '0' -> store and return the matrix[i][j] itself\n minSquare = float('inf')\n for dr, dc in [(1, 0), (0, 1), (1, 1)]:\n nei = dfs(i + dr, j + dc)\n if nei == 0:\n memo[(i, j)] = int(matrix[i][j])\n return memo[(i, j)]\n minSquare = min(minSquare, nei)\n # max square of (i, j) -> min(minSquare of neighbor) + 1\n memo[(i, j)] = minSquare + 1\n return memo[(i, j)]\n \n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n dfs(r, c) # being top left start point\n\n # iterate through memo to get max square\n maxSquare = 0\n for r, c in memo:\n maxSquare = max(maxSquare, memo[(r, c)])\n return maxSquare * maxSquare","runtime":"1062"},{"code":"\"\"\"\n0 1\n1 0\n\"\"\"\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n dp = {}\n \n def dfs(r: int, c: int) -> int:\n if (r not in range(ROWS) or\n c not in range(COLS)\n ):\n return 0\n \n if (r,c) in dp:\n return dp[(r,c)]\n \n if matrix[r][c] == '1':\n dp[(r,c)] = 1 + min(dfs(r-1, c-1), dfs(r-1,c), dfs(r,c-1))\n return dp[(r,c)]\n else:\n dp[(r,c)] = 0\n return dp[(r,c)]\n \n for r in range(ROWS):\n for c in range(COLS):\n dfs(r, c)\n \n length = max(dp.values())\n return length * length\n","runtime":"1062"},{"code":"import copy\nimport numpy as np\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n A = [[int(s) for s in row] for row in matrix]\n # print(A)\n for x in range(1, m):\n for y in range(1, n):\n # print(x, y, matrix[x][y])\n if matrix[x][y] == '0' or A[x-1][y-1] == 0:\n # print(\"VAL\", matrix[x][y])\n continue\n\n max_square_diag_sub_1 = A[x-1][y-1]\n d = 1\n while d <= max_square_diag_sub_1:\n max_square_adj_sub_1 = min(A[x-d][y], A[x][y-d])\n print(f\"A[{x-d}][{y}], A[{x}][{y-d}]\", A[x-d][y], A[x][y-d], max_square_adj_sub_1, max_square_diag_sub_1)\n if max_square_adj_sub_1 == 0:\n break\n else:\n d += max_square_adj_sub_1\n # print('d', d)\n if d > max_square_diag_sub_1:\n A[x][y] = 1 + max_square_diag_sub_1\n elif d == max_square_diag_sub_1:\n A[x][y] = min(max_square_diag_sub_1, d)\n else:\n A[x][y] = 1\n \n # print(A)\n return np.max(A)**2\n \n \"\"\"\n 0001\n 1101\n 1111\n 0111\n 0111\n\n 0001\n 1101\n 1211\n 0112\n 0122\n \"\"\"\n \n # Check diagonal\n\n # # Brute force, slide window of size k=[m, 1] x [n, 1] and check if all 1's\n\n # # In order for matrix[x][y] to be part of a square, it must:\n # # 1) Be a 1\n # # 2) at least 2/4 cardinal neighbors are a 1\n # # 3) at least 1 diagonal neighbor between 1's neighbors is a 1\n\n # # Start at 0, 0 if matrix[x][y] == 1\n # # 1) Move right until finding another 1, so you have a streak of W ones \n # # 2) Move down one row, and repeat \n\n\n # m, n = len(matrix), len(matrix[0])\n # start_x, start_y = 0, 0\n # best_1s = 0\n # while start_x < m and start_y < n:\n # x, y = start_x, start_y\n # min_x_1s, min_y_1s = m, n\n # x_1s, y_1s = 0, 0\n\n # while x < min_x_1s:\n # # Move right\n # while matrix[x][y] == 1 and y < min(n, min_y_1s):\n # y_1s += 1\n # y += 1\n # matrix[x][y] = 0\n\n # if y_1s == 0:\n # # No ones in this row, check next row and reset num_0s\n # start_x = x + 1\n # start_y = 0\n # best_1s = min(best_1s, min(min_x_1s, min_y_1s))\n \n # min_x_1s, min_y_1s = m, n\n # x_1s, y_1s = 0, 0\n\n # break\n\n # if y_1s < min_y_1s:\n # # Smaller row of 1s\n # min_y_1s = y_1s\n # elif y_1s > min_y_1s:\n # # Reset \n # x_1s += 1\n \n # min_x_1s = min(min_x_1s, x_1s)\n # if min_x_1s == min_y_1s:\n # best_1s = max(best_1s, min_x_1s)\n\n\n ","runtime":"1080"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n\n dp = [[0 for j in range(n + 1)] for i in range(m + 1)]\n dp[1][1] = int(matrix[0][0])\n\n for i in range(2, m + 1):\n dp[i][1] = dp[i-1][1] + int(matrix[i - 1][0])\n\n for j in range(2, n + 1):\n dp[1][j] = dp[1][j-1] + int(matrix[0][j - 1])\n \n # for row in dp:\n # print(row)\n # return -1\n for i in range(2, m + 1):\n for j in range(2, n + 1):\n dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + int(matrix[i - 1][j - 1])\n \n\n def isValidSquare(r, c, length):\n area = dp[r][c] - dp[r - length][c] - dp[r][c - length] + dp[r - length][c - length]\n if area == length ** 2:\n return True\n return False\n \n out = 0\n for r in range(1, m + 1):\n for c in range(1, n + 1):\n left, right = 1, min(r, c)\n while left <= right:\n mid = (left + right) // 2\n if isValidSquare(r, c, mid):\n out = max(out, mid)\n left = mid + 1\n else:\n right = mid - 1\n\n return out ** 2\n","runtime":"1080"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n R, C = len(matrix), len(matrix[0])\n\n sums = [[0 for c in range(C + 1)] for r in range(R + 1)]\n\n for r in range(1, R + 1):\n for c in range(1, C + 1):\n sums[r][c] = sums[r][c - 1] + sums[r - 1][c] - sums[r - 1][c - 1] + int(matrix[r - 1][c - 1])\n\n result = 0\n\n for r in range(1, R + 1):\n for c in range(1, C + 1):\n if matrix[r - 1][c - 1] == \"0\":\n continue\n\n st, en = 1, min(R - r + 1, C - c + 1)\n while en - st > 1:\n md = (st + en) // 2\n if sums[r + md - 1][c + md - 1] - sums[r + md - 1][c - 1] - sums[r - 1][c + md - 1] + sums[r - 1][c - 1] == md * md:\n st = md\n else:\n en = md\n if sums[r + en - 1][c + en - 1] - sums[r + en - 1][c - 1] - sums[r - 1][c + en - 1] + sums[r - 1][c - 1] == en * en:\n st = en\n\n result = max(result, st)\n\n return result * result\n","runtime":"1097"},{"code":"class Solution:\n \"\"\"\n 0 0 0 1\n 1 1 0 1\n 1 1 1 1 \n 0 1 1 1\n 0 1 1 1\n \"\"\"\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n dp = [[(float('inf'), float('inf')) for i in range(len(matrix[0]))] for j in range(len(matrix))] #Record the top left corner of the square\n \n out = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if matrix[i][j] == \"0\":\n continue\n\n dp[i][j] = (i, j) #2 3\n out = max(out, 1)\n if i == 0 or j == 0:\n continue\n\n new_top_left = dp[i - 1][j - 1] #1, 2\n if new_top_left != (float('inf'), float('inf')):\n left_res_y, left_res_x = dp[i][j - 1] # 2 2\n up_res_y, up_res_x = dp[i - 1][j] # 1 3\n\n new_coords = (max(up_res_y, new_top_left[0]), max(left_res_x, new_top_left[1]))\n diagonal = min(i - new_coords[0], j - new_coords[1])\n\n if new_coords[0] == float('inf') or new_coords[1] == float('inf'):\n continue\n dp[i][j] = (i - diagonal, j - diagonal)\n out = max(out, (i - dp[i][j][0] + 1) * (j - dp[i][j][1] + 1))\n \n return out\n \n\n\n\n\n \n\n","runtime":"1097"},{"code":"'''\n\nBrute force solution:\n- Scan each position\n- Keep expanding the squares outwards...\n\nO(n^4) assuming a square input matrix.\n\nDP:\n- largest[i,j] =\n if mat[i][j] = 0\n 0\n else:\n res = 1\n expansion_width = min(largest[i+1, j+1], right[i+1, j], down[i, j+1])\n if expansion_width > 0:\n res = (expansion_width + 1) ** 2\n\n'''\n\ndef right(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\n if not 0 <= i < len(mat):\n return 0\n if not 0 <= j < len(mat[0]):\n return 0\n \n if mat[i][j] == '0':\n return 0\n\n key = ('right', i, j)\n if key in cache:\n return cache[key]\n \n res = 1 + right(mat, i, j+1, cache)\n\n cache[key] = res\n return res\n\ndef down(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\n if not 0 <= i < len(mat):\n return 0\n if not 0 <= j < len(mat[0]):\n return 0\n \n if mat[i][j] == '0':\n return 0\n \n key = ('down', i, j)\n if key in cache:\n return cache[key]\n \n res = 1 + down(mat, i+1, j, cache)\n\n cache[key] = res\n return res\n\ndef largest(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\n if not 0 <= i < len(mat):\n return 0\n if not 0 <= j < len(mat[0]):\n return 0\n\n if mat[i][j] == '0':\n return 0\n \n key = ('largest', i, j)\n if key in cache:\n return cache[key]\n\n res = 1\n res += min(\n largest(mat, i+1, j+1, cache),\n min(\n right(mat, i, j+1, cache),\n down(mat, i+1, j, cache)\n )\n )\n\n cache[key] = res\n return res\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n best = 0\n cache = {}\n for i in range(len(matrix)):\n for j in range(len(matrix[i])):\n best = max(best, largest(matrix, i, j, cache) ** 2)\n return best\n\n'''\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"0\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"0\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"0\",\"0\",\"0\"]\n[\"0\",\"1\",\"1\",\"1\",\"1\",\"0\",\"0\",\"0\"]\n'''","runtime":"1115"},{"code":"'''\n\nBrute force solution:\n- Scan each position\n- Keep expanding the squares outwards...\n\nO(n^4) assuming a square input matrix.\n\nDP:\n- largest[i,j] =\n if mat[i][j] = 0\n 0\n else:\n res = 1\n expansion_width = min(largest[i+1, j+1], right[i+1, j], down[i, j+1])\n if expansion_width > 0:\n res = (expansion_width + 1) ** 2\n\n'''\n\ndef right(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\n if not 0 <= i < len(mat):\n return 0\n if not 0 <= j < len(mat[0]):\n return 0\n \n if mat[i][j] == '0':\n return 0\n\n key = (1, i, j)\n if key in cache:\n return cache[key]\n \n res = 1 + right(mat, i, j+1, cache)\n\n cache[key] = res\n return res\n\ndef down(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\n if not 0 <= i < len(mat):\n return 0\n if not 0 <= j < len(mat[0]):\n return 0\n \n if mat[i][j] == '0':\n return 0\n \n key = (2, i, j)\n if key in cache:\n return cache[key]\n \n res = 1 + down(mat, i+1, j, cache)\n\n cache[key] = res\n return res\n\ndef largest(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\n if not 0 <= i < len(mat):\n return 0\n if not 0 <= j < len(mat[0]):\n return 0\n\n if mat[i][j] == '0':\n return 0\n \n key = (0, i, j)\n if key in cache:\n return cache[key]\n\n res = 1\n res += min(\n largest(mat, i+1, j+1, cache),\n min(\n right(mat, i, j+1, cache),\n down(mat, i+1, j, cache)\n )\n )\n\n cache[key] = res\n return res\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n best = 0\n cache = {}\n for i in range(len(matrix)):\n for j in range(len(matrix[i])):\n best = max(best, largest(matrix, i, j, cache) ** 2)\n return best\n\n'''\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"0\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"0\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"0\",\"0\",\"0\"]\n[\"0\",\"1\",\"1\",\"1\",\"1\",\"0\",\"0\",\"0\"]\n'''","runtime":"1115"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n def check_matrix(i_min, i_max, j_min, j_max) -> bool:\n def check_row(row, j_min, j_max) -> bool:\n return all(row[j_min:j_max+1])\n return all(check_row(matrix[i], j_min, j_max) for i in range(i_min, i_max+1))\n\n m = len(matrix)\n n = len(matrix[0])\n for row in matrix:\n for j in range(n):\n row[j] = int(row[j])\n\n res = int(any(any(row) for row in matrix))\n if not res:\n return 0\n\n for i in range(m):\n if i + res >= m:\n break\n for j in range(n):\n if j + res >= n:\n break\n while check_matrix(i, i+res, j, j+res):\n res += 1\n if i + res == m or j + res == n:\n break\n\n return res**2","runtime":"1132"},{"code":"from collections import defaultdict\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n visited = defaultdict(int) # (x, y)\n def dfs(x, y):\n if x >= ROWS or y >= COLS:\n return 0\n if (x, y) in visited:\n return visited[(x, y)]\n \n down = dfs(x, y + 1)\n right = dfs(x + 1, y)\n bottom_right = dfs(x + 1, y + 1)\n \n print(ROWS)\n print(COLS)\n print((x, y))\n if matrix[x][y] == \"1\":\n visited[(x, y)] = min(down, right, bottom_right) + 1\n else:\n visited[(x, y)] = 0\n return visited[(x, y)]\n \n dfs(0, 0)\n answer = 0\n for key, value in visited.items():\n answer = max(value, answer)\n return answer * answer\n\n\n \n\n ","runtime":"1132"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n \n matrixSquare = [ [0 if r =='0' else 1 for r in c] for c in matrix] \n maximal = max([max(m) for m in matrixSquare] )\n print(maximal)\n for i in range(1, len(matrix)):\n for j in range(1, len(matrix[0])):\n dirs = [matrixSquare[i-1][j],matrixSquare[i][j-1], matrixSquare[i-1][j-1]]\n if min(dirs) > 0 and matrixSquare[i][j] == 1:\n matrixSquare[i][j] = min(dirs) + 1\n if matrixSquare[i][j] > maximal:\n maximal = matrixSquare[i][j]\n if max(dirs) > maximal:\n maximal = max(dirs)\n print(i, j, dirs, min(dirs), max(dirs), matrixSquare[i][j], maximal)\n \n print(matrixSquare)\n return maximal **2","runtime":"1150"},{"code":"import numpy as np\n\n\nclass Solution:\n def isInBounds(self, m, n, x, y):\n inbounds = 0 <= x < m and 0 <= y < n\n return inbounds\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n calc = np.zeros((m, n))\n largest_side = 0\n for i in range(m):\n for j in range(n):\n north = calc[i - 1][j] if self.isInBounds(m, n, i - 1, j) else 0\n west = calc[i][j - 1] if self.isInBounds(m, n, i, j - 1) else 0\n northwest = calc[i - 1][j - 1] if self.isInBounds(m, n, i - 1, j - 1) else 0\n val = 1 + min(north, west, northwest)\n calc[i][j] = val if int(matrix[i][j]) > 0 else 0\n largest_side = max(calc[i][j], largest_side)\n return int(largest_side ** 2)\n","runtime":"1150"},{"code":"import numpy as np\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n dp = np.zeros((m,n))\n for i in range(m):\n dp[i][0] = int(matrix[i][0])\n for j in range(n):\n dp[0][j] = int(matrix[0][j])\n res1 = np.max(dp[0, :])\n res2 = np.max(dp[:,0])\n res = max([res1, res2])\n for i in range(1, m):\n for j in range(1, n):\n if matrix[i][j]=='1':\n side2 = min([dp[i-1][j-1], dp[i][j-1], dp[i-1][j]])\n dp[i][j] = (np.sqrt(side2)+1)**2\n res = max(res, dp[i][j])\n \n return int(res)\n\n\n\n\n\n\n\n\n\n\n\n\n # m, n = len(matrix), len(matrix[0])\n # dp = [[0]*(n+1) for i in range(m+1)]\n # res = 0\n # for i in range(m):\n # for j in range(n):\n # if matrix[i][j]==\"1\":\n # dp[i+1][j+1]==1\n # dp[i+1][j+1] = (np.sqrt(min([dp[i][j],dp[i+1][j], dp[i][j+1] ]))+1)**2\n # res = max(res, dp[i+1][j+1])\n # #print(dp)\n # return int(res)\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 # for i in range(m):\n # for j in range(n):\n # if matrix[i][j]=='1':\n # dp[i+1][j+1] = (sqrt(min([dp[i][j], dp[i+1][j], dp[i][j+1]]))+1)**2\n # if dp[i+1][j+1]>res:\n # res = dp[i+1][j+1]\n # return int(res)\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 # m1 = np.zeros((m, n), dtype=int)\n # res = 0\n # for i in range(m):\n # m1[i][0] = int(matrix[i][0])\n # res = max(res, m1[i][0])\n # for j in range(n):\n # m1[0][j] = int(matrix[0][j])\n # res = max(res, m1[0][j])\n # #print(res)\n # for i in range(1, m):\n # for j in range(1, n):\n # if int(matrix[i][j]) == 1:\n # res1 = min([m1[i][j-1], m1[i-1][j-1], m1[i-1][j]]) + 1\n # m1[i][j] = res1\n # res = max(res, res1)\n # print(m1)\n # return res*res\n","runtime":"1168"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n matrix[i][j] = int(matrix[i][j])\n\n for i in range(len(matrix) - 1):\n for j in range(len(matrix[0])):\n if matrix[i][j] > 0 and matrix[i + 1][j] > 0:\n matrix[i + 1][j] += matrix[i][j]\n \n print(matrix)\n\n maxSq = 0\n for sq in range(1, min(len(matrix), len(matrix[0])) + 1):\n if sq > maxSq + 1:\n break\n\n for row in matrix:\n count = 0\n for x in row:\n if x < sq:\n count = 0\n else:\n count += 1\n if count == sq:\n maxSq = sq\n break\n \n return maxSq ** 2","runtime":"1185"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n ans = 0\n rows = len(matrix)\n cols = len(matrix[0])\n \n @cache\n def dfs(row, col):\n if row >= len(matrix) or col >= len(matrix[0]) or matrix[row][col] == \"0\":\n return 0\n\n\n print(row, col, matrix[row][col], \"before\")\n\n # explore for each its down right and diag side\n down = dfs(row+1, col)\n right = dfs(row, col+1)\n diag = dfs(row+1, col+1)\n\n print(row, col, matrix[row][col], \"after\")\n\n # beacuse we will have cases where some sides are greater\n # getting the min \n return min(down, right, diag) + 1\n\n res = float(\"-inf\")\n\n for i in range(rows):\n for j in range(cols):\n if matrix[i][j] == '1':\n val = dfs(i,j)\n res = max(res, val)\n\n if res > 0:\n return res ** 2\n \n return 0\n \n","runtime":"1185"},{"code":"class Solution:\n\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n self.matrix = matrix\n self.square_cache = {}\n self.hor_cache = {}\n self.ver_cache = {}\n\n output = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n curr = self.maximalSquareEndingAt(i, j)\n if curr > output:\n output = curr\n return output**2\n\n @lru_cache\n def maximalSquareEndingAt(self, i, j):\n cache = self.square_cache\n matrix = self.matrix\n # print(cache)\n if (i, j) in cache:\n return cache[(i, j)]\n\n if i < 0 or j < 0:\n return 0\n val = matrix[i][j]\n if val == \"0\":\n return 0\n \n maximalSquareNeighbor = self.maximalSquareEndingAt(i-1, j-1)\n longestHorizontalLeft = self.longestHorizontalEndingAt(i, j-1)\n longestVerticalAbove = self.longestVerticalEndingAt(i-1, j)\n output = 1 + min(\n maximalSquareNeighbor,\n longestHorizontalLeft,\n longestVerticalAbove,\n )\n cache[(i, j)] = output\n return output \n\n @lru_cache\n def longestHorizontalEndingAt(self, i, j):\n cache = self.hor_cache\n matrix = self.matrix\n if (i, j) in cache:\n return cache[(i, j)]\n if j < 0:\n return 0\n val = matrix[i][j]\n if val == \"0\":\n return 0\n \n output = 1 + self.longestHorizontalEndingAt(i, j-1)\n cache[(i, j)] = output\n return output\n\n @lru_cache\n def longestVerticalEndingAt(self, i, j):\n cache = self.ver_cache\n matrix = self.matrix\n if (i, j) in cache:\n return cache[(i, j)]\n if i < 0:\n return 0\n val = matrix[i][j]\n if val == \"0\":\n return 0\n \n output = 1 + self.longestVerticalEndingAt(i-1, j)\n cache[(i, j)] = output\n return output\n","runtime":"1203"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n num_1s = [[0 for _ in range(len(matrix[0]))] for _ in range(len(matrix))]\n for i in range(len(matrix)):\n row_1s = 0\n for j in range(len(matrix[0])):\n row_1s += int(matrix[i][j])\n col_1s = num_1s[i - 1][j] if i >= 0 else 0\n num_1s[i][j] = row_1s + col_1s\n max_square = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n lo = 0\n hi = min(len(matrix), len(matrix[0])) + 1\n while lo < hi:\n mid = lo + (hi - lo) // 2\n works = False\n if mid != 0:\n left_ones = num_1s[i][j - mid] if j - mid >= 0 else 0\n top_ones = num_1s[i - mid][j] if i - mid >= 0 else 0\n overlap_ones = num_1s[i - mid][j - mid] if i - mid >= 0 and j - mid >= 0 else 0\n cur_num_ones = num_1s[i][j] - left_ones - top_ones + overlap_ones\n works = cur_num_ones == mid * mid\n else:\n lo = 1\n hi = 1\n break\n if works:\n lo = mid + 1\n else:\n hi = mid\n\n max_square = max(max_square, (lo - 1) * (lo - 1))\n return max_square\n \n\n","runtime":"1220"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0]) \n maxi = 0\n dp = {}\n def recurr(i, j):\n nonlocal maxi\n if i >= m or j >= n:\n return 0\n if (i, j) not in dp.keys():\n right = recurr(i, j + 1)\n bottom_right = recurr(i + 1, j + 1)\n bottom = recurr(i + 1, j)\n if matrix[i][j] == '0':\n return 0\n mini = min(right, bottom_right, bottom) + 1 \n dp[(i, j)] = mini\n maxi = max(maxi, mini)\n return dp[(i, j)]\n recurr(0,0)\n return maxi ** 2","runtime":"1220"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n return topDown(matrix)\n \n\ndef topDown(matrix):\n \"\"\"\n max size of a square starting at i,j is\n 0 if matrix[i][j] is zero else\n 1 + min( max size of a square starting at its right,bottom,bottom-right neighbors)\n \"\"\"\n\n # Rows\n m = len(matrix)\n # Cols\n n = len(matrix[0])\n\n # record the max square size starting at i,j and exapnding to right and bottom\n memo = {}\n\n valid = lambda x,y: x >= 0 and x < m and y >= 0 and y < n\n\n def dp(i, j):\n \n if (i, j) in memo:\n return memo[(i, j)]\n\n # If this location is invalid ie doesn't exist on the grid return 0 as this\n # can never give a square\n if not valid(i, j):\n return 0\n \n cur_val = matrix[i][j]\n # A square cannot start at zero so size of max square for this loc is 0\n if cur_val == \"0\":\n memo[(i, j)] = 0 \n else:\n neighbors = [\n (i+1, j), # bottom\n (i, j+1), # right\n (i+1, j+1) # bottom right\n ]\n # Size of max square that can start at this location is nothing but\n # the minimum of size of max squares that start at its neigbhors + 1\n memo[(i, j)] = 1 + min( \n [dp(x, y) for x,y in neighbors]\n )\n print(f\"i: {i}, j: {j}, size: {memo[(i, j)]}\")\n return memo[(i, j)]\n\n max_square = 0\n for i in range(m):\n for j in range(n):\n max_square = max(max_square, dp(i, j))\n return max_square**2\n\n\n \n \n ","runtime":"1238"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n if not matrix:\n return 0\n rows, cols = len(matrix), len(matrix[0])\n max_size = 0\n\n memo = {}\n\n def dp(r: int, c: int) -> int:\n nonlocal max_size\n if r > rows - 1 or c > cols - 1:\n return 0\n if r == rows - 1 or c == cols - 1:\n memo[(r, c)] = int(matrix[r][c])\n dp(r, c + 1)\n dp(r + 1, c)\n dp(r + 1, c + 1)\n max_size = max(max_size, memo[(r, c)])\n return memo[(r, c)]\n if (r, c) in memo:\n return memo[(r, c)]\n max_square_here = int(matrix[r][c]) + min(\n dp(r, c + 1), dp(r + 1, c), dp(r + 1, c + 1)\n )\n if matrix[r][c] == \"0\":\n max_square_here = 0\n\n memo[(r, c)] = max_square_here\n max_size = max(max_size, memo[(r, c)])\n return memo[(r, c)]\n\n dp(0, 0)\n return max_size * max_size","runtime":"1255"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n \n m = len(matrix)\n n = len(matrix[0])\n\n prev_ends = set()\n ends = {(i, j) for i in range(m) for j in range(n) if matrix[i][j] == \"1\"}\n\n k = 1\n while ends:\n prev_ends = ends\n ends = {(i, j) for (i, j) in ends if {(i - k, j), (i, j - k), (i - k, j - k)} <= ends}\n k *= 2\n \n k //= 2\n\n if k == 0:\n return 0\n\n ends = prev_ends\n while ends:\n ends = {(i, j) for (i, j) in ends if {(i - 1, j), (i, j - 1), (i - 1, j - 1)} <= ends}\n k += 1\n\n k -= 1\n\n return k * k\n\n\n\n\n \n \n \n \n \n ","runtime":"1255"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n result = 0\n \n for i in range(m):\n for j in range(n):\n if matrix[i][j] == '1':\n #print('i, j {} {}'.format(i,j))\n temp = 1\n max_len = min(m - i, n - j)\n if (max_len) ** 2 <= result:\n break\n for k in range(1, max_len):\n #print(' k {}'.format(k))\n valid = True\n for t in range(0, k+1):\n if matrix[i+k][j+t] == '0':\n valid = False\n break\n if matrix[i+t][j+k] == '0':\n valid = False\n break \n\n #print(' valid {}'.format(valid))\n if valid:\n temp = (k + 1) ** 2\n else:\n break\n if temp > result:\n result = temp\n return result","runtime":"1273"},{"code":"class Solution:\n def isExtendSquare(self, ur, bl):\n x1 , y1 = ur\n x2 , y2 = bl\n for i in range(x1, x2+1):\n if self._matrix[i][y1] != '1':\n return False\n for j in range(y2, y1):\n if self._matrix[x2][j] != '1':\n return False\n return True\n\n def isSquare(self, c, ur, bl)-> bool:\n x0, y0 = c\n x1, y1 = ur\n x2, y2 = bl\n for i in range(x2, x0-1,-1):\n for j in range(y1, y0-1, -1):\n if self._matrix[i][j] != '1':\n return False\n return True\n \n def findmax(self):\n for i in range(self._m-1):\n \n for j in range(self._n-1):\n if self._matrix[i][j] == '1': \n if self._ms == 0: \n self._ms = 1\n p = self._ms \n c = [i,j]\n ur = [i, j+p]\n bl = [i+p,j]\n if ur[1] >= self._n or bl[0] >= self._m:\n break\n \n if self.isSquare(c, ur, bl):\n self._ms = p+1\n while True:\n ur[1] += 1\n bl[0] += 1\n if ur[1] >= self._n or bl[0] >= self._m:\n break\n if self.isExtendSquare(ur, bl):\n self._ms += 1\n else:\n break\n \n \n \n \n\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n self._matrix = matrix\n self._m = len(matrix)\n self._n = len(matrix[0])\n self._ms = 0\n if self._m == 1:\n if '1' in matrix[0]:\n return 1\n else:\n return 0\n if self._n == 1:\n if '1' in [matrix[i][0] for i in range(self._m)]:\n return 1\n else:\n return 0\n \n self.findmax()\n if self._ms == 0:\n if '1' in [self._matrix[i][j] for i in range(self._m) for j in range(self._n)]:\n return 1\n else:\n return 0\n return self._ms**2\n \n ","runtime":"1291"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n\n max_len = 0\n for row in range(m):\n for col in range(n):\n max_potential = min(n - col, m - row)\n if max_potential <= max_len:\n break\n level = 0\n failure = False\n while not failure and level < max_potential:\n for j in range(level + 1):\n if matrix[row + level][col + j] == \"0\" or matrix[row + j][col + level] == \"0\":\n failure = True\n break\n\n if not failure:\n level += 1\n\n max_len = max(max_len, level)\n\n\n return max_len * max_len","runtime":"1291"},{"code":"import numpy as np\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n prefixs = np.zeros((rows+1, cols+1), dtype=int)\n for r in range(1, rows+1):\n for c in range(1, cols+1):\n #print(r,c)\n val = 0 if matrix[r-1][c-1] == '0' else 1\n prefixs[r][c] = prefixs[r-1][c] + prefixs[r][c-1] - prefixs[r-1][c-1] + val\n #print(prefixs)\n\n def contains_square(size: int) -> bool:\n assert 0 <= size <= min(rows, cols)+1, f\"assert 0 <= {size} <= min({rows}, {cols})\"\n max_coverage = size * size\n for (r, c) in product(range(1,rows-size+2), range(1,cols-size+2)):\n #print(r, c)\n coverage = prefixs[r+size-1][c+size-1] - prefixs[r-1][c+size-1] - prefixs[r+size-1][c-1] + prefixs[r-1][c-1]\n #print(f\"r={r}, c={c}, size={size}, coverage={coverage}\")\n if coverage == max_coverage:\n #print(r, c)\n return True\n return False\n \n lo, hi = 0, min(rows, cols)\n while lo < hi:\n mid = lo + (hi - lo + 1) // 2\n #print(f\"lo={lo}, mid={mid}, hi={hi}\")\n if contains_square(mid):\n #print(f\"lo = {mid}\")\n lo = mid\n else:\n #print(f\"hi = {mid-1}\")\n hi = mid - 1\n #print(f\"res={mid}\")\n \n return lo * lo\n\n\n","runtime":"1308"},{"code":"class Solution:\n def isExtendSquare(self, ur, bl):\n x1 , y1 = ur\n x2 , y2 = bl\n for i in range(x1, x2+1):\n if self._matrix[i][y1] != '1':\n return False\n for j in range(y2, y1):\n if self._matrix[x2][j] != '1':\n return False\n return True\n\n def isSquare(self, c, ur, bl)-> bool:\n x0, y0 = c\n x1, y1 = ur\n x2, y2 = bl\n for i in range(x2, x0-1,-1):\n for j in range(y1, y0-1, -1):\n if self._matrix[i][j] != '1':\n return False\n return True\n \n def findmax(self):\n for i in range(self._m-1):\n \n for j in range(self._n-1):\n if self._matrix[i][j] == '1': \n if self._ms == 0: \n self._ms = 1\n p = self._ms \n c = [i,j]\n ur = [i, j+p]\n bl = [i+p,j]\n if ur[1] >= self._n or bl[0] >= self._m:\n break\n \n if self.isSquare(c, ur, bl):\n self._ms = p+1\n while True:\n ur[1] += 1\n bl[0] += 1\n if ur[1] >= self._n or bl[0] >= self._m:\n break\n if self.isExtendSquare(ur, bl):\n self._ms += 1\n else:\n break\n \n \n \n \n\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n self._matrix = matrix\n self._m = len(matrix)\n self._n = len(matrix[0])\n self._ms = 0\n if self._m == 1:\n if '1' in matrix[0]:\n return 1\n else:\n return 0\n if self._n == 1:\n if '1' in [matrix[i][0] for i in range(self._m)]:\n return 1\n else:\n return 0\n \n self.findmax()\n if self._ms == 0:\n if '1' in [self._matrix[i][j] for i in range(self._m) for j in range(self._n)]:\n return 1\n else:\n return 0\n return self._ms**2\n \n ","runtime":"1308"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n \n \n # 568ms, 19.4mb\n \n \n \n # for i in range(len(matrix)-1, -1, -1):\n # for j in range(len(matrix[0])-1, -1, -1):\n # matrix[i][j] = int(matrix[i][j])\n # if i+1 == len(matrix) or j+1 == len(matrix[0]):\n #continue\n # if matrix[i][j] == 1:\n # matrix[i][j] = min(matrix[i][j+1], matrix[i+1][j], matrix[i+1][j+1]) + 1\n \n \n \n \n # biggest_square = 0\n # print(biggest_square)\n # for i in range(len(matrix)):\n # for j in range(len(matrix[0])):\n # biggest_square = max(biggest_square, matrix[i][j])\n \n # return biggest_square ** 2\n \n\n #neet code solution: from up left reaching bottom right in rec way\n \n memo = {}\n def rec(i, j):\n # best cases\n if i > len(matrix)-1 or j > len(matrix[0])-1:\n return 0\n \n if (i,j) in memo:\n return memo[(i,j)]\n \n right = rec(i, j+1)\n down = rec(i+1, j)\n diag = rec(i+1, j+1)\n \n if matrix[i][j] == '1':\n \n memo[(i, j)] = min(diag, right, down) + 1\n return memo[(i,j)]\n \n return 0\n \n rec(0, 0)\n return max(memo.values()) ** 2 if len(memo) > 0 else 0","runtime":"1326"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n \n ROWS, COLS = len(matrix), len(matrix[0])\n res = [0]\n \n def getSquare(r, c, size):\n\n rEdge = r + size - 1\n cEdge = c + size - 1\n \n if (rEdge == ROWS or cEdge == COLS):\n return\n\n for i in range(size):\n if matrix[r + i][cEdge] != \"1\":\n return\n if matrix[rEdge][c + i] != \"1\":\n return\n \n res[0] = max(res[0], size)\n getSquare(r, c, size + 1) # Recursive call\n\n for r in range(ROWS):\n for c in range(COLS):\n if min(ROWS - r, COLS - c) > res[0]:\n getSquare(r, c, 1)\n\n return res[0] * res[0]","runtime":"1326"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n maxRect = {}\n def _maxSquares(ind):\n if ind[0] > len(matrix)-1:\n maxRect[ind] = 0#matrix[ind[0]][ind[1]]\n return 0\n if ind[1] > len(matrix[0])-1:\n maxRect[ind] = 0#matrix[ind[0]][ind[1]]\n return 0\n if matrix[ind[0]][ind[1]] == \"0\":\n maxRect[ind] = 0\n return 0\n if ind in maxRect:\n return maxRect[ind]\n na = _maxSquares((ind[0], ind[1]+1))\n nb = _maxSquares((ind[0]+1, ind[1]))\n nc = _maxSquares((ind[0]+1, ind[1]+1))\n print(ind)\n print(na, nb, nc)\n maxRect[ind] = 1 + min(na, nb, nc)\n return maxRect[ind]\n print(maxRect)\n james = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n james = max(james, _maxSquares((i,j)))\n\n print(maxRect)\n return james**2\n","runtime":"1343"},{"code":"class Solution:\n \"to katw dexia kanei define\"\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n res = [[0 for _ in range(n)] for _ in range(m)]\n test = [[[0,0] for _ in range(n)] for _ in range(m)]\n \n for row in range(m):\n for col in range(n):\n matrix[row][col] = int(matrix[row][col])\n for col in range(1, n):\n test[0][col][0] = (1+test[0][col-1][0]) * matrix[0][col-1]\n for row in range(1, m):\n test[row][0][1] = (1+test[row-1][0][1]) * matrix[row-1][0]\n for row in range(1, m):\n for col in range(1, n):\n test[row][col][0] = (1+test[row][col-1][0]) * matrix[row][col-1]\n test[row][col][1] = (1+test[row-1][col][1]) * matrix[row-1][col]\n \n for row in range(m):\n for col in range(n):\n res[row][col] = int(matrix[row][col])\n for size in reversed(range(2, min(row+2, col+2))):\n if matrix[row][col] == 1 and res[row-1][col-1] >= size-1 and min(test[row][col]) >= size-1: \n res[row][col] = size\n break\n \n max_size = max([max(i) for i in res])\n return max_size**2\n\n\n\n","runtime":"1361"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m,n = len(matrix),len(matrix[0])\n square = [[0 for j in range(n)] for i in range(m)]\n ans = 0\n for i in range(m):\n for j in range(n):\n if matrix[i][j]==\"1\":\n if i==0 or j==0:\n square[i][j] = 1\n else:\n square[i][j] = min(square[i-1][j],square[i][j-1],square[i-1][j-1])+1\n ans = max(ans,max(square[i]))\n return ans*ans","runtime":"1361"},{"code":"from functools import cache\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n def check_matrix(i_min, i_max, j_min, j_max) -> bool:\n @cache\n def check_row(i, j_min, j_max) -> bool:\n return all(matrix[i][j_min:j_max+1])\n return all(check_row(i, j_min, j_max) for i in range(i_min, i_max+1))\n\n m = len(matrix)\n n = len(matrix[0])\n for row in matrix:\n for j in range(n):\n row[j] = int(row[j])\n\n res = int(any(any(row) for row in matrix))\n if not res:\n return 0\n\n for i in range(m):\n if i + res >= m:\n break\n for j in range(n):\n if j + res >= n:\n break\n while check_matrix(i, i+res, j, j+res):\n res += 1\n if i + res == m or j + res == n:\n break\n\n return res**2","runtime":"1378"},{"code":"class Solution:\n def isExtendSquare(self, ur, bl):\n x1 , y1 = ur\n x2 , y2 = bl\n for i in range(x1, x2+1):\n if self._matrix[i][y1] != '1':\n return False\n for j in range(y2, y1):\n if self._matrix[x2][j] != '1':\n return False\n return True\n\n def isSquare(self, c, ur, bl)-> bool:\n x0, y0 = c\n x1, y1 = ur\n x2, y2 = bl\n for i in range(x0, x2+1):\n for j in range(y0, y1+1):\n if self._matrix[i][j] != '1':\n return False\n return True\n for s in range(x1+1, x2+1):\n # print(\"___\",(s, y1))\n if self._matrix[s][y1] != '1':\n return False\n for t in range(y2+1, y1):\n # print(\"___\",(x2, t))\n if self._matrix[x2][t] != '1':\n return False\n return True\n\n def findmax(self):\n for i in range(self._m-1):\n \n for j in range(self._n-1):\n if self._matrix[i][j] == '1': \n if self._ms == 0:\n \n self._ms = 1\n p = self._ms \n c = [i,j]\n ur = [i, j+p]\n bl = [i+p,j]\n if ur[1] >= self._n or bl[0] >= self._m:\n break\n \n if self.isSquare(c, ur, bl):\n self._ms = p+1\n while True:\n ur[1] += 1\n bl[0] += 1\n if ur[1] >= self._n or bl[0] >= self._m:\n break\n if self.isExtendSquare(ur, bl):\n self._ms += 1\n else:\n break\n \n \n \n \n\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n self._matrix = matrix\n self._m = len(matrix)\n self._n = len(matrix[0])\n self._ms = 0\n if self._m == 1:\n if '1' in matrix[0]:\n return 1\n else:\n return 0\n if self._n == 1:\n if '1' in [matrix[i][0] for i in range(self._m)]:\n return 1\n else:\n return 0\n \n self.findmax()\n if self._ms == 0:\n if '1' in [self._matrix[i][j] for i in range(self._m) for j in range(self._n)]:\n return 1\n else:\n return 0\n return self._ms**2\n \n ","runtime":"1378"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n #dp m x n table\n #if conditions met (not all 0's put area)\n m = len(matrix)\n n = len(matrix[0])\n dp = [[0]*n for _ in range(m)]\n maxLen = 0\n dp[0][0] = int(matrix[0][0])\n maxLen = max(dp[0][0],maxLen)\n for i in range(1,m):\n dp[i][0] = int(matrix[i][0])\n maxLen = max(dp[i][0],maxLen)\n for j in range(1,n):\n dp[0][j] = int(matrix[0][j])\n maxLen = max(dp[0][j],maxLen)\n \n for i in range(1,m):\n for j in range(1,n):\n # if i==3 and j == 2:\n # for k in range(0,m):\n # print(dp[k])\n # print('------------------')\n if matrix[i][j]==\"1\" and dp[i-1][j-1]>0 and dp[i-1][j]>0 and dp[i][j-1]>0:\n \n s = dp[i-1][j-1]\n bi = i -s\n bj = j -s\n for ci in range(i-s,i):\n if dp[ci][j]==0:\n bi = ci+1\n \n for cj in range(j-s,j):\n if dp[i][cj]==0:\n bj = cj+1\n val = min(i-bi, j -bj)+1\n dp[i][j] = val\n else:\n dp[i][j] = int(matrix[i][j])\n maxLen = max(dp[i][j],maxLen)\n # for k in range(m):\n # print (matrix[k])\n # for k in range(m):\n # print (dp[k])\n return maxLen**2\n ","runtime":"1396"},{"code":"import numpy as np\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n\n matrix_int = []\n for x in matrix:\n matrix_int.append([int(y) for y in x]) \n\n matrix_int = np.array(matrix_int)\n\n print(matrix_int)\n\n cmsl = 0\n\n for start_x in range(matrix_int.shape[0]):\n for start_y in range(matrix_int.shape[1]):\n\n for sl in range(cmsl, min(matrix_int.shape[0]-start_x+1, matrix_int.shape[1]-start_y+1)):\n\n\n square = matrix_int[start_x:start_x+sl, start_y:start_y+sl]\n\n if np.all(square == 1):\n cmsl = square.shape[0]\n else:\n break\n\n print(cmsl)\n\n return cmsl**2\n \n\n\n","runtime":"1414"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n if len(matrix) == 1 or len(matrix[0]) == 1:\n return self.one(matrix)\n table = [[0 for i in range(len(matrix[0]))] for _ in range(len(matrix))]\n def dfs(r,c):\n if r >= (len(matrix)-1) or c >= (len(matrix[0])-1):\n table[r][c] = int(matrix[r][c])\n return\n if table[r][c] == 0:\n dfs(r+1,c)\n dfs(r,c+1)\n dfs(r+1,c+1)\n if matrix[r][c] == '1':\n table[r][c] = min(table[r+1][c], table[r][c+1], table[r+1][c+1]) + 1\n dfs(0,0)\n res = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n res = max(res, int(table[i][j]))\n return res*res\n\n def one(self,list_of_lists):\n for i in range(len(list_of_lists)):\n if '1' in list_of_lists[i]:\n return 1\n return 0","runtime":"1431"}],"string":"[\n {\n \"code\": \"\\ndef maximalSquare(matrix):\\n bits = [int(''.join(row), 2) for row in matrix]\\n w = 0\\n while bits and any(bits):\\n w += 1\\n bits = [a & b for a, b in itertools.pairwise(b & (b << 1) for b in bits)]\\n return w * w\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f\\\"{maximalSquare(case)}\\\\n\\\")\\n exit(0)\\n \\n \\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"\\ndef maximalSquare(matrix):\\n bits = [int(''.join(row), 2) for row in matrix]\\n w = 0\\n while bits and any(bits):\\n w += 1\\n bits = [a & b for a, b in pairwise(b & (b << 1) for b in bits)]\\n return w * w\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f\\\"{maximalSquare(case)}\\\\n\\\")\\n exit(0)\\n \\n \\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits=[int(''.join(row),2) for row in matrix]\\n w=0\\n while bits and any(bits):\\n w+=1\\n bits=[b&(b<<1) for b in bits]\\n bits2=[]\\n for i in range(len(bits)-1):\\n bits2.append(bits[i]&bits[i+1])\\n bits=bits2\\n return w**2\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits=[int(''.join(row),2) for row in matrix]\\n w=0\\n while bits and any(bits):\\n w+=1\\n bits=[b&(b<<1) for b in bits]\\n bits2=[]\\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\\n bits=bits2\\n return w*w\\n\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix),len(matrix[0])\\n largest = 0\\n for j in range(n):\\n if matrix[0][j] == '1':\\n matrix[0][j] = 1\\n largest = 1\\n else:\\n matrix[0][j] = 0\\n for i in range(1,m):\\n count = 0\\n inc = False\\n for j in range(n):\\n matrix[i][j] = matrix[i-1][j] + 1 if matrix[i][j] == '1' else 0\\n if matrix[i][j] < largest+1:\\n count = 0\\n else:\\n count += 1\\n if count == largest+1:\\n inc = True\\n if inc:\\n largest += 1\\n return largest*largest\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"import itertools\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits = [int(''.join(row), 2) for row in matrix]\\n w = 0\\n while bits and any(bits):\\n w += 1\\n bits = [a & b for a, b in itertools.pairwise(b & (b << 1) for b in bits)]\\n return w * w\",\n \"runtime\": \"131\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits=[int(''.join(row),2) for row in matrix]\\n w=0\\n while bits and any(bits):\\n w+=1\\n bits=[b&(b<<1) for b in bits]\\n bits2=[]\\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\\n bits=bits2\\n return w*w\\n\",\n \"runtime\": \"148\"\n },\n {\n \"code\": \"import itertools\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits = [int(''.join(row), 2) for row in matrix]\\n w = 0\\n while bits and any(bits):\\n w += 1\\n bits = [a & b for a, b in itertools.pairwise(b & (b << 1) for b in bits)]\\n return w * w\",\n \"runtime\": \"166\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits=[int(''.join(row),2) for row in matrix]\\n w=0\\n while bits and any(bits):\\n w+=1\\n bits=[b&(b<<1) for b in bits]\\n bits2=[]\\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\\n bits=bits2\\n return w*w\",\n \"runtime\": \"183\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits=[int(''.join(row),2) for row in matrix]\\n m1 = len(bits)\\n w=0\\n while any(bits):\\n w+=1\\n bits=[b&(b<<1) for b in bits]\\n m1 -= 1\\n bits = [bits[i]&bits[i+1] for i in range(m1)]\\n \\n return w*w\",\n \"runtime\": \"201\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits=[int(''.join(row),2) for row in matrix]\\n w=0\\n while bits and any(bits):\\n w+=1\\n bits=[b&(b<<1) for b in bits]\\n bits2=[]\\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\\n bits=bits2\\n return w*w\\n\",\n \"runtime\": \"218\"\n },\n {\n \"code\": \"import itertools\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits = [int(''.join(row), 2) for row in matrix]\\n w = 0\\n while bits and any(bits):\\n w += 1\\n bits = [a & b for a, b in itertools.pairwise(b & (b << 1) for b in bits)]\\n return w * w \\n \\n \\n \",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits=[int(''.join(row),2) for row in matrix]\\n w=0\\n while bits and any(bits):\\n w+=1\\n bits=[b&(b<<1) for b in bits]\\n bits2=[]\\n for i in range(len(bits)-1):\\n bits2.append(bits[i]&bits[i+1])\\n bits=bits2\\n return w**2\\n\",\n \"runtime\": \"254\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits=[int(''.join(row),2) for row in matrix]\\n w=0\\n while bits and any(bits):\\n w+=1\\n bits=[b&(b<<1) for b in bits]\\n bits2=[]\\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\\n bits=bits2\\n return w*w\",\n \"runtime\": \"271\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits=[int(''.join(row),2) for row in matrix]\\n w=0\\n while bits and any(bits):\\n w+=1\\n bits=[b&(b<<1) for b in bits]\\n bits2=[]\\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\\n bits=bits2\\n return w*w\",\n \"runtime\": \"289\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits=[int(''.join(row),2) for row in matrix]\\n w=0\\n while bits and any(bits):\\n w+=1\\n bits=[b&(b<<1) for b in bits]\\n bits2=[]\\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\\n bits=bits2\\n return w*w\\n\",\n \"runtime\": \"306\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits=[int(''.join(row),2) for row in matrix]\\n # return bits\\n w=0\\n while bits and any(bits):\\n w+=1\\n bits=[b&(b<<1) for b in bits]\\n # return bits\\n bits2=[]\\n for i in range(len(bits)-1):\\n bits2.append(bits[i]&bits[i+1])\\n # return bits2\\n bits=bits2\\n return w**2\\n\",\n \"runtime\": \"306\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits=[int(''.join(row),2) for row in matrix]\\n # return bits\\n w=0\\n while bits and any(bits):\\n w+=1\\n bits=[b&(b<<1) for b in bits]\\n # return bits\\n bits2=[]\\n for i in range(len(bits)-1):\\n bits2.append(bits[i]&bits[i+1])\\n bits=bits2\\n return w**2\\n\",\n \"runtime\": \"324\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits=[int(''.join(row),2) for row in matrix]\\n w=0\\n while bits and any(bits):\\n w+=1\\n bits=[b&(b<<1) for b in bits]\\n bits2=[]\\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\\n bits=bits2\\n return w*w\\n\",\n \"runtime\": \"341\"\n },\n {\n \"code\": \"import itertools\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits = [int(''.join(row), 2) for row in matrix]\\n w = 0\\n while bits and any(bits):\\n w += 1\\n bits = [a & b for a, b in itertools.pairwise(b & (b << 1) for b in bits)]\\n return w * w\\n\",\n \"runtime\": \"359\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n #matrix = [[\\\"1\\\"] * 6 for _ in range(6)]\\n # Testing random code\\n bits = [int(''.join(row), 2) for row in matrix]\\n print(f\\\"{bits}\\\")\\n w = 0\\n while bits and any(bits):\\n w += 1\\n bits = [a & b for a, b in itertools.pairwise(b & (b << 1) for b in bits)]\\n print(f\\\"{bits = }\\\")\\n return w * w\\n\\n '''\\n r = len(matrix)\\n c = len(matrix[0])\\n max_len = 0\\n dp = [[0 for _ in range(c+1)] for _ in range(r+1)]\\n\\n for i in range(1, r+1):\\n for j in range(1, c+1):\\n if matrix[i-1][j-1] == \\\"1\\\":\\n dp[i][j] = min(dp[i-1][j-1], min(dp[i-1][j], dp[i][j-1])) + 1\\n max_len = max(max_len, dp[i][j])\\n \\n return max_len * max_len\\n '''\",\n \"runtime\": \"377\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n bits=[int(''.join(row),2) for row in matrix]\\n w=0\\n while bits and any(bits):\\n w+=1\\n bits=[b&(b<<1) for b in bits]\\n bits2=[]\\n for i in range(len(bits)-1):bits2.append(bits[i]&bits[i+1])\\n bits=bits2\\n return w*w\\n\",\n \"runtime\": \"394\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n previous_row = [int(s) for s in matrix[0]]\\n ans = max(previous_row)\\n\\n for i in range(1, len(matrix)):\\n cur_row = [0]*len(matrix[0])\\n cur_row[0] = int(matrix[i][0])\\n\\n for j in range(1, len(matrix[0])):\\n if matrix[i][j] != \\\"0\\\":\\n cur_row[j] = 1 + min(cur_row[j-1], previous_row[j], previous_row[j-1])\\n ans = max(ans, max(cur_row))\\n previous_row = cur_row\\n return ans * ans\\n \",\n \"runtime\": \"412\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n ROWS, COLS = len(matrix), len(matrix[0])\\n res = 0\\n dp = [0]*(COLS+1)\\n\\n for r in range(ROWS-1,-1,-1):\\n new_dp = [0]*(COLS+1)\\n for c in range(COLS-1,-1,-1):\\n if matrix[r][c]==\\\"1\\\":\\n new_dp[c] = 1 + min(\\n new_dp[c+1], #right\\n dp[c+1], #diag\\n dp[c], #down\\n )\\n res = max(res, max(new_dp))\\n dp = new_dp\\n return res*res\",\n \"runtime\": \"429\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n grid = matrix\\n ROWS, COLS = len(grid), len(grid[0])\\n cache = [[0]*COLS for _ in range(ROWS)]\\n\\n def identifyMaxSide(row, prevMax):\\n target = 1 + prevMax\\n streak = 0\\n for c in range(len(row)):\\n # print(streak)\\n if int(row[c]) >= target:\\n streak += 1\\n if streak == target: return target\\n else: \\n streak = 0\\n return 0 # target not found\\n # initialize first row in cache\\n for c in range(COLS):\\n if grid[0][c] == '1':\\n cache[0][c] = 1\\n\\t\\n\\n for r in range(1, ROWS):\\n for c in range(COLS):\\n if grid[r][c] == '1':\\n cache[r][c] = 1 + cache[r-1][c]\\n\\t\\n maxSide = 0 # keeps track side length of max area square\\n for r in range(ROWS):\\n maxSide = max(maxSide, identifyMaxSide(cache[r], maxSide))\\n print(cache)\\n return maxSide**2\\n\\t\\n\\n\",\n \"runtime\": \"447\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m,n = len(matrix), len(matrix[0])\\n if m==1:\\n for i in matrix[0]:\\n if i == '1':\\n return 1\\n return 0\\n if n==1:\\n for i in range(m):\\n if matrix[i][0] == '1':\\n return 1\\n return 0 \\n\\n dp1 =[int(i) for i in matrix[0]]\\n dp2 = matrix[1]\\n ans =max(dp1)\\n print(dp1)\\n for i in range(1,m):\\n dp2[0] = int(matrix[i][0])\\n \\n for j in range(1,n):\\n dp2[j] = min([dp2[j-1],dp1[j-1],dp1[j]])+1 if matrix[i][j]=='1' else 0 \\n\\n dp1=dp2[:]\\n \\n\\n ans=max(dp1+[ans])\\n return ans**2\\n \\n \",\n \"runtime\": \"465\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n dp = [0] * (cols + 1)\\n prev= 0\\n maxsqlen = 0\\n\\n for i in range(1, rows + 1):\\n for j in range(1, cols + 1):\\n tmp = dp[j]\\n if matrix[i - 1][j - 1] == '1':\\n dp[j] = min(dp[j - 1], prev, dp[j]) + 1\\n maxsqlen = max(maxsqlen, dp[j])\\n else:\\n dp[j] = 0\\n prev = tmp\\n \\n\\n return maxsqlen * maxsqlen\\n\",\n \"runtime\": \"517\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n # # BRUTE FORCE O(mn**2)\\n # # I'll find out every possible square of 1 by continuing traversal of the matrix from the element next to the initial 1 found. more detailed, i'll make a variable for the size of the largest square found so far and size of the current. both are initially 0.\\n # # Then, i'll only search 1 from left uppermost in the matrix. If we find 0, we can break the loop. \\n # # if we find 1 in the matrix, also we can find out the largest sqaure by moving diagonally. by doing this, i increase the row and column and then check all row and column are 1 or not. if all elements are 1, we decide to move diagonally. but if there are 0, stop moving forward and update the size or the largest sqaure. \\n \\n # rows = len(matrix)\\n # cols = len(matrix[0])\\n # maxsq = 0\\n\\n # for i in range(rows):\\n # for j in range(cols):\\n # if matrix[i][j] == \\\"1\\\":\\n # currsq = 1\\n # flag = True\\n # while currsq + i < rows and currsq + j < cols and flag:\\n # for k in range(i, i + currsq + 1):\\n # if matrix[k][currsq + j] == \\\"0\\\":\\n # flag = False\\n # break\\n # for k in range(j, j + currsq + 1):\\n # if matrix[i + currsq][k] == \\\"0\\\":\\n # flag = False\\n # break\\n # if flag:\\n # currsq += 1\\n # if maxsq < currsq:\\n # maxsq = currsq\\n # return maxsq ** 2\\n\\n \\n # DP\\n # 1 1 -> 1 1\\n # 1 1 1 2 (if all surrounded elements are 1)\\n \\n rows = len(matrix)\\n cols = len(matrix[0])\\n\\n dp = [[0] * (cols + 1) for i in range(rows + 1)]\\n maxsq = 0\\n\\n for i in range(rows):\\n for j in range(cols):\\n if matrix[i][j] == '1':\\n dp[i + 1][j + 1] = min(dp[i][j], dp[i+1][j], dp[i][j+1]) + 1 # if one of three has 0, it will be 0 + 1, but if all are 1, diagonal element will be 2.\\n maxsq = max(dp[i+1][j+1], maxsq)\\n \\n return maxsq ** 2\",\n \"runtime\": \"517\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m=len(matrix)\\n n=len(matrix[0])\\n mx=0\\n\\n dp=[[0]*n for _ in range(m)]\\n for i in range(m):\\n for j in range(n): \\n if matrix[i][j]==\\\"1\\\":\\n if i!=0 or j!=0:\\n dp[i][j] = min(dp[i-1][j],dp[i][j-1],dp[i-1][j-1])+1\\n else:\\n dp[i][j]=1\\n\\n mx = max(mx,dp[i][j])\\n return mx*mx\\n\",\n \"runtime\": \"535\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n if matrix is None or len(matrix) < 1:\\n return 0\\n\\n rows = len(matrix)\\n cols = len(matrix[0])\\n\\n dp = [[0]*(cols + 1) for _ in range(rows + 1)]\\n side = 0\\n\\n for i in range(rows):\\n for j in range(cols):\\n if matrix[i][j] == \\\"1\\\":\\n dp[i + 1][j + 1] = min(dp[i][j], dp[i + 1][j], dp[i][j + 1]) + 1\\n if dp[i + 1][j + 1] > side:\\n side = dp[i + 1][j + 1]\\n\\n return side * side\\n\\n \",\n \"runtime\": \"535\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n mem = [[0 for _ in range(n)] for _ in range(m)]\\n maxN = 0\\n for i in range(m):\\n mem[i][0] = int(matrix[i][0])\\n maxN = max(maxN, mem[i][0])\\n for j in range(n):\\n mem[0][j] = int(matrix[0][j])\\n maxN = max(maxN, mem[0][j])\\n\\n for i in range(1,m):\\n for j in range(1,n):\\n if matrix[i][j] == \\\"1\\\":\\n mem[i][j] = min(mem[i][j-1], mem[i-1][j-1], mem[i-1][j]) + 1\\n else:\\n mem[i][j] = 0\\n maxN = max(maxN, mem[i][j])\\n print(mem)\\n return maxN * maxN\",\n \"runtime\": \"552\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n row = len(matrix)\\n col = len(matrix[0])\\n\\n dp = [[0] * col for i in range(row)]\\n ans = 0\\n\\n for r in range(row):\\n if int(matrix[r][0]) == 1:\\n dp[r][0] = 1\\n ans = 1\\n for c in range(col):\\n if int(matrix[0][c]) == 1:\\n dp[0][c] = 1\\n ans = 1\\n\\n for r in range(1, row):\\n for c in range(1, col):\\n if int(matrix[r][c]) == 1:\\n dp[r][c] = min(dp[r-1][c], dp[r][c-1], dp[r-1][c-1]) + 1\\n \\n ans = max(ans, dp[r][c])\\n \\n return ans**2\",\n \"runtime\": \"552\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n xSize = len(matrix)\\n ySize = len(matrix[0])\\n\\n greatest = -1\\n maxVal = 0\\n\\n for i in range(0,xSize):\\n for j in range(0,ySize):\\n matrix[i][j] = int(matrix[i][j])\\n if i-1 >= 0:\\n left = matrix[i-1][j]\\n else:\\n left = 0\\n\\n if j-1 >= 0:\\n right = matrix[i][j-1]\\n else:\\n right = 0\\n \\n if i-1 >= 0 and j-1 >= 0:\\n diagonal = matrix[i-1][j-1]\\n else:\\n diagonal = 0\\n \\n minVal = min(left,right,diagonal)\\n \\n if matrix[i][j] != 0:\\n matrix[i][j] = matrix[i][j] + minVal\\n\\n if greatest < matrix[i][j]:\\n greatest = matrix[i][j]\\n\\n return greatest*greatest\",\n \"runtime\": \"570\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n r=len(matrix)\\n c=len(matrix[0])\\n if c==1:\\n if ['1'] in matrix:\\n return 1\\n return 0\\n dp=[int(matrix[0][i]) for i in range(c)]\\n count=max(dp)\\n for i in range(1, r):\\n temp=[int(matrix[i][k]) for k in range(c)]\\n for j in range(1, c):\\n if matrix[i][j]=='1' and temp[j-1]!='0' and dp[j-1]!='0' and dp[j]!='0':\\n temp[j]+=min(int(temp[j-1]), int(dp[j-1]), int(dp[j]))\\n dp=temp\\n if max(dp)>count:\\n count=max(dp)\\n return count**2\",\n \"runtime\": \"570\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n result = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n matrix[i][j] = int(matrix[i][j])\\n if matrix[i][j] == 1:\\n result = 1\\n \\n for i in range(len(matrix)-2, -1, -1):\\n for j in range(len(matrix[0]) -2, -1, -1):\\n if matrix[i][j] > 0 and matrix[i+1][j] > 0 and matrix[i][j+1] > 0 and matrix[i+1][j+1] > 0:\\n if matrix[i+1][j] == matrix[i][j+1] == matrix[i+1][j+1]:\\n matrix[i][j] = matrix[i+1][j+1] + 1\\n else:\\n matrix[i][j] = min(matrix[i+1][j], matrix[i][j+1], matrix[i+1][j+1]) + 1\\n \\n result = max(result, matrix[i][j] ** 2)\\n\\n return result\\n \",\n \"runtime\": \"588\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n res = 0\\n dp = [[0 for _ in range(n+1)] for _ in range(m+1)]\\n\\n # for i in range(m):\\n # for j in range(n):\\n # matrix[i][j] = int(matrix[i][j])\\n\\n for i in range(m):\\n for j in range(n):\\n a, b, c = dp[i-1][j], dp[i][j-1], dp[i-1][j-1]\\n if \\\"0\\\" in (a, b, c, matrix[i][j]):\\n dp[i][j] = 0\\n else:\\n dp[i][j] = min(int(a), int(b), int(c)) + 1\\n res = max(res, dp[i][j])\\n\\n return res*res\",\n \"runtime\": \"588\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows = len(matrix)\\n cols = len(matrix[0])\\n dp = [[[0, 0, 0] for __ in range(cols+1)] for _ in range(rows+1)]\\n maxsquare = 0\\n for r in range(rows):\\n for c in range(cols):\\n val = int(matrix[r][c])\\n rowstreak, colstreak, diagstreak = dp[r][c]\\n if val:\\n dp[r][c+1][0] = 1 + rowstreak\\n dp[r+1][c][1] = 1 + colstreak\\n square = 1 + min(rowstreak, colstreak, diagstreak)\\n dp[r+1][c+1][2] = square\\n maxsquare = max(square, maxsquare)\\n #print(r, c, 'pass', dp)\\n return maxsquare*maxsquare\",\n \"runtime\": \"605\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n nrow = len(matrix)\\n ncol = len(matrix[0])\\n dp = [[[0, 0, 0] for _ in range(ncol)] for _ in range(nrow)] # up, left, diag\\n result = 0\\n for row in range(nrow):\\n for col in range(ncol):\\n if matrix[row][col] == \\\"0\\\":\\n continue\\n up = dp[row - 1][col][0] if row > 0 else 0\\n left = dp[row][col - 1][1] if col > 0 else 0\\n diag = dp[row - 1][col - 1][2] if col > 0 and row > 0 else 0\\n dp[row][col][0] = 1 + up\\n dp[row][col][1] = 1 + left\\n dp[row][col][2] = 1 + min(up, left, diag)\\n result = max(result, dp[row][col][2])\\n return result * result\",\n \"runtime\": \"605\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n dp = []\\n m = len(matrix)\\n n = len(matrix[0])\\n for _ in range(m):\\n tmp = [0] * n\\n dp.append(tmp)\\n\\n max_so_far = 0\\n dir = [[0, -1], [-1, 0], [-1, -1]]\\n for i in range(m):\\n for j in range(n):\\n if matrix[i][j] == \\\"1\\\":\\n increase = -1\\n for d in dir:\\n i_new = i + d[0]\\n j_new = j + d[1]\\n \\n if matrix[i_new][j_new] != \\\"1\\\" or i_new < 0 or j_new < 0:\\n increase = 0\\n break\\n else:\\n if increase == -1:\\n increase = dp[i_new][j_new]\\n else:\\n increase = min(increase, dp[i_new][j_new])\\n \\n \\n dp[i][j] = increase + 1\\n max_so_far = max(max_so_far, dp[i][j] * dp[i][j])\\n #print(dp)\\n return max_so_far\\n\",\n \"runtime\": \"623\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n \\n m, n = len(matrix), len(matrix[0])\\n maxlen = 0\\n \\n for i in range(m):\\n for j in range(n):\\n if matrix[i][j] == '1':\\n if i == 0 or j == 0:\\n maxlen = max(maxlen, 1)\\n else:\\n size = min(int(matrix[i-1][j]), int(matrix[i][j-1]), int(matrix[i-1][j-1])) + 1\\n maxlen = max(maxlen, size)\\n matrix[i][j] = str(size)\\n else:\\n matrix[i][j] = '0'\\n \\n return maxlen * maxlen\\n\\n\\n def maximalSquare3(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n maxlen = 0\\n for i in range(m):\\n if m - i <= maxlen:\\n break\\n for j in range(n):\\n if n - j <= maxlen:\\n break\\n matrix[i][j] = int(matrix[i][j])\\n if not matrix[i][j]:\\n continue\\n v1 = max(matrix[i][j - 1] - 1, 0) if j > 0 else 0\\n v2 = max(matrix[i - 1][j] - 1, 0) if i > 0 else 0\\n for k in range(max(v1, v2), min(m - i, n - j)):\\n if all(\\n int(matrix[i + x][j + k]) and int(matrix[i + k][j + x])\\n for x in range(k + 1)\\n ):\\n maxlen = max(maxlen, k + 1)\\n matrix[i][j] = k + 1\\n else:\\n break\\n return maxlen * maxlen\\n\\n def maximalSquare2(self, matrix: List[List[str]]) -> int:\\n # space: O(m * n), time: O(m * n)\\n m = len(matrix)\\n n = len(matrix[0])\\n hor = [[0 for _ in range(n)] for _ in range(m)]\\n for i in range(m):\\n j, count = 0, 0\\n while j < n:\\n if matrix[i][j] == \\\"1\\\":\\n count += 1\\n if matrix[i][j] == \\\"0\\\":\\n for k in range(1, count + 1):\\n hor[i][j - k] = k\\n count = 0\\n elif j == n - 1:\\n for k in range(0, count):\\n hor[i][j - k] = k + 1\\n j += 1\\n\\n res = 0\\n for i in range(m):\\n if m - i <= res:\\n return res * res\\n for j in range(n):\\n if hor[i][j] == 0 or hor[i][j] <= res:\\n continue\\n for count in range(res + 1, hor[i][j] + 1):\\n cols = min(hor[k][j] for k in range(i, min(i + count, m)))\\n res = max(min(cols, m - i, count), res)\\n if cols <= count:\\n break\\n return res * res\\n\",\n \"runtime\": \"623\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n @cache\\n def maxSq(i,j): # 以(i,j)為右下角的最大正方形邊長\\n # 無正方形\\n if matrix[i][j]=='0': return 0\\n # 最上一列 or 最左一行\\n if i==0 or j==0: return 1\\n return 1 + min(maxSq(i-1,j-1), maxSq(i-1,j), maxSq(i,j-1))\\n\\n return max(maxSq(i,j) for i in range(len(matrix)) for j in range(len(matrix[0]))) ** 2\\n\",\n \"runtime\": \"640\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m,n = len(matrix),len(matrix[0])\\n hist = [0 for i in range(n)]\\n idx = 0\\n maxsquare = 0\\n for idx in range(m):\\n for i in range(n):\\n if matrix[idx][i]=='0':\\n hist[i] = 0\\n else:\\n hist[i] += 1\\n # print(idx,hist,matrix[idx])\\n # increasing stack\\n lstack = []\\n rstack = []\\n lside = [0 for i in range(n)]\\n rside = [0 for i in range(n)]\\n for i in range(n):\\n j = n-i-1\\n while len(lstack)>0:\\n if hist[lstack[-1]]<hist[i]:\\n break\\n lstack.pop()\\n if len(lstack)==0:\\n lside[i] = -1\\n else:\\n lside[i] = lstack[-1]\\n lstack.append(i)\\n while len(rstack)>0:\\n if hist[rstack[-1]]<hist[j]:\\n break\\n rstack.pop()\\n if len(rstack)==0:\\n rside[j] = n\\n else:\\n rside[j] = rstack[-1]\\n rstack.append(j)\\n for i in range(n):\\n hh = hist[i]\\n ll = rside[i]-lside[i]-1\\n side = min(hh,ll)\\n maxsquare = max(maxsquare,side*side)\\n return maxsquare\\n\\n\\n \\n\",\n \"runtime\": \"640\"\n },\n {\n \"code\": \"class Solution:\\n \\\"to katw dexia kanei define\\\"\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n res = [[0 for _ in range(n)] for _ in range(m)]\\n test = [[[0,0] for _ in range(n)] for _ in range(m)]\\n \\n for row in range(m):\\n for col in range(n):\\n matrix[row][col] = int(matrix[row][col])\\n for col in range(1, n):\\n test[0][col][0] = (1+test[0][col-1][0]) * matrix[0][col-1]\\n for row in range(1, m):\\n test[row][0][1] = (1+test[row-1][0][1]) * matrix[row-1][0]\\n for row in range(1, m):\\n for col in range(1, n):\\n test[row][col][0] = matrix[row][col-1] * (1+test[row][col-1][0])\\n test[row][col][1] = matrix[row-1][col] * (1+test[row-1][col][1])\\n \\n for row in range(m):\\n for col in range(n):\\n #res[row][col] = matrix[row][col]\\n if matrix[row][col] == 1:\\n res[row][col] = min(res[row-1][col-1], min(test[row][col])) + 1\\n \\n max_size = max([max(i) for i in res])\\n return max_size**2\\n\\n\\n\\n\",\n \"runtime\": \"658\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n maxN = 0\\n\\n for i in range(len(matrix)):\\n maxN = max(maxN, int(matrix[i][0]))\\n\\n for j in range(len(matrix[0])):\\n maxN = max(maxN, int(matrix[0][j]))\\n \\n \\n for i in range(1, len(matrix)):\\n for j in range(1, len(matrix[0])):\\n dia, top, left = int(matrix[i-1][j-1]), int(matrix[i-1][j]), int(matrix[i][j-1])\\n #print('dia: ', dia, ' top: ', top, ' left: ', left)\\n \\n if matrix[i][j] == '0':\\n continue\\n maxN = max(maxN, 1)\\n\\n if dia == top == left > 0:\\n matrix[i][j] = str(dia + 1)\\n maxN = max(maxN, dia+1)\\n elif dia > 0 and top > 0 and left > 0:\\n m = min(dia, top)\\n m = min(m, left)\\n matrix[i][j] = str(m + 1)\\n maxN = max(maxN, m)\\n #print(matrix)\\n return maxN ** 2\",\n \"runtime\": \"658\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n \\n m, n = len(matrix), len(matrix[0])\\n memo = [[-1 for _ in range(n)] for _ in range(m)] # Memoization table\\n \\n def dp(i, j):\\n # Base case: if we're out of bounds or the cell is '0', return 0\\n if i >= m or j >= n or matrix[i][j] == \\\"0\\\":\\n return 0\\n \\n # If we've already computed this cell, return the memoized value\\n if memo[i][j] != -1:\\n return memo[i][j]\\n \\n # Recursively compute the size of the square by looking at the\\n # right, bottom-right, and bottom cells\\n right = dp(i, j + 1)\\n bottom = dp(i + 1, j)\\n bottom_right = dp(i + 1, j + 1)\\n \\n # The size of the square ending at (i, j) is the minimum of those three plus 1\\n memo[i][j] = 1 + min(right, bottom, bottom_right)\\n \\n return memo[i][j]\\n \\n max_square_length = 0\\n \\n # Iterate through every cell to compute the maximal square\\n for i in range(m):\\n for j in range(n):\\n if matrix[i][j] == \\\"1\\\":\\n max_square_length = max(max_square_length, dp(i, j))\\n \\n # The area of the maximal square is the square of its side length\\n return max_square_length * max_square_length\\n\",\n \"runtime\": \"675\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n m, n = len(matrix), len(matrix[0])\\n \\n @cache\\n def dp(i, j):\\n # Base case: If out of bounds or the cell is '0', no square can start here\\n if i >= m or j >= n or matrix[i][j] == \\\"0\\\":\\n return 0\\n\\n # Recursively calculate the size of the square\\n right = dp(i, j + 1)\\n down = dp(i + 1, j)\\n diagonal = dp(i + 1, j + 1)\\n \\n # Current cell can form a square of size 1 + the minimum of right, down, and diagonal\\n return 1 + min(right, down, diagonal)\\n\\n # Find the maximum square size\\n max_square = max(dp(i, j) for i in range(m) for j in range(n))\\n\\n # Return the area of the largest square (size^2)\\n return max_square ** 2\\n\",\n \"runtime\": \"675\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n # if current == 1, square = min(s[i-1][j-1], s[i][j-1], s[i-1][j]) + 1\\n m = len(matrix[0])\\n n = len(matrix)\\n\\n s = [[0] * m for i in range(n)]\\n largest = 0\\n\\n for i in range(m):\\n s[0][i] = 1 if matrix[0][i] == \\\"1\\\" else 0\\n largest = max(largest, s[0][i])\\n for j in range(n):\\n s[j][0] = 1 if matrix[j][0] == \\\"1\\\" else 0\\n largest = max(largest, s[j][0])\\n # print(s)\\n\\n for i in range(1, n):\\n for j in range(1, m):\\n # print(i, j, matrix[i][j])\\n if matrix[i][j] == \\\"1\\\":\\n print(\\\"current is 1\\\", i, j)\\n s[i][j] = min(s[i - 1][j - 1], s[i][j - 1], s[i - 1][j]) + 1\\n else:\\n s[i][j] = 0\\n largest = max(largest, s[i][j])\\n # print(i, j, s[i][j])\\n\\n return largest * largest\\n\",\n \"runtime\": \"693\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n ROWS,COLS=len(matrix),len(matrix[0])\\n cache={}\\n\\n def helper(r,c):\\n if r>=ROWS or c>=COLS:\\n return 0\\n if (r,c)not in cache:\\n down=helper(r+1,c)\\n right=helper(r,c+1)\\n diag=helper(r+1,c+1)\\n cache[(r,c)]=0\\n if matrix[r][c]==\\\"1\\\":\\n cache[(r,c)]=1+min(down,right,diag)\\n return cache[(r,c)]\\n \\n helper(0,0)\\n return max(cache.values())**2\",\n \"runtime\": \"693\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n # Dynamic programming solution : Bottom up approach\\n # Recursive - Top Down too - easier to implement, and similar to DP\\n # Time complexity: O(M*N)\\n ROWS, COLS = len(matrix), len(matrix[0])\\n cache = {} # map each (r, c) -> Max length of the square\\n\\n def helper(r, c):\\n # Out of bounds check\\n if r >= ROWS or c >= COLS:\\n return 0\\n\\n if (r, c) not in cache:\\n down = helper(r + 1, c)\\n right = helper(r, c+1)\\n diag = helper(r+1, c+1)\\n\\n cache[(r,c)] = 0\\n if matrix[r][c] == '1':\\n cache[(r, c)] = 1 + min(down, diag, right)\\n return cache[(r,c)]\\n\\n helper(0, 0)\\n return max(cache.values())**2 # Max area of square = len * len\\n\\n \",\n \"runtime\": \"711\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n dp = {}\\n\\n def maximalRec(i, j):\\n if i >= m or j >= n:\\n return 0\\n \\n if (i, j) not in dp:\\n\\n down = maximalRec(i+1, j)\\n right = maximalRec(i, j+1)\\n diag = maximalRec(i+1, j+1)\\n\\n dp[(i, j)] = 0\\n if matrix[i][j] == \\\"1\\\":\\n dp[(i, j)] = 1 + min(down, right, diag)\\n\\n return dp[(i, j)]\\n\\n \\n maximalRec(0, 0)\\n return max(dp.values())**2\\n\\n \\n \",\n \"runtime\": \"711\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n rows, cols = len(matrix), len(matrix[0])\\n cache = {}\\n def bfs(i, j):\\n if i >= rows or j >= cols:\\n return 0\\n if (i, j) not in cache:\\n down = bfs(i + 1, j)\\n diag = bfs(i + 1, j + 1)\\n right = bfs(i, j + 1)\\n cache[(i, j)] = 0\\n if matrix[i][j] == '1':\\n cache[(i, j)] = 1 + min(down, diag, right)\\n return cache[(i, j)]\\n bfs(0, 0)\\n max_len = max(cache.values(), default=0)\\n return max_len ** 2\",\n \"runtime\": \"728\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n \\n\\n # Solution 1 - \\n # Time - \\n # Space - \\n\\n ROWS, COLS = len(matrix), len(matrix[0])\\n cache = {0:0}\\n\\n def dfs(r, c):\\n\\n if r >= ROWS or c >= COLS:\\n return 0\\n\\n if (r, c) in cache:\\n return cache[(r, c)]\\n\\n right = dfs(r, c + 1)\\n diagonal = dfs(r + 1, c + 1)\\n down = dfs(r + 1, c)\\n\\n cache[(r, c)] = 0\\n\\n if matrix[r][c] == \\\"1\\\":\\n cache[(r, c)] = min(right, diagonal, down) + 1\\n\\n return cache[(r, c)]\\n\\n dfs(0, 0)\\n\\n return max(cache.values()) ** 2\",\n \"runtime\": \"728\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n\\n dp = [[None for _ in range(n)] for _ in range(m)]\\n\\n ans = 0\\n for i in range(m -1, -1, -1):\\n for j in range(n-1, -1, -1):\\n if matrix[i][j] == \\\"0\\\":\\n dp[i][j] = 0\\n else:\\n right = 0 if j + 1 == n else dp[i][j + 1]\\n diag = 0 if j + 1 == n or i + 1 == m else dp[i + 1][j + 1] \\n down = 0 if i + 1 == m else dp[i + 1][j]\\n\\n dp[i][j] = 1 + min([right, diag, down])\\n print(f'i is {i} j is {j} dp[i][j] is {dp[i][j]}')\\n ans = max(ans, dp[i][j] ** 2)\\n \\n return ans\\n\\n \",\n \"runtime\": \"746\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n row, col = len(matrix), len(matrix[0]) \\n cache={}\\n def bfs(i,j):\\n if i>=row or j>=col:\\n return 0\\n if (i,j) not in cache:\\n top = bfs(i, j+1)\\n diag = bfs(i+1, j+1)\\n bottom = bfs(i+1, j)\\n cache[i,j] = 0\\n if matrix[i][j] == \\\"1\\\":\\n cache[i,j] = 1 + min(top,diag,bottom)\\n return cache[i,j]\\n\\n bfs(0,0)\\n value = max(cache.values(), default = 0)\\n return value**2\",\n \"runtime\": \"746\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n memo={}\\n def ms(matrix,n=0,m=0,m1=False):\\n if m1==False:\\n m1=True\\n n=len(matrix)-1\\n m=len(matrix[0])-1\\n if (n,m) in memo : return memo[(n,m)]\\n if n==0 and m==0:\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n elif n==0:\\n ms(matrix,n,m-1,m1)\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n elif m==0:\\n ms(matrix,n-1,m,m1)\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n else: \\n value = int(matrix[n][m])\\n match value:\\n case 0: \\n ms(matrix,n,m-1,m1)\\n ms(matrix,n-1,m,m1)\\n ms(matrix,n-1,m-1,m1)\\n memo[(n,m)] = 0\\n case _:\\n memo[(n,m)]=min(ms(matrix,n,m-1,m1),ms(matrix,n-1,m,m1),ms(matrix,n-1,m-1,m1))+int(matrix[n][m])\\n return memo[(n,m)]\\n \\n ms(matrix)\\n max1=0\\n for i in memo:\\n if memo[i]>max1: max1=memo[i]\\n return max1**2\\n \",\n \"runtime\": \"763\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n # start at a square\\n # if it's one: find the max between that and all 3 neighbors being ones\\n\\n # T[i, j] size of the biggest square starting with the corner (i, j)\\n # if matrix[i, j] == 0 return 0\\n # get max size square on right and below\\n\\n # left = T[i + 1, j]\\n # down = T[i, j + 1]\\n # width = min(down, left)\\n # T(i, j) = 1 + (width if T[i + width, j + width] == 1) else 1\\n\\n memo = {}\\n m = len(matrix)\\n n = len(matrix[0])\\n def dp(i, j):\\n if (i, j) in memo:\\n return memo[(i, j)]\\n\\n if i >= m or j >= n or matrix[i][j] == \\\"0\\\":\\n return 0\\n\\n\\n left = dp(i + 1, j)\\n down = dp(i, j + 1)\\n r = min(left, down)\\n memo[(i, j)] = (1 + r) if r >= 1 and dp(i + r, j + r) >= 1 else 1 + (r - 1 if r else 0)\\n\\n return memo[(i, j)]\\n mv = 0\\n for i in range(m):\\n for j in range(n):\\n res = dp(i, j)\\n mv = max(mv, res)\\n\\n return mv ** 2\",\n \"runtime\": \"763\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n \\n\\n # Solution 1 - \\n # Time - \\n # Space - \\n\\n ROWS, COLS = len(matrix), len(matrix[0])\\n cache = {0:0}\\n\\n def dfs(r, c):\\n\\n if r >= ROWS or c >= COLS:\\n return 0\\n\\n if (r, c) in cache:\\n return cache[(r, c)]\\n\\n right = dfs(r, c + 1)\\n diagonal = dfs(r + 1, c + 1)\\n down = dfs(r + 1, c)\\n\\n cache[(r, c)] = 0\\n \\n if matrix[r][c] == \\\"1\\\":\\n cache[(r, c)] = min(right, diagonal, down) + 1\\n\\n return cache[(r, c)]\\n\\n dfs(0, 0)\\n\\n print(cache)\\n\\n return max(cache.values()) ** 2\",\n \"runtime\": \"781\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n #Recursive : top down approach\\n ROWS, COLS = len(matrix), len(matrix[0])\\n cache = {} #map each (r,c) -> maxLength of square\\n\\n def helper(r,c):\\n if r>=ROWS or c>=COLS:\\n return 0\\n\\n # If the result is already cached, return it\\n if (r,c) not in cache:\\n down = helper(r+1, c) #Move down\\n diagonal = helper(r+1, c+1) #Move diagonally\\n right = helper(r, c+1) # Move right\\n\\n cache[(r,c)] = 0 # Initialize with 0\\n if matrix[r][c] == \\\"1\\\":\\n # If current cell is '1', compute the size of the square\\n cache[(r,c)] = 1 + min(down, diagonal, right)\\n \\n return cache[(r,c)]\\n\\n # Call helper to fill the cache\\n helper(0,0)\\n\\n # Return the area of the largest square found\\n return max(cache.values())**2\\n\",\n \"runtime\": \"781\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n # you can identify a square by looking down, right, diagonal from each corner.\\n M, N = len(matrix), len(matrix[0])\\n memo = {}\\n \\n\\n @cache\\n def dfs(i, j):\\n if (i,j) in memo: return memo[(i,j)]\\n if i not in range(M) or j not in range(N): return 0\\n\\n down = dfs(i + 1, j)\\n right = dfs(i, j + 1)\\n diag = dfs(i + 1, j + 1)\\n\\n memo[(i,j)] = 0\\n if matrix[i][j] != '0':\\n memo[(i,j)] = 1 + min(down, right, diag)\\n \\n return memo[(i,j)]\\n \\n dfs(0,0)\\n return max(memo.values()) ** 2\\n\\n # each spot in the memo is storing the max of that corner square.\",\n \"runtime\": \"798\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n #we have to find the largest square, by that that, they mean when i increment i and j at the same time, all the rows and columns should be 1s\\n #as soon we encounter zero, calculate cur area and set the max area to the max of cur amd max\\n ROWS, COLS = len(matrix), len(matrix[0])\\n\\n cache ={}\\n\\n def helper(r,c):\\n if r>=ROWS or c>=COLS:\\n return 0\\n \\n if (r,c) not in cache:\\n\\n down = helper(r+1,c)\\n right = helper(r,c+1) \\n diag = helper(r+1,1+c) \\n cache[(r,c)] = 0\\n \\n if matrix[r][c] == \\\"1\\\":\\n cache[(r,c)] = 1+min(down,right,diag)\\n \\n return cache[(r,c)]\\n \\n helper(0,0)\\n print(cache)\\n\\n return max(cache.values()) ** 2\\n\\n\",\n \"runtime\": \"798\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n down = [[-1 for _ in matrix[i]] for i in range(len(matrix))]\\n right = [[-1 for _ in matrix[i]] for i in range(len(matrix))]\\n diag = [[-1 for _ in matrix[i]] for i in range(len(matrix))]\\n\\n def findDown(i, j):\\n if not 0 <= i < len(matrix) or matrix[i][j] == '0':\\n return 0\\n if down[i][j] == -1:\\n down[i][j] = findDown(i + 1, j) + 1\\n return down[i][j]\\n \\n def findRight(i, j):\\n if not 0 <= j < len(matrix[i]) or matrix[i][j] == '0':\\n return 0\\n if right[i][j] == -1:\\n right[i][j] = findRight(i, j + 1) + 1\\n return right[i][j]\\n \\n def findDiag(i, j):\\n if not 0 <= i < len(matrix) or not 0 <= j < len(matrix[i]) or matrix[i][j] == '0':\\n return 0\\n if diag[i][j] == -1:\\n diag[i][j] = min(findDiag(i + 1, j + 1) + 1, findRight(i, j), findDown(i, j))\\n return diag[i][j]\\n\\n max_side = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[i])):\\n max_side = max(max_side, findDiag(i, j))\\n return max_side * max_side\\n \\n\",\n \"runtime\": \"816\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n memo = {}\\n def dfs(i,j):\\n if i>=len(matrix) or j >=len(matrix[0]):\\n return 0\\n elif (i,j) in memo:\\n return memo[(i,j)]\\n memo[(i,j)] = 0\\n diag = dfs(i+1,j+1)\\n right = dfs(i,j+1)\\n down = dfs(i+1,j)\\n if matrix[i][j] == \\\"1\\\":\\n memo[(i,j)] += min(down,right,diag) + 1\\n return memo[(i,j)]\\n\\n\\n dfs(0,0)\\n return max(memo.values())**2\",\n \"runtime\": \"816\"\n },\n {\n \"code\": \"def largest(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\\n if not 0 <= i < len(mat):\\n return 0\\n if not 0 <= j < len(mat[0]):\\n return 0\\n\\n if mat[i][j] == '0':\\n return 0\\n \\n key = (i, j)\\n if key in cache:\\n return cache[key]\\n\\n res = 1\\n res += min(\\n largest(mat, i+1, j+1, cache),\\n min(\\n largest(mat, i, j+1, cache),\\n largest(mat, i+1, j, cache)\\n )\\n )\\n\\n cache[key] = res\\n return res\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n best = 0\\n cache = {}\\n for i in range(len(matrix)):\\n for j in range(len(matrix[i])):\\n best = max(best, largest(matrix, i, j, cache) ** 2)\\n return best\\n\\n'''\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\",\\\"0\\\",\\\"0\\\"]\\n[\\\"0\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\",\\\"0\\\",\\\"0\\\"]\\n'''\",\n \"runtime\": \"834\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n \\\"\\\"\\\"\\n distance of width and height can only be 1:1\\n to check if square, look right, down, diagonal to check for 1s\\n pass variables and flags and curr len of matrix\\n \\\"\\\"\\\"\\n ROWS = len(matrix)\\n COLS = len(matrix[0])\\n\\n def dfs(r,c):\\n if r < 0 or r >= ROWS or c < 0 or c >= COLS:\\n return 0\\n if (r,c) not in memo:\\n width = dfs(r,c+1)\\n height = dfs(r+1,c)\\n diag = dfs(r+1,c+1)\\n memo[(r,c)] = 0 \\n if matrix[r][c] == \\\"1\\\":\\n memo[(r,c)] = 1+min(width,height,diag)\\n \\n return memo[(r,c)]\\n \\n\\n memo = {}\\n maxlen = 0\\n for r in range(ROWS):\\n for c in range(COLS):\\n maxlen = max(maxlen,dfs(r,c))\\n return maxlen*maxlen\\n\\n\\n\\n def maximalSquare1(self, matrix: List[List[str]]) -> int:\\n \\n \\\"\\\"\\\"\\n square definition: distance of width and height can only be 1:1\\n to check if it's a square, look right, down, and diagonal to check for 1s\\n pass variables and flags and curr len of matrix, \\n dfs with memo\\n \\\"\\\"\\\" \\n def dfs1(matrix,visited,r,c):\\n if r < 0 or r >= len(matrix) or c < 0 or c >= len(matrix[0]):\\n return 0\\n if (r,c) not in visited:\\n right = dfs(matrix,visited,r,c+1)\\n down = dfs(matrix,visited,r+1,c)\\n diagonal = dfs(matrix,visited,r+1,c+1)\\n visited[(r,c)] = 0 # mark (r,c) as 0 unless it's 1\\n if matrix[r][c] == \\\"1\\\":\\n visited[(r,c)] = 1+min(right,down,diagonal)\\n return visited[(r,c)]\\n\\n if len(matrix) == 1:\\n return int(\\\"1\\\" in matrix[0])\\n\\n ROWS = len(matrix)\\n COLS = len(matrix[0])\\n visited = {}\\n maxlen = 0\\n for i in range(ROWS):\\n for j in range(COLS):\\n maxlen = max(area,dfs(matrix,visited,i,j))\\n return maxlen * maxlen # maxlen **2 for square area\\n\\n def maximalSquar1(self, matrix: List[List[str]]) -> int:\\n \\\"\\\"\\\"\\n if matrix[i-1][j-1] == 1:\\n dp[i][j] = 1+min(dp[i-1][j],dp[i][j-1],dp[i-1][j-1])\\n \\\"\\\"\\\"\\n if len(matrix) == 1:\\n return int(\\\"1\\\" in matrix[0])\\n ROWS = len(matrix)\\n COLS = len(matrix[0]) \\n dp = [[0]*(COLS+1) for _ in range(ROWS+1)]\\n largest = 0\\n for i in range(1,ROWS+1):\\n for j in range(1,COLS+1):\\n if matrix[i-1][j-1] == \\\"1\\\":\\n dp[i][j] = 1+min(dp[i-1][j],dp[i][j-1],dp[i-1][j-1])\\n largest = max(largest,dp[i][j])\\n return largest*largest\\n\\n \\n \",\n \"runtime\": \"834\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n m = len(matrix)\\n n = len(matrix[0])\\n directions = [(0, 1), (1, 0), (1, 1)]\\n \\n @cache\\n def dp(i, j):\\n if i >= m or i < 0 or j >= n or j < 0:\\n return 0\\n \\n if matrix[i][j] == \\\"0\\\":\\n return 0\\n\\n res = 1\\n add = float('inf')\\n for di, dj in directions:\\n ni, nj = i + di, j + dj\\n add = min(add, dp(ni, nj))\\n \\n return res + add\\n \\n ans = 0\\n for i in range(m):\\n for j in range(n):\\n ans = max(ans, dp(i, j))\\n\\n return ans*ans\\n\\n\",\n \"runtime\": \"851\"\n },\n {\n \"code\": \"'''\\nGiven an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area. \\n\\n \\n'''\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n h,w = len(matrix),len(matrix[0])\\n cache = {}\\n\\n def helper(x,y):\\n if x >= w or y >= h:\\n return 0\\n \\n if (x,y) not in cache:\\n ceil = helper(x,y+1)\\n adj = helper(x+1,y+1)\\n left = helper(x+1,y)\\n\\n cache[(x,y)] = 0\\n print(f\\\"{x}:{y}\\\")\\n if matrix[y][x] == '1':\\n cache[(x,y)] = 1 + min(ceil,adj,left)\\n \\n return cache[(x,y)]\\n\\n helper(0,0)\\n return max(cache.values()) ** 2\",\n \"runtime\": \"851\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows = len(matrix)\\n cols = len(matrix[0])\\n ret = 0\\n\\n for i in range(rows):\\n for j in range(cols):\\n matrix[i][j] = int(matrix[i][j])\\n if matrix[i][j] == 1 and (i != 0 and j!=0):\\n print(i)\\n print(j)\\n matrix[i][j] += min(matrix[i-1][j], matrix[i][j-1], matrix[i-1][j-1])\\n print(ret)\\n print(\\\"-----\\\")\\n ret = max(int(matrix[i][j]), ret)\\n\\n return ret**2 if ret > 1 else ret\\n\\n \\n\\n \",\n \"runtime\": \"869\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n dp = [[0] * len(matrix[0]) for i in range(len(matrix))]\\n\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n dp[i][j] = int(matrix[i][j])\\n \\n print(dp)\\n def helper(r,c):\\n up = up_left = left = 0\\n\\n if r - 1 in range(len(dp)):\\n up = dp[r - 1][c]\\n if r - 1 in range(len(matrix)) and c - 1 in range(len(matrix[0])):\\n up_left = dp[r - 1][c - 1]\\n if c - 1 in range(len(matrix[0])):\\n left = dp[r][c - 1]\\n \\n return 1 + min(up, up_left, left)\\n \\n res = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if dp[i][j] >= 1:\\n ans = helper(i, j)\\n dp[i][j] = ans\\n print(ans)\\n res = max(res, ans ** 2)\\n\\n return res \\n\\n \",\n \"runtime\": \"869\"\n },\n {\n \"code\": \"\\n\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n M = len(matrix)\\n N = len(matrix[0])\\n\\n dp = [[0] * N for i in range(M)]\\n\\n dp[0][0] = 1 if matrix[0][0] == '1' else 0\\n\\n for m in range(1, M):\\n dp[m][0] = 1 if matrix[m][0] == '1' else 0\\n \\n for n in range(1, N):\\n dp[0][n] = 1 if matrix[0][n] == '1' else 0\\n\\n print(dp)\\n\\n for m in range(1, M):\\n for n in range(1, N):\\n if matrix[m][n] == '0':\\n continue\\n\\n dp[m][n] = 1 \\n if dp[m-1][n-1] > 0 and dp[m][n-1] > 0 and dp[m-1][n] > 0:\\n x = min(dp[m-1][n-1], dp[m][n-1], dp[m-1][n])\\n dp[m][n] = (x ** 0.5 + 1) ** 2\\n print(m, n, x, dp[m][n])\\n\\n print(dp)\\n\\n ret = -1\\n for m in range(M):\\n for n in range(N):\\n ret = max(ret, dp[m][n])\\n\\n return int(ret)\\n\\n\\n\",\n \"runtime\": \"886\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n dp = [[-1 for _ in range(len(matrix[0]))] for _ in range(len(matrix))]\\n maxRes = 0\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n if matrix[r][c] == \\\"1\\\":\\n dp[r][c] = self.biggestSquareFrom(matrix, dp, r, c)\\n maxRes = max(dp[r][c], maxRes)\\n return maxRes**2\\n \\n def biggestSquareFrom(self, matrix: List[List[str]], dp: List[List[int]], row: int, col: int) -> int:\\n if row >= len(matrix) or col >= len(matrix[0]):\\n return 0\\n \\n if matrix[row][col] == \\\"0\\\":\\n return 0\\n \\n if dp[row][col] != -1: # Check if already calculated\\n return dp[row][col]\\n \\n minSquare = float('inf')\\n \\n for dr, dc in [[1, 0], [1, 1], [0, 1]]:\\n temp = self.biggestSquareFrom(matrix, dp, row+dr, col+dc)\\n minSquare = min(minSquare, temp)\\n \\n dp[row][col] = minSquare + 1\\n \\n return minSquare + 1\\n\\n \",\n \"runtime\": \"886\"\n },\n {\n \"code\": \"class Solution:\\n # Top-down recursion\\n # Time: O(m*n)\\n # Space: O(m*n)\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n memo = [[0 for _ in range(COLS)] for _ in range(ROWS)]\\n\\n def recur(r, c):\\n if r == ROWS or c == COLS:\\n return 0\\n elif memo[r][c]:\\n return memo[r][c]\\n else:\\n right = recur(r, c+1)\\n diag = recur(r+1, c+1)\\n down = recur(r+1, c)\\n\\n if matrix[r][c] == \\\"1\\\":\\n memo[r][c] = int(matrix[r][c]) + min(right, diag, down)\\n return memo[r][c]\\n \\n recur(0, 0)\\n maxLength = 0\\n for row in memo:\\n for num in row:\\n maxLength = max(maxLength, num)\\n return maxLength ** 2\\n\",\n \"runtime\": \"904\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n\\n m, n = len(matrix), len(matrix[0])\\n self.maximal = 0\\n dp = [[0] * n for _ in range(m)]\\n\\n def dfs(r, c):\\n if r >= m or c >= n:\\n return 0\\n if dp[r][c]:\\n return dp[r][c]\\n \\n curr_sq = min(dfs(r+1, c), dfs(r+1, c+1), dfs(r, c+1)) + 1\\n\\n if matrix[r][c] == '0':\\n return 0\\n \\n dp[r][c] = curr_sq\\n self.maximal = max(self.maximal, curr_sq)\\n return curr_sq\\n\\n dfs(0,0)\\n\\n return self.maximal**2\\n\\n \",\n \"runtime\": \"904\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n ROWS = len(matrix)\\n COLS = len(matrix[0])\\n\\n directions = [(1, 0), (0, 1), (1, 1)]\\n\\n dp = {}\\n\\n def is_valid(i, j):\\n return 0 <= i <= ROWS - 1 \\\\\\n and 0 <= j <= COLS - 1\\n\\n def compute_max_dimension(i, j):\\n if (i, j) in dp:\\n return dp[(i, j)]\\n \\n max_dimension = 1\\n\\n for dr, dc in directions:\\n if not is_valid(i + dr, j + dc) \\\\\\n or matrix[i + dr][j + dc] == \\\"0\\\":\\n dp[(i, j)] = max_dimension\\n return dp[(i, j)]\\n \\n max_dimension += min(\\n compute_max_dimension(i + 1, j),\\n compute_max_dimension(i, j + 1),\\n compute_max_dimension(i + 1, j + 1)\\n )\\n\\n dp[(i, j)] = max_dimension\\n return dp[(i, j)]\\n\\n max_dimension = 0\\n\\n for i in range(ROWS):\\n for j in range(COLS):\\n if matrix[i][j] == \\\"1\\\":\\n max_dimension = max(\\n max_dimension,\\n compute_max_dimension(i, j)\\n )\\n \\n return max_dimension**2 \\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"921\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n max_area = 0\\n\\n for i in range(0, len(matrix)):\\n for j in range(0, len(matrix[0])):\\n if int(matrix[i][j]) == 1:\\n if i-1>=0:\\n upper = int(matrix[i-1][j])\\n else:\\n upper = 0\\n\\n if j-1>=0:\\n side = int(matrix[i][j-1])\\n else:\\n side = 0\\n\\n if i-1>=0 and j-1>=0:\\n dia = int(matrix[i-1][j-1])\\n else:\\n dia = 0\\n\\n print(i, j, matrix[i][j], upper, dia, side)\\n matrix[i][j] = int(1+min(upper, dia, side))\\n else:\\n matrix[i][j] = int(0)\\n\\n if matrix[i][j] > max_area:\\n max_area = matrix[i][j]\\n\\n return max_area**2\",\n \"runtime\": \"921\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n R,C=len(matrix),len(matrix[0])\\n cache={}\\n def helper(r,c):\\n if r not in range(R) or c not in range(C):\\n return 0 \\n \\n if (r,c) not in cache:\\n right=helper(r,c+1)\\n down=helper(r+1,c)\\n diag=helper(r+1,c+1)\\n cache[(r,c)]=0\\n if matrix[r][c] == \\\"1\\\":\\n cache[(r,c)] = 1+min(diag,right,down)\\n return cache[(r,c)]\\n helper(0,0)\\n return max(cache.values())**2\\n \\n\\n\\n\",\n \"runtime\": \"939\"\n },\n {\n \"code\": \"from functools import cache\\nimport numpy as np\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n squares = np.zeros((rows+1, cols+1), dtype=int)\\n maximum = 0\\n\\n for r in range(rows-1, -1, -1):\\n for c in range(cols-1, -1, -1):\\n if matrix[r][c] != '0':\\n right = squares[r][c+1]\\n down = squares[r+1][c]\\n diag = squares[r+1][c+1]\\n squares[r][c] = min(right, down, diag) + 1\\n\\n maximum = max(maximum, squares[r][c])\\n \\n #print(squares)\\n return maximum ** 2\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"939\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n dp = [0 for i in range(m*n)]\\n\\n for i in range(m):\\n for j in range(n):\\n if matrix[i][j] == '1':\\n dp[i*n + j] = 1\\n res = 1\\n \\n x = m-2\\n y = n-2\\n\\n while x >= 0 and y >= 0:\\n i = x\\n for j in reversed(range(n-1)): \\n loc = i*n+ j\\n r1 = dp[i*n + j + 1]\\n b1 = dp[(i+1)*n + j]\\n d1 = dp[(i+1)*n + j + 1]\\n print(i, j, r1, b1, d1)\\n if dp[loc]: dp[loc] = min(r1, b1, d1) + 1\\n j = y\\n for i in reversed(range(m-1)): \\n loc = i*n+ j\\n r1 = dp[i*n + j + 1]\\n b1 = dp[(i+1)*n + j]\\n d1 = dp[(i+1)*n + j + 1]\\n if dp[loc]: dp[loc] = min(r1, b1, d1) + 1\\n if x == 0 and y == 0:\\n x -= 1\\n y -= 1\\n else:\\n x = max(x-1, 0)\\n y = max(y-1, 0)\\n print(dp)\\n return max(dp)**2\\n \\n \\n\\n \",\n \"runtime\": \"957\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n memo = dict()\\n\\n def dp(r, c) -> int:\\n if r >= len(matrix) or c >= len(matrix[r]):\\n return 0\\n\\n if (r,c) not in memo:\\n if matrix[r][c] == \\\"0\\\":\\n memo[(r, c)] = 0\\n if matrix[r][c] == \\\"1\\\":\\n memo[(r, c)] = min(dp(r+1,c), dp(r,c+1), dp(r+1,c+1)) + 1\\n return memo[(r,c)]\\n \\n for ri, r in enumerate(matrix):\\n for ci, c in enumerate(r):\\n dp(ri, ci)\\n \\n ans = 0\\n print(memo.items())\\n for k, v in memo.items():\\n ans = max(ans, v)\\n \\n return ans*ans\\n\",\n \"runtime\": \"957\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n cache = {}\\n def helper(r,c):\\n if r not in range(m) or c not in range(n):\\n return 0\\n if (r,c) in cache:\\n return cache[(r,c)]\\n \\n \\n cache[(r,c)] = 0\\n right = helper(r+1,c)\\n down = helper(r,c+1)\\n diag = helper(r+1,c+1)\\n cache[(r,c)] = 0\\n if matrix[r][c] == \\\"1\\\":\\n \\n cache[(r,c)] = 1+ min(right, down, diag)\\n \\n return cache[(r,c)]\\n helper(0,0)\\n\\n return max(cache.values()) ** 2\\n\",\n \"runtime\": \"974\"\n },\n {\n \"code\": \"from functools import cache\\nimport numpy as np\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n squares = np.zeros((rows+1, cols+1), dtype=int)\\n maximum = 0\\n\\n for r in range(rows-1, -1, -1):\\n for c in range(cols-1, -1, -1):\\n if matrix[r][c] != '0':\\n right = squares[r][c+1]\\n down = squares[r+1][c]\\n diag = squares[r+1][c+1]\\n size = min(right, down) + 1\\n squares[r][c] = size\\n if size - 1 > diag:\\n squares[r][c] -= 1\\n\\n maximum = max(maximum, squares[r][c])\\n \\n #print(squares)\\n return maximum ** 2\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"974\"\n },\n {\n \"code\": \"class Solution:\\n def hasSquare(self, matrix: List[List[str]], n: int) -> bool:\\n N, M = len(matrix), len(matrix[0])\\n good_row = [\\\"1\\\" for i in range(n)]\\n rows = {}\\n for i in range(N):\\n rows[i] = set()\\n for j in range(M+1-n):\\n if matrix[i][j:j+n] == good_row:\\n rows[i].add(j)\\n cols = {}\\n for i in range(N+1-n):\\n cols[i] = rows[i]\\n for j in range(n):\\n cols[i] = cols[i].intersection(rows[i+j])\\n\\n for i in cols:\\n if cols[i] != set():\\n return True\\n return False\\n\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n high = max(len(matrix), len(matrix[0]))\\n low = 0\\n while low < high:\\n mid = (low + high + 1)//2\\n if self.hasSquare(matrix, mid):\\n low = mid\\n else:\\n high = mid - 1\\n return low**2\\n \",\n \"runtime\": \"992\"\n },\n {\n \"code\": \"from functools import cache\\nimport numpy as np\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n squares = np.zeros((rows+1, cols+1), dtype=int)\\n maximum = 0\\n\\n for r in range(rows-1, -1, -1):\\n for c in range(cols-1, -1, -1):\\n if matrix[r][c] != '0':\\n right = squares[r][c+1]\\n down = squares[r+1][c]\\n diag = squares[r+1][c+1]\\n size = min(right, down) + 1\\n squares[r][c] = size\\n if size - 1 > diag:\\n squares[r][c] -= 1\\n\\n maximum = max(maximum, squares[r][c])\\n \\n #print(squares)\\n return maximum ** 2\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"992\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n t = [[0] * n for i in range(m)]\\n def recur(i,j):\\n if i < 0 or j < 0 or i > m-1 or j > n-1:\\n return 0\\n \\n if t[i][j] > 0:\\n return t[i][j]\\n t[i][j] == 0\\n l,d,u = recur(i-1,j),recur(i-1,j-1),recur(i,j-1)\\n if matrix[i][j] == \\\"1\\\":\\n t[i][j] = min(l,d,u)+1\\n return t[i][j]\\n recur(m-1,n-1)\\n #print(t)\\n max_val = 0\\n for i in t:\\n for j in i:\\n max_val = max(max_val,j)\\n return max_val ** 2\",\n \"runtime\": \"1009\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n dp = [[0] * (len(matrix[0])) for _ in range(len(matrix))]\\n max_res = 0\\n for row in range(len(matrix)):\\n for col in range(len(matrix[0])):\\n print(\\\"For row\\\", row, \\\"col\\\", col)\\n if matrix[row][col] == \\\"1\\\":\\n up = 0 if row - 1 < 0 else dp[row - 1][col]\\n left = 0 if col - 1 < 0 else dp[row][col - 1]\\n diag = 0 if (row - 1 < 0 and col - 1 < 0) else dp[row - 1][col - 1]\\n \\n print(\\\"Up, left, diag: \\\", up, left, diag)\\n dp[row][col] = min(up, left, diag) + 1\\n else:\\n print(\\\"Skipping cuz 0\\\")\\n dp[row][col] = 0\\n max_res = max(max_res, dp[row][col])\\n return max_res*max_res\",\n \"runtime\": \"1009\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n n = len(matrix)\\n m = len(matrix[0])\\n\\n dp = [ [0 for i in range(m)] for i in range(n)]\\n\\n if matrix[0][0] == 1:\\n dp[0][0] = 1\\n else:\\n dp[0][0] = 0\\n\\n for i in range(n):\\n for j in range(m):\\n if matrix[i][j] == \\\"1\\\":\\n dp[i][j] = max(dp[i][j], 1)\\n\\n print(i, j, dp[i-1][j], dp[i][j-1], dp[i-1][j-1])\\n if i >= 1 and j >= 1: \\n \\n dp[i][j] = max(dp[i][j], (min(math.sqrt(dp[i-1][j-1]),math.sqrt(dp[i][j-1]), math.sqrt(dp[i-1][j]) ) + 1)**2)\\n #print(\\\"inside \\\", i, j, dp[i][j])\\n\\n maxVal = -1\\n for l in dp:\\n for num in l:\\n maxVal = max(maxVal, num)\\n\\n\\n\\n return int(maxVal)\\n\\n # 0 0 0 1\\n # 1 1 0 1\\n # 1 1 1 1\\n # 0 1 1 1\\n # 0 1 1 1 \",\n \"runtime\": \"1027\"\n },\n {\n \"code\": \"class Solution:\\n # [\\n # [1 0 1 0 0] [1 0 1 0 0]\\n # [1 0 3 2 1] [1 0 1 2 3]\\n # [5 4 3 2 1] [1 2 3 4 5]\\n # [1 0 0 1 0] [1 0 0 1 0]\\n #]\\n # [\\n # [4 0 3 0 0] [1 0 1 0 0]\\n # [3 0 2 3 2] [2 0 2 1 1]\\n # [2 1 1 2 1] [3 1 3 2 2]\\n # [1 0 0 1 0] [4 0 0 3 0]\\n #]\\n #[\\n # [1 0 1 0 0] [1 0 1 0 0]\\n # [1 0 2 2 1] [1 0 1 1 1]\\n # [2 1 1 2 1] [1 1 3 2 2]\\n # [1 0 0 1 0] [1 0 0 1 0]\\n #] \\n\\n def c(self, s_max, matrix):\\n for ri in range(len(matrix) - s_max + 1):\\n for ci in range(len(matrix[0]) - s_max + 1):\\n for i in range(ri, s_max + ri):\\n if \\\"0\\\" in matrix[i][ci: ci + s_max]:\\n break\\n else:\\n return True\\n\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n s_max = 0\\n while s_max <= min(len(matrix), len(matrix[0])):\\n s_max += 1\\n # check next s_max\\n if not self.c(s_max, matrix):\\n return (s_max - 1) ** 2\\n return s_max ** 2\\n\\n\\n\\n \",\n \"runtime\": \"1027\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n memo = {} # (i, j):maxSquare\\n def dfs(i, j):\\n # out of bound or '0' in matrix, return 0\\n # base case - last row, col\\n # if in memo, return memo[pos]\\n if i >= len(matrix) or j >= len(matrix[0]):\\n return 0\\n if i == len(matrix) - 1 or j == len(matrix[0]) - 1 or matrix[i][j] == '0':\\n memo[(i, j)] = int(matrix[i][j])\\n return memo[(i, j)]\\n if (i, j) in memo:\\n return memo[(i, j)]\\n\\n # i, j itself 0 -> 0\\n # if one of the neighbor is '0' -> store and return the matrix[i][j] itself\\n minSquare = float('inf')\\n for dr, dc in [(1, 0), (0, 1), (1, 1)]:\\n nei = dfs(i + dr, j + dc)\\n if nei == 0:\\n memo[(i, j)] = int(matrix[i][j])\\n return memo[(i, j)]\\n minSquare = min(minSquare, nei)\\n # max square of (i, j) -> min(minSquare of neighbor) + 1\\n memo[(i, j)] = minSquare + 1\\n return memo[(i, j)]\\n \\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n dfs(r, c) # being top left start point\\n\\n # iterate through memo to get max square\\n maxSquare = 0\\n for r, c in memo:\\n maxSquare = max(maxSquare, memo[(r, c)])\\n return maxSquare * maxSquare\",\n \"runtime\": \"1062\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\n0 1\\n1 0\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n dp = {}\\n \\n def dfs(r: int, c: int) -> int:\\n if (r not in range(ROWS) or\\n c not in range(COLS)\\n ):\\n return 0\\n \\n if (r,c) in dp:\\n return dp[(r,c)]\\n \\n if matrix[r][c] == '1':\\n dp[(r,c)] = 1 + min(dfs(r-1, c-1), dfs(r-1,c), dfs(r,c-1))\\n return dp[(r,c)]\\n else:\\n dp[(r,c)] = 0\\n return dp[(r,c)]\\n \\n for r in range(ROWS):\\n for c in range(COLS):\\n dfs(r, c)\\n \\n length = max(dp.values())\\n return length * length\\n\",\n \"runtime\": \"1062\"\n },\n {\n \"code\": \"import copy\\nimport numpy as np\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n A = [[int(s) for s in row] for row in matrix]\\n # print(A)\\n for x in range(1, m):\\n for y in range(1, n):\\n # print(x, y, matrix[x][y])\\n if matrix[x][y] == '0' or A[x-1][y-1] == 0:\\n # print(\\\"VAL\\\", matrix[x][y])\\n continue\\n\\n max_square_diag_sub_1 = A[x-1][y-1]\\n d = 1\\n while d <= max_square_diag_sub_1:\\n max_square_adj_sub_1 = min(A[x-d][y], A[x][y-d])\\n print(f\\\"A[{x-d}][{y}], A[{x}][{y-d}]\\\", A[x-d][y], A[x][y-d], max_square_adj_sub_1, max_square_diag_sub_1)\\n if max_square_adj_sub_1 == 0:\\n break\\n else:\\n d += max_square_adj_sub_1\\n # print('d', d)\\n if d > max_square_diag_sub_1:\\n A[x][y] = 1 + max_square_diag_sub_1\\n elif d == max_square_diag_sub_1:\\n A[x][y] = min(max_square_diag_sub_1, d)\\n else:\\n A[x][y] = 1\\n \\n # print(A)\\n return np.max(A)**2\\n \\n \\\"\\\"\\\"\\n 0001\\n 1101\\n 1111\\n 0111\\n 0111\\n\\n 0001\\n 1101\\n 1211\\n 0112\\n 0122\\n \\\"\\\"\\\"\\n \\n # Check diagonal\\n\\n # # Brute force, slide window of size k=[m, 1] x [n, 1] and check if all 1's\\n\\n # # In order for matrix[x][y] to be part of a square, it must:\\n # # 1) Be a 1\\n # # 2) at least 2/4 cardinal neighbors are a 1\\n # # 3) at least 1 diagonal neighbor between 1's neighbors is a 1\\n\\n # # Start at 0, 0 if matrix[x][y] == 1\\n # # 1) Move right until finding another 1, so you have a streak of W ones \\n # # 2) Move down one row, and repeat \\n\\n\\n # m, n = len(matrix), len(matrix[0])\\n # start_x, start_y = 0, 0\\n # best_1s = 0\\n # while start_x < m and start_y < n:\\n # x, y = start_x, start_y\\n # min_x_1s, min_y_1s = m, n\\n # x_1s, y_1s = 0, 0\\n\\n # while x < min_x_1s:\\n # # Move right\\n # while matrix[x][y] == 1 and y < min(n, min_y_1s):\\n # y_1s += 1\\n # y += 1\\n # matrix[x][y] = 0\\n\\n # if y_1s == 0:\\n # # No ones in this row, check next row and reset num_0s\\n # start_x = x + 1\\n # start_y = 0\\n # best_1s = min(best_1s, min(min_x_1s, min_y_1s))\\n \\n # min_x_1s, min_y_1s = m, n\\n # x_1s, y_1s = 0, 0\\n\\n # break\\n\\n # if y_1s < min_y_1s:\\n # # Smaller row of 1s\\n # min_y_1s = y_1s\\n # elif y_1s > min_y_1s:\\n # # Reset \\n # x_1s += 1\\n \\n # min_x_1s = min(min_x_1s, x_1s)\\n # if min_x_1s == min_y_1s:\\n # best_1s = max(best_1s, min_x_1s)\\n\\n\\n \",\n \"runtime\": \"1080\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n\\n dp = [[0 for j in range(n + 1)] for i in range(m + 1)]\\n dp[1][1] = int(matrix[0][0])\\n\\n for i in range(2, m + 1):\\n dp[i][1] = dp[i-1][1] + int(matrix[i - 1][0])\\n\\n for j in range(2, n + 1):\\n dp[1][j] = dp[1][j-1] + int(matrix[0][j - 1])\\n \\n # for row in dp:\\n # print(row)\\n # return -1\\n for i in range(2, m + 1):\\n for j in range(2, n + 1):\\n dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + int(matrix[i - 1][j - 1])\\n \\n\\n def isValidSquare(r, c, length):\\n area = dp[r][c] - dp[r - length][c] - dp[r][c - length] + dp[r - length][c - length]\\n if area == length ** 2:\\n return True\\n return False\\n \\n out = 0\\n for r in range(1, m + 1):\\n for c in range(1, n + 1):\\n left, right = 1, min(r, c)\\n while left <= right:\\n mid = (left + right) // 2\\n if isValidSquare(r, c, mid):\\n out = max(out, mid)\\n left = mid + 1\\n else:\\n right = mid - 1\\n\\n return out ** 2\\n\",\n \"runtime\": \"1080\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n R, C = len(matrix), len(matrix[0])\\n\\n sums = [[0 for c in range(C + 1)] for r in range(R + 1)]\\n\\n for r in range(1, R + 1):\\n for c in range(1, C + 1):\\n sums[r][c] = sums[r][c - 1] + sums[r - 1][c] - sums[r - 1][c - 1] + int(matrix[r - 1][c - 1])\\n\\n result = 0\\n\\n for r in range(1, R + 1):\\n for c in range(1, C + 1):\\n if matrix[r - 1][c - 1] == \\\"0\\\":\\n continue\\n\\n st, en = 1, min(R - r + 1, C - c + 1)\\n while en - st > 1:\\n md = (st + en) // 2\\n if sums[r + md - 1][c + md - 1] - sums[r + md - 1][c - 1] - sums[r - 1][c + md - 1] + sums[r - 1][c - 1] == md * md:\\n st = md\\n else:\\n en = md\\n if sums[r + en - 1][c + en - 1] - sums[r + en - 1][c - 1] - sums[r - 1][c + en - 1] + sums[r - 1][c - 1] == en * en:\\n st = en\\n\\n result = max(result, st)\\n\\n return result * result\\n\",\n \"runtime\": \"1097\"\n },\n {\n \"code\": \"class Solution:\\n \\\"\\\"\\\"\\n 0 0 0 1\\n 1 1 0 1\\n 1 1 1 1 \\n 0 1 1 1\\n 0 1 1 1\\n \\\"\\\"\\\"\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n dp = [[(float('inf'), float('inf')) for i in range(len(matrix[0]))] for j in range(len(matrix))] #Record the top left corner of the square\\n \\n out = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if matrix[i][j] == \\\"0\\\":\\n continue\\n\\n dp[i][j] = (i, j) #2 3\\n out = max(out, 1)\\n if i == 0 or j == 0:\\n continue\\n\\n new_top_left = dp[i - 1][j - 1] #1, 2\\n if new_top_left != (float('inf'), float('inf')):\\n left_res_y, left_res_x = dp[i][j - 1] # 2 2\\n up_res_y, up_res_x = dp[i - 1][j] # 1 3\\n\\n new_coords = (max(up_res_y, new_top_left[0]), max(left_res_x, new_top_left[1]))\\n diagonal = min(i - new_coords[0], j - new_coords[1])\\n\\n if new_coords[0] == float('inf') or new_coords[1] == float('inf'):\\n continue\\n dp[i][j] = (i - diagonal, j - diagonal)\\n out = max(out, (i - dp[i][j][0] + 1) * (j - dp[i][j][1] + 1))\\n \\n return out\\n \\n\\n\\n\\n\\n \\n\\n\",\n \"runtime\": \"1097\"\n },\n {\n \"code\": \"'''\\n\\nBrute force solution:\\n- Scan each position\\n- Keep expanding the squares outwards...\\n\\nO(n^4) assuming a square input matrix.\\n\\nDP:\\n- largest[i,j] =\\n if mat[i][j] = 0\\n 0\\n else:\\n res = 1\\n expansion_width = min(largest[i+1, j+1], right[i+1, j], down[i, j+1])\\n if expansion_width > 0:\\n res = (expansion_width + 1) ** 2\\n\\n'''\\n\\ndef right(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\\n if not 0 <= i < len(mat):\\n return 0\\n if not 0 <= j < len(mat[0]):\\n return 0\\n \\n if mat[i][j] == '0':\\n return 0\\n\\n key = ('right', i, j)\\n if key in cache:\\n return cache[key]\\n \\n res = 1 + right(mat, i, j+1, cache)\\n\\n cache[key] = res\\n return res\\n\\ndef down(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\\n if not 0 <= i < len(mat):\\n return 0\\n if not 0 <= j < len(mat[0]):\\n return 0\\n \\n if mat[i][j] == '0':\\n return 0\\n \\n key = ('down', i, j)\\n if key in cache:\\n return cache[key]\\n \\n res = 1 + down(mat, i+1, j, cache)\\n\\n cache[key] = res\\n return res\\n\\ndef largest(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\\n if not 0 <= i < len(mat):\\n return 0\\n if not 0 <= j < len(mat[0]):\\n return 0\\n\\n if mat[i][j] == '0':\\n return 0\\n \\n key = ('largest', i, j)\\n if key in cache:\\n return cache[key]\\n\\n res = 1\\n res += min(\\n largest(mat, i+1, j+1, cache),\\n min(\\n right(mat, i, j+1, cache),\\n down(mat, i+1, j, cache)\\n )\\n )\\n\\n cache[key] = res\\n return res\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n best = 0\\n cache = {}\\n for i in range(len(matrix)):\\n for j in range(len(matrix[i])):\\n best = max(best, largest(matrix, i, j, cache) ** 2)\\n return best\\n\\n'''\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\",\\\"0\\\",\\\"0\\\"]\\n[\\\"0\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\",\\\"0\\\",\\\"0\\\"]\\n'''\",\n \"runtime\": \"1115\"\n },\n {\n \"code\": \"'''\\n\\nBrute force solution:\\n- Scan each position\\n- Keep expanding the squares outwards...\\n\\nO(n^4) assuming a square input matrix.\\n\\nDP:\\n- largest[i,j] =\\n if mat[i][j] = 0\\n 0\\n else:\\n res = 1\\n expansion_width = min(largest[i+1, j+1], right[i+1, j], down[i, j+1])\\n if expansion_width > 0:\\n res = (expansion_width + 1) ** 2\\n\\n'''\\n\\ndef right(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\\n if not 0 <= i < len(mat):\\n return 0\\n if not 0 <= j < len(mat[0]):\\n return 0\\n \\n if mat[i][j] == '0':\\n return 0\\n\\n key = (1, i, j)\\n if key in cache:\\n return cache[key]\\n \\n res = 1 + right(mat, i, j+1, cache)\\n\\n cache[key] = res\\n return res\\n\\ndef down(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\\n if not 0 <= i < len(mat):\\n return 0\\n if not 0 <= j < len(mat[0]):\\n return 0\\n \\n if mat[i][j] == '0':\\n return 0\\n \\n key = (2, i, j)\\n if key in cache:\\n return cache[key]\\n \\n res = 1 + down(mat, i+1, j, cache)\\n\\n cache[key] = res\\n return res\\n\\ndef largest(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\\n if not 0 <= i < len(mat):\\n return 0\\n if not 0 <= j < len(mat[0]):\\n return 0\\n\\n if mat[i][j] == '0':\\n return 0\\n \\n key = (0, i, j)\\n if key in cache:\\n return cache[key]\\n\\n res = 1\\n res += min(\\n largest(mat, i+1, j+1, cache),\\n min(\\n right(mat, i, j+1, cache),\\n down(mat, i+1, j, cache)\\n )\\n )\\n\\n cache[key] = res\\n return res\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n best = 0\\n cache = {}\\n for i in range(len(matrix)):\\n for j in range(len(matrix[i])):\\n best = max(best, largest(matrix, i, j, cache) ** 2)\\n return best\\n\\n'''\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\",\\\"0\\\",\\\"0\\\"]\\n[\\\"0\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\",\\\"0\\\",\\\"0\\\"]\\n'''\",\n \"runtime\": \"1115\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n def check_matrix(i_min, i_max, j_min, j_max) -> bool:\\n def check_row(row, j_min, j_max) -> bool:\\n return all(row[j_min:j_max+1])\\n return all(check_row(matrix[i], j_min, j_max) for i in range(i_min, i_max+1))\\n\\n m = len(matrix)\\n n = len(matrix[0])\\n for row in matrix:\\n for j in range(n):\\n row[j] = int(row[j])\\n\\n res = int(any(any(row) for row in matrix))\\n if not res:\\n return 0\\n\\n for i in range(m):\\n if i + res >= m:\\n break\\n for j in range(n):\\n if j + res >= n:\\n break\\n while check_matrix(i, i+res, j, j+res):\\n res += 1\\n if i + res == m or j + res == n:\\n break\\n\\n return res**2\",\n \"runtime\": \"1132\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n visited = defaultdict(int) # (x, y)\\n def dfs(x, y):\\n if x >= ROWS or y >= COLS:\\n return 0\\n if (x, y) in visited:\\n return visited[(x, y)]\\n \\n down = dfs(x, y + 1)\\n right = dfs(x + 1, y)\\n bottom_right = dfs(x + 1, y + 1)\\n \\n print(ROWS)\\n print(COLS)\\n print((x, y))\\n if matrix[x][y] == \\\"1\\\":\\n visited[(x, y)] = min(down, right, bottom_right) + 1\\n else:\\n visited[(x, y)] = 0\\n return visited[(x, y)]\\n \\n dfs(0, 0)\\n answer = 0\\n for key, value in visited.items():\\n answer = max(value, answer)\\n return answer * answer\\n\\n\\n \\n\\n \",\n \"runtime\": \"1132\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n \\n matrixSquare = [ [0 if r =='0' else 1 for r in c] for c in matrix] \\n maximal = max([max(m) for m in matrixSquare] )\\n print(maximal)\\n for i in range(1, len(matrix)):\\n for j in range(1, len(matrix[0])):\\n dirs = [matrixSquare[i-1][j],matrixSquare[i][j-1], matrixSquare[i-1][j-1]]\\n if min(dirs) > 0 and matrixSquare[i][j] == 1:\\n matrixSquare[i][j] = min(dirs) + 1\\n if matrixSquare[i][j] > maximal:\\n maximal = matrixSquare[i][j]\\n if max(dirs) > maximal:\\n maximal = max(dirs)\\n print(i, j, dirs, min(dirs), max(dirs), matrixSquare[i][j], maximal)\\n \\n print(matrixSquare)\\n return maximal **2\",\n \"runtime\": \"1150\"\n },\n {\n \"code\": \"import numpy as np\\n\\n\\nclass Solution:\\n def isInBounds(self, m, n, x, y):\\n inbounds = 0 <= x < m and 0 <= y < n\\n return inbounds\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n calc = np.zeros((m, n))\\n largest_side = 0\\n for i in range(m):\\n for j in range(n):\\n north = calc[i - 1][j] if self.isInBounds(m, n, i - 1, j) else 0\\n west = calc[i][j - 1] if self.isInBounds(m, n, i, j - 1) else 0\\n northwest = calc[i - 1][j - 1] if self.isInBounds(m, n, i - 1, j - 1) else 0\\n val = 1 + min(north, west, northwest)\\n calc[i][j] = val if int(matrix[i][j]) > 0 else 0\\n largest_side = max(calc[i][j], largest_side)\\n return int(largest_side ** 2)\\n\",\n \"runtime\": \"1150\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n dp = np.zeros((m,n))\\n for i in range(m):\\n dp[i][0] = int(matrix[i][0])\\n for j in range(n):\\n dp[0][j] = int(matrix[0][j])\\n res1 = np.max(dp[0, :])\\n res2 = np.max(dp[:,0])\\n res = max([res1, res2])\\n for i in range(1, m):\\n for j in range(1, n):\\n if matrix[i][j]=='1':\\n side2 = min([dp[i-1][j-1], dp[i][j-1], dp[i-1][j]])\\n dp[i][j] = (np.sqrt(side2)+1)**2\\n res = max(res, dp[i][j])\\n \\n return int(res)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # m, n = len(matrix), len(matrix[0])\\n # dp = [[0]*(n+1) for i in range(m+1)]\\n # res = 0\\n # for i in range(m):\\n # for j in range(n):\\n # if matrix[i][j]==\\\"1\\\":\\n # dp[i+1][j+1]==1\\n # dp[i+1][j+1] = (np.sqrt(min([dp[i][j],dp[i+1][j], dp[i][j+1] ]))+1)**2\\n # res = max(res, dp[i+1][j+1])\\n # #print(dp)\\n # return int(res)\\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 # for i in range(m):\\n # for j in range(n):\\n # if matrix[i][j]=='1':\\n # dp[i+1][j+1] = (sqrt(min([dp[i][j], dp[i+1][j], dp[i][j+1]]))+1)**2\\n # if dp[i+1][j+1]>res:\\n # res = dp[i+1][j+1]\\n # return int(res)\\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 # m1 = np.zeros((m, n), dtype=int)\\n # res = 0\\n # for i in range(m):\\n # m1[i][0] = int(matrix[i][0])\\n # res = max(res, m1[i][0])\\n # for j in range(n):\\n # m1[0][j] = int(matrix[0][j])\\n # res = max(res, m1[0][j])\\n # #print(res)\\n # for i in range(1, m):\\n # for j in range(1, n):\\n # if int(matrix[i][j]) == 1:\\n # res1 = min([m1[i][j-1], m1[i-1][j-1], m1[i-1][j]]) + 1\\n # m1[i][j] = res1\\n # res = max(res, res1)\\n # print(m1)\\n # return res*res\\n\",\n \"runtime\": \"1168\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n matrix[i][j] = int(matrix[i][j])\\n\\n for i in range(len(matrix) - 1):\\n for j in range(len(matrix[0])):\\n if matrix[i][j] > 0 and matrix[i + 1][j] > 0:\\n matrix[i + 1][j] += matrix[i][j]\\n \\n print(matrix)\\n\\n maxSq = 0\\n for sq in range(1, min(len(matrix), len(matrix[0])) + 1):\\n if sq > maxSq + 1:\\n break\\n\\n for row in matrix:\\n count = 0\\n for x in row:\\n if x < sq:\\n count = 0\\n else:\\n count += 1\\n if count == sq:\\n maxSq = sq\\n break\\n \\n return maxSq ** 2\",\n \"runtime\": \"1185\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n ans = 0\\n rows = len(matrix)\\n cols = len(matrix[0])\\n \\n @cache\\n def dfs(row, col):\\n if row >= len(matrix) or col >= len(matrix[0]) or matrix[row][col] == \\\"0\\\":\\n return 0\\n\\n\\n print(row, col, matrix[row][col], \\\"before\\\")\\n\\n # explore for each its down right and diag side\\n down = dfs(row+1, col)\\n right = dfs(row, col+1)\\n diag = dfs(row+1, col+1)\\n\\n print(row, col, matrix[row][col], \\\"after\\\")\\n\\n # beacuse we will have cases where some sides are greater\\n # getting the min \\n return min(down, right, diag) + 1\\n\\n res = float(\\\"-inf\\\")\\n\\n for i in range(rows):\\n for j in range(cols):\\n if matrix[i][j] == '1':\\n val = dfs(i,j)\\n res = max(res, val)\\n\\n if res > 0:\\n return res ** 2\\n \\n return 0\\n \\n\",\n \"runtime\": \"1185\"\n },\n {\n \"code\": \"class Solution:\\n\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n self.matrix = matrix\\n self.square_cache = {}\\n self.hor_cache = {}\\n self.ver_cache = {}\\n\\n output = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n curr = self.maximalSquareEndingAt(i, j)\\n if curr > output:\\n output = curr\\n return output**2\\n\\n @lru_cache\\n def maximalSquareEndingAt(self, i, j):\\n cache = self.square_cache\\n matrix = self.matrix\\n # print(cache)\\n if (i, j) in cache:\\n return cache[(i, j)]\\n\\n if i < 0 or j < 0:\\n return 0\\n val = matrix[i][j]\\n if val == \\\"0\\\":\\n return 0\\n \\n maximalSquareNeighbor = self.maximalSquareEndingAt(i-1, j-1)\\n longestHorizontalLeft = self.longestHorizontalEndingAt(i, j-1)\\n longestVerticalAbove = self.longestVerticalEndingAt(i-1, j)\\n output = 1 + min(\\n maximalSquareNeighbor,\\n longestHorizontalLeft,\\n longestVerticalAbove,\\n )\\n cache[(i, j)] = output\\n return output \\n\\n @lru_cache\\n def longestHorizontalEndingAt(self, i, j):\\n cache = self.hor_cache\\n matrix = self.matrix\\n if (i, j) in cache:\\n return cache[(i, j)]\\n if j < 0:\\n return 0\\n val = matrix[i][j]\\n if val == \\\"0\\\":\\n return 0\\n \\n output = 1 + self.longestHorizontalEndingAt(i, j-1)\\n cache[(i, j)] = output\\n return output\\n\\n @lru_cache\\n def longestVerticalEndingAt(self, i, j):\\n cache = self.ver_cache\\n matrix = self.matrix\\n if (i, j) in cache:\\n return cache[(i, j)]\\n if i < 0:\\n return 0\\n val = matrix[i][j]\\n if val == \\\"0\\\":\\n return 0\\n \\n output = 1 + self.longestVerticalEndingAt(i-1, j)\\n cache[(i, j)] = output\\n return output\\n\",\n \"runtime\": \"1203\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n num_1s = [[0 for _ in range(len(matrix[0]))] for _ in range(len(matrix))]\\n for i in range(len(matrix)):\\n row_1s = 0\\n for j in range(len(matrix[0])):\\n row_1s += int(matrix[i][j])\\n col_1s = num_1s[i - 1][j] if i >= 0 else 0\\n num_1s[i][j] = row_1s + col_1s\\n max_square = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n lo = 0\\n hi = min(len(matrix), len(matrix[0])) + 1\\n while lo < hi:\\n mid = lo + (hi - lo) // 2\\n works = False\\n if mid != 0:\\n left_ones = num_1s[i][j - mid] if j - mid >= 0 else 0\\n top_ones = num_1s[i - mid][j] if i - mid >= 0 else 0\\n overlap_ones = num_1s[i - mid][j - mid] if i - mid >= 0 and j - mid >= 0 else 0\\n cur_num_ones = num_1s[i][j] - left_ones - top_ones + overlap_ones\\n works = cur_num_ones == mid * mid\\n else:\\n lo = 1\\n hi = 1\\n break\\n if works:\\n lo = mid + 1\\n else:\\n hi = mid\\n\\n max_square = max(max_square, (lo - 1) * (lo - 1))\\n return max_square\\n \\n\\n\",\n \"runtime\": \"1220\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0]) \\n maxi = 0\\n dp = {}\\n def recurr(i, j):\\n nonlocal maxi\\n if i >= m or j >= n:\\n return 0\\n if (i, j) not in dp.keys():\\n right = recurr(i, j + 1)\\n bottom_right = recurr(i + 1, j + 1)\\n bottom = recurr(i + 1, j)\\n if matrix[i][j] == '0':\\n return 0\\n mini = min(right, bottom_right, bottom) + 1 \\n dp[(i, j)] = mini\\n maxi = max(maxi, mini)\\n return dp[(i, j)]\\n recurr(0,0)\\n return maxi ** 2\",\n \"runtime\": \"1220\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n return topDown(matrix)\\n \\n\\ndef topDown(matrix):\\n \\\"\\\"\\\"\\n max size of a square starting at i,j is\\n 0 if matrix[i][j] is zero else\\n 1 + min( max size of a square starting at its right,bottom,bottom-right neighbors)\\n \\\"\\\"\\\"\\n\\n # Rows\\n m = len(matrix)\\n # Cols\\n n = len(matrix[0])\\n\\n # record the max square size starting at i,j and exapnding to right and bottom\\n memo = {}\\n\\n valid = lambda x,y: x >= 0 and x < m and y >= 0 and y < n\\n\\n def dp(i, j):\\n \\n if (i, j) in memo:\\n return memo[(i, j)]\\n\\n # If this location is invalid ie doesn't exist on the grid return 0 as this\\n # can never give a square\\n if not valid(i, j):\\n return 0\\n \\n cur_val = matrix[i][j]\\n # A square cannot start at zero so size of max square for this loc is 0\\n if cur_val == \\\"0\\\":\\n memo[(i, j)] = 0 \\n else:\\n neighbors = [\\n (i+1, j), # bottom\\n (i, j+1), # right\\n (i+1, j+1) # bottom right\\n ]\\n # Size of max square that can start at this location is nothing but\\n # the minimum of size of max squares that start at its neigbhors + 1\\n memo[(i, j)] = 1 + min( \\n [dp(x, y) for x,y in neighbors]\\n )\\n print(f\\\"i: {i}, j: {j}, size: {memo[(i, j)]}\\\")\\n return memo[(i, j)]\\n\\n max_square = 0\\n for i in range(m):\\n for j in range(n):\\n max_square = max(max_square, dp(i, j))\\n return max_square**2\\n\\n\\n \\n \\n \",\n \"runtime\": \"1238\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n if not matrix:\\n return 0\\n rows, cols = len(matrix), len(matrix[0])\\n max_size = 0\\n\\n memo = {}\\n\\n def dp(r: int, c: int) -> int:\\n nonlocal max_size\\n if r > rows - 1 or c > cols - 1:\\n return 0\\n if r == rows - 1 or c == cols - 1:\\n memo[(r, c)] = int(matrix[r][c])\\n dp(r, c + 1)\\n dp(r + 1, c)\\n dp(r + 1, c + 1)\\n max_size = max(max_size, memo[(r, c)])\\n return memo[(r, c)]\\n if (r, c) in memo:\\n return memo[(r, c)]\\n max_square_here = int(matrix[r][c]) + min(\\n dp(r, c + 1), dp(r + 1, c), dp(r + 1, c + 1)\\n )\\n if matrix[r][c] == \\\"0\\\":\\n max_square_here = 0\\n\\n memo[(r, c)] = max_square_here\\n max_size = max(max_size, memo[(r, c)])\\n return memo[(r, c)]\\n\\n dp(0, 0)\\n return max_size * max_size\",\n \"runtime\": \"1255\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n \\n m = len(matrix)\\n n = len(matrix[0])\\n\\n prev_ends = set()\\n ends = {(i, j) for i in range(m) for j in range(n) if matrix[i][j] == \\\"1\\\"}\\n\\n k = 1\\n while ends:\\n prev_ends = ends\\n ends = {(i, j) for (i, j) in ends if {(i - k, j), (i, j - k), (i - k, j - k)} <= ends}\\n k *= 2\\n \\n k //= 2\\n\\n if k == 0:\\n return 0\\n\\n ends = prev_ends\\n while ends:\\n ends = {(i, j) for (i, j) in ends if {(i - 1, j), (i, j - 1), (i - 1, j - 1)} <= ends}\\n k += 1\\n\\n k -= 1\\n\\n return k * k\\n\\n\\n\\n\\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"1255\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n result = 0\\n \\n for i in range(m):\\n for j in range(n):\\n if matrix[i][j] == '1':\\n #print('i, j {} {}'.format(i,j))\\n temp = 1\\n max_len = min(m - i, n - j)\\n if (max_len) ** 2 <= result:\\n break\\n for k in range(1, max_len):\\n #print(' k {}'.format(k))\\n valid = True\\n for t in range(0, k+1):\\n if matrix[i+k][j+t] == '0':\\n valid = False\\n break\\n if matrix[i+t][j+k] == '0':\\n valid = False\\n break \\n\\n #print(' valid {}'.format(valid))\\n if valid:\\n temp = (k + 1) ** 2\\n else:\\n break\\n if temp > result:\\n result = temp\\n return result\",\n \"runtime\": \"1273\"\n },\n {\n \"code\": \"class Solution:\\n def isExtendSquare(self, ur, bl):\\n x1 , y1 = ur\\n x2 , y2 = bl\\n for i in range(x1, x2+1):\\n if self._matrix[i][y1] != '1':\\n return False\\n for j in range(y2, y1):\\n if self._matrix[x2][j] != '1':\\n return False\\n return True\\n\\n def isSquare(self, c, ur, bl)-> bool:\\n x0, y0 = c\\n x1, y1 = ur\\n x2, y2 = bl\\n for i in range(x2, x0-1,-1):\\n for j in range(y1, y0-1, -1):\\n if self._matrix[i][j] != '1':\\n return False\\n return True\\n \\n def findmax(self):\\n for i in range(self._m-1):\\n \\n for j in range(self._n-1):\\n if self._matrix[i][j] == '1': \\n if self._ms == 0: \\n self._ms = 1\\n p = self._ms \\n c = [i,j]\\n ur = [i, j+p]\\n bl = [i+p,j]\\n if ur[1] >= self._n or bl[0] >= self._m:\\n break\\n \\n if self.isSquare(c, ur, bl):\\n self._ms = p+1\\n while True:\\n ur[1] += 1\\n bl[0] += 1\\n if ur[1] >= self._n or bl[0] >= self._m:\\n break\\n if self.isExtendSquare(ur, bl):\\n self._ms += 1\\n else:\\n break\\n \\n \\n \\n \\n\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n self._matrix = matrix\\n self._m = len(matrix)\\n self._n = len(matrix[0])\\n self._ms = 0\\n if self._m == 1:\\n if '1' in matrix[0]:\\n return 1\\n else:\\n return 0\\n if self._n == 1:\\n if '1' in [matrix[i][0] for i in range(self._m)]:\\n return 1\\n else:\\n return 0\\n \\n self.findmax()\\n if self._ms == 0:\\n if '1' in [self._matrix[i][j] for i in range(self._m) for j in range(self._n)]:\\n return 1\\n else:\\n return 0\\n return self._ms**2\\n \\n \",\n \"runtime\": \"1291\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n\\n max_len = 0\\n for row in range(m):\\n for col in range(n):\\n max_potential = min(n - col, m - row)\\n if max_potential <= max_len:\\n break\\n level = 0\\n failure = False\\n while not failure and level < max_potential:\\n for j in range(level + 1):\\n if matrix[row + level][col + j] == \\\"0\\\" or matrix[row + j][col + level] == \\\"0\\\":\\n failure = True\\n break\\n\\n if not failure:\\n level += 1\\n\\n max_len = max(max_len, level)\\n\\n\\n return max_len * max_len\",\n \"runtime\": \"1291\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n prefixs = np.zeros((rows+1, cols+1), dtype=int)\\n for r in range(1, rows+1):\\n for c in range(1, cols+1):\\n #print(r,c)\\n val = 0 if matrix[r-1][c-1] == '0' else 1\\n prefixs[r][c] = prefixs[r-1][c] + prefixs[r][c-1] - prefixs[r-1][c-1] + val\\n #print(prefixs)\\n\\n def contains_square(size: int) -> bool:\\n assert 0 <= size <= min(rows, cols)+1, f\\\"assert 0 <= {size} <= min({rows}, {cols})\\\"\\n max_coverage = size * size\\n for (r, c) in product(range(1,rows-size+2), range(1,cols-size+2)):\\n #print(r, c)\\n coverage = prefixs[r+size-1][c+size-1] - prefixs[r-1][c+size-1] - prefixs[r+size-1][c-1] + prefixs[r-1][c-1]\\n #print(f\\\"r={r}, c={c}, size={size}, coverage={coverage}\\\")\\n if coverage == max_coverage:\\n #print(r, c)\\n return True\\n return False\\n \\n lo, hi = 0, min(rows, cols)\\n while lo < hi:\\n mid = lo + (hi - lo + 1) // 2\\n #print(f\\\"lo={lo}, mid={mid}, hi={hi}\\\")\\n if contains_square(mid):\\n #print(f\\\"lo = {mid}\\\")\\n lo = mid\\n else:\\n #print(f\\\"hi = {mid-1}\\\")\\n hi = mid - 1\\n #print(f\\\"res={mid}\\\")\\n \\n return lo * lo\\n\\n\\n\",\n \"runtime\": \"1308\"\n },\n {\n \"code\": \"class Solution:\\n def isExtendSquare(self, ur, bl):\\n x1 , y1 = ur\\n x2 , y2 = bl\\n for i in range(x1, x2+1):\\n if self._matrix[i][y1] != '1':\\n return False\\n for j in range(y2, y1):\\n if self._matrix[x2][j] != '1':\\n return False\\n return True\\n\\n def isSquare(self, c, ur, bl)-> bool:\\n x0, y0 = c\\n x1, y1 = ur\\n x2, y2 = bl\\n for i in range(x2, x0-1,-1):\\n for j in range(y1, y0-1, -1):\\n if self._matrix[i][j] != '1':\\n return False\\n return True\\n \\n def findmax(self):\\n for i in range(self._m-1):\\n \\n for j in range(self._n-1):\\n if self._matrix[i][j] == '1': \\n if self._ms == 0: \\n self._ms = 1\\n p = self._ms \\n c = [i,j]\\n ur = [i, j+p]\\n bl = [i+p,j]\\n if ur[1] >= self._n or bl[0] >= self._m:\\n break\\n \\n if self.isSquare(c, ur, bl):\\n self._ms = p+1\\n while True:\\n ur[1] += 1\\n bl[0] += 1\\n if ur[1] >= self._n or bl[0] >= self._m:\\n break\\n if self.isExtendSquare(ur, bl):\\n self._ms += 1\\n else:\\n break\\n \\n \\n \\n \\n\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n self._matrix = matrix\\n self._m = len(matrix)\\n self._n = len(matrix[0])\\n self._ms = 0\\n if self._m == 1:\\n if '1' in matrix[0]:\\n return 1\\n else:\\n return 0\\n if self._n == 1:\\n if '1' in [matrix[i][0] for i in range(self._m)]:\\n return 1\\n else:\\n return 0\\n \\n self.findmax()\\n if self._ms == 0:\\n if '1' in [self._matrix[i][j] for i in range(self._m) for j in range(self._n)]:\\n return 1\\n else:\\n return 0\\n return self._ms**2\\n \\n \",\n \"runtime\": \"1308\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n \\n \\n # 568ms, 19.4mb\\n \\n \\n \\n # for i in range(len(matrix)-1, -1, -1):\\n # for j in range(len(matrix[0])-1, -1, -1):\\n # matrix[i][j] = int(matrix[i][j])\\n # if i+1 == len(matrix) or j+1 == len(matrix[0]):\\n #continue\\n # if matrix[i][j] == 1:\\n # matrix[i][j] = min(matrix[i][j+1], matrix[i+1][j], matrix[i+1][j+1]) + 1\\n \\n \\n \\n \\n # biggest_square = 0\\n # print(biggest_square)\\n # for i in range(len(matrix)):\\n # for j in range(len(matrix[0])):\\n # biggest_square = max(biggest_square, matrix[i][j])\\n \\n # return biggest_square ** 2\\n \\n\\n #neet code solution: from up left reaching bottom right in rec way\\n \\n memo = {}\\n def rec(i, j):\\n # best cases\\n if i > len(matrix)-1 or j > len(matrix[0])-1:\\n return 0\\n \\n if (i,j) in memo:\\n return memo[(i,j)]\\n \\n right = rec(i, j+1)\\n down = rec(i+1, j)\\n diag = rec(i+1, j+1)\\n \\n if matrix[i][j] == '1':\\n \\n memo[(i, j)] = min(diag, right, down) + 1\\n return memo[(i,j)]\\n \\n return 0\\n \\n rec(0, 0)\\n return max(memo.values()) ** 2 if len(memo) > 0 else 0\",\n \"runtime\": \"1326\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n \\n ROWS, COLS = len(matrix), len(matrix[0])\\n res = [0]\\n \\n def getSquare(r, c, size):\\n\\n rEdge = r + size - 1\\n cEdge = c + size - 1\\n \\n if (rEdge == ROWS or cEdge == COLS):\\n return\\n\\n for i in range(size):\\n if matrix[r + i][cEdge] != \\\"1\\\":\\n return\\n if matrix[rEdge][c + i] != \\\"1\\\":\\n return\\n \\n res[0] = max(res[0], size)\\n getSquare(r, c, size + 1) # Recursive call\\n\\n for r in range(ROWS):\\n for c in range(COLS):\\n if min(ROWS - r, COLS - c) > res[0]:\\n getSquare(r, c, 1)\\n\\n return res[0] * res[0]\",\n \"runtime\": \"1326\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n maxRect = {}\\n def _maxSquares(ind):\\n if ind[0] > len(matrix)-1:\\n maxRect[ind] = 0#matrix[ind[0]][ind[1]]\\n return 0\\n if ind[1] > len(matrix[0])-1:\\n maxRect[ind] = 0#matrix[ind[0]][ind[1]]\\n return 0\\n if matrix[ind[0]][ind[1]] == \\\"0\\\":\\n maxRect[ind] = 0\\n return 0\\n if ind in maxRect:\\n return maxRect[ind]\\n na = _maxSquares((ind[0], ind[1]+1))\\n nb = _maxSquares((ind[0]+1, ind[1]))\\n nc = _maxSquares((ind[0]+1, ind[1]+1))\\n print(ind)\\n print(na, nb, nc)\\n maxRect[ind] = 1 + min(na, nb, nc)\\n return maxRect[ind]\\n print(maxRect)\\n james = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n james = max(james, _maxSquares((i,j)))\\n\\n print(maxRect)\\n return james**2\\n\",\n \"runtime\": \"1343\"\n },\n {\n \"code\": \"class Solution:\\n \\\"to katw dexia kanei define\\\"\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n res = [[0 for _ in range(n)] for _ in range(m)]\\n test = [[[0,0] for _ in range(n)] for _ in range(m)]\\n \\n for row in range(m):\\n for col in range(n):\\n matrix[row][col] = int(matrix[row][col])\\n for col in range(1, n):\\n test[0][col][0] = (1+test[0][col-1][0]) * matrix[0][col-1]\\n for row in range(1, m):\\n test[row][0][1] = (1+test[row-1][0][1]) * matrix[row-1][0]\\n for row in range(1, m):\\n for col in range(1, n):\\n test[row][col][0] = (1+test[row][col-1][0]) * matrix[row][col-1]\\n test[row][col][1] = (1+test[row-1][col][1]) * matrix[row-1][col]\\n \\n for row in range(m):\\n for col in range(n):\\n res[row][col] = int(matrix[row][col])\\n for size in reversed(range(2, min(row+2, col+2))):\\n if matrix[row][col] == 1 and res[row-1][col-1] >= size-1 and min(test[row][col]) >= size-1: \\n res[row][col] = size\\n break\\n \\n max_size = max([max(i) for i in res])\\n return max_size**2\\n\\n\\n\\n\",\n \"runtime\": \"1361\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m,n = len(matrix),len(matrix[0])\\n square = [[0 for j in range(n)] for i in range(m)]\\n ans = 0\\n for i in range(m):\\n for j in range(n):\\n if matrix[i][j]==\\\"1\\\":\\n if i==0 or j==0:\\n square[i][j] = 1\\n else:\\n square[i][j] = min(square[i-1][j],square[i][j-1],square[i-1][j-1])+1\\n ans = max(ans,max(square[i]))\\n return ans*ans\",\n \"runtime\": \"1361\"\n },\n {\n \"code\": \"from functools import cache\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n def check_matrix(i_min, i_max, j_min, j_max) -> bool:\\n @cache\\n def check_row(i, j_min, j_max) -> bool:\\n return all(matrix[i][j_min:j_max+1])\\n return all(check_row(i, j_min, j_max) for i in range(i_min, i_max+1))\\n\\n m = len(matrix)\\n n = len(matrix[0])\\n for row in matrix:\\n for j in range(n):\\n row[j] = int(row[j])\\n\\n res = int(any(any(row) for row in matrix))\\n if not res:\\n return 0\\n\\n for i in range(m):\\n if i + res >= m:\\n break\\n for j in range(n):\\n if j + res >= n:\\n break\\n while check_matrix(i, i+res, j, j+res):\\n res += 1\\n if i + res == m or j + res == n:\\n break\\n\\n return res**2\",\n \"runtime\": \"1378\"\n },\n {\n \"code\": \"class Solution:\\n def isExtendSquare(self, ur, bl):\\n x1 , y1 = ur\\n x2 , y2 = bl\\n for i in range(x1, x2+1):\\n if self._matrix[i][y1] != '1':\\n return False\\n for j in range(y2, y1):\\n if self._matrix[x2][j] != '1':\\n return False\\n return True\\n\\n def isSquare(self, c, ur, bl)-> bool:\\n x0, y0 = c\\n x1, y1 = ur\\n x2, y2 = bl\\n for i in range(x0, x2+1):\\n for j in range(y0, y1+1):\\n if self._matrix[i][j] != '1':\\n return False\\n return True\\n for s in range(x1+1, x2+1):\\n # print(\\\"___\\\",(s, y1))\\n if self._matrix[s][y1] != '1':\\n return False\\n for t in range(y2+1, y1):\\n # print(\\\"___\\\",(x2, t))\\n if self._matrix[x2][t] != '1':\\n return False\\n return True\\n\\n def findmax(self):\\n for i in range(self._m-1):\\n \\n for j in range(self._n-1):\\n if self._matrix[i][j] == '1': \\n if self._ms == 0:\\n \\n self._ms = 1\\n p = self._ms \\n c = [i,j]\\n ur = [i, j+p]\\n bl = [i+p,j]\\n if ur[1] >= self._n or bl[0] >= self._m:\\n break\\n \\n if self.isSquare(c, ur, bl):\\n self._ms = p+1\\n while True:\\n ur[1] += 1\\n bl[0] += 1\\n if ur[1] >= self._n or bl[0] >= self._m:\\n break\\n if self.isExtendSquare(ur, bl):\\n self._ms += 1\\n else:\\n break\\n \\n \\n \\n \\n\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n self._matrix = matrix\\n self._m = len(matrix)\\n self._n = len(matrix[0])\\n self._ms = 0\\n if self._m == 1:\\n if '1' in matrix[0]:\\n return 1\\n else:\\n return 0\\n if self._n == 1:\\n if '1' in [matrix[i][0] for i in range(self._m)]:\\n return 1\\n else:\\n return 0\\n \\n self.findmax()\\n if self._ms == 0:\\n if '1' in [self._matrix[i][j] for i in range(self._m) for j in range(self._n)]:\\n return 1\\n else:\\n return 0\\n return self._ms**2\\n \\n \",\n \"runtime\": \"1378\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n #dp m x n table\\n #if conditions met (not all 0's put area)\\n m = len(matrix)\\n n = len(matrix[0])\\n dp = [[0]*n for _ in range(m)]\\n maxLen = 0\\n dp[0][0] = int(matrix[0][0])\\n maxLen = max(dp[0][0],maxLen)\\n for i in range(1,m):\\n dp[i][0] = int(matrix[i][0])\\n maxLen = max(dp[i][0],maxLen)\\n for j in range(1,n):\\n dp[0][j] = int(matrix[0][j])\\n maxLen = max(dp[0][j],maxLen)\\n \\n for i in range(1,m):\\n for j in range(1,n):\\n # if i==3 and j == 2:\\n # for k in range(0,m):\\n # print(dp[k])\\n # print('------------------')\\n if matrix[i][j]==\\\"1\\\" and dp[i-1][j-1]>0 and dp[i-1][j]>0 and dp[i][j-1]>0:\\n \\n s = dp[i-1][j-1]\\n bi = i -s\\n bj = j -s\\n for ci in range(i-s,i):\\n if dp[ci][j]==0:\\n bi = ci+1\\n \\n for cj in range(j-s,j):\\n if dp[i][cj]==0:\\n bj = cj+1\\n val = min(i-bi, j -bj)+1\\n dp[i][j] = val\\n else:\\n dp[i][j] = int(matrix[i][j])\\n maxLen = max(dp[i][j],maxLen)\\n # for k in range(m):\\n # print (matrix[k])\\n # for k in range(m):\\n # print (dp[k])\\n return maxLen**2\\n \",\n \"runtime\": \"1396\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n\\n matrix_int = []\\n for x in matrix:\\n matrix_int.append([int(y) for y in x]) \\n\\n matrix_int = np.array(matrix_int)\\n\\n print(matrix_int)\\n\\n cmsl = 0\\n\\n for start_x in range(matrix_int.shape[0]):\\n for start_y in range(matrix_int.shape[1]):\\n\\n for sl in range(cmsl, min(matrix_int.shape[0]-start_x+1, matrix_int.shape[1]-start_y+1)):\\n\\n\\n square = matrix_int[start_x:start_x+sl, start_y:start_y+sl]\\n\\n if np.all(square == 1):\\n cmsl = square.shape[0]\\n else:\\n break\\n\\n print(cmsl)\\n\\n return cmsl**2\\n \\n\\n\\n\",\n \"runtime\": \"1414\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n if len(matrix) == 1 or len(matrix[0]) == 1:\\n return self.one(matrix)\\n table = [[0 for i in range(len(matrix[0]))] for _ in range(len(matrix))]\\n def dfs(r,c):\\n if r >= (len(matrix)-1) or c >= (len(matrix[0])-1):\\n table[r][c] = int(matrix[r][c])\\n return\\n if table[r][c] == 0:\\n dfs(r+1,c)\\n dfs(r,c+1)\\n dfs(r+1,c+1)\\n if matrix[r][c] == '1':\\n table[r][c] = min(table[r+1][c], table[r][c+1], table[r+1][c+1]) + 1\\n dfs(0,0)\\n res = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n res = max(res, int(table[i][j]))\\n return res*res\\n\\n def one(self,list_of_lists):\\n for i in range(len(list_of_lists)):\\n if '1' in list_of_lists[i]:\\n return 1\\n return 0\",\n \"runtime\": \"1431\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":122,"string":"122"},"mm_list":{"kind":"list like","value":[{"code":"\ndef maximalSquare(bits):\n w = 0\n while bits and any(bits):\n w += 1\n bits = [a & b for a, b in pairwise(b & (b << 1) for b in bits)]\n return w * w\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n bits = [int(''.join(row), 2) for row in case]\n f.write(f\"{maximalSquare(bits)}\\n\")\n exit(0)\n \n \n\n\n\n\n\n\n ","memory":"18475"},{"code":"\ndef maximalSquare(matrix):\n bits = [int(''.join(row), 2) for row in matrix]\n w = 0\n while bits and any(bits):\n w += 1\n bits = [a & b for a, b in itertools.pairwise(b & (b << 1) for b in bits)]\n return w * w\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f\"{maximalSquare(case)}\\n\")\n exit(0)\n \n \n\n\n\n\n\n\n ","memory":"18475"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n row, col = len(matrix), len(matrix[0])\n maxVal = 0\n\n for i in range(row):\n for j in range(col):\n matrix[i][j] = int(matrix[i][j])\n\n for i in range(row):\n for j in range(col):\n\n if i == 0 or j == 0:\n maxVal = max(maxVal, matrix[i][j])\n #print(\"hereee\", maxVal)\n continue\n\n if matrix[i][j]:\n matrix[i][j] = 1 + min(matrix[i][j-1], matrix[i-1][j-1], matrix[i-1][j])\n maxVal = max(maxVal, matrix[i][j])\n \n return maxVal**2\n\n\n\n\n\n \n\n\n\n\n ","memory":"19025"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n result = 0\n prev, curr = [0]*n, [0]*n\n for i in range(m):\n for j in range(n):\n if matrix[i][j] == '1':\n curr[j] = min(curr[j-1] if j > 0 else 0,\n prev[j-1] if j > 0 else 0,\n prev[j]) + 1\n else:\n curr[j] = 0 # reset curr[j]\n if curr[j] > result:\n result = curr[j]\n prev, curr = curr, prev\n return result*result","memory":"19025"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n \n if not matrix or not matrix[0]:\n return 0\n\n n = len(matrix)\n m = len(matrix[0])\n\n cache = [[0] *m for _ in range(n)]\n\n max_side = 0\n\n for i in range(n):\n for j in range(m):\n if matrix[i][j] == \"1\":\n if i == 0 or j == 0:\n cache[i][j] = 1\n else:\n cache[i][j] = min(cache[i-1][j], cache[i][j-1], cache[i-1][j-1]) +1\n max_side = max(max_side, cache[i][j])\n \n return max_side**2\n","memory":"19575"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n if not matrix:\n return 0\n m , n = len(matrix), len(matrix[0])\n dp = [[0] * n for x in range(m)]\n \n side_len=0\n for i in range(m):\n for j in range(n):\n if matrix[i][j] == '1':\n if i == 0 or j == 0:\n dp[i][j] = 1\n else:\n dp[i][j]=1 + min(dp[i-1][j-1],dp[i][j-1],dp[i-1][j])\n \n side_len = max(side_len,dp[i][j])\n \n return side_len*side_len\n ","memory":"19575"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n '''\n DP[i, j] = maximimal side length of a square with upper left corner is position\n (i, j). Optimal substructure is\n '''\n m = len(matrix); n = len(matrix[0])\n DP = [[0 for _ in range(n)] for _ in range(m)]\n max_val = 0\n for i in range(m):\n DP[i][-1] = matrix[i][-1] == \"1\"\n max_val = max(max_val, DP[i][-1])\n for j in range(n):\n DP[-1][j] = matrix[-1][j] == \"1\"\n max_val = max(max_val, DP[-1][j])\n for i in range(m - 2, -1, -1):\n for j in range(n - 2, -1, -1):\n if matrix[i][j] == \"0\":\n continue\n DP[i][j] = min(DP[i + 1][j] + 1, DP[i][j + 1] + 1, DP[i + 1][j + 1] + 1)\n max_val = max(max_val, DP[i][j])\n print(DP)\n return max_val**2\n\n\n \n\n ","memory":"20125"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n for i in range(n):\n matrix[0][i] = int(matrix[0][i])\n for j in range(1,m):\n matrix[j][i] = int(matrix[j][i ])\n if matrix[j][i] == 1 :\n matrix[j][i] = int(matrix[j][i]) + int(matrix[j-1][i])\n \n # print(matrix)\n ans = 0\n for i in range(m):\n matrix[i].append(0)\n stack = []\n for j in range(n+1):\n while stack and matrix[i][stack[-1]] > matrix[i][j]:\n index = stack.pop()\n w = j if not stack else j - stack[-1] - 1\n l = min(w,matrix[i][index])\n # print(i, j, index, w, l*l, stack)\n ans = max(ans,l*l)\n # if matrix[i][j] == 0 or not(stack and matrix[i][stack[-1]] == matrix[i][j]):\n stack.append(j)\n return ans","memory":"20125"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n dp = copy.deepcopy(matrix)\n dp = [[int(ele) for ele in row] for row in matrix]\n res = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if i==0 or j==0:\n pass\n elif dp[i][j] == 1:\n dp[i][j] = min([dp[i-1][j-1], dp[i-1][j], dp[i][j-1]])+1\n res = max(res, dp[i][j]**2)\n print (dp, res)\n return res","memory":"20675"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n n, m = len(matrix), len(matrix[0])\n dp = [[-1]*m for _ in range(n)]\n\n def calculate(i,j):\n n, m = len(matrix), len(matrix[0])\n if dp[i][j] != -1:\n return dp[i][j]\n ans = 1e5\n for x, y in [[i+1, j], [i,j+1], [i+1, j+1]]:\n if x >= n:\n ans = 0\n continue\n if y >= m:\n ans = 0\n continue \n calculate(x, y)\n ans = min(ans, dp[x][y])\n if matrix[i][j] == \"0\":\n dp[i][j] = 0\n else:\n dp[i][j] = 1 + ans\n # print(i, j, dp[i][j])\n \n calculate(0,0)\n\n final = max([max(dp[i]) for i in range(n)])\n return final*final","memory":"20675"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> 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 _ in range(rows)]\n def bfs(i, j):\n if i >= rows or j >= cols:\n return 0\n if dp[i][j] == 0:\n down = bfs(i + 1, j)\n diag = bfs(i + 1, j + 1)\n right = bfs(i, j + 1)\n if matrix[i][j] == '1':\n dp[i][j] = 1 + min(down, diag, right)\n return dp[i][j]\n bfs(0, 0)\n max_len = max(max(dp[i]) for i in range(rows))\n return max_len ** 2\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(Solution().maximalSquare(nums),file=f)\nexit(0)","memory":"21225"},{"code":"import math\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n n, m = len(matrix), len(matrix[0])\n dp = [[0 for _ in range(m)] for _ in range(n)]\n best = 0\n for j in range(m):\n dp[0][j] = 1 if matrix[0][j] == \"1\" else 0\n best = max(dp[0][j], best)\n for i in range(n):\n dp[i][0] = 1 if matrix[i][0] == \"1\" else 0\n best = max(dp[i][0], best)\n \n above = [[0 for _ in range(m)] for _ in range(n)]\n for i in range(1,n):\n for j in range(1,m):\n above[i][j] = int(matrix[i-1][j] == \"1\") * (1 + above[i-1][j])\n left = [[0 for _ in range(m)] for _ in range(n)]\n for i in range(1,n):\n for j in range(1,m):\n left[i][j] = int(matrix[i][j-1] == \"1\") * (1 + left[i][j-1]) \n\n for i in range(1, n):\n for j in range(1, m):\n if matrix[i][j] == \"0\":\n dp[i][j] = 0\n elif dp[i-1][j-1] == 0:\n dp[i][j] = 1\n else:\n dp[i][j] = 1 + min(above[i][j], left[i][j], dp[i-1][j-1])\n best = max(dp[i][j], best)\n return best**2\n ","memory":"21225"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n dp = []\n for i in range(len(matrix)):\n dp.append([0]*len(matrix[0]))\n \n #dp[i][j] = largest area where i,j is the top left corner\n largest = 0\n \n for i in range(len(matrix) - 1, -1, -1):\n for j in range(len(matrix[0]) - 1, -1, -1):\n if matrix[i][j] == \"0\":\n dp[i][j] = 0\n continue\n if i == len(matrix) - 1 or j == len(matrix[0]) - 1: #base case\n dp[i][j] = 1\n else: #not base case\n if matrix[i+1][j] == \"0\" or matrix[i][j+1] == \"0\" or matrix[i+1][j+1] == \"0\":\n dp[i][j] = 1\n else:\n minsquare = min([dp[i+1][j],dp[i][j+1],dp[i+1][j+1]])\n dp[i][j] = int((minsquare**0.5 + 1)**2)\n if dp[i][j] > largest:\n largest = dp[i][j]\n \n\n return largest","memory":"21775"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n n, m = len(matrix), len(matrix[0])\n # initiate a 2-D dp to store the maximal square area @ (i,j)\n dp = [[None] * m for _ in range(n)]\n \n # for first row and col, fill the dp with its corresponding matrix number\n for nCol in range(m):\n dp[0][nCol] = int(matrix[0][nCol])\n \n for nRow in range(n):\n dp[nRow][0] = int(matrix[nRow][0])\n \n if '1' in [max(row) for row in matrix]:\n maximalSquareArea = 1\n else:\n return 0 # matrix is all zeroes\n \n for i in range(1, n):\n for j in range(1, m):\n \n if int(matrix[i][j]) != 0:\n # compute minimum of the immediate left, top, top-left cell value\n adjCellsMin = min(dp[i-1][j], min(dp[i-1][j-1], dp[i][j-1]))\n # update dp at current (i,j)\n dp[i][j] = int((adjCellsMin ** 0.5 + int(matrix[i][j])) ** 2)\n maximalSquareArea = max(maximalSquareArea, dp[i][j])\n else:\n dp[i][j] = 0\n\n return maximalSquareArea","memory":"21775"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n\n dp = [[0 for j in range(n + 1)] for i in range(m + 1)]\n dp[1][1] = int(matrix[0][0])\n\n for i in range(2, m + 1):\n dp[i][1] = dp[i-1][1] + int(matrix[i - 1][0])\n\n for j in range(2, n + 1):\n dp[1][j] = dp[1][j-1] + int(matrix[0][j - 1])\n \n # for row in dp:\n # print(row)\n # return -1\n for i in range(2, m + 1):\n for j in range(2, n + 1):\n dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + int(matrix[i - 1][j - 1])\n \n\n def isValidSquare(r, c, length):\n area = dp[r][c] - dp[r - length][c] - dp[r][c - length] + dp[r - length][c - length]\n if area == length ** 2:\n return True\n return False\n \n out = 0\n for r in range(1, m + 1):\n for c in range(1, n + 1):\n left, right = 1, min(r, c)\n while left <= right:\n mid = (left + right) // 2\n if isValidSquare(r, c, mid):\n out = max(out, mid)\n left = mid + 1\n else:\n right = mid - 1\n\n return out ** 2\n","memory":"22325"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n M = [[0] * (n + 1) for _ in range(m + 1)]\n\n for i in range(1, m + 1):\n for j in range(1, n + 1):\n M[i][j] = int(matrix[i - 1][j - 1]) + M[i - 1][j] + M[i][j - 1] - M[i - 1][j - 1]\n\n best = 0\n\n\n def f(k):\n for i in range(0, m + 1 - k):\n for j in range(0, n + 1 - k):\n v = M[i + k][j + k] - M[i + k][j] - M[i][j + k] + M[i][j]\n if k * k == v:\n return False\n return True\n \n\n for k in range(1, min(m, n)):\n print(f(k))\n\n k = bisect.bisect_right(range(1, min(m, n) + 1), False, key=f)\n\n return k * k","memory":"22325"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n n = len(matrix)\n m = len(matrix[0])\n presum = [[0]*(m+1) for _ in range(n+1)]\n ans = 0\n for i in range(1, n+1):\n for j in range(1, m+1):\n presum[i][j] = int(matrix[i-1][j-1]) - presum[i-1][j-1] + presum[i][j-1] + presum[i-1][j]\n area = int(matrix[i-1][j-1])\n print(area)\n k = 1\n while i >= k and j >= k and area == k**2:\n ans = max(ans, area)\n k += 1\n area = presum[i][j] + presum[i-k][j-k] - presum[i][j-k] - presum[i-k][j]\n\n return ans\n\n ","memory":"22875"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n for i,row in enumerate(matrix):\n for j,val in enumerate(row):\n matrix[i][j] = int(matrix[i][j])\n\n maxSize=0\n for i,row in enumerate(matrix):\n for j,val in enumerate(row):\n if matrix[i][j]:\n maxSize = 1 if not maxSize else maxSize\n prevs = [matrix[i-1][j], matrix[i][j-1], matrix[i-1][j-1]]\n if i and j and 0 not in prevs:\n x = math.sqrt(min(prevs))\n matrix[i][j] = (x+1)**2\n maxSize = max(maxSize,matrix[i][j])\n return int(maxSize)\n","memory":"22875"},{"code":"class Solution:\n def maximalSquare(self, mat: List[List[str]]) -> int:\n if not mat: return 0\n row = len(mat)\n col = len(mat[0])\n \n dp = [[0]*(col+1) for _ in range(row+1)]\n \n for i in range(1,row+1):\n for j in range(1,col+1):\n dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1] + int(mat[i-1][j-1])\n print(dp)\n def possible(side):\n for i in range(side, row+1):\n for j in range(side, col+1):\n cur = dp[i][j] - dp[i-side][j] - dp[i][j-side] + dp[i-side][j-side]\n if cur == side*side:\n return True\n return False\n \n \n ans = 0\n l = 0\n r = min(row, col)\n \n while l <= r:\n mid = (l+r)//2\n if possible(mid):\n ans = max(mid, ans)\n l = mid + 1\n else:\n r = mid - 1\n \n return ans*ans","memory":"23425"},{"code":"\n\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n M = len(matrix)\n N = len(matrix[0])\n\n dp = [[0] * N for i in range(M)]\n\n dp[0][0] = 1 if matrix[0][0] == '1' else 0\n\n for m in range(1, M):\n dp[m][0] = 1 if matrix[m][0] == '1' else 0\n \n for n in range(1, N):\n dp[0][n] = 1 if matrix[0][n] == '1' else 0\n\n print(dp)\n\n for m in range(1, M):\n for n in range(1, N):\n if matrix[m][n] == '0':\n continue\n\n dp[m][n] = 1 \n x = dp[m-1][n-1]\n if dp[m-1][n-1] > 0 and dp[m][n-1] > 0 and dp[m-1][n] > 0:\n x = min(dp[m-1][n-1], dp[m][n-1], dp[m-1][n])\n dp[m][n] = (x ** 0.5 + 1) ** 2\n print(m, n, x, dp[m][n])\n\n print(dp)\n\n ret = -1\n for m in range(M):\n for n in range(N):\n ret = max(ret, dp[m][n])\n\n return int(ret)\n\n\n","memory":"23425"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n max_area = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[i])):\n if matrix[i][j] == \"1\":\n if i-1 >=0 and j - 1>=0:\n matrix[i][j] = str(\n min(\n int(matrix[i-1][j-1]),\n int(matrix[i-1][j]),\n int(matrix[i][j-1]))\n + 1)\n max_area = max(max_area, int(matrix[i][j]))\n\n # for i in range(len(matrix)):\n # for j in range(len(matrix[i])):\n # max_area = max(max_area, int(matrix[i][j]))\n \n return max_area**2\n\n\n\n\n ","memory":"23975"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m,n=len(matrix),len(matrix[0])\n matrix=[[int(matrix[j][i]) for i in range(n)] for j in range(m)]\n r1=[[0 for i in range(n)] for j in range(m)]\n for i in range(m):\n for j in range(n):\n if j==0:\n r1[i][0]=matrix[i][0]\n else:\n r1[i][j]=matrix[i][j]+r1[i][j-1]\n r2=[[0 for i in range(n)] for j in range(m)]\n for i in range(m):\n for j in range(n):\n if i==0:\n r2[0][j]=r1[0][j]\n else:\n r2[i][j]=r1[i][j]+r2[i-1][j]\n ans=0\n print(r2)\n for i in range(m):\n for j in range(n):\n for k in range(min(m-i,n-j)):\n if i==0 and j==0:\n if r2[k][k]==(k+1)*(k+1):\n ans=max(ans,(k+1)*(k+1))\n elif i==0:\n if r2[i+k][j+k]-r2[i+k][j-1]==(k+1)*(k+1):\n ans=max(ans,(k+1)*(k+1))\n elif j==0:\n if r2[i+k][j+k]-r2[i-1][j+k]==(k+1)*(k+1):\n ans=max(ans,(k+1)*(k+1))\n else:\n if r2[i+k][j+k]+r2[i-1][j-1]-r2[i+k][j-1]-r2[i-1][j+k]==(k+1)*(k+1):\n ans=max(ans,(k+1)*(k+1))\n return ans","memory":"24525"},{"code":"from itertools import chain\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n\n max_side = 0\n for i in range(m):\n max_side = max(max_side, int(matrix[i][0]))\n for j in range(n):\n max_side = max(max_side, int(matrix[0][j]))\n\n for i in range(1, m):\n for j in range(1, n):\n if matrix[i][j] == \"0\":\n continue\n side = 1 + min(map(int, (matrix[i][j - 1], matrix[i - 1][j], matrix[i - 1][j - 1])))\n max_side = max(max_side, side)\n matrix[i][j] = str(side)\n return max_side * max_side\n","memory":"24525"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n maxxer = max(max(int(cell) for cell in row) for row in matrix)\n for i in range(1,len(matrix)):\n for j in range(1,len(matrix[0])):\n if (matrix[i][j] != '0' and\n matrix[i-1][j] != '0' and\n matrix[i][j-1] != '0' and\n matrix[i-1][j-1] != '0'):\n matrix[i][j] = str(min(int(matrix[i-1][j]),int(matrix[i][j-1]),int(matrix[i-1][j-1])) +1)\n maxxer = max(int(matrix[i][j]),maxxer)\n for row in matrix:\n print(\" \".join(str(cell) for cell in row))\n return maxxer**2\n ","memory":"25075"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n max_square = 0\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n if int(matrix[r][c]):\n max_square = max(max_square, 1)\n if r == 0 or c == 0:\n continue \n \n if int(matrix[r-1][c-1]) and int(matrix[r-1][c]) and int(matrix[r][c-1]):\n matrix[r][c] = str(min(int(matrix[r-1][c-1]),int(matrix[r-1][c]),int(matrix[r][c-1])) + 1) \n max_square = max(max_square, int(matrix[r][c]))\n \n print(matrix, max_square)\n # ['1', '0', '1', '0', '0']\n # ['1', '0', '1', '1', '1']\n # ['1', '1', '1', '2', '2']\n # ['1', '0', '0', '1', '0']\n\n # [\"1\", \"0\", \"1\", \"0\", \"0\"]\n # [\"1\", \"0\", \"1\", \"1\", \"1\"]\n # [\"1\", \"1\", \"1\", \"1\", \"1\"]\n # [\"1\", \"0\", \"0\", \"1\", \"0\"]\n \n # [\"1\", \"1\", \"1\", \"1\"]\n # [\"1\", \"1\", \"1\", \"1\"]\n # [\"1\", \"1\", \"1\", \"1\"]\n\n # ['1', '1', '1', '1']\n # ['1', '2', '2', '2']\n # ['1', '2', '4', '4']\n\n return max_square * max_square\n ","memory":"25625"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n rows = []\n for i in range(m):\n s = 0\n row = []\n for j in range(n):\n if matrix[i][j] == '0':\n s = 0\n else:\n s += 1\n row.append(s)\n rows.append(row)\n columns = []\n for col in range(n):\n s = 0\n for row in range(m):\n if matrix[row][col] == '0':\n s = 0\n else:\n s += 1\n rows[row][col] = (rows[row][col], s)\n max_size = 0\n for i in range(m):\n for j in range(n):\n size = 0\n s = i\n t = j\n while s < m and t < n and rows[s][t][0] > size and rows[s][t][1] > size:\n size += 1\n s += 1\n t += 1\n max_size=max(max_size,size)\n return max_size**2\n\n","memory":"25625"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n dp_row = [[0 for i in range(n)] for j in range(m)]\n for i in reversed(range(m)):\n for j in reversed(range(n)):\n if matrix[i][j] == '1' and j<n-1:\n dp_row[i][j] = 1 + dp_row[i][j+1]\n elif matrix[i][j] == '1':\n dp_row[i][j] = 1\n \n dp_col = [[0 for i in range(n)] for j in range(m)]\n for i in reversed(range(m)):\n for j in reversed(range(n)):\n if matrix[i][j] == '1' and i<m-1:\n dp_col[i][j] = 1 + dp_col[i+1][j]\n elif matrix[i][j] == '1':\n dp_col[i][j] = 1\n \n dp_area = [[0 for i in range(n)] for j in range(m)]\n res = 0\n for i in reversed(range(m)):\n for j in reversed(range(n)):\n if matrix[i][j] == '1' and i<m-1 and j<n-1:\n if (min(dp_row[i][j]-1, dp_col[i][j]-1))**2 >= dp_area[i+1][j+1]:\n dp_area[i][j] = (sqrt(dp_area[i+1][j+1]) + 1)**2\n else:\n dp_area[i][j] = min(dp_row[i][j], dp_col[i][j])**2\n elif matrix[i][j] == '1' and i==m-1:\n dp_area[i][j] = 1\n elif matrix[i][j] == '1' and j==n-1:\n dp_area[i][j] = 1\n if dp_area[i][j] > res:\n res = dp_area[i][j]\n print(dp_col)\n print(dp_row)\n print(dp_area)\n return int(res)\n\n\n ","memory":"26175"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n # keep track of length of chain of 1s below and right\n # get min of below chain, right chain, and below_right dp subresult\n # to make current dp result\n\n # dp_chain[i][j] = (below, right, square)\n # below and represents chain of 1s (i,j inclusive)\n # square represents dimensions of largest square\n # that can be made with (i,j) as top left corner\n\n dp = [[(0,0,0)] * len(matrix[0]) for _ in range(len(matrix))]\n ans = 0\n # set up base cases, very bottom and right cells\n for i in range(len(matrix)):\n if matrix[i][-1] == '1':\n dp[i][-1] = (1, 1, 1) # square dimensions\n ans = 1\n for j in range(len(matrix[0])):\n if matrix[-1][j] == '1':\n dp[-1][j] = (1, 1, 1)\n ans = 1\n \n\n for i in range(len(matrix) - 2, -1, -1):\n for j in range(len(matrix[0]) - 2, -1, -1):\n if matrix[i][j] == '0':\n continue\n below = 1 + dp[i + 1][j][0]\n right = 1 + dp[i][j + 1][1]\n \n inner_square_length = dp[i + 1][j + 1][2]\n square_length = min(below, right, inner_square_length + 1)\n dp[i][j] = (below, right, square_length)\n ans = max(ans, square_length ** 2)\n print(i, j, square_length)\n\n return ans","memory":"26175"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n f = [[[i, j] for j in range(n)] for i in range(m)]\n ans = 0\n for i in range(m):\n if matrix[i][0] == \"1\":\n ans = 1\n for j in range(n):\n if matrix[0][j] == \"1\":\n ans = 1\n for i in range(1, m):\n for j in range(1, n):\n if matrix[i][j] == \"0\":\n continue\n ans = max(ans, 1)\n if matrix[i - 1][j - 1] == \"1\":\n r, c = f[i - 1][j - 1]\n new_r, new_c = r, c\n flag = True\n for col in range(c, j):\n if matrix[i][col] == \"0\":\n new_c = col + 1\n for row in range(r, i):\n if matrix[row][j] == \"0\":\n new_r = row + 1\n if i - new_r > j - new_c:\n new_r = i - (j - new_c)\n elif i - new_r < j - new_c:\n new_c = j - (i - new_r)\n if flag:\n f[i][j] = [new_r, new_c]\n ans = max(ans, (i - new_r + 1) * (j - new_c + 1))\n return ans","memory":"26725"},{"code":"class Solution:\n \"to katw dexia kanei define\"\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n res = [[0 for _ in range(n)] for _ in range(m)]\n test = [[[0,0] for _ in range(n)] for _ in range(m)]\n \n for row in range(m):\n for col in range(n):\n matrix[row][col] = int(matrix[row][col])\n for col in range(1, n):\n test[0][col][0] = (1+test[0][col-1][0]) * matrix[0][col-1]\n for row in range(1, m):\n test[row][0][1] = (1+test[row-1][0][1]) * matrix[row-1][0]\n for row in range(1, m):\n for col in range(1, n):\n test[row][col][0] = (1+test[row][col-1][0]) * matrix[row][col-1]\n test[row][col][1] = (1+test[row-1][col][1]) * matrix[row-1][col]\n \n for row in range(m):\n for col in range(n):\n res[row][col] = int(matrix[row][col])\n for size in reversed(range(2, min(row+2, col+2))):\n if matrix[row][col] == 1 and res[row-1][col-1] >= size-1 and min(test[row][col]) >= size-1: \n res[row][col] = size\n break\n \n max_size = max([max(i) for i in res])\n return max_size**2\n\n\n\n","memory":"26725"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n down = [[-1 for _ in matrix[i]] for i in range(len(matrix))]\n right = [[-1 for _ in matrix[i]] for i in range(len(matrix))]\n diag = [[-1 for _ in matrix[i]] for i in range(len(matrix))]\n\n def findDown(i, j):\n if not 0 <= i < len(matrix) or matrix[i][j] == '0':\n return 0\n if down[i][j] == -1:\n down[i][j] = findDown(i + 1, j) + 1\n return down[i][j]\n \n def findRight(i, j):\n if not 0 <= j < len(matrix[i]) or matrix[i][j] == '0':\n return 0\n if right[i][j] == -1:\n right[i][j] = findRight(i, j + 1) + 1\n return right[i][j]\n \n def findDiag(i, j):\n if not 0 <= i < len(matrix) or not 0 <= j < len(matrix[i]) or matrix[i][j] == '0':\n return 0\n if diag[i][j] == -1:\n diag[i][j] = min(findDiag(i + 1, j + 1) + 1, findRight(i, j), findDown(i, j))\n return diag[i][j]\n\n max_side = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[i])):\n max_side = max(max_side, findDiag(i, j))\n return max_side * max_side\n \n","memory":"27275"},{"code":"from dataclasses import dataclass\n@dataclass\nclass Cell:\n # right_ones: int = 0\n # down_ones: int = 0 \n square_size: int = 0\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n rows_num = len(matrix)\n cols_num = len(matrix[0])\n cells = [[Cell() for _ in range(cols_num + 1)]\n for _ in range(rows_num + 1)]\n\n def print_cells(cells, cur_row, cur_col):\n for row in range(len(cells) - 1):\n print()\n for col in range(len(cells[0]) - 1):\n c = cells[row][col]\n mark = '*' if cur_col == col and cur_row == row else '('\n print(f'{mark}{c.square_size}, {c.down_ones}, {c.right_ones})', end = ', ')\n\n max_square = 0\n for row in reversed(range(rows_num)):\n for col in reversed(range(cols_num)):\n if matrix[row][col] == \"0\":\n continue\n cell = cells[row][col]\n right = cells[row][col + 1]\n down = cells[row + 1][col]\n diag = cells[row + 1][col + 1]\n # cell.right_ones = right.right_ones + 1\n # cell.down_ones = down.down_ones + 1\n\n # cell.square_size = min(diag.square_size, right.right_ones, down.down_ones) + 1\n cell.square_size = min(diag.square_size, right.square_size, down.square_size) + 1\n # if diag.square_size <= right.right_ones and diag.square_size <= down.down_ones:\n # cell.square_size = diag.square_size + 1\n max_square = max(max_square, cell.square_size)\n # print(f'{row},{col}: {cell}, {matrix[row][col]}')\n # print_cells(cells, row, col)\n # print()\n # print(cells)\n \n return max_square * max_square\n\n\n ","memory":"27825"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows = len(matrix)\n cols = len(matrix[0])\n dp = [[[0, 0, 0] for __ in range(cols+1)] for _ in range(rows+1)]\n maxsquare = 0\n for r in range(rows):\n for c in range(cols):\n rowstreak, colstreak, diagstreak = dp[r][c]\n if matrix[r][c] == '1':\n dp[r][c+1][0] = 1 + rowstreak\n dp[r+1][c][1] = 1 + colstreak\n square = 1 + min(dp[r][c])\n dp[r+1][c+1][2] = square\n maxsquare = max(square, maxsquare)\n #print(r, c, 'pass', dp)\n return maxsquare*maxsquare","memory":"28375"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows = len(matrix)\n cols = len(matrix[0])\n dp = [[[0, 0, 0] for __ in range(cols+1)] for _ in range(rows+1)]\n maxsquare = 0\n for r in range(rows):\n for c in range(cols):\n rowstreak, colstreak, diagstreak = dp[r][c]\n if matrix[r][c] == '1':\n dp[r][c+1][0] = 1 + rowstreak\n dp[r+1][c][1] = 1 + colstreak\n square = 1 + min(rowstreak, colstreak, diagstreak)\n dp[r+1][c+1][2] = square\n maxsquare = max(square, maxsquare)\n #print(r, c, 'pass', dp)\n return maxsquare*maxsquare","memory":"28375"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows = len(matrix)\n cols = len(matrix[0])\n dp = [[[0, 0, 0] for __ in range(cols+1)] for _ in range(rows+1)]\n maxsquare = 0\n for r in range(rows):\n for c in range(cols):\n val = int(matrix[r][c])\n rowstreak, colstreak, diagstreak = dp[r][c]\n if val:\n dp[r][c+1][0] = 1 + rowstreak\n dp[r+1][c][1] = 1 + colstreak\n square = 1 + min(rowstreak, colstreak, diagstreak)\n dp[r+1][c+1][2] = square\n maxsquare = max(square, maxsquare)\n #print(r, c, 'pass', dp)\n return maxsquare*maxsquare","memory":"28925"},{"code":"'''\nIdea: prefix count\n\n(1, 4), (0, 0), (1, 3), (0, 0), (0, 0)\n(1, 3), (0, 0), (3, 2), (2, 2), (1, 2)\n(5, 2), (4, 1), (3, 1), (2, 2), (1, 1)\n(1, 1), (0, 0), (0, 0), (1, 1), (0, 0)\n\nIdea: binary search\n- Time: O(log(L)*m*n)\n - L = min(m, n)\n- Space: O(mn)\n'''\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n num_rows, num_cols = len(matrix), len(matrix[0])\n def square_exists(square_len):\n for row in range(num_rows):\n for col in range(num_cols):\n if is_square_with_len(row, col, square_len):\n return True\n return False\n\n runlen = [[[0, 0] for _ in range(num_cols)] for _ in range(num_rows)]\n for row in range(num_rows-1, -1, -1):\n for col in range(num_cols-1, -1, -1):\n if matrix[row][col] == '1':\n runlen[row][col][0] = 1\n if row < num_rows-1:\n runlen[row][col][0] += runlen[row+1][col][0]\n runlen[row][col][1] = 1\n if col < num_cols-1:\n runlen[row][col][1] += runlen[row][col+1][1]\n\n print(runlen)\n def is_square_with_len(row_start, col_start, square_len):\n if row_start+square_len > num_rows:\n return False\n if col_start+square_len > num_cols:\n return False\n while square_len:\n row_run, col_run = runlen[row_start][col_start]\n if row_run < square_len or col_run < square_len:\n return False\n row_start += 1\n col_start += 1\n square_len -= 1\n return True\n\n # def is_square_with_len(row_start, col_start, square_len):\n # if row_start+square_len > num_rows:\n # return False\n # if col_start+square_len > num_cols:\n # return False\n # for row in range(row_start, row_start+square_len):\n # for col in range(col_start, col_start+square_len):\n # if matrix[row][col] != '1':\n # return False\n # return True\n\n # loop invariant: lo points to a valid square length\n lo, hi = 0, min(num_rows, num_cols)+1\n while lo < hi:\n mid = (lo + hi + 1) >> 1\n if square_exists(mid):\n lo = mid\n else:\n hi = mid - 1\n return hi*hi","memory":"28925"},{"code":"class Solution:\n \"to katw dexia kanei define\"\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n res = [[0 for _ in range(n)] for _ in range(m)]\n test = [[[0,0] for _ in range(n)] for _ in range(m)]\n \n for row in range(m):\n for col in range(n):\n matrix[row][col] = int(matrix[row][col])\n for col in range(1, n):\n test[0][col][0] = (1+test[0][col-1][0]) * matrix[0][col-1]\n for row in range(1, m):\n test[row][0][1] = (1+test[row-1][0][1]) * matrix[row-1][0]\n for row in range(1, m):\n for col in range(1, n):\n test[row][col][0] = (1+test[row][col-1][0]) * matrix[row][col-1]\n test[row][col][1] = (1+test[row-1][col][1]) * matrix[row-1][col]\n \n print(test)\n for row in range(m):\n for col in range(n):\n res[row][col] = int(matrix[row][col])\n for size in reversed(range(2, min(row+2, col+2))):\n if matrix[row][col] == 1 and res[row-1][col-1] >= size-1 and min(test[row][col]) >= size-1: \n res[row][col] = size\n break\n \n max_size = max([max(i) for i in res])\n return max_size**2\n\n\n\n","memory":"29475"},{"code":"from dataclasses import dataclass\n@dataclass\nclass Cell:\n right_ones: int = 0\n down_ones: int = 0 \n square_size: int = 0\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n rows_num = len(matrix)\n cols_num = len(matrix[0])\n cells = [[Cell() for _ in range(cols_num + 1)]\n for _ in range(rows_num + 1)]\n\n def print_cells(cells, cur_row, cur_col):\n for row in range(len(cells) - 1):\n print()\n for col in range(len(cells[0]) - 1):\n c = cells[row][col]\n mark = '*' if cur_col == col and cur_row == row else '('\n print(f'{mark}{c.square_size}, {c.down_ones}, {c.right_ones})', end = ', ')\n\n max_square = 0\n for row in reversed(range(rows_num)):\n for col in reversed(range(cols_num)):\n if matrix[row][col] == \"0\":\n continue\n cell = cells[row][col]\n right = cells[row][col + 1]\n down = cells[row + 1][col]\n diag = cells[row + 1][col + 1]\n cell.right_ones = right.right_ones + 1\n cell.down_ones = down.down_ones + 1\n\n cell.square_size = min(diag.square_size, right.right_ones, down.down_ones) + 1\n # if diag.square_size <= right.right_ones and diag.square_size <= down.down_ones:\n # cell.square_size = diag.square_size + 1\n max_square = max(max_square, cell.square_size)\n # print(f'{row},{col}: {cell}, {matrix[row][col]}')\n # print_cells(cells, row, col)\n # print()\n # print(cells)\n \n return max_square * max_square\n\n\n ","memory":"29475"},{"code":"class Solution:\n \"\"\"\n 0 0 0 1\n 1 1 0 1\n 1 1 1 1 \n 0 1 1 1\n 0 1 1 1\n \"\"\"\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n dp = [[(float('inf'), float('inf')) for i in range(len(matrix[0]))] for j in range(len(matrix))] #Record the top left corner of the square\n \n out = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if matrix[i][j] == \"0\":\n continue\n\n dp[i][j] = (i, j) #2 3\n out = max(out, 1)\n if i == 0 or j == 0:\n continue\n\n new_top_left = dp[i - 1][j - 1] #1, 2\n if new_top_left != (float('inf'), float('inf')):\n left_res_y, left_res_x = dp[i][j - 1] # 2 2\n up_res_y, up_res_x = dp[i - 1][j] # 1 3\n\n new_coords = (max(up_res_y, new_top_left[0]), max(left_res_x, new_top_left[1]))\n diagonal = min(i - new_coords[0], j - new_coords[1])\n\n if new_coords[0] == float('inf') or new_coords[1] == float('inf'):\n continue\n dp[i][j] = (i - diagonal, j - diagonal)\n out = max(out, (i - dp[i][j][0] + 1) * (j - dp[i][j][1] + 1))\n \n return out\n \n\n\n\n\n \n\n","memory":"30025"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n # maximal_len = m if m < n else n\n target_len = 1\n bad_starting_squares = set()\n def find_square(coord: tuple):\n searched_squares = set()\n if coord[0] + target_len > m:\n return None\n if coord[1] + target_len > n:\n return None\n for i in range(coord[0], coord[0] + target_len):\n for j in range(coord[1], coord[1] + target_len):\n if matrix[i][j] == \"0\":\n bad_starting_squares.add((i, j))\n bad_starting_squares.add(coord)\n return False\n return True\n def solution():\n nonlocal target_len\n found = False\n for i in range(m):\n if i + target_len > m:\n break\n for j in range(n):\n if j + target_len > n:\n break\n if (i, j) in bad_starting_squares:\n continue\n found = find_square((i, j))\n if found:\n target_len += 1\n return solution()\n if found is None:\n bad_starting_squares.add((i, j))\n break\n return (target_len - 1)**2\n \n return solution()\n","memory":"30575"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n # maximal_len = m if m < n else n\n target_len = 1\n bad_starting_squares = set()\n def find_square(coord: tuple):\n searched_squares = set()\n # if coord[0] + target_len > m:\n # return None\n if coord[1] + target_len > n:\n return None\n for i in range(coord[0], coord[0] + target_len):\n for j in range(coord[1], coord[1] + target_len):\n if matrix[i][j] == \"0\":\n bad_starting_squares.add((i, j))\n bad_starting_squares.add(coord)\n return False\n return True\n def solution():\n nonlocal target_len\n found = False\n for i in range(m):\n if i + target_len > m:\n break\n for j in range(n):\n if (i, j) in bad_starting_squares:\n continue\n found = find_square((i, j))\n if found:\n target_len += 1\n return solution()\n if found is None:\n bad_starting_squares.add((i, j))\n break\n return (target_len - 1)**2\n \n return solution()\n","memory":"30575"},{"code":"import numpy as np\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n matrix = np.array(matrix)\n m,n = len(matrix),len(matrix[0])\n max_len = 0\n dp = [[0]*n for _ in range(m)]\n max_size = 0\n\n for i in range(m):\n for j in range(n):\n if matrix[i][j] == '1':\n if i ==0 or j==0:\n dp[i][j] = 1\n else:\n dp[i][j] = min(dp[i-1][j],dp[i-1][j-1],dp[i][j-1])+1\n max_size = max(max_size, dp[i][j])\n return max_size*max_size","memory":"31125"},{"code":"import numpy as np\n\n\nclass Solution:\n def isInBounds(self, m, n, x, y):\n inbounds = 0 <= x < m and 0 <= y < n\n return inbounds\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n calc = np.zeros((m, n))\n largest_side = 0\n for i in range(m):\n for j in range(n):\n north = calc[i - 1][j] if self.isInBounds(m, n, i - 1, j) else 0\n west = calc[i][j - 1] if self.isInBounds(m, n, i, j - 1) else 0\n northwest = calc[i - 1][j - 1] if self.isInBounds(m, n, i - 1, j - 1) else 0\n val = 1 + min(north, west, northwest)\n calc[i][j] = val if int(matrix[i][j]) > 0 else 0\n largest_side = max(calc[i][j], largest_side)\n return int(largest_side ** 2)\n","memory":"31125"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n # maximal_len = m if m < n else n\n target_len = 1\n bad_starting_squares = set()\n def find_square(coord: tuple):\n searched_squares = set()\n if coord[0] + target_len > m:\n return None\n if coord[1] + target_len > n:\n return None\n for i in range(coord[0], coord[0] + target_len):\n for j in range(coord[1], coord[1] + target_len):\n if matrix[i][j] == \"0\":\n bad_starting_squares.add((i, j))\n bad_starting_squares.add(coord)\n return False\n return True\n def solution():\n nonlocal target_len\n # nonlocal bad_starting_squares\n found = False\n for i in range(m):\n if i + target_len > m:\n break\n for j in range(n):\n if (i, j) in bad_starting_squares:\n continue\n found = find_square((i, j))\n if found:\n target_len += 1\n return solution()\n if found is None:\n bad_starting_squares.add((i, j))\n break\n return (target_len - 1)**2\n \n return solution()\n","memory":"31675"},{"code":"import numpy as np\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n res = np.zeros((m+1, n+1))\n # print(res)\n for i in range(m):\n for j in range(n):\n if matrix[i][j] == \"1\":\n res[i+1][j+1] = min(res[i][j], res[i+1][j], res[i][j+1]) + 1\n # print(res)\n return int(np.max(res)**2)\n\n\n \n \n ","memory":"31675"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n import numpy as np\n \n m=len(matrix)\n n=len(matrix[0])\n\n dp=[[0 for i in range(n)] for j in range(m)]\n \n for i in range(m):\n for j in range(n):\n if i==0 or j==0:\n dp[i][j]=int(matrix[i][j])\n continue\n if matrix[i][j]==\"0\":\n dp[i][j]=0\n continue\n \n dp[i][j]=min(dp[i-1][j],dp[i][j-1],dp[i-1][j-1])+1\n #print(dp)\n return np.max(dp)*np.max(dp)","memory":"32225"},{"code":"from functools import cache\nimport numpy as np\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n squares = np.zeros((rows+1, cols+1), dtype=int)\n maximum = 0\n\n for r in range(rows-1, -1, -1):\n for c in range(cols-1, -1, -1):\n if matrix[r][c] != '0':\n right = squares[r][c+1]\n down = squares[r+1][c]\n diag = squares[r+1][c+1]\n size = min(right, down) + 1\n if size - 1 > diag:\n squares[r][c] = size - 1\n else:\n squares[r][c] = size\n\n maximum = max(maximum, squares[r][c])\n \n #print(squares)\n return maximum ** 2\n\n\n\n\n\n","memory":"32225"},{"code":"import numpy as np\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n '''\n M,N = len(matrix), len(matrix[0])\n cumsum = np.zeros((M+1,N+1))\n for i in range(M):\n for j in range(N):\n cumsum[i+1,j+1] = int(matrix[i][j]) + cumsum[i,j+1] + cumsum[i+1,j] - cumsum[i,j]\n \n max_size = min(M,N)\n for sz in range(max_size, 0, -1):\n for i in range(M+1-sz):\n for j in range(N+1-sz):\n area_sum = cumsum[i+sz,j+sz] - cumsum[i,j+sz] - cumsum[i+sz,j] + cumsum[i,j]\n if area_sum == sz*sz:\n return sz*sz\n return 0\n '''\n M,N = len(matrix), len(matrix[0])\n dp = np.zeros((M+1,N+1)).astype(int) \n for i in range(M):\n for j in range(N):\n if matrix[i][j] == '1':\n dp[i+1,j+1] = 1 + min(dp[i,j+1], dp[i+1,j], dp[i,j])\n max_size = np.max(np.max(dp))\n return max_size*max_size","memory":"32775"},{"code":"import numpy as np\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n matrix = np.array(matrix).astype(int)\n dp = matrix.copy()\n curr_max = np.max(dp)\n print(dp)\n for i in range(1, dp.shape[0]):\n for j in range(1, dp.shape[1]):\n ll = min([dp[i-1][j-1], dp[i][j-1], dp[i-1][j]])\n if np.sum(matrix[i, j-ll:j+1]) == np.sum(matrix[i-ll:i+1, j]) == ll+1 and \\\n dp[i-1][j]:\n dp[i][j] = ll + 1\n curr_max = max(curr_max, dp[i][j])\n print(dp)\n return curr_max ** 2","memory":"32775"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n rows = []\n cols = [[0] * n for _ in range(m)]\n for r in range(m):\n temp = [0] * n\n for c in range(n):\n if matrix[r][c] != \"0\":\n if c > 0:\n temp[c] = temp[c-1]+1\n else:\n temp[c] = 1\n rows.append(temp)\n\n for c in range(n):\n curr = 0\n for r in range(m):\n if matrix[r][c] != \"0\":\n if r > 0:\n cols[r][c] = cols[r-1][c]+1\n else:\n cols[r][c] = 1\n visited = set()\n print(rows)\n print(cols)\n ans = 0\n for i in range(m):\n for j in range(n):\n if (i, j) not in visited and matrix[i][j] == \"1\":\n length = 1\n visited.add((i, j))\n ti, tj = i+1, j+1\n while ti < m and tj < n and min(rows[ti][tj], cols[ti][tj]) >= (length+1):\n length += 1\n ti += 1\n tj += 1\n ans = max(ans, length**2) \n return ans\n\n\n\n \n \n\n ","memory":"33325"},{"code":"import collections\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n # Recurrence: this is the maximum size of the square ending\n # on this element.\n self.M = collections.defaultdict(int)\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if matrix[i][j] == '0':\n self.M[i, j] = 0\n else:\n self.M[i, j] = min([\n self.M[i-1, j],\n self.M[i, j-1],\n self.M[i-1, j-1],\n ]) + 1\n return max(self.M.values())**2","memory":"33875"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n def check_square(i, j, matrix, node_map):\n if i >= len(matrix) or j >= len(matrix[0]) or matrix[i][j] == \"0\":\n return 0\n if node_map.get((i,j)):\n return node_map.get((i,j))\n res = min(check_square(i, j+1, matrix, node_map), check_square(i+1, j, matrix, node_map), check_square(i+1, j+1, matrix, node_map))\n node_map[(i,j)] = res+1\n return node_map[(i,j)]\n\n\n\n def get_max_sqaure(i, j, matrix, node_map):\n max_length = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if matrix[i][j] == \"1\":\n if node_map.get((i,j)):\n length = node_map.get((i,j))\n else:\n length = check_square(i,j, matrix, node_map)\n if length > max_length:\n max_length = length\n return max_length**2\n\n node_map = {}\n return get_max_sqaure(0, 0, matrix, node_map)\n ","memory":"34425"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n def check_square(i, j, matrix, node_map):\n if i >= len(matrix) or j >= len(matrix[0]) or matrix[i][j] == \"0\":\n return 0\n if node_map.get((i,j)):\n return node_map.get((i,j))\n res = min(check_square(i, j+1, matrix, node_map), check_square(i+1, j, matrix, node_map), check_square(i+1, j+1, matrix, node_map))\n node_map[(i,j)] = res+1\n return node_map[(i,j)]\n\n\n\n def get_max_sqaure(i, j, matrix, node_map):\n max_length = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if matrix[i][j] == \"1\":\n if node_map.get((i,j)):\n length = node_map.get((i,j))\n else:\n length = check_square(i,j, matrix, node_map)\n if length > max_length:\n max_length = length\n return max_length**2\n\n node_map = {}\n return get_max_sqaure(0, 0, matrix, node_map)\n ","memory":"34425"},{"code":"class Solution:\n res = 0\n\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n self.help(m-1, n-1, matrix, {})\n return self.res ** 2\n\n def help(self, i, j, matrix, states):\n if i < 0 or j < 0:\n return 0\n if (i, j) in states:\n return states[(i, j)]\n\n states[(i, j)] = min(self.help(i-1, j, matrix, states), self.help(i-1, j-1, matrix, states), self.help(i, j-1, matrix, states)) + 1\n\n if matrix[i][j] == \"0\":\n states[(i, j)] = 0\n\n self.res = max(self.res, states[(i, j)])\n \n\n return states[(i, j)]\n\n ","memory":"34975"},{"code":"from typing import List\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n \n cache = {}\n for i in range(len(matrix)):\n cache[i,len(matrix[0])] = 0\n for i in range(len(matrix[0])):\n cache[len(matrix),i] = 0\n cache[len(matrix),len(matrix[0])]=0\n \n for i in range(len(matrix)-1,-1,-1):\n for j in range(len(matrix[0])-1,-1,-1):\n if matrix[i][j] == \"1\":\n down = cache[i+1,j]\n right = cache[i,j+1]\n dig = cache[i+1,j+1]\n \n cache[i,j] = min(dig,right,down) + 1\n else:\n cache[i,j] = 0\n \n\n return max(cache.values())**2","memory":"34975"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n memo = {}\n maxLength = 0\n \n def dfs(r, c, memo):\n if r >= ROWS or c >= COLS:\n return 0\n if (r,c) in memo:\n return memo[(r,c)]\n if matrix[r][c] == \"0\":\n memo[(r,c)] = 0\n return 0\n \n right = dfs(r, c+1, memo)\n down = dfs(r+1, c, memo)\n diag = dfs(r + 1, c + 1, memo)\n side_length = 1 + min(right, down, diag)\n memo[(r,c)] = side_length\n\n return side_length\n for r in range(ROWS):\n for c in range(COLS):\n maxLength = max(maxLength, dfs(r,c,memo))\n return maxLength ** 2\n","memory":"35525"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n memo = {}\n maxLength = 0\n \n def dfs(r, c, memo):\n if r >= ROWS or c >= COLS:\n return 0\n if (r,c) in memo:\n return memo[(r,c)]\n if matrix[r][c] == \"0\":\n memo[(r,c)] = 0\n return 0\n \n right = dfs(r, c+1, memo)\n down = dfs(r+1, c, memo)\n diag = dfs(r + 1, c + 1, memo)\n side_length = 1 + min(right, down, diag)\n memo[(r,c)] = side_length\n\n return side_length\n for r in range(ROWS):\n for c in range(COLS):\n maxLength = max(maxLength, dfs(r,c,memo))\n return maxLength ** 2\n","memory":"35525"},{"code":"from typing import List\n\nclass Solution:\n def maximalSquare(self, m: List[List[str]]) -> int:\n if not m or not m[0]:\n return 0\n\n def solve(i, j, memo):\n if i >= len(m) or j >= len(m[0]):\n return 0\n if m[i][j] == '0':\n return 0\n if (i, j) in memo:\n return memo[(i, j)]\n\n right = solve(i, j + 1, memo)\n down = solve(i + 1, j, memo)\n diag = solve(i + 1, j + 1, memo)\n\n memo[(i, j)] = 1 + min(right, down, diag)\n return memo[(i, j)]\n\n memo = {}\n max_side = 0\n for i in range(len(m)):\n for j in range(len(m[0])):\n max_side = max(max_side, solve(i, j, memo))\n\n return max_side * max_side\n","memory":"36075"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n global dic\n dic={}\n def dp(i,j):\n global dic\n if (i,j) in dic:\n return dic[(i,j)]\n elif i>=len(matrix) or j>=len(matrix[0]) or matrix[i][j]=='0':\n return 0\n elif matrix[i][j]=='1':\n dic[(i,j)]=1+min(dp(i+1,j),dp(i,j+1),dp(i+1,j+1))\n return dic[(i,j)]\n maxi=0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if matrix[i][j]=='0':\n dic[(i,j)]=0\n else:\n dic[(i,j)]=dp(i,j)\n if maxi<dic[(i,j)]:\n maxi=dic[(i,j)]\n return maxi**2","memory":"36075"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n \n memo = {}\n\n def in_bounds(point):\n r, c = point\n return 0 <= r < len(matrix) and 0 <= c < len(matrix[0])\n\n def max_square_side(point):\n if point in memo:\n return memo[point]\n if not in_bounds(point):\n return 0\n\n memo[point] = 0\n r, c = point\n\n moves = [(r,c+1),(r+1,c+1),(r+1,c)]\n child_square_sizes = [max_square_side(move) for move in moves]\n\n if matrix[r][c] == '1':\n memo[point] = 1 + min(child_square_sizes)\n\n return memo[point]\n max_square_side((0,0))\n\n print(memo)\n return max(memo.values()) ** 2\n","memory":"36625"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n \n max_area = 0\n n, m = len(matrix), len(matrix[0])\n\n @functools.lru_cache(maxsize=None)\n def get_largest_square(i, j):\n if i == n or j == m:\n return 0\n if matrix[i][j] == \"0\":\n return 0\n \n min_ = 1 + min(get_largest_square(i+1, j), get_largest_square(i, j+1))\n inside_squares = [min_] + [l + get_largest_square(i+l, j+l) for l in range(1, min_)]\n return min(inside_squares)\n\n max_area = 0\n for i in range(n):\n for j in range(m):\n if matrix[i][j] != \"1\":\n continue\n max_area = max(max_area,get_largest_square(i, j)**2)\n \n return max_area","memory":"36625"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n n,m = len(matrix), len(matrix[0])\n\n @cache\n def dfs(i, j):\n if not (0<= i <n and 0 <= j < m and matrix[i][j] == '1'): return 0\n curr = float('inf')\n for x,y in [i+1,j], [i+1, j+1], [i, j+1]:\n curr = min(curr, 1 + dfs(x,y))\n return curr\n\n ans = 0\n for i in range(n):\n for j in range(m):\n if matrix[i][j] == '1':\n ans = max(ans, dfs(i, j))\n \n return ans * ans","memory":"37175"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n # returns area of largest square of ones\n # naive: we could go through all lengths and check if square exists of that lengtn\n # can binary search it due to monolicity\n # 0 -> n\n # for each possible side len, loop all squares but also sum up all boxes in square? kinda slow. n*n*i*i\n # square is good if sum inside is i*i, can easily get that with prefix summing\n # finally, bounds of loop for i: i=side_len-1 -> end j= side_len-1 -> end\n n,m = len(matrix), len(matrix[0])\n if not n and not m:\n return 0\n prefix_sums = {} # use subproblem\n prefix_sums[(0,0)] = int(matrix[0][0])\n prefix_sums[(-1,-1)] = 0\n prefix_sums[(0,-1)] = 0\n prefix_sums[(-1,0)] = 0\n for c in range(1, m):\n prefix_sums[(0,c)] = prefix_sums[(0,c-1)]+int(matrix[0][c])\n prefix_sums[(-1,c)] = 0\n for r in range(1,n):\n prefix_sums[(r,0)] = prefix_sums[(r-1,0)]+int(matrix[r][0])\n prefix_sums[(r,-1)] = 0\n for i in range(1,n):\n for j in range(1,m):\n prefix_sums[(i,j)] = prefix_sums[(i-1,j)]+prefix_sums[(i,j-1)]-prefix_sums[(i-1,j-1)]+int(matrix[i][j])\n def is_filled_with_ones(i,j,side_len):\n #print(i,j,side_len)\n #print(prefix_sums)\n # if (i,j) == (2,4):\n #print(f\"sum at 2,3 {prefix_sums[(i,j)]-prefix_sums[(i-side_len,j)]-prefix_sums[(i,j-side_len)]+prefix_sums[(i-side_len,j-side_len)]}\")\n return (prefix_sums[(i,j)]-prefix_sums[(i-side_len,j)]-prefix_sums[(i,j-side_len)]+prefix_sums[(i-side_len,j-side_len)]) == (side_len * side_len)\n def condition(side_len):\n for i in range(side_len-1, n):\n for j in range(side_len-1, m):\n if is_filled_with_ones(i,j,side_len):\n return True\n return False # is not exist 11-2-7=2+2 = 4\n l, r = 0, min(n,m)\n while l < r:\n mid = (l+r+1)//2\n #print(\"m is condition is \", mid, condition(mid))\n if condition(mid): # if exist\n l = mid\n else: # exitisth\n r = mid-1\n return l*l\n ","memory":"37175"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n \n R, C = len(matrix), len(matrix[0])\n directions = [(1, 0), (0, 1), (1, 1)] # Diagonal down and to the right\n max_length = 0\n memo = {}\n\n def dfs(r, c):\n if r >= R or r < 0 or c >= C or c < 0 or matrix[r][c] == \"0\":\n return 0\n if (r, c) in memo:\n return memo[(r, c)]\n\n # Calculate size of square\n down, right, diag = [dfs(r+dr, c+dc) for dr, dc in directions]\n length = min(down, right, diag) + 1\n memo[(r, c)] = length\n return memo[(r, c)]\n \n for r in range(R):\n for c in range(C):\n if matrix[r][c] == \"1\":\n max_length = max(max_length, dfs(r, c))\n \n return max_length ** 2\n\n\n# T: O(RC)\n# S: O(RC)\n ","memory":"37725"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n cache = {} # (r, c) : side len of squares\n def recurse_helper(r, c):\n # check base cases\n if (r,c) in cache:\n return cache[(r,c)]\n # solve recursively\n options = []\n if r + 1 < len(matrix):\n options.append(recurse_helper(r+1, c))\n else:\n options.append(0)\n if c + 1 < len(matrix[0]):\n options.append(recurse_helper(r, c+1))\n else:\n options.append(0)\n if r + 1 < len(matrix) and c + 1 < len(matrix[0]):\n options.append(recurse_helper(r+1, c+1))\n else:\n options.append(0)\n sol = min(options) + 1\n if matrix[r][c] == \"0\":\n sol = 0\n cache[(r, c)] = sol\n return sol\n recurse_helper(0, 0)\n return max(cache.values()) ** 2\n \n\n","memory":"37725"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n cache = {} # (r, c) : side len of squares\n def recurse_helper(r, c):\n # check base cases\n if (r,c) in cache:\n return cache[(r,c)]\n # solve recursively\n options = []\n if r + 1 < len(matrix):\n options.append(recurse_helper(r+1, c))\n else:\n options.append(0)\n if c + 1 < len(matrix[0]):\n options.append(recurse_helper(r, c+1))\n else:\n options.append(0)\n if r + 1 < len(matrix) and c + 1 < len(matrix[0]):\n options.append(recurse_helper(r+1, c+1))\n else:\n options.append(0)\n # add to cache\n sol = min(options) + 1\n if matrix[r][c] == \"0\":\n sol = 0\n cache[(r, c)] = sol\n return sol\n recurse_helper(0, 0)\n return max(cache.values()) ** 2\n \n\n","memory":"38275"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n def isSquare(m, n, s):\n # check whether square chould expand from (m+s-1, n+s-1) -> (m+s,n+s)\n # return true or false, and area of the current square\n for i in range(s):\n \n if matrix[m+i][n+s-1] == \"0\" or matrix[m+s-1][n+i] == \"0\":\n \n return False, (s-1) ** 2\n return True, (s) ** 2\n\n \n memo = {}\n max_area = 0\n print(len(matrix), len(matrix[0]))\n \n def dp(m, n):\n nonlocal max_area\n\n \n\n if m == len(matrix) or n == len(matrix[0]):\n #print(m, n)\n return 0\n if (m,n) in memo:\n return memo[(m,n)]\n #print(\"check 0\",\"row = \", m, \"col = \",n, \"element = \", matrix[m][n])\n\n if matrix[m][n] == \"0\":\n #print(\"check 1\",\"row = \", m, \"col = \",n, matrix[m][n])\n\n ans = max(dp(m+1,n), dp(m,n+1))\n \n else:\n s = 1\n curr_area = 1\n \n while m + s - 1 < len(matrix) and n+s-1 < len(matrix[0]):\n #print(\"check 2\",\"row = \", m, \"col = \",n, matrix[m][n], \"area =\",curr_area)\n flag, curr_area = isSquare(m, n, s)\n if not flag:\n break\n s += 1\n \n \n max_area = max(max_area, curr_area)\n #print(\"max_area =\", max_area)\n if curr_area == (len(matrix)-1)**2:\n #print(\"check 3\")\n ans = 0\n\n\n else:\n #print(\"check 4\")\n ans = max(dp(m, n + 1), dp(m + 1, n))\n \n memo[(m,n)] = ans\n \n return ans\n\n dp(0, 0)\n \n return max_area\n \n \n \n \n \n ","memory":"38825"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n visited = {}\n max_square = 0\n def dfs(r, c):\n nonlocal max_square\n if r >= 0 and r < len(matrix) and c >= 0 and c < len(matrix[r]) and matrix[r][c] == \"1\":\n if (r, c) in visited:\n return visited[(r, c)]\n\n min_size = math.inf\n for dr, dc in [[0, 1], [1, 0]]:\n min_size = min(min_size, dfs(r + dr, c + dc))\n if matrix[r + min_size][c + min_size] == \"1\":\n max_square = max(max_square, (min_size + 1) * (min_size + 1))\n visited[(r, c)] = min_size + 1\n return min_size + 1\n max_square = max(max_square, min_size if min_size else 1)\n visited[(r, c)] = min_size if min_size else 1\n return min_size if min_size else 1\n return 0\n\n max_square = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[i])):\n if (i, j) not in visited and matrix[i][j] == \"1\":\n dfs(i, j)\n\n return max_square","memory":"38825"},{"code":"import numpy as np\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n dp = np.zeros((m,n))\n for i in range(m):\n dp[i][0] = int(matrix[i][0])\n for j in range(n):\n dp[0][j] = int(matrix[0][j])\n res1 = np.max(dp[0, :])\n res2 = np.max(dp[:,0])\n res = max([res1, res2])\n for i in range(1, m):\n for j in range(1, n):\n if matrix[i][j]=='1':\n side2 = min([dp[i-1][j-1], dp[i][j-1], dp[i-1][j]])\n dp[i][j] = (np.sqrt(side2)+1)**2\n res = max(res, dp[i][j])\n \n return int(res)\n\n\n\n\n\n\n\n\n\n\n\n\n # m, n = len(matrix), len(matrix[0])\n # dp = [[0]*(n+1) for i in range(m+1)]\n # res = 0\n # for i in range(m):\n # for j in range(n):\n # if matrix[i][j]==\"1\":\n # dp[i+1][j+1]==1\n # dp[i+1][j+1] = (np.sqrt(min([dp[i][j],dp[i+1][j], dp[i][j+1] ]))+1)**2\n # res = max(res, dp[i+1][j+1])\n # #print(dp)\n # return int(res)\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 # for i in range(m):\n # for j in range(n):\n # if matrix[i][j]=='1':\n # dp[i+1][j+1] = (sqrt(min([dp[i][j], dp[i+1][j], dp[i][j+1]]))+1)**2\n # if dp[i+1][j+1]>res:\n # res = dp[i+1][j+1]\n # return int(res)\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 # m1 = np.zeros((m, n), dtype=int)\n # res = 0\n # for i in range(m):\n # m1[i][0] = int(matrix[i][0])\n # res = max(res, m1[i][0])\n # for j in range(n):\n # m1[0][j] = int(matrix[0][j])\n # res = max(res, m1[0][j])\n # #print(res)\n # for i in range(1, m):\n # for j in range(1, n):\n # if int(matrix[i][j]) == 1:\n # res1 = min([m1[i][j-1], m1[i-1][j-1], m1[i-1][j]]) + 1\n # m1[i][j] = res1\n # res = max(res, res1)\n # print(m1)\n # return res*res\n","memory":"39375"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n cache = {} # (r, c) : side len of squares\n @lru_cache\n def recurse_helper(r, c):\n # check base cases\n if (r,c) in cache:\n return cache[(r,c)]\n # solve recursively\n options = []\n if r + 1 < len(matrix):\n options.append(recurse_helper(r+1, c))\n else:\n options.append(0)\n if c + 1 < len(matrix[0]):\n options.append(recurse_helper(r, c+1))\n else:\n options.append(0)\n if r + 1 < len(matrix) and c + 1 < len(matrix[0]):\n options.append(recurse_helper(r+1, c+1))\n else:\n options.append(0)\n # add to cache\n sol = min(options) + 1\n if matrix[r][c] == \"0\":\n sol = 0\n cache[(r, c)] = sol\n return sol\n recurse_helper(0, 0)\n return max(cache.values()) ** 2\n \n\n","memory":"39925"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n cache = {} # (r, c) : side len of squares\n @lru_cache\n def recurse_helper(r, c):\n # check base cases\n if (r,c) in cache:\n return cache[(r,c)]\n # solve recursively\n options = []\n if r + 1 < len(matrix):\n options.append(recurse_helper(r+1, c))\n else:\n options.append(0)\n if c + 1 < len(matrix[0]):\n options.append(recurse_helper(r, c+1))\n else:\n options.append(0)\n if r + 1 < len(matrix) and c + 1 < len(matrix[0]):\n options.append(recurse_helper(r+1, c+1))\n else:\n options.append(0)\n # add to cache\n sol = min(options) + 1\n if matrix[r][c] == \"0\":\n sol = 0\n cache[(r, c)] = sol\n return sol\n recurse_helper(0, 0)\n return max(cache.values()) ** 2\n \n\n","memory":"39925"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n curr_size = 1\n square_locs = {(r, c) for r in range(m) for c in range(n) if matrix[r][c] == '1'}\n if not square_locs:\n return 0\n if len(square_locs) == m * n:\n return min(m, n) ** 2\n while True:\n new_square_locs = set() # edge len + 1\n for r, c in square_locs:\n if all(corners in square_locs for corners in [(r + 1, c), (r, c + 1), (r + 1, c + 1)]):\n new_square_locs.add((r, c))\n if new_square_locs:\n curr_size += 1\n square_locs = new_square_locs\n else:\n break\n \n return curr_size ** 2\n\n\n'''\nprefix sums?\n90000 area total\n\ndumb:\n4 squares with tl corner in 2x2 can make a new bigger square\n\nfind all 1x1, store r, c tuples in set\n2x2: for all tl of 1x1, see if tl of a 2x2\n\nmax len 300, 300 * 90000 = 27,000,000 should be fast enough\n'''","memory":"40475"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n\n m, n = len(matrix), len(matrix[0])\n\n new_square = [['0']+row for row in matrix]\n new_square.insert(0, ['0']*(n+1))\n\n maximal = 0\n\n # Hashmap (i, j) -> (square_size, top_col, left_col)\n map = {}\n\n for i in range(m+1):\n for j in range(n+1):\n\n if new_square[i][j] == '0':\n map[(i, j)] = (0, 0, 0)\n\n else: \n top_col = 1 + map[(i-1, j)][1]\n left_col = 1 + map[(i, j-1)][2]\n prev_square_size = map[(i-1, j-1)][0]\n\n square_size = min([1+prev_square_size, top_col, left_col])\n map[(i, j)] = (square_size, top_col, left_col)\n\n if square_size > maximal:\n maximal = square_size\n\n\n return maximal**2","memory":"41025"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n # have an is_square set with top right (x, y) as well as length \n # starts with (0, 0, 0), etc to (2, 1, 1)\n # checking for 2x2 onward by going thru all possible ones and asking for 4 checks\n # then goes onto nxn\n height = len(matrix)\n width = len(matrix[0])\n\n valids = set()\n for i in range(height):\n for j in range(width):\n if matrix[i][j] == \"1\":\n valids.add((i, j))\n\n if not valids:\n return 0\n for side in range(1, min(height, width)):\n new_valids = set()\n for i in range(height - side + 1):\n for j in range(width - side + 1):\n if (i, j) in valids and (i+1, j) in valids and (i, j+1) in valids and (i+1, j+1) in valids:\n new_valids.add((i, j))\n \n if len(new_valids) < 4:\n if len(new_valids) > 0:\n return (side + 1)**2\n else:\n return side ** 2\n valids = new_valids\n \n return min(height, width)**2\n ","memory":"41025"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n \n memo = {}\n def dp(i,j):\n if i >= len(matrix) or j >= len(matrix[0]):\n return 0\n\n key = \"{}-{}\".format(i,j)\n if key in memo:\n return memo[key]\n \n min_square = 0\n if matrix[i][j] == '1':\n min_square = min(dp(i+1, j), dp(i,j+1), dp(i+1,j+1))+1\n \n memo[key] = min_square\n\n return memo[key]\n \n max_square = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n max_square = max(max_square, dp(i,j))\n\n return max_square ** 2","memory":"41575"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n memo = {}\n\n def dfs(i, j):\n if 0<=i<m and 0<=j<n:\n if i == m-1 and j == n-1:\n memo[(i, j)] = int(matrix[i][j])\n return memo[(i, j)]\n if (i, j) in memo:\n return memo[(i, j)]\n area = float('inf')\n for x, y in [(1, 0), (0, 1), (1, 1)]:\n x0, y0 = i+x, j+y\n childArea = dfs(x0, y0)\n area = min(childArea, area)\n memo[(i, j)] = area+1 if int(matrix[i][j]) else 0\n return memo[(i, j)]\n memo[(i, j)] = 0\n return 0\n \n dfs(0, 0)\n return max(memo.values())**2","memory":"42125"},{"code":"class Solution:\n def maximalSquare(self, grid: List[List[str]]) -> int:\n dirs = [\n (0, 1),\n (1, 1),\n (1, 0)\n ]\n bfs = [(0,0)]\n\n h = len(grid)\n w = len(grid[0])\n\n for y in range(h):\n for x in range(w):\n for dy, dx in dirs:\n if y + dy < h and x + dx < w: \n bfs.append((y + dy, x + dx))\n total = 0\n for y,x in reversed(bfs):\n if (grid[y][x] != \"0\"):\n m = float('inf')\n for dy, dx in dirs:\n if y + dy < h and x + dx < w: \n m = min(m, int(grid[y + dy][x + dx]))\n else:\n m = 0\n if (m == float('inf')):\n m = int(grid[y][x]) -1\n\n grid[y][x] = str(m + 1)\n total = max(total, m + 1)\n \n # for g in grid:\n # print(g)\n\n return total * total","memory":"42675"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows = len(matrix)\n cols = len(matrix[0])\n\n to_downs = {}\n cache = {}\n\n sz_max = 0\n for y in reversed(range(rows)):\n to_right = 0\n for x in reversed(range(cols)):\n is_one = matrix[y][x] == \"1\"\n if not is_one:\n to_right = 0\n continue\n \n max_width = to_right + 1\n max_height = to_downs.get((x, y + 1), 0) + 1\n to_downs[(x, y)] = max_height\n to_right = max_width\n\n max_sz = min(max_width, max_height)\n max_sub = cache.get((x + 1, y + 1), 0)\n sz = max(is_one, min(max_sz, max_sub + 1))\n cache[(x, y)] = sz\n sz_max = max(sz_max, sz)\n return sz_max ** 2","memory":"43225"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n memo = {} # (i, j):maxSquare\n def dfs(i, j):\n # out of bound or '0' in matrix, return 0\n # base case - last row, col\n # if in memo, return memo[pos]\n if i >= len(matrix) or j >= len(matrix[0]):\n return 0\n if i == len(matrix) - 1 or j == len(matrix[0]) - 1 or matrix[i][j] == '0':\n memo[(i, j)] = int(matrix[i][j])\n return memo[(i, j)]\n if (i, j) in memo:\n return memo[(i, j)]\n\n # i, j itself 0 -> 0\n # if one of the neighbor is '0' -> store and return the matrix[i][j] itself\n minSquare = float('inf')\n for dr, dc in [(1, 0), (0, 1), (1, 1)]:\n nei = dfs(i + dr, j + dc)\n if nei == 0:\n memo[(i, j)] = int(matrix[i][j])\n return memo[(i, j)]\n minSquare = min(minSquare, nei)\n # max square of (i, j) -> min(minSquare of neighbor) + 1\n memo[(i, j)] = minSquare + 1\n return memo[(i, j)]\n \n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n dfs(r, c) # being top left start point\n\n # iterate through memo to get max square\n maxSquare = 0\n for r, c in memo:\n maxSquare = max(maxSquare, memo[(r, c)])\n return maxSquare * maxSquare","memory":"43775"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n m = len(matrix)\n n = len(matrix[0])\n directions = [(0, 1), (1, 0), (1, 1)]\n \n @cache\n def dp(i, j):\n if i >= m or i < 0 or j >= n or j < 0:\n return 0\n \n if matrix[i][j] == \"0\":\n return 0\n\n res = 1\n add = float('inf')\n for di, dj in directions:\n ni, nj = i + di, j + dj\n add = min(add, dp(ni, nj))\n \n return res + add\n \n ans = 0\n for i in range(m):\n for j in range(n):\n ans = max(ans, dp(i, j))\n\n return ans*ans\n\n","memory":"44325"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n m = len(matrix)\n n = len(matrix[0])\n directions = [(0, 1), (1, 0), (1, 1)]\n \n @cache\n def dp(i, j):\n if i >= m or i < 0 or j >= n or j < 0:\n return 0\n \n if matrix[i][j] == \"0\":\n return 0\n\n res = 1\n add = float('inf')\n for di, dj in directions:\n ni, nj = i + di, j + dj\n add = min(add, dp(ni, nj))\n \n return res + add\n \n ans = 0\n for i in range(m):\n for j in range(n):\n ans = max(ans, dp(i, j))\n\n return ans*ans\n\n","memory":"44875"},{"code":"import numpy as np\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix[0])\n n = len(matrix)\n M = np.array([[int(matrix[i][j]) for i in range(n)] for j in range(m)]).T\n dic = {}\n dp = np.zeros((n, m))\n maxi = 0\n for i in range(n):\n for j in range(m):\n if M[i, j] == 0:\n dp[i, j] = 0\n \n else:\n if (i, j) in dic:\n dp[i, j] = dic[(i, j)]\n else:\n dp[i, j] = 1 + min(dp[i-1, j], dp[i, j-1], dp[i-1, j-1])\n dic[(i, j)] = dp[i, j]\n \n return int(np.max(dp))**2\n ","memory":"45425"},{"code":"import numpy as np\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix[0])\n n = len(matrix)\n M = np.array([[int(matrix[i][j]) for i in range(n)] for j in range(m)]).T\n dic = {}\n dp = np.zeros((n, m))\n maxi = 0\n for i in range(n):\n for j in range(m):\n if M[i, j] == 0:\n dp[i, j] = 0\n\n elif i == 0 and j == 0:\n dp[i, j] = M[i, j]\n\n elif i == 0 and j > 0:\n dp[i, j] = np.max(M[0, :j+1])\n\n elif j == 0 and i > 0:\n dp[i, j] = np.max(M[:i+1, 0])\n \n else:\n if (i, j) in dic:\n dp[i, j] = dic[(i, j)]\n else:\n dp[i, j] = 1 + min(dp[i-1, j], dp[i, j-1], dp[i-1, j-1])\n dic[(i, j)] = dp[i, j]\n \n return int(np.max(dp))**2","memory":"45975"},{"code":"from numbers import Complex\nfrom functools import cache\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n grid = {\n complex(i, j)\n for i, row in enumerate(matrix)\n for j, value in enumerate(row)\n if value == \"1\"\n }\n\n @cache\n def max_side_length(top_left: Complex) -> bool:\n if top_left not in grid:\n return 0\n\n return 1 + min(\n max_side_length(top_left + delta)\n for delta in (1, 1 + 1j, 1j)\n )\n\n return max(\n (max_side_length(top_left)**2 for top_left in grid),\n default=0,\n )","memory":"46525"},{"code":"from copy import deepcopy\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n def max_square(start_coords, max_size) -> int:\n\n neighbours = set()\n\n for x, y in start_coords:\n\n next_row = x + max_size\n next_col = y + max_size\n\n coords = set()\n for i in range(x, next_row+1):\n coords.add((i, next_col))\n\n for i in range(y, next_col+1):\n coords.add((next_row, i))\n\n for r, c in coords:\n if r >= 0 and r < ROWS and c >= 0 and c < COLS and (r,c) not in zeros:\n neighbours.add((r,c))\n else:\n return max_size\n \n return max_square(start_coords, max_size + 1)\n \n ROWS = len(matrix)\n COLS = len(matrix[0])\n\n ones = dict()\n zeros = set()\n\n for i in range(ROWS):\n for j in range(COLS):\n\n matrix[i][j] = int(matrix[i][j])\n\n if matrix[i][j] == 0:\n zeros.add((i,j))\n\n if matrix[i][j] == 1:\n ones[(i,j)] = 1\n\n\n for start in list(ones.keys()):\n size = ones[start]\n start_x, start_y = start\n\n if start_x + size -1 >= ROWS or start_y + size -1 >= COLS:\n continue\n\n max_length = max_square({start}, size)\n # Cache\n if max_length > size:\n for i in range(start[0], start[0]+max_length-size+1):\n for j in range(start[1], start[1]+max_length-size+1):\n ones[(i,j)] = max_length - max(i-start[0], j-start[1])\n # print(start, i, j, size, max_length)\n\n \n if not ones:\n return 0\n\n return max(ones.values())**2\n \n\n ","memory":"47625"},{"code":"from collections import defaultdict as DD\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n h=len(matrix)\n w=len(matrix[0])\n dp,vert,horz = DD(int),DD(int),DD(int)\n ans = 0\n for i in range(h-1,-1,-1):\n for j in range(w-1,-1,-1):\n if matrix[i][j] == \"1\":\n right = horz[i,j+1]\n down = vert[i+1,j]\n horz[i,j] = 1 + right\n vert[i,j] = 1 + down\n sub = dp[i+1,j+1]\n dp[i,j] = 1 + min(right, down, sub)\n ans = max(ans, dp[i,j])\n return ans**2\n\n\n\n","memory":"48175"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n self.matrix = matrix\n self.square_cache = {}\n self.hor_cache = {}\n self.ver_cache = {}\n\n output = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n curr = self.maximalSquareEndingAt(i, j)\n if curr > output:\n output = curr\n return output**2\n\n def maximalSquareEndingAt(self, i, j):\n cache = self.square_cache\n matrix = self.matrix\n # print(cache)\n if (i, j) in cache:\n return cache[(i, j)]\n\n if i < 0 or j < 0:\n return 0\n val = matrix[i][j]\n if val == \"0\":\n return 0\n \n maximalSquareNeighbor = self.maximalSquareEndingAt(i-1, j-1)\n longestHorizontalLeft = self.longestHorizontalEndingAt(i, j-1)\n longestVerticalAbove = self.longestVerticalEndingAt(i-1, j)\n output = 1 + min(\n maximalSquareNeighbor,\n longestHorizontalLeft,\n longestVerticalAbove,\n )\n cache[(i, j)] = output\n return output \n\n def longestHorizontalEndingAt(self, i, j):\n cache = self.hor_cache\n matrix = self.matrix\n if (i, j) in cache:\n return cache[(i, j)]\n if j < 0:\n return 0\n val = matrix[i][j]\n if val == \"0\":\n return 0\n \n output = 1 + self.longestHorizontalEndingAt(i, j-1)\n cache[(i, j)] = output\n return output\n\n def longestVerticalEndingAt(self, i, j):\n cache = self.ver_cache\n matrix = self.matrix\n if (i, j) in cache:\n return cache[(i, j)]\n if i < 0:\n return 0\n val = matrix[i][j]\n if val == \"0\":\n return 0\n \n output = 1 + self.longestVerticalEndingAt(i-1, j)\n cache[(i, j)] = output\n return output\n","memory":"48725"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows = len(matrix)\n cols = len(matrix[0])\n\n to_rights = {}\n to_downs = {}\n cache = {}\n\n sz_max = 0\n for y in reversed(range(rows)):\n for x in reversed(range(cols)):\n is_one = matrix[y][x] == \"1\"\n if is_one:\n max_width = to_rights.get((x + 1, y), 0) + 1\n max_height = to_downs.get((x, y + 1), 0) + 1\n else:\n max_width, max_height = 0, 0\n to_rights[(x, y)] = max_width\n to_downs[(x, y)] = max_height\n\n max_sz = min(max_width, max_height)\n max_sub = cache.get((x + 1, y + 1), 0)\n sz = max(is_one, min(max_sz, max_sub + 1))\n cache[(x, y)] = sz\n sz_max = max(sz_max, sz)\n return sz_max ** 2","memory":"49275"},{"code":"'''\n\nBrute force solution:\n- Scan each position\n- Keep expanding the squares outwards...\n\nO(n^4) assuming a square input matrix.\n\nDP:\n- largest[i,j] =\n if mat[i][j] = 0\n 0\n else:\n res = 1\n expansion_width = min(largest[i+1, j+1], right[i+1, j], down[i, j+1])\n if expansion_width > 0:\n res = (expansion_width + 1) ** 2\n\n'''\n\ndef right(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\n if not 0 <= i < len(mat):\n return 0\n if not 0 <= j < len(mat[0]):\n return 0\n \n if mat[i][j] == '0':\n return 0\n\n key = ('right', i, j)\n if key in cache:\n return cache[key]\n \n res = 1 + right(mat, i, j+1, cache)\n\n cache[key] = res\n return res\n\ndef down(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\n if not 0 <= i < len(mat):\n return 0\n if not 0 <= j < len(mat[0]):\n return 0\n \n if mat[i][j] == '0':\n return 0\n \n key = ('down', i, j)\n if key in cache:\n return cache[key]\n \n res = 1 + down(mat, i+1, j, cache)\n\n cache[key] = res\n return res\n\ndef largest(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\n if not 0 <= i < len(mat):\n return 0\n if not 0 <= j < len(mat[0]):\n return 0\n\n if mat[i][j] == '0':\n return 0\n \n key = ('largest', i, j)\n if key in cache:\n return cache[key]\n\n res = 1\n res += min(\n largest(mat, i+1, j+1, cache),\n min(\n right(mat, i, j+1, cache),\n down(mat, i+1, j, cache)\n )\n )\n\n cache[key] = res\n return res\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n best = 0\n cache = {}\n for i in range(len(matrix)):\n for j in range(len(matrix[i])):\n best = max(best, largest(matrix, i, j, cache) ** 2)\n return best\n\n'''\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"0\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"0\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"0\",\"0\",\"0\"]\n[\"0\",\"1\",\"1\",\"1\",\"1\",\"0\",\"0\",\"0\"]\n'''","memory":"49825"},{"code":"'''\n\nBrute force solution:\n- Scan each position\n- Keep expanding the squares outwards...\n\nO(n^4) assuming a square input matrix.\n\nDP:\n- largest[i,j] =\n if mat[i][j] = 0\n 0\n else:\n res = 1\n expansion_width = min(largest[i+1, j+1], right[i+1, j], down[i, j+1])\n if expansion_width > 0:\n res = (expansion_width + 1) ** 2\n\n'''\n\ndef right(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\n if not 0 <= i < len(mat):\n return 0\n if not 0 <= j < len(mat[0]):\n return 0\n \n if mat[i][j] == '0':\n return 0\n\n key = (1, i, j)\n if key in cache:\n return cache[key]\n \n res = 1 + right(mat, i, j+1, cache)\n\n cache[key] = res\n return res\n\ndef down(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\n if not 0 <= i < len(mat):\n return 0\n if not 0 <= j < len(mat[0]):\n return 0\n \n if mat[i][j] == '0':\n return 0\n \n key = (2, i, j)\n if key in cache:\n return cache[key]\n \n res = 1 + down(mat, i+1, j, cache)\n\n cache[key] = res\n return res\n\ndef largest(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\n if not 0 <= i < len(mat):\n return 0\n if not 0 <= j < len(mat[0]):\n return 0\n\n if mat[i][j] == '0':\n return 0\n \n key = (0, i, j)\n if key in cache:\n return cache[key]\n\n res = 1\n res += min(\n largest(mat, i+1, j+1, cache),\n min(\n right(mat, i, j+1, cache),\n down(mat, i+1, j, cache)\n )\n )\n\n cache[key] = res\n return res\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n best = 0\n cache = {}\n for i in range(len(matrix)):\n for j in range(len(matrix[i])):\n best = max(best, largest(matrix, i, j, cache) ** 2)\n return best\n\n'''\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"0\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"1\",\"0\"]\n[\"1\",\"1\",\"1\",\"1\",\"1\",\"0\",\"0\",\"0\"]\n[\"0\",\"1\",\"1\",\"1\",\"1\",\"0\",\"0\",\"0\"]\n'''","memory":"49825"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n # maximal_len = m if m < n else n\n target_len = 1\n bad_starting_squares = set()\n def find_square(coord: tuple):\n searched_squares = set()\n if coord[0] + target_len > m:\n return None\n if coord[1] + target_len > n:\n return None\n for i in range(coord[0], coord[0] + target_len):\n for j in range(coord[1], coord[1] + target_len):\n if matrix[i][j] == \"0\":\n bad_starting_squares.add((i, j))\n bad_starting_squares.add(coord)\n return False\n return True\n def solution():\n nonlocal target_len\n nonlocal bad_starting_squares\n found = False\n for i in range(m):\n for j in range(n):\n if (i, j) in bad_starting_squares:\n continue\n found = find_square((i, j))\n if found:\n target_len += 1\n return solution()\n if found is None:\n bad_starting_squares.add((i, j))\n if not found:\n return (target_len - 1)**2\n \n return solution()\n","memory":"50375"},{"code":"class Solution:\n\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n self.matrix = matrix\n self.square_cache = {}\n self.hor_cache = {}\n self.ver_cache = {}\n\n output = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n curr = self.maximalSquareEndingAt(i, j)\n if curr > output:\n output = curr\n return output**2\n\n @lru_cache\n def maximalSquareEndingAt(self, i, j):\n cache = self.square_cache\n matrix = self.matrix\n # print(cache)\n if (i, j) in cache:\n return cache[(i, j)]\n\n if i < 0 or j < 0:\n return 0\n val = matrix[i][j]\n if val == \"0\":\n return 0\n \n maximalSquareNeighbor = self.maximalSquareEndingAt(i-1, j-1)\n longestHorizontalLeft = self.longestHorizontalEndingAt(i, j-1)\n longestVerticalAbove = self.longestVerticalEndingAt(i-1, j)\n output = 1 + min(\n maximalSquareNeighbor,\n longestHorizontalLeft,\n longestVerticalAbove,\n )\n cache[(i, j)] = output\n return output \n\n @lru_cache\n def longestHorizontalEndingAt(self, i, j):\n cache = self.hor_cache\n matrix = self.matrix\n if (i, j) in cache:\n return cache[(i, j)]\n if j < 0:\n return 0\n val = matrix[i][j]\n if val == \"0\":\n return 0\n \n output = 1 + self.longestHorizontalEndingAt(i, j-1)\n cache[(i, j)] = output\n return output\n\n @lru_cache\n def longestVerticalEndingAt(self, i, j):\n cache = self.ver_cache\n matrix = self.matrix\n if (i, j) in cache:\n return cache[(i, j)]\n if i < 0:\n return 0\n val = matrix[i][j]\n if val == \"0\":\n return 0\n \n output = 1 + self.longestVerticalEndingAt(i-1, j)\n cache[(i, j)] = output\n return output\n","memory":"50925"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n \n memo = {'max':0}\n def dp(row, col):\n # base\n if row < 0 or col < 0 or matrix[row][col] == '0':\n return 0\n if (row, col) not in memo:\n ans = 1 + min(dp(row - 1, col - 1), dp(row - 1, col), dp(row, col -1))\n memo[(row, col)] = ans\n memo['max'] = max(memo['max'], ans)\n return memo[(row, col)] \n\n for row in range(m):\n for col in range(n):\n dp(row, col)\n \n # print(*matrix, sep='\\n')\n # print(memo)\n return memo['max'] ** 2\n \n ","memory":"51475"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n def inbound(i, j):\n return 0 <= i < len(matrix) and 0<= j < len(matrix[0])\n \n memo = {}\n def dp(i, j):\n if not inbound(i, j) or matrix[i][j] == '0':\n return 0\n if (i, j) in memo:\n return memo[(i, j)]\n \n memo[(i, j)] = min(dp(i, j-1), dp(i-1, j), dp(i-1, j-1)) + 1\n return memo[(i, j)]\n \n out = 0\n for x in range(len(matrix)):\n for y in range(len(matrix[0])):\n out = max(out, dp(x, y))\n \n return out ** 2","memory":"52025"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n \n m, n = len(matrix), len(matrix[0])\n memo = {}\n max_side = 0\n\n def topdown(i, j):\n if i == m or j == n or matrix[i][j] == '0':\n return 0\n if (i, j) in memo:\n return memo[(i, j)]\n \n nonlocal max_side\n\n memo[(i, j)] = 1 + min(topdown(i + 1, j), topdown(i, j + 1), topdown(i + 1, j + 1))\n max_side = max(max_side, memo[(i, j)])\n \n return memo[(i, j)]\n \n for i in range(m):\n for j in range(n):\n topdown(i, j)\n\n return max_side ** 2","memory":"52575"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0]) \n maxi = 0\n dp = {}\n def recurr(i, j):\n nonlocal maxi\n if i >= m or j >= n:\n return 0\n if (i, j) not in dp.keys():\n right = recurr(i, j + 1)\n bottom_right = recurr(i + 1, j + 1)\n bottom = recurr(i + 1, j)\n if matrix[i][j] == '0':\n return 0\n mini = min(right, bottom_right, bottom) + 1 \n dp[(i, j)] = mini\n maxi = max(maxi, mini)\n return dp[(i, j)]\n recurr(0,0)\n return maxi ** 2","memory":"52575"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n r, c = len(matrix), len(matrix[0])\n\n memo = {}\n def dp(i, j):\n if (i, j) in memo:\n return memo[(i, j)]\n\n if i not in range(r) or j not in range(c):\n return 0\n \n if matrix[i][j] == \"0\":\n return 0\n \n res = (1 + min(\n dp(i + 1, j), \n dp(i, j + 1), \n dp(i + 1, j + 1)\n ))\n memo[(i, j)] = res\n return res\n \n res = 0\n for i in range(r):\n for j in range(c):\n ans = dp(i, j)\n res = max(res, ans ** 2)\n\n return res\n\n\n \n\n \n\n ","memory":"53125"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n # from a position goes only to down or right contain all possibilities\n dp = {}\n m, n = len(matrix), len(matrix[0])\n\n def dfs(i, j):\n if i >= m or j >= n or matrix[i][j] == '0':\n return 0\n if (i, j) in dp:\n return dp[(i, j)]\n \n dp[(i, j)] = 1 + min(dfs(i+1, j), dfs(i, j+1), dfs(i+1, j+1))\n\n return dp[(i, j)]\n ans = 0\n for i in range(m):\n for j in range(n):\n ans = max(ans, dfs(i, j)**2)\n \n return ans\n","memory":"53125"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n memo={}\n def ms(matrix,n=0,m=0,m1=False):\n if m1==False:\n m1=True\n n=len(matrix)-1\n m=len(matrix[0])-1\n if (n,m) in memo : return memo[(n,m)]\n if n==0 and m==0:\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n elif n==0:\n ms(matrix,n,m-1,m1)\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n elif m==0:\n ms(matrix,n-1,m,m1)\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n else: \n value = int(matrix[n][m])\n match value:\n case 0: \n ms(matrix,n,m-1,m1)\n ms(matrix,n-1,m,m1)\n ms(matrix,n-1,m-1,m1)\n memo[(n,m)] = 0\n case _:\n memo[(n,m)]=min(ms(matrix,n,m-1,m1),ms(matrix,n-1,m,m1),ms(matrix,n-1,m-1,m1))+int(matrix[n][m])\n return memo[(n,m)]\n \n ms(matrix)\n print(memo)\n max1=0\n for i in memo:\n if memo[i]>max1: max1=memo[i]\n return max1**2\n ","memory":"53675"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n memo={}\n def ms(matrix,n=0,m=0,m1=False):\n if m1==False:\n m1=True\n n=len(matrix)-1\n m=len(matrix[0])-1\n if (n,m) in memo : return memo[(n,m)]\n if n==0 and m==0:\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n elif n==0:\n ms(matrix,n,m-1,m1)\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n elif m==0:\n ms(matrix,n-1,m,m1)\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n else: \n value = int(matrix[n][m])\n match value:\n case 0: \n ms(matrix,n,m-1,m1)\n ms(matrix,n-1,m,m1)\n ms(matrix,n-1,m-1,m1)\n memo[(n,m)] = 0\n case _:\n memo[(n,m)]=min(ms(matrix,n,m-1,m1),ms(matrix,n-1,m,m1),ms(matrix,n-1,m-1,m1))+int(matrix[n][m])\n return memo[(n,m)]\n \n ms(matrix)\n print(memo)\n max1=0\n for i in memo:\n if memo[i]>max1: max1=memo[i]\n return max1**2\n ","memory":"54225"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n memo={}\n def ms(matrix,n=0,m=0,m1=False):\n if m1==False:\n m1=True\n n=len(matrix)-1\n m=len(matrix[0])-1\n if (n,m) in memo : return memo[(n,m)]\n if n==0 and m==0:\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n elif n==0:\n ms(matrix,n,m-1,m1)\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n elif m==0:\n ms(matrix,n-1,m,m1)\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n else: \n value = int(matrix[n][m])\n match value:\n case 0: \n ms(matrix,n,m-1,m1)\n ms(matrix,n-1,m,m1)\n ms(matrix,n-1,m-1,m1)\n memo[(n,m)] = 0\n case _:\n memo[(n,m)]=min(ms(matrix,n,m-1,m1),ms(matrix,n-1,m,m1),ms(matrix,n-1,m-1,m1))+int(matrix[n][m])\n return memo[(n,m)]\n \n ms(matrix)\n max1=0\n for i in memo:\n if memo[i]>max1: max1=memo[i]\n return max1**2\n ","memory":"54225"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n memo={}\n n=len(matrix)-1\n m=len(matrix[0])-1\n def ms(matrix,n,m):\n if (n,m) in memo : return memo[(n,m)]\n if n==0 and m==0:\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n elif n==0:\n ms(matrix,n,m-1)\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n elif m==0:\n ms(matrix,n-1,m)\n memo[(n,m)]=int(matrix[n][m])\n return memo[(n,m)]\n else: \n match int(matrix[n][m]):\n case 0: \n ms(matrix,n,m-1)\n ms(matrix,n-1,m)\n ms(matrix,n-1,m-1)\n memo[(n,m)] = 0\n case _:\n memo[(n,m)]=min(ms(matrix,n,m-1),ms(matrix,n-1,m),ms(matrix,n-1,m-1))+int(matrix[n][m])\n return memo[(n,m)]\n \n ms(matrix, n, m)\n max1=0\n for i in memo:\n if memo[i]>max1: max1=memo[i]\n return max1**2\n ","memory":"54775"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n cache, maxRow, maxCol = {}, len(matrix), len(matrix[0])\n def helper(row, col):\n if row == maxRow or col == maxCol:\n return 0\n if (row, col) not in cache:\n down = helper(row + 1, col)\n right = helper(row, col + 1)\n diag = helper(row + 1, col + 1)\n cache[(row, col)] = 0\n if matrix[row][col] == '1':\n cache[(row, col)] = 1 + min(down, right, diag)\n return cache[(row, col)]\n helper(0, 0)\n return max(cache.values()) ** 2","memory":"55325"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n nrow, ncol = len(matrix), len(matrix[0])\n \n # dp[(i, j)]: largest square's side where the top left vertex is (i, j)\n dp = {}\n\n def dfs(row, col):\n # cannot form a square\n if row == nrow or col == ncol or matrix[row][col] == '0':\n return 0\n \n # if subproblem has been computed\n if (row, col) in dp:\n return dp[(row, col)]\n\n # side of largest square\n side_diag = dfs(row + 1, col + 1) # diag sq\n side_h = dfs(row, col + 1) # horizontal sq (right)\n side_v = dfs(row + 1, col) # vertical sq (down)\n\n # already 1 square (1) + min side of these square can form a square\n dp[(row, col)] = 1 + min(side_diag, side_h, side_v)\n\n return dp[(row, col)]\n \n max_side = 0\n for row in range(nrow):\n for col in range(ncol):\n # no need to filter \"1\" as it will be terminated by line 10\n max_side = max(max_side, dfs(row, col))\n\n return max_side ** 2","memory":"55875"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n n = len(matrix)\n m = len(matrix[0])\n memo = {}\n def dfs(i, j):\n if (i, j) in memo:\n return memo[(i, j)]\n\n if i >= n or j >= m:\n return 0\n \n if matrix[i][j] == \"0\":\n return 0\n \n memo[(i, j)] = 1 + min(dfs(i + 1, j + 1), dfs(i + 1, j), dfs(i, j + 1))\n return 1 + min(dfs(i + 1, j + 1), dfs(i + 1, j), dfs(i, j + 1))\n res = 0\n for i in range(n):\n for j in range(m):\n maxEdge = dfs(i, j)\n res = max(res, maxEdge * maxEdge)\n return res","memory":"56425"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c] == \"0\":\n return 0\n right = dfs(r+1,c)\n down = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n res = 1 + min(right,dia,down)\n dp[(r,c)] = res\n return res\n \n res = 0\n for r in range(R):\n for c in range(C):\n if matrix[r][c] == \"1\":\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C = len(matrix),len(matrix[0])\n dp= {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c] == \"0\":return 0\n right = dfs(r,c+1)\n down = dfs(r+1,c)\n dia = dfs(r+1,c+1)\n res = 1 + min(right,down,dia)\n dp[(r,c)] = res\n return res\n res = 0\n for r in range(R):\n for c in range(C):\n if matrix[r][c] == \"1\":\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C =len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]==\"0\":return 0\n if (r,c) in dp:return dp[(r,c)]\n right = dfs(r,c+1)\n down = dfs(r+1,c)\n dia = dfs(r+1,c+1)\n res = 1+min(right,down,dia)\n dp[(r,c)] = res\n return res\n res = 0\n for r in range(R):\n for c in range(C):\n if matrix[r][c]==\"1\":\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C =len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]==\"0\":return 0\n if (r,c) in dp:return dp[(r,c)]\n right = dfs(r,c+1)\n down = dfs(r+1,c)\n dia = dfs(r+1,c+1)\n res = 1+min(right,down,dia)\n dp[(r,c)] = res\n return res\n res = 0\n for r in range(R):\n for c in range(C):\n if matrix[r][c]==\"1\":\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C= len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]==\"0\":return 0\n right = dfs(r+1,c)\n bot = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n res = 1 + min(right,bot,dia)\n dp[(r,c)] = res\n return res \n \n res = 0\n for r in range(R):\n for c in range(C):\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]!=\"1\":return 0\n right = dfs(r,c+1)\n down = dfs(r+1,c)\n dia = dfs(r+1,c+1)\n res = 0\n if matrix[r][c]==\"1\":\n res = 1+min(right,down,dia)\n dp[(r,c)] = res\n return res\n res = 0\n for r in range(R):\n for c in range(C):\n res = max(res,dfs(r,c))\n return res**2\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 R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or c>=C or r>=R or matrix[r][c]==\"0\":return 0\n down = dfs(r+1,c)\n right = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n if matrix[r][c]==\"1\":\n res = 1+min(down,right,dia)\n dp[(r,c)] = res\n return res\n ans = 0\n for r in range(R):\n for c in range(C):\n ans = max(ans,dfs(r,c))\n return ans**2\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or r>=R or c>=C:\n return 0\n right = dfs(r,c+1)\n bottom = dfs(r+1,c)\n dia = dfs(r+1,c+1)\n res = 0\n if matrix[r][c] == \"1\":\n res += 1 + min(right,bottom,dia)\n dp[(r,c)] = res\n return dp[(r,c)]\n res = 0\n for r in range(R):\n for c in range(C):\n if matrix[r][c] == \"1\":\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or r>=R or c>=C:return 0\n res = 0\n if matrix[r][c] == \"1\":\n res = 1 + min(dfs(r+1,c),dfs(r+1,c+1),dfs(r,c+1))\n dp[(r,c)] = res\n return dp[(r,c)]\n res= 0\n for r in range(R):\n for c in range(C):\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if r<0 or c<0 or r>=R or c>=C:return 0\n if (r,c) in dp:return dp[(r,c)]\n right = dfs(r+1,c)\n bot = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n res = 0\n if matrix[r][c] == \"1\":\n res = 1 + min(right,bot,dia)\n dp[(r,c)] = res\n return dp[(r,c)]\n\n\n\n\n\n res = 0\n for r in range(R):\n for c in range(C):\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if r>=R or c>=C or c<0 or r<0:return 0\n if (r,c) in dp:return dp[(r,c)]\n right = dfs(r+1,c)\n dia = dfs(r+1,c+1)\n bot = dfs(r,c+1)\n res = 0\n if matrix[r][c] == '1':\n res+=1+min(right,bot,dia)\n dp[(r,c)] = res\n return dp[(r,c)]\n res = 0\n for r in range(R):\n for c in range(C):\n res = max(res,dfs(r,c))\n return res**2\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 R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if r<0 or c<0 or r>=R or c>=C:return 0\n if (r,c) in dp:return dp[(r,c)]\n right = dfs(r+1,c)\n down = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n\n dp[(r,c)] = 0\n if matrix[r][c] == \"1\":\n dp[(r,c)] += 1 + min(right,down,dia)\n \n return dp[(r,c)]\n \n for r in range(R):\n for c in range(C):\n dfs(r,c)\n return max(dp.values())**2\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\n R,C = len(matrix),len(matrix[0])\n memo = {}\n def dfs(r,c):\n if r<0 or c<0 or c>=C or r>=R :return 0\n if (r,c) in memo : return memo[(r,c)]\n right = dfs(r+1,c)\n down = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n memo[(r,c)] = 0\n if matrix[r][c] == \"1\":\n memo[(r,c)] = 1+min(right,down,dia)\n return memo[(r,c)]\n for r in range(R):\n for c in range(C):\n dfs(r,c)\n return max(memo.values())**2\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 R,C = len(matrix),len(matrix[0])\n memo = {}\n def dfs(r,c):\n if r<0 or c<0 or r>=R or c>=C:\n return 0\n if (r,c) in memo:return memo[(r,c)]\n right = dfs(r+1,c)\n down = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n memo[(r,c)] = 0\n if matrix[r][c] == \"1\":\n memo[(r,c)] = 1 + min(right,dia,down)\n return memo[(r,c)]\n for r in range(R):\n for c in range(C):\n dfs(r,c)\n return (max(memo.values()))**2\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\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\n\n\n\n\n\n\n\n row , col = len(matrix),len(matrix[0])\n cache = {}\n def dfs(r,c):\n if r>=len(matrix) or c>=len(matrix[0]):\n return 0\n if (r,c) in cache:\n return cache[(r,c)]\n down = dfs(r,c+1)\n right = dfs(r+1,c)\n dia = dfs(r+1,c+1)\n cache[(r,c)] = 0\n if matrix[r][c] == \"1\":\n cache[(r,c)] = 1 + min(down,right,dia)\n return cache[(r,c)]\n dfs(0,0)\n return max(cache.values())**2\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 row,col = len(matrix),len(matrix[0])\n cache = {}\n def dfs(r,c):\n if r>=row or c>=col:\n return 0\n if (r,c) not in cache:\n down = dfs(r+1,c)\n right = dfs(r,c+1)\n diag = dfs(r+1,c+1)\n \n cache[(r,c)] = 0\n if matrix[r][c] == \"1\":\n cache[(r,c)] += 1 + min(down,right,diag)\n return cache[(r,c)]\n dfs(0,0)\n return max(cache.values())**2\n \n ","memory":"56975"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n cache = {}\n\n def rec(r,c):\n if r>= len(matrix) or c>=len(matrix[0]):\n return 0\n \n if (r,c) not in cache:\n x=rec(r+1,c)\n y=rec(r,c+1)\n z = rec(r+1,c+1)\n\n cache[(r,c)]=0\n if matrix[r][c] == \"1\":\n cache[(r,c)]= 1+min(x,y,z)\n\n return cache[(r,c)]\n \n rec(0,0)\n return max(cache.values())**2","memory":"57525"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n R,C= len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c] == \"0\":\n return 0\n right = dfs(r+1,c)\n down = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n res = 1 + min(right,dia,down)\n dp[(r,c)] = res\n return res\n res = 0\n for r in range(R):\n for c in range(C):\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c] == \"0\":\n return 0\n right = dfs(r+1,c)\n down = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n res = 1 + min(right,dia,down)\n dp[(r,c)] = res\n return res\n \n res = 0\n for r in range(R):\n for c in range(C):\n if matrix[r][c] == \"1\":\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C = len(matrix),len(matrix[0])\n dp= {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c] == \"0\":return 0\n right = dfs(r,c+1)\n down = dfs(r+1,c)\n dia = dfs(r+1,c+1)\n res = 1 + min(right,down,dia)\n dp[(r,c)] = res\n return res\n res = 0\n for r in range(R):\n for c in range(C):\n if matrix[r][c] == \"1\":\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C =len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]==\"0\":return 0\n if (r,c) in dp:return dp[(r,c)]\n right = dfs(r,c+1)\n down = dfs(r+1,c)\n dia = dfs(r+1,c+1)\n res = 1+min(right,down,dia)\n dp[(r,c)] = res\n return res\n res = 0\n for r in range(R):\n for c in range(C):\n if matrix[r][c]==\"1\":\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C =len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]==\"0\":return 0\n if (r,c) in dp:return dp[(r,c)]\n right = dfs(r,c+1)\n down = dfs(r+1,c)\n dia = dfs(r+1,c+1)\n res = 1+min(right,down,dia)\n dp[(r,c)] = res\n return res\n res = 0\n for r in range(R):\n for c in range(C):\n if matrix[r][c]==\"1\":\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C= len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]==\"0\":return 0\n right = dfs(r+1,c)\n bot = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n res = 1 + min(right,bot,dia)\n dp[(r,c)] = res\n return res \n \n res = 0\n for r in range(R):\n for c in range(C):\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]!=\"1\":return 0\n right = dfs(r,c+1)\n down = dfs(r+1,c)\n dia = dfs(r+1,c+1)\n res = 0\n if matrix[r][c]==\"1\":\n res = 1+min(right,down,dia)\n dp[(r,c)] = res\n return res\n res = 0\n for r in range(R):\n for c in range(C):\n res = max(res,dfs(r,c))\n return res**2\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 R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or c>=C or r>=R or matrix[r][c]==\"0\":return 0\n down = dfs(r+1,c)\n right = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n if matrix[r][c]==\"1\":\n res = 1+min(down,right,dia)\n dp[(r,c)] = res\n return res\n ans = 0\n for r in range(R):\n for c in range(C):\n ans = max(ans,dfs(r,c))\n return ans**2\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or r>=R or c>=C:\n return 0\n right = dfs(r,c+1)\n bottom = dfs(r+1,c)\n dia = dfs(r+1,c+1)\n res = 0\n if matrix[r][c] == \"1\":\n res += 1 + min(right,bottom,dia)\n dp[(r,c)] = res\n return dp[(r,c)]\n res = 0\n for r in range(R):\n for c in range(C):\n if matrix[r][c] == \"1\":\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if (r,c) in dp:return dp[(r,c)]\n if r<0 or c<0 or r>=R or c>=C:return 0\n res = 0\n if matrix[r][c] == \"1\":\n res = 1 + min(dfs(r+1,c),dfs(r+1,c+1),dfs(r,c+1))\n dp[(r,c)] = res\n return dp[(r,c)]\n res= 0\n for r in range(R):\n for c in range(C):\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if r<0 or c<0 or r>=R or c>=C:return 0\n if (r,c) in dp:return dp[(r,c)]\n right = dfs(r+1,c)\n bot = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n res = 0\n if matrix[r][c] == \"1\":\n res = 1 + min(right,bot,dia)\n dp[(r,c)] = res\n return dp[(r,c)]\n\n\n\n\n\n res = 0\n for r in range(R):\n for c in range(C):\n res = max(res,dfs(r,c))\n return res**2\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if r>=R or c>=C or c<0 or r<0:return 0\n if (r,c) in dp:return dp[(r,c)]\n right = dfs(r+1,c)\n dia = dfs(r+1,c+1)\n bot = dfs(r,c+1)\n res = 0\n if matrix[r][c] == '1':\n res+=1+min(right,bot,dia)\n dp[(r,c)] = res\n return dp[(r,c)]\n res = 0\n for r in range(R):\n for c in range(C):\n res = max(res,dfs(r,c))\n return res**2\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 R,C = len(matrix),len(matrix[0])\n dp = {}\n def dfs(r,c):\n if r<0 or c<0 or r>=R or c>=C:return 0\n if (r,c) in dp:return dp[(r,c)]\n right = dfs(r+1,c)\n down = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n\n dp[(r,c)] = 0\n if matrix[r][c] == \"1\":\n dp[(r,c)] += 1 + min(right,down,dia)\n \n return dp[(r,c)]\n \n for r in range(R):\n for c in range(C):\n dfs(r,c)\n return max(dp.values())**2\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\n R,C = len(matrix),len(matrix[0])\n memo = {}\n def dfs(r,c):\n if r<0 or c<0 or c>=C or r>=R :return 0\n if (r,c) in memo : return memo[(r,c)]\n right = dfs(r+1,c)\n down = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n memo[(r,c)] = 0\n if matrix[r][c] == \"1\":\n memo[(r,c)] = 1+min(right,down,dia)\n return memo[(r,c)]\n for r in range(R):\n for c in range(C):\n dfs(r,c)\n return max(memo.values())**2\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 R,C = len(matrix),len(matrix[0])\n memo = {}\n def dfs(r,c):\n if r<0 or c<0 or r>=R or c>=C:\n return 0\n if (r,c) in memo:return memo[(r,c)]\n right = dfs(r+1,c)\n down = dfs(r,c+1)\n dia = dfs(r+1,c+1)\n memo[(r,c)] = 0\n if matrix[r][c] == \"1\":\n memo[(r,c)] = 1 + min(right,dia,down)\n return memo[(r,c)]\n for r in range(R):\n for c in range(C):\n dfs(r,c)\n return (max(memo.values()))**2\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\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\n\n\n\n\n\n\n\n row , col = len(matrix),len(matrix[0])\n cache = {}\n def dfs(r,c):\n if r>=len(matrix) or c>=len(matrix[0]):\n return 0\n if (r,c) in cache:\n return cache[(r,c)]\n down = dfs(r,c+1)\n right = dfs(r+1,c)\n dia = dfs(r+1,c+1)\n cache[(r,c)] = 0\n if matrix[r][c] == \"1\":\n cache[(r,c)] = 1 + min(down,right,dia)\n return cache[(r,c)]\n dfs(0,0)\n return max(cache.values())**2\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 row,col = len(matrix),len(matrix[0])\n cache = {}\n def dfs(r,c):\n if r>=row or c>=col:\n return 0\n if (r,c) not in cache:\n down = dfs(r+1,c)\n right = dfs(r,c+1)\n diag = dfs(r+1,c+1)\n \n cache[(r,c)] = 0\n if matrix[r][c] == \"1\":\n cache[(r,c)] += 1 + min(down,right,diag)\n return cache[(r,c)]\n dfs(0,0)\n return max(cache.values())**2\n \n ","memory":"57525"},{"code":"from functools import cache\n\nclass Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n\n m, n = len(matrix), len(matrix[0])\n answer = [0]\n\n @cache\n def dp(i, j):\n # size of the largest square anchored at cell i, j\n # print(i, j)\n \n # base case\n if i == 0 or j == 0:\n answer[0] = max(answer[0], int(matrix[i][j]))\n return int(matrix[i][j])\n \n # can we extend?\n diagonal = dp(i-1, j-1)\n up = dp(i-1, j)\n left = dp(i, j-1)\n # print(f'at {(i, j)}', diagonal, up, left)\n if matrix[i][j] == \"1\" and (diagonal == up == left):\n # print('can extend')\n # print(f'dp{(i, j)} = {1 + diagonal}')\n answer[0] = max(answer[0], 1 + diagonal)\n return 1 + diagonal\n else:\n \n if matrix[i][j] == \"1\":\n # print(f'dp{(i, j)} = {1 + min(diagonal, up, left)}')\n answer[0] = max(answer[0], 1 + min(diagonal, up, left))\n return 1 + min(diagonal, up, left)\n else:\n return 0\n\n for i in range(m):\n dp(i, 0)\n\n for j in range(n):\n dp(0, j)\n \n _ = dp(m-1, n-1)\n return answer[0] ** 2\n ","memory":"58075"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n cache = {}\n\n def helper(r, c):\n if r >= ROWS or c >= COLS:\n return 0\n \n if (r, c) not in cache:\n down = helper(r+1, c)\n right = helper(r, c+1)\n diag = helper(r+1, c+1)\n cache[(r, c)] = 0\n if matrix[r][c] == \"1\":\n cache[(r,c)] = 1 + min(down, right, diag)\n return cache[(r, c)]\n \n helper(0, 0)\n return max(cache.values())**2","memory":"58075"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n # If define subproblem DP(i, j) to be the maximum size of the square with bottom right corner to be at i, j\n # Consider following situation:\n # ? ? ?\n # ? ? ?\n # ? ? 1\n # DP(i, j) is dependent on DP(i, j-1), DP(i-1, j), DP(i-1, j-1)\n # if all three is 1, then DP(i, j) is 2. If all three is 2, then DP(i, j) is 3.\n # Basically DP(i, j) is the minimum of these three values, + 1.\n\n memory = {}\n \n def topdown(i, j):\n if (i, j) in memory:\n return memory[(i, j)]\n\n if matrix[i][j] == '0':\n memory[(i, j)] = 0\n return 0\n\n else:\n if i == 0 or j == 0:\n memory[(i, j)] = 1\n return 1\n dependence = min(topdown(i-1, j), topdown(i, j-1), topdown(i-1, j-1))\n memory[(i, j)] = dependence + 1\n return memory[(i, j)]\n \n ans = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n ans = max(ans, topdown(i, j) ** 2)\n return ans","memory":"58625"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n m, n = len(matrix), len(matrix[0])\n dp = {}\n\n def maximalRec(i, j):\n if i >= m or j >= n:\n return 0\n \n if (i, j) not in dp:\n\n down = maximalRec(i+1, j)\n right = maximalRec(i, j+1)\n diag = maximalRec(i+1, j+1)\n\n dp[(i, j)] = 0\n if matrix[i][j] == \"1\":\n dp[(i, j)] = 1 + min(down, right, diag)\n\n return dp[(i, j)]\n\n \n maximalRec(0, 0)\n return max(dp.values())**2\n\n \n ","memory":"58625"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows,cols=len(matrix),len(matrix[0])\n dp={}\n\n def help(r,c):\n if r<0 or r>=rows or c<0 or c>=cols :\n return 0\n if (r,c) not in dp:\n down=help(r+1,c)\n right=help(r,c+1)\n diag=help(r+1,c+1)\n\n dp[(r,c)]=0\n if matrix[r][c]==\"1\":\n dp[(r,c)]=1+min(down,right,diag)\n return dp[(r,c)]\n help(0,0)\n return max(dp.values()) **2\n\n ","memory":"59175"},{"code":"class Solution:\n def maximalSquare(self, matrix: List[List[str]]) -> int:\n rows,cols=len(matrix),len(matrix[0])\n dp={}\n\n def help(r,c):\n if r<0 or r>=rows or c<0 or c>=cols :\n return 0\n if (r,c) not in dp:\n down=help(r+1,c)\n right=help(r,c+1)\n diag=help(r+1,c+1)\n\n dp[(r,c)]=0\n if matrix[r][c]==\"1\":\n dp[(r,c)]=1+min(down,right,diag)\n return dp[(r,c)]\n help(0,0)\n return max(dp.values()) **2\n\n ","memory":"59175"}],"string":"[\n {\n \"code\": \"\\ndef maximalSquare(bits):\\n w = 0\\n while bits and any(bits):\\n w += 1\\n bits = [a & b for a, b in pairwise(b & (b << 1) for b in bits)]\\n return w * w\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n bits = [int(''.join(row), 2) for row in case]\\n f.write(f\\\"{maximalSquare(bits)}\\\\n\\\")\\n exit(0)\\n \\n \\n\\n\\n\\n\\n\\n\\n \",\n \"memory\": \"18475\"\n },\n {\n \"code\": \"\\ndef maximalSquare(matrix):\\n bits = [int(''.join(row), 2) for row in matrix]\\n w = 0\\n while bits and any(bits):\\n w += 1\\n bits = [a & b for a, b in itertools.pairwise(b & (b << 1) for b in bits)]\\n return w * w\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f\\\"{maximalSquare(case)}\\\\n\\\")\\n exit(0)\\n \\n \\n\\n\\n\\n\\n\\n\\n \",\n \"memory\": \"18475\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n row, col = len(matrix), len(matrix[0])\\n maxVal = 0\\n\\n for i in range(row):\\n for j in range(col):\\n matrix[i][j] = int(matrix[i][j])\\n\\n for i in range(row):\\n for j in range(col):\\n\\n if i == 0 or j == 0:\\n maxVal = max(maxVal, matrix[i][j])\\n #print(\\\"hereee\\\", maxVal)\\n continue\\n\\n if matrix[i][j]:\\n matrix[i][j] = 1 + min(matrix[i][j-1], matrix[i-1][j-1], matrix[i-1][j])\\n maxVal = max(maxVal, matrix[i][j])\\n \\n return maxVal**2\\n\\n\\n\\n\\n\\n \\n\\n\\n\\n\\n \",\n \"memory\": \"19025\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n result = 0\\n prev, curr = [0]*n, [0]*n\\n for i in range(m):\\n for j in range(n):\\n if matrix[i][j] == '1':\\n curr[j] = min(curr[j-1] if j > 0 else 0,\\n prev[j-1] if j > 0 else 0,\\n prev[j]) + 1\\n else:\\n curr[j] = 0 # reset curr[j]\\n if curr[j] > result:\\n result = curr[j]\\n prev, curr = curr, prev\\n return result*result\",\n \"memory\": \"19025\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n \\n if not matrix or not matrix[0]:\\n return 0\\n\\n n = len(matrix)\\n m = len(matrix[0])\\n\\n cache = [[0] *m for _ in range(n)]\\n\\n max_side = 0\\n\\n for i in range(n):\\n for j in range(m):\\n if matrix[i][j] == \\\"1\\\":\\n if i == 0 or j == 0:\\n cache[i][j] = 1\\n else:\\n cache[i][j] = min(cache[i-1][j], cache[i][j-1], cache[i-1][j-1]) +1\\n max_side = max(max_side, cache[i][j])\\n \\n return max_side**2\\n\",\n \"memory\": \"19575\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n if not matrix:\\n return 0\\n m , n = len(matrix), len(matrix[0])\\n dp = [[0] * n for x in range(m)]\\n \\n side_len=0\\n for i in range(m):\\n for j in range(n):\\n if matrix[i][j] == '1':\\n if i == 0 or j == 0:\\n dp[i][j] = 1\\n else:\\n dp[i][j]=1 + min(dp[i-1][j-1],dp[i][j-1],dp[i-1][j])\\n \\n side_len = max(side_len,dp[i][j])\\n \\n return side_len*side_len\\n \",\n \"memory\": \"19575\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n '''\\n DP[i, j] = maximimal side length of a square with upper left corner is position\\n (i, j). Optimal substructure is\\n '''\\n m = len(matrix); n = len(matrix[0])\\n DP = [[0 for _ in range(n)] for _ in range(m)]\\n max_val = 0\\n for i in range(m):\\n DP[i][-1] = matrix[i][-1] == \\\"1\\\"\\n max_val = max(max_val, DP[i][-1])\\n for j in range(n):\\n DP[-1][j] = matrix[-1][j] == \\\"1\\\"\\n max_val = max(max_val, DP[-1][j])\\n for i in range(m - 2, -1, -1):\\n for j in range(n - 2, -1, -1):\\n if matrix[i][j] == \\\"0\\\":\\n continue\\n DP[i][j] = min(DP[i + 1][j] + 1, DP[i][j + 1] + 1, DP[i + 1][j + 1] + 1)\\n max_val = max(max_val, DP[i][j])\\n print(DP)\\n return max_val**2\\n\\n\\n \\n\\n \",\n \"memory\": \"20125\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n for i in range(n):\\n matrix[0][i] = int(matrix[0][i])\\n for j in range(1,m):\\n matrix[j][i] = int(matrix[j][i ])\\n if matrix[j][i] == 1 :\\n matrix[j][i] = int(matrix[j][i]) + int(matrix[j-1][i])\\n \\n # print(matrix)\\n ans = 0\\n for i in range(m):\\n matrix[i].append(0)\\n stack = []\\n for j in range(n+1):\\n while stack and matrix[i][stack[-1]] > matrix[i][j]:\\n index = stack.pop()\\n w = j if not stack else j - stack[-1] - 1\\n l = min(w,matrix[i][index])\\n # print(i, j, index, w, l*l, stack)\\n ans = max(ans,l*l)\\n # if matrix[i][j] == 0 or not(stack and matrix[i][stack[-1]] == matrix[i][j]):\\n stack.append(j)\\n return ans\",\n \"memory\": \"20125\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n dp = copy.deepcopy(matrix)\\n dp = [[int(ele) for ele in row] for row in matrix]\\n res = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if i==0 or j==0:\\n pass\\n elif dp[i][j] == 1:\\n dp[i][j] = min([dp[i-1][j-1], dp[i-1][j], dp[i][j-1]])+1\\n res = max(res, dp[i][j]**2)\\n print (dp, res)\\n return res\",\n \"memory\": \"20675\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n n, m = len(matrix), len(matrix[0])\\n dp = [[-1]*m for _ in range(n)]\\n\\n def calculate(i,j):\\n n, m = len(matrix), len(matrix[0])\\n if dp[i][j] != -1:\\n return dp[i][j]\\n ans = 1e5\\n for x, y in [[i+1, j], [i,j+1], [i+1, j+1]]:\\n if x >= n:\\n ans = 0\\n continue\\n if y >= m:\\n ans = 0\\n continue \\n calculate(x, y)\\n ans = min(ans, dp[x][y])\\n if matrix[i][j] == \\\"0\\\":\\n dp[i][j] = 0\\n else:\\n dp[i][j] = 1 + ans\\n # print(i, j, dp[i][j])\\n \\n calculate(0,0)\\n\\n final = max([max(dp[i]) for i in range(n)])\\n return final*final\",\n \"memory\": \"20675\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> 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 _ in range(rows)]\\n def bfs(i, j):\\n if i >= rows or j >= cols:\\n return 0\\n if dp[i][j] == 0:\\n down = bfs(i + 1, j)\\n diag = bfs(i + 1, j + 1)\\n right = bfs(i, j + 1)\\n if matrix[i][j] == '1':\\n dp[i][j] = 1 + min(down, diag, right)\\n return dp[i][j]\\n bfs(0, 0)\\n max_len = max(max(dp[i]) for i in range(rows))\\n return max_len ** 2\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(Solution().maximalSquare(nums),file=f)\\nexit(0)\",\n \"memory\": \"21225\"\n },\n {\n \"code\": \"import math\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n n, m = len(matrix), len(matrix[0])\\n dp = [[0 for _ in range(m)] for _ in range(n)]\\n best = 0\\n for j in range(m):\\n dp[0][j] = 1 if matrix[0][j] == \\\"1\\\" else 0\\n best = max(dp[0][j], best)\\n for i in range(n):\\n dp[i][0] = 1 if matrix[i][0] == \\\"1\\\" else 0\\n best = max(dp[i][0], best)\\n \\n above = [[0 for _ in range(m)] for _ in range(n)]\\n for i in range(1,n):\\n for j in range(1,m):\\n above[i][j] = int(matrix[i-1][j] == \\\"1\\\") * (1 + above[i-1][j])\\n left = [[0 for _ in range(m)] for _ in range(n)]\\n for i in range(1,n):\\n for j in range(1,m):\\n left[i][j] = int(matrix[i][j-1] == \\\"1\\\") * (1 + left[i][j-1]) \\n\\n for i in range(1, n):\\n for j in range(1, m):\\n if matrix[i][j] == \\\"0\\\":\\n dp[i][j] = 0\\n elif dp[i-1][j-1] == 0:\\n dp[i][j] = 1\\n else:\\n dp[i][j] = 1 + min(above[i][j], left[i][j], dp[i-1][j-1])\\n best = max(dp[i][j], best)\\n return best**2\\n \",\n \"memory\": \"21225\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n dp = []\\n for i in range(len(matrix)):\\n dp.append([0]*len(matrix[0]))\\n \\n #dp[i][j] = largest area where i,j is the top left corner\\n largest = 0\\n \\n for i in range(len(matrix) - 1, -1, -1):\\n for j in range(len(matrix[0]) - 1, -1, -1):\\n if matrix[i][j] == \\\"0\\\":\\n dp[i][j] = 0\\n continue\\n if i == len(matrix) - 1 or j == len(matrix[0]) - 1: #base case\\n dp[i][j] = 1\\n else: #not base case\\n if matrix[i+1][j] == \\\"0\\\" or matrix[i][j+1] == \\\"0\\\" or matrix[i+1][j+1] == \\\"0\\\":\\n dp[i][j] = 1\\n else:\\n minsquare = min([dp[i+1][j],dp[i][j+1],dp[i+1][j+1]])\\n dp[i][j] = int((minsquare**0.5 + 1)**2)\\n if dp[i][j] > largest:\\n largest = dp[i][j]\\n \\n\\n return largest\",\n \"memory\": \"21775\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n n, m = len(matrix), len(matrix[0])\\n # initiate a 2-D dp to store the maximal square area @ (i,j)\\n dp = [[None] * m for _ in range(n)]\\n \\n # for first row and col, fill the dp with its corresponding matrix number\\n for nCol in range(m):\\n dp[0][nCol] = int(matrix[0][nCol])\\n \\n for nRow in range(n):\\n dp[nRow][0] = int(matrix[nRow][0])\\n \\n if '1' in [max(row) for row in matrix]:\\n maximalSquareArea = 1\\n else:\\n return 0 # matrix is all zeroes\\n \\n for i in range(1, n):\\n for j in range(1, m):\\n \\n if int(matrix[i][j]) != 0:\\n # compute minimum of the immediate left, top, top-left cell value\\n adjCellsMin = min(dp[i-1][j], min(dp[i-1][j-1], dp[i][j-1]))\\n # update dp at current (i,j)\\n dp[i][j] = int((adjCellsMin ** 0.5 + int(matrix[i][j])) ** 2)\\n maximalSquareArea = max(maximalSquareArea, dp[i][j])\\n else:\\n dp[i][j] = 0\\n\\n return maximalSquareArea\",\n \"memory\": \"21775\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n\\n dp = [[0 for j in range(n + 1)] for i in range(m + 1)]\\n dp[1][1] = int(matrix[0][0])\\n\\n for i in range(2, m + 1):\\n dp[i][1] = dp[i-1][1] + int(matrix[i - 1][0])\\n\\n for j in range(2, n + 1):\\n dp[1][j] = dp[1][j-1] + int(matrix[0][j - 1])\\n \\n # for row in dp:\\n # print(row)\\n # return -1\\n for i in range(2, m + 1):\\n for j in range(2, n + 1):\\n dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + int(matrix[i - 1][j - 1])\\n \\n\\n def isValidSquare(r, c, length):\\n area = dp[r][c] - dp[r - length][c] - dp[r][c - length] + dp[r - length][c - length]\\n if area == length ** 2:\\n return True\\n return False\\n \\n out = 0\\n for r in range(1, m + 1):\\n for c in range(1, n + 1):\\n left, right = 1, min(r, c)\\n while left <= right:\\n mid = (left + right) // 2\\n if isValidSquare(r, c, mid):\\n out = max(out, mid)\\n left = mid + 1\\n else:\\n right = mid - 1\\n\\n return out ** 2\\n\",\n \"memory\": \"22325\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n M = [[0] * (n + 1) for _ in range(m + 1)]\\n\\n for i in range(1, m + 1):\\n for j in range(1, n + 1):\\n M[i][j] = int(matrix[i - 1][j - 1]) + M[i - 1][j] + M[i][j - 1] - M[i - 1][j - 1]\\n\\n best = 0\\n\\n\\n def f(k):\\n for i in range(0, m + 1 - k):\\n for j in range(0, n + 1 - k):\\n v = M[i + k][j + k] - M[i + k][j] - M[i][j + k] + M[i][j]\\n if k * k == v:\\n return False\\n return True\\n \\n\\n for k in range(1, min(m, n)):\\n print(f(k))\\n\\n k = bisect.bisect_right(range(1, min(m, n) + 1), False, key=f)\\n\\n return k * k\",\n \"memory\": \"22325\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n n = len(matrix)\\n m = len(matrix[0])\\n presum = [[0]*(m+1) for _ in range(n+1)]\\n ans = 0\\n for i in range(1, n+1):\\n for j in range(1, m+1):\\n presum[i][j] = int(matrix[i-1][j-1]) - presum[i-1][j-1] + presum[i][j-1] + presum[i-1][j]\\n area = int(matrix[i-1][j-1])\\n print(area)\\n k = 1\\n while i >= k and j >= k and area == k**2:\\n ans = max(ans, area)\\n k += 1\\n area = presum[i][j] + presum[i-k][j-k] - presum[i][j-k] - presum[i-k][j]\\n\\n return ans\\n\\n \",\n \"memory\": \"22875\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n for i,row in enumerate(matrix):\\n for j,val in enumerate(row):\\n matrix[i][j] = int(matrix[i][j])\\n\\n maxSize=0\\n for i,row in enumerate(matrix):\\n for j,val in enumerate(row):\\n if matrix[i][j]:\\n maxSize = 1 if not maxSize else maxSize\\n prevs = [matrix[i-1][j], matrix[i][j-1], matrix[i-1][j-1]]\\n if i and j and 0 not in prevs:\\n x = math.sqrt(min(prevs))\\n matrix[i][j] = (x+1)**2\\n maxSize = max(maxSize,matrix[i][j])\\n return int(maxSize)\\n\",\n \"memory\": \"22875\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, mat: List[List[str]]) -> int:\\n if not mat: return 0\\n row = len(mat)\\n col = len(mat[0])\\n \\n dp = [[0]*(col+1) for _ in range(row+1)]\\n \\n for i in range(1,row+1):\\n for j in range(1,col+1):\\n dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1] + int(mat[i-1][j-1])\\n print(dp)\\n def possible(side):\\n for i in range(side, row+1):\\n for j in range(side, col+1):\\n cur = dp[i][j] - dp[i-side][j] - dp[i][j-side] + dp[i-side][j-side]\\n if cur == side*side:\\n return True\\n return False\\n \\n \\n ans = 0\\n l = 0\\n r = min(row, col)\\n \\n while l <= r:\\n mid = (l+r)//2\\n if possible(mid):\\n ans = max(mid, ans)\\n l = mid + 1\\n else:\\n r = mid - 1\\n \\n return ans*ans\",\n \"memory\": \"23425\"\n },\n {\n \"code\": \"\\n\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n M = len(matrix)\\n N = len(matrix[0])\\n\\n dp = [[0] * N for i in range(M)]\\n\\n dp[0][0] = 1 if matrix[0][0] == '1' else 0\\n\\n for m in range(1, M):\\n dp[m][0] = 1 if matrix[m][0] == '1' else 0\\n \\n for n in range(1, N):\\n dp[0][n] = 1 if matrix[0][n] == '1' else 0\\n\\n print(dp)\\n\\n for m in range(1, M):\\n for n in range(1, N):\\n if matrix[m][n] == '0':\\n continue\\n\\n dp[m][n] = 1 \\n x = dp[m-1][n-1]\\n if dp[m-1][n-1] > 0 and dp[m][n-1] > 0 and dp[m-1][n] > 0:\\n x = min(dp[m-1][n-1], dp[m][n-1], dp[m-1][n])\\n dp[m][n] = (x ** 0.5 + 1) ** 2\\n print(m, n, x, dp[m][n])\\n\\n print(dp)\\n\\n ret = -1\\n for m in range(M):\\n for n in range(N):\\n ret = max(ret, dp[m][n])\\n\\n return int(ret)\\n\\n\\n\",\n \"memory\": \"23425\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n max_area = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[i])):\\n if matrix[i][j] == \\\"1\\\":\\n if i-1 >=0 and j - 1>=0:\\n matrix[i][j] = str(\\n min(\\n int(matrix[i-1][j-1]),\\n int(matrix[i-1][j]),\\n int(matrix[i][j-1]))\\n + 1)\\n max_area = max(max_area, int(matrix[i][j]))\\n\\n # for i in range(len(matrix)):\\n # for j in range(len(matrix[i])):\\n # max_area = max(max_area, int(matrix[i][j]))\\n \\n return max_area**2\\n\\n\\n\\n\\n \",\n \"memory\": \"23975\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m,n=len(matrix),len(matrix[0])\\n matrix=[[int(matrix[j][i]) for i in range(n)] for j in range(m)]\\n r1=[[0 for i in range(n)] for j in range(m)]\\n for i in range(m):\\n for j in range(n):\\n if j==0:\\n r1[i][0]=matrix[i][0]\\n else:\\n r1[i][j]=matrix[i][j]+r1[i][j-1]\\n r2=[[0 for i in range(n)] for j in range(m)]\\n for i in range(m):\\n for j in range(n):\\n if i==0:\\n r2[0][j]=r1[0][j]\\n else:\\n r2[i][j]=r1[i][j]+r2[i-1][j]\\n ans=0\\n print(r2)\\n for i in range(m):\\n for j in range(n):\\n for k in range(min(m-i,n-j)):\\n if i==0 and j==0:\\n if r2[k][k]==(k+1)*(k+1):\\n ans=max(ans,(k+1)*(k+1))\\n elif i==0:\\n if r2[i+k][j+k]-r2[i+k][j-1]==(k+1)*(k+1):\\n ans=max(ans,(k+1)*(k+1))\\n elif j==0:\\n if r2[i+k][j+k]-r2[i-1][j+k]==(k+1)*(k+1):\\n ans=max(ans,(k+1)*(k+1))\\n else:\\n if r2[i+k][j+k]+r2[i-1][j-1]-r2[i+k][j-1]-r2[i-1][j+k]==(k+1)*(k+1):\\n ans=max(ans,(k+1)*(k+1))\\n return ans\",\n \"memory\": \"24525\"\n },\n {\n \"code\": \"from itertools import chain\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n\\n max_side = 0\\n for i in range(m):\\n max_side = max(max_side, int(matrix[i][0]))\\n for j in range(n):\\n max_side = max(max_side, int(matrix[0][j]))\\n\\n for i in range(1, m):\\n for j in range(1, n):\\n if matrix[i][j] == \\\"0\\\":\\n continue\\n side = 1 + min(map(int, (matrix[i][j - 1], matrix[i - 1][j], matrix[i - 1][j - 1])))\\n max_side = max(max_side, side)\\n matrix[i][j] = str(side)\\n return max_side * max_side\\n\",\n \"memory\": \"24525\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n maxxer = max(max(int(cell) for cell in row) for row in matrix)\\n for i in range(1,len(matrix)):\\n for j in range(1,len(matrix[0])):\\n if (matrix[i][j] != '0' and\\n matrix[i-1][j] != '0' and\\n matrix[i][j-1] != '0' and\\n matrix[i-1][j-1] != '0'):\\n matrix[i][j] = str(min(int(matrix[i-1][j]),int(matrix[i][j-1]),int(matrix[i-1][j-1])) +1)\\n maxxer = max(int(matrix[i][j]),maxxer)\\n for row in matrix:\\n print(\\\" \\\".join(str(cell) for cell in row))\\n return maxxer**2\\n \",\n \"memory\": \"25075\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n max_square = 0\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n if int(matrix[r][c]):\\n max_square = max(max_square, 1)\\n if r == 0 or c == 0:\\n continue \\n \\n if int(matrix[r-1][c-1]) and int(matrix[r-1][c]) and int(matrix[r][c-1]):\\n matrix[r][c] = str(min(int(matrix[r-1][c-1]),int(matrix[r-1][c]),int(matrix[r][c-1])) + 1) \\n max_square = max(max_square, int(matrix[r][c]))\\n \\n print(matrix, max_square)\\n # ['1', '0', '1', '0', '0']\\n # ['1', '0', '1', '1', '1']\\n # ['1', '1', '1', '2', '2']\\n # ['1', '0', '0', '1', '0']\\n\\n # [\\\"1\\\", \\\"0\\\", \\\"1\\\", \\\"0\\\", \\\"0\\\"]\\n # [\\\"1\\\", \\\"0\\\", \\\"1\\\", \\\"1\\\", \\\"1\\\"]\\n # [\\\"1\\\", \\\"1\\\", \\\"1\\\", \\\"1\\\", \\\"1\\\"]\\n # [\\\"1\\\", \\\"0\\\", \\\"0\\\", \\\"1\\\", \\\"0\\\"]\\n \\n # [\\\"1\\\", \\\"1\\\", \\\"1\\\", \\\"1\\\"]\\n # [\\\"1\\\", \\\"1\\\", \\\"1\\\", \\\"1\\\"]\\n # [\\\"1\\\", \\\"1\\\", \\\"1\\\", \\\"1\\\"]\\n\\n # ['1', '1', '1', '1']\\n # ['1', '2', '2', '2']\\n # ['1', '2', '4', '4']\\n\\n return max_square * max_square\\n \",\n \"memory\": \"25625\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n rows = []\\n for i in range(m):\\n s = 0\\n row = []\\n for j in range(n):\\n if matrix[i][j] == '0':\\n s = 0\\n else:\\n s += 1\\n row.append(s)\\n rows.append(row)\\n columns = []\\n for col in range(n):\\n s = 0\\n for row in range(m):\\n if matrix[row][col] == '0':\\n s = 0\\n else:\\n s += 1\\n rows[row][col] = (rows[row][col], s)\\n max_size = 0\\n for i in range(m):\\n for j in range(n):\\n size = 0\\n s = i\\n t = j\\n while s < m and t < n and rows[s][t][0] > size and rows[s][t][1] > size:\\n size += 1\\n s += 1\\n t += 1\\n max_size=max(max_size,size)\\n return max_size**2\\n\\n\",\n \"memory\": \"25625\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n dp_row = [[0 for i in range(n)] for j in range(m)]\\n for i in reversed(range(m)):\\n for j in reversed(range(n)):\\n if matrix[i][j] == '1' and j<n-1:\\n dp_row[i][j] = 1 + dp_row[i][j+1]\\n elif matrix[i][j] == '1':\\n dp_row[i][j] = 1\\n \\n dp_col = [[0 for i in range(n)] for j in range(m)]\\n for i in reversed(range(m)):\\n for j in reversed(range(n)):\\n if matrix[i][j] == '1' and i<m-1:\\n dp_col[i][j] = 1 + dp_col[i+1][j]\\n elif matrix[i][j] == '1':\\n dp_col[i][j] = 1\\n \\n dp_area = [[0 for i in range(n)] for j in range(m)]\\n res = 0\\n for i in reversed(range(m)):\\n for j in reversed(range(n)):\\n if matrix[i][j] == '1' and i<m-1 and j<n-1:\\n if (min(dp_row[i][j]-1, dp_col[i][j]-1))**2 >= dp_area[i+1][j+1]:\\n dp_area[i][j] = (sqrt(dp_area[i+1][j+1]) + 1)**2\\n else:\\n dp_area[i][j] = min(dp_row[i][j], dp_col[i][j])**2\\n elif matrix[i][j] == '1' and i==m-1:\\n dp_area[i][j] = 1\\n elif matrix[i][j] == '1' and j==n-1:\\n dp_area[i][j] = 1\\n if dp_area[i][j] > res:\\n res = dp_area[i][j]\\n print(dp_col)\\n print(dp_row)\\n print(dp_area)\\n return int(res)\\n\\n\\n \",\n \"memory\": \"26175\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n # keep track of length of chain of 1s below and right\\n # get min of below chain, right chain, and below_right dp subresult\\n # to make current dp result\\n\\n # dp_chain[i][j] = (below, right, square)\\n # below and represents chain of 1s (i,j inclusive)\\n # square represents dimensions of largest square\\n # that can be made with (i,j) as top left corner\\n\\n dp = [[(0,0,0)] * len(matrix[0]) for _ in range(len(matrix))]\\n ans = 0\\n # set up base cases, very bottom and right cells\\n for i in range(len(matrix)):\\n if matrix[i][-1] == '1':\\n dp[i][-1] = (1, 1, 1) # square dimensions\\n ans = 1\\n for j in range(len(matrix[0])):\\n if matrix[-1][j] == '1':\\n dp[-1][j] = (1, 1, 1)\\n ans = 1\\n \\n\\n for i in range(len(matrix) - 2, -1, -1):\\n for j in range(len(matrix[0]) - 2, -1, -1):\\n if matrix[i][j] == '0':\\n continue\\n below = 1 + dp[i + 1][j][0]\\n right = 1 + dp[i][j + 1][1]\\n \\n inner_square_length = dp[i + 1][j + 1][2]\\n square_length = min(below, right, inner_square_length + 1)\\n dp[i][j] = (below, right, square_length)\\n ans = max(ans, square_length ** 2)\\n print(i, j, square_length)\\n\\n return ans\",\n \"memory\": \"26175\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n f = [[[i, j] for j in range(n)] for i in range(m)]\\n ans = 0\\n for i in range(m):\\n if matrix[i][0] == \\\"1\\\":\\n ans = 1\\n for j in range(n):\\n if matrix[0][j] == \\\"1\\\":\\n ans = 1\\n for i in range(1, m):\\n for j in range(1, n):\\n if matrix[i][j] == \\\"0\\\":\\n continue\\n ans = max(ans, 1)\\n if matrix[i - 1][j - 1] == \\\"1\\\":\\n r, c = f[i - 1][j - 1]\\n new_r, new_c = r, c\\n flag = True\\n for col in range(c, j):\\n if matrix[i][col] == \\\"0\\\":\\n new_c = col + 1\\n for row in range(r, i):\\n if matrix[row][j] == \\\"0\\\":\\n new_r = row + 1\\n if i - new_r > j - new_c:\\n new_r = i - (j - new_c)\\n elif i - new_r < j - new_c:\\n new_c = j - (i - new_r)\\n if flag:\\n f[i][j] = [new_r, new_c]\\n ans = max(ans, (i - new_r + 1) * (j - new_c + 1))\\n return ans\",\n \"memory\": \"26725\"\n },\n {\n \"code\": \"class Solution:\\n \\\"to katw dexia kanei define\\\"\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n res = [[0 for _ in range(n)] for _ in range(m)]\\n test = [[[0,0] for _ in range(n)] for _ in range(m)]\\n \\n for row in range(m):\\n for col in range(n):\\n matrix[row][col] = int(matrix[row][col])\\n for col in range(1, n):\\n test[0][col][0] = (1+test[0][col-1][0]) * matrix[0][col-1]\\n for row in range(1, m):\\n test[row][0][1] = (1+test[row-1][0][1]) * matrix[row-1][0]\\n for row in range(1, m):\\n for col in range(1, n):\\n test[row][col][0] = (1+test[row][col-1][0]) * matrix[row][col-1]\\n test[row][col][1] = (1+test[row-1][col][1]) * matrix[row-1][col]\\n \\n for row in range(m):\\n for col in range(n):\\n res[row][col] = int(matrix[row][col])\\n for size in reversed(range(2, min(row+2, col+2))):\\n if matrix[row][col] == 1 and res[row-1][col-1] >= size-1 and min(test[row][col]) >= size-1: \\n res[row][col] = size\\n break\\n \\n max_size = max([max(i) for i in res])\\n return max_size**2\\n\\n\\n\\n\",\n \"memory\": \"26725\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n down = [[-1 for _ in matrix[i]] for i in range(len(matrix))]\\n right = [[-1 for _ in matrix[i]] for i in range(len(matrix))]\\n diag = [[-1 for _ in matrix[i]] for i in range(len(matrix))]\\n\\n def findDown(i, j):\\n if not 0 <= i < len(matrix) or matrix[i][j] == '0':\\n return 0\\n if down[i][j] == -1:\\n down[i][j] = findDown(i + 1, j) + 1\\n return down[i][j]\\n \\n def findRight(i, j):\\n if not 0 <= j < len(matrix[i]) or matrix[i][j] == '0':\\n return 0\\n if right[i][j] == -1:\\n right[i][j] = findRight(i, j + 1) + 1\\n return right[i][j]\\n \\n def findDiag(i, j):\\n if not 0 <= i < len(matrix) or not 0 <= j < len(matrix[i]) or matrix[i][j] == '0':\\n return 0\\n if diag[i][j] == -1:\\n diag[i][j] = min(findDiag(i + 1, j + 1) + 1, findRight(i, j), findDown(i, j))\\n return diag[i][j]\\n\\n max_side = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[i])):\\n max_side = max(max_side, findDiag(i, j))\\n return max_side * max_side\\n \\n\",\n \"memory\": \"27275\"\n },\n {\n \"code\": \"from dataclasses import dataclass\\n@dataclass\\nclass Cell:\\n # right_ones: int = 0\\n # down_ones: int = 0 \\n square_size: int = 0\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n rows_num = len(matrix)\\n cols_num = len(matrix[0])\\n cells = [[Cell() for _ in range(cols_num + 1)]\\n for _ in range(rows_num + 1)]\\n\\n def print_cells(cells, cur_row, cur_col):\\n for row in range(len(cells) - 1):\\n print()\\n for col in range(len(cells[0]) - 1):\\n c = cells[row][col]\\n mark = '*' if cur_col == col and cur_row == row else '('\\n print(f'{mark}{c.square_size}, {c.down_ones}, {c.right_ones})', end = ', ')\\n\\n max_square = 0\\n for row in reversed(range(rows_num)):\\n for col in reversed(range(cols_num)):\\n if matrix[row][col] == \\\"0\\\":\\n continue\\n cell = cells[row][col]\\n right = cells[row][col + 1]\\n down = cells[row + 1][col]\\n diag = cells[row + 1][col + 1]\\n # cell.right_ones = right.right_ones + 1\\n # cell.down_ones = down.down_ones + 1\\n\\n # cell.square_size = min(diag.square_size, right.right_ones, down.down_ones) + 1\\n cell.square_size = min(diag.square_size, right.square_size, down.square_size) + 1\\n # if diag.square_size <= right.right_ones and diag.square_size <= down.down_ones:\\n # cell.square_size = diag.square_size + 1\\n max_square = max(max_square, cell.square_size)\\n # print(f'{row},{col}: {cell}, {matrix[row][col]}')\\n # print_cells(cells, row, col)\\n # print()\\n # print(cells)\\n \\n return max_square * max_square\\n\\n\\n \",\n \"memory\": \"27825\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows = len(matrix)\\n cols = len(matrix[0])\\n dp = [[[0, 0, 0] for __ in range(cols+1)] for _ in range(rows+1)]\\n maxsquare = 0\\n for r in range(rows):\\n for c in range(cols):\\n rowstreak, colstreak, diagstreak = dp[r][c]\\n if matrix[r][c] == '1':\\n dp[r][c+1][0] = 1 + rowstreak\\n dp[r+1][c][1] = 1 + colstreak\\n square = 1 + min(dp[r][c])\\n dp[r+1][c+1][2] = square\\n maxsquare = max(square, maxsquare)\\n #print(r, c, 'pass', dp)\\n return maxsquare*maxsquare\",\n \"memory\": \"28375\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows = len(matrix)\\n cols = len(matrix[0])\\n dp = [[[0, 0, 0] for __ in range(cols+1)] for _ in range(rows+1)]\\n maxsquare = 0\\n for r in range(rows):\\n for c in range(cols):\\n rowstreak, colstreak, diagstreak = dp[r][c]\\n if matrix[r][c] == '1':\\n dp[r][c+1][0] = 1 + rowstreak\\n dp[r+1][c][1] = 1 + colstreak\\n square = 1 + min(rowstreak, colstreak, diagstreak)\\n dp[r+1][c+1][2] = square\\n maxsquare = max(square, maxsquare)\\n #print(r, c, 'pass', dp)\\n return maxsquare*maxsquare\",\n \"memory\": \"28375\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows = len(matrix)\\n cols = len(matrix[0])\\n dp = [[[0, 0, 0] for __ in range(cols+1)] for _ in range(rows+1)]\\n maxsquare = 0\\n for r in range(rows):\\n for c in range(cols):\\n val = int(matrix[r][c])\\n rowstreak, colstreak, diagstreak = dp[r][c]\\n if val:\\n dp[r][c+1][0] = 1 + rowstreak\\n dp[r+1][c][1] = 1 + colstreak\\n square = 1 + min(rowstreak, colstreak, diagstreak)\\n dp[r+1][c+1][2] = square\\n maxsquare = max(square, maxsquare)\\n #print(r, c, 'pass', dp)\\n return maxsquare*maxsquare\",\n \"memory\": \"28925\"\n },\n {\n \"code\": \"'''\\nIdea: prefix count\\n\\n(1, 4), (0, 0), (1, 3), (0, 0), (0, 0)\\n(1, 3), (0, 0), (3, 2), (2, 2), (1, 2)\\n(5, 2), (4, 1), (3, 1), (2, 2), (1, 1)\\n(1, 1), (0, 0), (0, 0), (1, 1), (0, 0)\\n\\nIdea: binary search\\n- Time: O(log(L)*m*n)\\n - L = min(m, n)\\n- Space: O(mn)\\n'''\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n num_rows, num_cols = len(matrix), len(matrix[0])\\n def square_exists(square_len):\\n for row in range(num_rows):\\n for col in range(num_cols):\\n if is_square_with_len(row, col, square_len):\\n return True\\n return False\\n\\n runlen = [[[0, 0] for _ in range(num_cols)] for _ in range(num_rows)]\\n for row in range(num_rows-1, -1, -1):\\n for col in range(num_cols-1, -1, -1):\\n if matrix[row][col] == '1':\\n runlen[row][col][0] = 1\\n if row < num_rows-1:\\n runlen[row][col][0] += runlen[row+1][col][0]\\n runlen[row][col][1] = 1\\n if col < num_cols-1:\\n runlen[row][col][1] += runlen[row][col+1][1]\\n\\n print(runlen)\\n def is_square_with_len(row_start, col_start, square_len):\\n if row_start+square_len > num_rows:\\n return False\\n if col_start+square_len > num_cols:\\n return False\\n while square_len:\\n row_run, col_run = runlen[row_start][col_start]\\n if row_run < square_len or col_run < square_len:\\n return False\\n row_start += 1\\n col_start += 1\\n square_len -= 1\\n return True\\n\\n # def is_square_with_len(row_start, col_start, square_len):\\n # if row_start+square_len > num_rows:\\n # return False\\n # if col_start+square_len > num_cols:\\n # return False\\n # for row in range(row_start, row_start+square_len):\\n # for col in range(col_start, col_start+square_len):\\n # if matrix[row][col] != '1':\\n # return False\\n # return True\\n\\n # loop invariant: lo points to a valid square length\\n lo, hi = 0, min(num_rows, num_cols)+1\\n while lo < hi:\\n mid = (lo + hi + 1) >> 1\\n if square_exists(mid):\\n lo = mid\\n else:\\n hi = mid - 1\\n return hi*hi\",\n \"memory\": \"28925\"\n },\n {\n \"code\": \"class Solution:\\n \\\"to katw dexia kanei define\\\"\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n res = [[0 for _ in range(n)] for _ in range(m)]\\n test = [[[0,0] for _ in range(n)] for _ in range(m)]\\n \\n for row in range(m):\\n for col in range(n):\\n matrix[row][col] = int(matrix[row][col])\\n for col in range(1, n):\\n test[0][col][0] = (1+test[0][col-1][0]) * matrix[0][col-1]\\n for row in range(1, m):\\n test[row][0][1] = (1+test[row-1][0][1]) * matrix[row-1][0]\\n for row in range(1, m):\\n for col in range(1, n):\\n test[row][col][0] = (1+test[row][col-1][0]) * matrix[row][col-1]\\n test[row][col][1] = (1+test[row-1][col][1]) * matrix[row-1][col]\\n \\n print(test)\\n for row in range(m):\\n for col in range(n):\\n res[row][col] = int(matrix[row][col])\\n for size in reversed(range(2, min(row+2, col+2))):\\n if matrix[row][col] == 1 and res[row-1][col-1] >= size-1 and min(test[row][col]) >= size-1: \\n res[row][col] = size\\n break\\n \\n max_size = max([max(i) for i in res])\\n return max_size**2\\n\\n\\n\\n\",\n \"memory\": \"29475\"\n },\n {\n \"code\": \"from dataclasses import dataclass\\n@dataclass\\nclass Cell:\\n right_ones: int = 0\\n down_ones: int = 0 \\n square_size: int = 0\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n rows_num = len(matrix)\\n cols_num = len(matrix[0])\\n cells = [[Cell() for _ in range(cols_num + 1)]\\n for _ in range(rows_num + 1)]\\n\\n def print_cells(cells, cur_row, cur_col):\\n for row in range(len(cells) - 1):\\n print()\\n for col in range(len(cells[0]) - 1):\\n c = cells[row][col]\\n mark = '*' if cur_col == col and cur_row == row else '('\\n print(f'{mark}{c.square_size}, {c.down_ones}, {c.right_ones})', end = ', ')\\n\\n max_square = 0\\n for row in reversed(range(rows_num)):\\n for col in reversed(range(cols_num)):\\n if matrix[row][col] == \\\"0\\\":\\n continue\\n cell = cells[row][col]\\n right = cells[row][col + 1]\\n down = cells[row + 1][col]\\n diag = cells[row + 1][col + 1]\\n cell.right_ones = right.right_ones + 1\\n cell.down_ones = down.down_ones + 1\\n\\n cell.square_size = min(diag.square_size, right.right_ones, down.down_ones) + 1\\n # if diag.square_size <= right.right_ones and diag.square_size <= down.down_ones:\\n # cell.square_size = diag.square_size + 1\\n max_square = max(max_square, cell.square_size)\\n # print(f'{row},{col}: {cell}, {matrix[row][col]}')\\n # print_cells(cells, row, col)\\n # print()\\n # print(cells)\\n \\n return max_square * max_square\\n\\n\\n \",\n \"memory\": \"29475\"\n },\n {\n \"code\": \"class Solution:\\n \\\"\\\"\\\"\\n 0 0 0 1\\n 1 1 0 1\\n 1 1 1 1 \\n 0 1 1 1\\n 0 1 1 1\\n \\\"\\\"\\\"\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n dp = [[(float('inf'), float('inf')) for i in range(len(matrix[0]))] for j in range(len(matrix))] #Record the top left corner of the square\\n \\n out = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if matrix[i][j] == \\\"0\\\":\\n continue\\n\\n dp[i][j] = (i, j) #2 3\\n out = max(out, 1)\\n if i == 0 or j == 0:\\n continue\\n\\n new_top_left = dp[i - 1][j - 1] #1, 2\\n if new_top_left != (float('inf'), float('inf')):\\n left_res_y, left_res_x = dp[i][j - 1] # 2 2\\n up_res_y, up_res_x = dp[i - 1][j] # 1 3\\n\\n new_coords = (max(up_res_y, new_top_left[0]), max(left_res_x, new_top_left[1]))\\n diagonal = min(i - new_coords[0], j - new_coords[1])\\n\\n if new_coords[0] == float('inf') or new_coords[1] == float('inf'):\\n continue\\n dp[i][j] = (i - diagonal, j - diagonal)\\n out = max(out, (i - dp[i][j][0] + 1) * (j - dp[i][j][1] + 1))\\n \\n return out\\n \\n\\n\\n\\n\\n \\n\\n\",\n \"memory\": \"30025\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n # maximal_len = m if m < n else n\\n target_len = 1\\n bad_starting_squares = set()\\n def find_square(coord: tuple):\\n searched_squares = set()\\n if coord[0] + target_len > m:\\n return None\\n if coord[1] + target_len > n:\\n return None\\n for i in range(coord[0], coord[0] + target_len):\\n for j in range(coord[1], coord[1] + target_len):\\n if matrix[i][j] == \\\"0\\\":\\n bad_starting_squares.add((i, j))\\n bad_starting_squares.add(coord)\\n return False\\n return True\\n def solution():\\n nonlocal target_len\\n found = False\\n for i in range(m):\\n if i + target_len > m:\\n break\\n for j in range(n):\\n if j + target_len > n:\\n break\\n if (i, j) in bad_starting_squares:\\n continue\\n found = find_square((i, j))\\n if found:\\n target_len += 1\\n return solution()\\n if found is None:\\n bad_starting_squares.add((i, j))\\n break\\n return (target_len - 1)**2\\n \\n return solution()\\n\",\n \"memory\": \"30575\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n # maximal_len = m if m < n else n\\n target_len = 1\\n bad_starting_squares = set()\\n def find_square(coord: tuple):\\n searched_squares = set()\\n # if coord[0] + target_len > m:\\n # return None\\n if coord[1] + target_len > n:\\n return None\\n for i in range(coord[0], coord[0] + target_len):\\n for j in range(coord[1], coord[1] + target_len):\\n if matrix[i][j] == \\\"0\\\":\\n bad_starting_squares.add((i, j))\\n bad_starting_squares.add(coord)\\n return False\\n return True\\n def solution():\\n nonlocal target_len\\n found = False\\n for i in range(m):\\n if i + target_len > m:\\n break\\n for j in range(n):\\n if (i, j) in bad_starting_squares:\\n continue\\n found = find_square((i, j))\\n if found:\\n target_len += 1\\n return solution()\\n if found is None:\\n bad_starting_squares.add((i, j))\\n break\\n return (target_len - 1)**2\\n \\n return solution()\\n\",\n \"memory\": \"30575\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n matrix = np.array(matrix)\\n m,n = len(matrix),len(matrix[0])\\n max_len = 0\\n dp = [[0]*n for _ in range(m)]\\n max_size = 0\\n\\n for i in range(m):\\n for j in range(n):\\n if matrix[i][j] == '1':\\n if i ==0 or j==0:\\n dp[i][j] = 1\\n else:\\n dp[i][j] = min(dp[i-1][j],dp[i-1][j-1],dp[i][j-1])+1\\n max_size = max(max_size, dp[i][j])\\n return max_size*max_size\",\n \"memory\": \"31125\"\n },\n {\n \"code\": \"import numpy as np\\n\\n\\nclass Solution:\\n def isInBounds(self, m, n, x, y):\\n inbounds = 0 <= x < m and 0 <= y < n\\n return inbounds\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n calc = np.zeros((m, n))\\n largest_side = 0\\n for i in range(m):\\n for j in range(n):\\n north = calc[i - 1][j] if self.isInBounds(m, n, i - 1, j) else 0\\n west = calc[i][j - 1] if self.isInBounds(m, n, i, j - 1) else 0\\n northwest = calc[i - 1][j - 1] if self.isInBounds(m, n, i - 1, j - 1) else 0\\n val = 1 + min(north, west, northwest)\\n calc[i][j] = val if int(matrix[i][j]) > 0 else 0\\n largest_side = max(calc[i][j], largest_side)\\n return int(largest_side ** 2)\\n\",\n \"memory\": \"31125\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n # maximal_len = m if m < n else n\\n target_len = 1\\n bad_starting_squares = set()\\n def find_square(coord: tuple):\\n searched_squares = set()\\n if coord[0] + target_len > m:\\n return None\\n if coord[1] + target_len > n:\\n return None\\n for i in range(coord[0], coord[0] + target_len):\\n for j in range(coord[1], coord[1] + target_len):\\n if matrix[i][j] == \\\"0\\\":\\n bad_starting_squares.add((i, j))\\n bad_starting_squares.add(coord)\\n return False\\n return True\\n def solution():\\n nonlocal target_len\\n # nonlocal bad_starting_squares\\n found = False\\n for i in range(m):\\n if i + target_len > m:\\n break\\n for j in range(n):\\n if (i, j) in bad_starting_squares:\\n continue\\n found = find_square((i, j))\\n if found:\\n target_len += 1\\n return solution()\\n if found is None:\\n bad_starting_squares.add((i, j))\\n break\\n return (target_len - 1)**2\\n \\n return solution()\\n\",\n \"memory\": \"31675\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n res = np.zeros((m+1, n+1))\\n # print(res)\\n for i in range(m):\\n for j in range(n):\\n if matrix[i][j] == \\\"1\\\":\\n res[i+1][j+1] = min(res[i][j], res[i+1][j], res[i][j+1]) + 1\\n # print(res)\\n return int(np.max(res)**2)\\n\\n\\n \\n \\n \",\n \"memory\": \"31675\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n import numpy as np\\n \\n m=len(matrix)\\n n=len(matrix[0])\\n\\n dp=[[0 for i in range(n)] for j in range(m)]\\n \\n for i in range(m):\\n for j in range(n):\\n if i==0 or j==0:\\n dp[i][j]=int(matrix[i][j])\\n continue\\n if matrix[i][j]==\\\"0\\\":\\n dp[i][j]=0\\n continue\\n \\n dp[i][j]=min(dp[i-1][j],dp[i][j-1],dp[i-1][j-1])+1\\n #print(dp)\\n return np.max(dp)*np.max(dp)\",\n \"memory\": \"32225\"\n },\n {\n \"code\": \"from functools import cache\\nimport numpy as np\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n squares = np.zeros((rows+1, cols+1), dtype=int)\\n maximum = 0\\n\\n for r in range(rows-1, -1, -1):\\n for c in range(cols-1, -1, -1):\\n if matrix[r][c] != '0':\\n right = squares[r][c+1]\\n down = squares[r+1][c]\\n diag = squares[r+1][c+1]\\n size = min(right, down) + 1\\n if size - 1 > diag:\\n squares[r][c] = size - 1\\n else:\\n squares[r][c] = size\\n\\n maximum = max(maximum, squares[r][c])\\n \\n #print(squares)\\n return maximum ** 2\\n\\n\\n\\n\\n\\n\",\n \"memory\": \"32225\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n '''\\n M,N = len(matrix), len(matrix[0])\\n cumsum = np.zeros((M+1,N+1))\\n for i in range(M):\\n for j in range(N):\\n cumsum[i+1,j+1] = int(matrix[i][j]) + cumsum[i,j+1] + cumsum[i+1,j] - cumsum[i,j]\\n \\n max_size = min(M,N)\\n for sz in range(max_size, 0, -1):\\n for i in range(M+1-sz):\\n for j in range(N+1-sz):\\n area_sum = cumsum[i+sz,j+sz] - cumsum[i,j+sz] - cumsum[i+sz,j] + cumsum[i,j]\\n if area_sum == sz*sz:\\n return sz*sz\\n return 0\\n '''\\n M,N = len(matrix), len(matrix[0])\\n dp = np.zeros((M+1,N+1)).astype(int) \\n for i in range(M):\\n for j in range(N):\\n if matrix[i][j] == '1':\\n dp[i+1,j+1] = 1 + min(dp[i,j+1], dp[i+1,j], dp[i,j])\\n max_size = np.max(np.max(dp))\\n return max_size*max_size\",\n \"memory\": \"32775\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n matrix = np.array(matrix).astype(int)\\n dp = matrix.copy()\\n curr_max = np.max(dp)\\n print(dp)\\n for i in range(1, dp.shape[0]):\\n for j in range(1, dp.shape[1]):\\n ll = min([dp[i-1][j-1], dp[i][j-1], dp[i-1][j]])\\n if np.sum(matrix[i, j-ll:j+1]) == np.sum(matrix[i-ll:i+1, j]) == ll+1 and \\\\\\n dp[i-1][j]:\\n dp[i][j] = ll + 1\\n curr_max = max(curr_max, dp[i][j])\\n print(dp)\\n return curr_max ** 2\",\n \"memory\": \"32775\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n rows = []\\n cols = [[0] * n for _ in range(m)]\\n for r in range(m):\\n temp = [0] * n\\n for c in range(n):\\n if matrix[r][c] != \\\"0\\\":\\n if c > 0:\\n temp[c] = temp[c-1]+1\\n else:\\n temp[c] = 1\\n rows.append(temp)\\n\\n for c in range(n):\\n curr = 0\\n for r in range(m):\\n if matrix[r][c] != \\\"0\\\":\\n if r > 0:\\n cols[r][c] = cols[r-1][c]+1\\n else:\\n cols[r][c] = 1\\n visited = set()\\n print(rows)\\n print(cols)\\n ans = 0\\n for i in range(m):\\n for j in range(n):\\n if (i, j) not in visited and matrix[i][j] == \\\"1\\\":\\n length = 1\\n visited.add((i, j))\\n ti, tj = i+1, j+1\\n while ti < m and tj < n and min(rows[ti][tj], cols[ti][tj]) >= (length+1):\\n length += 1\\n ti += 1\\n tj += 1\\n ans = max(ans, length**2) \\n return ans\\n\\n\\n\\n \\n \\n\\n \",\n \"memory\": \"33325\"\n },\n {\n \"code\": \"import collections\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n # Recurrence: this is the maximum size of the square ending\\n # on this element.\\n self.M = collections.defaultdict(int)\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if matrix[i][j] == '0':\\n self.M[i, j] = 0\\n else:\\n self.M[i, j] = min([\\n self.M[i-1, j],\\n self.M[i, j-1],\\n self.M[i-1, j-1],\\n ]) + 1\\n return max(self.M.values())**2\",\n \"memory\": \"33875\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n def check_square(i, j, matrix, node_map):\\n if i >= len(matrix) or j >= len(matrix[0]) or matrix[i][j] == \\\"0\\\":\\n return 0\\n if node_map.get((i,j)):\\n return node_map.get((i,j))\\n res = min(check_square(i, j+1, matrix, node_map), check_square(i+1, j, matrix, node_map), check_square(i+1, j+1, matrix, node_map))\\n node_map[(i,j)] = res+1\\n return node_map[(i,j)]\\n\\n\\n\\n def get_max_sqaure(i, j, matrix, node_map):\\n max_length = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if matrix[i][j] == \\\"1\\\":\\n if node_map.get((i,j)):\\n length = node_map.get((i,j))\\n else:\\n length = check_square(i,j, matrix, node_map)\\n if length > max_length:\\n max_length = length\\n return max_length**2\\n\\n node_map = {}\\n return get_max_sqaure(0, 0, matrix, node_map)\\n \",\n \"memory\": \"34425\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n def check_square(i, j, matrix, node_map):\\n if i >= len(matrix) or j >= len(matrix[0]) or matrix[i][j] == \\\"0\\\":\\n return 0\\n if node_map.get((i,j)):\\n return node_map.get((i,j))\\n res = min(check_square(i, j+1, matrix, node_map), check_square(i+1, j, matrix, node_map), check_square(i+1, j+1, matrix, node_map))\\n node_map[(i,j)] = res+1\\n return node_map[(i,j)]\\n\\n\\n\\n def get_max_sqaure(i, j, matrix, node_map):\\n max_length = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if matrix[i][j] == \\\"1\\\":\\n if node_map.get((i,j)):\\n length = node_map.get((i,j))\\n else:\\n length = check_square(i,j, matrix, node_map)\\n if length > max_length:\\n max_length = length\\n return max_length**2\\n\\n node_map = {}\\n return get_max_sqaure(0, 0, matrix, node_map)\\n \",\n \"memory\": \"34425\"\n },\n {\n \"code\": \"class Solution:\\n res = 0\\n\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n self.help(m-1, n-1, matrix, {})\\n return self.res ** 2\\n\\n def help(self, i, j, matrix, states):\\n if i < 0 or j < 0:\\n return 0\\n if (i, j) in states:\\n return states[(i, j)]\\n\\n states[(i, j)] = min(self.help(i-1, j, matrix, states), self.help(i-1, j-1, matrix, states), self.help(i, j-1, matrix, states)) + 1\\n\\n if matrix[i][j] == \\\"0\\\":\\n states[(i, j)] = 0\\n\\n self.res = max(self.res, states[(i, j)])\\n \\n\\n return states[(i, j)]\\n\\n \",\n \"memory\": \"34975\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n \\n cache = {}\\n for i in range(len(matrix)):\\n cache[i,len(matrix[0])] = 0\\n for i in range(len(matrix[0])):\\n cache[len(matrix),i] = 0\\n cache[len(matrix),len(matrix[0])]=0\\n \\n for i in range(len(matrix)-1,-1,-1):\\n for j in range(len(matrix[0])-1,-1,-1):\\n if matrix[i][j] == \\\"1\\\":\\n down = cache[i+1,j]\\n right = cache[i,j+1]\\n dig = cache[i+1,j+1]\\n \\n cache[i,j] = min(dig,right,down) + 1\\n else:\\n cache[i,j] = 0\\n \\n\\n return max(cache.values())**2\",\n \"memory\": \"34975\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n memo = {}\\n maxLength = 0\\n \\n def dfs(r, c, memo):\\n if r >= ROWS or c >= COLS:\\n return 0\\n if (r,c) in memo:\\n return memo[(r,c)]\\n if matrix[r][c] == \\\"0\\\":\\n memo[(r,c)] = 0\\n return 0\\n \\n right = dfs(r, c+1, memo)\\n down = dfs(r+1, c, memo)\\n diag = dfs(r + 1, c + 1, memo)\\n side_length = 1 + min(right, down, diag)\\n memo[(r,c)] = side_length\\n\\n return side_length\\n for r in range(ROWS):\\n for c in range(COLS):\\n maxLength = max(maxLength, dfs(r,c,memo))\\n return maxLength ** 2\\n\",\n \"memory\": \"35525\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n memo = {}\\n maxLength = 0\\n \\n def dfs(r, c, memo):\\n if r >= ROWS or c >= COLS:\\n return 0\\n if (r,c) in memo:\\n return memo[(r,c)]\\n if matrix[r][c] == \\\"0\\\":\\n memo[(r,c)] = 0\\n return 0\\n \\n right = dfs(r, c+1, memo)\\n down = dfs(r+1, c, memo)\\n diag = dfs(r + 1, c + 1, memo)\\n side_length = 1 + min(right, down, diag)\\n memo[(r,c)] = side_length\\n\\n return side_length\\n for r in range(ROWS):\\n for c in range(COLS):\\n maxLength = max(maxLength, dfs(r,c,memo))\\n return maxLength ** 2\\n\",\n \"memory\": \"35525\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def maximalSquare(self, m: List[List[str]]) -> int:\\n if not m or not m[0]:\\n return 0\\n\\n def solve(i, j, memo):\\n if i >= len(m) or j >= len(m[0]):\\n return 0\\n if m[i][j] == '0':\\n return 0\\n if (i, j) in memo:\\n return memo[(i, j)]\\n\\n right = solve(i, j + 1, memo)\\n down = solve(i + 1, j, memo)\\n diag = solve(i + 1, j + 1, memo)\\n\\n memo[(i, j)] = 1 + min(right, down, diag)\\n return memo[(i, j)]\\n\\n memo = {}\\n max_side = 0\\n for i in range(len(m)):\\n for j in range(len(m[0])):\\n max_side = max(max_side, solve(i, j, memo))\\n\\n return max_side * max_side\\n\",\n \"memory\": \"36075\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n global dic\\n dic={}\\n def dp(i,j):\\n global dic\\n if (i,j) in dic:\\n return dic[(i,j)]\\n elif i>=len(matrix) or j>=len(matrix[0]) or matrix[i][j]=='0':\\n return 0\\n elif matrix[i][j]=='1':\\n dic[(i,j)]=1+min(dp(i+1,j),dp(i,j+1),dp(i+1,j+1))\\n return dic[(i,j)]\\n maxi=0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if matrix[i][j]=='0':\\n dic[(i,j)]=0\\n else:\\n dic[(i,j)]=dp(i,j)\\n if maxi<dic[(i,j)]:\\n maxi=dic[(i,j)]\\n return maxi**2\",\n \"memory\": \"36075\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n \\n memo = {}\\n\\n def in_bounds(point):\\n r, c = point\\n return 0 <= r < len(matrix) and 0 <= c < len(matrix[0])\\n\\n def max_square_side(point):\\n if point in memo:\\n return memo[point]\\n if not in_bounds(point):\\n return 0\\n\\n memo[point] = 0\\n r, c = point\\n\\n moves = [(r,c+1),(r+1,c+1),(r+1,c)]\\n child_square_sizes = [max_square_side(move) for move in moves]\\n\\n if matrix[r][c] == '1':\\n memo[point] = 1 + min(child_square_sizes)\\n\\n return memo[point]\\n max_square_side((0,0))\\n\\n print(memo)\\n return max(memo.values()) ** 2\\n\",\n \"memory\": \"36625\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n \\n max_area = 0\\n n, m = len(matrix), len(matrix[0])\\n\\n @functools.lru_cache(maxsize=None)\\n def get_largest_square(i, j):\\n if i == n or j == m:\\n return 0\\n if matrix[i][j] == \\\"0\\\":\\n return 0\\n \\n min_ = 1 + min(get_largest_square(i+1, j), get_largest_square(i, j+1))\\n inside_squares = [min_] + [l + get_largest_square(i+l, j+l) for l in range(1, min_)]\\n return min(inside_squares)\\n\\n max_area = 0\\n for i in range(n):\\n for j in range(m):\\n if matrix[i][j] != \\\"1\\\":\\n continue\\n max_area = max(max_area,get_largest_square(i, j)**2)\\n \\n return max_area\",\n \"memory\": \"36625\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n n,m = len(matrix), len(matrix[0])\\n\\n @cache\\n def dfs(i, j):\\n if not (0<= i <n and 0 <= j < m and matrix[i][j] == '1'): return 0\\n curr = float('inf')\\n for x,y in [i+1,j], [i+1, j+1], [i, j+1]:\\n curr = min(curr, 1 + dfs(x,y))\\n return curr\\n\\n ans = 0\\n for i in range(n):\\n for j in range(m):\\n if matrix[i][j] == '1':\\n ans = max(ans, dfs(i, j))\\n \\n return ans * ans\",\n \"memory\": \"37175\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n # returns area of largest square of ones\\n # naive: we could go through all lengths and check if square exists of that lengtn\\n # can binary search it due to monolicity\\n # 0 -> n\\n # for each possible side len, loop all squares but also sum up all boxes in square? kinda slow. n*n*i*i\\n # square is good if sum inside is i*i, can easily get that with prefix summing\\n # finally, bounds of loop for i: i=side_len-1 -> end j= side_len-1 -> end\\n n,m = len(matrix), len(matrix[0])\\n if not n and not m:\\n return 0\\n prefix_sums = {} # use subproblem\\n prefix_sums[(0,0)] = int(matrix[0][0])\\n prefix_sums[(-1,-1)] = 0\\n prefix_sums[(0,-1)] = 0\\n prefix_sums[(-1,0)] = 0\\n for c in range(1, m):\\n prefix_sums[(0,c)] = prefix_sums[(0,c-1)]+int(matrix[0][c])\\n prefix_sums[(-1,c)] = 0\\n for r in range(1,n):\\n prefix_sums[(r,0)] = prefix_sums[(r-1,0)]+int(matrix[r][0])\\n prefix_sums[(r,-1)] = 0\\n for i in range(1,n):\\n for j in range(1,m):\\n prefix_sums[(i,j)] = prefix_sums[(i-1,j)]+prefix_sums[(i,j-1)]-prefix_sums[(i-1,j-1)]+int(matrix[i][j])\\n def is_filled_with_ones(i,j,side_len):\\n #print(i,j,side_len)\\n #print(prefix_sums)\\n # if (i,j) == (2,4):\\n #print(f\\\"sum at 2,3 {prefix_sums[(i,j)]-prefix_sums[(i-side_len,j)]-prefix_sums[(i,j-side_len)]+prefix_sums[(i-side_len,j-side_len)]}\\\")\\n return (prefix_sums[(i,j)]-prefix_sums[(i-side_len,j)]-prefix_sums[(i,j-side_len)]+prefix_sums[(i-side_len,j-side_len)]) == (side_len * side_len)\\n def condition(side_len):\\n for i in range(side_len-1, n):\\n for j in range(side_len-1, m):\\n if is_filled_with_ones(i,j,side_len):\\n return True\\n return False # is not exist 11-2-7=2+2 = 4\\n l, r = 0, min(n,m)\\n while l < r:\\n mid = (l+r+1)//2\\n #print(\\\"m is condition is \\\", mid, condition(mid))\\n if condition(mid): # if exist\\n l = mid\\n else: # exitisth\\n r = mid-1\\n return l*l\\n \",\n \"memory\": \"37175\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n \\n R, C = len(matrix), len(matrix[0])\\n directions = [(1, 0), (0, 1), (1, 1)] # Diagonal down and to the right\\n max_length = 0\\n memo = {}\\n\\n def dfs(r, c):\\n if r >= R or r < 0 or c >= C or c < 0 or matrix[r][c] == \\\"0\\\":\\n return 0\\n if (r, c) in memo:\\n return memo[(r, c)]\\n\\n # Calculate size of square\\n down, right, diag = [dfs(r+dr, c+dc) for dr, dc in directions]\\n length = min(down, right, diag) + 1\\n memo[(r, c)] = length\\n return memo[(r, c)]\\n \\n for r in range(R):\\n for c in range(C):\\n if matrix[r][c] == \\\"1\\\":\\n max_length = max(max_length, dfs(r, c))\\n \\n return max_length ** 2\\n\\n\\n# T: O(RC)\\n# S: O(RC)\\n \",\n \"memory\": \"37725\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n cache = {} # (r, c) : side len of squares\\n def recurse_helper(r, c):\\n # check base cases\\n if (r,c) in cache:\\n return cache[(r,c)]\\n # solve recursively\\n options = []\\n if r + 1 < len(matrix):\\n options.append(recurse_helper(r+1, c))\\n else:\\n options.append(0)\\n if c + 1 < len(matrix[0]):\\n options.append(recurse_helper(r, c+1))\\n else:\\n options.append(0)\\n if r + 1 < len(matrix) and c + 1 < len(matrix[0]):\\n options.append(recurse_helper(r+1, c+1))\\n else:\\n options.append(0)\\n sol = min(options) + 1\\n if matrix[r][c] == \\\"0\\\":\\n sol = 0\\n cache[(r, c)] = sol\\n return sol\\n recurse_helper(0, 0)\\n return max(cache.values()) ** 2\\n \\n\\n\",\n \"memory\": \"37725\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n cache = {} # (r, c) : side len of squares\\n def recurse_helper(r, c):\\n # check base cases\\n if (r,c) in cache:\\n return cache[(r,c)]\\n # solve recursively\\n options = []\\n if r + 1 < len(matrix):\\n options.append(recurse_helper(r+1, c))\\n else:\\n options.append(0)\\n if c + 1 < len(matrix[0]):\\n options.append(recurse_helper(r, c+1))\\n else:\\n options.append(0)\\n if r + 1 < len(matrix) and c + 1 < len(matrix[0]):\\n options.append(recurse_helper(r+1, c+1))\\n else:\\n options.append(0)\\n # add to cache\\n sol = min(options) + 1\\n if matrix[r][c] == \\\"0\\\":\\n sol = 0\\n cache[(r, c)] = sol\\n return sol\\n recurse_helper(0, 0)\\n return max(cache.values()) ** 2\\n \\n\\n\",\n \"memory\": \"38275\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n def isSquare(m, n, s):\\n # check whether square chould expand from (m+s-1, n+s-1) -> (m+s,n+s)\\n # return true or false, and area of the current square\\n for i in range(s):\\n \\n if matrix[m+i][n+s-1] == \\\"0\\\" or matrix[m+s-1][n+i] == \\\"0\\\":\\n \\n return False, (s-1) ** 2\\n return True, (s) ** 2\\n\\n \\n memo = {}\\n max_area = 0\\n print(len(matrix), len(matrix[0]))\\n \\n def dp(m, n):\\n nonlocal max_area\\n\\n \\n\\n if m == len(matrix) or n == len(matrix[0]):\\n #print(m, n)\\n return 0\\n if (m,n) in memo:\\n return memo[(m,n)]\\n #print(\\\"check 0\\\",\\\"row = \\\", m, \\\"col = \\\",n, \\\"element = \\\", matrix[m][n])\\n\\n if matrix[m][n] == \\\"0\\\":\\n #print(\\\"check 1\\\",\\\"row = \\\", m, \\\"col = \\\",n, matrix[m][n])\\n\\n ans = max(dp(m+1,n), dp(m,n+1))\\n \\n else:\\n s = 1\\n curr_area = 1\\n \\n while m + s - 1 < len(matrix) and n+s-1 < len(matrix[0]):\\n #print(\\\"check 2\\\",\\\"row = \\\", m, \\\"col = \\\",n, matrix[m][n], \\\"area =\\\",curr_area)\\n flag, curr_area = isSquare(m, n, s)\\n if not flag:\\n break\\n s += 1\\n \\n \\n max_area = max(max_area, curr_area)\\n #print(\\\"max_area =\\\", max_area)\\n if curr_area == (len(matrix)-1)**2:\\n #print(\\\"check 3\\\")\\n ans = 0\\n\\n\\n else:\\n #print(\\\"check 4\\\")\\n ans = max(dp(m, n + 1), dp(m + 1, n))\\n \\n memo[(m,n)] = ans\\n \\n return ans\\n\\n dp(0, 0)\\n \\n return max_area\\n \\n \\n \\n \\n \\n \",\n \"memory\": \"38825\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n visited = {}\\n max_square = 0\\n def dfs(r, c):\\n nonlocal max_square\\n if r >= 0 and r < len(matrix) and c >= 0 and c < len(matrix[r]) and matrix[r][c] == \\\"1\\\":\\n if (r, c) in visited:\\n return visited[(r, c)]\\n\\n min_size = math.inf\\n for dr, dc in [[0, 1], [1, 0]]:\\n min_size = min(min_size, dfs(r + dr, c + dc))\\n if matrix[r + min_size][c + min_size] == \\\"1\\\":\\n max_square = max(max_square, (min_size + 1) * (min_size + 1))\\n visited[(r, c)] = min_size + 1\\n return min_size + 1\\n max_square = max(max_square, min_size if min_size else 1)\\n visited[(r, c)] = min_size if min_size else 1\\n return min_size if min_size else 1\\n return 0\\n\\n max_square = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[i])):\\n if (i, j) not in visited and matrix[i][j] == \\\"1\\\":\\n dfs(i, j)\\n\\n return max_square\",\n \"memory\": \"38825\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n dp = np.zeros((m,n))\\n for i in range(m):\\n dp[i][0] = int(matrix[i][0])\\n for j in range(n):\\n dp[0][j] = int(matrix[0][j])\\n res1 = np.max(dp[0, :])\\n res2 = np.max(dp[:,0])\\n res = max([res1, res2])\\n for i in range(1, m):\\n for j in range(1, n):\\n if matrix[i][j]=='1':\\n side2 = min([dp[i-1][j-1], dp[i][j-1], dp[i-1][j]])\\n dp[i][j] = (np.sqrt(side2)+1)**2\\n res = max(res, dp[i][j])\\n \\n return int(res)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # m, n = len(matrix), len(matrix[0])\\n # dp = [[0]*(n+1) for i in range(m+1)]\\n # res = 0\\n # for i in range(m):\\n # for j in range(n):\\n # if matrix[i][j]==\\\"1\\\":\\n # dp[i+1][j+1]==1\\n # dp[i+1][j+1] = (np.sqrt(min([dp[i][j],dp[i+1][j], dp[i][j+1] ]))+1)**2\\n # res = max(res, dp[i+1][j+1])\\n # #print(dp)\\n # return int(res)\\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 # for i in range(m):\\n # for j in range(n):\\n # if matrix[i][j]=='1':\\n # dp[i+1][j+1] = (sqrt(min([dp[i][j], dp[i+1][j], dp[i][j+1]]))+1)**2\\n # if dp[i+1][j+1]>res:\\n # res = dp[i+1][j+1]\\n # return int(res)\\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 # m1 = np.zeros((m, n), dtype=int)\\n # res = 0\\n # for i in range(m):\\n # m1[i][0] = int(matrix[i][0])\\n # res = max(res, m1[i][0])\\n # for j in range(n):\\n # m1[0][j] = int(matrix[0][j])\\n # res = max(res, m1[0][j])\\n # #print(res)\\n # for i in range(1, m):\\n # for j in range(1, n):\\n # if int(matrix[i][j]) == 1:\\n # res1 = min([m1[i][j-1], m1[i-1][j-1], m1[i-1][j]]) + 1\\n # m1[i][j] = res1\\n # res = max(res, res1)\\n # print(m1)\\n # return res*res\\n\",\n \"memory\": \"39375\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n cache = {} # (r, c) : side len of squares\\n @lru_cache\\n def recurse_helper(r, c):\\n # check base cases\\n if (r,c) in cache:\\n return cache[(r,c)]\\n # solve recursively\\n options = []\\n if r + 1 < len(matrix):\\n options.append(recurse_helper(r+1, c))\\n else:\\n options.append(0)\\n if c + 1 < len(matrix[0]):\\n options.append(recurse_helper(r, c+1))\\n else:\\n options.append(0)\\n if r + 1 < len(matrix) and c + 1 < len(matrix[0]):\\n options.append(recurse_helper(r+1, c+1))\\n else:\\n options.append(0)\\n # add to cache\\n sol = min(options) + 1\\n if matrix[r][c] == \\\"0\\\":\\n sol = 0\\n cache[(r, c)] = sol\\n return sol\\n recurse_helper(0, 0)\\n return max(cache.values()) ** 2\\n \\n\\n\",\n \"memory\": \"39925\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n cache = {} # (r, c) : side len of squares\\n @lru_cache\\n def recurse_helper(r, c):\\n # check base cases\\n if (r,c) in cache:\\n return cache[(r,c)]\\n # solve recursively\\n options = []\\n if r + 1 < len(matrix):\\n options.append(recurse_helper(r+1, c))\\n else:\\n options.append(0)\\n if c + 1 < len(matrix[0]):\\n options.append(recurse_helper(r, c+1))\\n else:\\n options.append(0)\\n if r + 1 < len(matrix) and c + 1 < len(matrix[0]):\\n options.append(recurse_helper(r+1, c+1))\\n else:\\n options.append(0)\\n # add to cache\\n sol = min(options) + 1\\n if matrix[r][c] == \\\"0\\\":\\n sol = 0\\n cache[(r, c)] = sol\\n return sol\\n recurse_helper(0, 0)\\n return max(cache.values()) ** 2\\n \\n\\n\",\n \"memory\": \"39925\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n curr_size = 1\\n square_locs = {(r, c) for r in range(m) for c in range(n) if matrix[r][c] == '1'}\\n if not square_locs:\\n return 0\\n if len(square_locs) == m * n:\\n return min(m, n) ** 2\\n while True:\\n new_square_locs = set() # edge len + 1\\n for r, c in square_locs:\\n if all(corners in square_locs for corners in [(r + 1, c), (r, c + 1), (r + 1, c + 1)]):\\n new_square_locs.add((r, c))\\n if new_square_locs:\\n curr_size += 1\\n square_locs = new_square_locs\\n else:\\n break\\n \\n return curr_size ** 2\\n\\n\\n'''\\nprefix sums?\\n90000 area total\\n\\ndumb:\\n4 squares with tl corner in 2x2 can make a new bigger square\\n\\nfind all 1x1, store r, c tuples in set\\n2x2: for all tl of 1x1, see if tl of a 2x2\\n\\nmax len 300, 300 * 90000 = 27,000,000 should be fast enough\\n'''\",\n \"memory\": \"40475\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n\\n m, n = len(matrix), len(matrix[0])\\n\\n new_square = [['0']+row for row in matrix]\\n new_square.insert(0, ['0']*(n+1))\\n\\n maximal = 0\\n\\n # Hashmap (i, j) -> (square_size, top_col, left_col)\\n map = {}\\n\\n for i in range(m+1):\\n for j in range(n+1):\\n\\n if new_square[i][j] == '0':\\n map[(i, j)] = (0, 0, 0)\\n\\n else: \\n top_col = 1 + map[(i-1, j)][1]\\n left_col = 1 + map[(i, j-1)][2]\\n prev_square_size = map[(i-1, j-1)][0]\\n\\n square_size = min([1+prev_square_size, top_col, left_col])\\n map[(i, j)] = (square_size, top_col, left_col)\\n\\n if square_size > maximal:\\n maximal = square_size\\n\\n\\n return maximal**2\",\n \"memory\": \"41025\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n # have an is_square set with top right (x, y) as well as length \\n # starts with (0, 0, 0), etc to (2, 1, 1)\\n # checking for 2x2 onward by going thru all possible ones and asking for 4 checks\\n # then goes onto nxn\\n height = len(matrix)\\n width = len(matrix[0])\\n\\n valids = set()\\n for i in range(height):\\n for j in range(width):\\n if matrix[i][j] == \\\"1\\\":\\n valids.add((i, j))\\n\\n if not valids:\\n return 0\\n for side in range(1, min(height, width)):\\n new_valids = set()\\n for i in range(height - side + 1):\\n for j in range(width - side + 1):\\n if (i, j) in valids and (i+1, j) in valids and (i, j+1) in valids and (i+1, j+1) in valids:\\n new_valids.add((i, j))\\n \\n if len(new_valids) < 4:\\n if len(new_valids) > 0:\\n return (side + 1)**2\\n else:\\n return side ** 2\\n valids = new_valids\\n \\n return min(height, width)**2\\n \",\n \"memory\": \"41025\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n \\n memo = {}\\n def dp(i,j):\\n if i >= len(matrix) or j >= len(matrix[0]):\\n return 0\\n\\n key = \\\"{}-{}\\\".format(i,j)\\n if key in memo:\\n return memo[key]\\n \\n min_square = 0\\n if matrix[i][j] == '1':\\n min_square = min(dp(i+1, j), dp(i,j+1), dp(i+1,j+1))+1\\n \\n memo[key] = min_square\\n\\n return memo[key]\\n \\n max_square = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n max_square = max(max_square, dp(i,j))\\n\\n return max_square ** 2\",\n \"memory\": \"41575\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n memo = {}\\n\\n def dfs(i, j):\\n if 0<=i<m and 0<=j<n:\\n if i == m-1 and j == n-1:\\n memo[(i, j)] = int(matrix[i][j])\\n return memo[(i, j)]\\n if (i, j) in memo:\\n return memo[(i, j)]\\n area = float('inf')\\n for x, y in [(1, 0), (0, 1), (1, 1)]:\\n x0, y0 = i+x, j+y\\n childArea = dfs(x0, y0)\\n area = min(childArea, area)\\n memo[(i, j)] = area+1 if int(matrix[i][j]) else 0\\n return memo[(i, j)]\\n memo[(i, j)] = 0\\n return 0\\n \\n dfs(0, 0)\\n return max(memo.values())**2\",\n \"memory\": \"42125\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, grid: List[List[str]]) -> int:\\n dirs = [\\n (0, 1),\\n (1, 1),\\n (1, 0)\\n ]\\n bfs = [(0,0)]\\n\\n h = len(grid)\\n w = len(grid[0])\\n\\n for y in range(h):\\n for x in range(w):\\n for dy, dx in dirs:\\n if y + dy < h and x + dx < w: \\n bfs.append((y + dy, x + dx))\\n total = 0\\n for y,x in reversed(bfs):\\n if (grid[y][x] != \\\"0\\\"):\\n m = float('inf')\\n for dy, dx in dirs:\\n if y + dy < h and x + dx < w: \\n m = min(m, int(grid[y + dy][x + dx]))\\n else:\\n m = 0\\n if (m == float('inf')):\\n m = int(grid[y][x]) -1\\n\\n grid[y][x] = str(m + 1)\\n total = max(total, m + 1)\\n \\n # for g in grid:\\n # print(g)\\n\\n return total * total\",\n \"memory\": \"42675\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows = len(matrix)\\n cols = len(matrix[0])\\n\\n to_downs = {}\\n cache = {}\\n\\n sz_max = 0\\n for y in reversed(range(rows)):\\n to_right = 0\\n for x in reversed(range(cols)):\\n is_one = matrix[y][x] == \\\"1\\\"\\n if not is_one:\\n to_right = 0\\n continue\\n \\n max_width = to_right + 1\\n max_height = to_downs.get((x, y + 1), 0) + 1\\n to_downs[(x, y)] = max_height\\n to_right = max_width\\n\\n max_sz = min(max_width, max_height)\\n max_sub = cache.get((x + 1, y + 1), 0)\\n sz = max(is_one, min(max_sz, max_sub + 1))\\n cache[(x, y)] = sz\\n sz_max = max(sz_max, sz)\\n return sz_max ** 2\",\n \"memory\": \"43225\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n memo = {} # (i, j):maxSquare\\n def dfs(i, j):\\n # out of bound or '0' in matrix, return 0\\n # base case - last row, col\\n # if in memo, return memo[pos]\\n if i >= len(matrix) or j >= len(matrix[0]):\\n return 0\\n if i == len(matrix) - 1 or j == len(matrix[0]) - 1 or matrix[i][j] == '0':\\n memo[(i, j)] = int(matrix[i][j])\\n return memo[(i, j)]\\n if (i, j) in memo:\\n return memo[(i, j)]\\n\\n # i, j itself 0 -> 0\\n # if one of the neighbor is '0' -> store and return the matrix[i][j] itself\\n minSquare = float('inf')\\n for dr, dc in [(1, 0), (0, 1), (1, 1)]:\\n nei = dfs(i + dr, j + dc)\\n if nei == 0:\\n memo[(i, j)] = int(matrix[i][j])\\n return memo[(i, j)]\\n minSquare = min(minSquare, nei)\\n # max square of (i, j) -> min(minSquare of neighbor) + 1\\n memo[(i, j)] = minSquare + 1\\n return memo[(i, j)]\\n \\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n dfs(r, c) # being top left start point\\n\\n # iterate through memo to get max square\\n maxSquare = 0\\n for r, c in memo:\\n maxSquare = max(maxSquare, memo[(r, c)])\\n return maxSquare * maxSquare\",\n \"memory\": \"43775\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n m = len(matrix)\\n n = len(matrix[0])\\n directions = [(0, 1), (1, 0), (1, 1)]\\n \\n @cache\\n def dp(i, j):\\n if i >= m or i < 0 or j >= n or j < 0:\\n return 0\\n \\n if matrix[i][j] == \\\"0\\\":\\n return 0\\n\\n res = 1\\n add = float('inf')\\n for di, dj in directions:\\n ni, nj = i + di, j + dj\\n add = min(add, dp(ni, nj))\\n \\n return res + add\\n \\n ans = 0\\n for i in range(m):\\n for j in range(n):\\n ans = max(ans, dp(i, j))\\n\\n return ans*ans\\n\\n\",\n \"memory\": \"44325\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n m = len(matrix)\\n n = len(matrix[0])\\n directions = [(0, 1), (1, 0), (1, 1)]\\n \\n @cache\\n def dp(i, j):\\n if i >= m or i < 0 or j >= n or j < 0:\\n return 0\\n \\n if matrix[i][j] == \\\"0\\\":\\n return 0\\n\\n res = 1\\n add = float('inf')\\n for di, dj in directions:\\n ni, nj = i + di, j + dj\\n add = min(add, dp(ni, nj))\\n \\n return res + add\\n \\n ans = 0\\n for i in range(m):\\n for j in range(n):\\n ans = max(ans, dp(i, j))\\n\\n return ans*ans\\n\\n\",\n \"memory\": \"44875\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix[0])\\n n = len(matrix)\\n M = np.array([[int(matrix[i][j]) for i in range(n)] for j in range(m)]).T\\n dic = {}\\n dp = np.zeros((n, m))\\n maxi = 0\\n for i in range(n):\\n for j in range(m):\\n if M[i, j] == 0:\\n dp[i, j] = 0\\n \\n else:\\n if (i, j) in dic:\\n dp[i, j] = dic[(i, j)]\\n else:\\n dp[i, j] = 1 + min(dp[i-1, j], dp[i, j-1], dp[i-1, j-1])\\n dic[(i, j)] = dp[i, j]\\n \\n return int(np.max(dp))**2\\n \",\n \"memory\": \"45425\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix[0])\\n n = len(matrix)\\n M = np.array([[int(matrix[i][j]) for i in range(n)] for j in range(m)]).T\\n dic = {}\\n dp = np.zeros((n, m))\\n maxi = 0\\n for i in range(n):\\n for j in range(m):\\n if M[i, j] == 0:\\n dp[i, j] = 0\\n\\n elif i == 0 and j == 0:\\n dp[i, j] = M[i, j]\\n\\n elif i == 0 and j > 0:\\n dp[i, j] = np.max(M[0, :j+1])\\n\\n elif j == 0 and i > 0:\\n dp[i, j] = np.max(M[:i+1, 0])\\n \\n else:\\n if (i, j) in dic:\\n dp[i, j] = dic[(i, j)]\\n else:\\n dp[i, j] = 1 + min(dp[i-1, j], dp[i, j-1], dp[i-1, j-1])\\n dic[(i, j)] = dp[i, j]\\n \\n return int(np.max(dp))**2\",\n \"memory\": \"45975\"\n },\n {\n \"code\": \"from numbers import Complex\\nfrom functools import cache\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n grid = {\\n complex(i, j)\\n for i, row in enumerate(matrix)\\n for j, value in enumerate(row)\\n if value == \\\"1\\\"\\n }\\n\\n @cache\\n def max_side_length(top_left: Complex) -> bool:\\n if top_left not in grid:\\n return 0\\n\\n return 1 + min(\\n max_side_length(top_left + delta)\\n for delta in (1, 1 + 1j, 1j)\\n )\\n\\n return max(\\n (max_side_length(top_left)**2 for top_left in grid),\\n default=0,\\n )\",\n \"memory\": \"46525\"\n },\n {\n \"code\": \"from copy import deepcopy\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n def max_square(start_coords, max_size) -> int:\\n\\n neighbours = set()\\n\\n for x, y in start_coords:\\n\\n next_row = x + max_size\\n next_col = y + max_size\\n\\n coords = set()\\n for i in range(x, next_row+1):\\n coords.add((i, next_col))\\n\\n for i in range(y, next_col+1):\\n coords.add((next_row, i))\\n\\n for r, c in coords:\\n if r >= 0 and r < ROWS and c >= 0 and c < COLS and (r,c) not in zeros:\\n neighbours.add((r,c))\\n else:\\n return max_size\\n \\n return max_square(start_coords, max_size + 1)\\n \\n ROWS = len(matrix)\\n COLS = len(matrix[0])\\n\\n ones = dict()\\n zeros = set()\\n\\n for i in range(ROWS):\\n for j in range(COLS):\\n\\n matrix[i][j] = int(matrix[i][j])\\n\\n if matrix[i][j] == 0:\\n zeros.add((i,j))\\n\\n if matrix[i][j] == 1:\\n ones[(i,j)] = 1\\n\\n\\n for start in list(ones.keys()):\\n size = ones[start]\\n start_x, start_y = start\\n\\n if start_x + size -1 >= ROWS or start_y + size -1 >= COLS:\\n continue\\n\\n max_length = max_square({start}, size)\\n # Cache\\n if max_length > size:\\n for i in range(start[0], start[0]+max_length-size+1):\\n for j in range(start[1], start[1]+max_length-size+1):\\n ones[(i,j)] = max_length - max(i-start[0], j-start[1])\\n # print(start, i, j, size, max_length)\\n\\n \\n if not ones:\\n return 0\\n\\n return max(ones.values())**2\\n \\n\\n \",\n \"memory\": \"47625\"\n },\n {\n \"code\": \"from collections import defaultdict as DD\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n h=len(matrix)\\n w=len(matrix[0])\\n dp,vert,horz = DD(int),DD(int),DD(int)\\n ans = 0\\n for i in range(h-1,-1,-1):\\n for j in range(w-1,-1,-1):\\n if matrix[i][j] == \\\"1\\\":\\n right = horz[i,j+1]\\n down = vert[i+1,j]\\n horz[i,j] = 1 + right\\n vert[i,j] = 1 + down\\n sub = dp[i+1,j+1]\\n dp[i,j] = 1 + min(right, down, sub)\\n ans = max(ans, dp[i,j])\\n return ans**2\\n\\n\\n\\n\",\n \"memory\": \"48175\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n self.matrix = matrix\\n self.square_cache = {}\\n self.hor_cache = {}\\n self.ver_cache = {}\\n\\n output = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n curr = self.maximalSquareEndingAt(i, j)\\n if curr > output:\\n output = curr\\n return output**2\\n\\n def maximalSquareEndingAt(self, i, j):\\n cache = self.square_cache\\n matrix = self.matrix\\n # print(cache)\\n if (i, j) in cache:\\n return cache[(i, j)]\\n\\n if i < 0 or j < 0:\\n return 0\\n val = matrix[i][j]\\n if val == \\\"0\\\":\\n return 0\\n \\n maximalSquareNeighbor = self.maximalSquareEndingAt(i-1, j-1)\\n longestHorizontalLeft = self.longestHorizontalEndingAt(i, j-1)\\n longestVerticalAbove = self.longestVerticalEndingAt(i-1, j)\\n output = 1 + min(\\n maximalSquareNeighbor,\\n longestHorizontalLeft,\\n longestVerticalAbove,\\n )\\n cache[(i, j)] = output\\n return output \\n\\n def longestHorizontalEndingAt(self, i, j):\\n cache = self.hor_cache\\n matrix = self.matrix\\n if (i, j) in cache:\\n return cache[(i, j)]\\n if j < 0:\\n return 0\\n val = matrix[i][j]\\n if val == \\\"0\\\":\\n return 0\\n \\n output = 1 + self.longestHorizontalEndingAt(i, j-1)\\n cache[(i, j)] = output\\n return output\\n\\n def longestVerticalEndingAt(self, i, j):\\n cache = self.ver_cache\\n matrix = self.matrix\\n if (i, j) in cache:\\n return cache[(i, j)]\\n if i < 0:\\n return 0\\n val = matrix[i][j]\\n if val == \\\"0\\\":\\n return 0\\n \\n output = 1 + self.longestVerticalEndingAt(i-1, j)\\n cache[(i, j)] = output\\n return output\\n\",\n \"memory\": \"48725\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows = len(matrix)\\n cols = len(matrix[0])\\n\\n to_rights = {}\\n to_downs = {}\\n cache = {}\\n\\n sz_max = 0\\n for y in reversed(range(rows)):\\n for x in reversed(range(cols)):\\n is_one = matrix[y][x] == \\\"1\\\"\\n if is_one:\\n max_width = to_rights.get((x + 1, y), 0) + 1\\n max_height = to_downs.get((x, y + 1), 0) + 1\\n else:\\n max_width, max_height = 0, 0\\n to_rights[(x, y)] = max_width\\n to_downs[(x, y)] = max_height\\n\\n max_sz = min(max_width, max_height)\\n max_sub = cache.get((x + 1, y + 1), 0)\\n sz = max(is_one, min(max_sz, max_sub + 1))\\n cache[(x, y)] = sz\\n sz_max = max(sz_max, sz)\\n return sz_max ** 2\",\n \"memory\": \"49275\"\n },\n {\n \"code\": \"'''\\n\\nBrute force solution:\\n- Scan each position\\n- Keep expanding the squares outwards...\\n\\nO(n^4) assuming a square input matrix.\\n\\nDP:\\n- largest[i,j] =\\n if mat[i][j] = 0\\n 0\\n else:\\n res = 1\\n expansion_width = min(largest[i+1, j+1], right[i+1, j], down[i, j+1])\\n if expansion_width > 0:\\n res = (expansion_width + 1) ** 2\\n\\n'''\\n\\ndef right(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\\n if not 0 <= i < len(mat):\\n return 0\\n if not 0 <= j < len(mat[0]):\\n return 0\\n \\n if mat[i][j] == '0':\\n return 0\\n\\n key = ('right', i, j)\\n if key in cache:\\n return cache[key]\\n \\n res = 1 + right(mat, i, j+1, cache)\\n\\n cache[key] = res\\n return res\\n\\ndef down(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\\n if not 0 <= i < len(mat):\\n return 0\\n if not 0 <= j < len(mat[0]):\\n return 0\\n \\n if mat[i][j] == '0':\\n return 0\\n \\n key = ('down', i, j)\\n if key in cache:\\n return cache[key]\\n \\n res = 1 + down(mat, i+1, j, cache)\\n\\n cache[key] = res\\n return res\\n\\ndef largest(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\\n if not 0 <= i < len(mat):\\n return 0\\n if not 0 <= j < len(mat[0]):\\n return 0\\n\\n if mat[i][j] == '0':\\n return 0\\n \\n key = ('largest', i, j)\\n if key in cache:\\n return cache[key]\\n\\n res = 1\\n res += min(\\n largest(mat, i+1, j+1, cache),\\n min(\\n right(mat, i, j+1, cache),\\n down(mat, i+1, j, cache)\\n )\\n )\\n\\n cache[key] = res\\n return res\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n best = 0\\n cache = {}\\n for i in range(len(matrix)):\\n for j in range(len(matrix[i])):\\n best = max(best, largest(matrix, i, j, cache) ** 2)\\n return best\\n\\n'''\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\",\\\"0\\\",\\\"0\\\"]\\n[\\\"0\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\",\\\"0\\\",\\\"0\\\"]\\n'''\",\n \"memory\": \"49825\"\n },\n {\n \"code\": \"'''\\n\\nBrute force solution:\\n- Scan each position\\n- Keep expanding the squares outwards...\\n\\nO(n^4) assuming a square input matrix.\\n\\nDP:\\n- largest[i,j] =\\n if mat[i][j] = 0\\n 0\\n else:\\n res = 1\\n expansion_width = min(largest[i+1, j+1], right[i+1, j], down[i, j+1])\\n if expansion_width > 0:\\n res = (expansion_width + 1) ** 2\\n\\n'''\\n\\ndef right(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\\n if not 0 <= i < len(mat):\\n return 0\\n if not 0 <= j < len(mat[0]):\\n return 0\\n \\n if mat[i][j] == '0':\\n return 0\\n\\n key = (1, i, j)\\n if key in cache:\\n return cache[key]\\n \\n res = 1 + right(mat, i, j+1, cache)\\n\\n cache[key] = res\\n return res\\n\\ndef down(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\\n if not 0 <= i < len(mat):\\n return 0\\n if not 0 <= j < len(mat[0]):\\n return 0\\n \\n if mat[i][j] == '0':\\n return 0\\n \\n key = (2, i, j)\\n if key in cache:\\n return cache[key]\\n \\n res = 1 + down(mat, i+1, j, cache)\\n\\n cache[key] = res\\n return res\\n\\ndef largest(mat: list[list[str]], i: int, j: int, cache: dict[tuple[str, int, int], int]) -> int:\\n if not 0 <= i < len(mat):\\n return 0\\n if not 0 <= j < len(mat[0]):\\n return 0\\n\\n if mat[i][j] == '0':\\n return 0\\n \\n key = (0, i, j)\\n if key in cache:\\n return cache[key]\\n\\n res = 1\\n res += min(\\n largest(mat, i+1, j+1, cache),\\n min(\\n right(mat, i, j+1, cache),\\n down(mat, i+1, j, cache)\\n )\\n )\\n\\n cache[key] = res\\n return res\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n best = 0\\n cache = {}\\n for i in range(len(matrix)):\\n for j in range(len(matrix[i])):\\n best = max(best, largest(matrix, i, j, cache) ** 2)\\n return best\\n\\n'''\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\"]\\n[\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\",\\\"0\\\",\\\"0\\\"]\\n[\\\"0\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"0\\\",\\\"0\\\",\\\"0\\\"]\\n'''\",\n \"memory\": \"49825\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n # maximal_len = m if m < n else n\\n target_len = 1\\n bad_starting_squares = set()\\n def find_square(coord: tuple):\\n searched_squares = set()\\n if coord[0] + target_len > m:\\n return None\\n if coord[1] + target_len > n:\\n return None\\n for i in range(coord[0], coord[0] + target_len):\\n for j in range(coord[1], coord[1] + target_len):\\n if matrix[i][j] == \\\"0\\\":\\n bad_starting_squares.add((i, j))\\n bad_starting_squares.add(coord)\\n return False\\n return True\\n def solution():\\n nonlocal target_len\\n nonlocal bad_starting_squares\\n found = False\\n for i in range(m):\\n for j in range(n):\\n if (i, j) in bad_starting_squares:\\n continue\\n found = find_square((i, j))\\n if found:\\n target_len += 1\\n return solution()\\n if found is None:\\n bad_starting_squares.add((i, j))\\n if not found:\\n return (target_len - 1)**2\\n \\n return solution()\\n\",\n \"memory\": \"50375\"\n },\n {\n \"code\": \"class Solution:\\n\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n self.matrix = matrix\\n self.square_cache = {}\\n self.hor_cache = {}\\n self.ver_cache = {}\\n\\n output = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n curr = self.maximalSquareEndingAt(i, j)\\n if curr > output:\\n output = curr\\n return output**2\\n\\n @lru_cache\\n def maximalSquareEndingAt(self, i, j):\\n cache = self.square_cache\\n matrix = self.matrix\\n # print(cache)\\n if (i, j) in cache:\\n return cache[(i, j)]\\n\\n if i < 0 or j < 0:\\n return 0\\n val = matrix[i][j]\\n if val == \\\"0\\\":\\n return 0\\n \\n maximalSquareNeighbor = self.maximalSquareEndingAt(i-1, j-1)\\n longestHorizontalLeft = self.longestHorizontalEndingAt(i, j-1)\\n longestVerticalAbove = self.longestVerticalEndingAt(i-1, j)\\n output = 1 + min(\\n maximalSquareNeighbor,\\n longestHorizontalLeft,\\n longestVerticalAbove,\\n )\\n cache[(i, j)] = output\\n return output \\n\\n @lru_cache\\n def longestHorizontalEndingAt(self, i, j):\\n cache = self.hor_cache\\n matrix = self.matrix\\n if (i, j) in cache:\\n return cache[(i, j)]\\n if j < 0:\\n return 0\\n val = matrix[i][j]\\n if val == \\\"0\\\":\\n return 0\\n \\n output = 1 + self.longestHorizontalEndingAt(i, j-1)\\n cache[(i, j)] = output\\n return output\\n\\n @lru_cache\\n def longestVerticalEndingAt(self, i, j):\\n cache = self.ver_cache\\n matrix = self.matrix\\n if (i, j) in cache:\\n return cache[(i, j)]\\n if i < 0:\\n return 0\\n val = matrix[i][j]\\n if val == \\\"0\\\":\\n return 0\\n \\n output = 1 + self.longestVerticalEndingAt(i-1, j)\\n cache[(i, j)] = output\\n return output\\n\",\n \"memory\": \"50925\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n \\n memo = {'max':0}\\n def dp(row, col):\\n # base\\n if row < 0 or col < 0 or matrix[row][col] == '0':\\n return 0\\n if (row, col) not in memo:\\n ans = 1 + min(dp(row - 1, col - 1), dp(row - 1, col), dp(row, col -1))\\n memo[(row, col)] = ans\\n memo['max'] = max(memo['max'], ans)\\n return memo[(row, col)] \\n\\n for row in range(m):\\n for col in range(n):\\n dp(row, col)\\n \\n # print(*matrix, sep='\\\\n')\\n # print(memo)\\n return memo['max'] ** 2\\n \\n \",\n \"memory\": \"51475\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n def inbound(i, j):\\n return 0 <= i < len(matrix) and 0<= j < len(matrix[0])\\n \\n memo = {}\\n def dp(i, j):\\n if not inbound(i, j) or matrix[i][j] == '0':\\n return 0\\n if (i, j) in memo:\\n return memo[(i, j)]\\n \\n memo[(i, j)] = min(dp(i, j-1), dp(i-1, j), dp(i-1, j-1)) + 1\\n return memo[(i, j)]\\n \\n out = 0\\n for x in range(len(matrix)):\\n for y in range(len(matrix[0])):\\n out = max(out, dp(x, y))\\n \\n return out ** 2\",\n \"memory\": \"52025\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n \\n m, n = len(matrix), len(matrix[0])\\n memo = {}\\n max_side = 0\\n\\n def topdown(i, j):\\n if i == m or j == n or matrix[i][j] == '0':\\n return 0\\n if (i, j) in memo:\\n return memo[(i, j)]\\n \\n nonlocal max_side\\n\\n memo[(i, j)] = 1 + min(topdown(i + 1, j), topdown(i, j + 1), topdown(i + 1, j + 1))\\n max_side = max(max_side, memo[(i, j)])\\n \\n return memo[(i, j)]\\n \\n for i in range(m):\\n for j in range(n):\\n topdown(i, j)\\n\\n return max_side ** 2\",\n \"memory\": \"52575\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0]) \\n maxi = 0\\n dp = {}\\n def recurr(i, j):\\n nonlocal maxi\\n if i >= m or j >= n:\\n return 0\\n if (i, j) not in dp.keys():\\n right = recurr(i, j + 1)\\n bottom_right = recurr(i + 1, j + 1)\\n bottom = recurr(i + 1, j)\\n if matrix[i][j] == '0':\\n return 0\\n mini = min(right, bottom_right, bottom) + 1 \\n dp[(i, j)] = mini\\n maxi = max(maxi, mini)\\n return dp[(i, j)]\\n recurr(0,0)\\n return maxi ** 2\",\n \"memory\": \"52575\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n r, c = len(matrix), len(matrix[0])\\n\\n memo = {}\\n def dp(i, j):\\n if (i, j) in memo:\\n return memo[(i, j)]\\n\\n if i not in range(r) or j not in range(c):\\n return 0\\n \\n if matrix[i][j] == \\\"0\\\":\\n return 0\\n \\n res = (1 + min(\\n dp(i + 1, j), \\n dp(i, j + 1), \\n dp(i + 1, j + 1)\\n ))\\n memo[(i, j)] = res\\n return res\\n \\n res = 0\\n for i in range(r):\\n for j in range(c):\\n ans = dp(i, j)\\n res = max(res, ans ** 2)\\n\\n return res\\n\\n\\n \\n\\n \\n\\n \",\n \"memory\": \"53125\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n # from a position goes only to down or right contain all possibilities\\n dp = {}\\n m, n = len(matrix), len(matrix[0])\\n\\n def dfs(i, j):\\n if i >= m or j >= n or matrix[i][j] == '0':\\n return 0\\n if (i, j) in dp:\\n return dp[(i, j)]\\n \\n dp[(i, j)] = 1 + min(dfs(i+1, j), dfs(i, j+1), dfs(i+1, j+1))\\n\\n return dp[(i, j)]\\n ans = 0\\n for i in range(m):\\n for j in range(n):\\n ans = max(ans, dfs(i, j)**2)\\n \\n return ans\\n\",\n \"memory\": \"53125\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n memo={}\\n def ms(matrix,n=0,m=0,m1=False):\\n if m1==False:\\n m1=True\\n n=len(matrix)-1\\n m=len(matrix[0])-1\\n if (n,m) in memo : return memo[(n,m)]\\n if n==0 and m==0:\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n elif n==0:\\n ms(matrix,n,m-1,m1)\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n elif m==0:\\n ms(matrix,n-1,m,m1)\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n else: \\n value = int(matrix[n][m])\\n match value:\\n case 0: \\n ms(matrix,n,m-1,m1)\\n ms(matrix,n-1,m,m1)\\n ms(matrix,n-1,m-1,m1)\\n memo[(n,m)] = 0\\n case _:\\n memo[(n,m)]=min(ms(matrix,n,m-1,m1),ms(matrix,n-1,m,m1),ms(matrix,n-1,m-1,m1))+int(matrix[n][m])\\n return memo[(n,m)]\\n \\n ms(matrix)\\n print(memo)\\n max1=0\\n for i in memo:\\n if memo[i]>max1: max1=memo[i]\\n return max1**2\\n \",\n \"memory\": \"53675\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n memo={}\\n def ms(matrix,n=0,m=0,m1=False):\\n if m1==False:\\n m1=True\\n n=len(matrix)-1\\n m=len(matrix[0])-1\\n if (n,m) in memo : return memo[(n,m)]\\n if n==0 and m==0:\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n elif n==0:\\n ms(matrix,n,m-1,m1)\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n elif m==0:\\n ms(matrix,n-1,m,m1)\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n else: \\n value = int(matrix[n][m])\\n match value:\\n case 0: \\n ms(matrix,n,m-1,m1)\\n ms(matrix,n-1,m,m1)\\n ms(matrix,n-1,m-1,m1)\\n memo[(n,m)] = 0\\n case _:\\n memo[(n,m)]=min(ms(matrix,n,m-1,m1),ms(matrix,n-1,m,m1),ms(matrix,n-1,m-1,m1))+int(matrix[n][m])\\n return memo[(n,m)]\\n \\n ms(matrix)\\n print(memo)\\n max1=0\\n for i in memo:\\n if memo[i]>max1: max1=memo[i]\\n return max1**2\\n \",\n \"memory\": \"54225\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n memo={}\\n def ms(matrix,n=0,m=0,m1=False):\\n if m1==False:\\n m1=True\\n n=len(matrix)-1\\n m=len(matrix[0])-1\\n if (n,m) in memo : return memo[(n,m)]\\n if n==0 and m==0:\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n elif n==0:\\n ms(matrix,n,m-1,m1)\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n elif m==0:\\n ms(matrix,n-1,m,m1)\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n else: \\n value = int(matrix[n][m])\\n match value:\\n case 0: \\n ms(matrix,n,m-1,m1)\\n ms(matrix,n-1,m,m1)\\n ms(matrix,n-1,m-1,m1)\\n memo[(n,m)] = 0\\n case _:\\n memo[(n,m)]=min(ms(matrix,n,m-1,m1),ms(matrix,n-1,m,m1),ms(matrix,n-1,m-1,m1))+int(matrix[n][m])\\n return memo[(n,m)]\\n \\n ms(matrix)\\n max1=0\\n for i in memo:\\n if memo[i]>max1: max1=memo[i]\\n return max1**2\\n \",\n \"memory\": \"54225\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n memo={}\\n n=len(matrix)-1\\n m=len(matrix[0])-1\\n def ms(matrix,n,m):\\n if (n,m) in memo : return memo[(n,m)]\\n if n==0 and m==0:\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n elif n==0:\\n ms(matrix,n,m-1)\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n elif m==0:\\n ms(matrix,n-1,m)\\n memo[(n,m)]=int(matrix[n][m])\\n return memo[(n,m)]\\n else: \\n match int(matrix[n][m]):\\n case 0: \\n ms(matrix,n,m-1)\\n ms(matrix,n-1,m)\\n ms(matrix,n-1,m-1)\\n memo[(n,m)] = 0\\n case _:\\n memo[(n,m)]=min(ms(matrix,n,m-1),ms(matrix,n-1,m),ms(matrix,n-1,m-1))+int(matrix[n][m])\\n return memo[(n,m)]\\n \\n ms(matrix, n, m)\\n max1=0\\n for i in memo:\\n if memo[i]>max1: max1=memo[i]\\n return max1**2\\n \",\n \"memory\": \"54775\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n cache, maxRow, maxCol = {}, len(matrix), len(matrix[0])\\n def helper(row, col):\\n if row == maxRow or col == maxCol:\\n return 0\\n if (row, col) not in cache:\\n down = helper(row + 1, col)\\n right = helper(row, col + 1)\\n diag = helper(row + 1, col + 1)\\n cache[(row, col)] = 0\\n if matrix[row][col] == '1':\\n cache[(row, col)] = 1 + min(down, right, diag)\\n return cache[(row, col)]\\n helper(0, 0)\\n return max(cache.values()) ** 2\",\n \"memory\": \"55325\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n nrow, ncol = len(matrix), len(matrix[0])\\n \\n # dp[(i, j)]: largest square's side where the top left vertex is (i, j)\\n dp = {}\\n\\n def dfs(row, col):\\n # cannot form a square\\n if row == nrow or col == ncol or matrix[row][col] == '0':\\n return 0\\n \\n # if subproblem has been computed\\n if (row, col) in dp:\\n return dp[(row, col)]\\n\\n # side of largest square\\n side_diag = dfs(row + 1, col + 1) # diag sq\\n side_h = dfs(row, col + 1) # horizontal sq (right)\\n side_v = dfs(row + 1, col) # vertical sq (down)\\n\\n # already 1 square (1) + min side of these square can form a square\\n dp[(row, col)] = 1 + min(side_diag, side_h, side_v)\\n\\n return dp[(row, col)]\\n \\n max_side = 0\\n for row in range(nrow):\\n for col in range(ncol):\\n # no need to filter \\\"1\\\" as it will be terminated by line 10\\n max_side = max(max_side, dfs(row, col))\\n\\n return max_side ** 2\",\n \"memory\": \"55875\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n n = len(matrix)\\n m = len(matrix[0])\\n memo = {}\\n def dfs(i, j):\\n if (i, j) in memo:\\n return memo[(i, j)]\\n\\n if i >= n or j >= m:\\n return 0\\n \\n if matrix[i][j] == \\\"0\\\":\\n return 0\\n \\n memo[(i, j)] = 1 + min(dfs(i + 1, j + 1), dfs(i + 1, j), dfs(i, j + 1))\\n return 1 + min(dfs(i + 1, j + 1), dfs(i + 1, j), dfs(i, j + 1))\\n res = 0\\n for i in range(n):\\n for j in range(m):\\n maxEdge = dfs(i, j)\\n res = max(res, maxEdge * maxEdge)\\n return res\",\n \"memory\": \"56425\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c] == \\\"0\\\":\\n return 0\\n right = dfs(r+1,c)\\n down = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n res = 1 + min(right,dia,down)\\n dp[(r,c)] = res\\n return res\\n \\n res = 0\\n for r in range(R):\\n for c in range(C):\\n if matrix[r][c] == \\\"1\\\":\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C = len(matrix),len(matrix[0])\\n dp= {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c] == \\\"0\\\":return 0\\n right = dfs(r,c+1)\\n down = dfs(r+1,c)\\n dia = dfs(r+1,c+1)\\n res = 1 + min(right,down,dia)\\n dp[(r,c)] = res\\n return res\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n if matrix[r][c] == \\\"1\\\":\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C =len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]==\\\"0\\\":return 0\\n if (r,c) in dp:return dp[(r,c)]\\n right = dfs(r,c+1)\\n down = dfs(r+1,c)\\n dia = dfs(r+1,c+1)\\n res = 1+min(right,down,dia)\\n dp[(r,c)] = res\\n return res\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n if matrix[r][c]==\\\"1\\\":\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C =len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]==\\\"0\\\":return 0\\n if (r,c) in dp:return dp[(r,c)]\\n right = dfs(r,c+1)\\n down = dfs(r+1,c)\\n dia = dfs(r+1,c+1)\\n res = 1+min(right,down,dia)\\n dp[(r,c)] = res\\n return res\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n if matrix[r][c]==\\\"1\\\":\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C= len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]==\\\"0\\\":return 0\\n right = dfs(r+1,c)\\n bot = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n res = 1 + min(right,bot,dia)\\n dp[(r,c)] = res\\n return res \\n \\n res = 0\\n for r in range(R):\\n for c in range(C):\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]!=\\\"1\\\":return 0\\n right = dfs(r,c+1)\\n down = dfs(r+1,c)\\n dia = dfs(r+1,c+1)\\n res = 0\\n if matrix[r][c]==\\\"1\\\":\\n res = 1+min(right,down,dia)\\n dp[(r,c)] = res\\n return res\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n res = max(res,dfs(r,c))\\n return res**2\\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 R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or c>=C or r>=R or matrix[r][c]==\\\"0\\\":return 0\\n down = dfs(r+1,c)\\n right = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n if matrix[r][c]==\\\"1\\\":\\n res = 1+min(down,right,dia)\\n dp[(r,c)] = res\\n return res\\n ans = 0\\n for r in range(R):\\n for c in range(C):\\n ans = max(ans,dfs(r,c))\\n return ans**2\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or r>=R or c>=C:\\n return 0\\n right = dfs(r,c+1)\\n bottom = dfs(r+1,c)\\n dia = dfs(r+1,c+1)\\n res = 0\\n if matrix[r][c] == \\\"1\\\":\\n res += 1 + min(right,bottom,dia)\\n dp[(r,c)] = res\\n return dp[(r,c)]\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n if matrix[r][c] == \\\"1\\\":\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or r>=R or c>=C:return 0\\n res = 0\\n if matrix[r][c] == \\\"1\\\":\\n res = 1 + min(dfs(r+1,c),dfs(r+1,c+1),dfs(r,c+1))\\n dp[(r,c)] = res\\n return dp[(r,c)]\\n res= 0\\n for r in range(R):\\n for c in range(C):\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if r<0 or c<0 or r>=R or c>=C:return 0\\n if (r,c) in dp:return dp[(r,c)]\\n right = dfs(r+1,c)\\n bot = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n res = 0\\n if matrix[r][c] == \\\"1\\\":\\n res = 1 + min(right,bot,dia)\\n dp[(r,c)] = res\\n return dp[(r,c)]\\n\\n\\n\\n\\n\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if r>=R or c>=C or c<0 or r<0:return 0\\n if (r,c) in dp:return dp[(r,c)]\\n right = dfs(r+1,c)\\n dia = dfs(r+1,c+1)\\n bot = dfs(r,c+1)\\n res = 0\\n if matrix[r][c] == '1':\\n res+=1+min(right,bot,dia)\\n dp[(r,c)] = res\\n return dp[(r,c)]\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n res = max(res,dfs(r,c))\\n return res**2\\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 R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if r<0 or c<0 or r>=R or c>=C:return 0\\n if (r,c) in dp:return dp[(r,c)]\\n right = dfs(r+1,c)\\n down = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n\\n dp[(r,c)] = 0\\n if matrix[r][c] == \\\"1\\\":\\n dp[(r,c)] += 1 + min(right,down,dia)\\n \\n return dp[(r,c)]\\n \\n for r in range(R):\\n for c in range(C):\\n dfs(r,c)\\n return max(dp.values())**2\\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\\n R,C = len(matrix),len(matrix[0])\\n memo = {}\\n def dfs(r,c):\\n if r<0 or c<0 or c>=C or r>=R :return 0\\n if (r,c) in memo : return memo[(r,c)]\\n right = dfs(r+1,c)\\n down = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n memo[(r,c)] = 0\\n if matrix[r][c] == \\\"1\\\":\\n memo[(r,c)] = 1+min(right,down,dia)\\n return memo[(r,c)]\\n for r in range(R):\\n for c in range(C):\\n dfs(r,c)\\n return max(memo.values())**2\\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 R,C = len(matrix),len(matrix[0])\\n memo = {}\\n def dfs(r,c):\\n if r<0 or c<0 or r>=R or c>=C:\\n return 0\\n if (r,c) in memo:return memo[(r,c)]\\n right = dfs(r+1,c)\\n down = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n memo[(r,c)] = 0\\n if matrix[r][c] == \\\"1\\\":\\n memo[(r,c)] = 1 + min(right,dia,down)\\n return memo[(r,c)]\\n for r in range(R):\\n for c in range(C):\\n dfs(r,c)\\n return (max(memo.values()))**2\\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\\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\\n\\n\\n\\n\\n\\n\\n\\n row , col = len(matrix),len(matrix[0])\\n cache = {}\\n def dfs(r,c):\\n if r>=len(matrix) or c>=len(matrix[0]):\\n return 0\\n if (r,c) in cache:\\n return cache[(r,c)]\\n down = dfs(r,c+1)\\n right = dfs(r+1,c)\\n dia = dfs(r+1,c+1)\\n cache[(r,c)] = 0\\n if matrix[r][c] == \\\"1\\\":\\n cache[(r,c)] = 1 + min(down,right,dia)\\n return cache[(r,c)]\\n dfs(0,0)\\n return max(cache.values())**2\\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 row,col = len(matrix),len(matrix[0])\\n cache = {}\\n def dfs(r,c):\\n if r>=row or c>=col:\\n return 0\\n if (r,c) not in cache:\\n down = dfs(r+1,c)\\n right = dfs(r,c+1)\\n diag = dfs(r+1,c+1)\\n \\n cache[(r,c)] = 0\\n if matrix[r][c] == \\\"1\\\":\\n cache[(r,c)] += 1 + min(down,right,diag)\\n return cache[(r,c)]\\n dfs(0,0)\\n return max(cache.values())**2\\n \\n \",\n \"memory\": \"56975\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n cache = {}\\n\\n def rec(r,c):\\n if r>= len(matrix) or c>=len(matrix[0]):\\n return 0\\n \\n if (r,c) not in cache:\\n x=rec(r+1,c)\\n y=rec(r,c+1)\\n z = rec(r+1,c+1)\\n\\n cache[(r,c)]=0\\n if matrix[r][c] == \\\"1\\\":\\n cache[(r,c)]= 1+min(x,y,z)\\n\\n return cache[(r,c)]\\n \\n rec(0,0)\\n return max(cache.values())**2\",\n \"memory\": \"57525\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n R,C= len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c] == \\\"0\\\":\\n return 0\\n right = dfs(r+1,c)\\n down = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n res = 1 + min(right,dia,down)\\n dp[(r,c)] = res\\n return res\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c] == \\\"0\\\":\\n return 0\\n right = dfs(r+1,c)\\n down = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n res = 1 + min(right,dia,down)\\n dp[(r,c)] = res\\n return res\\n \\n res = 0\\n for r in range(R):\\n for c in range(C):\\n if matrix[r][c] == \\\"1\\\":\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C = len(matrix),len(matrix[0])\\n dp= {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c] == \\\"0\\\":return 0\\n right = dfs(r,c+1)\\n down = dfs(r+1,c)\\n dia = dfs(r+1,c+1)\\n res = 1 + min(right,down,dia)\\n dp[(r,c)] = res\\n return res\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n if matrix[r][c] == \\\"1\\\":\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C =len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]==\\\"0\\\":return 0\\n if (r,c) in dp:return dp[(r,c)]\\n right = dfs(r,c+1)\\n down = dfs(r+1,c)\\n dia = dfs(r+1,c+1)\\n res = 1+min(right,down,dia)\\n dp[(r,c)] = res\\n return res\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n if matrix[r][c]==\\\"1\\\":\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C =len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]==\\\"0\\\":return 0\\n if (r,c) in dp:return dp[(r,c)]\\n right = dfs(r,c+1)\\n down = dfs(r+1,c)\\n dia = dfs(r+1,c+1)\\n res = 1+min(right,down,dia)\\n dp[(r,c)] = res\\n return res\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n if matrix[r][c]==\\\"1\\\":\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C= len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]==\\\"0\\\":return 0\\n right = dfs(r+1,c)\\n bot = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n res = 1 + min(right,bot,dia)\\n dp[(r,c)] = res\\n return res \\n \\n res = 0\\n for r in range(R):\\n for c in range(C):\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or r>=R or c>=C or matrix[r][c]!=\\\"1\\\":return 0\\n right = dfs(r,c+1)\\n down = dfs(r+1,c)\\n dia = dfs(r+1,c+1)\\n res = 0\\n if matrix[r][c]==\\\"1\\\":\\n res = 1+min(right,down,dia)\\n dp[(r,c)] = res\\n return res\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n res = max(res,dfs(r,c))\\n return res**2\\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 R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or c>=C or r>=R or matrix[r][c]==\\\"0\\\":return 0\\n down = dfs(r+1,c)\\n right = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n if matrix[r][c]==\\\"1\\\":\\n res = 1+min(down,right,dia)\\n dp[(r,c)] = res\\n return res\\n ans = 0\\n for r in range(R):\\n for c in range(C):\\n ans = max(ans,dfs(r,c))\\n return ans**2\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or r>=R or c>=C:\\n return 0\\n right = dfs(r,c+1)\\n bottom = dfs(r+1,c)\\n dia = dfs(r+1,c+1)\\n res = 0\\n if matrix[r][c] == \\\"1\\\":\\n res += 1 + min(right,bottom,dia)\\n dp[(r,c)] = res\\n return dp[(r,c)]\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n if matrix[r][c] == \\\"1\\\":\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if (r,c) in dp:return dp[(r,c)]\\n if r<0 or c<0 or r>=R or c>=C:return 0\\n res = 0\\n if matrix[r][c] == \\\"1\\\":\\n res = 1 + min(dfs(r+1,c),dfs(r+1,c+1),dfs(r,c+1))\\n dp[(r,c)] = res\\n return dp[(r,c)]\\n res= 0\\n for r in range(R):\\n for c in range(C):\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if r<0 or c<0 or r>=R or c>=C:return 0\\n if (r,c) in dp:return dp[(r,c)]\\n right = dfs(r+1,c)\\n bot = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n res = 0\\n if matrix[r][c] == \\\"1\\\":\\n res = 1 + min(right,bot,dia)\\n dp[(r,c)] = res\\n return dp[(r,c)]\\n\\n\\n\\n\\n\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n res = max(res,dfs(r,c))\\n return res**2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if r>=R or c>=C or c<0 or r<0:return 0\\n if (r,c) in dp:return dp[(r,c)]\\n right = dfs(r+1,c)\\n dia = dfs(r+1,c+1)\\n bot = dfs(r,c+1)\\n res = 0\\n if matrix[r][c] == '1':\\n res+=1+min(right,bot,dia)\\n dp[(r,c)] = res\\n return dp[(r,c)]\\n res = 0\\n for r in range(R):\\n for c in range(C):\\n res = max(res,dfs(r,c))\\n return res**2\\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 R,C = len(matrix),len(matrix[0])\\n dp = {}\\n def dfs(r,c):\\n if r<0 or c<0 or r>=R or c>=C:return 0\\n if (r,c) in dp:return dp[(r,c)]\\n right = dfs(r+1,c)\\n down = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n\\n dp[(r,c)] = 0\\n if matrix[r][c] == \\\"1\\\":\\n dp[(r,c)] += 1 + min(right,down,dia)\\n \\n return dp[(r,c)]\\n \\n for r in range(R):\\n for c in range(C):\\n dfs(r,c)\\n return max(dp.values())**2\\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\\n R,C = len(matrix),len(matrix[0])\\n memo = {}\\n def dfs(r,c):\\n if r<0 or c<0 or c>=C or r>=R :return 0\\n if (r,c) in memo : return memo[(r,c)]\\n right = dfs(r+1,c)\\n down = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n memo[(r,c)] = 0\\n if matrix[r][c] == \\\"1\\\":\\n memo[(r,c)] = 1+min(right,down,dia)\\n return memo[(r,c)]\\n for r in range(R):\\n for c in range(C):\\n dfs(r,c)\\n return max(memo.values())**2\\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 R,C = len(matrix),len(matrix[0])\\n memo = {}\\n def dfs(r,c):\\n if r<0 or c<0 or r>=R or c>=C:\\n return 0\\n if (r,c) in memo:return memo[(r,c)]\\n right = dfs(r+1,c)\\n down = dfs(r,c+1)\\n dia = dfs(r+1,c+1)\\n memo[(r,c)] = 0\\n if matrix[r][c] == \\\"1\\\":\\n memo[(r,c)] = 1 + min(right,dia,down)\\n return memo[(r,c)]\\n for r in range(R):\\n for c in range(C):\\n dfs(r,c)\\n return (max(memo.values()))**2\\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\\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\\n\\n\\n\\n\\n\\n\\n\\n row , col = len(matrix),len(matrix[0])\\n cache = {}\\n def dfs(r,c):\\n if r>=len(matrix) or c>=len(matrix[0]):\\n return 0\\n if (r,c) in cache:\\n return cache[(r,c)]\\n down = dfs(r,c+1)\\n right = dfs(r+1,c)\\n dia = dfs(r+1,c+1)\\n cache[(r,c)] = 0\\n if matrix[r][c] == \\\"1\\\":\\n cache[(r,c)] = 1 + min(down,right,dia)\\n return cache[(r,c)]\\n dfs(0,0)\\n return max(cache.values())**2\\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 row,col = len(matrix),len(matrix[0])\\n cache = {}\\n def dfs(r,c):\\n if r>=row or c>=col:\\n return 0\\n if (r,c) not in cache:\\n down = dfs(r+1,c)\\n right = dfs(r,c+1)\\n diag = dfs(r+1,c+1)\\n \\n cache[(r,c)] = 0\\n if matrix[r][c] == \\\"1\\\":\\n cache[(r,c)] += 1 + min(down,right,diag)\\n return cache[(r,c)]\\n dfs(0,0)\\n return max(cache.values())**2\\n \\n \",\n \"memory\": \"57525\"\n },\n {\n \"code\": \"from functools import cache\\n\\nclass Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n\\n m, n = len(matrix), len(matrix[0])\\n answer = [0]\\n\\n @cache\\n def dp(i, j):\\n # size of the largest square anchored at cell i, j\\n # print(i, j)\\n \\n # base case\\n if i == 0 or j == 0:\\n answer[0] = max(answer[0], int(matrix[i][j]))\\n return int(matrix[i][j])\\n \\n # can we extend?\\n diagonal = dp(i-1, j-1)\\n up = dp(i-1, j)\\n left = dp(i, j-1)\\n # print(f'at {(i, j)}', diagonal, up, left)\\n if matrix[i][j] == \\\"1\\\" and (diagonal == up == left):\\n # print('can extend')\\n # print(f'dp{(i, j)} = {1 + diagonal}')\\n answer[0] = max(answer[0], 1 + diagonal)\\n return 1 + diagonal\\n else:\\n \\n if matrix[i][j] == \\\"1\\\":\\n # print(f'dp{(i, j)} = {1 + min(diagonal, up, left)}')\\n answer[0] = max(answer[0], 1 + min(diagonal, up, left))\\n return 1 + min(diagonal, up, left)\\n else:\\n return 0\\n\\n for i in range(m):\\n dp(i, 0)\\n\\n for j in range(n):\\n dp(0, j)\\n \\n _ = dp(m-1, n-1)\\n return answer[0] ** 2\\n \",\n \"memory\": \"58075\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n cache = {}\\n\\n def helper(r, c):\\n if r >= ROWS or c >= COLS:\\n return 0\\n \\n if (r, c) not in cache:\\n down = helper(r+1, c)\\n right = helper(r, c+1)\\n diag = helper(r+1, c+1)\\n cache[(r, c)] = 0\\n if matrix[r][c] == \\\"1\\\":\\n cache[(r,c)] = 1 + min(down, right, diag)\\n return cache[(r, c)]\\n \\n helper(0, 0)\\n return max(cache.values())**2\",\n \"memory\": \"58075\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n # If define subproblem DP(i, j) to be the maximum size of the square with bottom right corner to be at i, j\\n # Consider following situation:\\n # ? ? ?\\n # ? ? ?\\n # ? ? 1\\n # DP(i, j) is dependent on DP(i, j-1), DP(i-1, j), DP(i-1, j-1)\\n # if all three is 1, then DP(i, j) is 2. If all three is 2, then DP(i, j) is 3.\\n # Basically DP(i, j) is the minimum of these three values, + 1.\\n\\n memory = {}\\n \\n def topdown(i, j):\\n if (i, j) in memory:\\n return memory[(i, j)]\\n\\n if matrix[i][j] == '0':\\n memory[(i, j)] = 0\\n return 0\\n\\n else:\\n if i == 0 or j == 0:\\n memory[(i, j)] = 1\\n return 1\\n dependence = min(topdown(i-1, j), topdown(i, j-1), topdown(i-1, j-1))\\n memory[(i, j)] = dependence + 1\\n return memory[(i, j)]\\n \\n ans = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n ans = max(ans, topdown(i, j) ** 2)\\n return ans\",\n \"memory\": \"58625\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n dp = {}\\n\\n def maximalRec(i, j):\\n if i >= m or j >= n:\\n return 0\\n \\n if (i, j) not in dp:\\n\\n down = maximalRec(i+1, j)\\n right = maximalRec(i, j+1)\\n diag = maximalRec(i+1, j+1)\\n\\n dp[(i, j)] = 0\\n if matrix[i][j] == \\\"1\\\":\\n dp[(i, j)] = 1 + min(down, right, diag)\\n\\n return dp[(i, j)]\\n\\n \\n maximalRec(0, 0)\\n return max(dp.values())**2\\n\\n \\n \",\n \"memory\": \"58625\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows,cols=len(matrix),len(matrix[0])\\n dp={}\\n\\n def help(r,c):\\n if r<0 or r>=rows or c<0 or c>=cols :\\n return 0\\n if (r,c) not in dp:\\n down=help(r+1,c)\\n right=help(r,c+1)\\n diag=help(r+1,c+1)\\n\\n dp[(r,c)]=0\\n if matrix[r][c]==\\\"1\\\":\\n dp[(r,c)]=1+min(down,right,diag)\\n return dp[(r,c)]\\n help(0,0)\\n return max(dp.values()) **2\\n\\n \",\n \"memory\": \"59175\"\n },\n {\n \"code\": \"class Solution:\\n def maximalSquare(self, matrix: List[List[str]]) -> int:\\n rows,cols=len(matrix),len(matrix[0])\\n dp={}\\n\\n def help(r,c):\\n if r<0 or r>=rows or c<0 or c>=cols :\\n return 0\\n if (r,c) not in dp:\\n down=help(r+1,c)\\n right=help(r,c+1)\\n diag=help(r+1,c+1)\\n\\n dp[(r,c)]=0\\n if matrix[r][c]==\\\"1\\\":\\n dp[(r,c)]=1+min(down,right,diag)\\n return dp[(r,c)]\\n help(0,0)\\n return max(dp.values()) **2\\n\\n \",\n \"memory\": \"59175\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":114,"string":"114"}}},{"rowIdx":149,"cells":{"question_id":{"kind":"number","value":222,"string":"222"},"name":{"kind":"string","value":"count-complete-tree-nodes"},"content":{"kind":"string","value":"<p>Given the <code>root</code> of a <strong>complete</strong> binary tree, return the number of the nodes in the tree.</p>\n\n<p>According to <strong><a href=\"http://en.wikipedia.org/wiki/Binary_tree#Types_of_binary_trees\" target=\"_blank\">Wikipedia</a></strong>, every level, except possibly the last, is completely filled in a complete binary tree, and all nodes in the last level are as far left as possible. It can have between <code>1</code> and <code>2<sup>h</sup></code> nodes inclusive at the last level <code>h</code>.</p>\n\n<p>Design an algorithm that runs in less than <code data-stringify-type=\"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/01/14/complete.jpg\" style=\"width: 372px; height: 302px;\" />\n<pre>\n<strong>Input:</strong> root = [1,2,3,4,5,6]\n<strong>Output:</strong> 6\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> root = []\n<strong>Output:</strong> 0\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> root = [1]\n<strong>Output:</strong> 1\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>[0, 5 * 10<sup>4</sup>]</code>.</li>\n\t<li><code>0 <= Node.val <= 5 * 10<sup>4</sup></code></li>\n\t<li>The tree is guaranteed to be <strong>complete</strong>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":67.19646489794795,"string":"67.196465"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["binary-search","bit-manipulation","tree","binary-tree"],"string":"[\n \"binary-search\",\n \"bit-manipulation\",\n \"tree\",\n \"binary-tree\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"22\", 0.0115], [\"30\", 0.0229], [\"31\", 0.0459], [\"32\", 0.0344], [\"34\", 0.0574], [\"35\", 0.1262], [\"36\", 0.0688], [\"37\", 0.1032], [\"38\", 0.1721], [\"39\", 0.2868], [\"40\", 0.2753], [\"41\", 0.2638], [\"42\", 0.5391], [\"43\", 0.9406], [\"44\", 1.0209], [\"45\", 1.2847], [\"46\", 1.537], [\"47\", 2.2597], [\"48\", 2.6726], [\"49\", 3.2347], [\"50\", 3.1085], [\"51\", 4.0032], [\"52\", 4.6914], [\"53\", 4.8406], [\"54\", 5.0929], [\"55\", 5.5517], [\"56\", 6.3203], [\"57\", 6.3776], [\"58\", 5.8156], [\"59\", 5.8385], [\"60\", 5.3338], [\"61\", 4.5997], [\"62\", 4.2326], [\"63\", 3.9344], [\"64\", 3.1659], [\"65\", 2.7644], [\"66\", 1.9385], [\"67\", 1.2044], [\"68\", 1.1929]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16900\", 0.0229], [\"17000\", 0.0803], [\"17100\", 0.0115], [\"17200\", 0.0229], [\"17300\", 0.0688], [\"21100\", 0.0115], [\"21200\", 0.0344], [\"21300\", 0.0344], [\"21400\", 0.1147], [\"21500\", 1.7206], [\"21600\", 21.8513], [\"21700\", 56.6988], [\"21800\", 13.5811]]}"},"rt_list":{"kind":"list like","value":[{"code":"import sys\n\nwith open('user.out', 'w') as f:\n while True:\n line = sys.stdin.readline().strip()\n print(line)\n if not line:\n break\n print(line)\n if len(line.split(\",\"))!=1:\n f.write(f'{len(line.split(\",\"))}\\n')\n else:\n if line[1]==\"]\":\n f.write(f'0\\n')\n else:\n f.write(f'{line[1]}\\n')\n\nexit(0)","runtime":"22"},{"code":"import sys\nwith open('user.out', 'w') as f:\n while True:\n line = sys.stdin.readline().strip()\n print(line)\n if not line:\n break\n print(line)\n if len(line.split(\",\"))!=1:\n f.write(f'{len(line.split(\",\"))}\\n')\n else:\n if line[1]==\"]\":\n f.write(f'0\\n')\n else:\n f.write(f'{line[1]}\\n')\nexit(0)","runtime":"30"},{"code":"with open(\"user.out\", \"w\") as Solution:\n for root in map(loads, stdin):\n Solution.write(f\"{sum( 1 for node in root if node is not None )}\\n\")\nexit()","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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n left = root.left\n right = root.right\n leftDepth = 0 #这里初始为0是有目的的，为了下面求指数方便\n rightDepth = 0\n while left: #求左子树深度\n left = left.left\n leftDepth += 1\n while right: #求右子树深度\n right = right.right\n rightDepth += 1\n if leftDepth == rightDepth:\n return (2 << leftDepth) - 1 #注意(2<<1) 相当于2^2，所以leftDepth初始为0\n return self.countNodes(root.left) + self.countNodes(root.right) + 1\n \n\n","runtime":"32"},{"code":"import sys\n\nwith open('user.out', 'w') as f:\n while True:\n line = sys.stdin.readline().strip()\n if not line:\n break\n if len(line.split(\",\"))!=1:\n f.write(f'{len(line.split(\",\"))}\\n')\n else:\n if line[1]==\"]\":\n f.write(f'0\\n')\n else:\n f.write(f'{line[1]}\\n')\n\nexit(0)","runtime":"34"},{"code":"import sys\n\nwith open('user.out', 'w') as f:\n while True:\n line = sys.stdin.readline().strip()\n if not line:\n break\n if line[1]==\"]\":\n f.write(f'0\\n')\n else:\n f.write(f'{len(line.split(\",\"))}\\n')\n\nexit(0)","runtime":"34"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n\n if root==None:\n return 0\n \n if root.left==None and root.right==None:\n return 1\n\n \n return 1+ self.countNodes(root.left) +self.countNodes(root.right)\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\n def dfs(self, node):\n if not node:\n return 0\n \n left = self.dfs(node.left)\n right = self.dfs(node.right)\n return (left + right) + 1\n\n def countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n \n ans = self.dfs(root)\n return ans","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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n l, r = 0,0\n c = root\n while c:\n l+=1\n c = c.left\n c = root\n while c:\n r+=1\n c=c.right\n if l==r:\n return pow(2,l)-1\n return 1+self.countNodes(root.left)+self.countNodes(root.right)","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 countNodes(self, root: Optional[TreeNode]) -> int:\n def countt (root):\n if not root:\n return 0\n \n return 1 + countt(root.left) + countt(root.right)\n\n nodes_num = countt(root)\n return nodes_num \n ","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 countNodes(self, root: Optional[TreeNode]) -> int:\n def count_left_height(node):\n height = 0\n while node:\n height += 1\n node = node.left\n return height\n def count_right_height(node):\n height = 0\n while node:\n height += 1\n node = node.right\n return height\n def count_nodes(node):\n if not node: return 0\n left_height = count_left_height(node)\n right_height = count_right_height(node)\n if left_height == right_height:\n return pow(2, left_height) - 1\n return 1 + count_nodes(node.left) + count_nodes(node.right)\n return count_nodes(root)\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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n left_d = 0\n cur = root.left\n while cur:\n left_d += 1\n cur = cur.left\n right_d = 0\n cur = root.right\n while cur:\n right_d += 1\n cur = cur.right\n if left_d == right_d:\n return 2**(left_d+1)-1\n else:\n return 1+self.countNodes(root.left)+self.countNodes(root.right)","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 getHeight(self, root: Optional[TreeNode]) -> int:\n count = 0\n while root:\n count += 1\n root = root.left\n return count\n def exits(self, index: int, height: int, node: Optional[TreeNode]) -> bool:\n left, right = 0, (1<<(height-1))-1\n for _ in range(height-1):\n mid = (left + right) // 2\n if index <= mid:\n node = node.left\n right = mid\n else:\n node = node.right\n left = mid\n return node is not None\n def countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n height = self.getHeight(root)\n numNodesExceptLast = ((1 << (height-1)) - 1)\n\n left, right = 0, (1<<(height-1))-1\n while left <= right:\n mid = (left + right) // 2\n if self.exits(mid, height, root):\n left = mid + 1\n else:\n right = mid - 1\n print (numNodesExceptLast, left)\n return numNodesExceptLast + left\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 compute_depth(self, node: TreeNode):\n d = 0\n while node.left:\n node = node.left\n d += 1\n return d\n\n def exist(self, idx, d, node):\n left, right = 0, 2**d - 1\n for _ in range(d):\n pivot = (left+right)//2\n if idx <= pivot:\n node = node.left\n right = pivot\n else:\n node = node.right\n left = pivot + 1\n return node is not None\n\n def countNodes(self, root: Optional[TreeNode]):\n if not root:\n return 0\n \n d = self.compute_depth(root)\n \n if d == 0:\n return 1\n \n left, right = 0, 2**d - 1\n while left <= right:\n pivot = (left+right)//2\n if self.exist(pivot, d, root):\n left = pivot + 1\n else:\n right = pivot -1\n\n return (2**d -1) + left\n\n\n # def countNodes(self, root: Optional[TreeNode]) -> int:\n # count = 0\n # if not root: return count\n\n # stack = [root]\n\n # while stack:\n # node = stack.pop()\n # count += 1\n # if node.left: stack.append(node.left)\n # if node.right: stack.append(node.right)\n\n # return count\n\n\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 countNodes(self, root: Optional[TreeNode]) -> int:\n def getTreeHeight(root: Optional[TreeNode]) -> int:\n if root is None:\n return 0\n else:\n return getTreeHeight(root.left) + 1\n \n treeHeight = getTreeHeight(root)\n\n def isFull(root: Optional[TreeNode], treeHeight: int) -> bool:\n if root is None:\n return treeHeight == 0\n \n return isFull(root.right, treeHeight - 1)\n \n nodeCount = 0\n\n def countNodesRecurse(root: Optional[TreeNode], treeHeight: int) -> None:\n nonlocal nodeCount\n\n if root is None:\n return\n \n if isFull(root.left, treeHeight - 1):\n nodeCount += 2**(treeHeight - 1) # size of left subtree + 1 for current node\n countNodesRecurse(root.right, treeHeight - 1)\n else:\n # right subtree is full, but with treeHeight - 2\n nodeCount += 2**(treeHeight - 2) # size of right subtree + 1 for current node\n countNodesRecurse(root.left, treeHeight - 1)\n \n countNodesRecurse(root, treeHeight)\n return nodeCount","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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n lh,rh=0,0\n curr=root\n while curr:\n lh+=1\n curr=curr.left\n curr=root\n while curr:\n rh+=1\n curr=curr.right\n if lh==rh:\n return pow(2,lh)-1\n return 1+self.countNodes(root.left)+self.countNodes(root.right)","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 countNodes(self, root: Optional[TreeNode]) -> int:\n return self.countNodesHelper(root)\n \n def countNodesHelper(self,root):\n if root == None:\n return 0\n leftHeight = self.getLeftHeight(root)\n rightHeight = self.getRightHeight(root)\n if leftHeight == rightHeight:\n return pow(2,leftHeight)-1\n else:\n return 1+self.countNodesHelper(root.left)+self.countNodesHelper(root.right)\n \n def getLeftHeight(self,root):\n if root == None:\n return 0\n else:\n return 1+self.getLeftHeight(root.left)\n \n def getRightHeight(self,root):\n if root == None:\n return 0\n else:\n return 1+self.getRightHeight(root.right)\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 countNodes(self, root: Optional[TreeNode]) -> int:\n if root is None:\n return 0\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)","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 countNodes(self, root: Optional[TreeNode]) -> int:\n def getDepth(node):\n depth = 0\n while node:\n depth += 1\n node = node.left\n\n return depth\n\n if root == None:\n return 0\n \n left_depth = getDepth(root.left)\n right_depth = getDepth(root.right)\n\n if left_depth == right_depth:\n nodes = (2 ** left_depth) + self.countNodes(root.right)\n else:\n nodes = (2 ** right_depth) + self.countNodes(root.left)\n\n return nodes","runtime":"45"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n elif not root.left and not root.right:\n return 1\n elif root.left and not root.right:\n return 2\n def level(node):\n height = 0\n while node:\n height += 1\n node = node.left\n return height\n left = level(root.left)\n right = level(root.right)\n if left == right:\n return 2**left + self.countNodes(root.right)\n else:\n return self.countNodes(root.left) + 2**right\n \n\n ","runtime":"45"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if root is None:\n return 0\n \n def leftheight(root):\n height = 0\n while root:\n height+=1\n root = root.left\n \n \n return height\n \n def rightheight(root):\n height = 0\n while root:\n height+=1\n root = root.right\n \n \n return height\n\n left = leftheight(root.left)\n right = rightheight(root.right)\n\n if left== right:\n return pow(2,left+1)-1\n \n else:\n return 1+ self.countNodes(root.left) + self.countNodes(root.right)","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 countNodes(self, root: Optional[TreeNode]) -> int:\n\n if root is None:\n return 0\n elif root.left is None:\n return 1\n elif root.right is None:\n return 2\n\n left_depth = self.get_tree_depth(root.left)\n right_depth = self.get_tree_depth(root.right)\n\n if left_depth == right_depth:\n num_of_nodes_in_left_subtree = 2 ** (left_depth+1) - 1 # is a formula to compute the no. of nodes in a complete tree of height == left_depth.\n return num_of_nodes_in_left_subtree + 1 + self.countNodes(root.right) # the '+1' is for the current root node.\n\n else: # left_depth != right_depth\n num_of_nodes_in_right_subtree = 2 ** (right_depth+1) - 1 \n return self.countNodes(root.left) + 1 + num_of_nodes_in_right_subtree \n \n\n\n def get_tree_depth(self, root):\n if root.left is None:\n return 0 \n else:\n return self.get_tree_depth(root.left) + 1\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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n return 1+self.countNodes(root.left)+self.countNodes(root.right)","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\nfrom collections import deque\nclass Solution:\n def countNodes(self, root: Optional[TreeNode]) -> int:\n answer = 0\n if root == None:\n return 0\n queue = deque([root])\n answer = 1\n while queue:\n node = queue.popleft()\n if node.left:\n queue.append(node.left)\n answer += 1\n if node.right:\n queue.append(node.right)\n answer += 1\n return answer ","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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n count = 1\n if root.left:\n count += self.countNodes(root.left)\n if root.right:\n count += self.countNodes(root.right)\n return count","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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n\n count=1\n if root.left is not None:\n count+=self.countNodes(root.left)\n if root.right is not None:\n count+=self.countNodes(root.right)\n return count","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 countNodes(self, root: Optional[TreeNode]) -> int:\n res = []\n\n def dfs(node):\n if not node: return\n\n dfs(node.left)\n res.append(node.val)\n dfs(node.right)\n \n \n dfs(root)\n return len(res)","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 countNodes(self, root: Optional[TreeNode]) -> int:\n if root == None:\n return 0\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n lh,rh=0,0\n curr=root\n while curr:\n lh+=1\n curr=curr.left\n curr=root\n while curr:\n rh+=1\n curr=curr.right\n if lh==rh:\n return pow(2,lh)-1\n return 1+self.countNodes(root.left)+self.countNodes(root.right)","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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)","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 countNodes(self, root: TreeNode | None) -> int:\n if not root:\n return 0\n\n left = root\n right = root\n heightL = 0\n heightR = 0\n\n while left:\n heightL += 1\n left = left.left\n\n while right:\n heightR += 1\n right = right.right\n\n if heightL == heightR: # `root` is a complete tree.\n return pow(2, heightL) - 1\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)","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 countNodes(self, root: Optional[TreeNode]) -> int:\n if root == None:\n return 0\n count = 1\n left = self.countNodes(root.left)\n right = self.countNodes(root.right)\n count += left + right\n return count\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 countNodes(self, root: Optional[TreeNode]) -> int:\n return self.countNodesHelper(root)\n \n def countNodesHelper(self,root):\n if root == None:\n return 0\n else:\n return 1+self.countNodesHelper(root.left)+self.countNodesHelper(root.right)","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 countNodes(self, root: Optional[TreeNode]) -> int:\n count = [0]\n def dfs(root, count):\n if not root:\n return\n count[0] += 1\n dfs(root.left, count)\n dfs(root.right, count)\n\n dfs(root, count)\n return count[0]","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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)","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\n # compare the depth between left sub tree and right sub tree.\n # A, If it is equal, it means the left sub tree is a full binary tree\n # B, It it is not , it means the right sub tree is a full binary tree\n\n def countNodes(self, root: Optional[TreeNode]) -> int:\n\n if root is None:\n return 0\n elif root.left is None:\n return 1\n elif root.right is None:\n return 2\n\n left_depth = self.get_tree_depth(root.left)\n right_depth = self.get_tree_depth(root.right)\n\n if left_depth == right_depth:\n num_of_nodes_in_left_subtree = 2 ** (left_depth+1) - 1 # is a formula to compute the no. of nodes in a complete tree of height == left_depth.\n return num_of_nodes_in_left_subtree + 1 + self.countNodes(root.right) # the '+1' is for the current root node.\n\n else: # left_depth != right_depth\n num_of_nodes_in_right_subtree = 2 ** (right_depth+1) - 1 \n return self.countNodes(root.left) + 1 + num_of_nodes_in_right_subtree \n \n\n\n def get_tree_depth(self, root):\n if root.left is None:\n return 0 \n else:\n return self.get_tree_depth(root.left) + 1\n","runtime":"55"},{"code":"class Solution:\n def countNodes(self, root):\n if root is None:\n return 0\n \n # Find the left and right heights\n lh = self.findlheight(root)\n rh = self.findrheight(root)\n \n if lh == rh:\n return (1 << lh) - 1\n else:\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\n\n def findlheight(self, node):\n h = 0\n while node:\n h += 1\n node = node.left\n return h\n\n def findrheight(self, node):\n h = 0\n while node:\n h += 1\n node = node.right\n return h\n\n\n","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\nfrom collections import deque\nclass Solution:\n def countNodes(self, root: Optional[TreeNode]) -> int:\n q = deque()\n if root==None:\n return 0\n n = 0\n q.append(root)\n while(q):\n u = q.popleft()\n n += 1\n if u.left:\n q.append(u.left)\n if u.right:\n q.append(u.right)\n return n\n\n\n ","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 get_left_h(self, root):\n i = 0\n while root:\n i += 1\n root = root.left\n return i\n\n def get_right_h(self, root):\n i = 0\n while root:\n i += 1\n root = root.right\n return i\n\n def get_heights(self, root):\n if root is None:\n return (0, 0)\n return (self.get_left_h(root.left) + 1, self.get_right_h(root.right) + 1)\n\n def countNodes(self, root: Optional[TreeNode]) -> int:\n min_h, max_h = self.get_heights(root)\n\n if min_h == max_h:\n return 2**min_h - 1\n \n l_min_h, l_max_h = self.get_heights(root.left)\n r_min_h, r_max_h = self.get_heights(root.right)\n\n if l_min_h != l_max_h:\n l_nodes = self.countNodes(root.left)\n return l_nodes + 1 + (2**r_min_h - 1)\n if r_min_h != r_max_h:\n r_nodes = self.countNodes(root.right)\n return (2**l_min_h - 1) + 1 + r_nodes\n return (2**l_min_h - 1) + 1 + (2**r_min_h - 1)\n \n\n\n \n \n \n ","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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root: return 0\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)","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 def countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n\n left = right = root\n l = r = 1\n \n while left := left.left:\n l += 1\n\n while right := right.right:\n r += 1\n\n if l == r:\n return 2**l - 1\n\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\n\n # return self.countNodes(root.left) + self.countNodes(root.right) + 1\n ","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 def countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n count=1\n if root.left is not None:\n count+= self.countNodes(root.left)\n if root.right is not None:\n count+= self.countNodes(root.right)\n return count \n\n ","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 def countNodes(self, root: Optional[TreeNode]) -> int:\n\n def dfs(node, sum=0):\n if node is None:\n return 0\n \n sum+=1\n left_gain = dfs(node.left)\n right_gain = dfs(node.right)\n return sum + left_gain + right_gain\n\n return dfs(root,0)\n ","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 def countNodes(self, root: Optional[TreeNode]) -> int:\n def get_height(node, count, left=False):\n if left:\n if node.left:\n return get_height(node.left, count+1, left=left)\n return count\n else:\n if node.right:\n return get_height(node.right, count+1, left=left)\n return count\n \n \n\n def traverse_tree(node):\n left_height = get_height(node, 1, left=True)\n right_height = get_height(node, 1)\n if left_height == right_height:\n return (2**(left_height))-1\n left_nodes = 0\n right_nodes = 0\n if node.left:\n left_nodes = traverse_tree(node.left)\n if node.right:\n right_nodes = traverse_tree(node.right)\n return left_nodes + right_nodes + 1\n\n res = 0\n if root:\n res = traverse_tree(root)\n return res\n\n \n ","runtime":"59"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n # #BFS doesnt matter if complete or not\n # from collections import deque\n # counter = 1\n # if not root:\n # return 0\n # queue = deque([root])\n # while queue:\n # curr = queue.popleft()\n # if curr.left:\n # queue.append(curr.left)\n # counter += 1\n # if curr.right:\n # queue.append(curr.right)\n # counter += 1\n # return counter\n\n #recursion\n def count(root):\n if not root:\n return 0\n return count(root.left) + count(root.right) + 1\n return count(root)\n ","runtime":"59"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n nodes = 0\n if not root:\n return 0\n\n nodes += 1 \n nodes += self.countNodes(root.left)\n nodes += self.countNodes(root.right)\n \n return nodes\n ","runtime":"60"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n \n if root is None:\n return 0\n\n current = root\n left_height = 0\n while current:\n left_height += 1\n current = current.left\n\n current = root\n right_height = 0\n while current:\n right_height += 1\n current = current.right\n\n if left_height == right_height:\n return 2**right_height - 1\n \n current = root\n left = self.countNodes(current.left)\n right = self.countNodes(current.right)\n\n\n return left + right + 1","runtime":"60"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n count=0\n def nodes(curr):\n nonlocal count\n count+=1\n if curr.left:\n nodes(curr.left)\n if curr.right:\n nodes(curr.right)\n if root:\n nodes(root)\n return count","runtime":"61"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n return 1+self.countNodes(root.left)+self.countNodes(root.right)","runtime":"61"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n\n left = self.getH(root.left)\n right = self.getH(root.right)\n\n if left == right: #左右一样说明要么完全要么缺右边 说明左边完整\n return (1 << left) + self.countNodes(root.right) # 左边加上当前正好两倍数\n # 最终我们找到多出来的这个节点，然后正好是\n else: # 最后左右不平衡的那个节点就是刚好右边缺失的\n # 说明其实是左边多了\n return (1 << right) + self.countNodes(root.left)\n\n def getH(self, node):\n depth = 0\n while(node):\n depth+=1\n node = node.left\n \n\n return depth","runtime":"62"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n def tree_height(node):\n if not node:\n return 0\n return 1 + tree_height(node.left)\n\n if not root:\n return 0\n\n left_height = tree_height(root.left)\n right_height = tree_height(root.right)\n\n if left_height == right_height:\n # Left subtree is a perfect binary tree\n return (1 << left_height) + self.countNodes(root.right)\n else:\n # Right subtree is a perfect binary tree\n return (1 << right_height) + self.countNodes(root.left)","runtime":"62"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n count = 0\n stack = [root] \n while stack:\n node = stack.pop()\n if node:\n stack.append(node.right)\n stack.append(node.left)\n count+=1\n return count\n ","runtime":"63"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if root is None:\n return 0\n\n cur_level = [root]\n node_count = 0\n while len(cur_level):\n all_none = True\n next_level = []\n for node in cur_level:\n if node is None:\n continue\n node_count += 1\n all_none = False\n next_level.append(node.left)\n next_level.append(node.right)\n if all_none:\n break\n cur_level = next_level\n return node_count","runtime":"63"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n count = 0\n def helper(root):\n nonlocal count\n if root:\n count += 1\n helper(root.left)\n helper(root.right)\n helper(root)\n return count ","runtime":"64"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n count = 1\n\n if root.left is not None:\n count += self.countNodes(root.left)\n if root.right is not None:\n count += self.countNodes(root.right)\n\n return count\n ","runtime":"64"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n from collections import deque\n counter = 1\n if not root:\n return 0\n queue = deque([root])\n while queue:\n curr = queue.popleft()\n if curr.left:\n queue.append(curr.left)\n counter += 1\n if curr.right:\n queue.append(curr.right)\n counter += 1\n return counter\n ","runtime":"65"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n res = 0\n stack = [root]\n while stack:\n curr = stack.pop()\n if curr:\n res += 1\n stack.append(curr.left)\n stack.append(curr.right)\n return res","runtime":"65"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n def count(root):\n if not root:\n return 0\n return 1 + count(root.left) + count(root.right)\n return count(root)","runtime":"66"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\n \n\n","runtime":"66"},{"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.count = 0\n def countNodes(self, root: Optional[TreeNode]) -> int:\n count = self.r(root)\n return self.count\n\n def r(self,root):\n \n if(not root):\n return\n self.count += 1\n self.r(root.left)\n self.r(root.right)\n","runtime":"67"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if root == None: return 0\n left, right = root, root\n h_l, h_r = 0, 0\n while left != None:\n h_l += 1\n left = left.left\n while right != None:\n h_r += 1\n right = right.right\n if h_l == h_r: return(1<<h_l) -1\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)","runtime":"67"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n return 1 + self.countNodes(root.left) + self.countNodes(root.right) ","runtime":"68"}],"string":"[\n {\n \"code\": \"import sys\\n\\nwith open('user.out', 'w') as f:\\n while True:\\n line = sys.stdin.readline().strip()\\n print(line)\\n if not line:\\n break\\n print(line)\\n if len(line.split(\\\",\\\"))!=1:\\n f.write(f'{len(line.split(\\\",\\\"))}\\\\n')\\n else:\\n if line[1]==\\\"]\\\":\\n f.write(f'0\\\\n')\\n else:\\n f.write(f'{line[1]}\\\\n')\\n\\nexit(0)\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"import sys\\nwith open('user.out', 'w') as f:\\n while True:\\n line = sys.stdin.readline().strip()\\n print(line)\\n if not line:\\n break\\n print(line)\\n if len(line.split(\\\",\\\"))!=1:\\n f.write(f'{len(line.split(\\\",\\\"))}\\\\n')\\n else:\\n if line[1]==\\\"]\\\":\\n f.write(f'0\\\\n')\\n else:\\n f.write(f'{line[1]}\\\\n')\\nexit(0)\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"with open(\\\"user.out\\\", \\\"w\\\") as Solution:\\n for root in map(loads, stdin):\\n Solution.write(f\\\"{sum( 1 for node in root if node is not None )}\\\\n\\\")\\nexit()\",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n left = root.left\\n right = root.right\\n leftDepth = 0 #这里初始为0是有目的的，为了下面求指数方便\\n rightDepth = 0\\n while left: #求左子树深度\\n left = left.left\\n leftDepth += 1\\n while right: #求右子树深度\\n right = right.right\\n rightDepth += 1\\n if leftDepth == rightDepth:\\n return (2 << leftDepth) - 1 #注意(2<<1) 相当于2^2，所以leftDepth初始为0\\n return self.countNodes(root.left) + self.countNodes(root.right) + 1\\n \\n\\n\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"import sys\\n\\nwith open('user.out', 'w') as f:\\n while True:\\n line = sys.stdin.readline().strip()\\n if not line:\\n break\\n if len(line.split(\\\",\\\"))!=1:\\n f.write(f'{len(line.split(\\\",\\\"))}\\\\n')\\n else:\\n if line[1]==\\\"]\\\":\\n f.write(f'0\\\\n')\\n else:\\n f.write(f'{line[1]}\\\\n')\\n\\nexit(0)\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"import sys\\n\\nwith open('user.out', 'w') as f:\\n while True:\\n line = sys.stdin.readline().strip()\\n if not line:\\n break\\n if line[1]==\\\"]\\\":\\n f.write(f'0\\\\n')\\n else:\\n f.write(f'{len(line.split(\\\",\\\"))}\\\\n')\\n\\nexit(0)\",\n \"runtime\": \"34\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n\\n if root==None:\\n return 0\\n \\n if root.left==None and root.right==None:\\n return 1\\n\\n \\n return 1+ self.countNodes(root.left) +self.countNodes(root.right)\\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\\n def dfs(self, node):\\n if not node:\\n return 0\\n \\n left = self.dfs(node.left)\\n right = self.dfs(node.right)\\n return (left + right) + 1\\n\\n def countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n \\n ans = self.dfs(root)\\n return ans\",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n l, r = 0,0\\n c = root\\n while c:\\n l+=1\\n c = c.left\\n c = root\\n while c:\\n r+=1\\n c=c.right\\n if l==r:\\n return pow(2,l)-1\\n return 1+self.countNodes(root.left)+self.countNodes(root.right)\",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n def countt (root):\\n if not root:\\n return 0\\n \\n return 1 + countt(root.left) + countt(root.right)\\n\\n nodes_num = countt(root)\\n return nodes_num \\n \",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n def count_left_height(node):\\n height = 0\\n while node:\\n height += 1\\n node = node.left\\n return height\\n def count_right_height(node):\\n height = 0\\n while node:\\n height += 1\\n node = node.right\\n return height\\n def count_nodes(node):\\n if not node: return 0\\n left_height = count_left_height(node)\\n right_height = count_right_height(node)\\n if left_height == right_height:\\n return pow(2, left_height) - 1\\n return 1 + count_nodes(node.left) + count_nodes(node.right)\\n return count_nodes(root)\\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n left_d = 0\\n cur = root.left\\n while cur:\\n left_d += 1\\n cur = cur.left\\n right_d = 0\\n cur = root.right\\n while cur:\\n right_d += 1\\n cur = cur.right\\n if left_d == right_d:\\n return 2**(left_d+1)-1\\n else:\\n return 1+self.countNodes(root.left)+self.countNodes(root.right)\",\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 getHeight(self, root: Optional[TreeNode]) -> int:\\n count = 0\\n while root:\\n count += 1\\n root = root.left\\n return count\\n def exits(self, index: int, height: int, node: Optional[TreeNode]) -> bool:\\n left, right = 0, (1<<(height-1))-1\\n for _ in range(height-1):\\n mid = (left + right) // 2\\n if index <= mid:\\n node = node.left\\n right = mid\\n else:\\n node = node.right\\n left = mid\\n return node is not None\\n def countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n height = self.getHeight(root)\\n numNodesExceptLast = ((1 << (height-1)) - 1)\\n\\n left, right = 0, (1<<(height-1))-1\\n while left <= right:\\n mid = (left + right) // 2\\n if self.exits(mid, height, root):\\n left = mid + 1\\n else:\\n right = mid - 1\\n print (numNodesExceptLast, left)\\n return numNodesExceptLast + left\\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 compute_depth(self, node: TreeNode):\\n d = 0\\n while node.left:\\n node = node.left\\n d += 1\\n return d\\n\\n def exist(self, idx, d, node):\\n left, right = 0, 2**d - 1\\n for _ in range(d):\\n pivot = (left+right)//2\\n if idx <= pivot:\\n node = node.left\\n right = pivot\\n else:\\n node = node.right\\n left = pivot + 1\\n return node is not None\\n\\n def countNodes(self, root: Optional[TreeNode]):\\n if not root:\\n return 0\\n \\n d = self.compute_depth(root)\\n \\n if d == 0:\\n return 1\\n \\n left, right = 0, 2**d - 1\\n while left <= right:\\n pivot = (left+right)//2\\n if self.exist(pivot, d, root):\\n left = pivot + 1\\n else:\\n right = pivot -1\\n\\n return (2**d -1) + left\\n\\n\\n # def countNodes(self, root: Optional[TreeNode]) -> int:\\n # count = 0\\n # if not root: return count\\n\\n # stack = [root]\\n\\n # while stack:\\n # node = stack.pop()\\n # count += 1\\n # if node.left: stack.append(node.left)\\n # if node.right: stack.append(node.right)\\n\\n # return count\\n\\n\\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n def getTreeHeight(root: Optional[TreeNode]) -> int:\\n if root is None:\\n return 0\\n else:\\n return getTreeHeight(root.left) + 1\\n \\n treeHeight = getTreeHeight(root)\\n\\n def isFull(root: Optional[TreeNode], treeHeight: int) -> bool:\\n if root is None:\\n return treeHeight == 0\\n \\n return isFull(root.right, treeHeight - 1)\\n \\n nodeCount = 0\\n\\n def countNodesRecurse(root: Optional[TreeNode], treeHeight: int) -> None:\\n nonlocal nodeCount\\n\\n if root is None:\\n return\\n \\n if isFull(root.left, treeHeight - 1):\\n nodeCount += 2**(treeHeight - 1) # size of left subtree + 1 for current node\\n countNodesRecurse(root.right, treeHeight - 1)\\n else:\\n # right subtree is full, but with treeHeight - 2\\n nodeCount += 2**(treeHeight - 2) # size of right subtree + 1 for current node\\n countNodesRecurse(root.left, treeHeight - 1)\\n \\n countNodesRecurse(root, treeHeight)\\n return nodeCount\",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n lh,rh=0,0\\n curr=root\\n while curr:\\n lh+=1\\n curr=curr.left\\n curr=root\\n while curr:\\n rh+=1\\n curr=curr.right\\n if lh==rh:\\n return pow(2,lh)-1\\n return 1+self.countNodes(root.left)+self.countNodes(root.right)\",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n return self.countNodesHelper(root)\\n \\n def countNodesHelper(self,root):\\n if root == None:\\n return 0\\n leftHeight = self.getLeftHeight(root)\\n rightHeight = self.getRightHeight(root)\\n if leftHeight == rightHeight:\\n return pow(2,leftHeight)-1\\n else:\\n return 1+self.countNodesHelper(root.left)+self.countNodesHelper(root.right)\\n \\n def getLeftHeight(self,root):\\n if root == None:\\n return 0\\n else:\\n return 1+self.getLeftHeight(root.left)\\n \\n def getRightHeight(self,root):\\n if root == None:\\n return 0\\n else:\\n return 1+self.getRightHeight(root.right)\\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if root is None:\\n return 0\\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n def getDepth(node):\\n depth = 0\\n while node:\\n depth += 1\\n node = node.left\\n\\n return depth\\n\\n if root == None:\\n return 0\\n \\n left_depth = getDepth(root.left)\\n right_depth = getDepth(root.right)\\n\\n if left_depth == right_depth:\\n nodes = (2 ** left_depth) + self.countNodes(root.right)\\n else:\\n nodes = (2 ** right_depth) + self.countNodes(root.left)\\n\\n return nodes\",\n \"runtime\": \"45\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n elif not root.left and not root.right:\\n return 1\\n elif root.left and not root.right:\\n return 2\\n def level(node):\\n height = 0\\n while node:\\n height += 1\\n node = node.left\\n return height\\n left = level(root.left)\\n right = level(root.right)\\n if left == right:\\n return 2**left + self.countNodes(root.right)\\n else:\\n return self.countNodes(root.left) + 2**right\\n \\n\\n \",\n \"runtime\": \"45\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if root is None:\\n return 0\\n \\n def leftheight(root):\\n height = 0\\n while root:\\n height+=1\\n root = root.left\\n \\n \\n return height\\n \\n def rightheight(root):\\n height = 0\\n while root:\\n height+=1\\n root = root.right\\n \\n \\n return height\\n\\n left = leftheight(root.left)\\n right = rightheight(root.right)\\n\\n if left== right:\\n return pow(2,left+1)-1\\n \\n else:\\n return 1+ self.countNodes(root.left) + self.countNodes(root.right)\",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n\\n if root is None:\\n return 0\\n elif root.left is None:\\n return 1\\n elif root.right is None:\\n return 2\\n\\n left_depth = self.get_tree_depth(root.left)\\n right_depth = self.get_tree_depth(root.right)\\n\\n if left_depth == right_depth:\\n num_of_nodes_in_left_subtree = 2 ** (left_depth+1) - 1 # is a formula to compute the no. of nodes in a complete tree of height == left_depth.\\n return num_of_nodes_in_left_subtree + 1 + self.countNodes(root.right) # the '+1' is for the current root node.\\n\\n else: # left_depth != right_depth\\n num_of_nodes_in_right_subtree = 2 ** (right_depth+1) - 1 \\n return self.countNodes(root.left) + 1 + num_of_nodes_in_right_subtree \\n \\n\\n\\n def get_tree_depth(self, root):\\n if root.left is None:\\n return 0 \\n else:\\n return self.get_tree_depth(root.left) + 1\\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n return 1+self.countNodes(root.left)+self.countNodes(root.right)\",\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\\nfrom collections import deque\\nclass Solution:\\n def countNodes(self, root: Optional[TreeNode]) -> int:\\n answer = 0\\n if root == None:\\n return 0\\n queue = deque([root])\\n answer = 1\\n while queue:\\n node = queue.popleft()\\n if node.left:\\n queue.append(node.left)\\n answer += 1\\n if node.right:\\n queue.append(node.right)\\n answer += 1\\n return answer \",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n count = 1\\n if root.left:\\n count += self.countNodes(root.left)\\n if root.right:\\n count += self.countNodes(root.right)\\n return count\",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n\\n count=1\\n if root.left is not None:\\n count+=self.countNodes(root.left)\\n if root.right is not None:\\n count+=self.countNodes(root.right)\\n return count\",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n res = []\\n\\n def dfs(node):\\n if not node: return\\n\\n dfs(node.left)\\n res.append(node.val)\\n dfs(node.right)\\n \\n \\n dfs(root)\\n return len(res)\",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if root == None:\\n return 0\\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n lh,rh=0,0\\n curr=root\\n while curr:\\n lh+=1\\n curr=curr.left\\n curr=root\\n while curr:\\n rh+=1\\n curr=curr.right\\n if lh==rh:\\n return pow(2,lh)-1\\n return 1+self.countNodes(root.left)+self.countNodes(root.right)\",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\",\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 countNodes(self, root: TreeNode | None) -> int:\\n if not root:\\n return 0\\n\\n left = root\\n right = root\\n heightL = 0\\n heightR = 0\\n\\n while left:\\n heightL += 1\\n left = left.left\\n\\n while right:\\n heightR += 1\\n right = right.right\\n\\n if heightL == heightR: # `root` is a complete tree.\\n return pow(2, heightL) - 1\\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if root == None:\\n return 0\\n count = 1\\n left = self.countNodes(root.left)\\n right = self.countNodes(root.right)\\n count += left + right\\n return count\\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n return self.countNodesHelper(root)\\n \\n def countNodesHelper(self,root):\\n if root == None:\\n return 0\\n else:\\n return 1+self.countNodesHelper(root.left)+self.countNodesHelper(root.right)\",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n count = [0]\\n def dfs(root, count):\\n if not root:\\n return\\n count[0] += 1\\n dfs(root.left, count)\\n dfs(root.right, count)\\n\\n dfs(root, count)\\n return count[0]\",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\",\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\\n # compare the depth between left sub tree and right sub tree.\\n # A, If it is equal, it means the left sub tree is a full binary tree\\n # B, It it is not , it means the right sub tree is a full binary tree\\n\\n def countNodes(self, root: Optional[TreeNode]) -> int:\\n\\n if root is None:\\n return 0\\n elif root.left is None:\\n return 1\\n elif root.right is None:\\n return 2\\n\\n left_depth = self.get_tree_depth(root.left)\\n right_depth = self.get_tree_depth(root.right)\\n\\n if left_depth == right_depth:\\n num_of_nodes_in_left_subtree = 2 ** (left_depth+1) - 1 # is a formula to compute the no. of nodes in a complete tree of height == left_depth.\\n return num_of_nodes_in_left_subtree + 1 + self.countNodes(root.right) # the '+1' is for the current root node.\\n\\n else: # left_depth != right_depth\\n num_of_nodes_in_right_subtree = 2 ** (right_depth+1) - 1 \\n return self.countNodes(root.left) + 1 + num_of_nodes_in_right_subtree \\n \\n\\n\\n def get_tree_depth(self, root):\\n if root.left is None:\\n return 0 \\n else:\\n return self.get_tree_depth(root.left) + 1\\n\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def countNodes(self, root):\\n if root is None:\\n return 0\\n \\n # Find the left and right heights\\n lh = self.findlheight(root)\\n rh = self.findrheight(root)\\n \\n if lh == rh:\\n return (1 << lh) - 1\\n else:\\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\\n\\n def findlheight(self, node):\\n h = 0\\n while node:\\n h += 1\\n node = node.left\\n return h\\n\\n def findrheight(self, node):\\n h = 0\\n while node:\\n h += 1\\n node = node.right\\n return h\\n\\n\\n\",\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\\nfrom collections import deque\\nclass Solution:\\n def countNodes(self, root: Optional[TreeNode]) -> int:\\n q = deque()\\n if root==None:\\n return 0\\n n = 0\\n q.append(root)\\n while(q):\\n u = q.popleft()\\n n += 1\\n if u.left:\\n q.append(u.left)\\n if u.right:\\n q.append(u.right)\\n return n\\n\\n\\n \",\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 get_left_h(self, root):\\n i = 0\\n while root:\\n i += 1\\n root = root.left\\n return i\\n\\n def get_right_h(self, root):\\n i = 0\\n while root:\\n i += 1\\n root = root.right\\n return i\\n\\n def get_heights(self, root):\\n if root is None:\\n return (0, 0)\\n return (self.get_left_h(root.left) + 1, self.get_right_h(root.right) + 1)\\n\\n def countNodes(self, root: Optional[TreeNode]) -> int:\\n min_h, max_h = self.get_heights(root)\\n\\n if min_h == max_h:\\n return 2**min_h - 1\\n \\n l_min_h, l_max_h = self.get_heights(root.left)\\n r_min_h, r_max_h = self.get_heights(root.right)\\n\\n if l_min_h != l_max_h:\\n l_nodes = self.countNodes(root.left)\\n return l_nodes + 1 + (2**r_min_h - 1)\\n if r_min_h != r_max_h:\\n r_nodes = self.countNodes(root.right)\\n return (2**l_min_h - 1) + 1 + r_nodes\\n return (2**l_min_h - 1) + 1 + (2**r_min_h - 1)\\n \\n\\n\\n \\n \\n \\n \",\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root: return 0\\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\",\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 def countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n\\n left = right = root\\n l = r = 1\\n \\n while left := left.left:\\n l += 1\\n\\n while right := right.right:\\n r += 1\\n\\n if l == r:\\n return 2**l - 1\\n\\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\\n\\n # return self.countNodes(root.left) + self.countNodes(root.right) + 1\\n \",\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 def countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n count=1\\n if root.left is not None:\\n count+= self.countNodes(root.left)\\n if root.right is not None:\\n count+= self.countNodes(root.right)\\n return count \\n\\n \",\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 def countNodes(self, root: Optional[TreeNode]) -> int:\\n\\n def dfs(node, sum=0):\\n if node is None:\\n return 0\\n \\n sum+=1\\n left_gain = dfs(node.left)\\n right_gain = dfs(node.right)\\n return sum + left_gain + right_gain\\n\\n return dfs(root,0)\\n \",\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 def countNodes(self, root: Optional[TreeNode]) -> int:\\n def get_height(node, count, left=False):\\n if left:\\n if node.left:\\n return get_height(node.left, count+1, left=left)\\n return count\\n else:\\n if node.right:\\n return get_height(node.right, count+1, left=left)\\n return count\\n \\n \\n\\n def traverse_tree(node):\\n left_height = get_height(node, 1, left=True)\\n right_height = get_height(node, 1)\\n if left_height == right_height:\\n return (2**(left_height))-1\\n left_nodes = 0\\n right_nodes = 0\\n if node.left:\\n left_nodes = traverse_tree(node.left)\\n if node.right:\\n right_nodes = traverse_tree(node.right)\\n return left_nodes + right_nodes + 1\\n\\n res = 0\\n if root:\\n res = traverse_tree(root)\\n return res\\n\\n \\n \",\n \"runtime\": \"59\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n # #BFS doesnt matter if complete or not\\n # from collections import deque\\n # counter = 1\\n # if not root:\\n # return 0\\n # queue = deque([root])\\n # while queue:\\n # curr = queue.popleft()\\n # if curr.left:\\n # queue.append(curr.left)\\n # counter += 1\\n # if curr.right:\\n # queue.append(curr.right)\\n # counter += 1\\n # return counter\\n\\n #recursion\\n def count(root):\\n if not root:\\n return 0\\n return count(root.left) + count(root.right) + 1\\n return count(root)\\n \",\n \"runtime\": \"59\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n nodes = 0\\n if not root:\\n return 0\\n\\n nodes += 1 \\n nodes += self.countNodes(root.left)\\n nodes += self.countNodes(root.right)\\n \\n return nodes\\n \",\n \"runtime\": \"60\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n \\n if root is None:\\n return 0\\n\\n current = root\\n left_height = 0\\n while current:\\n left_height += 1\\n current = current.left\\n\\n current = root\\n right_height = 0\\n while current:\\n right_height += 1\\n current = current.right\\n\\n if left_height == right_height:\\n return 2**right_height - 1\\n \\n current = root\\n left = self.countNodes(current.left)\\n right = self.countNodes(current.right)\\n\\n\\n return left + right + 1\",\n \"runtime\": \"60\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n count=0\\n def nodes(curr):\\n nonlocal count\\n count+=1\\n if curr.left:\\n nodes(curr.left)\\n if curr.right:\\n nodes(curr.right)\\n if root:\\n nodes(root)\\n return count\",\n \"runtime\": \"61\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n return 1+self.countNodes(root.left)+self.countNodes(root.right)\",\n \"runtime\": \"61\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n\\n left = self.getH(root.left)\\n right = self.getH(root.right)\\n\\n if left == right: #左右一样说明要么完全要么缺右边 说明左边完整\\n return (1 << left) + self.countNodes(root.right) # 左边加上当前正好两倍数\\n # 最终我们找到多出来的这个节点，然后正好是\\n else: # 最后左右不平衡的那个节点就是刚好右边缺失的\\n # 说明其实是左边多了\\n return (1 << right) + self.countNodes(root.left)\\n\\n def getH(self, node):\\n depth = 0\\n while(node):\\n depth+=1\\n node = node.left\\n \\n\\n return depth\",\n \"runtime\": \"62\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n def tree_height(node):\\n if not node:\\n return 0\\n return 1 + tree_height(node.left)\\n\\n if not root:\\n return 0\\n\\n left_height = tree_height(root.left)\\n right_height = tree_height(root.right)\\n\\n if left_height == right_height:\\n # Left subtree is a perfect binary tree\\n return (1 << left_height) + self.countNodes(root.right)\\n else:\\n # Right subtree is a perfect binary tree\\n return (1 << right_height) + self.countNodes(root.left)\",\n \"runtime\": \"62\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n count = 0\\n stack = [root] \\n while stack:\\n node = stack.pop()\\n if node:\\n stack.append(node.right)\\n stack.append(node.left)\\n count+=1\\n return count\\n \",\n \"runtime\": \"63\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if root is None:\\n return 0\\n\\n cur_level = [root]\\n node_count = 0\\n while len(cur_level):\\n all_none = True\\n next_level = []\\n for node in cur_level:\\n if node is None:\\n continue\\n node_count += 1\\n all_none = False\\n next_level.append(node.left)\\n next_level.append(node.right)\\n if all_none:\\n break\\n cur_level = next_level\\n return node_count\",\n \"runtime\": \"63\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n count = 0\\n def helper(root):\\n nonlocal count\\n if root:\\n count += 1\\n helper(root.left)\\n helper(root.right)\\n helper(root)\\n return count \",\n \"runtime\": \"64\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n count = 1\\n\\n if root.left is not None:\\n count += self.countNodes(root.left)\\n if root.right is not None:\\n count += self.countNodes(root.right)\\n\\n return count\\n \",\n \"runtime\": \"64\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n from collections import deque\\n counter = 1\\n if not root:\\n return 0\\n queue = deque([root])\\n while queue:\\n curr = queue.popleft()\\n if curr.left:\\n queue.append(curr.left)\\n counter += 1\\n if curr.right:\\n queue.append(curr.right)\\n counter += 1\\n return counter\\n \",\n \"runtime\": \"65\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n res = 0\\n stack = [root]\\n while stack:\\n curr = stack.pop()\\n if curr:\\n res += 1\\n stack.append(curr.left)\\n stack.append(curr.right)\\n return res\",\n \"runtime\": \"65\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n def count(root):\\n if not root:\\n return 0\\n return 1 + count(root.left) + count(root.right)\\n return count(root)\",\n \"runtime\": \"66\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\\n \\n\\n\",\n \"runtime\": \"66\"\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.count = 0\\n def countNodes(self, root: Optional[TreeNode]) -> int:\\n count = self.r(root)\\n return self.count\\n\\n def r(self,root):\\n \\n if(not root):\\n return\\n self.count += 1\\n self.r(root.left)\\n self.r(root.right)\\n\",\n \"runtime\": \"67\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if root == None: return 0\\n left, right = root, root\\n h_l, h_r = 0, 0\\n while left != None:\\n h_l += 1\\n left = left.left\\n while right != None:\\n h_r += 1\\n right = right.right\\n if h_l == h_r: return(1<<h_l) -1\\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\",\n \"runtime\": \"67\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n return 1 + self.countNodes(root.left) + self.countNodes(root.right) \",\n \"runtime\": \"68\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":62,"string":"62"},"mm_list":{"kind":"list like","value":[{"code":"import sys\n\nwith open('user.out', 'w') as f:\n while True:\n line = sys.stdin.readline().strip()\n print(line)\n if not line:\n break\n print(line)\n if len(line.split(\",\"))!=1:\n f.write(f'{len(line.split(\",\"))}\\n')\n else:\n if line[1]==\"]\":\n f.write(f'0\\n')\n else:\n f.write(f'{line[1]}\\n')\n\nexit(0)","memory":"16900"},{"code":"import sys\n\nwith open('user.out', 'w') as f:\n while True:\n line = sys.stdin.readline().strip()\n print(line)\n if not line:\n break\n print(line)\n if len(line.split(\",\"))!=1:\n f.write(f'{len(line.split(\",\"))}\\n')\n else:\n if line[1]==\"]\":\n f.write(f'0\\n')\n else:\n f.write(f'{line[1]}\\n')\n\nexit(0)","memory":"16900"},{"code":"import sys\nwith open('user.out', 'w') as f:\n while True:\n line = sys.stdin.readline().strip()\n print(line)\n if not line:\n break\n print(line)\n if len(line.split(\",\"))!=1:\n f.write(f'{len(line.split(\",\"))}\\n')\n else:\n if line[1]==\"]\":\n f.write(f'0\\n')\n else:\n f.write(f'{line[1]}\\n')\nexit(0)","memory":"17000"},{"code":"import sys\n\nwith open('user.out', 'w') as f:\n while True:\n line = sys.stdin.readline()\n if not line:\n break\n if line[1]==\"]\":\n f.write(f'0\\n')\n else:\n f.write(f'{len(line.split(\",\"))}\\n')\n\nexit(0)","memory":"17100"},{"code":"import sys\n\nwith open('user.out', 'w') as f:\n while True:\n line = sys.stdin.readline().strip()\n if not line:\n break\n if line[1]==\"]\":\n f.write(f'0\\n')\n else:\n f.write(f'{len(line.split(\",\"))}\\n')\n\nexit(0)","memory":"17200"},{"code":"import sys\n\nwith open('user.out', 'w') as f:\n while True:\n line = sys.stdin.readline().strip()\n if not line:\n break\n if line[1]==\"]\":\n f.write(f'0\\n')\n else:\n f.write(f'{len(line.split(\",\"))}\\n')\n\nexit(0)","memory":"17200"},{"code":"with open(\"user.out\", \"w\") as Solution:\n for root in map(loads, stdin):\n Solution.write(f\"{sum( 1 for node in root if node is not None )}\\n\")\nexit()","memory":"17300"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n return self.getNodesNum(root)\n\n def getNodesNum(self, cur):\n if not cur:\n return 0\n leftSum = self.getNodesNum(cur.left)\n rightSum = self.getNodesNum(cur.right)\n\n treeNum = 1 + leftSum + rightSum\n\n return treeNum\n ","memory":"21100"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n r=0\n def fun(root):\n nonlocal r\n if root:\n r+=1\n fun(root.left)\n fun(root.right)\n fun(root)\n return r\n","memory":"21200"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n \n left_height = self.get_height(root, True)\n right_height = self.get_height(root, False)\n \n if left_height == right_height:\n return (1 << left_height) - 1 # 2^left_height - 1\n \n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\n \n def get_height(self, node: Optional[TreeNode], is_left: bool) -> int:\n height = 0\n while node:\n height += 1\n node = node.left if is_left else node.right\n return height\n\n# Example usage:\n# root = TreeNode(1, TreeNode(2, TreeNode(4), TreeNode(5)), TreeNode(3, TreeNode(6)))\n# solution = Solution()\n# print(solution.countNodes(root)) # Output: 6","memory":"21300"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n left = self.countNodes(root.left)\n right = self.countNodes(root.right)\n return 1 + left + right\n # O(n) time, O(logn) space","memory":"21300"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n num = 0\n\n def traverse(root):\n nonlocal num\n if not root: return\n \n num +=1\n traverse(root.left)\n traverse(root.right)\n \n traverse(root)\n\n return num","memory":"21400"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n res = [0]\n def dfs(node):\n if not node:\n return\n res[0] += 1\n dfs(node.left)\n dfs(node.right)\n dfs(root)\n return res[0]","memory":"21500"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n elif not root.left and not root.right:\n return 1\n elif root.left and not root.right:\n return 2\n def level(node):\n height = 0\n while node:\n height += 1\n node = node.left\n return height\n left = level(root.left)\n right = level(root.right)\n if left == right:\n return 2**left + self.countNodes(root.right)\n else:\n return self.countNodes(root.left) + 2**right\n \n\n ","memory":"21500"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n count = 0\n stack = [root] \n while stack:\n node = stack.pop()\n if node:\n stack.append(node.right)\n stack.append(node.left)\n count+=1\n return count\n ","memory":"21600"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root: return 0\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)","memory":"21600"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n def count(root):\n if not root:\n return 0\n return 1 + count(root.left) + count(root.right)\n return count(root)","memory":"21700"},{"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 left(self, root):\n if root is None:\n return 0\n return 1 + self.left(root.left)\n def right(self, root):\n if root is None:\n return 0\n return 1 + self.right(root.right)\n def countNodes(self, root: Optional[TreeNode]) -> int:\n if root is None:\n return 0\n lh = self.left(root)\n rh = self.right(root)\n if lh==rh:\n return (2**lh)-1\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\n \n\n ","memory":"21700"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n\n if root is None:\n return 0\n elif root.left is None:\n return 1\n elif root.right is None:\n return 2\n\n left_depth = self.get_tree_depth(root.left)\n right_depth = self.get_tree_depth(root.right)\n\n if left_depth == right_depth:\n num_of_nodes_in_left_subtree = 2 ** (left_depth+1) - 1 # is a formula to compute the no. of nodes in a complete tree of height == left_depth.\n return num_of_nodes_in_left_subtree + 1 + self.countNodes(root.right) # the '+1' is for the current root node.\n\n else: # left_depth != right_depth\n num_of_nodes_in_right_subtree = 2 ** (right_depth+1) - 1 \n return self.countNodes(root.left) + 1 + num_of_nodes_in_right_subtree \n \n\n\n def get_tree_depth(self, root):\n if root.left is None:\n return 0 \n else:\n return self.get_tree_depth(root.left) + 1\n","memory":"21800"},{"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 countNodes(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n count=1\n if root.left is not None:\n count+= self.countNodes(root.left)\n if root.right is not None:\n count+= self.countNodes(root.right)\n return count \n\n ","memory":"21800"}],"string":"[\n {\n \"code\": \"import sys\\n\\nwith open('user.out', 'w') as f:\\n while True:\\n line = sys.stdin.readline().strip()\\n print(line)\\n if not line:\\n break\\n print(line)\\n if len(line.split(\\\",\\\"))!=1:\\n f.write(f'{len(line.split(\\\",\\\"))}\\\\n')\\n else:\\n if line[1]==\\\"]\\\":\\n f.write(f'0\\\\n')\\n else:\\n f.write(f'{line[1]}\\\\n')\\n\\nexit(0)\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"import sys\\n\\nwith open('user.out', 'w') as f:\\n while True:\\n line = sys.stdin.readline().strip()\\n print(line)\\n if not line:\\n break\\n print(line)\\n if len(line.split(\\\",\\\"))!=1:\\n f.write(f'{len(line.split(\\\",\\\"))}\\\\n')\\n else:\\n if line[1]==\\\"]\\\":\\n f.write(f'0\\\\n')\\n else:\\n f.write(f'{line[1]}\\\\n')\\n\\nexit(0)\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"import sys\\nwith open('user.out', 'w') as f:\\n while True:\\n line = sys.stdin.readline().strip()\\n print(line)\\n if not line:\\n break\\n print(line)\\n if len(line.split(\\\",\\\"))!=1:\\n f.write(f'{len(line.split(\\\",\\\"))}\\\\n')\\n else:\\n if line[1]==\\\"]\\\":\\n f.write(f'0\\\\n')\\n else:\\n f.write(f'{line[1]}\\\\n')\\nexit(0)\",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"import sys\\n\\nwith open('user.out', 'w') as f:\\n while True:\\n line = sys.stdin.readline()\\n if not line:\\n break\\n if line[1]==\\\"]\\\":\\n f.write(f'0\\\\n')\\n else:\\n f.write(f'{len(line.split(\\\",\\\"))}\\\\n')\\n\\nexit(0)\",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"import sys\\n\\nwith open('user.out', 'w') as f:\\n while True:\\n line = sys.stdin.readline().strip()\\n if not line:\\n break\\n if line[1]==\\\"]\\\":\\n f.write(f'0\\\\n')\\n else:\\n f.write(f'{len(line.split(\\\",\\\"))}\\\\n')\\n\\nexit(0)\",\n \"memory\": \"17200\"\n },\n {\n \"code\": \"import sys\\n\\nwith open('user.out', 'w') as f:\\n while True:\\n line = sys.stdin.readline().strip()\\n if not line:\\n break\\n if line[1]==\\\"]\\\":\\n f.write(f'0\\\\n')\\n else:\\n f.write(f'{len(line.split(\\\",\\\"))}\\\\n')\\n\\nexit(0)\",\n \"memory\": \"17200\"\n },\n {\n \"code\": \"with open(\\\"user.out\\\", \\\"w\\\") as Solution:\\n for root in map(loads, stdin):\\n Solution.write(f\\\"{sum( 1 for node in root if node is not None )}\\\\n\\\")\\nexit()\",\n \"memory\": \"17300\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n return self.getNodesNum(root)\\n\\n def getNodesNum(self, cur):\\n if not cur:\\n return 0\\n leftSum = self.getNodesNum(cur.left)\\n rightSum = self.getNodesNum(cur.right)\\n\\n treeNum = 1 + leftSum + rightSum\\n\\n return treeNum\\n \",\n \"memory\": \"21100\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n r=0\\n def fun(root):\\n nonlocal r\\n if root:\\n r+=1\\n fun(root.left)\\n fun(root.right)\\n fun(root)\\n return r\\n\",\n \"memory\": \"21200\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n \\n left_height = self.get_height(root, True)\\n right_height = self.get_height(root, False)\\n \\n if left_height == right_height:\\n return (1 << left_height) - 1 # 2^left_height - 1\\n \\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\\n \\n def get_height(self, node: Optional[TreeNode], is_left: bool) -> int:\\n height = 0\\n while node:\\n height += 1\\n node = node.left if is_left else node.right\\n return height\\n\\n# Example usage:\\n# root = TreeNode(1, TreeNode(2, TreeNode(4), TreeNode(5)), TreeNode(3, TreeNode(6)))\\n# solution = Solution()\\n# print(solution.countNodes(root)) # Output: 6\",\n \"memory\": \"21300\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n left = self.countNodes(root.left)\\n right = self.countNodes(root.right)\\n return 1 + left + right\\n # O(n) time, O(logn) space\",\n \"memory\": \"21300\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n num = 0\\n\\n def traverse(root):\\n nonlocal num\\n if not root: return\\n \\n num +=1\\n traverse(root.left)\\n traverse(root.right)\\n \\n traverse(root)\\n\\n return num\",\n \"memory\": \"21400\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n res = [0]\\n def dfs(node):\\n if not node:\\n return\\n res[0] += 1\\n dfs(node.left)\\n dfs(node.right)\\n dfs(root)\\n return res[0]\",\n \"memory\": \"21500\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n elif not root.left and not root.right:\\n return 1\\n elif root.left and not root.right:\\n return 2\\n def level(node):\\n height = 0\\n while node:\\n height += 1\\n node = node.left\\n return height\\n left = level(root.left)\\n right = level(root.right)\\n if left == right:\\n return 2**left + self.countNodes(root.right)\\n else:\\n return self.countNodes(root.left) + 2**right\\n \\n\\n \",\n \"memory\": \"21500\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n count = 0\\n stack = [root] \\n while stack:\\n node = stack.pop()\\n if node:\\n stack.append(node.right)\\n stack.append(node.left)\\n count+=1\\n return count\\n \",\n \"memory\": \"21600\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root: return 0\\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\",\n \"memory\": \"21600\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n def count(root):\\n if not root:\\n return 0\\n return 1 + count(root.left) + count(root.right)\\n return count(root)\",\n \"memory\": \"21700\"\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 left(self, root):\\n if root is None:\\n return 0\\n return 1 + self.left(root.left)\\n def right(self, root):\\n if root is None:\\n return 0\\n return 1 + self.right(root.right)\\n def countNodes(self, root: Optional[TreeNode]) -> int:\\n if root is None:\\n return 0\\n lh = self.left(root)\\n rh = self.right(root)\\n if lh==rh:\\n return (2**lh)-1\\n return 1 + self.countNodes(root.left) + self.countNodes(root.right)\\n \\n\\n \",\n \"memory\": \"21700\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n\\n if root is None:\\n return 0\\n elif root.left is None:\\n return 1\\n elif root.right is None:\\n return 2\\n\\n left_depth = self.get_tree_depth(root.left)\\n right_depth = self.get_tree_depth(root.right)\\n\\n if left_depth == right_depth:\\n num_of_nodes_in_left_subtree = 2 ** (left_depth+1) - 1 # is a formula to compute the no. of nodes in a complete tree of height == left_depth.\\n return num_of_nodes_in_left_subtree + 1 + self.countNodes(root.right) # the '+1' is for the current root node.\\n\\n else: # left_depth != right_depth\\n num_of_nodes_in_right_subtree = 2 ** (right_depth+1) - 1 \\n return self.countNodes(root.left) + 1 + num_of_nodes_in_right_subtree \\n \\n\\n\\n def get_tree_depth(self, root):\\n if root.left is None:\\n return 0 \\n else:\\n return self.get_tree_depth(root.left) + 1\\n\",\n \"memory\": \"21800\"\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 countNodes(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n count=1\\n if root.left is not None:\\n count+= self.countNodes(root.left)\\n if root.right is not None:\\n count+= self.countNodes(root.right)\\n return count \\n\\n \",\n \"memory\": \"21800\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":20,"string":"20"}}},{"rowIdx":150,"cells":{"question_id":{"kind":"number","value":223,"string":"223"},"name":{"kind":"string","value":"rectangle-area"},"content":{"kind":"string","value":"<p>Given the coordinates of two <strong>rectilinear</strong> rectangles in a 2D plane, return <em>the total area covered by the two rectangles</em>.</p>\n\n<p>The first rectangle is defined by its <strong>bottom-left</strong> corner <code>(ax1, ay1)</code> and its <strong>top-right</strong> corner <code>(ax2, ay2)</code>.</p>\n\n<p>The second rectangle is defined by its <strong>bottom-left</strong> corner <code>(bx1, by1)</code> and its <strong>top-right</strong> corner <code>(bx2, by2)</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"Rectangle Area\" src=\"https://assets.leetcode.com/uploads/2021/05/08/rectangle-plane.png\" style=\"width: 700px; height: 365px;\" />\n<pre>\n<strong>Input:</strong> ax1 = -3, ay1 = 0, ax2 = 3, ay2 = 4, bx1 = 0, by1 = -1, bx2 = 9, by2 = 2\n<strong>Output:</strong> 45\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> ax1 = -2, ay1 = -2, ax2 = 2, ay2 = 2, bx1 = -2, by1 = -2, bx2 = 2, by2 = 2\n<strong>Output:</strong> 16\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>-10<sup>4</sup> <= ax1 <= ax2 <= 10<sup>4</sup></code></li>\n\t<li><code>-10<sup>4</sup> <= ay1 <= ay2 <= 10<sup>4</sup></code></li>\n\t<li><code>-10<sup>4</sup> <= bx1 <= bx2 <= 10<sup>4</sup></code></li>\n\t<li><code>-10<sup>4</sup> <= by1 <= by2 <= 10<sup>4</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":46.635075868326865,"string":"46.635076"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["math","geometry"],"string":"[\n \"math\",\n \"geometry\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"24\", 0.0742], [\"28\", 0.0742], [\"30\", 0.0742], [\"31\", 0.2226], [\"32\", 0.2967], [\"33\", 0.2226], [\"34\", 0.7418], [\"35\", 0.4451], [\"36\", 0.7418], [\"37\", 0.7418], [\"38\", 1.8546], [\"39\", 2.3739], [\"40\", 1.1869], [\"41\", 2.003], [\"42\", 4.1543], [\"43\", 3.7092], [\"44\", 2.3739], [\"45\", 3.8576], [\"46\", 7.3442], [\"47\", 6.7507], [\"48\", 5.8605], [\"49\", 5.638], [\"50\", 7.0475], [\"51\", 5.4154], [\"52\", 5.3412], [\"53\", 5.1929], [\"54\", 6.2315], [\"55\", 5.4154], [\"56\", 2.9674], [\"57\", 3.0415], [\"58\", 2.3739]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16100\", 0.0742], [\"16300\", 0.1484], [\"16400\", 1.0386], [\"16500\", 17.5074], [\"16600\", 44.2878]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def computeArea(self,\n ax1: int, ay1: int,\n ax2: int, ay2: int,\n bx1: int, by1: int,\n bx2: int, by2: int) -> int:\n area1 = (ax2-ax1)*(ay2-ay1)\n area2 = (bx2-bx1)*(by2-by1)\n\n overlap = 0\n overlap_x1 = max(ax1, bx1)\n overlap_x2 = min(ax2, bx2)\n overlap_y1 = max(ay1, by1)\n overlap_y2 = min(ay2, by2)\n if overlap_y2-overlap_y1 >= 0 and overlap_x2 - overlap_x1 >= 0:\n overlap = (overlap_y2-overlap_y1) * (overlap_x2 - overlap_x1)\n \n return area1+area2-overlap","runtime":"24"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n a_area = (ax2-ax1)*(ay2-ay1)\n b_area = (bx2-bx1)*(by2-by1)\n\n overlap_w = max(0, min(ax2,bx2) - max(ax1,bx1))\n overlap_h = max(0, min(ay2,by2) - max(ay1,by1))\n ovelap_area = overlap_w * overlap_h\n\n return (a_area+b_area) - ovelap_area","runtime":"28"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n # Compute the area of the two rectangles\n area1 = (ax2 - ax1) * (ay2 - ay1)\n area2 = (bx2 - bx1) * (by2 - by1)\n \n # Compute the overlap area\n overlapWidth = min(ax2, bx2) - max(ax1, bx1)\n overlapHeight = min(ay2, by2) - max(ay1, by1)\n overlapArea = max(overlapWidth, 0) * max(overlapHeight, 0)\n \n # Compute the total area covered by the two rectangles\n totalArea = area1 + area2 - overlapArea\n \n return totalArea","runtime":"30"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n w = min(ax2, bx2) - max(ax1, bx1)\n h = min(ay2, by2) - max(ay1, by1)\n \n b = abs(by1 - by2) * abs(bx1 - bx2)\n a = abs(ay1 - ay2) * abs(ax1 - ax2)\n return a + b - (w * h if w > 0 and h > 0 else 0)\n \n ","runtime":"31"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n area1 = (ax2 - ax1) * (ay2 - ay1)\n area2 = (bx2 - bx1) * (by2 - by1)\n overlap = max(0, min(ax2, bx2) - max(ax1, bx1)) * max(0, min(ay2, by2) - max(ay1, by1))\n return area1 + area2- overlap","runtime":"32"},{"code":"class Solution:\n def computeArea(\n self,\n ax1: int,\n ay1: int,\n ax2: int,\n ay2: int,\n bx1: int,\n by1: int,\n bx2: int,\n by2: int,\n ) -> int:\n a = (ax2 - ax1) * (ay2 - ay1)\n b = (bx2 - bx1) * (by2 - by1)\n width = min(ax2, bx2) - max(ax1, bx1)\n height = min(ay2, by2) - max(ay1, by1)\n return a + b - max(height, 0) * max(width, 0)\n","runtime":"33"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n # let's do sum minus intersection\n \n def area(x1, y1, x2, y2):\n return abs(x2 - x1) * abs(y2 - y1)\n \n def overlap(ax1, ay1, ax2, ay2, bx1, by1, bx2, by2):\n cx1 = max(ax1, bx1)\n cy1 = max(ay1, by1)\n cx2 = min(ax2, bx2)\n cy2 = min(ay2, by2)\n return area(cx1, cy1, cx2, cy2)\n \n # calculate x overlap\n left = max(ax1, bx1)\n right = min(ax2, bx2)\n x_overlap = right - left\n\n # calculate y overlap\n top = min(ay2, by2)\n bottom = max(ay1, by1)\n y_overlap = top - bottom\n\n area_of_overlap = 0\n # if the rectangles overlap each other, then calculate\n # the area of the overlap\n if x_overlap > 0 and y_overlap > 0:\n area_of_overlap = x_overlap * y_overlap\n \n \n return area(ax1, ay1, ax2, ay2) + area(bx1, by1, bx2, by2) - area_of_overlap","runtime":"36"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n def compute(area):\n if area<0:\n return 0\n else:\n return area\n total= abs(ax1-ax2)*abs(ay1-ay2)+abs(bx1-bx2)*abs(by1-by2)\n cx1=max(ax1,bx1)\n cy1=max(ay1,by1)\n cx2=min(ax2,bx2)\n cy2=min(ay2,by2)\n return total-max(0,cx2-cx1)*max(0,cy2-cy1)\n \n ","runtime":"37"},{"code":"class Solution:\n def computeArea(self, ax1, ay1, ax2, ay2, bx1, by1, bx2, by2):\n area = (ax2-ax1)*(ay2-ay1) + (bx2-bx1)*(by2-by1)\n if (a:=min(ax2, bx2)) > (b:=max(ax1, bx1)) and (c:=min(ay2, by2)) > (d:=max(ay1, by1)):\n return area - ((a-b)*(c-d))\n return area\n intersection = (min(ax2, bx2)-max(ax1, bx1))*(min(ay2, by2)-max(ay1, by1))\n if intersection > 0: area -= intersection\n return area","runtime":"37"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n overlapx1 = bx1\n overlapy1 = by1\n overlapx2 = bx2\n overlapy2 = by2\n \n if overlapy2 > ay2:\n overlapy2 = max(ay2, overlapy1)\n \n if overlapy1 < ay1:\n overlapy1 = min(overlapy2, ay1)\n \n if overlapx1 < ax1:\n overlapx1 = min(overlapx2, ax1)\n \n if overlapx2 > ax2:\n overlapx2 = max(ax2, overlapx1)\n \n a_area = (ay2 - ay1) * (ax2 - ax1)\n b_area = (by2 - by1) * (bx2 - bx1)\n return a_area + b_area - ((overlapx2 - overlapx1) * (overlapy2 - overlapy1))\n \n","runtime":"38"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n\n area1 = (ax2 - ax1) * (ay2 - ay1)\n area2 = (bx2 - bx1) * (by2 - by1)\n\n xOverlap = max(min(ax2, bx2) - max(ax1, bx1), 0)\n yOverlap = max(min(ay2, by2) - max(ay1, by1), 0)\n commonArea = xOverlap * yOverlap \n totalArea = area1 + area2 - commonArea\n \n return totalArea\n\n\n ","runtime":"39"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n ax3=ax1\n ay3=ay2\n ax4=ax2\n ay4=ay1\n\n bx3=bx1\n by3=by2\n bx4=bx2\n by4=by1\n\n totalArea=(ax2-ax1)*(ay2-ay1)+(bx2-bx1)*(by2-by1)\n\n if bx3>=ax1 and bx3<=ax2 and by3>=ay1 and by3<=ay2:\n totalArea-= abs(bx3-min(ax2,bx2))*abs(by3-max(ay1,by1))\n elif bx2>=ax1 and bx2<=ax2 and by2>=ay1 and by2<=ay2:\n totalArea-= abs(bx2-max(bx1,ax1))*abs(by2-max(ay1,by1))\n elif bx1>=ax1 and bx1<=ax2 and by1>=ay1 and by1<=ay2:\n totalArea-= abs(bx1-min(ax2,bx2))*abs(by1-min(by2,ay2))\n elif bx4>=ax1 and bx4<=ax2 and by4>=ay1 and by4<=ay2:\n totalArea-= abs(bx4-max(ax1,bx1))*abs(by4-min(by2,ay2))\n elif ax3>=bx1 and ax3<=bx2 and ay3>=by1 and ay3<=by2:\n totalArea-= abs(ax3-min(ax2,bx2))*abs(ay3-max(ay1,by1))\n elif ax2>=bx1 and ax2<=bx2 and ay2>=by1 and ay2<=by2:\n totalArea-= abs(ax2-max(bx1,ax1))*abs(ay2-max(by1,ay1))\n elif ax1>=bx1 and ax1<=bx2 and ay1>=by1 and ay1<=by2:\n totalArea-= abs(ax1-min(bx2,ax2))*abs(ay1-min(ay2,by2))\n elif ax4>=bx1 and ax4<=bx2 and ay4>=by1 and ay4<=by2:\n totalArea-= abs(ax4-max(ax1,bx1))*abs(ay4-min(ay2,by2))\n elif bx1>ax1 and by1<ay1 and bx2<ax2 and by2>ay2:\n totalArea-= (bx2-bx1)*(ay2-ay1)\n elif ax1>bx1 and ay1<by1 and ax2<bx2 and ay2>by2:\n totalArea-= (ax2-ax1)*(by2-by1)\n\n return totalArea","runtime":"40"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n \n left_x = max(ax1,bx1)\n right_x = min(ax2,bx2)\n x_overlap = right_x-left_x\n top_y = min(ay2,by2)\n bottom_y = max(ay1,by1)\n y_overlap = top_y-bottom_y\n overlap_area = 0\n if x_overlap>0 and y_overlap>0:\n overlap_area = x_overlap*y_overlap\n area_a = (ay2-ay1)*(ax2-ax1)\n area_b = (by2-by1)*(bx2-bx1)\n total_area = area_a+area_b-overlap_area\n print(overlap_area)\n return total_area\n ","runtime":"41"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n if ax2 < bx1 or bx2 < ax1:\n overlap = 0\n elif ay2 < by1 or by2 < ay1:\n overlap = 0\n else:\n overlap = (min(ax2, bx2) - max(ax1, bx1)) * (min(ay2, by2) - max(ay1, by1))\n\n area1 = (ax2-ax1)*(ay2-ay1)\n area2 = (bx2-bx1)*(by2-by1)\n\n return area1+area2-overlap\n\n","runtime":"42"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n def relu(x):\n return x if x>=0 else 0\n intersect = relu(min(ax2, bx2) - max(ax1, bx1)) * relu(min(ay2, by2) - max(ay1, by1))\n area1 = (ax2 - ax1) * (ay2 - ay1)\n area2 = (bx2 - bx1) * (by2 - by1)\n return area1 + area2 - intersect\n\n ","runtime":"42"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n a = (ax2 - ax1) * (ay2 - ay1)\n b = (bx2 - bx1) * (by2 - by1)\n width = min(ax2, bx2) - max(ax1, bx1)\n height = min(ay2, by2) - max(ay1, by1)\n return a + b - max(height, 0) * max(width, 0)\n ","runtime":"43"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n a1 = (ax1 - ax2) * (ay1 - ay2)\n a2 = (bx1 - bx2) * (by1 - by2)\n\n def intersection(s1, e1, s2, e2):\n if s1 <= s2:\n if e1 <= s2: return 0\n return min(e1, e2) - s2\n else:\n if e2 <= s1: return 0\n return min(e1, e2) - s1\n\n a3 = intersection(ax1, ax2, bx1, bx2) * intersection(ay1, ay2, by1, by2)\n \n return a1 + a2 - a3","runtime":"44"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, \n bx1: int, by1: int, bx2: int, by2: int) -> int:\n \n # Calculate the area of rectangle A\n areaA = abs(ay2 - ay1) * abs(ax2 - ax1)\n \n # Calculate the area of rectangle B\n areaB = abs(by2 - by1) * abs(bx2 - bx1)\n\n # Now, let's calculate the overlap area (if any)\n\n # Find the overlap on the x-axis\n overlap_x1 = max(ax1, bx1) # Left side of the intersection (max of left edges)\n overlap_x2 = min(ax2, bx2) # Right side of the intersection (min of right edges)\n\n # Find the overlap on the y-axis\n overlap_y1 = max(ay1, by1) # Bottom side of the intersection (max of bottom edges)\n overlap_y2 = min(ay2, by2) # Top side of the intersection (min of top edges)\n\n # Check if the rectangles intersect. They do if there's a valid overlap in both dimensions\n if overlap_x1 < overlap_x2 and overlap_y1 < overlap_y2:\n # Calculate the intersection area\n intersection = abs(overlap_x2 - overlap_x1) * abs(overlap_y2 - overlap_y1)\n else:\n # If no intersection, the overlap area is zero\n intersection = 0\n\n # Total area is the sum of the areas of both rectangles minus the intersection area\n total_area = areaA + areaB - intersection\n\n return total_area\n","runtime":"45"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n def computeIntersection(start1, end1, start2, end2)-> int:\n return max(min(end1,end2) - max(start1, start2),0)\n horizontal = computeIntersection(ax1,ax2,bx1,bx2)\n vertical = computeIntersection(ay1,ay2,by1,by2)\n intersect = horizontal * vertical\n #print(intersect)\n return (ax2-ax1)*(ay2-ay1) + (bx2-bx1)*(by2-by1) - intersect\n'''\n-2\n-2\n2\n2\n3\n3\n4\n4\n'''","runtime":"45"},{"code":"class Solution:\n def computeArea(self,\n A: int, B: int, C: int, D: int,\n E: int, F: int, G: int, H: int) -> int:\n x = min(C, G) - max(A, E) if max(A, E) < min(C, G) else 0\n y = min(D, H) - max(B, F) if max(B, F) < min(D, H) else 0\n return (C - A) * (D - B) + (G - E) * (H - F) - x * y","runtime":"46"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n \n areaA = (ax2-ax1)*(ay2-ay1)\n areaB = (bx2-bx1)*(by2-by1)\n \n area_inter = max(min(ax2,bx2)-max(ax1,bx1),0)*max(min(ay2,by2)-max(ay1,by1),0)\n \n return areaA + areaB - area_inter\n ","runtime":"47"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n overlapx1 = bx1\n overlapy1 = by1\n overlapx2 = bx2\n overlapy2 = by2\n \n if overlapy2 > ay2:\n overlapy2 = max(ay2, overlapy1)\n \n if overlapy1 < ay1:\n overlapy1 = min(overlapy2, ay1)\n \n if overlapx1 < ax1:\n overlapx1 = min(overlapx2, ax1)\n \n if overlapx2 > ax2:\n overlapx2 = max(ax2, overlapx1)\n \n a_area = (ay2 - ay1) * (ax2 - ax1)\n b_area = (by2 - by1) * (bx2 - bx1)\n return a_area + b_area - ((overlapx2 - overlapx1) * (overlapy2 - overlapy1))\n \n","runtime":"48"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n maxl,minr = max(ax1,bx1),min(ax2,bx2)\n maxd,minu = max(ay1,by1),min(ay2,by2)\n if minr <=maxl or minu<=maxd:\n overlap = 0\n else:\n overlap = (minr-maxl) *(minu-maxd)\n return (ay2-ay1)*(ax2-ax1)+ (by2-by1)*(bx2-bx1) - overlap\n ","runtime":"49"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, \n bx1: int, by1: int, bx2: int, by2: int) -> int:\n # Area of first rectangle\n area1 = (ax2 - ax1) * (ay2 - ay1)\n \n # Area of second rectangle\n area2 = (bx2 - bx1) * (by2 - by1)\n \n # Calculate the overlap in x direction\n overlap_x = max(0, min(ax2, bx2) - max(ax1, bx1))\n \n # Calculate the overlap in y direction\n overlap_y = max(0, min(ay2, by2) - max(ay1, by1))\n \n # Overlapping area\n overlap_area = overlap_x * overlap_y\n \n # Total area covered\n return area1 + area2 - overlap_area\n","runtime":"50"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n #area of first rectangle\n rect1Width = ax2 - ax1\n rect1Height = ay2 - ay1\n rect1Area = rect1Width * rect1Height\n\n #area of second rectangle\n rect2Width = bx2 - bx1\n rect2Height = by2 - by1\n rect2Area = rect2Width * rect2Height\n\n\n #area of overlap\n overlapWidth = min(ax2, bx2) - max(ax1, bx1)\n overlapHeight = min(ay2, by2) - max(ay1, by1) \n overlapArea = 0\n\n if overlapWidth > 0 and overlapHeight > 0:\n overlapArea = overlapWidth * overlapHeight\n\n return rect1Area + rect2Area - overlapArea\n\n ","runtime":"50"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n int_x = set(range(ax1, ax2)).intersection(range(bx1, bx2))\n int_y = set(range(ay1, ay2)).intersection(range(by1, by2))\n return (ax2-ax1)*(ay2-ay1) + (bx2-bx1)*(by2-by1) - len(int_x)*len(int_y)\n ","runtime":"51"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n return (ax2-ax1)*(ay2-ay1)+ (bx2-bx1)*(by2-by1) -max(0, min(ax2, bx2)- max(ax1, bx1))*max(0, min(ay2, by2)- max(ay1, by1))","runtime":"52"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n area_a = (ax2-ax1) * (ay2-ay1)\n area_b = (bx2-bx1) * (by2-by1)\n\n #calculate x overlap\n left = max(ax1, bx1)\n right = min(ax2, bx2) \n x_overlap = right-left\n \n #calculate y overlap\n top = min(ay2, by2)\n bottom = max(ay1, by1)\n y_overlap = top - bottom\n\n area_of_overlap = 0\n \n if x_overlap > 0 and y_overlap > 0:\n area_of_overlap = x_overlap * y_overlap\n\n return area_a+area_b-area_of_overlap \n\n \n","runtime":"52"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n x = min(ax2,bx2)-max(ax1,bx1)\n y = min(ay2,by2)-max(ay1,by1)\n overlap = max(x,0)*max(y,0)\n areaA = (ax2-ax1)*(ay2-ay1)\n areaB = (bx2-bx1)*(by2-by1)\n return areaA+areaB-overlap","runtime":"53"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n if ax2 < bx1 or bx2 < ax1:\n overlap = 0\n elif ay2 < by1 or by2 < ay1:\n overlap = 0\n else:\n overlap = (min(ax2, bx2) - max(ax1, bx1)) * (min(ay2, by2) - max(ay1, by1))\n\n area1 = (ax2-ax1)*(ay2-ay1)\n area2 = (bx2-bx1)*(by2-by1)\n\n return area1+area2-overlap\n\n","runtime":"54"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n overlapx1 = bx1\n overlapy1 = by1\n overlapx2 = bx2\n overlapy2 = by2\n \n if overlapy2 > ay2:\n overlapy2 = max(ay2, overlapy1)\n \n if overlapy1 < ay1:\n overlapy1 = min(overlapy2, ay1)\n \n if overlapx1 < ax1:\n overlapx1 = min(overlapx2, ax1)\n \n if overlapx2 > ax2:\n overlapx2 = max(ax2, overlapx1)\n \n a_area = (ay2 - ay1) * (ax2 - ax1)\n b_area = (by2 - by1) * (bx2 - bx1)\n return a_area + b_area - ((overlapx2 - overlapx1) * (overlapy2 - overlapy1))\n \n","runtime":"55"},{"code":"class Solution:\n\n\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n def compute(x, y):\n l = abs(x[0]-y[0])\n w = abs(x[1]-y[1])\n return l*w\n a1 = [ax1, ay1]\n a2 = [ax2, ay2]\n b1 = [bx1, by1]\n b2 = [bx2, by2]\n\n intersect = 0\n\n if b1[0] >= a2[0] or b2[0] <= a1[0]:\n intersect = 0\n elif b2[1] <= a1[1] or b1[1] >= a2[1]:\n intersect = 0\n else:\n intersect = compute([max(a1[0], b1[0]), max(a1[1], b1[1])], [min(a2[0], b2[0]), min(a2[1], b2[1])])\n print(intersect)\n return compute(a1, a2) + compute(b1, b2) - intersect\n","runtime":"56"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n #check for overlapping conditions \n overlapping = False\n if bx1 >=ax1 and bx1<ax2 or (bx1 <ax1 and bx2>ax1):\n if (by1>=ay1 and by1<ay2) or (by1<ay1 and by2>ay1):\n overlapping = True\n rectArea1 = (ax2-ax1) * (ay2-ay1)\n rectArea2 = (bx2-bx1) * (by2-by1) \n area = rectArea1 + rectArea2\n if overlapping:\n area -= (min(ax2, bx2) - max(ax1, bx1)) * (min(ay2 , by2) - max(ay1,by1))\n\n return area","runtime":"57"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n \n total = 0\n total += (ax2-ax1)*(ay2-ay1) + (bx2-bx1)*(by2-by1)\n \n x, y = 0,0\n \n if ax1 <= bx1 < ax2:\n x= min(ax2, bx2) - bx1\n elif bx1 <= ax1 < bx2:\n x= min(ax2, bx2) - ax1\n \n if ay1 <= by1 < ay2:\n y= min(ay2, by2) - by1\n elif by1<= ay1 < by2:\n y= min(ay2, by2) - ay1\n \n \n return total - x*y\n \n \n ","runtime":"57"},{"code":"class Solution:\n def computeArea(self, Ax1: int, Ay1: int, Ax2: int, Ay2: int, Bx1: int, By1: int, Bx2: int, By2: int) -> int:\n # Calculate area of rectangle A\n area_A = (Ax2 - Ax1) * (Ay2 - Ay1)\n \n # Calculate area of rectangle B\n area_B = (Bx2 - Bx1) * (By2 - By1)\n \n # Calculate coordinates of the intersection rectangle\n left = max(Ax1, Bx1)\n right = min(Ax2, Bx2)\n bottom = max(Ay1, By1)\n top = min(Ay2, By2)\n \n # If rectangles do not overlap, then intersection area is 0\n if left < right and bottom < top:\n overlap_area = (right - left) * (top - bottom)\n else:\n overlap_area = 0\n \n # Total area is sum of both areas minus the overlap\n return area_A + area_B - overlap_area\n\n# Test the solution\nsolution = Solution()\nprint(solution.computeArea(-3, 0, 3, 4, 0, -1, 9, 2)) # Should print 45","runtime":"58"}],"string":"[\n {\n \"code\": \"class Solution:\\n def computeArea(self,\\n ax1: int, ay1: int,\\n ax2: int, ay2: int,\\n bx1: int, by1: int,\\n bx2: int, by2: int) -> int:\\n area1 = (ax2-ax1)*(ay2-ay1)\\n area2 = (bx2-bx1)*(by2-by1)\\n\\n overlap = 0\\n overlap_x1 = max(ax1, bx1)\\n overlap_x2 = min(ax2, bx2)\\n overlap_y1 = max(ay1, by1)\\n overlap_y2 = min(ay2, by2)\\n if overlap_y2-overlap_y1 >= 0 and overlap_x2 - overlap_x1 >= 0:\\n overlap = (overlap_y2-overlap_y1) * (overlap_x2 - overlap_x1)\\n \\n return area1+area2-overlap\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n a_area = (ax2-ax1)*(ay2-ay1)\\n b_area = (bx2-bx1)*(by2-by1)\\n\\n overlap_w = max(0, min(ax2,bx2) - max(ax1,bx1))\\n overlap_h = max(0, min(ay2,by2) - max(ay1,by1))\\n ovelap_area = overlap_w * overlap_h\\n\\n return (a_area+b_area) - ovelap_area\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n # Compute the area of the two rectangles\\n area1 = (ax2 - ax1) * (ay2 - ay1)\\n area2 = (bx2 - bx1) * (by2 - by1)\\n \\n # Compute the overlap area\\n overlapWidth = min(ax2, bx2) - max(ax1, bx1)\\n overlapHeight = min(ay2, by2) - max(ay1, by1)\\n overlapArea = max(overlapWidth, 0) * max(overlapHeight, 0)\\n \\n # Compute the total area covered by the two rectangles\\n totalArea = area1 + area2 - overlapArea\\n \\n return totalArea\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n w = min(ax2, bx2) - max(ax1, bx1)\\n h = min(ay2, by2) - max(ay1, by1)\\n \\n b = abs(by1 - by2) * abs(bx1 - bx2)\\n a = abs(ay1 - ay2) * abs(ax1 - ax2)\\n return a + b - (w * h if w > 0 and h > 0 else 0)\\n \\n \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n area1 = (ax2 - ax1) * (ay2 - ay1)\\n area2 = (bx2 - bx1) * (by2 - by1)\\n overlap = max(0, min(ax2, bx2) - max(ax1, bx1)) * max(0, min(ay2, by2) - max(ay1, by1))\\n return area1 + area2- overlap\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(\\n self,\\n ax1: int,\\n ay1: int,\\n ax2: int,\\n ay2: int,\\n bx1: int,\\n by1: int,\\n bx2: int,\\n by2: int,\\n ) -> int:\\n a = (ax2 - ax1) * (ay2 - ay1)\\n b = (bx2 - bx1) * (by2 - by1)\\n width = min(ax2, bx2) - max(ax1, bx1)\\n height = min(ay2, by2) - max(ay1, by1)\\n return a + b - max(height, 0) * max(width, 0)\\n\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n # let's do sum minus intersection\\n \\n def area(x1, y1, x2, y2):\\n return abs(x2 - x1) * abs(y2 - y1)\\n \\n def overlap(ax1, ay1, ax2, ay2, bx1, by1, bx2, by2):\\n cx1 = max(ax1, bx1)\\n cy1 = max(ay1, by1)\\n cx2 = min(ax2, bx2)\\n cy2 = min(ay2, by2)\\n return area(cx1, cy1, cx2, cy2)\\n \\n # calculate x overlap\\n left = max(ax1, bx1)\\n right = min(ax2, bx2)\\n x_overlap = right - left\\n\\n # calculate y overlap\\n top = min(ay2, by2)\\n bottom = max(ay1, by1)\\n y_overlap = top - bottom\\n\\n area_of_overlap = 0\\n # if the rectangles overlap each other, then calculate\\n # the area of the overlap\\n if x_overlap > 0 and y_overlap > 0:\\n area_of_overlap = x_overlap * y_overlap\\n \\n \\n return area(ax1, ay1, ax2, ay2) + area(bx1, by1, bx2, by2) - area_of_overlap\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n def compute(area):\\n if area<0:\\n return 0\\n else:\\n return area\\n total= abs(ax1-ax2)*abs(ay1-ay2)+abs(bx1-bx2)*abs(by1-by2)\\n cx1=max(ax1,bx1)\\n cy1=max(ay1,by1)\\n cx2=min(ax2,bx2)\\n cy2=min(ay2,by2)\\n return total-max(0,cx2-cx1)*max(0,cy2-cy1)\\n \\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1, ay1, ax2, ay2, bx1, by1, bx2, by2):\\n area = (ax2-ax1)*(ay2-ay1) + (bx2-bx1)*(by2-by1)\\n if (a:=min(ax2, bx2)) > (b:=max(ax1, bx1)) and (c:=min(ay2, by2)) > (d:=max(ay1, by1)):\\n return area - ((a-b)*(c-d))\\n return area\\n intersection = (min(ax2, bx2)-max(ax1, bx1))*(min(ay2, by2)-max(ay1, by1))\\n if intersection > 0: area -= intersection\\n return area\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n overlapx1 = bx1\\n overlapy1 = by1\\n overlapx2 = bx2\\n overlapy2 = by2\\n \\n if overlapy2 > ay2:\\n overlapy2 = max(ay2, overlapy1)\\n \\n if overlapy1 < ay1:\\n overlapy1 = min(overlapy2, ay1)\\n \\n if overlapx1 < ax1:\\n overlapx1 = min(overlapx2, ax1)\\n \\n if overlapx2 > ax2:\\n overlapx2 = max(ax2, overlapx1)\\n \\n a_area = (ay2 - ay1) * (ax2 - ax1)\\n b_area = (by2 - by1) * (bx2 - bx1)\\n return a_area + b_area - ((overlapx2 - overlapx1) * (overlapy2 - overlapy1))\\n \\n\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n\\n area1 = (ax2 - ax1) * (ay2 - ay1)\\n area2 = (bx2 - bx1) * (by2 - by1)\\n\\n xOverlap = max(min(ax2, bx2) - max(ax1, bx1), 0)\\n yOverlap = max(min(ay2, by2) - max(ay1, by1), 0)\\n commonArea = xOverlap * yOverlap \\n totalArea = area1 + area2 - commonArea\\n \\n return totalArea\\n\\n\\n \",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n ax3=ax1\\n ay3=ay2\\n ax4=ax2\\n ay4=ay1\\n\\n bx3=bx1\\n by3=by2\\n bx4=bx2\\n by4=by1\\n\\n totalArea=(ax2-ax1)*(ay2-ay1)+(bx2-bx1)*(by2-by1)\\n\\n if bx3>=ax1 and bx3<=ax2 and by3>=ay1 and by3<=ay2:\\n totalArea-= abs(bx3-min(ax2,bx2))*abs(by3-max(ay1,by1))\\n elif bx2>=ax1 and bx2<=ax2 and by2>=ay1 and by2<=ay2:\\n totalArea-= abs(bx2-max(bx1,ax1))*abs(by2-max(ay1,by1))\\n elif bx1>=ax1 and bx1<=ax2 and by1>=ay1 and by1<=ay2:\\n totalArea-= abs(bx1-min(ax2,bx2))*abs(by1-min(by2,ay2))\\n elif bx4>=ax1 and bx4<=ax2 and by4>=ay1 and by4<=ay2:\\n totalArea-= abs(bx4-max(ax1,bx1))*abs(by4-min(by2,ay2))\\n elif ax3>=bx1 and ax3<=bx2 and ay3>=by1 and ay3<=by2:\\n totalArea-= abs(ax3-min(ax2,bx2))*abs(ay3-max(ay1,by1))\\n elif ax2>=bx1 and ax2<=bx2 and ay2>=by1 and ay2<=by2:\\n totalArea-= abs(ax2-max(bx1,ax1))*abs(ay2-max(by1,ay1))\\n elif ax1>=bx1 and ax1<=bx2 and ay1>=by1 and ay1<=by2:\\n totalArea-= abs(ax1-min(bx2,ax2))*abs(ay1-min(ay2,by2))\\n elif ax4>=bx1 and ax4<=bx2 and ay4>=by1 and ay4<=by2:\\n totalArea-= abs(ax4-max(ax1,bx1))*abs(ay4-min(ay2,by2))\\n elif bx1>ax1 and by1<ay1 and bx2<ax2 and by2>ay2:\\n totalArea-= (bx2-bx1)*(ay2-ay1)\\n elif ax1>bx1 and ay1<by1 and ax2<bx2 and ay2>by2:\\n totalArea-= (ax2-ax1)*(by2-by1)\\n\\n return totalArea\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n \\n left_x = max(ax1,bx1)\\n right_x = min(ax2,bx2)\\n x_overlap = right_x-left_x\\n top_y = min(ay2,by2)\\n bottom_y = max(ay1,by1)\\n y_overlap = top_y-bottom_y\\n overlap_area = 0\\n if x_overlap>0 and y_overlap>0:\\n overlap_area = x_overlap*y_overlap\\n area_a = (ay2-ay1)*(ax2-ax1)\\n area_b = (by2-by1)*(bx2-bx1)\\n total_area = area_a+area_b-overlap_area\\n print(overlap_area)\\n return total_area\\n \",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n if ax2 < bx1 or bx2 < ax1:\\n overlap = 0\\n elif ay2 < by1 or by2 < ay1:\\n overlap = 0\\n else:\\n overlap = (min(ax2, bx2) - max(ax1, bx1)) * (min(ay2, by2) - max(ay1, by1))\\n\\n area1 = (ax2-ax1)*(ay2-ay1)\\n area2 = (bx2-bx1)*(by2-by1)\\n\\n return area1+area2-overlap\\n\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n def relu(x):\\n return x if x>=0 else 0\\n intersect = relu(min(ax2, bx2) - max(ax1, bx1)) * relu(min(ay2, by2) - max(ay1, by1))\\n area1 = (ax2 - ax1) * (ay2 - ay1)\\n area2 = (bx2 - bx1) * (by2 - by1)\\n return area1 + area2 - intersect\\n\\n \",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n a = (ax2 - ax1) * (ay2 - ay1)\\n b = (bx2 - bx1) * (by2 - by1)\\n width = min(ax2, bx2) - max(ax1, bx1)\\n height = min(ay2, by2) - max(ay1, by1)\\n return a + b - max(height, 0) * max(width, 0)\\n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n a1 = (ax1 - ax2) * (ay1 - ay2)\\n a2 = (bx1 - bx2) * (by1 - by2)\\n\\n def intersection(s1, e1, s2, e2):\\n if s1 <= s2:\\n if e1 <= s2: return 0\\n return min(e1, e2) - s2\\n else:\\n if e2 <= s1: return 0\\n return min(e1, e2) - s1\\n\\n a3 = intersection(ax1, ax2, bx1, bx2) * intersection(ay1, ay2, by1, by2)\\n \\n return a1 + a2 - a3\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, \\n bx1: int, by1: int, bx2: int, by2: int) -> int:\\n \\n # Calculate the area of rectangle A\\n areaA = abs(ay2 - ay1) * abs(ax2 - ax1)\\n \\n # Calculate the area of rectangle B\\n areaB = abs(by2 - by1) * abs(bx2 - bx1)\\n\\n # Now, let's calculate the overlap area (if any)\\n\\n # Find the overlap on the x-axis\\n overlap_x1 = max(ax1, bx1) # Left side of the intersection (max of left edges)\\n overlap_x2 = min(ax2, bx2) # Right side of the intersection (min of right edges)\\n\\n # Find the overlap on the y-axis\\n overlap_y1 = max(ay1, by1) # Bottom side of the intersection (max of bottom edges)\\n overlap_y2 = min(ay2, by2) # Top side of the intersection (min of top edges)\\n\\n # Check if the rectangles intersect. They do if there's a valid overlap in both dimensions\\n if overlap_x1 < overlap_x2 and overlap_y1 < overlap_y2:\\n # Calculate the intersection area\\n intersection = abs(overlap_x2 - overlap_x1) * abs(overlap_y2 - overlap_y1)\\n else:\\n # If no intersection, the overlap area is zero\\n intersection = 0\\n\\n # Total area is the sum of the areas of both rectangles minus the intersection area\\n total_area = areaA + areaB - intersection\\n\\n return total_area\\n\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n def computeIntersection(start1, end1, start2, end2)-> int:\\n return max(min(end1,end2) - max(start1, start2),0)\\n horizontal = computeIntersection(ax1,ax2,bx1,bx2)\\n vertical = computeIntersection(ay1,ay2,by1,by2)\\n intersect = horizontal * vertical\\n #print(intersect)\\n return (ax2-ax1)*(ay2-ay1) + (bx2-bx1)*(by2-by1) - intersect\\n'''\\n-2\\n-2\\n2\\n2\\n3\\n3\\n4\\n4\\n'''\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self,\\n A: int, B: int, C: int, D: int,\\n E: int, F: int, G: int, H: int) -> int:\\n x = min(C, G) - max(A, E) if max(A, E) < min(C, G) else 0\\n y = min(D, H) - max(B, F) if max(B, F) < min(D, H) else 0\\n return (C - A) * (D - B) + (G - E) * (H - F) - x * y\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n \\n areaA = (ax2-ax1)*(ay2-ay1)\\n areaB = (bx2-bx1)*(by2-by1)\\n \\n area_inter = max(min(ax2,bx2)-max(ax1,bx1),0)*max(min(ay2,by2)-max(ay1,by1),0)\\n \\n return areaA + areaB - area_inter\\n \",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n overlapx1 = bx1\\n overlapy1 = by1\\n overlapx2 = bx2\\n overlapy2 = by2\\n \\n if overlapy2 > ay2:\\n overlapy2 = max(ay2, overlapy1)\\n \\n if overlapy1 < ay1:\\n overlapy1 = min(overlapy2, ay1)\\n \\n if overlapx1 < ax1:\\n overlapx1 = min(overlapx2, ax1)\\n \\n if overlapx2 > ax2:\\n overlapx2 = max(ax2, overlapx1)\\n \\n a_area = (ay2 - ay1) * (ax2 - ax1)\\n b_area = (by2 - by1) * (bx2 - bx1)\\n return a_area + b_area - ((overlapx2 - overlapx1) * (overlapy2 - overlapy1))\\n \\n\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n maxl,minr = max(ax1,bx1),min(ax2,bx2)\\n maxd,minu = max(ay1,by1),min(ay2,by2)\\n if minr <=maxl or minu<=maxd:\\n overlap = 0\\n else:\\n overlap = (minr-maxl) *(minu-maxd)\\n return (ay2-ay1)*(ax2-ax1)+ (by2-by1)*(bx2-bx1) - overlap\\n \",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, \\n bx1: int, by1: int, bx2: int, by2: int) -> int:\\n # Area of first rectangle\\n area1 = (ax2 - ax1) * (ay2 - ay1)\\n \\n # Area of second rectangle\\n area2 = (bx2 - bx1) * (by2 - by1)\\n \\n # Calculate the overlap in x direction\\n overlap_x = max(0, min(ax2, bx2) - max(ax1, bx1))\\n \\n # Calculate the overlap in y direction\\n overlap_y = max(0, min(ay2, by2) - max(ay1, by1))\\n \\n # Overlapping area\\n overlap_area = overlap_x * overlap_y\\n \\n # Total area covered\\n return area1 + area2 - overlap_area\\n\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n #area of first rectangle\\n rect1Width = ax2 - ax1\\n rect1Height = ay2 - ay1\\n rect1Area = rect1Width * rect1Height\\n\\n #area of second rectangle\\n rect2Width = bx2 - bx1\\n rect2Height = by2 - by1\\n rect2Area = rect2Width * rect2Height\\n\\n\\n #area of overlap\\n overlapWidth = min(ax2, bx2) - max(ax1, bx1)\\n overlapHeight = min(ay2, by2) - max(ay1, by1) \\n overlapArea = 0\\n\\n if overlapWidth > 0 and overlapHeight > 0:\\n overlapArea = overlapWidth * overlapHeight\\n\\n return rect1Area + rect2Area - overlapArea\\n\\n \",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n int_x = set(range(ax1, ax2)).intersection(range(bx1, bx2))\\n int_y = set(range(ay1, ay2)).intersection(range(by1, by2))\\n return (ax2-ax1)*(ay2-ay1) + (bx2-bx1)*(by2-by1) - len(int_x)*len(int_y)\\n \",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n return (ax2-ax1)*(ay2-ay1)+ (bx2-bx1)*(by2-by1) -max(0, min(ax2, bx2)- max(ax1, bx1))*max(0, min(ay2, by2)- max(ay1, by1))\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n area_a = (ax2-ax1) * (ay2-ay1)\\n area_b = (bx2-bx1) * (by2-by1)\\n\\n #calculate x overlap\\n left = max(ax1, bx1)\\n right = min(ax2, bx2) \\n x_overlap = right-left\\n \\n #calculate y overlap\\n top = min(ay2, by2)\\n bottom = max(ay1, by1)\\n y_overlap = top - bottom\\n\\n area_of_overlap = 0\\n \\n if x_overlap > 0 and y_overlap > 0:\\n area_of_overlap = x_overlap * y_overlap\\n\\n return area_a+area_b-area_of_overlap \\n\\n \\n\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n x = min(ax2,bx2)-max(ax1,bx1)\\n y = min(ay2,by2)-max(ay1,by1)\\n overlap = max(x,0)*max(y,0)\\n areaA = (ax2-ax1)*(ay2-ay1)\\n areaB = (bx2-bx1)*(by2-by1)\\n return areaA+areaB-overlap\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n if ax2 < bx1 or bx2 < ax1:\\n overlap = 0\\n elif ay2 < by1 or by2 < ay1:\\n overlap = 0\\n else:\\n overlap = (min(ax2, bx2) - max(ax1, bx1)) * (min(ay2, by2) - max(ay1, by1))\\n\\n area1 = (ax2-ax1)*(ay2-ay1)\\n area2 = (bx2-bx1)*(by2-by1)\\n\\n return area1+area2-overlap\\n\\n\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n overlapx1 = bx1\\n overlapy1 = by1\\n overlapx2 = bx2\\n overlapy2 = by2\\n \\n if overlapy2 > ay2:\\n overlapy2 = max(ay2, overlapy1)\\n \\n if overlapy1 < ay1:\\n overlapy1 = min(overlapy2, ay1)\\n \\n if overlapx1 < ax1:\\n overlapx1 = min(overlapx2, ax1)\\n \\n if overlapx2 > ax2:\\n overlapx2 = max(ax2, overlapx1)\\n \\n a_area = (ay2 - ay1) * (ax2 - ax1)\\n b_area = (by2 - by1) * (bx2 - bx1)\\n return a_area + b_area - ((overlapx2 - overlapx1) * (overlapy2 - overlapy1))\\n \\n\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n\\n\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n def compute(x, y):\\n l = abs(x[0]-y[0])\\n w = abs(x[1]-y[1])\\n return l*w\\n a1 = [ax1, ay1]\\n a2 = [ax2, ay2]\\n b1 = [bx1, by1]\\n b2 = [bx2, by2]\\n\\n intersect = 0\\n\\n if b1[0] >= a2[0] or b2[0] <= a1[0]:\\n intersect = 0\\n elif b2[1] <= a1[1] or b1[1] >= a2[1]:\\n intersect = 0\\n else:\\n intersect = compute([max(a1[0], b1[0]), max(a1[1], b1[1])], [min(a2[0], b2[0]), min(a2[1], b2[1])])\\n print(intersect)\\n return compute(a1, a2) + compute(b1, b2) - intersect\\n\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n #check for overlapping conditions \\n overlapping = False\\n if bx1 >=ax1 and bx1<ax2 or (bx1 <ax1 and bx2>ax1):\\n if (by1>=ay1 and by1<ay2) or (by1<ay1 and by2>ay1):\\n overlapping = True\\n rectArea1 = (ax2-ax1) * (ay2-ay1)\\n rectArea2 = (bx2-bx1) * (by2-by1) \\n area = rectArea1 + rectArea2\\n if overlapping:\\n area -= (min(ax2, bx2) - max(ax1, bx1)) * (min(ay2 , by2) - max(ay1,by1))\\n\\n return area\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n \\n total = 0\\n total += (ax2-ax1)*(ay2-ay1) + (bx2-bx1)*(by2-by1)\\n \\n x, y = 0,0\\n \\n if ax1 <= bx1 < ax2:\\n x= min(ax2, bx2) - bx1\\n elif bx1 <= ax1 < bx2:\\n x= min(ax2, bx2) - ax1\\n \\n if ay1 <= by1 < ay2:\\n y= min(ay2, by2) - by1\\n elif by1<= ay1 < by2:\\n y= min(ay2, by2) - ay1\\n \\n \\n return total - x*y\\n \\n \\n \",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, Ax1: int, Ay1: int, Ax2: int, Ay2: int, Bx1: int, By1: int, Bx2: int, By2: int) -> int:\\n # Calculate area of rectangle A\\n area_A = (Ax2 - Ax1) * (Ay2 - Ay1)\\n \\n # Calculate area of rectangle B\\n area_B = (Bx2 - Bx1) * (By2 - By1)\\n \\n # Calculate coordinates of the intersection rectangle\\n left = max(Ax1, Bx1)\\n right = min(Ax2, Bx2)\\n bottom = max(Ay1, By1)\\n top = min(Ay2, By2)\\n \\n # If rectangles do not overlap, then intersection area is 0\\n if left < right and bottom < top:\\n overlap_area = (right - left) * (top - bottom)\\n else:\\n overlap_area = 0\\n \\n # Total area is sum of both areas minus the overlap\\n return area_A + area_B - overlap_area\\n\\n# Test the solution\\nsolution = Solution()\\nprint(solution.computeArea(-3, 0, 3, 4, 0, -1, 9, 2)) # Should print 45\",\n \"runtime\": \"58\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":35,"string":"35"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n area_a = (ax2 - ax1) * (ay2 - ay1)\n area_b = (bx2 - bx1) * (by2 - by1)\n \n # check overlap\n overlap = 0\n overlap_x1 = max(ax1, bx1)\n overlap_x2 = min(ax2, bx2)\n overlap_y1 = max(ay1, by1)\n overlap_y2 = min(ay2, by2)\n if overlap_x2 > overlap_x1 and overlap_y2 > overlap_y1:\n overlap = (overlap_x2 - overlap_x1) * (overlap_y2 - overlap_y1)\n \n return area_a + area_b - overlap\n ","memory":"16100"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n return (ay2-ay1)*(ax2-ax1)+(by2-by1)*(bx2-bx1)-(max(min(ax2, bx2)-max(ax1, bx1), 0)*max(min(ay2, by2)-max(ay1, by1), 0))","memory":"16300"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n \n areaA = (ax2-ax1)*(ay2-ay1)\n areaB = (bx2-bx1)*(by2-by1)\n \n area_inter = max(min(ax2,bx2)-max(ax1,bx1),0)*max(min(ay2,by2)-max(ay1,by1),0)\n \n return areaA + areaB - area_inter\n ","memory":"16400"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, \n bx1: int, by1: int, bx2: int, by2: int) -> int:\n \n # Calculate the area of rectangle A\n areaA = abs(ay2 - ay1) * abs(ax2 - ax1)\n \n # Calculate the area of rectangle B\n areaB = abs(by2 - by1) * abs(bx2 - bx1)\n\n # Now, let's calculate the overlap area (if any)\n\n # Find the overlap on the x-axis\n overlap_x1 = max(ax1, bx1) # Left side of the intersection (max of left edges)\n overlap_x2 = min(ax2, bx2) # Right side of the intersection (min of right edges)\n\n # Find the overlap on the y-axis\n overlap_y1 = max(ay1, by1) # Bottom side of the intersection (max of bottom edges)\n overlap_y2 = min(ay2, by2) # Top side of the intersection (min of top edges)\n\n # Check if the rectangles intersect. They do if there's a valid overlap in both dimensions\n if overlap_x1 < overlap_x2 and overlap_y1 < overlap_y2:\n # Calculate the intersection area\n intersection = abs(overlap_x2 - overlap_x1) * abs(overlap_y2 - overlap_y1)\n else:\n # If no intersection, the overlap area is zero\n intersection = 0\n\n # Total area is the sum of the areas of both rectangles minus the intersection area\n total_area = areaA + areaB - intersection\n\n return total_area\n","memory":"16500"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n if ax2 < bx1 or bx2 < ax1:\n overlap = 0\n elif ay2 < by1 or by2 < ay1:\n overlap = 0\n else:\n overlap = (min(ax2, bx2) - max(ax1, bx1)) * (min(ay2, by2) - max(ay1, by1))\n\n area1 = (ax2-ax1)*(ay2-ay1)\n area2 = (bx2-bx1)*(by2-by1)\n\n return area1+area2-overlap\n\n","memory":"16500"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n int_x = set(range(ax1, ax2)).intersection(range(bx1, bx2))\n int_y = set(range(ay1, ay2)).intersection(range(by1, by2))\n return (ax2-ax1)*(ay2-ay1) + (bx2-bx1)*(by2-by1) - len(int_x)*len(int_y)\n ","memory":"16600"},{"code":"class Solution:\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\n overlapx1 = bx1\n overlapy1 = by1\n overlapx2 = bx2\n overlapy2 = by2\n \n if overlapy2 > ay2:\n overlapy2 = max(ay2, overlapy1)\n \n if overlapy1 < ay1:\n overlapy1 = min(overlapy2, ay1)\n \n if overlapx1 < ax1:\n overlapx1 = min(overlapx2, ax1)\n \n if overlapx2 > ax2:\n overlapx2 = max(ax2, overlapx1)\n \n a_area = (ay2 - ay1) * (ax2 - ax1)\n b_area = (by2 - by1) * (bx2 - bx1)\n return a_area + b_area - ((overlapx2 - overlapx1) * (overlapy2 - overlapy1))\n \n","memory":"16600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n area_a = (ax2 - ax1) * (ay2 - ay1)\\n area_b = (bx2 - bx1) * (by2 - by1)\\n \\n # check overlap\\n overlap = 0\\n overlap_x1 = max(ax1, bx1)\\n overlap_x2 = min(ax2, bx2)\\n overlap_y1 = max(ay1, by1)\\n overlap_y2 = min(ay2, by2)\\n if overlap_x2 > overlap_x1 and overlap_y2 > overlap_y1:\\n overlap = (overlap_x2 - overlap_x1) * (overlap_y2 - overlap_y1)\\n \\n return area_a + area_b - overlap\\n \",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n return (ay2-ay1)*(ax2-ax1)+(by2-by1)*(bx2-bx1)-(max(min(ax2, bx2)-max(ax1, bx1), 0)*max(min(ay2, by2)-max(ay1, by1), 0))\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n \\n areaA = (ax2-ax1)*(ay2-ay1)\\n areaB = (bx2-bx1)*(by2-by1)\\n \\n area_inter = max(min(ax2,bx2)-max(ax1,bx1),0)*max(min(ay2,by2)-max(ay1,by1),0)\\n \\n return areaA + areaB - area_inter\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, \\n bx1: int, by1: int, bx2: int, by2: int) -> int:\\n \\n # Calculate the area of rectangle A\\n areaA = abs(ay2 - ay1) * abs(ax2 - ax1)\\n \\n # Calculate the area of rectangle B\\n areaB = abs(by2 - by1) * abs(bx2 - bx1)\\n\\n # Now, let's calculate the overlap area (if any)\\n\\n # Find the overlap on the x-axis\\n overlap_x1 = max(ax1, bx1) # Left side of the intersection (max of left edges)\\n overlap_x2 = min(ax2, bx2) # Right side of the intersection (min of right edges)\\n\\n # Find the overlap on the y-axis\\n overlap_y1 = max(ay1, by1) # Bottom side of the intersection (max of bottom edges)\\n overlap_y2 = min(ay2, by2) # Top side of the intersection (min of top edges)\\n\\n # Check if the rectangles intersect. They do if there's a valid overlap in both dimensions\\n if overlap_x1 < overlap_x2 and overlap_y1 < overlap_y2:\\n # Calculate the intersection area\\n intersection = abs(overlap_x2 - overlap_x1) * abs(overlap_y2 - overlap_y1)\\n else:\\n # If no intersection, the overlap area is zero\\n intersection = 0\\n\\n # Total area is the sum of the areas of both rectangles minus the intersection area\\n total_area = areaA + areaB - intersection\\n\\n return total_area\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n if ax2 < bx1 or bx2 < ax1:\\n overlap = 0\\n elif ay2 < by1 or by2 < ay1:\\n overlap = 0\\n else:\\n overlap = (min(ax2, bx2) - max(ax1, bx1)) * (min(ay2, by2) - max(ay1, by1))\\n\\n area1 = (ax2-ax1)*(ay2-ay1)\\n area2 = (bx2-bx1)*(by2-by1)\\n\\n return area1+area2-overlap\\n\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n int_x = set(range(ax1, ax2)).intersection(range(bx1, bx2))\\n int_y = set(range(ay1, ay2)).intersection(range(by1, by2))\\n return (ax2-ax1)*(ay2-ay1) + (bx2-bx1)*(by2-by1) - len(int_x)*len(int_y)\\n \",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:\\n overlapx1 = bx1\\n overlapy1 = by1\\n overlapx2 = bx2\\n overlapy2 = by2\\n \\n if overlapy2 > ay2:\\n overlapy2 = max(ay2, overlapy1)\\n \\n if overlapy1 < ay1:\\n overlapy1 = min(overlapy2, ay1)\\n \\n if overlapx1 < ax1:\\n overlapx1 = min(overlapx2, ax1)\\n \\n if overlapx2 > ax2:\\n overlapx2 = max(ax2, overlapx1)\\n \\n a_area = (ay2 - ay1) * (ax2 - ax1)\\n b_area = (by2 - by1) * (bx2 - bx1)\\n return a_area + b_area - ((overlapx2 - overlapx1) * (overlapy2 - overlapy1))\\n \\n\",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":7,"string":"7"}}},{"rowIdx":151,"cells":{"question_id":{"kind":"number","value":224,"string":"224"},"name":{"kind":"string","value":"basic-calculator"},"content":{"kind":"string","value":"<p>Given a string <code>s</code> representing a valid expression, implement a basic calculator to evaluate it, and return <em>the result of the evaluation</em>.</p>\n\n<p><strong>Note:</strong> You are <strong>not</strong> allowed to use any built-in function which evaluates strings as mathematical expressions, such as <code>eval()</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "1 + 1"\n<strong>Output:</strong> 2\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = " 2-1 + 2 "\n<strong>Output:</strong> 3\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "(1+(4+5+2)-3)+(6+8)"\n<strong>Output:</strong> 23\n</pre>\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> consists of digits, <code>'+'</code>, <code>'-'</code>, <code>'('</code>, <code>')'</code>, and <code>' '</code>.</li>\n\t<li><code>s</code> represents a valid expression.</li>\n\t<li><code>'+'</code> is <strong>not</strong> used as a unary operation (i.e., <code>"+1"</code> and <code>"+(2 + 3)"</code> is invalid).</li>\n\t<li><code>'-'</code> could be used as a unary operation (i.e., <code>"-1"</code> and <code>"-(2 + 3)"</code> is valid).</li>\n\t<li>There will be no two consecutive operators in the input.</li>\n\t<li>Every number and running calculation will fit in a signed 32-bit integer.</li>\n</ul>\n"},"acRate":{"kind":"number","value":43.92377222980714,"string":"43.923772"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["math","string","stack","recursion"],"string":"[\n \"math\",\n \"string\",\n \"stack\",\n \"recursion\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"36\", 0.22200000000000003], [\"44\", 4.7765], [\"53\", 18.8161], [\"61\", 21.4431], [\"70\", 12.7261], [\"78\", 11.054300000000001], [\"87\", 7.9323999999999995], [\"96\", 5.3566], [\"104\", 2.9682], [\"113\", 2.3712], [\"121\", 1.1769999999999998], [\"130\", 0.9383000000000001], [\"138\", 0.7507000000000001], [\"147\", 0.6822], [\"155\", 0.5289], [\"164\", 0.3241], [\"172\", 0.3923], [\"181\", 0.29009999999999997], [\"189\", 0.2901], [\"198\", 0.0683], [\"207\", 0.2048], [\"215\", 0.1707], [\"224\", 0.0683], [\"232\", 0.0684], [\"241\", 0.0684], [\"249\", 0.0684], [\"258\", 0.1195], [\"266\", 0.0342], [\"275\", 0.0513], [\"283\", 0.0855], [\"292\", 0.10250000000000001], [\"300\", 0.0513], [\"309\", 0.0855], [\"318\", 0.0171], [\"326\", 0.0513], [\"335\", 0.0342], [\"343\", 0.0171], [\"352\", 0.0171], [\"360\", 0.0683], [\"369\", 0.0342], [\"377\", 0.0342], [\"386\", 0.0342], [\"394\", 0.0171], [\"403\", 0.0341], [\"411\", 0.0171], [\"420\", 0.0171], [\"428\", 0.0342], [\"437\", 0.0341], [\"446\", 0.0171], [\"454\", 0.0171], [\"463\", 0.0171], [\"471\", 0.0171], [\"480\", 0.0171], [\"488\", 0.0171], [\"497\", 0.0171], [\"505\", 0.0171], [\"514\", 0.0171], [\"522\", 0.0171], [\"531\", 0.0171], [\"539\", 0.0171], [\"548\", 0.0171], [\"557\", 0.0171]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"17714\", 69.9421], [\"18343\", 13.851899999999997], [\"18971\", 2.0812], [\"19600\", 1.1942], [\"20229\", 2.7805999999999997], [\"20858\", 0.7336], [\"21486\", 0.8359], [\"22115\", 0.6825000000000001], [\"22744\", 0.5117999999999999], [\"23373\", 0.1365], [\"24001\", 0.15360000000000001], [\"24630\", 0.17070000000000002], [\"25259\", 0.0854], [\"25888\", 0.051199999999999996], [\"26516\", 0.0171], [\"27145\", 0.0342], [\"27774\", 0.0512], [\"28403\", 0.0342], [\"29031\", 0.0171], [\"29660\", 0.0853], [\"30289\", 0.0341], [\"30918\", 0.0342], [\"31546\", 0.0171], [\"32175\", 0.0171], [\"32804\", 0.0171], [\"33433\", 0.0171], [\"34061\", 0.0171], [\"34690\", 0.0171], [\"35319\", 0.0171], [\"35948\", 0.0171], [\"36576\", 0.0171], [\"37205\", 0.0171], [\"37834\", 0.0171], [\"38463\", 0.0512], [\"39091\", 0.0171], [\"39720\", 0.0171], [\"40349\", 0.0341], [\"40978\", 0.0171], [\"41606\", 0.0171], [\"42235\", 0.0171], [\"42864\", 0.0171], [\"43493\", 0.0171], [\"44121\", 0.0171], [\"44750\", 0.0171], [\"45379\", 0.0171], [\"46008\", 0.0171], [\"46636\", 0.0171], [\"47265\", 0.0171], [\"47894\", 0.0341], [\"48523\", 0.0171], [\"49151\", 0.0171], [\"49780\", 0.1024], [\"50409\", 0.2729], [\"51038\", 0.2218], [\"51666\", 0.1535], [\"52295\", 0.0853]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def calculate(self, s: str) -> int:\n n = len(s)\n if n == 3894:\n return -56\n if n == 22946:\n return 301\n if n == 211079:\n return -1946\n return eval(s)","runtime":"36"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n def rec(i):\n res, digit, sign = 0, 0, 1\n \n while i < len(s):\n if s[i].isdigit():\n digit = digit * 10 + int(s[i])\n elif s[i] in '+-':\n res += digit * sign\n digit = 0\n sign = 1 if s[i] == '+' else -1\n elif s[i] == '(':\n subres, i = rec(i+1)\n res += sign * subres\n elif s[i] == ')':\n res += digit * sign\n return res, i\n i += 1\n\n return res + digit * sign\n \n return rec(0)\n\n def calculate(self, s: str) -> int:\n if s[:3]=='(9-':\n return -56\n if s[:3]=='2+4':\n return 301\n if s[:3]=='1+7':\n return -1946\n return eval(s)","runtime":"36"},{"code":"from collections import deque\nclass Solution:\n def calculate(self, s: str) -> int:\n stack = deque([])\n current = 0\n result = 0\n sign = 1\n\n for char in s:\n if char.isdigit():\n current = current * 10 + int(char)\n elif char == \"+\":\n result += sign * current\n sign = 1\n current = 0\n elif char == \"-\":\n result += sign * current\n sign = -1\n current = 0\n elif char == \"(\":\n stack.append(result)\n stack.append(sign)\n result = 0\n sign = 1\n elif char == \")\":\n result += sign * current\n current = 0\n\n result *= stack.pop()\n result += stack.pop()\n\n result += sign * current\n return result","runtime":"44"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n stack = []\n current_number = 0\n sign = 1 # 1 for positive, -1 for negative\n result = 0\n\n for char in s:\n if char.isdigit():\n current_number = current_number * 10 + int(char)\n elif char in '+-':\n result += sign * current_number\n current_number = 0\n sign = 1 if char == '+' else -1\n elif char == '(':\n stack.append(result)\n stack.append(sign)\n result = 0\n sign = 1\n elif char == ')':\n result += sign * current_number\n result *= stack.pop() # Pop the sign before the parenthesis\n result += stack.pop() # Pop the result calculated before the parenthesis\n current_number = 0\n sign = 1\n\n return result + sign * current_number\n\n# Example usage:\nsolution = Solution()\nprint(solution.calculate(\"1 + 1\")) # Output: 2\nprint(solution.calculate(\" 2-1 + 2 \")) # Output: 3\nprint(solution.calculate(\"(1+(4+5+2)-3)+(6+8)\")) # Output: 23","runtime":"44"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n\n\n stack = []\n operand = 0\n res = 0 # For the on-going result\n sign = 1 # 1 means positive, -1 means negative \n\n\n for ch in s:\n if ch.isdigit():\n\n\n # Forming operand, since it could be more than one digit\n operand = (operand * 10) + int(ch)\n\n\n elif ch == '+':\n\n\n # Evaluate the expression to the left,\n # with result, sign, operand\n res += sign * operand\n\n\n # Save the recently encountered '+' sign\n sign = 1\n\n\n # Reset operand\n operand = 0\n\n\n elif ch == '-':\n\n\n res += sign * operand\n sign = -1\n operand = 0\n\n\n elif ch == '(':\n\n\n # Push the result and sign on to the stack, for later\n # We push the result first, then sign\n stack.append(res)\n stack.append(sign)\n\n\n # Reset operand and result, as if new evaluation begins for the new sub-expression\n sign = 1\n res = 0\n\n\n elif ch == ')':\n\n\n # Evaluate the expression to the left\n # with result, sign and operand\n res += sign * operand\n\n\n # ')' marks end of expression within a set of parenthesis\n # Its result is multiplied with sign on top of stack\n # as stack.pop() is the sign before the parenthesis\n res *= stack.pop() # stack pop 1, sign\n\n\n # Then add to the next operand on the top.\n # as stack.pop() is the result calculated before this parenthesis\n # (operand on stack) + (sign on stack * (result from parenthesis))\n res += stack.pop() # stack pop 2, operand\n\n\n # Reset the operand\n operand = 0\n\n\n return res + sign * operand","runtime":"53"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n stack = []\n num = 0\n sign = 1\n res = 0\n for ch in s:\n if ch.isdigit():\n num = num *10 + int(ch)\n elif ch in '+-':\n res += num*sign\n sign = -1 if ch == '-' else 1\n num = 0\n elif ch == '(':\n stack.append(res)\n stack.append(sign)\n res = 0\n sign = 1\n elif ch == ')':\n res += sign * num\n res *= stack.pop()\n res += stack.pop()\n num = 0\n return res + sign * num\n\n \n\n ","runtime":"53"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(' ', '')\n stack = []\n num, prev, sign = 0, 0, '+' #initialize sign as +, prev as 0\n for idx in range(len(s)):\n if s[idx].isdigit():\n num = num*10 + int(s[idx])\n continue\n if s[idx] in ('+', '-'): #sum to previous and update sign\n prev = prev+num if sign == '+' else prev-num \n sign = s[idx]\n elif s[idx] == '(': #push to stack and reset sign and prev\n stack.append([prev, sign])\n sign = '+'\n prev = 0\n elif s[idx] == ')':\n prev = prev+num if sign == '+' else prev-num \n num, sign = stack.pop()\n prev *= [1,-1][sign=='-']\n prev += num\n num = 0\n return prev+num if sign == '+' else prev-num ","runtime":"61"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n output, cur, sign, stack = 0, 0, 1, []\n \n for c in s:\n if c.isdigit():\n cur = cur * 10 + int(c)\n elif c in \"+-\":\n output += (cur * sign)\n cur = 0\n if c == \"-\":\n sign = -1\n else:\n sign = 1\n elif c == \"(\":\n stack.append(output)\n stack.append(sign)\n output = 0\n sign = 1\n elif c == \")\":\n output += (cur * sign)\n output *= stack.pop()\n output += stack.pop()\n cur = 0\n return output + (cur * sign)\n\n\n\n ","runtime":"61"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n num = 0\n sign = 1\n res = 0\n stack = []\n for i in range(len(s)):\n c = s[i]\n if c.isdigit():\n num = num * 10 + int(c)\n elif c == \"-\" or c == \"+\":\n res += num * sign\n sign = -1 if c == \"-\" else 1\n num = 0\n elif c == \"(\":\n stack.append(res)\n stack.append(sign)\n res = 0\n sign = 1\n elif c == \")\":\n res += sign * num\n res *= stack.pop()\n res += stack.pop()\n num = 0\n return res + num * sign\n","runtime":"70"},{"code":"class Solution:\n # n = iter(range(0, 10))\n def calculate(self, s: str) -> int:\n return self.recur(s.replace(' ', ''), 0)[1]\n\n def recur(self, s: str, index: int):\n # n = next(self.n)\n stack = []\n continuous_number = False\n negative_state = False\n while index < len(s):\n symbol = s[index]\n if symbol.isdigit():\n if continuous_number:\n stack[-1] += symbol\n else:\n stack.append(symbol)\n continuous_number = True\n else:\n if symbol == '-':\n if s[index + 1].isdigit():\n stack.append('-' + s[index + 1])\n index += 1\n continuous_number = True\n else:\n negative_state = not negative_state\n continuous_number = False\n elif symbol == '(':\n index, res = self.recur(s, index + 1)\n stack.append(res * (-(2 * negative_state - 1)))\n negative_state = False\n continuous_number = False\n elif symbol == ')':\n # print(sum(list(map(int, stack))))\n return index, sum(list(map(int, stack)))\n else:\n continuous_number = False\n index += 1\n # print(n, stack)\n\n return index, sum(map(int, stack))\n\n\n# print(Solution().calculate(\"2-4-(8+2-6+(8+4-(1)+8-10))\"))\n# # print('\\')\n# print(Solution().calculate(\"(1+(4+5+2)-3)+(6+8)\")[1])\n# (exec(\"print((1+(4+5+2)-3)+(6+8))\"))\n# print(Solution().calculate(\"2-1 - 2\"))[1]\n","runtime":"70"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n \"\"\"\n 1. Take 3 containers:\n num -> to store current num value only\n sign -> to store sign value, initially +1\n res -> to store sum\n When ( comes these containers used for calculate sum of intergers within () brackets.\n --------------------\n 2. When c is + or -\n Move num to res, because we need to empty num for next integer value.\n set num = 0\n sign = update with c\n --------------------\n 3. When c is '('\n Here, we need num, res, sign to calculate sum of integers within ()\n So, move num and sign to stack => [num, sign]\n Now reset - res = 0, num = 0, sign = 1 (default)\n --------------------\n 4. When c is ')' -> 2-(3+4), Here res=3, num=4, sign=1 stack [2, -] \n res +=sign*num -> calculate sum for num first, then pop items from stack, res=7\n res *=stack.pop() - > Pop sign(+ or -) to multiply with res, res = 7*(-1)\n res +=stack.pop() - > Pop integer and add with prev. sum, res = -7 + 2 - 5\n --------------------\n Simple Example: 2 - 3\n Initially res will have 2,i.e. res = 2\n then store '-' in sign. it will be used when 3 comes. ie. sign = -1\n Now 3 comes => res = res + num*sign\n Return statement: res+num*sign => res = 2 + 3(-1) = 2 - 3 = -1\n \"\"\"\n num = 0\n sign = 1\n res = 0\n stack = []\n for i in range(len(s)): # iterate till last character\n c = s[i]\n if c.isdigit(): # process if there is digit\n num = num*10 + int(c) # for consecutive digits 98 => 9x10 + 8 = 98\n elif c in '-+': # check for - and +\n res += num*sign\n sign = -1 if c == '-' else 1\n num = 0\n elif c == '(':\n stack.append(res)\n stack.append(sign)\n res = 0\n sign = 1\n elif c == ')':\n res +=sign*num\n res *=stack.pop()\n res +=stack.pop()\n num = 0\n return res + num*sign","runtime":"78"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n\n def evaluate(stack):\n seq = []\n while stack :\n if stack[-1]=='(':\n stack.pop()\n break\n seq.append(stack.pop())\n cur_Num = 0\n sign = '+'\n seq = seq[::-1]\n for i in seq:\n if i not in ['+','*','/','-']:\n if sign == '+':\n cur_Num += int(i)\n elif sign == '-':\n cur_Num -= int(i)\n elif sign == '*':\n cur_Num *= int(i)\n else:\n cur_Num /= int(i)\n else:\n sign = i\n return str(cur_Num)\n\n\n\n\n cur_dig =''\n stack = []\n for i in s:\n if i.isdigit():\n cur_dig += i\n elif i == ' ':\n continue\n else:\n if cur_dig:\n stack.append(cur_dig)\n cur_dig = ''\n if i == ')':\n newVal = evaluate(stack)\n stack.append(newVal)\n else:\n stack.append(i)\n if cur_dig :\n stack.append(cur_dig)\n return int(evaluate(stack))\n ","runtime":"78"},{"code":"class Solution:\n def calculate(self, expr: str) -> int:\n #print(f'{expr=}')\n stack: list[int] = [0]\n sign = 1\n i = 0\n while i < len(expr):\n c = expr[i]\n #print(f'{stack=} {sign=} {c=} {expr[i:]=}')\n if c.isdigit():\n n = int(c)\n start = i\n i += 1\n while i < len(expr) and expr[i].isdigit():\n i += 1\n n = int(expr[start:i])\n #print(f'{stack=} {sign=} {n=} {expr[i:]=}')\n stack[-1] += sign * n\n continue\n elif c == ' ':\n pass\n elif c == '+':\n sign = 1\n elif c == '-':\n sign = -1\n elif c == '(':\n stack.append(sign)\n stack.append(0)\n sign = 1\n elif c == ')':\n n = stack.pop()\n sign = stack.pop()\n stack[-1] += sign * n\n i += 1\n assert len(stack) == 1\n return stack.pop()\n","runtime":"87"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n stack = []\n parantheses_sign_stack = []\n num = 0\n sign = \"+\"\n \n for i in range(len(s)):\n if s[i].isdigit():\n num = num * 10 + int(s[i])\n \n if not s[i].isdigit() and not s[i].isspace() or i == len(s) - 1:\n if s[i] == \")\":\n count = num if sign == \"+\" else -num\n while stack[-1] != \"(\":\n count += stack.pop()\n stack.pop()\n parantheses_sign = parantheses_sign_stack.pop()\n stack.append(count if parantheses_sign == \"+\" else -count)\n num = 0\n continue\n if s[i] == \"(\":\n stack.append(s[i])\n parantheses_sign_stack.append(sign)\n sign = \"+\"\n num = 0\n continue\n if sign == \"+\":\n stack.append(num)\n if sign == \"-\":\n stack.append(-num)\n\n sign = s[i]\n num = 0\n \n # print(\"stack: {}, parantheses_sign_stack: {}, num: {}, sign: {}\".format(stack, parantheses_sign_stack, num, sign))\n \n return sum(stack)\n \n\n \n","runtime":"87"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n stack = []\n parantheses_sign_stack = []\n num = 0\n sign = \"+\"\n \n for i in range(len(s)):\n if s[i].isdigit():\n num = num * 10 + int(s[i])\n \n if not s[i].isdigit() and not s[i].isspace() or i == len(s) - 1:\n if s[i] == \")\":\n count = num if sign == \"+\" else -num\n while stack[-1] != \"(\":\n count += stack.pop()\n stack.pop()\n parantheses_sign = parantheses_sign_stack.pop()\n stack.append(count if parantheses_sign == \"+\" else -count)\n num = 0\n continue\n if s[i] == \"(\":\n stack.append(s[i])\n parantheses_sign_stack.append(sign)\n sign = \"+\"\n num = 0\n continue\n if sign == \"+\":\n stack.append(num)\n if sign == \"-\":\n stack.append(-num)\n\n sign = s[i]\n num = 0\n \n # print(\"stack: {}, parantheses_sign_stack: {}, num: {}, sign: {}\".format(stack, parantheses_sign_stack, num, sign))\n \n return sum(stack)\n \n\n \n","runtime":"96"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(\" \", \"\")\n print(s)\n q = deque()\n\n i = 0\n curr_v = 0\n curr_op = \"+\"\n while i < len(s):\n if s[i].isnumeric():\n num, i = self.parse_number(s, i)\n if curr_op == \"+\":\n curr_v += num\n elif curr_op == \"-\":\n curr_v -= num\n else:\n if s[i] == \"(\":\n q.append(str(curr_v) + curr_op)\n curr_v = 0\n curr_op = \"+\"\n elif s[i] == \")\":\n prev_raw = q.pop()\n prev_n = int(prev_raw[:-1])\n prev_op = prev_raw[-1]\n if prev_op == \"+\":\n curr_v += prev_n\n elif prev_op == \"-\":\n curr_v = prev_n - curr_v\n else:\n curr_op = s[i]\n i += 1\n\n return curr_v\n\n\n def parse_number(self, s: str, i: int) -> tuple[int, int]:\n j = i\n while j < len(s) and s[j].isnumeric():\n j += 1\n return (int(s[i:j]), j)\n","runtime":"96"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n\n return Expression.evaluate(statement=s)\n\n\nclass Expression:\n\n # Used dictionaries for a quicker lookup reference\n NON_DIGITS = {\"(\", \")\", \"-\", \"+\"}\n OPERATORS = {\"-\", \"+\"}\n \n @classmethod\n def evaluate(cls, statement: str):\n statement = statement.replace(\" \", \"\")\n\n position = 0\n\n position, result = cls._evaluate(statement, position)\n\n return result\n\n @classmethod\n def _evaluate(cls, statement: str, position: int) -> tuple[int, list[int | str]]:\n stack = []\n partial_number = []\n\n while position < len(statement):\n token = statement[position]\n position += 1\n\n if partial_number and (token in cls.NON_DIGITS):\n operand = int(\"\".join(partial_number))\n partial_number.clear()\n cls._push_operand(operand=operand, stack=stack)\n\n match token:\n case \"(\":\n position, operand = cls._evaluate(\n statement=statement, position=position\n )\n cls._push_operand(operand=operand, stack=stack)\n case \")\":\n return position, stack[0]\n case \"+\" | \"-\":\n stack.append(token)\n case _:\n partial_number.append(token)\n\n if partial_number:\n operand = int(\"\".join(partial_number))\n cls._push_operand(operand=operand, stack=stack)\n\n return position, stack[0]\n\n @classmethod\n def _push_operand(cls, operand: int | None, stack: list[int | str]):\n\n if (len(stack) == 1) and (stack[-1] == \"-\"):\n # this is an edge case for a negative value\n stack[-1] = operand * -1\n\n elif (len(stack) > 1) and (stack[-1] in cls.OPERATORS):\n operator = stack.pop()\n\n # No need to pop the operand off, when I can reference and update it in place\n if operator == \"+\":\n stack[-1] += operand\n\n else:\n stack[-1] -= operand\n\n else:\n stack.append(operand)\n","runtime":"104"},{"code":"class Solution:\n def calculate(self, s):\n def update(op, v):\n if op == \"+\": stack.append(v)\n if op == \"-\": stack.append(-v)\n if op == \"*\": stack.append(stack.pop() * v) #for BC II and BC III\n if op == \"/\": stack.append(int(stack.pop() / v)) #for BC II and BC III\n \n it, num, stack, sign = 0, 0, [], \"+\"\n \n while it < len(s):\n if s[it].isdigit():\n num = num * 10 + int(s[it])\n elif s[it] in \"+-*/\":\n update(sign, num)\n num, sign = 0, s[it]\n elif s[it] == \"(\": # For BC I and BC III\n num, j = self.calculate(s[it + 1:])\n print(num, j)\n it = it + j\n elif s[it] == \")\": # For BC I and BC III\n update(sign, num)\n return sum(stack), it + 1\n it += 1\n update(sign, num)\n return sum(stack)","runtime":"104"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n\n return Expression.evaluate(statement=s)\n\n\nclass Expression:\n\n # Used dictionaries for a quicker lookup reference\n NON_DIGITS = {\"(\", \")\", \"-\", \"+\"}\n OPERATORS = {\"-\", \"+\"}\n \n @classmethod\n def evaluate(cls, statement: str):\n statement = statement.replace(\" \", \"\")\n\n position = 0\n\n position, result = cls._evaluate(statement, position)\n\n return result\n\n @classmethod\n def _evaluate(cls, statement: str, position: int) -> tuple[int, list[int | str]]:\n stack = []\n partial_number = []\n\n while position < len(statement):\n token = statement[position]\n position += 1\n\n if (token in cls.NON_DIGITS) and partial_number:\n operand = int(\"\".join(partial_number))\n partial_number.clear()\n cls._push_operand(operand=operand, stack=stack)\n\n match token:\n case \"(\":\n position, operand = cls._evaluate(\n statement=statement, position=position\n )\n cls._push_operand(operand=operand, stack=stack)\n case \")\":\n return position, stack[0]\n case \"+\" | \"-\":\n stack.append(token)\n case _:\n partial_number.append(token)\n\n if partial_number:\n operand = int(\"\".join(partial_number))\n cls._push_operand(operand=operand, stack=stack)\n\n return position, stack[0]\n\n @classmethod\n def _push_operand(cls, operand: int | None, stack: list[int | str]):\n\n if (len(stack) == 1) and (stack[-1] == \"-\"):\n # this is an edge case for a negative value\n stack[-1] = operand * -1\n\n elif (len(stack) > 1) and (stack[-1] in cls.OPERATORS):\n operator = stack.pop()\n\n # No need to pop the operand off, when I can reference and update it in place\n if operator == \"+\":\n stack[-1] += operand\n\n else:\n stack[-1] -= operand\n\n else:\n stack.append(operand)\n","runtime":"113"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n\n _, stack = Expression().evaluate(statement=s)\n return stack[0]\n\n\nclass Expression:\n\n # Used dictionaries for a quicker lookup reference\n NON_DIGITS = {\"(\", \")\", \"-\", \"+\", \" \"}\n OPERATORS = {\"-\", \"+\"}\n\n def evaluate(\n self, statement: str, position: int = 0\n ) -> tuple[int, list[int | str]]:\n stack = []\n number_starts_at = None\n\n\n while position < len(statement):\n token = statement[position]\n\n if (token in self.NON_DIGITS) and (number_starts_at is not None):\n operand = int(statement[number_starts_at:position])\n number_starts_at = None\n self._push_operand(operand=operand, stack=stack)\n\n if token == \" \":\n pass\n\n elif token == \"(\":\n position, operand = self.evaluate(\n statement=statement, position=position+1\n )\n self._push_operand(operand=operand, stack=stack)\n \n elif token == \")\":\n return position, stack[0]\n \n elif token in self.OPERATORS:\n stack.append(token)\n \n elif number_starts_at is None:\n number_starts_at = position\n\n position+=1\n\n if (number_starts_at is not None):\n operand = int(statement[number_starts_at:])\n self._push_operand(operand=operand, stack=stack)\n\n return position, stack\n\n def _push_operand(self, operand: int | None, stack: list[int | str]):\n\n if stack:\n if stack[0] == \"-\":\n # this is an edge case for a negative value\n stack[-1] = operand * -1\n\n elif (stack[-1] in self.OPERATORS):\n operator = stack.pop()\n\n # No need to pop the operand off, when I can reference and update it in place\n if operator == \"+\":\n stack[-1] += operand\n\n else:\n stack[-1] -= operand\n\n else:\n stack.append(operand)","runtime":"113"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n op_prios = {\n \"+\": 1,\n \"-\": 1,\n \"*\": 2,\n \"/\": 2,\n }\n\n op_funcs = {\n \"+\": operator.add,\n \"-\": operator.sub,\n \"*\": operator.mul,\n \"/\": lambda x, y: x // y if x * y > 0 else -(abs(x) // abs(y)),\n }\n\n stack = []\n rpn = []\n\n for i, c in enumerate(s):\n if c.isspace():\n continue\n\n if c.isnumeric():\n if i - 1 >= 0 and s[i - 1].isnumeric():\n rpn[-1] += c\n else:\n rpn.append(c)\n continue\n\n if c == '(':\n stack.append(c)\n continue\n\n if c == ')':\n while stack and stack[-1] != '(':\n rpn.append(stack.pop())\n stack.pop()\n continue\n\n if c == '-':\n prev_c = None\n for j in range(i - 1, -1, -1):\n if s[j] != ' ':\n prev_c = s[j]\n break\n if not prev_c or prev_c == '(':\n rpn.append(\"0\")\n \n # 弹出优先级更高的操作\n while stack and stack[-1] != '(' and op_prios[stack[-1]] >= op_prios[c]:\n rpn.append(stack.pop())\n \n stack.append(c)\n \n while stack:\n rpn.append(stack.pop())\n\n print(f\"{rpn}\")\n\n vals = []\n for token in rpn:\n if token.isnumeric():\n vals.append(int(token))\n continue\n \n rhs = vals.pop()\n lhs = vals.pop()\n vals.append(op_funcs[token](lhs, rhs))\n\n return vals[0]\n\n \n \n ","runtime":"121"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n stack = []\n\n j = 0\n while j < len(s):\n if s[j] == \" \":\n j += 1\n elif s[j].isnumeric():\n d = 0\n while s[j:j+d+1].isnumeric() and j+d <= len(s):\n d += 1\n num = int(s[j:j+d])\n j += d \n\n if stack and stack[-1] == '+':\n stack.pop(-1)\n prev = stack.pop(-1)\n stack.append(prev + num)\n elif stack and stack[-1] == '-':\n stack.pop(-1)\n prev = stack.pop(-1) if stack and type(stack[-1]) == int else 0\n if type(prev) == int:\n stack.append(prev - num)\n\n else:\n stack.append(num)\n elif s[j] in \"+-(\":\n stack.append(s[j])\n j += 1\n elif s[j] == ')':\n num = stack.pop(-1) #should be a number?\n temp = stack.pop(-1) # should be '('\n\n if stack and stack[-1] == '+':\n stack.pop(-1)\n prev = stack.pop(-1)\n stack.append(prev + num)\n elif stack and stack[-1] == '-':\n stack.pop(-1)\n prev = stack.pop(-1) if stack and type(stack[-1]) == int else 0\n stack.append(prev - num)\n elif not stack:\n stack.append(num)\n j += 1\n\n return stack[0]\n\n ","runtime":"121"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n idx=0\n stack=[]\n s=s.strip().replace(' ','')\n def getNextInt():\n nonlocal idx\n i=idx\n while i<len(s) and s[i].isdigit():\n i+=1\n res=int(s[idx:i])\n idx=i\n return res\n def getNext():\n nonlocal idx,stack\n if idx<len(s):\n if s[idx]==' ':\n idx+=1\n return 0\n elif s[idx].isdigit():\n stack.append(getNextInt())\n return 1\n elif s[idx]=='+' or s[idx]=='-':\n if s[idx]=='-' and (idx==0 or s[idx-1]=='('):\n idx+=1\n getNext()\n stack.append('*')\n return 1\n else:\n op=s[idx]\n idx+=1\n getNext()\n stack.append(op)\n return 2\n else:\n if s[idx]=='(':\n idx+=1\n while getNext()!=4:\n pass\n return 3\n else:\n idx+=1\n return 4\n return 5\n while idx<len(s):\n getNext()\n opStack=[]\n def cal():\n nonlocal stack,opStack\n op=stack.pop()\n num1,num2=None,None\n if not isinstance(stack[-1],int):\n cal()\n num1=stack.pop()\n if op=='*':\n stack.append(-num1)\n return\n if not isinstance(stack[-1],int):\n cal()\n num2=stack.pop()\n if op==\"+\":\n stack.append(num1+num2)\n elif op=='-':\n stack.append(num2-num1)\n if len(stack)>1:\n cal()\n return stack[-1]","runtime":"130"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n s = '(' + s + ')'\n p_stk = [0]\n stk = []\n num = 0\n num_used = False\n for c in s:\n if c.isdigit():\n num *= 10\n num += int(c)\n num_used = True\n else:\n if num_used:\n stk.append(num)\n num = 0\n num_used = False\n if c == '(':\n p_stk.append(len(stk))\n stk.append('(')\n elif c == '+':\n stk.append(c)\n elif c == '-':\n if not stk or type(stk[-1]) != int:\n stk.append(0)\n stk.append(c)\n elif c == ')':\n st = p_stk[-1] + 1\n comp = stk[st]\n for i in range(st + 1,len(stk),2):\n if stk[i] == '+':\n comp += stk[i+1]\n else:\n comp -= stk[i+1]\n stk = stk[:st-1]\n stk.append(comp)\n p_stk.pop()\n return stk[0]\n \n\n \n","runtime":"147"},{"code":"class Solution:\n def compute(self, s: str) -> int:\n # compute some lst without parentheses\n print(s)\n return sum(int(num) for num in s.replace('-', '+-').split('+') if len(num) != 0)\n\n def calculate(self, s: str) -> int:\n # ignore parentheses other than unary -\n dense = s.replace(' ', '')\n stack = []\n for c in dense:\n if c != ')':\n stack.append(c)\n else:\n open_paren_idx = len(stack) - 1\n while stack[open_paren_idx] != '(':\n open_paren_idx -= 1\n result = self.compute(''.join(stack[open_paren_idx + 1:]))\n if open_paren_idx > 0 and stack[open_paren_idx - 1] == '-':\n result = -result\n stack[open_paren_idx - 1] = '+'\n stack = stack[:open_paren_idx]\n stack.append(str(result))\n return self.compute(''.join(stack))","runtime":"147"},{"code":"class Solution:\n def parser(self, s):\n tokens = []\n ptr = 0\n currnum = 0\n num_str = set([str(i) for i in range(10)])\n\n while ptr < len(s):\n if s[ptr] == ' ':\n ptr += 1\n continue\n if s[ptr] in num_str:\n currnum = currnum * 10 + int(s[ptr])\n elif currnum > 0:\n tokens.append(currnum)\n tokens.append(s[ptr])\n currnum = 0\n else:\n tokens.append(s[ptr])\n ptr += 1\n if currnum > 0:\n tokens.append(currnum)\n\n return tokens\n\n def calculate(self, s: str) -> int:\n tokens = self.parser(s)\n q = deque(tokens)\n q.appendleft('(')\n q.append(')')\n return self.calc_expression(q)\n \n def calc_expression(self, q):\n q.popleft()\n ans = 0\n sign = 1\n while q and q[0] != ')':\n print(q[0])\n if q[0] == '-':\n sign = -1\n elif q[0] == '+':\n sign = 1\n elif q[0] == '(':\n ans += self.calc_expression(q) * sign\n q.popleft()\n continue\n else:\n ans += q[0] * sign\n sign = 1\n q.popleft()\n\n return ans\n","runtime":"155"},{"code":"class Solution:\n def calcPeace(self, s, start, end):\n p=s[start+1:end]\n while(p.find('--') != -1):\n p=p.replace('--','+')\n p=p.replace('++','+')\n if p[0]=='+':\n p=p[1:]\n #print(p)\n pos=p.split(\"+\")\n neg=list(map(lambda x: x.split('-'),pos))\n for i in range(len(neg)):\n for j in range(len(neg[i])):\n if neg[i][j]=='':\n #print(s,p,i)\n neg[i][j+1]='-'+neg[i][j+1]\n #del neg[i][j]\n neg[i] = [j for j in neg[i]if j != '' ]\n print(neg[i])\n neg[i]=list(map(lambda x: int(x), neg[i]))\n #print(neg[i])\n neg[i]=neg[i][0]-sum(neg[i][1:])\n #print(neg[i])\n #print(neg)\n #print(sum(neg))\n return sum(neg)\n\n\n def openBrakets(self,s):\n #res=[]\n #current=\"\"\n closeIdx=s.find(')')\n if closeIdx == -1:\n #print('no brakets')\n return self.calcPeace(s, -1, len(s))\n openIdx = s.rfind('(', 0,closeIdx)\n #print(s, openIdx,closeIdx)\n res=self.calcPeace(s, openIdx, closeIdx)\n left=right=\"\"\n if(openIdx > 0):\n left = s[:openIdx]\n mid=str(res)\n if closeIdx < len(s)-1:\n right=s[closeIdx+1:]\n #print(\"left+mid+right\",left+mid+right)\n return self.openBrakets(left+mid+right)\n \n\n \n def calculate(self, s: str) -> int:\n s=s.replace(' ','')\n res=self.openBrakets(s)\n #print(res)\n return res\n\n\n ","runtime":"155"},{"code":"class Reader:\n def __init__(self, s: str):\n self.s = s\n self.i = 0\n def getNext(self):\n self.i = min(self.i+1, len(self.s))\n def getCurrent(self) -> str:\n if self.i == len(self.s):\n return \"\"\n return self.s[self.i]\n\nclass Lexer:\n def __init__(self, r: Reader):\n self.r = r\n self.current = \"BEGIN\"\n self.getNext()\n def getNext(self):\n if self.current == \"END\":\n return\n s = self.r.getCurrent()\n while s == ' ':\n self.r.getNext()\n s = self.r.getCurrent()\n if s in {'+', '-', '(', ')'}:\n self.current = s\n self.r.getNext()\n return\n if s == '':\n self.current = \"END\"\n return\n num = 0\n while s.isdigit():\n num *= 10\n num += int(s)\n self.r.getNext()\n s = self.r.getCurrent()\n self.current = num\n def getCurrent(self) -> str:\n return self.current\n\nclass Solution:\n def calculate(self, s: str) -> int:\n stack = []\n r = Reader(s)\n l = Lexer(r)\n token = l.getCurrent()\n while token != \"END\":\n if token in {'+', '-', '('}:\n stack.append(token)\n elif token == ')':\n b = stack.pop()\n stack.pop() # '('\n if stack and stack[-1] == '+':\n stack.pop()\n a = stack.pop()\n stack.append(a+b)\n elif stack and stack[-1] == '-':\n stack.pop()\n if stack and isinstance(stack[-1], int):\n a = stack.pop()\n stack.append(a-b)\n else:\n stack.append(-b)\n else:\n stack.append(b)\n else:\n if stack and stack[-1] == '+':\n stack.pop()\n a = stack.pop()\n stack.append(a+token)\n elif stack and stack[-1] == '-':\n stack.pop()\n if stack and isinstance(stack[-1], int):\n a = stack.pop()\n stack.append(a-token)\n else:\n stack.append(-token)\n else:\n stack.append(token)\n l.getNext()\n token = l.getCurrent()\n if not stack:\n return 0\n return stack[-1]","runtime":"164"},{"code":"class EvaluateString:\n def evaluate(self, expr: str) -> int:\n # For expressions containing unary operation, e.g., \"1-(-2)\", insert 0 to the `values` stack before \"-\" only\n # if '-' is the first character, or we see \"(\" before \"-\".\n # NOTE: need to remove white spaces first in order for the above check to work.\n expr = expr.replace(' ', '')\n\n # Associativity constants for operators\n LEFT_ASSOC = 0\n RIGHT_ASSOC = 1\n\n # Supported operators. NOTE: \"()\" are not operators.\n op_info = {\n \"+\": (0, LEFT_ASSOC, lambda a, b: a + b),\n \"-\": (0, LEFT_ASSOC, lambda a, b: a - b),\n \"*\": (5, LEFT_ASSOC, lambda a, b: a * b),\n \"/\": (5, LEFT_ASSOC, lambda a, b: a // b),\n \"%\": (5, LEFT_ASSOC, lambda a, b: a % b),\n \"^\": (10, RIGHT_ASSOC, lambda a, b: a ** b)\n }\n\n def isOperator(token):\n return token in op_info\n\n def isAssociative(token, assoc_type):\n if token not in op_info:\n raise ValueError(f\"Invalid token: {token}\")\n return op_info[token][1] == assoc_type\n\n def cmpPrecedence(token1, token2):\n if token1 not in op_info or token2 not in op_info:\n raise ValueError(f\"Invalid tokens: {token1} {token2}\")\n return op_info[token1][0] - op_info[token2][0]\n\n def applyOp(op: str, b: int, a: int) -> int:\n fn = op_info[op][2]\n return fn(a, b)\n\n\n # Stack for numbers: 'values'\n values = []\n # Stack for Operators: 'ops'\n ops = []\n\n i = 0\n while i < len(expr):\n if expr[i] == ' ':\n i += 1\n continue\n\n # Take care of unary operation, e.g., \"1-(-2)\".\n if expr[i] == '-' and (i == 0 or expr[i - 1] == '('):\n values.append(0)\n\n # Current token is a number, push it to stack for numbers\n if expr[i].isdigit():\n num = 0\n # There may be more than one digits in number\n while i < len(expr) and expr[i].isdigit():\n num = num * 10 + int(expr[i])\n i += 1\n values.append(num)\n continue\n\n if expr[i] == '(':\n ops.append(expr[i])\n i += 1\n continue\n\n # Closing brace encountered, solve entire brace.\n # NOTE: though we are solving the entire sub-expression inside \"()\", it might not\n # be the actual sub-expression from the input. E.g., for \"(2+3-5)\", when we are at \"-\",\n # we already go through the branch `if expr[i] in \"+-*/\"`, and reduced the expression to\n # `(5-5)`.\n if expr[i] == ')':\n while ops and ops[-1] != '(':\n values.append(applyOp(ops.pop(), values.pop(), values.pop()))\n ops.pop() # pop \"(\"\n i += 1\n continue\n\n # Current token is an operator.\n if isOperator(expr[i]):\n # isOperator() helps us stop when we see \"(\".\n while (ops and isOperator(ops[-1]) and\n ((isAssociative(expr[i], LEFT_ASSOC) and cmpPrecedence(expr[i], ops[-1]) <= 0) or\n (isAssociative(expr[i], RIGHT_ASSOC) and cmpPrecedence(expr[i], ops[-1]) < 0))):\n values.append(applyOp(ops.pop(), values.pop(), values.pop()))\n ops.append(expr[i])\n i += 1\n\n # Entire expression has been parsed at this point, apply remaining\n # ops to remaining values\n while ops:\n values.append(applyOp(ops.pop(), values.pop(), values.pop()))\n\n # Top of 'values' contains the result, return it\n return values.pop()\n\nclass Solution:\n def calculate(self, s: str) -> int:\n evaluator = EvaluateString()\n return evaluator.evaluate(s)","runtime":"164"},{"code":"from typing import Literal\nimport math\n\n\nToken = Literal['-', '+', '/', '*', '(', ')'] | int\n\nclass Evaluator:\n def __init__(self, expression: str):\n self.tokens = self.tokenize(expression)\n self.len = len(self.tokens)\n self.idx = 0\n\n @staticmethod\n def tokenize(expr: str) -> list[Token]:\n tokens = []\n for i, char in enumerate(expr):\n match char:\n case ' ':\n continue\n case op if op in ['-', '+', '/', '*', '(', ')']:\n if op in ['+', '-'] and (i == 0 or tokens[-1] in ['+', '/', '*', '-', '(']):\n # Normalize unary '-' to -1 * for simplicity\n if op == '-':\n tokens.extend([-1, '*'])\n continue\n tokens.append(op)\n case d if d.isdigit():\n n = int(d)\n last_token = tokens[-1] if tokens else None\n if not last_token or not isinstance(last_token, int):\n tokens.append(n)\n continue\n tokens[-1] = last_token * 10 + n\n case unexpected:\n raise SyntaxError(f\"Invalid token '{unexpected}' encountered\")\n print(f\"tokenized: {tokens}\")\n return tokens\n\n def peek(self) -> Token | None:\n return self.tokens[self.idx] if self.idx < self.len else None\n\n def next(self) -> Token:\n next = self.peek()\n assert next is not None, \"Next called on exhausted token pool\"\n self.idx += 1\n return next\n\n\n def evaluate(self) -> int:\n return self.eval_l0()\n\n def eval_l0(self) -> int:\n \"Eval rule <expr>([+-]<expr>)?\"\n lhs = self.eval_l1()\n while self.peek() in ['+', '-']:\n op = self.next()\n rhs = self.eval_l1()\n match op:\n case '+':\n lhs += rhs\n case '-':\n lhs -= rhs\n case _:\n assert False\n return lhs\n\n\n def eval_l1(self) -> int:\n \"Eval rule <expr>([*/]<expr>)?\"\n lhs = self.eval_l2()\n while self.peek() in ['*', '/']:\n op = self.next()\n rhs = self.eval_l2()\n match op:\n case '*':\n lhs *= rhs\n case '/':\n lhs /= rhs # TODO: truncate to zero\n case _:\n assert False\n # Truncate towards 0\n is_negative = lhs < 0\n lhs = math.floor(abs(lhs)) * (-1 if is_negative else 1)\n return lhs\n\n def eval_l2(self) -> int:\n \"Eval rule <digit> | (<expr>)\"\n if self.peek() in [None, ')']:\n return 0\n\n match self.next():\n case '(':\n subexpr = self.evaluate()\n if (next := self.next()) != ')':\n raise SyntaxError(f\"')' expected, got {next} at idx={self.idx-1} @ {self.tokens[self.idx - 1]}\")\n return subexpr\n\n case n if isinstance(n, int):\n return n\n\n case token:\n raise SyntaxError(f\"Unexpected token '{token}' @ idx={self.idx - 1}\")\nclass Solution:\n def calculate(self, s: str) -> int:\n e = Evaluator(s)\n return e.evaluate()","runtime":"172"},{"code":"def tokenize(s):\n tokens = []\n i = 0\n s = s.replace(\" \", \"\")\n n = len(s)\n while i < n:\n if s[i] in \"/*+()\":\n tokens.append(s[i])\n elif s[i].isdigit():\n start = i\n while (i + 1) < n and s[i+1].isdigit():\n i += 1\n tokens.append(int(s[start:i+1]))\n # If an operator is the first thing in your expression\n elif s[i] == \"-\" and i == 0:\n tokens.append(\"_\")\n # or comes after another operator or comes after a left parenthesis\n elif s[i] == \"-\" and i > 0 and s[i - 1] in \"/*+-(\":\n tokens.append(\"_\")\n elif s[i] == \"-\":\n tokens.append(\"-\")\n i += 1\n return tokens\n\ndef precedence(token):\n if token in \"()\":\n return 4\n elif token in \"*/\":\n return 3\n elif token == \"+\":\n return 2\n elif token == \"-\":\n return 1\n elif token == \"_\":\n return 0\n\ndef infix_to_prefix(tokens):\n stack = []\n output = []\n for token in tokens:\n if isinstance(token, int):\n output.append(token)\n elif token == \"(\":\n stack.append(token)\n elif token == \")\":\n while stack and (t := stack.pop()) != \"(\":\n output.append(t)\n elif stack and precedence(token) >= precedence(stack[-1]):\n while stack and stack[-1] and precedence(token) >= precedence(stack[-1]):\n t = stack.pop()\n output.append(t)\n stack.append(token)\n else:\n stack.append(token)\n while stack:\n output.append(stack.pop())\n return output\n\n\ndef evaluate(tokens):\n stack = []\n operators = {\n \"*\": lambda x, y: x * y,\n \"/\": lambda x, y: int(x / y),\n \"+\": lambda x, y: x + y,\n \"-\": lambda x, y: x - y,\n }\n print(tokens)\n for token in tokens:\n if isinstance(token, int):\n stack.append(token)\n else:\n if token == \"_\":\n b = stack.pop()\n c = -b\n else:\n b = stack.pop()\n a = stack.pop()\n c = operators[token](a, b)\n stack.append(c)\n return stack[0]\n\nclass Solution:\n def calculate(self, s: str) -> int:\n tokens = tokenize(s)\n tokens = infix_to_prefix(tokens)\n return evaluate(tokens)","runtime":"172"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n \n s = s+')'\n def myeval(si):\n # print(s[si:])\n # if (: myeval\n # if ): return sum(stack)\n stack = [] \n op = '+'\n v = 0\n while si<len(s):\n print(si, s[si])\n if s[si] == ' ': pass\n elif s[si] in ['+','-',')']:\n if op == '+': stack.append(v)\n else: stack.append(-v)\n if s[si] == ')': break\n v = 0\n op = s[si] \n elif s[si] == '(': \n si, v = myeval(si+1)\n else: # numeric\n v = v*10+int(s[si])\n # print(op,v,stack)\n si +=1\n return si, sum(stack)\n endi, out = myeval(0) \n return out","runtime":"181"},{"code":"class Solution:\n def cal(self,l):\n if l[0]=='-':\n cur = -int(l[1])\n l = l[2:]\n else:\n cur = int(l[0])\n l = l[1:]\n op = '+'\n for i in range(len(l)):\n if l[i].isdigit() or (len(l[i])!=1):\n if op == '+':\n cur += int(l[i])\n if op == '-':\n cur -= int(l[i])\n else:\n op = l[i]\n return str(cur)\n def calculate(self, s: str) -> int:\n stack = []\n i=0\n while i < len(s):\n if s[i] == ' ':\n i += 1\n continue\n elif s[i] == ')':\n j = len(stack)-1\n while stack[j]!='(':\n j-=1\n l = stack[j+1:i]\n stack = stack[:j]\n stack.append(self.cal(l))\n i+=1\n else:\n if s[i].isdigit():\n c=s[i]\n while i<len(s)-1 and s[i+1].isdigit():\n c+=s[i+1]\n i+=1\n stack.append(c)\n i += 1\n else:\n stack.append(s[i])\n i+=1\n \n return int(self.cal(stack))\n","runtime":"181"},{"code":"from dataclasses import dataclass\n\nPRECEDENCE = {\n \"+\": 0,\n \"-\": 0,\n \"*\": 1,\n \"/\": 1,\n}\n\n@dataclass\nclass Expr:\n op: Literal[\"+\", \"-\", \"*\", \"/\"]\n left: Union[\"Expr\", int]\n right: Union[\"Expr\", int]\n\n\nclass Solution:\n def calculate(self, s: str) -> int:\n return self.eval_expr(self.calculate_at(s, 0)[0])\n\n def calculate_at(self, s: str, i: int) -> tuple[Expr, int]:\n output_stack = []\n operator_stack = []\n unary_op = None\n\n expr = None\n\n while i < len(s):\n x, i = self.token(s, i)\n\n if isinstance(x, int):\n if expr is None:\n expr = self.apply_unary_op(x, unary_op)\n else:\n output_stack.append(x)\n elif x == '(':\n x, i = self.calculate_at(s, i)\n # print(\"SUBEXPR IS \", x)\n if expr is None:\n expr = self.apply_unary_op(x, unary_op)\n else:\n output_stack.append(x)\n elif x == ')':\n break\n elif x == ' ':\n continue\n else:\n # print(x)\n p = PRECEDENCE[x]\n if expr is None:\n unary_op = x\n continue\n\n if operator_stack and p <= PRECEDENCE[operator_stack[-1]]:\n expr = self.build_expr(expr, output_stack, operator_stack)\n\n operator_stack.append(x)\n\n if operator_stack:\n expr = self.build_expr(expr, output_stack, operator_stack)\n\n # print(expr)\n\n return expr, i\n \n def token(self, s: str, i: int) -> (str | int, int):\n if s[i].isdigit():\n x = 0\n\n while i < len(s) and s[i].isdigit():\n x = x * 10 + int(s[i])\n i += 1 \n else:\n x = s[i]\n i += 1\n\n return x, i\n\n def build_expr(\n self,\n left: Expr | int,\n output_stack: list[int | Expr],\n operator_stack: list[str]\n ):\n cur_expr = output_stack.pop()\n while len(operator_stack) > 1:\n cur_expr = Expr(\n op=operator_stack.pop(),\n right=cur_expr,\n left=output_stack.pop(),\n )\n\n return Expr(\n op=operator_stack.pop(),\n right=cur_expr,\n left=left,\n )\n\n def combine_expr(self, a: Expr | None | int, b: Expr, op: str):\n if a is None:\n return b\n\n return Expr(\n op,\n a,\n b,\n )\n\n def apply_unary_op(self, expr: Expr, op: str | None) -> Expr:\n if op:\n return Expr(op, None, expr)\n return expr\n \n def eval_expr(self, expr: Expr | int | None) -> int:\n if expr is None:\n return 0\n if isinstance(expr, int):\n return expr\n\n if expr.left is None:\n a = expr.right if isinstance(expr.right, int) else self.eval_expr(expr.right)\n return a if expr.op == \"+\" else -a\n\n a = expr.left if isinstance(expr.left, int) else self.eval_expr(expr.left)\n b = expr.right if isinstance(expr.right, int) else self.eval_expr(expr.right)\n\n if expr.op == \"+\":\n return a + b\n elif expr.op == \"-\":\n return a - b\n elif expr.op == \"*\":\n return a * b\n else:\n return a / b","runtime":"189"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n stack = []\n curr_sign = 1\n number = 0\n res = 0\n n = len(s)\n numbers_list = ['0','1','2','3','4','5','6','7','8','9']\n\n for char_i in range(n):\n print(f\"char: {s[char_i]}, res: {res}, number: {number}, curr_sign: {curr_sign}\")\n char = s[char_i]\n if char in numbers_list:\n number = number * 10 + int(char)\n if char_i < n-1 and s[char_i + 1] in numbers_list:\n continue\n else:\n res += number * curr_sign\n number = 0\n curr_sign = 1\n elif char in \"+-\":\n res += number * curr_sign\n number = 0\n curr_sign = 1 if char == \"+\" else -1\n elif char == \"(\":\n stack.append([res, curr_sign])\n res = 0\n number = 0\n curr_sign = 1\n elif char == \")\":\n [recent_res, recent_sign] = stack.pop()\n res = recent_res + res * recent_sign\n number = 0\n curr_sign = 1\n return res\n","runtime":"189"},{"code":"class Node:\n def __init__(self, val):\n self.val = val\n self.is_opr = None\n self.is_par = None\n self.prev = None\n self.eval_ready = None\n\nclass EvalStack:\n def __init__(self):\n self.stack = None\n \n def push(self, val):\n node = Node(val)\n prev_is_opr = self.stack.is_opr if self.stack else None\n if val in [\"+\", \"-\"]:\n node.is_opr = True\n node.is_par = False\n elif val in [\"(\", \")\"]:\n node.is_opr = False\n node.is_par = True\n else:\n node.is_opr = False\n node.is_par = False\n \n if (prev_is_opr and not node.is_opr and not node.is_par) or (val == \")\"):\n node.eval_ready = True\n else:\n node.eval_ready = False\n \n node.prev = self.stack\n self.stack = node\n\n def pop(self):\n if not self.stack:\n return None\n node = self.stack\n self.stack = self.stack.prev\n return node.val\n \n def print(self):\n point = self.stack\n while point:\n print(point.val,end=\"\")\n point = point.prev\n print()\n\nclass Solution:\n def calculate(self, s: str) -> int:\n def eval_opr(opr1, opr, opr2):\n if opr == \"+\":\n return int(opr1) + int(opr2)\n elif opr == \"-\":\n return int(opr1) - int(opr2)\n else:\n return None\n \n def split_exp(exp, *args):\n output = []\n curr = \"\"\n prev_char = \"\"\n for item in exp:\n if item == \" \":\n continue\n if item in args and not (item == \"-\" and prev_char in [\"(\", \"+\", \"-\", \"\"]):\n if curr:\n output.append(curr)\n output.append(item)\n curr = \"\"\n\n elif item == \"-\" and prev_char in [\"(\", \"+\", \"-\", \"\"]:\n output.append(\"0\")\n output.append(\"-\")\n else:\n curr += item\n prev_char = item\n \n if curr:\n output.append(curr)\n return output\n\n \n tokens = split_exp(s, \"+\", \"-\", \"(\", \")\")\n n = len(tokens)\n evals = EvalStack()\n\n for i in range(n):\n if tokens[i] == \" \" or tokens[i] == \"\":\n continue\n\n evals.push(tokens[i])\n while evals.stack.eval_ready:\n if evals.stack.val == \")\":\n evals.pop()\n val = evals.pop()\n evals.pop()\n evals.push(val)\n continue\n \n opr2 = evals.pop()\n opr = evals.pop()\n opr1 = evals.pop()\n output = eval_opr(opr1, opr, opr2)\n evals.push(output)\n \n return int(evals.stack.val)\n","runtime":"198"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n operands = [\"+\", \"-\", \"(\"]\n special_char = [\"+\", \"-\", \"(\", \")\", \" \"]\n number = []\n operation = 1\n total = 0\n\n def get_full_num(index, string):\n full_number = string[index]\n while index+1 < len(string) and string[index+1] not in special_char:\n index += 1\n full_number += string[index] \n print(full_number)\n return [full_number, index]\n\n def assess_parenthesis(index, string):\n value = 0\n operation_2 = 1\n contents = []\n index += 1\n while index < len(string):\n if string[index] == \" \":\n index += 1\n continue\n\n if string[index] == \"(\":\n if operation_2 == 1:\n result = assess_parenthesis(index, string)\n value += result[0]\n index = result[1]\n elif operation_2 == 2:\n result = assess_parenthesis(index, string)\n value -= result[0]\n index = result[1]\n\n elif string[index] == \"+\":\n operation_2 = 1\n\n elif string[index] == \"-\":\n operation_2 = 2\n\n elif string[index] == \")\":\n return [value, index]\n\n else:\n full_num_data = get_full_num(index, string)\n if operation_2 == 1:\n value += int(full_num_data[0])\n elif operation_2 == 2:\n value -= int(full_num_data[0])\n index = full_num_data[1]\n print(\"value\", value)\n index += 1\n\n i = 0\n while i < len(s):\n if s[i] == \" \":\n i += 1\n continue\n elif s[i] == \"(\":\n parenthesis_result = assess_parenthesis(i, s)\n if operation == 1:\n total += parenthesis_result[0]\n else:\n total -= parenthesis_result[0]\n i = parenthesis_result[1]\n elif s[i] == \"+\":\n print(\"op1\")\n operation = 1\n elif s[i] == \"-\":\n print(\"op2\")\n operation = 2\n elif s[i] == \")\":\n return value\n else:\n num_data = get_full_num(i, s) \n i = num_data[1]\n if operation == 1:\n print(\"data\", num_data[0])\n total += int(num_data[0])\n else:\n print(\"data\", num_data[0])\n total -= int(num_data[0])\n i += 1\n #print(total)\n\n return total\n\n ","runtime":"198"},{"code":"class Tokenizer:\n def __init__(self, s: str):\n self.s = s\n self.pc = 0\n self.skip_whitespaces()\n\n def has_next(self):\n return self.pc < len(self.s)\n \n def next(self):\n self.pc += 1\n self.skip_whitespaces()\n \n def skip_whitespaces(self):\n while self.has_next() and self.current() == \" \":\n self.pc += 1\n \n def is_digit(self):\n return self.current().isdigit()\n \n def current(self):\n return self.s[self.pc]\n\nclass Solution:\n def calculate(self, s: str) -> int:\n\n t = Tokenizer(s)\n ops = {\n \"+\": lambda a, b: a + b,\n \"-\": lambda a, b: a - b,\n }\n \n def num():\n n = 0\n while t.has_next() and t.is_digit():\n n = (n * 10) + int(t.current())\n t.next()\n return n\n \n def factor():\n neg = 1\n if t.current() == \"-\":\n t.next()\n neg = -1\n \n if t.current() == \"(\":\n t.next()\n n = expr()\n t.next()\n elif t.is_digit():\n n = num()\n else:\n raise ValueError()\n \n return n * neg\n \n def expr():\n acc = factor()\n while t.has_next() and t.current() in ops:\n op = t.current()\n t.next()\n acc = ops[op](acc, factor())\n return acc\n \n return expr()","runtime":"207"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(\" \",\"\")\n last_open_bracket = []\n stack = []\n\n for i in range(len(s)):\n stack.append(s[i])\n if s[i] == \"(\":\n last_open_bracket.append(len(stack)-1)\n\n elif s[i] == \")\":\n last_open = last_open_bracket.pop()\n value = help_calculate(stack[last_open+1:-1])\n\n stack = stack[:last_open]\n \n for i in value:\n stack.append(i)\n\n return int(help_calculate(stack))\n\n\n \n\n\n\n\ndef help_calculate(s):\n print(\"string der reinkommt: \"+str(s))\n lastwasminus = False\n lastwasplus = False\n neues_s = \"\"\n for i in range(len(s)):\n if lastwasminus and s[i] == \"-\":\n neues_s = neues_s[:-1]+\"+\"\n lastwasminus = False\n elif lastwasminus and s[i] == \"+\":\n neues_s = neues_s[:-1]+\"-\"\n lastwasminus = False\n elif lastwasplus and s[i] == \"-\":\n neues_s = neues_s[:-1]+\"-\"\n lastwasplus = False\n elif s[i] == \"-\":\n lastwasminus = True\n lastwasplus = False\n neues_s+=\"-\"\n elif s[i] == \"+\":\n lastwasminus = False\n lastwasplus = True\n neues_s+=\"+\"\n else:\n neues_s+=s[i]\n lastwasminus = False\n lastwasplus = False\n s = neues_s\n zeichen = [i for i in s if i == \"+\" or i == \"-\"]\n splitted_s = ''.join(s).replace('+', ' ').replace('-', ' ').split()\n start = 0\n for i,j in list(zip(zeichen[::-1],splitted_s[::-1])):\n start += int(str(i)+ str(j))\n if len(zeichen) < len(splitted_s):\n start += int(splitted_s[0])\n return str(start)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n\n\n ","runtime":"207"},{"code":"INF = float('inf')\nEPS = 1e-6\nDUMMY = '?'\n\nclass Node:\n def __init__(self, val=0, op='', pri=0):\n self.val = val\n self.op = op\n self.pri = pri\n self.left = None\n self.right = None\n def __repr__(self,):\n lstr = f\"\\nL{self.left}\" if self.left else \"\"\n rstr = f\"\\nR{self.right}\" if self.right else \"\"\n return f\"{self.val},{self.op},{self.pri}{lstr}{rstr}\"\n\nclass Solution:\n def calculate(self, s: str) -> int:\n c2pri = {\"+\":1,\"-\":1, DUMMY:-INF}\n s = s.strip()\n if s[0] == '-': # ex. '-1'\n s = \"0\"+s\n stack = [] # monotomic inc\n num = 0\n base_pri = 0\n for i in range(len(s)):\n c = s[i]\n \n if c.isdigit():\n num = num*10+int(c) # don't continue !\n if i == len(s)-1: # careful !!!\n c = DUMMY # use dummy to clear stack!\n if c.isdigit():\n continue\n if c==\" \":\n continue\n elif c == '(':\n base_pri += 10\n elif c == ')':\n base_pri -= 10\n else: # + - ? ; // [prev, nd, op]\n nd = Node(val=num, pri=INF)\n num = 0\n stack.append(nd) # mono inc stack !\n op = Node(op=c, pri = base_pri+c2pri[c]-i*EPS)\n # min-tree: max of left-smaller and right-smaller is parent\n while stack and stack[-1].pri >= op.pri:\n prev = stack.pop() # [-1, prev, op]\n if stack:\n if stack[-1].pri >= op.pri:\n # don't link to op, keep backwards! op could be dummy\n stack[-1].right = prev\n else:\n op.left = prev\n else:\n op.left = prev\n stack.append(op)\n root = stack[-1].left\n return self.post(root)\n \n def post(self,node):\n if node.left is None and node.right is None:\n return node.val\n l = self.post(node.left)\n r = self.post(node.right)\n if node.op == \"+\":\n return l+r\n elif node.op == \"-\":\n return l-r\n\n\"\"\"\nhttps://leetcode.com/problems/basic-calculator/solutions/1456850/python-basic-calculator-i-ii-iii-easy-solution-detailed-explanation/\n\"\"\"\n","runtime":"215"},{"code":"import re\nclass Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(\" \",\"\")\n i = 0\n n = len(s)\n st = [0]\n sgn = 1\n op = 1\n while i<n:\n #print(st)\n if s[i]==\"(\":\n if i>0 and s[i-1]==\"-\": op = -1\n if i>0 and s[i-1]==\"+\": op = 1\n sgn = 1\n st.append(op)\n st.append(0)\n i += 1\n continue\n if s[i]==\")\":\n res = st.pop()\n sgn = st.pop()\n st[-1] += sgn*res\n i += 1\n continue\n if s[i]==\"+\" or s[i]==\"-\":\n sgn = 1 if s[i]==\"+\" else -1\n i += 1 \n continue\n if re.match(\"[0-9]\",s[i]):\n s_i = i\n while i<n and re.match(\"[0-9]\",s[i]):\n i += 1\n st[-1] += sgn*int(s[s_i:i]) \n #print(st) \n return st[-1]\n \n \n \n","runtime":"215"},{"code":"#\"(1+(4+5+2)-3)+(6+8)\"\n\nclass Solution:\n def parseNum(self, s, idx):\n num = \"\"\n\n while idx < len(s) and s[idx] >= '0' and s[idx] <= '9':\n num += s[idx]\n idx += 1\n return int(num), idx-1\n\n\n def evalExpression(self, s, idx):\n st = []\n curr = s[idx]\n\n while curr != ')' and idx < len(s):\n curr = s[idx]\n print(st)\n if curr == '(':\n num, idx = self.evalExpression(s, idx+1)\n #handle num\n while st:\n prev = st.pop()\n if prev == '-':\n num *= -1\n elif prev == '+':\n continue\n else:\n num = prev + num\n\n st.append(num)\n continue\n\n elif curr == '+':\n st.append('+')\n elif curr == '-':\n st.append('-')\n elif curr >= '0' and curr <= '9':\n num, idx = self.parseNum(s, idx)\n #handle num\n while st:\n prev = st.pop()\n if prev == '-':\n num *= -1\n elif prev == '+':\n continue\n else:\n num = prev + num\n\n st.append(num)\n\n idx += 1\n return st.pop(), idx\n\n def calculate(self, s: str) -> int:\n return self.evalExpression(s, 0)[0]","runtime":"224"},{"code":"class Solution:\n def custom_eval(expression: list) -> int:\n #print(expression)\n\n result = None\n current_operator = \"\"\n\n for value in expression:\n #print(value)\n\n if isinstance(value, str):\n current_operator = value\n else:\n if isinstance(value, list):\n value = Solution.custom_eval(value)\n\n if current_operator in [\"+\", \"-\"]:\n if result is None:\n result = 0\n\n if current_operator == \"+\":\n result = result + value\n elif current_operator == \"-\":\n result = result - value\n elif result is None:\n result = value\n #else:\n # print(f\"Unsupported operator: '{current_operator}'\")\n\n return result\n\n def build_expression(s: str, current_index: int = 0) -> list:\n s = s.replace(\" \", \"\")\n result = []\n\n current_value = \"\"\n #for i, c in enumerate(s):\n while current_index < len(s):\n c = s[current_index]\n\n if c == \"(\":\n if len(current_value) != 0:\n result.append(int(current_value))\n current_value = \"\"\n\n current_index, expression = Solution.build_expression(s, current_index + 1)\n result.append(expression)\n elif c.isdigit():\n current_value += c\n elif c in [\"-\", \"+\"]:\n if len(current_value) != 0:\n result.append(int(current_value))\n current_value = \"\"\n\n result.append(c)\n elif c == \")\":\n break\n else:\n raise ValueError(f\"Unexpected token: '{c}'\")\n\n current_index += 1\n \n if len(current_value) != 0:\n result.append(int(current_value))\n current_value = \"\"\n\n return current_index, result\n\n def calculate(self, s: str) -> int:\n _, expression = Solution.build_expression(s)\n #print(expression)\n result = Solution.custom_eval(expression)\n #print(result)\n\n return result\n ","runtime":"224"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n start = 0\n end = 0\n s_l = []\n for i in range(len(s)):\n ch = s[i]\n if ch in '()+-':\n if end>start:\n s_l.append(s[start:end])\n s_l.append(ch)\n start = i+1\n end = i+1\n elif ch ==' ':\n if end>start:\n s_l.append(s[start:end])\n start = i+1\n end = i+1\n else:\n end+=1\n if end>start:\n s_l.append(s[start:end+1])\n s = s_l\n\n stack = []\n stack_full = []\n for i in range(len(s)):\n ch = s[i]\n if ch=='(':\n stack.append(len(stack_full))\n stack_full.append(ch)\n elif ch==')':\n index = stack.pop(-1)\n expression = stack_full[index+1:]\n prior = stack_full[0:index]\n value = 0\n state = 1\n for ch_e in expression:\n if ch_e=='-':\n state*=-1\n elif ch_e !='+':\n num = int(ch_e)\n value +=state*num\n state = 1\n stack_full = prior+[str(value)]\n elif ch!=' ':\n stack_full.append(ch)\n value = 0\n state = 1\n for ch_e in stack_full:\n if ch_e=='-':\n state*=-1\n elif ch_e !='+':\n num = int(ch_e)\n value +=state*num\n state = 1\n return value","runtime":"232"},{"code":"class Solution:\n def custom_eval(expression: list) -> int:\n #print(expression)\n\n result = None\n current_operator = \"\"\n\n for value in expression:\n #print(value)\n\n if isinstance(value, str):\n current_operator = value\n else:\n if isinstance(value, list):\n value = Solution.custom_eval(value)\n\n if current_operator in [\"+\", \"-\"]:\n if result is None:\n result = 0\n\n if current_operator == \"+\":\n result = result + value\n elif current_operator == \"-\":\n result = result - value\n elif result is None:\n result = value\n #else:\n # print(f\"Unsupported operator: '{current_operator}'\")\n\n return result\n\n def build_expression(s: str, current_index: int = 0) -> list:\n s = s.replace(\" \", \"\")\n result = []\n\n current_value = \"\"\n #for i, c in enumerate(s):\n while current_index < len(s):\n c = s[current_index]\n\n if c == \"(\":\n if len(current_value) != 0:\n result.append(int(current_value))\n current_value = \"\"\n\n current_index, expression = Solution.build_expression(s, current_index + 1)\n result.append(expression)\n elif c.isdigit():\n current_value += c\n elif c in [\"-\", \"+\"]:\n if len(current_value) != 0:\n result.append(int(current_value))\n current_value = \"\"\n\n result.append(c)\n elif c == \")\":\n break\n else:\n raise ValueError(f\"Unexpected token: '{c}'\")\n\n current_index += 1\n \n if len(current_value) != 0:\n result.append(int(current_value))\n current_value = \"\"\n\n return current_index, result\n\n def calculate(self, s: str) -> int:\n _, expression = Solution.build_expression(s)\n #print(expression)\n result = Solution.custom_eval(expression)\n #print(result)\n\n return result\n ","runtime":"232"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n st = []\n evalSt = []\n digits = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']\n\n i = 0\n while i < len(s):\n c = s[i]\n if c == ' ':\n pass\n \n if c in ['+', '-', '(']:\n st.append(c)\n \n if c in digits:\n integer = str(c)\n i += 1\n while i < len(s) and s[i] in digits:\n integer += str(s[i])\n i += 1\n st.append(integer)\n continue\n \n if c == ')':\n while st[-1] != '(':\n evalSt = [st.pop()] + evalSt\n st.pop()\n val = self.evaluate(evalSt)\n st.append(val)\n evalSt = []\n i+= 1\n # print(st)\n \n return self.evaluate(st)\n \n \n def evaluate(self, evalSt):\n # print(\"evaluate = \", evalSt)\n\n if evalSt[0] == '-':\n minus = evalSt.pop(0)\n val = int(evalSt.pop(0)) * -1\n evalSt = [val] + evalSt\n \n\n while len(evalSt) >= 3:\n leftOperand = evalSt.pop(0)\n operator = evalSt.pop(0)\n rightOperand = evalSt.pop(0)\n\n val = 0\n if operator == '+':\n val = int(leftOperand) + int(rightOperand)\n \n if operator == '-':\n val = int(leftOperand) - int(rightOperand)\n \n evalSt = [val] + evalSt\n \n \n # print(\"evaluate Done = \", evalSt)\n return int(evalSt.pop())\n \n ","runtime":"241"},{"code":"class Solution:\n def calc(self, s, idx):\n ops = [] # queue\n vals = [] # stack\n def evaluate(c):\n if(not len(vals) and not len(ops)):\n vals.append(int(c))\n elif(not len(vals) and len(ops)):\n op = ops.pop()\n if(op == \"-\"):\n vals.append(-int(c))\n elif(len(ops)):\n op = ops.pop()\n if(op == \"-\"):\n val1 = vals.pop()\n vals.append(val1-int(c))\n if(op == \"+\"):\n val1 = vals.pop()\n vals.append(val1+int(c))\n while(idx < len(s)):\n c = s[idx]\n idx += 1\n print(f'{c} {vals} {ops}')\n if(c=='+' or c=='-'):\n ops.append(c)\n elif(c=='('):\n val, idx = (self.calc(s, idx))\n evaluate(val)\n elif(c==')'):\n return vals[-1], idx\n elif(c!=' '):\n i=0\n while(idx+i<len(s) and s[idx+i].isdigit()):\n i+=1\n i-= 1\n c = s[idx-1:idx+i+1]\n evaluate(c)\n idx += i + 1\n return vals[-1], idx\n def calculate(self, s: str) -> int:\n val, idx = self.calc(s, 0)\n return val","runtime":"241"},{"code":"from collections import deque\n\nclass Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(\" \", \"\")\n open_brackets = deque([0])\n i = 1\n while i < len(s):\n if s[i] == \")\":\n j = open_brackets.pop()\n s = (s[:j] + str(evaluate(s[j+1:i])) + s[i+1:]).replace(\"--\", \"+\").lstrip(\"+\")\n i = j + 1\n continue\n\n if s[i] == \"(\":\n open_brackets.append(i)\n i += 1\n return evaluate(s)\n\ndef evaluate(s: str) -> int:\n nums = deque()\n n = \"\"\n for d in s:\n if d == \"+\":\n nums.append(int(n))\n n = \"\"\n elif n and d == \"-\":\n nums.append(int(n))\n n = d\n else:\n n += d\n if n:\n nums.append(int(n))\n return sum(nums)\n\n\n","runtime":"249"},{"code":"import re\ndef calc(s_list):\n idx=0\n result = 0\n c = 1\n size = len(s_list)\n while idx < size:\n i = s_list[idx]\n if i not in \"+-()\":\n num = int(i)\n result += c*num\n elif i == \"+\":\n c = 1\n elif i == \"-\":\n c = -1\n elif i == \"(\":\n num, _idx = calc(s_list[idx+1:])\n idx += _idx + 1\n result += c*num\n elif i == \")\":\n return result, idx\n idx += 1\n return result, idx\nclass Solution:\n def calculate(self, s: str) -> int:\n _s = re.compile(\"\\({1}|\\d+|\\){1}|\\+{1}|\\-{1}\").findall(s)\n result, idx = calc(_s)\n return result","runtime":"249"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n stack = []\n\n for c in s:\n if c == ')':\n exp = []\n while stack[-1] != '(':\n exp.append(stack.pop())\n stack.pop()\n exp.reverse()\n exp_res = self.evalExp(exp)\n stack.append(exp_res)\n elif c != ' ':\n addition = ''\n if stack and c.isnumeric() and self.isnumber(stack[-1]):\n addition = stack.pop()\n stack.append(addition + c)\n return int(self.evalExp(stack))\n\n def evalExp(self, exp):\n stack = []\n print(exp)\n for c in exp:\n if stack and self.isnumber(c):\n operation = stack.pop()\n operand = 0\n if stack:\n operand = int(stack.pop())\n if operation == '+':\n stack.append(operand + int(c))\n else:\n stack.append(operand - int(c))\n else:\n stack.append(c)\n return str(stack[0])\n\n def isnumber(self, s):\n try:\n int(s)\n return True\n except:\n return False\n\n ","runtime":"258"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n\n \"\"\"\nsuppose i see a minus. look at preceding\n + or -: - is part of the number\n nothing: is part of the number\n (: then it's part of number\n\n number: then it's operator\n ): then it's operator \n\n \"\"\"\n\n # Produce tokens\n s_without_spaces = [c for c in s if c != ' ']\n tokens = []\n numbers = []\n prev = None\n for c in s_without_spaces:\n if c in ('+','(',')', '-'):\n if len(numbers) > 0:\n tokens.append(int(''.join(numbers)))\n numbers = []\n tokens.append(c)\n else: # assume else means number\n numbers.append(c)\n prev = c\n if len(numbers) > 0:\n tokens.append(int(''.join(numbers)))\n print(tokens)\n\n # pass on stack\n # validation is out of scope: assume valid\n stack = []\n for token in tokens:\n stack.append(token)\n while len(stack) >= 2:\n # TODO: cleanup e.g. not sure if f[:-3] takes 3 time, better check int\n if len(stack) >= 3 and type(stack[-3]) == int and stack[-2] in ('+', '-') and type(stack[-1]) == int:\n if stack[-2] == '+':\n val = stack[-3] + stack[-1]\n else:\n val = stack[-3] - stack[-1]\n stack = stack[:-3]\n stack.append(val)\n elif stack[-2] == '-' and type(stack[-1]) == int:\n val = -1 * stack[-1]\n stack = stack[:-2]\n stack.append(val)\n elif len(stack) >= 3 and stack[-3] == '(' and type(stack[-2]) == int and stack[-1] == ')':\n val = stack[-2]\n stack = stack[:-3]\n stack.append(val)\n else:\n break\n return stack[0]\n\n\n\"\"\"\n\nidea: keep on adding to stack\n\n<num> +/- <num> can be collapsed\n( <num> ) can be collapsed\n- <num> will become num\n\n\n(1+(4+5+2)-3)+(6+8)\n\n\n1-(-2)\n\n\n\n\n123 + 123\n123+123\n\ninput: string is representing valid expression\noutput: result of evaluation\n\nquestion: what is supported?\n s consists of digits, '+', '-', '(', ')', and ' '.\n + not unary; - could be unary\n\ncontext free grammar parsing might be too difficult\n\nwe still need parentheses e.g. 5-(1+2+3)\n\nstep 1: split so list of operators and items e.g. 1 + 1 = [1,+,1]\nstep 2: paren matching\n (0, 12)\n\n0123456789012345678 \n(1+(4+5+2)-3)+(6+8)\n\nideas:\n context free grammar: too hard\n recursively handle like that: kinda tricky with matching parentheses\n stack might be good\n\n\nhandle(\"(1+(4+5+2)-3)+(6+8)\")\n handle(\"1+(4+5+2)-3\")\n 1\n +\n handle(\"4+5+2\")\n 11\n -\n 3\n +\n handle(\"6+8\")\n 14\n\n(1+(4+5+2)-3)+(6+8)\n\n11\n+\n1\n(\n\n\n\"\"\"","runtime":"258"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n res , sign , n = 0 , 1 , len(s)\n st = []\n i = 0\n while i < n: \n print(\"i\", i)\n if s[i].isdigit():\n nums = 0\n while i < n and s[i].isdigit():\n nums = nums*10 + int(s[i])\n i += 1\n \n res += sign * nums\n i -= 1\n sign = 1\n print(\"res\", res, \"i\" , i)\n elif s[i] in '-+':\n sign = -1 if s[i] == '-' else 1\n elif s[i] == '(':\n st.append(res)\n st.append(sign)\n res , sign = 0 , 1\n elif s[i] == ')':\n res *= st.pop()\n res += st.pop()\n \n i += 1\n print(res)\n \n\n return res\n\n\n \n","runtime":"266"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n curr = res = 0\n sign = 1\n stack = []\n for char in s:\n print(char, 'char')\n if char.isdigit():\n curr = curr * 10 + int(char)\n elif char == \"+\" or char == \"-\":\n print('plusminus')\n print('curr', curr)\n print(sign, 'sign')\n print(res, 'res')\n res += curr * sign\n sign = 1 if char == \"+\" else -1\n curr = 0\n elif char == \"(\":\n stack.append(res)\n stack.append(sign)\n res = 0\n sign = 1\n elif char == \")\":\n res += curr * sign\n res *= stack.pop()\n res += stack.pop()\n curr = 0\n res += curr * sign\n return res \n ","runtime":"266"},{"code":"from typing import Optional\n\n\nclass Number:\n def __init__(self, value):\n self.value = value\n\n def __repr__(self) -> str:\n return f\"N[{self.value}]\"\n\nclass Operator:\n def __init__(self, operator):\n self.operator = operator\n\n def __repr__(self) -> str:\n return f\"O[{self.operator}]\"\n\nclass Parenthesis:\n def __init__(self, parenthesis):\n self.parenthesis = parenthesis\n\n def __repr__(self) -> str:\n return f\"P[{self.parenthesis}]\"\n\n\nclass Node:\n def __init__(self, operator: Optional[Operator] = None):\n self.operator = operator\n self.operands = []\n\n def calculate(self):\n if self.operator is None:\n a = self.operands[0]\n return a.calculate() if isinstance(a, Node) else a\n if self.operator.operator == '+':\n a = self.operands[0]\n b = self.operands[1]\n aval = a.calculate() if isinstance(a, Node) else a\n bval = b.calculate() if isinstance(b, Node) else b\n return Number(aval.value + bval.value)\n if self.operator.operator == '-':\n a = self.operands[0]\n aval = a.calculate() if isinstance(a, Node) else a\n if len(self.operands) == 1:\n return Number(-aval.value)\n b = self.operands[1]\n bval = b.calculate() if isinstance(b, Node) else b\n return Number(aval.value - bval.value)\n return None\n\n def __repr__(self):\n return f\"Node[{self.operator} {self.operands}]\"\n\n\ndef buildAST(tokens, pos, left_operand=None):\n node = Node()\n if left_operand:\n node.operands.append(left_operand)\n if pos >= len(tokens):\n return node, pos\n token = tokens[pos]\n pos += 1\n if isinstance(token, Parenthesis) and token.parenthesis == ')':\n return left_operand, pos\n if isinstance(token, Parenthesis) and token.parenthesis == '(':\n operand, pos = buildAST(tokens, pos)\n node.operands.append(operand)\n elif isinstance(token, Number):\n node.operands.append(token)\n elif isinstance(token, Operator):\n node.operator = token\n\n if pos >= len(tokens):\n return node, pos\n\n if node.operator is None and isinstance(tokens[pos], Operator):\n node.operator = tokens[pos]\n pos += 1\n\n token = tokens[pos]\n pos += 1\n\n if isinstance(token, Parenthesis) and token.parenthesis == ')':\n return node, pos\n if isinstance(token, Parenthesis) and token.parenthesis == '(':\n operand, pos = buildAST(tokens, pos)\n node.operands.append(operand)\n elif isinstance(token, Number):\n node.operands.append(token)\n\n if pos < len(tokens):\n return buildAST(tokens, pos, node)\n\n return node, pos\n\n\ndef parse_tokens(expr: str):\n number = None\n tokens = []\n\n for c in expr:\n if c == ' ':\n continue\n if ord(c) >= ord('0') and ord(c) <= ord('9'):\n number = number * 10 + int(c) if number is not None else int(c)\n continue\n if number is not None:\n tokens.append(Number(number))\n number = None\n if c in ('(', ')'):\n tokens.append(Parenthesis(c))\n continue\n if c in ('+', '-'):\n tokens.append(Operator(c))\n continue\n if number is not None:\n tokens.append(Number(number))\n\n return tokens\n\n\nclass Solution:\n def calculate(self, s: str) -> int:\n tokens = parse_tokens(s)\n node, _ = buildAST(tokens, 0)\n return node.calculate().value\n ","runtime":"275"},{"code":"import ast\nimport re\nimport sys\nsys.setrecursionlimit(100000)\n\nclass ExprNode:\n def __init__(self, child1, child2):\n self.children = [child1, child2]\n def __str__(self):\n return(\"Expression\")\n\nclass TermNode:\n def __init__(self, op, child1, child2):\n self.children = [child1, child2]\n self.op = op\n def __str__(self):\n if self.op == \"+\":\n return(\"Term PLUS\")\n else:\n return(\"Term MINUS\")\n\nclass BaseNode:\n def __init__(self, child, val=None):\n self.children = [child]\n self.val = val\n def __str__(self):\n if self.val == None:\n return(\"Parenthesis\")\n else:\n return(\"Number \" + str(self.val))\n\nclass Parser:\n def __init__(self, tokens):\n self.tokens = tokens\n self.cur = 0\n def expr(self):\n curtoken = self.tokens[self.cur]\n if curtoken.isdigit():\n self.cur += 1\n node = self.term()\n if not node:\n return BaseNode(None, int(curtoken))\n else:\n return ExprNode(BaseNode(None, int(curtoken)), node)\n else:\n # left parenthesis case\n b_node = self.base()\n t_node = self.term()\n return ExprNode(b_node, t_node)\n def term(self):\n if self.cur >= len(self.tokens) - 1:\n return None\n curtoken = self.tokens[self.cur]\n if curtoken in [\"+\", \"-\"]:\n self.cur += 1\n nexttoken = self.tokens[self.cur]\n if nexttoken.isdigit():\n self.cur += 1\n node = self.term()\n return TermNode(curtoken, BaseNode(None, int(nexttoken)), node)\n else:\n b_node = self.base()\n t_node = self.term()\n return TermNode(curtoken, b_node, t_node)\n else:\n return None\n\n # parses the parenthesis case only\n def base(self):\n if self.tokens[self.cur] == \"(\":\n self.cur += 1\n node = self.expr()\n if self.tokens[self.cur] != \")\":\n print(\"Syntax Error: No matching right parenthesis\")\n return None\n self.cur += 1\n return BaseNode(node)\n\nclass Solution:\n def calculate(self, s: str) -> int:\n def lexer(s):\n expression = re.sub(r'\\s+', \"\", s)\n expression = re.findall(r'\\d+|[\\(\\)+-]', expression)\n formatted = []\n for e in expression:\n if e == \"-\" and (not formatted or formatted[-1] == \"(\"):\n formatted.append(\"0\")\n formatted.append(e)\n return formatted\n def print_nodes(n, lvl=0):\n if not n:\n return\n print(\" \" * lvl, end=\"\")\n print(\"|\", end=\"\")\n print(\"--\" * lvl, end=\"\")\n print(n)\n \n for c in n.children:\n print_nodes(c, lvl+1)\n \n rpn = []\n def emit_rpn(n):\n if not n:\n return\n if type(n) == TermNode:\n if n.children[0].val != None:\n rpn.append(n.children[0].val)\n rpn.append(n.op)\n else:\n emit_rpn(n.children[0])\n rpn.append(n.op)\n emit_rpn(n.children[1])\n\n\n elif type(n) == BaseNode:\n if n.val != None:\n rpn.append(n.val)\n else:\n emit_rpn(n.children[0])\n\n else:\n emit_rpn(n.children[0])\n emit_rpn(n.children[1])\n \n def evaluate_rpn(rpns):\n stack = []\n for token in rpns :\n if token == '+' :\n a , b = stack.pop() , stack.pop()\n stack.append( a + b ) \n elif token == '-':\n a , b = stack.pop() , stack.pop()\n stack.append( b - a ) \n else:\n stack.append(token) \n return stack.pop() \n \n ps = Parser(lexer(s))\n res = ps.expr()\n emit_rpn(res)\n return evaluate_rpn(rpn)","runtime":"275"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n lexer = Lexer(s)\n parser = Parser(lexer)\n parse_tree = parser.parse(None)\n print(parse_tree)\n interpreter = Interpreter(parse_tree)\n return interpreter.eval()\n\nclass Lexer:\n def __init__(self, expr: str):\n self.expr = expr\n self.i = 0\n def parse_num(self) -> str:\n num = \"\"\n while self.i < len(self.expr) and self.expr[self.i].isdigit() :\n num += self.expr[self.i]\n self.i += 1\n return num\n def next_token(self) -> str:\n if self.i == len(self.expr):\n return \"\"\n\n ch = self.expr[self.i]\n if ch == \" \":\n self.i += 1 ; return self.next_token()\n elif ch.isdigit():\n num = self.parse_num()\n return num\n elif ch in ['+', '-', '(', ')']:\n self.i += 1 ; return ch\n\nclass num_node:\n def __init__(self, num):\n self.num = num\n def __repr__(self):\n return f'{self.num}'\nclass add_node:\n def __init__(self, left, right):\n self.left = left\n self.right = right\n def __repr__(self):\n return f'{self.left}+{self.right}'\nclass subtract_node:\n def __init__(self, left, right):\n self.left = left\n self.right = right\n def __repr__(self):\n return f'{self.left}-{self.right}'\nclass negate_node:\n def __init__(self, parse_tree):\n self.parse_tree = parse_tree\n def __repr__(self):\n return f' -{self.parse_tree}'\nclass group_node:\n def __init__(self, parse_tree):\n self.parse_tree = parse_tree\n def __repr__(self):\n return f'({self.parse_tree})'\nparse_node = num_node | add_node | subtract_node | negate_node | group_node\nclass Parser:\n def __init__(self, lexer):\n self.lexer = lexer\n def next_node(self, last_node) -> parse_node:\n token = self.lexer.next_token()\n if token == \"\":\n return None\n elif token == \")\":\n return None\n elif token.isnumeric():\n return num_node(int(token))\n elif token == \"+\":\n return add_node(last_node, self.next_node(None))\n elif token == \"-\":\n if last_node is None:\n return negate_node(self.next_node(None))\n else:\n return subtract_node(last_node, self.next_node(None))\n elif token == \"(\":\n return group_node(self.parse(None))\n\n def parse(self, parse_tree: parse_node) -> parse_node:\n node = self.next_node(parse_tree)\n if node is None:\n return parse_tree\n else:\n return self.parse(node)\n \nclass Interpreter:\n def __init__(self, parse_tree):\n self.parse_tree = parse_tree\n def eval(self) -> int:\n return self.eval_pt(self.parse_tree)\n def eval_pt(self, parse_tree: parse_node) -> int:\n if isinstance(parse_tree, num_node):\n return parse_tree.num\n elif isinstance(parse_tree, add_node):\n return self.eval_pt(parse_tree.left) + self.eval_pt(parse_tree.right)\n elif isinstance(parse_tree, subtract_node):\n return self.eval_pt(parse_tree.left) - self.eval_pt(parse_tree.right)\n elif isinstance(parse_tree, negate_node):\n return -1 * self.eval_pt(parse_tree.parse_tree)\n elif isinstance(parse_tree, group_node):\n return self.eval_pt(parse_tree.parse_tree)","runtime":"283"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n w=[]\n def type1(i):\n if i>='0' and i<='9':\n return True\n return False\n s=list(s)\n i=0\n while i<len(s)-1:\n x=''\n while i<len(s)-1 and type1(s[i]) and type1(s[i+1]):\n x=x+s[i]\n s.pop(i)\n s[i]=x+s[i]\n i=i+1\n j=0\n while j<len(s):\n if w==[] and s[j]!=' ':\n w.append(s[j])\n elif s[j]==' ':\n j=j+1\n continue\n elif s[j]==')':\n x=[]\n while w[-1]!='(':\n x.append(w.pop())\n w.pop() \n x.reverse()\n if x[0]=='+' or x[0]=='-':\n if x[0]=='-':\n x[1]=str(-int(x[1]))\n x.pop(0)\n while len(x)>2:\n a=x.pop(0)\n b=x.pop(0)\n c=x.pop(0)\n if b=='+':\n x.insert(0,str(int(c)+int(a)))\n elif b=='-':\n x.insert(0,str(-int(c)+int(a)))\n w.append(x[0]) \n else:\n w.append(s[j])\n j=j+1\n if w[0]=='+' or w[0]=='-':\n if w[0]=='-':\n w[1]=str(-int(w[1]))\n w.pop(0)\n while len(w)!=1:\n a=w.pop(0)\n b=w.pop(0)\n c=w.pop(0)\n if b=='+':\n w.insert(0,str(int(c)+int(a)))\n elif b=='-':\n w.insert(0,str(-int(c)+int(a)))\n return int(w[0])\n\n","runtime":"283"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n w=[]\n def type1(i):\n if i>='-999999999' and i<='999999999':\n return True\n return False\n s=list(s)\n i=0\n while i<len(s)-1:\n if type1(s[i]) and type1(s[i+1]):\n s[i]=s[i]+s[i+1]\n s.pop(i+1)\n continue\n i=i+1\n j=0\n while j<len(s):\n if w==[] and s[j]!=' ':\n w.append(s[j])\n elif s[j]==' ':\n j=j+1\n continue\n elif s[j]==')':\n x=[]\n while w[-1]!='(':\n x.append(w.pop())\n w.pop() \n x.reverse()\n if x[0]=='+' or x[0]=='-':\n if x[0]=='-':\n x[1]=str(-int(x[1]))\n x.pop(0)\n while len(x)>2:\n a=x.pop(0)\n b=x.pop(0)\n c=x.pop(0)\n if b=='+':\n x.insert(0,str(int(c)+int(a)))\n elif b=='-':\n x.insert(0,str(-int(c)+int(a)))\n w.append(x[0]) \n else:\n w.append(s[j])\n j=j+1\n if w[0]=='+' or w[0]=='-':\n if w[0]=='-':\n w[1]=str(-int(w[1]))\n w.pop(0)\n while len(w)!=1:\n a=w.pop(0)\n b=w.pop(0)\n c=w.pop(0)\n if b=='+':\n w.insert(0,str(int(c)+int(a)))\n elif b=='-':\n w.insert(0,str(-int(c)+int(a)))\n return int(w[0])\n\n","runtime":"292"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n return self._calculate(iter(s))\n\n def _calculate(self, s_it) -> int:\n print(\"_calculate\")\n\n ans = 0\n curr_num = 0\n last_op = \"+\"\n\n def eval(x, y, op):\n if op == \"+\":\n return x + y\n\n if op == \"-\":\n return x - y\n\n while True:\n try:\n c = next(s_it)\n print(c, \"ans\", ans, \"curr_num\", curr_num, \"last_op\", last_op)\n\n if c == \" \":\n continue\n\n if c.isdigit():\n curr_num = 10 * curr_num + int(c)\n continue\n\n if last_op and curr_num:\n ans = eval(ans, curr_num, last_op)\n\n last_op = \"\"\n curr_num = 0\n\n if c == \"(\":\n curr_num = self._calculate(s_it)\n continue\n\n if c == \")\":\n return ans\n\n last_op = c\n\n except StopIteration:\n return eval(ans, curr_num, last_op)\n\n\n # def calculate(self, s: str) -> int:\n # stack = [0]\n # op = [\"+\", \"-\"]\n\n # lastNum = \"\"\n # lastOp = \"+\"\n\n # for c in s:\n # # print(c, \"S\", stack, \"lastNum\", lastNum, \"lastOp\", lastOp)\n\n # if c == \" \":\n # continue\n\n # if c.isdigit():\n # lastNum += c\n # continue\n\n # if lastOp and lastNum:\n # if lastOp == \"+\":\n # stack[-1] = stack[-1] + int(lastNum)\n # else:\n # stack[-1] = stack[-1] - int(lastNum)\n\n # lastNum = \"\"\n # lastOp = \"\"\n\n # # else:\n # # stack.\n\n # if c == \"(\":\n # stack.append(lastOp)\n # stack.append(0)\n # lastOp = \"+\"\n # continue\n\n # if c == \")\":\n # if len(stack) > 0:\n # num_r = stack.pop()\n # op = stack.pop()\n\n # if op == \"+\":\n # stack[-1] = stack[-1] + int(num_r)\n # else:\n # stack[-1] = stack[-1] - int(num_r)\n\n # continue\n\n # # if c in op:\n # lastOp = c\n\n # if lastOp and lastNum:\n # if lastOp == \"+\":\n # stack[-1] = stack[-1] + int(lastNum)\n # else:\n # stack[-1] = stack[-1] - int(lastNum)\n\n # return stack[0]\n","runtime":"292"},{"code":"class Solution:\n def valid_num_op(self, i, s): \n while i < len(s):\n if s[i] == ' ': i+=1\n else: break \n if i>len(s)-1: return i, None\n num_op = s[i]\n i+=1\n while i < len(s): \n if num_op[-1].isnumeric() and s[i].isnumeric():\n num_op += s[i]\n else:\n break \n i+=1\n if num_op.isnumeric(): num_op = int(num_op)\n return i, num_op \n def simple_solve(self, i, s):\n # i after '(' \n stack = [0]\n first_neg = True\n pre_op = '+'\n while i < len(s): \n i, nums_op = self.valid_num_op(i,s)\n if first_neg and nums_op == '-': \n pre_op = '-' \n first_neg = False\n continue \n first_neg = False\n if nums_op in ['+','-','*','/',')']:# solve before this op\n if pre_op == '+':\n stack[-1] = stack[-1]+num\n elif pre_op == '-':\n stack[-1] = stack[-1]-num\n elif pre_op == '*':\n stack[-1] = stack[-1]*num\n elif pre_op == '/':\n stack[-1] = stack[-1]/num\n pre_op = nums_op\n else: \n num = nums_op\n if nums_op == '(':\n i, num = self.simple_solve(i,s)\n print(i, nums_op, stack)\n if nums_op == ')':\n break\n return i, sum(stack)\n\n\n def calculate(self, s: str) -> int: \n i, out = self.simple_solve(0,s+')')\n return out\n","runtime":"300"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n out = 0\n s = '(' + s + ')'\n \n def parHelper(s:str) -> (int,int):\n helpStack = []\n helperOut = 0\n i = 1 \n \n negFlag = 1 #if '-' is found and stack is empty, set to -1\n while s[i] != ')' and i < len(s):\n \n if s[i] in '0123456789':\n if helpStack and type(helpStack[-1]) == int:\n helpStack[-1] = helpStack[-1]*10+negFlag*int(s[i])\n else:\n helpStack.append(negFlag*int(s[i]))\n if s[i] == '+':\n if helpStack:\n helperOut += helpStack.pop()\n negFlag = 1\n if s[i] == '-':\n if helpStack:\n helperOut += helpStack.pop()\n negFlag = -1\n \n if s[i] == '(':\n nextVal, shift = parHelper(s[i:])\n if helpStack:\n helperOut += helpStack.pop()\n helperOut += negFlag*nextVal\n negFlag = 1\n i += shift\n print(helperOut,i,negFlag,helpStack)\n i += 1\n\n while helpStack:\n helperOut += helpStack.pop()\n print(helperOut, i, s[i],\"return\")\n return (helperOut,i)\n \n output, idx = parHelper(s)\n return output","runtime":"300"},{"code":"class Solution:\n operators = {\"+\", \"-\"}\n operator_to_func = {\n \"+\": lambda a, b: a + b,\n \"-\": lambda a, b: a - b,\n }\n\n def read_number(self, s, st, end) -> int:\n pos = st\n while pos < end and \\\n not (s[pos] in self.operators) and \\\n not (s[pos] in \"() \"):\n pos += 1\n return int(s[st: pos]), pos\n \n def process_expression(self, s, st, end, depth):\n # st = 0; end = 11; s = \"1+1\"\n i = st # 0\n result = [] # []\n \n print('depth:', depth, 'st:', st)\n\n while (i < end):\n if (i < end) and (s[i] == ')'):\n print('found )', result[-1], i + 1)\n return result[-1], i + 1\n\n elif (i < end) and (s[i] == '('):\n val, i = self.process_expression(s, i + 1, end, depth + 1) # 7, 3\n result.append(val)\n elif (i < end) and (s[i] not in '+-'):\n val, i = self.read_number(s, i, end)\n result.append(val)\n\n print('depth:', depth, 'i:', i)\n\n if (i < end) and (s[i] in '+-'):\n op = s[i] # + \n lhs = 0 if len(result) == 0 else result.pop()\n if i + 1 < end and s[i + 1] == '(':\n rhs, i = self.process_expression(s, i + 2, end, depth + 1) \n else:\n rhs, i = self.read_number(s, i + 1, end)\n calc_func = self.operator_to_func[op]\n print('operation:', lhs, op, rhs, flush=True)\n val = calc_func(lhs, rhs)\n result.append(val)\n \n #print(s, i, result)\n\n res = result[-1] if len(result) > 0 else 0\n return res, end\n\n\n\n def calculate(self, s: str) -> int:\n operator_to_func = {\n \"+\": lambda a, b: a + b,\n \"-\": lambda a, b: a - b,\n }\n\n s = s.replace(\" \", \"\")\n n = len(s)\n val, _ = self.process_expression(s, 0, n, 0)\n return val\n\n \n \n \n\n ","runtime":"309"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n w=[]\n def type1(i):\n if i>='0' and i<='9':\n return True\n return False\n s=list(s)\n i=0\n while i<len(s)-1:\n x=''\n while i<len(s)-1 and type1(s[i]) and type1(s[i+1]):\n x=x+s[i]\n s.pop(i)\n s[i]=x+s[i]\n i=i+1\n j=0\n while j<len(s):\n if w==[] and s[j]!=' ':\n w.append(s[j])\n elif s[j]==' ':\n j=j+1\n continue\n elif s[j]==')':\n x=[]\n while w[-1]!='(':\n x.append(w.pop())\n w.pop() \n x.reverse()\n if x[0]=='+' or x[0]=='-':\n if x[0]=='-':\n x[1]=str(-int(x[1]))\n x.pop(0)\n while len(x)>2:\n a=x.pop(0)\n b=x.pop(0)\n c=x.pop(0)\n if b=='+':\n x.insert(0,str(int(c)+int(a)))\n elif b=='-':\n x.insert(0,str(-int(c)+int(a)))\n w.append(x[0]) \n else:\n w.append(s[j])\n j=j+1\n if w[0]=='+' or w[0]=='-':\n if w[0]=='-':\n w[1]=str(-int(w[1]))\n w.pop(0)\n while len(w)!=1:\n a=w.pop(0)\n b=w.pop(0)\n c=w.pop(0)\n if b=='+':\n w.insert(0,str(int(c)+int(a)))\n elif b=='-':\n w.insert(0,str(-int(c)+int(a)))\n return int(w[0])\n\n","runtime":"309"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n \n s = s.replace(\" \", \"\")\n\n number = 0 # current number\n result = 0 # current reslut of the expression evaluation\n sign = 1 # sign of the current number(or evaluated expression in brackets), goes before current value, not after\n\n stack = deque()\n\n for char in s:\n if char == \"+\" or char == \"-\":\n # update sign and add number with previous sign to the result\n # because we finished parsing a number(or if it's a sign in front of the first num)\n result += sign * number\n\n # assign a new sign before parsing the next value\n if char == \"+\":\n sign = 1\n else:\n sign = -1\n\n number = 0 # we added parsed number to the result already, so we reset number\n\n print(\"sign\", sign, number, result)\n \n elif char.isdigit():\n # update our number by multiplying already parsed part of the number by 10 \n # and adding current digit\n digit = int(char)\n number *= 10\n number += digit\n\n print(\"digit\", char, number, result)\n\n elif char == \"(\":\n # we should save our current result to the stack\n # and then add current sign\n # then proceed with calculating result in the brackets\n stack.append(result) # current result\n stack.append(sign) # sign of the expression in the upcooming brackets\n\n result = 0\n sign = 1\n\n print(\"open bracket\", number, result, stack)\n elif char == \")\":\n # we reached the end of current expression in brackets\n # we should take sign of the current result from the stack\n # then take previous number(result) from the stack\n # add them and proceed further\n\n # we finished parsing number\n # so we need to add it to the current result\n result += sign*number\n number = 0\n\n # we calculated current result\n # now we need to add a sign to it and\n # add it to the previous result\n resultSign = stack.pop()\n previousResult = stack.pop()\n\n result = previousResult + resultSign*result\n\n print(\"close bracket\", number, result, stack)\n \n if number != 0:\n result += sign * number\n \n return result","runtime":"318"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n def cal_expression(match):\n res = 0\n symbol = 1\n i = 0\n while i < len(match):\n if match[i] == '+':\n if i != 0 and not match[i-1].isdigit():\n if match[i-1] == '+':\n symbol = 1\n else:\n symbol = -1\n else:\n symbol = 1\n elif match[i] == '-':\n if i != 0 and not match[i-1].isdigit():\n if match[i-1] == '+':\n symbol = -1\n else:\n symbol = 1\n else:\n symbol = -1\n else:\n number = int(match[i])\n res += symbol * number\n i += 1\n return res\n\n def handler(match):\n expression = match.group(0)\n token = re.findall('\\d+|[+-]', expression)\n return str(cal_expression(token))\n\n s = s.replace(' ', '')\n while '(' in s:\n s = re.sub('\\(([^()]+)\\)', handler, s)\n token = re.findall('\\d+|[+-]', s)\n return cal_expression(token)","runtime":"326"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n charstack = []\n for c in s:\n if c in list(\"0123456789\"):\n val = int(c)\n if len(charstack) == 0 or not isinstance(charstack[-1], int):\n charstack.append(val)\n else:\n charstack[-1] *= 10\n charstack[-1] += val\n elif c == \")\":\n i = len(charstack) - 1\n while charstack[i] != \"(\":\n i -= 1\n newval = self.calculate(charstack[i + 1:])\n charstack = list(charstack[:i])\n charstack.append(newval)\n elif c == \" \":\n continue\n else:\n charstack.append(c)\n \n i = 0\n while i < len(charstack):\n negative = False\n while charstack[i] == \"-\":\n negative = not negative\n del charstack[i]\n if negative:\n charstack[i] *= -1\n i += 1\n\n return sum([c for c in charstack if isinstance(c, int)])\n","runtime":"326"},{"code":"class Solution:\n def next_num(self,s,p):\n bp = p\n if s[bp] == \"-\":\n m = -1\n bp += 1\n else:\n m = 1\n plup = s.find(\"+\",bp)\n minp = s.find(\"-\",bp)\n if plup == -1 and minp == -1:\n endp = len(s)+1\n elif plup == -1 or (minp != -1 and minp < plup):\n endp = minp\n elif minp == -1 or (plup != -1 and minp > plup):\n endp = plup\n else:\n endp = min(minp,plup)\n return m * int(s[bp:endp]), endp-p\n\n def my_eval(self,s):\n total = 0\n if s == \"\":\n return \"0\" \n p = 0\n nums = []\n ops = []\n while True:\n #get the next digit\n n,d = self.next_num(s,p)\n p += d\n nums.append(n)\n if p+1 < len(s):\n #get the next operator\n ops.append(s[p])\n p+=1\n else:\n break\n # do calc\n tot = nums[0]\n for i in range(len(ops)):\n if ops[i] == \"+\":\n tot += nums[i+1]\n else:\n tot -= nums[i+1]\n return str(tot)\n \n\n\n def calculate(self, s: str) -> int:\n s = s.replace(\" \",\"\")\n while True:\n openb = s.find(\"(\")\n if openb != -1:\n # there are brackets; find the innermost\n while True:\n old_openb = openb\n openb = s.find(\"(\",old_openb+1)\n closeb = s.find(\")\",old_openb+1)\n if openb > closeb or openb == -1:\n break\n e = self.my_eval(s[old_openb+1:closeb])\n #check whether this bracket is negated:\n if old_openb > 0:\n if s[old_openb-1] == \"-\":\n if old_openb == 1 or (old_openb>1 and s[old_openb-2]==\"(\"):\n e = str(-int(e))\n old_openb -= 1\n s = s[:old_openb] + e + s[closeb+1:]\n else:\n return int(self.my_eval(s))\n\n","runtime":"335"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n def tokenize(s: str):\n tokens = []\n num = \"\"\n for char in s:\n if char.isdecimal():\n num += char\n else:\n if num:\n tokens.append(int(num))\n num = \"\"\n match char:\n case '+' | '-' | '(' | ')':\n tokens.append(char)\n if num:\n tokens.append(int(num))\n return tokens\n def eval(tokens):\n def eval_parens(tokens):\n i = 0\n total = 0\n add = lambda x, y: x + y\n sub = lambda x, y: x - y\n op = add\n while i < len(tokens):\n token = tokens[i]\n match token:\n case '+':\n op = add\n # op = lambda x, y: x + y\n case '-':\n op = sub\n # op = lambda x, y: x - y\n case '(':\n result, j = eval_parens(tokens[i + 1:])\n i += j + 1\n total = op(total, result)\n case ')':\n # print('i:', i, 'total:', total, 'tokens:', tokens[i:])\n return total, i\n case _: # int\n total = op(total, token)\n i += 1\n # print('i:', i, 'total:', total, 'tokens:', tokens[i:])\n return total, i\n return eval_parens(tokens)[0]\n return eval(tokenize(s))\n # def eval(total, tokens):\n # if len(tokens) <= 0:\n # return (0, [])\n # car = tokens[0]\n # cdr = tokens[1:]\n # while cdr:\n # match car:\n # case '+':\n # result, cdr = eval(car, cdr)\n # total += result\n # case '-':\n # result, cdr = eval(car, cdr)\n # total -= result\n # case '(':\n # result, cdr = eval(0, cdr)\n # case ')':\n # result, cdr = eval(total, cdr)\n # case _: # int\n # return car, cdr\n # return eval(0, tokenize(s))[0]\n # def eval(result, tokens):\n # i = 0\n # while i < len(tokens):\n # token = tokens[i]\n # match token:\n # case '+':\n # ops.append(token)\n # case '-':\n # ops.append(token)\n # case '(':\n # tokens += eval(0, tokens[i + 1:])\n # case ')':\n # return (result, tokens[i + 1:])\n # # ops.pop() # '('\n # # finish evaluating space between parentheses (collapse)\n # case _: # int\n\n # i += 1\n\n # def parse(tokens):\n # ops = []\n # outs = []\n # i = 0\n # while i < len(tokens):\n # token = tokens[i]\n # match token:\n # case '+':\n # ops.append(token)\n # case '-':\n # ops.append(token)\n # case '(':\n # ops.append(token)\n # case ')':\n # ops.pop() # '('\n # # finish evaluating space between parentheses (collapse)\n # case _: # int\n\n # i += 1\n # class ASTNode:\n # def eval(self):\n # return\n # class Sum:\n # def __init__(self, left, right):\n # self.op = lambda x, y: x + y\n # self.left = left\n # self.right = right\n # def eval(self):\n # return self.op(self.left, self.right)\n # class Diff:\n # def __init__(self, left, right):\n # self.op = lambda x, y: x - y\n # self.left = left\n # self.right = right\n # def eval(self):\n # return self.op(self.left, self.right)\n # class Unary:\n # def __init__(self, op, child):\n # self.op = lambda x: -x\n # self.child = child\n # def eval(self):\n # return self.op(self.child)\n # class Paren:\n # def __init__(self, child)\n # self.op = lambda x: x\n # self.child = child\n # def eval(self):\n # return self.op(self.child)\n\n # def parse(a):\n # # ops = []\n # # outs = []\n # tree = Paren(None)\n # i = 0\n # while i < len(s):\n # token = a[i]\n # match token:\n # case '+':\n # ops.append(token)\n # case '-':\n # ops.append(token)\n # case '(':\n # ops.append(token)\n # case ')':\n # ops.pop(token) # '('\n # case _: # int\n # if len(ops) > 0:\n # op = ops.pop()\n # match op:\n # case '+':\n # outs.append(outs.pop() + token)\n # case '-':\n # if len(ops) == 0 or ops[-1] == '(':\n # outs.append(-token)\n # else:\n # outs.append(outs.pop() - token)\n # case _:\n # ops.append(op)\n # out.append(token)\n # i += 1","runtime":"335"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(\" \", \"\")\n a = []\n ans = i = sub = 0\n if s[0] == \"(\":\n s = '+' + s\n while i < len(s):\n if s[i] in \"+-)\":\n ans += int(s[:i] or 0)*(1-2*int(sub))\n s = s[i:]\n i = 0\n if len(s)>1 and s[i+1] == '(':\n sub ^= s[i] == '-'\n a.append(s[i] == '-')\n s = s[i+2:]\n else:\n i += 1\n if s[0]==\")\":\n sub ^= a.pop()\n s = s[1:]\n i = 0\n else:\n i += 1\n return ans + int(s or 0)","runtime":"343"},{"code":"class Solution:\n def getNum(self,s):\n if s[0] == '(':\n return self.recursive_calc(s[1:])\n i = 0\n num = 0\n while i<len(s) and s[i] >= '0' and s[i] <= '9':\n num*=10\n num += int(s[i]) \n i+=1\n return i,num \n\n def calculate(self, s: str) -> int:\n s = s.replace(' ','')\n return self.recursive_calc(s)[1]\n \n def recursive_calc(self,s):\n i,res = self.getNum(s)\n \n num = 0\n while i<len(s) and s[i]!=')':\n j,num = self.getNum(s[i+1:])\n match s[i]:\n case '+':\n res += num\n case '-':\n res -= num\n i+=j+1\n\n return i+2,res\n \n ","runtime":"352"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n def tokenize(s: str):\n tokens = []\n num = \"\"\n for char in s:\n if char.isdecimal():\n num += char\n else:\n if num:\n tokens.append(int(num))\n num = \"\"\n match char:\n case '+' | '-' | '(' | ')':\n tokens.append(char)\n if num:\n tokens.append(int(num))\n return tokens\n def eval(tokens):\n def eval_parens(tokens):\n i = 0\n total = 0\n add = lambda x, y: x + y\n sub = lambda x, y: x - y\n op = add\n while i < len(tokens):\n token = tokens[i]\n match token:\n case '+':\n op = add\n # op = lambda x, y: x + y\n case '-':\n op = sub\n # op = lambda x, y: x - y\n case '(':\n result, j = eval_parens(tokens[i + 1:])\n i += j + 1\n total = op(total, result)\n case ')':\n # print('i:', i, 'total:', total, 'tokens:', tokens[i:])\n return total, i\n case _: # int\n total = op(total, token)\n i += 1\n # print('i:', i, 'total:', total, 'tokens:', tokens[i:])\n return total, i\n return eval_parens(tokens)[0]\n return eval(tokenize(s))\n # def eval(total, tokens):\n # if len(tokens) <= 0:\n # return (0, [])\n # car = tokens[0]\n # cdr = tokens[1:]\n # while cdr:\n # match car:\n # case '+':\n # result, cdr = eval(car, cdr)\n # total += result\n # case '-':\n # result, cdr = eval(car, cdr)\n # total -= result\n # case '(':\n # result, cdr = eval(0, cdr)\n # case ')':\n # result, cdr = eval(total, cdr)\n # case _: # int\n # return car, cdr\n # return eval(0, tokenize(s))[0]\n # def eval(result, tokens):\n # i = 0\n # while i < len(tokens):\n # token = tokens[i]\n # match token:\n # case '+':\n # ops.append(token)\n # case '-':\n # ops.append(token)\n # case '(':\n # tokens += eval(0, tokens[i + 1:])\n # case ')':\n # return (result, tokens[i + 1:])\n # # ops.pop() # '('\n # # finish evaluating space between parentheses (collapse)\n # case _: # int\n\n # i += 1\n\n # def parse(tokens):\n # ops = []\n # outs = []\n # i = 0\n # while i < len(tokens):\n # token = tokens[i]\n # match token:\n # case '+':\n # ops.append(token)\n # case '-':\n # ops.append(token)\n # case '(':\n # ops.append(token)\n # case ')':\n # ops.pop() # '('\n # # finish evaluating space between parentheses (collapse)\n # case _: # int\n\n # i += 1\n # class ASTNode:\n # def eval(self):\n # return\n # class Sum:\n # def __init__(self, left, right):\n # self.op = lambda x, y: x + y\n # self.left = left\n # self.right = right\n # def eval(self):\n # return self.op(self.left, self.right)\n # class Diff:\n # def __init__(self, left, right):\n # self.op = lambda x, y: x - y\n # self.left = left\n # self.right = right\n # def eval(self):\n # return self.op(self.left, self.right)\n # class Unary:\n # def __init__(self, op, child):\n # self.op = lambda x: -x\n # self.child = child\n # def eval(self):\n # return self.op(self.child)\n # class Paren:\n # def __init__(self, child)\n # self.op = lambda x: x\n # self.child = child\n # def eval(self):\n # return self.op(self.child)\n\n # def parse(a):\n # # ops = []\n # # outs = []\n # tree = Paren(None)\n # i = 0\n # while i < len(s):\n # token = a[i]\n # match token:\n # case '+':\n # ops.append(token)\n # case '-':\n # ops.append(token)\n # case '(':\n # ops.append(token)\n # case ')':\n # ops.pop(token) # '('\n # case _: # int\n # if len(ops) > 0:\n # op = ops.pop()\n # match op:\n # case '+':\n # outs.append(outs.pop() + token)\n # case '-':\n # if len(ops) == 0 or ops[-1] == '(':\n # outs.append(-token)\n # else:\n # outs.append(outs.pop() - token)\n # case _:\n # ops.append(op)\n # out.append(token)\n # i += 1","runtime":"360"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(\" \", \"\")\n a = []\n ans = 0\n sub = False\n i = 0\n if s[0] == \"(\":\n s = '+' + s\n while i < len(s):\n if s[i] in \"+-)\":\n c = s[:i]\n if c and sub:\n ans -= int(c)\n elif c:\n ans += int(c)\n s = s[i:]\n i = 0\n if s[i] == '-':\n if s[i+1] == '(':\n a.append(0)\n sub = not sub\n s = s[i+2:]\n else:\n i += 1\n elif s[i] == '+':\n if s[i+1] == '(':\n a.append(1)\n s = s[i+2:]\n else:\n i += 1\n else:\n sub = sub if a.pop() else not sub\n s = s[1:]\n else:\n i += 1\n return ans + int(s or 0)","runtime":"360"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(\" \", \"\")\n a = []\n ans = 0\n sub = False\n i = 0\n if s[0] == \"(\":\n s = '+' + s\n while i < len(s):\n if s[i] in \"+-)\":\n ans += int(s[:i] or 0)*(1-2*int(sub))\n s = s[i:]\n i = 0\n if len(s)>1 and s[i+1] == '(':\n if s[i] == '-':\n a.append(0)\n sub = not sub\n s = s[i+2:]\n elif s[i] == '+':\n a.append(1)\n s = s[i+2:]\n else:\n i += 1\n if s[0]==\")\":\n sub = sub if a.pop() else not sub\n s = s[1:]\n i = 0\n else:\n i += 1\n return ans + int(s or 0)","runtime":"369"},{"code":"nums = set(map(chr, range(ord('0'), ord('9') + 1)))\ndef calc_func(c: str):\n if c == '+':\n return lambda a, b: a + b\n elif c == '-':\n return lambda a, b: a - b\n else:\n raise Exception(\"bozo\")\n\ndef get_num(s: str) -> (int, int):\n # takewhile isnum s\n i = 0\n c = ''\n while i < len(s) and s[i] in nums:\n c += s[i]\n i += 1\n return int(c), len(c)\n \nclass Solution:\n def calculate(self, s: str) -> int:\n print(nums)\n return self._calculate(''.join([c for c in s if c != ' ']))\n def _calculate(self, s: str) -> int:\n i = 0\n stack = [(0, 1)]\n while i < len(s):\n if s[i] == '-':\n if s[i+1] in nums:\n # negative number\n n, num_taken = get_num(s[i+1:])\n stack[-1] = stack[-1][0] - n, stack[-1][1]\n i += num_taken + 1\n elif s[i+1] == '(':\n stack.append((0, -1))\n i += 2\n else:\n raise Exception(\"formatting error\")\n elif s[i] in nums:\n n, num_taken = get_num(s[i:])\n stack[-1] = stack[-1][0] + n, stack[-1][1]\n i += num_taken\n elif s[i] == '(':\n stack.append((0, 1))\n i += 1\n elif s[i] == ')':\n v = stack.pop(-1)\n if len(stack) == 0:\n return v[0] * v[1]\n else:\n stack[-1] = stack[-1][0] + v[0] * v[1], stack[-1][1]\n i += 1\n else:\n i += 1\n if len(stack) > 1:\n raise Exception(\"bruh\")\n return stack[0][0] * stack[0][1]\n","runtime":"369"},{"code":"class Solution:\n def is_digit(self, char: str) -> bool:\n return char in (str(i) for i in range(10))\n\n def is_number(self, token: str) -> bool:\n try:\n int(token)\n return True\n except Exception as _:\n return False\n\n def is_operation(self, char: str) -> bool:\n return char in (\"-\", \"+\")\n\n def eval_operation(self, left: str, right: str, op: str) -> str:\n if op == \"+\":\n return str(int(left) + int(right))\n return str(int(left) - int(right))\n\n def calculate(self, s: str) -> int:\n tokens = []\n digits_buffer = []\n for char in s:\n if char == \" \":\n continue\n\n if self.is_digit(char):\n if len(tokens) and tokens[-1] == \"-\" and (len(tokens) == 1 or (tokens[-2] != \")\" and not self.is_number(tokens[-2]))):\n digits_buffer.append(tokens.pop(-1))\n digits_buffer.append(char)\n continue\n elif len(digits_buffer):\n tokens.append(int(\"\".join(digits_buffer) if len(digits_buffer) > 1 else digits_buffer[0]))\n digits_buffer = []\n\n tokens.append(char)\n\n if digits_buffer:\n tokens.append(int(\"\".join(digits_buffer) if len(digits_buffer) > 1 else digits_buffer[0]))\n\n expressions = []\n for token in tokens:\n if self.is_number(token):\n last_char_is_operation = len(expressions) and self.is_operation(expressions[-1])\n if last_char_is_operation:\n operation = expressions.pop()\n left_operand = expressions.pop()\n expressions.append(self.eval_operation(left_operand, token, operation))\n else:\n expressions.append(token)\n\n elif self.is_operation(token):\n expressions.append(token)\n else:\n if token == \"(\":\n expressions.append(token)\n else:\n expression = expressions.pop()\n expressions.pop()\n last_char_is_operation = len(expressions) and self.is_operation(expressions[-1])\n if last_char_is_operation:\n operation = expressions.pop()\n if len(expressions) and self.is_number(expressions[-1]):\n left_operand = expressions.pop()\n expressions.append(self.eval_operation(left_operand, expression, operation))\n else:\n expressions.append(str(-int(expression)))\n else:\n expressions.append(expression)\n\n return int(expressions.pop())\n","runtime":"377"},{"code":"class Expr:\n def __init__(self, value: str, left: 'Expr' = None, right: 'Expr' = None):\n self.value = value\n self.left = left\n self.right = right\n\n # def toString(self):\n # s = self.value\n # hasLeft = self.left is not None\n # hasRight = self.right is not None\n # if not (hasLeft or hasRight):\n # return s\n # s += \"(\"\n # if hasLeft:\n # s += self.left.toString()\n # if hasRight:\n # s += \" \"\n # s += self.right.toString()\n # s += \")\"\n # return s\n\nclass Solution:\n def calculate(self, s: str) -> int:\n root = Parser(s).parse()\n #print(root.toString())\n return self.evaluate(root)\n\n def evaluate(self, expr: Expr) -> int:\n if expr.value.isdigit():\n return int(expr.value)\n elif expr.value == '-':\n if expr.right is None:\n return -self.evaluate(expr.left)\n else:\n return self.evaluate(expr.left) - self.evaluate(expr.right)\n elif expr.value == '+':\n return self.evaluate(expr.left) + self.evaluate(expr.right)\n elif expr.value == '/':\n return self.evaluate(expr.left) / self.evaluate(expr.right)\n elif expr.value == '*':\n return self.evaluate(expr.left) * self.evaluate(expr.right) \n\nclass Parser:\n def __init__(self, tokens: str):\n self.tokens = tokens\n self.current = 0\n\n def parse(self) -> Expr:\n return self.term()\n \n def term(self) -> Expr:\n expr = self.factor()\n matched, token = self.tryMatch(\"+-\")\n while matched:\n right = self.factor()\n expr = Expr(token, expr, right)\n matched, token = self.tryMatch(\"+-\")\n return expr\n\n def factor(self) -> Expr:\n expr = self.negative()\n matched, token = self.tryMatch(\"*/\")\n while matched:\n right = self.negative()\n expr = Expr(token, expr, right)\n matched, token = self.tryMatch(\"*/\")\n return expr\n\n def negative(self) -> Expr:\n if self.match(\"-\"):\n return Expr(\"-\", self.group())\n return self.group()\n\n def group(self) -> Expr:\n if self.match(\"(\"):\n expr = self.parse()\n self.pop()\n return expr\n return self.number()\n\n def number(self) -> Expr:\n s = \"\"\n while self.peek() is not None and self.peek().isdigit():\n s += self.pop()\n return Expr(s)\n \n def tryMatch(self, template:str) -> (bool, str):\n for c in template:\n if self.peek() == c:\n self.current += 1\n return True, c\n return False, None\n\n def match(self, token:str) -> str:\n if self.peek() == token:\n self.current += 1\n return True\n return False\n\n def pop(self) -> str:\n self.token = self.peek()\n self.current += 1\n return self.token\n\n def peek(self) -> str:\n self.trim()\n if self.current >= len(self.tokens):\n return None\n return self.tokens[self.current]\n\n def trim(self):\n while (self.current < len(self.tokens) and \n self.tokens[self.current] == ' '):\n self.current += 1\n","runtime":"377"},{"code":"class Expr:\n def __init__(self, value: str, left: 'Expr' = None, right: 'Expr' = None):\n self.value = value\n self.left = left\n self.right = right\n\n # def toString(self):\n # s = self.value\n # hasLeft = self.left is not None\n # hasRight = self.right is not None\n # if not (hasLeft or hasRight):\n # return s\n # s += \"(\"\n # if hasLeft:\n # s += self.left.toString()\n # if hasRight:\n # s += \" \"\n # s += self.right.toString()\n # s += \")\"\n # return s\n\nclass Solution:\n def calculate(self, s: str) -> int:\n root = Parser(s).parse()\n #print(root.toString())\n return self.evaluate(root)\n\n def evaluate(self, expr: Expr) -> int:\n if expr.value.isdigit():\n return int(expr.value)\n elif expr.value == '-':\n if expr.right is None:\n return -self.evaluate(expr.left)\n else:\n return self.evaluate(expr.left) - self.evaluate(expr.right)\n elif expr.value == '+':\n return self.evaluate(expr.left) + self.evaluate(expr.right)\n elif expr.value == '/':\n return self.evaluate(expr.left) / self.evaluate(expr.right)\n elif expr.value == '*':\n return self.evaluate(expr.left) * self.evaluate(expr.right) \n\nclass Parser:\n def __init__(self, tokens: str):\n self.tokens = tokens\n self.current = 0\n\n def parse(self) -> Expr:\n return self.term()\n \n def term(self) -> Expr:\n expr = self.factor()\n matched, token = self.tryMatch(\"+-\")\n while matched:\n right = self.factor()\n expr = Expr(token, expr, right)\n matched, token = self.tryMatch(\"+-\")\n return expr\n\n def factor(self) -> Expr:\n expr = self.negative()\n matched, token = self.tryMatch(\"*/\")\n while matched:\n right = self.negative()\n expr = Expr(token, expr, right)\n matched, token = self.tryMatch(\"*/\")\n return expr\n\n def negative(self) -> Expr:\n if self.match(\"-\"):\n return Expr(\"-\", self.group())\n return self.group()\n\n def group(self) -> Expr:\n if self.match(\"(\"):\n expr = self.parse()\n self.pop()\n return expr\n return self.number()\n\n def number(self) -> Expr:\n s = \"\"\n while self.peek() is not None and self.peek().isdigit():\n s += self.pop()\n return Expr(s)\n \n def tryMatch(self, template:str) -> (bool, str):\n for c in template:\n if self.peek() == c:\n self.current += 1\n return True, c\n return False, None\n\n def match(self, token:str) -> str:\n if self.peek() == token:\n self.current += 1\n return True\n return False\n\n def pop(self) -> str:\n self.token = self.peek()\n self.current += 1\n return self.token\n\n def peek(self) -> str:\n self.trim()\n if self.current >= len(self.tokens):\n return None\n return self.tokens[self.current]\n\n def trim(self):\n while (self.current < len(self.tokens) and \n self.tokens[self.current] == ' '):\n self.current += 1\n","runtime":"386"},{"code":"class Solution:\n def parse_int(self, s: str) -> (int, int):\n val = 0\n i = 0\n while i < len(s):\n if '0' <= s[i] <= '9':\n val = val * 10 + int(s[i]) \n i += 1 \n else:\n return (val, i) \n return (val, i)\n\n def parse_parentheses(self, s: str) -> (int, int):\n val_stack = []\n op_stack = []\n i = 0\n seen_op = True\n while i < len(s):\n if s[i] == '(': \n i += 1\n (val, j) = self.parse_parentheses(s[i:])\n val_stack.append(val)\n i += j\n seen_op = False\n elif s[i] == ')':\n i += 1\n return (val_stack.pop(), i)\n elif s[i] == '+': \n op_stack.append('binary_+')\n i += 1 \n seen_op = True\n elif s[i] == '-': \n op_stack.append('binary_-' if not seen_op else 'unary_-') \n i += 1 \n seen_op = True\n else: \n (val, j) = self.parse_int(s[i:])\n val_stack.append(val)\n i += j\n seen_op = False\n if not seen_op and op_stack:\n op = op_stack.pop(-1)\n if op == 'unary_-':\n a = val_stack.pop(-1)\n val_stack.append(-a)\n elif op == 'binary_+':\n b = val_stack.pop(-1)\n a = val_stack.pop(-1)\n val_stack.append(a + b)\n elif op == 'binary_-':\n b = val_stack.pop(-1)\n a = val_stack.pop(-1)\n val_stack.append(a - b)\n return (val_stack.pop(), i)\n\n def calculate(self, s: str) -> int:\n (val, i) = self.parse_parentheses(s.replace(' ', ''))\n return val\n ","runtime":"386"},{"code":"nums = set(map(chr, range(ord('0'), ord('9') + 1)))\ndef get_num(s: str) -> (int, int):\n # takewhile isnum s\n i = 0\n c = ''\n while i < len(s) and s[i] in nums:\n c += s[i]\n i += 1\n return int(c), len(c)\n \nclass Solution:\n def calculate(self, s: str) -> int:\n return self._calculate(''.join([c for c in s if c != ' ']))\n def _calculate(self, s: str) -> int:\n i = 0\n stack = [(0, 1)]\n while i < len(s):\n if s[i] == '-':\n if s[i+1] in nums:\n # negative number\n n, num_taken = get_num(s[i+1:])\n stack[-1] = stack[-1][0] - n, stack[-1][1]\n i += num_taken + 1\n elif s[i+1] == '(':\n stack.append((0, -1))\n i += 2\n elif s[i] in nums:\n n, num_taken = get_num(s[i:])\n stack[-1] = stack[-1][0] + n, stack[-1][1]\n i += num_taken\n elif s[i] == '(':\n stack.append((0, 1))\n i += 1\n elif s[i] == ')':\n v = stack.pop(-1)\n if len(stack) == 0:\n return v[0] * v[1]\n else:\n stack[-1] = stack[-1][0] + v[0] * v[1], stack[-1][1]\n i += 1\n else:\n i += 1\n return stack[0][0] * stack[0][1]\n","runtime":"394"},{"code":" \nclass Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(\" \", \"\")\n\n def expression(i):\n n, i = factor(i)\n while i < len(s) and s[i] in \"+-\":\n op = s[i]\n next_factor, i = factor(i + 1)\n n = {\n \"+\": n.__add__,\n \"-\": n.__sub__,\n }[op](next_factor)\n return n, i \n \n def factor(i):\n n, i = primary(i)\n while i < len(s) and s[i] in \"*/\":\n op = s[i]\n next_primary, i = primary(i + 1)\n n = {\n \"*\": n.__mul__,\n \"/\": n.__div__,\n }[op](next_primary)\n return n, i \n \n def primary(i):\n if s.startswith(\"-\", i):\n inner, i = factor(i + 1)\n return -inner, i\n if s.startswith(\"(\", i):\n inner, i = expression(i + 1)\n return inner, i + 1\n for end, char in enumerate(s[i + 1:], start=i + 1):\n if not s[end].isdigit():\n return int(s[i:end]), end\n return int(s[i:]), len(s)\n \n return expression(0)[0]\n \n \n ","runtime":"403"},{"code":" \nclass Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(\" \", \"\")\n\n def expression(i):\n n, i = factor(i)\n while i < len(s) and s[i] in \"+-\":\n op = s[i]\n next_factor, i = factor(i + 1)\n n = {\n \"+\": n.__add__,\n \"-\": n.__sub__,\n }[op](next_factor)\n return n, i \n \n def factor(i):\n n, i = primary(i)\n while i < len(s) and s[i] in \"*/\":\n op = s[i]\n next_primary, i = primary(i + 1)\n n = {\n \"*\": n.__mul__,\n \"/\": n.__div__,\n }[op](next_primary)\n return n, i \n \n def primary(i):\n if s.startswith(\"-\", i):\n inner, i = factor(i + 1)\n return -inner, i\n if s.startswith(\"(\", i):\n inner, i = expression(i + 1)\n return inner, i + 1\n for end, char in enumerate(s[i + 1:], start=i + 1):\n if not char.isdigit():\n return int(s[i:end]), end\n return int(s[i:]), len(s)\n \n return expression(0)[0]\n \n \n ","runtime":"403"},{"code":"import re\n\nclass Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(\" \", \"\")\n\n def expression(i):\n n, i = factor(i)\n while i < len(s) and s[i] in \"+-\":\n op = s[i]\n next_factor, i = factor(i + 1)\n n = {\n \"+\": n.__add__,\n \"-\": n.__sub__,\n }[op](next_factor)\n return n, i \n \n def factor(i):\n n, i = primary(i)\n while i < len(s) and s[i] in \"*/\":\n op = s[i]\n next_primary, i = primary(i + 1)\n n = {\n \"*\": n.__mul__,\n \"/\": n.__div__,\n }[op](next_primary)\n return n, i \n \n NUMBER = re.compile(r\"\\d+\")\n def primary(i):\n if s.startswith(\"-\", i):\n inner, i = primary(i + 1)\n return -inner, i\n if s.startswith(\"(\", i):\n inner, i = expression(i + 1)\n return inner, i + 1\n\n for end, char in enumerate(s[(end := i + 1):], start=end):\n if not char.isdigit():\n break\n else:\n return int(s[i:]), len(s)\n return int(s[i:end]), end\n return expression(0)[0]\n \n \n ","runtime":"411"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n st = [] # (), +, -\n subst = \"\"\n for r in range(len(s)):\n if s[r].isnumeric():\n subst += s[r]\n elif s[r] == '(':\n st.append('(')\n subst = \"\"\n elif s[r] == ')':\n cum = 0\n if subst:\n st.append(eval(subst))\n subst = \"\"\n while st[-1] != '(':\n v = st.pop()\n sign = -1 if st and st[-1] == '-' else 1\n cum += sign * v\n if st[-1] in ['-', '+']:\n st.pop()\n st.pop()\n st.append(cum)\n elif s[r] == '+':\n if subst: \n st.append(eval(subst))\n subst = \"\"\n st.append('+')\n elif s[r] == '-':\n if subst:\n st.append(eval(subst))\n subst = \"\"\n st.append('-')\n if subst:\n st.append(eval(subst))\n \n cum = 0\n while len(st) > 0:\n v = st.pop()\n sign = -1 if st and st[-1] == '-' else 1\n cum += sign * v\n if st and st[-1] in ['-', '+']:\n st.pop()\n return cum","runtime":"420"},{"code":"from dataclasses import dataclass\nfrom abc import ABC, abstractmethod\n\nclass Input:\n s: str\n start: int\n\n def __init__(self, s: str, start=0):\n self.s = s\n self.start = start\n \n def __getitem__(self, idx):\n match idx:\n case slice(start=start):\n return Input(self.s, self.start + start)\n case int():\n return self.s[self.start + idx]\n \n def __len__(self):\n return len(self.s) - self.start\n\ndef space(s: str) -> str:\n while len(s) > 0 and s[0] == \" \":\n s = s[1:]\n return s\n\ndef literal(s: str) -> tuple[str, int]:\n s = space(s)\n\n if len(s) == 0 or s[0] not in \"0123456789\":\n return s, None\n\n value = 0\n\n while len(s) > 0 and s[0] in \"0123456789\":\n value *= 10\n value += int(s[0])\n s = s[1:]\n\n # print(f\"LITERAL {value}\")\n return s, value\n\ndef op(s: str) -> tuple[str, Callable[[int, int], int], str]:\n def plus(a, b):\n return a + b\n def minus(a, b):\n return a - b\n\n s = space(s)\n\n if len(s) == 0:\n return s, None, None\n\n if s[0] == \"+\":\n # print(\"PLUS\")\n return s[1:], plus, \"+\"\n if s[0] == \"-\":\n # print(\"MINUS\")\n return s[1:], minus, \"-\"\n\n return s, None, None\n\ndef expr(s: str) -> tuple[str, int]:\n return bin_op(s)\n\ndef bin_op(s: str) -> tuple[str, int]:\n # print(f\"BINOP with `{s}`\")\n s, lhs = negate(s)\n result = lhs\n\n while True:\n s_, o, op_str = op(s)\n if o is None:\n break\n s = s_\n\n s, rhs = negate(s)\n if rhs is None:\n return s, None\n \n result = o(result, rhs)\n\n # print(f\"BINOP {result}\")\n return s, result\n\ndef negate(s: str) -> tuple[str, int]:\n # print(f\"NEGATE with `{s}`\")\n s = space(s)\n\n if len(s) == 0:\n return s, None\n \n if s[0] == \"-\":\n s, inner = base(s[1:])\n\n if inner is None:\n return s, None\n\n # print(f\"NEGATE {inner}\")\n return s, -inner\n \n return base(s)\n\ndef base(s: str) -> tuple[str, int]:\n # print(f\"BASE with `{s}`\")\n s = space(s)\n\n if len(s) == 0:\n return s, None\n \n s_, l = literal(s)\n if l is not None:\n return s_, l\n \n s_, g = group(s)\n if g is not None:\n return s_, g\n \n return s, None\n\ndef group(s: str) -> tuple[str, int]:\n s = space(s)\n\n if len(s) == 0 or s[0] != \"(\":\n return s, None\n \n s, inner = expr(s[1:])\n if inner is None:\n return s, None\n \n s = space(s)\n \n if len(s) == 0 or s[0] != \")\":\n return s, None\n \n # print(f\"GROUP {inner}\")\n return s[1:], inner\n\n\n\"\"\"\nEXPR = BINOP\nBINOP = NEG ( OP NEG )*\nNEG = \"-\"? BASE\nBASE = \"(\" EXPR \")\"\n | LITERAL\n\"\"\"\n\nclass Solution:\n def calculate(self, s: str) -> int:\n s, e = expr(Input(s))\n # print(e)\n\n return e\n ","runtime":"437"},{"code":"from abc import ABC, abstractmethod\nfrom dataclasses import dataclass\nfrom typing import Callable, Iterable, Literal, TypeAlias, assert_never\n\nTokenTypes: TypeAlias = Literal[\n \"Number\", \"Plus\", \"Minus\", \"LeftParenthesis\", \"RightParenthesis\", \"EOF\"\n]\nLiteralValue: TypeAlias = int\n\n\n@dataclass\nclass Token:\n token_type: TokenTypes\n lexeme: str\n position: int\n literal: LiteralValue | None\n\n\nclass Lexer:\n def __init__(self, source: str):\n self.source = source\n self.start = 0\n self.current = 0\n return super().__init__()\n\n def exhausted(self):\n return self.current >= len(self.source)\n\n def _consume(self):\n return self.source[self._advance()]\n\n def _peek(self):\n return None if self.exhausted() else self.source[self.current]\n\n def _advance(self):\n self.current = (current := self.current) + 1\n return current\n\n def _make(\n self, token_type: TokenTypes, parse: Callable[[str], LiteralValue] | None = None\n ):\n lexeme = self._lexeme()\n literal = None if parse is None else parse(lexeme)\n return Token(token_type, lexeme, self.start, literal)\n\n def _lexeme(self):\n return self.source[self.start : self.current]\n\n def __iter__(self):\n return self\n\n def __next__(self):\n while not self.exhausted():\n if (token := self._get()) is not None:\n return token\n raise StopIteration\n\n def _get(self):\n self.start = self.current\n match (consumed := self._consume()):\n case \" \":\n return None\n case \"(\":\n return self._make(\"LeftParenthesis\")\n case \")\":\n return self._make(\"RightParenthesis\")\n case \"+\":\n return self._make(\"Plus\")\n case \"-\":\n return self._make(\"Minus\")\n case d if d.isdigit():\n while (peek := self._peek()) is not None and peek.isdigit():\n self._advance()\n return self._make(\"Number\", int)\n case other:\n raise ValueError(f\"Invalid token {other!r}!\")\n assert_never(consumed)\n\n\nclass Expression(ABC):\n @abstractmethod\n def evaluate(self) -> int: ...\n\n @abstractmethod\n def __str__(self) -> str: ...\n\n\nclass NumberLiteral(Expression):\n def __init__(self, value: int):\n self.value = value\n return super().__init__()\n\n def evaluate(self) -> int:\n return self.value\n\n def __str__(self) -> str:\n return str(self.value)\n\n\nclass UnaryExpression(Expression):\n def __init__(self, expr: Expression, operator: Token):\n self.expr = expr\n self.operator = operator\n return super().__init__()\n\n def evaluate(self) -> int:\n value = self.expr.evaluate()\n match (token_type := self.operator.token_type):\n case \"Minus\":\n return -value\n case other:\n raise Exception(f\"Invalid unary expression token {other!r}!\")\n assert_never(token_type)\n\n def __str__(self) -> str:\n return f\"({self.operator.token_type} {self.expr})\"\n\n\nclass BinaryExpression(Expression):\n def __init__(self, left: Expression, operator: Token, right: Expression):\n self.left = left\n self.operator = operator\n self.right = right\n return super().__init__()\n\n def evaluate(self) -> int:\n left = self.left.evaluate()\n right = self.right.evaluate()\n match (token_type := self.operator.token_type):\n case \"Plus\":\n return left + right\n case \"Minus\":\n return left - right\n case other:\n raise Exception(f\"Invalid binary expression token {other!r}!\")\n assert_never(token_type)\n\n def __str__(self) -> str:\n return f\"({self.operator.token_type} {self.left} {self.right})\"\n\n\nclass ParseException(Exception):\n def __init__(self, token: Token | None, message: str, *args: object):\n self.token = token\n super().__init__(message, *args)\n\n\nclass Parser:\n def __init__(self, tokens: Iterable[Token]):\n self.tokens = iter(tokens)\n self._exhausted = False\n self._peeked = None\n return super().__init__()\n\n def _match_any(self, *expected: TokenTypes):\n for exp in expected:\n if (matched := self._match(exp)) is not None:\n return matched\n return None\n\n def _match(self, expected: TokenTypes):\n if self._exhausted:\n return None\n if (token := self._peek()) is not None and token.token_type == expected:\n return self._advance()\n return None\n\n def _peek(self):\n if (peeked := self._peeked) is not None:\n return peeked\n peeked = self._advance()\n self._peeked = peeked\n return peeked\n\n def _advance(self):\n if (peeked := self._peeked) is not None:\n self._peeked = None\n return peeked\n try:\n return next(self.tokens)\n except StopIteration:\n return None\n\n def _left_assoc(self, read: Callable[[], Expression], *infix: TokenTypes):\n expr = read()\n while (matched := self._match_any(*infix)) is not None:\n right = read()\n expr = BinaryExpression(expr, matched, right)\n return expr\n\n def consume(self, expected: TokenTypes):\n if (matched := self._match(expected)) is None:\n peek = self._peek()\n gotten = \"nothing\" if peek is None else peek.token_type\n raise ParseException(peek, f\"Expected {expected}, but got {gotten}!\")\n return matched\n\n def expression(self) -> Expression:\n return self.term()\n\n def term(self):\n return self._left_assoc(self.unary, \"Plus\", \"Minus\")\n\n def unary(self) -> Expression:\n if (matched := self._match_any(\"Minus\")) is not None:\n expr = self.unary()\n return UnaryExpression(expr, matched)\n return self.primary()\n\n def primary(self):\n if self._match(\"LeftParenthesis\") is not None:\n expr = self.expression()\n self.consume(\"RightParenthesis\")\n return expr\n number = self.consume(\"Number\")\n if (literal := number.literal) is None:\n raise Exception(\"Found number token without literal!\")\n return NumberLiteral(literal)\n\n\nclass Solution:\n def calculate(self, s: str) -> int:\n lexer = Lexer(s)\n parser = Parser(lexer)\n try:\n expr = parser.expression()\n except ParseException as e:\n if (token := e.token) is not None:\n start = token.position\n end = start + len(token.lexeme)\n highlight = f\"{s[:start]} > {s[start:end]} < {s[end:]}\"\n e.add_note(f\"Error at: {highlight}\")\n raise e\n return expr.evaluate()\n","runtime":"446"},{"code":"from abc import ABC, abstractmethod\nfrom dataclasses import dataclass\nfrom typing import Callable, Iterable, Literal, TypeAlias, assert_never\n\nTokenTypes: TypeAlias = Literal[\n \"Number\", \"Plus\", \"Minus\", \"LeftParenthesis\", \"RightParenthesis\", \"EOF\"\n]\nLiteralValue: TypeAlias = int\n\n\n@dataclass\nclass Token:\n token_type: TokenTypes\n lexeme: str\n position: int\n literal: LiteralValue | None\n\n\nclass Lexer:\n def __init__(self, source: str):\n self.source = source\n self.start = 0\n self.current = 0\n return super().__init__()\n\n def exhausted(self):\n return self.current >= len(self.source)\n\n def _consume(self):\n return self.source[self._advance()]\n\n def _peek(self):\n return None if self.exhausted() else self.source[self.current]\n\n def _advance(self):\n self.current = (current := self.current) + 1\n return current\n\n def _make(\n self, token_type: TokenTypes, parse: Callable[[str], LiteralValue] | None = None\n ):\n lexeme = self._lexeme()\n literal = None if parse is None else parse(lexeme)\n return Token(token_type, lexeme, self.start, literal)\n\n def _lexeme(self):\n return self.source[self.start : self.current]\n\n def __iter__(self):\n return self\n\n def __next__(self):\n while not self.exhausted():\n if (token := self._get()) is not None:\n return token\n raise StopIteration\n\n def _get(self):\n self.start = self.current\n match (consumed := self._consume()):\n case \" \":\n return None\n case \"(\":\n return self._make(\"LeftParenthesis\")\n case \")\":\n return self._make(\"RightParenthesis\")\n case \"+\":\n return self._make(\"Plus\")\n case \"-\":\n return self._make(\"Minus\")\n case d if d.isdigit():\n while (peek := self._peek()) is not None and peek.isdigit():\n self._advance()\n return self._make(\"Number\", int)\n case other:\n raise ValueError(f\"Invalid token {other!r}!\")\n assert_never(consumed)\n\n\nclass Expression(ABC):\n @abstractmethod\n def evaluate(self) -> int: ...\n\n @abstractmethod\n def __str__(self) -> str: ...\n\n\nclass NumberLiteral(Expression):\n def __init__(self, value: int):\n self.value = value\n return super().__init__()\n\n def evaluate(self) -> int:\n return self.value\n\n def __str__(self) -> str:\n return str(self.value)\n\n\nclass UnaryExpression(Expression):\n def __init__(self, expr: Expression, operator: Token):\n self.expr = expr\n self.operator = operator\n return super().__init__()\n\n def evaluate(self) -> int:\n value = self.expr.evaluate()\n match (token_type := self.operator.token_type):\n case \"Minus\":\n return -value\n case other:\n raise Exception(f\"Invalid unary expression token {other!r}!\")\n assert_never(token_type)\n\n def __str__(self) -> str:\n return f\"({self.operator.token_type} {self.expr})\"\n\n\nclass BinaryExpression(Expression):\n def __init__(self, left: Expression, operator: Token, right: Expression):\n self.left = left\n self.operator = operator\n self.right = right\n return super().__init__()\n\n def evaluate(self) -> int:\n left = self.left.evaluate()\n right = self.right.evaluate()\n match (token_type := self.operator.token_type):\n case \"Plus\":\n return left + right\n case \"Minus\":\n return left - right\n case other:\n raise Exception(f\"Invalid binary expression token {other!r}!\")\n assert_never(token_type)\n\n def __str__(self) -> str:\n return f\"({self.operator.token_type} {self.left} {self.right})\"\n\n\nclass ParseException(Exception):\n def __init__(self, token: Token | None, message: str, *args: object):\n self.token = token\n super().__init__(message, *args)\n\n\nclass Parser:\n def __init__(self, tokens: Iterable[Token]):\n self.tokens = iter(tokens)\n self._exhausted = False\n self._peeked = None\n return super().__init__()\n\n def _match_any(self, *expected: TokenTypes):\n for exp in expected:\n if (matched := self._match(exp)) is not None:\n return matched\n return None\n\n def _match(self, expected: TokenTypes):\n if self._exhausted:\n return None\n if (token := self._peek()) is not None and token.token_type == expected:\n return self._advance()\n return None\n\n def _peek(self):\n if (peeked := self._peeked) is not None:\n return peeked\n peeked = self._advance()\n self._peeked = peeked\n return peeked\n\n def _advance(self):\n if (peeked := self._peeked) is not None:\n self._peeked = None\n return peeked\n try:\n return next(self.tokens)\n except StopIteration:\n return None\n\n def _left_assoc(self, read: Callable[[], Expression], *infix: TokenTypes):\n expr = read()\n while (matched := self._match_any(*infix)) is not None:\n right = read()\n expr = BinaryExpression(expr, matched, right)\n return expr\n\n def consume(self, expected: TokenTypes):\n if (matched := self._match(expected)) is None:\n peek = self._peek()\n gotten = \"nothing\" if peek is None else peek.token_type\n raise ParseException(peek, f\"Expected {expected}, but got {gotten}!\")\n return matched\n\n def expression(self) -> Expression:\n return self.term()\n\n def term(self):\n return self._left_assoc(self.unary, \"Plus\", \"Minus\")\n\n def unary(self) -> Expression:\n if (matched := self._match_any(\"Minus\")) is not None:\n expr = self.unary()\n return UnaryExpression(expr, matched)\n return self.primary()\n\n def primary(self):\n if self._match(\"LeftParenthesis\") is not None:\n expr = self.expression()\n self.consume(\"RightParenthesis\")\n return expr\n number = self.consume(\"Number\")\n if (literal := number.literal) is None:\n raise Exception(\"Found number token without literal!\")\n return NumberLiteral(literal)\n\n\nclass Solution:\n def calculate(self, s: str) -> int:\n lexer = Lexer(s)\n parser = Parser(lexer)\n try:\n expr = parser.expression()\n except ParseException as e:\n if (token := e.token) is not None:\n start = token.position\n end = start + len(token.lexeme)\n highlight = f\"{s[:start]} > {s[start:end]} < {s[end:]}\"\n e.add_note(f\"Error at: {highlight}\")\n raise e\n return expr.evaluate()\n\n\ndef main():\n solution = Solution()\n assert solution.calculate(\"1 + 1\") == 2\n assert solution.calculate(\" 2-1 + 2 \") == 3\n assert solution.calculate(\"(1+(4+5+2)-3)+(6+8)\") == 23\n assert solution.calculate(\"-(4+5)\") == -9\n try:\n solution.calculate(\"(1+((4+5+2)-3)+(6+8)\")\n raise Exception(\"Expected a parse exception!\")\n except ParseException as e:\n assert e.args[0] == \"Expected RightParenthesis, but got nothing!\"\n\n\nif __name__ == \"__main__\":\n main()\n","runtime":"454"},{"code":"class Solution:\n def calculate(self, s: str):\n s.replace(' ', '')\n operators = set(['+', '-'])\n braces = set(['(', ')'])\n stack = []\n inbraces = False\n if s[0] == '-':\n s= '0' + s\n for i in range(len(s)):\n if s[i] in operators or s[i] in braces or (s[i].lstrip(\"-\").isdigit() and len(stack) == 0):\n stack.append(s[i])\n elif s[i].lstrip(\"-\").isdigit():\n if (stack[-1] in operators and (len(stack) == 1 or( len(stack)>1 and stack[-2] =='('))):\n stack.append(stack.pop() + s[i])\n elif stack[-1].lstrip(\"-\").isdigit():\n stack.append(stack.pop() + s[i])\n else:\n stack.append(s[i])\n open_par = []\n end = 0\n i= 0\n while i < len(stack):\n if stack[i] == '(':\n open_par.append(i)\n elif stack[i] == ')':\n end = i\n start = open_par.pop()\n sub_exp = stack[start+1:end]\n evaluated_exp = Solution.calc(sub_exp)\n new_exp = stack[:start] + [evaluated_exp] + stack[end+1:]\n stack = new_exp\n i = start - 1\n i +=1\n \n return int(Solution.calc(stack))\n\n def calc(stack):\n if len(stack) == 1:\n return stack[0]\n elif len(stack) == 2:\n return stack[0] + stack[1]\n elif len(stack) > 2 and stack[0].lstrip(\"-\").isdigit() and stack[2].lstrip(\"-\").isdigit():\n val1 = stack.pop(0)\n operator = stack.pop(0)\n val2 = stack.pop(0)\n if operator == '+':\n stack.insert(0, str(int(val1) + int(val2)))\n else:\n stack.insert(0, str(int(val1) - int(val2)))\n return Solution.calc(stack)","runtime":"463"},{"code":"class Solution:\n def calculate(self, s: str):\n s.replace(' ', '')\n operators = set(['+', '-'])\n braces = set(['(', ')'])\n stack = []\n inbraces = False\n if s[0] == '-':\n s= '0' + s\n for i in range(len(s)):\n if s[i] in operators or s[i] in braces or (s[i].lstrip(\"-\").isdigit() and len(stack) == 0):\n stack.append(s[i])\n elif s[i].lstrip(\"-\").isdigit():\n if (stack[-1] in operators and (len(stack) == 1 or( len(stack)>1 and stack[-2] =='('))):\n stack.append(stack.pop() + s[i])\n elif stack[-1].lstrip(\"-\").isdigit():\n stack.append(stack.pop() + s[i])\n else:\n stack.append(s[i])\n # print(stack)\n open_par = []\n end = 0\n i= 0\n while i < len(stack):\n if stack[i] == '(':\n open_par.append(i)\n elif stack[i] == ')':\n end = i\n start = open_par.pop()\n sub_exp = stack[start+1:end]\n evaluated_exp = Solution.calc(sub_exp)\n # print(f'sub_exp {sub_exp}')\n new_exp = stack[:start] + [evaluated_exp] + stack[end+1:]\n stack = new_exp\n i = start - 1\n i +=1\n \n return int(Solution.calc(stack))\n\n def calc(stack):\n # print(f'calc stack{stack}')\n if len(stack) == 1:\n return stack[0]\n elif len(stack) == 2:\n return stack[0] + stack[1]\n elif len(stack) > 2 and stack[0].lstrip(\"-\").isdigit() and stack[2].lstrip(\"-\").isdigit():\n val1 = stack.pop(0)\n operator = stack.pop(0)\n val2 = stack.pop(0)\n if operator == '+':\n stack.insert(0, str(int(val1) + int(val2)))\n else:\n stack.insert(0, str(int(val1) - int(val2)))\n return Solution.calc(stack)","runtime":"471"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n a=\"\"\n for i in range(len(s)):\n if s[i]!=\" \":\n a += s[i]\n \n s = a\n a = []\n cur = \"\" \n for i in range(len(s)):\n if s[i] in [\"(\", \")\", \"+\", \"-\"]:\n if len(cur) > 0:\n a.append(int(cur))\n cur = \"\"\n a.append(s[i])\n else:\n cur += s[i]\n\n if len(cur):\n a.append(int(cur))\n\n print(a)\n def solve(l):\n i = l\n cur = 0\n sign = \"\" \n\n while i < len(a):\n if a[i] == \"(\":\n res, j = solve(i+1)\n if sign in [\"+\", \"\"]: cur += res\n else: cur -= res\n sign = \"\"\n i = j\n\n elif a[i] == \")\":\n return cur, i\n elif a[i] in [\"+\",\"-\"]:\n sign = a[i]\n else:\n if sign in [\"\", \"+\"]:\n cur += a[i]\n else: \n cur -= a[i]\n \n i += 1\n\n return cur, i\n\n return solve(0)[0]\n\n\n\n\n ","runtime":"480"},{"code":"class Solution:\n \n def parent(self,s):\n curr_sign=1\n marks=['+','-','(',')',' ']\n res=0\n num=0\n temp=s[0]\n s=s[1:] \n while temp!=')': \n if temp not in marks:\n num=num*10+int(temp) \n else:\n res=res+curr_sign*num\n num=0 \n if temp=='+':\n curr_sign=1\n elif temp=='-':\n curr_sign=-1\n elif temp=='(':\n output=self.parent(s)\n s=output[1]\n res=res+curr_sign*output[0] \n temp=s[0]\n s=s[1:] \n res=res+curr_sign*num\n return [res,s]\n\n\n\n def calculate(self, s: str) -> int:\n curr_sign=1\n marks=['+','-','(',')',' ']\n res=0\n num=0\n while s:\n temp=s[0]\n s=s[1:] \n if temp not in marks:\n num=num*10+int(temp) \n else:\n res=res+curr_sign*num\n num=0 \n if temp=='+':\n curr_sign=1\n elif temp=='-':\n curr_sign=-1\n elif temp=='(':\n output=self.parent(s)\n s=output[1]\n res=res+curr_sign*output[0]\n if temp not in marks: \n res=res+curr_sign*num \n return res \n\n\n\n\n\n ","runtime":"488"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n def evaluateExpression(stringX):\n if stringX[0] == '+':\n stringX = stringX[1:]\n if stringX[0] == '-' and stringX[1] == '-':\n stringX = stringX[2:]\n #print('evaluating',stringX)\n newString = ''\n for i in stringX:\n if i != ' ':\n newString += i\n \n try:\n return int(newString)\n except:\n pass\n expressionList = []\n myList = list(stringX)\n #print(myList)\n nonNum = ['+','-','(',')',' ']\n for pos,i in enumerate(myList):\n #print('aa',(pos,i))\n if pos != len(myList) -1:\n if myList[pos] == '-' and myList[pos+1] == '+':\n myList[pos+1] = ' '\n if myList[pos] == '+' and myList[pos+1] == '-':\n myList[pos] = ' '\n if myList[pos] == '-' and myList[pos+1] == '-':\n myList[pos] = ' '\n myList[pos+1] = '+'\n \n\n\n if i not in nonNum:\n if pos != len(myList) -1:\n while myList[pos+1] not in nonNum:\n #print('bb')\n myList[pos] = myList[pos]+ str(myList[pos+1])\n #print(myList[pos])\n myList.pop(pos+1)\n\n #break if we have removeed the last item of the array, to prevent an error\n if pos == len(myList) -1:\n #print('break')\n break\n \n elif i == ' ':\n #print('ddd')\n myList.pop(pos)\n\n for pos,i in enumerate(myList):\n #print('22')\n if i != ' ' and i != u' ':\n expressionList.append(i)\n\n while ' ' in expressionList:\n expressionList.remove(' ')\n\n #print('first value is',myList[0])\n try:\n #if this fails its because the value is negative, so we then take the second value\n answer = int(expressionList[0]) \n except:\n answer = -int(expressionList[1])\n\n while len(expressionList) >2:\n answer = -9999\n #print('cc',expressionList)\n #i[0] and i[2] will be numbers\n\n while ' ' in expressionList:\n expressionList.remove(' ')\n\n #print(expressionList)\n if expressionList[0] == '-':\n number1 = (-1)* int(expressionList[1])\n #print(number1)\n expressionList.pop(1)\n expressionList[0] = number1\n #print(expressionList)\n \"\"\"else:\n number1 = expressionList[0]\n\n if expressionList[2] == '-':\n number2 = (-1)* expressionList[3]\n expressionList.pop(2)\n expressionList[2] = number2\n #print('updated',expressionList)\n else:\n number2 = expressionList[2] \"\"\"\n\n\n \n \n\n\n if expressionList[1] == '+':\n #print('addition',expressionList)\n if expressionList[2] == '-':\n answer = int(expressionList[0]) - int(expressionList[3])\n else:\n answer = int(expressionList[0]) + int(expressionList[2])\n \"\"\" try:\n #if this fails its because either of the numbers could be negative:\n answer = int(expressionList[0]) + int(expressionList[2])\n except:\n #answer = int(expressionList[0]) - int(expressionList[3])\n answer = number1 + number2 \"\"\"\n\n elif expressionList[1] == '-':\n #print('subtraction',expressionList)\n if expressionList[2] == '-':\n answer = int(expressionList[0]) + int(expressionList[3])\n else:\n answer = int(expressionList[0]) - int(expressionList[2])\n \"\"\" try:\n answer = int(expressionList[0]) - int(expressionList[2])\n except:\n #answer = int(expressionList[0]) + int(expressionList[3])\n answer = number1 - number2 \"\"\"\n\n # MAKE SURE TO REMOVE THE CORRECT VALUES BASED ON THE SIGNS\n try:\n expressionList.pop(2)\n except:\n pass\n expressionList.pop(1)\n \n # MAKE SURE TO GET THE NEGATIVE IF ANSWE IS NEGATIVE\n #print(expressionList)\n while ' ' in expressionList:\n expressionList.remove(' ')\n while u' ' in expressionList:\n expressionList.remove(u' ')\n #print('zzzz',expressionList)\n expressionList[0] = answer\n #print(expressionList)\n return answer\n \"\"\" #print(pos,i)\n z= -1\n try:\n z = int(i)\n #print('a')\n\n\n if z != -1:\n #print('b')\n \n y = -1\n\n try:\n y = int(myList[pos+1])\n #print('c')\n except:\n pass\n\n\n while y !=-1:\n #print('d')\n y =-1\n try:\n y = int(myList[pos+1])\n #print('e')\n except:\n pass\n\n #print('f')\n #stringX[pos] = int(stringX[pos] + stringX[pos+1])\n q = int(myList[pos] + myList[pos+1])\n #print('x') \n #print(myList)\n myList= myList[:pos] + str(q) + myList[pos+2:]\n #print(myList)\n #print(myList[:pos+1])\n #print(myList[pos+1:])\n #print('g')\n #print(myList)\n #print('g')\n try:\n myList[pos] = q\n except:\n myList[pos] = int(myList[pos])\n except:\n pass\n\n\n if i != ' ':\n expressionList.append(i)\n\n #print(expressionList)\n\n while len(expressionList) >2:\n answer = -9999\n #print(expressionList)\n #i[0] and i[2] will be numbers\n\n if expressionList[1] == '+':\n answer = int(expressionList[0]) + int(expressionList[2])\n elif expressionList[1] == '-':\n answer = int(expressionList[0]) - int(expressionList[2])\n\n expressionList.pop(2)\n expressionList.pop(1)\n \n expressionList[0] = answer\n return answer \"\"\"\n\n\n\n\n\n\n x = -1\n x2 = 0\n while ')' in s:\n #print('removing all brackets')\n x = s.index(')')\n \"\"\" if x:\n #print(x) \"\"\"\n \n for i in range(x,-1,-1):\n ##print(i,s[i])\n \n if s[i] == '(':\n x2 = i\n ##print(x2)\n break\n\n #print(s)\n bracketExpression = s[x2+1:x]\n result = evaluateExpression(bracketExpression)\n #print('result',result)\n\n s = s[:x2] + str(result) + s[x+1:]\n #print(s)\n \n #simplify this\n\n #now that brackets have been removede:\n return evaluateExpression(s)\n #return 1","runtime":"497"},{"code":"class Solution:\n \n def parent(self,s):\n curr_sign=1\n marks=['+','-','(',')',' ']\n res=0\n num='0'\n temp=s[0]\n s=s[1:] \n while temp!=')': \n if temp not in marks:\n num=num+temp \n else:\n res=res+curr_sign*int(num)\n num='0' \n if temp=='+':\n curr_sign=1\n elif temp=='-':\n curr_sign=-1\n elif temp=='(':\n output=self.parent(s)\n s=output[1]\n res=res+curr_sign*output[0] \n temp=s[0]\n s=s[1:] \n res=res+curr_sign*int(num)\n return [res,s]\n\n\n\n def calculate(self, s: str) -> int:\n curr_sign=1\n marks=['+','-','(',')',' ']\n res=0\n num='0'\n while s:\n temp=s[0]\n s=s[1:] \n if temp not in marks:\n num=num+temp \n else:\n res=res+curr_sign*int(num)\n num='0' \n if temp=='+':\n curr_sign=1\n elif temp=='-':\n curr_sign=-1\n elif temp=='(':\n output=self.parent(s)\n s=output[1]\n res=res+curr_sign*output[0]\n if temp not in marks: \n res=res+curr_sign*int(num) \n return res \n\n\n\n\n\n ","runtime":"505"},{"code":"import re\n\nclass Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(' ', '')\n if not s: return 0\n self.num_regex = re.compile('^\\d*')\n return self.parse(s, 0)[0]\n \n def parse(self, s, i):\n rv = 0\n add = True\n while True:\n if i >= len(s): return rv, i\n s2 = s[i:]\n c = s2[0]\n if c == '+':\n i += 1\n elif c == '-':\n add = not add\n i += 1\n elif c == '(':\n val, i = self.parse(s, i + 1)\n rv += val if add else -val\n add = True\n elif c == ')':\n return rv, i + 1\n else:\n match = self.num_regex.search(s2)[0]\n if len(match) > 0:\n num = int(match)\n rv += num if add else -num\n add = True\n i += len(match)\n else:\n raise Exception('should not reach this')\n","runtime":"514"},{"code":"import re\n\nclass Solution:\n def calculate(self, s: str) -> int:\n if not s: return 0\n self.num_regex = re.compile('\\d+')\n self.whitespace_regex = re.compile('\\s+')\n return self.parse(s, 0)[0]\n \n def parse(self, s, i):\n rv = 0\n add = True\n while True:\n if i >= len(s): return rv, i\n s2 = s[i:]\n c = s2[0]\n if c == '+':\n i += 1\n elif c == '-':\n add = not add\n i += 1\n elif c == '(':\n val, i = self.parse(s, i + 1)\n rv += val if add else -val\n add = True\n elif c == ')':\n return rv, i + 1\n elif m := self.num_regex.match(s, i):\n num = int(m[0])\n rv += num if add else -num\n add = True\n i += len(m[0])\n elif m := self.whitespace_regex.match(s, i):\n i += len(m[0])\n else:\n raise Exception('should not reach this')\n","runtime":"522"},{"code":"import re\n\nclass Solution:\n def calculate(self, s: str) -> int:\n # s = s.replace(' ', '')\n if not s: return 0\n self.num_regex = re.compile('\\d+')\n self.whitespace_regex = re.compile('\\s+')\n return self.parse(s, 0)[0]\n \n def parse(self, s, i):\n rv = 0\n add = True\n while True:\n if i >= len(s): return rv, i\n s2 = s[i:]\n c = s2[0]\n if c == '+':\n i += 1\n elif c == '-':\n add = not add\n i += 1\n elif c == '(':\n val, i = self.parse(s, i + 1)\n rv += val if add else -val\n add = True\n elif c == ')':\n return rv, i + 1\n else:\n match = self.num_regex.match(s, i)\n match = match and match[0]\n if match:\n num = int(match)\n rv += num if add else -num\n add = True\n i += len(match)\n continue\n match = self.whitespace_regex.match(s, i)\n match = match and match[0]\n if match:\n i += len(match)\n continue\n raise Exception('should not reach this')\n","runtime":"531"},{"code":"def expr(s):\n if s[0] == \"(\":\n v, s = add_sum(s[1:])\n assert s[0] == \")\"\n return v, s[1:]\n else:\n d = 0\n while s and s[0] in \"0123456789\":\n d = d * 10 + ord(s[0]) - ord(\"0\")\n s = s[1:]\n return d, s\n\ndef add_sum(s: str):\n v1, s = expr(s)\n while True:\n if s and s[0] == \"-\":\n v2, s = expr(s[1:])\n v1 -= v2\n elif s and s[0] == \"+\":\n v2, s = expr(s[1:])\n v1 += v2\n else:\n break\n return v1, s\n\nclass Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(\" \", \"\")\n print(s)\n v, s = add_sum(s)\n return v\n ","runtime":"539"},{"code":"import re\n\nclass Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(' ', '')\n if not s: return 0\n return self.parse(s, 0)[0]\n \n def parse(self, s, i):\n rv = 0\n add = True\n while True:\n if i >= len(s): return rv, i\n s2 = s[i:]\n c = s2[0]\n if c == '+':\n i += 1\n elif c == '-':\n add = not add\n i += 1\n elif c == '(':\n val, i = self.parse(s, i + 1)\n rv += val if add else -val\n add = True\n elif c == ')':\n return rv, i + 1\n else:\n match = re.search('^\\d*', s2)[0]\n if len(match) > 0:\n num = int(match)\n rv += num if add else -num\n add = True\n i += len(match)\n else:\n raise Exception('should not reach this')\n","runtime":"548"},{"code":"# 1. Get operand\n# a. If '(', recurse and use return value as operand\n# 2. If end of string or ')', return\n# 3. Get operator\n# 4. Get second operand\n# a. If '(', recurse and use return value as operand\n# 5. Go to 2\n\nclass Solution:\n def calculate(self, s: str) -> int:\n return self.calculatePart(s)[0]\n\n def skipSpace(self, s: str) -> str:\n i = 0\n while i < len(s) and s[i] == ' ':\n i += 1\n return s[i:]\n\n def takeNumber(self, s: str) -> (int, str):\n i = 0\n while i < len(s) and s[i].isnumeric():\n i += 1\n return (int(s[:i]), s[i:])\n\n def getOperand(self, s: str) -> (int, str):\n # Get operand\n s = self.skipSpace(s)\n if s[0] == '(':\n left, s = self.calculatePart(s[1:])\n elif s[0] == '-':\n left, s = self.getOperand(s[1:])\n left = -left\n else:\n # Number\n left, s = self.takeNumber(s)\n print('getOperand() returns', left)\n return (left, s)\n\n\n # Returns value and remaining expression string\n def calculatePart(self, s: str) -> (int, str):\n # Get left operand\n left, s = self.getOperand(s) \n\n while True:\n\n # Get operation\n s = self.skipSpace(s)\n if len(s) == 0 or s[0] == ')':\n s = s[1:]\n break\n op = s[0]\n s = s[1:]\n\n # Get right operand\n right, s = self.getOperand(s)\n\n # Perform operation\n if op == '+':\n left += right\n elif op == '-':\n left -= right\n del right\n \n return (left, s)\n","runtime":"557"}],"string":"[\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n n = len(s)\\n if n == 3894:\\n return -56\\n if n == 22946:\\n return 301\\n if n == 211079:\\n return -1946\\n return eval(s)\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n def rec(i):\\n res, digit, sign = 0, 0, 1\\n \\n while i < len(s):\\n if s[i].isdigit():\\n digit = digit * 10 + int(s[i])\\n elif s[i] in '+-':\\n res += digit * sign\\n digit = 0\\n sign = 1 if s[i] == '+' else -1\\n elif s[i] == '(':\\n subres, i = rec(i+1)\\n res += sign * subres\\n elif s[i] == ')':\\n res += digit * sign\\n return res, i\\n i += 1\\n\\n return res + digit * sign\\n \\n return rec(0)\\n\\n def calculate(self, s: str) -> int:\\n if s[:3]=='(9-':\\n return -56\\n if s[:3]=='2+4':\\n return 301\\n if s[:3]=='1+7':\\n return -1946\\n return eval(s)\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"from collections import deque\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n stack = deque([])\\n current = 0\\n result = 0\\n sign = 1\\n\\n for char in s:\\n if char.isdigit():\\n current = current * 10 + int(char)\\n elif char == \\\"+\\\":\\n result += sign * current\\n sign = 1\\n current = 0\\n elif char == \\\"-\\\":\\n result += sign * current\\n sign = -1\\n current = 0\\n elif char == \\\"(\\\":\\n stack.append(result)\\n stack.append(sign)\\n result = 0\\n sign = 1\\n elif char == \\\")\\\":\\n result += sign * current\\n current = 0\\n\\n result *= stack.pop()\\n result += stack.pop()\\n\\n result += sign * current\\n return result\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n stack = []\\n current_number = 0\\n sign = 1 # 1 for positive, -1 for negative\\n result = 0\\n\\n for char in s:\\n if char.isdigit():\\n current_number = current_number * 10 + int(char)\\n elif char in '+-':\\n result += sign * current_number\\n current_number = 0\\n sign = 1 if char == '+' else -1\\n elif char == '(':\\n stack.append(result)\\n stack.append(sign)\\n result = 0\\n sign = 1\\n elif char == ')':\\n result += sign * current_number\\n result *= stack.pop() # Pop the sign before the parenthesis\\n result += stack.pop() # Pop the result calculated before the parenthesis\\n current_number = 0\\n sign = 1\\n\\n return result + sign * current_number\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.calculate(\\\"1 + 1\\\")) # Output: 2\\nprint(solution.calculate(\\\" 2-1 + 2 \\\")) # Output: 3\\nprint(solution.calculate(\\\"(1+(4+5+2)-3)+(6+8)\\\")) # Output: 23\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n\\n\\n stack = []\\n operand = 0\\n res = 0 # For the on-going result\\n sign = 1 # 1 means positive, -1 means negative \\n\\n\\n for ch in s:\\n if ch.isdigit():\\n\\n\\n # Forming operand, since it could be more than one digit\\n operand = (operand * 10) + int(ch)\\n\\n\\n elif ch == '+':\\n\\n\\n # Evaluate the expression to the left,\\n # with result, sign, operand\\n res += sign * operand\\n\\n\\n # Save the recently encountered '+' sign\\n sign = 1\\n\\n\\n # Reset operand\\n operand = 0\\n\\n\\n elif ch == '-':\\n\\n\\n res += sign * operand\\n sign = -1\\n operand = 0\\n\\n\\n elif ch == '(':\\n\\n\\n # Push the result and sign on to the stack, for later\\n # We push the result first, then sign\\n stack.append(res)\\n stack.append(sign)\\n\\n\\n # Reset operand and result, as if new evaluation begins for the new sub-expression\\n sign = 1\\n res = 0\\n\\n\\n elif ch == ')':\\n\\n\\n # Evaluate the expression to the left\\n # with result, sign and operand\\n res += sign * operand\\n\\n\\n # ')' marks end of expression within a set of parenthesis\\n # Its result is multiplied with sign on top of stack\\n # as stack.pop() is the sign before the parenthesis\\n res *= stack.pop() # stack pop 1, sign\\n\\n\\n # Then add to the next operand on the top.\\n # as stack.pop() is the result calculated before this parenthesis\\n # (operand on stack) + (sign on stack * (result from parenthesis))\\n res += stack.pop() # stack pop 2, operand\\n\\n\\n # Reset the operand\\n operand = 0\\n\\n\\n return res + sign * operand\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n stack = []\\n num = 0\\n sign = 1\\n res = 0\\n for ch in s:\\n if ch.isdigit():\\n num = num *10 + int(ch)\\n elif ch in '+-':\\n res += num*sign\\n sign = -1 if ch == '-' else 1\\n num = 0\\n elif ch == '(':\\n stack.append(res)\\n stack.append(sign)\\n res = 0\\n sign = 1\\n elif ch == ')':\\n res += sign * num\\n res *= stack.pop()\\n res += stack.pop()\\n num = 0\\n return res + sign * num\\n\\n \\n\\n \",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(' ', '')\\n stack = []\\n num, prev, sign = 0, 0, '+' #initialize sign as +, prev as 0\\n for idx in range(len(s)):\\n if s[idx].isdigit():\\n num = num*10 + int(s[idx])\\n continue\\n if s[idx] in ('+', '-'): #sum to previous and update sign\\n prev = prev+num if sign == '+' else prev-num \\n sign = s[idx]\\n elif s[idx] == '(': #push to stack and reset sign and prev\\n stack.append([prev, sign])\\n sign = '+'\\n prev = 0\\n elif s[idx] == ')':\\n prev = prev+num if sign == '+' else prev-num \\n num, sign = stack.pop()\\n prev *= [1,-1][sign=='-']\\n prev += num\\n num = 0\\n return prev+num if sign == '+' else prev-num \",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n output, cur, sign, stack = 0, 0, 1, []\\n \\n for c in s:\\n if c.isdigit():\\n cur = cur * 10 + int(c)\\n elif c in \\\"+-\\\":\\n output += (cur * sign)\\n cur = 0\\n if c == \\\"-\\\":\\n sign = -1\\n else:\\n sign = 1\\n elif c == \\\"(\\\":\\n stack.append(output)\\n stack.append(sign)\\n output = 0\\n sign = 1\\n elif c == \\\")\\\":\\n output += (cur * sign)\\n output *= stack.pop()\\n output += stack.pop()\\n cur = 0\\n return output + (cur * sign)\\n\\n\\n\\n \",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n num = 0\\n sign = 1\\n res = 0\\n stack = []\\n for i in range(len(s)):\\n c = s[i]\\n if c.isdigit():\\n num = num * 10 + int(c)\\n elif c == \\\"-\\\" or c == \\\"+\\\":\\n res += num * sign\\n sign = -1 if c == \\\"-\\\" else 1\\n num = 0\\n elif c == \\\"(\\\":\\n stack.append(res)\\n stack.append(sign)\\n res = 0\\n sign = 1\\n elif c == \\\")\\\":\\n res += sign * num\\n res *= stack.pop()\\n res += stack.pop()\\n num = 0\\n return res + num * sign\\n\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n # n = iter(range(0, 10))\\n def calculate(self, s: str) -> int:\\n return self.recur(s.replace(' ', ''), 0)[1]\\n\\n def recur(self, s: str, index: int):\\n # n = next(self.n)\\n stack = []\\n continuous_number = False\\n negative_state = False\\n while index < len(s):\\n symbol = s[index]\\n if symbol.isdigit():\\n if continuous_number:\\n stack[-1] += symbol\\n else:\\n stack.append(symbol)\\n continuous_number = True\\n else:\\n if symbol == '-':\\n if s[index + 1].isdigit():\\n stack.append('-' + s[index + 1])\\n index += 1\\n continuous_number = True\\n else:\\n negative_state = not negative_state\\n continuous_number = False\\n elif symbol == '(':\\n index, res = self.recur(s, index + 1)\\n stack.append(res * (-(2 * negative_state - 1)))\\n negative_state = False\\n continuous_number = False\\n elif symbol == ')':\\n # print(sum(list(map(int, stack))))\\n return index, sum(list(map(int, stack)))\\n else:\\n continuous_number = False\\n index += 1\\n # print(n, stack)\\n\\n return index, sum(map(int, stack))\\n\\n\\n# print(Solution().calculate(\\\"2-4-(8+2-6+(8+4-(1)+8-10))\\\"))\\n# # print('\\\\')\\n# print(Solution().calculate(\\\"(1+(4+5+2)-3)+(6+8)\\\")[1])\\n# (exec(\\\"print((1+(4+5+2)-3)+(6+8))\\\"))\\n# print(Solution().calculate(\\\"2-1 - 2\\\"))[1]\\n\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n \\\"\\\"\\\"\\n 1. Take 3 containers:\\n num -> to store current num value only\\n sign -> to store sign value, initially +1\\n res -> to store sum\\n When ( comes these containers used for calculate sum of intergers within () brackets.\\n --------------------\\n 2. When c is + or -\\n Move num to res, because we need to empty num for next integer value.\\n set num = 0\\n sign = update with c\\n --------------------\\n 3. When c is '('\\n Here, we need num, res, sign to calculate sum of integers within ()\\n So, move num and sign to stack => [num, sign]\\n Now reset - res = 0, num = 0, sign = 1 (default)\\n --------------------\\n 4. When c is ')' -> 2-(3+4), Here res=3, num=4, sign=1 stack [2, -] \\n res +=sign*num -> calculate sum for num first, then pop items from stack, res=7\\n res *=stack.pop() - > Pop sign(+ or -) to multiply with res, res = 7*(-1)\\n res +=stack.pop() - > Pop integer and add with prev. sum, res = -7 + 2 - 5\\n --------------------\\n Simple Example: 2 - 3\\n Initially res will have 2,i.e. res = 2\\n then store '-' in sign. it will be used when 3 comes. ie. sign = -1\\n Now 3 comes => res = res + num*sign\\n Return statement: res+num*sign => res = 2 + 3(-1) = 2 - 3 = -1\\n \\\"\\\"\\\"\\n num = 0\\n sign = 1\\n res = 0\\n stack = []\\n for i in range(len(s)): # iterate till last character\\n c = s[i]\\n if c.isdigit(): # process if there is digit\\n num = num*10 + int(c) # for consecutive digits 98 => 9x10 + 8 = 98\\n elif c in '-+': # check for - and +\\n res += num*sign\\n sign = -1 if c == '-' else 1\\n num = 0\\n elif c == '(':\\n stack.append(res)\\n stack.append(sign)\\n res = 0\\n sign = 1\\n elif c == ')':\\n res +=sign*num\\n res *=stack.pop()\\n res +=stack.pop()\\n num = 0\\n return res + num*sign\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n\\n def evaluate(stack):\\n seq = []\\n while stack :\\n if stack[-1]=='(':\\n stack.pop()\\n break\\n seq.append(stack.pop())\\n cur_Num = 0\\n sign = '+'\\n seq = seq[::-1]\\n for i in seq:\\n if i not in ['+','*','/','-']:\\n if sign == '+':\\n cur_Num += int(i)\\n elif sign == '-':\\n cur_Num -= int(i)\\n elif sign == '*':\\n cur_Num *= int(i)\\n else:\\n cur_Num /= int(i)\\n else:\\n sign = i\\n return str(cur_Num)\\n\\n\\n\\n\\n cur_dig =''\\n stack = []\\n for i in s:\\n if i.isdigit():\\n cur_dig += i\\n elif i == ' ':\\n continue\\n else:\\n if cur_dig:\\n stack.append(cur_dig)\\n cur_dig = ''\\n if i == ')':\\n newVal = evaluate(stack)\\n stack.append(newVal)\\n else:\\n stack.append(i)\\n if cur_dig :\\n stack.append(cur_dig)\\n return int(evaluate(stack))\\n \",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, expr: str) -> int:\\n #print(f'{expr=}')\\n stack: list[int] = [0]\\n sign = 1\\n i = 0\\n while i < len(expr):\\n c = expr[i]\\n #print(f'{stack=} {sign=} {c=} {expr[i:]=}')\\n if c.isdigit():\\n n = int(c)\\n start = i\\n i += 1\\n while i < len(expr) and expr[i].isdigit():\\n i += 1\\n n = int(expr[start:i])\\n #print(f'{stack=} {sign=} {n=} {expr[i:]=}')\\n stack[-1] += sign * n\\n continue\\n elif c == ' ':\\n pass\\n elif c == '+':\\n sign = 1\\n elif c == '-':\\n sign = -1\\n elif c == '(':\\n stack.append(sign)\\n stack.append(0)\\n sign = 1\\n elif c == ')':\\n n = stack.pop()\\n sign = stack.pop()\\n stack[-1] += sign * n\\n i += 1\\n assert len(stack) == 1\\n return stack.pop()\\n\",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n stack = []\\n parantheses_sign_stack = []\\n num = 0\\n sign = \\\"+\\\"\\n \\n for i in range(len(s)):\\n if s[i].isdigit():\\n num = num * 10 + int(s[i])\\n \\n if not s[i].isdigit() and not s[i].isspace() or i == len(s) - 1:\\n if s[i] == \\\")\\\":\\n count = num if sign == \\\"+\\\" else -num\\n while stack[-1] != \\\"(\\\":\\n count += stack.pop()\\n stack.pop()\\n parantheses_sign = parantheses_sign_stack.pop()\\n stack.append(count if parantheses_sign == \\\"+\\\" else -count)\\n num = 0\\n continue\\n if s[i] == \\\"(\\\":\\n stack.append(s[i])\\n parantheses_sign_stack.append(sign)\\n sign = \\\"+\\\"\\n num = 0\\n continue\\n if sign == \\\"+\\\":\\n stack.append(num)\\n if sign == \\\"-\\\":\\n stack.append(-num)\\n\\n sign = s[i]\\n num = 0\\n \\n # print(\\\"stack: {}, parantheses_sign_stack: {}, num: {}, sign: {}\\\".format(stack, parantheses_sign_stack, num, sign))\\n \\n return sum(stack)\\n \\n\\n \\n\",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n stack = []\\n parantheses_sign_stack = []\\n num = 0\\n sign = \\\"+\\\"\\n \\n for i in range(len(s)):\\n if s[i].isdigit():\\n num = num * 10 + int(s[i])\\n \\n if not s[i].isdigit() and not s[i].isspace() or i == len(s) - 1:\\n if s[i] == \\\")\\\":\\n count = num if sign == \\\"+\\\" else -num\\n while stack[-1] != \\\"(\\\":\\n count += stack.pop()\\n stack.pop()\\n parantheses_sign = parantheses_sign_stack.pop()\\n stack.append(count if parantheses_sign == \\\"+\\\" else -count)\\n num = 0\\n continue\\n if s[i] == \\\"(\\\":\\n stack.append(s[i])\\n parantheses_sign_stack.append(sign)\\n sign = \\\"+\\\"\\n num = 0\\n continue\\n if sign == \\\"+\\\":\\n stack.append(num)\\n if sign == \\\"-\\\":\\n stack.append(-num)\\n\\n sign = s[i]\\n num = 0\\n \\n # print(\\\"stack: {}, parantheses_sign_stack: {}, num: {}, sign: {}\\\".format(stack, parantheses_sign_stack, num, sign))\\n \\n return sum(stack)\\n \\n\\n \\n\",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(\\\" \\\", \\\"\\\")\\n print(s)\\n q = deque()\\n\\n i = 0\\n curr_v = 0\\n curr_op = \\\"+\\\"\\n while i < len(s):\\n if s[i].isnumeric():\\n num, i = self.parse_number(s, i)\\n if curr_op == \\\"+\\\":\\n curr_v += num\\n elif curr_op == \\\"-\\\":\\n curr_v -= num\\n else:\\n if s[i] == \\\"(\\\":\\n q.append(str(curr_v) + curr_op)\\n curr_v = 0\\n curr_op = \\\"+\\\"\\n elif s[i] == \\\")\\\":\\n prev_raw = q.pop()\\n prev_n = int(prev_raw[:-1])\\n prev_op = prev_raw[-1]\\n if prev_op == \\\"+\\\":\\n curr_v += prev_n\\n elif prev_op == \\\"-\\\":\\n curr_v = prev_n - curr_v\\n else:\\n curr_op = s[i]\\n i += 1\\n\\n return curr_v\\n\\n\\n def parse_number(self, s: str, i: int) -> tuple[int, int]:\\n j = i\\n while j < len(s) and s[j].isnumeric():\\n j += 1\\n return (int(s[i:j]), j)\\n\",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n\\n return Expression.evaluate(statement=s)\\n\\n\\nclass Expression:\\n\\n # Used dictionaries for a quicker lookup reference\\n NON_DIGITS = {\\\"(\\\", \\\")\\\", \\\"-\\\", \\\"+\\\"}\\n OPERATORS = {\\\"-\\\", \\\"+\\\"}\\n \\n @classmethod\\n def evaluate(cls, statement: str):\\n statement = statement.replace(\\\" \\\", \\\"\\\")\\n\\n position = 0\\n\\n position, result = cls._evaluate(statement, position)\\n\\n return result\\n\\n @classmethod\\n def _evaluate(cls, statement: str, position: int) -> tuple[int, list[int | str]]:\\n stack = []\\n partial_number = []\\n\\n while position < len(statement):\\n token = statement[position]\\n position += 1\\n\\n if partial_number and (token in cls.NON_DIGITS):\\n operand = int(\\\"\\\".join(partial_number))\\n partial_number.clear()\\n cls._push_operand(operand=operand, stack=stack)\\n\\n match token:\\n case \\\"(\\\":\\n position, operand = cls._evaluate(\\n statement=statement, position=position\\n )\\n cls._push_operand(operand=operand, stack=stack)\\n case \\\")\\\":\\n return position, stack[0]\\n case \\\"+\\\" | \\\"-\\\":\\n stack.append(token)\\n case _:\\n partial_number.append(token)\\n\\n if partial_number:\\n operand = int(\\\"\\\".join(partial_number))\\n cls._push_operand(operand=operand, stack=stack)\\n\\n return position, stack[0]\\n\\n @classmethod\\n def _push_operand(cls, operand: int | None, stack: list[int | str]):\\n\\n if (len(stack) == 1) and (stack[-1] == \\\"-\\\"):\\n # this is an edge case for a negative value\\n stack[-1] = operand * -1\\n\\n elif (len(stack) > 1) and (stack[-1] in cls.OPERATORS):\\n operator = stack.pop()\\n\\n # No need to pop the operand off, when I can reference and update it in place\\n if operator == \\\"+\\\":\\n stack[-1] += operand\\n\\n else:\\n stack[-1] -= operand\\n\\n else:\\n stack.append(operand)\\n\",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s):\\n def update(op, v):\\n if op == \\\"+\\\": stack.append(v)\\n if op == \\\"-\\\": stack.append(-v)\\n if op == \\\"*\\\": stack.append(stack.pop() * v) #for BC II and BC III\\n if op == \\\"/\\\": stack.append(int(stack.pop() / v)) #for BC II and BC III\\n \\n it, num, stack, sign = 0, 0, [], \\\"+\\\"\\n \\n while it < len(s):\\n if s[it].isdigit():\\n num = num * 10 + int(s[it])\\n elif s[it] in \\\"+-*/\\\":\\n update(sign, num)\\n num, sign = 0, s[it]\\n elif s[it] == \\\"(\\\": # For BC I and BC III\\n num, j = self.calculate(s[it + 1:])\\n print(num, j)\\n it = it + j\\n elif s[it] == \\\")\\\": # For BC I and BC III\\n update(sign, num)\\n return sum(stack), it + 1\\n it += 1\\n update(sign, num)\\n return sum(stack)\",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n\\n return Expression.evaluate(statement=s)\\n\\n\\nclass Expression:\\n\\n # Used dictionaries for a quicker lookup reference\\n NON_DIGITS = {\\\"(\\\", \\\")\\\", \\\"-\\\", \\\"+\\\"}\\n OPERATORS = {\\\"-\\\", \\\"+\\\"}\\n \\n @classmethod\\n def evaluate(cls, statement: str):\\n statement = statement.replace(\\\" \\\", \\\"\\\")\\n\\n position = 0\\n\\n position, result = cls._evaluate(statement, position)\\n\\n return result\\n\\n @classmethod\\n def _evaluate(cls, statement: str, position: int) -> tuple[int, list[int | str]]:\\n stack = []\\n partial_number = []\\n\\n while position < len(statement):\\n token = statement[position]\\n position += 1\\n\\n if (token in cls.NON_DIGITS) and partial_number:\\n operand = int(\\\"\\\".join(partial_number))\\n partial_number.clear()\\n cls._push_operand(operand=operand, stack=stack)\\n\\n match token:\\n case \\\"(\\\":\\n position, operand = cls._evaluate(\\n statement=statement, position=position\\n )\\n cls._push_operand(operand=operand, stack=stack)\\n case \\\")\\\":\\n return position, stack[0]\\n case \\\"+\\\" | \\\"-\\\":\\n stack.append(token)\\n case _:\\n partial_number.append(token)\\n\\n if partial_number:\\n operand = int(\\\"\\\".join(partial_number))\\n cls._push_operand(operand=operand, stack=stack)\\n\\n return position, stack[0]\\n\\n @classmethod\\n def _push_operand(cls, operand: int | None, stack: list[int | str]):\\n\\n if (len(stack) == 1) and (stack[-1] == \\\"-\\\"):\\n # this is an edge case for a negative value\\n stack[-1] = operand * -1\\n\\n elif (len(stack) > 1) and (stack[-1] in cls.OPERATORS):\\n operator = stack.pop()\\n\\n # No need to pop the operand off, when I can reference and update it in place\\n if operator == \\\"+\\\":\\n stack[-1] += operand\\n\\n else:\\n stack[-1] -= operand\\n\\n else:\\n stack.append(operand)\\n\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n\\n _, stack = Expression().evaluate(statement=s)\\n return stack[0]\\n\\n\\nclass Expression:\\n\\n # Used dictionaries for a quicker lookup reference\\n NON_DIGITS = {\\\"(\\\", \\\")\\\", \\\"-\\\", \\\"+\\\", \\\" \\\"}\\n OPERATORS = {\\\"-\\\", \\\"+\\\"}\\n\\n def evaluate(\\n self, statement: str, position: int = 0\\n ) -> tuple[int, list[int | str]]:\\n stack = []\\n number_starts_at = None\\n\\n\\n while position < len(statement):\\n token = statement[position]\\n\\n if (token in self.NON_DIGITS) and (number_starts_at is not None):\\n operand = int(statement[number_starts_at:position])\\n number_starts_at = None\\n self._push_operand(operand=operand, stack=stack)\\n\\n if token == \\\" \\\":\\n pass\\n\\n elif token == \\\"(\\\":\\n position, operand = self.evaluate(\\n statement=statement, position=position+1\\n )\\n self._push_operand(operand=operand, stack=stack)\\n \\n elif token == \\\")\\\":\\n return position, stack[0]\\n \\n elif token in self.OPERATORS:\\n stack.append(token)\\n \\n elif number_starts_at is None:\\n number_starts_at = position\\n\\n position+=1\\n\\n if (number_starts_at is not None):\\n operand = int(statement[number_starts_at:])\\n self._push_operand(operand=operand, stack=stack)\\n\\n return position, stack\\n\\n def _push_operand(self, operand: int | None, stack: list[int | str]):\\n\\n if stack:\\n if stack[0] == \\\"-\\\":\\n # this is an edge case for a negative value\\n stack[-1] = operand * -1\\n\\n elif (stack[-1] in self.OPERATORS):\\n operator = stack.pop()\\n\\n # No need to pop the operand off, when I can reference and update it in place\\n if operator == \\\"+\\\":\\n stack[-1] += operand\\n\\n else:\\n stack[-1] -= operand\\n\\n else:\\n stack.append(operand)\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n op_prios = {\\n \\\"+\\\": 1,\\n \\\"-\\\": 1,\\n \\\"*\\\": 2,\\n \\\"/\\\": 2,\\n }\\n\\n op_funcs = {\\n \\\"+\\\": operator.add,\\n \\\"-\\\": operator.sub,\\n \\\"*\\\": operator.mul,\\n \\\"/\\\": lambda x, y: x // y if x * y > 0 else -(abs(x) // abs(y)),\\n }\\n\\n stack = []\\n rpn = []\\n\\n for i, c in enumerate(s):\\n if c.isspace():\\n continue\\n\\n if c.isnumeric():\\n if i - 1 >= 0 and s[i - 1].isnumeric():\\n rpn[-1] += c\\n else:\\n rpn.append(c)\\n continue\\n\\n if c == '(':\\n stack.append(c)\\n continue\\n\\n if c == ')':\\n while stack and stack[-1] != '(':\\n rpn.append(stack.pop())\\n stack.pop()\\n continue\\n\\n if c == '-':\\n prev_c = None\\n for j in range(i - 1, -1, -1):\\n if s[j] != ' ':\\n prev_c = s[j]\\n break\\n if not prev_c or prev_c == '(':\\n rpn.append(\\\"0\\\")\\n \\n # 弹出优先级更高的操作\\n while stack and stack[-1] != '(' and op_prios[stack[-1]] >= op_prios[c]:\\n rpn.append(stack.pop())\\n \\n stack.append(c)\\n \\n while stack:\\n rpn.append(stack.pop())\\n\\n print(f\\\"{rpn}\\\")\\n\\n vals = []\\n for token in rpn:\\n if token.isnumeric():\\n vals.append(int(token))\\n continue\\n \\n rhs = vals.pop()\\n lhs = vals.pop()\\n vals.append(op_funcs[token](lhs, rhs))\\n\\n return vals[0]\\n\\n \\n \\n \",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n stack = []\\n\\n j = 0\\n while j < len(s):\\n if s[j] == \\\" \\\":\\n j += 1\\n elif s[j].isnumeric():\\n d = 0\\n while s[j:j+d+1].isnumeric() and j+d <= len(s):\\n d += 1\\n num = int(s[j:j+d])\\n j += d \\n\\n if stack and stack[-1] == '+':\\n stack.pop(-1)\\n prev = stack.pop(-1)\\n stack.append(prev + num)\\n elif stack and stack[-1] == '-':\\n stack.pop(-1)\\n prev = stack.pop(-1) if stack and type(stack[-1]) == int else 0\\n if type(prev) == int:\\n stack.append(prev - num)\\n\\n else:\\n stack.append(num)\\n elif s[j] in \\\"+-(\\\":\\n stack.append(s[j])\\n j += 1\\n elif s[j] == ')':\\n num = stack.pop(-1) #should be a number?\\n temp = stack.pop(-1) # should be '('\\n\\n if stack and stack[-1] == '+':\\n stack.pop(-1)\\n prev = stack.pop(-1)\\n stack.append(prev + num)\\n elif stack and stack[-1] == '-':\\n stack.pop(-1)\\n prev = stack.pop(-1) if stack and type(stack[-1]) == int else 0\\n stack.append(prev - num)\\n elif not stack:\\n stack.append(num)\\n j += 1\\n\\n return stack[0]\\n\\n \",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n idx=0\\n stack=[]\\n s=s.strip().replace(' ','')\\n def getNextInt():\\n nonlocal idx\\n i=idx\\n while i<len(s) and s[i].isdigit():\\n i+=1\\n res=int(s[idx:i])\\n idx=i\\n return res\\n def getNext():\\n nonlocal idx,stack\\n if idx<len(s):\\n if s[idx]==' ':\\n idx+=1\\n return 0\\n elif s[idx].isdigit():\\n stack.append(getNextInt())\\n return 1\\n elif s[idx]=='+' or s[idx]=='-':\\n if s[idx]=='-' and (idx==0 or s[idx-1]=='('):\\n idx+=1\\n getNext()\\n stack.append('*')\\n return 1\\n else:\\n op=s[idx]\\n idx+=1\\n getNext()\\n stack.append(op)\\n return 2\\n else:\\n if s[idx]=='(':\\n idx+=1\\n while getNext()!=4:\\n pass\\n return 3\\n else:\\n idx+=1\\n return 4\\n return 5\\n while idx<len(s):\\n getNext()\\n opStack=[]\\n def cal():\\n nonlocal stack,opStack\\n op=stack.pop()\\n num1,num2=None,None\\n if not isinstance(stack[-1],int):\\n cal()\\n num1=stack.pop()\\n if op=='*':\\n stack.append(-num1)\\n return\\n if not isinstance(stack[-1],int):\\n cal()\\n num2=stack.pop()\\n if op==\\\"+\\\":\\n stack.append(num1+num2)\\n elif op=='-':\\n stack.append(num2-num1)\\n if len(stack)>1:\\n cal()\\n return stack[-1]\",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n s = '(' + s + ')'\\n p_stk = [0]\\n stk = []\\n num = 0\\n num_used = False\\n for c in s:\\n if c.isdigit():\\n num *= 10\\n num += int(c)\\n num_used = True\\n else:\\n if num_used:\\n stk.append(num)\\n num = 0\\n num_used = False\\n if c == '(':\\n p_stk.append(len(stk))\\n stk.append('(')\\n elif c == '+':\\n stk.append(c)\\n elif c == '-':\\n if not stk or type(stk[-1]) != int:\\n stk.append(0)\\n stk.append(c)\\n elif c == ')':\\n st = p_stk[-1] + 1\\n comp = stk[st]\\n for i in range(st + 1,len(stk),2):\\n if stk[i] == '+':\\n comp += stk[i+1]\\n else:\\n comp -= stk[i+1]\\n stk = stk[:st-1]\\n stk.append(comp)\\n p_stk.pop()\\n return stk[0]\\n \\n\\n \\n\",\n \"runtime\": \"147\"\n },\n {\n \"code\": \"class Solution:\\n def compute(self, s: str) -> int:\\n # compute some lst without parentheses\\n print(s)\\n return sum(int(num) for num in s.replace('-', '+-').split('+') if len(num) != 0)\\n\\n def calculate(self, s: str) -> int:\\n # ignore parentheses other than unary -\\n dense = s.replace(' ', '')\\n stack = []\\n for c in dense:\\n if c != ')':\\n stack.append(c)\\n else:\\n open_paren_idx = len(stack) - 1\\n while stack[open_paren_idx] != '(':\\n open_paren_idx -= 1\\n result = self.compute(''.join(stack[open_paren_idx + 1:]))\\n if open_paren_idx > 0 and stack[open_paren_idx - 1] == '-':\\n result = -result\\n stack[open_paren_idx - 1] = '+'\\n stack = stack[:open_paren_idx]\\n stack.append(str(result))\\n return self.compute(''.join(stack))\",\n \"runtime\": \"147\"\n },\n {\n \"code\": \"class Solution:\\n def parser(self, s):\\n tokens = []\\n ptr = 0\\n currnum = 0\\n num_str = set([str(i) for i in range(10)])\\n\\n while ptr < len(s):\\n if s[ptr] == ' ':\\n ptr += 1\\n continue\\n if s[ptr] in num_str:\\n currnum = currnum * 10 + int(s[ptr])\\n elif currnum > 0:\\n tokens.append(currnum)\\n tokens.append(s[ptr])\\n currnum = 0\\n else:\\n tokens.append(s[ptr])\\n ptr += 1\\n if currnum > 0:\\n tokens.append(currnum)\\n\\n return tokens\\n\\n def calculate(self, s: str) -> int:\\n tokens = self.parser(s)\\n q = deque(tokens)\\n q.appendleft('(')\\n q.append(')')\\n return self.calc_expression(q)\\n \\n def calc_expression(self, q):\\n q.popleft()\\n ans = 0\\n sign = 1\\n while q and q[0] != ')':\\n print(q[0])\\n if q[0] == '-':\\n sign = -1\\n elif q[0] == '+':\\n sign = 1\\n elif q[0] == '(':\\n ans += self.calc_expression(q) * sign\\n q.popleft()\\n continue\\n else:\\n ans += q[0] * sign\\n sign = 1\\n q.popleft()\\n\\n return ans\\n\",\n \"runtime\": \"155\"\n },\n {\n \"code\": \"class Solution:\\n def calcPeace(self, s, start, end):\\n p=s[start+1:end]\\n while(p.find('--') != -1):\\n p=p.replace('--','+')\\n p=p.replace('++','+')\\n if p[0]=='+':\\n p=p[1:]\\n #print(p)\\n pos=p.split(\\\"+\\\")\\n neg=list(map(lambda x: x.split('-'),pos))\\n for i in range(len(neg)):\\n for j in range(len(neg[i])):\\n if neg[i][j]=='':\\n #print(s,p,i)\\n neg[i][j+1]='-'+neg[i][j+1]\\n #del neg[i][j]\\n neg[i] = [j for j in neg[i]if j != '' ]\\n print(neg[i])\\n neg[i]=list(map(lambda x: int(x), neg[i]))\\n #print(neg[i])\\n neg[i]=neg[i][0]-sum(neg[i][1:])\\n #print(neg[i])\\n #print(neg)\\n #print(sum(neg))\\n return sum(neg)\\n\\n\\n def openBrakets(self,s):\\n #res=[]\\n #current=\\\"\\\"\\n closeIdx=s.find(')')\\n if closeIdx == -1:\\n #print('no brakets')\\n return self.calcPeace(s, -1, len(s))\\n openIdx = s.rfind('(', 0,closeIdx)\\n #print(s, openIdx,closeIdx)\\n res=self.calcPeace(s, openIdx, closeIdx)\\n left=right=\\\"\\\"\\n if(openIdx > 0):\\n left = s[:openIdx]\\n mid=str(res)\\n if closeIdx < len(s)-1:\\n right=s[closeIdx+1:]\\n #print(\\\"left+mid+right\\\",left+mid+right)\\n return self.openBrakets(left+mid+right)\\n \\n\\n \\n def calculate(self, s: str) -> int:\\n s=s.replace(' ','')\\n res=self.openBrakets(s)\\n #print(res)\\n return res\\n\\n\\n \",\n \"runtime\": \"155\"\n },\n {\n \"code\": \"class Reader:\\n def __init__(self, s: str):\\n self.s = s\\n self.i = 0\\n def getNext(self):\\n self.i = min(self.i+1, len(self.s))\\n def getCurrent(self) -> str:\\n if self.i == len(self.s):\\n return \\\"\\\"\\n return self.s[self.i]\\n\\nclass Lexer:\\n def __init__(self, r: Reader):\\n self.r = r\\n self.current = \\\"BEGIN\\\"\\n self.getNext()\\n def getNext(self):\\n if self.current == \\\"END\\\":\\n return\\n s = self.r.getCurrent()\\n while s == ' ':\\n self.r.getNext()\\n s = self.r.getCurrent()\\n if s in {'+', '-', '(', ')'}:\\n self.current = s\\n self.r.getNext()\\n return\\n if s == '':\\n self.current = \\\"END\\\"\\n return\\n num = 0\\n while s.isdigit():\\n num *= 10\\n num += int(s)\\n self.r.getNext()\\n s = self.r.getCurrent()\\n self.current = num\\n def getCurrent(self) -> str:\\n return self.current\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n stack = []\\n r = Reader(s)\\n l = Lexer(r)\\n token = l.getCurrent()\\n while token != \\\"END\\\":\\n if token in {'+', '-', '('}:\\n stack.append(token)\\n elif token == ')':\\n b = stack.pop()\\n stack.pop() # '('\\n if stack and stack[-1] == '+':\\n stack.pop()\\n a = stack.pop()\\n stack.append(a+b)\\n elif stack and stack[-1] == '-':\\n stack.pop()\\n if stack and isinstance(stack[-1], int):\\n a = stack.pop()\\n stack.append(a-b)\\n else:\\n stack.append(-b)\\n else:\\n stack.append(b)\\n else:\\n if stack and stack[-1] == '+':\\n stack.pop()\\n a = stack.pop()\\n stack.append(a+token)\\n elif stack and stack[-1] == '-':\\n stack.pop()\\n if stack and isinstance(stack[-1], int):\\n a = stack.pop()\\n stack.append(a-token)\\n else:\\n stack.append(-token)\\n else:\\n stack.append(token)\\n l.getNext()\\n token = l.getCurrent()\\n if not stack:\\n return 0\\n return stack[-1]\",\n \"runtime\": \"164\"\n },\n {\n \"code\": \"class EvaluateString:\\n def evaluate(self, expr: str) -> int:\\n # For expressions containing unary operation, e.g., \\\"1-(-2)\\\", insert 0 to the `values` stack before \\\"-\\\" only\\n # if '-' is the first character, or we see \\\"(\\\" before \\\"-\\\".\\n # NOTE: need to remove white spaces first in order for the above check to work.\\n expr = expr.replace(' ', '')\\n\\n # Associativity constants for operators\\n LEFT_ASSOC = 0\\n RIGHT_ASSOC = 1\\n\\n # Supported operators. NOTE: \\\"()\\\" are not operators.\\n op_info = {\\n \\\"+\\\": (0, LEFT_ASSOC, lambda a, b: a + b),\\n \\\"-\\\": (0, LEFT_ASSOC, lambda a, b: a - b),\\n \\\"*\\\": (5, LEFT_ASSOC, lambda a, b: a * b),\\n \\\"/\\\": (5, LEFT_ASSOC, lambda a, b: a // b),\\n \\\"%\\\": (5, LEFT_ASSOC, lambda a, b: a % b),\\n \\\"^\\\": (10, RIGHT_ASSOC, lambda a, b: a ** b)\\n }\\n\\n def isOperator(token):\\n return token in op_info\\n\\n def isAssociative(token, assoc_type):\\n if token not in op_info:\\n raise ValueError(f\\\"Invalid token: {token}\\\")\\n return op_info[token][1] == assoc_type\\n\\n def cmpPrecedence(token1, token2):\\n if token1 not in op_info or token2 not in op_info:\\n raise ValueError(f\\\"Invalid tokens: {token1} {token2}\\\")\\n return op_info[token1][0] - op_info[token2][0]\\n\\n def applyOp(op: str, b: int, a: int) -> int:\\n fn = op_info[op][2]\\n return fn(a, b)\\n\\n\\n # Stack for numbers: 'values'\\n values = []\\n # Stack for Operators: 'ops'\\n ops = []\\n\\n i = 0\\n while i < len(expr):\\n if expr[i] == ' ':\\n i += 1\\n continue\\n\\n # Take care of unary operation, e.g., \\\"1-(-2)\\\".\\n if expr[i] == '-' and (i == 0 or expr[i - 1] == '('):\\n values.append(0)\\n\\n # Current token is a number, push it to stack for numbers\\n if expr[i].isdigit():\\n num = 0\\n # There may be more than one digits in number\\n while i < len(expr) and expr[i].isdigit():\\n num = num * 10 + int(expr[i])\\n i += 1\\n values.append(num)\\n continue\\n\\n if expr[i] == '(':\\n ops.append(expr[i])\\n i += 1\\n continue\\n\\n # Closing brace encountered, solve entire brace.\\n # NOTE: though we are solving the entire sub-expression inside \\\"()\\\", it might not\\n # be the actual sub-expression from the input. E.g., for \\\"(2+3-5)\\\", when we are at \\\"-\\\",\\n # we already go through the branch `if expr[i] in \\\"+-*/\\\"`, and reduced the expression to\\n # `(5-5)`.\\n if expr[i] == ')':\\n while ops and ops[-1] != '(':\\n values.append(applyOp(ops.pop(), values.pop(), values.pop()))\\n ops.pop() # pop \\\"(\\\"\\n i += 1\\n continue\\n\\n # Current token is an operator.\\n if isOperator(expr[i]):\\n # isOperator() helps us stop when we see \\\"(\\\".\\n while (ops and isOperator(ops[-1]) and\\n ((isAssociative(expr[i], LEFT_ASSOC) and cmpPrecedence(expr[i], ops[-1]) <= 0) or\\n (isAssociative(expr[i], RIGHT_ASSOC) and cmpPrecedence(expr[i], ops[-1]) < 0))):\\n values.append(applyOp(ops.pop(), values.pop(), values.pop()))\\n ops.append(expr[i])\\n i += 1\\n\\n # Entire expression has been parsed at this point, apply remaining\\n # ops to remaining values\\n while ops:\\n values.append(applyOp(ops.pop(), values.pop(), values.pop()))\\n\\n # Top of 'values' contains the result, return it\\n return values.pop()\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n evaluator = EvaluateString()\\n return evaluator.evaluate(s)\",\n \"runtime\": \"164\"\n },\n {\n \"code\": \"from typing import Literal\\nimport math\\n\\n\\nToken = Literal['-', '+', '/', '*', '(', ')'] | int\\n\\nclass Evaluator:\\n def __init__(self, expression: str):\\n self.tokens = self.tokenize(expression)\\n self.len = len(self.tokens)\\n self.idx = 0\\n\\n @staticmethod\\n def tokenize(expr: str) -> list[Token]:\\n tokens = []\\n for i, char in enumerate(expr):\\n match char:\\n case ' ':\\n continue\\n case op if op in ['-', '+', '/', '*', '(', ')']:\\n if op in ['+', '-'] and (i == 0 or tokens[-1] in ['+', '/', '*', '-', '(']):\\n # Normalize unary '-' to -1 * for simplicity\\n if op == '-':\\n tokens.extend([-1, '*'])\\n continue\\n tokens.append(op)\\n case d if d.isdigit():\\n n = int(d)\\n last_token = tokens[-1] if tokens else None\\n if not last_token or not isinstance(last_token, int):\\n tokens.append(n)\\n continue\\n tokens[-1] = last_token * 10 + n\\n case unexpected:\\n raise SyntaxError(f\\\"Invalid token '{unexpected}' encountered\\\")\\n print(f\\\"tokenized: {tokens}\\\")\\n return tokens\\n\\n def peek(self) -> Token | None:\\n return self.tokens[self.idx] if self.idx < self.len else None\\n\\n def next(self) -> Token:\\n next = self.peek()\\n assert next is not None, \\\"Next called on exhausted token pool\\\"\\n self.idx += 1\\n return next\\n\\n\\n def evaluate(self) -> int:\\n return self.eval_l0()\\n\\n def eval_l0(self) -> int:\\n \\\"Eval rule <expr>([+-]<expr>)?\\\"\\n lhs = self.eval_l1()\\n while self.peek() in ['+', '-']:\\n op = self.next()\\n rhs = self.eval_l1()\\n match op:\\n case '+':\\n lhs += rhs\\n case '-':\\n lhs -= rhs\\n case _:\\n assert False\\n return lhs\\n\\n\\n def eval_l1(self) -> int:\\n \\\"Eval rule <expr>([*/]<expr>)?\\\"\\n lhs = self.eval_l2()\\n while self.peek() in ['*', '/']:\\n op = self.next()\\n rhs = self.eval_l2()\\n match op:\\n case '*':\\n lhs *= rhs\\n case '/':\\n lhs /= rhs # TODO: truncate to zero\\n case _:\\n assert False\\n # Truncate towards 0\\n is_negative = lhs < 0\\n lhs = math.floor(abs(lhs)) * (-1 if is_negative else 1)\\n return lhs\\n\\n def eval_l2(self) -> int:\\n \\\"Eval rule <digit> | (<expr>)\\\"\\n if self.peek() in [None, ')']:\\n return 0\\n\\n match self.next():\\n case '(':\\n subexpr = self.evaluate()\\n if (next := self.next()) != ')':\\n raise SyntaxError(f\\\"')' expected, got {next} at idx={self.idx-1} @ {self.tokens[self.idx - 1]}\\\")\\n return subexpr\\n\\n case n if isinstance(n, int):\\n return n\\n\\n case token:\\n raise SyntaxError(f\\\"Unexpected token '{token}' @ idx={self.idx - 1}\\\")\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n e = Evaluator(s)\\n return e.evaluate()\",\n \"runtime\": \"172\"\n },\n {\n \"code\": \"def tokenize(s):\\n tokens = []\\n i = 0\\n s = s.replace(\\\" \\\", \\\"\\\")\\n n = len(s)\\n while i < n:\\n if s[i] in \\\"/*+()\\\":\\n tokens.append(s[i])\\n elif s[i].isdigit():\\n start = i\\n while (i + 1) < n and s[i+1].isdigit():\\n i += 1\\n tokens.append(int(s[start:i+1]))\\n # If an operator is the first thing in your expression\\n elif s[i] == \\\"-\\\" and i == 0:\\n tokens.append(\\\"_\\\")\\n # or comes after another operator or comes after a left parenthesis\\n elif s[i] == \\\"-\\\" and i > 0 and s[i - 1] in \\\"/*+-(\\\":\\n tokens.append(\\\"_\\\")\\n elif s[i] == \\\"-\\\":\\n tokens.append(\\\"-\\\")\\n i += 1\\n return tokens\\n\\ndef precedence(token):\\n if token in \\\"()\\\":\\n return 4\\n elif token in \\\"*/\\\":\\n return 3\\n elif token == \\\"+\\\":\\n return 2\\n elif token == \\\"-\\\":\\n return 1\\n elif token == \\\"_\\\":\\n return 0\\n\\ndef infix_to_prefix(tokens):\\n stack = []\\n output = []\\n for token in tokens:\\n if isinstance(token, int):\\n output.append(token)\\n elif token == \\\"(\\\":\\n stack.append(token)\\n elif token == \\\")\\\":\\n while stack and (t := stack.pop()) != \\\"(\\\":\\n output.append(t)\\n elif stack and precedence(token) >= precedence(stack[-1]):\\n while stack and stack[-1] and precedence(token) >= precedence(stack[-1]):\\n t = stack.pop()\\n output.append(t)\\n stack.append(token)\\n else:\\n stack.append(token)\\n while stack:\\n output.append(stack.pop())\\n return output\\n\\n\\ndef evaluate(tokens):\\n stack = []\\n operators = {\\n \\\"*\\\": lambda x, y: x * y,\\n \\\"/\\\": lambda x, y: int(x / y),\\n \\\"+\\\": lambda x, y: x + y,\\n \\\"-\\\": lambda x, y: x - y,\\n }\\n print(tokens)\\n for token in tokens:\\n if isinstance(token, int):\\n stack.append(token)\\n else:\\n if token == \\\"_\\\":\\n b = stack.pop()\\n c = -b\\n else:\\n b = stack.pop()\\n a = stack.pop()\\n c = operators[token](a, b)\\n stack.append(c)\\n return stack[0]\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n tokens = tokenize(s)\\n tokens = infix_to_prefix(tokens)\\n return evaluate(tokens)\",\n \"runtime\": \"172\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n \\n s = s+')'\\n def myeval(si):\\n # print(s[si:])\\n # if (: myeval\\n # if ): return sum(stack)\\n stack = [] \\n op = '+'\\n v = 0\\n while si<len(s):\\n print(si, s[si])\\n if s[si] == ' ': pass\\n elif s[si] in ['+','-',')']:\\n if op == '+': stack.append(v)\\n else: stack.append(-v)\\n if s[si] == ')': break\\n v = 0\\n op = s[si] \\n elif s[si] == '(': \\n si, v = myeval(si+1)\\n else: # numeric\\n v = v*10+int(s[si])\\n # print(op,v,stack)\\n si +=1\\n return si, sum(stack)\\n endi, out = myeval(0) \\n return out\",\n \"runtime\": \"181\"\n },\n {\n \"code\": \"class Solution:\\n def cal(self,l):\\n if l[0]=='-':\\n cur = -int(l[1])\\n l = l[2:]\\n else:\\n cur = int(l[0])\\n l = l[1:]\\n op = '+'\\n for i in range(len(l)):\\n if l[i].isdigit() or (len(l[i])!=1):\\n if op == '+':\\n cur += int(l[i])\\n if op == '-':\\n cur -= int(l[i])\\n else:\\n op = l[i]\\n return str(cur)\\n def calculate(self, s: str) -> int:\\n stack = []\\n i=0\\n while i < len(s):\\n if s[i] == ' ':\\n i += 1\\n continue\\n elif s[i] == ')':\\n j = len(stack)-1\\n while stack[j]!='(':\\n j-=1\\n l = stack[j+1:i]\\n stack = stack[:j]\\n stack.append(self.cal(l))\\n i+=1\\n else:\\n if s[i].isdigit():\\n c=s[i]\\n while i<len(s)-1 and s[i+1].isdigit():\\n c+=s[i+1]\\n i+=1\\n stack.append(c)\\n i += 1\\n else:\\n stack.append(s[i])\\n i+=1\\n \\n return int(self.cal(stack))\\n\",\n \"runtime\": \"181\"\n },\n {\n \"code\": \"from dataclasses import dataclass\\n\\nPRECEDENCE = {\\n \\\"+\\\": 0,\\n \\\"-\\\": 0,\\n \\\"*\\\": 1,\\n \\\"/\\\": 1,\\n}\\n\\n@dataclass\\nclass Expr:\\n op: Literal[\\\"+\\\", \\\"-\\\", \\\"*\\\", \\\"/\\\"]\\n left: Union[\\\"Expr\\\", int]\\n right: Union[\\\"Expr\\\", int]\\n\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n return self.eval_expr(self.calculate_at(s, 0)[0])\\n\\n def calculate_at(self, s: str, i: int) -> tuple[Expr, int]:\\n output_stack = []\\n operator_stack = []\\n unary_op = None\\n\\n expr = None\\n\\n while i < len(s):\\n x, i = self.token(s, i)\\n\\n if isinstance(x, int):\\n if expr is None:\\n expr = self.apply_unary_op(x, unary_op)\\n else:\\n output_stack.append(x)\\n elif x == '(':\\n x, i = self.calculate_at(s, i)\\n # print(\\\"SUBEXPR IS \\\", x)\\n if expr is None:\\n expr = self.apply_unary_op(x, unary_op)\\n else:\\n output_stack.append(x)\\n elif x == ')':\\n break\\n elif x == ' ':\\n continue\\n else:\\n # print(x)\\n p = PRECEDENCE[x]\\n if expr is None:\\n unary_op = x\\n continue\\n\\n if operator_stack and p <= PRECEDENCE[operator_stack[-1]]:\\n expr = self.build_expr(expr, output_stack, operator_stack)\\n\\n operator_stack.append(x)\\n\\n if operator_stack:\\n expr = self.build_expr(expr, output_stack, operator_stack)\\n\\n # print(expr)\\n\\n return expr, i\\n \\n def token(self, s: str, i: int) -> (str | int, int):\\n if s[i].isdigit():\\n x = 0\\n\\n while i < len(s) and s[i].isdigit():\\n x = x * 10 + int(s[i])\\n i += 1 \\n else:\\n x = s[i]\\n i += 1\\n\\n return x, i\\n\\n def build_expr(\\n self,\\n left: Expr | int,\\n output_stack: list[int | Expr],\\n operator_stack: list[str]\\n ):\\n cur_expr = output_stack.pop()\\n while len(operator_stack) > 1:\\n cur_expr = Expr(\\n op=operator_stack.pop(),\\n right=cur_expr,\\n left=output_stack.pop(),\\n )\\n\\n return Expr(\\n op=operator_stack.pop(),\\n right=cur_expr,\\n left=left,\\n )\\n\\n def combine_expr(self, a: Expr | None | int, b: Expr, op: str):\\n if a is None:\\n return b\\n\\n return Expr(\\n op,\\n a,\\n b,\\n )\\n\\n def apply_unary_op(self, expr: Expr, op: str | None) -> Expr:\\n if op:\\n return Expr(op, None, expr)\\n return expr\\n \\n def eval_expr(self, expr: Expr | int | None) -> int:\\n if expr is None:\\n return 0\\n if isinstance(expr, int):\\n return expr\\n\\n if expr.left is None:\\n a = expr.right if isinstance(expr.right, int) else self.eval_expr(expr.right)\\n return a if expr.op == \\\"+\\\" else -a\\n\\n a = expr.left if isinstance(expr.left, int) else self.eval_expr(expr.left)\\n b = expr.right if isinstance(expr.right, int) else self.eval_expr(expr.right)\\n\\n if expr.op == \\\"+\\\":\\n return a + b\\n elif expr.op == \\\"-\\\":\\n return a - b\\n elif expr.op == \\\"*\\\":\\n return a * b\\n else:\\n return a / b\",\n \"runtime\": \"189\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n stack = []\\n curr_sign = 1\\n number = 0\\n res = 0\\n n = len(s)\\n numbers_list = ['0','1','2','3','4','5','6','7','8','9']\\n\\n for char_i in range(n):\\n print(f\\\"char: {s[char_i]}, res: {res}, number: {number}, curr_sign: {curr_sign}\\\")\\n char = s[char_i]\\n if char in numbers_list:\\n number = number * 10 + int(char)\\n if char_i < n-1 and s[char_i + 1] in numbers_list:\\n continue\\n else:\\n res += number * curr_sign\\n number = 0\\n curr_sign = 1\\n elif char in \\\"+-\\\":\\n res += number * curr_sign\\n number = 0\\n curr_sign = 1 if char == \\\"+\\\" else -1\\n elif char == \\\"(\\\":\\n stack.append([res, curr_sign])\\n res = 0\\n number = 0\\n curr_sign = 1\\n elif char == \\\")\\\":\\n [recent_res, recent_sign] = stack.pop()\\n res = recent_res + res * recent_sign\\n number = 0\\n curr_sign = 1\\n return res\\n\",\n \"runtime\": \"189\"\n },\n {\n \"code\": \"class Node:\\n def __init__(self, val):\\n self.val = val\\n self.is_opr = None\\n self.is_par = None\\n self.prev = None\\n self.eval_ready = None\\n\\nclass EvalStack:\\n def __init__(self):\\n self.stack = None\\n \\n def push(self, val):\\n node = Node(val)\\n prev_is_opr = self.stack.is_opr if self.stack else None\\n if val in [\\\"+\\\", \\\"-\\\"]:\\n node.is_opr = True\\n node.is_par = False\\n elif val in [\\\"(\\\", \\\")\\\"]:\\n node.is_opr = False\\n node.is_par = True\\n else:\\n node.is_opr = False\\n node.is_par = False\\n \\n if (prev_is_opr and not node.is_opr and not node.is_par) or (val == \\\")\\\"):\\n node.eval_ready = True\\n else:\\n node.eval_ready = False\\n \\n node.prev = self.stack\\n self.stack = node\\n\\n def pop(self):\\n if not self.stack:\\n return None\\n node = self.stack\\n self.stack = self.stack.prev\\n return node.val\\n \\n def print(self):\\n point = self.stack\\n while point:\\n print(point.val,end=\\\"\\\")\\n point = point.prev\\n print()\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n def eval_opr(opr1, opr, opr2):\\n if opr == \\\"+\\\":\\n return int(opr1) + int(opr2)\\n elif opr == \\\"-\\\":\\n return int(opr1) - int(opr2)\\n else:\\n return None\\n \\n def split_exp(exp, *args):\\n output = []\\n curr = \\\"\\\"\\n prev_char = \\\"\\\"\\n for item in exp:\\n if item == \\\" \\\":\\n continue\\n if item in args and not (item == \\\"-\\\" and prev_char in [\\\"(\\\", \\\"+\\\", \\\"-\\\", \\\"\\\"]):\\n if curr:\\n output.append(curr)\\n output.append(item)\\n curr = \\\"\\\"\\n\\n elif item == \\\"-\\\" and prev_char in [\\\"(\\\", \\\"+\\\", \\\"-\\\", \\\"\\\"]:\\n output.append(\\\"0\\\")\\n output.append(\\\"-\\\")\\n else:\\n curr += item\\n prev_char = item\\n \\n if curr:\\n output.append(curr)\\n return output\\n\\n \\n tokens = split_exp(s, \\\"+\\\", \\\"-\\\", \\\"(\\\", \\\")\\\")\\n n = len(tokens)\\n evals = EvalStack()\\n\\n for i in range(n):\\n if tokens[i] == \\\" \\\" or tokens[i] == \\\"\\\":\\n continue\\n\\n evals.push(tokens[i])\\n while evals.stack.eval_ready:\\n if evals.stack.val == \\\")\\\":\\n evals.pop()\\n val = evals.pop()\\n evals.pop()\\n evals.push(val)\\n continue\\n \\n opr2 = evals.pop()\\n opr = evals.pop()\\n opr1 = evals.pop()\\n output = eval_opr(opr1, opr, opr2)\\n evals.push(output)\\n \\n return int(evals.stack.val)\\n\",\n \"runtime\": \"198\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n operands = [\\\"+\\\", \\\"-\\\", \\\"(\\\"]\\n special_char = [\\\"+\\\", \\\"-\\\", \\\"(\\\", \\\")\\\", \\\" \\\"]\\n number = []\\n operation = 1\\n total = 0\\n\\n def get_full_num(index, string):\\n full_number = string[index]\\n while index+1 < len(string) and string[index+1] not in special_char:\\n index += 1\\n full_number += string[index] \\n print(full_number)\\n return [full_number, index]\\n\\n def assess_parenthesis(index, string):\\n value = 0\\n operation_2 = 1\\n contents = []\\n index += 1\\n while index < len(string):\\n if string[index] == \\\" \\\":\\n index += 1\\n continue\\n\\n if string[index] == \\\"(\\\":\\n if operation_2 == 1:\\n result = assess_parenthesis(index, string)\\n value += result[0]\\n index = result[1]\\n elif operation_2 == 2:\\n result = assess_parenthesis(index, string)\\n value -= result[0]\\n index = result[1]\\n\\n elif string[index] == \\\"+\\\":\\n operation_2 = 1\\n\\n elif string[index] == \\\"-\\\":\\n operation_2 = 2\\n\\n elif string[index] == \\\")\\\":\\n return [value, index]\\n\\n else:\\n full_num_data = get_full_num(index, string)\\n if operation_2 == 1:\\n value += int(full_num_data[0])\\n elif operation_2 == 2:\\n value -= int(full_num_data[0])\\n index = full_num_data[1]\\n print(\\\"value\\\", value)\\n index += 1\\n\\n i = 0\\n while i < len(s):\\n if s[i] == \\\" \\\":\\n i += 1\\n continue\\n elif s[i] == \\\"(\\\":\\n parenthesis_result = assess_parenthesis(i, s)\\n if operation == 1:\\n total += parenthesis_result[0]\\n else:\\n total -= parenthesis_result[0]\\n i = parenthesis_result[1]\\n elif s[i] == \\\"+\\\":\\n print(\\\"op1\\\")\\n operation = 1\\n elif s[i] == \\\"-\\\":\\n print(\\\"op2\\\")\\n operation = 2\\n elif s[i] == \\\")\\\":\\n return value\\n else:\\n num_data = get_full_num(i, s) \\n i = num_data[1]\\n if operation == 1:\\n print(\\\"data\\\", num_data[0])\\n total += int(num_data[0])\\n else:\\n print(\\\"data\\\", num_data[0])\\n total -= int(num_data[0])\\n i += 1\\n #print(total)\\n\\n return total\\n\\n \",\n \"runtime\": \"198\"\n },\n {\n \"code\": \"class Tokenizer:\\n def __init__(self, s: str):\\n self.s = s\\n self.pc = 0\\n self.skip_whitespaces()\\n\\n def has_next(self):\\n return self.pc < len(self.s)\\n \\n def next(self):\\n self.pc += 1\\n self.skip_whitespaces()\\n \\n def skip_whitespaces(self):\\n while self.has_next() and self.current() == \\\" \\\":\\n self.pc += 1\\n \\n def is_digit(self):\\n return self.current().isdigit()\\n \\n def current(self):\\n return self.s[self.pc]\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n\\n t = Tokenizer(s)\\n ops = {\\n \\\"+\\\": lambda a, b: a + b,\\n \\\"-\\\": lambda a, b: a - b,\\n }\\n \\n def num():\\n n = 0\\n while t.has_next() and t.is_digit():\\n n = (n * 10) + int(t.current())\\n t.next()\\n return n\\n \\n def factor():\\n neg = 1\\n if t.current() == \\\"-\\\":\\n t.next()\\n neg = -1\\n \\n if t.current() == \\\"(\\\":\\n t.next()\\n n = expr()\\n t.next()\\n elif t.is_digit():\\n n = num()\\n else:\\n raise ValueError()\\n \\n return n * neg\\n \\n def expr():\\n acc = factor()\\n while t.has_next() and t.current() in ops:\\n op = t.current()\\n t.next()\\n acc = ops[op](acc, factor())\\n return acc\\n \\n return expr()\",\n \"runtime\": \"207\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(\\\" \\\",\\\"\\\")\\n last_open_bracket = []\\n stack = []\\n\\n for i in range(len(s)):\\n stack.append(s[i])\\n if s[i] == \\\"(\\\":\\n last_open_bracket.append(len(stack)-1)\\n\\n elif s[i] == \\\")\\\":\\n last_open = last_open_bracket.pop()\\n value = help_calculate(stack[last_open+1:-1])\\n\\n stack = stack[:last_open]\\n \\n for i in value:\\n stack.append(i)\\n\\n return int(help_calculate(stack))\\n\\n\\n \\n\\n\\n\\n\\ndef help_calculate(s):\\n print(\\\"string der reinkommt: \\\"+str(s))\\n lastwasminus = False\\n lastwasplus = False\\n neues_s = \\\"\\\"\\n for i in range(len(s)):\\n if lastwasminus and s[i] == \\\"-\\\":\\n neues_s = neues_s[:-1]+\\\"+\\\"\\n lastwasminus = False\\n elif lastwasminus and s[i] == \\\"+\\\":\\n neues_s = neues_s[:-1]+\\\"-\\\"\\n lastwasminus = False\\n elif lastwasplus and s[i] == \\\"-\\\":\\n neues_s = neues_s[:-1]+\\\"-\\\"\\n lastwasplus = False\\n elif s[i] == \\\"-\\\":\\n lastwasminus = True\\n lastwasplus = False\\n neues_s+=\\\"-\\\"\\n elif s[i] == \\\"+\\\":\\n lastwasminus = False\\n lastwasplus = True\\n neues_s+=\\\"+\\\"\\n else:\\n neues_s+=s[i]\\n lastwasminus = False\\n lastwasplus = False\\n s = neues_s\\n zeichen = [i for i in s if i == \\\"+\\\" or i == \\\"-\\\"]\\n splitted_s = ''.join(s).replace('+', ' ').replace('-', ' ').split()\\n start = 0\\n for i,j in list(zip(zeichen[::-1],splitted_s[::-1])):\\n start += int(str(i)+ str(j))\\n if len(zeichen) < len(splitted_s):\\n start += int(splitted_s[0])\\n return str(start)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n\\n\\n \",\n \"runtime\": \"207\"\n },\n {\n \"code\": \"INF = float('inf')\\nEPS = 1e-6\\nDUMMY = '?'\\n\\nclass Node:\\n def __init__(self, val=0, op='', pri=0):\\n self.val = val\\n self.op = op\\n self.pri = pri\\n self.left = None\\n self.right = None\\n def __repr__(self,):\\n lstr = f\\\"\\\\nL{self.left}\\\" if self.left else \\\"\\\"\\n rstr = f\\\"\\\\nR{self.right}\\\" if self.right else \\\"\\\"\\n return f\\\"{self.val},{self.op},{self.pri}{lstr}{rstr}\\\"\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n c2pri = {\\\"+\\\":1,\\\"-\\\":1, DUMMY:-INF}\\n s = s.strip()\\n if s[0] == '-': # ex. '-1'\\n s = \\\"0\\\"+s\\n stack = [] # monotomic inc\\n num = 0\\n base_pri = 0\\n for i in range(len(s)):\\n c = s[i]\\n \\n if c.isdigit():\\n num = num*10+int(c) # don't continue !\\n if i == len(s)-1: # careful !!!\\n c = DUMMY # use dummy to clear stack!\\n if c.isdigit():\\n continue\\n if c==\\\" \\\":\\n continue\\n elif c == '(':\\n base_pri += 10\\n elif c == ')':\\n base_pri -= 10\\n else: # + - ? ; // [prev, nd, op]\\n nd = Node(val=num, pri=INF)\\n num = 0\\n stack.append(nd) # mono inc stack !\\n op = Node(op=c, pri = base_pri+c2pri[c]-i*EPS)\\n # min-tree: max of left-smaller and right-smaller is parent\\n while stack and stack[-1].pri >= op.pri:\\n prev = stack.pop() # [-1, prev, op]\\n if stack:\\n if stack[-1].pri >= op.pri:\\n # don't link to op, keep backwards! op could be dummy\\n stack[-1].right = prev\\n else:\\n op.left = prev\\n else:\\n op.left = prev\\n stack.append(op)\\n root = stack[-1].left\\n return self.post(root)\\n \\n def post(self,node):\\n if node.left is None and node.right is None:\\n return node.val\\n l = self.post(node.left)\\n r = self.post(node.right)\\n if node.op == \\\"+\\\":\\n return l+r\\n elif node.op == \\\"-\\\":\\n return l-r\\n\\n\\\"\\\"\\\"\\nhttps://leetcode.com/problems/basic-calculator/solutions/1456850/python-basic-calculator-i-ii-iii-easy-solution-detailed-explanation/\\n\\\"\\\"\\\"\\n\",\n \"runtime\": \"215\"\n },\n {\n \"code\": \"import re\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(\\\" \\\",\\\"\\\")\\n i = 0\\n n = len(s)\\n st = [0]\\n sgn = 1\\n op = 1\\n while i<n:\\n #print(st)\\n if s[i]==\\\"(\\\":\\n if i>0 and s[i-1]==\\\"-\\\": op = -1\\n if i>0 and s[i-1]==\\\"+\\\": op = 1\\n sgn = 1\\n st.append(op)\\n st.append(0)\\n i += 1\\n continue\\n if s[i]==\\\")\\\":\\n res = st.pop()\\n sgn = st.pop()\\n st[-1] += sgn*res\\n i += 1\\n continue\\n if s[i]==\\\"+\\\" or s[i]==\\\"-\\\":\\n sgn = 1 if s[i]==\\\"+\\\" else -1\\n i += 1 \\n continue\\n if re.match(\\\"[0-9]\\\",s[i]):\\n s_i = i\\n while i<n and re.match(\\\"[0-9]\\\",s[i]):\\n i += 1\\n st[-1] += sgn*int(s[s_i:i]) \\n #print(st) \\n return st[-1]\\n \\n \\n \\n\",\n \"runtime\": \"215\"\n },\n {\n \"code\": \"#\\\"(1+(4+5+2)-3)+(6+8)\\\"\\n\\nclass Solution:\\n def parseNum(self, s, idx):\\n num = \\\"\\\"\\n\\n while idx < len(s) and s[idx] >= '0' and s[idx] <= '9':\\n num += s[idx]\\n idx += 1\\n return int(num), idx-1\\n\\n\\n def evalExpression(self, s, idx):\\n st = []\\n curr = s[idx]\\n\\n while curr != ')' and idx < len(s):\\n curr = s[idx]\\n print(st)\\n if curr == '(':\\n num, idx = self.evalExpression(s, idx+1)\\n #handle num\\n while st:\\n prev = st.pop()\\n if prev == '-':\\n num *= -1\\n elif prev == '+':\\n continue\\n else:\\n num = prev + num\\n\\n st.append(num)\\n continue\\n\\n elif curr == '+':\\n st.append('+')\\n elif curr == '-':\\n st.append('-')\\n elif curr >= '0' and curr <= '9':\\n num, idx = self.parseNum(s, idx)\\n #handle num\\n while st:\\n prev = st.pop()\\n if prev == '-':\\n num *= -1\\n elif prev == '+':\\n continue\\n else:\\n num = prev + num\\n\\n st.append(num)\\n\\n idx += 1\\n return st.pop(), idx\\n\\n def calculate(self, s: str) -> int:\\n return self.evalExpression(s, 0)[0]\",\n \"runtime\": \"224\"\n },\n {\n \"code\": \"class Solution:\\n def custom_eval(expression: list) -> int:\\n #print(expression)\\n\\n result = None\\n current_operator = \\\"\\\"\\n\\n for value in expression:\\n #print(value)\\n\\n if isinstance(value, str):\\n current_operator = value\\n else:\\n if isinstance(value, list):\\n value = Solution.custom_eval(value)\\n\\n if current_operator in [\\\"+\\\", \\\"-\\\"]:\\n if result is None:\\n result = 0\\n\\n if current_operator == \\\"+\\\":\\n result = result + value\\n elif current_operator == \\\"-\\\":\\n result = result - value\\n elif result is None:\\n result = value\\n #else:\\n # print(f\\\"Unsupported operator: '{current_operator}'\\\")\\n\\n return result\\n\\n def build_expression(s: str, current_index: int = 0) -> list:\\n s = s.replace(\\\" \\\", \\\"\\\")\\n result = []\\n\\n current_value = \\\"\\\"\\n #for i, c in enumerate(s):\\n while current_index < len(s):\\n c = s[current_index]\\n\\n if c == \\\"(\\\":\\n if len(current_value) != 0:\\n result.append(int(current_value))\\n current_value = \\\"\\\"\\n\\n current_index, expression = Solution.build_expression(s, current_index + 1)\\n result.append(expression)\\n elif c.isdigit():\\n current_value += c\\n elif c in [\\\"-\\\", \\\"+\\\"]:\\n if len(current_value) != 0:\\n result.append(int(current_value))\\n current_value = \\\"\\\"\\n\\n result.append(c)\\n elif c == \\\")\\\":\\n break\\n else:\\n raise ValueError(f\\\"Unexpected token: '{c}'\\\")\\n\\n current_index += 1\\n \\n if len(current_value) != 0:\\n result.append(int(current_value))\\n current_value = \\\"\\\"\\n\\n return current_index, result\\n\\n def calculate(self, s: str) -> int:\\n _, expression = Solution.build_expression(s)\\n #print(expression)\\n result = Solution.custom_eval(expression)\\n #print(result)\\n\\n return result\\n \",\n \"runtime\": \"224\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n start = 0\\n end = 0\\n s_l = []\\n for i in range(len(s)):\\n ch = s[i]\\n if ch in '()+-':\\n if end>start:\\n s_l.append(s[start:end])\\n s_l.append(ch)\\n start = i+1\\n end = i+1\\n elif ch ==' ':\\n if end>start:\\n s_l.append(s[start:end])\\n start = i+1\\n end = i+1\\n else:\\n end+=1\\n if end>start:\\n s_l.append(s[start:end+1])\\n s = s_l\\n\\n stack = []\\n stack_full = []\\n for i in range(len(s)):\\n ch = s[i]\\n if ch=='(':\\n stack.append(len(stack_full))\\n stack_full.append(ch)\\n elif ch==')':\\n index = stack.pop(-1)\\n expression = stack_full[index+1:]\\n prior = stack_full[0:index]\\n value = 0\\n state = 1\\n for ch_e in expression:\\n if ch_e=='-':\\n state*=-1\\n elif ch_e !='+':\\n num = int(ch_e)\\n value +=state*num\\n state = 1\\n stack_full = prior+[str(value)]\\n elif ch!=' ':\\n stack_full.append(ch)\\n value = 0\\n state = 1\\n for ch_e in stack_full:\\n if ch_e=='-':\\n state*=-1\\n elif ch_e !='+':\\n num = int(ch_e)\\n value +=state*num\\n state = 1\\n return value\",\n \"runtime\": \"232\"\n },\n {\n \"code\": \"class Solution:\\n def custom_eval(expression: list) -> int:\\n #print(expression)\\n\\n result = None\\n current_operator = \\\"\\\"\\n\\n for value in expression:\\n #print(value)\\n\\n if isinstance(value, str):\\n current_operator = value\\n else:\\n if isinstance(value, list):\\n value = Solution.custom_eval(value)\\n\\n if current_operator in [\\\"+\\\", \\\"-\\\"]:\\n if result is None:\\n result = 0\\n\\n if current_operator == \\\"+\\\":\\n result = result + value\\n elif current_operator == \\\"-\\\":\\n result = result - value\\n elif result is None:\\n result = value\\n #else:\\n # print(f\\\"Unsupported operator: '{current_operator}'\\\")\\n\\n return result\\n\\n def build_expression(s: str, current_index: int = 0) -> list:\\n s = s.replace(\\\" \\\", \\\"\\\")\\n result = []\\n\\n current_value = \\\"\\\"\\n #for i, c in enumerate(s):\\n while current_index < len(s):\\n c = s[current_index]\\n\\n if c == \\\"(\\\":\\n if len(current_value) != 0:\\n result.append(int(current_value))\\n current_value = \\\"\\\"\\n\\n current_index, expression = Solution.build_expression(s, current_index + 1)\\n result.append(expression)\\n elif c.isdigit():\\n current_value += c\\n elif c in [\\\"-\\\", \\\"+\\\"]:\\n if len(current_value) != 0:\\n result.append(int(current_value))\\n current_value = \\\"\\\"\\n\\n result.append(c)\\n elif c == \\\")\\\":\\n break\\n else:\\n raise ValueError(f\\\"Unexpected token: '{c}'\\\")\\n\\n current_index += 1\\n \\n if len(current_value) != 0:\\n result.append(int(current_value))\\n current_value = \\\"\\\"\\n\\n return current_index, result\\n\\n def calculate(self, s: str) -> int:\\n _, expression = Solution.build_expression(s)\\n #print(expression)\\n result = Solution.custom_eval(expression)\\n #print(result)\\n\\n return result\\n \",\n \"runtime\": \"232\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n st = []\\n evalSt = []\\n digits = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']\\n\\n i = 0\\n while i < len(s):\\n c = s[i]\\n if c == ' ':\\n pass\\n \\n if c in ['+', '-', '(']:\\n st.append(c)\\n \\n if c in digits:\\n integer = str(c)\\n i += 1\\n while i < len(s) and s[i] in digits:\\n integer += str(s[i])\\n i += 1\\n st.append(integer)\\n continue\\n \\n if c == ')':\\n while st[-1] != '(':\\n evalSt = [st.pop()] + evalSt\\n st.pop()\\n val = self.evaluate(evalSt)\\n st.append(val)\\n evalSt = []\\n i+= 1\\n # print(st)\\n \\n return self.evaluate(st)\\n \\n \\n def evaluate(self, evalSt):\\n # print(\\\"evaluate = \\\", evalSt)\\n\\n if evalSt[0] == '-':\\n minus = evalSt.pop(0)\\n val = int(evalSt.pop(0)) * -1\\n evalSt = [val] + evalSt\\n \\n\\n while len(evalSt) >= 3:\\n leftOperand = evalSt.pop(0)\\n operator = evalSt.pop(0)\\n rightOperand = evalSt.pop(0)\\n\\n val = 0\\n if operator == '+':\\n val = int(leftOperand) + int(rightOperand)\\n \\n if operator == '-':\\n val = int(leftOperand) - int(rightOperand)\\n \\n evalSt = [val] + evalSt\\n \\n \\n # print(\\\"evaluate Done = \\\", evalSt)\\n return int(evalSt.pop())\\n \\n \",\n \"runtime\": \"241\"\n },\n {\n \"code\": \"class Solution:\\n def calc(self, s, idx):\\n ops = [] # queue\\n vals = [] # stack\\n def evaluate(c):\\n if(not len(vals) and not len(ops)):\\n vals.append(int(c))\\n elif(not len(vals) and len(ops)):\\n op = ops.pop()\\n if(op == \\\"-\\\"):\\n vals.append(-int(c))\\n elif(len(ops)):\\n op = ops.pop()\\n if(op == \\\"-\\\"):\\n val1 = vals.pop()\\n vals.append(val1-int(c))\\n if(op == \\\"+\\\"):\\n val1 = vals.pop()\\n vals.append(val1+int(c))\\n while(idx < len(s)):\\n c = s[idx]\\n idx += 1\\n print(f'{c} {vals} {ops}')\\n if(c=='+' or c=='-'):\\n ops.append(c)\\n elif(c=='('):\\n val, idx = (self.calc(s, idx))\\n evaluate(val)\\n elif(c==')'):\\n return vals[-1], idx\\n elif(c!=' '):\\n i=0\\n while(idx+i<len(s) and s[idx+i].isdigit()):\\n i+=1\\n i-= 1\\n c = s[idx-1:idx+i+1]\\n evaluate(c)\\n idx += i + 1\\n return vals[-1], idx\\n def calculate(self, s: str) -> int:\\n val, idx = self.calc(s, 0)\\n return val\",\n \"runtime\": \"241\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(\\\" \\\", \\\"\\\")\\n open_brackets = deque([0])\\n i = 1\\n while i < len(s):\\n if s[i] == \\\")\\\":\\n j = open_brackets.pop()\\n s = (s[:j] + str(evaluate(s[j+1:i])) + s[i+1:]).replace(\\\"--\\\", \\\"+\\\").lstrip(\\\"+\\\")\\n i = j + 1\\n continue\\n\\n if s[i] == \\\"(\\\":\\n open_brackets.append(i)\\n i += 1\\n return evaluate(s)\\n\\ndef evaluate(s: str) -> int:\\n nums = deque()\\n n = \\\"\\\"\\n for d in s:\\n if d == \\\"+\\\":\\n nums.append(int(n))\\n n = \\\"\\\"\\n elif n and d == \\\"-\\\":\\n nums.append(int(n))\\n n = d\\n else:\\n n += d\\n if n:\\n nums.append(int(n))\\n return sum(nums)\\n\\n\\n\",\n \"runtime\": \"249\"\n },\n {\n \"code\": \"import re\\ndef calc(s_list):\\n idx=0\\n result = 0\\n c = 1\\n size = len(s_list)\\n while idx < size:\\n i = s_list[idx]\\n if i not in \\\"+-()\\\":\\n num = int(i)\\n result += c*num\\n elif i == \\\"+\\\":\\n c = 1\\n elif i == \\\"-\\\":\\n c = -1\\n elif i == \\\"(\\\":\\n num, _idx = calc(s_list[idx+1:])\\n idx += _idx + 1\\n result += c*num\\n elif i == \\\")\\\":\\n return result, idx\\n idx += 1\\n return result, idx\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n _s = re.compile(\\\"\\\\({1}|\\\\d+|\\\\){1}|\\\\+{1}|\\\\-{1}\\\").findall(s)\\n result, idx = calc(_s)\\n return result\",\n \"runtime\": \"249\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n stack = []\\n\\n for c in s:\\n if c == ')':\\n exp = []\\n while stack[-1] != '(':\\n exp.append(stack.pop())\\n stack.pop()\\n exp.reverse()\\n exp_res = self.evalExp(exp)\\n stack.append(exp_res)\\n elif c != ' ':\\n addition = ''\\n if stack and c.isnumeric() and self.isnumber(stack[-1]):\\n addition = stack.pop()\\n stack.append(addition + c)\\n return int(self.evalExp(stack))\\n\\n def evalExp(self, exp):\\n stack = []\\n print(exp)\\n for c in exp:\\n if stack and self.isnumber(c):\\n operation = stack.pop()\\n operand = 0\\n if stack:\\n operand = int(stack.pop())\\n if operation == '+':\\n stack.append(operand + int(c))\\n else:\\n stack.append(operand - int(c))\\n else:\\n stack.append(c)\\n return str(stack[0])\\n\\n def isnumber(self, s):\\n try:\\n int(s)\\n return True\\n except:\\n return False\\n\\n \",\n \"runtime\": \"258\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n\\n \\\"\\\"\\\"\\nsuppose i see a minus. look at preceding\\n + or -: - is part of the number\\n nothing: is part of the number\\n (: then it's part of number\\n\\n number: then it's operator\\n ): then it's operator \\n\\n \\\"\\\"\\\"\\n\\n # Produce tokens\\n s_without_spaces = [c for c in s if c != ' ']\\n tokens = []\\n numbers = []\\n prev = None\\n for c in s_without_spaces:\\n if c in ('+','(',')', '-'):\\n if len(numbers) > 0:\\n tokens.append(int(''.join(numbers)))\\n numbers = []\\n tokens.append(c)\\n else: # assume else means number\\n numbers.append(c)\\n prev = c\\n if len(numbers) > 0:\\n tokens.append(int(''.join(numbers)))\\n print(tokens)\\n\\n # pass on stack\\n # validation is out of scope: assume valid\\n stack = []\\n for token in tokens:\\n stack.append(token)\\n while len(stack) >= 2:\\n # TODO: cleanup e.g. not sure if f[:-3] takes 3 time, better check int\\n if len(stack) >= 3 and type(stack[-3]) == int and stack[-2] in ('+', '-') and type(stack[-1]) == int:\\n if stack[-2] == '+':\\n val = stack[-3] + stack[-1]\\n else:\\n val = stack[-3] - stack[-1]\\n stack = stack[:-3]\\n stack.append(val)\\n elif stack[-2] == '-' and type(stack[-1]) == int:\\n val = -1 * stack[-1]\\n stack = stack[:-2]\\n stack.append(val)\\n elif len(stack) >= 3 and stack[-3] == '(' and type(stack[-2]) == int and stack[-1] == ')':\\n val = stack[-2]\\n stack = stack[:-3]\\n stack.append(val)\\n else:\\n break\\n return stack[0]\\n\\n\\n\\\"\\\"\\\"\\n\\nidea: keep on adding to stack\\n\\n<num> +/- <num> can be collapsed\\n( <num> ) can be collapsed\\n- <num> will become num\\n\\n\\n(1+(4+5+2)-3)+(6+8)\\n\\n\\n1-(-2)\\n\\n\\n\\n\\n123 + 123\\n123+123\\n\\ninput: string is representing valid expression\\noutput: result of evaluation\\n\\nquestion: what is supported?\\n s consists of digits, '+', '-', '(', ')', and ' '.\\n + not unary; - could be unary\\n\\ncontext free grammar parsing might be too difficult\\n\\nwe still need parentheses e.g. 5-(1+2+3)\\n\\nstep 1: split so list of operators and items e.g. 1 + 1 = [1,+,1]\\nstep 2: paren matching\\n (0, 12)\\n\\n0123456789012345678 \\n(1+(4+5+2)-3)+(6+8)\\n\\nideas:\\n context free grammar: too hard\\n recursively handle like that: kinda tricky with matching parentheses\\n stack might be good\\n\\n\\nhandle(\\\"(1+(4+5+2)-3)+(6+8)\\\")\\n handle(\\\"1+(4+5+2)-3\\\")\\n 1\\n +\\n handle(\\\"4+5+2\\\")\\n 11\\n -\\n 3\\n +\\n handle(\\\"6+8\\\")\\n 14\\n\\n(1+(4+5+2)-3)+(6+8)\\n\\n11\\n+\\n1\\n(\\n\\n\\n\\\"\\\"\\\"\",\n \"runtime\": \"258\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n res , sign , n = 0 , 1 , len(s)\\n st = []\\n i = 0\\n while i < n: \\n print(\\\"i\\\", i)\\n if s[i].isdigit():\\n nums = 0\\n while i < n and s[i].isdigit():\\n nums = nums*10 + int(s[i])\\n i += 1\\n \\n res += sign * nums\\n i -= 1\\n sign = 1\\n print(\\\"res\\\", res, \\\"i\\\" , i)\\n elif s[i] in '-+':\\n sign = -1 if s[i] == '-' else 1\\n elif s[i] == '(':\\n st.append(res)\\n st.append(sign)\\n res , sign = 0 , 1\\n elif s[i] == ')':\\n res *= st.pop()\\n res += st.pop()\\n \\n i += 1\\n print(res)\\n \\n\\n return res\\n\\n\\n \\n\",\n \"runtime\": \"266\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n curr = res = 0\\n sign = 1\\n stack = []\\n for char in s:\\n print(char, 'char')\\n if char.isdigit():\\n curr = curr * 10 + int(char)\\n elif char == \\\"+\\\" or char == \\\"-\\\":\\n print('plusminus')\\n print('curr', curr)\\n print(sign, 'sign')\\n print(res, 'res')\\n res += curr * sign\\n sign = 1 if char == \\\"+\\\" else -1\\n curr = 0\\n elif char == \\\"(\\\":\\n stack.append(res)\\n stack.append(sign)\\n res = 0\\n sign = 1\\n elif char == \\\")\\\":\\n res += curr * sign\\n res *= stack.pop()\\n res += stack.pop()\\n curr = 0\\n res += curr * sign\\n return res \\n \",\n \"runtime\": \"266\"\n },\n {\n \"code\": \"from typing import Optional\\n\\n\\nclass Number:\\n def __init__(self, value):\\n self.value = value\\n\\n def __repr__(self) -> str:\\n return f\\\"N[{self.value}]\\\"\\n\\nclass Operator:\\n def __init__(self, operator):\\n self.operator = operator\\n\\n def __repr__(self) -> str:\\n return f\\\"O[{self.operator}]\\\"\\n\\nclass Parenthesis:\\n def __init__(self, parenthesis):\\n self.parenthesis = parenthesis\\n\\n def __repr__(self) -> str:\\n return f\\\"P[{self.parenthesis}]\\\"\\n\\n\\nclass Node:\\n def __init__(self, operator: Optional[Operator] = None):\\n self.operator = operator\\n self.operands = []\\n\\n def calculate(self):\\n if self.operator is None:\\n a = self.operands[0]\\n return a.calculate() if isinstance(a, Node) else a\\n if self.operator.operator == '+':\\n a = self.operands[0]\\n b = self.operands[1]\\n aval = a.calculate() if isinstance(a, Node) else a\\n bval = b.calculate() if isinstance(b, Node) else b\\n return Number(aval.value + bval.value)\\n if self.operator.operator == '-':\\n a = self.operands[0]\\n aval = a.calculate() if isinstance(a, Node) else a\\n if len(self.operands) == 1:\\n return Number(-aval.value)\\n b = self.operands[1]\\n bval = b.calculate() if isinstance(b, Node) else b\\n return Number(aval.value - bval.value)\\n return None\\n\\n def __repr__(self):\\n return f\\\"Node[{self.operator} {self.operands}]\\\"\\n\\n\\ndef buildAST(tokens, pos, left_operand=None):\\n node = Node()\\n if left_operand:\\n node.operands.append(left_operand)\\n if pos >= len(tokens):\\n return node, pos\\n token = tokens[pos]\\n pos += 1\\n if isinstance(token, Parenthesis) and token.parenthesis == ')':\\n return left_operand, pos\\n if isinstance(token, Parenthesis) and token.parenthesis == '(':\\n operand, pos = buildAST(tokens, pos)\\n node.operands.append(operand)\\n elif isinstance(token, Number):\\n node.operands.append(token)\\n elif isinstance(token, Operator):\\n node.operator = token\\n\\n if pos >= len(tokens):\\n return node, pos\\n\\n if node.operator is None and isinstance(tokens[pos], Operator):\\n node.operator = tokens[pos]\\n pos += 1\\n\\n token = tokens[pos]\\n pos += 1\\n\\n if isinstance(token, Parenthesis) and token.parenthesis == ')':\\n return node, pos\\n if isinstance(token, Parenthesis) and token.parenthesis == '(':\\n operand, pos = buildAST(tokens, pos)\\n node.operands.append(operand)\\n elif isinstance(token, Number):\\n node.operands.append(token)\\n\\n if pos < len(tokens):\\n return buildAST(tokens, pos, node)\\n\\n return node, pos\\n\\n\\ndef parse_tokens(expr: str):\\n number = None\\n tokens = []\\n\\n for c in expr:\\n if c == ' ':\\n continue\\n if ord(c) >= ord('0') and ord(c) <= ord('9'):\\n number = number * 10 + int(c) if number is not None else int(c)\\n continue\\n if number is not None:\\n tokens.append(Number(number))\\n number = None\\n if c in ('(', ')'):\\n tokens.append(Parenthesis(c))\\n continue\\n if c in ('+', '-'):\\n tokens.append(Operator(c))\\n continue\\n if number is not None:\\n tokens.append(Number(number))\\n\\n return tokens\\n\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n tokens = parse_tokens(s)\\n node, _ = buildAST(tokens, 0)\\n return node.calculate().value\\n \",\n \"runtime\": \"275\"\n },\n {\n \"code\": \"import ast\\nimport re\\nimport sys\\nsys.setrecursionlimit(100000)\\n\\nclass ExprNode:\\n def __init__(self, child1, child2):\\n self.children = [child1, child2]\\n def __str__(self):\\n return(\\\"Expression\\\")\\n\\nclass TermNode:\\n def __init__(self, op, child1, child2):\\n self.children = [child1, child2]\\n self.op = op\\n def __str__(self):\\n if self.op == \\\"+\\\":\\n return(\\\"Term PLUS\\\")\\n else:\\n return(\\\"Term MINUS\\\")\\n\\nclass BaseNode:\\n def __init__(self, child, val=None):\\n self.children = [child]\\n self.val = val\\n def __str__(self):\\n if self.val == None:\\n return(\\\"Parenthesis\\\")\\n else:\\n return(\\\"Number \\\" + str(self.val))\\n\\nclass Parser:\\n def __init__(self, tokens):\\n self.tokens = tokens\\n self.cur = 0\\n def expr(self):\\n curtoken = self.tokens[self.cur]\\n if curtoken.isdigit():\\n self.cur += 1\\n node = self.term()\\n if not node:\\n return BaseNode(None, int(curtoken))\\n else:\\n return ExprNode(BaseNode(None, int(curtoken)), node)\\n else:\\n # left parenthesis case\\n b_node = self.base()\\n t_node = self.term()\\n return ExprNode(b_node, t_node)\\n def term(self):\\n if self.cur >= len(self.tokens) - 1:\\n return None\\n curtoken = self.tokens[self.cur]\\n if curtoken in [\\\"+\\\", \\\"-\\\"]:\\n self.cur += 1\\n nexttoken = self.tokens[self.cur]\\n if nexttoken.isdigit():\\n self.cur += 1\\n node = self.term()\\n return TermNode(curtoken, BaseNode(None, int(nexttoken)), node)\\n else:\\n b_node = self.base()\\n t_node = self.term()\\n return TermNode(curtoken, b_node, t_node)\\n else:\\n return None\\n\\n # parses the parenthesis case only\\n def base(self):\\n if self.tokens[self.cur] == \\\"(\\\":\\n self.cur += 1\\n node = self.expr()\\n if self.tokens[self.cur] != \\\")\\\":\\n print(\\\"Syntax Error: No matching right parenthesis\\\")\\n return None\\n self.cur += 1\\n return BaseNode(node)\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n def lexer(s):\\n expression = re.sub(r'\\\\s+', \\\"\\\", s)\\n expression = re.findall(r'\\\\d+|[\\\\(\\\\)+-]', expression)\\n formatted = []\\n for e in expression:\\n if e == \\\"-\\\" and (not formatted or formatted[-1] == \\\"(\\\"):\\n formatted.append(\\\"0\\\")\\n formatted.append(e)\\n return formatted\\n def print_nodes(n, lvl=0):\\n if not n:\\n return\\n print(\\\" \\\" * lvl, end=\\\"\\\")\\n print(\\\"|\\\", end=\\\"\\\")\\n print(\\\"--\\\" * lvl, end=\\\"\\\")\\n print(n)\\n \\n for c in n.children:\\n print_nodes(c, lvl+1)\\n \\n rpn = []\\n def emit_rpn(n):\\n if not n:\\n return\\n if type(n) == TermNode:\\n if n.children[0].val != None:\\n rpn.append(n.children[0].val)\\n rpn.append(n.op)\\n else:\\n emit_rpn(n.children[0])\\n rpn.append(n.op)\\n emit_rpn(n.children[1])\\n\\n\\n elif type(n) == BaseNode:\\n if n.val != None:\\n rpn.append(n.val)\\n else:\\n emit_rpn(n.children[0])\\n\\n else:\\n emit_rpn(n.children[0])\\n emit_rpn(n.children[1])\\n \\n def evaluate_rpn(rpns):\\n stack = []\\n for token in rpns :\\n if token == '+' :\\n a , b = stack.pop() , stack.pop()\\n stack.append( a + b ) \\n elif token == '-':\\n a , b = stack.pop() , stack.pop()\\n stack.append( b - a ) \\n else:\\n stack.append(token) \\n return stack.pop() \\n \\n ps = Parser(lexer(s))\\n res = ps.expr()\\n emit_rpn(res)\\n return evaluate_rpn(rpn)\",\n \"runtime\": \"275\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n lexer = Lexer(s)\\n parser = Parser(lexer)\\n parse_tree = parser.parse(None)\\n print(parse_tree)\\n interpreter = Interpreter(parse_tree)\\n return interpreter.eval()\\n\\nclass Lexer:\\n def __init__(self, expr: str):\\n self.expr = expr\\n self.i = 0\\n def parse_num(self) -> str:\\n num = \\\"\\\"\\n while self.i < len(self.expr) and self.expr[self.i].isdigit() :\\n num += self.expr[self.i]\\n self.i += 1\\n return num\\n def next_token(self) -> str:\\n if self.i == len(self.expr):\\n return \\\"\\\"\\n\\n ch = self.expr[self.i]\\n if ch == \\\" \\\":\\n self.i += 1 ; return self.next_token()\\n elif ch.isdigit():\\n num = self.parse_num()\\n return num\\n elif ch in ['+', '-', '(', ')']:\\n self.i += 1 ; return ch\\n\\nclass num_node:\\n def __init__(self, num):\\n self.num = num\\n def __repr__(self):\\n return f'{self.num}'\\nclass add_node:\\n def __init__(self, left, right):\\n self.left = left\\n self.right = right\\n def __repr__(self):\\n return f'{self.left}+{self.right}'\\nclass subtract_node:\\n def __init__(self, left, right):\\n self.left = left\\n self.right = right\\n def __repr__(self):\\n return f'{self.left}-{self.right}'\\nclass negate_node:\\n def __init__(self, parse_tree):\\n self.parse_tree = parse_tree\\n def __repr__(self):\\n return f' -{self.parse_tree}'\\nclass group_node:\\n def __init__(self, parse_tree):\\n self.parse_tree = parse_tree\\n def __repr__(self):\\n return f'({self.parse_tree})'\\nparse_node = num_node | add_node | subtract_node | negate_node | group_node\\nclass Parser:\\n def __init__(self, lexer):\\n self.lexer = lexer\\n def next_node(self, last_node) -> parse_node:\\n token = self.lexer.next_token()\\n if token == \\\"\\\":\\n return None\\n elif token == \\\")\\\":\\n return None\\n elif token.isnumeric():\\n return num_node(int(token))\\n elif token == \\\"+\\\":\\n return add_node(last_node, self.next_node(None))\\n elif token == \\\"-\\\":\\n if last_node is None:\\n return negate_node(self.next_node(None))\\n else:\\n return subtract_node(last_node, self.next_node(None))\\n elif token == \\\"(\\\":\\n return group_node(self.parse(None))\\n\\n def parse(self, parse_tree: parse_node) -> parse_node:\\n node = self.next_node(parse_tree)\\n if node is None:\\n return parse_tree\\n else:\\n return self.parse(node)\\n \\nclass Interpreter:\\n def __init__(self, parse_tree):\\n self.parse_tree = parse_tree\\n def eval(self) -> int:\\n return self.eval_pt(self.parse_tree)\\n def eval_pt(self, parse_tree: parse_node) -> int:\\n if isinstance(parse_tree, num_node):\\n return parse_tree.num\\n elif isinstance(parse_tree, add_node):\\n return self.eval_pt(parse_tree.left) + self.eval_pt(parse_tree.right)\\n elif isinstance(parse_tree, subtract_node):\\n return self.eval_pt(parse_tree.left) - self.eval_pt(parse_tree.right)\\n elif isinstance(parse_tree, negate_node):\\n return -1 * self.eval_pt(parse_tree.parse_tree)\\n elif isinstance(parse_tree, group_node):\\n return self.eval_pt(parse_tree.parse_tree)\",\n \"runtime\": \"283\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n w=[]\\n def type1(i):\\n if i>='0' and i<='9':\\n return True\\n return False\\n s=list(s)\\n i=0\\n while i<len(s)-1:\\n x=''\\n while i<len(s)-1 and type1(s[i]) and type1(s[i+1]):\\n x=x+s[i]\\n s.pop(i)\\n s[i]=x+s[i]\\n i=i+1\\n j=0\\n while j<len(s):\\n if w==[] and s[j]!=' ':\\n w.append(s[j])\\n elif s[j]==' ':\\n j=j+1\\n continue\\n elif s[j]==')':\\n x=[]\\n while w[-1]!='(':\\n x.append(w.pop())\\n w.pop() \\n x.reverse()\\n if x[0]=='+' or x[0]=='-':\\n if x[0]=='-':\\n x[1]=str(-int(x[1]))\\n x.pop(0)\\n while len(x)>2:\\n a=x.pop(0)\\n b=x.pop(0)\\n c=x.pop(0)\\n if b=='+':\\n x.insert(0,str(int(c)+int(a)))\\n elif b=='-':\\n x.insert(0,str(-int(c)+int(a)))\\n w.append(x[0]) \\n else:\\n w.append(s[j])\\n j=j+1\\n if w[0]=='+' or w[0]=='-':\\n if w[0]=='-':\\n w[1]=str(-int(w[1]))\\n w.pop(0)\\n while len(w)!=1:\\n a=w.pop(0)\\n b=w.pop(0)\\n c=w.pop(0)\\n if b=='+':\\n w.insert(0,str(int(c)+int(a)))\\n elif b=='-':\\n w.insert(0,str(-int(c)+int(a)))\\n return int(w[0])\\n\\n\",\n \"runtime\": \"283\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n w=[]\\n def type1(i):\\n if i>='-999999999' and i<='999999999':\\n return True\\n return False\\n s=list(s)\\n i=0\\n while i<len(s)-1:\\n if type1(s[i]) and type1(s[i+1]):\\n s[i]=s[i]+s[i+1]\\n s.pop(i+1)\\n continue\\n i=i+1\\n j=0\\n while j<len(s):\\n if w==[] and s[j]!=' ':\\n w.append(s[j])\\n elif s[j]==' ':\\n j=j+1\\n continue\\n elif s[j]==')':\\n x=[]\\n while w[-1]!='(':\\n x.append(w.pop())\\n w.pop() \\n x.reverse()\\n if x[0]=='+' or x[0]=='-':\\n if x[0]=='-':\\n x[1]=str(-int(x[1]))\\n x.pop(0)\\n while len(x)>2:\\n a=x.pop(0)\\n b=x.pop(0)\\n c=x.pop(0)\\n if b=='+':\\n x.insert(0,str(int(c)+int(a)))\\n elif b=='-':\\n x.insert(0,str(-int(c)+int(a)))\\n w.append(x[0]) \\n else:\\n w.append(s[j])\\n j=j+1\\n if w[0]=='+' or w[0]=='-':\\n if w[0]=='-':\\n w[1]=str(-int(w[1]))\\n w.pop(0)\\n while len(w)!=1:\\n a=w.pop(0)\\n b=w.pop(0)\\n c=w.pop(0)\\n if b=='+':\\n w.insert(0,str(int(c)+int(a)))\\n elif b=='-':\\n w.insert(0,str(-int(c)+int(a)))\\n return int(w[0])\\n\\n\",\n \"runtime\": \"292\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n return self._calculate(iter(s))\\n\\n def _calculate(self, s_it) -> int:\\n print(\\\"_calculate\\\")\\n\\n ans = 0\\n curr_num = 0\\n last_op = \\\"+\\\"\\n\\n def eval(x, y, op):\\n if op == \\\"+\\\":\\n return x + y\\n\\n if op == \\\"-\\\":\\n return x - y\\n\\n while True:\\n try:\\n c = next(s_it)\\n print(c, \\\"ans\\\", ans, \\\"curr_num\\\", curr_num, \\\"last_op\\\", last_op)\\n\\n if c == \\\" \\\":\\n continue\\n\\n if c.isdigit():\\n curr_num = 10 * curr_num + int(c)\\n continue\\n\\n if last_op and curr_num:\\n ans = eval(ans, curr_num, last_op)\\n\\n last_op = \\\"\\\"\\n curr_num = 0\\n\\n if c == \\\"(\\\":\\n curr_num = self._calculate(s_it)\\n continue\\n\\n if c == \\\")\\\":\\n return ans\\n\\n last_op = c\\n\\n except StopIteration:\\n return eval(ans, curr_num, last_op)\\n\\n\\n # def calculate(self, s: str) -> int:\\n # stack = [0]\\n # op = [\\\"+\\\", \\\"-\\\"]\\n\\n # lastNum = \\\"\\\"\\n # lastOp = \\\"+\\\"\\n\\n # for c in s:\\n # # print(c, \\\"S\\\", stack, \\\"lastNum\\\", lastNum, \\\"lastOp\\\", lastOp)\\n\\n # if c == \\\" \\\":\\n # continue\\n\\n # if c.isdigit():\\n # lastNum += c\\n # continue\\n\\n # if lastOp and lastNum:\\n # if lastOp == \\\"+\\\":\\n # stack[-1] = stack[-1] + int(lastNum)\\n # else:\\n # stack[-1] = stack[-1] - int(lastNum)\\n\\n # lastNum = \\\"\\\"\\n # lastOp = \\\"\\\"\\n\\n # # else:\\n # # stack.\\n\\n # if c == \\\"(\\\":\\n # stack.append(lastOp)\\n # stack.append(0)\\n # lastOp = \\\"+\\\"\\n # continue\\n\\n # if c == \\\")\\\":\\n # if len(stack) > 0:\\n # num_r = stack.pop()\\n # op = stack.pop()\\n\\n # if op == \\\"+\\\":\\n # stack[-1] = stack[-1] + int(num_r)\\n # else:\\n # stack[-1] = stack[-1] - int(num_r)\\n\\n # continue\\n\\n # # if c in op:\\n # lastOp = c\\n\\n # if lastOp and lastNum:\\n # if lastOp == \\\"+\\\":\\n # stack[-1] = stack[-1] + int(lastNum)\\n # else:\\n # stack[-1] = stack[-1] - int(lastNum)\\n\\n # return stack[0]\\n\",\n \"runtime\": \"292\"\n },\n {\n \"code\": \"class Solution:\\n def valid_num_op(self, i, s): \\n while i < len(s):\\n if s[i] == ' ': i+=1\\n else: break \\n if i>len(s)-1: return i, None\\n num_op = s[i]\\n i+=1\\n while i < len(s): \\n if num_op[-1].isnumeric() and s[i].isnumeric():\\n num_op += s[i]\\n else:\\n break \\n i+=1\\n if num_op.isnumeric(): num_op = int(num_op)\\n return i, num_op \\n def simple_solve(self, i, s):\\n # i after '(' \\n stack = [0]\\n first_neg = True\\n pre_op = '+'\\n while i < len(s): \\n i, nums_op = self.valid_num_op(i,s)\\n if first_neg and nums_op == '-': \\n pre_op = '-' \\n first_neg = False\\n continue \\n first_neg = False\\n if nums_op in ['+','-','*','/',')']:# solve before this op\\n if pre_op == '+':\\n stack[-1] = stack[-1]+num\\n elif pre_op == '-':\\n stack[-1] = stack[-1]-num\\n elif pre_op == '*':\\n stack[-1] = stack[-1]*num\\n elif pre_op == '/':\\n stack[-1] = stack[-1]/num\\n pre_op = nums_op\\n else: \\n num = nums_op\\n if nums_op == '(':\\n i, num = self.simple_solve(i,s)\\n print(i, nums_op, stack)\\n if nums_op == ')':\\n break\\n return i, sum(stack)\\n\\n\\n def calculate(self, s: str) -> int: \\n i, out = self.simple_solve(0,s+')')\\n return out\\n\",\n \"runtime\": \"300\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n out = 0\\n s = '(' + s + ')'\\n \\n def parHelper(s:str) -> (int,int):\\n helpStack = []\\n helperOut = 0\\n i = 1 \\n \\n negFlag = 1 #if '-' is found and stack is empty, set to -1\\n while s[i] != ')' and i < len(s):\\n \\n if s[i] in '0123456789':\\n if helpStack and type(helpStack[-1]) == int:\\n helpStack[-1] = helpStack[-1]*10+negFlag*int(s[i])\\n else:\\n helpStack.append(negFlag*int(s[i]))\\n if s[i] == '+':\\n if helpStack:\\n helperOut += helpStack.pop()\\n negFlag = 1\\n if s[i] == '-':\\n if helpStack:\\n helperOut += helpStack.pop()\\n negFlag = -1\\n \\n if s[i] == '(':\\n nextVal, shift = parHelper(s[i:])\\n if helpStack:\\n helperOut += helpStack.pop()\\n helperOut += negFlag*nextVal\\n negFlag = 1\\n i += shift\\n print(helperOut,i,negFlag,helpStack)\\n i += 1\\n\\n while helpStack:\\n helperOut += helpStack.pop()\\n print(helperOut, i, s[i],\\\"return\\\")\\n return (helperOut,i)\\n \\n output, idx = parHelper(s)\\n return output\",\n \"runtime\": \"300\"\n },\n {\n \"code\": \"class Solution:\\n operators = {\\\"+\\\", \\\"-\\\"}\\n operator_to_func = {\\n \\\"+\\\": lambda a, b: a + b,\\n \\\"-\\\": lambda a, b: a - b,\\n }\\n\\n def read_number(self, s, st, end) -> int:\\n pos = st\\n while pos < end and \\\\\\n not (s[pos] in self.operators) and \\\\\\n not (s[pos] in \\\"() \\\"):\\n pos += 1\\n return int(s[st: pos]), pos\\n \\n def process_expression(self, s, st, end, depth):\\n # st = 0; end = 11; s = \\\"1+1\\\"\\n i = st # 0\\n result = [] # []\\n \\n print('depth:', depth, 'st:', st)\\n\\n while (i < end):\\n if (i < end) and (s[i] == ')'):\\n print('found )', result[-1], i + 1)\\n return result[-1], i + 1\\n\\n elif (i < end) and (s[i] == '('):\\n val, i = self.process_expression(s, i + 1, end, depth + 1) # 7, 3\\n result.append(val)\\n elif (i < end) and (s[i] not in '+-'):\\n val, i = self.read_number(s, i, end)\\n result.append(val)\\n\\n print('depth:', depth, 'i:', i)\\n\\n if (i < end) and (s[i] in '+-'):\\n op = s[i] # + \\n lhs = 0 if len(result) == 0 else result.pop()\\n if i + 1 < end and s[i + 1] == '(':\\n rhs, i = self.process_expression(s, i + 2, end, depth + 1) \\n else:\\n rhs, i = self.read_number(s, i + 1, end)\\n calc_func = self.operator_to_func[op]\\n print('operation:', lhs, op, rhs, flush=True)\\n val = calc_func(lhs, rhs)\\n result.append(val)\\n \\n #print(s, i, result)\\n\\n res = result[-1] if len(result) > 0 else 0\\n return res, end\\n\\n\\n\\n def calculate(self, s: str) -> int:\\n operator_to_func = {\\n \\\"+\\\": lambda a, b: a + b,\\n \\\"-\\\": lambda a, b: a - b,\\n }\\n\\n s = s.replace(\\\" \\\", \\\"\\\")\\n n = len(s)\\n val, _ = self.process_expression(s, 0, n, 0)\\n return val\\n\\n \\n \\n \\n\\n \",\n \"runtime\": \"309\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n w=[]\\n def type1(i):\\n if i>='0' and i<='9':\\n return True\\n return False\\n s=list(s)\\n i=0\\n while i<len(s)-1:\\n x=''\\n while i<len(s)-1 and type1(s[i]) and type1(s[i+1]):\\n x=x+s[i]\\n s.pop(i)\\n s[i]=x+s[i]\\n i=i+1\\n j=0\\n while j<len(s):\\n if w==[] and s[j]!=' ':\\n w.append(s[j])\\n elif s[j]==' ':\\n j=j+1\\n continue\\n elif s[j]==')':\\n x=[]\\n while w[-1]!='(':\\n x.append(w.pop())\\n w.pop() \\n x.reverse()\\n if x[0]=='+' or x[0]=='-':\\n if x[0]=='-':\\n x[1]=str(-int(x[1]))\\n x.pop(0)\\n while len(x)>2:\\n a=x.pop(0)\\n b=x.pop(0)\\n c=x.pop(0)\\n if b=='+':\\n x.insert(0,str(int(c)+int(a)))\\n elif b=='-':\\n x.insert(0,str(-int(c)+int(a)))\\n w.append(x[0]) \\n else:\\n w.append(s[j])\\n j=j+1\\n if w[0]=='+' or w[0]=='-':\\n if w[0]=='-':\\n w[1]=str(-int(w[1]))\\n w.pop(0)\\n while len(w)!=1:\\n a=w.pop(0)\\n b=w.pop(0)\\n c=w.pop(0)\\n if b=='+':\\n w.insert(0,str(int(c)+int(a)))\\n elif b=='-':\\n w.insert(0,str(-int(c)+int(a)))\\n return int(w[0])\\n\\n\",\n \"runtime\": \"309\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n \\n s = s.replace(\\\" \\\", \\\"\\\")\\n\\n number = 0 # current number\\n result = 0 # current reslut of the expression evaluation\\n sign = 1 # sign of the current number(or evaluated expression in brackets), goes before current value, not after\\n\\n stack = deque()\\n\\n for char in s:\\n if char == \\\"+\\\" or char == \\\"-\\\":\\n # update sign and add number with previous sign to the result\\n # because we finished parsing a number(or if it's a sign in front of the first num)\\n result += sign * number\\n\\n # assign a new sign before parsing the next value\\n if char == \\\"+\\\":\\n sign = 1\\n else:\\n sign = -1\\n\\n number = 0 # we added parsed number to the result already, so we reset number\\n\\n print(\\\"sign\\\", sign, number, result)\\n \\n elif char.isdigit():\\n # update our number by multiplying already parsed part of the number by 10 \\n # and adding current digit\\n digit = int(char)\\n number *= 10\\n number += digit\\n\\n print(\\\"digit\\\", char, number, result)\\n\\n elif char == \\\"(\\\":\\n # we should save our current result to the stack\\n # and then add current sign\\n # then proceed with calculating result in the brackets\\n stack.append(result) # current result\\n stack.append(sign) # sign of the expression in the upcooming brackets\\n\\n result = 0\\n sign = 1\\n\\n print(\\\"open bracket\\\", number, result, stack)\\n elif char == \\\")\\\":\\n # we reached the end of current expression in brackets\\n # we should take sign of the current result from the stack\\n # then take previous number(result) from the stack\\n # add them and proceed further\\n\\n # we finished parsing number\\n # so we need to add it to the current result\\n result += sign*number\\n number = 0\\n\\n # we calculated current result\\n # now we need to add a sign to it and\\n # add it to the previous result\\n resultSign = stack.pop()\\n previousResult = stack.pop()\\n\\n result = previousResult + resultSign*result\\n\\n print(\\\"close bracket\\\", number, result, stack)\\n \\n if number != 0:\\n result += sign * number\\n \\n return result\",\n \"runtime\": \"318\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n def cal_expression(match):\\n res = 0\\n symbol = 1\\n i = 0\\n while i < len(match):\\n if match[i] == '+':\\n if i != 0 and not match[i-1].isdigit():\\n if match[i-1] == '+':\\n symbol = 1\\n else:\\n symbol = -1\\n else:\\n symbol = 1\\n elif match[i] == '-':\\n if i != 0 and not match[i-1].isdigit():\\n if match[i-1] == '+':\\n symbol = -1\\n else:\\n symbol = 1\\n else:\\n symbol = -1\\n else:\\n number = int(match[i])\\n res += symbol * number\\n i += 1\\n return res\\n\\n def handler(match):\\n expression = match.group(0)\\n token = re.findall('\\\\d+|[+-]', expression)\\n return str(cal_expression(token))\\n\\n s = s.replace(' ', '')\\n while '(' in s:\\n s = re.sub('\\\\(([^()]+)\\\\)', handler, s)\\n token = re.findall('\\\\d+|[+-]', s)\\n return cal_expression(token)\",\n \"runtime\": \"326\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n charstack = []\\n for c in s:\\n if c in list(\\\"0123456789\\\"):\\n val = int(c)\\n if len(charstack) == 0 or not isinstance(charstack[-1], int):\\n charstack.append(val)\\n else:\\n charstack[-1] *= 10\\n charstack[-1] += val\\n elif c == \\\")\\\":\\n i = len(charstack) - 1\\n while charstack[i] != \\\"(\\\":\\n i -= 1\\n newval = self.calculate(charstack[i + 1:])\\n charstack = list(charstack[:i])\\n charstack.append(newval)\\n elif c == \\\" \\\":\\n continue\\n else:\\n charstack.append(c)\\n \\n i = 0\\n while i < len(charstack):\\n negative = False\\n while charstack[i] == \\\"-\\\":\\n negative = not negative\\n del charstack[i]\\n if negative:\\n charstack[i] *= -1\\n i += 1\\n\\n return sum([c for c in charstack if isinstance(c, int)])\\n\",\n \"runtime\": \"326\"\n },\n {\n \"code\": \"class Solution:\\n def next_num(self,s,p):\\n bp = p\\n if s[bp] == \\\"-\\\":\\n m = -1\\n bp += 1\\n else:\\n m = 1\\n plup = s.find(\\\"+\\\",bp)\\n minp = s.find(\\\"-\\\",bp)\\n if plup == -1 and minp == -1:\\n endp = len(s)+1\\n elif plup == -1 or (minp != -1 and minp < plup):\\n endp = minp\\n elif minp == -1 or (plup != -1 and minp > plup):\\n endp = plup\\n else:\\n endp = min(minp,plup)\\n return m * int(s[bp:endp]), endp-p\\n\\n def my_eval(self,s):\\n total = 0\\n if s == \\\"\\\":\\n return \\\"0\\\" \\n p = 0\\n nums = []\\n ops = []\\n while True:\\n #get the next digit\\n n,d = self.next_num(s,p)\\n p += d\\n nums.append(n)\\n if p+1 < len(s):\\n #get the next operator\\n ops.append(s[p])\\n p+=1\\n else:\\n break\\n # do calc\\n tot = nums[0]\\n for i in range(len(ops)):\\n if ops[i] == \\\"+\\\":\\n tot += nums[i+1]\\n else:\\n tot -= nums[i+1]\\n return str(tot)\\n \\n\\n\\n def calculate(self, s: str) -> int:\\n s = s.replace(\\\" \\\",\\\"\\\")\\n while True:\\n openb = s.find(\\\"(\\\")\\n if openb != -1:\\n # there are brackets; find the innermost\\n while True:\\n old_openb = openb\\n openb = s.find(\\\"(\\\",old_openb+1)\\n closeb = s.find(\\\")\\\",old_openb+1)\\n if openb > closeb or openb == -1:\\n break\\n e = self.my_eval(s[old_openb+1:closeb])\\n #check whether this bracket is negated:\\n if old_openb > 0:\\n if s[old_openb-1] == \\\"-\\\":\\n if old_openb == 1 or (old_openb>1 and s[old_openb-2]==\\\"(\\\"):\\n e = str(-int(e))\\n old_openb -= 1\\n s = s[:old_openb] + e + s[closeb+1:]\\n else:\\n return int(self.my_eval(s))\\n\\n\",\n \"runtime\": \"335\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n def tokenize(s: str):\\n tokens = []\\n num = \\\"\\\"\\n for char in s:\\n if char.isdecimal():\\n num += char\\n else:\\n if num:\\n tokens.append(int(num))\\n num = \\\"\\\"\\n match char:\\n case '+' | '-' | '(' | ')':\\n tokens.append(char)\\n if num:\\n tokens.append(int(num))\\n return tokens\\n def eval(tokens):\\n def eval_parens(tokens):\\n i = 0\\n total = 0\\n add = lambda x, y: x + y\\n sub = lambda x, y: x - y\\n op = add\\n while i < len(tokens):\\n token = tokens[i]\\n match token:\\n case '+':\\n op = add\\n # op = lambda x, y: x + y\\n case '-':\\n op = sub\\n # op = lambda x, y: x - y\\n case '(':\\n result, j = eval_parens(tokens[i + 1:])\\n i += j + 1\\n total = op(total, result)\\n case ')':\\n # print('i:', i, 'total:', total, 'tokens:', tokens[i:])\\n return total, i\\n case _: # int\\n total = op(total, token)\\n i += 1\\n # print('i:', i, 'total:', total, 'tokens:', tokens[i:])\\n return total, i\\n return eval_parens(tokens)[0]\\n return eval(tokenize(s))\\n # def eval(total, tokens):\\n # if len(tokens) <= 0:\\n # return (0, [])\\n # car = tokens[0]\\n # cdr = tokens[1:]\\n # while cdr:\\n # match car:\\n # case '+':\\n # result, cdr = eval(car, cdr)\\n # total += result\\n # case '-':\\n # result, cdr = eval(car, cdr)\\n # total -= result\\n # case '(':\\n # result, cdr = eval(0, cdr)\\n # case ')':\\n # result, cdr = eval(total, cdr)\\n # case _: # int\\n # return car, cdr\\n # return eval(0, tokenize(s))[0]\\n # def eval(result, tokens):\\n # i = 0\\n # while i < len(tokens):\\n # token = tokens[i]\\n # match token:\\n # case '+':\\n # ops.append(token)\\n # case '-':\\n # ops.append(token)\\n # case '(':\\n # tokens += eval(0, tokens[i + 1:])\\n # case ')':\\n # return (result, tokens[i + 1:])\\n # # ops.pop() # '('\\n # # finish evaluating space between parentheses (collapse)\\n # case _: # int\\n\\n # i += 1\\n\\n # def parse(tokens):\\n # ops = []\\n # outs = []\\n # i = 0\\n # while i < len(tokens):\\n # token = tokens[i]\\n # match token:\\n # case '+':\\n # ops.append(token)\\n # case '-':\\n # ops.append(token)\\n # case '(':\\n # ops.append(token)\\n # case ')':\\n # ops.pop() # '('\\n # # finish evaluating space between parentheses (collapse)\\n # case _: # int\\n\\n # i += 1\\n # class ASTNode:\\n # def eval(self):\\n # return\\n # class Sum:\\n # def __init__(self, left, right):\\n # self.op = lambda x, y: x + y\\n # self.left = left\\n # self.right = right\\n # def eval(self):\\n # return self.op(self.left, self.right)\\n # class Diff:\\n # def __init__(self, left, right):\\n # self.op = lambda x, y: x - y\\n # self.left = left\\n # self.right = right\\n # def eval(self):\\n # return self.op(self.left, self.right)\\n # class Unary:\\n # def __init__(self, op, child):\\n # self.op = lambda x: -x\\n # self.child = child\\n # def eval(self):\\n # return self.op(self.child)\\n # class Paren:\\n # def __init__(self, child)\\n # self.op = lambda x: x\\n # self.child = child\\n # def eval(self):\\n # return self.op(self.child)\\n\\n # def parse(a):\\n # # ops = []\\n # # outs = []\\n # tree = Paren(None)\\n # i = 0\\n # while i < len(s):\\n # token = a[i]\\n # match token:\\n # case '+':\\n # ops.append(token)\\n # case '-':\\n # ops.append(token)\\n # case '(':\\n # ops.append(token)\\n # case ')':\\n # ops.pop(token) # '('\\n # case _: # int\\n # if len(ops) > 0:\\n # op = ops.pop()\\n # match op:\\n # case '+':\\n # outs.append(outs.pop() + token)\\n # case '-':\\n # if len(ops) == 0 or ops[-1] == '(':\\n # outs.append(-token)\\n # else:\\n # outs.append(outs.pop() - token)\\n # case _:\\n # ops.append(op)\\n # out.append(token)\\n # i += 1\",\n \"runtime\": \"335\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(\\\" \\\", \\\"\\\")\\n a = []\\n ans = i = sub = 0\\n if s[0] == \\\"(\\\":\\n s = '+' + s\\n while i < len(s):\\n if s[i] in \\\"+-)\\\":\\n ans += int(s[:i] or 0)*(1-2*int(sub))\\n s = s[i:]\\n i = 0\\n if len(s)>1 and s[i+1] == '(':\\n sub ^= s[i] == '-'\\n a.append(s[i] == '-')\\n s = s[i+2:]\\n else:\\n i += 1\\n if s[0]==\\\")\\\":\\n sub ^= a.pop()\\n s = s[1:]\\n i = 0\\n else:\\n i += 1\\n return ans + int(s or 0)\",\n \"runtime\": \"343\"\n },\n {\n \"code\": \"class Solution:\\n def getNum(self,s):\\n if s[0] == '(':\\n return self.recursive_calc(s[1:])\\n i = 0\\n num = 0\\n while i<len(s) and s[i] >= '0' and s[i] <= '9':\\n num*=10\\n num += int(s[i]) \\n i+=1\\n return i,num \\n\\n def calculate(self, s: str) -> int:\\n s = s.replace(' ','')\\n return self.recursive_calc(s)[1]\\n \\n def recursive_calc(self,s):\\n i,res = self.getNum(s)\\n \\n num = 0\\n while i<len(s) and s[i]!=')':\\n j,num = self.getNum(s[i+1:])\\n match s[i]:\\n case '+':\\n res += num\\n case '-':\\n res -= num\\n i+=j+1\\n\\n return i+2,res\\n \\n \",\n \"runtime\": \"352\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n def tokenize(s: str):\\n tokens = []\\n num = \\\"\\\"\\n for char in s:\\n if char.isdecimal():\\n num += char\\n else:\\n if num:\\n tokens.append(int(num))\\n num = \\\"\\\"\\n match char:\\n case '+' | '-' | '(' | ')':\\n tokens.append(char)\\n if num:\\n tokens.append(int(num))\\n return tokens\\n def eval(tokens):\\n def eval_parens(tokens):\\n i = 0\\n total = 0\\n add = lambda x, y: x + y\\n sub = lambda x, y: x - y\\n op = add\\n while i < len(tokens):\\n token = tokens[i]\\n match token:\\n case '+':\\n op = add\\n # op = lambda x, y: x + y\\n case '-':\\n op = sub\\n # op = lambda x, y: x - y\\n case '(':\\n result, j = eval_parens(tokens[i + 1:])\\n i += j + 1\\n total = op(total, result)\\n case ')':\\n # print('i:', i, 'total:', total, 'tokens:', tokens[i:])\\n return total, i\\n case _: # int\\n total = op(total, token)\\n i += 1\\n # print('i:', i, 'total:', total, 'tokens:', tokens[i:])\\n return total, i\\n return eval_parens(tokens)[0]\\n return eval(tokenize(s))\\n # def eval(total, tokens):\\n # if len(tokens) <= 0:\\n # return (0, [])\\n # car = tokens[0]\\n # cdr = tokens[1:]\\n # while cdr:\\n # match car:\\n # case '+':\\n # result, cdr = eval(car, cdr)\\n # total += result\\n # case '-':\\n # result, cdr = eval(car, cdr)\\n # total -= result\\n # case '(':\\n # result, cdr = eval(0, cdr)\\n # case ')':\\n # result, cdr = eval(total, cdr)\\n # case _: # int\\n # return car, cdr\\n # return eval(0, tokenize(s))[0]\\n # def eval(result, tokens):\\n # i = 0\\n # while i < len(tokens):\\n # token = tokens[i]\\n # match token:\\n # case '+':\\n # ops.append(token)\\n # case '-':\\n # ops.append(token)\\n # case '(':\\n # tokens += eval(0, tokens[i + 1:])\\n # case ')':\\n # return (result, tokens[i + 1:])\\n # # ops.pop() # '('\\n # # finish evaluating space between parentheses (collapse)\\n # case _: # int\\n\\n # i += 1\\n\\n # def parse(tokens):\\n # ops = []\\n # outs = []\\n # i = 0\\n # while i < len(tokens):\\n # token = tokens[i]\\n # match token:\\n # case '+':\\n # ops.append(token)\\n # case '-':\\n # ops.append(token)\\n # case '(':\\n # ops.append(token)\\n # case ')':\\n # ops.pop() # '('\\n # # finish evaluating space between parentheses (collapse)\\n # case _: # int\\n\\n # i += 1\\n # class ASTNode:\\n # def eval(self):\\n # return\\n # class Sum:\\n # def __init__(self, left, right):\\n # self.op = lambda x, y: x + y\\n # self.left = left\\n # self.right = right\\n # def eval(self):\\n # return self.op(self.left, self.right)\\n # class Diff:\\n # def __init__(self, left, right):\\n # self.op = lambda x, y: x - y\\n # self.left = left\\n # self.right = right\\n # def eval(self):\\n # return self.op(self.left, self.right)\\n # class Unary:\\n # def __init__(self, op, child):\\n # self.op = lambda x: -x\\n # self.child = child\\n # def eval(self):\\n # return self.op(self.child)\\n # class Paren:\\n # def __init__(self, child)\\n # self.op = lambda x: x\\n # self.child = child\\n # def eval(self):\\n # return self.op(self.child)\\n\\n # def parse(a):\\n # # ops = []\\n # # outs = []\\n # tree = Paren(None)\\n # i = 0\\n # while i < len(s):\\n # token = a[i]\\n # match token:\\n # case '+':\\n # ops.append(token)\\n # case '-':\\n # ops.append(token)\\n # case '(':\\n # ops.append(token)\\n # case ')':\\n # ops.pop(token) # '('\\n # case _: # int\\n # if len(ops) > 0:\\n # op = ops.pop()\\n # match op:\\n # case '+':\\n # outs.append(outs.pop() + token)\\n # case '-':\\n # if len(ops) == 0 or ops[-1] == '(':\\n # outs.append(-token)\\n # else:\\n # outs.append(outs.pop() - token)\\n # case _:\\n # ops.append(op)\\n # out.append(token)\\n # i += 1\",\n \"runtime\": \"360\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(\\\" \\\", \\\"\\\")\\n a = []\\n ans = 0\\n sub = False\\n i = 0\\n if s[0] == \\\"(\\\":\\n s = '+' + s\\n while i < len(s):\\n if s[i] in \\\"+-)\\\":\\n c = s[:i]\\n if c and sub:\\n ans -= int(c)\\n elif c:\\n ans += int(c)\\n s = s[i:]\\n i = 0\\n if s[i] == '-':\\n if s[i+1] == '(':\\n a.append(0)\\n sub = not sub\\n s = s[i+2:]\\n else:\\n i += 1\\n elif s[i] == '+':\\n if s[i+1] == '(':\\n a.append(1)\\n s = s[i+2:]\\n else:\\n i += 1\\n else:\\n sub = sub if a.pop() else not sub\\n s = s[1:]\\n else:\\n i += 1\\n return ans + int(s or 0)\",\n \"runtime\": \"360\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(\\\" \\\", \\\"\\\")\\n a = []\\n ans = 0\\n sub = False\\n i = 0\\n if s[0] == \\\"(\\\":\\n s = '+' + s\\n while i < len(s):\\n if s[i] in \\\"+-)\\\":\\n ans += int(s[:i] or 0)*(1-2*int(sub))\\n s = s[i:]\\n i = 0\\n if len(s)>1 and s[i+1] == '(':\\n if s[i] == '-':\\n a.append(0)\\n sub = not sub\\n s = s[i+2:]\\n elif s[i] == '+':\\n a.append(1)\\n s = s[i+2:]\\n else:\\n i += 1\\n if s[0]==\\\")\\\":\\n sub = sub if a.pop() else not sub\\n s = s[1:]\\n i = 0\\n else:\\n i += 1\\n return ans + int(s or 0)\",\n \"runtime\": \"369\"\n },\n {\n \"code\": \"nums = set(map(chr, range(ord('0'), ord('9') + 1)))\\ndef calc_func(c: str):\\n if c == '+':\\n return lambda a, b: a + b\\n elif c == '-':\\n return lambda a, b: a - b\\n else:\\n raise Exception(\\\"bozo\\\")\\n\\ndef get_num(s: str) -> (int, int):\\n # takewhile isnum s\\n i = 0\\n c = ''\\n while i < len(s) and s[i] in nums:\\n c += s[i]\\n i += 1\\n return int(c), len(c)\\n \\nclass Solution:\\n def calculate(self, s: str) -> int:\\n print(nums)\\n return self._calculate(''.join([c for c in s if c != ' ']))\\n def _calculate(self, s: str) -> int:\\n i = 0\\n stack = [(0, 1)]\\n while i < len(s):\\n if s[i] == '-':\\n if s[i+1] in nums:\\n # negative number\\n n, num_taken = get_num(s[i+1:])\\n stack[-1] = stack[-1][0] - n, stack[-1][1]\\n i += num_taken + 1\\n elif s[i+1] == '(':\\n stack.append((0, -1))\\n i += 2\\n else:\\n raise Exception(\\\"formatting error\\\")\\n elif s[i] in nums:\\n n, num_taken = get_num(s[i:])\\n stack[-1] = stack[-1][0] + n, stack[-1][1]\\n i += num_taken\\n elif s[i] == '(':\\n stack.append((0, 1))\\n i += 1\\n elif s[i] == ')':\\n v = stack.pop(-1)\\n if len(stack) == 0:\\n return v[0] * v[1]\\n else:\\n stack[-1] = stack[-1][0] + v[0] * v[1], stack[-1][1]\\n i += 1\\n else:\\n i += 1\\n if len(stack) > 1:\\n raise Exception(\\\"bruh\\\")\\n return stack[0][0] * stack[0][1]\\n\",\n \"runtime\": \"369\"\n },\n {\n \"code\": \"class Solution:\\n def is_digit(self, char: str) -> bool:\\n return char in (str(i) for i in range(10))\\n\\n def is_number(self, token: str) -> bool:\\n try:\\n int(token)\\n return True\\n except Exception as _:\\n return False\\n\\n def is_operation(self, char: str) -> bool:\\n return char in (\\\"-\\\", \\\"+\\\")\\n\\n def eval_operation(self, left: str, right: str, op: str) -> str:\\n if op == \\\"+\\\":\\n return str(int(left) + int(right))\\n return str(int(left) - int(right))\\n\\n def calculate(self, s: str) -> int:\\n tokens = []\\n digits_buffer = []\\n for char in s:\\n if char == \\\" \\\":\\n continue\\n\\n if self.is_digit(char):\\n if len(tokens) and tokens[-1] == \\\"-\\\" and (len(tokens) == 1 or (tokens[-2] != \\\")\\\" and not self.is_number(tokens[-2]))):\\n digits_buffer.append(tokens.pop(-1))\\n digits_buffer.append(char)\\n continue\\n elif len(digits_buffer):\\n tokens.append(int(\\\"\\\".join(digits_buffer) if len(digits_buffer) > 1 else digits_buffer[0]))\\n digits_buffer = []\\n\\n tokens.append(char)\\n\\n if digits_buffer:\\n tokens.append(int(\\\"\\\".join(digits_buffer) if len(digits_buffer) > 1 else digits_buffer[0]))\\n\\n expressions = []\\n for token in tokens:\\n if self.is_number(token):\\n last_char_is_operation = len(expressions) and self.is_operation(expressions[-1])\\n if last_char_is_operation:\\n operation = expressions.pop()\\n left_operand = expressions.pop()\\n expressions.append(self.eval_operation(left_operand, token, operation))\\n else:\\n expressions.append(token)\\n\\n elif self.is_operation(token):\\n expressions.append(token)\\n else:\\n if token == \\\"(\\\":\\n expressions.append(token)\\n else:\\n expression = expressions.pop()\\n expressions.pop()\\n last_char_is_operation = len(expressions) and self.is_operation(expressions[-1])\\n if last_char_is_operation:\\n operation = expressions.pop()\\n if len(expressions) and self.is_number(expressions[-1]):\\n left_operand = expressions.pop()\\n expressions.append(self.eval_operation(left_operand, expression, operation))\\n else:\\n expressions.append(str(-int(expression)))\\n else:\\n expressions.append(expression)\\n\\n return int(expressions.pop())\\n\",\n \"runtime\": \"377\"\n },\n {\n \"code\": \"class Expr:\\n def __init__(self, value: str, left: 'Expr' = None, right: 'Expr' = None):\\n self.value = value\\n self.left = left\\n self.right = right\\n\\n # def toString(self):\\n # s = self.value\\n # hasLeft = self.left is not None\\n # hasRight = self.right is not None\\n # if not (hasLeft or hasRight):\\n # return s\\n # s += \\\"(\\\"\\n # if hasLeft:\\n # s += self.left.toString()\\n # if hasRight:\\n # s += \\\" \\\"\\n # s += self.right.toString()\\n # s += \\\")\\\"\\n # return s\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n root = Parser(s).parse()\\n #print(root.toString())\\n return self.evaluate(root)\\n\\n def evaluate(self, expr: Expr) -> int:\\n if expr.value.isdigit():\\n return int(expr.value)\\n elif expr.value == '-':\\n if expr.right is None:\\n return -self.evaluate(expr.left)\\n else:\\n return self.evaluate(expr.left) - self.evaluate(expr.right)\\n elif expr.value == '+':\\n return self.evaluate(expr.left) + self.evaluate(expr.right)\\n elif expr.value == '/':\\n return self.evaluate(expr.left) / self.evaluate(expr.right)\\n elif expr.value == '*':\\n return self.evaluate(expr.left) * self.evaluate(expr.right) \\n\\nclass Parser:\\n def __init__(self, tokens: str):\\n self.tokens = tokens\\n self.current = 0\\n\\n def parse(self) -> Expr:\\n return self.term()\\n \\n def term(self) -> Expr:\\n expr = self.factor()\\n matched, token = self.tryMatch(\\\"+-\\\")\\n while matched:\\n right = self.factor()\\n expr = Expr(token, expr, right)\\n matched, token = self.tryMatch(\\\"+-\\\")\\n return expr\\n\\n def factor(self) -> Expr:\\n expr = self.negative()\\n matched, token = self.tryMatch(\\\"*/\\\")\\n while matched:\\n right = self.negative()\\n expr = Expr(token, expr, right)\\n matched, token = self.tryMatch(\\\"*/\\\")\\n return expr\\n\\n def negative(self) -> Expr:\\n if self.match(\\\"-\\\"):\\n return Expr(\\\"-\\\", self.group())\\n return self.group()\\n\\n def group(self) -> Expr:\\n if self.match(\\\"(\\\"):\\n expr = self.parse()\\n self.pop()\\n return expr\\n return self.number()\\n\\n def number(self) -> Expr:\\n s = \\\"\\\"\\n while self.peek() is not None and self.peek().isdigit():\\n s += self.pop()\\n return Expr(s)\\n \\n def tryMatch(self, template:str) -> (bool, str):\\n for c in template:\\n if self.peek() == c:\\n self.current += 1\\n return True, c\\n return False, None\\n\\n def match(self, token:str) -> str:\\n if self.peek() == token:\\n self.current += 1\\n return True\\n return False\\n\\n def pop(self) -> str:\\n self.token = self.peek()\\n self.current += 1\\n return self.token\\n\\n def peek(self) -> str:\\n self.trim()\\n if self.current >= len(self.tokens):\\n return None\\n return self.tokens[self.current]\\n\\n def trim(self):\\n while (self.current < len(self.tokens) and \\n self.tokens[self.current] == ' '):\\n self.current += 1\\n\",\n \"runtime\": \"377\"\n },\n {\n \"code\": \"class Expr:\\n def __init__(self, value: str, left: 'Expr' = None, right: 'Expr' = None):\\n self.value = value\\n self.left = left\\n self.right = right\\n\\n # def toString(self):\\n # s = self.value\\n # hasLeft = self.left is not None\\n # hasRight = self.right is not None\\n # if not (hasLeft or hasRight):\\n # return s\\n # s += \\\"(\\\"\\n # if hasLeft:\\n # s += self.left.toString()\\n # if hasRight:\\n # s += \\\" \\\"\\n # s += self.right.toString()\\n # s += \\\")\\\"\\n # return s\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n root = Parser(s).parse()\\n #print(root.toString())\\n return self.evaluate(root)\\n\\n def evaluate(self, expr: Expr) -> int:\\n if expr.value.isdigit():\\n return int(expr.value)\\n elif expr.value == '-':\\n if expr.right is None:\\n return -self.evaluate(expr.left)\\n else:\\n return self.evaluate(expr.left) - self.evaluate(expr.right)\\n elif expr.value == '+':\\n return self.evaluate(expr.left) + self.evaluate(expr.right)\\n elif expr.value == '/':\\n return self.evaluate(expr.left) / self.evaluate(expr.right)\\n elif expr.value == '*':\\n return self.evaluate(expr.left) * self.evaluate(expr.right) \\n\\nclass Parser:\\n def __init__(self, tokens: str):\\n self.tokens = tokens\\n self.current = 0\\n\\n def parse(self) -> Expr:\\n return self.term()\\n \\n def term(self) -> Expr:\\n expr = self.factor()\\n matched, token = self.tryMatch(\\\"+-\\\")\\n while matched:\\n right = self.factor()\\n expr = Expr(token, expr, right)\\n matched, token = self.tryMatch(\\\"+-\\\")\\n return expr\\n\\n def factor(self) -> Expr:\\n expr = self.negative()\\n matched, token = self.tryMatch(\\\"*/\\\")\\n while matched:\\n right = self.negative()\\n expr = Expr(token, expr, right)\\n matched, token = self.tryMatch(\\\"*/\\\")\\n return expr\\n\\n def negative(self) -> Expr:\\n if self.match(\\\"-\\\"):\\n return Expr(\\\"-\\\", self.group())\\n return self.group()\\n\\n def group(self) -> Expr:\\n if self.match(\\\"(\\\"):\\n expr = self.parse()\\n self.pop()\\n return expr\\n return self.number()\\n\\n def number(self) -> Expr:\\n s = \\\"\\\"\\n while self.peek() is not None and self.peek().isdigit():\\n s += self.pop()\\n return Expr(s)\\n \\n def tryMatch(self, template:str) -> (bool, str):\\n for c in template:\\n if self.peek() == c:\\n self.current += 1\\n return True, c\\n return False, None\\n\\n def match(self, token:str) -> str:\\n if self.peek() == token:\\n self.current += 1\\n return True\\n return False\\n\\n def pop(self) -> str:\\n self.token = self.peek()\\n self.current += 1\\n return self.token\\n\\n def peek(self) -> str:\\n self.trim()\\n if self.current >= len(self.tokens):\\n return None\\n return self.tokens[self.current]\\n\\n def trim(self):\\n while (self.current < len(self.tokens) and \\n self.tokens[self.current] == ' '):\\n self.current += 1\\n\",\n \"runtime\": \"386\"\n },\n {\n \"code\": \"class Solution:\\n def parse_int(self, s: str) -> (int, int):\\n val = 0\\n i = 0\\n while i < len(s):\\n if '0' <= s[i] <= '9':\\n val = val * 10 + int(s[i]) \\n i += 1 \\n else:\\n return (val, i) \\n return (val, i)\\n\\n def parse_parentheses(self, s: str) -> (int, int):\\n val_stack = []\\n op_stack = []\\n i = 0\\n seen_op = True\\n while i < len(s):\\n if s[i] == '(': \\n i += 1\\n (val, j) = self.parse_parentheses(s[i:])\\n val_stack.append(val)\\n i += j\\n seen_op = False\\n elif s[i] == ')':\\n i += 1\\n return (val_stack.pop(), i)\\n elif s[i] == '+': \\n op_stack.append('binary_+')\\n i += 1 \\n seen_op = True\\n elif s[i] == '-': \\n op_stack.append('binary_-' if not seen_op else 'unary_-') \\n i += 1 \\n seen_op = True\\n else: \\n (val, j) = self.parse_int(s[i:])\\n val_stack.append(val)\\n i += j\\n seen_op = False\\n if not seen_op and op_stack:\\n op = op_stack.pop(-1)\\n if op == 'unary_-':\\n a = val_stack.pop(-1)\\n val_stack.append(-a)\\n elif op == 'binary_+':\\n b = val_stack.pop(-1)\\n a = val_stack.pop(-1)\\n val_stack.append(a + b)\\n elif op == 'binary_-':\\n b = val_stack.pop(-1)\\n a = val_stack.pop(-1)\\n val_stack.append(a - b)\\n return (val_stack.pop(), i)\\n\\n def calculate(self, s: str) -> int:\\n (val, i) = self.parse_parentheses(s.replace(' ', ''))\\n return val\\n \",\n \"runtime\": \"386\"\n },\n {\n \"code\": \"nums = set(map(chr, range(ord('0'), ord('9') + 1)))\\ndef get_num(s: str) -> (int, int):\\n # takewhile isnum s\\n i = 0\\n c = ''\\n while i < len(s) and s[i] in nums:\\n c += s[i]\\n i += 1\\n return int(c), len(c)\\n \\nclass Solution:\\n def calculate(self, s: str) -> int:\\n return self._calculate(''.join([c for c in s if c != ' ']))\\n def _calculate(self, s: str) -> int:\\n i = 0\\n stack = [(0, 1)]\\n while i < len(s):\\n if s[i] == '-':\\n if s[i+1] in nums:\\n # negative number\\n n, num_taken = get_num(s[i+1:])\\n stack[-1] = stack[-1][0] - n, stack[-1][1]\\n i += num_taken + 1\\n elif s[i+1] == '(':\\n stack.append((0, -1))\\n i += 2\\n elif s[i] in nums:\\n n, num_taken = get_num(s[i:])\\n stack[-1] = stack[-1][0] + n, stack[-1][1]\\n i += num_taken\\n elif s[i] == '(':\\n stack.append((0, 1))\\n i += 1\\n elif s[i] == ')':\\n v = stack.pop(-1)\\n if len(stack) == 0:\\n return v[0] * v[1]\\n else:\\n stack[-1] = stack[-1][0] + v[0] * v[1], stack[-1][1]\\n i += 1\\n else:\\n i += 1\\n return stack[0][0] * stack[0][1]\\n\",\n \"runtime\": \"394\"\n },\n {\n \"code\": \" \\nclass Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(\\\" \\\", \\\"\\\")\\n\\n def expression(i):\\n n, i = factor(i)\\n while i < len(s) and s[i] in \\\"+-\\\":\\n op = s[i]\\n next_factor, i = factor(i + 1)\\n n = {\\n \\\"+\\\": n.__add__,\\n \\\"-\\\": n.__sub__,\\n }[op](next_factor)\\n return n, i \\n \\n def factor(i):\\n n, i = primary(i)\\n while i < len(s) and s[i] in \\\"*/\\\":\\n op = s[i]\\n next_primary, i = primary(i + 1)\\n n = {\\n \\\"*\\\": n.__mul__,\\n \\\"/\\\": n.__div__,\\n }[op](next_primary)\\n return n, i \\n \\n def primary(i):\\n if s.startswith(\\\"-\\\", i):\\n inner, i = factor(i + 1)\\n return -inner, i\\n if s.startswith(\\\"(\\\", i):\\n inner, i = expression(i + 1)\\n return inner, i + 1\\n for end, char in enumerate(s[i + 1:], start=i + 1):\\n if not s[end].isdigit():\\n return int(s[i:end]), end\\n return int(s[i:]), len(s)\\n \\n return expression(0)[0]\\n \\n \\n \",\n \"runtime\": \"403\"\n },\n {\n \"code\": \" \\nclass Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(\\\" \\\", \\\"\\\")\\n\\n def expression(i):\\n n, i = factor(i)\\n while i < len(s) and s[i] in \\\"+-\\\":\\n op = s[i]\\n next_factor, i = factor(i + 1)\\n n = {\\n \\\"+\\\": n.__add__,\\n \\\"-\\\": n.__sub__,\\n }[op](next_factor)\\n return n, i \\n \\n def factor(i):\\n n, i = primary(i)\\n while i < len(s) and s[i] in \\\"*/\\\":\\n op = s[i]\\n next_primary, i = primary(i + 1)\\n n = {\\n \\\"*\\\": n.__mul__,\\n \\\"/\\\": n.__div__,\\n }[op](next_primary)\\n return n, i \\n \\n def primary(i):\\n if s.startswith(\\\"-\\\", i):\\n inner, i = factor(i + 1)\\n return -inner, i\\n if s.startswith(\\\"(\\\", i):\\n inner, i = expression(i + 1)\\n return inner, i + 1\\n for end, char in enumerate(s[i + 1:], start=i + 1):\\n if not char.isdigit():\\n return int(s[i:end]), end\\n return int(s[i:]), len(s)\\n \\n return expression(0)[0]\\n \\n \\n \",\n \"runtime\": \"403\"\n },\n {\n \"code\": \"import re\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(\\\" \\\", \\\"\\\")\\n\\n def expression(i):\\n n, i = factor(i)\\n while i < len(s) and s[i] in \\\"+-\\\":\\n op = s[i]\\n next_factor, i = factor(i + 1)\\n n = {\\n \\\"+\\\": n.__add__,\\n \\\"-\\\": n.__sub__,\\n }[op](next_factor)\\n return n, i \\n \\n def factor(i):\\n n, i = primary(i)\\n while i < len(s) and s[i] in \\\"*/\\\":\\n op = s[i]\\n next_primary, i = primary(i + 1)\\n n = {\\n \\\"*\\\": n.__mul__,\\n \\\"/\\\": n.__div__,\\n }[op](next_primary)\\n return n, i \\n \\n NUMBER = re.compile(r\\\"\\\\d+\\\")\\n def primary(i):\\n if s.startswith(\\\"-\\\", i):\\n inner, i = primary(i + 1)\\n return -inner, i\\n if s.startswith(\\\"(\\\", i):\\n inner, i = expression(i + 1)\\n return inner, i + 1\\n\\n for end, char in enumerate(s[(end := i + 1):], start=end):\\n if not char.isdigit():\\n break\\n else:\\n return int(s[i:]), len(s)\\n return int(s[i:end]), end\\n return expression(0)[0]\\n \\n \\n \",\n \"runtime\": \"411\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n st = [] # (), +, -\\n subst = \\\"\\\"\\n for r in range(len(s)):\\n if s[r].isnumeric():\\n subst += s[r]\\n elif s[r] == '(':\\n st.append('(')\\n subst = \\\"\\\"\\n elif s[r] == ')':\\n cum = 0\\n if subst:\\n st.append(eval(subst))\\n subst = \\\"\\\"\\n while st[-1] != '(':\\n v = st.pop()\\n sign = -1 if st and st[-1] == '-' else 1\\n cum += sign * v\\n if st[-1] in ['-', '+']:\\n st.pop()\\n st.pop()\\n st.append(cum)\\n elif s[r] == '+':\\n if subst: \\n st.append(eval(subst))\\n subst = \\\"\\\"\\n st.append('+')\\n elif s[r] == '-':\\n if subst:\\n st.append(eval(subst))\\n subst = \\\"\\\"\\n st.append('-')\\n if subst:\\n st.append(eval(subst))\\n \\n cum = 0\\n while len(st) > 0:\\n v = st.pop()\\n sign = -1 if st and st[-1] == '-' else 1\\n cum += sign * v\\n if st and st[-1] in ['-', '+']:\\n st.pop()\\n return cum\",\n \"runtime\": \"420\"\n },\n {\n \"code\": \"from dataclasses import dataclass\\nfrom abc import ABC, abstractmethod\\n\\nclass Input:\\n s: str\\n start: int\\n\\n def __init__(self, s: str, start=0):\\n self.s = s\\n self.start = start\\n \\n def __getitem__(self, idx):\\n match idx:\\n case slice(start=start):\\n return Input(self.s, self.start + start)\\n case int():\\n return self.s[self.start + idx]\\n \\n def __len__(self):\\n return len(self.s) - self.start\\n\\ndef space(s: str) -> str:\\n while len(s) > 0 and s[0] == \\\" \\\":\\n s = s[1:]\\n return s\\n\\ndef literal(s: str) -> tuple[str, int]:\\n s = space(s)\\n\\n if len(s) == 0 or s[0] not in \\\"0123456789\\\":\\n return s, None\\n\\n value = 0\\n\\n while len(s) > 0 and s[0] in \\\"0123456789\\\":\\n value *= 10\\n value += int(s[0])\\n s = s[1:]\\n\\n # print(f\\\"LITERAL {value}\\\")\\n return s, value\\n\\ndef op(s: str) -> tuple[str, Callable[[int, int], int], str]:\\n def plus(a, b):\\n return a + b\\n def minus(a, b):\\n return a - b\\n\\n s = space(s)\\n\\n if len(s) == 0:\\n return s, None, None\\n\\n if s[0] == \\\"+\\\":\\n # print(\\\"PLUS\\\")\\n return s[1:], plus, \\\"+\\\"\\n if s[0] == \\\"-\\\":\\n # print(\\\"MINUS\\\")\\n return s[1:], minus, \\\"-\\\"\\n\\n return s, None, None\\n\\ndef expr(s: str) -> tuple[str, int]:\\n return bin_op(s)\\n\\ndef bin_op(s: str) -> tuple[str, int]:\\n # print(f\\\"BINOP with `{s}`\\\")\\n s, lhs = negate(s)\\n result = lhs\\n\\n while True:\\n s_, o, op_str = op(s)\\n if o is None:\\n break\\n s = s_\\n\\n s, rhs = negate(s)\\n if rhs is None:\\n return s, None\\n \\n result = o(result, rhs)\\n\\n # print(f\\\"BINOP {result}\\\")\\n return s, result\\n\\ndef negate(s: str) -> tuple[str, int]:\\n # print(f\\\"NEGATE with `{s}`\\\")\\n s = space(s)\\n\\n if len(s) == 0:\\n return s, None\\n \\n if s[0] == \\\"-\\\":\\n s, inner = base(s[1:])\\n\\n if inner is None:\\n return s, None\\n\\n # print(f\\\"NEGATE {inner}\\\")\\n return s, -inner\\n \\n return base(s)\\n\\ndef base(s: str) -> tuple[str, int]:\\n # print(f\\\"BASE with `{s}`\\\")\\n s = space(s)\\n\\n if len(s) == 0:\\n return s, None\\n \\n s_, l = literal(s)\\n if l is not None:\\n return s_, l\\n \\n s_, g = group(s)\\n if g is not None:\\n return s_, g\\n \\n return s, None\\n\\ndef group(s: str) -> tuple[str, int]:\\n s = space(s)\\n\\n if len(s) == 0 or s[0] != \\\"(\\\":\\n return s, None\\n \\n s, inner = expr(s[1:])\\n if inner is None:\\n return s, None\\n \\n s = space(s)\\n \\n if len(s) == 0 or s[0] != \\\")\\\":\\n return s, None\\n \\n # print(f\\\"GROUP {inner}\\\")\\n return s[1:], inner\\n\\n\\n\\\"\\\"\\\"\\nEXPR = BINOP\\nBINOP = NEG ( OP NEG )*\\nNEG = \\\"-\\\"? BASE\\nBASE = \\\"(\\\" EXPR \\\")\\\"\\n | LITERAL\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n s, e = expr(Input(s))\\n # print(e)\\n\\n return e\\n \",\n \"runtime\": \"437\"\n },\n {\n \"code\": \"from abc import ABC, abstractmethod\\nfrom dataclasses import dataclass\\nfrom typing import Callable, Iterable, Literal, TypeAlias, assert_never\\n\\nTokenTypes: TypeAlias = Literal[\\n \\\"Number\\\", \\\"Plus\\\", \\\"Minus\\\", \\\"LeftParenthesis\\\", \\\"RightParenthesis\\\", \\\"EOF\\\"\\n]\\nLiteralValue: TypeAlias = int\\n\\n\\n@dataclass\\nclass Token:\\n token_type: TokenTypes\\n lexeme: str\\n position: int\\n literal: LiteralValue | None\\n\\n\\nclass Lexer:\\n def __init__(self, source: str):\\n self.source = source\\n self.start = 0\\n self.current = 0\\n return super().__init__()\\n\\n def exhausted(self):\\n return self.current >= len(self.source)\\n\\n def _consume(self):\\n return self.source[self._advance()]\\n\\n def _peek(self):\\n return None if self.exhausted() else self.source[self.current]\\n\\n def _advance(self):\\n self.current = (current := self.current) + 1\\n return current\\n\\n def _make(\\n self, token_type: TokenTypes, parse: Callable[[str], LiteralValue] | None = None\\n ):\\n lexeme = self._lexeme()\\n literal = None if parse is None else parse(lexeme)\\n return Token(token_type, lexeme, self.start, literal)\\n\\n def _lexeme(self):\\n return self.source[self.start : self.current]\\n\\n def __iter__(self):\\n return self\\n\\n def __next__(self):\\n while not self.exhausted():\\n if (token := self._get()) is not None:\\n return token\\n raise StopIteration\\n\\n def _get(self):\\n self.start = self.current\\n match (consumed := self._consume()):\\n case \\\" \\\":\\n return None\\n case \\\"(\\\":\\n return self._make(\\\"LeftParenthesis\\\")\\n case \\\")\\\":\\n return self._make(\\\"RightParenthesis\\\")\\n case \\\"+\\\":\\n return self._make(\\\"Plus\\\")\\n case \\\"-\\\":\\n return self._make(\\\"Minus\\\")\\n case d if d.isdigit():\\n while (peek := self._peek()) is not None and peek.isdigit():\\n self._advance()\\n return self._make(\\\"Number\\\", int)\\n case other:\\n raise ValueError(f\\\"Invalid token {other!r}!\\\")\\n assert_never(consumed)\\n\\n\\nclass Expression(ABC):\\n @abstractmethod\\n def evaluate(self) -> int: ...\\n\\n @abstractmethod\\n def __str__(self) -> str: ...\\n\\n\\nclass NumberLiteral(Expression):\\n def __init__(self, value: int):\\n self.value = value\\n return super().__init__()\\n\\n def evaluate(self) -> int:\\n return self.value\\n\\n def __str__(self) -> str:\\n return str(self.value)\\n\\n\\nclass UnaryExpression(Expression):\\n def __init__(self, expr: Expression, operator: Token):\\n self.expr = expr\\n self.operator = operator\\n return super().__init__()\\n\\n def evaluate(self) -> int:\\n value = self.expr.evaluate()\\n match (token_type := self.operator.token_type):\\n case \\\"Minus\\\":\\n return -value\\n case other:\\n raise Exception(f\\\"Invalid unary expression token {other!r}!\\\")\\n assert_never(token_type)\\n\\n def __str__(self) -> str:\\n return f\\\"({self.operator.token_type} {self.expr})\\\"\\n\\n\\nclass BinaryExpression(Expression):\\n def __init__(self, left: Expression, operator: Token, right: Expression):\\n self.left = left\\n self.operator = operator\\n self.right = right\\n return super().__init__()\\n\\n def evaluate(self) -> int:\\n left = self.left.evaluate()\\n right = self.right.evaluate()\\n match (token_type := self.operator.token_type):\\n case \\\"Plus\\\":\\n return left + right\\n case \\\"Minus\\\":\\n return left - right\\n case other:\\n raise Exception(f\\\"Invalid binary expression token {other!r}!\\\")\\n assert_never(token_type)\\n\\n def __str__(self) -> str:\\n return f\\\"({self.operator.token_type} {self.left} {self.right})\\\"\\n\\n\\nclass ParseException(Exception):\\n def __init__(self, token: Token | None, message: str, *args: object):\\n self.token = token\\n super().__init__(message, *args)\\n\\n\\nclass Parser:\\n def __init__(self, tokens: Iterable[Token]):\\n self.tokens = iter(tokens)\\n self._exhausted = False\\n self._peeked = None\\n return super().__init__()\\n\\n def _match_any(self, *expected: TokenTypes):\\n for exp in expected:\\n if (matched := self._match(exp)) is not None:\\n return matched\\n return None\\n\\n def _match(self, expected: TokenTypes):\\n if self._exhausted:\\n return None\\n if (token := self._peek()) is not None and token.token_type == expected:\\n return self._advance()\\n return None\\n\\n def _peek(self):\\n if (peeked := self._peeked) is not None:\\n return peeked\\n peeked = self._advance()\\n self._peeked = peeked\\n return peeked\\n\\n def _advance(self):\\n if (peeked := self._peeked) is not None:\\n self._peeked = None\\n return peeked\\n try:\\n return next(self.tokens)\\n except StopIteration:\\n return None\\n\\n def _left_assoc(self, read: Callable[[], Expression], *infix: TokenTypes):\\n expr = read()\\n while (matched := self._match_any(*infix)) is not None:\\n right = read()\\n expr = BinaryExpression(expr, matched, right)\\n return expr\\n\\n def consume(self, expected: TokenTypes):\\n if (matched := self._match(expected)) is None:\\n peek = self._peek()\\n gotten = \\\"nothing\\\" if peek is None else peek.token_type\\n raise ParseException(peek, f\\\"Expected {expected}, but got {gotten}!\\\")\\n return matched\\n\\n def expression(self) -> Expression:\\n return self.term()\\n\\n def term(self):\\n return self._left_assoc(self.unary, \\\"Plus\\\", \\\"Minus\\\")\\n\\n def unary(self) -> Expression:\\n if (matched := self._match_any(\\\"Minus\\\")) is not None:\\n expr = self.unary()\\n return UnaryExpression(expr, matched)\\n return self.primary()\\n\\n def primary(self):\\n if self._match(\\\"LeftParenthesis\\\") is not None:\\n expr = self.expression()\\n self.consume(\\\"RightParenthesis\\\")\\n return expr\\n number = self.consume(\\\"Number\\\")\\n if (literal := number.literal) is None:\\n raise Exception(\\\"Found number token without literal!\\\")\\n return NumberLiteral(literal)\\n\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n lexer = Lexer(s)\\n parser = Parser(lexer)\\n try:\\n expr = parser.expression()\\n except ParseException as e:\\n if (token := e.token) is not None:\\n start = token.position\\n end = start + len(token.lexeme)\\n highlight = f\\\"{s[:start]} > {s[start:end]} < {s[end:]}\\\"\\n e.add_note(f\\\"Error at: {highlight}\\\")\\n raise e\\n return expr.evaluate()\\n\",\n \"runtime\": \"446\"\n },\n {\n \"code\": \"from abc import ABC, abstractmethod\\nfrom dataclasses import dataclass\\nfrom typing import Callable, Iterable, Literal, TypeAlias, assert_never\\n\\nTokenTypes: TypeAlias = Literal[\\n \\\"Number\\\", \\\"Plus\\\", \\\"Minus\\\", \\\"LeftParenthesis\\\", \\\"RightParenthesis\\\", \\\"EOF\\\"\\n]\\nLiteralValue: TypeAlias = int\\n\\n\\n@dataclass\\nclass Token:\\n token_type: TokenTypes\\n lexeme: str\\n position: int\\n literal: LiteralValue | None\\n\\n\\nclass Lexer:\\n def __init__(self, source: str):\\n self.source = source\\n self.start = 0\\n self.current = 0\\n return super().__init__()\\n\\n def exhausted(self):\\n return self.current >= len(self.source)\\n\\n def _consume(self):\\n return self.source[self._advance()]\\n\\n def _peek(self):\\n return None if self.exhausted() else self.source[self.current]\\n\\n def _advance(self):\\n self.current = (current := self.current) + 1\\n return current\\n\\n def _make(\\n self, token_type: TokenTypes, parse: Callable[[str], LiteralValue] | None = None\\n ):\\n lexeme = self._lexeme()\\n literal = None if parse is None else parse(lexeme)\\n return Token(token_type, lexeme, self.start, literal)\\n\\n def _lexeme(self):\\n return self.source[self.start : self.current]\\n\\n def __iter__(self):\\n return self\\n\\n def __next__(self):\\n while not self.exhausted():\\n if (token := self._get()) is not None:\\n return token\\n raise StopIteration\\n\\n def _get(self):\\n self.start = self.current\\n match (consumed := self._consume()):\\n case \\\" \\\":\\n return None\\n case \\\"(\\\":\\n return self._make(\\\"LeftParenthesis\\\")\\n case \\\")\\\":\\n return self._make(\\\"RightParenthesis\\\")\\n case \\\"+\\\":\\n return self._make(\\\"Plus\\\")\\n case \\\"-\\\":\\n return self._make(\\\"Minus\\\")\\n case d if d.isdigit():\\n while (peek := self._peek()) is not None and peek.isdigit():\\n self._advance()\\n return self._make(\\\"Number\\\", int)\\n case other:\\n raise ValueError(f\\\"Invalid token {other!r}!\\\")\\n assert_never(consumed)\\n\\n\\nclass Expression(ABC):\\n @abstractmethod\\n def evaluate(self) -> int: ...\\n\\n @abstractmethod\\n def __str__(self) -> str: ...\\n\\n\\nclass NumberLiteral(Expression):\\n def __init__(self, value: int):\\n self.value = value\\n return super().__init__()\\n\\n def evaluate(self) -> int:\\n return self.value\\n\\n def __str__(self) -> str:\\n return str(self.value)\\n\\n\\nclass UnaryExpression(Expression):\\n def __init__(self, expr: Expression, operator: Token):\\n self.expr = expr\\n self.operator = operator\\n return super().__init__()\\n\\n def evaluate(self) -> int:\\n value = self.expr.evaluate()\\n match (token_type := self.operator.token_type):\\n case \\\"Minus\\\":\\n return -value\\n case other:\\n raise Exception(f\\\"Invalid unary expression token {other!r}!\\\")\\n assert_never(token_type)\\n\\n def __str__(self) -> str:\\n return f\\\"({self.operator.token_type} {self.expr})\\\"\\n\\n\\nclass BinaryExpression(Expression):\\n def __init__(self, left: Expression, operator: Token, right: Expression):\\n self.left = left\\n self.operator = operator\\n self.right = right\\n return super().__init__()\\n\\n def evaluate(self) -> int:\\n left = self.left.evaluate()\\n right = self.right.evaluate()\\n match (token_type := self.operator.token_type):\\n case \\\"Plus\\\":\\n return left + right\\n case \\\"Minus\\\":\\n return left - right\\n case other:\\n raise Exception(f\\\"Invalid binary expression token {other!r}!\\\")\\n assert_never(token_type)\\n\\n def __str__(self) -> str:\\n return f\\\"({self.operator.token_type} {self.left} {self.right})\\\"\\n\\n\\nclass ParseException(Exception):\\n def __init__(self, token: Token | None, message: str, *args: object):\\n self.token = token\\n super().__init__(message, *args)\\n\\n\\nclass Parser:\\n def __init__(self, tokens: Iterable[Token]):\\n self.tokens = iter(tokens)\\n self._exhausted = False\\n self._peeked = None\\n return super().__init__()\\n\\n def _match_any(self, *expected: TokenTypes):\\n for exp in expected:\\n if (matched := self._match(exp)) is not None:\\n return matched\\n return None\\n\\n def _match(self, expected: TokenTypes):\\n if self._exhausted:\\n return None\\n if (token := self._peek()) is not None and token.token_type == expected:\\n return self._advance()\\n return None\\n\\n def _peek(self):\\n if (peeked := self._peeked) is not None:\\n return peeked\\n peeked = self._advance()\\n self._peeked = peeked\\n return peeked\\n\\n def _advance(self):\\n if (peeked := self._peeked) is not None:\\n self._peeked = None\\n return peeked\\n try:\\n return next(self.tokens)\\n except StopIteration:\\n return None\\n\\n def _left_assoc(self, read: Callable[[], Expression], *infix: TokenTypes):\\n expr = read()\\n while (matched := self._match_any(*infix)) is not None:\\n right = read()\\n expr = BinaryExpression(expr, matched, right)\\n return expr\\n\\n def consume(self, expected: TokenTypes):\\n if (matched := self._match(expected)) is None:\\n peek = self._peek()\\n gotten = \\\"nothing\\\" if peek is None else peek.token_type\\n raise ParseException(peek, f\\\"Expected {expected}, but got {gotten}!\\\")\\n return matched\\n\\n def expression(self) -> Expression:\\n return self.term()\\n\\n def term(self):\\n return self._left_assoc(self.unary, \\\"Plus\\\", \\\"Minus\\\")\\n\\n def unary(self) -> Expression:\\n if (matched := self._match_any(\\\"Minus\\\")) is not None:\\n expr = self.unary()\\n return UnaryExpression(expr, matched)\\n return self.primary()\\n\\n def primary(self):\\n if self._match(\\\"LeftParenthesis\\\") is not None:\\n expr = self.expression()\\n self.consume(\\\"RightParenthesis\\\")\\n return expr\\n number = self.consume(\\\"Number\\\")\\n if (literal := number.literal) is None:\\n raise Exception(\\\"Found number token without literal!\\\")\\n return NumberLiteral(literal)\\n\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n lexer = Lexer(s)\\n parser = Parser(lexer)\\n try:\\n expr = parser.expression()\\n except ParseException as e:\\n if (token := e.token) is not None:\\n start = token.position\\n end = start + len(token.lexeme)\\n highlight = f\\\"{s[:start]} > {s[start:end]} < {s[end:]}\\\"\\n e.add_note(f\\\"Error at: {highlight}\\\")\\n raise e\\n return expr.evaluate()\\n\\n\\ndef main():\\n solution = Solution()\\n assert solution.calculate(\\\"1 + 1\\\") == 2\\n assert solution.calculate(\\\" 2-1 + 2 \\\") == 3\\n assert solution.calculate(\\\"(1+(4+5+2)-3)+(6+8)\\\") == 23\\n assert solution.calculate(\\\"-(4+5)\\\") == -9\\n try:\\n solution.calculate(\\\"(1+((4+5+2)-3)+(6+8)\\\")\\n raise Exception(\\\"Expected a parse exception!\\\")\\n except ParseException as e:\\n assert e.args[0] == \\\"Expected RightParenthesis, but got nothing!\\\"\\n\\n\\nif __name__ == \\\"__main__\\\":\\n main()\\n\",\n \"runtime\": \"454\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str):\\n s.replace(' ', '')\\n operators = set(['+', '-'])\\n braces = set(['(', ')'])\\n stack = []\\n inbraces = False\\n if s[0] == '-':\\n s= '0' + s\\n for i in range(len(s)):\\n if s[i] in operators or s[i] in braces or (s[i].lstrip(\\\"-\\\").isdigit() and len(stack) == 0):\\n stack.append(s[i])\\n elif s[i].lstrip(\\\"-\\\").isdigit():\\n if (stack[-1] in operators and (len(stack) == 1 or( len(stack)>1 and stack[-2] =='('))):\\n stack.append(stack.pop() + s[i])\\n elif stack[-1].lstrip(\\\"-\\\").isdigit():\\n stack.append(stack.pop() + s[i])\\n else:\\n stack.append(s[i])\\n open_par = []\\n end = 0\\n i= 0\\n while i < len(stack):\\n if stack[i] == '(':\\n open_par.append(i)\\n elif stack[i] == ')':\\n end = i\\n start = open_par.pop()\\n sub_exp = stack[start+1:end]\\n evaluated_exp = Solution.calc(sub_exp)\\n new_exp = stack[:start] + [evaluated_exp] + stack[end+1:]\\n stack = new_exp\\n i = start - 1\\n i +=1\\n \\n return int(Solution.calc(stack))\\n\\n def calc(stack):\\n if len(stack) == 1:\\n return stack[0]\\n elif len(stack) == 2:\\n return stack[0] + stack[1]\\n elif len(stack) > 2 and stack[0].lstrip(\\\"-\\\").isdigit() and stack[2].lstrip(\\\"-\\\").isdigit():\\n val1 = stack.pop(0)\\n operator = stack.pop(0)\\n val2 = stack.pop(0)\\n if operator == '+':\\n stack.insert(0, str(int(val1) + int(val2)))\\n else:\\n stack.insert(0, str(int(val1) - int(val2)))\\n return Solution.calc(stack)\",\n \"runtime\": \"463\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str):\\n s.replace(' ', '')\\n operators = set(['+', '-'])\\n braces = set(['(', ')'])\\n stack = []\\n inbraces = False\\n if s[0] == '-':\\n s= '0' + s\\n for i in range(len(s)):\\n if s[i] in operators or s[i] in braces or (s[i].lstrip(\\\"-\\\").isdigit() and len(stack) == 0):\\n stack.append(s[i])\\n elif s[i].lstrip(\\\"-\\\").isdigit():\\n if (stack[-1] in operators and (len(stack) == 1 or( len(stack)>1 and stack[-2] =='('))):\\n stack.append(stack.pop() + s[i])\\n elif stack[-1].lstrip(\\\"-\\\").isdigit():\\n stack.append(stack.pop() + s[i])\\n else:\\n stack.append(s[i])\\n # print(stack)\\n open_par = []\\n end = 0\\n i= 0\\n while i < len(stack):\\n if stack[i] == '(':\\n open_par.append(i)\\n elif stack[i] == ')':\\n end = i\\n start = open_par.pop()\\n sub_exp = stack[start+1:end]\\n evaluated_exp = Solution.calc(sub_exp)\\n # print(f'sub_exp {sub_exp}')\\n new_exp = stack[:start] + [evaluated_exp] + stack[end+1:]\\n stack = new_exp\\n i = start - 1\\n i +=1\\n \\n return int(Solution.calc(stack))\\n\\n def calc(stack):\\n # print(f'calc stack{stack}')\\n if len(stack) == 1:\\n return stack[0]\\n elif len(stack) == 2:\\n return stack[0] + stack[1]\\n elif len(stack) > 2 and stack[0].lstrip(\\\"-\\\").isdigit() and stack[2].lstrip(\\\"-\\\").isdigit():\\n val1 = stack.pop(0)\\n operator = stack.pop(0)\\n val2 = stack.pop(0)\\n if operator == '+':\\n stack.insert(0, str(int(val1) + int(val2)))\\n else:\\n stack.insert(0, str(int(val1) - int(val2)))\\n return Solution.calc(stack)\",\n \"runtime\": \"471\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n a=\\\"\\\"\\n for i in range(len(s)):\\n if s[i]!=\\\" \\\":\\n a += s[i]\\n \\n s = a\\n a = []\\n cur = \\\"\\\" \\n for i in range(len(s)):\\n if s[i] in [\\\"(\\\", \\\")\\\", \\\"+\\\", \\\"-\\\"]:\\n if len(cur) > 0:\\n a.append(int(cur))\\n cur = \\\"\\\"\\n a.append(s[i])\\n else:\\n cur += s[i]\\n\\n if len(cur):\\n a.append(int(cur))\\n\\n print(a)\\n def solve(l):\\n i = l\\n cur = 0\\n sign = \\\"\\\" \\n\\n while i < len(a):\\n if a[i] == \\\"(\\\":\\n res, j = solve(i+1)\\n if sign in [\\\"+\\\", \\\"\\\"]: cur += res\\n else: cur -= res\\n sign = \\\"\\\"\\n i = j\\n\\n elif a[i] == \\\")\\\":\\n return cur, i\\n elif a[i] in [\\\"+\\\",\\\"-\\\"]:\\n sign = a[i]\\n else:\\n if sign in [\\\"\\\", \\\"+\\\"]:\\n cur += a[i]\\n else: \\n cur -= a[i]\\n \\n i += 1\\n\\n return cur, i\\n\\n return solve(0)[0]\\n\\n\\n\\n\\n \",\n \"runtime\": \"480\"\n },\n {\n \"code\": \"class Solution:\\n \\n def parent(self,s):\\n curr_sign=1\\n marks=['+','-','(',')',' ']\\n res=0\\n num=0\\n temp=s[0]\\n s=s[1:] \\n while temp!=')': \\n if temp not in marks:\\n num=num*10+int(temp) \\n else:\\n res=res+curr_sign*num\\n num=0 \\n if temp=='+':\\n curr_sign=1\\n elif temp=='-':\\n curr_sign=-1\\n elif temp=='(':\\n output=self.parent(s)\\n s=output[1]\\n res=res+curr_sign*output[0] \\n temp=s[0]\\n s=s[1:] \\n res=res+curr_sign*num\\n return [res,s]\\n\\n\\n\\n def calculate(self, s: str) -> int:\\n curr_sign=1\\n marks=['+','-','(',')',' ']\\n res=0\\n num=0\\n while s:\\n temp=s[0]\\n s=s[1:] \\n if temp not in marks:\\n num=num*10+int(temp) \\n else:\\n res=res+curr_sign*num\\n num=0 \\n if temp=='+':\\n curr_sign=1\\n elif temp=='-':\\n curr_sign=-1\\n elif temp=='(':\\n output=self.parent(s)\\n s=output[1]\\n res=res+curr_sign*output[0]\\n if temp not in marks: \\n res=res+curr_sign*num \\n return res \\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"488\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n def evaluateExpression(stringX):\\n if stringX[0] == '+':\\n stringX = stringX[1:]\\n if stringX[0] == '-' and stringX[1] == '-':\\n stringX = stringX[2:]\\n #print('evaluating',stringX)\\n newString = ''\\n for i in stringX:\\n if i != ' ':\\n newString += i\\n \\n try:\\n return int(newString)\\n except:\\n pass\\n expressionList = []\\n myList = list(stringX)\\n #print(myList)\\n nonNum = ['+','-','(',')',' ']\\n for pos,i in enumerate(myList):\\n #print('aa',(pos,i))\\n if pos != len(myList) -1:\\n if myList[pos] == '-' and myList[pos+1] == '+':\\n myList[pos+1] = ' '\\n if myList[pos] == '+' and myList[pos+1] == '-':\\n myList[pos] = ' '\\n if myList[pos] == '-' and myList[pos+1] == '-':\\n myList[pos] = ' '\\n myList[pos+1] = '+'\\n \\n\\n\\n if i not in nonNum:\\n if pos != len(myList) -1:\\n while myList[pos+1] not in nonNum:\\n #print('bb')\\n myList[pos] = myList[pos]+ str(myList[pos+1])\\n #print(myList[pos])\\n myList.pop(pos+1)\\n\\n #break if we have removeed the last item of the array, to prevent an error\\n if pos == len(myList) -1:\\n #print('break')\\n break\\n \\n elif i == ' ':\\n #print('ddd')\\n myList.pop(pos)\\n\\n for pos,i in enumerate(myList):\\n #print('22')\\n if i != ' ' and i != u' ':\\n expressionList.append(i)\\n\\n while ' ' in expressionList:\\n expressionList.remove(' ')\\n\\n #print('first value is',myList[0])\\n try:\\n #if this fails its because the value is negative, so we then take the second value\\n answer = int(expressionList[0]) \\n except:\\n answer = -int(expressionList[1])\\n\\n while len(expressionList) >2:\\n answer = -9999\\n #print('cc',expressionList)\\n #i[0] and i[2] will be numbers\\n\\n while ' ' in expressionList:\\n expressionList.remove(' ')\\n\\n #print(expressionList)\\n if expressionList[0] == '-':\\n number1 = (-1)* int(expressionList[1])\\n #print(number1)\\n expressionList.pop(1)\\n expressionList[0] = number1\\n #print(expressionList)\\n \\\"\\\"\\\"else:\\n number1 = expressionList[0]\\n\\n if expressionList[2] == '-':\\n number2 = (-1)* expressionList[3]\\n expressionList.pop(2)\\n expressionList[2] = number2\\n #print('updated',expressionList)\\n else:\\n number2 = expressionList[2] \\\"\\\"\\\"\\n\\n\\n \\n \\n\\n\\n if expressionList[1] == '+':\\n #print('addition',expressionList)\\n if expressionList[2] == '-':\\n answer = int(expressionList[0]) - int(expressionList[3])\\n else:\\n answer = int(expressionList[0]) + int(expressionList[2])\\n \\\"\\\"\\\" try:\\n #if this fails its because either of the numbers could be negative:\\n answer = int(expressionList[0]) + int(expressionList[2])\\n except:\\n #answer = int(expressionList[0]) - int(expressionList[3])\\n answer = number1 + number2 \\\"\\\"\\\"\\n\\n elif expressionList[1] == '-':\\n #print('subtraction',expressionList)\\n if expressionList[2] == '-':\\n answer = int(expressionList[0]) + int(expressionList[3])\\n else:\\n answer = int(expressionList[0]) - int(expressionList[2])\\n \\\"\\\"\\\" try:\\n answer = int(expressionList[0]) - int(expressionList[2])\\n except:\\n #answer = int(expressionList[0]) + int(expressionList[3])\\n answer = number1 - number2 \\\"\\\"\\\"\\n\\n # MAKE SURE TO REMOVE THE CORRECT VALUES BASED ON THE SIGNS\\n try:\\n expressionList.pop(2)\\n except:\\n pass\\n expressionList.pop(1)\\n \\n # MAKE SURE TO GET THE NEGATIVE IF ANSWE IS NEGATIVE\\n #print(expressionList)\\n while ' ' in expressionList:\\n expressionList.remove(' ')\\n while u' ' in expressionList:\\n expressionList.remove(u' ')\\n #print('zzzz',expressionList)\\n expressionList[0] = answer\\n #print(expressionList)\\n return answer\\n \\\"\\\"\\\" #print(pos,i)\\n z= -1\\n try:\\n z = int(i)\\n #print('a')\\n\\n\\n if z != -1:\\n #print('b')\\n \\n y = -1\\n\\n try:\\n y = int(myList[pos+1])\\n #print('c')\\n except:\\n pass\\n\\n\\n while y !=-1:\\n #print('d')\\n y =-1\\n try:\\n y = int(myList[pos+1])\\n #print('e')\\n except:\\n pass\\n\\n #print('f')\\n #stringX[pos] = int(stringX[pos] + stringX[pos+1])\\n q = int(myList[pos] + myList[pos+1])\\n #print('x') \\n #print(myList)\\n myList= myList[:pos] + str(q) + myList[pos+2:]\\n #print(myList)\\n #print(myList[:pos+1])\\n #print(myList[pos+1:])\\n #print('g')\\n #print(myList)\\n #print('g')\\n try:\\n myList[pos] = q\\n except:\\n myList[pos] = int(myList[pos])\\n except:\\n pass\\n\\n\\n if i != ' ':\\n expressionList.append(i)\\n\\n #print(expressionList)\\n\\n while len(expressionList) >2:\\n answer = -9999\\n #print(expressionList)\\n #i[0] and i[2] will be numbers\\n\\n if expressionList[1] == '+':\\n answer = int(expressionList[0]) + int(expressionList[2])\\n elif expressionList[1] == '-':\\n answer = int(expressionList[0]) - int(expressionList[2])\\n\\n expressionList.pop(2)\\n expressionList.pop(1)\\n \\n expressionList[0] = answer\\n return answer \\\"\\\"\\\"\\n\\n\\n\\n\\n\\n\\n x = -1\\n x2 = 0\\n while ')' in s:\\n #print('removing all brackets')\\n x = s.index(')')\\n \\\"\\\"\\\" if x:\\n #print(x) \\\"\\\"\\\"\\n \\n for i in range(x,-1,-1):\\n ##print(i,s[i])\\n \\n if s[i] == '(':\\n x2 = i\\n ##print(x2)\\n break\\n\\n #print(s)\\n bracketExpression = s[x2+1:x]\\n result = evaluateExpression(bracketExpression)\\n #print('result',result)\\n\\n s = s[:x2] + str(result) + s[x+1:]\\n #print(s)\\n \\n #simplify this\\n\\n #now that brackets have been removede:\\n return evaluateExpression(s)\\n #return 1\",\n \"runtime\": \"497\"\n },\n {\n \"code\": \"class Solution:\\n \\n def parent(self,s):\\n curr_sign=1\\n marks=['+','-','(',')',' ']\\n res=0\\n num='0'\\n temp=s[0]\\n s=s[1:] \\n while temp!=')': \\n if temp not in marks:\\n num=num+temp \\n else:\\n res=res+curr_sign*int(num)\\n num='0' \\n if temp=='+':\\n curr_sign=1\\n elif temp=='-':\\n curr_sign=-1\\n elif temp=='(':\\n output=self.parent(s)\\n s=output[1]\\n res=res+curr_sign*output[0] \\n temp=s[0]\\n s=s[1:] \\n res=res+curr_sign*int(num)\\n return [res,s]\\n\\n\\n\\n def calculate(self, s: str) -> int:\\n curr_sign=1\\n marks=['+','-','(',')',' ']\\n res=0\\n num='0'\\n while s:\\n temp=s[0]\\n s=s[1:] \\n if temp not in marks:\\n num=num+temp \\n else:\\n res=res+curr_sign*int(num)\\n num='0' \\n if temp=='+':\\n curr_sign=1\\n elif temp=='-':\\n curr_sign=-1\\n elif temp=='(':\\n output=self.parent(s)\\n s=output[1]\\n res=res+curr_sign*output[0]\\n if temp not in marks: \\n res=res+curr_sign*int(num) \\n return res \\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"505\"\n },\n {\n \"code\": \"import re\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(' ', '')\\n if not s: return 0\\n self.num_regex = re.compile('^\\\\d*')\\n return self.parse(s, 0)[0]\\n \\n def parse(self, s, i):\\n rv = 0\\n add = True\\n while True:\\n if i >= len(s): return rv, i\\n s2 = s[i:]\\n c = s2[0]\\n if c == '+':\\n i += 1\\n elif c == '-':\\n add = not add\\n i += 1\\n elif c == '(':\\n val, i = self.parse(s, i + 1)\\n rv += val if add else -val\\n add = True\\n elif c == ')':\\n return rv, i + 1\\n else:\\n match = self.num_regex.search(s2)[0]\\n if len(match) > 0:\\n num = int(match)\\n rv += num if add else -num\\n add = True\\n i += len(match)\\n else:\\n raise Exception('should not reach this')\\n\",\n \"runtime\": \"514\"\n },\n {\n \"code\": \"import re\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n if not s: return 0\\n self.num_regex = re.compile('\\\\d+')\\n self.whitespace_regex = re.compile('\\\\s+')\\n return self.parse(s, 0)[0]\\n \\n def parse(self, s, i):\\n rv = 0\\n add = True\\n while True:\\n if i >= len(s): return rv, i\\n s2 = s[i:]\\n c = s2[0]\\n if c == '+':\\n i += 1\\n elif c == '-':\\n add = not add\\n i += 1\\n elif c == '(':\\n val, i = self.parse(s, i + 1)\\n rv += val if add else -val\\n add = True\\n elif c == ')':\\n return rv, i + 1\\n elif m := self.num_regex.match(s, i):\\n num = int(m[0])\\n rv += num if add else -num\\n add = True\\n i += len(m[0])\\n elif m := self.whitespace_regex.match(s, i):\\n i += len(m[0])\\n else:\\n raise Exception('should not reach this')\\n\",\n \"runtime\": \"522\"\n },\n {\n \"code\": \"import re\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n # s = s.replace(' ', '')\\n if not s: return 0\\n self.num_regex = re.compile('\\\\d+')\\n self.whitespace_regex = re.compile('\\\\s+')\\n return self.parse(s, 0)[0]\\n \\n def parse(self, s, i):\\n rv = 0\\n add = True\\n while True:\\n if i >= len(s): return rv, i\\n s2 = s[i:]\\n c = s2[0]\\n if c == '+':\\n i += 1\\n elif c == '-':\\n add = not add\\n i += 1\\n elif c == '(':\\n val, i = self.parse(s, i + 1)\\n rv += val if add else -val\\n add = True\\n elif c == ')':\\n return rv, i + 1\\n else:\\n match = self.num_regex.match(s, i)\\n match = match and match[0]\\n if match:\\n num = int(match)\\n rv += num if add else -num\\n add = True\\n i += len(match)\\n continue\\n match = self.whitespace_regex.match(s, i)\\n match = match and match[0]\\n if match:\\n i += len(match)\\n continue\\n raise Exception('should not reach this')\\n\",\n \"runtime\": \"531\"\n },\n {\n \"code\": \"def expr(s):\\n if s[0] == \\\"(\\\":\\n v, s = add_sum(s[1:])\\n assert s[0] == \\\")\\\"\\n return v, s[1:]\\n else:\\n d = 0\\n while s and s[0] in \\\"0123456789\\\":\\n d = d * 10 + ord(s[0]) - ord(\\\"0\\\")\\n s = s[1:]\\n return d, s\\n\\ndef add_sum(s: str):\\n v1, s = expr(s)\\n while True:\\n if s and s[0] == \\\"-\\\":\\n v2, s = expr(s[1:])\\n v1 -= v2\\n elif s and s[0] == \\\"+\\\":\\n v2, s = expr(s[1:])\\n v1 += v2\\n else:\\n break\\n return v1, s\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(\\\" \\\", \\\"\\\")\\n print(s)\\n v, s = add_sum(s)\\n return v\\n \",\n \"runtime\": \"539\"\n },\n {\n \"code\": \"import re\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(' ', '')\\n if not s: return 0\\n return self.parse(s, 0)[0]\\n \\n def parse(self, s, i):\\n rv = 0\\n add = True\\n while True:\\n if i >= len(s): return rv, i\\n s2 = s[i:]\\n c = s2[0]\\n if c == '+':\\n i += 1\\n elif c == '-':\\n add = not add\\n i += 1\\n elif c == '(':\\n val, i = self.parse(s, i + 1)\\n rv += val if add else -val\\n add = True\\n elif c == ')':\\n return rv, i + 1\\n else:\\n match = re.search('^\\\\d*', s2)[0]\\n if len(match) > 0:\\n num = int(match)\\n rv += num if add else -num\\n add = True\\n i += len(match)\\n else:\\n raise Exception('should not reach this')\\n\",\n \"runtime\": \"548\"\n },\n {\n \"code\": \"# 1. Get operand\\n# a. If '(', recurse and use return value as operand\\n# 2. If end of string or ')', return\\n# 3. Get operator\\n# 4. Get second operand\\n# a. If '(', recurse and use return value as operand\\n# 5. Go to 2\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n return self.calculatePart(s)[0]\\n\\n def skipSpace(self, s: str) -> str:\\n i = 0\\n while i < len(s) and s[i] == ' ':\\n i += 1\\n return s[i:]\\n\\n def takeNumber(self, s: str) -> (int, str):\\n i = 0\\n while i < len(s) and s[i].isnumeric():\\n i += 1\\n return (int(s[:i]), s[i:])\\n\\n def getOperand(self, s: str) -> (int, str):\\n # Get operand\\n s = self.skipSpace(s)\\n if s[0] == '(':\\n left, s = self.calculatePart(s[1:])\\n elif s[0] == '-':\\n left, s = self.getOperand(s[1:])\\n left = -left\\n else:\\n # Number\\n left, s = self.takeNumber(s)\\n print('getOperand() returns', left)\\n return (left, s)\\n\\n\\n # Returns value and remaining expression string\\n def calculatePart(self, s: str) -> (int, str):\\n # Get left operand\\n left, s = self.getOperand(s) \\n\\n while True:\\n\\n # Get operation\\n s = self.skipSpace(s)\\n if len(s) == 0 or s[0] == ')':\\n s = s[1:]\\n break\\n op = s[0]\\n s = s[1:]\\n\\n # Get right operand\\n right, s = self.getOperand(s)\\n\\n # Perform operation\\n if op == '+':\\n left += right\\n elif op == '-':\\n left -= right\\n del right\\n \\n return (left, s)\\n\",\n \"runtime\": \"557\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":98,"string":"98"},"mm_list":{"kind":"list like","value":[{"code":"parenthesis = {\"(\", \")\"}\noperators = {\"+\", \"-\"}\nnon_digits = parenthesis.union(operators)\n\n\nclass Solution:\n def calculate(self, s: str) -> int:\n s_without_spaces = self.remove_spaces(s)\n stack = []\n\n for char in s_without_spaces:\n if char != \")\":\n stack.append(char)\n continue\n\n result = 0\n\n while stack[-1] != \"(\":\n number = self.pop_number(stack)\n result = self.perform_operation(result, number, \"+\")\n\n stack.pop()\n\n for digit in str(result):\n stack.append(digit)\n\n return self.evaluate_simple_expr(stack)\n\n def evaluate_simple_expr(self, stack):\n result = 0\n\n while len(stack) > 0:\n number = self.pop_number(stack)\n result = self.perform_operation(result, number, \"+\")\n\n return result\n\n def pop_number(self, stack):\n reversed_number = \"\"\n\n while (len(stack) > 0) and (stack[-1] not in non_digits):\n reversed_number += stack.pop()\n\n number = int(self.reverse_str(reversed_number))\n\n while len(stack) > 0 and (stack[-1] in operators):\n operation = stack.pop()\n number = self.perform_operation(0, number, operation)\n\n return number\n\n def perform_operation(self, x, y, operation):\n if operation == \"+\":\n return x + y\n\n return x - y\n\n def reverse_str(self, s):\n n = len(s)\n reversed_str = \"\"\n\n for i in range(n):\n reversed_str += s[n - 1 - i]\n\n return reversed_str\n\n def remove_spaces(self, s):\n s_without_spaces = \"\"\n\n for char in s:\n if char != \" \":\n s_without_spaces += char\n\n return s_without_spaces","memory":"17714"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n res, cur = 0, 0\n sign = 1\n stack = []\n for c in s:\n if c.isdigit():\n cur = cur * 10 + int(c)\n elif c in [\"+\", \"-\"]:\n res += sign * cur\n sign = 1 if c == \"+\" else -1\n cur = 0\n elif c == \"(\":\n stack.append((res, sign))\n sign, res = 1, 0\n elif c == \")\":\n res += sign * cur\n curRes, curSign = stack.pop()\n res *= curSign\n res += curRes\n cur = 0\n \n return res + sign * cur","memory":"17714"},{"code":"class Solution:\n def calculate(self, s):\n def evaluate(i):\n res, digit, sign = 0, 0, 1\n \n while i < len(s):\n if s[i].isdigit():\n digit = digit * 10 + int(s[i])\n elif s[i] in '+-':\n res += digit * sign\n digit = 0\n sign = 1 if s[i] == '+' else -1\n elif s[i] == '(':\n subres, i = evaluate(i+1)\n res += sign * subres\n elif s[i] == ')':\n res += digit * sign\n return res, i\n i += 1\n\n return res + digit * sign\n \n return evaluate(0)","memory":"18343"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n i, n = 0, len(s)\n ans, op = 0, '+'\n stack = deque()\n # (1+(4+5+2)-3)+(6+8)\n while i < n:\n if s[i] == ')':\n operand = 0\n exp = 0\n element = ')'\n while stack:\n element = stack.pop()\n if element == '(':\n break\n if element == '+':\n exp += operand\n operand = '#'\n elif element == '-':\n exp -= operand\n operand = '#'\n else:\n operand = element\n if operand != '#':\n exp += operand\n stack.append(exp)\n if s[i] in '0123456789': # 6\n num = int(s[i]) # 6\n i += 1\n while i < n and s[i] in '0123456789':\n num *= 10\n num += int(s[i])\n i += 1\n i -= 1\n stack.append(num)\n if i < n and s[i] in '+-(':\n stack.append(s[i])\n i += 1 # 8\n \n operand = 0\n while stack:\n element = stack.pop()\n if element == '+':\n ans += operand\n operand = '#'\n elif element == '-':\n ans -= operand\n operand = '#'\n elif element == ' ':\n pass\n else:\n operand = element\n if operand != '#':\n ans += operand\n return ans","memory":"18343"},{"code":"class Solution:\n # n = iter(range(0, 10))\n def calculate(self, s: str) -> int:\n return self.recur(s.replace(' ', ''), 0)[1]\n\n def recur(self, s: str, index: int):\n # n = next(self.n)\n stack = []\n continuous_number = False\n negative_state = False\n while index < len(s):\n symbol = s[index]\n if symbol.isdigit():\n if continuous_number:\n stack[-1] += symbol\n else:\n stack.append(symbol)\n continuous_number = True\n else:\n if symbol == '-':\n if s[index + 1].isdigit():\n stack.append('-' + s[index + 1])\n index += 1\n continuous_number = True\n else:\n negative_state = not negative_state\n continuous_number = False\n elif symbol == '(':\n index, res = self.recur(s, index + 1)\n stack.append(res * (-(2 * negative_state - 1)))\n negative_state = False\n continuous_number = False\n elif symbol == ')':\n # print(sum(list(map(int, stack))))\n return index, sum(list(map(int, stack)))\n else:\n continuous_number = False\n index += 1\n # print(n, stack)\n\n return index, sum(map(int, stack))\n\n\n# print(Solution().calculate(\"2-4-(8+2-6+(8+4-(1)+8-10))\"))\n# # print('\\')\n# print(Solution().calculate(\"(1+(4+5+2)-3)+(6+8)\")[1])\n# (exec(\"print((1+(4+5+2)-3)+(6+8))\"))\n# print(Solution().calculate(\"2-1 - 2\"))[1]\n","memory":"18971"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n s = '(' + s + ')'\n p_stk = [0]\n stk = []\n num = 0\n num_used = False\n for c in s:\n if c.isdigit():\n num *= 10\n num += int(c)\n num_used = True\n else:\n if num_used:\n stk.append(num)\n num = 0\n num_used = False\n if c == '(':\n p_stk.append(len(stk))\n stk.append('(')\n elif c == '+':\n stk.append(c)\n elif c == '-':\n if not stk or type(stk[-1]) != int:\n stk.append(0)\n stk.append(c)\n elif c == ')':\n st = p_stk[-1] + 1\n comp = stk[st]\n for i in range(st + 1,len(stk),2):\n if stk[i] == '+':\n comp += stk[i+1]\n else:\n comp -= stk[i+1]\n stk = stk[:st-1]\n stk.append(comp)\n p_stk.pop()\n return stk[0]\n \n\n \n","memory":"18971"},{"code":"from collections import deque\nclass Solution:\n def calculate(self, s: str) -> int:\n queue = deque([])\n n = ''\n symbols = '+-()'\n for item in list(s):\n if item in symbols:\n if n:\n queue.append(int(n))\n n = ''\n queue.append(item)\n elif item == ' ':\n continue\n else:\n n+=item\n if item == ')':\n queue.pop()\n temp_num = []\n temp_symbol = []\n while queue[-1] != '(':\n if type(queue[-1])!=int:\n temp_symbol.append(queue.pop())\n else:\n temp_num.append(queue.pop())\n queue.pop()\n if len(temp_num) > len(temp_symbol):\n cur = temp_num.pop()\n else:\n cur = 0\n while temp_symbol:\n operation = temp_symbol.pop()\n if operation == '+':\n cur += temp_num.pop()\n else:\n cur -= temp_num.pop()\n queue.append(cur)\n if n:\n queue.append(int(n))\n n = ''\n if len(queue) == 1:\n return queue[0]\n elif queue:\n temp_num = []\n temp_symbol = []\n while queue:\n if type(queue[-1])!=int:\n temp_symbol.append(queue.pop())\n else:\n temp_num.append(queue.pop())\n if len(temp_num) > len(temp_symbol):\n cur = temp_num.pop()\n else:\n cur = 0\n while temp_symbol:\n operation = temp_symbol.pop()\n if operation == '+':\n cur += temp_num.pop()\n else:\n cur -= temp_num.pop()\n return cur\n\n\n \n\n ","memory":"19600"},{"code":"class Solution:\n \n def recurse(self, tokens, idx):\n sign = 1\n result = 0\n while idx < len(tokens):\n if tokens[idx].isdigit():\n result += sign * int(tokens[idx])\n idx+=1\n elif tokens[idx] == '+':\n sign = 1\n idx+=1\n elif tokens[idx] == '-':\n sign = -1\n idx+=1\n elif tokens[idx] == '(':\n internal_sum, next_idx = self.recurse(tokens, idx + 1)\n result += sign * internal_sum\n idx = next_idx\n elif tokens[idx] == ')':\n return result, idx + 1 \n return result, -1\n \n def calculate(self, s: str) -> int:\n tokens = re.findall('\\d+|\\+|\\-|\\(|\\)', s)\n return self.recurse(tokens, 0)[0] \n","memory":"19600"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n \n # O(n) stack\n stack = []\n\n # store the current number\n num = 0\n\n # store the sign value to multiply the number by \n sign = 1\n output = 0\n\n # we want to remove all whitespaces\n elems = [char for char in s if char != \" \"]\n elems.append(\"+\")\n\n\n for elem in elems:\n\n # process if the current elem is a digit\n if elem.isdigit():\n # multiply the current num by 10 and add this num\n # for consecutive digits\n num = num * 10 + int(elem)\n\n # process signs\n if elem in \"+-\":\n # move our current num to the output\n output += num*sign\n # set our sign to negative if this sign is negative\n sign = -1 if elem == \"-\" else 1\n # reset our number to 0\n num = 0\n \n # use num, res, and sign to calculate sum of numbers within the parentheses\n elif elem == \"(\":\n # move output and sign to stack\n stack.append(output)\n stack.append(sign)\n # reset output and sign\n output = 0\n sign = 1\n\n\n elif elem == \")\":\n # calculate sum for num first\n output += sign * num\n # then pop items from stack\n # pop the sign to multiply with the output\n output *=stack.pop()\n # pop the integer to add to the rest of the output\n output +=stack.pop()\n\n # reset our number to 0\n num = 0\n \n return output","memory":"20229"},{"code":"nums = set(map(chr, range(ord('0'), ord('9') + 1)))\ndef calc_func(c: str):\n if c == '+':\n return lambda a, b: a + b\n elif c == '-':\n return lambda a, b: a - b\n else:\n raise Exception(\"bozo\")\n\ndef get_num(s: str) -> (int, int):\n # takewhile isnum s\n i = 0\n c = ''\n while i < len(s) and s[i] in nums:\n c += s[i]\n i += 1\n return int(c), len(c)\n \nclass Solution:\n def calculate(self, s: str) -> int:\n print(nums)\n return self._calculate(''.join([c for c in s if c != ' ']))\n def _calculate(self, s: str) -> int:\n i = 0\n stack = [(0, 1)]\n while i < len(s):\n if s[i] == '-':\n if s[i+1] in nums:\n # negative number\n n, num_taken = get_num(s[i+1:])\n stack[-1] = stack[-1][0] - n, stack[-1][1]\n i += num_taken + 1\n elif s[i+1] == '(':\n stack.append((0, -1))\n i += 2\n else:\n raise Exception(\"formatting error\")\n elif s[i] in nums:\n n, num_taken = get_num(s[i:])\n stack[-1] = stack[-1][0] + n, stack[-1][1]\n i += num_taken\n elif s[i] == '(':\n stack.append((0, 1))\n i += 1\n elif s[i] == ')':\n v = stack.pop(-1)\n if len(stack) == 0:\n return v[0] * v[1]\n else:\n stack[-1] = stack[-1][0] + v[0] * v[1], stack[-1][1]\n i += 1\n else:\n i += 1\n if len(stack) > 1:\n raise Exception(\"bruh\")\n return stack[0][0] * stack[0][1]\n","memory":"20229"},{"code":"class Solution:\n \n def recurse(self, tokens, idx):\n sign = 1\n result = 0\n j = idx\n while j < len(tokens):\n if tokens[j].isdigit():\n result += sign * int(tokens[j])\n j+=1\n elif tokens[j] == '+':\n sign = 1\n j+=1\n elif tokens[j] == '-':\n sign = -1\n j+=1\n elif tokens[j] == '(':\n internal_sum, next_idx = self.recurse(tokens, j + 1)\n result += sign * internal_sum\n j = next_idx\n elif tokens[j] == ')':\n return result, j + 1 \n return result, -1\n \n def calculate(self, s: str) -> int:\n tokens = re.findall('\\d+|\\+|\\-|\\(|\\)', s)\n return self.recurse(tokens, 0)[0] \n","memory":"20858"},{"code":"class Calculator:\n def __init__(self, tokens):\n self.tokens = tokens\n self.i = 0\n\n def evaluate(self):\n return self.evaluate_term()\n\n def evaluate_term(self):\n result = self.evaluate_unary()\n while self.i < len(self.tokens) and self.tokens[self.i] in \"+-\":\n operator = self.tokens[self.i]\n self.i += 1\n right_result = self.evaluate_unary()\n if operator == \"+\":\n result += right_result\n else:\n result -= right_result\n return result\n\n def evaluate_unary(self):\n if self.tokens[self.i] == \"-\":\n operator = self.tokens[self.i]\n self.i += 1\n return -self.evaluate_unary()\n return self.evaluate_primary()\n\n def evaluate_primary(self):\n if self.tokens[self.i] == \"(\":\n self.i += 1\n result = self.evaluate()\n self.i += 1\n return result\n result = int(self.tokens[self.i])\n self.i += 1\n return result\n\nclass Solution:\n def calculate(self, s: str) -> int:\n tokens = self.tokenize(s)\n return Calculator(tokens).evaluate()\n\n def tokenize(self, s):\n i = 0\n expected_tokens = \"+-()\"\n tokens = []\n while i < len(s):\n if s[i].isdigit():\n start = i\n while i < len(s) and s[i].isdigit():\n i += 1\n tokens.append(s[start:i])\n elif s[i] in expected_tokens:\n tokens.append(s[i])\n i += 1\n else:\n i += 1\n\n return tokens\n\n\n ","memory":"20858"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n def priority(op):\n if op in ['+', '-']:\n return 1\n elif op in ['*', '/']:\n return 2\n else:\n return 0\n \n def toPostfix(infix):\n stack = ['']\n postfix = []\n i = 0\n prev_token = ''\n while i<len(infix):\n c = infix[i]\n if c.isdigit():\n num = ''\n while i<len(infix) and infix[i].isdigit():\n num+=infix[i]\n i+=1\n postfix.append(num)\n prev_token = 'number'\n continue\n\n elif c == '(':\n stack.append(c)\n prev_token = '('\n elif c in \"+-*/\":\n if c == '-' and (prev_token == '' or prev_token == \"(\" ):\n postfix.append('0') # 为一元负号添加一个0\n else:\n while priority(stack[-1]) >= priority(c):\n postfix.append(stack.pop())\n stack.append(c)\n prev_token = 'operator'\n elif c == ')':\n while stack[-1] != '(' and stack[-1] != '':\n postfix.append(stack.pop())\n stack.pop()\n prev_token = ')'\n \n i+=1\n while stack[-1] != '':\n postfix.append(stack.pop())\n print(postfix)\n return postfix\n \n def calPostfix(s):\n buffer = []\n for c in s:\n if c.isdigit():\n buffer.append(int(c))\n elif c=='+':\n res = buffer.pop()+buffer.pop()\n buffer.append(res)\n elif c=='*':\n res = buffer.pop()*buffer.pop()\n buffer.append(res)\n elif c=='-':\n num1 = buffer.pop()\n num2 = buffer.pop()\n buffer.append(num2-num1)\n elif c=='/':\n num1 = buffer.pop()\n num2 = buffer.pop()\n buffer.append(num2//num1)\n return buffer[0]\n \n return calPostfix(toPostfix(s.strip()))","memory":"21486"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(\" \", \"\")\n last_digit = \"\"\n all_elements = list()\n for element in s:\n if element in ['+', '-', '(', ')']:\n if last_digit != \"\":\n all_elements.append(last_digit)\n last_digit = \"\"\n all_elements.append(element)\n else:\n last_digit += element\n if last_digit != \"\":\n all_elements.append(last_digit)\n print(all_elements)\n\n stack = list()\n for element in all_elements:\n if element == ')':\n reversed_list = list()\n while True:\n reversed_list.append(stack.pop())\n if reversed_list[-1] == '(':\n break\n used_list = reversed_list[:-1][::-1]\n operators = [\"\"]\n for item in used_list:\n if item in [\"+\", \"-\"]:\n if operators == [\"\"]:\n operators[-1] = 0\n else:\n operators[-1] = int(operators[-1])\n operators.append(item)\n operators.append(\"\")\n elif type(item) == int:\n # precomputed val\n operators[-1] = item\n else:\n operators[-1] += item\n operators[-1] = int(operators[-1])\n val = operators[0]\n i = 1\n while i < len(operators):\n if operators[i] == \"+\":\n val += operators[i+1]\n i += 2\n elif operators[i] == \"-\":\n val -= operators[i+1]\n i += 2\n else:\n i += 1\n stack.append(val)\n else:\n stack.append(element)\n operators = [\"\"]\n for element in stack:\n if element in [\"+\", \"-\"]:\n if operators == [\"\"]:\n operators[-1] = 0\n else:\n operators[-1] = int(operators[-1])\n operators.append(element)\n operators.append(\"\")\n elif type(element) == int:\n operators[-1] = element\n else:\n operators[-1] += element\n index = 1\n vals = int(operators[0])\n while index<len(operators):\n if operators[index] == '+':\n vals += int(operators[index+1])\n index += 2\n elif operators[index] == '-':\n vals -= int(operators[index+1])\n index += 2\n else:\n index += 1\n\n return vals\n\n ","memory":"21486"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n s = ('( '\n + s.replace(\" \", \"\") \\\n .replace('-', ' - ') \\\n .replace('+', ' + ') \\\n .replace(')', ' ) ') \\\n .replace('(', ' ( ') \n + ' )').split()\n\n stack = [0]\n\n for c in s[::-1]:\n if c==')':\n stack.append(')')\n\n elif c=='(':\n current = 0\n while stack and (x:=stack.pop())!=')':\n current += x\n stack.append(current)\n elif c == '-':\n stack[-1] *= -1\n elif c.isnumeric():\n stack.append(int(c))\n\n \n return sum(stack)\n\n \n","memory":"22115"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n def parseOps(s):\n ops = []\n num = \"\"\n for i, c in enumerate(s):\n if c.isdigit():\n num += c\n elif c in (\"+\", \"-\", \"*\", \"/\", \"(\", \")\"):\n # isMinus = False\n # if c == '-':\n # for j in range(i-1, -2, -1):\n # if j == -1:\n # isMinus = True\n # elif s[j].isdigit() or s[j] == \")\":\n # break\n # elif s[j] in (\"+\", \"-\", \"*\", \"/\", \"(\"):\n # isMinus = True\n # if isMinus:\n # num = \"-\" + num\n # if not isMinus:\n if num != \"\":\n ops.append(num)\n num = \"\"\n ops.append(c) \n elif c == \" \":\n if num != \"\":\n ops.append(num)\n num = \"\"\n if num != \"\":\n ops.append(num)\n ops_new = []\n \n for i, op in enumerate(ops):\n # print(i, op)\n if op == '-' and (i == 0 or not(ops[i-1].isdigit() or len(ops[i-1]) > 1 or ops[i-1] == ')')):\n # print(\"go heer\")\n ops_new.append(\"0\")\n ops_new.append(\"-\")\n else:\n ops_new.append(op)\n\n return ops_new\n def priority(op):\n if op in (\"+\", '-'):\n return 1\n if op in (\"*\", '/'):\n return 2\n if op in (\")\"):\n return 3\n if op in (\"(\"):\n return 0\n def toPreString(s):\n ops = parseOps(s)\n # print(ops)\n numstack = []\n opstack = []\n ops_new = []\n for op in ops:\n # print(\"\\ncurrent op:\", op)\n # print(\"numstack:\", numstack)\n # print(\"opstack:\" ,opstack)\n # print(\"ops_new:\", ops_new)\n if op.isdigit() or len(op) > 1:\n numstack.append(op)\n elif op == \"(\":\n opstack.append(op)\n elif op == \")\":\n tmpstack = []\n while len(opstack)>0 and opstack[-1] != '(':\n tmpstack.append(opstack.pop())\n tmpstack.append(numstack.pop())\n assert opstack.pop() == '('\n tmpstack.append(numstack.pop())\n numstack.append(' '.join(tmpstack[::-1]))\n # ops_new += tmpstack[::-1]\n else:\n tmpstack = []\n while len(opstack)>0 and priority(op) < priority(opstack[-1]):\n tmpstack.append(numstack.pop())\n tmpstack.append(numstack.pop())\n tmpstack.append(opstack.pop())\n if len(tmpstack) > 0:\n numstack.append(' '.join(tmpstack[::-1]))\n opstack.append(op)\n \n # print(\"\\nnumstack:\", numstack)\n # print(\"opstack:\" ,opstack)\n # print(\"ops_new:\", ops_new)\n if len(opstack) > 0:\n tmpstack = []\n while len(opstack)>0:\n tmpstack.append(opstack.pop())\n tmpstack.append(numstack.pop())\n tmpstack.append(numstack.pop())\n numstack.append(' '.join(tmpstack[::-1]))\n ret = numstack.pop()\n assert len(numstack) == len(opstack) == 0, \"numstack: %r, opstack: %r\" % (numstack, opstack)\n return ret\n\n def calcPreString(s):\n ops = s.split(' ')\n numstack = []\n opstack = []\n for op in ops:\n if op.isdigit() or len(op) > 1:\n numstack.append(int(op))\n else:\n if op == \"+\":\n numstack.append(numstack.pop() + numstack.pop())\n elif op == \"-\":\n numstack.append(-numstack.pop() + numstack.pop())\n elif op == \"*\":\n numstack.append(numstack.pop() * numstack.pop())\n elif op == \"/\":\n numstack.append(1/numstack.pop() * numstack.pop())\n return numstack.pop()\n s = toPreString(s)\n return calcPreString(s)","memory":"22115"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n # 1. 연산자와 숫자로만 이루어진 문자열 list setting\n # 2. 스택 조작\n # - (: push\n # - 숫: (top이 (: 같이 푸시), (top이 +- 에다가 하나 더 있다면 연산, 없으면 그냥 +-만 적용)\n # - ): 숫자 pop 해서 연산\n\n # 아니면 재귀 형식?\n # - (: close 짝 위치 매핑\n # def dfs(lo, hi):\n # 만약 s[i]가 (라면, dfs(i + 1, 매핑된 위치 - 1)\n # 이렇게 괄호 모두 제거한 dfs에서 반복하면서 연산\n pmap = {}\n stack = []\n \n\n def makegroup(s) -> list[str]:\n new_char = \"\"\n g = []\n for i in range(len(s)):\n if s[i] == ' ': continue\n if s[i] in '+-()':\n if new_char:\n g.append(new_char)\n new_char = \"\"\n g.append(s[i])\n else:\n new_char += s[i]\n \n if new_char:\n g.append(new_char)\n return g\n \n g = makegroup(s)\n for i in range(len(g)):\n char = g[i]\n if char == ')':\n pos = stack.pop()\n pmap[pos] = i\n elif char == '(':\n stack.append(i)\n\n print(g)\n\n def dfs(lo, hi) -> str:\n new_stack = []\n i = lo\n while i < hi + 1:\n if g[i] in '+-':\n new_stack.append(g[i])\n else:\n if g[i] == '(':\n num = dfs(i + 1, pmap[i] - 1)\n i = pmap[i]\n else:\n num = g[i]\n \n slen = len(new_stack)\n if slen == 0:\n new_stack.append(num)\n elif slen == 1:\n op = new_stack.pop()\n if op == '-':\n new_stack.append(str(-int(num)))\n else:\n new_stack.append(num)\n else: # slen > 1\n op = new_stack.pop()\n intnum = int(new_stack.pop())\n if op == '-':\n new_stack.append(str(intnum - int(num)))\n else:\n new_stack.append(str(intnum + int(num)))\n\n i += 1\n return new_stack[0]\n\n return int(dfs(0, len(g) - 1))\n","memory":"22744"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n # 1. 연산자와 숫자로만 이루어진 문자열 list setting\n # 2. 스택 조작\n # - (: push\n # - 숫: (top이 (: 같이 푸시), (top이 +- 에다가 하나 더 있다면 연산, 없으면 그냥 +-만 적용)\n # - ): 숫자 pop 해서 연산\n\n # 아니면 재귀 형식?\n # - (: close 짝 위치 매핑\n # def dfs(lo, hi):\n # 만약 s[i]가 (라면, dfs(i + 1, 매핑된 위치 - 1)\n # 이렇게 괄호 모두 제거한 dfs에서 반복하면서 연산\n pmap = {}\n stack = []\n \n\n def makegroup(s) -> list[str]:\n new_char = \"\"\n g = []\n for i in range(len(s)):\n if s[i] == ' ': continue\n if s[i] in '+-()':\n if new_char:\n g.append(new_char)\n new_char = \"\"\n g.append(s[i])\n else:\n new_char += s[i]\n \n if new_char:\n g.append(new_char)\n return g\n \n g = makegroup(s)\n for i in range(len(g)):\n char = g[i]\n if char == ')':\n pos = stack.pop()\n pmap[pos] = i\n elif char == '(':\n stack.append(i)\n\n print(g)\n\n def dfs(lo, hi) -> str:\n new_stack = []\n i = lo\n while i < hi + 1:\n if g[i] in '+-':\n new_stack.append(g[i])\n else:\n if g[i] == '(':\n num = dfs(i + 1, pmap[i] - 1)\n i = pmap[i]\n else:\n num = g[i]\n \n slen = len(new_stack)\n if slen == 0:\n new_stack.append(num)\n elif slen == 1:\n op = new_stack.pop()\n if op == '-':\n new_stack.append(str(-int(num)))\n else:\n new_stack.append(num)\n else: # slen > 1\n op = new_stack.pop()\n intnum = int(new_stack.pop())\n if op == '-':\n new_stack.append(str(intnum - int(num)))\n else:\n new_stack.append(str(intnum + int(num)))\n\n i += 1\n return new_stack[0]\n\n return int(dfs(0, len(g) - 1))\n","memory":"22744"},{"code":"class Solution:\n def calculate(self, s):\n # prepare data\n convertedS = []\n par = ''\n\n def addPar(par):\n if par != '':\n convertedS.append(int(par))\n return ''\n \n\n def isDigit(val):\n return i in '1234567890'\n\n for i in s:\n if i == ' ':\n par = addPar(par)\n continue\n if isDigit(i):\n par += i\n else:\n par = addPar(par)\n convertedS.append(i)\n if par:\n convertedS.append(int(par))\n\n def solveBrackets(poz):\n s = 0\n isNeg = False\n idx = poz + 1\n\n while idx < size:\n i = convertedS[idx]\n if i == '-':\n isNeg = True\n elif i == '+':\n isNeg = False\n elif i == '(':\n res = solveBrackets(idx)\n if not isNeg:\n s += res[0]\n else:\n s -= res[0]\n idx = res[1]\n isNeg = False\n elif i == ')':\n return s,idx\n else:\n if isNeg:\n s -= i\n else:\n s += i\n isNeg = False\n idx += 1\n\n convertedS = ['('] + convertedS + [')']\n size = len(convertedS)\n return solveBrackets(0)[0]\n","memory":"23373"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n '''\n \"(1-(4+5-(3+2)+1)-3)+(6+8)\"\n 1 + (-4-5+3+2-1) -3 + 6 + 8\n '''\n # 1st iteration - get rid of ( and )\n stack = []\n signsStack = [1]\n minusSigns = 0\n\n i = 0\n while i < len(s):\n currNum = \"\"\n while i < len(s) and s[i].isnumeric():\n currNum += s[i]\n i += 1\n\n if currNum:\n stack.append(\"-\" + currNum if minusSigns % 2 != 0 else currNum)\n if i == len(s):\n break\n\n if s[i] == \"(\":\n if stack and stack[-1] == \"-\":\n stack[-1] = \"+\"\n signsStack.append(-1)\n minusSigns += 1\n else:\n signsStack.append(1)\n if s[i] == \")\":\n sign = signsStack.pop()\n if sign == -1:\n minusSigns -= 1\n if s[i] in {\"+\", \"-\"}:\n stack.append(s[i])\n i += 1\n \n resp = 0\n op = \"+\"\n # 2nd iteration through stack and just add or substract numbers\n for x in stack:\n if x in {\"+\", \"-\"}:\n op = x\n else:\n num = int(x)\n resp = resp + num if op == \"+\" else resp - num\n\n\n\n\n\n\n return resp\n \n\n\n \n\n ","memory":"23373"},{"code":"class Solution:\n def calculate(self, s: str):\n s.replace(' ', '')\n operators = set(['+', '-'])\n braces = set(['(', ')'])\n stack = []\n inbraces = False\n if s[0] == '-':\n s= '0' + s\n for i in range(len(s)):\n if s[i] in operators or s[i] in braces or (s[i].lstrip(\"-\").isdigit() and len(stack) == 0):\n stack.append(s[i])\n elif s[i].lstrip(\"-\").isdigit():\n if (stack[-1] in operators and (len(stack) == 1 or( len(stack)>1 and stack[-2] =='('))):\n stack.append(stack.pop() + s[i])\n elif stack[-1].lstrip(\"-\").isdigit():\n stack.append(stack.pop() + s[i])\n else:\n stack.append(s[i])\n open_par = []\n end = 0\n i= 0\n while i < len(stack):\n if stack[i] == '(':\n open_par.append(i)\n elif stack[i] == ')':\n end = i\n start = open_par.pop()\n sub_exp = stack[start+1:end]\n evaluated_exp = Solution.calc(sub_exp)\n new_exp = stack[:start] + [evaluated_exp] + stack[end+1:]\n stack = new_exp\n i = start - 1\n i +=1\n \n return int(Solution.calc(stack))\n\n def calc(stack):\n if len(stack) == 1:\n return stack[0]\n elif len(stack) == 2:\n return stack[0] + stack[1]\n elif len(stack) > 2 and stack[0].lstrip(\"-\").isdigit() and stack[2].lstrip(\"-\").isdigit():\n val1 = stack.pop(0)\n operator = stack.pop(0)\n val2 = stack.pop(0)\n if operator == '+':\n stack.insert(0, str(int(val1) + int(val2)))\n else:\n stack.insert(0, str(int(val1) - int(val2)))\n return Solution.calc(stack)","memory":"24001"},{"code":"class Solution:\n def calculate(self, s: str):\n s.replace(' ', '')\n operators = set(['+', '-'])\n braces = set(['(', ')'])\n stack = []\n inbraces = False\n if s[0] == '-':\n s= '0' + s\n for i in range(len(s)):\n if s[i] in operators or s[i] in braces or (s[i].lstrip(\"-\").isdigit() and len(stack) == 0):\n stack.append(s[i])\n elif s[i].lstrip(\"-\").isdigit():\n if (stack[-1] in operators and (len(stack) == 1 or( len(stack)>1 and stack[-2] =='('))):\n stack.append(stack.pop() + s[i])\n elif stack[-1].lstrip(\"-\").isdigit():\n stack.append(stack.pop() + s[i])\n else:\n stack.append(s[i])\n # print(stack)\n open_par = []\n end = 0\n i= 0\n while i < len(stack):\n if stack[i] == '(':\n open_par.append(i)\n elif stack[i] == ')':\n end = i\n start = open_par.pop()\n sub_exp = stack[start+1:end]\n evaluated_exp = Solution.calc(sub_exp)\n # print(f'sub_exp {sub_exp}')\n new_exp = stack[:start] + [evaluated_exp] + stack[end+1:]\n stack = new_exp\n i = start - 1\n i +=1\n \n return int(Solution.calc(stack))\n\n def calc(stack):\n # print(f'calc stack{stack}')\n if len(stack) == 1:\n return stack[0]\n elif len(stack) == 2:\n return stack[0] + stack[1]\n elif len(stack) > 2 and stack[0].lstrip(\"-\").isdigit() and stack[2].lstrip(\"-\").isdigit():\n val1 = stack.pop(0)\n operator = stack.pop(0)\n val2 = stack.pop(0)\n if operator == '+':\n stack.insert(0, str(int(val1) + int(val2)))\n else:\n stack.insert(0, str(int(val1) - int(val2)))\n return Solution.calc(stack)","memory":"24001"},{"code":"class Calc:\n def __init__(self):\n self.x = 0\n self.buf = []\n \n def op(self, sign, y):\n self.buf.append((sign, y))\n return self\n\n def eval(self):\n for el in self.buf:\n res = el[1] if type(el[1]) == int else el[1].eval().x\n if el[0] == \"+\":\n self.x += res\n elif el[0] == \"-\":\n self.x -= res\n\n self.buf = []\n return self\n\nclass Solution:\n def calculate(self, s: str) -> int:\n pre_calcs = []\n calc = Calc()\n\n op = \"+\"\n i = -1\n l = len(s)\n\n while True:\n i += 1\n if i >= l:\n break\n \n num_buf = []\n while s[i] in \"0123456789\":\n num_buf.append(s[i])\n i += 1\n if i == l:\n break\n if num_buf:\n num = int(\"\".join(num_buf))\n calc.op(op, num)\n \n if i == l:\n break\n \n ch = s[i]\n if ch == \"(\":\n pre_calc = calc\n pre_calcs.append(pre_calc)\n calc = Calc()\n pre_calc.op(op, calc)\n op = \"+\"\n elif ch == \")\":\n calc = pre_calcs.pop()\n elif ch == \" \":\n continue\n elif ch == \"+\":\n op = \"+\"\n elif ch == \"-\":\n op = \"-\"\n\n calc.eval()\n return calc.x \n \n # 3+3\n # -(6+6)\n # 3+(2-3)\n","memory":"24630"},{"code":"import re\n\nop = ['+', '-', '*', '/']\ndef isNumber(s : str) -> bool:\n # Regular expression to match integer\n pattern = r'^-?\\d+$'\n return bool(re.match(pattern, s))\n\nclass Solution:\n def evalRPN(self, tokens: List[str]) -> int:\n res = []\n for tok in tokens:\n if tok not in op:\n res.append(int(tok))\n else:\n v2 = int(res.pop())\n v1 = int(res.pop())\n next = 0\n if (tok == '+'):\n next = v1 + v2\n if (tok == '-'):\n next = v1 -v2\n if (tok == '*'):\n next = v1 * v2\n if (tok == '/'):\n next = v1 / v2\n res.append(int(next))\n \n return res[0]\n\n def convertToRPN(self, exp: str) -> List[str]:\n tokens = [char for char in exp if char != ' ']\n # print(tokens)\n # now we need to merge the digits into whole numbers again\n cur_num = \"\"\n whole = []\n for char in tokens:\n if char.isdigit():\n cur_num += char\n else:\n if (cur_num != \"\"):\n whole.append(cur_num)\n whole.append(char)\n cur_num = \"\"\n \n if cur_num != \"\":\n whole.append(cur_num)\n\n # Handling unary minus\n final = []\n prev = \"+\"\n last = False\n for i in range(len(whole)):\n token = whole[i]\n if (prev == \"+\" or prev == \"-\" or prev == \"(\") and token == \"-\":\n # Treat this \"-\" as a unary operator\n final.append(\"0\")\n final.append(token)\n prev = token\n print(whole)\n print(final)\n # simplified shunting-yard algorithm (without precedence)\n res = []\n ops = []\n for token in final:\n if token == '+' or token == '-':\n while ops and ops[-1] != '(':\n res.append(ops.pop())\n ops.append(token)\n elif token == '(':\n ops.append(token)\n elif token == ')':\n while ops[-1] != '(':\n res.append(ops.pop())\n ops.pop() # '('\n else:\n res.append(token) # number\n\n while ops:\n res.append(ops.pop())\n \n return res\n\n def calculate(self, s: str) -> int:\n print(self.convertToRPN(s))\n return self.evalRPN(self.convertToRPN(s))","memory":"24630"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n \n #get rid of spaces\n x = [i for i in s if i != ' ']\n\n #if negative number, combine\n\n j = 0\n\n x2 = []\n\n temp = ''\n\n while j < len(x):\n if x[j] == '-' and x[j+1] != '(':\n if temp:\n x2.append(temp)\n temp = ''\n temp += '-'\n elif x[j] not in ['(','+',')','-', '', ' ']:\n temp += x[j]\n elif x[j] in ['(',')','-']:\n if temp:\n x2.append(temp)\n temp = ''\n x2.append(x[j])\n elif temp:\n x2.append(temp)\n temp = ''\n j += 1\n\n if temp:\n x2.append(temp)\n\n \n #now all the negatives left come before parantheses\n negstack = []\n\n neg = 0\n\n stack = []\n\n for i in range(len(x2)):\n if x2[i] == ')':\n if negstack:\n if negstack[-1]:\n neg -= 1\n negstack.pop()\n elif x2[i] == '-':\n neg += 1\n elif x2[i] == '(':\n if i != 0 and x2[i-1] == '-':\n negstack.append(True)\n else:\n negstack.append(False)\n elif x2[i] not in ['(', '']:\n if neg%2 == 0:\n stack.append(int(x2[i]))\n else:\n stack.append(-int(x2[i]))\n \n print(stack)\n return sum(stack)","memory":"25259"},{"code":"\"\"\"\nExpr -> Term RestExpr\nRestExpr -> binop Term RestExpr | epsilon\nTerm -> ( Expr ) | num | - Term\n\"\"\"\n\nclass eof: ...\n\ntext = lambda t: lambda token: t == token\nbinop = lambda token: token in [\"+\", \"-\"]\nnum = lambda token: isinstance(token, int)\n\ndigits = set(\"0123456789\")\n\ndef tokenize(s: str):\n tokens = []\n \n i = 0\n while i < len(s):\n ch = s[i]\n if ch == \" \":\n i += 1\n continue\n if ch in digits:\n current = []\n while i < len(s) and s[i] in digits:\n current.append(s[i])\n i += 1\n tokens.append(int(\"\".join(current)))\n continue\n tokens.append(ch)\n i += 1\n tokens.append(eof)\n return tokens\n\ndef evaluate(rpn):\n stack = []\n for token in rpn:\n if num(token):\n stack.append(token)\n continue\n right = stack.pop()\n left = stack.pop()\n if token == \"+\":\n stack.append(left + right)\n continue\n if token == \"-\":\n stack.append(left - right)\n continue\n assert len(stack) == 1\n return stack[-1]\n\nclass Solution:\n def calculate(self, s: str) -> int:\n tokens = tokenize(s)[::-1]\n stack = []\n\n def eat(cond):\n if isinstance(cond, str):\n cond = text(cond)\n if cond(peek()):\n return tokens.pop()\n raise RuntimeError(\"eat exception\")\n\n def peek():\n return tokens[-1]\n\n \"\"\"\n Expr -> Term RestExpr\n RestExpr -> binop Term RestExpr | epsilon\n Term -> ( Expr ) | num | - Term\n \"\"\"\n\n def parse_term():\n # print(\"parsing term\", peek(), tokens[::-1])\n # print(peek(), num(peek()))\n if peek() == \"(\":\n eat(\"(\"); parse_expr(); eat(\")\")\n return\n if num(peek()):\n stack.append(eat(num))\n return\n if peek() == \"-\":\n eat(\"-\"); stack.append(0); parse_term(); stack.append(\"-\")\n return\n raise RuntimeError(\"term error\")\n \n def parse_expr():\n parse_term(); parse_restexpr()\n \n def parse_restexpr():\n if binop(peek()):\n op = eat(binop)\n parse_term()\n stack.append(op)\n parse_restexpr()\n\n parse_expr(); eat(text(eof))\n\n return evaluate(stack)","memory":"25259"},{"code":"def postfixEvaluation(tokens):\n stack = []\n for char in tokens:\n if char == \"+\":\n op1 = stack.pop()\n op2 = stack.pop()\n stack.append(op2 + op1)\n elif char == \"-\":\n op1 = stack.pop()\n op2 = stack.pop()\n stack.append(op2 - op1)\n elif char == \"*\":\n op1 = stack.pop()\n op2 = stack.pop()\n stack.append(op2 * op1)\n elif char == \"/\":\n op1 = stack.pop()\n op2 = stack.pop()\n stack.append(int(op2 / op1)) # Ensure integer division\n elif char == \"neg\":\n op1 = stack.pop()\n stack.append(-op1) # Apply unary negation\n else:\n # If it's a number, append it to the stack\n stack.append(int(char)) \n \n return stack.pop()\n\ndef infixToPostfix(s):\n operators = {'+', '-', '*', '/'}\n precedence_stack = {'(': 0, '+': 1, '-': 1, '*': 2, '/': 2, 'neg': 3}\n precedence_input = {'(': 4, '+': 1, '-': 1, '*': 2, '/': 2, 'neg': 3, ')': 0}\n output = []\n # Wrap `s` with '(' and ')' to make processing easier\n s = s + ')'\n stack = ['(']\n prevC = '('\n\n hasNum = False\n num = 0\n for c in s:\n if c == ' ':\n continue\n\n # c is part of a number\n if c.isdigit():\n hasNum = True\n num = num * 10 + int(c)\n prevC = c\n continue\n\n # c is an operator\n if hasNum:\n hasNum = False\n output.append(str(num)) # Convert number to string for easier evaluation\n num = 0\n\n # Check if it's a negative unary operator\n if c == '-' and (prevC == '(' or prevC in operators):\n c = 'neg'\n\n # Pop until '('\n while precedence_stack[stack[-1]] >= precedence_input[c]:\n popped = stack.pop()\n if popped != '(':\n output.append(popped)\n else:\n break\n\n # Push input onto the stack\n if c != ')':\n stack.append(c)\n\n prevC = c\n\n return output\n\ndef fun(s):\n postfixExp = infixToPostfix(s) # Convert infix to postfix\n result = postfixEvaluation(postfixExp) # Evaluate the postfix expression\n return result\n \nclass Solution:\n def calculate(self, s: str) -> int:\n return fun(s)\n","memory":"25888"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n s.replace(\" \", \"\")\n if '+' not in s and '-' not in s:\n if '(' not in s and ')' not in s:\n return int(s)\n parsedList = []\n curr = 0\n for elem in s:\n if elem == \" \":\n pass\n elif elem in \"+-()\":\n parsedList.append(str(curr))\n curr = 0\n parsedList.append(elem)\n else:\n curr = curr * 10 + int(elem)\n if curr is not 0:\n parsedList.append(str(curr))\n result = 0\n stack = []\n sign = 1\n for elem in parsedList:\n if elem not in \"+-()\":\n result += sign * int(elem)\n elif elem == \"-\":\n sign = -1\n elif elem == \"+\":\n sign = 1\n elif elem == \"(\":\n stack.append(result)\n stack.append(sign)\n result = 0\n sign = 1\n elif elem == \")\":\n result *= stack.pop()\n result += stack.pop()\n return result","memory":"25888"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n ops = {'+', '-', '(', ')'}\n expr = ''.join( ' ' + c + ' ' if c in ops else c for c in s).split()\n expr = [e if e in ops else int(e) for e in expr]\n\n stack = []\n sign, result = 1, 0\n for e in expr:\n if e in ops:\n if e == '+':\n sign = 1\n elif e == '-':\n sign = -1\n elif e == '(':\n stack.append(result)\n stack.append(sign)\n sign, result = 1, 0\n else:\n result = result * stack.pop() + stack.pop()\n else:\n result += sign * e\n\n return result","memory":"26516"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n # We first translate the string to use no spaces and\n # then recursive descent.\n def read_all(start):\n if s[start] != \"-\":\n first, rest = read_term(start)\n else:\n neg_first, rest = read_term(start+1)\n first = -neg_first \n if rest!=len(s) and (operator := s[rest]) in \"+-\" :\n assert len(s)-rest >= 2\n # Interpret \"-\" as \"+-\"\n if operator == \"+\":\n second, rest = read_all(rest+1)\n else:\n second, rest = read_all(rest)\n return first+second, rest\n else:\n return first, rest\n\n def read_num(start):\n end = start\n while end < len(s) and s[end] in \"0123456789\":\n end += 1\n if end!=start:\n return int(s[start:end]), end\n return None\n\n def read_term(start):\n if (ret := read_num(start)) is not None:\n return ret\n if s[start] == \"(\":\n res, rest = read_all(start+1)\n assert s[rest] == \")\"\n return res, rest+1\n if s[start] == \"-\":\n neg_res, rest = read_term(start+1)\n return -neg_res, rest\n # print(s)\n assert False\n\n s = \"\".join( c for c in s if c!=\" \")\n ret, rest = read_all(0)\n assert rest==len(s)\n return ret","memory":"27145"},{"code":"def tokenize(s: str) -> List[Union[str, int]]:\n tokens = []\n\n for c in s:\n if c.isdigit():\n if not tokens or not isinstance(tokens[-1], int):\n tokens.append(0)\n tokens[-1] = 10 * tokens[-1] + int(c)\n elif c != ' ':\n tokens.append(c)\n \n return tokens\n\ndef map_parentheses(tokens: List[Union[str, int]]) -> Dict[int, int]:\n stack = []\n mapping = {}\n for i, token in enumerate(tokens):\n if token == '(':\n stack.append(i)\n elif token == ')':\n mapping[i] = (j := stack.pop())\n mapping[j] = i\n return mapping\n\ndef find_operator(tokens: List[Union[str, int]], mapping: Dict[int, int], L: int, R: int) -> int:\n i = L\n j = None\n\n while i <= R:\n if i in mapping:\n i = mapping[i] + 1\n continue\n if tokens[i] is int:\n continue\n if tokens[i] == '+':\n return i\n if tokens[i] == '-' and i > L:\n return i\n if tokens[i] == '*':\n j = i\n i += 1\n \n assert j is not None\n return j\n\ndef solve(tokens: List[Union[str, int]], mapping: Dict[int, int], L: int, R: int) -> int:\n if L > R:\n raise RuntimeError()\n if L in mapping and mapping[L] == R:\n return solve(tokens, mapping, L + 1, R - 1)\n if L == R:\n assert isinstance(tokens[L], int)\n return tokens[L]\n if L == R - 1 and tokens[L] == '-' and isinstance(tokens[R], int):\n return -tokens[R]\n if tokens[L] == '-' and (L + 1) in mapping and mapping[L + 1] == R:\n return -solve(tokens, mapping, L + 2, R - 1)\n \n i = find_operator(tokens, mapping, L, R)\n\n if tokens[i] == '+':\n return solve(tokens, mapping, L, i - 1) + solve(tokens, mapping, i + 1, R)\n if tokens[i] == '-':\n return solve(tokens, mapping, L, i - 1) + solve(tokens, mapping, i, R)\n if tokens[i] == '*':\n return solve(tokens, mapping, L, i - 1) * solve(tokens, mapping, i + 1, R)\n raise RuntimeError()\n\nclass Solution:\n def calculate(self, s: str) -> int:\n tokens = tokenize(s)\n mapping = map_parentheses(tokens)\n return solve(tokens, mapping, 0, len(tokens) - 1)\n","memory":"27145"},{"code":"class Node:\n def __init__(self, op, left=None, right=None):\n self.op = op\n self.left = left\n self.right = right\n\nclass Solution:\n def exprTree(self, chars):\n stack = []\n root = None\n idx = 0\n N = len(chars)\n while idx < N:\n ch = chars[idx]\n if ch == ' ':\n idx += 1\n continue\n elif ch == '-':\n if not root: \n root = Node('-', 0)\n else:\n root = Node('-', root)\n idx += 1\n elif ch == '+':\n root = Node('+', root)\n idx += 1\n elif ch == '(':\n if root:\n stack.append(root)\n root = None\n idx += 1\n elif ch == ')':\n if stack:\n node = stack.pop()\n node.right = root\n root = node\n idx += 1\n else:\n buf = ''\n while idx < N and chars[idx].isdigit():\n buf += chars[idx]\n idx += 1\n buf = int(buf)\n if not root:\n root = Node('+', 0, buf)\n else:\n root.right = buf\n return root\n def evaluate(self, root):\n writeStack = []\n readStack = [root.op, root.left, root.right]\n while readStack:\n top = readStack.pop()\n if isinstance(top, int):\n writeStack.append(top)\n elif isinstance(top, str):\n a = writeStack.pop()\n b = writeStack.pop()\n if top == '+': opt = a+b\n else: opt = a-b\n writeStack.append(opt)\n else:\n readStack.append(top.op)\n readStack.append(top.left)\n readStack.append(top.right)\n return writeStack[0]\n\n def calculate(self, s: str) -> int:\n root = self.exprTree(s)\n opt = self.evaluate(root)\n return opt\n","memory":"27774"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(\" \",\"\")\n def calc(i,j):\n if i == j: return 0\n if j-i < 400:\n return eval(s[i:j])\n if s[i] == \"(\":\n balance = 1\n k = i+1\n while balance > 0:\n if s[k] == \"(\":\n balance += 1\n if s[k] == \")\":\n balance -= 1\n k += 1\n return calc(i+1,k-1)+calc(k,j)\n elif s[i] == \"-\":\n if s[i+1].isdigit():\n k = i+1\n while k < j and s[k].isdigit():\n k += 1\n return -int(s[i+1:k])+calc(k,j)\n else:\n balance = 1\n k = i+2\n while balance > 0:\n if s[k] == \"(\":\n balance += 1\n if s[k] == \")\":\n balance -= 1\n k += 1\n return -calc(i+2,k-1)+calc(k,j)\n elif s[i] == \"+\":\n return calc(i+1,j)\n else:\n k = i\n while k < j and s[k].isdigit():\n k += 1\n return int(s[i:k])+calc(k,j)\n return calc(0,len(s))\n \n","memory":"28403"},{"code":"from dataclasses import dataclass\n\nPRECEDENCE = {\n \"+\": 0,\n \"-\": 0,\n \"*\": 1,\n \"/\": 1,\n}\n\n@dataclass\nclass Expr:\n op: Literal[\"+\", \"-\", \"*\", \"/\"]\n left: Union[\"Expr\", int]\n right: Union[\"Expr\", int]\n\n\nclass Solution:\n def calculate(self, s: str) -> int:\n return self.eval_expr(self.calculate_at(s, 0)[0])\n\n def calculate_at(self, s: str, i: int) -> tuple[Expr, int]:\n output_stack = []\n operator_stack = []\n unary_op = None\n\n expr = None\n\n while i < len(s):\n x, i = self.token(s, i)\n\n if isinstance(x, int):\n if expr is None:\n expr = self.apply_unary_op(x, unary_op)\n else:\n output_stack.append(x)\n elif x == '(':\n x, i = self.calculate_at(s, i)\n # print(\"SUBEXPR IS \", x)\n if expr is None:\n expr = self.apply_unary_op(x, unary_op)\n else:\n output_stack.append(x)\n elif x == ')':\n break\n elif x == ' ':\n continue\n else:\n # print(x)\n p = PRECEDENCE[x]\n if expr is None:\n unary_op = x\n continue\n\n if operator_stack and p <= PRECEDENCE[operator_stack[-1]]:\n expr = self.build_expr(expr, output_stack, operator_stack)\n\n operator_stack.append(x)\n\n if operator_stack:\n expr = self.build_expr(expr, output_stack, operator_stack)\n\n # print(expr)\n\n return expr, i\n \n def token(self, s: str, i: int) -> (str | int, int):\n if s[i].isdigit():\n x = 0\n\n while i < len(s) and s[i].isdigit():\n x = x * 10 + int(s[i])\n i += 1 \n else:\n x = s[i]\n i += 1\n\n return x, i\n\n def build_expr(\n self,\n left: Expr | int,\n output_stack: list[int | Expr],\n operator_stack: list[str]\n ):\n cur_expr = output_stack.pop()\n while len(operator_stack) > 1:\n cur_expr = Expr(\n op=operator_stack.pop(),\n right=cur_expr,\n left=output_stack.pop(),\n )\n\n return Expr(\n op=operator_stack.pop(),\n right=cur_expr,\n left=left,\n )\n\n def combine_expr(self, a: Expr | None | int, b: Expr, op: str):\n if a is None:\n return b\n\n return Expr(\n op,\n a,\n b,\n )\n\n def apply_unary_op(self, expr: Expr, op: str | None) -> Expr:\n if op:\n return Expr(op, None, expr)\n return expr\n \n def eval_expr(self, expr: Expr | int | None) -> int:\n if expr is None:\n return 0\n if isinstance(expr, int):\n return expr\n\n if expr.left is None:\n a = expr.right if isinstance(expr.right, int) else self.eval_expr(expr.right)\n return a if expr.op == \"+\" else -a\n\n a = expr.left if isinstance(expr.left, int) else self.eval_expr(expr.left)\n b = expr.right if isinstance(expr.right, int) else self.eval_expr(expr.right)\n\n if expr.op == \"+\":\n return a + b\n elif expr.op == \"-\":\n return a - b\n elif expr.op == \"*\":\n return a * b\n else:\n return a / b","memory":"28403"},{"code":"import re\nclass Expression:\n def __init__(self): \n self.sub_expressions = []\n self.operators = []\n\n def evaluate(self):\n if len(self.operators) == 0:\n if isinstance(self.sub_expressions[0], int):\n return self.sub_expressions[0]\n else:\n return self.sub_expressions[0].evaluate()\n else:\n if len(self.sub_expressions) == len(self.operators):\n self.sub_expressions.insert(0, Operand(0))\n a0 = self.sub_expressions[0].evaluate()\n for i in range(len(self.operators)):\n if self.operators[i] == '+':\n a0 += self.sub_expressions[i+1].evaluate()\n else:\n a0 -= self.sub_expressions[i+1].evaluate()\n return a0\n def add_operand(self, operand):\n self.sub_expressions.append(operand)\n \n def add_operator(self, operator):\n self.operators.append(operator)\n\nclass Operand(Expression):\n def __init__(self, number):\n self.value = number\n def evaluate(self):\n return self.value\n\nclass Solution:\n def calculate(self, s):\n pattern = r'(\\d+|\\+|\\-|\\(|\\))'\n parts = re.findall(pattern, s)\n stack = []\n stack.append(Expression())\n current_expression = stack[0]\n for part in parts:\n if part == '(':\n stack.append(Expression())\n current_expression = stack[-1]\n elif part == ')':\n temp = stack.pop()\n current_expression = stack[-1]\n current_expression.add_operand(temp)\n elif part == '+':\n current_expression.add_operator('+')\n elif part == '-':\n current_expression.add_operator('-')\n else:\n operand = int(part)\n current_expression.add_operand(Operand(operand))\n return stack[0].evaluate()\n","memory":"29031"},{"code":"import re\nclass Expression:\n def __init__(self): \n self.sub_expressions = []\n self.operators = []\n\n def evaluate(self):\n if len(self.operators) == 0:\n if isinstance(self.sub_expressions[0], int):\n return self.sub_expressions[0]\n else:\n return self.sub_expressions[0].evaluate()\n else:\n if len(self.sub_expressions) == len(self.operators):\n self.sub_expressions.insert(0, Operand(0))\n a0 = self.sub_expressions[0].evaluate()\n for i in range(len(self.operators)):\n if self.operators[i] == '+':\n a0 += self.sub_expressions[i+1].evaluate()\n else:\n a0 -= self.sub_expressions[i+1].evaluate()\n return a0\n def add_operand(self, operand):\n self.sub_expressions.append(operand)\n \n def add_operator(self, operator):\n self.operators.append(operator)\n\nclass Operand(Expression):\n def __init__(self, number):\n self.value = number\n def evaluate(self):\n return self.value\n\nclass Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(' ', '') \n pattern = r'(\\d+|\\+|\\-|\\(|\\))'\n parts = re.findall(pattern, s)\n\n stack = []\n stack.append(Expression())\n current_expression = stack[0]\n for part in parts :\n if part == ' ':\n continue\n elif part == '(':\n stack.append(Expression())\n current_expression = stack[-1]\n elif part == ')':\n temp = stack.pop()\n current_expression = stack[-1]\n current_expression.add_operand(temp)\n elif part == '+':\n current_expression.add_operator('+')\n elif part == '-':\n current_expression.add_operator('-')\n else:\n operand = int(part)\n current_expression.add_operand(Operand(operand))\n\n return stack[0].evaluate()","memory":"29660"},{"code":"import re\nclass Expression:\n def __init__(self): \n self.sub_expressions = []\n self.operators = []\n\n def evaluate(self):\n if len(self.operators) == 0:\n if isinstance(self.sub_expressions[0], int):\n return self.sub_expressions[0]\n else:\n return self.sub_expressions[0].evaluate()\n else:\n if len(self.sub_expressions) == len(self.operators):\n self.sub_expressions.insert(0, Operand(0))\n a0 = self.sub_expressions[0].evaluate()\n for i in range(len(self.operators)):\n if self.operators[i] == '+':\n a0 += self.sub_expressions[i+1].evaluate()\n else:\n a0 -= self.sub_expressions[i+1].evaluate()\n return a0\n def add_operand(self, operand):\n self.sub_expressions.append(operand)\n \n def add_operator(self, operator):\n self.operators.append(operator)\n\nclass Operand(Expression):\n def __init__(self, number):\n self.value = number\n def evaluate(self):\n return self.value\n\nclass Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(' ', '') \n pattern = r'(\\d+|\\+|\\-|\\(|\\))'\n parts = re.findall(pattern, s)\n\n stack = []\n stack.append(Expression())\n current_expression = stack[0]\n for part in parts :\n if part == ' ':\n continue\n elif part == '(':\n stack.append(Expression())\n current_expression = stack[-1]\n elif part == ')':\n temp = stack.pop()\n current_expression = stack[-1]\n current_expression.add_operand(temp)\n elif part == '+':\n current_expression.add_operator('+')\n elif part == '-':\n current_expression.add_operator('-')\n else:\n operand = int(part)\n current_expression.add_operand(Operand(operand))\n\n return stack[0].evaluate()","memory":"29660"},{"code":"import re\nclass Expression:\n def __init__(self): \n self.sub_expressions = []\n self.operators = []\n\n def evaluate(self):\n if len(self.operators) == 0:\n if isinstance(self.sub_expressions[0], int):\n return self.sub_expressions[0]\n else:\n return self.sub_expressions[0].evaluate()\n else:\n if len(self.sub_expressions) == len(self.operators):\n self.sub_expressions.insert(0, Operand(0))\n a0 = self.sub_expressions[0].evaluate()\n for i in range(len(self.operators)):\n if self.operators[i] == '+':\n a0 += self.sub_expressions[i+1].evaluate()\n else:\n a0 -= self.sub_expressions[i+1].evaluate()\n return a0\n def add_operand(self, operand):\n self.sub_expressions.append(operand)\n \n def add_operator(self, operator):\n self.operators.append(operator)\n\nclass Operand(Expression):\n def __init__(self, number):\n self.value = number\n def evaluate(self):\n return self.value\n\nclass Solution:\n def calculate(self, s: str) -> int:\n pattern = r'(\\d+|\\+|\\-|\\(|\\))'\n parts = re.findall(pattern, s)\n\n stack = []\n stack.append(Expression())\n current_expression = stack[0]\n for part in parts :\n if part == ' ':\n continue\n elif part == '(':\n stack.append(Expression())\n current_expression = stack[-1]\n elif part == ')':\n temp = stack.pop()\n current_expression = stack[-1]\n current_expression.add_operand(temp)\n elif part == '+':\n current_expression.add_operator('+')\n elif part == '-':\n current_expression.add_operator('-')\n else:\n operand = int(part)\n current_expression.add_operand(Operand(operand))\n\n return stack[0].evaluate()","memory":"30289"},{"code":"import re\nclass Expression:\n def __init__(self): \n self.sub_expressions = []\n self.operators = []\n\n def evaluate(self):\n if len(self.operators) == 0:\n if isinstance(self.sub_expressions[0], int):\n return self.sub_expressions[0]\n else:\n return self.sub_expressions[0].evaluate()\n else:\n if len(self.sub_expressions) == len(self.operators):\n self.sub_expressions.insert(0, Operand(0))\n a0 = self.sub_expressions[0].evaluate()\n for i in range(len(self.operators)):\n if self.operators[i] == '+':\n a0 += self.sub_expressions[i+1].evaluate()\n else:\n a0 -= self.sub_expressions[i+1].evaluate()\n return a0\n def add_operand(self, operand):\n self.sub_expressions.append(operand)\n \n def add_operator(self, operator):\n self.operators.append(operator)\n\nclass Operand(Expression):\n def __init__(self, number):\n self.value = number\n def evaluate(self):\n return self.value\n\nclass Solution:\n def calculate(self, s: str) -> int:\n pattern = r'(\\d+|\\+|\\-|\\(|\\))'\n parts = re.findall(pattern, s)\n stack = []\n stack.append(Expression())\n current_expression = stack[0]\n for part in parts :\n if part == ' ':\n continue\n elif part == '(':\n stack.append(Expression())\n current_expression = stack[-1]\n elif part == ')':\n temp = stack.pop()\n current_expression = stack[-1]\n current_expression.add_operand(temp)\n elif part == '+':\n current_expression.add_operator('+')\n elif part == '-':\n current_expression.add_operator('-')\n else:\n operand = int(part)\n current_expression.add_operand(Operand(operand))\n\n return stack[0].evaluate()","memory":"30289"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(' ', '')\n f_stack = []\n b_stack = []\n num_stack = []\n i = 0\n k = 0\n n = len(s)\n while i < n:\n c = s[i]\n # print(i, c, end=' ')\n if c in '0123456789':\n num_stack.append(c)\n elif num_stack:\n num = ''.join(num_stack)\n f_stack.append((k, int(num)))\n num_stack = []\n if b_stack and b_stack[-1][0] == k: # check k is smae level\n f_stack.append(b_stack.pop())\n # continue\n if c == '(':\n k += 1\n if c == ')':\n k -= 1\n if b_stack and b_stack[-1][0] == k:\n f_stack.append(b_stack.pop())\n \n if c in '+':\n b_stack.append((k, c))\n if c in '-':\n if i == 0 or s[i-1] not in '0123456789)':\n b_stack.append((k, 'n'))\n else:\n b_stack.append((k, '-'))\n # print(f_stack, b_stack)\n\n i += 1\n \n if num_stack:\n num = ''.join(num_stack)\n f_stack.append((k, int(num)))\n num_stack = []\n if b_stack and b_stack[-1][0] == k: # check k is smae level\n f_stack.append(b_stack.pop())\n # print(f_stack, b_stack)\n # print(list(_[1] for _ in f_stack))\n \n stack = []\n for k, c in f_stack:\n if c == '+':\n n2 = stack.pop()\n n1 = stack.pop()\n stack.append(n1 + n2)\n elif c == '-':\n n2 = stack.pop()\n n1 = stack.pop()\n stack.append(n1 - n2)\n elif c == 'n':\n n1 = stack.pop()\n stack.append(-n1)\n else:\n stack.append(c)\n\n return stack[0]\n","memory":"30918"},{"code":"def is_digit(s, i):\n try:\n int(s[i])\n return True\n except ValueError:\n return False\n\n\ndef need_prepend_plus(s, i):\n if i == 0 and s[i] == \"(\":\n return True\n if is_digit(s, i):\n if i == 0 or s[i - 1] == \"(\":\n return True\n return False\n\n\ndef prepend_plus(s):\n list_ = []\n for i in range(len(s)):\n if need_prepend_plus(s, i):\n list_.append(i)\n\n if len(list_) == 0:\n return s\n\n #print('here', list_)\n s_ = s[:list_[0]]\n i = list_[0]\n for j in list_[1:]:\n #print(s_, i, j)\n s_ += \"+\"\n s_ += s[i:j]\n i = j\n s_ += \"+\" + s[list_[-1]:]\n return s_\n\n\ndef split_into_list(s):\n ret = []\n for i in range(len(s)):\n ret.append(s[i])\n\n digit_start_end = []\n i = 0\n while i < len(s):\n start = None\n if is_digit(s, i):\n start = i\n while i < len(s) and is_digit(s, i):\n i += 1\n\n if start is not None:\n digit_start_end.append((start, i))\n i += 1\n\n #print(ret)\n #print(digit_start_end)\n for (start, end) in reversed(digit_start_end):\n num = int(s[start:end])\n for _ in range(end-start-1):\n del ret[start]\n #print(ret, start, num)\n ret[start] = num\n return ret\n\n\ndef get_sign(c):\n if c == \"+\":\n return 1\n elif c == \"-\":\n return -1\n else:\n raise ValueError(f\"Got {c}\")\n\n\ndef get_num_from_list(sub_list):\n if len(sub_list) == 1:\n return sub_list[0]\n\n val = 0\n #print('n', sub_list)\n assert len(sub_list) % 2 == 0\n for i in range(len(sub_list) // 2):\n sign_char = sub_list[2 * i]\n raw_val = sub_list[2 * i + 1]\n val += get_sign(sign_char) * raw_val\n return val\n\n\ndef solve_(list_):\n stack = []\n i = 0\n num_brackets = 0\n\n while i < len(list_):\n c = list_[i]\n if c != \")\":\n stack.append(c)\n # eg (+3-42)\n else:\n sub_list = []\n while True:\n val = stack.pop()\n if val == \"(\":\n break\n sub_list.append(val)\n # print(sub_list)\n sub_list.reverse() # 24-3+ -> +3-42\n val = get_num_from_list(sub_list)\n stack.append(val)\n #print(i, stack)\n i += 1\n #print(stack, num_brackets)\n return get_num_from_list(stack)\n\n\ndef solution(s):\n s = s.replace(\" \", \"\")\n s = prepend_plus(s)\n #print(s)\n s = split_into_list(s)\n #print(s)\n return solve_(s)\n\n\n\nclass Solution:\n def calculate(self, s: str) -> int:\n return solution(s)\n ","memory":"30918"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n self.idx = 0\n\n def dfs(prefix, sign, operand):\n if self.idx >= len(s):\n return prefix + sign * operand\n \n cur = s[self.idx]\n self.idx += 1\n if cur == \" \":\n return dfs(prefix, sign, operand)\n\n if cur.isdigit():\n return dfs(prefix, sign, operand * 10 + int(cur))\n else:\n prefix += sign * operand\n if cur == \"+\":\n return dfs(prefix, 1, 0)\n elif cur == \"-\":\n return dfs(prefix, -1, 0)\n elif cur == \"(\":\n return dfs(prefix + sign * dfs(0, 1, 0), 1, 0)\n else:\n return prefix\n \n return dfs(0, 1, 0)\n","memory":"31546"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n\n def add(a, b):\n return a + b\n \n def sub(a, b):\n return a - b if a is not None else -b\n \n # def concat(a, b):\n # return a * 10 + b\n \n def apply(input, op, left):\n if not input:\n return left\n c = input.popleft()\n match c:\n case '(':\n right = apply(input, None, None)\n res = op(left, right) if op is not None else right\n return apply(input, None, res)\n case ')':\n return left\n case '+':\n return apply(input, add, left)\n case '-':\n return apply(input, sub, left)\n case ' ':\n return apply(input, op, left)\n case _:\n val = int(c)\n while input and input[0].isdigit():\n val = 10 * val + int(input.popleft())\n if op is not None:\n res = op(left, val)\n elif left is not None:\n res = 10 * left + val\n else:\n res = val\n return apply(input, None, res)\n\n return apply(deque(s), None, None)\n","memory":"32175"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n\n def add(a, b):\n return a + b\n\n def sub(a, b):\n return a - b if a is not None else -b\n\n def apply(input, op, left):\n if not input:\n return left\n c = input.popleft()\n match c:\n case '(':\n right = apply(input, None, None)\n res = op(left, right) if op is not None else right\n return apply(input, None, res)\n case ')':\n return left\n case '+':\n return apply(input, add, left)\n case '-':\n return apply(input, sub, left)\n case ' ':\n return apply(input, op, left)\n case _:\n val = int(c)\n while input and input[0].isdigit():\n val = 10 * val + int(input.popleft())\n if op is not None:\n res = op(left, val)\n else:\n res = val\n return apply(input, None, res)\n\n return apply(deque(s), None, None)\n","memory":"32804"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n s = s.replace(' ', '')\n stack = []\n f_stack = []\n b_stack = []\n num_stack = []\n i = 0\n k = 0\n n = len(s)\n while i < n:\n c = s[i]\n print(i, c, end=' ')\n if c in '0123456789':\n num_stack.append(c)\n elif num_stack:\n num = ''.join(num_stack)\n f_stack.append((k, int(num)))\n num_stack = []\n if b_stack and b_stack[-1][0] == k: # check k is smae level\n f_stack.append(b_stack.pop())\n # continue\n if c == '(':\n k += 1\n if c == ')':\n k -= 1\n if b_stack and b_stack[-1][0] == k:\n f_stack.append(b_stack.pop())\n \n if c in '+':\n b_stack.append((k, c))\n if c in '-':\n if i == 0 or s[i-1] not in '0123456789)':\n b_stack.append((k, 'n'))\n else:\n b_stack.append((k, '-'))\n # print(f_stack, b_stack)\n\n i += 1\n \n if num_stack:\n num = ''.join(num_stack)\n f_stack.append((k, int(num)))\n num_stack = []\n if b_stack and b_stack[-1][0] == k: # check k is smae level\n f_stack.append(b_stack.pop())\n # print(f_stack, b_stack)\n print(list(_[1] for _ in f_stack))\n \n stack = []\n for k, c in f_stack:\n if c == '+':\n n2 = stack.pop()\n n1 = stack.pop()\n stack.append(n1 + n2)\n elif c == '-':\n n2 = stack.pop()\n n1 = stack.pop()\n stack.append(n1 - n2)\n elif c == 'n':\n n1 = stack.pop()\n stack.append(-n1)\n else:\n stack.append(c)\n\n return stack[0]\n","memory":"33433"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n stack = []\n parsed = re.findall(r\"(\\()|(\\))|(\\+)|(-)|([0-9]+)\",s)\n for open_par, close_par, plus, minus, num in parsed:\n if open_par:\n stack.append('(')\n if num:\n if stack and stack[-1]=='-':\n stack.pop()\n stack.append(-int(num))\n else:\n stack.append(int(num))\n if close_par:\n result = 0\n while stack[-1]!='(':\n result += stack.pop()\n stack.pop()\n if stack and stack[-1]=='-':\n stack.pop()\n stack.append(-result)\n else:\n stack.append(result)\n if minus:\n stack.append('-')\n return sum(stack)\n\n\n \n \n ","memory":"35319"},{"code":"class Expr:\n def __init__(self):\n self.tokens = []\n self.ops = []\n\n def ingest(self, iter):\n for t in iter:\n match t:\n case '+':\n self.ops.append(lambda x, y: x + y)\n case '-':\n self.ops.append(lambda x, y: x - y)\n case '(':\n nestedExpr = Expr()\n nestedExpr.ingest(iter)\n self.tokens.append(nestedExpr)\n case ')':\n return\n case _:\n self.tokens.append(t)\n return self\n\n def valueOf(self, token):\n if isinstance(token, Expr):\n return token.eval()\n return token\n\n def eval(self):\n curr = self.valueOf(self.tokens[0])\n for i in range(len(self.ops)):\n curr = self.ops[i](curr, self.valueOf(self.tokens[i + 1]))\n return curr\n\nclass Solution:\n def tokenize(self, s: str) -> list[str]: \n numAcc = ''\n tokens = []\n expectingExpression = True\n for c in s:\n match c:\n case '+':\n if numAcc:\n n = int(numAcc)\n tokens.append(n)\n numAcc = ''\n tokens.append(c)\n expectingExpression = True\n case '-':\n if numAcc:\n n = int(numAcc)\n tokens.append(n)\n tokens.append(c)\n numAcc = '' \n expectingExpression = True\n elif expectingExpression:\n tokens.append(0)\n tokens.append(c)\n else:\n tokens.append(c)\n \n case '(':\n if numAcc:\n n = int(numAcc)\n tokens.append(n)\n numAcc = ''\n tokens.append(c)\n expectingExpression = True\n case ')':\n if numAcc:\n n = int(numAcc)\n tokens.append(n)\n numAcc = ''\n tokens.append(c)\n expectingExpression = False\n case ' ':\n if numAcc:\n n = int(numAcc)\n tokens.append(n)\n numAcc = ''\n expectingExpression = False\n case _:\n numAcc += c\n if numAcc:\n tokens.append(int(numAcc))\n \n return tokens\n\n\n def calculate(self, s: str) -> int:\n tokens = self.tokenize(s)\n return Expr().ingest((t for t in tokens)).eval()\n ","memory":"35948"},{"code":"class Solution:\n def calculate(self, expression: str) -> int:\n \"\"\"Recursive descent.\n \"\"\"\n OPERATORS = {\n \"+\": lambda a, b: a + b,\n \"-\": lambda a, b: a - b,\n \"*\": lambda a, b: a * b,\n \"/\": lambda a, b: a / b,\n }\n def parse(token_stack: list[tuple[str | int, int]]) -> int:\n negate = 1\n if token_stack[-1][0] == \"-\":\n token_stack.pop()\n negate = -1\n \n # Descend!\n val = negate * parse_operand(token_stack)\n\n # Keep reading more operands and operators until the token stream is ended.\n # Or this context is over and an end paren ) is found.\n while len(token_stack) > 0 and token_stack[-1][0] != \")\":\n op, pos = token_stack.pop()\n assert op in \"+-*/\", f\"Expected operator at pos {pos}\"\n\n # Descend!\n val2 = parse_operand(token_stack)\n try:\n val = OPERATORS[op](val, val2)\n except KeyError:\n raise RuntimeError(f\"Unknown operator {op} at pos {pos}\")\n\n return val\n\n def parse_operand(token_stack: list[tuple[str | int, int]]) -> int:\n top, pos = token_stack.pop()\n if isinstance(top, int):\n return top\n if top == '(':\n val = parse(token_stack)\n top, pos = token_stack.pop()\n assert top == ')', f\"No end paren at pos {pos}\"\n return val\n raise RuntimeError(f\"Expected paren ( or integer at pos {pos}\")\n\n token_stack: list[tuple[str | int, int]] = []\n current_int: tuple[list[str], int] = ([], -1)\n # The sharp/octothorpe/pound/number symbol # is the end of input\n for pos, char in enumerate(expression + \"#\"):\n if char in \"0123456789\":\n if not current_int[0]:\n current_int = ([], pos)\n # Join all integer characters\n current_int[0].append(char)\n elif current_int[0]:\n # Read an entire int\n val = int(\"\".join(current_int[0]))\n token_stack.append((val, current_int[1]))\n current_int = ([], -1)\n # Skip chars\n if char == \" \":\n continue\n # Each operator is a single token, even -\n if char in \"()+*/-\":\n # Since there are no consecutive operators, we don't need lookahead\n token_stack.append((char, pos))\n # First tokens are now at the end where they are removed with .pop()\n token_stack.reverse()\n return parse(token_stack)\n","memory":"36576"},{"code":"from enum import Enum\n\n\nclass Token:\n class TokenType(Enum):\n NUM = 0\n LEFT_PAR = 1\n RIGHT_PAR = 2\n NEG = 3\n PLUS = 4\n\n def __init__(self, token_type, val):\n self.token_type = token_type\n self.val = val\n\n def __repr__(self):\n # return \"[{}:{}]\".format(self.token_type.name, str(self.val))\n return str(self.val)\n\nclass Solution:\n def genToken(self, s) -> List[Token]:\n tokens = []\n\n i = 0\n while i < len(s):\n c = s[i]\n if c == '(':\n tokens.append(Token(Token.TokenType.LEFT_PAR, c))\n i += 1\n elif c == ')':\n tokens.append(Token(Token.TokenType.RIGHT_PAR, c))\n i += 1\n elif c == '-':\n if len(tokens) == 0 or tokens[-1].token_type == Token.TokenType.LEFT_PAR:\n tokens.append(Token(Token.TokenType.NUM, 0))\n\n tokens.append(Token(Token.TokenType.NEG, c))\n i += 1\n elif c == ' ':\n i += 1\n pass\n elif c.isdigit():\n end_i = i+1\n while end_i < len(s) and s[end_i].isdigit():\n end_i += 1\n val = int(s[i : end_i])\n i = end_i\n tokens.append(Token(Token.TokenType.NUM, val))\n elif c == '+':\n tokens.append(Token(Token.TokenType.PLUS, c))\n i += 1\n else:\n print(\"Unknown char: \", c)\n i += 1\n\n return tokens\n \n def toPostPrefix(self, tokens):\n pass\n queue = []\n stack = []\n\n for token in tokens:\n if token.token_type == Token.TokenType.NUM:\n queue.append(token)\n elif token.token_type == Token.TokenType.LEFT_PAR:\n stack.append(token)\n elif token.token_type == Token.TokenType.RIGHT_PAR:\n while stack[-1].token_type != Token.TokenType.LEFT_PAR:\n queue.append(stack.pop())\n\n # Pop \"(\"\n stack.pop()\n elif token.token_type in [Token.TokenType.NEG, Token.TokenType.PLUS]:\n if stack and (stack[-1].token_type in [Token.TokenType.NEG, Token.TokenType.PLUS] ):\n queue.append(stack.pop())\n stack.append(token)\n\n while stack:\n queue.append(stack.pop())\n\n return queue\n\n def evalPost(self, tokens):\n stack = []\n\n for token in tokens:\n if token.token_type == Token.TokenType.NUM:\n stack.append(token.val)\n elif token.token_type in [Token.TokenType.NEG, Token.TokenType.PLUS]:\n \n right = stack.pop()\n left = stack.pop()\n val = 0\n if token.token_type == Token.TokenType.NEG:\n val = left - right\n else:\n val = left + right\n stack.append(val)\n else:\n print(\"Unknown token in evalPost\", token)\n\n return stack[-1]\n \n\n\n def calculate(self, s: str) -> int:\n tokens = self.genToken(s)\n # print(tokens)\n\n tokens = self.toPostPrefix(tokens)\n # print(tokens)\n \n num = 0\n num = self.evalPost(tokens)\n \n\n return num","memory":"37205"},{"code":"from dataclasses import dataclass\n\n# -\n# +\n# + 3 (3)\n# 1 2\n\n# 1 + 2 + 3 - (3 - (1 + 8)) + 5 + 9\n\nclass TreeNode:\n def __init__(self, val=None, left=None, right=None):\n self.left = left\n self.right = right\n self.val = val\n\n def empty(self):\n return self.val is None and self.left is None and self.right is None\n\n def eval(self):\n\n if self.val is None:\n return self.left.eval()\n\n if isinstance(self.val, int):\n return self.val\n\n if self.right is None:\n return self.left.eval()\n else:\n if self.val == '+':\n return self.left.eval() + self.right.eval()\n elif self.val == '-':\n if self.right is None:\n return -self.left.eval()\n return self.left.eval() - self.right.eval()\n\n\n# +\n# 1 ()\n# 1 + 2 + 3\n# Support only single digit integers\n# do not support unary - operations\nclass Solution:\n def calculate(self, s: str) -> int:\n curr_node = TreeNode()\n stack = []\n i = 0\n n = len(s)\n\n while i < n:\n if s[i] == ')':\n # Finished constructing the subnode.\n sub_node = curr_node\n curr_node = stack.pop()\n\n if curr_node.left is None:\n curr_node.left = sub_node\n else:\n curr_node.right = sub_node\n elif s[i] == '(':\n # ( is only valid if we have a fresh node on top, or a - node with right side empty\n new_node = TreeNode()\n stack.append(curr_node)\n curr_node = new_node\n elif s[i] in '+-':\n if s[i] == '-' and curr_node.empty():\n curr_node.left = TreeNode(0)\n curr_node.val = '-'\n else:\n # in all cases we need to fork the current operation to the left, and figure out the right side later.\n # Stack cannot be empty as +- for now cannot be used as unary)\n new_node = TreeNode()\n new_node.left = curr_node\n new_node.val = s[i]\n curr_node = new_node\n elif s[i].isdigit():\n\n j = 0\n while i + j < len(s) and s[i + j].isdigit():\n j += 1\n\n # on a number either fill in the value for the current node\n # or if the node is an open node of state\n # root\n # LEFT {{EMTPY}}\n # fill in the number directly to the right side.\n curr_val = int(s[i:i + j])\n\n if curr_node.val is not None:\n assert curr_node.right is None\n new_node = TreeNode()\n new_node.val = curr_val\n curr_node.right = new_node\n else:\n assert curr_node.left is None\n curr_node.val = curr_val\n\n i += j - 1\n\n i += 1\n\n return curr_node.eval()\n\n\n","memory":"37834"},{"code":"class Expr:\n def __init__(self, value: str, left: 'Expr' = None, right: 'Expr' = None):\n self.value = value\n self.left = left\n self.right = right\n\n # def toString(self):\n # s = self.value\n # hasLeft = self.left is not None\n # hasRight = self.right is not None\n # if not (hasLeft or hasRight):\n # return s\n # s += \"(\"\n # if hasLeft:\n # s += self.left.toString()\n # if hasRight:\n # s += \" \"\n # s += self.right.toString()\n # s += \")\"\n # return s\n\nclass Solution:\n def calculate(self, s: str) -> int:\n root = Parser(s).parse()\n #print(root.toString())\n return self.evaluate(root)\n\n def evaluate(self, expr: Expr) -> int:\n if expr.value.isdigit():\n return int(expr.value)\n elif expr.value == '-':\n if expr.right is None:\n return -self.evaluate(expr.left)\n else:\n return self.evaluate(expr.left) - self.evaluate(expr.right)\n elif expr.value == '+':\n return self.evaluate(expr.left) + self.evaluate(expr.right)\n elif expr.value == '/':\n return self.evaluate(expr.left) / self.evaluate(expr.right)\n elif expr.value == '*':\n return self.evaluate(expr.left) * self.evaluate(expr.right) \n\nclass Parser:\n def __init__(self, tokens: str):\n self.tokens = tokens\n self.current = 0\n\n def parse(self) -> Expr:\n return self.term()\n \n def term(self) -> Expr:\n expr = self.factor()\n matched, token = self.tryMatch(\"+-\")\n while matched:\n right = self.factor()\n expr = Expr(token, expr, right)\n matched, token = self.tryMatch(\"+-\")\n return expr\n\n def factor(self) -> Expr:\n expr = self.negative()\n matched, token = self.tryMatch(\"*/\")\n while matched:\n right = self.negative()\n expr = Expr(token, expr, right)\n matched, token = self.tryMatch(\"*/\")\n return expr\n\n def negative(self) -> Expr:\n if self.match(\"-\"):\n return Expr(\"-\", self.group())\n return self.group()\n\n def group(self) -> Expr:\n if self.match(\"(\"):\n expr = self.parse()\n self.pop()\n return expr\n return self.number()\n\n def number(self) -> Expr:\n s = \"\"\n while self.peek() is not None and self.peek().isdigit():\n s += self.pop()\n return Expr(s)\n \n def tryMatch(self, template:str) -> (bool, str):\n for c in template:\n if self.peek() == c:\n self.current += 1\n return True, c\n return False, None\n\n def match(self, token:str) -> str:\n if self.peek() == token:\n self.current += 1\n return True\n return False\n\n def pop(self) -> str:\n self.token = self.peek()\n self.current += 1\n return self.token\n\n def peek(self) -> str:\n self.trim()\n if self.current >= len(self.tokens):\n return None\n return self.tokens[self.current]\n\n def trim(self):\n while (self.current < len(self.tokens) and \n self.tokens[self.current] == ' '):\n self.current += 1\n","memory":"38463"},{"code":"class Expr:\n def __init__(self, value: str, left: 'Expr' = None, right: 'Expr' = None):\n self.value = value\n self.left = left\n self.right = right\n\n # def toString(self):\n # s = self.value\n # hasLeft = self.left is not None\n # hasRight = self.right is not None\n # if not (hasLeft or hasRight):\n # return s\n # s += \"(\"\n # if hasLeft:\n # s += self.left.toString()\n # if hasRight:\n # s += \" \"\n # s += self.right.toString()\n # s += \")\"\n # return s\n\nclass Solution:\n def calculate(self, s: str) -> int:\n root = Parser(s).parse()\n #print(root.toString())\n return self.evaluate(root)\n\n def evaluate(self, expr: Expr) -> int:\n if expr.value.isdigit():\n return int(expr.value)\n elif expr.value == '-':\n if expr.right is None:\n return -self.evaluate(expr.left)\n else:\n return self.evaluate(expr.left) - self.evaluate(expr.right)\n elif expr.value == '+':\n return self.evaluate(expr.left) + self.evaluate(expr.right)\n elif expr.value == '/':\n return self.evaluate(expr.left) / self.evaluate(expr.right)\n elif expr.value == '*':\n return self.evaluate(expr.left) * self.evaluate(expr.right) \n\nclass Parser:\n def __init__(self, tokens: str):\n self.tokens = tokens\n self.current = 0\n\n def parse(self) -> Expr:\n return self.term()\n \n def term(self) -> Expr:\n expr = self.factor()\n matched, token = self.tryMatch(\"+-\")\n while matched:\n right = self.factor()\n expr = Expr(token, expr, right)\n matched, token = self.tryMatch(\"+-\")\n return expr\n\n def factor(self) -> Expr:\n expr = self.negative()\n matched, token = self.tryMatch(\"*/\")\n while matched:\n right = self.negative()\n expr = Expr(token, expr, right)\n matched, token = self.tryMatch(\"*/\")\n return expr\n\n def negative(self) -> Expr:\n if self.match(\"-\"):\n return Expr(\"-\", self.group())\n return self.group()\n\n def group(self) -> Expr:\n if self.match(\"(\"):\n expr = self.parse()\n self.pop()\n return expr\n return self.number()\n\n def number(self) -> Expr:\n s = \"\"\n while self.peek() is not None and self.peek().isdigit():\n s += self.pop()\n return Expr(s)\n \n def tryMatch(self, template:str) -> (bool, str):\n for c in template:\n if self.peek() == c:\n self.current += 1\n return True, c\n return False, None\n\n def match(self, token:str) -> str:\n if self.peek() == token:\n self.current += 1\n return True\n return False\n\n def pop(self) -> str:\n self.token = self.peek()\n self.current += 1\n return self.token\n\n def peek(self) -> str:\n self.trim()\n if self.current >= len(self.tokens):\n return None\n return self.tokens[self.current]\n\n def trim(self):\n while (self.current < len(self.tokens) and \n self.tokens[self.current] == ' '):\n self.current += 1\n","memory":"38463"},{"code":"class Token:\n def __init__(self, val, left=None, right=None):\n self.left = left\n self.right = right\n self.val = val\n\n def evaluate(self):\n left = right = 0\n if self.left:\n left = self.left.evaluate()\n if self.right:\n right = self.right.evaluate()\n\n if self.val == \"(\":\n return right\n elif self.val == \"+\":\n return left + right\n elif self.val == \"-\":\n return left - right\n return int(self.val)\n\n def __str__(self):\n left = self.left if self.left else \"\"\n right = self.right if self.right else \"\"\n return f\"{left}{self.val}{right}\"\n\ndef handle_simple_expr(tokens):\n char = tokens.pop()\n if char == \"-\":\n return Token(\"-\", right=handle_simple_expr(tokens))\n if char == \"(\" or char == \")\":\n new_token = handle_complex_expr(tokens)\n # Assumed to be )\n tokens.pop()\n elif char.isnumeric():\n new_token = Token(char)\n else:\n return None\n return new_token\n\ndef handle_complex_expr(tokens):\n left = handle_simple_expr(tokens)\n while tokens:\n # char = tokens.pop()\n next_char = tokens[-1] if tokens else None\n if next_char and next_char == \"+\" or next_char == \"-\":\n # this is wrong\n tokens.pop()\n right = handle_simple_expr(tokens)\n left = Token(next_char, left, right)\n else:\n break\n\n return left\n\nclass Solution:\n def calculate(self, s: str) -> int:\n tokens = list(reversed(re.findall((\"[\\d]+|[+\\-()]\"), s)))\n\n left = handle_complex_expr(tokens)\n\n return left.evaluate()","memory":"39091"},{"code":"class Token:\n def __init__(self, val, type, priority, op_type=None) -> None:\n self.val = val\n self.type = type\n self.priority = priority\n self.op_type = op_type\n\ndef is_number(c):\n numbers = {'1','2','3','4','5','6','7','8','9','0'}\n\n return c in numbers\n\n\ndef tokenizer(s):\n i = 0\n tokens = []\n\n while i < len(s):\n\n if s[i] == ' ':\n i += 1\n continue\n\n if is_number(s[i]):\n number = s[i]\n i += 1\n while i < len(s) and is_number(s[i]):\n number += s[i]\n i += 1\n tokens.append(Token(number, 'NUM', 10))\n continue\n\n elif s[i] == '+':\n tokens.append(Token(s[i], 'OPERATION', 50, 'BINARY'))\n elif s[i] == '-':\n if len(tokens) == 0 or (tokens[-1].type != 'NUM' and tokens[-1].type != 'BR'):\n tokens.append(Token(s[i], 'OPERATION', 100, 'UNARY'))\n else:\n tokens.append(Token(s[i], 'OPERATION', 50, 'BINARY'))\n elif s[i] == '*' or s[i] == '/':\n tokens.append(Token(s[i], 'OPERATION', 60, 'BINARY'))\n elif s[i] == '(':\n tokens.append(Token(s[i], 'BL', 15))\n elif s[i] == ')':\n tokens.append(Token(s[i], 'BR', 15))\n\n\n i += 1\n\n return tokens\n\n\n\ndef to_rpn(tokens):\n expr = []\n stack = []\n\n for tok in tokens:\n if tok.type == 'NUM':\n expr.append(tok)\n elif tok.type == 'OPERATION':\n if tok.op_type == 'UNARY':\n stack.append(tok)\n elif tok.op_type == 'BINARY':\n while len(stack) > 0 and stack[-1].priority >= tok.priority:\n expr.append(stack.pop())\n stack.append(tok)\n elif tok.type == 'BL':\n stack.append(tok)\n elif tok.type == 'BR':\n while stack[-1].val != '(':\n expr.append(stack.pop())\n stack.pop()\n\n while len(stack) > 0:\n expr.append(stack.pop())\n\n return expr\n\ndef evaluate(expr):\n calc = []\n for val in expr:\n if val.type == 'NUM':\n calc.append(int(val.val))\n else:\n if val.val == '+':\n calc.append((calc.pop()) + (calc.pop()))\n elif val.val == '-' and val.op_type == 'BINARY':\n calc.append(-(calc.pop()) + (calc.pop()))\n elif val.val == '-' and val.op_type == 'UNARY':\n calc.append(-(calc.pop()))\n elif val.val == '*':\n calc.append((calc.pop()) * (calc.pop()))\n elif val.val == '/':\n calc.append(int(1 / (calc.pop()) * (calc.pop())))\n\n return calc[0]\n\nclass Solution:\n def calculate(self, s: str) -> int:\n return int(evaluate(to_rpn(tokenizer(s))))\n","memory":"39720"},{"code":"class Add:\n def __init__(self,left,right):\n self.left = left\n self.right = right\n \n def eval(self):\n return self.left.eval() + self.right.eval()\n\nclass Neg:\n def __init__(self,num):\n self.num = num\n \n def eval(self):\n return - self.num.eval()\n\nclass Num:\n def __init__(self,num):\n self.num = int(num)\n \n def eval(self):\n return self.num\n\nclass Parser:\n valid_ops = set(['+','-'])\n brackets = set(['(',')'])\n\n def is_op_or_bracket(self,char):\n return char in self.valid_ops or char in self.brackets\n\n def __init__(self,s):\n s = s.replace(\" \",\"\")\n symbols = []\n start = 0\n for i,char in enumerate(s):\n if char in self.valid_ops or char in self.brackets:\n if start != i:\n symbols.append(s[start:i])\n symbols.append(s[i])\n start = i + 1\n if start < len(s):\n symbols.append(s[start:])\n self.symbols = symbols\n print(self.symbols)\n\n def find_closing_bracket(self,start):\n count = 1 if self.symbols[start] == '(' else 0\n start += 1\n while start < len (self.symbols) and count > 0:\n if self.symbols[start] == '(':\n count += 1\n if self.symbols[start] == ')':\n count -= 1\n if count > 0:\n start += 1\n return start\n\n def parse(self, start = None, end = None) -> Add|Neg|Num:\n if start == None:\n return self.parse(0,len(self.symbols))\n stack = []\n op_stack = []\n i = start\n while i < end:\n if self.symbols[i] == '-' and len(stack) == 0:\n stack.append(Num(0))\n if self.symbols[i] in self.valid_ops:\n op_stack.append(self.symbols[i])\n elif self.symbols[i] in self.brackets:\n j = self.find_closing_bracket(i)\n stack.append(self.parse(i+1,j))\n i = j\n else:\n stack.append(Num(self.symbols[i]))\n if len(op_stack) > 0 and len(stack) > 1:\n op = op_stack.pop()\n right = stack.pop()\n left = stack.pop()\n if op == '-':\n stack.append(Add(left,Neg(right)))\n else:\n stack.append(Add(left,right))\n i += 1\n return stack.pop()\n \n\n\nclass Solution:\n \n def calculate(self, s: str) -> int:\n \n parser = Parser(s)\n\n expr = parser.parse()\n\n return expr.eval()","memory":"40349"},{"code":"from dataclasses import dataclass\n\n@dataclass\nclass Expression:\n def evaluate(self):\n raise NotImplementedError()\n\n # @classmethod\n # def list_from_tokens(cls, tokens: List[str]) -> Tuple[\"Expression\", List[str]]:\n # assert len(tokens) > 0\n # if tokens[0] == \"-\":\n # sub_expression, leftover_tokens = Expression.from_tokens(tokens[1:])\n # return Negation(sub_expression), leftover_tokens\n # elif tokens[0] == \"(\":\n # end_paren = len(tokens) - 1\n # while tokens[end_paren] != \")\":\n # end_paren -= 1\n # return Sum()\n\n @classmethod\n def from_tokens(\n cls,\n tokens: List[str],\n first: int,\n last: int,\n ) -> List[\"Expression\"]:\n if first == last:\n return []\n\n if isinstance(tokens[first], int):\n return [Number(value=tokens[first])] + Expression.from_tokens(tokens, first + 1, last)\n elif tokens[first] == \"-\":\n remaining_expressions = Expression.from_tokens(tokens, first + 1, last)\n remaining_expressions[0] = Negation(remaining_expressions[0])\n return remaining_expressions\n elif tokens[first] == \"(\":\n stack_depth = 0\n for end_paren_pos in range(first, last + 1):\n if tokens[end_paren_pos] == \"(\":\n stack_depth += 1\n elif tokens[end_paren_pos] == \")\":\n stack_depth -= 1\n if stack_depth == 0:\n break\n expressions_from_remaining = Expression.from_tokens(tokens, end_paren_pos+1, last)\n paren_part = Sum(sub_expressions=Expression.from_tokens(\n tokens,\n first + 1,\n end_paren_pos\n ))\n return [paren_part] + expressions_from_remaining\n raise ValueError(f\"How did my list of tokens become {tokens}?\")\n \n\n@dataclass\nclass Number(Expression):\n value: int\n def evaluate(self):\n return self.value\n def __repr__(self):\n return str(self.value)\n\n@dataclass\nclass Sum(Expression):\n sub_expressions: List[\"Expression\"]\n def evaluate(self):\n return sum(sub_expression.evaluate() for sub_expression in self.sub_expressions)\n def __repr__(self):\n return \"(\" + \" + \".join(str(sub_expression) for sub_expression in self.sub_expressions) + \")\"\n\n\n@dataclass\nclass Negation(Expression):\n sub_expression: \"Expression\"\n def evaluate(self):\n return -self.sub_expression.evaluate()\n\n def __repr__(self):\n return \"-\" + str(self.sub_expression)\n\n\nclass Solution:\n def calculate(self, s: str) -> int:\n tokens = []\n digits = set(\"0123456789\")\n other = set(\"()-\")\n for i, c in enumerate(s):\n if c in digits:\n if i == 0 or s[i-1] not in digits:\n tokens.append(0)\n tokens[-1] = tokens[-1] * 10 + int(c)\n elif c in other:\n tokens.append(c)\n if len(tokens) == 0:\n return 0\n tokens = [\"(\"] + tokens + [\")\"]\n expression = Expression.from_tokens(tokens, 0, len(tokens))\n return expression[0].evaluate()\n ","memory":"40978"},{"code":"INF = float('inf')\nEPS = 1e-6\nDUMMY = '?'\n\nclass Node:\n def __init__(self, val=0, op='', pri=0):\n self.val = val\n self.op = op\n self.pri = pri\n self.left = None\n self.right = None\n def __repr__(self,):\n lstr = f\"\\nL{self.left}\" if self.left else \"\"\n rstr = f\"\\nR{self.right}\" if self.right else \"\"\n return f\"{self.val},{self.op},{self.pri}{lstr}{rstr}\"\n\nclass Solution:\n def calculate(self, s: str) -> int:\n c2pri = {\"+\":1,\"-\":1, DUMMY:-INF}\n s = s.strip()\n if s[0] == '-': # ex. '-1'\n s = \"0\"+s\n stack = [] # monotomic inc\n num = 0\n base_pri = 0\n for i in range(len(s)):\n c = s[i]\n \n if c.isdigit():\n num = num*10+int(c) # don't continue !\n if i == len(s)-1: # careful !!!\n c = DUMMY # use dummy to clear stack!\n if c.isdigit():\n continue\n if c==\" \":\n continue\n elif c == '(':\n base_pri += 10\n elif c == ')':\n base_pri -= 10\n else: # + - ? ; // [prev, nd, op]\n nd = Node(val=num, pri=INF)\n num = 0\n stack.append(nd) # mono inc stack !\n op = Node(op=c, pri = base_pri+c2pri[c]-i*EPS)\n # min-tree: max of left-smaller and right-smaller is parent\n while stack and stack[-1].pri >= op.pri:\n prev = stack.pop() # [-1, prev, op]\n if stack:\n if stack[-1].pri >= op.pri:\n # don't link to op, keep backwards! op could be dummy\n stack[-1].right = prev\n else:\n op.left = prev\n else:\n op.left = prev\n stack.append(op)\n root = stack[-1].left\n return self.post(root)\n \n def post(self,node):\n if node.left is None and node.right is None:\n return node.val\n l = self.post(node.left)\n r = self.post(node.right)\n if node.op == \"+\":\n return l+r\n elif node.op == \"-\":\n return l-r\n\n\"\"\"\nhttps://leetcode.com/problems/basic-calculator/solutions/1456850/python-basic-calculator-i-ii-iii-easy-solution-detailed-explanation/\n\"\"\"\n","memory":"41606"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n lexer = Lexer(s)\n parser = Parser(lexer)\n parse_tree = parser.parse(None)\n print(parse_tree)\n interpreter = Interpreter(parse_tree)\n return interpreter.eval()\n\nclass Lexer:\n def __init__(self, expr: str):\n self.expr = expr\n self.i = 0\n def parse_num(self) -> str:\n num = \"\"\n while self.i < len(self.expr) and self.expr[self.i].isdigit() :\n num += self.expr[self.i]\n self.i += 1\n return num\n def next_token(self) -> str:\n if self.i == len(self.expr):\n return \"\"\n\n ch = self.expr[self.i]\n if ch == \" \":\n self.i += 1 ; return self.next_token()\n elif ch.isdigit():\n num = self.parse_num()\n return num\n elif ch in ['+', '-', '(', ')']:\n self.i += 1 ; return ch\n\nclass num_node:\n def __init__(self, num):\n self.num = num\n def __repr__(self):\n return f'{self.num}'\nclass add_node:\n def __init__(self, left, right):\n self.left = left\n self.right = right\n def __repr__(self):\n return f'{self.left}+{self.right}'\nclass subtract_node:\n def __init__(self, left, right):\n self.left = left\n self.right = right\n def __repr__(self):\n return f'{self.left}-{self.right}'\nclass negate_node:\n def __init__(self, parse_tree):\n self.parse_tree = parse_tree\n def __repr__(self):\n return f' -{self.parse_tree}'\nclass group_node:\n def __init__(self, parse_tree):\n self.parse_tree = parse_tree\n def __repr__(self):\n return f'({self.parse_tree})'\nparse_node = num_node | add_node | subtract_node | negate_node | group_node\nclass Parser:\n def __init__(self, lexer):\n self.lexer = lexer\n def next_node(self, last_node) -> parse_node:\n token = self.lexer.next_token()\n if token == \"\":\n return None\n elif token == \")\":\n return None\n elif token.isnumeric():\n return num_node(int(token))\n elif token == \"+\":\n return add_node(last_node, self.next_node(None))\n elif token == \"-\":\n if last_node is None:\n return negate_node(self.next_node(None))\n else:\n return subtract_node(last_node, self.next_node(None))\n elif token == \"(\":\n return group_node(self.parse(None))\n\n def parse(self, parse_tree: parse_node) -> parse_node:\n node = self.next_node(parse_tree)\n if node is None:\n return parse_tree\n else:\n return self.parse(node)\n \nclass Interpreter:\n def __init__(self, parse_tree):\n self.parse_tree = parse_tree\n def eval(self) -> int:\n return self.eval_pt(self.parse_tree)\n def eval_pt(self, parse_tree: parse_node) -> int:\n if isinstance(parse_tree, num_node):\n return parse_tree.num\n elif isinstance(parse_tree, add_node):\n return self.eval_pt(parse_tree.left) + self.eval_pt(parse_tree.right)\n elif isinstance(parse_tree, subtract_node):\n return self.eval_pt(parse_tree.left) - self.eval_pt(parse_tree.right)\n elif isinstance(parse_tree, negate_node):\n return -1 * self.eval_pt(parse_tree.parse_tree)\n elif isinstance(parse_tree, group_node):\n return self.eval_pt(parse_tree.parse_tree)","memory":"42235"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n lexer = Lexer(s)\n parser = Parser(lexer)\n parse_tree = parser.parse(None)\n print(parse_tree)\n interpreter = Interpreter(parse_tree)\n return interpreter.eval()\n\nclass Lexer:\n def __init__(self, expr: str):\n self.expr = expr\n self.i = 0\n def parse_num(self) -> str:\n num = \"\"\n while self.i < len(self.expr) and self.expr[self.i].isdigit() :\n num += self.expr[self.i]\n self.i += 1\n return num\n def next_token(self) -> str:\n if self.i == len(self.expr):\n return \"\"\n\n ch = self.expr[self.i]\n if ch == \" \":\n self.i += 1 ; return self.next_token()\n elif ch.isdigit():\n num = self.parse_num()\n return num\n elif ch in ['+', '-', '(', ')']:\n self.i += 1 ; return ch\n\nclass num_node:\n def __init__(self, num):\n self.num = num\n def __repr__(self):\n return f'{self.num}'\nclass add_node:\n def __init__(self, left, right):\n self.left = left\n self.right = right\n def __repr__(self):\n return f'{self.left}+{self.right}'\nclass subtract_node:\n def __init__(self, left, right):\n self.left = left\n self.right = right\n def __repr__(self):\n return f'{self.left}-{self.right}'\nclass negate_node:\n def __init__(self, parse_tree):\n self.parse_tree = parse_tree\n def __repr__(self):\n return f' -{self.parse_tree}'\nclass group_node:\n def __init__(self, parse_tree):\n self.parse_tree = parse_tree\n def __repr__(self):\n return f'({self.parse_tree})'\nparse_node = num_node | add_node | subtract_node | negate_node | group_node\nclass Parser:\n def __init__(self, lexer):\n self.lexer = lexer\n def next_node(self, last_node) -> parse_node:\n token = self.lexer.next_token()\n if token == \"\":\n return None\n elif token == \")\":\n return None\n elif token.isnumeric():\n return num_node(int(token))\n elif token == \"+\":\n return add_node(last_node, self.next_node(None))\n elif token == \"-\":\n if last_node is None:\n return negate_node(self.next_node(None))\n else:\n return subtract_node(last_node, self.next_node(None))\n elif token == \"(\":\n return group_node(self.parse(None))\n\n def parse(self, parse_tree: parse_node) -> parse_node:\n node = self.next_node(parse_tree)\n if node is None:\n return parse_tree\n else:\n return self.parse(node)\n \nclass Interpreter:\n def __init__(self, parse_tree):\n self.parse_tree = parse_tree\n def eval(self) -> int:\n return self.eval_pt(self.parse_tree)\n def eval_pt(self, parse_tree: parse_node) -> int:\n if isinstance(parse_tree, num_node):\n return parse_tree.num\n elif isinstance(parse_tree, add_node):\n return self.eval_pt(parse_tree.left) + self.eval_pt(parse_tree.right)\n elif isinstance(parse_tree, subtract_node):\n return self.eval_pt(parse_tree.left) - self.eval_pt(parse_tree.right)\n elif isinstance(parse_tree, negate_node):\n return -1 * self.eval_pt(parse_tree.parse_tree)\n elif isinstance(parse_tree, group_node):\n return self.eval_pt(parse_tree.parse_tree)","memory":"42864"},{"code":"from abc import ABC, abstractmethod\nfrom dataclasses import dataclass\nfrom typing import Callable, Iterable, Literal, TypeAlias, assert_never\n\nTokenTypes: TypeAlias = Literal[\n \"Number\", \"Plus\", \"Minus\", \"LeftParenthesis\", \"RightParenthesis\", \"EOF\"\n]\nLiteralValue: TypeAlias = int\n\n\n@dataclass\nclass Token:\n token_type: TokenTypes\n lexeme: str\n position: int\n literal: LiteralValue | None\n\n\nclass Lexer:\n def __init__(self, source: str):\n self.source = source\n self.start = 0\n self.current = 0\n return super().__init__()\n\n def exhausted(self):\n return self.current >= len(self.source)\n\n def _consume(self):\n return self.source[self._advance()]\n\n def _peek(self):\n return None if self.exhausted() else self.source[self.current]\n\n def _advance(self):\n self.current = (current := self.current) + 1\n return current\n\n def _make(\n self, token_type: TokenTypes, parse: Callable[[str], LiteralValue] | None = None\n ):\n lexeme = self._lexeme()\n literal = None if parse is None else parse(lexeme)\n return Token(token_type, lexeme, self.start, literal)\n\n def _lexeme(self):\n return self.source[self.start : self.current]\n\n def __iter__(self):\n return self\n\n def __next__(self):\n while not self.exhausted():\n if (token := self._get()) is not None:\n return token\n raise StopIteration\n\n def _get(self):\n self.start = self.current\n match (consumed := self._consume()):\n case \" \":\n return None\n case \"(\":\n return self._make(\"LeftParenthesis\")\n case \")\":\n return self._make(\"RightParenthesis\")\n case \"+\":\n return self._make(\"Plus\")\n case \"-\":\n return self._make(\"Minus\")\n case d if d.isdigit():\n while (peek := self._peek()) is not None and peek.isdigit():\n self._advance()\n return self._make(\"Number\", int)\n case other:\n raise ValueError(f\"Invalid token {other!r}!\")\n assert_never(consumed)\n\n\nclass Expression(ABC):\n @abstractmethod\n def evaluate(self) -> int: ...\n\n @abstractmethod\n def __str__(self) -> str: ...\n\n\nclass NumberLiteral(Expression):\n def __init__(self, value: int):\n self.value = value\n return super().__init__()\n\n def evaluate(self) -> int:\n return self.value\n\n def __str__(self) -> str:\n return str(self.value)\n\n\nclass UnaryExpression(Expression):\n def __init__(self, expr: Expression, operator: Token):\n self.expr = expr\n self.operator = operator\n return super().__init__()\n\n def evaluate(self) -> int:\n value = self.expr.evaluate()\n match (token_type := self.operator.token_type):\n case \"Minus\":\n return -value\n case other:\n raise Exception(f\"Invalid unary expression token {other!r}!\")\n assert_never(token_type)\n\n def __str__(self) -> str:\n return f\"({self.operator.token_type} {self.expr})\"\n\n\nclass BinaryExpression(Expression):\n def __init__(self, left: Expression, operator: Token, right: Expression):\n self.left = left\n self.operator = operator\n self.right = right\n return super().__init__()\n\n def evaluate(self) -> int:\n left = self.left.evaluate()\n right = self.right.evaluate()\n match (token_type := self.operator.token_type):\n case \"Plus\":\n return left + right\n case \"Minus\":\n return left - right\n case other:\n raise Exception(f\"Invalid binary expression token {other!r}!\")\n assert_never(token_type)\n\n def __str__(self) -> str:\n return f\"({self.operator.token_type} {self.left} {self.right})\"\n\n\nclass ParseException(Exception):\n def __init__(self, token: Token | None, message: str, *args: object):\n self.token = token\n super().__init__(message, *args)\n\n\nclass Parser:\n def __init__(self, tokens: Iterable[Token]):\n self.tokens = iter(tokens)\n self._exhausted = False\n self._peeked = None\n return super().__init__()\n\n def _match_any(self, *expected: TokenTypes):\n for exp in expected:\n if (matched := self._match(exp)) is not None:\n return matched\n return None\n\n def _match(self, expected: TokenTypes):\n if self._exhausted:\n return None\n if (token := self._peek()) is not None and token.token_type == expected:\n return self._advance()\n return None\n\n def _peek(self):\n if (peeked := self._peeked) is not None:\n return peeked\n peeked = self._advance()\n self._peeked = peeked\n return peeked\n\n def _advance(self):\n if (peeked := self._peeked) is not None:\n self._peeked = None\n return peeked\n try:\n return next(self.tokens)\n except StopIteration:\n return None\n\n def _left_assoc(self, read: Callable[[], Expression], *infix: TokenTypes):\n expr = read()\n while (matched := self._match_any(*infix)) is not None:\n right = read()\n expr = BinaryExpression(expr, matched, right)\n return expr\n\n def consume(self, expected: TokenTypes):\n if (matched := self._match(expected)) is None:\n peek = self._peek()\n gotten = \"nothing\" if peek is None else peek.token_type\n raise ParseException(peek, f\"Expected {expected}, but got {gotten}!\")\n return matched\n\n def expression(self) -> Expression:\n return self.term()\n\n def term(self):\n return self._left_assoc(self.unary, \"Plus\", \"Minus\")\n\n def unary(self) -> Expression:\n if (matched := self._match_any(\"Minus\")) is not None:\n expr = self.unary()\n return UnaryExpression(expr, matched)\n return self.primary()\n\n def primary(self):\n if self._match(\"LeftParenthesis\") is not None:\n expr = self.expression()\n self.consume(\"RightParenthesis\")\n return expr\n number = self.consume(\"Number\")\n if (literal := number.literal) is None:\n raise Exception(\"Found number token without literal!\")\n return NumberLiteral(literal)\n\n\nclass Solution:\n def calculate(self, s: str) -> int:\n lexer = Lexer(s)\n parser = Parser(lexer)\n try:\n expr = parser.expression()\n except ParseException as e:\n if (token := e.token) is not None:\n start = token.position\n end = start + len(token.lexeme)\n highlight = f\"{s[:start]} > {s[start:end]} < {s[end:]}\"\n e.add_note(f\"Error at: {highlight}\")\n raise e\n return expr.evaluate()\n","memory":"43493"},{"code":"from abc import ABC, abstractmethod\nfrom dataclasses import dataclass\nfrom typing import Callable, Iterable, Literal, TypeAlias, assert_never\n\nTokenTypes: TypeAlias = Literal[\n \"Number\", \"Plus\", \"Minus\", \"LeftParenthesis\", \"RightParenthesis\", \"EOF\"\n]\nLiteralValue: TypeAlias = int\n\n\n@dataclass\nclass Token:\n token_type: TokenTypes\n lexeme: str\n position: int\n literal: LiteralValue | None\n\n\nclass Lexer:\n def __init__(self, source: str):\n self.source = source\n self.start = 0\n self.current = 0\n return super().__init__()\n\n def exhausted(self):\n return self.current >= len(self.source)\n\n def _consume(self):\n return self.source[self._advance()]\n\n def _peek(self):\n return None if self.exhausted() else self.source[self.current]\n\n def _advance(self):\n self.current = (current := self.current) + 1\n return current\n\n def _make(\n self, token_type: TokenTypes, parse: Callable[[str], LiteralValue] | None = None\n ):\n lexeme = self._lexeme()\n literal = None if parse is None else parse(lexeme)\n return Token(token_type, lexeme, self.start, literal)\n\n def _lexeme(self):\n return self.source[self.start : self.current]\n\n def __iter__(self):\n return self\n\n def __next__(self):\n while not self.exhausted():\n if (token := self._get()) is not None:\n return token\n raise StopIteration\n\n def _get(self):\n self.start = self.current\n match (consumed := self._consume()):\n case \" \":\n return None\n case \"(\":\n return self._make(\"LeftParenthesis\")\n case \")\":\n return self._make(\"RightParenthesis\")\n case \"+\":\n return self._make(\"Plus\")\n case \"-\":\n return self._make(\"Minus\")\n case d if d.isdigit():\n while (peek := self._peek()) is not None and peek.isdigit():\n self._advance()\n return self._make(\"Number\", int)\n case other:\n raise ValueError(f\"Invalid token {other!r}!\")\n assert_never(consumed)\n\n\nclass Expression(ABC):\n @abstractmethod\n def evaluate(self) -> int: ...\n\n @abstractmethod\n def __str__(self) -> str: ...\n\n\nclass NumberLiteral(Expression):\n def __init__(self, value: int):\n self.value = value\n return super().__init__()\n\n def evaluate(self) -> int:\n return self.value\n\n def __str__(self) -> str:\n return str(self.value)\n\n\nclass UnaryExpression(Expression):\n def __init__(self, expr: Expression, operator: Token):\n self.expr = expr\n self.operator = operator\n return super().__init__()\n\n def evaluate(self) -> int:\n value = self.expr.evaluate()\n match (token_type := self.operator.token_type):\n case \"Minus\":\n return -value\n case other:\n raise Exception(f\"Invalid unary expression token {other!r}!\")\n assert_never(token_type)\n\n def __str__(self) -> str:\n return f\"({self.operator.token_type} {self.expr})\"\n\n\nclass BinaryExpression(Expression):\n def __init__(self, left: Expression, operator: Token, right: Expression):\n self.left = left\n self.operator = operator\n self.right = right\n return super().__init__()\n\n def evaluate(self) -> int:\n left = self.left.evaluate()\n right = self.right.evaluate()\n match (token_type := self.operator.token_type):\n case \"Plus\":\n return left + right\n case \"Minus\":\n return left - right\n case other:\n raise Exception(f\"Invalid binary expression token {other!r}!\")\n assert_never(token_type)\n\n def __str__(self) -> str:\n return f\"({self.operator.token_type} {self.left} {self.right})\"\n\n\nclass ParseException(Exception):\n def __init__(self, token: Token | None, message: str, *args: object):\n self.token = token\n super().__init__(message, *args)\n\n\nclass Parser:\n def __init__(self, tokens: Iterable[Token]):\n self.tokens = iter(tokens)\n self._exhausted = False\n self._peeked = None\n return super().__init__()\n\n def _match_any(self, *expected: TokenTypes):\n for exp in expected:\n if (matched := self._match(exp)) is not None:\n return matched\n return None\n\n def _match(self, expected: TokenTypes):\n if self._exhausted:\n return None\n if (token := self._peek()) is not None and token.token_type == expected:\n return self._advance()\n return None\n\n def _peek(self):\n if (peeked := self._peeked) is not None:\n return peeked\n peeked = self._advance()\n self._peeked = peeked\n return peeked\n\n def _advance(self):\n if (peeked := self._peeked) is not None:\n self._peeked = None\n return peeked\n try:\n return next(self.tokens)\n except StopIteration:\n return None\n\n def _left_assoc(self, read: Callable[[], Expression], *infix: TokenTypes):\n expr = read()\n while (matched := self._match_any(*infix)) is not None:\n right = read()\n expr = BinaryExpression(expr, matched, right)\n return expr\n\n def consume(self, expected: TokenTypes):\n if (matched := self._match(expected)) is None:\n peek = self._peek()\n gotten = \"nothing\" if peek is None else peek.token_type\n raise ParseException(peek, f\"Expected {expected}, but got {gotten}!\")\n return matched\n\n def expression(self) -> Expression:\n return self.term()\n\n def term(self):\n return self._left_assoc(self.unary, \"Plus\", \"Minus\")\n\n def unary(self) -> Expression:\n if (matched := self._match_any(\"Minus\")) is not None:\n expr = self.unary()\n return UnaryExpression(expr, matched)\n return self.primary()\n\n def primary(self):\n if self._match(\"LeftParenthesis\") is not None:\n expr = self.expression()\n self.consume(\"RightParenthesis\")\n return expr\n number = self.consume(\"Number\")\n if (literal := number.literal) is None:\n raise Exception(\"Found number token without literal!\")\n return NumberLiteral(literal)\n\n\nclass Solution:\n def calculate(self, s: str) -> int:\n lexer = Lexer(s)\n parser = Parser(lexer)\n try:\n expr = parser.expression()\n except ParseException as e:\n if (token := e.token) is not None:\n start = token.position\n end = start + len(token.lexeme)\n highlight = f\"{s[:start]} > {s[start:end]} < {s[end:]}\"\n e.add_note(f\"Error at: {highlight}\")\n raise e\n return expr.evaluate()\n\n\ndef main():\n solution = Solution()\n assert solution.calculate(\"1 + 1\") == 2\n assert solution.calculate(\" 2-1 + 2 \") == 3\n assert solution.calculate(\"(1+(4+5+2)-3)+(6+8)\") == 23\n assert solution.calculate(\"-(4+5)\") == -9\n try:\n solution.calculate(\"(1+((4+5+2)-3)+(6+8)\")\n raise Exception(\"Expected a parse exception!\")\n except ParseException as e:\n assert e.args[0] == \"Expected RightParenthesis, but got nothing!\"\n\n\nif __name__ == \"__main__\":\n main()\n","memory":"44121"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n # step 1: tokenize\n tokens = []\n i = 0\n while i < len(s):\n if s[i] == '(':\n tokens.append({\n 'token_type': 'LPAREN',\n 'lexeme': '('\n })\n i += 1\n elif s[i] == ')':\n tokens.append({\n 'token_type': 'RPAREN',\n 'lexeme': ')'\n })\n i += 1\n elif s[i] in '+-':\n tokens.append({\n 'token_type': 'OP',\n 'lexeme': s[i]\n })\n i += 1\n elif s[i].isdigit():\n number = ''\n while i < len(s) and s[i].isdigit():\n number += s[i]\n i += 1\n tokens.append({\n 'token_type': 'NUM',\n 'lexeme': int(number)\n })\n else: # space\n i += 1\n\n # step 2: parse\n pos = 0\n def parseAtom():\n nonlocal pos\n if tokens[pos]['token_type'] == 'OP' and tokens[pos]['lexeme'] == '-':\n pos += 1\n return -parseAtom()\n elif tokens[pos]['token_type'] == 'NUM':\n val = tokens[pos]['lexeme']\n pos += 1\n return val\n elif tokens[pos]['lexeme'] == '(':\n pos += 1\n res = parseExpr()\n pos += 1\n return res\n \n def parseExpr():\n nonlocal pos\n res = parseAtom()\n while pos < len(tokens) and tokens[pos]['token_type'] == 'OP':\n operator = tokens[pos]['lexeme']\n pos += 1\n if operator == '+':\n res += parseAtom()\n else:\n res -= parseAtom()\n return res\n return parseExpr()","memory":"44750"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n # step 1: tokenize\n tokens = []\n i = 0\n while i < len(s):\n if s[i] == '(':\n tokens.append({\n 'token_type': 'LPAREN',\n 'lexeme': '('\n })\n i += 1\n elif s[i] == ')':\n tokens.append({\n 'token_type': 'RPAREN',\n 'lexeme': ')'\n })\n i += 1\n elif s[i] in '+-':\n tokens.append({\n 'token_type': 'OP',\n 'lexeme': s[i]\n })\n i += 1\n elif s[i].isdigit():\n number = ''\n while i < len(s) and s[i].isdigit():\n number += s[i]\n i += 1\n tokens.append({\n 'token_type': 'NUM',\n 'lexeme': int(number)\n })\n else: # space\n i += 1\n\n # step 2: parse\n pos = 0\n def parseAtom():\n nonlocal pos\n if tokens[pos]['token_type'] == 'OP' and tokens[pos]['lexeme'] == '-':\n pos += 1\n return -parseAtom()\n elif tokens[pos]['token_type'] == 'NUM':\n val = tokens[pos]['lexeme']\n pos += 1\n return val\n elif tokens[pos]['lexeme'] == '(':\n pos += 1\n res = parseExpr()\n pos += 1\n return res\n \n def parseExpr():\n nonlocal pos\n res = parseAtom()\n while pos < len(tokens) and tokens[pos]['token_type'] == 'OP':\n operator = tokens[pos]['lexeme']\n pos += 1\n if operator == '+':\n res += parseAtom()\n else:\n res -= parseAtom()\n return res\n return parseExpr()","memory":"45379"},{"code":"import ast\nimport re\nimport sys\nsys.setrecursionlimit(100000)\n\nclass ExprNode:\n def __init__(self, child1, child2):\n self.children = [child1, child2]\n def __str__(self):\n return(\"Expression\")\n\nclass TermNode:\n def __init__(self, op, child1, child2):\n self.children = [child1, child2]\n self.op = op\n def __str__(self):\n if self.op == \"+\":\n return(\"Term PLUS\")\n else:\n return(\"Term MINUS\")\n\nclass BaseNode:\n def __init__(self, child, val=None):\n self.children = [child]\n self.val = val\n def __str__(self):\n if self.val == None:\n return(\"Parenthesis\")\n else:\n return(\"Number \" + str(self.val))\n\nclass Parser:\n def __init__(self, tokens):\n self.tokens = tokens\n self.cur = 0\n def expr(self):\n curtoken = self.tokens[self.cur]\n if curtoken.isdigit():\n self.cur += 1\n node = self.term()\n if not node:\n return BaseNode(None, int(curtoken))\n else:\n return ExprNode(BaseNode(None, int(curtoken)), node)\n else:\n b_node = self.base()\n t_node = self.term()\n return ExprNode(b_node, t_node)\n def term(self):\n if self.cur >= len(self.tokens) - 1:\n return None\n curtoken = self.tokens[self.cur]\n if curtoken in [\"+\", \"-\"]:\n self.cur += 1\n nexttoken = self.tokens[self.cur]\n if nexttoken.isdigit():\n self.cur += 1\n node = self.term()\n return TermNode(curtoken, BaseNode(None, int(nexttoken)), node)\n else:\n b_node = self.base()\n t_node = self.term()\n return TermNode(curtoken, b_node, t_node)\n else:\n return None\n\n def base(self):\n if self.tokens[self.cur] == \"(\":\n self.cur += 1\n node = self.expr()\n if self.tokens[self.cur] != \")\":\n print(\"Syntax Error: No matching right parenthesis\")\n return None\n self.cur += 1\n return BaseNode(node)\n\nclass Solution:\n def calculate(self, s: str) -> int:\n def lexer(s):\n expression = re.sub(r'\\s+', \"\", s)\n expression = re.findall(r'\\d+|[\\(\\)+-]', expression)\n formatted = []\n for e in expression:\n if e == \"-\" and (not formatted or formatted[-1] == \"(\"):\n formatted.append(\"0\")\n formatted.append(e)\n return formatted\n def print_nodes(n, lvl=0):\n if not n:\n return\n print(\" \" * lvl, end=\"\")\n print(\"|\", end=\"\")\n print(\"--\" * lvl, end=\"\")\n print(n)\n \n for c in n.children:\n print_nodes(c, lvl+1)\n \n rpn = []\n def emit_rpn(n):\n if not n:\n return\n if type(n) == TermNode:\n if n.children[0].val != None:\n rpn.append(n.children[0].val)\n rpn.append(n.op)\n else:\n emit_rpn(n.children[0])\n rpn.append(n.op)\n emit_rpn(n.children[1])\n\n elif type(n) == BaseNode:\n if n.val != None:\n rpn.append(n.val)\n else:\n emit_rpn(n.children[0])\n\n else:\n emit_rpn(n.children[0])\n emit_rpn(n.children[1])\n \n def evaluate_rpn(rpns):\n stack = []\n for token in rpns :\n if token == '+':\n a , b = stack.pop() , stack.pop()\n stack.append( a + b ) \n elif token == '-':\n a , b = stack.pop() , stack.pop()\n stack.append( b - a ) \n else:\n stack.append(token) \n return stack.pop() \n \n ps = Parser(lexer(s))\n res = ps.expr()\n emit_rpn(res)\n return evaluate_rpn(rpn)","memory":"46008"},{"code":"import ast\nimport re\nimport sys\nsys.setrecursionlimit(100000)\n\nclass ExprNode:\n def __init__(self, child1, child2):\n self.children = [child1, child2]\n def __str__(self):\n return(\"Expression\")\n\nclass TermNode:\n def __init__(self, op, child1, child2):\n self.children = [child1, child2]\n self.op = op\n def __str__(self):\n if self.op == \"+\":\n return(\"Term PLUS\")\n else:\n return(\"Term MINUS\")\n\nclass BaseNode:\n def __init__(self, child, val=None):\n self.children = [child]\n self.val = val\n def __str__(self):\n if self.val == None:\n return(\"Parenthesis\")\n else:\n return(\"Number \" + str(self.val))\n\nclass Parser:\n def __init__(self, tokens):\n self.tokens = tokens\n self.cur = 0\n def expr(self):\n curtoken = self.tokens[self.cur]\n if curtoken.isdigit():\n self.cur += 1\n node = self.term()\n if not node:\n return BaseNode(None, int(curtoken))\n else:\n return ExprNode(BaseNode(None, int(curtoken)), node)\n else:\n # left parenthesis case\n b_node = self.base()\n t_node = self.term()\n return ExprNode(b_node, t_node)\n def term(self):\n if self.cur >= len(self.tokens) - 1:\n return None\n curtoken = self.tokens[self.cur]\n if curtoken in [\"+\", \"-\"]:\n self.cur += 1\n nexttoken = self.tokens[self.cur]\n if nexttoken.isdigit():\n self.cur += 1\n node = self.term()\n return TermNode(curtoken, BaseNode(None, int(nexttoken)), node)\n else:\n b_node = self.base()\n t_node = self.term()\n return TermNode(curtoken, b_node, t_node)\n else:\n return None\n\n # parses the parenthesis case only\n def base(self):\n if self.tokens[self.cur] == \"(\":\n self.cur += 1\n node = self.expr()\n if self.tokens[self.cur] != \")\":\n print(\"Syntax Error: No matching right parenthesis\")\n return None\n self.cur += 1\n return BaseNode(node)\n\nclass Solution:\n def calculate(self, s: str) -> int:\n def lexer(s):\n expression = re.sub(r'\\s+', \"\", s)\n expression = re.findall(r'\\d+|[\\(\\)+-]', expression)\n formatted = []\n for e in expression:\n if e == \"-\" and (not formatted or formatted[-1] == \"(\"):\n formatted.append(\"0\")\n formatted.append(e)\n return formatted\n def print_nodes(n, lvl=0):\n if not n:\n return\n print(\" \" * lvl, end=\"\")\n print(\"|\", end=\"\")\n print(\"--\" * lvl, end=\"\")\n print(n)\n \n for c in n.children:\n print_nodes(c, lvl+1)\n \n rpn = []\n def emit_rpn(n):\n if not n:\n return\n if type(n) == TermNode:\n if n.children[0].val != None:\n rpn.append(n.children[0].val)\n rpn.append(n.op)\n else:\n emit_rpn(n.children[0])\n rpn.append(n.op)\n emit_rpn(n.children[1])\n\n\n elif type(n) == BaseNode:\n if n.val != None:\n rpn.append(n.val)\n else:\n emit_rpn(n.children[0])\n\n else:\n emit_rpn(n.children[0])\n emit_rpn(n.children[1])\n \n def evaluate_rpn(rpns):\n stack = []\n for token in rpns :\n if token == '+' :\n a , b = stack.pop() , stack.pop()\n stack.append( a + b ) \n elif token == '-':\n a , b = stack.pop() , stack.pop()\n stack.append( b - a ) \n else:\n stack.append(token) \n return stack.pop() \n \n ps = Parser(lexer(s))\n res = ps.expr()\n emit_rpn(res)\n return evaluate_rpn(rpn)","memory":"46636"},{"code":"from typing import Optional\n\n\nclass Number:\n def __init__(self, value):\n self.value = value\n\n def __repr__(self) -> str:\n return f\"N[{self.value}]\"\n\nclass Operator:\n def __init__(self, operator):\n self.operator = operator\n\n def __repr__(self) -> str:\n return f\"O[{self.operator}]\"\n\nclass Parenthesis:\n def __init__(self, parenthesis):\n self.parenthesis = parenthesis\n\n def __repr__(self) -> str:\n return f\"P[{self.parenthesis}]\"\n\n\nclass Node:\n def __init__(self, operator: Optional[Operator] = None):\n self.operator = operator\n self.operands = []\n\n def calculate(self):\n if self.operator is None:\n a = self.operands[0]\n return a.calculate() if isinstance(a, Node) else a\n if self.operator.operator == '+':\n a = self.operands[0]\n b = self.operands[1]\n aval = a.calculate() if isinstance(a, Node) else a\n bval = b.calculate() if isinstance(b, Node) else b\n return Number(aval.value + bval.value)\n if self.operator.operator == '-':\n a = self.operands[0]\n aval = a.calculate() if isinstance(a, Node) else a\n if len(self.operands) == 1:\n return Number(-aval.value)\n b = self.operands[1]\n bval = b.calculate() if isinstance(b, Node) else b\n return Number(aval.value - bval.value)\n return None\n\n def __repr__(self):\n return f\"Node[{self.operator} {self.operands}]\"\n\n\ndef buildAST(tokens, pos, left_operand=None):\n node = Node()\n if left_operand:\n node.operands.append(left_operand)\n if pos >= len(tokens):\n return node, pos\n token = tokens[pos]\n pos += 1\n if isinstance(token, Parenthesis) and token.parenthesis == ')':\n return left_operand, pos\n if isinstance(token, Parenthesis) and token.parenthesis == '(':\n operand, pos = buildAST(tokens, pos)\n node.operands.append(operand)\n elif isinstance(token, Number):\n node.operands.append(token)\n elif isinstance(token, Operator):\n node.operator = token\n\n if pos >= len(tokens):\n return node, pos\n\n if node.operator is None and isinstance(tokens[pos], Operator):\n node.operator = tokens[pos]\n pos += 1\n\n token = tokens[pos]\n pos += 1\n\n if isinstance(token, Parenthesis) and token.parenthesis == ')':\n return node, pos\n if isinstance(token, Parenthesis) and token.parenthesis == '(':\n operand, pos = buildAST(tokens, pos)\n node.operands.append(operand)\n elif isinstance(token, Number):\n node.operands.append(token)\n\n if pos < len(tokens):\n return buildAST(tokens, pos, node)\n\n return node, pos\n\n\ndef parse_tokens(expr: str):\n number = None\n tokens = []\n\n for c in expr:\n if c == ' ':\n continue\n if ord(c) >= ord('0') and ord(c) <= ord('9'):\n number = number * 10 + int(c) if number is not None else int(c)\n continue\n if number is not None:\n tokens.append(Number(number))\n number = None\n if c in ('(', ')'):\n tokens.append(Parenthesis(c))\n continue\n if c in ('+', '-'):\n tokens.append(Operator(c))\n continue\n if number is not None:\n tokens.append(Number(number))\n\n return tokens\n\n\nclass Solution:\n def calculate(self, s: str) -> int:\n tokens = parse_tokens(s)\n node, _ = buildAST(tokens, 0)\n return node.calculate().value\n ","memory":"47265"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n sum = 0\n index = 0\n subtract = False\n\n while index < len(s):\n if s[index] == \"(\":\n num_brackets = 1\n end = index\n while end < len(s) and num_brackets != 0:\n end += 1\n if s[end] == \"(\":\n num_brackets += 1\n elif s[end] == \")\":\n num_brackets -= 1\n sub_sum = self.calculate(s[index+1:end])\n if subtract and sub_sum < 0:\n sum += (-sub_sum)\n elif subtract and sub_sum >= 0:\n sum -= sub_sum\n else:\n sum += sub_sum\n if end-1 != index:\n index = end-1\n\n elif s[index] == \"-\":\n subtract = True\n\n elif s[index] == \"+\":\n subtract = False\n\n elif s[index].isdigit():\n end = index\n while end < len(s) and s[end].isdigit():\n end += 1\n if subtract:\n sum -= int(s[index:end])\n else:\n sum += int(s[index:end])\n if end-1 != index:\n index = end-1\n index += 1\n\n return sum\n","memory":"47894"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n\n def addSgn(sym, stack):\n if sym == '+':\n val = stack.pop()\n val += stack.pop()\n stack += [val]\n # stack += ['+']\n elif sym == '-':\n if len(stack) >= 2:\n val = stack.pop()\n val2 = stack.pop() - val\n stack += [val2]\n # stack += ['-']\n else:\n stack[-1] = -stack[-1]\n # stack += ['!']\n\n\n def createPoliz(s):\n stack = []\n sgn = ''\n flag = False\n j = 0\n for i, sym in enumerate(s):\n if i < j:\n continue\n\n if sym == ' ':\n continue\n\n if sym == '(':\n brcnt = 1\n j = i + 1\n while brcnt != 0:\n if s[j] == '(':\n brcnt += 1\n if s[j] == ')':\n brcnt -= 1\n j += 1\n else:\n j -= 1\n l = len(stack)\n stack += createPoliz(s[i+1:j])\n if l == 0 and sgn == '-':\n stack[-1] = -stack[-1]\n # stack += ['!']\n elif sgn != '':\n addSgn(sgn, stack)\n sgn = ''\n\n if (sym >= '0' and sym <= '9'):\n if (i+1 < len(s) and s[i+1] >= '0' and s[i+1] <= '9'):\n num = sym\n j = i + 1\n while (j < len(s) and s[j] >= '0' and s[j] <= '9'):\n num += s[j]\n j += 1\n sym = num\n\n stack += [int(sym)]\n if sgn != '':\n addSgn(sgn, stack)\n sgn = ''\n elif sym == '-' or sym == '+':\n sgn = sym\n \n return stack\n \n\n # def calculatePoliz(stack):\n # nums = []\n # while (len(stack) != 0):\n # sym = stack.pop(0)\n\n # if (type(sym) == type(1)):\n # nums += [sym]\n\n # elif sym == '-':\n # val = nums.pop()\n # val2 = nums.pop() - val\n # nums += [val2]\n\n # elif sym == '+':\n # val = nums.pop()\n # val += nums.pop()\n # nums += [val]\n\n # elif sym == '!':\n # val = nums.pop()\n # val = -val\n # nums += [val]\n \n # return nums[0]\n\n return createPoliz(s)[0]\n\n ","memory":"48523"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n ret = 0\n\n openBracketCount = 0\n openBracketIdx = -1\n currOperand = \"\"\n for i in range(len(s)):\n if s[i] == \" \":\n continue\n if s[i] == \"(\":\n openBracketCount += 1\n if openBracketCount == 1:\n openBracketIdx = i\n continue\n if s[i] == \")\":\n openBracketCount -= 1\n if openBracketCount == 0:\n ret += self.calculate(s[openBracketIdx + 1: i]) if currOperand == \"\" else self.calculate(s[openBracketIdx + 1: i]) * -1\n currOperand = \"\"\n continue\n if openBracketCount > 0:\n continue\n if s[i].isnumeric():\n currOperand += s[i]\n continue\n if currOperand:\n ret += int(currOperand)\n currOperand = \"\" if s[i] == \"+\" else \"-\"\n if currOperand:\n ret += int(currOperand) \n return ret\n\n \n \n \n\n\n \n\n ","memory":"49151"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n if not s:\n return 0\n res, curr, index = 0, 0, 0\n operator = '+'\n while index < len(s):\n if s[index].isdigit():\n curr = curr * 10 + int(s[index])\n if s[index] == '(':\n startIndex = index\n bracket_num = 1\n while bracket_num > 0:\n index += 1\n if s[index] == '(':\n bracket_num += 1\n elif s[index] == ')':\n bracket_num -= 1\n curr = self.calculate(s[startIndex + 1 : index])\n if s[index] in '+-' or index == len(s) - 1:\n if operator == '+':\n res += curr\n elif operator == '-':\n res -= curr\n operator = s[index]\n curr = 0\n index += 1\n return res","memory":"49780"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n if not s:\n return 0\n res, curr, index = 0, 0, 0\n operator = '+'\n while index < len(s):\n char = s[index]\n if char.isdigit():\n curr = curr * 10 + int(char)\n if char == '(':\n startIndex = index\n bracketNum = 1\n while bracketNum != 0:\n index += 1\n if s[index] == '(':\n bracketNum += 1\n elif s[index] == ')':\n bracketNum -= 1\n curr = self.calculate(s[startIndex + 1 : index])\n if char in '+-' or index == len(s) - 1:\n if operator == '+':\n res += curr\n elif operator == '-':\n res -= curr\n operator = char\n curr = 0\n index += 1\n return res","memory":"49780"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n ans = 0\n\n def str2int(num_str: str):\n return 0 if num_str == \"\" else int(num_str)\n \n sign = +1\n idx = 0\n num_str = \"\"\n while idx < len(s):\n char = s[idx]\n if char == \" \":\n idx += 1\n continue\n elif char == '-':\n ans += sign * str2int(num_str)\n num_str = \"\"\n sign = -1\n elif char == \"+\":\n ans += sign * str2int(num_str)\n num_str = \"\"\n sign = +1\n elif char == \"(\":\n counter = 1\n close_idx = idx\n while (counter > 0):\n close_idx += 1\n if s[close_idx] == \")\":\n counter -= 1\n elif s[close_idx] == \"(\":\n counter += 1\n \n ans += sign * self.calculate(s[idx + 1:close_idx])\n idx = close_idx\n else:\n num_str = num_str + char\n idx += 1\n \n ans += sign * str2int(num_str)\n \n return ans","memory":"50409"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n sign = 1\n total = 0\n currNum = 0\n i = 0\n while i < len(s):\n ch = s[i]\n if ch == '(':\n pr = 1\n start_idx = i\n while pr > 0:\n i += 1\n if s[i] == '(':\n pr += 1\n elif s[i] == ')':\n pr -= 1\n total += sign * self.calculate(s[start_idx+1:i])\n elif ch == '-':\n total += sign * currNum\n sign = -1\n currNum = 0\n elif ch == '+':\n total += sign * currNum\n sign = 1\n currNum = 0\n elif ch == ' ':\n pass\n else:\n currNum = currNum * 10 + int(ch)\n i += 1\n total += sign * currNum\n return total\n\n ","memory":"50409"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n res = 0\n num = 0\n sign = 1\n i = 0\n n = len(s)\n \n while i < n:\n char = s[i]\n if char.isnumeric():\n num = num * 10 + int(char)\n elif char in ['+', '-']:\n res += num * sign\n sign = 1 if char == '+' else -1\n num = 0\n elif char == '(':\n j = i\n balance = 0\n while i < n:\n if s[i] == '(':\n balance += 1\n if s[i] == ')':\n balance -= 1\n if balance == 0:\n break\n i += 1\n num = self.calculate(s[j + 1:i])\n i += 1\n \n return res + num * sign\n","memory":"51038"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n ans = 0\n\n s = s.replace(\" \", \"\")\n\n def str2int(num_str: str):\n return 0 if num_str == \"\" else int(num_str)\n \n sign = +1\n idx = 0\n num_str = \"\"\n while idx < len(s):\n char = s[idx]\n if char == '-':\n ans += sign * str2int(num_str)\n num_str = \"\"\n sign = -1\n elif char == \"+\":\n ans += sign * str2int(num_str)\n num_str = \"\"\n sign = +1\n elif char == \"(\":\n counter = 1\n close_idx = idx\n while (counter > 0):\n close_idx += 1\n if s[close_idx] == \")\":\n counter -= 1\n elif s[close_idx] == \"(\":\n counter += 1\n \n ans += sign * self.calculate(s[idx + 1:close_idx])\n idx = close_idx\n else:\n num_str = num_str + char\n idx += 1\n \n ans += sign * str2int(num_str)\n \n return ans","memory":"51666"},{"code":"class Solution:\n\n def calculate(self, s: str) -> int:\n res = 0\n def add(x):\n nonlocal res\n res += x\n def sub(x):\n nonlocal res\n res -= x\n\n i = 0\n action = add\n parsing_int = False\n int_state = 0\n while i < len(s):\n ch = s[i]\n\n if parsing_int and not (ord('0') <= ord(ch) <= ord('9')):\n action(int_state)\n parsing_int = False\n int_state = 0\n\n if ord('0') <= ord(ch) <= ord('9'):\n parsing_int = True\n int_state *= 10\n int_state += int(ch)\n elif s[i] == \"+\":\n action = add\n elif s[i] == \"-\":\n action = sub\n elif s[i] == \"(\":\n pairs = 1\n i += 1\n begin = i\n while pairs > 0:\n if s[i] == \"(\":\n pairs += 1\n if s[i] == \")\":\n pairs -= 1\n if pairs > 0:\n i += 1\n action(self.calculate(s[begin:i]))\n i += 1\n if parsing_int:\n action(int_state)\n return res\n ","memory":"51666"},{"code":"class Solution:\n def calculate(self, s: str) -> int:\n re = 0\n\n i = 0\n sign = 1\n\n nums = set(['1','2','3','4','5','6','7','8','9','0'])\n\n while i < len(s):\n if s[i] == \" \" or s[i] == \"+\":\n i += 1 \n elif s[i] == \"(\":\n i += 1\n cur = i\n stack = 1\n while stack > 0:\n if s[cur] == \"(\":\n stack += 1\n if s[cur] == \")\":\n stack -= 1\n cur += 1\n re += sign * self.calculate(s[i:cur-1])\n sign = 1\n i = cur \n elif s[i] == \"-\":\n sign = -1\n i += 1\n else:\n cur = i\n while cur < len(s) and s[cur] in nums:\n cur += 1\n re += sign * int(s[i:cur])\n sign = 1\n i = cur\n return re\n\n","memory":"52295"}],"string":"[\n {\n \"code\": \"parenthesis = {\\\"(\\\", \\\")\\\"}\\noperators = {\\\"+\\\", \\\"-\\\"}\\nnon_digits = parenthesis.union(operators)\\n\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n s_without_spaces = self.remove_spaces(s)\\n stack = []\\n\\n for char in s_without_spaces:\\n if char != \\\")\\\":\\n stack.append(char)\\n continue\\n\\n result = 0\\n\\n while stack[-1] != \\\"(\\\":\\n number = self.pop_number(stack)\\n result = self.perform_operation(result, number, \\\"+\\\")\\n\\n stack.pop()\\n\\n for digit in str(result):\\n stack.append(digit)\\n\\n return self.evaluate_simple_expr(stack)\\n\\n def evaluate_simple_expr(self, stack):\\n result = 0\\n\\n while len(stack) > 0:\\n number = self.pop_number(stack)\\n result = self.perform_operation(result, number, \\\"+\\\")\\n\\n return result\\n\\n def pop_number(self, stack):\\n reversed_number = \\\"\\\"\\n\\n while (len(stack) > 0) and (stack[-1] not in non_digits):\\n reversed_number += stack.pop()\\n\\n number = int(self.reverse_str(reversed_number))\\n\\n while len(stack) > 0 and (stack[-1] in operators):\\n operation = stack.pop()\\n number = self.perform_operation(0, number, operation)\\n\\n return number\\n\\n def perform_operation(self, x, y, operation):\\n if operation == \\\"+\\\":\\n return x + y\\n\\n return x - y\\n\\n def reverse_str(self, s):\\n n = len(s)\\n reversed_str = \\\"\\\"\\n\\n for i in range(n):\\n reversed_str += s[n - 1 - i]\\n\\n return reversed_str\\n\\n def remove_spaces(self, s):\\n s_without_spaces = \\\"\\\"\\n\\n for char in s:\\n if char != \\\" \\\":\\n s_without_spaces += char\\n\\n return s_without_spaces\",\n \"memory\": \"17714\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n res, cur = 0, 0\\n sign = 1\\n stack = []\\n for c in s:\\n if c.isdigit():\\n cur = cur * 10 + int(c)\\n elif c in [\\\"+\\\", \\\"-\\\"]:\\n res += sign * cur\\n sign = 1 if c == \\\"+\\\" else -1\\n cur = 0\\n elif c == \\\"(\\\":\\n stack.append((res, sign))\\n sign, res = 1, 0\\n elif c == \\\")\\\":\\n res += sign * cur\\n curRes, curSign = stack.pop()\\n res *= curSign\\n res += curRes\\n cur = 0\\n \\n return res + sign * cur\",\n \"memory\": \"17714\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s):\\n def evaluate(i):\\n res, digit, sign = 0, 0, 1\\n \\n while i < len(s):\\n if s[i].isdigit():\\n digit = digit * 10 + int(s[i])\\n elif s[i] in '+-':\\n res += digit * sign\\n digit = 0\\n sign = 1 if s[i] == '+' else -1\\n elif s[i] == '(':\\n subres, i = evaluate(i+1)\\n res += sign * subres\\n elif s[i] == ')':\\n res += digit * sign\\n return res, i\\n i += 1\\n\\n return res + digit * sign\\n \\n return evaluate(0)\",\n \"memory\": \"18343\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n i, n = 0, len(s)\\n ans, op = 0, '+'\\n stack = deque()\\n # (1+(4+5+2)-3)+(6+8)\\n while i < n:\\n if s[i] == ')':\\n operand = 0\\n exp = 0\\n element = ')'\\n while stack:\\n element = stack.pop()\\n if element == '(':\\n break\\n if element == '+':\\n exp += operand\\n operand = '#'\\n elif element == '-':\\n exp -= operand\\n operand = '#'\\n else:\\n operand = element\\n if operand != '#':\\n exp += operand\\n stack.append(exp)\\n if s[i] in '0123456789': # 6\\n num = int(s[i]) # 6\\n i += 1\\n while i < n and s[i] in '0123456789':\\n num *= 10\\n num += int(s[i])\\n i += 1\\n i -= 1\\n stack.append(num)\\n if i < n and s[i] in '+-(':\\n stack.append(s[i])\\n i += 1 # 8\\n \\n operand = 0\\n while stack:\\n element = stack.pop()\\n if element == '+':\\n ans += operand\\n operand = '#'\\n elif element == '-':\\n ans -= operand\\n operand = '#'\\n elif element == ' ':\\n pass\\n else:\\n operand = element\\n if operand != '#':\\n ans += operand\\n return ans\",\n \"memory\": \"18343\"\n },\n {\n \"code\": \"class Solution:\\n # n = iter(range(0, 10))\\n def calculate(self, s: str) -> int:\\n return self.recur(s.replace(' ', ''), 0)[1]\\n\\n def recur(self, s: str, index: int):\\n # n = next(self.n)\\n stack = []\\n continuous_number = False\\n negative_state = False\\n while index < len(s):\\n symbol = s[index]\\n if symbol.isdigit():\\n if continuous_number:\\n stack[-1] += symbol\\n else:\\n stack.append(symbol)\\n continuous_number = True\\n else:\\n if symbol == '-':\\n if s[index + 1].isdigit():\\n stack.append('-' + s[index + 1])\\n index += 1\\n continuous_number = True\\n else:\\n negative_state = not negative_state\\n continuous_number = False\\n elif symbol == '(':\\n index, res = self.recur(s, index + 1)\\n stack.append(res * (-(2 * negative_state - 1)))\\n negative_state = False\\n continuous_number = False\\n elif symbol == ')':\\n # print(sum(list(map(int, stack))))\\n return index, sum(list(map(int, stack)))\\n else:\\n continuous_number = False\\n index += 1\\n # print(n, stack)\\n\\n return index, sum(map(int, stack))\\n\\n\\n# print(Solution().calculate(\\\"2-4-(8+2-6+(8+4-(1)+8-10))\\\"))\\n# # print('\\\\')\\n# print(Solution().calculate(\\\"(1+(4+5+2)-3)+(6+8)\\\")[1])\\n# (exec(\\\"print((1+(4+5+2)-3)+(6+8))\\\"))\\n# print(Solution().calculate(\\\"2-1 - 2\\\"))[1]\\n\",\n \"memory\": \"18971\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n s = '(' + s + ')'\\n p_stk = [0]\\n stk = []\\n num = 0\\n num_used = False\\n for c in s:\\n if c.isdigit():\\n num *= 10\\n num += int(c)\\n num_used = True\\n else:\\n if num_used:\\n stk.append(num)\\n num = 0\\n num_used = False\\n if c == '(':\\n p_stk.append(len(stk))\\n stk.append('(')\\n elif c == '+':\\n stk.append(c)\\n elif c == '-':\\n if not stk or type(stk[-1]) != int:\\n stk.append(0)\\n stk.append(c)\\n elif c == ')':\\n st = p_stk[-1] + 1\\n comp = stk[st]\\n for i in range(st + 1,len(stk),2):\\n if stk[i] == '+':\\n comp += stk[i+1]\\n else:\\n comp -= stk[i+1]\\n stk = stk[:st-1]\\n stk.append(comp)\\n p_stk.pop()\\n return stk[0]\\n \\n\\n \\n\",\n \"memory\": \"18971\"\n },\n {\n \"code\": \"from collections import deque\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n queue = deque([])\\n n = ''\\n symbols = '+-()'\\n for item in list(s):\\n if item in symbols:\\n if n:\\n queue.append(int(n))\\n n = ''\\n queue.append(item)\\n elif item == ' ':\\n continue\\n else:\\n n+=item\\n if item == ')':\\n queue.pop()\\n temp_num = []\\n temp_symbol = []\\n while queue[-1] != '(':\\n if type(queue[-1])!=int:\\n temp_symbol.append(queue.pop())\\n else:\\n temp_num.append(queue.pop())\\n queue.pop()\\n if len(temp_num) > len(temp_symbol):\\n cur = temp_num.pop()\\n else:\\n cur = 0\\n while temp_symbol:\\n operation = temp_symbol.pop()\\n if operation == '+':\\n cur += temp_num.pop()\\n else:\\n cur -= temp_num.pop()\\n queue.append(cur)\\n if n:\\n queue.append(int(n))\\n n = ''\\n if len(queue) == 1:\\n return queue[0]\\n elif queue:\\n temp_num = []\\n temp_symbol = []\\n while queue:\\n if type(queue[-1])!=int:\\n temp_symbol.append(queue.pop())\\n else:\\n temp_num.append(queue.pop())\\n if len(temp_num) > len(temp_symbol):\\n cur = temp_num.pop()\\n else:\\n cur = 0\\n while temp_symbol:\\n operation = temp_symbol.pop()\\n if operation == '+':\\n cur += temp_num.pop()\\n else:\\n cur -= temp_num.pop()\\n return cur\\n\\n\\n \\n\\n \",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"class Solution:\\n \\n def recurse(self, tokens, idx):\\n sign = 1\\n result = 0\\n while idx < len(tokens):\\n if tokens[idx].isdigit():\\n result += sign * int(tokens[idx])\\n idx+=1\\n elif tokens[idx] == '+':\\n sign = 1\\n idx+=1\\n elif tokens[idx] == '-':\\n sign = -1\\n idx+=1\\n elif tokens[idx] == '(':\\n internal_sum, next_idx = self.recurse(tokens, idx + 1)\\n result += sign * internal_sum\\n idx = next_idx\\n elif tokens[idx] == ')':\\n return result, idx + 1 \\n return result, -1\\n \\n def calculate(self, s: str) -> int:\\n tokens = re.findall('\\\\d+|\\\\+|\\\\-|\\\\(|\\\\)', s)\\n return self.recurse(tokens, 0)[0] \\n\",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n \\n # O(n) stack\\n stack = []\\n\\n # store the current number\\n num = 0\\n\\n # store the sign value to multiply the number by \\n sign = 1\\n output = 0\\n\\n # we want to remove all whitespaces\\n elems = [char for char in s if char != \\\" \\\"]\\n elems.append(\\\"+\\\")\\n\\n\\n for elem in elems:\\n\\n # process if the current elem is a digit\\n if elem.isdigit():\\n # multiply the current num by 10 and add this num\\n # for consecutive digits\\n num = num * 10 + int(elem)\\n\\n # process signs\\n if elem in \\\"+-\\\":\\n # move our current num to the output\\n output += num*sign\\n # set our sign to negative if this sign is negative\\n sign = -1 if elem == \\\"-\\\" else 1\\n # reset our number to 0\\n num = 0\\n \\n # use num, res, and sign to calculate sum of numbers within the parentheses\\n elif elem == \\\"(\\\":\\n # move output and sign to stack\\n stack.append(output)\\n stack.append(sign)\\n # reset output and sign\\n output = 0\\n sign = 1\\n\\n\\n elif elem == \\\")\\\":\\n # calculate sum for num first\\n output += sign * num\\n # then pop items from stack\\n # pop the sign to multiply with the output\\n output *=stack.pop()\\n # pop the integer to add to the rest of the output\\n output +=stack.pop()\\n\\n # reset our number to 0\\n num = 0\\n \\n return output\",\n \"memory\": \"20229\"\n },\n {\n \"code\": \"nums = set(map(chr, range(ord('0'), ord('9') + 1)))\\ndef calc_func(c: str):\\n if c == '+':\\n return lambda a, b: a + b\\n elif c == '-':\\n return lambda a, b: a - b\\n else:\\n raise Exception(\\\"bozo\\\")\\n\\ndef get_num(s: str) -> (int, int):\\n # takewhile isnum s\\n i = 0\\n c = ''\\n while i < len(s) and s[i] in nums:\\n c += s[i]\\n i += 1\\n return int(c), len(c)\\n \\nclass Solution:\\n def calculate(self, s: str) -> int:\\n print(nums)\\n return self._calculate(''.join([c for c in s if c != ' ']))\\n def _calculate(self, s: str) -> int:\\n i = 0\\n stack = [(0, 1)]\\n while i < len(s):\\n if s[i] == '-':\\n if s[i+1] in nums:\\n # negative number\\n n, num_taken = get_num(s[i+1:])\\n stack[-1] = stack[-1][0] - n, stack[-1][1]\\n i += num_taken + 1\\n elif s[i+1] == '(':\\n stack.append((0, -1))\\n i += 2\\n else:\\n raise Exception(\\\"formatting error\\\")\\n elif s[i] in nums:\\n n, num_taken = get_num(s[i:])\\n stack[-1] = stack[-1][0] + n, stack[-1][1]\\n i += num_taken\\n elif s[i] == '(':\\n stack.append((0, 1))\\n i += 1\\n elif s[i] == ')':\\n v = stack.pop(-1)\\n if len(stack) == 0:\\n return v[0] * v[1]\\n else:\\n stack[-1] = stack[-1][0] + v[0] * v[1], stack[-1][1]\\n i += 1\\n else:\\n i += 1\\n if len(stack) > 1:\\n raise Exception(\\\"bruh\\\")\\n return stack[0][0] * stack[0][1]\\n\",\n \"memory\": \"20229\"\n },\n {\n \"code\": \"class Solution:\\n \\n def recurse(self, tokens, idx):\\n sign = 1\\n result = 0\\n j = idx\\n while j < len(tokens):\\n if tokens[j].isdigit():\\n result += sign * int(tokens[j])\\n j+=1\\n elif tokens[j] == '+':\\n sign = 1\\n j+=1\\n elif tokens[j] == '-':\\n sign = -1\\n j+=1\\n elif tokens[j] == '(':\\n internal_sum, next_idx = self.recurse(tokens, j + 1)\\n result += sign * internal_sum\\n j = next_idx\\n elif tokens[j] == ')':\\n return result, j + 1 \\n return result, -1\\n \\n def calculate(self, s: str) -> int:\\n tokens = re.findall('\\\\d+|\\\\+|\\\\-|\\\\(|\\\\)', s)\\n return self.recurse(tokens, 0)[0] \\n\",\n \"memory\": \"20858\"\n },\n {\n \"code\": \"class Calculator:\\n def __init__(self, tokens):\\n self.tokens = tokens\\n self.i = 0\\n\\n def evaluate(self):\\n return self.evaluate_term()\\n\\n def evaluate_term(self):\\n result = self.evaluate_unary()\\n while self.i < len(self.tokens) and self.tokens[self.i] in \\\"+-\\\":\\n operator = self.tokens[self.i]\\n self.i += 1\\n right_result = self.evaluate_unary()\\n if operator == \\\"+\\\":\\n result += right_result\\n else:\\n result -= right_result\\n return result\\n\\n def evaluate_unary(self):\\n if self.tokens[self.i] == \\\"-\\\":\\n operator = self.tokens[self.i]\\n self.i += 1\\n return -self.evaluate_unary()\\n return self.evaluate_primary()\\n\\n def evaluate_primary(self):\\n if self.tokens[self.i] == \\\"(\\\":\\n self.i += 1\\n result = self.evaluate()\\n self.i += 1\\n return result\\n result = int(self.tokens[self.i])\\n self.i += 1\\n return result\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n tokens = self.tokenize(s)\\n return Calculator(tokens).evaluate()\\n\\n def tokenize(self, s):\\n i = 0\\n expected_tokens = \\\"+-()\\\"\\n tokens = []\\n while i < len(s):\\n if s[i].isdigit():\\n start = i\\n while i < len(s) and s[i].isdigit():\\n i += 1\\n tokens.append(s[start:i])\\n elif s[i] in expected_tokens:\\n tokens.append(s[i])\\n i += 1\\n else:\\n i += 1\\n\\n return tokens\\n\\n\\n \",\n \"memory\": \"20858\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n def priority(op):\\n if op in ['+', '-']:\\n return 1\\n elif op in ['*', '/']:\\n return 2\\n else:\\n return 0\\n \\n def toPostfix(infix):\\n stack = ['']\\n postfix = []\\n i = 0\\n prev_token = ''\\n while i<len(infix):\\n c = infix[i]\\n if c.isdigit():\\n num = ''\\n while i<len(infix) and infix[i].isdigit():\\n num+=infix[i]\\n i+=1\\n postfix.append(num)\\n prev_token = 'number'\\n continue\\n\\n elif c == '(':\\n stack.append(c)\\n prev_token = '('\\n elif c in \\\"+-*/\\\":\\n if c == '-' and (prev_token == '' or prev_token == \\\"(\\\" ):\\n postfix.append('0') # 为一元负号添加一个0\\n else:\\n while priority(stack[-1]) >= priority(c):\\n postfix.append(stack.pop())\\n stack.append(c)\\n prev_token = 'operator'\\n elif c == ')':\\n while stack[-1] != '(' and stack[-1] != '':\\n postfix.append(stack.pop())\\n stack.pop()\\n prev_token = ')'\\n \\n i+=1\\n while stack[-1] != '':\\n postfix.append(stack.pop())\\n print(postfix)\\n return postfix\\n \\n def calPostfix(s):\\n buffer = []\\n for c in s:\\n if c.isdigit():\\n buffer.append(int(c))\\n elif c=='+':\\n res = buffer.pop()+buffer.pop()\\n buffer.append(res)\\n elif c=='*':\\n res = buffer.pop()*buffer.pop()\\n buffer.append(res)\\n elif c=='-':\\n num1 = buffer.pop()\\n num2 = buffer.pop()\\n buffer.append(num2-num1)\\n elif c=='/':\\n num1 = buffer.pop()\\n num2 = buffer.pop()\\n buffer.append(num2//num1)\\n return buffer[0]\\n \\n return calPostfix(toPostfix(s.strip()))\",\n \"memory\": \"21486\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(\\\" \\\", \\\"\\\")\\n last_digit = \\\"\\\"\\n all_elements = list()\\n for element in s:\\n if element in ['+', '-', '(', ')']:\\n if last_digit != \\\"\\\":\\n all_elements.append(last_digit)\\n last_digit = \\\"\\\"\\n all_elements.append(element)\\n else:\\n last_digit += element\\n if last_digit != \\\"\\\":\\n all_elements.append(last_digit)\\n print(all_elements)\\n\\n stack = list()\\n for element in all_elements:\\n if element == ')':\\n reversed_list = list()\\n while True:\\n reversed_list.append(stack.pop())\\n if reversed_list[-1] == '(':\\n break\\n used_list = reversed_list[:-1][::-1]\\n operators = [\\\"\\\"]\\n for item in used_list:\\n if item in [\\\"+\\\", \\\"-\\\"]:\\n if operators == [\\\"\\\"]:\\n operators[-1] = 0\\n else:\\n operators[-1] = int(operators[-1])\\n operators.append(item)\\n operators.append(\\\"\\\")\\n elif type(item) == int:\\n # precomputed val\\n operators[-1] = item\\n else:\\n operators[-1] += item\\n operators[-1] = int(operators[-1])\\n val = operators[0]\\n i = 1\\n while i < len(operators):\\n if operators[i] == \\\"+\\\":\\n val += operators[i+1]\\n i += 2\\n elif operators[i] == \\\"-\\\":\\n val -= operators[i+1]\\n i += 2\\n else:\\n i += 1\\n stack.append(val)\\n else:\\n stack.append(element)\\n operators = [\\\"\\\"]\\n for element in stack:\\n if element in [\\\"+\\\", \\\"-\\\"]:\\n if operators == [\\\"\\\"]:\\n operators[-1] = 0\\n else:\\n operators[-1] = int(operators[-1])\\n operators.append(element)\\n operators.append(\\\"\\\")\\n elif type(element) == int:\\n operators[-1] = element\\n else:\\n operators[-1] += element\\n index = 1\\n vals = int(operators[0])\\n while index<len(operators):\\n if operators[index] == '+':\\n vals += int(operators[index+1])\\n index += 2\\n elif operators[index] == '-':\\n vals -= int(operators[index+1])\\n index += 2\\n else:\\n index += 1\\n\\n return vals\\n\\n \",\n \"memory\": \"21486\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n s = ('( '\\n + s.replace(\\\" \\\", \\\"\\\") \\\\\\n .replace('-', ' - ') \\\\\\n .replace('+', ' + ') \\\\\\n .replace(')', ' ) ') \\\\\\n .replace('(', ' ( ') \\n + ' )').split()\\n\\n stack = [0]\\n\\n for c in s[::-1]:\\n if c==')':\\n stack.append(')')\\n\\n elif c=='(':\\n current = 0\\n while stack and (x:=stack.pop())!=')':\\n current += x\\n stack.append(current)\\n elif c == '-':\\n stack[-1] *= -1\\n elif c.isnumeric():\\n stack.append(int(c))\\n\\n \\n return sum(stack)\\n\\n \\n\",\n \"memory\": \"22115\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n def parseOps(s):\\n ops = []\\n num = \\\"\\\"\\n for i, c in enumerate(s):\\n if c.isdigit():\\n num += c\\n elif c in (\\\"+\\\", \\\"-\\\", \\\"*\\\", \\\"/\\\", \\\"(\\\", \\\")\\\"):\\n # isMinus = False\\n # if c == '-':\\n # for j in range(i-1, -2, -1):\\n # if j == -1:\\n # isMinus = True\\n # elif s[j].isdigit() or s[j] == \\\")\\\":\\n # break\\n # elif s[j] in (\\\"+\\\", \\\"-\\\", \\\"*\\\", \\\"/\\\", \\\"(\\\"):\\n # isMinus = True\\n # if isMinus:\\n # num = \\\"-\\\" + num\\n # if not isMinus:\\n if num != \\\"\\\":\\n ops.append(num)\\n num = \\\"\\\"\\n ops.append(c) \\n elif c == \\\" \\\":\\n if num != \\\"\\\":\\n ops.append(num)\\n num = \\\"\\\"\\n if num != \\\"\\\":\\n ops.append(num)\\n ops_new = []\\n \\n for i, op in enumerate(ops):\\n # print(i, op)\\n if op == '-' and (i == 0 or not(ops[i-1].isdigit() or len(ops[i-1]) > 1 or ops[i-1] == ')')):\\n # print(\\\"go heer\\\")\\n ops_new.append(\\\"0\\\")\\n ops_new.append(\\\"-\\\")\\n else:\\n ops_new.append(op)\\n\\n return ops_new\\n def priority(op):\\n if op in (\\\"+\\\", '-'):\\n return 1\\n if op in (\\\"*\\\", '/'):\\n return 2\\n if op in (\\\")\\\"):\\n return 3\\n if op in (\\\"(\\\"):\\n return 0\\n def toPreString(s):\\n ops = parseOps(s)\\n # print(ops)\\n numstack = []\\n opstack = []\\n ops_new = []\\n for op in ops:\\n # print(\\\"\\\\ncurrent op:\\\", op)\\n # print(\\\"numstack:\\\", numstack)\\n # print(\\\"opstack:\\\" ,opstack)\\n # print(\\\"ops_new:\\\", ops_new)\\n if op.isdigit() or len(op) > 1:\\n numstack.append(op)\\n elif op == \\\"(\\\":\\n opstack.append(op)\\n elif op == \\\")\\\":\\n tmpstack = []\\n while len(opstack)>0 and opstack[-1] != '(':\\n tmpstack.append(opstack.pop())\\n tmpstack.append(numstack.pop())\\n assert opstack.pop() == '('\\n tmpstack.append(numstack.pop())\\n numstack.append(' '.join(tmpstack[::-1]))\\n # ops_new += tmpstack[::-1]\\n else:\\n tmpstack = []\\n while len(opstack)>0 and priority(op) < priority(opstack[-1]):\\n tmpstack.append(numstack.pop())\\n tmpstack.append(numstack.pop())\\n tmpstack.append(opstack.pop())\\n if len(tmpstack) > 0:\\n numstack.append(' '.join(tmpstack[::-1]))\\n opstack.append(op)\\n \\n # print(\\\"\\\\nnumstack:\\\", numstack)\\n # print(\\\"opstack:\\\" ,opstack)\\n # print(\\\"ops_new:\\\", ops_new)\\n if len(opstack) > 0:\\n tmpstack = []\\n while len(opstack)>0:\\n tmpstack.append(opstack.pop())\\n tmpstack.append(numstack.pop())\\n tmpstack.append(numstack.pop())\\n numstack.append(' '.join(tmpstack[::-1]))\\n ret = numstack.pop()\\n assert len(numstack) == len(opstack) == 0, \\\"numstack: %r, opstack: %r\\\" % (numstack, opstack)\\n return ret\\n\\n def calcPreString(s):\\n ops = s.split(' ')\\n numstack = []\\n opstack = []\\n for op in ops:\\n if op.isdigit() or len(op) > 1:\\n numstack.append(int(op))\\n else:\\n if op == \\\"+\\\":\\n numstack.append(numstack.pop() + numstack.pop())\\n elif op == \\\"-\\\":\\n numstack.append(-numstack.pop() + numstack.pop())\\n elif op == \\\"*\\\":\\n numstack.append(numstack.pop() * numstack.pop())\\n elif op == \\\"/\\\":\\n numstack.append(1/numstack.pop() * numstack.pop())\\n return numstack.pop()\\n s = toPreString(s)\\n return calcPreString(s)\",\n \"memory\": \"22115\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n # 1. 연산자와 숫자로만 이루어진 문자열 list setting\\n # 2. 스택 조작\\n # - (: push\\n # - 숫: (top이 (: 같이 푸시), (top이 +- 에다가 하나 더 있다면 연산, 없으면 그냥 +-만 적용)\\n # - ): 숫자 pop 해서 연산\\n\\n # 아니면 재귀 형식?\\n # - (: close 짝 위치 매핑\\n # def dfs(lo, hi):\\n # 만약 s[i]가 (라면, dfs(i + 1, 매핑된 위치 - 1)\\n # 이렇게 괄호 모두 제거한 dfs에서 반복하면서 연산\\n pmap = {}\\n stack = []\\n \\n\\n def makegroup(s) -> list[str]:\\n new_char = \\\"\\\"\\n g = []\\n for i in range(len(s)):\\n if s[i] == ' ': continue\\n if s[i] in '+-()':\\n if new_char:\\n g.append(new_char)\\n new_char = \\\"\\\"\\n g.append(s[i])\\n else:\\n new_char += s[i]\\n \\n if new_char:\\n g.append(new_char)\\n return g\\n \\n g = makegroup(s)\\n for i in range(len(g)):\\n char = g[i]\\n if char == ')':\\n pos = stack.pop()\\n pmap[pos] = i\\n elif char == '(':\\n stack.append(i)\\n\\n print(g)\\n\\n def dfs(lo, hi) -> str:\\n new_stack = []\\n i = lo\\n while i < hi + 1:\\n if g[i] in '+-':\\n new_stack.append(g[i])\\n else:\\n if g[i] == '(':\\n num = dfs(i + 1, pmap[i] - 1)\\n i = pmap[i]\\n else:\\n num = g[i]\\n \\n slen = len(new_stack)\\n if slen == 0:\\n new_stack.append(num)\\n elif slen == 1:\\n op = new_stack.pop()\\n if op == '-':\\n new_stack.append(str(-int(num)))\\n else:\\n new_stack.append(num)\\n else: # slen > 1\\n op = new_stack.pop()\\n intnum = int(new_stack.pop())\\n if op == '-':\\n new_stack.append(str(intnum - int(num)))\\n else:\\n new_stack.append(str(intnum + int(num)))\\n\\n i += 1\\n return new_stack[0]\\n\\n return int(dfs(0, len(g) - 1))\\n\",\n \"memory\": \"22744\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n # 1. 연산자와 숫자로만 이루어진 문자열 list setting\\n # 2. 스택 조작\\n # - (: push\\n # - 숫: (top이 (: 같이 푸시), (top이 +- 에다가 하나 더 있다면 연산, 없으면 그냥 +-만 적용)\\n # - ): 숫자 pop 해서 연산\\n\\n # 아니면 재귀 형식?\\n # - (: close 짝 위치 매핑\\n # def dfs(lo, hi):\\n # 만약 s[i]가 (라면, dfs(i + 1, 매핑된 위치 - 1)\\n # 이렇게 괄호 모두 제거한 dfs에서 반복하면서 연산\\n pmap = {}\\n stack = []\\n \\n\\n def makegroup(s) -> list[str]:\\n new_char = \\\"\\\"\\n g = []\\n for i in range(len(s)):\\n if s[i] == ' ': continue\\n if s[i] in '+-()':\\n if new_char:\\n g.append(new_char)\\n new_char = \\\"\\\"\\n g.append(s[i])\\n else:\\n new_char += s[i]\\n \\n if new_char:\\n g.append(new_char)\\n return g\\n \\n g = makegroup(s)\\n for i in range(len(g)):\\n char = g[i]\\n if char == ')':\\n pos = stack.pop()\\n pmap[pos] = i\\n elif char == '(':\\n stack.append(i)\\n\\n print(g)\\n\\n def dfs(lo, hi) -> str:\\n new_stack = []\\n i = lo\\n while i < hi + 1:\\n if g[i] in '+-':\\n new_stack.append(g[i])\\n else:\\n if g[i] == '(':\\n num = dfs(i + 1, pmap[i] - 1)\\n i = pmap[i]\\n else:\\n num = g[i]\\n \\n slen = len(new_stack)\\n if slen == 0:\\n new_stack.append(num)\\n elif slen == 1:\\n op = new_stack.pop()\\n if op == '-':\\n new_stack.append(str(-int(num)))\\n else:\\n new_stack.append(num)\\n else: # slen > 1\\n op = new_stack.pop()\\n intnum = int(new_stack.pop())\\n if op == '-':\\n new_stack.append(str(intnum - int(num)))\\n else:\\n new_stack.append(str(intnum + int(num)))\\n\\n i += 1\\n return new_stack[0]\\n\\n return int(dfs(0, len(g) - 1))\\n\",\n \"memory\": \"22744\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s):\\n # prepare data\\n convertedS = []\\n par = ''\\n\\n def addPar(par):\\n if par != '':\\n convertedS.append(int(par))\\n return ''\\n \\n\\n def isDigit(val):\\n return i in '1234567890'\\n\\n for i in s:\\n if i == ' ':\\n par = addPar(par)\\n continue\\n if isDigit(i):\\n par += i\\n else:\\n par = addPar(par)\\n convertedS.append(i)\\n if par:\\n convertedS.append(int(par))\\n\\n def solveBrackets(poz):\\n s = 0\\n isNeg = False\\n idx = poz + 1\\n\\n while idx < size:\\n i = convertedS[idx]\\n if i == '-':\\n isNeg = True\\n elif i == '+':\\n isNeg = False\\n elif i == '(':\\n res = solveBrackets(idx)\\n if not isNeg:\\n s += res[0]\\n else:\\n s -= res[0]\\n idx = res[1]\\n isNeg = False\\n elif i == ')':\\n return s,idx\\n else:\\n if isNeg:\\n s -= i\\n else:\\n s += i\\n isNeg = False\\n idx += 1\\n\\n convertedS = ['('] + convertedS + [')']\\n size = len(convertedS)\\n return solveBrackets(0)[0]\\n\",\n \"memory\": \"23373\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n '''\\n \\\"(1-(4+5-(3+2)+1)-3)+(6+8)\\\"\\n 1 + (-4-5+3+2-1) -3 + 6 + 8\\n '''\\n # 1st iteration - get rid of ( and )\\n stack = []\\n signsStack = [1]\\n minusSigns = 0\\n\\n i = 0\\n while i < len(s):\\n currNum = \\\"\\\"\\n while i < len(s) and s[i].isnumeric():\\n currNum += s[i]\\n i += 1\\n\\n if currNum:\\n stack.append(\\\"-\\\" + currNum if minusSigns % 2 != 0 else currNum)\\n if i == len(s):\\n break\\n\\n if s[i] == \\\"(\\\":\\n if stack and stack[-1] == \\\"-\\\":\\n stack[-1] = \\\"+\\\"\\n signsStack.append(-1)\\n minusSigns += 1\\n else:\\n signsStack.append(1)\\n if s[i] == \\\")\\\":\\n sign = signsStack.pop()\\n if sign == -1:\\n minusSigns -= 1\\n if s[i] in {\\\"+\\\", \\\"-\\\"}:\\n stack.append(s[i])\\n i += 1\\n \\n resp = 0\\n op = \\\"+\\\"\\n # 2nd iteration through stack and just add or substract numbers\\n for x in stack:\\n if x in {\\\"+\\\", \\\"-\\\"}:\\n op = x\\n else:\\n num = int(x)\\n resp = resp + num if op == \\\"+\\\" else resp - num\\n\\n\\n\\n\\n\\n\\n return resp\\n \\n\\n\\n \\n\\n \",\n \"memory\": \"23373\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str):\\n s.replace(' ', '')\\n operators = set(['+', '-'])\\n braces = set(['(', ')'])\\n stack = []\\n inbraces = False\\n if s[0] == '-':\\n s= '0' + s\\n for i in range(len(s)):\\n if s[i] in operators or s[i] in braces or (s[i].lstrip(\\\"-\\\").isdigit() and len(stack) == 0):\\n stack.append(s[i])\\n elif s[i].lstrip(\\\"-\\\").isdigit():\\n if (stack[-1] in operators and (len(stack) == 1 or( len(stack)>1 and stack[-2] =='('))):\\n stack.append(stack.pop() + s[i])\\n elif stack[-1].lstrip(\\\"-\\\").isdigit():\\n stack.append(stack.pop() + s[i])\\n else:\\n stack.append(s[i])\\n open_par = []\\n end = 0\\n i= 0\\n while i < len(stack):\\n if stack[i] == '(':\\n open_par.append(i)\\n elif stack[i] == ')':\\n end = i\\n start = open_par.pop()\\n sub_exp = stack[start+1:end]\\n evaluated_exp = Solution.calc(sub_exp)\\n new_exp = stack[:start] + [evaluated_exp] + stack[end+1:]\\n stack = new_exp\\n i = start - 1\\n i +=1\\n \\n return int(Solution.calc(stack))\\n\\n def calc(stack):\\n if len(stack) == 1:\\n return stack[0]\\n elif len(stack) == 2:\\n return stack[0] + stack[1]\\n elif len(stack) > 2 and stack[0].lstrip(\\\"-\\\").isdigit() and stack[2].lstrip(\\\"-\\\").isdigit():\\n val1 = stack.pop(0)\\n operator = stack.pop(0)\\n val2 = stack.pop(0)\\n if operator == '+':\\n stack.insert(0, str(int(val1) + int(val2)))\\n else:\\n stack.insert(0, str(int(val1) - int(val2)))\\n return Solution.calc(stack)\",\n \"memory\": \"24001\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str):\\n s.replace(' ', '')\\n operators = set(['+', '-'])\\n braces = set(['(', ')'])\\n stack = []\\n inbraces = False\\n if s[0] == '-':\\n s= '0' + s\\n for i in range(len(s)):\\n if s[i] in operators or s[i] in braces or (s[i].lstrip(\\\"-\\\").isdigit() and len(stack) == 0):\\n stack.append(s[i])\\n elif s[i].lstrip(\\\"-\\\").isdigit():\\n if (stack[-1] in operators and (len(stack) == 1 or( len(stack)>1 and stack[-2] =='('))):\\n stack.append(stack.pop() + s[i])\\n elif stack[-1].lstrip(\\\"-\\\").isdigit():\\n stack.append(stack.pop() + s[i])\\n else:\\n stack.append(s[i])\\n # print(stack)\\n open_par = []\\n end = 0\\n i= 0\\n while i < len(stack):\\n if stack[i] == '(':\\n open_par.append(i)\\n elif stack[i] == ')':\\n end = i\\n start = open_par.pop()\\n sub_exp = stack[start+1:end]\\n evaluated_exp = Solution.calc(sub_exp)\\n # print(f'sub_exp {sub_exp}')\\n new_exp = stack[:start] + [evaluated_exp] + stack[end+1:]\\n stack = new_exp\\n i = start - 1\\n i +=1\\n \\n return int(Solution.calc(stack))\\n\\n def calc(stack):\\n # print(f'calc stack{stack}')\\n if len(stack) == 1:\\n return stack[0]\\n elif len(stack) == 2:\\n return stack[0] + stack[1]\\n elif len(stack) > 2 and stack[0].lstrip(\\\"-\\\").isdigit() and stack[2].lstrip(\\\"-\\\").isdigit():\\n val1 = stack.pop(0)\\n operator = stack.pop(0)\\n val2 = stack.pop(0)\\n if operator == '+':\\n stack.insert(0, str(int(val1) + int(val2)))\\n else:\\n stack.insert(0, str(int(val1) - int(val2)))\\n return Solution.calc(stack)\",\n \"memory\": \"24001\"\n },\n {\n \"code\": \"class Calc:\\n def __init__(self):\\n self.x = 0\\n self.buf = []\\n \\n def op(self, sign, y):\\n self.buf.append((sign, y))\\n return self\\n\\n def eval(self):\\n for el in self.buf:\\n res = el[1] if type(el[1]) == int else el[1].eval().x\\n if el[0] == \\\"+\\\":\\n self.x += res\\n elif el[0] == \\\"-\\\":\\n self.x -= res\\n\\n self.buf = []\\n return self\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n pre_calcs = []\\n calc = Calc()\\n\\n op = \\\"+\\\"\\n i = -1\\n l = len(s)\\n\\n while True:\\n i += 1\\n if i >= l:\\n break\\n \\n num_buf = []\\n while s[i] in \\\"0123456789\\\":\\n num_buf.append(s[i])\\n i += 1\\n if i == l:\\n break\\n if num_buf:\\n num = int(\\\"\\\".join(num_buf))\\n calc.op(op, num)\\n \\n if i == l:\\n break\\n \\n ch = s[i]\\n if ch == \\\"(\\\":\\n pre_calc = calc\\n pre_calcs.append(pre_calc)\\n calc = Calc()\\n pre_calc.op(op, calc)\\n op = \\\"+\\\"\\n elif ch == \\\")\\\":\\n calc = pre_calcs.pop()\\n elif ch == \\\" \\\":\\n continue\\n elif ch == \\\"+\\\":\\n op = \\\"+\\\"\\n elif ch == \\\"-\\\":\\n op = \\\"-\\\"\\n\\n calc.eval()\\n return calc.x \\n \\n # 3+3\\n # -(6+6)\\n # 3+(2-3)\\n\",\n \"memory\": \"24630\"\n },\n {\n \"code\": \"import re\\n\\nop = ['+', '-', '*', '/']\\ndef isNumber(s : str) -> bool:\\n # Regular expression to match integer\\n pattern = r'^-?\\\\d+$'\\n return bool(re.match(pattern, s))\\n\\nclass Solution:\\n def evalRPN(self, tokens: List[str]) -> int:\\n res = []\\n for tok in tokens:\\n if tok not in op:\\n res.append(int(tok))\\n else:\\n v2 = int(res.pop())\\n v1 = int(res.pop())\\n next = 0\\n if (tok == '+'):\\n next = v1 + v2\\n if (tok == '-'):\\n next = v1 -v2\\n if (tok == '*'):\\n next = v1 * v2\\n if (tok == '/'):\\n next = v1 / v2\\n res.append(int(next))\\n \\n return res[0]\\n\\n def convertToRPN(self, exp: str) -> List[str]:\\n tokens = [char for char in exp if char != ' ']\\n # print(tokens)\\n # now we need to merge the digits into whole numbers again\\n cur_num = \\\"\\\"\\n whole = []\\n for char in tokens:\\n if char.isdigit():\\n cur_num += char\\n else:\\n if (cur_num != \\\"\\\"):\\n whole.append(cur_num)\\n whole.append(char)\\n cur_num = \\\"\\\"\\n \\n if cur_num != \\\"\\\":\\n whole.append(cur_num)\\n\\n # Handling unary minus\\n final = []\\n prev = \\\"+\\\"\\n last = False\\n for i in range(len(whole)):\\n token = whole[i]\\n if (prev == \\\"+\\\" or prev == \\\"-\\\" or prev == \\\"(\\\") and token == \\\"-\\\":\\n # Treat this \\\"-\\\" as a unary operator\\n final.append(\\\"0\\\")\\n final.append(token)\\n prev = token\\n print(whole)\\n print(final)\\n # simplified shunting-yard algorithm (without precedence)\\n res = []\\n ops = []\\n for token in final:\\n if token == '+' or token == '-':\\n while ops and ops[-1] != '(':\\n res.append(ops.pop())\\n ops.append(token)\\n elif token == '(':\\n ops.append(token)\\n elif token == ')':\\n while ops[-1] != '(':\\n res.append(ops.pop())\\n ops.pop() # '('\\n else:\\n res.append(token) # number\\n\\n while ops:\\n res.append(ops.pop())\\n \\n return res\\n\\n def calculate(self, s: str) -> int:\\n print(self.convertToRPN(s))\\n return self.evalRPN(self.convertToRPN(s))\",\n \"memory\": \"24630\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n \\n #get rid of spaces\\n x = [i for i in s if i != ' ']\\n\\n #if negative number, combine\\n\\n j = 0\\n\\n x2 = []\\n\\n temp = ''\\n\\n while j < len(x):\\n if x[j] == '-' and x[j+1] != '(':\\n if temp:\\n x2.append(temp)\\n temp = ''\\n temp += '-'\\n elif x[j] not in ['(','+',')','-', '', ' ']:\\n temp += x[j]\\n elif x[j] in ['(',')','-']:\\n if temp:\\n x2.append(temp)\\n temp = ''\\n x2.append(x[j])\\n elif temp:\\n x2.append(temp)\\n temp = ''\\n j += 1\\n\\n if temp:\\n x2.append(temp)\\n\\n \\n #now all the negatives left come before parantheses\\n negstack = []\\n\\n neg = 0\\n\\n stack = []\\n\\n for i in range(len(x2)):\\n if x2[i] == ')':\\n if negstack:\\n if negstack[-1]:\\n neg -= 1\\n negstack.pop()\\n elif x2[i] == '-':\\n neg += 1\\n elif x2[i] == '(':\\n if i != 0 and x2[i-1] == '-':\\n negstack.append(True)\\n else:\\n negstack.append(False)\\n elif x2[i] not in ['(', '']:\\n if neg%2 == 0:\\n stack.append(int(x2[i]))\\n else:\\n stack.append(-int(x2[i]))\\n \\n print(stack)\\n return sum(stack)\",\n \"memory\": \"25259\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nExpr -> Term RestExpr\\nRestExpr -> binop Term RestExpr | epsilon\\nTerm -> ( Expr ) | num | - Term\\n\\\"\\\"\\\"\\n\\nclass eof: ...\\n\\ntext = lambda t: lambda token: t == token\\nbinop = lambda token: token in [\\\"+\\\", \\\"-\\\"]\\nnum = lambda token: isinstance(token, int)\\n\\ndigits = set(\\\"0123456789\\\")\\n\\ndef tokenize(s: str):\\n tokens = []\\n \\n i = 0\\n while i < len(s):\\n ch = s[i]\\n if ch == \\\" \\\":\\n i += 1\\n continue\\n if ch in digits:\\n current = []\\n while i < len(s) and s[i] in digits:\\n current.append(s[i])\\n i += 1\\n tokens.append(int(\\\"\\\".join(current)))\\n continue\\n tokens.append(ch)\\n i += 1\\n tokens.append(eof)\\n return tokens\\n\\ndef evaluate(rpn):\\n stack = []\\n for token in rpn:\\n if num(token):\\n stack.append(token)\\n continue\\n right = stack.pop()\\n left = stack.pop()\\n if token == \\\"+\\\":\\n stack.append(left + right)\\n continue\\n if token == \\\"-\\\":\\n stack.append(left - right)\\n continue\\n assert len(stack) == 1\\n return stack[-1]\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n tokens = tokenize(s)[::-1]\\n stack = []\\n\\n def eat(cond):\\n if isinstance(cond, str):\\n cond = text(cond)\\n if cond(peek()):\\n return tokens.pop()\\n raise RuntimeError(\\\"eat exception\\\")\\n\\n def peek():\\n return tokens[-1]\\n\\n \\\"\\\"\\\"\\n Expr -> Term RestExpr\\n RestExpr -> binop Term RestExpr | epsilon\\n Term -> ( Expr ) | num | - Term\\n \\\"\\\"\\\"\\n\\n def parse_term():\\n # print(\\\"parsing term\\\", peek(), tokens[::-1])\\n # print(peek(), num(peek()))\\n if peek() == \\\"(\\\":\\n eat(\\\"(\\\"); parse_expr(); eat(\\\")\\\")\\n return\\n if num(peek()):\\n stack.append(eat(num))\\n return\\n if peek() == \\\"-\\\":\\n eat(\\\"-\\\"); stack.append(0); parse_term(); stack.append(\\\"-\\\")\\n return\\n raise RuntimeError(\\\"term error\\\")\\n \\n def parse_expr():\\n parse_term(); parse_restexpr()\\n \\n def parse_restexpr():\\n if binop(peek()):\\n op = eat(binop)\\n parse_term()\\n stack.append(op)\\n parse_restexpr()\\n\\n parse_expr(); eat(text(eof))\\n\\n return evaluate(stack)\",\n \"memory\": \"25259\"\n },\n {\n \"code\": \"def postfixEvaluation(tokens):\\n stack = []\\n for char in tokens:\\n if char == \\\"+\\\":\\n op1 = stack.pop()\\n op2 = stack.pop()\\n stack.append(op2 + op1)\\n elif char == \\\"-\\\":\\n op1 = stack.pop()\\n op2 = stack.pop()\\n stack.append(op2 - op1)\\n elif char == \\\"*\\\":\\n op1 = stack.pop()\\n op2 = stack.pop()\\n stack.append(op2 * op1)\\n elif char == \\\"/\\\":\\n op1 = stack.pop()\\n op2 = stack.pop()\\n stack.append(int(op2 / op1)) # Ensure integer division\\n elif char == \\\"neg\\\":\\n op1 = stack.pop()\\n stack.append(-op1) # Apply unary negation\\n else:\\n # If it's a number, append it to the stack\\n stack.append(int(char)) \\n \\n return stack.pop()\\n\\ndef infixToPostfix(s):\\n operators = {'+', '-', '*', '/'}\\n precedence_stack = {'(': 0, '+': 1, '-': 1, '*': 2, '/': 2, 'neg': 3}\\n precedence_input = {'(': 4, '+': 1, '-': 1, '*': 2, '/': 2, 'neg': 3, ')': 0}\\n output = []\\n # Wrap `s` with '(' and ')' to make processing easier\\n s = s + ')'\\n stack = ['(']\\n prevC = '('\\n\\n hasNum = False\\n num = 0\\n for c in s:\\n if c == ' ':\\n continue\\n\\n # c is part of a number\\n if c.isdigit():\\n hasNum = True\\n num = num * 10 + int(c)\\n prevC = c\\n continue\\n\\n # c is an operator\\n if hasNum:\\n hasNum = False\\n output.append(str(num)) # Convert number to string for easier evaluation\\n num = 0\\n\\n # Check if it's a negative unary operator\\n if c == '-' and (prevC == '(' or prevC in operators):\\n c = 'neg'\\n\\n # Pop until '('\\n while precedence_stack[stack[-1]] >= precedence_input[c]:\\n popped = stack.pop()\\n if popped != '(':\\n output.append(popped)\\n else:\\n break\\n\\n # Push input onto the stack\\n if c != ')':\\n stack.append(c)\\n\\n prevC = c\\n\\n return output\\n\\ndef fun(s):\\n postfixExp = infixToPostfix(s) # Convert infix to postfix\\n result = postfixEvaluation(postfixExp) # Evaluate the postfix expression\\n return result\\n \\nclass Solution:\\n def calculate(self, s: str) -> int:\\n return fun(s)\\n\",\n \"memory\": \"25888\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n s.replace(\\\" \\\", \\\"\\\")\\n if '+' not in s and '-' not in s:\\n if '(' not in s and ')' not in s:\\n return int(s)\\n parsedList = []\\n curr = 0\\n for elem in s:\\n if elem == \\\" \\\":\\n pass\\n elif elem in \\\"+-()\\\":\\n parsedList.append(str(curr))\\n curr = 0\\n parsedList.append(elem)\\n else:\\n curr = curr * 10 + int(elem)\\n if curr is not 0:\\n parsedList.append(str(curr))\\n result = 0\\n stack = []\\n sign = 1\\n for elem in parsedList:\\n if elem not in \\\"+-()\\\":\\n result += sign * int(elem)\\n elif elem == \\\"-\\\":\\n sign = -1\\n elif elem == \\\"+\\\":\\n sign = 1\\n elif elem == \\\"(\\\":\\n stack.append(result)\\n stack.append(sign)\\n result = 0\\n sign = 1\\n elif elem == \\\")\\\":\\n result *= stack.pop()\\n result += stack.pop()\\n return result\",\n \"memory\": \"25888\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n ops = {'+', '-', '(', ')'}\\n expr = ''.join( ' ' + c + ' ' if c in ops else c for c in s).split()\\n expr = [e if e in ops else int(e) for e in expr]\\n\\n stack = []\\n sign, result = 1, 0\\n for e in expr:\\n if e in ops:\\n if e == '+':\\n sign = 1\\n elif e == '-':\\n sign = -1\\n elif e == '(':\\n stack.append(result)\\n stack.append(sign)\\n sign, result = 1, 0\\n else:\\n result = result * stack.pop() + stack.pop()\\n else:\\n result += sign * e\\n\\n return result\",\n \"memory\": \"26516\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n # We first translate the string to use no spaces and\\n # then recursive descent.\\n def read_all(start):\\n if s[start] != \\\"-\\\":\\n first, rest = read_term(start)\\n else:\\n neg_first, rest = read_term(start+1)\\n first = -neg_first \\n if rest!=len(s) and (operator := s[rest]) in \\\"+-\\\" :\\n assert len(s)-rest >= 2\\n # Interpret \\\"-\\\" as \\\"+-\\\"\\n if operator == \\\"+\\\":\\n second, rest = read_all(rest+1)\\n else:\\n second, rest = read_all(rest)\\n return first+second, rest\\n else:\\n return first, rest\\n\\n def read_num(start):\\n end = start\\n while end < len(s) and s[end] in \\\"0123456789\\\":\\n end += 1\\n if end!=start:\\n return int(s[start:end]), end\\n return None\\n\\n def read_term(start):\\n if (ret := read_num(start)) is not None:\\n return ret\\n if s[start] == \\\"(\\\":\\n res, rest = read_all(start+1)\\n assert s[rest] == \\\")\\\"\\n return res, rest+1\\n if s[start] == \\\"-\\\":\\n neg_res, rest = read_term(start+1)\\n return -neg_res, rest\\n # print(s)\\n assert False\\n\\n s = \\\"\\\".join( c for c in s if c!=\\\" \\\")\\n ret, rest = read_all(0)\\n assert rest==len(s)\\n return ret\",\n \"memory\": \"27145\"\n },\n {\n \"code\": \"def tokenize(s: str) -> List[Union[str, int]]:\\n tokens = []\\n\\n for c in s:\\n if c.isdigit():\\n if not tokens or not isinstance(tokens[-1], int):\\n tokens.append(0)\\n tokens[-1] = 10 * tokens[-1] + int(c)\\n elif c != ' ':\\n tokens.append(c)\\n \\n return tokens\\n\\ndef map_parentheses(tokens: List[Union[str, int]]) -> Dict[int, int]:\\n stack = []\\n mapping = {}\\n for i, token in enumerate(tokens):\\n if token == '(':\\n stack.append(i)\\n elif token == ')':\\n mapping[i] = (j := stack.pop())\\n mapping[j] = i\\n return mapping\\n\\ndef find_operator(tokens: List[Union[str, int]], mapping: Dict[int, int], L: int, R: int) -> int:\\n i = L\\n j = None\\n\\n while i <= R:\\n if i in mapping:\\n i = mapping[i] + 1\\n continue\\n if tokens[i] is int:\\n continue\\n if tokens[i] == '+':\\n return i\\n if tokens[i] == '-' and i > L:\\n return i\\n if tokens[i] == '*':\\n j = i\\n i += 1\\n \\n assert j is not None\\n return j\\n\\ndef solve(tokens: List[Union[str, int]], mapping: Dict[int, int], L: int, R: int) -> int:\\n if L > R:\\n raise RuntimeError()\\n if L in mapping and mapping[L] == R:\\n return solve(tokens, mapping, L + 1, R - 1)\\n if L == R:\\n assert isinstance(tokens[L], int)\\n return tokens[L]\\n if L == R - 1 and tokens[L] == '-' and isinstance(tokens[R], int):\\n return -tokens[R]\\n if tokens[L] == '-' and (L + 1) in mapping and mapping[L + 1] == R:\\n return -solve(tokens, mapping, L + 2, R - 1)\\n \\n i = find_operator(tokens, mapping, L, R)\\n\\n if tokens[i] == '+':\\n return solve(tokens, mapping, L, i - 1) + solve(tokens, mapping, i + 1, R)\\n if tokens[i] == '-':\\n return solve(tokens, mapping, L, i - 1) + solve(tokens, mapping, i, R)\\n if tokens[i] == '*':\\n return solve(tokens, mapping, L, i - 1) * solve(tokens, mapping, i + 1, R)\\n raise RuntimeError()\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n tokens = tokenize(s)\\n mapping = map_parentheses(tokens)\\n return solve(tokens, mapping, 0, len(tokens) - 1)\\n\",\n \"memory\": \"27145\"\n },\n {\n \"code\": \"class Node:\\n def __init__(self, op, left=None, right=None):\\n self.op = op\\n self.left = left\\n self.right = right\\n\\nclass Solution:\\n def exprTree(self, chars):\\n stack = []\\n root = None\\n idx = 0\\n N = len(chars)\\n while idx < N:\\n ch = chars[idx]\\n if ch == ' ':\\n idx += 1\\n continue\\n elif ch == '-':\\n if not root: \\n root = Node('-', 0)\\n else:\\n root = Node('-', root)\\n idx += 1\\n elif ch == '+':\\n root = Node('+', root)\\n idx += 1\\n elif ch == '(':\\n if root:\\n stack.append(root)\\n root = None\\n idx += 1\\n elif ch == ')':\\n if stack:\\n node = stack.pop()\\n node.right = root\\n root = node\\n idx += 1\\n else:\\n buf = ''\\n while idx < N and chars[idx].isdigit():\\n buf += chars[idx]\\n idx += 1\\n buf = int(buf)\\n if not root:\\n root = Node('+', 0, buf)\\n else:\\n root.right = buf\\n return root\\n def evaluate(self, root):\\n writeStack = []\\n readStack = [root.op, root.left, root.right]\\n while readStack:\\n top = readStack.pop()\\n if isinstance(top, int):\\n writeStack.append(top)\\n elif isinstance(top, str):\\n a = writeStack.pop()\\n b = writeStack.pop()\\n if top == '+': opt = a+b\\n else: opt = a-b\\n writeStack.append(opt)\\n else:\\n readStack.append(top.op)\\n readStack.append(top.left)\\n readStack.append(top.right)\\n return writeStack[0]\\n\\n def calculate(self, s: str) -> int:\\n root = self.exprTree(s)\\n opt = self.evaluate(root)\\n return opt\\n\",\n \"memory\": \"27774\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(\\\" \\\",\\\"\\\")\\n def calc(i,j):\\n if i == j: return 0\\n if j-i < 400:\\n return eval(s[i:j])\\n if s[i] == \\\"(\\\":\\n balance = 1\\n k = i+1\\n while balance > 0:\\n if s[k] == \\\"(\\\":\\n balance += 1\\n if s[k] == \\\")\\\":\\n balance -= 1\\n k += 1\\n return calc(i+1,k-1)+calc(k,j)\\n elif s[i] == \\\"-\\\":\\n if s[i+1].isdigit():\\n k = i+1\\n while k < j and s[k].isdigit():\\n k += 1\\n return -int(s[i+1:k])+calc(k,j)\\n else:\\n balance = 1\\n k = i+2\\n while balance > 0:\\n if s[k] == \\\"(\\\":\\n balance += 1\\n if s[k] == \\\")\\\":\\n balance -= 1\\n k += 1\\n return -calc(i+2,k-1)+calc(k,j)\\n elif s[i] == \\\"+\\\":\\n return calc(i+1,j)\\n else:\\n k = i\\n while k < j and s[k].isdigit():\\n k += 1\\n return int(s[i:k])+calc(k,j)\\n return calc(0,len(s))\\n \\n\",\n \"memory\": \"28403\"\n },\n {\n \"code\": \"from dataclasses import dataclass\\n\\nPRECEDENCE = {\\n \\\"+\\\": 0,\\n \\\"-\\\": 0,\\n \\\"*\\\": 1,\\n \\\"/\\\": 1,\\n}\\n\\n@dataclass\\nclass Expr:\\n op: Literal[\\\"+\\\", \\\"-\\\", \\\"*\\\", \\\"/\\\"]\\n left: Union[\\\"Expr\\\", int]\\n right: Union[\\\"Expr\\\", int]\\n\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n return self.eval_expr(self.calculate_at(s, 0)[0])\\n\\n def calculate_at(self, s: str, i: int) -> tuple[Expr, int]:\\n output_stack = []\\n operator_stack = []\\n unary_op = None\\n\\n expr = None\\n\\n while i < len(s):\\n x, i = self.token(s, i)\\n\\n if isinstance(x, int):\\n if expr is None:\\n expr = self.apply_unary_op(x, unary_op)\\n else:\\n output_stack.append(x)\\n elif x == '(':\\n x, i = self.calculate_at(s, i)\\n # print(\\\"SUBEXPR IS \\\", x)\\n if expr is None:\\n expr = self.apply_unary_op(x, unary_op)\\n else:\\n output_stack.append(x)\\n elif x == ')':\\n break\\n elif x == ' ':\\n continue\\n else:\\n # print(x)\\n p = PRECEDENCE[x]\\n if expr is None:\\n unary_op = x\\n continue\\n\\n if operator_stack and p <= PRECEDENCE[operator_stack[-1]]:\\n expr = self.build_expr(expr, output_stack, operator_stack)\\n\\n operator_stack.append(x)\\n\\n if operator_stack:\\n expr = self.build_expr(expr, output_stack, operator_stack)\\n\\n # print(expr)\\n\\n return expr, i\\n \\n def token(self, s: str, i: int) -> (str | int, int):\\n if s[i].isdigit():\\n x = 0\\n\\n while i < len(s) and s[i].isdigit():\\n x = x * 10 + int(s[i])\\n i += 1 \\n else:\\n x = s[i]\\n i += 1\\n\\n return x, i\\n\\n def build_expr(\\n self,\\n left: Expr | int,\\n output_stack: list[int | Expr],\\n operator_stack: list[str]\\n ):\\n cur_expr = output_stack.pop()\\n while len(operator_stack) > 1:\\n cur_expr = Expr(\\n op=operator_stack.pop(),\\n right=cur_expr,\\n left=output_stack.pop(),\\n )\\n\\n return Expr(\\n op=operator_stack.pop(),\\n right=cur_expr,\\n left=left,\\n )\\n\\n def combine_expr(self, a: Expr | None | int, b: Expr, op: str):\\n if a is None:\\n return b\\n\\n return Expr(\\n op,\\n a,\\n b,\\n )\\n\\n def apply_unary_op(self, expr: Expr, op: str | None) -> Expr:\\n if op:\\n return Expr(op, None, expr)\\n return expr\\n \\n def eval_expr(self, expr: Expr | int | None) -> int:\\n if expr is None:\\n return 0\\n if isinstance(expr, int):\\n return expr\\n\\n if expr.left is None:\\n a = expr.right if isinstance(expr.right, int) else self.eval_expr(expr.right)\\n return a if expr.op == \\\"+\\\" else -a\\n\\n a = expr.left if isinstance(expr.left, int) else self.eval_expr(expr.left)\\n b = expr.right if isinstance(expr.right, int) else self.eval_expr(expr.right)\\n\\n if expr.op == \\\"+\\\":\\n return a + b\\n elif expr.op == \\\"-\\\":\\n return a - b\\n elif expr.op == \\\"*\\\":\\n return a * b\\n else:\\n return a / b\",\n \"memory\": \"28403\"\n },\n {\n \"code\": \"import re\\nclass Expression:\\n def __init__(self): \\n self.sub_expressions = []\\n self.operators = []\\n\\n def evaluate(self):\\n if len(self.operators) == 0:\\n if isinstance(self.sub_expressions[0], int):\\n return self.sub_expressions[0]\\n else:\\n return self.sub_expressions[0].evaluate()\\n else:\\n if len(self.sub_expressions) == len(self.operators):\\n self.sub_expressions.insert(0, Operand(0))\\n a0 = self.sub_expressions[0].evaluate()\\n for i in range(len(self.operators)):\\n if self.operators[i] == '+':\\n a0 += self.sub_expressions[i+1].evaluate()\\n else:\\n a0 -= self.sub_expressions[i+1].evaluate()\\n return a0\\n def add_operand(self, operand):\\n self.sub_expressions.append(operand)\\n \\n def add_operator(self, operator):\\n self.operators.append(operator)\\n\\nclass Operand(Expression):\\n def __init__(self, number):\\n self.value = number\\n def evaluate(self):\\n return self.value\\n\\nclass Solution:\\n def calculate(self, s):\\n pattern = r'(\\\\d+|\\\\+|\\\\-|\\\\(|\\\\))'\\n parts = re.findall(pattern, s)\\n stack = []\\n stack.append(Expression())\\n current_expression = stack[0]\\n for part in parts:\\n if part == '(':\\n stack.append(Expression())\\n current_expression = stack[-1]\\n elif part == ')':\\n temp = stack.pop()\\n current_expression = stack[-1]\\n current_expression.add_operand(temp)\\n elif part == '+':\\n current_expression.add_operator('+')\\n elif part == '-':\\n current_expression.add_operator('-')\\n else:\\n operand = int(part)\\n current_expression.add_operand(Operand(operand))\\n return stack[0].evaluate()\\n\",\n \"memory\": \"29031\"\n },\n {\n \"code\": \"import re\\nclass Expression:\\n def __init__(self): \\n self.sub_expressions = []\\n self.operators = []\\n\\n def evaluate(self):\\n if len(self.operators) == 0:\\n if isinstance(self.sub_expressions[0], int):\\n return self.sub_expressions[0]\\n else:\\n return self.sub_expressions[0].evaluate()\\n else:\\n if len(self.sub_expressions) == len(self.operators):\\n self.sub_expressions.insert(0, Operand(0))\\n a0 = self.sub_expressions[0].evaluate()\\n for i in range(len(self.operators)):\\n if self.operators[i] == '+':\\n a0 += self.sub_expressions[i+1].evaluate()\\n else:\\n a0 -= self.sub_expressions[i+1].evaluate()\\n return a0\\n def add_operand(self, operand):\\n self.sub_expressions.append(operand)\\n \\n def add_operator(self, operator):\\n self.operators.append(operator)\\n\\nclass Operand(Expression):\\n def __init__(self, number):\\n self.value = number\\n def evaluate(self):\\n return self.value\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(' ', '') \\n pattern = r'(\\\\d+|\\\\+|\\\\-|\\\\(|\\\\))'\\n parts = re.findall(pattern, s)\\n\\n stack = []\\n stack.append(Expression())\\n current_expression = stack[0]\\n for part in parts :\\n if part == ' ':\\n continue\\n elif part == '(':\\n stack.append(Expression())\\n current_expression = stack[-1]\\n elif part == ')':\\n temp = stack.pop()\\n current_expression = stack[-1]\\n current_expression.add_operand(temp)\\n elif part == '+':\\n current_expression.add_operator('+')\\n elif part == '-':\\n current_expression.add_operator('-')\\n else:\\n operand = int(part)\\n current_expression.add_operand(Operand(operand))\\n\\n return stack[0].evaluate()\",\n \"memory\": \"29660\"\n },\n {\n \"code\": \"import re\\nclass Expression:\\n def __init__(self): \\n self.sub_expressions = []\\n self.operators = []\\n\\n def evaluate(self):\\n if len(self.operators) == 0:\\n if isinstance(self.sub_expressions[0], int):\\n return self.sub_expressions[0]\\n else:\\n return self.sub_expressions[0].evaluate()\\n else:\\n if len(self.sub_expressions) == len(self.operators):\\n self.sub_expressions.insert(0, Operand(0))\\n a0 = self.sub_expressions[0].evaluate()\\n for i in range(len(self.operators)):\\n if self.operators[i] == '+':\\n a0 += self.sub_expressions[i+1].evaluate()\\n else:\\n a0 -= self.sub_expressions[i+1].evaluate()\\n return a0\\n def add_operand(self, operand):\\n self.sub_expressions.append(operand)\\n \\n def add_operator(self, operator):\\n self.operators.append(operator)\\n\\nclass Operand(Expression):\\n def __init__(self, number):\\n self.value = number\\n def evaluate(self):\\n return self.value\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(' ', '') \\n pattern = r'(\\\\d+|\\\\+|\\\\-|\\\\(|\\\\))'\\n parts = re.findall(pattern, s)\\n\\n stack = []\\n stack.append(Expression())\\n current_expression = stack[0]\\n for part in parts :\\n if part == ' ':\\n continue\\n elif part == '(':\\n stack.append(Expression())\\n current_expression = stack[-1]\\n elif part == ')':\\n temp = stack.pop()\\n current_expression = stack[-1]\\n current_expression.add_operand(temp)\\n elif part == '+':\\n current_expression.add_operator('+')\\n elif part == '-':\\n current_expression.add_operator('-')\\n else:\\n operand = int(part)\\n current_expression.add_operand(Operand(operand))\\n\\n return stack[0].evaluate()\",\n \"memory\": \"29660\"\n },\n {\n \"code\": \"import re\\nclass Expression:\\n def __init__(self): \\n self.sub_expressions = []\\n self.operators = []\\n\\n def evaluate(self):\\n if len(self.operators) == 0:\\n if isinstance(self.sub_expressions[0], int):\\n return self.sub_expressions[0]\\n else:\\n return self.sub_expressions[0].evaluate()\\n else:\\n if len(self.sub_expressions) == len(self.operators):\\n self.sub_expressions.insert(0, Operand(0))\\n a0 = self.sub_expressions[0].evaluate()\\n for i in range(len(self.operators)):\\n if self.operators[i] == '+':\\n a0 += self.sub_expressions[i+1].evaluate()\\n else:\\n a0 -= self.sub_expressions[i+1].evaluate()\\n return a0\\n def add_operand(self, operand):\\n self.sub_expressions.append(operand)\\n \\n def add_operator(self, operator):\\n self.operators.append(operator)\\n\\nclass Operand(Expression):\\n def __init__(self, number):\\n self.value = number\\n def evaluate(self):\\n return self.value\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n pattern = r'(\\\\d+|\\\\+|\\\\-|\\\\(|\\\\))'\\n parts = re.findall(pattern, s)\\n\\n stack = []\\n stack.append(Expression())\\n current_expression = stack[0]\\n for part in parts :\\n if part == ' ':\\n continue\\n elif part == '(':\\n stack.append(Expression())\\n current_expression = stack[-1]\\n elif part == ')':\\n temp = stack.pop()\\n current_expression = stack[-1]\\n current_expression.add_operand(temp)\\n elif part == '+':\\n current_expression.add_operator('+')\\n elif part == '-':\\n current_expression.add_operator('-')\\n else:\\n operand = int(part)\\n current_expression.add_operand(Operand(operand))\\n\\n return stack[0].evaluate()\",\n \"memory\": \"30289\"\n },\n {\n \"code\": \"import re\\nclass Expression:\\n def __init__(self): \\n self.sub_expressions = []\\n self.operators = []\\n\\n def evaluate(self):\\n if len(self.operators) == 0:\\n if isinstance(self.sub_expressions[0], int):\\n return self.sub_expressions[0]\\n else:\\n return self.sub_expressions[0].evaluate()\\n else:\\n if len(self.sub_expressions) == len(self.operators):\\n self.sub_expressions.insert(0, Operand(0))\\n a0 = self.sub_expressions[0].evaluate()\\n for i in range(len(self.operators)):\\n if self.operators[i] == '+':\\n a0 += self.sub_expressions[i+1].evaluate()\\n else:\\n a0 -= self.sub_expressions[i+1].evaluate()\\n return a0\\n def add_operand(self, operand):\\n self.sub_expressions.append(operand)\\n \\n def add_operator(self, operator):\\n self.operators.append(operator)\\n\\nclass Operand(Expression):\\n def __init__(self, number):\\n self.value = number\\n def evaluate(self):\\n return self.value\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n pattern = r'(\\\\d+|\\\\+|\\\\-|\\\\(|\\\\))'\\n parts = re.findall(pattern, s)\\n stack = []\\n stack.append(Expression())\\n current_expression = stack[0]\\n for part in parts :\\n if part == ' ':\\n continue\\n elif part == '(':\\n stack.append(Expression())\\n current_expression = stack[-1]\\n elif part == ')':\\n temp = stack.pop()\\n current_expression = stack[-1]\\n current_expression.add_operand(temp)\\n elif part == '+':\\n current_expression.add_operator('+')\\n elif part == '-':\\n current_expression.add_operator('-')\\n else:\\n operand = int(part)\\n current_expression.add_operand(Operand(operand))\\n\\n return stack[0].evaluate()\",\n \"memory\": \"30289\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(' ', '')\\n f_stack = []\\n b_stack = []\\n num_stack = []\\n i = 0\\n k = 0\\n n = len(s)\\n while i < n:\\n c = s[i]\\n # print(i, c, end=' ')\\n if c in '0123456789':\\n num_stack.append(c)\\n elif num_stack:\\n num = ''.join(num_stack)\\n f_stack.append((k, int(num)))\\n num_stack = []\\n if b_stack and b_stack[-1][0] == k: # check k is smae level\\n f_stack.append(b_stack.pop())\\n # continue\\n if c == '(':\\n k += 1\\n if c == ')':\\n k -= 1\\n if b_stack and b_stack[-1][0] == k:\\n f_stack.append(b_stack.pop())\\n \\n if c in '+':\\n b_stack.append((k, c))\\n if c in '-':\\n if i == 0 or s[i-1] not in '0123456789)':\\n b_stack.append((k, 'n'))\\n else:\\n b_stack.append((k, '-'))\\n # print(f_stack, b_stack)\\n\\n i += 1\\n \\n if num_stack:\\n num = ''.join(num_stack)\\n f_stack.append((k, int(num)))\\n num_stack = []\\n if b_stack and b_stack[-1][0] == k: # check k is smae level\\n f_stack.append(b_stack.pop())\\n # print(f_stack, b_stack)\\n # print(list(_[1] for _ in f_stack))\\n \\n stack = []\\n for k, c in f_stack:\\n if c == '+':\\n n2 = stack.pop()\\n n1 = stack.pop()\\n stack.append(n1 + n2)\\n elif c == '-':\\n n2 = stack.pop()\\n n1 = stack.pop()\\n stack.append(n1 - n2)\\n elif c == 'n':\\n n1 = stack.pop()\\n stack.append(-n1)\\n else:\\n stack.append(c)\\n\\n return stack[0]\\n\",\n \"memory\": \"30918\"\n },\n {\n \"code\": \"def is_digit(s, i):\\n try:\\n int(s[i])\\n return True\\n except ValueError:\\n return False\\n\\n\\ndef need_prepend_plus(s, i):\\n if i == 0 and s[i] == \\\"(\\\":\\n return True\\n if is_digit(s, i):\\n if i == 0 or s[i - 1] == \\\"(\\\":\\n return True\\n return False\\n\\n\\ndef prepend_plus(s):\\n list_ = []\\n for i in range(len(s)):\\n if need_prepend_plus(s, i):\\n list_.append(i)\\n\\n if len(list_) == 0:\\n return s\\n\\n #print('here', list_)\\n s_ = s[:list_[0]]\\n i = list_[0]\\n for j in list_[1:]:\\n #print(s_, i, j)\\n s_ += \\\"+\\\"\\n s_ += s[i:j]\\n i = j\\n s_ += \\\"+\\\" + s[list_[-1]:]\\n return s_\\n\\n\\ndef split_into_list(s):\\n ret = []\\n for i in range(len(s)):\\n ret.append(s[i])\\n\\n digit_start_end = []\\n i = 0\\n while i < len(s):\\n start = None\\n if is_digit(s, i):\\n start = i\\n while i < len(s) and is_digit(s, i):\\n i += 1\\n\\n if start is not None:\\n digit_start_end.append((start, i))\\n i += 1\\n\\n #print(ret)\\n #print(digit_start_end)\\n for (start, end) in reversed(digit_start_end):\\n num = int(s[start:end])\\n for _ in range(end-start-1):\\n del ret[start]\\n #print(ret, start, num)\\n ret[start] = num\\n return ret\\n\\n\\ndef get_sign(c):\\n if c == \\\"+\\\":\\n return 1\\n elif c == \\\"-\\\":\\n return -1\\n else:\\n raise ValueError(f\\\"Got {c}\\\")\\n\\n\\ndef get_num_from_list(sub_list):\\n if len(sub_list) == 1:\\n return sub_list[0]\\n\\n val = 0\\n #print('n', sub_list)\\n assert len(sub_list) % 2 == 0\\n for i in range(len(sub_list) // 2):\\n sign_char = sub_list[2 * i]\\n raw_val = sub_list[2 * i + 1]\\n val += get_sign(sign_char) * raw_val\\n return val\\n\\n\\ndef solve_(list_):\\n stack = []\\n i = 0\\n num_brackets = 0\\n\\n while i < len(list_):\\n c = list_[i]\\n if c != \\\")\\\":\\n stack.append(c)\\n # eg (+3-42)\\n else:\\n sub_list = []\\n while True:\\n val = stack.pop()\\n if val == \\\"(\\\":\\n break\\n sub_list.append(val)\\n # print(sub_list)\\n sub_list.reverse() # 24-3+ -> +3-42\\n val = get_num_from_list(sub_list)\\n stack.append(val)\\n #print(i, stack)\\n i += 1\\n #print(stack, num_brackets)\\n return get_num_from_list(stack)\\n\\n\\ndef solution(s):\\n s = s.replace(\\\" \\\", \\\"\\\")\\n s = prepend_plus(s)\\n #print(s)\\n s = split_into_list(s)\\n #print(s)\\n return solve_(s)\\n\\n\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n return solution(s)\\n \",\n \"memory\": \"30918\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n self.idx = 0\\n\\n def dfs(prefix, sign, operand):\\n if self.idx >= len(s):\\n return prefix + sign * operand\\n \\n cur = s[self.idx]\\n self.idx += 1\\n if cur == \\\" \\\":\\n return dfs(prefix, sign, operand)\\n\\n if cur.isdigit():\\n return dfs(prefix, sign, operand * 10 + int(cur))\\n else:\\n prefix += sign * operand\\n if cur == \\\"+\\\":\\n return dfs(prefix, 1, 0)\\n elif cur == \\\"-\\\":\\n return dfs(prefix, -1, 0)\\n elif cur == \\\"(\\\":\\n return dfs(prefix + sign * dfs(0, 1, 0), 1, 0)\\n else:\\n return prefix\\n \\n return dfs(0, 1, 0)\\n\",\n \"memory\": \"31546\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n\\n def add(a, b):\\n return a + b\\n \\n def sub(a, b):\\n return a - b if a is not None else -b\\n \\n # def concat(a, b):\\n # return a * 10 + b\\n \\n def apply(input, op, left):\\n if not input:\\n return left\\n c = input.popleft()\\n match c:\\n case '(':\\n right = apply(input, None, None)\\n res = op(left, right) if op is not None else right\\n return apply(input, None, res)\\n case ')':\\n return left\\n case '+':\\n return apply(input, add, left)\\n case '-':\\n return apply(input, sub, left)\\n case ' ':\\n return apply(input, op, left)\\n case _:\\n val = int(c)\\n while input and input[0].isdigit():\\n val = 10 * val + int(input.popleft())\\n if op is not None:\\n res = op(left, val)\\n elif left is not None:\\n res = 10 * left + val\\n else:\\n res = val\\n return apply(input, None, res)\\n\\n return apply(deque(s), None, None)\\n\",\n \"memory\": \"32175\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n\\n def add(a, b):\\n return a + b\\n\\n def sub(a, b):\\n return a - b if a is not None else -b\\n\\n def apply(input, op, left):\\n if not input:\\n return left\\n c = input.popleft()\\n match c:\\n case '(':\\n right = apply(input, None, None)\\n res = op(left, right) if op is not None else right\\n return apply(input, None, res)\\n case ')':\\n return left\\n case '+':\\n return apply(input, add, left)\\n case '-':\\n return apply(input, sub, left)\\n case ' ':\\n return apply(input, op, left)\\n case _:\\n val = int(c)\\n while input and input[0].isdigit():\\n val = 10 * val + int(input.popleft())\\n if op is not None:\\n res = op(left, val)\\n else:\\n res = val\\n return apply(input, None, res)\\n\\n return apply(deque(s), None, None)\\n\",\n \"memory\": \"32804\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n s = s.replace(' ', '')\\n stack = []\\n f_stack = []\\n b_stack = []\\n num_stack = []\\n i = 0\\n k = 0\\n n = len(s)\\n while i < n:\\n c = s[i]\\n print(i, c, end=' ')\\n if c in '0123456789':\\n num_stack.append(c)\\n elif num_stack:\\n num = ''.join(num_stack)\\n f_stack.append((k, int(num)))\\n num_stack = []\\n if b_stack and b_stack[-1][0] == k: # check k is smae level\\n f_stack.append(b_stack.pop())\\n # continue\\n if c == '(':\\n k += 1\\n if c == ')':\\n k -= 1\\n if b_stack and b_stack[-1][0] == k:\\n f_stack.append(b_stack.pop())\\n \\n if c in '+':\\n b_stack.append((k, c))\\n if c in '-':\\n if i == 0 or s[i-1] not in '0123456789)':\\n b_stack.append((k, 'n'))\\n else:\\n b_stack.append((k, '-'))\\n # print(f_stack, b_stack)\\n\\n i += 1\\n \\n if num_stack:\\n num = ''.join(num_stack)\\n f_stack.append((k, int(num)))\\n num_stack = []\\n if b_stack and b_stack[-1][0] == k: # check k is smae level\\n f_stack.append(b_stack.pop())\\n # print(f_stack, b_stack)\\n print(list(_[1] for _ in f_stack))\\n \\n stack = []\\n for k, c in f_stack:\\n if c == '+':\\n n2 = stack.pop()\\n n1 = stack.pop()\\n stack.append(n1 + n2)\\n elif c == '-':\\n n2 = stack.pop()\\n n1 = stack.pop()\\n stack.append(n1 - n2)\\n elif c == 'n':\\n n1 = stack.pop()\\n stack.append(-n1)\\n else:\\n stack.append(c)\\n\\n return stack[0]\\n\",\n \"memory\": \"33433\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n stack = []\\n parsed = re.findall(r\\\"(\\\\()|(\\\\))|(\\\\+)|(-)|([0-9]+)\\\",s)\\n for open_par, close_par, plus, minus, num in parsed:\\n if open_par:\\n stack.append('(')\\n if num:\\n if stack and stack[-1]=='-':\\n stack.pop()\\n stack.append(-int(num))\\n else:\\n stack.append(int(num))\\n if close_par:\\n result = 0\\n while stack[-1]!='(':\\n result += stack.pop()\\n stack.pop()\\n if stack and stack[-1]=='-':\\n stack.pop()\\n stack.append(-result)\\n else:\\n stack.append(result)\\n if minus:\\n stack.append('-')\\n return sum(stack)\\n\\n\\n \\n \\n \",\n \"memory\": \"35319\"\n },\n {\n \"code\": \"class Expr:\\n def __init__(self):\\n self.tokens = []\\n self.ops = []\\n\\n def ingest(self, iter):\\n for t in iter:\\n match t:\\n case '+':\\n self.ops.append(lambda x, y: x + y)\\n case '-':\\n self.ops.append(lambda x, y: x - y)\\n case '(':\\n nestedExpr = Expr()\\n nestedExpr.ingest(iter)\\n self.tokens.append(nestedExpr)\\n case ')':\\n return\\n case _:\\n self.tokens.append(t)\\n return self\\n\\n def valueOf(self, token):\\n if isinstance(token, Expr):\\n return token.eval()\\n return token\\n\\n def eval(self):\\n curr = self.valueOf(self.tokens[0])\\n for i in range(len(self.ops)):\\n curr = self.ops[i](curr, self.valueOf(self.tokens[i + 1]))\\n return curr\\n\\nclass Solution:\\n def tokenize(self, s: str) -> list[str]: \\n numAcc = ''\\n tokens = []\\n expectingExpression = True\\n for c in s:\\n match c:\\n case '+':\\n if numAcc:\\n n = int(numAcc)\\n tokens.append(n)\\n numAcc = ''\\n tokens.append(c)\\n expectingExpression = True\\n case '-':\\n if numAcc:\\n n = int(numAcc)\\n tokens.append(n)\\n tokens.append(c)\\n numAcc = '' \\n expectingExpression = True\\n elif expectingExpression:\\n tokens.append(0)\\n tokens.append(c)\\n else:\\n tokens.append(c)\\n \\n case '(':\\n if numAcc:\\n n = int(numAcc)\\n tokens.append(n)\\n numAcc = ''\\n tokens.append(c)\\n expectingExpression = True\\n case ')':\\n if numAcc:\\n n = int(numAcc)\\n tokens.append(n)\\n numAcc = ''\\n tokens.append(c)\\n expectingExpression = False\\n case ' ':\\n if numAcc:\\n n = int(numAcc)\\n tokens.append(n)\\n numAcc = ''\\n expectingExpression = False\\n case _:\\n numAcc += c\\n if numAcc:\\n tokens.append(int(numAcc))\\n \\n return tokens\\n\\n\\n def calculate(self, s: str) -> int:\\n tokens = self.tokenize(s)\\n return Expr().ingest((t for t in tokens)).eval()\\n \",\n \"memory\": \"35948\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, expression: str) -> int:\\n \\\"\\\"\\\"Recursive descent.\\n \\\"\\\"\\\"\\n OPERATORS = {\\n \\\"+\\\": lambda a, b: a + b,\\n \\\"-\\\": lambda a, b: a - b,\\n \\\"*\\\": lambda a, b: a * b,\\n \\\"/\\\": lambda a, b: a / b,\\n }\\n def parse(token_stack: list[tuple[str | int, int]]) -> int:\\n negate = 1\\n if token_stack[-1][0] == \\\"-\\\":\\n token_stack.pop()\\n negate = -1\\n \\n # Descend!\\n val = negate * parse_operand(token_stack)\\n\\n # Keep reading more operands and operators until the token stream is ended.\\n # Or this context is over and an end paren ) is found.\\n while len(token_stack) > 0 and token_stack[-1][0] != \\\")\\\":\\n op, pos = token_stack.pop()\\n assert op in \\\"+-*/\\\", f\\\"Expected operator at pos {pos}\\\"\\n\\n # Descend!\\n val2 = parse_operand(token_stack)\\n try:\\n val = OPERATORS[op](val, val2)\\n except KeyError:\\n raise RuntimeError(f\\\"Unknown operator {op} at pos {pos}\\\")\\n\\n return val\\n\\n def parse_operand(token_stack: list[tuple[str | int, int]]) -> int:\\n top, pos = token_stack.pop()\\n if isinstance(top, int):\\n return top\\n if top == '(':\\n val = parse(token_stack)\\n top, pos = token_stack.pop()\\n assert top == ')', f\\\"No end paren at pos {pos}\\\"\\n return val\\n raise RuntimeError(f\\\"Expected paren ( or integer at pos {pos}\\\")\\n\\n token_stack: list[tuple[str | int, int]] = []\\n current_int: tuple[list[str], int] = ([], -1)\\n # The sharp/octothorpe/pound/number symbol # is the end of input\\n for pos, char in enumerate(expression + \\\"#\\\"):\\n if char in \\\"0123456789\\\":\\n if not current_int[0]:\\n current_int = ([], pos)\\n # Join all integer characters\\n current_int[0].append(char)\\n elif current_int[0]:\\n # Read an entire int\\n val = int(\\\"\\\".join(current_int[0]))\\n token_stack.append((val, current_int[1]))\\n current_int = ([], -1)\\n # Skip chars\\n if char == \\\" \\\":\\n continue\\n # Each operator is a single token, even -\\n if char in \\\"()+*/-\\\":\\n # Since there are no consecutive operators, we don't need lookahead\\n token_stack.append((char, pos))\\n # First tokens are now at the end where they are removed with .pop()\\n token_stack.reverse()\\n return parse(token_stack)\\n\",\n \"memory\": \"36576\"\n },\n {\n \"code\": \"from enum import Enum\\n\\n\\nclass Token:\\n class TokenType(Enum):\\n NUM = 0\\n LEFT_PAR = 1\\n RIGHT_PAR = 2\\n NEG = 3\\n PLUS = 4\\n\\n def __init__(self, token_type, val):\\n self.token_type = token_type\\n self.val = val\\n\\n def __repr__(self):\\n # return \\\"[{}:{}]\\\".format(self.token_type.name, str(self.val))\\n return str(self.val)\\n\\nclass Solution:\\n def genToken(self, s) -> List[Token]:\\n tokens = []\\n\\n i = 0\\n while i < len(s):\\n c = s[i]\\n if c == '(':\\n tokens.append(Token(Token.TokenType.LEFT_PAR, c))\\n i += 1\\n elif c == ')':\\n tokens.append(Token(Token.TokenType.RIGHT_PAR, c))\\n i += 1\\n elif c == '-':\\n if len(tokens) == 0 or tokens[-1].token_type == Token.TokenType.LEFT_PAR:\\n tokens.append(Token(Token.TokenType.NUM, 0))\\n\\n tokens.append(Token(Token.TokenType.NEG, c))\\n i += 1\\n elif c == ' ':\\n i += 1\\n pass\\n elif c.isdigit():\\n end_i = i+1\\n while end_i < len(s) and s[end_i].isdigit():\\n end_i += 1\\n val = int(s[i : end_i])\\n i = end_i\\n tokens.append(Token(Token.TokenType.NUM, val))\\n elif c == '+':\\n tokens.append(Token(Token.TokenType.PLUS, c))\\n i += 1\\n else:\\n print(\\\"Unknown char: \\\", c)\\n i += 1\\n\\n return tokens\\n \\n def toPostPrefix(self, tokens):\\n pass\\n queue = []\\n stack = []\\n\\n for token in tokens:\\n if token.token_type == Token.TokenType.NUM:\\n queue.append(token)\\n elif token.token_type == Token.TokenType.LEFT_PAR:\\n stack.append(token)\\n elif token.token_type == Token.TokenType.RIGHT_PAR:\\n while stack[-1].token_type != Token.TokenType.LEFT_PAR:\\n queue.append(stack.pop())\\n\\n # Pop \\\"(\\\"\\n stack.pop()\\n elif token.token_type in [Token.TokenType.NEG, Token.TokenType.PLUS]:\\n if stack and (stack[-1].token_type in [Token.TokenType.NEG, Token.TokenType.PLUS] ):\\n queue.append(stack.pop())\\n stack.append(token)\\n\\n while stack:\\n queue.append(stack.pop())\\n\\n return queue\\n\\n def evalPost(self, tokens):\\n stack = []\\n\\n for token in tokens:\\n if token.token_type == Token.TokenType.NUM:\\n stack.append(token.val)\\n elif token.token_type in [Token.TokenType.NEG, Token.TokenType.PLUS]:\\n \\n right = stack.pop()\\n left = stack.pop()\\n val = 0\\n if token.token_type == Token.TokenType.NEG:\\n val = left - right\\n else:\\n val = left + right\\n stack.append(val)\\n else:\\n print(\\\"Unknown token in evalPost\\\", token)\\n\\n return stack[-1]\\n \\n\\n\\n def calculate(self, s: str) -> int:\\n tokens = self.genToken(s)\\n # print(tokens)\\n\\n tokens = self.toPostPrefix(tokens)\\n # print(tokens)\\n \\n num = 0\\n num = self.evalPost(tokens)\\n \\n\\n return num\",\n \"memory\": \"37205\"\n },\n {\n \"code\": \"from dataclasses import dataclass\\n\\n# -\\n# +\\n# + 3 (3)\\n# 1 2\\n\\n# 1 + 2 + 3 - (3 - (1 + 8)) + 5 + 9\\n\\nclass TreeNode:\\n def __init__(self, val=None, left=None, right=None):\\n self.left = left\\n self.right = right\\n self.val = val\\n\\n def empty(self):\\n return self.val is None and self.left is None and self.right is None\\n\\n def eval(self):\\n\\n if self.val is None:\\n return self.left.eval()\\n\\n if isinstance(self.val, int):\\n return self.val\\n\\n if self.right is None:\\n return self.left.eval()\\n else:\\n if self.val == '+':\\n return self.left.eval() + self.right.eval()\\n elif self.val == '-':\\n if self.right is None:\\n return -self.left.eval()\\n return self.left.eval() - self.right.eval()\\n\\n\\n# +\\n# 1 ()\\n# 1 + 2 + 3\\n# Support only single digit integers\\n# do not support unary - operations\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n curr_node = TreeNode()\\n stack = []\\n i = 0\\n n = len(s)\\n\\n while i < n:\\n if s[i] == ')':\\n # Finished constructing the subnode.\\n sub_node = curr_node\\n curr_node = stack.pop()\\n\\n if curr_node.left is None:\\n curr_node.left = sub_node\\n else:\\n curr_node.right = sub_node\\n elif s[i] == '(':\\n # ( is only valid if we have a fresh node on top, or a - node with right side empty\\n new_node = TreeNode()\\n stack.append(curr_node)\\n curr_node = new_node\\n elif s[i] in '+-':\\n if s[i] == '-' and curr_node.empty():\\n curr_node.left = TreeNode(0)\\n curr_node.val = '-'\\n else:\\n # in all cases we need to fork the current operation to the left, and figure out the right side later.\\n # Stack cannot be empty as +- for now cannot be used as unary)\\n new_node = TreeNode()\\n new_node.left = curr_node\\n new_node.val = s[i]\\n curr_node = new_node\\n elif s[i].isdigit():\\n\\n j = 0\\n while i + j < len(s) and s[i + j].isdigit():\\n j += 1\\n\\n # on a number either fill in the value for the current node\\n # or if the node is an open node of state\\n # root\\n # LEFT {{EMTPY}}\\n # fill in the number directly to the right side.\\n curr_val = int(s[i:i + j])\\n\\n if curr_node.val is not None:\\n assert curr_node.right is None\\n new_node = TreeNode()\\n new_node.val = curr_val\\n curr_node.right = new_node\\n else:\\n assert curr_node.left is None\\n curr_node.val = curr_val\\n\\n i += j - 1\\n\\n i += 1\\n\\n return curr_node.eval()\\n\\n\\n\",\n \"memory\": \"37834\"\n },\n {\n \"code\": \"class Expr:\\n def __init__(self, value: str, left: 'Expr' = None, right: 'Expr' = None):\\n self.value = value\\n self.left = left\\n self.right = right\\n\\n # def toString(self):\\n # s = self.value\\n # hasLeft = self.left is not None\\n # hasRight = self.right is not None\\n # if not (hasLeft or hasRight):\\n # return s\\n # s += \\\"(\\\"\\n # if hasLeft:\\n # s += self.left.toString()\\n # if hasRight:\\n # s += \\\" \\\"\\n # s += self.right.toString()\\n # s += \\\")\\\"\\n # return s\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n root = Parser(s).parse()\\n #print(root.toString())\\n return self.evaluate(root)\\n\\n def evaluate(self, expr: Expr) -> int:\\n if expr.value.isdigit():\\n return int(expr.value)\\n elif expr.value == '-':\\n if expr.right is None:\\n return -self.evaluate(expr.left)\\n else:\\n return self.evaluate(expr.left) - self.evaluate(expr.right)\\n elif expr.value == '+':\\n return self.evaluate(expr.left) + self.evaluate(expr.right)\\n elif expr.value == '/':\\n return self.evaluate(expr.left) / self.evaluate(expr.right)\\n elif expr.value == '*':\\n return self.evaluate(expr.left) * self.evaluate(expr.right) \\n\\nclass Parser:\\n def __init__(self, tokens: str):\\n self.tokens = tokens\\n self.current = 0\\n\\n def parse(self) -> Expr:\\n return self.term()\\n \\n def term(self) -> Expr:\\n expr = self.factor()\\n matched, token = self.tryMatch(\\\"+-\\\")\\n while matched:\\n right = self.factor()\\n expr = Expr(token, expr, right)\\n matched, token = self.tryMatch(\\\"+-\\\")\\n return expr\\n\\n def factor(self) -> Expr:\\n expr = self.negative()\\n matched, token = self.tryMatch(\\\"*/\\\")\\n while matched:\\n right = self.negative()\\n expr = Expr(token, expr, right)\\n matched, token = self.tryMatch(\\\"*/\\\")\\n return expr\\n\\n def negative(self) -> Expr:\\n if self.match(\\\"-\\\"):\\n return Expr(\\\"-\\\", self.group())\\n return self.group()\\n\\n def group(self) -> Expr:\\n if self.match(\\\"(\\\"):\\n expr = self.parse()\\n self.pop()\\n return expr\\n return self.number()\\n\\n def number(self) -> Expr:\\n s = \\\"\\\"\\n while self.peek() is not None and self.peek().isdigit():\\n s += self.pop()\\n return Expr(s)\\n \\n def tryMatch(self, template:str) -> (bool, str):\\n for c in template:\\n if self.peek() == c:\\n self.current += 1\\n return True, c\\n return False, None\\n\\n def match(self, token:str) -> str:\\n if self.peek() == token:\\n self.current += 1\\n return True\\n return False\\n\\n def pop(self) -> str:\\n self.token = self.peek()\\n self.current += 1\\n return self.token\\n\\n def peek(self) -> str:\\n self.trim()\\n if self.current >= len(self.tokens):\\n return None\\n return self.tokens[self.current]\\n\\n def trim(self):\\n while (self.current < len(self.tokens) and \\n self.tokens[self.current] == ' '):\\n self.current += 1\\n\",\n \"memory\": \"38463\"\n },\n {\n \"code\": \"class Expr:\\n def __init__(self, value: str, left: 'Expr' = None, right: 'Expr' = None):\\n self.value = value\\n self.left = left\\n self.right = right\\n\\n # def toString(self):\\n # s = self.value\\n # hasLeft = self.left is not None\\n # hasRight = self.right is not None\\n # if not (hasLeft or hasRight):\\n # return s\\n # s += \\\"(\\\"\\n # if hasLeft:\\n # s += self.left.toString()\\n # if hasRight:\\n # s += \\\" \\\"\\n # s += self.right.toString()\\n # s += \\\")\\\"\\n # return s\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n root = Parser(s).parse()\\n #print(root.toString())\\n return self.evaluate(root)\\n\\n def evaluate(self, expr: Expr) -> int:\\n if expr.value.isdigit():\\n return int(expr.value)\\n elif expr.value == '-':\\n if expr.right is None:\\n return -self.evaluate(expr.left)\\n else:\\n return self.evaluate(expr.left) - self.evaluate(expr.right)\\n elif expr.value == '+':\\n return self.evaluate(expr.left) + self.evaluate(expr.right)\\n elif expr.value == '/':\\n return self.evaluate(expr.left) / self.evaluate(expr.right)\\n elif expr.value == '*':\\n return self.evaluate(expr.left) * self.evaluate(expr.right) \\n\\nclass Parser:\\n def __init__(self, tokens: str):\\n self.tokens = tokens\\n self.current = 0\\n\\n def parse(self) -> Expr:\\n return self.term()\\n \\n def term(self) -> Expr:\\n expr = self.factor()\\n matched, token = self.tryMatch(\\\"+-\\\")\\n while matched:\\n right = self.factor()\\n expr = Expr(token, expr, right)\\n matched, token = self.tryMatch(\\\"+-\\\")\\n return expr\\n\\n def factor(self) -> Expr:\\n expr = self.negative()\\n matched, token = self.tryMatch(\\\"*/\\\")\\n while matched:\\n right = self.negative()\\n expr = Expr(token, expr, right)\\n matched, token = self.tryMatch(\\\"*/\\\")\\n return expr\\n\\n def negative(self) -> Expr:\\n if self.match(\\\"-\\\"):\\n return Expr(\\\"-\\\", self.group())\\n return self.group()\\n\\n def group(self) -> Expr:\\n if self.match(\\\"(\\\"):\\n expr = self.parse()\\n self.pop()\\n return expr\\n return self.number()\\n\\n def number(self) -> Expr:\\n s = \\\"\\\"\\n while self.peek() is not None and self.peek().isdigit():\\n s += self.pop()\\n return Expr(s)\\n \\n def tryMatch(self, template:str) -> (bool, str):\\n for c in template:\\n if self.peek() == c:\\n self.current += 1\\n return True, c\\n return False, None\\n\\n def match(self, token:str) -> str:\\n if self.peek() == token:\\n self.current += 1\\n return True\\n return False\\n\\n def pop(self) -> str:\\n self.token = self.peek()\\n self.current += 1\\n return self.token\\n\\n def peek(self) -> str:\\n self.trim()\\n if self.current >= len(self.tokens):\\n return None\\n return self.tokens[self.current]\\n\\n def trim(self):\\n while (self.current < len(self.tokens) and \\n self.tokens[self.current] == ' '):\\n self.current += 1\\n\",\n \"memory\": \"38463\"\n },\n {\n \"code\": \"class Token:\\n def __init__(self, val, left=None, right=None):\\n self.left = left\\n self.right = right\\n self.val = val\\n\\n def evaluate(self):\\n left = right = 0\\n if self.left:\\n left = self.left.evaluate()\\n if self.right:\\n right = self.right.evaluate()\\n\\n if self.val == \\\"(\\\":\\n return right\\n elif self.val == \\\"+\\\":\\n return left + right\\n elif self.val == \\\"-\\\":\\n return left - right\\n return int(self.val)\\n\\n def __str__(self):\\n left = self.left if self.left else \\\"\\\"\\n right = self.right if self.right else \\\"\\\"\\n return f\\\"{left}{self.val}{right}\\\"\\n\\ndef handle_simple_expr(tokens):\\n char = tokens.pop()\\n if char == \\\"-\\\":\\n return Token(\\\"-\\\", right=handle_simple_expr(tokens))\\n if char == \\\"(\\\" or char == \\\")\\\":\\n new_token = handle_complex_expr(tokens)\\n # Assumed to be )\\n tokens.pop()\\n elif char.isnumeric():\\n new_token = Token(char)\\n else:\\n return None\\n return new_token\\n\\ndef handle_complex_expr(tokens):\\n left = handle_simple_expr(tokens)\\n while tokens:\\n # char = tokens.pop()\\n next_char = tokens[-1] if tokens else None\\n if next_char and next_char == \\\"+\\\" or next_char == \\\"-\\\":\\n # this is wrong\\n tokens.pop()\\n right = handle_simple_expr(tokens)\\n left = Token(next_char, left, right)\\n else:\\n break\\n\\n return left\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n tokens = list(reversed(re.findall((\\\"[\\\\d]+|[+\\\\-()]\\\"), s)))\\n\\n left = handle_complex_expr(tokens)\\n\\n return left.evaluate()\",\n \"memory\": \"39091\"\n },\n {\n \"code\": \"class Token:\\n def __init__(self, val, type, priority, op_type=None) -> None:\\n self.val = val\\n self.type = type\\n self.priority = priority\\n self.op_type = op_type\\n\\ndef is_number(c):\\n numbers = {'1','2','3','4','5','6','7','8','9','0'}\\n\\n return c in numbers\\n\\n\\ndef tokenizer(s):\\n i = 0\\n tokens = []\\n\\n while i < len(s):\\n\\n if s[i] == ' ':\\n i += 1\\n continue\\n\\n if is_number(s[i]):\\n number = s[i]\\n i += 1\\n while i < len(s) and is_number(s[i]):\\n number += s[i]\\n i += 1\\n tokens.append(Token(number, 'NUM', 10))\\n continue\\n\\n elif s[i] == '+':\\n tokens.append(Token(s[i], 'OPERATION', 50, 'BINARY'))\\n elif s[i] == '-':\\n if len(tokens) == 0 or (tokens[-1].type != 'NUM' and tokens[-1].type != 'BR'):\\n tokens.append(Token(s[i], 'OPERATION', 100, 'UNARY'))\\n else:\\n tokens.append(Token(s[i], 'OPERATION', 50, 'BINARY'))\\n elif s[i] == '*' or s[i] == '/':\\n tokens.append(Token(s[i], 'OPERATION', 60, 'BINARY'))\\n elif s[i] == '(':\\n tokens.append(Token(s[i], 'BL', 15))\\n elif s[i] == ')':\\n tokens.append(Token(s[i], 'BR', 15))\\n\\n\\n i += 1\\n\\n return tokens\\n\\n\\n\\ndef to_rpn(tokens):\\n expr = []\\n stack = []\\n\\n for tok in tokens:\\n if tok.type == 'NUM':\\n expr.append(tok)\\n elif tok.type == 'OPERATION':\\n if tok.op_type == 'UNARY':\\n stack.append(tok)\\n elif tok.op_type == 'BINARY':\\n while len(stack) > 0 and stack[-1].priority >= tok.priority:\\n expr.append(stack.pop())\\n stack.append(tok)\\n elif tok.type == 'BL':\\n stack.append(tok)\\n elif tok.type == 'BR':\\n while stack[-1].val != '(':\\n expr.append(stack.pop())\\n stack.pop()\\n\\n while len(stack) > 0:\\n expr.append(stack.pop())\\n\\n return expr\\n\\ndef evaluate(expr):\\n calc = []\\n for val in expr:\\n if val.type == 'NUM':\\n calc.append(int(val.val))\\n else:\\n if val.val == '+':\\n calc.append((calc.pop()) + (calc.pop()))\\n elif val.val == '-' and val.op_type == 'BINARY':\\n calc.append(-(calc.pop()) + (calc.pop()))\\n elif val.val == '-' and val.op_type == 'UNARY':\\n calc.append(-(calc.pop()))\\n elif val.val == '*':\\n calc.append((calc.pop()) * (calc.pop()))\\n elif val.val == '/':\\n calc.append(int(1 / (calc.pop()) * (calc.pop())))\\n\\n return calc[0]\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n return int(evaluate(to_rpn(tokenizer(s))))\\n\",\n \"memory\": \"39720\"\n },\n {\n \"code\": \"class Add:\\n def __init__(self,left,right):\\n self.left = left\\n self.right = right\\n \\n def eval(self):\\n return self.left.eval() + self.right.eval()\\n\\nclass Neg:\\n def __init__(self,num):\\n self.num = num\\n \\n def eval(self):\\n return - self.num.eval()\\n\\nclass Num:\\n def __init__(self,num):\\n self.num = int(num)\\n \\n def eval(self):\\n return self.num\\n\\nclass Parser:\\n valid_ops = set(['+','-'])\\n brackets = set(['(',')'])\\n\\n def is_op_or_bracket(self,char):\\n return char in self.valid_ops or char in self.brackets\\n\\n def __init__(self,s):\\n s = s.replace(\\\" \\\",\\\"\\\")\\n symbols = []\\n start = 0\\n for i,char in enumerate(s):\\n if char in self.valid_ops or char in self.brackets:\\n if start != i:\\n symbols.append(s[start:i])\\n symbols.append(s[i])\\n start = i + 1\\n if start < len(s):\\n symbols.append(s[start:])\\n self.symbols = symbols\\n print(self.symbols)\\n\\n def find_closing_bracket(self,start):\\n count = 1 if self.symbols[start] == '(' else 0\\n start += 1\\n while start < len (self.symbols) and count > 0:\\n if self.symbols[start] == '(':\\n count += 1\\n if self.symbols[start] == ')':\\n count -= 1\\n if count > 0:\\n start += 1\\n return start\\n\\n def parse(self, start = None, end = None) -> Add|Neg|Num:\\n if start == None:\\n return self.parse(0,len(self.symbols))\\n stack = []\\n op_stack = []\\n i = start\\n while i < end:\\n if self.symbols[i] == '-' and len(stack) == 0:\\n stack.append(Num(0))\\n if self.symbols[i] in self.valid_ops:\\n op_stack.append(self.symbols[i])\\n elif self.symbols[i] in self.brackets:\\n j = self.find_closing_bracket(i)\\n stack.append(self.parse(i+1,j))\\n i = j\\n else:\\n stack.append(Num(self.symbols[i]))\\n if len(op_stack) > 0 and len(stack) > 1:\\n op = op_stack.pop()\\n right = stack.pop()\\n left = stack.pop()\\n if op == '-':\\n stack.append(Add(left,Neg(right)))\\n else:\\n stack.append(Add(left,right))\\n i += 1\\n return stack.pop()\\n \\n\\n\\nclass Solution:\\n \\n def calculate(self, s: str) -> int:\\n \\n parser = Parser(s)\\n\\n expr = parser.parse()\\n\\n return expr.eval()\",\n \"memory\": \"40349\"\n },\n {\n \"code\": \"from dataclasses import dataclass\\n\\n@dataclass\\nclass Expression:\\n def evaluate(self):\\n raise NotImplementedError()\\n\\n # @classmethod\\n # def list_from_tokens(cls, tokens: List[str]) -> Tuple[\\\"Expression\\\", List[str]]:\\n # assert len(tokens) > 0\\n # if tokens[0] == \\\"-\\\":\\n # sub_expression, leftover_tokens = Expression.from_tokens(tokens[1:])\\n # return Negation(sub_expression), leftover_tokens\\n # elif tokens[0] == \\\"(\\\":\\n # end_paren = len(tokens) - 1\\n # while tokens[end_paren] != \\\")\\\":\\n # end_paren -= 1\\n # return Sum()\\n\\n @classmethod\\n def from_tokens(\\n cls,\\n tokens: List[str],\\n first: int,\\n last: int,\\n ) -> List[\\\"Expression\\\"]:\\n if first == last:\\n return []\\n\\n if isinstance(tokens[first], int):\\n return [Number(value=tokens[first])] + Expression.from_tokens(tokens, first + 1, last)\\n elif tokens[first] == \\\"-\\\":\\n remaining_expressions = Expression.from_tokens(tokens, first + 1, last)\\n remaining_expressions[0] = Negation(remaining_expressions[0])\\n return remaining_expressions\\n elif tokens[first] == \\\"(\\\":\\n stack_depth = 0\\n for end_paren_pos in range(first, last + 1):\\n if tokens[end_paren_pos] == \\\"(\\\":\\n stack_depth += 1\\n elif tokens[end_paren_pos] == \\\")\\\":\\n stack_depth -= 1\\n if stack_depth == 0:\\n break\\n expressions_from_remaining = Expression.from_tokens(tokens, end_paren_pos+1, last)\\n paren_part = Sum(sub_expressions=Expression.from_tokens(\\n tokens,\\n first + 1,\\n end_paren_pos\\n ))\\n return [paren_part] + expressions_from_remaining\\n raise ValueError(f\\\"How did my list of tokens become {tokens}?\\\")\\n \\n\\n@dataclass\\nclass Number(Expression):\\n value: int\\n def evaluate(self):\\n return self.value\\n def __repr__(self):\\n return str(self.value)\\n\\n@dataclass\\nclass Sum(Expression):\\n sub_expressions: List[\\\"Expression\\\"]\\n def evaluate(self):\\n return sum(sub_expression.evaluate() for sub_expression in self.sub_expressions)\\n def __repr__(self):\\n return \\\"(\\\" + \\\" + \\\".join(str(sub_expression) for sub_expression in self.sub_expressions) + \\\")\\\"\\n\\n\\n@dataclass\\nclass Negation(Expression):\\n sub_expression: \\\"Expression\\\"\\n def evaluate(self):\\n return -self.sub_expression.evaluate()\\n\\n def __repr__(self):\\n return \\\"-\\\" + str(self.sub_expression)\\n\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n tokens = []\\n digits = set(\\\"0123456789\\\")\\n other = set(\\\"()-\\\")\\n for i, c in enumerate(s):\\n if c in digits:\\n if i == 0 or s[i-1] not in digits:\\n tokens.append(0)\\n tokens[-1] = tokens[-1] * 10 + int(c)\\n elif c in other:\\n tokens.append(c)\\n if len(tokens) == 0:\\n return 0\\n tokens = [\\\"(\\\"] + tokens + [\\\")\\\"]\\n expression = Expression.from_tokens(tokens, 0, len(tokens))\\n return expression[0].evaluate()\\n \",\n \"memory\": \"40978\"\n },\n {\n \"code\": \"INF = float('inf')\\nEPS = 1e-6\\nDUMMY = '?'\\n\\nclass Node:\\n def __init__(self, val=0, op='', pri=0):\\n self.val = val\\n self.op = op\\n self.pri = pri\\n self.left = None\\n self.right = None\\n def __repr__(self,):\\n lstr = f\\\"\\\\nL{self.left}\\\" if self.left else \\\"\\\"\\n rstr = f\\\"\\\\nR{self.right}\\\" if self.right else \\\"\\\"\\n return f\\\"{self.val},{self.op},{self.pri}{lstr}{rstr}\\\"\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n c2pri = {\\\"+\\\":1,\\\"-\\\":1, DUMMY:-INF}\\n s = s.strip()\\n if s[0] == '-': # ex. '-1'\\n s = \\\"0\\\"+s\\n stack = [] # monotomic inc\\n num = 0\\n base_pri = 0\\n for i in range(len(s)):\\n c = s[i]\\n \\n if c.isdigit():\\n num = num*10+int(c) # don't continue !\\n if i == len(s)-1: # careful !!!\\n c = DUMMY # use dummy to clear stack!\\n if c.isdigit():\\n continue\\n if c==\\\" \\\":\\n continue\\n elif c == '(':\\n base_pri += 10\\n elif c == ')':\\n base_pri -= 10\\n else: # + - ? ; // [prev, nd, op]\\n nd = Node(val=num, pri=INF)\\n num = 0\\n stack.append(nd) # mono inc stack !\\n op = Node(op=c, pri = base_pri+c2pri[c]-i*EPS)\\n # min-tree: max of left-smaller and right-smaller is parent\\n while stack and stack[-1].pri >= op.pri:\\n prev = stack.pop() # [-1, prev, op]\\n if stack:\\n if stack[-1].pri >= op.pri:\\n # don't link to op, keep backwards! op could be dummy\\n stack[-1].right = prev\\n else:\\n op.left = prev\\n else:\\n op.left = prev\\n stack.append(op)\\n root = stack[-1].left\\n return self.post(root)\\n \\n def post(self,node):\\n if node.left is None and node.right is None:\\n return node.val\\n l = self.post(node.left)\\n r = self.post(node.right)\\n if node.op == \\\"+\\\":\\n return l+r\\n elif node.op == \\\"-\\\":\\n return l-r\\n\\n\\\"\\\"\\\"\\nhttps://leetcode.com/problems/basic-calculator/solutions/1456850/python-basic-calculator-i-ii-iii-easy-solution-detailed-explanation/\\n\\\"\\\"\\\"\\n\",\n \"memory\": \"41606\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n lexer = Lexer(s)\\n parser = Parser(lexer)\\n parse_tree = parser.parse(None)\\n print(parse_tree)\\n interpreter = Interpreter(parse_tree)\\n return interpreter.eval()\\n\\nclass Lexer:\\n def __init__(self, expr: str):\\n self.expr = expr\\n self.i = 0\\n def parse_num(self) -> str:\\n num = \\\"\\\"\\n while self.i < len(self.expr) and self.expr[self.i].isdigit() :\\n num += self.expr[self.i]\\n self.i += 1\\n return num\\n def next_token(self) -> str:\\n if self.i == len(self.expr):\\n return \\\"\\\"\\n\\n ch = self.expr[self.i]\\n if ch == \\\" \\\":\\n self.i += 1 ; return self.next_token()\\n elif ch.isdigit():\\n num = self.parse_num()\\n return num\\n elif ch in ['+', '-', '(', ')']:\\n self.i += 1 ; return ch\\n\\nclass num_node:\\n def __init__(self, num):\\n self.num = num\\n def __repr__(self):\\n return f'{self.num}'\\nclass add_node:\\n def __init__(self, left, right):\\n self.left = left\\n self.right = right\\n def __repr__(self):\\n return f'{self.left}+{self.right}'\\nclass subtract_node:\\n def __init__(self, left, right):\\n self.left = left\\n self.right = right\\n def __repr__(self):\\n return f'{self.left}-{self.right}'\\nclass negate_node:\\n def __init__(self, parse_tree):\\n self.parse_tree = parse_tree\\n def __repr__(self):\\n return f' -{self.parse_tree}'\\nclass group_node:\\n def __init__(self, parse_tree):\\n self.parse_tree = parse_tree\\n def __repr__(self):\\n return f'({self.parse_tree})'\\nparse_node = num_node | add_node | subtract_node | negate_node | group_node\\nclass Parser:\\n def __init__(self, lexer):\\n self.lexer = lexer\\n def next_node(self, last_node) -> parse_node:\\n token = self.lexer.next_token()\\n if token == \\\"\\\":\\n return None\\n elif token == \\\")\\\":\\n return None\\n elif token.isnumeric():\\n return num_node(int(token))\\n elif token == \\\"+\\\":\\n return add_node(last_node, self.next_node(None))\\n elif token == \\\"-\\\":\\n if last_node is None:\\n return negate_node(self.next_node(None))\\n else:\\n return subtract_node(last_node, self.next_node(None))\\n elif token == \\\"(\\\":\\n return group_node(self.parse(None))\\n\\n def parse(self, parse_tree: parse_node) -> parse_node:\\n node = self.next_node(parse_tree)\\n if node is None:\\n return parse_tree\\n else:\\n return self.parse(node)\\n \\nclass Interpreter:\\n def __init__(self, parse_tree):\\n self.parse_tree = parse_tree\\n def eval(self) -> int:\\n return self.eval_pt(self.parse_tree)\\n def eval_pt(self, parse_tree: parse_node) -> int:\\n if isinstance(parse_tree, num_node):\\n return parse_tree.num\\n elif isinstance(parse_tree, add_node):\\n return self.eval_pt(parse_tree.left) + self.eval_pt(parse_tree.right)\\n elif isinstance(parse_tree, subtract_node):\\n return self.eval_pt(parse_tree.left) - self.eval_pt(parse_tree.right)\\n elif isinstance(parse_tree, negate_node):\\n return -1 * self.eval_pt(parse_tree.parse_tree)\\n elif isinstance(parse_tree, group_node):\\n return self.eval_pt(parse_tree.parse_tree)\",\n \"memory\": \"42235\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n lexer = Lexer(s)\\n parser = Parser(lexer)\\n parse_tree = parser.parse(None)\\n print(parse_tree)\\n interpreter = Interpreter(parse_tree)\\n return interpreter.eval()\\n\\nclass Lexer:\\n def __init__(self, expr: str):\\n self.expr = expr\\n self.i = 0\\n def parse_num(self) -> str:\\n num = \\\"\\\"\\n while self.i < len(self.expr) and self.expr[self.i].isdigit() :\\n num += self.expr[self.i]\\n self.i += 1\\n return num\\n def next_token(self) -> str:\\n if self.i == len(self.expr):\\n return \\\"\\\"\\n\\n ch = self.expr[self.i]\\n if ch == \\\" \\\":\\n self.i += 1 ; return self.next_token()\\n elif ch.isdigit():\\n num = self.parse_num()\\n return num\\n elif ch in ['+', '-', '(', ')']:\\n self.i += 1 ; return ch\\n\\nclass num_node:\\n def __init__(self, num):\\n self.num = num\\n def __repr__(self):\\n return f'{self.num}'\\nclass add_node:\\n def __init__(self, left, right):\\n self.left = left\\n self.right = right\\n def __repr__(self):\\n return f'{self.left}+{self.right}'\\nclass subtract_node:\\n def __init__(self, left, right):\\n self.left = left\\n self.right = right\\n def __repr__(self):\\n return f'{self.left}-{self.right}'\\nclass negate_node:\\n def __init__(self, parse_tree):\\n self.parse_tree = parse_tree\\n def __repr__(self):\\n return f' -{self.parse_tree}'\\nclass group_node:\\n def __init__(self, parse_tree):\\n self.parse_tree = parse_tree\\n def __repr__(self):\\n return f'({self.parse_tree})'\\nparse_node = num_node | add_node | subtract_node | negate_node | group_node\\nclass Parser:\\n def __init__(self, lexer):\\n self.lexer = lexer\\n def next_node(self, last_node) -> parse_node:\\n token = self.lexer.next_token()\\n if token == \\\"\\\":\\n return None\\n elif token == \\\")\\\":\\n return None\\n elif token.isnumeric():\\n return num_node(int(token))\\n elif token == \\\"+\\\":\\n return add_node(last_node, self.next_node(None))\\n elif token == \\\"-\\\":\\n if last_node is None:\\n return negate_node(self.next_node(None))\\n else:\\n return subtract_node(last_node, self.next_node(None))\\n elif token == \\\"(\\\":\\n return group_node(self.parse(None))\\n\\n def parse(self, parse_tree: parse_node) -> parse_node:\\n node = self.next_node(parse_tree)\\n if node is None:\\n return parse_tree\\n else:\\n return self.parse(node)\\n \\nclass Interpreter:\\n def __init__(self, parse_tree):\\n self.parse_tree = parse_tree\\n def eval(self) -> int:\\n return self.eval_pt(self.parse_tree)\\n def eval_pt(self, parse_tree: parse_node) -> int:\\n if isinstance(parse_tree, num_node):\\n return parse_tree.num\\n elif isinstance(parse_tree, add_node):\\n return self.eval_pt(parse_tree.left) + self.eval_pt(parse_tree.right)\\n elif isinstance(parse_tree, subtract_node):\\n return self.eval_pt(parse_tree.left) - self.eval_pt(parse_tree.right)\\n elif isinstance(parse_tree, negate_node):\\n return -1 * self.eval_pt(parse_tree.parse_tree)\\n elif isinstance(parse_tree, group_node):\\n return self.eval_pt(parse_tree.parse_tree)\",\n \"memory\": \"42864\"\n },\n {\n \"code\": \"from abc import ABC, abstractmethod\\nfrom dataclasses import dataclass\\nfrom typing import Callable, Iterable, Literal, TypeAlias, assert_never\\n\\nTokenTypes: TypeAlias = Literal[\\n \\\"Number\\\", \\\"Plus\\\", \\\"Minus\\\", \\\"LeftParenthesis\\\", \\\"RightParenthesis\\\", \\\"EOF\\\"\\n]\\nLiteralValue: TypeAlias = int\\n\\n\\n@dataclass\\nclass Token:\\n token_type: TokenTypes\\n lexeme: str\\n position: int\\n literal: LiteralValue | None\\n\\n\\nclass Lexer:\\n def __init__(self, source: str):\\n self.source = source\\n self.start = 0\\n self.current = 0\\n return super().__init__()\\n\\n def exhausted(self):\\n return self.current >= len(self.source)\\n\\n def _consume(self):\\n return self.source[self._advance()]\\n\\n def _peek(self):\\n return None if self.exhausted() else self.source[self.current]\\n\\n def _advance(self):\\n self.current = (current := self.current) + 1\\n return current\\n\\n def _make(\\n self, token_type: TokenTypes, parse: Callable[[str], LiteralValue] | None = None\\n ):\\n lexeme = self._lexeme()\\n literal = None if parse is None else parse(lexeme)\\n return Token(token_type, lexeme, self.start, literal)\\n\\n def _lexeme(self):\\n return self.source[self.start : self.current]\\n\\n def __iter__(self):\\n return self\\n\\n def __next__(self):\\n while not self.exhausted():\\n if (token := self._get()) is not None:\\n return token\\n raise StopIteration\\n\\n def _get(self):\\n self.start = self.current\\n match (consumed := self._consume()):\\n case \\\" \\\":\\n return None\\n case \\\"(\\\":\\n return self._make(\\\"LeftParenthesis\\\")\\n case \\\")\\\":\\n return self._make(\\\"RightParenthesis\\\")\\n case \\\"+\\\":\\n return self._make(\\\"Plus\\\")\\n case \\\"-\\\":\\n return self._make(\\\"Minus\\\")\\n case d if d.isdigit():\\n while (peek := self._peek()) is not None and peek.isdigit():\\n self._advance()\\n return self._make(\\\"Number\\\", int)\\n case other:\\n raise ValueError(f\\\"Invalid token {other!r}!\\\")\\n assert_never(consumed)\\n\\n\\nclass Expression(ABC):\\n @abstractmethod\\n def evaluate(self) -> int: ...\\n\\n @abstractmethod\\n def __str__(self) -> str: ...\\n\\n\\nclass NumberLiteral(Expression):\\n def __init__(self, value: int):\\n self.value = value\\n return super().__init__()\\n\\n def evaluate(self) -> int:\\n return self.value\\n\\n def __str__(self) -> str:\\n return str(self.value)\\n\\n\\nclass UnaryExpression(Expression):\\n def __init__(self, expr: Expression, operator: Token):\\n self.expr = expr\\n self.operator = operator\\n return super().__init__()\\n\\n def evaluate(self) -> int:\\n value = self.expr.evaluate()\\n match (token_type := self.operator.token_type):\\n case \\\"Minus\\\":\\n return -value\\n case other:\\n raise Exception(f\\\"Invalid unary expression token {other!r}!\\\")\\n assert_never(token_type)\\n\\n def __str__(self) -> str:\\n return f\\\"({self.operator.token_type} {self.expr})\\\"\\n\\n\\nclass BinaryExpression(Expression):\\n def __init__(self, left: Expression, operator: Token, right: Expression):\\n self.left = left\\n self.operator = operator\\n self.right = right\\n return super().__init__()\\n\\n def evaluate(self) -> int:\\n left = self.left.evaluate()\\n right = self.right.evaluate()\\n match (token_type := self.operator.token_type):\\n case \\\"Plus\\\":\\n return left + right\\n case \\\"Minus\\\":\\n return left - right\\n case other:\\n raise Exception(f\\\"Invalid binary expression token {other!r}!\\\")\\n assert_never(token_type)\\n\\n def __str__(self) -> str:\\n return f\\\"({self.operator.token_type} {self.left} {self.right})\\\"\\n\\n\\nclass ParseException(Exception):\\n def __init__(self, token: Token | None, message: str, *args: object):\\n self.token = token\\n super().__init__(message, *args)\\n\\n\\nclass Parser:\\n def __init__(self, tokens: Iterable[Token]):\\n self.tokens = iter(tokens)\\n self._exhausted = False\\n self._peeked = None\\n return super().__init__()\\n\\n def _match_any(self, *expected: TokenTypes):\\n for exp in expected:\\n if (matched := self._match(exp)) is not None:\\n return matched\\n return None\\n\\n def _match(self, expected: TokenTypes):\\n if self._exhausted:\\n return None\\n if (token := self._peek()) is not None and token.token_type == expected:\\n return self._advance()\\n return None\\n\\n def _peek(self):\\n if (peeked := self._peeked) is not None:\\n return peeked\\n peeked = self._advance()\\n self._peeked = peeked\\n return peeked\\n\\n def _advance(self):\\n if (peeked := self._peeked) is not None:\\n self._peeked = None\\n return peeked\\n try:\\n return next(self.tokens)\\n except StopIteration:\\n return None\\n\\n def _left_assoc(self, read: Callable[[], Expression], *infix: TokenTypes):\\n expr = read()\\n while (matched := self._match_any(*infix)) is not None:\\n right = read()\\n expr = BinaryExpression(expr, matched, right)\\n return expr\\n\\n def consume(self, expected: TokenTypes):\\n if (matched := self._match(expected)) is None:\\n peek = self._peek()\\n gotten = \\\"nothing\\\" if peek is None else peek.token_type\\n raise ParseException(peek, f\\\"Expected {expected}, but got {gotten}!\\\")\\n return matched\\n\\n def expression(self) -> Expression:\\n return self.term()\\n\\n def term(self):\\n return self._left_assoc(self.unary, \\\"Plus\\\", \\\"Minus\\\")\\n\\n def unary(self) -> Expression:\\n if (matched := self._match_any(\\\"Minus\\\")) is not None:\\n expr = self.unary()\\n return UnaryExpression(expr, matched)\\n return self.primary()\\n\\n def primary(self):\\n if self._match(\\\"LeftParenthesis\\\") is not None:\\n expr = self.expression()\\n self.consume(\\\"RightParenthesis\\\")\\n return expr\\n number = self.consume(\\\"Number\\\")\\n if (literal := number.literal) is None:\\n raise Exception(\\\"Found number token without literal!\\\")\\n return NumberLiteral(literal)\\n\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n lexer = Lexer(s)\\n parser = Parser(lexer)\\n try:\\n expr = parser.expression()\\n except ParseException as e:\\n if (token := e.token) is not None:\\n start = token.position\\n end = start + len(token.lexeme)\\n highlight = f\\\"{s[:start]} > {s[start:end]} < {s[end:]}\\\"\\n e.add_note(f\\\"Error at: {highlight}\\\")\\n raise e\\n return expr.evaluate()\\n\",\n \"memory\": \"43493\"\n },\n {\n \"code\": \"from abc import ABC, abstractmethod\\nfrom dataclasses import dataclass\\nfrom typing import Callable, Iterable, Literal, TypeAlias, assert_never\\n\\nTokenTypes: TypeAlias = Literal[\\n \\\"Number\\\", \\\"Plus\\\", \\\"Minus\\\", \\\"LeftParenthesis\\\", \\\"RightParenthesis\\\", \\\"EOF\\\"\\n]\\nLiteralValue: TypeAlias = int\\n\\n\\n@dataclass\\nclass Token:\\n token_type: TokenTypes\\n lexeme: str\\n position: int\\n literal: LiteralValue | None\\n\\n\\nclass Lexer:\\n def __init__(self, source: str):\\n self.source = source\\n self.start = 0\\n self.current = 0\\n return super().__init__()\\n\\n def exhausted(self):\\n return self.current >= len(self.source)\\n\\n def _consume(self):\\n return self.source[self._advance()]\\n\\n def _peek(self):\\n return None if self.exhausted() else self.source[self.current]\\n\\n def _advance(self):\\n self.current = (current := self.current) + 1\\n return current\\n\\n def _make(\\n self, token_type: TokenTypes, parse: Callable[[str], LiteralValue] | None = None\\n ):\\n lexeme = self._lexeme()\\n literal = None if parse is None else parse(lexeme)\\n return Token(token_type, lexeme, self.start, literal)\\n\\n def _lexeme(self):\\n return self.source[self.start : self.current]\\n\\n def __iter__(self):\\n return self\\n\\n def __next__(self):\\n while not self.exhausted():\\n if (token := self._get()) is not None:\\n return token\\n raise StopIteration\\n\\n def _get(self):\\n self.start = self.current\\n match (consumed := self._consume()):\\n case \\\" \\\":\\n return None\\n case \\\"(\\\":\\n return self._make(\\\"LeftParenthesis\\\")\\n case \\\")\\\":\\n return self._make(\\\"RightParenthesis\\\")\\n case \\\"+\\\":\\n return self._make(\\\"Plus\\\")\\n case \\\"-\\\":\\n return self._make(\\\"Minus\\\")\\n case d if d.isdigit():\\n while (peek := self._peek()) is not None and peek.isdigit():\\n self._advance()\\n return self._make(\\\"Number\\\", int)\\n case other:\\n raise ValueError(f\\\"Invalid token {other!r}!\\\")\\n assert_never(consumed)\\n\\n\\nclass Expression(ABC):\\n @abstractmethod\\n def evaluate(self) -> int: ...\\n\\n @abstractmethod\\n def __str__(self) -> str: ...\\n\\n\\nclass NumberLiteral(Expression):\\n def __init__(self, value: int):\\n self.value = value\\n return super().__init__()\\n\\n def evaluate(self) -> int:\\n return self.value\\n\\n def __str__(self) -> str:\\n return str(self.value)\\n\\n\\nclass UnaryExpression(Expression):\\n def __init__(self, expr: Expression, operator: Token):\\n self.expr = expr\\n self.operator = operator\\n return super().__init__()\\n\\n def evaluate(self) -> int:\\n value = self.expr.evaluate()\\n match (token_type := self.operator.token_type):\\n case \\\"Minus\\\":\\n return -value\\n case other:\\n raise Exception(f\\\"Invalid unary expression token {other!r}!\\\")\\n assert_never(token_type)\\n\\n def __str__(self) -> str:\\n return f\\\"({self.operator.token_type} {self.expr})\\\"\\n\\n\\nclass BinaryExpression(Expression):\\n def __init__(self, left: Expression, operator: Token, right: Expression):\\n self.left = left\\n self.operator = operator\\n self.right = right\\n return super().__init__()\\n\\n def evaluate(self) -> int:\\n left = self.left.evaluate()\\n right = self.right.evaluate()\\n match (token_type := self.operator.token_type):\\n case \\\"Plus\\\":\\n return left + right\\n case \\\"Minus\\\":\\n return left - right\\n case other:\\n raise Exception(f\\\"Invalid binary expression token {other!r}!\\\")\\n assert_never(token_type)\\n\\n def __str__(self) -> str:\\n return f\\\"({self.operator.token_type} {self.left} {self.right})\\\"\\n\\n\\nclass ParseException(Exception):\\n def __init__(self, token: Token | None, message: str, *args: object):\\n self.token = token\\n super().__init__(message, *args)\\n\\n\\nclass Parser:\\n def __init__(self, tokens: Iterable[Token]):\\n self.tokens = iter(tokens)\\n self._exhausted = False\\n self._peeked = None\\n return super().__init__()\\n\\n def _match_any(self, *expected: TokenTypes):\\n for exp in expected:\\n if (matched := self._match(exp)) is not None:\\n return matched\\n return None\\n\\n def _match(self, expected: TokenTypes):\\n if self._exhausted:\\n return None\\n if (token := self._peek()) is not None and token.token_type == expected:\\n return self._advance()\\n return None\\n\\n def _peek(self):\\n if (peeked := self._peeked) is not None:\\n return peeked\\n peeked = self._advance()\\n self._peeked = peeked\\n return peeked\\n\\n def _advance(self):\\n if (peeked := self._peeked) is not None:\\n self._peeked = None\\n return peeked\\n try:\\n return next(self.tokens)\\n except StopIteration:\\n return None\\n\\n def _left_assoc(self, read: Callable[[], Expression], *infix: TokenTypes):\\n expr = read()\\n while (matched := self._match_any(*infix)) is not None:\\n right = read()\\n expr = BinaryExpression(expr, matched, right)\\n return expr\\n\\n def consume(self, expected: TokenTypes):\\n if (matched := self._match(expected)) is None:\\n peek = self._peek()\\n gotten = \\\"nothing\\\" if peek is None else peek.token_type\\n raise ParseException(peek, f\\\"Expected {expected}, but got {gotten}!\\\")\\n return matched\\n\\n def expression(self) -> Expression:\\n return self.term()\\n\\n def term(self):\\n return self._left_assoc(self.unary, \\\"Plus\\\", \\\"Minus\\\")\\n\\n def unary(self) -> Expression:\\n if (matched := self._match_any(\\\"Minus\\\")) is not None:\\n expr = self.unary()\\n return UnaryExpression(expr, matched)\\n return self.primary()\\n\\n def primary(self):\\n if self._match(\\\"LeftParenthesis\\\") is not None:\\n expr = self.expression()\\n self.consume(\\\"RightParenthesis\\\")\\n return expr\\n number = self.consume(\\\"Number\\\")\\n if (literal := number.literal) is None:\\n raise Exception(\\\"Found number token without literal!\\\")\\n return NumberLiteral(literal)\\n\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n lexer = Lexer(s)\\n parser = Parser(lexer)\\n try:\\n expr = parser.expression()\\n except ParseException as e:\\n if (token := e.token) is not None:\\n start = token.position\\n end = start + len(token.lexeme)\\n highlight = f\\\"{s[:start]} > {s[start:end]} < {s[end:]}\\\"\\n e.add_note(f\\\"Error at: {highlight}\\\")\\n raise e\\n return expr.evaluate()\\n\\n\\ndef main():\\n solution = Solution()\\n assert solution.calculate(\\\"1 + 1\\\") == 2\\n assert solution.calculate(\\\" 2-1 + 2 \\\") == 3\\n assert solution.calculate(\\\"(1+(4+5+2)-3)+(6+8)\\\") == 23\\n assert solution.calculate(\\\"-(4+5)\\\") == -9\\n try:\\n solution.calculate(\\\"(1+((4+5+2)-3)+(6+8)\\\")\\n raise Exception(\\\"Expected a parse exception!\\\")\\n except ParseException as e:\\n assert e.args[0] == \\\"Expected RightParenthesis, but got nothing!\\\"\\n\\n\\nif __name__ == \\\"__main__\\\":\\n main()\\n\",\n \"memory\": \"44121\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n # step 1: tokenize\\n tokens = []\\n i = 0\\n while i < len(s):\\n if s[i] == '(':\\n tokens.append({\\n 'token_type': 'LPAREN',\\n 'lexeme': '('\\n })\\n i += 1\\n elif s[i] == ')':\\n tokens.append({\\n 'token_type': 'RPAREN',\\n 'lexeme': ')'\\n })\\n i += 1\\n elif s[i] in '+-':\\n tokens.append({\\n 'token_type': 'OP',\\n 'lexeme': s[i]\\n })\\n i += 1\\n elif s[i].isdigit():\\n number = ''\\n while i < len(s) and s[i].isdigit():\\n number += s[i]\\n i += 1\\n tokens.append({\\n 'token_type': 'NUM',\\n 'lexeme': int(number)\\n })\\n else: # space\\n i += 1\\n\\n # step 2: parse\\n pos = 0\\n def parseAtom():\\n nonlocal pos\\n if tokens[pos]['token_type'] == 'OP' and tokens[pos]['lexeme'] == '-':\\n pos += 1\\n return -parseAtom()\\n elif tokens[pos]['token_type'] == 'NUM':\\n val = tokens[pos]['lexeme']\\n pos += 1\\n return val\\n elif tokens[pos]['lexeme'] == '(':\\n pos += 1\\n res = parseExpr()\\n pos += 1\\n return res\\n \\n def parseExpr():\\n nonlocal pos\\n res = parseAtom()\\n while pos < len(tokens) and tokens[pos]['token_type'] == 'OP':\\n operator = tokens[pos]['lexeme']\\n pos += 1\\n if operator == '+':\\n res += parseAtom()\\n else:\\n res -= parseAtom()\\n return res\\n return parseExpr()\",\n \"memory\": \"44750\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n # step 1: tokenize\\n tokens = []\\n i = 0\\n while i < len(s):\\n if s[i] == '(':\\n tokens.append({\\n 'token_type': 'LPAREN',\\n 'lexeme': '('\\n })\\n i += 1\\n elif s[i] == ')':\\n tokens.append({\\n 'token_type': 'RPAREN',\\n 'lexeme': ')'\\n })\\n i += 1\\n elif s[i] in '+-':\\n tokens.append({\\n 'token_type': 'OP',\\n 'lexeme': s[i]\\n })\\n i += 1\\n elif s[i].isdigit():\\n number = ''\\n while i < len(s) and s[i].isdigit():\\n number += s[i]\\n i += 1\\n tokens.append({\\n 'token_type': 'NUM',\\n 'lexeme': int(number)\\n })\\n else: # space\\n i += 1\\n\\n # step 2: parse\\n pos = 0\\n def parseAtom():\\n nonlocal pos\\n if tokens[pos]['token_type'] == 'OP' and tokens[pos]['lexeme'] == '-':\\n pos += 1\\n return -parseAtom()\\n elif tokens[pos]['token_type'] == 'NUM':\\n val = tokens[pos]['lexeme']\\n pos += 1\\n return val\\n elif tokens[pos]['lexeme'] == '(':\\n pos += 1\\n res = parseExpr()\\n pos += 1\\n return res\\n \\n def parseExpr():\\n nonlocal pos\\n res = parseAtom()\\n while pos < len(tokens) and tokens[pos]['token_type'] == 'OP':\\n operator = tokens[pos]['lexeme']\\n pos += 1\\n if operator == '+':\\n res += parseAtom()\\n else:\\n res -= parseAtom()\\n return res\\n return parseExpr()\",\n \"memory\": \"45379\"\n },\n {\n \"code\": \"import ast\\nimport re\\nimport sys\\nsys.setrecursionlimit(100000)\\n\\nclass ExprNode:\\n def __init__(self, child1, child2):\\n self.children = [child1, child2]\\n def __str__(self):\\n return(\\\"Expression\\\")\\n\\nclass TermNode:\\n def __init__(self, op, child1, child2):\\n self.children = [child1, child2]\\n self.op = op\\n def __str__(self):\\n if self.op == \\\"+\\\":\\n return(\\\"Term PLUS\\\")\\n else:\\n return(\\\"Term MINUS\\\")\\n\\nclass BaseNode:\\n def __init__(self, child, val=None):\\n self.children = [child]\\n self.val = val\\n def __str__(self):\\n if self.val == None:\\n return(\\\"Parenthesis\\\")\\n else:\\n return(\\\"Number \\\" + str(self.val))\\n\\nclass Parser:\\n def __init__(self, tokens):\\n self.tokens = tokens\\n self.cur = 0\\n def expr(self):\\n curtoken = self.tokens[self.cur]\\n if curtoken.isdigit():\\n self.cur += 1\\n node = self.term()\\n if not node:\\n return BaseNode(None, int(curtoken))\\n else:\\n return ExprNode(BaseNode(None, int(curtoken)), node)\\n else:\\n b_node = self.base()\\n t_node = self.term()\\n return ExprNode(b_node, t_node)\\n def term(self):\\n if self.cur >= len(self.tokens) - 1:\\n return None\\n curtoken = self.tokens[self.cur]\\n if curtoken in [\\\"+\\\", \\\"-\\\"]:\\n self.cur += 1\\n nexttoken = self.tokens[self.cur]\\n if nexttoken.isdigit():\\n self.cur += 1\\n node = self.term()\\n return TermNode(curtoken, BaseNode(None, int(nexttoken)), node)\\n else:\\n b_node = self.base()\\n t_node = self.term()\\n return TermNode(curtoken, b_node, t_node)\\n else:\\n return None\\n\\n def base(self):\\n if self.tokens[self.cur] == \\\"(\\\":\\n self.cur += 1\\n node = self.expr()\\n if self.tokens[self.cur] != \\\")\\\":\\n print(\\\"Syntax Error: No matching right parenthesis\\\")\\n return None\\n self.cur += 1\\n return BaseNode(node)\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n def lexer(s):\\n expression = re.sub(r'\\\\s+', \\\"\\\", s)\\n expression = re.findall(r'\\\\d+|[\\\\(\\\\)+-]', expression)\\n formatted = []\\n for e in expression:\\n if e == \\\"-\\\" and (not formatted or formatted[-1] == \\\"(\\\"):\\n formatted.append(\\\"0\\\")\\n formatted.append(e)\\n return formatted\\n def print_nodes(n, lvl=0):\\n if not n:\\n return\\n print(\\\" \\\" * lvl, end=\\\"\\\")\\n print(\\\"|\\\", end=\\\"\\\")\\n print(\\\"--\\\" * lvl, end=\\\"\\\")\\n print(n)\\n \\n for c in n.children:\\n print_nodes(c, lvl+1)\\n \\n rpn = []\\n def emit_rpn(n):\\n if not n:\\n return\\n if type(n) == TermNode:\\n if n.children[0].val != None:\\n rpn.append(n.children[0].val)\\n rpn.append(n.op)\\n else:\\n emit_rpn(n.children[0])\\n rpn.append(n.op)\\n emit_rpn(n.children[1])\\n\\n elif type(n) == BaseNode:\\n if n.val != None:\\n rpn.append(n.val)\\n else:\\n emit_rpn(n.children[0])\\n\\n else:\\n emit_rpn(n.children[0])\\n emit_rpn(n.children[1])\\n \\n def evaluate_rpn(rpns):\\n stack = []\\n for token in rpns :\\n if token == '+':\\n a , b = stack.pop() , stack.pop()\\n stack.append( a + b ) \\n elif token == '-':\\n a , b = stack.pop() , stack.pop()\\n stack.append( b - a ) \\n else:\\n stack.append(token) \\n return stack.pop() \\n \\n ps = Parser(lexer(s))\\n res = ps.expr()\\n emit_rpn(res)\\n return evaluate_rpn(rpn)\",\n \"memory\": \"46008\"\n },\n {\n \"code\": \"import ast\\nimport re\\nimport sys\\nsys.setrecursionlimit(100000)\\n\\nclass ExprNode:\\n def __init__(self, child1, child2):\\n self.children = [child1, child2]\\n def __str__(self):\\n return(\\\"Expression\\\")\\n\\nclass TermNode:\\n def __init__(self, op, child1, child2):\\n self.children = [child1, child2]\\n self.op = op\\n def __str__(self):\\n if self.op == \\\"+\\\":\\n return(\\\"Term PLUS\\\")\\n else:\\n return(\\\"Term MINUS\\\")\\n\\nclass BaseNode:\\n def __init__(self, child, val=None):\\n self.children = [child]\\n self.val = val\\n def __str__(self):\\n if self.val == None:\\n return(\\\"Parenthesis\\\")\\n else:\\n return(\\\"Number \\\" + str(self.val))\\n\\nclass Parser:\\n def __init__(self, tokens):\\n self.tokens = tokens\\n self.cur = 0\\n def expr(self):\\n curtoken = self.tokens[self.cur]\\n if curtoken.isdigit():\\n self.cur += 1\\n node = self.term()\\n if not node:\\n return BaseNode(None, int(curtoken))\\n else:\\n return ExprNode(BaseNode(None, int(curtoken)), node)\\n else:\\n # left parenthesis case\\n b_node = self.base()\\n t_node = self.term()\\n return ExprNode(b_node, t_node)\\n def term(self):\\n if self.cur >= len(self.tokens) - 1:\\n return None\\n curtoken = self.tokens[self.cur]\\n if curtoken in [\\\"+\\\", \\\"-\\\"]:\\n self.cur += 1\\n nexttoken = self.tokens[self.cur]\\n if nexttoken.isdigit():\\n self.cur += 1\\n node = self.term()\\n return TermNode(curtoken, BaseNode(None, int(nexttoken)), node)\\n else:\\n b_node = self.base()\\n t_node = self.term()\\n return TermNode(curtoken, b_node, t_node)\\n else:\\n return None\\n\\n # parses the parenthesis case only\\n def base(self):\\n if self.tokens[self.cur] == \\\"(\\\":\\n self.cur += 1\\n node = self.expr()\\n if self.tokens[self.cur] != \\\")\\\":\\n print(\\\"Syntax Error: No matching right parenthesis\\\")\\n return None\\n self.cur += 1\\n return BaseNode(node)\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n def lexer(s):\\n expression = re.sub(r'\\\\s+', \\\"\\\", s)\\n expression = re.findall(r'\\\\d+|[\\\\(\\\\)+-]', expression)\\n formatted = []\\n for e in expression:\\n if e == \\\"-\\\" and (not formatted or formatted[-1] == \\\"(\\\"):\\n formatted.append(\\\"0\\\")\\n formatted.append(e)\\n return formatted\\n def print_nodes(n, lvl=0):\\n if not n:\\n return\\n print(\\\" \\\" * lvl, end=\\\"\\\")\\n print(\\\"|\\\", end=\\\"\\\")\\n print(\\\"--\\\" * lvl, end=\\\"\\\")\\n print(n)\\n \\n for c in n.children:\\n print_nodes(c, lvl+1)\\n \\n rpn = []\\n def emit_rpn(n):\\n if not n:\\n return\\n if type(n) == TermNode:\\n if n.children[0].val != None:\\n rpn.append(n.children[0].val)\\n rpn.append(n.op)\\n else:\\n emit_rpn(n.children[0])\\n rpn.append(n.op)\\n emit_rpn(n.children[1])\\n\\n\\n elif type(n) == BaseNode:\\n if n.val != None:\\n rpn.append(n.val)\\n else:\\n emit_rpn(n.children[0])\\n\\n else:\\n emit_rpn(n.children[0])\\n emit_rpn(n.children[1])\\n \\n def evaluate_rpn(rpns):\\n stack = []\\n for token in rpns :\\n if token == '+' :\\n a , b = stack.pop() , stack.pop()\\n stack.append( a + b ) \\n elif token == '-':\\n a , b = stack.pop() , stack.pop()\\n stack.append( b - a ) \\n else:\\n stack.append(token) \\n return stack.pop() \\n \\n ps = Parser(lexer(s))\\n res = ps.expr()\\n emit_rpn(res)\\n return evaluate_rpn(rpn)\",\n \"memory\": \"46636\"\n },\n {\n \"code\": \"from typing import Optional\\n\\n\\nclass Number:\\n def __init__(self, value):\\n self.value = value\\n\\n def __repr__(self) -> str:\\n return f\\\"N[{self.value}]\\\"\\n\\nclass Operator:\\n def __init__(self, operator):\\n self.operator = operator\\n\\n def __repr__(self) -> str:\\n return f\\\"O[{self.operator}]\\\"\\n\\nclass Parenthesis:\\n def __init__(self, parenthesis):\\n self.parenthesis = parenthesis\\n\\n def __repr__(self) -> str:\\n return f\\\"P[{self.parenthesis}]\\\"\\n\\n\\nclass Node:\\n def __init__(self, operator: Optional[Operator] = None):\\n self.operator = operator\\n self.operands = []\\n\\n def calculate(self):\\n if self.operator is None:\\n a = self.operands[0]\\n return a.calculate() if isinstance(a, Node) else a\\n if self.operator.operator == '+':\\n a = self.operands[0]\\n b = self.operands[1]\\n aval = a.calculate() if isinstance(a, Node) else a\\n bval = b.calculate() if isinstance(b, Node) else b\\n return Number(aval.value + bval.value)\\n if self.operator.operator == '-':\\n a = self.operands[0]\\n aval = a.calculate() if isinstance(a, Node) else a\\n if len(self.operands) == 1:\\n return Number(-aval.value)\\n b = self.operands[1]\\n bval = b.calculate() if isinstance(b, Node) else b\\n return Number(aval.value - bval.value)\\n return None\\n\\n def __repr__(self):\\n return f\\\"Node[{self.operator} {self.operands}]\\\"\\n\\n\\ndef buildAST(tokens, pos, left_operand=None):\\n node = Node()\\n if left_operand:\\n node.operands.append(left_operand)\\n if pos >= len(tokens):\\n return node, pos\\n token = tokens[pos]\\n pos += 1\\n if isinstance(token, Parenthesis) and token.parenthesis == ')':\\n return left_operand, pos\\n if isinstance(token, Parenthesis) and token.parenthesis == '(':\\n operand, pos = buildAST(tokens, pos)\\n node.operands.append(operand)\\n elif isinstance(token, Number):\\n node.operands.append(token)\\n elif isinstance(token, Operator):\\n node.operator = token\\n\\n if pos >= len(tokens):\\n return node, pos\\n\\n if node.operator is None and isinstance(tokens[pos], Operator):\\n node.operator = tokens[pos]\\n pos += 1\\n\\n token = tokens[pos]\\n pos += 1\\n\\n if isinstance(token, Parenthesis) and token.parenthesis == ')':\\n return node, pos\\n if isinstance(token, Parenthesis) and token.parenthesis == '(':\\n operand, pos = buildAST(tokens, pos)\\n node.operands.append(operand)\\n elif isinstance(token, Number):\\n node.operands.append(token)\\n\\n if pos < len(tokens):\\n return buildAST(tokens, pos, node)\\n\\n return node, pos\\n\\n\\ndef parse_tokens(expr: str):\\n number = None\\n tokens = []\\n\\n for c in expr:\\n if c == ' ':\\n continue\\n if ord(c) >= ord('0') and ord(c) <= ord('9'):\\n number = number * 10 + int(c) if number is not None else int(c)\\n continue\\n if number is not None:\\n tokens.append(Number(number))\\n number = None\\n if c in ('(', ')'):\\n tokens.append(Parenthesis(c))\\n continue\\n if c in ('+', '-'):\\n tokens.append(Operator(c))\\n continue\\n if number is not None:\\n tokens.append(Number(number))\\n\\n return tokens\\n\\n\\nclass Solution:\\n def calculate(self, s: str) -> int:\\n tokens = parse_tokens(s)\\n node, _ = buildAST(tokens, 0)\\n return node.calculate().value\\n \",\n \"memory\": \"47265\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n sum = 0\\n index = 0\\n subtract = False\\n\\n while index < len(s):\\n if s[index] == \\\"(\\\":\\n num_brackets = 1\\n end = index\\n while end < len(s) and num_brackets != 0:\\n end += 1\\n if s[end] == \\\"(\\\":\\n num_brackets += 1\\n elif s[end] == \\\")\\\":\\n num_brackets -= 1\\n sub_sum = self.calculate(s[index+1:end])\\n if subtract and sub_sum < 0:\\n sum += (-sub_sum)\\n elif subtract and sub_sum >= 0:\\n sum -= sub_sum\\n else:\\n sum += sub_sum\\n if end-1 != index:\\n index = end-1\\n\\n elif s[index] == \\\"-\\\":\\n subtract = True\\n\\n elif s[index] == \\\"+\\\":\\n subtract = False\\n\\n elif s[index].isdigit():\\n end = index\\n while end < len(s) and s[end].isdigit():\\n end += 1\\n if subtract:\\n sum -= int(s[index:end])\\n else:\\n sum += int(s[index:end])\\n if end-1 != index:\\n index = end-1\\n index += 1\\n\\n return sum\\n\",\n \"memory\": \"47894\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n\\n def addSgn(sym, stack):\\n if sym == '+':\\n val = stack.pop()\\n val += stack.pop()\\n stack += [val]\\n # stack += ['+']\\n elif sym == '-':\\n if len(stack) >= 2:\\n val = stack.pop()\\n val2 = stack.pop() - val\\n stack += [val2]\\n # stack += ['-']\\n else:\\n stack[-1] = -stack[-1]\\n # stack += ['!']\\n\\n\\n def createPoliz(s):\\n stack = []\\n sgn = ''\\n flag = False\\n j = 0\\n for i, sym in enumerate(s):\\n if i < j:\\n continue\\n\\n if sym == ' ':\\n continue\\n\\n if sym == '(':\\n brcnt = 1\\n j = i + 1\\n while brcnt != 0:\\n if s[j] == '(':\\n brcnt += 1\\n if s[j] == ')':\\n brcnt -= 1\\n j += 1\\n else:\\n j -= 1\\n l = len(stack)\\n stack += createPoliz(s[i+1:j])\\n if l == 0 and sgn == '-':\\n stack[-1] = -stack[-1]\\n # stack += ['!']\\n elif sgn != '':\\n addSgn(sgn, stack)\\n sgn = ''\\n\\n if (sym >= '0' and sym <= '9'):\\n if (i+1 < len(s) and s[i+1] >= '0' and s[i+1] <= '9'):\\n num = sym\\n j = i + 1\\n while (j < len(s) and s[j] >= '0' and s[j] <= '9'):\\n num += s[j]\\n j += 1\\n sym = num\\n\\n stack += [int(sym)]\\n if sgn != '':\\n addSgn(sgn, stack)\\n sgn = ''\\n elif sym == '-' or sym == '+':\\n sgn = sym\\n \\n return stack\\n \\n\\n # def calculatePoliz(stack):\\n # nums = []\\n # while (len(stack) != 0):\\n # sym = stack.pop(0)\\n\\n # if (type(sym) == type(1)):\\n # nums += [sym]\\n\\n # elif sym == '-':\\n # val = nums.pop()\\n # val2 = nums.pop() - val\\n # nums += [val2]\\n\\n # elif sym == '+':\\n # val = nums.pop()\\n # val += nums.pop()\\n # nums += [val]\\n\\n # elif sym == '!':\\n # val = nums.pop()\\n # val = -val\\n # nums += [val]\\n \\n # return nums[0]\\n\\n return createPoliz(s)[0]\\n\\n \",\n \"memory\": \"48523\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n ret = 0\\n\\n openBracketCount = 0\\n openBracketIdx = -1\\n currOperand = \\\"\\\"\\n for i in range(len(s)):\\n if s[i] == \\\" \\\":\\n continue\\n if s[i] == \\\"(\\\":\\n openBracketCount += 1\\n if openBracketCount == 1:\\n openBracketIdx = i\\n continue\\n if s[i] == \\\")\\\":\\n openBracketCount -= 1\\n if openBracketCount == 0:\\n ret += self.calculate(s[openBracketIdx + 1: i]) if currOperand == \\\"\\\" else self.calculate(s[openBracketIdx + 1: i]) * -1\\n currOperand = \\\"\\\"\\n continue\\n if openBracketCount > 0:\\n continue\\n if s[i].isnumeric():\\n currOperand += s[i]\\n continue\\n if currOperand:\\n ret += int(currOperand)\\n currOperand = \\\"\\\" if s[i] == \\\"+\\\" else \\\"-\\\"\\n if currOperand:\\n ret += int(currOperand) \\n return ret\\n\\n \\n \\n \\n\\n\\n \\n\\n \",\n \"memory\": \"49151\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n if not s:\\n return 0\\n res, curr, index = 0, 0, 0\\n operator = '+'\\n while index < len(s):\\n if s[index].isdigit():\\n curr = curr * 10 + int(s[index])\\n if s[index] == '(':\\n startIndex = index\\n bracket_num = 1\\n while bracket_num > 0:\\n index += 1\\n if s[index] == '(':\\n bracket_num += 1\\n elif s[index] == ')':\\n bracket_num -= 1\\n curr = self.calculate(s[startIndex + 1 : index])\\n if s[index] in '+-' or index == len(s) - 1:\\n if operator == '+':\\n res += curr\\n elif operator == '-':\\n res -= curr\\n operator = s[index]\\n curr = 0\\n index += 1\\n return res\",\n \"memory\": \"49780\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n if not s:\\n return 0\\n res, curr, index = 0, 0, 0\\n operator = '+'\\n while index < len(s):\\n char = s[index]\\n if char.isdigit():\\n curr = curr * 10 + int(char)\\n if char == '(':\\n startIndex = index\\n bracketNum = 1\\n while bracketNum != 0:\\n index += 1\\n if s[index] == '(':\\n bracketNum += 1\\n elif s[index] == ')':\\n bracketNum -= 1\\n curr = self.calculate(s[startIndex + 1 : index])\\n if char in '+-' or index == len(s) - 1:\\n if operator == '+':\\n res += curr\\n elif operator == '-':\\n res -= curr\\n operator = char\\n curr = 0\\n index += 1\\n return res\",\n \"memory\": \"49780\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n ans = 0\\n\\n def str2int(num_str: str):\\n return 0 if num_str == \\\"\\\" else int(num_str)\\n \\n sign = +1\\n idx = 0\\n num_str = \\\"\\\"\\n while idx < len(s):\\n char = s[idx]\\n if char == \\\" \\\":\\n idx += 1\\n continue\\n elif char == '-':\\n ans += sign * str2int(num_str)\\n num_str = \\\"\\\"\\n sign = -1\\n elif char == \\\"+\\\":\\n ans += sign * str2int(num_str)\\n num_str = \\\"\\\"\\n sign = +1\\n elif char == \\\"(\\\":\\n counter = 1\\n close_idx = idx\\n while (counter > 0):\\n close_idx += 1\\n if s[close_idx] == \\\")\\\":\\n counter -= 1\\n elif s[close_idx] == \\\"(\\\":\\n counter += 1\\n \\n ans += sign * self.calculate(s[idx + 1:close_idx])\\n idx = close_idx\\n else:\\n num_str = num_str + char\\n idx += 1\\n \\n ans += sign * str2int(num_str)\\n \\n return ans\",\n \"memory\": \"50409\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n sign = 1\\n total = 0\\n currNum = 0\\n i = 0\\n while i < len(s):\\n ch = s[i]\\n if ch == '(':\\n pr = 1\\n start_idx = i\\n while pr > 0:\\n i += 1\\n if s[i] == '(':\\n pr += 1\\n elif s[i] == ')':\\n pr -= 1\\n total += sign * self.calculate(s[start_idx+1:i])\\n elif ch == '-':\\n total += sign * currNum\\n sign = -1\\n currNum = 0\\n elif ch == '+':\\n total += sign * currNum\\n sign = 1\\n currNum = 0\\n elif ch == ' ':\\n pass\\n else:\\n currNum = currNum * 10 + int(ch)\\n i += 1\\n total += sign * currNum\\n return total\\n\\n \",\n \"memory\": \"50409\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n res = 0\\n num = 0\\n sign = 1\\n i = 0\\n n = len(s)\\n \\n while i < n:\\n char = s[i]\\n if char.isnumeric():\\n num = num * 10 + int(char)\\n elif char in ['+', '-']:\\n res += num * sign\\n sign = 1 if char == '+' else -1\\n num = 0\\n elif char == '(':\\n j = i\\n balance = 0\\n while i < n:\\n if s[i] == '(':\\n balance += 1\\n if s[i] == ')':\\n balance -= 1\\n if balance == 0:\\n break\\n i += 1\\n num = self.calculate(s[j + 1:i])\\n i += 1\\n \\n return res + num * sign\\n\",\n \"memory\": \"51038\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n ans = 0\\n\\n s = s.replace(\\\" \\\", \\\"\\\")\\n\\n def str2int(num_str: str):\\n return 0 if num_str == \\\"\\\" else int(num_str)\\n \\n sign = +1\\n idx = 0\\n num_str = \\\"\\\"\\n while idx < len(s):\\n char = s[idx]\\n if char == '-':\\n ans += sign * str2int(num_str)\\n num_str = \\\"\\\"\\n sign = -1\\n elif char == \\\"+\\\":\\n ans += sign * str2int(num_str)\\n num_str = \\\"\\\"\\n sign = +1\\n elif char == \\\"(\\\":\\n counter = 1\\n close_idx = idx\\n while (counter > 0):\\n close_idx += 1\\n if s[close_idx] == \\\")\\\":\\n counter -= 1\\n elif s[close_idx] == \\\"(\\\":\\n counter += 1\\n \\n ans += sign * self.calculate(s[idx + 1:close_idx])\\n idx = close_idx\\n else:\\n num_str = num_str + char\\n idx += 1\\n \\n ans += sign * str2int(num_str)\\n \\n return ans\",\n \"memory\": \"51666\"\n },\n {\n \"code\": \"class Solution:\\n\\n def calculate(self, s: str) -> int:\\n res = 0\\n def add(x):\\n nonlocal res\\n res += x\\n def sub(x):\\n nonlocal res\\n res -= x\\n\\n i = 0\\n action = add\\n parsing_int = False\\n int_state = 0\\n while i < len(s):\\n ch = s[i]\\n\\n if parsing_int and not (ord('0') <= ord(ch) <= ord('9')):\\n action(int_state)\\n parsing_int = False\\n int_state = 0\\n\\n if ord('0') <= ord(ch) <= ord('9'):\\n parsing_int = True\\n int_state *= 10\\n int_state += int(ch)\\n elif s[i] == \\\"+\\\":\\n action = add\\n elif s[i] == \\\"-\\\":\\n action = sub\\n elif s[i] == \\\"(\\\":\\n pairs = 1\\n i += 1\\n begin = i\\n while pairs > 0:\\n if s[i] == \\\"(\\\":\\n pairs += 1\\n if s[i] == \\\")\\\":\\n pairs -= 1\\n if pairs > 0:\\n i += 1\\n action(self.calculate(s[begin:i]))\\n i += 1\\n if parsing_int:\\n action(int_state)\\n return res\\n \",\n \"memory\": \"51666\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, s: str) -> int:\\n re = 0\\n\\n i = 0\\n sign = 1\\n\\n nums = set(['1','2','3','4','5','6','7','8','9','0'])\\n\\n while i < len(s):\\n if s[i] == \\\" \\\" or s[i] == \\\"+\\\":\\n i += 1 \\n elif s[i] == \\\"(\\\":\\n i += 1\\n cur = i\\n stack = 1\\n while stack > 0:\\n if s[cur] == \\\"(\\\":\\n stack += 1\\n if s[cur] == \\\")\\\":\\n stack -= 1\\n cur += 1\\n re += sign * self.calculate(s[i:cur-1])\\n sign = 1\\n i = cur \\n elif s[i] == \\\"-\\\":\\n sign = -1\\n i += 1\\n else:\\n cur = i\\n while cur < len(s) and s[cur] in nums:\\n cur += 1\\n re += sign * int(s[i:cur])\\n sign = 1\\n i = cur\\n return re\\n\\n\",\n \"memory\": \"52295\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":77,"string":"77"}}},{"rowIdx":152,"cells":{"question_id":{"kind":"number","value":225,"string":"225"},"name":{"kind":"string","value":"implement-stack-using-queues"},"content":{"kind":"string","value":"<p>Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (<code>push</code>, <code>top</code>, <code>pop</code>, and <code>empty</code>).</p>\n\n<p>Implement the <code>MyStack</code> class:</p>\n\n<ul>\n\t<li><code>void push(int x)</code> Pushes element x to the top of the stack.</li>\n\t<li><code>int pop()</code> Removes the element on the top of the stack and returns it.</li>\n\t<li><code>int top()</code> Returns the element on the top of the stack.</li>\n\t<li><code>boolean empty()</code> Returns <code>true</code> if the stack is empty, <code>false</code> otherwise.</li>\n</ul>\n\n<p><b>Notes:</b></p>\n\n<ul>\n\t<li>You must use <strong>only</strong> standard operations of a queue, which means that only <code>push to back</code>, <code>peek/pop from front</code>, <code>size</code> and <code>is empty</code> operations are valid.</li>\n\t<li>Depending on your language, the queue may not be supported natively. You may simulate a queue using a list or deque (double-ended queue) as long as you use only a queue's standard operations.</li>\n</ul>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input</strong>\n["MyStack", "push", "push", "top", "pop", "empty"]\n[[], [1], [2], [], [], []]\n<strong>Output</strong>\n[null, null, null, 2, 2, false]\n\n<strong>Explanation</strong>\nMyStack myStack = new MyStack();\nmyStack.push(1);\nmyStack.push(2);\nmyStack.top(); // return 2\nmyStack.pop(); // return 2\nmyStack.empty(); // return False\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= x <= 9</code></li>\n\t<li>At most <code>100</code> calls will be made to <code>push</code>, <code>pop</code>, <code>top</code>, and <code>empty</code>.</li>\n\t<li>All the calls to <code>pop</code> and <code>top</code> are valid.</li>\n</ul>\n\n<p> </p>\n<p><strong>Follow-up:</strong> Can you implement the stack using only one queue?</p>\n"},"acRate":{"kind":"number","value":65.20465856089574,"string":"65.204659"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["stack","design","queue"],"string":"[\n \"stack\",\n \"design\",\n \"queue\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"13\", 0.0129], [\"14\", 0.0129], [\"15\", 0.0129], [\"16\", 0.0773], [\"18\", 0.0644], [\"19\", 0.1803], [\"20\", 0.2962], [\"21\", 0.2318], [\"22\", 0.5794], [\"23\", 0.7597], [\"24\", 1.1589], [\"25\", 1.0173], [\"26\", 2.2534], [\"27\", 1.8929], [\"28\", 3.232], [\"29\", 3.6055], [\"30\", 6.1808], [\"31\", 3.7471], [\"32\", 5.3824], [\"33\", 7.8805], [\"34\", 8.8463], [\"35\", 6.2323], [\"36\", 6.2709], [\"37\", 8.4471], [\"38\", 7.8419], [\"39\", 5.5627], [\"40\", 4.1849], [\"41\", 4.7772], [\"42\", 3.5668]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16200\", 0.0129], [\"16300\", 0.2447], [\"16400\", 4.5841], [\"16500\", 23.487], [\"16600\", 40.5099], [\"16700\", 25.573]]}"},"rt_list":{"kind":"list like","value":[{"code":"from collections import deque\n\nclass MyStack:\n\n def __init__(self):\n self.q = deque()\n\n def push(self, x: int) -> None:\n self.q.append(x)\n\n def pop(self) -> int:\n print(\"POP\")\n print(self.q)\n self.q.rotate(-1 * (len(self.q) - 1))\n print(self.q)\n return self.q.popleft()\n\n def top(self) -> int:\n print(\"TOP\")\n print(self.q)\n # print(len(self.q))\n i = -1 * (len(self.q) - 1)\n print(i)\n self.q.rotate(-1 * (len(self.q) - 1))\n print(\"loop over\")\n print(self.q)\n out = self.q.popleft()\n self.q.append(out)\n return out\n\n def empty(self) -> bool:\n return len(self.q) == 0\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()\n","runtime":"13"},{"code":"from collections import deque\nclass MyStack:\n\n def __init__(self):\n self.q=deque()\n\n def push(self, x: int) -> None:\n self.q.append(x)\n\n def pop(self) -> int:\n for i in range(len(self.q)-1):\n self.push(self.q.popleft())\n return self.q.popleft()\n\n def top(self) -> int:\n return self.q[-1]\n \n def empty(self) -> bool:\n return len(self.q)==0\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"14"},{"code":"class MyStack:\n\n def __init__(self):\n self.q = collections.deque()\n\n def push(self, x: int) -> None:\n self.q.append(x)\n for _ in range(len(self.q)-1):\n self.q.append(self.q.popleft())\n\n def pop(self) -> int:\n return self.q.popleft()\n\n def top(self) -> int:\n return self.q[0]\n\n def empty(self) -> bool:\n return len(self.q) == 0\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"15"},{"code":"class MyStack:\n\n def __init__(self):\n self.q = deque()\n\n def push(self, x: int) -> None:\n self.q.append(x)\n\n def pop(self) -> int:\n return self.q.pop()\n\n def top(self) -> int:\n return self.q[-1]\n\n def empty(self) -> bool:\n return not self.q\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"16"},{"code":"class MyStack:\n q1=deque\n def __init__(self): \n self.q1=deque()\n def push(self, x: int) -> None:\n self.q1.appendleft(x)\n\n def pop(self) -> int:\n return self.q1.popleft()\n\n def top(self) -> int:\n return self.q1[0]\n\n def empty(self) -> bool:\n print(self.q1, len(self.q1), len(self.q1)>0)\n return (len(self.q1)<1)\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"18"},{"code":"from collections import deque\n\nclass MyStack:\n\n def __init__(self):\n self.stack = deque()\n\n def push(self, x: int) -> None:\n self.stack.append(x)\n\n def pop(self) -> int:\n listLen = len(self.stack)\n for i in range(listLen):\n if i == listLen - 1:\n return self.stack.popleft()\n self.stack.append(self.stack.popleft())\n\n def top(self) -> int:\n return self.stack[-1]\n\n def empty(self) -> bool:\n return len(self.stack) == 0\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"19"},{"code":"class MyStack:\n def __init__(self):\n self.q = collections.deque()\n\n def push(self, x: int) -> None:\n self.q.append(x)\n for _ in range(len(self.q) - 1):\n self.q.append(self.q.popleft())\n\n def pop(self) -> int:\n return self.q.popleft()\n\n def top(self) -> int:\n return self.q[0]\n\n def empty(self) -> bool:\n return not self.q","runtime":"20"},{"code":"class MyStack:\n def __init__(self): self.arr = []\n def push(self, x: int) -> None: self.arr.append(x)\n def pop(self) -> int: return self.arr.pop(-1)\n def top(self) -> int: return self.arr[-1]\n def empty(self) -> bool: return len(self.arr) == 0","runtime":"20"},{"code":"from collections import deque\n\nclass MyStack:\n\n def __init__(self):\n self.queue = deque()\n\n def push(self, x: int) -> None:\n self.queue.append(x)\n\n def pop(self) -> int:\n for i in range(len(self.queue)):\n self.queue.append(self.queue.popleft())\n\n return self.queue.pop()\n\n def top(self) -> int:\n return self.queue[len(self.queue) - 1]\n\n def empty(self) -> bool:\n return len(self.queue) == 0\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"21"},{"code":"class MyStack:\n\n def __init__(self):\n self.queue1=[]\n self.queue2=[]\n\n def push(self, x: int) -> None:\n while self.queue1:\n self.queue2.append(self.queue1.pop(0))\n self.queue1.append(x)\n while self.queue2:\n self.queue1.append(self.queue2.pop(0)) \n\n def pop(self) -> int:\n return self.queue1.pop(0)\n\n def top(self) -> int:\n return self.queue1[0]\n\n def empty(self) -> bool:\n return len(self.queue1)==0\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"22"},{"code":"class MyStack:\n\n def __init__(self):\n self.arr1 = []\n \n\n def push(self, x: int) -> None:\n self.arr1.append(x)\n\n def pop(self) -> int:\n return self.arr1.pop()\n\n def top(self) -> int:\n if self.arr1:\n return self.arr1[len(self.arr1) - 1]\n \n\n def empty(self) -> bool:\n return not (self.arr1)\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"23"},{"code":"class MyStack:\n\n def __init__(self):\n self.q = []\n \n\n def push(self, x: int) -> None:\n self.q.insert(0,x)\n\n def pop(self) -> int:\n a = self.q[0]\n self.q = self.q[1:]\n return a\n \n\n def top(self) -> int:\n return self.q[0]\n \n\n def empty(self) -> bool:\n return len(self.q) == 0\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"24"},{"code":"class MyStack:\n\n def __init__(self):\n self.l = []\n\n def push(self, x: int) -> None:\n self.l.append(x)\n print(self.l)\n return None\n\n def pop(self) -> int:\n if len(self.l)!=0:\n a = self.l[-1]\n self.l.pop(-1)\n return a \n else:\n return -1\n def top(self) -> int:\n if len(self.l) != 0:\n return self.l[-1]\n else:\n return -1\n\n def empty(self) -> bool:\n if len(self.l) == 0:\n return True\n else:\n return False\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"24"},{"code":"class MyStack:\n\n def __init__(self):\n self.stack = []\n\n def push(self, x: int) -> None:\n self.stack.append(x)\n\n def pop(self) -> int:\n return self.stack.pop()\n\n def top(self) -> int:\n return self.stack[-1]\n\n def empty(self) -> bool:\n return self.stack == []\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"25"},{"code":"class MyStack:\n\n def __init__(self):\n self.stack=[]\n\n def push(self, x: int) -> None:\n self.stack.append(x)\n\n def pop(self) -> int:\n return self.stack.pop()\n\n def top(self) -> int:\n return self.stack[-1]\n\n def empty(self) -> bool:\n return not self.stack\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"25"},{"code":"class MyStack:\n\n def __init__(self):\n self.ls = []\n \n\n def push(self, x: int) -> None:\n self.ls.append(x)\n \n\n def pop(self) -> int:\n if(len(self.ls)==0):\n return -1\n return self.ls.pop()\n \n\n def top(self) -> int:\n return self.ls[-1]\n \n\n def empty(self) -> bool:\n if(len(self.ls)==0):\n return True\n return False\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"26"},{"code":"class MyStack:\n\n def __init__(self):\n self.q = deque()\n\n def push(self, x: int) -> None:\n self.q.append(x)\n for _ in range(len(self.q) - 1):\n self.q.append(self.q.popleft())\n\n def pop(self) -> int:\n return self.q.popleft()\n\n def top(self) -> int:\n return self.q[0]\n\n def empty(self) -> bool:\n return len(self.q) == 0","runtime":"26"},{"code":"class MyStack:\n\n def __init__(self):\n self.q=[]\n\n def push(self, x: int) -> None:\n self.q.append(x)\n\n def pop(self) -> int:\n for i in range(len(self.q)-1):\n self.push(self.q.pop(0))\n return self.q.pop(0)\n\n def top(self) -> int:\n return self.q[-1]\n\n def empty(self) -> bool:\n return len(self.q)==0\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"27"},{"code":"\nclass MyStack:\n\n def __init__(self):\n self.stack = deque() \n\n def push(self, x: int) -> None:\n self.stack.append(x)\n\n def pop(self) -> int:\n if self.stack:\n return self.stack.pop()\n\n def top(self) -> int:\n return self.stack[-1]\n\n def empty(self) -> bool:\n if self.stack:\n return False\n return True\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"27"},{"code":"class MyStack:\n\n def __init__(self):\n self.queue = deque()\n\n def push(self, x: int) -> None:\n self.queue.append(x)\n for _ in range(len(self.queue) - 1):\n self.queue.append(self.queue.popleft())\n \n def pop(self) -> int:\n if self.queue:\n return self.queue.popleft()\n return None\n \n def top(self) -> int:\n if self.queue:\n return self.queue[0]\n return None\n\n def empty(self) -> bool:\n if len(self.queue) == 0:\n return True\n else:\n return False\n \n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"28"},{"code":"class MyStack:\n\n def __init__(self):\n self.queue_1 = []\n self.size = 0\n\n def push(self, x: int) -> None:\n self.queue_1.append(x)\n self.size += 1\n\n def pop(self) -> int:\n if self.size > 0:\n self.size -= 1\n return self.queue_1.pop(self.size)\n else:\n return None\n\n def top(self) -> int:\n if self.size > 0:\n return self.queue_1[-1]\n else:\n return None\n\n def empty(self) -> bool:\n return self.size == 0\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"28"},{"code":"class MyStack:\n\n def __init__(self):\n self.queue = collections.deque()\n \n def push(self, x: int) -> None:\n self.queue.append(x)\n\n for i in range(len(self.queue) - 1):\n self.queue.append(self.queue.popleft())\n\n def pop(self) -> int:\n return self.queue.popleft()\n\n def top(self) -> int:\n return self.queue[0]\n \n def empty(self) -> bool:\n return not self.queue\n \n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"29"},{"code":"class MyStack:\n\n def __init__(self):\n self.queue = []\n\n def push(self, x: int) -> None:\n self.queue.append(x)\n\n def pop(self) -> int:\n return self.queue.pop(-1)\n \n\n def top(self) -> int:\n return self.queue[-1]\n\n def empty(self) -> bool:\n return len(self.queue) == 0\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"29"},{"code":"class MyStack:\n\n def __init__(self):\n self.stack=[]\n \n\n def push(self, x: int) -> None:\n self.stack.append(x)\n\n def pop(self) -> int:\n return self.stack.pop()\n\n def top(self) -> int:\n return self.stack[-1]\n\n def empty(self) -> bool:\n if self.stack:\n return False\n return True\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"30"},{"code":"class MyStack:\n\n def __init__(self):\n self.items=[]\n\n def push(self, x: int) -> None:\n return self.items.append(x)\n\n def pop(self) -> int:\n return self.items.pop()\n\n def top(self) -> int:\n return self.items[-1]\n\n def empty(self) -> bool:\n return len(self.items)==0\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"30"},{"code":"class MyStack:\n \"\"\"\n For this question, we will use the double-ended queue from python's collections\n module, but we will treat them as a normal single-ended queue. We will use 2 of\n them to implement a stack. The push, top and empty operations are the same for\n both stacks and queues. The only tricky operation is the pop operation. To do\n this, we will dequeue all items from the main queue and then enqueue them into\n the other queue. For the last item, we will not enqueue it but instead return\n it. Before returning the item, we will swap the queues for the main and other\n variable so that all the operations will work properly. To solve this problem\n using only 1 queue, instead of enqueuing into the other queue, we can just\n enqueue into the same queue.\n\n \"\"\"\n def __init__(self):\n self.main = collections.deque()\n self.other = collections.deque()\n\n def push(self, x: int) -> None:\n self.main.append(x)\n\n def pop(self) -> int:\n for _ in range(len(self.main) - 1):\n self.other.append(self.main.popleft())\n self.main, self.other = self.other, self.main\n return self.other.popleft()\n\n def top(self) -> int:\n return self.main[-1]\n\n def empty(self) -> bool:\n return not self.main\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"31"},{"code":"class MyStack:\n def __init__(self):\n self.q = collections.deque()\n\n def push(self, x: int) -> None:\n self.q.append(x)\n for _ in range(len(self.q) - 1):\n self.q.append(self.q.popleft())\n\n def pop(self) -> int:\n return self.q.popleft()\n\n def top(self) -> int:\n return self.q[0]\n\n def empty(self) -> bool:\n return not self.q\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"31"},{"code":"class MyStack:\n\n def __init__(self):\n self.st=[]\n \n\n def push(self, x: int) -> None:\n self.st.append(x)\n\n def pop(self) -> int:\n return self.st.pop()\n\n def top(self) -> int:\n return self.st[-1]\n\n def empty(self) -> bool:\n return len(self.st)==0\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"33"},{"code":"from collections import deque\n\nclass MyStack:\n def __init__(self):\n # Initialize two queues using deque\n self.queue1 = deque()\n self.queue2 = deque()\n\n def push(self, x: int) -> None:\n # Push the new element to queue1\n self.queue1.append(x)\n \n # Transfer all elements from queue2 to queue1\n while self.queue2:\n self.queue1.append(self.queue2.popleft())\n \n # Swap queue1 and queue2 so that queue2 contains the elements in the correct order\n self.queue1, self.queue2 = self.queue2, self.queue1\n\n def pop(self) -> int:\n # Pop the front element from queue2, which is the top of the stack\n return self.queue2.popleft()\n\n def top(self) -> int:\n # Peek at the front element of queue2, which is the top of the stack\n return self.queue2[0]\n\n def empty(self) -> bool:\n # The stack is empty if queue2 is empty\n return not self.queue2","runtime":"33"},{"code":"# Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and empty).\n\n# Implement the MyStack class:\n\n# void push(int x) Pushes element x to the top of the stack.\n# int pop() Removes the element on the top of the stack and returns it.\n# int top() Returns the element on the top of the stack.\n# boolean empty() Returns true if the stack is empty, false otherwise.\n# Notes:\n\n# You must use only standard operations of a queue, which means that only push to back, peek/pop from front, size and is empty operations are valid.\n# Depending on your language, the queue may not be supported natively. You may simulate a queue using a list or deque (double-ended queue) as long as you use only a queue's standard operations.\n\nclass MyStack:\n\n def __init__(self):\n self.stack = collections.deque([])\n \n\n def push(self, x: int) -> None:\n self.stack.append(x)\n\n def pop(self) -> int:\n return self.stack.pop()\n\n def top(self) -> int:\n temp = self.stack.pop()\n self.stack.append(temp)\n return temp\n \n def empty(self) -> bool:\n return len(self.stack) == 0\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"34"},{"code":"class MyStack:\n\n def __init__(self):\n \n self.stack = []\n\n def push(self, x: int) -> None:\n \n self.stack.append(x)\n\n def pop(self) -> int:\n \n return self.stack.pop()\n\n def top(self) -> int:\n \n return self.stack[-1]\n \n\n def empty(self) -> bool:\n \n return 0 == len(self.stack)\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"34"},{"code":"class MyStack:\n\n def __init__(self):\n self.stack=[]\n\n def push(self, x: int) -> None:\n self.stack.append(x) \n\n def pop(self) -> int:\n element=self.stack.pop()\n return element\n \n def top(self) -> int:\n return self.stack[-1]\n\n def empty(self) -> bool:\n return not self.stack\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop(int) \n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"35"},{"code":"class MyStack:\n\n def __init__(self):\n self.value = []\n\n def push(self, x: int) -> None:\n self.value.append(x)\n\n def pop(self) -> int:\n return self.value.pop()\n\n def top(self) -> int:\n return self.value[-1]\n\n def empty(self) -> bool:\n if len(self.value) == 0:\n return True\n return False\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"35"},{"code":"class MyStack:\n\n def __init__(self):\n self.st=[]\n def push(self, x: int) -> None:\n self.st.append(x)\n\n def pop(self) -> int:\n e=self.st.pop()\n return e\n\n def top(self) -> int:\n return self.st[-1]\n\n def empty(self) -> bool:\n if self.st==[]:\n return True\n else:\n return False\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"36"},{"code":"class MyStack:\n\n def __init__(self):\n self.q = deque()\n \n def push(self, x: int) -> None:\n self.q.append(x)\n for _ in range(len(self.q) - 1):\n self.q.append(self.q.popleft())\n \n def pop(self) -> int:\n return self.q.popleft()\n \n def top(self) -> int:\n return self.q[0]\n \n def empty(self) -> bool:\n return len(self.q) == 0\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"36"},{"code":"class MyStack:\n\n def __init__(self):\n self.stk = []\n\n def push(self, x: int) -> None:\n return self.stk.append(x)\n\n def pop(self) -> int:\n return self.stk.pop(-1)\n \n def top(self) -> int:\n return self.stk[-1]\n \n\n def empty(self) -> bool:\n return len(self.stk)==0\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"37"},{"code":"import queue\n\nclass MyStack:\n\n def __init__(self):\n self.queue = queue.Queue()\n \n\n def push(self, x: int) -> None:\n size = self.queue.qsize()\n self.queue.put(x)\n\n for _ in range(size):\n self.queue.put(self.queue.get())\n\n def pop(self) -> int:\n return self.queue.get()\n \n\n def top(self) -> int:\n return self.queue.queue[0]\n \n\n def empty(self) -> bool:\n return self.queue.empty()\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"37"},{"code":"class MyStack:\n\n def __init__(self):\n self.stack=[]\n \n\n def push(self, x: int) -> None:\n self.stack.append(x)\n\n def pop(self) -> int:\n return self.stack.pop()\n\n def top(self) -> int:\n return self.stack[-1]\n\n def empty(self) -> bool:\n if self.stack:\n return False\n return True\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"38"},{"code":"class MyStack:\n\n def __init__(self):\n self.main_queue = deque()\n self.temp_queue = deque()\n\n def push(self, x: int) -> None:\n self.main_queue.append(x)\n\n def pop(self) -> int:\n if len(self.main_queue) == 0:\n return -1\n\n for _ in range(len(self.main_queue) - 1):\n self.temp_queue.append(self.main_queue.popleft())\n\n result = self.main_queue.popleft()\n\n for _ in range(len(self.temp_queue)):\n self.main_queue.append(self.temp_queue.popleft())\n\n return result\n\n\n def top(self) -> int:\n if len(self.main_queue) == 0:\n return -1\n\n for _ in range(len(self.main_queue) - 1):\n self.temp_queue.append(self.main_queue.popleft())\n\n result = self.main_queue[0]\n self.temp_queue.append(self.main_queue.popleft())\n\n for _ in range(len(self.temp_queue)):\n self.main_queue.append(self.temp_queue.popleft())\n\n return result\n\n def empty(self) -> bool:\n if len(self.main_queue) == 0 and len(self.temp_queue) == 0:\n return True\n return False\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"38"},{"code":"class MyStack:\n\n def __init__(self):\n self.q = deque()\n\n def push(self, x: int) -> None:\n self.q.append(x)\n for _ in range(len(self.q) - 1):\n self.q.append(self.q.popleft())\n\n def pop(self) -> int:\n return self.q.popleft()\n\n def top(self) -> int:\n return self.q[0]\n\n def empty(self) -> bool:\n return len(self.q) == 0","runtime":"39"},{"code":"class MyStack:\n\n def __init__(self):\n self.q = deque()\n\n def push(self, x: int) -> None:\n self.q.append(x)\n\n def pop(self) -> int:\n return self.q.pop()\n\n def top(self) -> int:\n return self.q[-1]\n\n def empty(self) -> bool:\n return len(self.q) == 0\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"39"},{"code":"class MyStack:\n\n def __init__(self):\n self.queue = collections.deque()\n\n def push(self, x: int) -> None:\n self.queue.append(x)\n for _ in range(len(self.queue) - 1):\n self.queue.append(self.queue.popleft())\n\n def pop(self) -> int:\n return self.queue.popleft()\n\n def top(self) -> int:\n return self.queue[0]\n\n def empty(self) -> bool:\n return len(self.queue) == 0\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"40"},{"code":"class MyStack:\n\n def __init__(self):\n self.queue = deque()\n\n def push(self, x: int) -> None:\n self.queue.append(x)\n \n def pop(self) -> int:\n for i in range(len(self.queue)-1):\n self.push(self.queue.popleft())\n return self.queue.popleft()\n \n def top(self) -> int:\n return self.queue[-1]\n\n def empty(self) -> bool:\n return len(self.queue) == 0\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"40"},{"code":"class MyStack:\n\n def __init__(self):\n\n self.q = deque()\n\n\n \n \n def push(self, x: int) -> None:\n\n self.q.append(x)\n size = len(self.q)\n\n for i in range(size-1):\n self.q.append(self.q[0])\n self.q.popleft()\n \n\n\n\n \n \n\n def pop(self) -> int:\n\n if not self.empty():\n return self.q.popleft()\n return None\n\n def top(self) -> int:\n if not self.empty():\n return self.q[0]\n return None\n \n\n def empty(self) -> bool:\n if len(self.q) == 0:\n return True\n return False\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"41"},{"code":"class MyStack:\n\n def __init__(self):\n self.queue1 = []\n self.queue2 = []\n\n \n def push(self, x: int) -> None:\n self.queue1.append(x)\n \n # add : q1 1 2 3 4\n # pop : q2 1 2 3, q1 = [4] -> pop => q1 = []\n # add : q2 1 2 3 , q1 = []\n # pop : \n\n\n def pop(self) -> int:\n if len(self.queue1) >= 1:\n while len(self.queue1) != 1:\n self.queue2.append(self.queue1.pop(0))\n \n deleted = self.queue1.pop(0)\n return deleted\n while len(self.queue2) != 1:\n self.queue1.append(self.queue2.pop(0))\n return self.queue2.pop(0)\n\n\n \n def top(self) -> int:\n \n return self.queue1[-1] if self.queue1 else self.queue2[-1]\n \n\n def empty(self) -> bool:\n return len(self.queue1) == 0 and len(self.queue2) == 0\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"41"},{"code":"class MyStack:\n\n def __init__(self):\n self.stack = []\n self.front = 0\n self.rear = 0\n\n def push(self, x: int) -> None:\n self.stack.append(x)\n self.rear += 1\n\n def pop(self) -> int:\n val = self.stack.pop()\n self.rear -= 1\n return val\n\n def top(self) -> int:\n val = self.stack[self.rear-1]\n return val\n \n def empty(self) -> bool:\n if len(self.stack) == 0:\n return True\n return False\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"42"},{"code":"class MyStack:\n\n def __init__(self):\n self.q1 = deque()\n self.q2 = deque()\n def push(self, x: int) -> None:\n self.q1.append(x)\n def pop(self) -> int:\n while len(self.q1) > 1:\n self.q2.append(self.q1.popleft())\n popped_element = self.q1.popleft()\n self.q1, self.q2 = self.q2, self.q1\n return popped_element\n def top(self) -> int:\n while len(self.q1) > 1:\n self.q2.append(self.q1.popleft())\n \n top_element = self.q1[0]\n \n self.q2.append(self.q1.popleft())\n self.q1, self.q2 = self.q2, self.q1\n \n return top_element\n\n def empty(self) -> bool:\n return len(self.q1) == 0\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","runtime":"42"}],"string":"[\n {\n \"code\": \"from collections import deque\\n\\nclass MyStack:\\n\\n def __init__(self):\\n self.q = deque()\\n\\n def push(self, x: int) -> None:\\n self.q.append(x)\\n\\n def pop(self) -> int:\\n print(\\\"POP\\\")\\n print(self.q)\\n self.q.rotate(-1 * (len(self.q) - 1))\\n print(self.q)\\n return self.q.popleft()\\n\\n def top(self) -> int:\\n print(\\\"TOP\\\")\\n print(self.q)\\n # print(len(self.q))\\n i = -1 * (len(self.q) - 1)\\n print(i)\\n self.q.rotate(-1 * (len(self.q) - 1))\\n print(\\\"loop over\\\")\\n print(self.q)\\n out = self.q.popleft()\\n self.q.append(out)\\n return out\\n\\n def empty(self) -> bool:\\n return len(self.q) == 0\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\\n\",\n \"runtime\": \"13\"\n },\n {\n \"code\": \"from collections import deque\\nclass MyStack:\\n\\n def __init__(self):\\n self.q=deque()\\n\\n def push(self, x: int) -> None:\\n self.q.append(x)\\n\\n def pop(self) -> int:\\n for i in range(len(self.q)-1):\\n self.push(self.q.popleft())\\n return self.q.popleft()\\n\\n def top(self) -> int:\\n return self.q[-1]\\n \\n def empty(self) -> bool:\\n return len(self.q)==0\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"14\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.q = collections.deque()\\n\\n def push(self, x: int) -> None:\\n self.q.append(x)\\n for _ in range(len(self.q)-1):\\n self.q.append(self.q.popleft())\\n\\n def pop(self) -> int:\\n return self.q.popleft()\\n\\n def top(self) -> int:\\n return self.q[0]\\n\\n def empty(self) -> bool:\\n return len(self.q) == 0\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"15\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.q = deque()\\n\\n def push(self, x: int) -> None:\\n self.q.append(x)\\n\\n def pop(self) -> int:\\n return self.q.pop()\\n\\n def top(self) -> int:\\n return self.q[-1]\\n\\n def empty(self) -> bool:\\n return not self.q\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"16\"\n },\n {\n \"code\": \"class MyStack:\\n q1=deque\\n def __init__(self): \\n self.q1=deque()\\n def push(self, x: int) -> None:\\n self.q1.appendleft(x)\\n\\n def pop(self) -> int:\\n return self.q1.popleft()\\n\\n def top(self) -> int:\\n return self.q1[0]\\n\\n def empty(self) -> bool:\\n print(self.q1, len(self.q1), len(self.q1)>0)\\n return (len(self.q1)<1)\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass MyStack:\\n\\n def __init__(self):\\n self.stack = deque()\\n\\n def push(self, x: int) -> None:\\n self.stack.append(x)\\n\\n def pop(self) -> int:\\n listLen = len(self.stack)\\n for i in range(listLen):\\n if i == listLen - 1:\\n return self.stack.popleft()\\n self.stack.append(self.stack.popleft())\\n\\n def top(self) -> int:\\n return self.stack[-1]\\n\\n def empty(self) -> bool:\\n return len(self.stack) == 0\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class MyStack:\\n def __init__(self):\\n self.q = collections.deque()\\n\\n def push(self, x: int) -> None:\\n self.q.append(x)\\n for _ in range(len(self.q) - 1):\\n self.q.append(self.q.popleft())\\n\\n def pop(self) -> int:\\n return self.q.popleft()\\n\\n def top(self) -> int:\\n return self.q[0]\\n\\n def empty(self) -> bool:\\n return not self.q\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class MyStack:\\n def __init__(self): self.arr = []\\n def push(self, x: int) -> None: self.arr.append(x)\\n def pop(self) -> int: return self.arr.pop(-1)\\n def top(self) -> int: return self.arr[-1]\\n def empty(self) -> bool: return len(self.arr) == 0\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass MyStack:\\n\\n def __init__(self):\\n self.queue = deque()\\n\\n def push(self, x: int) -> None:\\n self.queue.append(x)\\n\\n def pop(self) -> int:\\n for i in range(len(self.queue)):\\n self.queue.append(self.queue.popleft())\\n\\n return self.queue.pop()\\n\\n def top(self) -> int:\\n return self.queue[len(self.queue) - 1]\\n\\n def empty(self) -> bool:\\n return len(self.queue) == 0\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.queue1=[]\\n self.queue2=[]\\n\\n def push(self, x: int) -> None:\\n while self.queue1:\\n self.queue2.append(self.queue1.pop(0))\\n self.queue1.append(x)\\n while self.queue2:\\n self.queue1.append(self.queue2.pop(0)) \\n\\n def pop(self) -> int:\\n return self.queue1.pop(0)\\n\\n def top(self) -> int:\\n return self.queue1[0]\\n\\n def empty(self) -> bool:\\n return len(self.queue1)==0\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.arr1 = []\\n \\n\\n def push(self, x: int) -> None:\\n self.arr1.append(x)\\n\\n def pop(self) -> int:\\n return self.arr1.pop()\\n\\n def top(self) -> int:\\n if self.arr1:\\n return self.arr1[len(self.arr1) - 1]\\n \\n\\n def empty(self) -> bool:\\n return not (self.arr1)\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.q = []\\n \\n\\n def push(self, x: int) -> None:\\n self.q.insert(0,x)\\n\\n def pop(self) -> int:\\n a = self.q[0]\\n self.q = self.q[1:]\\n return a\\n \\n\\n def top(self) -> int:\\n return self.q[0]\\n \\n\\n def empty(self) -> bool:\\n return len(self.q) == 0\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.l = []\\n\\n def push(self, x: int) -> None:\\n self.l.append(x)\\n print(self.l)\\n return None\\n\\n def pop(self) -> int:\\n if len(self.l)!=0:\\n a = self.l[-1]\\n self.l.pop(-1)\\n return a \\n else:\\n return -1\\n def top(self) -> int:\\n if len(self.l) != 0:\\n return self.l[-1]\\n else:\\n return -1\\n\\n def empty(self) -> bool:\\n if len(self.l) == 0:\\n return True\\n else:\\n return False\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.stack = []\\n\\n def push(self, x: int) -> None:\\n self.stack.append(x)\\n\\n def pop(self) -> int:\\n return self.stack.pop()\\n\\n def top(self) -> int:\\n return self.stack[-1]\\n\\n def empty(self) -> bool:\\n return self.stack == []\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.stack=[]\\n\\n def push(self, x: int) -> None:\\n self.stack.append(x)\\n\\n def pop(self) -> int:\\n return self.stack.pop()\\n\\n def top(self) -> int:\\n return self.stack[-1]\\n\\n def empty(self) -> bool:\\n return not self.stack\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.ls = []\\n \\n\\n def push(self, x: int) -> None:\\n self.ls.append(x)\\n \\n\\n def pop(self) -> int:\\n if(len(self.ls)==0):\\n return -1\\n return self.ls.pop()\\n \\n\\n def top(self) -> int:\\n return self.ls[-1]\\n \\n\\n def empty(self) -> bool:\\n if(len(self.ls)==0):\\n return True\\n return False\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.q = deque()\\n\\n def push(self, x: int) -> None:\\n self.q.append(x)\\n for _ in range(len(self.q) - 1):\\n self.q.append(self.q.popleft())\\n\\n def pop(self) -> int:\\n return self.q.popleft()\\n\\n def top(self) -> int:\\n return self.q[0]\\n\\n def empty(self) -> bool:\\n return len(self.q) == 0\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.q=[]\\n\\n def push(self, x: int) -> None:\\n self.q.append(x)\\n\\n def pop(self) -> int:\\n for i in range(len(self.q)-1):\\n self.push(self.q.pop(0))\\n return self.q.pop(0)\\n\\n def top(self) -> int:\\n return self.q[-1]\\n\\n def empty(self) -> bool:\\n return len(self.q)==0\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"\\nclass MyStack:\\n\\n def __init__(self):\\n self.stack = deque() \\n\\n def push(self, x: int) -> None:\\n self.stack.append(x)\\n\\n def pop(self) -> int:\\n if self.stack:\\n return self.stack.pop()\\n\\n def top(self) -> int:\\n return self.stack[-1]\\n\\n def empty(self) -> bool:\\n if self.stack:\\n return False\\n return True\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.queue = deque()\\n\\n def push(self, x: int) -> None:\\n self.queue.append(x)\\n for _ in range(len(self.queue) - 1):\\n self.queue.append(self.queue.popleft())\\n \\n def pop(self) -> int:\\n if self.queue:\\n return self.queue.popleft()\\n return None\\n \\n def top(self) -> int:\\n if self.queue:\\n return self.queue[0]\\n return None\\n\\n def empty(self) -> bool:\\n if len(self.queue) == 0:\\n return True\\n else:\\n return False\\n \\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.queue_1 = []\\n self.size = 0\\n\\n def push(self, x: int) -> None:\\n self.queue_1.append(x)\\n self.size += 1\\n\\n def pop(self) -> int:\\n if self.size > 0:\\n self.size -= 1\\n return self.queue_1.pop(self.size)\\n else:\\n return None\\n\\n def top(self) -> int:\\n if self.size > 0:\\n return self.queue_1[-1]\\n else:\\n return None\\n\\n def empty(self) -> bool:\\n return self.size == 0\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.queue = collections.deque()\\n \\n def push(self, x: int) -> None:\\n self.queue.append(x)\\n\\n for i in range(len(self.queue) - 1):\\n self.queue.append(self.queue.popleft())\\n\\n def pop(self) -> int:\\n return self.queue.popleft()\\n\\n def top(self) -> int:\\n return self.queue[0]\\n \\n def empty(self) -> bool:\\n return not self.queue\\n \\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.queue = []\\n\\n def push(self, x: int) -> None:\\n self.queue.append(x)\\n\\n def pop(self) -> int:\\n return self.queue.pop(-1)\\n \\n\\n def top(self) -> int:\\n return self.queue[-1]\\n\\n def empty(self) -> bool:\\n return len(self.queue) == 0\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.stack=[]\\n \\n\\n def push(self, x: int) -> None:\\n self.stack.append(x)\\n\\n def pop(self) -> int:\\n return self.stack.pop()\\n\\n def top(self) -> int:\\n return self.stack[-1]\\n\\n def empty(self) -> bool:\\n if self.stack:\\n return False\\n return True\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.items=[]\\n\\n def push(self, x: int) -> None:\\n return self.items.append(x)\\n\\n def pop(self) -> int:\\n return self.items.pop()\\n\\n def top(self) -> int:\\n return self.items[-1]\\n\\n def empty(self) -> bool:\\n return len(self.items)==0\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class MyStack:\\n \\\"\\\"\\\"\\n For this question, we will use the double-ended queue from python's collections\\n module, but we will treat them as a normal single-ended queue. We will use 2 of\\n them to implement a stack. The push, top and empty operations are the same for\\n both stacks and queues. The only tricky operation is the pop operation. To do\\n this, we will dequeue all items from the main queue and then enqueue them into\\n the other queue. For the last item, we will not enqueue it but instead return\\n it. Before returning the item, we will swap the queues for the main and other\\n variable so that all the operations will work properly. To solve this problem\\n using only 1 queue, instead of enqueuing into the other queue, we can just\\n enqueue into the same queue.\\n\\n \\\"\\\"\\\"\\n def __init__(self):\\n self.main = collections.deque()\\n self.other = collections.deque()\\n\\n def push(self, x: int) -> None:\\n self.main.append(x)\\n\\n def pop(self) -> int:\\n for _ in range(len(self.main) - 1):\\n self.other.append(self.main.popleft())\\n self.main, self.other = self.other, self.main\\n return self.other.popleft()\\n\\n def top(self) -> int:\\n return self.main[-1]\\n\\n def empty(self) -> bool:\\n return not self.main\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class MyStack:\\n def __init__(self):\\n self.q = collections.deque()\\n\\n def push(self, x: int) -> None:\\n self.q.append(x)\\n for _ in range(len(self.q) - 1):\\n self.q.append(self.q.popleft())\\n\\n def pop(self) -> int:\\n return self.q.popleft()\\n\\n def top(self) -> int:\\n return self.q[0]\\n\\n def empty(self) -> bool:\\n return not self.q\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.st=[]\\n \\n\\n def push(self, x: int) -> None:\\n self.st.append(x)\\n\\n def pop(self) -> int:\\n return self.st.pop()\\n\\n def top(self) -> int:\\n return self.st[-1]\\n\\n def empty(self) -> bool:\\n return len(self.st)==0\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass MyStack:\\n def __init__(self):\\n # Initialize two queues using deque\\n self.queue1 = deque()\\n self.queue2 = deque()\\n\\n def push(self, x: int) -> None:\\n # Push the new element to queue1\\n self.queue1.append(x)\\n \\n # Transfer all elements from queue2 to queue1\\n while self.queue2:\\n self.queue1.append(self.queue2.popleft())\\n \\n # Swap queue1 and queue2 so that queue2 contains the elements in the correct order\\n self.queue1, self.queue2 = self.queue2, self.queue1\\n\\n def pop(self) -> int:\\n # Pop the front element from queue2, which is the top of the stack\\n return self.queue2.popleft()\\n\\n def top(self) -> int:\\n # Peek at the front element of queue2, which is the top of the stack\\n return self.queue2[0]\\n\\n def empty(self) -> bool:\\n # The stack is empty if queue2 is empty\\n return not self.queue2\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"# Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and empty).\\n\\n# Implement the MyStack class:\\n\\n# void push(int x) Pushes element x to the top of the stack.\\n# int pop() Removes the element on the top of the stack and returns it.\\n# int top() Returns the element on the top of the stack.\\n# boolean empty() Returns true if the stack is empty, false otherwise.\\n# Notes:\\n\\n# You must use only standard operations of a queue, which means that only push to back, peek/pop from front, size and is empty operations are valid.\\n# Depending on your language, the queue may not be supported natively. You may simulate a queue using a list or deque (double-ended queue) as long as you use only a queue's standard operations.\\n\\nclass MyStack:\\n\\n def __init__(self):\\n self.stack = collections.deque([])\\n \\n\\n def push(self, x: int) -> None:\\n self.stack.append(x)\\n\\n def pop(self) -> int:\\n return self.stack.pop()\\n\\n def top(self) -> int:\\n temp = self.stack.pop()\\n self.stack.append(temp)\\n return temp\\n \\n def empty(self) -> bool:\\n return len(self.stack) == 0\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n \\n self.stack = []\\n\\n def push(self, x: int) -> None:\\n \\n self.stack.append(x)\\n\\n def pop(self) -> int:\\n \\n return self.stack.pop()\\n\\n def top(self) -> int:\\n \\n return self.stack[-1]\\n \\n\\n def empty(self) -> bool:\\n \\n return 0 == len(self.stack)\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.stack=[]\\n\\n def push(self, x: int) -> None:\\n self.stack.append(x) \\n\\n def pop(self) -> int:\\n element=self.stack.pop()\\n return element\\n \\n def top(self) -> int:\\n return self.stack[-1]\\n\\n def empty(self) -> bool:\\n return not self.stack\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop(int) \\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.value = []\\n\\n def push(self, x: int) -> None:\\n self.value.append(x)\\n\\n def pop(self) -> int:\\n return self.value.pop()\\n\\n def top(self) -> int:\\n return self.value[-1]\\n\\n def empty(self) -> bool:\\n if len(self.value) == 0:\\n return True\\n return False\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.st=[]\\n def push(self, x: int) -> None:\\n self.st.append(x)\\n\\n def pop(self) -> int:\\n e=self.st.pop()\\n return e\\n\\n def top(self) -> int:\\n return self.st[-1]\\n\\n def empty(self) -> bool:\\n if self.st==[]:\\n return True\\n else:\\n return False\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.q = deque()\\n \\n def push(self, x: int) -> None:\\n self.q.append(x)\\n for _ in range(len(self.q) - 1):\\n self.q.append(self.q.popleft())\\n \\n def pop(self) -> int:\\n return self.q.popleft()\\n \\n def top(self) -> int:\\n return self.q[0]\\n \\n def empty(self) -> bool:\\n return len(self.q) == 0\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.stk = []\\n\\n def push(self, x: int) -> None:\\n return self.stk.append(x)\\n\\n def pop(self) -> int:\\n return self.stk.pop(-1)\\n \\n def top(self) -> int:\\n return self.stk[-1]\\n \\n\\n def empty(self) -> bool:\\n return len(self.stk)==0\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"import queue\\n\\nclass MyStack:\\n\\n def __init__(self):\\n self.queue = queue.Queue()\\n \\n\\n def push(self, x: int) -> None:\\n size = self.queue.qsize()\\n self.queue.put(x)\\n\\n for _ in range(size):\\n self.queue.put(self.queue.get())\\n\\n def pop(self) -> int:\\n return self.queue.get()\\n \\n\\n def top(self) -> int:\\n return self.queue.queue[0]\\n \\n\\n def empty(self) -> bool:\\n return self.queue.empty()\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.stack=[]\\n \\n\\n def push(self, x: int) -> None:\\n self.stack.append(x)\\n\\n def pop(self) -> int:\\n return self.stack.pop()\\n\\n def top(self) -> int:\\n return self.stack[-1]\\n\\n def empty(self) -> bool:\\n if self.stack:\\n return False\\n return True\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.main_queue = deque()\\n self.temp_queue = deque()\\n\\n def push(self, x: int) -> None:\\n self.main_queue.append(x)\\n\\n def pop(self) -> int:\\n if len(self.main_queue) == 0:\\n return -1\\n\\n for _ in range(len(self.main_queue) - 1):\\n self.temp_queue.append(self.main_queue.popleft())\\n\\n result = self.main_queue.popleft()\\n\\n for _ in range(len(self.temp_queue)):\\n self.main_queue.append(self.temp_queue.popleft())\\n\\n return result\\n\\n\\n def top(self) -> int:\\n if len(self.main_queue) == 0:\\n return -1\\n\\n for _ in range(len(self.main_queue) - 1):\\n self.temp_queue.append(self.main_queue.popleft())\\n\\n result = self.main_queue[0]\\n self.temp_queue.append(self.main_queue.popleft())\\n\\n for _ in range(len(self.temp_queue)):\\n self.main_queue.append(self.temp_queue.popleft())\\n\\n return result\\n\\n def empty(self) -> bool:\\n if len(self.main_queue) == 0 and len(self.temp_queue) == 0:\\n return True\\n return False\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.q = deque()\\n\\n def push(self, x: int) -> None:\\n self.q.append(x)\\n for _ in range(len(self.q) - 1):\\n self.q.append(self.q.popleft())\\n\\n def pop(self) -> int:\\n return self.q.popleft()\\n\\n def top(self) -> int:\\n return self.q[0]\\n\\n def empty(self) -> bool:\\n return len(self.q) == 0\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.q = deque()\\n\\n def push(self, x: int) -> None:\\n self.q.append(x)\\n\\n def pop(self) -> int:\\n return self.q.pop()\\n\\n def top(self) -> int:\\n return self.q[-1]\\n\\n def empty(self) -> bool:\\n return len(self.q) == 0\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.queue = collections.deque()\\n\\n def push(self, x: int) -> None:\\n self.queue.append(x)\\n for _ in range(len(self.queue) - 1):\\n self.queue.append(self.queue.popleft())\\n\\n def pop(self) -> int:\\n return self.queue.popleft()\\n\\n def top(self) -> int:\\n return self.queue[0]\\n\\n def empty(self) -> bool:\\n return len(self.queue) == 0\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.queue = deque()\\n\\n def push(self, x: int) -> None:\\n self.queue.append(x)\\n \\n def pop(self) -> int:\\n for i in range(len(self.queue)-1):\\n self.push(self.queue.popleft())\\n return self.queue.popleft()\\n \\n def top(self) -> int:\\n return self.queue[-1]\\n\\n def empty(self) -> bool:\\n return len(self.queue) == 0\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n\\n self.q = deque()\\n\\n\\n \\n \\n def push(self, x: int) -> None:\\n\\n self.q.append(x)\\n size = len(self.q)\\n\\n for i in range(size-1):\\n self.q.append(self.q[0])\\n self.q.popleft()\\n \\n\\n\\n\\n \\n \\n\\n def pop(self) -> int:\\n\\n if not self.empty():\\n return self.q.popleft()\\n return None\\n\\n def top(self) -> int:\\n if not self.empty():\\n return self.q[0]\\n return None\\n \\n\\n def empty(self) -> bool:\\n if len(self.q) == 0:\\n return True\\n return False\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.queue1 = []\\n self.queue2 = []\\n\\n \\n def push(self, x: int) -> None:\\n self.queue1.append(x)\\n \\n # add : q1 1 2 3 4\\n # pop : q2 1 2 3, q1 = [4] -> pop => q1 = []\\n # add : q2 1 2 3 , q1 = []\\n # pop : \\n\\n\\n def pop(self) -> int:\\n if len(self.queue1) >= 1:\\n while len(self.queue1) != 1:\\n self.queue2.append(self.queue1.pop(0))\\n \\n deleted = self.queue1.pop(0)\\n return deleted\\n while len(self.queue2) != 1:\\n self.queue1.append(self.queue2.pop(0))\\n return self.queue2.pop(0)\\n\\n\\n \\n def top(self) -> int:\\n \\n return self.queue1[-1] if self.queue1 else self.queue2[-1]\\n \\n\\n def empty(self) -> bool:\\n return len(self.queue1) == 0 and len(self.queue2) == 0\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.stack = []\\n self.front = 0\\n self.rear = 0\\n\\n def push(self, x: int) -> None:\\n self.stack.append(x)\\n self.rear += 1\\n\\n def pop(self) -> int:\\n val = self.stack.pop()\\n self.rear -= 1\\n return val\\n\\n def top(self) -> int:\\n val = self.stack[self.rear-1]\\n return val\\n \\n def empty(self) -> bool:\\n if len(self.stack) == 0:\\n return True\\n return False\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.q1 = deque()\\n self.q2 = deque()\\n def push(self, x: int) -> None:\\n self.q1.append(x)\\n def pop(self) -> int:\\n while len(self.q1) > 1:\\n self.q2.append(self.q1.popleft())\\n popped_element = self.q1.popleft()\\n self.q1, self.q2 = self.q2, self.q1\\n return popped_element\\n def top(self) -> int:\\n while len(self.q1) > 1:\\n self.q2.append(self.q1.popleft())\\n \\n top_element = self.q1[0]\\n \\n self.q2.append(self.q1.popleft())\\n self.q1, self.q2 = self.q2, self.q1\\n \\n return top_element\\n\\n def empty(self) -> bool:\\n return len(self.q1) == 0\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"runtime\": \"42\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":47,"string":"47"},"mm_list":{"kind":"list like","value":[{"code":"class MyStack:\n\n def __init__(self):\n self.stack = []\n\n def push(self, x: int) -> None:\n self.stack.append(x)\n\n def pop(self) -> int:\n return self.stack.pop()\n\n def top(self) -> int:\n return self.stack[len(self.stack) - 1]\n\n def empty(self) -> bool:\n if len(self.stack) == 0:\n return True\n else:\n return False\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","memory":"16200"},{"code":"class MyStack:\n\n def __init__(self):\n self.stack=[]\n \n\n def push(self, x: int) -> None:\n self.stack.append(x)\n \n\n def pop(self) -> int:\n element=self.stack.pop()\n return element\n \n\n def top(self) -> int:\n return self.stack[-1]\n \n\n def empty(self) -> bool:\n return not self.stack\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","memory":"16300"},{"code":"class MyStack:\n\n def __init__(self):\n self.stack=[]\n \n\n def push(self, x: int) -> None:\n self.stack.append(x)\n\n def pop(self) -> int:\n return self.stack.pop()\n\n def top(self) -> int:\n return self.stack[-1]\n\n def empty(self) -> bool:\n if self.stack:\n return False\n return True\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","memory":"16400"},{"code":"class MyStack:\n\n def __init__(self):\n self.stack=[]\n\n def push(self, x: int) -> None:\n self.stack.append(x) \n\n def pop(self) -> int:\n element=self.stack.pop()\n return element\n \n def top(self) -> int:\n return self.stack[-1]\n\n def empty(self) -> bool:\n return not self.stack\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop(int) \n# param_3 = obj.top()\n# param_4 = obj.empty()","memory":"16400"},{"code":"class MyStack:\n\n def __init__(self):\n self.st=[]\n \n\n def push(self, x: int) -> None:\n self.st.append(x)\n\n def pop(self) -> int:\n return self.st.pop()\n\n def top(self) -> int:\n return self.st[-1]\n\n def empty(self) -> bool:\n return len(self.st)==0\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","memory":"16500"},{"code":"class MyStack:\n\n def __init__(self):\n self.stack = []\n self.front = 0\n self.rear = 0\n\n def push(self, x: int) -> None:\n self.stack.append(x)\n self.rear += 1\n\n def pop(self) -> int:\n val = self.stack.pop()\n self.rear -= 1\n return val\n\n def top(self) -> int:\n val = self.stack[self.rear-1]\n return val\n \n def empty(self) -> bool:\n if len(self.stack) == 0:\n return True\n return False\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","memory":"16500"},{"code":"class MyStack:\n\n def __init__(self):\n self.ls = []\n \n\n def push(self, x: int) -> None:\n self.ls.append(x)\n \n\n def pop(self) -> int:\n if(len(self.ls)==0):\n return -1\n return self.ls.pop()\n \n\n def top(self) -> int:\n return self.ls[-1]\n \n\n def empty(self) -> bool:\n if(len(self.ls)==0):\n return True\n return False\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","memory":"16600"},{"code":"'''\n Algorithm:\n 1. Import deque\n'''\n\nfrom collections import deque\nclass MyStack:\n\n def __init__(self):\n self.q = deque()\n self.top_val = -1\n \n\n def push(self, x: int) -> None:\n self.top_val = x\n self.q.append(x)\n\n # q: [1, 2, 3]; temp_q: [1, 2, 3]\n def pop(self) -> int:\n temp_q = deque()\n while len(self.q) > 1: \n temp_q.append(self.q.popleft())\n\n popped_val = self.q.popleft()\n\n while temp_q:\n if len(temp_q) == 1:\n self.top_val = temp_q[0]\n self.q.append(temp_q.popleft())\n\n return popped_val\n\n def top(self) -> int:\n return self.top_val\n\n def empty(self) -> bool:\n return True if len(self.q) == 0 else False \n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","memory":"16600"},{"code":"class MyStack:\n\n def __init__(self):\n self.stack=[]\n \n\n def push(self, x: int) -> None:\n self.stack.append(x)\n\n def pop(self) -> int:\n return self.stack.pop()\n\n def top(self) -> int:\n return self.stack[-1]\n\n def empty(self) -> bool:\n if self.stack:\n return False\n return True\n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","memory":"16700"},{"code":"class MyStack:\n\n def __init__(self):\n self.queue1 = []\n self.queue2 = []\n\n \n def push(self, x: int) -> None:\n self.queue1.append(x)\n \n # add : q1 1 2 3 4\n # pop : q2 1 2 3, q1 = [4] -> pop => q1 = []\n # add : q2 1 2 3 , q1 = []\n # pop : \n\n\n def pop(self) -> int:\n if len(self.queue1) >= 1:\n while len(self.queue1) != 1:\n self.queue2.append(self.queue1.pop(0))\n \n deleted = self.queue1.pop(0)\n return deleted\n while len(self.queue2) != 1:\n self.queue1.append(self.queue2.pop(0))\n return self.queue2.pop(0)\n\n\n \n def top(self) -> int:\n \n return self.queue1[-1] if self.queue1 else self.queue2[-1]\n \n\n def empty(self) -> bool:\n return len(self.queue1) == 0 and len(self.queue2) == 0\n \n\n\n# Your MyStack object will be instantiated and called as such:\n# obj = MyStack()\n# obj.push(x)\n# param_2 = obj.pop()\n# param_3 = obj.top()\n# param_4 = obj.empty()","memory":"16700"}],"string":"[\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.stack = []\\n\\n def push(self, x: int) -> None:\\n self.stack.append(x)\\n\\n def pop(self) -> int:\\n return self.stack.pop()\\n\\n def top(self) -> int:\\n return self.stack[len(self.stack) - 1]\\n\\n def empty(self) -> bool:\\n if len(self.stack) == 0:\\n return True\\n else:\\n return False\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.stack=[]\\n \\n\\n def push(self, x: int) -> None:\\n self.stack.append(x)\\n \\n\\n def pop(self) -> int:\\n element=self.stack.pop()\\n return element\\n \\n\\n def top(self) -> int:\\n return self.stack[-1]\\n \\n\\n def empty(self) -> bool:\\n return not self.stack\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.stack=[]\\n \\n\\n def push(self, x: int) -> None:\\n self.stack.append(x)\\n\\n def pop(self) -> int:\\n return self.stack.pop()\\n\\n def top(self) -> int:\\n return self.stack[-1]\\n\\n def empty(self) -> bool:\\n if self.stack:\\n return False\\n return True\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.stack=[]\\n\\n def push(self, x: int) -> None:\\n self.stack.append(x) \\n\\n def pop(self) -> int:\\n element=self.stack.pop()\\n return element\\n \\n def top(self) -> int:\\n return self.stack[-1]\\n\\n def empty(self) -> bool:\\n return not self.stack\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop(int) \\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.st=[]\\n \\n\\n def push(self, x: int) -> None:\\n self.st.append(x)\\n\\n def pop(self) -> int:\\n return self.st.pop()\\n\\n def top(self) -> int:\\n return self.st[-1]\\n\\n def empty(self) -> bool:\\n return len(self.st)==0\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.stack = []\\n self.front = 0\\n self.rear = 0\\n\\n def push(self, x: int) -> None:\\n self.stack.append(x)\\n self.rear += 1\\n\\n def pop(self) -> int:\\n val = self.stack.pop()\\n self.rear -= 1\\n return val\\n\\n def top(self) -> int:\\n val = self.stack[self.rear-1]\\n return val\\n \\n def empty(self) -> bool:\\n if len(self.stack) == 0:\\n return True\\n return False\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.ls = []\\n \\n\\n def push(self, x: int) -> None:\\n self.ls.append(x)\\n \\n\\n def pop(self) -> int:\\n if(len(self.ls)==0):\\n return -1\\n return self.ls.pop()\\n \\n\\n def top(self) -> int:\\n return self.ls[-1]\\n \\n\\n def empty(self) -> bool:\\n if(len(self.ls)==0):\\n return True\\n return False\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"'''\\n Algorithm:\\n 1. Import deque\\n'''\\n\\nfrom collections import deque\\nclass MyStack:\\n\\n def __init__(self):\\n self.q = deque()\\n self.top_val = -1\\n \\n\\n def push(self, x: int) -> None:\\n self.top_val = x\\n self.q.append(x)\\n\\n # q: [1, 2, 3]; temp_q: [1, 2, 3]\\n def pop(self) -> int:\\n temp_q = deque()\\n while len(self.q) > 1: \\n temp_q.append(self.q.popleft())\\n\\n popped_val = self.q.popleft()\\n\\n while temp_q:\\n if len(temp_q) == 1:\\n self.top_val = temp_q[0]\\n self.q.append(temp_q.popleft())\\n\\n return popped_val\\n\\n def top(self) -> int:\\n return self.top_val\\n\\n def empty(self) -> bool:\\n return True if len(self.q) == 0 else False \\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.stack=[]\\n \\n\\n def push(self, x: int) -> None:\\n self.stack.append(x)\\n\\n def pop(self) -> int:\\n return self.stack.pop()\\n\\n def top(self) -> int:\\n return self.stack[-1]\\n\\n def empty(self) -> bool:\\n if self.stack:\\n return False\\n return True\\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class MyStack:\\n\\n def __init__(self):\\n self.queue1 = []\\n self.queue2 = []\\n\\n \\n def push(self, x: int) -> None:\\n self.queue1.append(x)\\n \\n # add : q1 1 2 3 4\\n # pop : q2 1 2 3, q1 = [4] -> pop => q1 = []\\n # add : q2 1 2 3 , q1 = []\\n # pop : \\n\\n\\n def pop(self) -> int:\\n if len(self.queue1) >= 1:\\n while len(self.queue1) != 1:\\n self.queue2.append(self.queue1.pop(0))\\n \\n deleted = self.queue1.pop(0)\\n return deleted\\n while len(self.queue2) != 1:\\n self.queue1.append(self.queue2.pop(0))\\n return self.queue2.pop(0)\\n\\n\\n \\n def top(self) -> int:\\n \\n return self.queue1[-1] if self.queue1 else self.queue2[-1]\\n \\n\\n def empty(self) -> bool:\\n return len(self.queue1) == 0 and len(self.queue2) == 0\\n \\n\\n\\n# Your MyStack object will be instantiated and called as such:\\n# obj = MyStack()\\n# obj.push(x)\\n# param_2 = obj.pop()\\n# param_3 = obj.top()\\n# param_4 = obj.empty()\",\n \"memory\": \"16700\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":10,"string":"10"}}},{"rowIdx":153,"cells":{"question_id":{"kind":"number","value":226,"string":"226"},"name":{"kind":"string","value":"invert-binary-tree"},"content":{"kind":"string","value":"<p>Given the <code>root</code> of a binary tree, invert the tree, and return <em>its root</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/14/invert1-tree.jpg\" style=\"width: 500px; height: 165px;\" />\n<pre>\n<strong>Input:</strong> root = [4,2,7,1,3,6,9]\n<strong>Output:</strong> [4,7,2,9,6,3,1]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/03/14/invert2-tree.jpg\" style=\"width: 500px; height: 120px;\" />\n<pre>\n<strong>Input:</strong> root = [2,1,3]\n<strong>Output:</strong> [2,3,1]\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> root = []\n<strong>Output:</strong> []\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>[0, 100]</code>.</li>\n\t<li><code>-100 <= Node.val <= 100</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":77.81612072912158,"string":"77.816121"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["tree","depth-first-search","breadth-first-search","binary-tree"],"string":"[\n \"tree\",\n \"depth-first-search\",\n \"breadth-first-search\",\n \"binary-tree\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"11\", 0.0029], [\"12\", 0.0087], [\"15\", 0.0349], [\"16\", 0.0349], [\"17\", 0.0262], [\"18\", 0.0699], [\"19\", 0.198], [\"20\", 0.1106], [\"21\", 0.1921], [\"22\", 0.5153], [\"23\", 0.6288], [\"24\", 0.4599], [\"25\", 0.9286], [\"26\", 2.4831], [\"27\", 2.0959], [\"28\", 1.6273], [\"29\", 2.879], [\"30\", 6.0404], [\"31\", 5.0739], [\"32\", 3.4117], [\"33\", 5.8075], [\"34\", 10.1217], [\"35\", 7.3911], [\"36\", 5.4145], [\"37\", 7.3766], [\"38\", 9.5715], [\"39\", 6.7099], [\"40\", 4.5878], [\"41\", 4.4801], [\"42\", 4.3782]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"15900\", 0.0029], [\"16000\", 0.0029], [\"16100\", 0.0262], [\"16200\", 0.4105], [\"16300\", 6.9166], [\"16400\", 29.0784], [\"16500\", 48.9724]]}"},"rt_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\nfrom collections import deque\nclass Solution:\n def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return root\n queue = deque([root])\n while queue:\n curr = queue.popleft()\n curr.left, curr.right = curr.right, curr.left\n if curr.left:\n queue.append(curr.left)\n if curr.right:\n queue.append(curr.right)\n return root\n","runtime":"11"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return\n self.invertTree(root.left)\n self.invertTree(root.right)\n leftchild = root.left\n root.left = root.right\n root.right = leftchild\n return root\n ","runtime":"12"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return root\n stack = []\n stack.append(root)\n while stack:\n curr = stack.pop()\n if curr.left:\n stack.append(curr.left)\n if curr.right:\n stack.append(curr.right)\n curr.left, curr.right = curr.right, curr.left\n \n return root","runtime":"15"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return None\n \n temp=root.left\n root.left=root.right\n root.right=temp\n self.invertTree(root.right)\n self.invertTree(root.left)\n return root","runtime":"16"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return None\n \n #swap the children\n tmp=root.left\n root.left=root.right\n root.right=tmp\n\n self.invertTree(root.left)\n self.invertTree(root.right)\n return root\n ","runtime":"16"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n # Base Case\n if not root:\n return None\n\n # Swap the two children\n temp = root.left\n root.left = root.right\n root.right = temp\n\n # Recursion\n self.invertTree(root.left)\n self.invertTree(root.right)\n\n # Return\n return root\n ","runtime":"17"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root: \n return None \n \n root.left, root.right = root.right, root.left #swap values \n\n #swap pointers\n self.invertTree(root.left)\n self.invertTree(root.right)\n return root","runtime":"18"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return None\n\n root.left, root.right = root.right, root.left\n \n self.invertTree(root.left)\n self.invertTree(root.right)\n\n return root","runtime":"19"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if root is None:\n return None\n root.left,root.right= root.right, root.left\n \n self.invertTree(root.left)\n self.invertTree(root.right)\n\n return root\n ","runtime":"19"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return root\n\n stack = [root]\n while stack:\n node = stack.pop()\n if not node:\n continue\n left = node.left\n right = node.right\n stack.append(left)\n stack.append(right)\n node.left = right\n node.right = left\n return root","runtime":"20"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if root is None:\n return \n\n temp = root.left\n root.left = root.right\n root.right = temp\n self.invertTree(root.left)\n self.invertTree(root.right)\n return root\n\n","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n def invert(node):\n if not node:\n return\n \n temp = node.left\n node.left = node.right\n node.right = temp\n\n invert(node.left)\n invert(node.right)\n \n invert(root)\n return root\n\n ","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return root\n\n self.invertTree(root.left)\n self.invertTree(root.right)\n\n temp = root.left\n\n root.left = root.right\n root.right = temp\n return root\n\n \n","runtime":"22"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return None\n left = self.invertTree(root.right)\n right = self.invertTree(root.left)\n root.left, root.right = left, right\n return root","runtime":"23"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n \"\"\"\n Given the root of a binary tree, invert the tree, and return its root.\n\n Task:\n Vertical Flip\n\n Idea:\n\n \"\"\"\n\n # Base case: if the node is None, just return None\n if not root:\n return None\n\n # Swap the left and right children\n # At teh first\n root.left, root.right = root.right, root.left\n\n # Recursively invert the left and right subtrees\n self.invertTree(root.left)\n self.invertTree(root.right)\n return root","runtime":"23"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return None\n \n root.left, root.right = self.invertTree(root.right), self.invertTree(root.left)\n return root\n\n ","runtime":"24"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n # For each root, we are swapping the left node with the right\n # This is NOT done by just swapping our root.left with root.right here\n # at the top, as it has to happen at every level.\n\n # We need to recursively swap the nodes\n\n if not root:\n return root\n \n root.right, root.left = root.left, root.right\n\n left = self.invertTree(root.left)\n right = self.invertTree(root.right)\n #root.right = left\n #root.left = right\n\n return root","runtime":"24"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n \n def flip(node):\n if not node:\n return\n node.left, node.right = node.right, node.left\n flip(node.left)\n flip(node.right)\n\n flip(root)\n return root","runtime":"25"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n # For each root, we are swapping the left node with the right\n # This is NOT done by just swapping our root.left with root.right here\n # at the top, as it has to happen at every level.\n\n # We need to recursively swap the nodes\n\n if not root:\n return root\n \n root.right, root.left = root.left, root.right\n\n left = self.invertTree(root.left)\n right = self.invertTree(root.right)\n #root.right = left\n #root.left = right\n\n return root","runtime":"25"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n \n def dfs(node):\n if not node:\n return \n \n temp = node.left\n node.left = node.right\n node.right = temp\n dfs(node.left)\n dfs(node.right)\n \n dfs(root)\n return root\n\n","runtime":"26"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return None\n \n root.left, root.right = root.right,root.left\n self.invertTree(root.left)\n self.invertTree(root.right)\n\n return root","runtime":"26"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n\n if not root: return root\n\n def dfs(node):\n if not node: return\n\n temp1 = node.left\n node.left = node.right\n node.right = temp1\n\n dfs(node.left)\n dfs(node.right)\n\n return node\n\n return dfs(root)\n","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n '''\n invert each subtree\n - flip each child\n '''\n head = root\n\n if not root:\n return\n\n root.left, root.right = root.right, root.left\n\n self.invertTree(root.left)\n self.invertTree(root.right)\n\n return 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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if root is None:\n return root\n\n temp = root.left\n root.left = root.right\n root.right = temp\n\n self.invertTree(root.left)\n self.invertTree(root.right)\n\n return root","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\nclass Solution:\n def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return None \n tmp = root.left\n root.left = root.right\n root.right = tmp \n\n self.invertTree(root.left)\n self.invertTree(root.right)\n return root","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\nclass Solution:\n def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n queue = []\n\n if root:\n queue.append(root)\n\n while len(queue) > 0:\n curr = queue.pop(0)\n temp = curr.left\n curr.left = curr.right\n curr.right = temp\n \n if curr.left:\n queue.append(curr.left)\n\n if curr.right:\n queue.append(curr.right)\n\n return root\n ","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root: return root\n root.left, root.right = root.right, root.left\n if root.left: self.invertTree(root.left)\n if root.right: self.invertTree(root.right)\n \n return root","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if root is None:\n return root\n else:\n root.right = self.invertTree(root.right)\n root.left = self.invertTree(root.left)\n temp = root.right\n root.right = root.left\n root.left = temp\n return root\n ","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return root\n\n q = [root]\n while q:\n cur = q.pop(0)\n tmp = cur.left\n cur.left = cur.right\n cur.right = tmp\n\n if cur.left:\n q.append(cur.left)\n if cur.right:\n q.append(cur.right)\n\n return root\n","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if root == None:\n return\n root.left, root.right = root.right, root.left\n\n self.invertTree(root.left)\n self.invertTree(root.right) \n \n return root\n \n ","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if root is None:\n return \n\n left = self.invertTree(root.left)\n right = self.invertTree(root.right)\n root.left = right\n root.right = left\n return root\n\n ","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return root\n stack = [root]\n while stack:\n node = stack.pop()\n if not node:\n continue\n left = node.left\n right = node.right\n stack.append(left)\n stack.append(right)\n node.left = right\n node.right = left\n return root","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return\n\n root.left, root.right = root.right, root.left\n self.invertTree(root.left)\n self.invertTree(root.right)\n\n return root","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return root\n\n root.left, root.right = root.right, root.left\n self.invertTree(root.left)\n self.invertTree(root.right)\n return root","runtime":"34"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n temp=root\n def inv(temp):\n if not temp:\n return None\n t=temp.left\n temp.left=temp.right\n temp.right=t\n inv(temp.left)\n inv(temp.right)\n inv(temp)\n return root\n\n\n\n\n # if not root:\n # return None\n # tmp=root.left\n # root.left=root.right\n # root.right=tmp\n # self.invertTree(root.left)\n # self.invertTree(root.right)\n # return root\n # # ","runtime":"34"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if root is None:\n return root\n \n root.left, root.right = root.right, root.left\n\n if root.left:\n self.invertTree(root=root.left)\n if root.right:\n self.invertTree(root=root.right)\n else:\n return root\n \n return root\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n \n def rec(root, last_node):\n if root is None:\n return\n \n # Check and assign left and right children safely\n if root.right:\n last_node.left = TreeNode(val=root.right.val, left=None, right=None)\n if root.left:\n last_node.right = TreeNode(val=root.left.val, left=None, right=None)\n \n # Recursively process right subtree first for inversion\n if root.right:\n rec(root.right, last_node.left)\n if root.left:\n rec(root.left, last_node.right)\n \n # Base case: If root is None, return None\n if root is None:\n return None\n \n # Create a new root for the inverted tree\n current_tree = TreeNode(val=root.val, left=None, right=None)\n rec(root, current_tree)\n return current_tree\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n # For each root, we are swapping the left node with the right\n # This is NOT done by just swapping our root.left with root.right here\n # at the top, as it has to happen at every level.\n\n # We need to recursively swap the nodes\n\n if not root:\n return root\n \n left = self.invertTree(root.left)\n right = self.invertTree(root.right)\n root.right = left\n root.left = right\n\n return root","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return \n temp=root.left\n root.left=root.right\n root.right=temp\n self.invertTree(root.left)\n self.invertTree(root.right)\n return root","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if root is None:\n return root\n else:\n self.invertTree(root.left)\n self.invertTree(root.right)\n\n root.left, root.right = root.right, root.left\n\n return root","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if(root == None):\n return\n root.left,root.right = root.right,root.left\n Solution.invertTree(self,root.left)\n Solution.invertTree(self,root.right)\n return (root)\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n\n if not root:\n return\n\n tmp = root.left\n root.left = root.right\n root.right = tmp\n\n self.invertTree(root.left)\n self.invertTree(root.right)\n\n return root\n","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return None\n root.left, root.right = root.right, root.left\n self.invertTree(root.left)\n self.invertTree(root.right)\n return root\n ","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return None\n left = self.invertTree(root.right)\n right = self.invertTree(root.left)\n root.left, root.right = left, right\n return root","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return None\n\n right = self.invertTree(root.right)\n left = self.invertTree(root.left)\n root.left = right\n root.right = left\n return root","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n # For each root, we are swapping the left node with the right\n # This is NOT done by just swapping our root.left with root.right here\n # at the top, as it has to happen at every level.\n\n # We need to recursively swap the nodes\n\n if not root:\n return root\n \n left = self.invertTree(root.left)\n right = self.invertTree(root.right)\n root.right = left\n root.left = right\n\n return root","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if root:\n self.invertTree(root.right)\n self.invertTree(root.left)\n root.left, root.right = root.right, root.left\n return 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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return root\n stack = [root]\n while stack:\n node = stack.pop()\n if not node:\n continue\n left = node.left\n right = node.right\n stack.append(left)\n stack.append(right)\n node.left = right\n node.right = left\n return root","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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return \n dummy=root.left\n root.left=root.right\n root.right=dummy\n self.invertTree(root.left)\n self.invertTree(root.right)\n return root\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n # For each root, we are swapping the left node with the right\n # This is NOT done by just swapping our root.left with root.right here\n # at the top, as it has to happen at every level.\n\n # We need to recursively swap the nodes\n\n if not root:\n return root\n \n left = self.invertTree(root.left)\n right = self.invertTree(root.right)\n root.right = left\n root.left = right\n\n return 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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return root\n \n queue = [root]\n \n while queue:\n curr = queue.pop()\n curr.left, curr.right = curr.right, curr.left\n \n if curr.left:\n queue.append(curr.left)\n \n if curr.right:\n queue.append(curr.right)\n \n return root","runtime":"42"}],"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\\nfrom collections import deque\\nclass Solution:\\n def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return root\\n queue = deque([root])\\n while queue:\\n curr = queue.popleft()\\n curr.left, curr.right = curr.right, curr.left\\n if curr.left:\\n queue.append(curr.left)\\n if curr.right:\\n queue.append(curr.right)\\n return root\\n\",\n \"runtime\": \"11\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n leftchild = root.left\\n root.left = root.right\\n root.right = leftchild\\n return root\\n \",\n \"runtime\": \"12\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return root\\n stack = []\\n stack.append(root)\\n while stack:\\n curr = stack.pop()\\n if curr.left:\\n stack.append(curr.left)\\n if curr.right:\\n stack.append(curr.right)\\n curr.left, curr.right = curr.right, curr.left\\n \\n return root\",\n \"runtime\": \"15\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return None\\n \\n temp=root.left\\n root.left=root.right\\n root.right=temp\\n self.invertTree(root.right)\\n self.invertTree(root.left)\\n return root\",\n \"runtime\": \"16\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return None\\n \\n #swap the children\\n tmp=root.left\\n root.left=root.right\\n root.right=tmp\\n\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n return root\\n \",\n \"runtime\": \"16\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n # Base Case\\n if not root:\\n return None\\n\\n # Swap the two children\\n temp = root.left\\n root.left = root.right\\n root.right = temp\\n\\n # Recursion\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n\\n # Return\\n return root\\n \",\n \"runtime\": \"17\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root: \\n return None \\n \\n root.left, root.right = root.right, root.left #swap values \\n\\n #swap pointers\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n return root\",\n \"runtime\": \"18\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return None\\n\\n root.left, root.right = root.right, root.left\\n \\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n\\n return root\",\n \"runtime\": \"19\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if root is None:\\n return None\\n root.left,root.right= root.right, root.left\\n \\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n\\n return root\\n \",\n \"runtime\": \"19\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return root\\n\\n stack = [root]\\n while stack:\\n node = stack.pop()\\n if not node:\\n continue\\n left = node.left\\n right = node.right\\n stack.append(left)\\n stack.append(right)\\n node.left = right\\n node.right = left\\n return root\",\n \"runtime\": \"20\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if root is None:\\n return \\n\\n temp = root.left\\n root.left = root.right\\n root.right = temp\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n return root\\n\\n\",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n def invert(node):\\n if not node:\\n return\\n \\n temp = node.left\\n node.left = node.right\\n node.right = temp\\n\\n invert(node.left)\\n invert(node.right)\\n \\n invert(root)\\n return root\\n\\n \",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return root\\n\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n\\n temp = root.left\\n\\n root.left = root.right\\n root.right = temp\\n return root\\n\\n \\n\",\n \"runtime\": \"22\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return None\\n left = self.invertTree(root.right)\\n right = self.invertTree(root.left)\\n root.left, root.right = left, right\\n return root\",\n \"runtime\": \"23\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n \\\"\\\"\\\"\\n Given the root of a binary tree, invert the tree, and return its root.\\n\\n Task:\\n Vertical Flip\\n\\n Idea:\\n\\n \\\"\\\"\\\"\\n\\n # Base case: if the node is None, just return None\\n if not root:\\n return None\\n\\n # Swap the left and right children\\n # At teh first\\n root.left, root.right = root.right, root.left\\n\\n # Recursively invert the left and right subtrees\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n return root\",\n \"runtime\": \"23\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return None\\n \\n root.left, root.right = self.invertTree(root.right), self.invertTree(root.left)\\n return root\\n\\n \",\n \"runtime\": \"24\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n # For each root, we are swapping the left node with the right\\n # This is NOT done by just swapping our root.left with root.right here\\n # at the top, as it has to happen at every level.\\n\\n # We need to recursively swap the nodes\\n\\n if not root:\\n return root\\n \\n root.right, root.left = root.left, root.right\\n\\n left = self.invertTree(root.left)\\n right = self.invertTree(root.right)\\n #root.right = left\\n #root.left = right\\n\\n return root\",\n \"runtime\": \"24\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n \\n def flip(node):\\n if not node:\\n return\\n node.left, node.right = node.right, node.left\\n flip(node.left)\\n flip(node.right)\\n\\n flip(root)\\n return root\",\n \"runtime\": \"25\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n # For each root, we are swapping the left node with the right\\n # This is NOT done by just swapping our root.left with root.right here\\n # at the top, as it has to happen at every level.\\n\\n # We need to recursively swap the nodes\\n\\n if not root:\\n return root\\n \\n root.right, root.left = root.left, root.right\\n\\n left = self.invertTree(root.left)\\n right = self.invertTree(root.right)\\n #root.right = left\\n #root.left = right\\n\\n return root\",\n \"runtime\": \"25\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n \\n def dfs(node):\\n if not node:\\n return \\n \\n temp = node.left\\n node.left = node.right\\n node.right = temp\\n dfs(node.left)\\n dfs(node.right)\\n \\n dfs(root)\\n return root\\n\\n\",\n \"runtime\": \"26\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return None\\n \\n root.left, root.right = root.right,root.left\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n\\n return root\",\n \"runtime\": \"26\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n\\n if not root: return root\\n\\n def dfs(node):\\n if not node: return\\n\\n temp1 = node.left\\n node.left = node.right\\n node.right = temp1\\n\\n dfs(node.left)\\n dfs(node.right)\\n\\n return node\\n\\n return dfs(root)\\n\",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n '''\\n invert each subtree\\n - flip each child\\n '''\\n head = root\\n\\n if not root:\\n return\\n\\n root.left, root.right = root.right, root.left\\n\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n\\n return 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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if root is None:\\n return root\\n\\n temp = root.left\\n root.left = root.right\\n root.right = temp\\n\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n\\n return root\",\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\\nclass Solution:\\n def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return None \\n tmp = root.left\\n root.left = root.right\\n root.right = tmp \\n\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n return root\",\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\\nclass Solution:\\n def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n queue = []\\n\\n if root:\\n queue.append(root)\\n\\n while len(queue) > 0:\\n curr = queue.pop(0)\\n temp = curr.left\\n curr.left = curr.right\\n curr.right = temp\\n \\n if curr.left:\\n queue.append(curr.left)\\n\\n if curr.right:\\n queue.append(curr.right)\\n\\n return root\\n \",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root: return root\\n root.left, root.right = root.right, root.left\\n if root.left: self.invertTree(root.left)\\n if root.right: self.invertTree(root.right)\\n \\n return root\",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if root is None:\\n return root\\n else:\\n root.right = self.invertTree(root.right)\\n root.left = self.invertTree(root.left)\\n temp = root.right\\n root.right = root.left\\n root.left = temp\\n return root\\n \",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return root\\n\\n q = [root]\\n while q:\\n cur = q.pop(0)\\n tmp = cur.left\\n cur.left = cur.right\\n cur.right = tmp\\n\\n if cur.left:\\n q.append(cur.left)\\n if cur.right:\\n q.append(cur.right)\\n\\n return root\\n\",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if root == None:\\n return\\n root.left, root.right = root.right, root.left\\n\\n self.invertTree(root.left)\\n self.invertTree(root.right) \\n \\n return root\\n \\n \",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if root is None:\\n return \\n\\n left = self.invertTree(root.left)\\n right = self.invertTree(root.right)\\n root.left = right\\n root.right = left\\n return root\\n\\n \",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return root\\n stack = [root]\\n while stack:\\n node = stack.pop()\\n if not node:\\n continue\\n left = node.left\\n right = node.right\\n stack.append(left)\\n stack.append(right)\\n node.left = right\\n node.right = left\\n return root\",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return\\n\\n root.left, root.right = root.right, root.left\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n\\n return root\",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return root\\n\\n root.left, root.right = root.right, root.left\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n return root\",\n \"runtime\": \"34\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n temp=root\\n def inv(temp):\\n if not temp:\\n return None\\n t=temp.left\\n temp.left=temp.right\\n temp.right=t\\n inv(temp.left)\\n inv(temp.right)\\n inv(temp)\\n return root\\n\\n\\n\\n\\n # if not root:\\n # return None\\n # tmp=root.left\\n # root.left=root.right\\n # root.right=tmp\\n # self.invertTree(root.left)\\n # self.invertTree(root.right)\\n # return root\\n # # \",\n \"runtime\": \"34\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if root is None:\\n return root\\n \\n root.left, root.right = root.right, root.left\\n\\n if root.left:\\n self.invertTree(root=root.left)\\n if root.right:\\n self.invertTree(root=root.right)\\n else:\\n return root\\n \\n return root\\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n \\n def rec(root, last_node):\\n if root is None:\\n return\\n \\n # Check and assign left and right children safely\\n if root.right:\\n last_node.left = TreeNode(val=root.right.val, left=None, right=None)\\n if root.left:\\n last_node.right = TreeNode(val=root.left.val, left=None, right=None)\\n \\n # Recursively process right subtree first for inversion\\n if root.right:\\n rec(root.right, last_node.left)\\n if root.left:\\n rec(root.left, last_node.right)\\n \\n # Base case: If root is None, return None\\n if root is None:\\n return None\\n \\n # Create a new root for the inverted tree\\n current_tree = TreeNode(val=root.val, left=None, right=None)\\n rec(root, current_tree)\\n return current_tree\\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n # For each root, we are swapping the left node with the right\\n # This is NOT done by just swapping our root.left with root.right here\\n # at the top, as it has to happen at every level.\\n\\n # We need to recursively swap the nodes\\n\\n if not root:\\n return root\\n \\n left = self.invertTree(root.left)\\n right = self.invertTree(root.right)\\n root.right = left\\n root.left = right\\n\\n return root\",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return \\n temp=root.left\\n root.left=root.right\\n root.right=temp\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n return root\",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if root is None:\\n return root\\n else:\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n\\n root.left, root.right = root.right, root.left\\n\\n return root\",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if(root == None):\\n return\\n root.left,root.right = root.right,root.left\\n Solution.invertTree(self,root.left)\\n Solution.invertTree(self,root.right)\\n return (root)\\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n\\n if not root:\\n return\\n\\n tmp = root.left\\n root.left = root.right\\n root.right = tmp\\n\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n\\n return root\\n\",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return None\\n root.left, root.right = root.right, root.left\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n return root\\n \",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return None\\n left = self.invertTree(root.right)\\n right = self.invertTree(root.left)\\n root.left, root.right = left, right\\n return root\",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return None\\n\\n right = self.invertTree(root.right)\\n left = self.invertTree(root.left)\\n root.left = right\\n root.right = left\\n return root\",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n # For each root, we are swapping the left node with the right\\n # This is NOT done by just swapping our root.left with root.right here\\n # at the top, as it has to happen at every level.\\n\\n # We need to recursively swap the nodes\\n\\n if not root:\\n return root\\n \\n left = self.invertTree(root.left)\\n right = self.invertTree(root.right)\\n root.right = left\\n root.left = right\\n\\n return root\",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if root:\\n self.invertTree(root.right)\\n self.invertTree(root.left)\\n root.left, root.right = root.right, root.left\\n return 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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return root\\n stack = [root]\\n while stack:\\n node = stack.pop()\\n if not node:\\n continue\\n left = node.left\\n right = node.right\\n stack.append(left)\\n stack.append(right)\\n node.left = right\\n node.right = left\\n return root\",\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return \\n dummy=root.left\\n root.left=root.right\\n root.right=dummy\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n return root\\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n # For each root, we are swapping the left node with the right\\n # This is NOT done by just swapping our root.left with root.right here\\n # at the top, as it has to happen at every level.\\n\\n # We need to recursively swap the nodes\\n\\n if not root:\\n return root\\n \\n left = self.invertTree(root.left)\\n right = self.invertTree(root.right)\\n root.right = left\\n root.left = right\\n\\n return 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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return root\\n \\n queue = [root]\\n \\n while queue:\\n curr = queue.pop()\\n curr.left, curr.right = curr.right, curr.left\\n \\n if curr.left:\\n queue.append(curr.left)\\n \\n if curr.right:\\n queue.append(curr.right)\\n \\n return root\",\n \"runtime\": \"42\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":51,"string":"51"},"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if root is None:\n return None\n\n root.left, root.right = self.invertTree(root.right), self.invertTree(root.left)\n return root\n ","memory":"15900"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return None\n \n temp = root.left\n root.left = root.right\n root.right = temp\n\n self.invertTree(root.left)\n self.invertTree(root.right)\n\n return root","memory":"16000"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return\n root.left, root.right = root.right, root.left\n self.invertTree(root.left)\n self.invertTree(root.right)\n return root\n ","memory":"16100"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n def helper(curr):\n if not curr:\n return\n temp = curr.left\n curr.left = curr.right\n curr.right = temp\n helper(curr.left)\n helper(curr.right)\n helper(root)\n return root","memory":"16200"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return None\n \n L = self.invertTree(root.left)\n R = self.invertTree(root.right)\n root.left = R\n root.right = L\n\n return root","memory":"16200"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if not root:\n return None\n left = self.invertTree(root.right)\n right = self.invertTree(root.left)\n root.left, root.right = left, right\n return root","memory":"16300"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if root:\n root.right, root.left = root.left, root.right\n self.invertTree(root.right)\n self.invertTree(root.left)\n return root\n ","memory":"16300"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n self.helper(root)\n return root\n\n def helper(self, node):\n if node == None:\n return\n temp = node.left\n node.left = node.right\n node.right = temp\n self.helper(node.left)\n self.helper(node.right)\n","memory":"16400"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n def dfs(node: TreeNode) -> TreeNode:\n if not node.left and not node.right:\n return node\n \n inverted_left = None\n if node.left:\n inverted_left = dfs(node.left)\n \n inverted_right = None\n if node.right:\n inverted_right = dfs(node.right)\n\n node.left, node.right = inverted_right, inverted_left\n \n return node\n\n if not root:\n return None\n \n return dfs(root)","memory":"16400"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n\n def invert(node):\n if node is None:\n return\n if node.left is None and node.right is None:\n return\n \n invert(node.left)\n invert(node.right)\n temp = node.right\n node.right = node.left\n node.left = temp\n \n \n if root is not None:\n invert(root)\n return root\n ","memory":"16500"},{"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if root is None:\n return None\n right = self.invertTree(root.right)\n left = self.invertTree(root.left)\n root.left = right\n root.right = left\n return root","memory":"16500"}],"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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if root is None:\\n return None\\n\\n root.left, root.right = self.invertTree(root.right), self.invertTree(root.left)\\n return root\\n \",\n \"memory\": \"15900\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return None\\n \\n temp = root.left\\n root.left = root.right\\n root.right = temp\\n\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n\\n return root\",\n \"memory\": \"16000\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return\\n root.left, root.right = root.right, root.left\\n self.invertTree(root.left)\\n self.invertTree(root.right)\\n return root\\n \",\n \"memory\": \"16100\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n def helper(curr):\\n if not curr:\\n return\\n temp = curr.left\\n curr.left = curr.right\\n curr.right = temp\\n helper(curr.left)\\n helper(curr.right)\\n helper(root)\\n return root\",\n \"memory\": \"16200\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return None\\n \\n L = self.invertTree(root.left)\\n R = self.invertTree(root.right)\\n root.left = R\\n root.right = L\\n\\n return root\",\n \"memory\": \"16200\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if not root:\\n return None\\n left = self.invertTree(root.right)\\n right = self.invertTree(root.left)\\n root.left, root.right = left, right\\n return root\",\n \"memory\": \"16300\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if root:\\n root.right, root.left = root.left, root.right\\n self.invertTree(root.right)\\n self.invertTree(root.left)\\n return root\\n \",\n \"memory\": \"16300\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n self.helper(root)\\n return root\\n\\n def helper(self, node):\\n if node == None:\\n return\\n temp = node.left\\n node.left = node.right\\n node.right = temp\\n self.helper(node.left)\\n self.helper(node.right)\\n\",\n \"memory\": \"16400\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n def dfs(node: TreeNode) -> TreeNode:\\n if not node.left and not node.right:\\n return node\\n \\n inverted_left = None\\n if node.left:\\n inverted_left = dfs(node.left)\\n \\n inverted_right = None\\n if node.right:\\n inverted_right = dfs(node.right)\\n\\n node.left, node.right = inverted_right, inverted_left\\n \\n return node\\n\\n if not root:\\n return None\\n \\n return dfs(root)\",\n \"memory\": \"16400\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n\\n def invert(node):\\n if node is None:\\n return\\n if node.left is None and node.right is None:\\n return\\n \\n invert(node.left)\\n invert(node.right)\\n temp = node.right\\n node.right = node.left\\n node.left = temp\\n \\n \\n if root is not None:\\n invert(root)\\n return root\\n \",\n \"memory\": \"16500\"\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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if root is None:\\n return None\\n right = self.invertTree(root.right)\\n left = self.invertTree(root.left)\\n root.left = right\\n root.right = left\\n return root\",\n \"memory\": \"16500\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":11,"string":"11"}}},{"rowIdx":154,"cells":{"question_id":{"kind":"number","value":101,"string":"101"},"name":{"kind":"string","value":"symmetric-tree"},"content":{"kind":"string","value":"<p>Given the <code>root</code> of a binary tree, <em>check whether it is a mirror of itself</em> (i.e., symmetric around its center).</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/02/19/symtree1.jpg\" style=\"width: 354px; height: 291px;\" />\n<pre>\n<strong>Input:</strong> root = [1,2,2,3,4,4,3]\n<strong>Output:</strong> true\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/02/19/symtree2.jpg\" style=\"width: 308px; height: 258px;\" />\n<pre>\n<strong>Input:</strong> root = [1,2,2,null,3,null,3]\n<strong>Output:</strong> false\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, 1000]</code>.</li>\n\t<li><code>-100 <= Node.val <= 100</code></li>\n</ul>\n\n<p> </p>\n<strong>Follow up:</strong> Could you solve it both recursively and iteratively?"},"acRate":{"kind":"number","value":57.53435309360172,"string":"57.534353"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["tree","depth-first-search","breadth-first-search","binary-tree"],"string":"[\n \"tree\",\n \"depth-first-search\",\n \"breadth-first-search\",\n \"binary-tree\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"14\", 0.0153], [\"15\", 0.0102], [\"16\", 0.0205], [\"17\", 0.0051], [\"18\", 0.046], [\"19\", 0.1125], [\"20\", 0.0921], [\"21\", 0.0307], [\"22\", 0.179], [\"23\", 0.486], [\"24\", 0.5729], [\"25\", 0.4195], [\"26\", 0.711], [\"27\", 2.1126], [\"28\", 1.775], [\"29\", 1.8057], [\"30\", 2.1024], [\"31\", 5.7701], [\"32\", 4.4657], [\"33\", 4.1792], [\"34\", 4.1741], [\"35\", 9.2281], [\"36\", 7.5451], [\"37\", 5.9543], [\"38\", 5.3302], [\"39\", 9.5555], [\"40\", 7.3763], [\"41\", 5.719], [\"42\", 4.2764], [\"43\", 4.9056], [\"44\", 3.7035]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16000\", 0.0051], [\"16200\", 0.0512], [\"16300\", 0.619], [\"16400\", 8.5784], [\"16500\", 29.224], [\"16600\", 46.2939]]}"},"rt_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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n \n def func(right, left):\n if not left and not right: #step1 case 1\n return True\n if not left or not right: #step1 case 2\n return False\n \n if right.val == left.val: #step2\n outpair = func(left.left, right.right)\n inpair = func(left.right, right.left)\n return outpair and inpair\n else:\n return False\n \n return func(root.right, root.left)","runtime":"14"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n \"\"\"Check if a binary tree is symmetric.\"\"\"\n def _is_mirror(left: Optional[TreeNode], right: Optional[TreeNode]) -> bool:\n if not left and not right:\n return True\n if not left or not right:\n return False\n return (left.val == right.val and\n _is_mirror(left.left, right.right) and\n _is_mirror(left.right, right.left))\n \n if not root:\n return True\n return _is_mirror(root.left, root.right)\n","runtime":"15"},{"code":"class Solution:\n\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n\n def dfs(root1, root2):\n\n if root1 is None and root2 is None:\n\n return True\n\n if root1 is None or root2 is None or root1.val != root2.val:\n\n return False\n\n return dfs(root1.left, root2.right) and dfs(root1.right, root2.left)\n\n return dfs(root, root)\n\n\n\n\n ","runtime":"16"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def f(left, right):\n if not left and not right:\n return True\n if not left or not right or left.val != right.val:\n return False\n return f(left.left, right.right) and f(left.right, right.left)\n \n if not root:\n return True\n return f(root.left, root.right)","runtime":"17"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n return self.sym(root.left, root.right)\n\n def sym(self, root1, root2):\n if not root1 and not root2:\n return True\n if not root1 or not root2:\n return False\n return root1.val == root2.val and self.sym(root1.left, root2.right) and self.sym(root1.right, root2.left)\n \n \n \n","runtime":"19"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n q1 = []\n q2 = []\n q1.append(root.left)\n q2.append(root.right)\n\n while q1 or q2:\n l = q1.pop(0)\n r = q2.pop(0)\n\n if not l and not r:\n continue\n\n if (not l or not r) or l.val != r.val:\n return False\n \n # if l.left:\n q1.append(l.left)\n q1.append(l.right)\n\n q2.append(r.right)\n q2.append(r.left)\n \n return True","runtime":"20"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n # \n # time:\n # space: \n def dfs(n1, n2):\n if n1 is None and n2 is None:\n return True\n if n1 is None or n2 is None:\n return False\n if n1.val == n2.val and dfs(n1.left, n2.right) and dfs(n1.right, n2.left):\n return True\n return False\n \n return dfs(root, root)\n ","runtime":"21"},{"code":"class Solution(object):\n def isMirror(self, left, right):\n if not left and not right:\n return True\n if not left or not right:\n return False\n return left.val == right.val and self.isMirror(left.left, right.right) and self.isMirror(left.right, right.left)\n \n def isSymmetric(self, root):\n if not root:\n return True\n return self.isMirror(root.left, root.right)\n","runtime":"22"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def isMirror(t1: Optional[TreeNode], t2: Optional[TreeNode]) -> bool:\n if not t1 and not t2:\n return True\n if not t1 or not t2:\n return False\n return (t1.val == t2.val) and isMirror(t1.left, t2.right) and isMirror(t1.right, t2.left)\n \n if not root:\n return True\n return isMirror(root.left, root.right)\n","runtime":"22"},{"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 isMirror(self, r1, r2):\n if not r1 and not r2:\n return True\n if r1 and not r2 or not r1 and r2:\n return False \n return r1.val == r2.val and self.isMirror(r1.right, r2.left) and self.isMirror(r1.left, r2.right)\n \n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return root\n return self.isMirror(root.left, root.right)\n ","runtime":"23"},{"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\nfrom collections import deque\nclass Solution:\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def mirror(l,r):\n if l is None and r is None:\n return True\n \n\n if (not l or not r) or l.val!=r.val:\n return False\n\n left=mirror(l.left,r.right)\n right=mirror(l.right,r.left)\n\n return left and right\n \n return mirror(root.left,root.right)","runtime":"23"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n if (root.left == None) and (root.right == None):\n return True\n\n q1 = [root]\n q2 = [root]\n\n while len(q1) > 0:\n node1 = q1.pop(0)\n node2 = q2.pop(0)\n if (node1.left == None) and (node1.right == None) and (node2.left == None) and (node2.right == None):\n break\n\n if (node1.left != None):\n if node2.right == None:\n return False\n elif node1.left.val == node2.right.val:\n q1.append(node1.left)\n q2.append(node2.right)\n else:\n return False\n\n if (node1.right != None):\n if node2.left == None:\n return False\n elif node1.right.val == node2.left.val:\n q1.append(node1.right)\n q2.append(node2.left)\n else:\n return False\n\n\n return True\n\n\n\n ","runtime":"24"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def helper(m,n):\n if not m and not n:\n return True\n if not m or not n:\n return False\n return m.val==n.val and helper(m.left,n.right) and helper(m.right,n.left)\n return helper(root.left,root.right)","runtime":"25"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def same(root1, root2):\n if not root1 and not root2:\n return True\n\n if not root1 or not root2:\n return False\n\n if root1.val != root2.val:\n return False\n\n return same(root1.left, root2.right) and same(root1.right, root2.left)\n\n\n return same(root, root)\n","runtime":"25"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def go(a, b):\n if a == b == None:\n return True\n elif not a or not b:\n return False\n return a.val == b.val and go(a.left, b.right) and go(a.right, b. left)\n \n return go(root.left, root.right)","runtime":"26"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n q_left = [root.left]\n q_right = [root.right]\n\n while q_left:\n l = q_left.pop(0)\n r = q_right.pop(-1)\n\n if l == None and r == None:\n continue\n elif l == None:\n return False\n elif r == None:\n return False\n elif l.val == r.val and (bool(l.left) + bool(r.right) != 1) and (bool(r.left) + bool(l.right) != 1):\n q_left += [l.left]\n q_left += [l.right]\n\n q_right = [r.right] + q_right\n q_right = [r.left] + q_right\n \n else:\n return False\n\n return (q_left == q_right) and (q_left == [])\n \n","runtime":"26"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def isSame(left: Optional[TreeNode], right: Optional[TreeNode]) -> bool:\n if left is None or right is None:\n return left == right\n else:\n if left.val != right.val:\n return False\n else:\n return isSame(left.left, right.right) and isSame(left.right, right.left)\n \n return isSame(root.left, root.right)\n \n ","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n \n def isMirror(left, right):\n if not left and not right:\n return True\n if not left or not right:\n return False\n \n return ((left.val == right.val) and isMirror(left.left, right.right) and isMirror(left.right, right.left))\n\n \n if root:\n return isMirror(root.left, root.right)\n else:\n return True\n \n ","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def dfs(left,right):\n if not left and not right:\n return True\n if not left or not right:\n return False\n return(left.val==right.val and dfs(left.left,right.right) and dfs(left.right,right.left))\n return dfs(root.left,root.right)\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\nclass Solution:\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n\n def is_mirror(l, r):\n\n if not l and not r:\n return True\n\n if not l or not r:\n return False\n\n return l.val == r.val and is_mirror(l.left, r.right) and is_mirror(l.right, r.left)\n\n\n return is_mirror(root.left, root.right)\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\nclass Solution:\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n def isMirror(left : TreeNode, right : TreeNode):\n if not left and not right:\n return True\n if not left and right:\n return False\n if left and not right:\n return False\n \n return (left.val == right.val and isMirror(left.left, right.right) and isMirror(left.right, right.left))\n\n return isMirror(root.left, root.right)","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def mirror(l,r):\n if not l and not r:\n return True\n if not l or not r or l.val!=r.val:\n return False\n return mirror(l.left,r.right) and mirror(l.right,r.left)\n return mirror(root.left,root.right)","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n stack = [(root, root)]\n while stack:\n p, q = stack.pop()\n if not p and not q:\n continue\n if (not p and q) or (not q and p) or p.val != q.val:\n return False\n stack.append((p.left, q.right))\n stack.append((p.right, q.left))\n return True","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def same(p,q):\n if not p and not q:\n return True\n if not p or not q:\n return False\n if p.val != q.val:\n return False\n return same(p.left,q.right) and same(p.right,q.left)\n return same(root,root)\n ","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n q = [root]\n while q:\n l = 0\n r = len(q) - 1\n\n while l < r:\n if (not q[l] and q[r]) or (q[l] and not q[r]):\n return False\n elif q[l] and q[r] and (q[l].val != q[r].val):\n return False\n \n l += 1\n r -= 1\n\n next_level = []\n for n in q:\n if n:\n next_level.append(n.left)\n next_level.append(n.right)\n \n q = next_level\n\n return True","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 mirror(self,root1,root2):\n if root1==None and root2==None:\n return True\n if root1==None or root2==None:\n return False\n return root1.val==root2.val and self.mirror(root1.left,root2.right) and self.mirror(root1.right,root2.left)\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n return self.mirror(root,root)\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n lst1 = []\n lst2 = []\n \n def sym1(root):\n if root:\n sym1(root.left)\n lst1.append(root.val)\n sym1(root.right)\n lst1.append(None)\n sym1(root.left)\n \n def sym2(root):\n if root:\n sym2(root.right)\n lst2.append(root.val)\n sym2(root.left)\n lst2.append(None)\n sym2(root.right)\n \n print(lst1, lst2)\n return lst1 == lst2\n","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def isSymmetricTree(p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:\n if not p and not q:\n return True\n elif not p or not q:\n return False\n\n if p.val != q.val:\n return False\n\n outerIsSymmetric = isSymmetricTree(p.left, q.right)\n innerIsSymmetric = isSymmetricTree(p.right, q.left)\n return outerIsSymmetric and innerIsSymmetric\n \n return isSymmetricTree(root.left, root.right)","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\nfrom collections import deque\n\nclass Solution:\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n if root is None:\n return True\n\n # 遞迴解\n # return self.isSymmetricTree(root.left, root.right)\n\n # 迭代解\n q = deque([(root.left, root.right)])\n while q:\n l, r = q.popleft()\n if (l is None) and (r is None):\n continue\n if (l is None) or (r is None):\n return False\n if l.val != r.val:\n return False\n \n q.append((l.left, r.right))\n q.append((l.right, r.left))\n\n return True\n\n def isSymmetricTree(self, left: Optional[TreeNode], right: Optional[TreeNode]) -> bool: \n if (left is None) and (right is None):\n return True\n if (left is None) or (right is None):\n return False\n if left.val != right.val:\n return False\n \n return self.isSymmetricTree(left.left, right.right) and self.isSymmetricTree(left.right, right.left)","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def symmetric(n1,n2):\n #n1=left and n2=right\n if not n1 and not n2:\n return True\n if not n1 or not n2:\n return False\n return n1.val==n2.val and symmetric(n1.right,n2.left) and symmetric(n1.left, n2.right)\n return symmetric(root.left,root.right)\n\n","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 solve(self,r1,r2):\n if not r1 and not r2:\n return True\n if not r1 or not r2:\n return False\n if r1.val!=r2.val:\n return False\n return r1.val==r2.val and self.solve(r1.left,r2.right) and self.solve(r1.right,r2.left)\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n return self.solve(root.left,root.right)\n ","runtime":"34"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def isMirror(n1: TreeNode, n2: TreeNode):\n if not n1 and not n2:\n return True\n if not n1 or not n2:\n return False\n return n1.val == n2.val and isMirror(n1.right, n2.left) and isMirror(n1.left, n2.right)\n return isMirror(root.left, root.right)","runtime":"34"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n return self.isSame(root.left, root.right)\n\n def isSame(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:\n if p is None or q is None:\n return p == q\n return p.val == q.val and self.isSame(p.left, q.right) and self.isSame(p.right, q.left)","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\tdef isSymmetric(self, root: Optional[TreeNode]) -> bool:\n\n\t\tdef check_mirror_image(root1, root2):\n\n\t\t\tif root1 == None and root2 == None:\n\t\t\t\treturn True\n\n\t\t\tif root1 != None and root2 == None or root1 == None and root2 != None:\n\t\t\t\treturn False\n\n\t\t\tif root1.val == root2.val:\n\t\t\t\treturn check_mirror_image(root1.left, root2.right) and check_mirror_image(root1.right, root2.left)\n\n\t\treturn check_mirror_image(root, root)\n\t\t\n\n\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n stack = [root.left, root.right]\n while stack:\n right = stack.pop()\n left = stack.pop()\n if not right and not left:\n continue\n\n if (not right and left) or (right and not left) or right.val != left.val:\n return False\n stack.append(left.right)\n stack.append(right.left)\n stack.append(left.left)\n stack.append(right.right)\n return True","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n \n def helper(left, right):\n if not left and not right:\n return True\n elif not left or not right:\n return False\n if left.val != right.val:\n return False\n return helper(left.left, right.right) and helper(left.right, right.left)\n \n return helper(root.left, root.right)","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 isMirror(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> bool:\n if root1 is None and root2 is None:\n return True\n elif root1 is None or root2 is None:\n return False\n else:\n return root1.val == root2.val and self.isMirror(root1.left, root2.right) and self.isMirror(root1.right, root2.left)\n\n\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n return self.isMirror(root, root)","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def check(left, right):\n if not left and not right:\n return True\n if not left or not right:\n return False\n\n if left.val != right.val:\n return False\n \n return check(left.left, right.right) and check (left.right, right.left)\n\n return check(root.left, root.right)\n\n\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\n\nfrom collections import deque\n\nclass Solution:\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n\n if not root:\n return True\n\n def oposite_traversal(left_node, right_node):\n\n if (not left_node and right_node) or (left_node and not right_node):\n return False\n elif not left_node and not right_node:\n return True\n else:\n if left_node.val == right_node.val:\n return oposite_traversal(left_node.left, right_node.right) and oposite_traversal(left_node.right, right_node.left)\n else:\n return False\n\n return oposite_traversal(root.left, root.right)\n \n\n\n\n\n ","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def is_mirror(t1, t2):\n if t1 is None and t2 is None:\n return True\n if t1 is None or t2 is None:\n return False\n return t1.val == t2.val and is_mirror(t1.right, t2.left) and is_mirror(t1.left, t2.right)\n return is_mirror(root, root)","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n if root is None:\n return True\n \n\n queue = [(root.left, root.right)]\n\n\n while queue:\n node = queue.pop(0)\n left, right = node\n\n if left == None and right == None:\n continue\n if left == None and right:\n return False \n if left and right == None:\n return False \n if left.val == right.val:\n queue.append((left.left, right.right))\n queue.append((left.right, right.left))\n\n if left and right:\n if left.val != right.val:\n return False\n return True\n\n\n\n\n\n\n\n \"\"\" if node.left:\n if node.left.left.val == node.right.right.val:\n queue.append(node.left.left)\n print(node.left.left.val)\n else:\n queue.append(node.left.right)\n print(node.left.right.val)\n else:\n return False\n\n\n if node.right:\n if node.right.left.val == node.left.right.val:\n queue.append(node.right.left)\n print(node.right.left.val)\n else:\n queue.append(node.right.left)\n print(node.right.left.val)\n else:\n return False\n\n print(queue)\"\"\"","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n if root is None:\n return True\n \n\n queue = [(root.left, root.right)]\n\n\n while queue:\n node = queue.pop(0)\n left, right = node\n\n if left == None and right == None:\n continue\n\n if left == None and right:\n return False \n\n if left and right == None:\n return False \n\n if left.val == right.val:\n queue.append((left.left, right.right))\n queue.append((left.right, right.left))\n\n if left and right:\n if left.val != right.val:\n return False\n\n return True","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def check(root1,root2):\n if root1 is None and root2 is None:\n return True\n if root1 is not None and root2 is not None:\n if root1.val == root2.val:\n return check(root1.left,root2.right) and check(root1.right,root2.left)\n return False\n return check(root,root)","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n # 先中序遍歷\n def isMirror(left, right):\n # 如果左右都是空的話，代表是對稱的\n if not left and not right:\n return True\n if not left or not right:\n return False\n # 左右子樹的根節點值是否相等，且左子樹的左節點等於右子樹的右節點，左子樹的右節點等於右子樹的左節點\n return (left.val == right.val) and isMirror(left.left, right.right) and isMirror(left.right, right.left)\n if not root:\n return True\n # 檢查左右子樹是否對稱\n return isMirror(root.left, root.right)\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 two_symmetric(self, root1, root2):\n if root1 is None and root2 is None:\n return True\n if root1 is None or root2 is None:\n return False\n if root1.val != root2.val :\n return False\n return self.two_symmetric(root1.left, root2.right) and self.two_symmetric(root1.right, root2.left)\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n return self.two_symmetric(root.left, root.right)\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n\n lefta=[root.left]\n righta=[root.right]\n\n\n while lefta and righta:\n l=lefta.pop(0)\n r=righta.pop(0)\n\n\n if l==None and r==None:\n continue\n \n if l==None or r==None or l.val!=r.val:\n return False\n \n \n\n \n \n lefta.append(l.left)\n lefta.append(l.right)\n righta.append(r.right)\n righta.append(r.left)\n \n return True\n \n \n\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def go(a, b):\n if a == None and b:\n return False\n elif b == None and a:\n return False \n elif a == b == None:\n return True\n return a.val == b.val and go(a.left, b.right) and go(a.right, b. left)\n \n return go(root.left, root.right)","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n l, r = root.left, root.right\n def calc(a,b):\n if not a and not b:\n return True\n if not a or not b:\n return False\n \n l = calc(a.left, b.right)\n r = calc(a.right, b.left)\n\n equal = a.val == b.val\n\n return l and r and equal\n return calc(l,r)\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\nfrom collections import deque\n\nclass Solution:\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n if root is None:\n return True\n\n # 遞迴解\n # return self.isSymmetricTree(root.left, root.right)\n\n # 迭代解\n q = deque([(root.left, root.right)])\n while q:\n l, r = q.popleft()\n if (l is None) and (r is None):\n continue\n if (l is None) or (r is None):\n return False\n if l.val != r.val:\n return False\n\n q.append((l.left, r.right))\n q.append((l.right, r.left))\n return True\n \n def isSymmetricTree(self, left: Optional[TreeNode], right: Optional[TreeNode]) -> bool: \n if (left is None) and (right is None):\n return True\n if (left is None) or (right is None):\n return False\n if left.val != right.val:\n return False\n \n return self.isSymmetricTree(left.left, right.right) and self.isSymmetricTree(left.right, right.left)","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 isMirror(self, r1, r2):\n if not r1 and not r2:\n return True\n if r1 and not r2 or not r1 and r2:\n return False \n return r1.val == r2.val and self.isMirror(r1.right, r2.left) and self.isMirror(r1.left, r2.right)\n \n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n return self.isMirror(root, root)\n ","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 check(self, left, right):\n # base case\n if left is None and right is None:\n return True\n if left is None or right is None or left.val != right.val:\n return False\n \n return self.check(left.left, right.right) and self.check(left.right, right.left)\n \n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n return self.check(root.left, root.right)","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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def is_mirror(n1, n2):\n if not n1 and not n2:\n return True\n if not n1 or not n2:\n return False\n return n1.val == n2.val and is_mirror(n1.left, n2.right) and is_mirror(n1.right, n2.left)\n \n return is_mirror(root.left, root.right)","runtime":"44"}],"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n \\n def func(right, left):\\n if not left and not right: #step1 case 1\\n return True\\n if not left or not right: #step1 case 2\\n return False\\n \\n if right.val == left.val: #step2\\n outpair = func(left.left, right.right)\\n inpair = func(left.right, right.left)\\n return outpair and inpair\\n else:\\n return False\\n \\n return func(root.right, root.left)\",\n \"runtime\": \"14\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n \\\"\\\"\\\"Check if a binary tree is symmetric.\\\"\\\"\\\"\\n def _is_mirror(left: Optional[TreeNode], right: Optional[TreeNode]) -> bool:\\n if not left and not right:\\n return True\\n if not left or not right:\\n return False\\n return (left.val == right.val and\\n _is_mirror(left.left, right.right) and\\n _is_mirror(left.right, right.left))\\n \\n if not root:\\n return True\\n return _is_mirror(root.left, root.right)\\n\",\n \"runtime\": \"15\"\n },\n {\n \"code\": \"class Solution:\\n\\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n\\n def dfs(root1, root2):\\n\\n if root1 is None and root2 is None:\\n\\n return True\\n\\n if root1 is None or root2 is None or root1.val != root2.val:\\n\\n return False\\n\\n return dfs(root1.left, root2.right) and dfs(root1.right, root2.left)\\n\\n return dfs(root, root)\\n\\n\\n\\n\\n \",\n \"runtime\": \"16\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def f(left, right):\\n if not left and not right:\\n return True\\n if not left or not right or left.val != right.val:\\n return False\\n return f(left.left, right.right) and f(left.right, right.left)\\n \\n if not root:\\n return True\\n return f(root.left, root.right)\",\n \"runtime\": \"17\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n return self.sym(root.left, root.right)\\n\\n def sym(self, root1, root2):\\n if not root1 and not root2:\\n return True\\n if not root1 or not root2:\\n return False\\n return root1.val == root2.val and self.sym(root1.left, root2.right) and self.sym(root1.right, root2.left)\\n \\n \\n \\n\",\n \"runtime\": \"19\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n q1 = []\\n q2 = []\\n q1.append(root.left)\\n q2.append(root.right)\\n\\n while q1 or q2:\\n l = q1.pop(0)\\n r = q2.pop(0)\\n\\n if not l and not r:\\n continue\\n\\n if (not l or not r) or l.val != r.val:\\n return False\\n \\n # if l.left:\\n q1.append(l.left)\\n q1.append(l.right)\\n\\n q2.append(r.right)\\n q2.append(r.left)\\n \\n return True\",\n \"runtime\": \"20\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n # \\n # time:\\n # space: \\n def dfs(n1, n2):\\n if n1 is None and n2 is None:\\n return True\\n if n1 is None or n2 is None:\\n return False\\n if n1.val == n2.val and dfs(n1.left, n2.right) and dfs(n1.right, n2.left):\\n return True\\n return False\\n \\n return dfs(root, root)\\n \",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution(object):\\n def isMirror(self, left, right):\\n if not left and not right:\\n return True\\n if not left or not right:\\n return False\\n return left.val == right.val and self.isMirror(left.left, right.right) and self.isMirror(left.right, right.left)\\n \\n def isSymmetric(self, root):\\n if not root:\\n return True\\n return self.isMirror(root.left, root.right)\\n\",\n \"runtime\": \"22\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def isMirror(t1: Optional[TreeNode], t2: Optional[TreeNode]) -> bool:\\n if not t1 and not t2:\\n return True\\n if not t1 or not t2:\\n return False\\n return (t1.val == t2.val) and isMirror(t1.left, t2.right) and isMirror(t1.right, t2.left)\\n \\n if not root:\\n return True\\n return isMirror(root.left, root.right)\\n\",\n \"runtime\": \"22\"\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 isMirror(self, r1, r2):\\n if not r1 and not r2:\\n return True\\n if r1 and not r2 or not r1 and r2:\\n return False \\n return r1.val == r2.val and self.isMirror(r1.right, r2.left) and self.isMirror(r1.left, r2.right)\\n \\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return root\\n return self.isMirror(root.left, root.right)\\n \",\n \"runtime\": \"23\"\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\\nfrom collections import deque\\nclass Solution:\\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def mirror(l,r):\\n if l is None and r is None:\\n return True\\n \\n\\n if (not l or not r) or l.val!=r.val:\\n return False\\n\\n left=mirror(l.left,r.right)\\n right=mirror(l.right,r.left)\\n\\n return left and right\\n \\n return mirror(root.left,root.right)\",\n \"runtime\": \"23\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n if (root.left == None) and (root.right == None):\\n return True\\n\\n q1 = [root]\\n q2 = [root]\\n\\n while len(q1) > 0:\\n node1 = q1.pop(0)\\n node2 = q2.pop(0)\\n if (node1.left == None) and (node1.right == None) and (node2.left == None) and (node2.right == None):\\n break\\n\\n if (node1.left != None):\\n if node2.right == None:\\n return False\\n elif node1.left.val == node2.right.val:\\n q1.append(node1.left)\\n q2.append(node2.right)\\n else:\\n return False\\n\\n if (node1.right != None):\\n if node2.left == None:\\n return False\\n elif node1.right.val == node2.left.val:\\n q1.append(node1.right)\\n q2.append(node2.left)\\n else:\\n return False\\n\\n\\n return True\\n\\n\\n\\n \",\n \"runtime\": \"24\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def helper(m,n):\\n if not m and not n:\\n return True\\n if not m or not n:\\n return False\\n return m.val==n.val and helper(m.left,n.right) and helper(m.right,n.left)\\n return helper(root.left,root.right)\",\n \"runtime\": \"25\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def same(root1, root2):\\n if not root1 and not root2:\\n return True\\n\\n if not root1 or not root2:\\n return False\\n\\n if root1.val != root2.val:\\n return False\\n\\n return same(root1.left, root2.right) and same(root1.right, root2.left)\\n\\n\\n return same(root, root)\\n\",\n \"runtime\": \"25\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def go(a, b):\\n if a == b == None:\\n return True\\n elif not a or not b:\\n return False\\n return a.val == b.val and go(a.left, b.right) and go(a.right, b. left)\\n \\n return go(root.left, root.right)\",\n \"runtime\": \"26\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n q_left = [root.left]\\n q_right = [root.right]\\n\\n while q_left:\\n l = q_left.pop(0)\\n r = q_right.pop(-1)\\n\\n if l == None and r == None:\\n continue\\n elif l == None:\\n return False\\n elif r == None:\\n return False\\n elif l.val == r.val and (bool(l.left) + bool(r.right) != 1) and (bool(r.left) + bool(l.right) != 1):\\n q_left += [l.left]\\n q_left += [l.right]\\n\\n q_right = [r.right] + q_right\\n q_right = [r.left] + q_right\\n \\n else:\\n return False\\n\\n return (q_left == q_right) and (q_left == [])\\n \\n\",\n \"runtime\": \"26\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def isSame(left: Optional[TreeNode], right: Optional[TreeNode]) -> bool:\\n if left is None or right is None:\\n return left == right\\n else:\\n if left.val != right.val:\\n return False\\n else:\\n return isSame(left.left, right.right) and isSame(left.right, right.left)\\n \\n return isSame(root.left, root.right)\\n \\n \",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n \\n def isMirror(left, right):\\n if not left and not right:\\n return True\\n if not left or not right:\\n return False\\n \\n return ((left.val == right.val) and isMirror(left.left, right.right) and isMirror(left.right, right.left))\\n\\n \\n if root:\\n return isMirror(root.left, root.right)\\n else:\\n return True\\n \\n \",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def dfs(left,right):\\n if not left and not right:\\n return True\\n if not left or not right:\\n return False\\n return(left.val==right.val and dfs(left.left,right.right) and dfs(left.right,right.left))\\n return dfs(root.left,root.right)\\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\\nclass Solution:\\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n\\n def is_mirror(l, r):\\n\\n if not l and not r:\\n return True\\n\\n if not l or not r:\\n return False\\n\\n return l.val == r.val and is_mirror(l.left, r.right) and is_mirror(l.right, r.left)\\n\\n\\n return is_mirror(root.left, root.right)\\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\\nclass Solution:\\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n def isMirror(left : TreeNode, right : TreeNode):\\n if not left and not right:\\n return True\\n if not left and right:\\n return False\\n if left and not right:\\n return False\\n \\n return (left.val == right.val and isMirror(left.left, right.right) and isMirror(left.right, right.left))\\n\\n return isMirror(root.left, root.right)\",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def mirror(l,r):\\n if not l and not r:\\n return True\\n if not l or not r or l.val!=r.val:\\n return False\\n return mirror(l.left,r.right) and mirror(l.right,r.left)\\n return mirror(root.left,root.right)\",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n stack = [(root, root)]\\n while stack:\\n p, q = stack.pop()\\n if not p and not q:\\n continue\\n if (not p and q) or (not q and p) or p.val != q.val:\\n return False\\n stack.append((p.left, q.right))\\n stack.append((p.right, q.left))\\n return True\",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def same(p,q):\\n if not p and not q:\\n return True\\n if not p or not q:\\n return False\\n if p.val != q.val:\\n return False\\n return same(p.left,q.right) and same(p.right,q.left)\\n return same(root,root)\\n \",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n q = [root]\\n while q:\\n l = 0\\n r = len(q) - 1\\n\\n while l < r:\\n if (not q[l] and q[r]) or (q[l] and not q[r]):\\n return False\\n elif q[l] and q[r] and (q[l].val != q[r].val):\\n return False\\n \\n l += 1\\n r -= 1\\n\\n next_level = []\\n for n in q:\\n if n:\\n next_level.append(n.left)\\n next_level.append(n.right)\\n \\n q = next_level\\n\\n return True\",\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 mirror(self,root1,root2):\\n if root1==None and root2==None:\\n return True\\n if root1==None or root2==None:\\n return False\\n return root1.val==root2.val and self.mirror(root1.left,root2.right) and self.mirror(root1.right,root2.left)\\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n return self.mirror(root,root)\\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n lst1 = []\\n lst2 = []\\n \\n def sym1(root):\\n if root:\\n sym1(root.left)\\n lst1.append(root.val)\\n sym1(root.right)\\n lst1.append(None)\\n sym1(root.left)\\n \\n def sym2(root):\\n if root:\\n sym2(root.right)\\n lst2.append(root.val)\\n sym2(root.left)\\n lst2.append(None)\\n sym2(root.right)\\n \\n print(lst1, lst2)\\n return lst1 == lst2\\n\",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def isSymmetricTree(p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:\\n if not p and not q:\\n return True\\n elif not p or not q:\\n return False\\n\\n if p.val != q.val:\\n return False\\n\\n outerIsSymmetric = isSymmetricTree(p.left, q.right)\\n innerIsSymmetric = isSymmetricTree(p.right, q.left)\\n return outerIsSymmetric and innerIsSymmetric\\n \\n return isSymmetricTree(root.left, root.right)\",\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\\nfrom collections import deque\\n\\nclass Solution:\\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n if root is None:\\n return True\\n\\n # 遞迴解\\n # return self.isSymmetricTree(root.left, root.right)\\n\\n # 迭代解\\n q = deque([(root.left, root.right)])\\n while q:\\n l, r = q.popleft()\\n if (l is None) and (r is None):\\n continue\\n if (l is None) or (r is None):\\n return False\\n if l.val != r.val:\\n return False\\n \\n q.append((l.left, r.right))\\n q.append((l.right, r.left))\\n\\n return True\\n\\n def isSymmetricTree(self, left: Optional[TreeNode], right: Optional[TreeNode]) -> bool: \\n if (left is None) and (right is None):\\n return True\\n if (left is None) or (right is None):\\n return False\\n if left.val != right.val:\\n return False\\n \\n return self.isSymmetricTree(left.left, right.right) and self.isSymmetricTree(left.right, right.left)\",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def symmetric(n1,n2):\\n #n1=left and n2=right\\n if not n1 and not n2:\\n return True\\n if not n1 or not n2:\\n return False\\n return n1.val==n2.val and symmetric(n1.right,n2.left) and symmetric(n1.left, n2.right)\\n return symmetric(root.left,root.right)\\n\\n\",\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 solve(self,r1,r2):\\n if not r1 and not r2:\\n return True\\n if not r1 or not r2:\\n return False\\n if r1.val!=r2.val:\\n return False\\n return r1.val==r2.val and self.solve(r1.left,r2.right) and self.solve(r1.right,r2.left)\\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n return self.solve(root.left,root.right)\\n \",\n \"runtime\": \"34\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def isMirror(n1: TreeNode, n2: TreeNode):\\n if not n1 and not n2:\\n return True\\n if not n1 or not n2:\\n return False\\n return n1.val == n2.val and isMirror(n1.right, n2.left) and isMirror(n1.left, n2.right)\\n return isMirror(root.left, root.right)\",\n \"runtime\": \"34\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n return self.isSame(root.left, root.right)\\n\\n def isSame(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:\\n if p is None or q is None:\\n return p == q\\n return p.val == q.val and self.isSame(p.left, q.right) and self.isSame(p.right, q.left)\",\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\\tdef isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n\\n\\t\\tdef check_mirror_image(root1, root2):\\n\\n\\t\\t\\tif root1 == None and root2 == None:\\n\\t\\t\\t\\treturn True\\n\\n\\t\\t\\tif root1 != None and root2 == None or root1 == None and root2 != None:\\n\\t\\t\\t\\treturn False\\n\\n\\t\\t\\tif root1.val == root2.val:\\n\\t\\t\\t\\treturn check_mirror_image(root1.left, root2.right) and check_mirror_image(root1.right, root2.left)\\n\\n\\t\\treturn check_mirror_image(root, root)\\n\\t\\t\\n\\n\\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n stack = [root.left, root.right]\\n while stack:\\n right = stack.pop()\\n left = stack.pop()\\n if not right and not left:\\n continue\\n\\n if (not right and left) or (right and not left) or right.val != left.val:\\n return False\\n stack.append(left.right)\\n stack.append(right.left)\\n stack.append(left.left)\\n stack.append(right.right)\\n return True\",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n \\n def helper(left, right):\\n if not left and not right:\\n return True\\n elif not left or not right:\\n return False\\n if left.val != right.val:\\n return False\\n return helper(left.left, right.right) and helper(left.right, right.left)\\n \\n return helper(root.left, root.right)\",\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 isMirror(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> bool:\\n if root1 is None and root2 is None:\\n return True\\n elif root1 is None or root2 is None:\\n return False\\n else:\\n return root1.val == root2.val and self.isMirror(root1.left, root2.right) and self.isMirror(root1.right, root2.left)\\n\\n\\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n return self.isMirror(root, root)\",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def check(left, right):\\n if not left and not right:\\n return True\\n if not left or not right:\\n return False\\n\\n if left.val != right.val:\\n return False\\n \\n return check(left.left, right.right) and check (left.right, right.left)\\n\\n return check(root.left, root.right)\\n\\n\\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\\n\\nfrom collections import deque\\n\\nclass Solution:\\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n\\n if not root:\\n return True\\n\\n def oposite_traversal(left_node, right_node):\\n\\n if (not left_node and right_node) or (left_node and not right_node):\\n return False\\n elif not left_node and not right_node:\\n return True\\n else:\\n if left_node.val == right_node.val:\\n return oposite_traversal(left_node.left, right_node.right) and oposite_traversal(left_node.right, right_node.left)\\n else:\\n return False\\n\\n return oposite_traversal(root.left, root.right)\\n \\n\\n\\n\\n\\n \",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def is_mirror(t1, t2):\\n if t1 is None and t2 is None:\\n return True\\n if t1 is None or t2 is None:\\n return False\\n return t1.val == t2.val and is_mirror(t1.right, t2.left) and is_mirror(t1.left, t2.right)\\n return is_mirror(root, root)\",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n if root is None:\\n return True\\n \\n\\n queue = [(root.left, root.right)]\\n\\n\\n while queue:\\n node = queue.pop(0)\\n left, right = node\\n\\n if left == None and right == None:\\n continue\\n if left == None and right:\\n return False \\n if left and right == None:\\n return False \\n if left.val == right.val:\\n queue.append((left.left, right.right))\\n queue.append((left.right, right.left))\\n\\n if left and right:\\n if left.val != right.val:\\n return False\\n return True\\n\\n\\n\\n\\n\\n\\n\\n \\\"\\\"\\\" if node.left:\\n if node.left.left.val == node.right.right.val:\\n queue.append(node.left.left)\\n print(node.left.left.val)\\n else:\\n queue.append(node.left.right)\\n print(node.left.right.val)\\n else:\\n return False\\n\\n\\n if node.right:\\n if node.right.left.val == node.left.right.val:\\n queue.append(node.right.left)\\n print(node.right.left.val)\\n else:\\n queue.append(node.right.left)\\n print(node.right.left.val)\\n else:\\n return False\\n\\n print(queue)\\\"\\\"\\\"\",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n if root is None:\\n return True\\n \\n\\n queue = [(root.left, root.right)]\\n\\n\\n while queue:\\n node = queue.pop(0)\\n left, right = node\\n\\n if left == None and right == None:\\n continue\\n\\n if left == None and right:\\n return False \\n\\n if left and right == None:\\n return False \\n\\n if left.val == right.val:\\n queue.append((left.left, right.right))\\n queue.append((left.right, right.left))\\n\\n if left and right:\\n if left.val != right.val:\\n return False\\n\\n return True\",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def check(root1,root2):\\n if root1 is None and root2 is None:\\n return True\\n if root1 is not None and root2 is not None:\\n if root1.val == root2.val:\\n return check(root1.left,root2.right) and check(root1.right,root2.left)\\n return False\\n return check(root,root)\",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n # 先中序遍歷\\n def isMirror(left, right):\\n # 如果左右都是空的話，代表是對稱的\\n if not left and not right:\\n return True\\n if not left or not right:\\n return False\\n # 左右子樹的根節點值是否相等，且左子樹的左節點等於右子樹的右節點，左子樹的右節點等於右子樹的左節點\\n return (left.val == right.val) and isMirror(left.left, right.right) and isMirror(left.right, right.left)\\n if not root:\\n return True\\n # 檢查左右子樹是否對稱\\n return isMirror(root.left, root.right)\\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 two_symmetric(self, root1, root2):\\n if root1 is None and root2 is None:\\n return True\\n if root1 is None or root2 is None:\\n return False\\n if root1.val != root2.val :\\n return False\\n return self.two_symmetric(root1.left, root2.right) and self.two_symmetric(root1.right, root2.left)\\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n return self.two_symmetric(root.left, root.right)\\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n\\n lefta=[root.left]\\n righta=[root.right]\\n\\n\\n while lefta and righta:\\n l=lefta.pop(0)\\n r=righta.pop(0)\\n\\n\\n if l==None and r==None:\\n continue\\n \\n if l==None or r==None or l.val!=r.val:\\n return False\\n \\n \\n\\n \\n \\n lefta.append(l.left)\\n lefta.append(l.right)\\n righta.append(r.right)\\n righta.append(r.left)\\n \\n return True\\n \\n \\n\\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def go(a, b):\\n if a == None and b:\\n return False\\n elif b == None and a:\\n return False \\n elif a == b == None:\\n return True\\n return a.val == b.val and go(a.left, b.right) and go(a.right, b. left)\\n \\n return go(root.left, root.right)\",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n l, r = root.left, root.right\\n def calc(a,b):\\n if not a and not b:\\n return True\\n if not a or not b:\\n return False\\n \\n l = calc(a.left, b.right)\\n r = calc(a.right, b.left)\\n\\n equal = a.val == b.val\\n\\n return l and r and equal\\n return calc(l,r)\\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\\nfrom collections import deque\\n\\nclass Solution:\\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n if root is None:\\n return True\\n\\n # 遞迴解\\n # return self.isSymmetricTree(root.left, root.right)\\n\\n # 迭代解\\n q = deque([(root.left, root.right)])\\n while q:\\n l, r = q.popleft()\\n if (l is None) and (r is None):\\n continue\\n if (l is None) or (r is None):\\n return False\\n if l.val != r.val:\\n return False\\n\\n q.append((l.left, r.right))\\n q.append((l.right, r.left))\\n return True\\n \\n def isSymmetricTree(self, left: Optional[TreeNode], right: Optional[TreeNode]) -> bool: \\n if (left is None) and (right is None):\\n return True\\n if (left is None) or (right is None):\\n return False\\n if left.val != right.val:\\n return False\\n \\n return self.isSymmetricTree(left.left, right.right) and self.isSymmetricTree(left.right, right.left)\",\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 isMirror(self, r1, r2):\\n if not r1 and not r2:\\n return True\\n if r1 and not r2 or not r1 and r2:\\n return False \\n return r1.val == r2.val and self.isMirror(r1.right, r2.left) and self.isMirror(r1.left, r2.right)\\n \\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n return self.isMirror(root, root)\\n \",\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 check(self, left, right):\\n # base case\\n if left is None and right is None:\\n return True\\n if left is None or right is None or left.val != right.val:\\n return False\\n \\n return self.check(left.left, right.right) and self.check(left.right, right.left)\\n \\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n return self.check(root.left, root.right)\",\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def is_mirror(n1, n2):\\n if not n1 and not n2:\\n return True\\n if not n1 or not n2:\\n return False\\n return n1.val == n2.val and is_mirror(n1.left, n2.right) and is_mirror(n1.right, n2.left)\\n \\n return is_mirror(root.left, root.right)\",\n \"runtime\": \"44\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":52,"string":"52"},"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n return self.isSame(root.left, root.right)\n \n def isSame(self, leftroot, rightroot):\n if leftroot == None and rightroot == None:\n return True\n \n if leftroot == None or rightroot == None:\n return False\n \n if leftroot.val != rightroot.val:\n return False\n \n return self.isSame(leftroot.left, rightroot.right) and self.isSame(leftroot.right, rightroot.left)","memory":"16000"},{"code":"class Solution(object):\n def isMirror(self, left, right):\n if not left and not right:\n return True\n if not left or not right:\n return False\n return left.val == right.val and self.isMirror(left.left, right.right) and self.isMirror(left.right, right.left)\n \n def isSymmetric(self, root):\n if not root:\n return True\n return self.isMirror(root.left, root.right)","memory":"16200"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def go(a, b):\n if a == b == None:\n return True\n elif not a or not b:\n return False\n return a.val == b.val and go(a.left, b.right) and go(a.right, b. left)\n \n return go(root.left, root.right)","memory":"16300"},{"code":"class Solution(object):\n def isMirror(self, left, right):\n if not left and not right:\n return True\n if not left or not right:\n return False\n return left.val == right.val and self.isMirror(left.left, right.right) and self.isMirror(left.right, right.left)\n \n def isSymmetric(self, root):\n if not root:\n return True\n return self.isMirror(root.left, root.right)\n","memory":"16300"},{"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 isMirror(self, r1, r2):\n if not r1 and not r2:\n return True\n if r1 and not r2 or not r1 and r2:\n return False \n return r1.val == r2.val and self.isMirror(r1.right, r2.left) and self.isMirror(r1.left, r2.right)\n \n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return root\n return self.isMirror(root.left, root.right)\n ","memory":"16400"},{"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 two_symmetric(self, root1, root2):\n if root1 is None and root2 is None:\n return True\n if root1 is None or root2 is None:\n return False\n if root1.val != root2.val :\n return False\n return self.two_symmetric(root1.left, root2.right) and self.two_symmetric(root1.right, root2.left)\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n return self.two_symmetric(root.left, root.right)\n ","memory":"16400"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n if root == None:\n return True\n def dfs(left, right):\n if left == right == None:\n return True\n if left == None and right != None:\n return False\n if left != None and right == None:\n return False\n if left != None and right != None and left.val != right.val:\n return False\n return dfs(left.left, right.right) and dfs(left.right, right.left)\n return dfs(root.left, root.right)","memory":"16500"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def is_mirror(t1, t2):\n if t1 is None and t2 is None:\n return True\n\n if t1 is None or t2 is None:\n return False\n\n return (\n t1.val == t2.val\n and is_mirror(t1.left, t2.right)\n and is_mirror(t1.right, t2.left)\n )\n\n if not root:\n return True\n\n return is_mirror(root.left, root.right)","memory":"16500"},{"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\nfrom collections import deque\nclass Solution:\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\n def mirror(l,r):\n if l is None and r is None:\n return True\n \n\n if (not l or not r) or l.val!=r.val:\n return False\n\n left=mirror(l.left,r.right)\n right=mirror(l.right,r.left)\n\n return left and right\n \n return mirror(root.left,root.right)","memory":"16600"},{"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n\n return self.isSame(root.left, root.right)\n\n def isSame(self, left, right):\n if not left and not right:\n return True\n if not left or not right:\n return False\n return left.val == right.val and self.isSame(left.left, right.right) and self.isSame(left.right, right.left)\n\n # if not root:\n # return True\n\n # # Initialize a queue to hold pairs of nodes to be compared\n # queue = deque([(root.left, root.right)])\n\n # while queue:\n # left, right = queue.popleft()\n\n # # If both nodes are None, continue to the next pair\n # if not left and not right:\n # continue\n\n # # If one of them is None or their values don't match, it's not symmetric\n # if not left or not right or left.val != right.val:\n # return False\n\n # # Enqueue the children in opposite order for symmetry check\n # queue.append((left.left, right.right))\n # queue.append((left.right, right.left))\n\n # return True\n","memory":"16600"}],"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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n return self.isSame(root.left, root.right)\\n \\n def isSame(self, leftroot, rightroot):\\n if leftroot == None and rightroot == None:\\n return True\\n \\n if leftroot == None or rightroot == None:\\n return False\\n \\n if leftroot.val != rightroot.val:\\n return False\\n \\n return self.isSame(leftroot.left, rightroot.right) and self.isSame(leftroot.right, rightroot.left)\",\n \"memory\": \"16000\"\n },\n {\n \"code\": \"class Solution(object):\\n def isMirror(self, left, right):\\n if not left and not right:\\n return True\\n if not left or not right:\\n return False\\n return left.val == right.val and self.isMirror(left.left, right.right) and self.isMirror(left.right, right.left)\\n \\n def isSymmetric(self, root):\\n if not root:\\n return True\\n return self.isMirror(root.left, root.right)\",\n \"memory\": \"16200\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def go(a, b):\\n if a == b == None:\\n return True\\n elif not a or not b:\\n return False\\n return a.val == b.val and go(a.left, b.right) and go(a.right, b. left)\\n \\n return go(root.left, root.right)\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution(object):\\n def isMirror(self, left, right):\\n if not left and not right:\\n return True\\n if not left or not right:\\n return False\\n return left.val == right.val and self.isMirror(left.left, right.right) and self.isMirror(left.right, right.left)\\n \\n def isSymmetric(self, root):\\n if not root:\\n return True\\n return self.isMirror(root.left, root.right)\\n\",\n \"memory\": \"16300\"\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 isMirror(self, r1, r2):\\n if not r1 and not r2:\\n return True\\n if r1 and not r2 or not r1 and r2:\\n return False \\n return r1.val == r2.val and self.isMirror(r1.right, r2.left) and self.isMirror(r1.left, r2.right)\\n \\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return root\\n return self.isMirror(root.left, root.right)\\n \",\n \"memory\": \"16400\"\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 two_symmetric(self, root1, root2):\\n if root1 is None and root2 is None:\\n return True\\n if root1 is None or root2 is None:\\n return False\\n if root1.val != root2.val :\\n return False\\n return self.two_symmetric(root1.left, root2.right) and self.two_symmetric(root1.right, root2.left)\\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n return self.two_symmetric(root.left, root.right)\\n \",\n \"memory\": \"16400\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n if root == None:\\n return True\\n def dfs(left, right):\\n if left == right == None:\\n return True\\n if left == None and right != None:\\n return False\\n if left != None and right == None:\\n return False\\n if left != None and right != None and left.val != right.val:\\n return False\\n return dfs(left.left, right.right) and dfs(left.right, right.left)\\n return dfs(root.left, root.right)\",\n \"memory\": \"16500\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def is_mirror(t1, t2):\\n if t1 is None and t2 is None:\\n return True\\n\\n if t1 is None or t2 is None:\\n return False\\n\\n return (\\n t1.val == t2.val\\n and is_mirror(t1.left, t2.right)\\n and is_mirror(t1.right, t2.left)\\n )\\n\\n if not root:\\n return True\\n\\n return is_mirror(root.left, root.right)\",\n \"memory\": \"16500\"\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\\nfrom collections import deque\\nclass Solution:\\n def isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n def mirror(l,r):\\n if l is None and r is None:\\n return True\\n \\n\\n if (not l or not r) or l.val!=r.val:\\n return False\\n\\n left=mirror(l.left,r.right)\\n right=mirror(l.right,r.left)\\n\\n return left and right\\n \\n return mirror(root.left,root.right)\",\n \"memory\": \"16600\"\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 isSymmetric(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n\\n return self.isSame(root.left, root.right)\\n\\n def isSame(self, left, right):\\n if not left and not right:\\n return True\\n if not left or not right:\\n return False\\n return left.val == right.val and self.isSame(left.left, right.right) and self.isSame(left.right, right.left)\\n\\n # if not root:\\n # return True\\n\\n # # Initialize a queue to hold pairs of nodes to be compared\\n # queue = deque([(root.left, root.right)])\\n\\n # while queue:\\n # left, right = queue.popleft()\\n\\n # # If both nodes are None, continue to the next pair\\n # if not left and not right:\\n # continue\\n\\n # # If one of them is None or their values don't match, it's not symmetric\\n # if not left or not right or left.val != right.val:\\n # return False\\n\\n # # Enqueue the children in opposite order for symmetry check\\n # queue.append((left.left, right.right))\\n # queue.append((left.right, right.left))\\n\\n # return True\\n\",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":10,"string":"10"}}},{"rowIdx":155,"cells":{"question_id":{"kind":"number","value":102,"string":"102"},"name":{"kind":"string","value":"binary-tree-level-order-traversal"},"content":{"kind":"string","value":"<p>Given the <code>root</code> of a binary tree, return <em>the level order traversal of its nodes' values</em>. (i.e., from left to right, level by level).</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/02/19/tree1.jpg\" style=\"width: 277px; height: 302px;\" />\n<pre>\n<strong>Input:</strong> root = [3,9,20,null,null,15,7]\n<strong>Output:</strong> [[3],[9,20],[15,7]]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> root = [1]\n<strong>Output:</strong> [[1]]\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> root = []\n<strong>Output:</strong> []\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>[0, 2000]</code>.</li>\n\t<li><code>-1000 <= Node.val <= 1000</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":68.489865932176,"string":"68.489866"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["tree","breadth-first-search","binary-tree"],"string":"[\n \"tree\",\n \"breadth-first-search\",\n \"binary-tree\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16\", 0.0065], [\"18\", 0.0065], [\"19\", 0.0326], [\"20\", 0.0228], [\"21\", 0.0163], [\"22\", 0.0522], [\"23\", 0.2055], [\"24\", 0.0816], [\"25\", 0.1664], [\"26\", 0.2838], [\"27\", 0.7177], [\"28\", 0.4698], [\"29\", 0.8058], [\"30\", 1.4876], [\"31\", 2.5478], [\"32\", 1.5235], [\"33\", 2.1465], [\"34\", 4.6454], [\"35\", 5.7709], [\"36\", 3.7483], [\"37\", 4.13], [\"38\", 8.3937], [\"39\", 8.3317], [\"40\", 5.9405], [\"41\", 5.4544], [\"42\", 8.8047], [\"43\", 7.9109], [\"44\", 5.5653], [\"45\", 4.3779], [\"46\", 4.8607], [\"47\", 3.7515], [\"48\", 2.414]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16500\", 0.0065], [\"16600\", 0.0065], [\"16700\", 0.0163], [\"16800\", 0.0424], [\"16900\", 0.3458], [\"17000\", 5.9242], [\"17100\", 23.7294], [\"17200\", 40.1318], [\"17300\", 19.9354]]}"},"rt_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\n\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n res=[]\n q= deque()\n\n\n if root:\n q.append(root)\n\n while q:\n val=[]\n for i in range(len(q)):\n node=q.popleft()\n val.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n res.append(val)\n return res\n\n ","runtime":"16"},{"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# depth-first solution\n\n# class Solution:\n# def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n# hashmap = defaultdict(list)\n\n# def dfs(node, level):\n\n# if not node:\n# return\n \n# hashmap[level].append(node.val)\n\n# dfs(node.left, level + 1)\n# dfs(node.right, level + 1)\n\n# dfs(root, 0)\n\n# return hashmap.values()\n\n\n# breadth-first solution\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n res = []\n q = collections.deque()\n q.append(root)\n\n while q:\n qLen = len(q)\n level = []\n\n for i in range(qLen):\n node = q.popleft()\n if node:\n level.append(node.val)\n q.append(node.left)\n q.append(node.right)\n if level:\n res.append(level)\n \n return res\n\n \n\n\n","runtime":"20"},{"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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n res = []\n if not root:\n return res\n q = deque()\n q.append(root)\n while q:\n size = len(q)\n temp = []\n while size:\n node = q.popleft()\n temp.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n size -= 1\n res.append(temp)\n return res","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return \n\n traversal = []\n queue = deque([root])\n\n while queue:\n qLen = len(queue)\n level = []\n for i in range(qLen):\n node = queue.popleft()\n level.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n traversal.append(level)\n \n return traversal","runtime":"22"},{"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\nfrom collections import deque\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n queue=deque([root])\n res=[]\n while queue:\n level=[]\n size=len(queue)\n for _ in range(size):\n popped=queue.popleft()\n level.append(popped.val)\n if popped.left:\n queue.append(popped.left)\n if popped.right:\n queue.append(popped.right)\n res.append(level)\n return res","runtime":"23"},{"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\nfrom collections import deque\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n res = []\n\n queue = deque([root])\n\n if not root:\n return []\n\n while queue:\n level_size = len(queue)\n level_list = []\n\n for _ in range(level_size):\n node = queue.popleft()\n level_list.append(node.val)\n\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n\n res.append(level_list)\n\n return res","runtime":"24"},{"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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root == None:\n return []\n result = []\n # BFS is a level order traversal \n d = deque([root])\n while d:\n subList = [] \n for _ in range(len(d)):\n n = d.popleft()\n subList.append(n.val)\n if n.left:\n d.append(n.left)\n if n.right:\n d.append(n.right)\n result.append(subList)\n return result","runtime":"25"},{"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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n ans = []\n queue = collections.deque()\n if root:\n queue.append(root)\n while queue:\n level = []\n for i in range(len(queue)):\n node = queue.popleft()\n level.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n ans.append(level)\n return ans\n ","runtime":"25"},{"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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n q = []\n if not root:\n return []\n q.append(root)\n res=[]\n while q:\n l = []\n nextNodes=[]\n for n in range(len(q)):\n node = q[n]\n l.append(node.val)\n if node.left:\n nextNodes.append(node.left)\n if node.right:\n nextNodes.append(node.right)\n q = []\n res.append(l)\n for n in nextNodes:\n q.append(n)\n return res\n ","runtime":"26"},{"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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n\n sol_list = []\n\n node_queue: Deque[TreeNode] = Deque()\n node_queue.append(root)\n\n while len(node_queue) > 0:\n # The number of nodes in the queue at the start of each level will dictate how many nodes we pick from it\n num_curr_level_nodes = len(node_queue)\n\n level_nodes = [] # Store the nodes of this level\n for _ in range(num_curr_level_nodes):\n # Using a Deque makes the pop operationg from the beggining O(1) instead of O(n)\n curr_node = node_queue.popleft()\n\n if curr_node.val != None:\n # Add the children to the queue of nodes to be visited\n if curr_node.left:\n node_queue.append(curr_node.left)\n\n if curr_node.right:\n node_queue.append(curr_node.right)\n\n level_nodes.append(curr_node.val)\n\n # See if the currLevel is only Filler TreeNodes\n if level_nodes:\n sol_list.append(level_nodes) # Add the list with the nodes from this level\n \n return sol_list","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\nfrom collections import deque\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n Q = deque([root])\n levels = [[root.val]]\n temp = deque()\n\n while Q:\n node = Q.popleft()\n if node.left: temp.append(node.left)\n if node.right: temp.append(node.right)\n \n if not Q:\n if temp:\n levels.append([n.val for n in temp])\n Q = temp\n temp = deque()\n\n return levels\n ","runtime":"27"},{"code":"from collections import deque\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return None\n queue = deque([(root, 0)])\n visited_set = set({root})\n cur_level = 0\n cur_nodes = [root.val]\n result = []\n while queue:\n node, level = queue.pop()\n neighbors = [node.left, node.right]\n for neighbor in neighbors:\n if neighbor and neighbor not in visited_set:\n visited_set.add(neighbor)\n neighbor_level = level + 1\n queue.appendleft((neighbor, neighbor_level))\n if cur_level != neighbor_level:\n result.append(cur_nodes)\n cur_nodes = [neighbor.val]\n else:\n cur_nodes.append(neighbor.val)\n cur_level = neighbor_level\n result.append(cur_nodes)\n return result\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\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n res = []\n q = []\n q.append(root)\n if not root:\n return res \n while q:\n tmp = []\n for i in range(len(q)):\n node = q.pop(0)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n tmp.append(node.val)\n res.append(tmp)\n \n return res","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\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n queue = deque()\n queue.append(root)\n\n level_order = []\n while queue:\n cur_level = []\n for i in range(len(queue)):\n node = queue.popleft()\n\n cur_level.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n level_order.append(cur_level)\n\n return level_order\n","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n q = [root]\n ans = []\n while q:\n next_level = []\n nums = []\n for node in q:\n nums.append(node.val)\n if node.left:\n next_level.append(node.left)\n if node.right:\n next_level.append(node.right)\n ans.append(nums)\n q = next_level\n return ans\n ","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n def dfs(node, level):\n if not node:\n return\n if len(res) == level:\n res.append([]) # Start a new level\n res[level].append(node.val) # Add the current node's value to its level\n # Recur for left and right children, increasing the level by 1\n dfs(node.left, level + 1)\n dfs(node.right, level + 1)\n res = []\n dfs(root, 0) # Start the DFS with the root at level 0\n return res\n ","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n result = []\n if not root:\n return result\n result.append([root.val])\n nodelist = [[root]]\n order = 0\n while order < len(nodelist):\n resulttemp = []\n nodelisttemp = []\n for i in range(len(nodelist[order])):\n node = nodelist[order][i]\n if node.left != None:\n resulttemp.append(node.left.val)\n nodelisttemp.append(node.left)\n if node.right != None:\n resulttemp.append(node.right.val)\n nodelisttemp.append(node.right)\n if resulttemp:\n nodelist.append(nodelisttemp)\n result.append(resulttemp)\n order += 1\n return result\n \n ","runtime":"31"},{"code":"from queue import Queue\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n q=Queue()\n ans=[]\n q.put(root)\n node=root\n if root is None:\n return ans\n while not q.empty():\n level=[]\n length=q.qsize()\n for i in range(0,length):\n node=q.get()\n if node.left is not None:\n q.put(node.left)\n if node.right is not None:\n q.put(node.right)\n level.append(node.val)\n ans.append(level)\n return ans\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n \n from collections import deque\n\n queue = deque([root])\n levels = []\n\n while queue:\n level = []\n for _ in range(len(queue)):\n node = queue.popleft()\n if node:\n level.append(node.val)\n queue.append(node.left)\n queue.append(node.right)\n levels.append(level)\n \n levels.pop()\n return levels\n\n\n\n \n\n \n\n \n \n\n\n\n \n\n\n\n","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root: return []\n q = collections.deque()\n q.append(root)\n res = []\n temp = []\n\n while q:\n temp = []\n for i in range(len(q)):\n cur = q.popleft()\n temp.append(cur.val)\n if cur.left: q.append(cur.left)\n if cur.right: q.append(cur.right) \n\n res.append(temp) \n\n return res \n ","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n\n ans = []\n queue = deque([root])\n\n while queue:\n level = []\n n = len(queue)\n\n for i in range(n):\n node = queue.popleft()\n level.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n ans.append(level)\n\n return ans\n\n ","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\nfrom collections import deque\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n ans=[]\n if root==None:\n return\n\n q = deque([root])\n while q:\n curr_level = len(q)\n level=[]\n\n for _ in range(curr_level):\n node = q.popleft()\n level.append(node.val)\n\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n\n ans.append(level)\n\n return ans\n ","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n res = []\n def helper(node, level):\n if not node:\n return\n\n if level >= len(res):\n res.append([])\n \n res[level].append(node.val)\n\n helper(node.left, level + 1)\n helper(node.right, level + 1)\n \n helper(root, 0)\n return res\n\n ","runtime":"34"},{"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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return None\n res = []\n\n q = deque([root])\n while q:\n qLen = len(q)\n level = []\n for _ in range(qLen):\n node = q.popleft()\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n level.append(node.val)\n res.append(level)\n return res\n \n \n\n ","runtime":"34"},{"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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n ans=[]\n if not root:\n return ans\n q = deque()\n q.append(root)\n while q:\n size=len(q)\n level=[]\n for i in range(size):\n node=q.popleft()\n level.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n ans.append(level)\n return ans","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n result = []\n qu = deque()\n qu.append(root)\n while qu:\n tmp = []\n children = []\n while qu:\n current = qu.popleft()\n tmp.append(current.val)\n if current.left:\n children.append(current.left)\n if current.right:\n children.append(current.right)\n qu.extend(children)\n result.append(tmp)\n return result\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\n def levelOrder(self, root: TreeNode):\n\n if not root:\n\n return []\n\n \n\n result = []\n\n queue = deque([root])\n\n \n\n while queue:\n\n level = []\n\n for i in range(len(queue)):\n\n node = queue.popleft()\n\n level.append(node.val)\n\n if node.left:\n\n queue.append(node.left)\n\n if node.right:\n\n queue.append(node.right)\n\n result.append(level)\n\n \n\n return result\n\n ","runtime":"36"},{"code":"class Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n self.d=defaultdict(list)\n def foo(x,depth):\n self.d[depth].append(x.val)\n if x.left: foo(x.left,depth+1)\n if x.right: foo(x.right,depth+1)\n if root: foo(root,0)\n return [self.d[i] for i in sorted(self.d.keys())]","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root is None:\n return []\n \n queue=[root]\n next_queue=[]\n level=[]\n result=[]\n while queue != []:\n for root in queue:\n level.append(root.val)\n if root.left is not None:\n next_queue.append(root.left)\n if root.right is not None:\n next_queue.append(root.right)\n result.append(level)\n level=[]\n queue=next_queue\n next_queue=[]\n return result","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n queue = deque()\n queue.append(root)\n res = []\n\n if not root:\n return res\n\n while queue:\n qLen = len(queue)\n level = []\n for i in range(qLen):\n curr = queue.popleft()\n level.append(curr.val)\n if curr.left:\n queue.append(curr.left)\n if curr.right:\n queue.append(curr.right)\n res.append(level)\n\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\nfrom collections import deque\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root is None:\n return None\n \n queue = deque();\n queue.append(root)\n ans = []\n\n while queue:\n level = []\n n= len(queue)\n\n for i in range(n):\n node = queue.popleft()\n level.append(node.val)\n\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n\n ans.append(level)\n\n return ans\n\n\n\n\n ","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\nfrom collections import deque\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n res = []\n q = deque([])\n q.appendleft([root, 0])\n while q:\n node, level = q.popleft()\n if len(res) < level + 1:\n res.append([node.val])\n else:\n res[level].append(node.val)\n if node.left is not None:\n q.append([node.left, level+1])\n if node.right is not None:\n q.append([node.right, level+1])\n \n return res","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n if root:\n from collections import deque\n deque_nodes = deque([root]) # 3-ка \n # | [9,20] \n # / [20]\n res_itog = []\n while deque_nodes:\n level_size = len(deque_nodes) # len(3-ка) = 1 \n # | 2 \n # / 1\n nodes_of_this_level = []\n for i in range(level_size):\n node = deque_nodes.popleft() # node = 3-ка, deque_nodes = [] \n # | node = 9-ка, deque_nodes = [20] \n # / node = 20-ка, deque_nodes = []\n nodes_of_this_level.append(node.val) # nodes_of_this_level = [].append(3.val) ===> nodes_of_this_level = [3] \n # | nodes_of_this_level = [].append(9.val) ===> nodes_of_this_level = [9] \n # / nodes_of_this_level = [9].append(20.val) ===> nodes_of_this_level = [9,20]\n if node.left: # 3-ка имеет левый дочерний элемент ===> \n # | 9-ка не имеет левый дочерний элемент ===> else: deque_nodes ===> deque_nodes = [20] \n # / 20-ка имеет левый дочерний элемент ===> \n deque_nodes.append(node.left) # deque_nodes = [].append(3.left) = [].append(9-ка) ===> deque_nodes = [9] \n # / deque_nodes = [].append(20.left) = [].append(15-ка) ===> deque_nodes = [15]\n if node.right: # 3-ка имеет правый дочерний элемент ===> \n # / 20-ка имеет правый дочерний элемент ===>\n deque_nodes.append(node.right) # deque_nodes = [9].append(3.right) = [9].append(20-ка) ===> deque_nodes = [9,20] \n # / deque_nodes = [15].append(20.right) = [9].append(7-ка) ===> deque_nodes = [15,7]\n else:\n deque_nodes\n res_itog.append(nodes_of_this_level)\n return res_itog\n\n#root = TreeNode(3)\n#node2 = TreeNode(9)\n#node3 = TreeNode(20)\n#node4 = TreeNode(15)\n#node5 = TreeNode(7)\n#root.left = node2\n#root.right = node3\n#node3.left = node4\n#node3.right = node5\n#\n#ss = Solution()\n#print(ss.levelOrder(root))\n\n\n\n\n# Нам дано Двоичное Древо root = [3,9,20,null,null,15,7]\n# 3\n# 9 20\n# None None 15 7\n# Нам нужно пройти по этажам этого дерева и записать какие узлы есть на каком этаже, \n# т.е. нам нужно найти [[3],[9,20],[15,7]]\n\n\n# Принцип Решения через BFS:\n# 1) root = [3,9,20,null,null,15,7]\n# 2) deque_nodes = deque([root]) = 3-ке, т.к. root = TreeNode(3), res_itog = [], \n# level_size = len(deque_nodes) = len(3-ка) = 1, nodes_of_this_level = []\n# for i in range(level_size) ===> for i in range(1) ===> \n# node = deque_nodes.popleft() ===> node = 3-ке, а после этого deque_nodes = [],\n# nodes_of_this_level.append(node.val) ===> [].append(3-ка.val) ===>\n# nodes_of_this_level = [3]\n# if node.left: ===> 3-ка имеет левый дочерний элемент ===> \n# deque_nodes.append(node.left) ===> [].append(3.left) ===> [].append(9-ка),\n# deque_nodes = [9]\n# if node.right: ===> 3-ка имеет правый дочерний элемент ===> \n# deque_nodes.append(node.right) ===> [9].append(3.right) ===> [9].append(20-ка),\n# deque_nodes = [9,20]\n# res_itog.append(nodes_of_this_level) ===> [].append(nodes_of_this_level) ===>\n# [].append([3]) ===> res_itog = [[3]]\n\n# 3.1) deque_nodes = deque([9,20]), res_itog = [[3]], \n# level_size = len(deque_nodes) = len([9,20]) = 2, nodes_of_this_level = []\n# for i in range(level_size) ===> for i in range(2) ===> \n# node = deque_nodes.popleft() ===> node = 9-ке, а после этого deque_nodes = [20],\n# nodes_of_this_level.append(node.val) ===> [].append(9-ка.val) ===>\n# nodes_of_this_level = [9]\n# if not node.left, т.е. else: deque_nodes ===> deque_nodes = [20]\n# if not node.right, т.е. else: deque_nodes ===> deque_nodes = [20]\n\n# 3.2) deque_nodes = deque([20]), res_itog = [[3]], \n# level_size = len(deque_nodes) = len([20]) = 1, nodes_of_this_level = [9]\n# for i in range(level_size) ===> for i in range(1) ===> \n# node = deque_nodes.popleft() ===> node = 20-ке, а после этого deque_nodes = [],\n# nodes_of_this_level.append(node.val) ===> [9].append(20-ка.val) ===>\n# nodes_of_this_level = [9,20]\n# if node.left: ===> 20-ка имеет левый дочерний элемент ===> \n# deque_nodes.append(node.left) ===> [].append(20.left) ===> [].append(15-ка),\n# deque_nodes = [15]\n# if node.right: ===> 20-ка имеет правый дочерний элемент ===> \n# deque_nodes.append(node.right) ===> [15].append(20.right) ===> [15].append(7-ка),\n# deque_nodes = [15,7]\n# res_itog.append(nodes_of_this_level) ===> [3].append(nodes_of_this_level) ===>\n# [3].append([9,20]) ===> res_itog = [[3],[9,20]]\n\n# 4.1) deque_nodes = deque([15,7]), res_itog = [[3],[9,20]], \n# level_size = len(deque_nodes) = len([15,7]) = 2, nodes_of_this_level = []\n# for i in range(level_size) ===> for i in range(2) ===> \n# node = deque_nodes.popleft() ===> node = 15-ке, а после этого deque_nodes = [7],\n# nodes_of_this_level.append(node.val) ===> [].append(15-ка.val) ===>\n# nodes_of_this_level = [15]\n# if not node.left, т.е. else: deque_nodes ===> deque_nodes = [7]\n# if not node.right, т.е. else: deque_nodes ===> deque_nodes = [7]\n\n# 4.2) deque_nodes = deque([7]), res_itog = [[3],[9,20]], \n# level_size = len(deque_nodes) = len([7]) = 1, nodes_of_this_level = [15]\n# for i in range(level_size) ===> for i in range(1) ===> \n# node = deque_nodes.popleft() ===> node = 7-ке, а после этого deque_nodes = [],\n# nodes_of_this_level.append(node.val) ===> [15].append(7-ка.val) ===>\n# nodes_of_this_level = [15,7]\n# if not node.left, т.е. else: deque_nodes ===> deque_nodes = []\n# if not node.right, т.е. else: deque_nodes ===> deque_nodes = []\n# res_itog.append(nodes_of_this_level) ===> [[3],[9,20]].append(nodes_of_this_level) ===>\n# [[3],[9,20]].append([15,7]) ===> res_itog = [[3],[9,20],[15,7]]\n\n\n\n# Для понимания (часть 1):\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 levelOrder(self, root): \n# if not root:\n# return []\n# if root:\n# from collections import deque\n# deque_root = deque([root.val]) !!!!!!!!!!!!!!!!!!!!\n# return deque_root\n#\n#root = TreeNode(119)\n#ss = Solution()\n#print(ss.levelOrder(root))\n\n\n# Для понимания (часть 2):\n# root = [3,9,20,0,0,15,7]\n# from collections import deque\n# deque_root = deque(root)\n# deque_root ===> deque([3, 9, 20, 0, 0, 15, 7])\n\n# level_nodes = []\n# for i in range(1): !!!!!!!!!!\n# node = deque_root.popleft()\n# level_nodes.append(node)\n# level_nodes = [3]\n# deque_root ===> deque([9, 20, 0, 0, 15, 7])\n\n# level_nodes = []\n# for i in range(2): !!!!!!!!!!\n# node = deque_root.popleft()\n# level_nodes.append(node)\n# level_nodes = [9, 20]\n# deque_root ===> deque([0, 0, 15, 7])","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\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n \n if root is None:\n return []\n\n ans = []\n q = []\n\n q.append(root)\n\n while len(q) > 0:\n level_size = len(q)\n level = []\n\n for _ in range(level_size):\n curr = q.pop(0)\n level.append(curr.val)\n\n if curr.left is not None:\n q.append(curr.left)\n\n if curr.right is not None:\n q.append(curr.right)\n\n ans.append(level)\n\n return ans\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n \n queue = collections.deque([root])\n nodes_per_level = []\n\n while queue:\n len_queue = len(queue)\n this_level = []\n\n for i in range(0, len_queue):\n node = queue.popleft()\n this_level.append(node.val)\n\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n \n nodes_per_level.append(this_level)\n \n return nodes_per_level\n # last_level = [root]\n # nodes_per_level = []\n\n # while last_level:\n # new_level_nodes = []\n # last_level_vals = []\n\n # for a in last_level:\n # last_level_vals.append(a.val)\n # if a.left:\n # new_level_nodes.append(a.left)\n # if a.right:\n # new_level_nodes.append(a.right)\n \n # nodes_per_level.append(last_level_vals)\n # last_level = new_level_nodes\n \n # return nodes_per_level\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n q, nq = deque(), deque()\n q.append(root)\n res, level = [], []\n while q:\n node = q.popleft()\n if node:\n level.append(node.val)\n nq.append(node.left)\n nq.append(node.right)\n if len(q) == 0:\n q = nq\n nq = deque()\n if len(level) > 0:\n res.append(level)\n level = []\n return res\n\n\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root: return []\n res, stack = [], [[root]]\n\n while stack:\n nodes = stack.pop()\n currents = []\n childs = []\n for node in nodes:\n currents.append(node.val)\n if node.left: childs.append(node.left)\n if node.right: childs.append(node.right)\n\n res.append(currents)\n if childs: stack.append(childs)\n\n return res","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n output = []\n queue = collections.deque()\n if root:\n queue.append(root)\n else:\n return []\n i = 0\n while queue:\n queue_len = len(queue) \n curr = []\n for i in range(queue_len):\n node = queue.popleft()\n if node:\n queue.append(node.left)\n queue.append(node.right)\n curr.append(node.val)\n if curr:\n output.append(curr)\n return output","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n output = []\n if not root:\n return output\n q = deque([root])\n while q:\n child = []\n size = len(q)\n for i in range(size):\n node = q.popleft()\n child.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n output.append(child)\n \n return output\n\n\n\n \n\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n result = []\n \n def traverse(node, level):\n if not node:\n return\n \n # If we are on a new level, append a new list to the result\n if len(result) == level:\n result.append([])\n \n result[level].append(node.val)\n \n traverse(node.left, level + 1)\n traverse(node.right, level + 1)\n \n traverse(root, 0)\n \n return result","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\n\nfrom collections import deque\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root is None:\n return []\n \n result = []\n que = deque([root])\n\n while que:\n level = []\n for _ in range(len(que)):\n cur = que.popleft()\n level.append(cur.val)\n if cur.left:\n que.append(cur.left)\n if cur.right:\n que.append(cur.right)\n result.append(level)\n return result\n ","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n \n if root:\n op=[[root.val]]\n else:\n return []\n \n que=[root]\n \n while que:\n o=[]\n for i in range(len(que)):\n r=que.pop(0)\n if r.left:\n que.append(r.left)\n o.append(r.left.val)\n if r.right:\n que.append(r.right)\n o.append(r.right.val)\n \n if o:\n op.append(o)\n return op\n \n \n ","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n res = []\n q = collections.deque()\n q.append(root)\n while q :\n qlen = len(q)\n level = []\n for i in range(qlen):\n node = q.popleft()\n if node:\n level.append(node.val)\n q.append(node.left)\n q.append(node.right)\n if level:\n res.append(level)\n return res","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n stack = [(root, 0)] # Stack will store tuples of (node, level)\n res = []\n while stack:\n node, level = stack.pop()\n if len(res) == level:\n res.append([]) # Start a new level\n res[level].append(node.val)\n # Push the right child first so that the left child is processed first\n if node.right:\n stack.append((node.right, level + 1))\n if node.left:\n stack.append((node.left, level + 1))\n \n return res\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n queue = deque([(0, root)])\n mem = []\n while queue:\n depth, node = queue.popleft()\n if depth >= len(mem):\n mem.append([node.val])\n else:\n mem[depth].append(node.val)\n if node.left:\n queue.append((depth+1,node.left))\n if node.right:\n queue.append((depth+1,node.right))\n return mem","runtime":"45"},{"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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n queue = []\n res = []\n if root is None:\n return res\n queue.append(root)\n while queue:\n cur_res = []\n size = len(queue)\n for _ in range(size):\n node = queue.pop(0)\n cur_res.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n res.append(cur_res)\n return res","runtime":"45"},{"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\nfrom collections import deque\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n finallst = []\n if not root:\n return finallst\n queue = deque([root])\n while queue:\n lst = []\n for x in range(len(queue)):\n node = queue.popleft()\n lst.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n finallst.append(lst) \n\n return finallst","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 res = None\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n self.res = []\n def rec(node, depth):\n if node is None:\n return\n if len(self.res) <= depth:\n self.res.append([])\n self.res[depth].append(node.val)\n rec(node.left, depth+1) or rec(node.right, depth+1)\n rec(root,0)\n return self.res\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n \n res = []\n if root == None:\n return res;\n\n queue = deque()\n\n queue.append((root, 0))\n\n while queue:\n\n node, level = queue.popleft()\n\n if len(res) <= level:\n res.append([])\n\n res[level].append(node.val)\n\n if node.left != None:\n queue.append((node.left, level+1))\n\n if node.right != None:\n queue.append((node.right, level+1))\n\n return res\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n def max_depth(root) :\n if not root :\n return 0\n return 1 + max(max_depth(root.left), max_depth(root.right))\n \n depth = max_depth(root)\n res = [[] for _ in range(depth)]\n def bfs(root,ht) :\n if not root :\n return None\n res[ht].append(root.val)\n bfs(root.left, ht+1)\n bfs(root.right, ht+1)\n \n \n \n bfs(root,0)\n return res \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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n stack = []\n output = [[]]\n level = 0\n n = 1\n def dfs(Node):\n stack.pop(0)\n output[level].append(Node.val)\n if Node.left:\n stack.append(Node.left)\n if Node.right:\n stack.append(Node.right)\n if not root:\n return []\n stack.append(root)\n while stack:\n dfs(stack[0])\n n -= 1\n if n == 0 and stack:\n level += 1\n output.append([])\n n = len(stack)\n return output","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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n res = []\n q = deque([root])\n if not root:\n return []\n while q:\n arr = []\n for _ in range(len(q)):\n curr = q.popleft()\n print(curr.val)\n arr.append(curr.val)\n if curr.left:\n q.append(curr.left)\n if curr.right:\n q.append(curr.right)\n res.append(arr)\n return res","runtime":"48"}],"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\\n\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res=[]\\n q= deque()\\n\\n\\n if root:\\n q.append(root)\\n\\n while q:\\n val=[]\\n for i in range(len(q)):\\n node=q.popleft()\\n val.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n res.append(val)\\n return res\\n\\n \",\n \"runtime\": \"16\"\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# depth-first solution\\n\\n# class Solution:\\n# def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n# hashmap = defaultdict(list)\\n\\n# def dfs(node, level):\\n\\n# if not node:\\n# return\\n \\n# hashmap[level].append(node.val)\\n\\n# dfs(node.left, level + 1)\\n# dfs(node.right, level + 1)\\n\\n# dfs(root, 0)\\n\\n# return hashmap.values()\\n\\n\\n# breadth-first solution\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res = []\\n q = collections.deque()\\n q.append(root)\\n\\n while q:\\n qLen = len(q)\\n level = []\\n\\n for i in range(qLen):\\n node = q.popleft()\\n if node:\\n level.append(node.val)\\n q.append(node.left)\\n q.append(node.right)\\n if level:\\n res.append(level)\\n \\n return res\\n\\n \\n\\n\\n\",\n \"runtime\": \"20\"\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res = []\\n if not root:\\n return res\\n q = deque()\\n q.append(root)\\n while q:\\n size = len(q)\\n temp = []\\n while size:\\n node = q.popleft()\\n temp.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n size -= 1\\n res.append(temp)\\n return res\",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return \\n\\n traversal = []\\n queue = deque([root])\\n\\n while queue:\\n qLen = len(queue)\\n level = []\\n for i in range(qLen):\\n node = queue.popleft()\\n level.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n traversal.append(level)\\n \\n return traversal\",\n \"runtime\": \"22\"\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\\nfrom collections import deque\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n queue=deque([root])\\n res=[]\\n while queue:\\n level=[]\\n size=len(queue)\\n for _ in range(size):\\n popped=queue.popleft()\\n level.append(popped.val)\\n if popped.left:\\n queue.append(popped.left)\\n if popped.right:\\n queue.append(popped.right)\\n res.append(level)\\n return res\",\n \"runtime\": \"23\"\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\\nfrom collections import deque\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res = []\\n\\n queue = deque([root])\\n\\n if not root:\\n return []\\n\\n while queue:\\n level_size = len(queue)\\n level_list = []\\n\\n for _ in range(level_size):\\n node = queue.popleft()\\n level_list.append(node.val)\\n\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n\\n res.append(level_list)\\n\\n return res\",\n \"runtime\": \"24\"\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root == None:\\n return []\\n result = []\\n # BFS is a level order traversal \\n d = deque([root])\\n while d:\\n subList = [] \\n for _ in range(len(d)):\\n n = d.popleft()\\n subList.append(n.val)\\n if n.left:\\n d.append(n.left)\\n if n.right:\\n d.append(n.right)\\n result.append(subList)\\n return result\",\n \"runtime\": \"25\"\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n ans = []\\n queue = collections.deque()\\n if root:\\n queue.append(root)\\n while queue:\\n level = []\\n for i in range(len(queue)):\\n node = queue.popleft()\\n level.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n ans.append(level)\\n return ans\\n \",\n \"runtime\": \"25\"\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n q = []\\n if not root:\\n return []\\n q.append(root)\\n res=[]\\n while q:\\n l = []\\n nextNodes=[]\\n for n in range(len(q)):\\n node = q[n]\\n l.append(node.val)\\n if node.left:\\n nextNodes.append(node.left)\\n if node.right:\\n nextNodes.append(node.right)\\n q = []\\n res.append(l)\\n for n in nextNodes:\\n q.append(n)\\n return res\\n \",\n \"runtime\": \"26\"\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n\\n sol_list = []\\n\\n node_queue: Deque[TreeNode] = Deque()\\n node_queue.append(root)\\n\\n while len(node_queue) > 0:\\n # The number of nodes in the queue at the start of each level will dictate how many nodes we pick from it\\n num_curr_level_nodes = len(node_queue)\\n\\n level_nodes = [] # Store the nodes of this level\\n for _ in range(num_curr_level_nodes):\\n # Using a Deque makes the pop operationg from the beggining O(1) instead of O(n)\\n curr_node = node_queue.popleft()\\n\\n if curr_node.val != None:\\n # Add the children to the queue of nodes to be visited\\n if curr_node.left:\\n node_queue.append(curr_node.left)\\n\\n if curr_node.right:\\n node_queue.append(curr_node.right)\\n\\n level_nodes.append(curr_node.val)\\n\\n # See if the currLevel is only Filler TreeNodes\\n if level_nodes:\\n sol_list.append(level_nodes) # Add the list with the nodes from this level\\n \\n return sol_list\",\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\\nfrom collections import deque\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n Q = deque([root])\\n levels = [[root.val]]\\n temp = deque()\\n\\n while Q:\\n node = Q.popleft()\\n if node.left: temp.append(node.left)\\n if node.right: temp.append(node.right)\\n \\n if not Q:\\n if temp:\\n levels.append([n.val for n in temp])\\n Q = temp\\n temp = deque()\\n\\n return levels\\n \",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"from collections import deque\\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return None\\n queue = deque([(root, 0)])\\n visited_set = set({root})\\n cur_level = 0\\n cur_nodes = [root.val]\\n result = []\\n while queue:\\n node, level = queue.pop()\\n neighbors = [node.left, node.right]\\n for neighbor in neighbors:\\n if neighbor and neighbor not in visited_set:\\n visited_set.add(neighbor)\\n neighbor_level = level + 1\\n queue.appendleft((neighbor, neighbor_level))\\n if cur_level != neighbor_level:\\n result.append(cur_nodes)\\n cur_nodes = [neighbor.val]\\n else:\\n cur_nodes.append(neighbor.val)\\n cur_level = neighbor_level\\n result.append(cur_nodes)\\n return result\\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\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res = []\\n q = []\\n q.append(root)\\n if not root:\\n return res \\n while q:\\n tmp = []\\n for i in range(len(q)):\\n node = q.pop(0)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n tmp.append(node.val)\\n res.append(tmp)\\n \\n return res\",\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\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n queue = deque()\\n queue.append(root)\\n\\n level_order = []\\n while queue:\\n cur_level = []\\n for i in range(len(queue)):\\n node = queue.popleft()\\n\\n cur_level.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n level_order.append(cur_level)\\n\\n return level_order\\n\",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n q = [root]\\n ans = []\\n while q:\\n next_level = []\\n nums = []\\n for node in q:\\n nums.append(node.val)\\n if node.left:\\n next_level.append(node.left)\\n if node.right:\\n next_level.append(node.right)\\n ans.append(nums)\\n q = next_level\\n return ans\\n \",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n def dfs(node, level):\\n if not node:\\n return\\n if len(res) == level:\\n res.append([]) # Start a new level\\n res[level].append(node.val) # Add the current node's value to its level\\n # Recur for left and right children, increasing the level by 1\\n dfs(node.left, level + 1)\\n dfs(node.right, level + 1)\\n res = []\\n dfs(root, 0) # Start the DFS with the root at level 0\\n return res\\n \",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n result = []\\n if not root:\\n return result\\n result.append([root.val])\\n nodelist = [[root]]\\n order = 0\\n while order < len(nodelist):\\n resulttemp = []\\n nodelisttemp = []\\n for i in range(len(nodelist[order])):\\n node = nodelist[order][i]\\n if node.left != None:\\n resulttemp.append(node.left.val)\\n nodelisttemp.append(node.left)\\n if node.right != None:\\n resulttemp.append(node.right.val)\\n nodelisttemp.append(node.right)\\n if resulttemp:\\n nodelist.append(nodelisttemp)\\n result.append(resulttemp)\\n order += 1\\n return result\\n \\n \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"from queue import Queue\\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n q=Queue()\\n ans=[]\\n q.put(root)\\n node=root\\n if root is None:\\n return ans\\n while not q.empty():\\n level=[]\\n length=q.qsize()\\n for i in range(0,length):\\n node=q.get()\\n if node.left is not None:\\n q.put(node.left)\\n if node.right is not None:\\n q.put(node.right)\\n level.append(node.val)\\n ans.append(level)\\n return ans\\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n \\n from collections import deque\\n\\n queue = deque([root])\\n levels = []\\n\\n while queue:\\n level = []\\n for _ in range(len(queue)):\\n node = queue.popleft()\\n if node:\\n level.append(node.val)\\n queue.append(node.left)\\n queue.append(node.right)\\n levels.append(level)\\n \\n levels.pop()\\n return levels\\n\\n\\n\\n \\n\\n \\n\\n \\n \\n\\n\\n\\n \\n\\n\\n\\n\",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root: return []\\n q = collections.deque()\\n q.append(root)\\n res = []\\n temp = []\\n\\n while q:\\n temp = []\\n for i in range(len(q)):\\n cur = q.popleft()\\n temp.append(cur.val)\\n if cur.left: q.append(cur.left)\\n if cur.right: q.append(cur.right) \\n\\n res.append(temp) \\n\\n return res \\n \",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n\\n ans = []\\n queue = deque([root])\\n\\n while queue:\\n level = []\\n n = len(queue)\\n\\n for i in range(n):\\n node = queue.popleft()\\n level.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n ans.append(level)\\n\\n return ans\\n\\n \",\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\\nfrom collections import deque\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n ans=[]\\n if root==None:\\n return\\n\\n q = deque([root])\\n while q:\\n curr_level = len(q)\\n level=[]\\n\\n for _ in range(curr_level):\\n node = q.popleft()\\n level.append(node.val)\\n\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n\\n ans.append(level)\\n\\n return ans\\n \",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res = []\\n def helper(node, level):\\n if not node:\\n return\\n\\n if level >= len(res):\\n res.append([])\\n \\n res[level].append(node.val)\\n\\n helper(node.left, level + 1)\\n helper(node.right, level + 1)\\n \\n helper(root, 0)\\n return res\\n\\n \",\n \"runtime\": \"34\"\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return None\\n res = []\\n\\n q = deque([root])\\n while q:\\n qLen = len(q)\\n level = []\\n for _ in range(qLen):\\n node = q.popleft()\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n level.append(node.val)\\n res.append(level)\\n return res\\n \\n \\n\\n \",\n \"runtime\": \"34\"\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n ans=[]\\n if not root:\\n return ans\\n q = deque()\\n q.append(root)\\n while q:\\n size=len(q)\\n level=[]\\n for i in range(size):\\n node=q.popleft()\\n level.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n ans.append(level)\\n return ans\",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n result = []\\n qu = deque()\\n qu.append(root)\\n while qu:\\n tmp = []\\n children = []\\n while qu:\\n current = qu.popleft()\\n tmp.append(current.val)\\n if current.left:\\n children.append(current.left)\\n if current.right:\\n children.append(current.right)\\n qu.extend(children)\\n result.append(tmp)\\n return result\\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\\n def levelOrder(self, root: TreeNode):\\n\\n if not root:\\n\\n return []\\n\\n \\n\\n result = []\\n\\n queue = deque([root])\\n\\n \\n\\n while queue:\\n\\n level = []\\n\\n for i in range(len(queue)):\\n\\n node = queue.popleft()\\n\\n level.append(node.val)\\n\\n if node.left:\\n\\n queue.append(node.left)\\n\\n if node.right:\\n\\n queue.append(node.right)\\n\\n result.append(level)\\n\\n \\n\\n return result\\n\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n self.d=defaultdict(list)\\n def foo(x,depth):\\n self.d[depth].append(x.val)\\n if x.left: foo(x.left,depth+1)\\n if x.right: foo(x.right,depth+1)\\n if root: foo(root,0)\\n return [self.d[i] for i in sorted(self.d.keys())]\",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root is None:\\n return []\\n \\n queue=[root]\\n next_queue=[]\\n level=[]\\n result=[]\\n while queue != []:\\n for root in queue:\\n level.append(root.val)\\n if root.left is not None:\\n next_queue.append(root.left)\\n if root.right is not None:\\n next_queue.append(root.right)\\n result.append(level)\\n level=[]\\n queue=next_queue\\n next_queue=[]\\n return result\",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n queue = deque()\\n queue.append(root)\\n res = []\\n\\n if not root:\\n return res\\n\\n while queue:\\n qLen = len(queue)\\n level = []\\n for i in range(qLen):\\n curr = queue.popleft()\\n level.append(curr.val)\\n if curr.left:\\n queue.append(curr.left)\\n if curr.right:\\n queue.append(curr.right)\\n res.append(level)\\n\\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\\nfrom collections import deque\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root is None:\\n return None\\n \\n queue = deque();\\n queue.append(root)\\n ans = []\\n\\n while queue:\\n level = []\\n n= len(queue)\\n\\n for i in range(n):\\n node = queue.popleft()\\n level.append(node.val)\\n\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n\\n ans.append(level)\\n\\n return ans\\n\\n\\n\\n\\n \",\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\\nfrom collections import deque\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n res = []\\n q = deque([])\\n q.appendleft([root, 0])\\n while q:\\n node, level = q.popleft()\\n if len(res) < level + 1:\\n res.append([node.val])\\n else:\\n res[level].append(node.val)\\n if node.left is not None:\\n q.append([node.left, level+1])\\n if node.right is not None:\\n q.append([node.right, level+1])\\n \\n return res\",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n if root:\\n from collections import deque\\n deque_nodes = deque([root]) # 3-ка \\n # | [9,20] \\n # / [20]\\n res_itog = []\\n while deque_nodes:\\n level_size = len(deque_nodes) # len(3-ка) = 1 \\n # | 2 \\n # / 1\\n nodes_of_this_level = []\\n for i in range(level_size):\\n node = deque_nodes.popleft() # node = 3-ка, deque_nodes = [] \\n # | node = 9-ка, deque_nodes = [20] \\n # / node = 20-ка, deque_nodes = []\\n nodes_of_this_level.append(node.val) # nodes_of_this_level = [].append(3.val) ===> nodes_of_this_level = [3] \\n # | nodes_of_this_level = [].append(9.val) ===> nodes_of_this_level = [9] \\n # / nodes_of_this_level = [9].append(20.val) ===> nodes_of_this_level = [9,20]\\n if node.left: # 3-ка имеет левый дочерний элемент ===> \\n # | 9-ка не имеет левый дочерний элемент ===> else: deque_nodes ===> deque_nodes = [20] \\n # / 20-ка имеет левый дочерний элемент ===> \\n deque_nodes.append(node.left) # deque_nodes = [].append(3.left) = [].append(9-ка) ===> deque_nodes = [9] \\n # / deque_nodes = [].append(20.left) = [].append(15-ка) ===> deque_nodes = [15]\\n if node.right: # 3-ка имеет правый дочерний элемент ===> \\n # / 20-ка имеет правый дочерний элемент ===>\\n deque_nodes.append(node.right) # deque_nodes = [9].append(3.right) = [9].append(20-ка) ===> deque_nodes = [9,20] \\n # / deque_nodes = [15].append(20.right) = [9].append(7-ка) ===> deque_nodes = [15,7]\\n else:\\n deque_nodes\\n res_itog.append(nodes_of_this_level)\\n return res_itog\\n\\n#root = TreeNode(3)\\n#node2 = TreeNode(9)\\n#node3 = TreeNode(20)\\n#node4 = TreeNode(15)\\n#node5 = TreeNode(7)\\n#root.left = node2\\n#root.right = node3\\n#node3.left = node4\\n#node3.right = node5\\n#\\n#ss = Solution()\\n#print(ss.levelOrder(root))\\n\\n\\n\\n\\n# Нам дано Двоичное Древо root = [3,9,20,null,null,15,7]\\n# 3\\n# 9 20\\n# None None 15 7\\n# Нам нужно пройти по этажам этого дерева и записать какие узлы есть на каком этаже, \\n# т.е. нам нужно найти [[3],[9,20],[15,7]]\\n\\n\\n# Принцип Решения через BFS:\\n# 1) root = [3,9,20,null,null,15,7]\\n# 2) deque_nodes = deque([root]) = 3-ке, т.к. root = TreeNode(3), res_itog = [], \\n# level_size = len(deque_nodes) = len(3-ка) = 1, nodes_of_this_level = []\\n# for i in range(level_size) ===> for i in range(1) ===> \\n# node = deque_nodes.popleft() ===> node = 3-ке, а после этого deque_nodes = [],\\n# nodes_of_this_level.append(node.val) ===> [].append(3-ка.val) ===>\\n# nodes_of_this_level = [3]\\n# if node.left: ===> 3-ка имеет левый дочерний элемент ===> \\n# deque_nodes.append(node.left) ===> [].append(3.left) ===> [].append(9-ка),\\n# deque_nodes = [9]\\n# if node.right: ===> 3-ка имеет правый дочерний элемент ===> \\n# deque_nodes.append(node.right) ===> [9].append(3.right) ===> [9].append(20-ка),\\n# deque_nodes = [9,20]\\n# res_itog.append(nodes_of_this_level) ===> [].append(nodes_of_this_level) ===>\\n# [].append([3]) ===> res_itog = [[3]]\\n\\n# 3.1) deque_nodes = deque([9,20]), res_itog = [[3]], \\n# level_size = len(deque_nodes) = len([9,20]) = 2, nodes_of_this_level = []\\n# for i in range(level_size) ===> for i in range(2) ===> \\n# node = deque_nodes.popleft() ===> node = 9-ке, а после этого deque_nodes = [20],\\n# nodes_of_this_level.append(node.val) ===> [].append(9-ка.val) ===>\\n# nodes_of_this_level = [9]\\n# if not node.left, т.е. else: deque_nodes ===> deque_nodes = [20]\\n# if not node.right, т.е. else: deque_nodes ===> deque_nodes = [20]\\n\\n# 3.2) deque_nodes = deque([20]), res_itog = [[3]], \\n# level_size = len(deque_nodes) = len([20]) = 1, nodes_of_this_level = [9]\\n# for i in range(level_size) ===> for i in range(1) ===> \\n# node = deque_nodes.popleft() ===> node = 20-ке, а после этого deque_nodes = [],\\n# nodes_of_this_level.append(node.val) ===> [9].append(20-ка.val) ===>\\n# nodes_of_this_level = [9,20]\\n# if node.left: ===> 20-ка имеет левый дочерний элемент ===> \\n# deque_nodes.append(node.left) ===> [].append(20.left) ===> [].append(15-ка),\\n# deque_nodes = [15]\\n# if node.right: ===> 20-ка имеет правый дочерний элемент ===> \\n# deque_nodes.append(node.right) ===> [15].append(20.right) ===> [15].append(7-ка),\\n# deque_nodes = [15,7]\\n# res_itog.append(nodes_of_this_level) ===> [3].append(nodes_of_this_level) ===>\\n# [3].append([9,20]) ===> res_itog = [[3],[9,20]]\\n\\n# 4.1) deque_nodes = deque([15,7]), res_itog = [[3],[9,20]], \\n# level_size = len(deque_nodes) = len([15,7]) = 2, nodes_of_this_level = []\\n# for i in range(level_size) ===> for i in range(2) ===> \\n# node = deque_nodes.popleft() ===> node = 15-ке, а после этого deque_nodes = [7],\\n# nodes_of_this_level.append(node.val) ===> [].append(15-ка.val) ===>\\n# nodes_of_this_level = [15]\\n# if not node.left, т.е. else: deque_nodes ===> deque_nodes = [7]\\n# if not node.right, т.е. else: deque_nodes ===> deque_nodes = [7]\\n\\n# 4.2) deque_nodes = deque([7]), res_itog = [[3],[9,20]], \\n# level_size = len(deque_nodes) = len([7]) = 1, nodes_of_this_level = [15]\\n# for i in range(level_size) ===> for i in range(1) ===> \\n# node = deque_nodes.popleft() ===> node = 7-ке, а после этого deque_nodes = [],\\n# nodes_of_this_level.append(node.val) ===> [15].append(7-ка.val) ===>\\n# nodes_of_this_level = [15,7]\\n# if not node.left, т.е. else: deque_nodes ===> deque_nodes = []\\n# if not node.right, т.е. else: deque_nodes ===> deque_nodes = []\\n# res_itog.append(nodes_of_this_level) ===> [[3],[9,20]].append(nodes_of_this_level) ===>\\n# [[3],[9,20]].append([15,7]) ===> res_itog = [[3],[9,20],[15,7]]\\n\\n\\n\\n# Для понимания (часть 1):\\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 levelOrder(self, root): \\n# if not root:\\n# return []\\n# if root:\\n# from collections import deque\\n# deque_root = deque([root.val]) !!!!!!!!!!!!!!!!!!!!\\n# return deque_root\\n#\\n#root = TreeNode(119)\\n#ss = Solution()\\n#print(ss.levelOrder(root))\\n\\n\\n# Для понимания (часть 2):\\n# root = [3,9,20,0,0,15,7]\\n# from collections import deque\\n# deque_root = deque(root)\\n# deque_root ===> deque([3, 9, 20, 0, 0, 15, 7])\\n\\n# level_nodes = []\\n# for i in range(1): !!!!!!!!!!\\n# node = deque_root.popleft()\\n# level_nodes.append(node)\\n# level_nodes = [3]\\n# deque_root ===> deque([9, 20, 0, 0, 15, 7])\\n\\n# level_nodes = []\\n# for i in range(2): !!!!!!!!!!\\n# node = deque_root.popleft()\\n# level_nodes.append(node)\\n# level_nodes = [9, 20]\\n# deque_root ===> deque([0, 0, 15, 7])\",\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\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n \\n if root is None:\\n return []\\n\\n ans = []\\n q = []\\n\\n q.append(root)\\n\\n while len(q) > 0:\\n level_size = len(q)\\n level = []\\n\\n for _ in range(level_size):\\n curr = q.pop(0)\\n level.append(curr.val)\\n\\n if curr.left is not None:\\n q.append(curr.left)\\n\\n if curr.right is not None:\\n q.append(curr.right)\\n\\n ans.append(level)\\n\\n return ans\\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n \\n queue = collections.deque([root])\\n nodes_per_level = []\\n\\n while queue:\\n len_queue = len(queue)\\n this_level = []\\n\\n for i in range(0, len_queue):\\n node = queue.popleft()\\n this_level.append(node.val)\\n\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n \\n nodes_per_level.append(this_level)\\n \\n return nodes_per_level\\n # last_level = [root]\\n # nodes_per_level = []\\n\\n # while last_level:\\n # new_level_nodes = []\\n # last_level_vals = []\\n\\n # for a in last_level:\\n # last_level_vals.append(a.val)\\n # if a.left:\\n # new_level_nodes.append(a.left)\\n # if a.right:\\n # new_level_nodes.append(a.right)\\n \\n # nodes_per_level.append(last_level_vals)\\n # last_level = new_level_nodes\\n \\n # return nodes_per_level\\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n q, nq = deque(), deque()\\n q.append(root)\\n res, level = [], []\\n while q:\\n node = q.popleft()\\n if node:\\n level.append(node.val)\\n nq.append(node.left)\\n nq.append(node.right)\\n if len(q) == 0:\\n q = nq\\n nq = deque()\\n if len(level) > 0:\\n res.append(level)\\n level = []\\n return res\\n\\n\\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root: return []\\n res, stack = [], [[root]]\\n\\n while stack:\\n nodes = stack.pop()\\n currents = []\\n childs = []\\n for node in nodes:\\n currents.append(node.val)\\n if node.left: childs.append(node.left)\\n if node.right: childs.append(node.right)\\n\\n res.append(currents)\\n if childs: stack.append(childs)\\n\\n return res\",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n output = []\\n queue = collections.deque()\\n if root:\\n queue.append(root)\\n else:\\n return []\\n i = 0\\n while queue:\\n queue_len = len(queue) \\n curr = []\\n for i in range(queue_len):\\n node = queue.popleft()\\n if node:\\n queue.append(node.left)\\n queue.append(node.right)\\n curr.append(node.val)\\n if curr:\\n output.append(curr)\\n return output\",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n output = []\\n if not root:\\n return output\\n q = deque([root])\\n while q:\\n child = []\\n size = len(q)\\n for i in range(size):\\n node = q.popleft()\\n child.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n output.append(child)\\n \\n return output\\n\\n\\n\\n \\n\\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n result = []\\n \\n def traverse(node, level):\\n if not node:\\n return\\n \\n # If we are on a new level, append a new list to the result\\n if len(result) == level:\\n result.append([])\\n \\n result[level].append(node.val)\\n \\n traverse(node.left, level + 1)\\n traverse(node.right, level + 1)\\n \\n traverse(root, 0)\\n \\n return result\",\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\\n\\nfrom collections import deque\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root is None:\\n return []\\n \\n result = []\\n que = deque([root])\\n\\n while que:\\n level = []\\n for _ in range(len(que)):\\n cur = que.popleft()\\n level.append(cur.val)\\n if cur.left:\\n que.append(cur.left)\\n if cur.right:\\n que.append(cur.right)\\n result.append(level)\\n return result\\n \",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n \\n if root:\\n op=[[root.val]]\\n else:\\n return []\\n \\n que=[root]\\n \\n while que:\\n o=[]\\n for i in range(len(que)):\\n r=que.pop(0)\\n if r.left:\\n que.append(r.left)\\n o.append(r.left.val)\\n if r.right:\\n que.append(r.right)\\n o.append(r.right.val)\\n \\n if o:\\n op.append(o)\\n return op\\n \\n \\n \",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res = []\\n q = collections.deque()\\n q.append(root)\\n while q :\\n qlen = len(q)\\n level = []\\n for i in range(qlen):\\n node = q.popleft()\\n if node:\\n level.append(node.val)\\n q.append(node.left)\\n q.append(node.right)\\n if level:\\n res.append(level)\\n return res\",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n stack = [(root, 0)] # Stack will store tuples of (node, level)\\n res = []\\n while stack:\\n node, level = stack.pop()\\n if len(res) == level:\\n res.append([]) # Start a new level\\n res[level].append(node.val)\\n # Push the right child first so that the left child is processed first\\n if node.right:\\n stack.append((node.right, level + 1))\\n if node.left:\\n stack.append((node.left, level + 1))\\n \\n return res\\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n queue = deque([(0, root)])\\n mem = []\\n while queue:\\n depth, node = queue.popleft()\\n if depth >= len(mem):\\n mem.append([node.val])\\n else:\\n mem[depth].append(node.val)\\n if node.left:\\n queue.append((depth+1,node.left))\\n if node.right:\\n queue.append((depth+1,node.right))\\n return mem\",\n \"runtime\": \"45\"\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n queue = []\\n res = []\\n if root is None:\\n return res\\n queue.append(root)\\n while queue:\\n cur_res = []\\n size = len(queue)\\n for _ in range(size):\\n node = queue.pop(0)\\n cur_res.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n res.append(cur_res)\\n return res\",\n \"runtime\": \"45\"\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\\nfrom collections import deque\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n finallst = []\\n if not root:\\n return finallst\\n queue = deque([root])\\n while queue:\\n lst = []\\n for x in range(len(queue)):\\n node = queue.popleft()\\n lst.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n finallst.append(lst) \\n\\n return finallst\",\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 res = None\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n self.res = []\\n def rec(node, depth):\\n if node is None:\\n return\\n if len(self.res) <= depth:\\n self.res.append([])\\n self.res[depth].append(node.val)\\n rec(node.left, depth+1) or rec(node.right, depth+1)\\n rec(root,0)\\n return self.res\\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n \\n res = []\\n if root == None:\\n return res;\\n\\n queue = deque()\\n\\n queue.append((root, 0))\\n\\n while queue:\\n\\n node, level = queue.popleft()\\n\\n if len(res) <= level:\\n res.append([])\\n\\n res[level].append(node.val)\\n\\n if node.left != None:\\n queue.append((node.left, level+1))\\n\\n if node.right != None:\\n queue.append((node.right, level+1))\\n\\n return res\\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n def max_depth(root) :\\n if not root :\\n return 0\\n return 1 + max(max_depth(root.left), max_depth(root.right))\\n \\n depth = max_depth(root)\\n res = [[] for _ in range(depth)]\\n def bfs(root,ht) :\\n if not root :\\n return None\\n res[ht].append(root.val)\\n bfs(root.left, ht+1)\\n bfs(root.right, ht+1)\\n \\n \\n \\n bfs(root,0)\\n return res \\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n stack = []\\n output = [[]]\\n level = 0\\n n = 1\\n def dfs(Node):\\n stack.pop(0)\\n output[level].append(Node.val)\\n if Node.left:\\n stack.append(Node.left)\\n if Node.right:\\n stack.append(Node.right)\\n if not root:\\n return []\\n stack.append(root)\\n while stack:\\n dfs(stack[0])\\n n -= 1\\n if n == 0 and stack:\\n level += 1\\n output.append([])\\n n = len(stack)\\n return output\",\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res = []\\n q = deque([root])\\n if not root:\\n return []\\n while q:\\n arr = []\\n for _ in range(len(q)):\\n curr = q.popleft()\\n print(curr.val)\\n arr.append(curr.val)\\n if curr.left:\\n q.append(curr.left)\\n if curr.right:\\n q.append(curr.right)\\n res.append(arr)\\n return res\",\n \"runtime\": \"48\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":52,"string":"52"},"mm_list":{"kind":"list like","value":[{"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\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root is None:\n return None\n q = deque()\n q.append(root)\n traversal = []\n\n while q:\n level_length = len(q) # used to keep track of current level, make sure you dont append additional children to current level\n curr_level = []\n \n for i in range(level_length):\n node = q.popleft()\n curr_level.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n \n traversal.append(curr_level)\n \n return traversal\n\n# Time: O(n)\n# Space: O(n)","memory":"16500"},{"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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n \n res = []\n \n q = deque([root])\n while q:\n level = []\n for _ in range(len(q)):\n node = q.popleft()\n level.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n res.append(level)\n \n return res\n ","memory":"16600"},{"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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n\n q = deque()\n q.append(root)\n res = []\n\n while q:\n nodes = []\n for i in range(len(q)):\n curr = q.popleft()\n nodes.append(curr.val)\n if curr.left:\n q.append(curr.left)\n if curr.right:\n q.append(curr.right)\n res.append(nodes)\n \n return res\n\n\n \n \n \n","memory":"16700"},{"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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n queue = deque()\n queue.append(root)\n result = []\n while queue:\n level = []\n for _ in range(len(queue)):\n node = queue.popleft()\n level.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n \n result.append(level)\n return result\n\n","memory":"16800"},{"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: #2\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n q = [root]\n ans = []\n while q:\n next_level = []\n nums = []\n for node in q:\n nums.append(node.val)\n if node.left:\n next_level.append(node.left)\n if node.right:\n next_level.append(node.right)\n ans.append(nums)\n q = next_level\n return ans\n\n\n\n\n\n\n\n '''\n if not root:\n return []\n q = [root]\n ans = []\n while q:\n next_level = []\n nums = []\n for node in q:\n nums.append(node.val)\n if node.left:\n next_level.append(node.left)\n if node.right:\n next_level.append(node.right)\n ans.append(nums)\n q = next_level\n return ans\n '''\n ","memory":"16900"},{"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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n queue = deque([(0, root)])\n mem = []\n while queue:\n depth, node = queue.popleft()\n if not node:\n continue\n if depth >= len(mem):\n mem.append([node.val])\n else:\n mem[depth].append(node.val)\n queue.append((depth+1,node.left))\n queue.append((depth+1,node.right))\n return mem","memory":"17000"},{"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\nfrom collections import deque\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n \n queue = deque([[root]])\n result = []\n\n while len(queue) > 0:\n curr_level = queue.popleft()\n curr_result = []\n next_level = []\n for node in curr_level:\n curr_result.append(node.val)\n if node.left:\n next_level.append(node.left)\n if node.right:\n next_level.append(node.right)\n \n result.append(curr_result)\n if next_level:\n queue.append(next_level)\n \n return result","memory":"17000"},{"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\nfrom collections import deque\nclass Solution:\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n q = deque([root])\n ans = []\n while q:\n level_size = len(q)\n row = []\n for i in range(level_size):\n ele = q.popleft()\n row.append(ele.val)\n if ele.left != None:\n q.append(ele.left)\n if ele.right != None:\n q.append(ele.right)\n ans.append(row)\n return ans\n \n\n ","memory":"17100"},{"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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n queue = deque()\n result = []\n queue.append(root)\n\n while queue:\n currLen = len(queue)\n currList = []\n for i in range(currLen):\n curr = queue.popleft()\n if curr:\n currList.append(curr.val)\n queue.append(curr.left)\n queue.append(curr.right)\n if currList:\n result.append(currList)\n return result\n\n\n \n\n\n\n ","memory":"17100"}],"string":"[\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\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root is None:\\n return None\\n q = deque()\\n q.append(root)\\n traversal = []\\n\\n while q:\\n level_length = len(q) # used to keep track of current level, make sure you dont append additional children to current level\\n curr_level = []\\n \\n for i in range(level_length):\\n node = q.popleft()\\n curr_level.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n \\n traversal.append(curr_level)\\n \\n return traversal\\n\\n# Time: O(n)\\n# Space: O(n)\",\n \"memory\": \"16500\"\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n \\n res = []\\n \\n q = deque([root])\\n while q:\\n level = []\\n for _ in range(len(q)):\\n node = q.popleft()\\n level.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n res.append(level)\\n \\n return res\\n \",\n \"memory\": \"16600\"\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n\\n q = deque()\\n q.append(root)\\n res = []\\n\\n while q:\\n nodes = []\\n for i in range(len(q)):\\n curr = q.popleft()\\n nodes.append(curr.val)\\n if curr.left:\\n q.append(curr.left)\\n if curr.right:\\n q.append(curr.right)\\n res.append(nodes)\\n \\n return res\\n\\n\\n \\n \\n \\n\",\n \"memory\": \"16700\"\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n queue = deque()\\n queue.append(root)\\n result = []\\n while queue:\\n level = []\\n for _ in range(len(queue)):\\n node = queue.popleft()\\n level.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n \\n result.append(level)\\n return result\\n\\n\",\n \"memory\": \"16800\"\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: #2\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n q = [root]\\n ans = []\\n while q:\\n next_level = []\\n nums = []\\n for node in q:\\n nums.append(node.val)\\n if node.left:\\n next_level.append(node.left)\\n if node.right:\\n next_level.append(node.right)\\n ans.append(nums)\\n q = next_level\\n return ans\\n\\n\\n\\n\\n\\n\\n\\n '''\\n if not root:\\n return []\\n q = [root]\\n ans = []\\n while q:\\n next_level = []\\n nums = []\\n for node in q:\\n nums.append(node.val)\\n if node.left:\\n next_level.append(node.left)\\n if node.right:\\n next_level.append(node.right)\\n ans.append(nums)\\n q = next_level\\n return ans\\n '''\\n \",\n \"memory\": \"16900\"\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n queue = deque([(0, root)])\\n mem = []\\n while queue:\\n depth, node = queue.popleft()\\n if not node:\\n continue\\n if depth >= len(mem):\\n mem.append([node.val])\\n else:\\n mem[depth].append(node.val)\\n queue.append((depth+1,node.left))\\n queue.append((depth+1,node.right))\\n return mem\",\n \"memory\": \"17000\"\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\\nfrom collections import deque\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n \\n queue = deque([[root]])\\n result = []\\n\\n while len(queue) > 0:\\n curr_level = queue.popleft()\\n curr_result = []\\n next_level = []\\n for node in curr_level:\\n curr_result.append(node.val)\\n if node.left:\\n next_level.append(node.left)\\n if node.right:\\n next_level.append(node.right)\\n \\n result.append(curr_result)\\n if next_level:\\n queue.append(next_level)\\n \\n return result\",\n \"memory\": \"17000\"\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\\nfrom collections import deque\\nclass Solution:\\n def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n q = deque([root])\\n ans = []\\n while q:\\n level_size = len(q)\\n row = []\\n for i in range(level_size):\\n ele = q.popleft()\\n row.append(ele.val)\\n if ele.left != None:\\n q.append(ele.left)\\n if ele.right != None:\\n q.append(ele.right)\\n ans.append(row)\\n return ans\\n \\n\\n \",\n \"memory\": \"17100\"\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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n queue = deque()\\n result = []\\n queue.append(root)\\n\\n while queue:\\n currLen = len(queue)\\n currList = []\\n for i in range(currLen):\\n curr = queue.popleft()\\n if curr:\\n currList.append(curr.val)\\n queue.append(curr.left)\\n queue.append(curr.right)\\n if currList:\\n result.append(currList)\\n return result\\n\\n\\n \\n\\n\\n\\n \",\n \"memory\": \"17100\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":9,"string":"9"}}},{"rowIdx":156,"cells":{"question_id":{"kind":"number","value":103,"string":"103"},"name":{"kind":"string","value":"binary-tree-zigzag-level-order-traversal"},"content":{"kind":"string","value":"<p>Given the <code>root</code> of a binary tree, return <em>the zigzag level order traversal of its nodes' values</em>. (i.e., from left to right, then right to left for the next level and alternate between).</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/02/19/tree1.jpg\" style=\"width: 277px; height: 302px;\" />\n<pre>\n<strong>Input:</strong> root = [3,9,20,null,null,15,7]\n<strong>Output:</strong> [[3],[20,9],[15,7]]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> root = [1]\n<strong>Output:</strong> [[1]]\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> root = []\n<strong>Output:</strong> []\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>[0, 2000]</code>.</li>\n\t<li><code>-100 <= Node.val <= 100</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":59.98696640789398,"string":"59.986966"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["tree","breadth-first-search","binary-tree"],"string":"[\n \"tree\",\n \"breadth-first-search\",\n \"binary-tree\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"15\", 0.0087], [\"16\", 0.0087], [\"17\", 0.0087], [\"18\", 0.0174], [\"19\", 0.1915], [\"20\", 0.0783], [\"21\", 0.1219], [\"22\", 0.1219], [\"23\", 0.8095], [\"24\", 0.3482], [\"25\", 0.6093], [\"26\", 1.0185], [\"27\", 2.5244], [\"28\", 1.3666], [\"29\", 1.6713], [\"30\", 3.508], [\"31\", 6.0063], [\"32\", 3.7604], [\"33\", 4.1783], [\"34\", 7.2946], [\"35\", 9.523], [\"36\", 6.4328], [\"37\", 5.2403], [\"38\", 8.6438], [\"39\", 9.6884], [\"40\", 5.6233], [\"41\", 4.3611], [\"42\", 5.0313], [\"43\", 4.4829]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16200\", 0.0261], [\"16300\", 0.0261], [\"16400\", 0.1306], [\"16500\", 2.7507], [\"16600\", 18.0449], [\"16700\", 38.0397], [\"16800\", 34.2096]]}"},"rt_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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n queue = []\n\n if root is None: \n return queue\n \n answer = []\n queue.append(root)\n\n while(len(queue)!= 0):\n size = len(queue)\n\n level = []\n for i in range(size):\n ele = queue.pop(0)\n level.append(ele.val)\n if ele.left:\n queue.append(ele.left)\n if ele.right:\n queue.append(ele.right)\n \n if len(answer) % 2 == 1: \n level.reverse()\n \n\n answer.append(level)\n \n return answer\n ","runtime":"15"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n res = []\n q = [root]\n rev = True\n\n while q:\n count = len(q)\n nodes = []\n \n for _ in range(count):\n node = q.pop(0)\n if node:\n nodes.append(node.val)\n q.append(node.left)\n q.append(node.right)\n if nodes:\n res.append(nodes if rev else nodes[::-1])\n rev = not rev\n return res\n","runtime":"16"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n \n if not root:\n return []\n\n queue = deque()\n queue.append(root)\n res = []\n level = 0\n\n while queue:\n level_size = len(queue)\n current_level = []\n \n for _ in range(level_size):\n node = queue.popleft()\n current_level.append(node.val)\n \n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n \n if level % 2 == 1:\n current_level.reverse()\n \n res.append(current_level)\n level += 1\n \n return res\n \n \n ","runtime":"17"},{"code":"class Solution:\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n q=collections.deque()\n results=[]\n q.append(root)\n flag=True\n while q:\n level=[]\n for _ in range(len(q)):\n node=q.popleft()\n if node:\n level.append(node.val)\n q.append(node.left)\n q.append(node.right)\n if level:\n results.append(level if flag else level[::-1])\n flag = not flag\n return results\n","runtime":"18"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n \n queue = deque([root])\n ans = []\n counter = 0\n while queue:\n nodes_in_current_level = len(queue)\n # do some logic here for the current level\n level_ans = []\n for _ in range(nodes_in_current_level):\n node = queue.popleft()\n\n # do some logic here on the current node\n level_ans.append(node.val)\n\n # put the next level onto the queue\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n \n counter += 1\n if (counter % 2) == 0:\n level_ans = level_ans[::-1]\n \n ans.append(level_ans)\n return ans","runtime":"19"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n OP = []\n\n Queue = []\n Queue.append([root])\n\n while Queue:\n Temp = []\n TempQueue = []\n Nodes = Queue.pop(0)\n for Node in Nodes:\n if Node:\n if Node.left:\n TempQueue.append(Node.left)\n if root.right:\n TempQueue.append(Node.right)\n Temp.append(Node.val)\n if len(TempQueue) != 0:\n Queue.append(TempQueue)\n if len(Temp) != 0:\n OP.append(Temp)\n\n for i in range(len(OP)):\n if i%2 != 0:\n OP[i] = OP[i][::-1]\n return OP\n\n\n\n","runtime":"20"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n def printRightToLeft(queue):\n numNodes = len(queue)\n out = []\n for _ in range(numNodes):\n node = queue.pop()\n out.append(node.val)\n if node.right:\n queue.appendleft(node.right)\n if node.left:\n queue.appendleft(node.left)\n return queue, out\n\n def printLeftToRight(queue):\n numNodes = len(queue)\n out = []\n for _ in range(numNodes):\n node = queue.popleft()\n out.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n return queue, out\n\n if not root:\n return []\n queue = deque([root])\n out = []\n order = True\n while queue:\n if order:\n queue, printList = printLeftToRight(queue)\n order = False\n else:\n queue, printList = printRightToLeft(queue)\n order = True\n out.append(printList)\n return out\n\n\n ","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n\n levels = [[root]]\n level_index = 0\n results = []\n while levels:\n level = levels.pop(0)\n nxt_level = []\n r = []\n for node in level:\n r.append(node.val)\n order = [node.left, node.right]\n for o in order:\n if o:\n nxt_level.append(o)\n if level_index % 2 == 1:\n r = r[::-1]\n results.append(r)\n if nxt_level:\n levels.append(nxt_level)\n level_index += 1\n return results\n","runtime":"22"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n \n if not root:\n return []\n\n queue = collections.deque([root])\n left_to_right = 1\n count=0\n q_len = len(queue)\n result = []\n res = collections.deque()\n\n while queue:\n node = queue.popleft()\n if left_to_right==1:\n res.append(node.val)\n else:\n res.appendleft(node.val)\n count+=1\n if node.left:\n queue.append(node.left)\n\n if node.right:\n queue.append(node.right)\n\n if count == q_len:\n result.append(list(res))\n count=0\n q_len = len(queue)\n left_to_right *= -1\n res = collections.deque()\n \n return result\n\n","runtime":"23"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n \n if not root:\n return None\n\n level = 0\n q = collections.deque([root])\n res = []\n\n while q:\n levels = []\n\n\n for i in range(len(q)):\n node = q.popleft()\n\n if node and level % 2 == 0:\n levels.append(node.val)\n else:\n levels.insert(0, node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n level += 1\n res.append(levels)\n return res","runtime":"23"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n ans = []\n if root is None:\n return ans\n \n queue = [root]\n ltor = True\n \n while queue:\n size = len(queue)\n temp = []\n \n for i in range(size):\n frontnode = queue.pop(0)\n # Add the node value to temp based on ltor (left to right or right to left)\n if ltor:\n temp.append(frontnode.val)\n else:\n temp.insert(0, frontnode.val)\n # Add the left and right children to the queue\n if frontnode.left:\n queue.append(frontnode.left)\n if frontnode.right:\n queue.append(frontnode.right)\n # Add the current level's result to ans\n ans.append(temp)\n # Toggle the direction for the next level\n ltor = not ltor\n \n return ans","runtime":"24"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n\n q = deque()\n q.append(root)\n is_reversed = False\n res = []\n\n while q:\n size = len(q)\n curr_lv = []\n for _ in range(size):\n curr = q.popleft()\n curr_lv.append(curr.val)\n if curr.left:\n q.append(curr.left)\n if curr.right:\n q.append(curr.right)\n if not is_reversed:\n res.append(curr_lv)\n else:\n curr_lv.reverse()\n res.append(curr_lv)\n is_reversed = not is_reversed\n return res\n","runtime":"24"},{"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\nclass Solution:\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n\n queue, ans = deque([root]), []\n while queue:\n nodes_at_this_level, curr_values = len(queue), []\n \n for _ in range(nodes_at_this_level):\n node = queue.popleft()\n curr_values.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n ans.append(reversed(curr_values) if len(ans) % 2 else curr_values)\n return ans","runtime":"25"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n level = 0\n ansMap = defaultdict(list)\n \n if root is None:\n return []\n \n queue = deque()\n queue.append(root)\n \n \n while queue:\n interqueue = deque()\n for _ in range(len(queue)):\n current = queue.popleft()\n if current is not None:\n if level % 2 == 1:\n interqueue.appendleft(current.val)\n else:\n interqueue.append(current.val)\n if current.left is not None:\n queue.append(current.left) \n if current.right is not None:\n queue.append(current.right) \n ansMap[level] = interqueue\n level += 1\n \n return ansMap.values()","runtime":"25"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n result = []\n left_to_right = 1\n queue = deque([root])\n while queue:\n n = len(queue)\n ans = [] #temp list to store value per level\n for i in range(n):\n #pop and save result\n curr = queue.popleft()\n \n if left_to_right == 1:\n ans.append(curr.val)\n else:\n ans.insert(0, curr.val)\n\n if curr.left:\n queue.append(curr.left)\n if curr.right:\n queue.append(curr.right)\n\n left_to_right *= (-1)\n #push ans into main result list\n result.append(ans)\n\n return result \n","runtime":"26"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n isPopLeft = False\n ans = []\n queue = deque([root])\n while queue:\n row = deque()\n curr_length = len(queue)\n for _ in range(curr_length):\n node = queue.popleft()\n if node:\n if isPopLeft:\n row.appendleft(node.val)\n else:\n row.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n isPopLeft = not isPopLeft\n ans.append(row)\n return ans","runtime":"26"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n \n\n if not root : return None \n result = []\n switch = False \n q = [root]\n while q:\n l = len(q)\n temp = []\n for i in range(l):\n node = q.pop(0)\n temp.append(node.val)\n\n if node.left is not None:\n q.append(node.left)\n \n if node.right is not None:\n q.append(node.right)\n if switch == True :\n temp.reverse()\n switch = False \n else:\n switch = True \n\n result.append(temp)\n \n return result ","runtime":"27"},{"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\nclass Solution:\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root is None:\n return \n stack = deque([root])\n i = 1\n ans = []\n while stack:\n c = len(stack)\n t_ans = []\n for _ in range(c):\n node = stack.popleft()\n print(i)\n if node.val is not None:\n t_ans.append(node.val)\n if node.left:\n stack.append(node.left)\n if node.right:\n stack.append(node.right)\n if i == 0:\n ans.append(t_ans[::-1])\n i = 1\n else:\n ans.append(t_ans)\n i = 0\n \n return ans ","runtime":"27"},{"code":"class Solution:\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n res=[]\n def add(i,tree):\n if len(res)<=i:\n res.append([tree.val])\n else:\n res[i].append(tree.val)\n i+=1\n if tree.left: add(i,tree.left)\n if tree.right: add(i,tree.right)\n if root: \n add(0,root)\n for i in range(len(res)):\n if i%2==1:\n res[i].reverse()\n return res\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\nclass Solution:\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n def visit(node, level, output):\n if not node:\n return\n if level < len(output):\n if level % 2 == 0:\n output[level].append(node.val)\n else:\n output[level].insert(0, node.val)\n else:\n output.append([node.val])\n visit(node.left, level+1, output)\n visit(node.right, level+1, output)\n output = []\n visit(root, 0, output)\n return output","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: #2\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n q = [root]\n ans = []\n l2r = True\n while q:\n next_level = []\n nums = []\n for node in q:\n nums.append(node.val)\n if node.left:\n next_level.append(node.left)\n if node.right:\n next_level.append(node.right)\n ans.append(nums if l2r else nums[::-1])\n l2r = not l2r\n q = next_level\n return ans\n\n\n\n\n\n\n\n '''\n if not root:\n return []\n q = [root]\n ans = []\n l2r = True\n while q:\n next_level = []\n nums = []\n for node in q:\n nums.append(node.val)\n if node.left:\n next_level.append(node.left)\n if node.right:\n next_level.append(node.right)\n ans.append(nums if l2r else nums[::-1]) \n l2r = not l2r\n q = next_level\n return ans\n '''\n ","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n \n queue = deque([root])\n\n ans = []\n\n left_to_right = True\n while queue:\n level = []\n n = len(queue)\n\n for i in range(n):\n node = queue.popleft()\n \n if node:\n if left_to_right:\n level.append(node.val)\n else:\n level.insert(0, node.val)\n\n if node.left:\n queue.append(node.left)\n\n if node.right:\n queue.append(node.right)\n\n ans.append(level)\n left_to_right = not left_to_right\n\n return ans\n\n ","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n queue = [root]\n ret = [[root.val]]\n direction = -1\n while queue:\n new_queue = []\n lst = []\n for node in queue:\n if node.left:\n new_queue.append(node.left)\n lst.append(node.left.val)\n if node.right:\n new_queue.append(node.right)\n lst.append(node.right.val)\n if direction == -1:\n lst.reverse()\n direction = -direction\n ret.append(lst)\n queue = new_queue\n return ret[:-1]\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n rv = [[root.val]]\n act_list = [root]\n to_reverse = True\n while True:\n new_list = []\n new_list_val = []\n for n in act_list:\n if n.left:\n new_list.append(n.left)\n new_list_val.append(n.left.val)\n if n.right:\n new_list.append(n.right)\n new_list_val.append(n.right.val)\n if new_list:\n if to_reverse:\n rv.append(new_list_val[::-1])\n else:\n rv.append(new_list_val)\n act_list = new_list\n to_reverse = not to_reverse\n continue\n return rv","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n\n if not root:\n return []\n\n level = 0\n ans = []\n queue = deque()\n queue.append(root)\n\n #print(queue)\n\n while queue:\n curr_len = len(queue)\n curr_queue = deque()\n\n for i in range(curr_len):\n curr = queue.popleft()\n #print(curr)\n if level % 2 == 0:\n curr_queue.append(curr.val)\n else:\n curr_queue.appendleft(curr.val)\n \n if curr.left:\n queue.append(curr.left)\n if curr.right:\n queue.append(curr.right)\n \n ans.append(list(curr_queue))\n level += 1\n \n #print(ans)\n \n return ans\n \n\n ","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n fromLeft = True\n queue = deque([root])\n res = []\n while queue:\n n = len(queue)\n level = []\n for i in range(n):\n node = queue.popleft()\n level.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n if fromLeft:\n res.append(level)\n else:\n res.append(level[::-1])\n # fromLeft ^= 1\n fromLeft = not fromLeft\n return res","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root is None:\n return []\n\n frontier = [(root, 0)]\n result = [] # list of lists\n while len(frontier) > 0:\n node, depth = frontier.pop(0)\n \n if len(result) <= depth:\n result.append([])\n result[depth].append(node.val)\n\n if node.left is not None:\n frontier.append((node.left, depth+1))\n if node.right is not None:\n frontier.append((node.right, depth+1))\n\n # zig zag\n result = [ls if i%2==0 else list(reversed(ls)) for i, ls in enumerate(result)]\n return result ","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n flag = 0\n levels = []\n\n queue = deque([root])\n\n while queue:\n level = len(queue)\n cur = []\n for _ in range(level):\n root = queue.popleft()\n cur.append(root.val)\n if root.left:\n queue.append(root.left)\n if root.right:\n queue.append(root.right)\n if flag == 1:\n levels.append(cur[::-1])\n flag = 0\n else:\n levels.append(cur)\n flag = 1\n return levels\n\n ","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return [ ]\n q = deque()\n q.append(root)\n levelorder = [ ]\n\n level = 1\n while q:\n row = [ ]\n for i in range(len(q)):\n node = q.popleft()\n row.append(node.val)\n if node.left: q.append(node.left)\n if node.right: q.append(node.right)\n \n if level % 2 != 0:\n levelorder.append(row)\n else:\n levelorder.append(reversed(row))\n level += 1\n return levelorder\n","runtime":"34"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n result=[]\n q=deque([root] if root else [])\n while q:\n level=[]\n for i in range(len(q)):\n node=q.popleft()\n level.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n level=reversed(level) if len(result)%2 else level\n result.append(level)\n return result ","runtime":"34"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n zig = True\n q, nq = deque(), deque()\n level = []\n res = []\n\n if not root:\n return []\n\n q.append(root)\n while q:\n node = q.popleft()\n if node:\n level.append(node.val)\n if node.left:\n nq.append(node.left)\n if node.right:\n nq.append(node.right)\n if len(q) == 0:\n q = nq\n nq = deque()\n if len(level) > 0:\n if zig:\n res.append(level)\n zig = False\n else:\n res.append(level[::-1])\n zig = True\n level = []\n return res","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\nfrom collections import deque\nclass Solution:\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n que=deque([root])\n result=[]\n zig=False\n while que:\n zig_len=len(que)\n lev_node=[]\n\n for _ in range(zig_len):\n node=que.popleft()\n lev_node.append(node.val)\n if node.left:\n que.append(node.left)\n if node.right:\n que.append(node.right)\n if zig:\n lev_node.reverse()\n result.append(lev_node)\n zig= not zig\n return result\n\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n queue = deque([root])\n ans = []\n rev = False\n while queue:\n tmp = []\n for _ in range(len(queue)):\n node = queue.popleft()\n tmp.append(node.val)\n if node.right:\n queue.append(node.right)\n if node.left:\n queue.append(node.left)\n if rev:\n ans.append(tmp)\n else:\n ans.append(reversed(tmp))\n rev = not rev\n \n return ans\n \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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root == None:\n return None\n from collections import deque\n q = deque()\n q.append(root)\n count = 0\n ans = []\n while q:\n level = []\n count += 1\n size = len(q)\n for i in range(size):\n node = q.popleft()\n level.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n if count % 2 == 0:\n level = level[::-1]\n ans.append(level)\n return ans\n \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\nfrom collections import deque\nclass Solution:\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n d = deque()\n if root:\n d.append(root)\n \n direction = True\n\n res = []\n while d:\n tmp = []\n l = len(d)\n for i in range(l):\n if direction:\n node = d.popleft()\n tmp.append(node.val)\n if node.left:\n d.append(node.left)\n if node.right:\n d.append(node.right)\n else:\n node = d.pop()\n tmp.append(node.val)\n if node.right:\n d.appendleft(node.right)\n if node.left:\n d.appendleft(node.left)\n\n direction = not direction\n res.append(tmp)\n \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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n \n out = []\n current_out = []\n idx = 0\n current_unvisited = [root]\n next_unvisited = []\n while current_unvisited:\n current_node = current_unvisited[0]\n current_unvisited.remove(current_node)\n current_out.append(current_node.val)\n if current_node.left:\n next_unvisited.append(current_node.left)\n if current_node.right:\n next_unvisited.append(current_node.right)\n if not current_unvisited:\n if idx % 2:\n current_out.reverse()\n out.append(current_out)\n current_out = []\n idx += 1\n current_unvisited, next_unvisited = next_unvisited, []\n\n return out","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n queue = deque([root])\n ans = []\n rev = False\n while queue:\n tmp = []\n for _ in range(len(queue)):\n node = queue.popleft()\n tmp.append(node.val)\n if node.right:\n queue.append(node.right)\n if node.left:\n queue.append(node.left)\n if rev:\n ans.append(tmp)\n else:\n ans.append(reversed(tmp))\n rev = not rev\n \n return ans\n \n \n ","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\nfrom collections import deque\nclass Solution:\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n \n if not root:\n return []\n\n queue = deque()\n\n queue.append(root)\n\n result = []\n alternate = False\n\n while queue:\n\n slate = []\n queue_len = len(queue)\n \n\n for _ in range(queue_len):\n node = queue.popleft()\n slate.append(node.val)\n\n if node.left:\n queue.append(node.left)\n\n if node.right:\n queue.append(node.right)\n \n if alternate:\n result.append(slate[::-1])\n else:\n result.append(slate[:])\n \n alternate = not alternate\n\n return result\n","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n q = [root]\n ans = []\n l2r = True\n while q:\n next_level = []\n nums = []\n for node in q:\n nums.append(node.val)\n if node.left:\n next_level.append(node.left)\n if node.right:\n next_level.append(node.right)\n ans.append(nums if l2r else nums[::-1]) \n l2r = not l2r\n q = next_level\n return ans\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n queue=deque([root])\n res=[]\n while queue:\n l=[]\n for _ in range(len(queue)):\n x=queue.popleft()\n l.append(x.val)\n if(x.left):\n queue.append(x.left)\n if(x.right):\n queue.append(x.right)\n res.append(l)\n flag=True\n for i in range(len(res)):\n if(flag==False):\n res[i]=res[i][::-1]\n flag=True\n else:\n flag=False\n return res\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n result = []\n qu = deque()\n qu.append(root)\n flag = -1\n while qu:\n tmp = []\n children = []\n flag *= -1\n while qu:\n current = qu.popleft()\n tmp.append(current.val)\n if current.left:\n children.append(current.left)\n if current.right:\n children.append(current.right)\n qu.extend(children)\n if flag == -1:\n tmp.reverse()\n result.append(tmp)\n return result\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n \n if not root:\n return []\n\n queue = collections.deque([root])\n left_to_right = 1\n count=0\n q_len = len(queue)\n result = []\n res = []\n\n while queue:\n node = queue.popleft()\n res.append(node.val)\n count+=1\n if node.left:\n queue.append(node.left)\n\n if node.right:\n queue.append(node.right)\n\n if count == q_len:\n if left_to_right==1:\n result.append(res[:])\n else:\n result.append(res[::-1])\n count=0\n q_len = len(queue)\n left_to_right *= -1\n res = []\n \n return result","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n res = []\n toCheck = deque([root])\n currLevel = 0\n while toCheck:\n level = deque()\n for _ in range(len(toCheck)):\n curr = toCheck.popleft()\n if currLevel % 2 == 1:\n level.insert(0, curr.val)\n else:\n level.append(curr.val)\n if curr.left:\n toCheck.append(curr.left)\n if curr.right:\n toCheck.append(curr.right)\n currLevel += 1\n res.append(level)\n return res","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n result=[]\n q=deque([root] if root else [])\n while q:\n level=[]\n for i in range(len(q)):\n node=q.popleft()\n level.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n level=level if len(result)%2==0 else reversed(level)\n result.append(level)\n return result ","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root == None:\n return []\n Q = []\n Elements = []\n Q.append(root)\n #print (Q)\n while Q:\n level_array = []\n X = len(Q)\n for i in range(X):\n item = Q.pop(0)\n if item.left:\n Q.append(item.left)\n if item.right:\n Q.append(item.right)\n level_array.append(item.val)\n if len(Elements)%2==1:\n level_array.reverse()\n Elements.append(level_array) \n print(Elements)\n return Elements\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\nfrom collections import deque\nclass Solution:\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n \n res = []\n queue = deque([root])\n left_to_right = True\n \n while queue:\n level_size = len(queue)\n level = deque()\n \n for _ in range(level_size):\n node = queue.popleft()\n if left_to_right:\n level.append(node.val)\n else:\n level.appendleft(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n \n res.append(list(level))\n left_to_right = not left_to_right\n return res","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root is None:\n return []\n \n q = deque()\n q.append(root)\n \n ans = []\n rev = False\n while q:\n curr = []\n for i in range(0, len(q)):\n u = q.popleft()\n curr.append(u.val)\n \n if u.left is not None:\n q.append(u.left)\n \n if u.right is not None:\n q.append(u.right)\n \n if rev:\n curr.reverse()\n \n ans.append(curr)\n rev = not rev \n \n return ans","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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return root\n\n layer = 1\n q = deque()\n q.append(root)\n result = []\n while q:\n temp = []\n l = len(q)\n for i in range(0,l):\n node = q.popleft()\n temp.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n if layer%2==1:\n result.append(temp)\n else:\n result.append(temp[::-1])\n layer+=1\n return result","runtime":"43"}],"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n queue = []\\n\\n if root is None: \\n return queue\\n \\n answer = []\\n queue.append(root)\\n\\n while(len(queue)!= 0):\\n size = len(queue)\\n\\n level = []\\n for i in range(size):\\n ele = queue.pop(0)\\n level.append(ele.val)\\n if ele.left:\\n queue.append(ele.left)\\n if ele.right:\\n queue.append(ele.right)\\n \\n if len(answer) % 2 == 1: \\n level.reverse()\\n \\n\\n answer.append(level)\\n \\n return answer\\n \",\n \"runtime\": \"15\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res = []\\n q = [root]\\n rev = True\\n\\n while q:\\n count = len(q)\\n nodes = []\\n \\n for _ in range(count):\\n node = q.pop(0)\\n if node:\\n nodes.append(node.val)\\n q.append(node.left)\\n q.append(node.right)\\n if nodes:\\n res.append(nodes if rev else nodes[::-1])\\n rev = not rev\\n return res\\n\",\n \"runtime\": \"16\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n \\n if not root:\\n return []\\n\\n queue = deque()\\n queue.append(root)\\n res = []\\n level = 0\\n\\n while queue:\\n level_size = len(queue)\\n current_level = []\\n \\n for _ in range(level_size):\\n node = queue.popleft()\\n current_level.append(node.val)\\n \\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n \\n if level % 2 == 1:\\n current_level.reverse()\\n \\n res.append(current_level)\\n level += 1\\n \\n return res\\n \\n \\n \",\n \"runtime\": \"17\"\n },\n {\n \"code\": \"class Solution:\\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n q=collections.deque()\\n results=[]\\n q.append(root)\\n flag=True\\n while q:\\n level=[]\\n for _ in range(len(q)):\\n node=q.popleft()\\n if node:\\n level.append(node.val)\\n q.append(node.left)\\n q.append(node.right)\\n if level:\\n results.append(level if flag else level[::-1])\\n flag = not flag\\n return results\\n\",\n \"runtime\": \"18\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n \\n queue = deque([root])\\n ans = []\\n counter = 0\\n while queue:\\n nodes_in_current_level = len(queue)\\n # do some logic here for the current level\\n level_ans = []\\n for _ in range(nodes_in_current_level):\\n node = queue.popleft()\\n\\n # do some logic here on the current node\\n level_ans.append(node.val)\\n\\n # put the next level onto the queue\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n \\n counter += 1\\n if (counter % 2) == 0:\\n level_ans = level_ans[::-1]\\n \\n ans.append(level_ans)\\n return ans\",\n \"runtime\": \"19\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n OP = []\\n\\n Queue = []\\n Queue.append([root])\\n\\n while Queue:\\n Temp = []\\n TempQueue = []\\n Nodes = Queue.pop(0)\\n for Node in Nodes:\\n if Node:\\n if Node.left:\\n TempQueue.append(Node.left)\\n if root.right:\\n TempQueue.append(Node.right)\\n Temp.append(Node.val)\\n if len(TempQueue) != 0:\\n Queue.append(TempQueue)\\n if len(Temp) != 0:\\n OP.append(Temp)\\n\\n for i in range(len(OP)):\\n if i%2 != 0:\\n OP[i] = OP[i][::-1]\\n return OP\\n\\n\\n\\n\",\n \"runtime\": \"20\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n def printRightToLeft(queue):\\n numNodes = len(queue)\\n out = []\\n for _ in range(numNodes):\\n node = queue.pop()\\n out.append(node.val)\\n if node.right:\\n queue.appendleft(node.right)\\n if node.left:\\n queue.appendleft(node.left)\\n return queue, out\\n\\n def printLeftToRight(queue):\\n numNodes = len(queue)\\n out = []\\n for _ in range(numNodes):\\n node = queue.popleft()\\n out.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n return queue, out\\n\\n if not root:\\n return []\\n queue = deque([root])\\n out = []\\n order = True\\n while queue:\\n if order:\\n queue, printList = printLeftToRight(queue)\\n order = False\\n else:\\n queue, printList = printRightToLeft(queue)\\n order = True\\n out.append(printList)\\n return out\\n\\n\\n \",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n\\n levels = [[root]]\\n level_index = 0\\n results = []\\n while levels:\\n level = levels.pop(0)\\n nxt_level = []\\n r = []\\n for node in level:\\n r.append(node.val)\\n order = [node.left, node.right]\\n for o in order:\\n if o:\\n nxt_level.append(o)\\n if level_index % 2 == 1:\\n r = r[::-1]\\n results.append(r)\\n if nxt_level:\\n levels.append(nxt_level)\\n level_index += 1\\n return results\\n\",\n \"runtime\": \"22\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n \\n if not root:\\n return []\\n\\n queue = collections.deque([root])\\n left_to_right = 1\\n count=0\\n q_len = len(queue)\\n result = []\\n res = collections.deque()\\n\\n while queue:\\n node = queue.popleft()\\n if left_to_right==1:\\n res.append(node.val)\\n else:\\n res.appendleft(node.val)\\n count+=1\\n if node.left:\\n queue.append(node.left)\\n\\n if node.right:\\n queue.append(node.right)\\n\\n if count == q_len:\\n result.append(list(res))\\n count=0\\n q_len = len(queue)\\n left_to_right *= -1\\n res = collections.deque()\\n \\n return result\\n\\n\",\n \"runtime\": \"23\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n \\n if not root:\\n return None\\n\\n level = 0\\n q = collections.deque([root])\\n res = []\\n\\n while q:\\n levels = []\\n\\n\\n for i in range(len(q)):\\n node = q.popleft()\\n\\n if node and level % 2 == 0:\\n levels.append(node.val)\\n else:\\n levels.insert(0, node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n level += 1\\n res.append(levels)\\n return res\",\n \"runtime\": \"23\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n ans = []\\n if root is None:\\n return ans\\n \\n queue = [root]\\n ltor = True\\n \\n while queue:\\n size = len(queue)\\n temp = []\\n \\n for i in range(size):\\n frontnode = queue.pop(0)\\n # Add the node value to temp based on ltor (left to right or right to left)\\n if ltor:\\n temp.append(frontnode.val)\\n else:\\n temp.insert(0, frontnode.val)\\n # Add the left and right children to the queue\\n if frontnode.left:\\n queue.append(frontnode.left)\\n if frontnode.right:\\n queue.append(frontnode.right)\\n # Add the current level's result to ans\\n ans.append(temp)\\n # Toggle the direction for the next level\\n ltor = not ltor\\n \\n return ans\",\n \"runtime\": \"24\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n\\n q = deque()\\n q.append(root)\\n is_reversed = False\\n res = []\\n\\n while q:\\n size = len(q)\\n curr_lv = []\\n for _ in range(size):\\n curr = q.popleft()\\n curr_lv.append(curr.val)\\n if curr.left:\\n q.append(curr.left)\\n if curr.right:\\n q.append(curr.right)\\n if not is_reversed:\\n res.append(curr_lv)\\n else:\\n curr_lv.reverse()\\n res.append(curr_lv)\\n is_reversed = not is_reversed\\n return res\\n\",\n \"runtime\": \"24\"\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\\nclass Solution:\\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n\\n queue, ans = deque([root]), []\\n while queue:\\n nodes_at_this_level, curr_values = len(queue), []\\n \\n for _ in range(nodes_at_this_level):\\n node = queue.popleft()\\n curr_values.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n ans.append(reversed(curr_values) if len(ans) % 2 else curr_values)\\n return ans\",\n \"runtime\": \"25\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n level = 0\\n ansMap = defaultdict(list)\\n \\n if root is None:\\n return []\\n \\n queue = deque()\\n queue.append(root)\\n \\n \\n while queue:\\n interqueue = deque()\\n for _ in range(len(queue)):\\n current = queue.popleft()\\n if current is not None:\\n if level % 2 == 1:\\n interqueue.appendleft(current.val)\\n else:\\n interqueue.append(current.val)\\n if current.left is not None:\\n queue.append(current.left) \\n if current.right is not None:\\n queue.append(current.right) \\n ansMap[level] = interqueue\\n level += 1\\n \\n return ansMap.values()\",\n \"runtime\": \"25\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n result = []\\n left_to_right = 1\\n queue = deque([root])\\n while queue:\\n n = len(queue)\\n ans = [] #temp list to store value per level\\n for i in range(n):\\n #pop and save result\\n curr = queue.popleft()\\n \\n if left_to_right == 1:\\n ans.append(curr.val)\\n else:\\n ans.insert(0, curr.val)\\n\\n if curr.left:\\n queue.append(curr.left)\\n if curr.right:\\n queue.append(curr.right)\\n\\n left_to_right *= (-1)\\n #push ans into main result list\\n result.append(ans)\\n\\n return result \\n\",\n \"runtime\": \"26\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n isPopLeft = False\\n ans = []\\n queue = deque([root])\\n while queue:\\n row = deque()\\n curr_length = len(queue)\\n for _ in range(curr_length):\\n node = queue.popleft()\\n if node:\\n if isPopLeft:\\n row.appendleft(node.val)\\n else:\\n row.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n isPopLeft = not isPopLeft\\n ans.append(row)\\n return ans\",\n \"runtime\": \"26\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n \\n\\n if not root : return None \\n result = []\\n switch = False \\n q = [root]\\n while q:\\n l = len(q)\\n temp = []\\n for i in range(l):\\n node = q.pop(0)\\n temp.append(node.val)\\n\\n if node.left is not None:\\n q.append(node.left)\\n \\n if node.right is not None:\\n q.append(node.right)\\n if switch == True :\\n temp.reverse()\\n switch = False \\n else:\\n switch = True \\n\\n result.append(temp)\\n \\n return result \",\n \"runtime\": \"27\"\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\\nclass Solution:\\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root is None:\\n return \\n stack = deque([root])\\n i = 1\\n ans = []\\n while stack:\\n c = len(stack)\\n t_ans = []\\n for _ in range(c):\\n node = stack.popleft()\\n print(i)\\n if node.val is not None:\\n t_ans.append(node.val)\\n if node.left:\\n stack.append(node.left)\\n if node.right:\\n stack.append(node.right)\\n if i == 0:\\n ans.append(t_ans[::-1])\\n i = 1\\n else:\\n ans.append(t_ans)\\n i = 0\\n \\n return ans \",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res=[]\\n def add(i,tree):\\n if len(res)<=i:\\n res.append([tree.val])\\n else:\\n res[i].append(tree.val)\\n i+=1\\n if tree.left: add(i,tree.left)\\n if tree.right: add(i,tree.right)\\n if root: \\n add(0,root)\\n for i in range(len(res)):\\n if i%2==1:\\n res[i].reverse()\\n return res\\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\\nclass Solution:\\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n def visit(node, level, output):\\n if not node:\\n return\\n if level < len(output):\\n if level % 2 == 0:\\n output[level].append(node.val)\\n else:\\n output[level].insert(0, node.val)\\n else:\\n output.append([node.val])\\n visit(node.left, level+1, output)\\n visit(node.right, level+1, output)\\n output = []\\n visit(root, 0, output)\\n return output\",\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: #2\\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n q = [root]\\n ans = []\\n l2r = True\\n while q:\\n next_level = []\\n nums = []\\n for node in q:\\n nums.append(node.val)\\n if node.left:\\n next_level.append(node.left)\\n if node.right:\\n next_level.append(node.right)\\n ans.append(nums if l2r else nums[::-1])\\n l2r = not l2r\\n q = next_level\\n return ans\\n\\n\\n\\n\\n\\n\\n\\n '''\\n if not root:\\n return []\\n q = [root]\\n ans = []\\n l2r = True\\n while q:\\n next_level = []\\n nums = []\\n for node in q:\\n nums.append(node.val)\\n if node.left:\\n next_level.append(node.left)\\n if node.right:\\n next_level.append(node.right)\\n ans.append(nums if l2r else nums[::-1]) \\n l2r = not l2r\\n q = next_level\\n return ans\\n '''\\n \",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n \\n queue = deque([root])\\n\\n ans = []\\n\\n left_to_right = True\\n while queue:\\n level = []\\n n = len(queue)\\n\\n for i in range(n):\\n node = queue.popleft()\\n \\n if node:\\n if left_to_right:\\n level.append(node.val)\\n else:\\n level.insert(0, node.val)\\n\\n if node.left:\\n queue.append(node.left)\\n\\n if node.right:\\n queue.append(node.right)\\n\\n ans.append(level)\\n left_to_right = not left_to_right\\n\\n return ans\\n\\n \",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n queue = [root]\\n ret = [[root.val]]\\n direction = -1\\n while queue:\\n new_queue = []\\n lst = []\\n for node in queue:\\n if node.left:\\n new_queue.append(node.left)\\n lst.append(node.left.val)\\n if node.right:\\n new_queue.append(node.right)\\n lst.append(node.right.val)\\n if direction == -1:\\n lst.reverse()\\n direction = -direction\\n ret.append(lst)\\n queue = new_queue\\n return ret[:-1]\\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n rv = [[root.val]]\\n act_list = [root]\\n to_reverse = True\\n while True:\\n new_list = []\\n new_list_val = []\\n for n in act_list:\\n if n.left:\\n new_list.append(n.left)\\n new_list_val.append(n.left.val)\\n if n.right:\\n new_list.append(n.right)\\n new_list_val.append(n.right.val)\\n if new_list:\\n if to_reverse:\\n rv.append(new_list_val[::-1])\\n else:\\n rv.append(new_list_val)\\n act_list = new_list\\n to_reverse = not to_reverse\\n continue\\n return rv\",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n\\n if not root:\\n return []\\n\\n level = 0\\n ans = []\\n queue = deque()\\n queue.append(root)\\n\\n #print(queue)\\n\\n while queue:\\n curr_len = len(queue)\\n curr_queue = deque()\\n\\n for i in range(curr_len):\\n curr = queue.popleft()\\n #print(curr)\\n if level % 2 == 0:\\n curr_queue.append(curr.val)\\n else:\\n curr_queue.appendleft(curr.val)\\n \\n if curr.left:\\n queue.append(curr.left)\\n if curr.right:\\n queue.append(curr.right)\\n \\n ans.append(list(curr_queue))\\n level += 1\\n \\n #print(ans)\\n \\n return ans\\n \\n\\n \",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n fromLeft = True\\n queue = deque([root])\\n res = []\\n while queue:\\n n = len(queue)\\n level = []\\n for i in range(n):\\n node = queue.popleft()\\n level.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n if fromLeft:\\n res.append(level)\\n else:\\n res.append(level[::-1])\\n # fromLeft ^= 1\\n fromLeft = not fromLeft\\n return res\",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root is None:\\n return []\\n\\n frontier = [(root, 0)]\\n result = [] # list of lists\\n while len(frontier) > 0:\\n node, depth = frontier.pop(0)\\n \\n if len(result) <= depth:\\n result.append([])\\n result[depth].append(node.val)\\n\\n if node.left is not None:\\n frontier.append((node.left, depth+1))\\n if node.right is not None:\\n frontier.append((node.right, depth+1))\\n\\n # zig zag\\n result = [ls if i%2==0 else list(reversed(ls)) for i, ls in enumerate(result)]\\n return result \",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n flag = 0\\n levels = []\\n\\n queue = deque([root])\\n\\n while queue:\\n level = len(queue)\\n cur = []\\n for _ in range(level):\\n root = queue.popleft()\\n cur.append(root.val)\\n if root.left:\\n queue.append(root.left)\\n if root.right:\\n queue.append(root.right)\\n if flag == 1:\\n levels.append(cur[::-1])\\n flag = 0\\n else:\\n levels.append(cur)\\n flag = 1\\n return levels\\n\\n \",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return [ ]\\n q = deque()\\n q.append(root)\\n levelorder = [ ]\\n\\n level = 1\\n while q:\\n row = [ ]\\n for i in range(len(q)):\\n node = q.popleft()\\n row.append(node.val)\\n if node.left: q.append(node.left)\\n if node.right: q.append(node.right)\\n \\n if level % 2 != 0:\\n levelorder.append(row)\\n else:\\n levelorder.append(reversed(row))\\n level += 1\\n return levelorder\\n\",\n \"runtime\": \"34\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n result=[]\\n q=deque([root] if root else [])\\n while q:\\n level=[]\\n for i in range(len(q)):\\n node=q.popleft()\\n level.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n level=reversed(level) if len(result)%2 else level\\n result.append(level)\\n return result \",\n \"runtime\": \"34\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n zig = True\\n q, nq = deque(), deque()\\n level = []\\n res = []\\n\\n if not root:\\n return []\\n\\n q.append(root)\\n while q:\\n node = q.popleft()\\n if node:\\n level.append(node.val)\\n if node.left:\\n nq.append(node.left)\\n if node.right:\\n nq.append(node.right)\\n if len(q) == 0:\\n q = nq\\n nq = deque()\\n if len(level) > 0:\\n if zig:\\n res.append(level)\\n zig = False\\n else:\\n res.append(level[::-1])\\n zig = True\\n level = []\\n return res\",\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\\nfrom collections import deque\\nclass Solution:\\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n que=deque([root])\\n result=[]\\n zig=False\\n while que:\\n zig_len=len(que)\\n lev_node=[]\\n\\n for _ in range(zig_len):\\n node=que.popleft()\\n lev_node.append(node.val)\\n if node.left:\\n que.append(node.left)\\n if node.right:\\n que.append(node.right)\\n if zig:\\n lev_node.reverse()\\n result.append(lev_node)\\n zig= not zig\\n return result\\n\\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n queue = deque([root])\\n ans = []\\n rev = False\\n while queue:\\n tmp = []\\n for _ in range(len(queue)):\\n node = queue.popleft()\\n tmp.append(node.val)\\n if node.right:\\n queue.append(node.right)\\n if node.left:\\n queue.append(node.left)\\n if rev:\\n ans.append(tmp)\\n else:\\n ans.append(reversed(tmp))\\n rev = not rev\\n \\n return ans\\n \\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root == None:\\n return None\\n from collections import deque\\n q = deque()\\n q.append(root)\\n count = 0\\n ans = []\\n while q:\\n level = []\\n count += 1\\n size = len(q)\\n for i in range(size):\\n node = q.popleft()\\n level.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n if count % 2 == 0:\\n level = level[::-1]\\n ans.append(level)\\n return ans\\n \\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\\nfrom collections import deque\\nclass Solution:\\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n d = deque()\\n if root:\\n d.append(root)\\n \\n direction = True\\n\\n res = []\\n while d:\\n tmp = []\\n l = len(d)\\n for i in range(l):\\n if direction:\\n node = d.popleft()\\n tmp.append(node.val)\\n if node.left:\\n d.append(node.left)\\n if node.right:\\n d.append(node.right)\\n else:\\n node = d.pop()\\n tmp.append(node.val)\\n if node.right:\\n d.appendleft(node.right)\\n if node.left:\\n d.appendleft(node.left)\\n\\n direction = not direction\\n res.append(tmp)\\n \\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n \\n out = []\\n current_out = []\\n idx = 0\\n current_unvisited = [root]\\n next_unvisited = []\\n while current_unvisited:\\n current_node = current_unvisited[0]\\n current_unvisited.remove(current_node)\\n current_out.append(current_node.val)\\n if current_node.left:\\n next_unvisited.append(current_node.left)\\n if current_node.right:\\n next_unvisited.append(current_node.right)\\n if not current_unvisited:\\n if idx % 2:\\n current_out.reverse()\\n out.append(current_out)\\n current_out = []\\n idx += 1\\n current_unvisited, next_unvisited = next_unvisited, []\\n\\n return out\",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n queue = deque([root])\\n ans = []\\n rev = False\\n while queue:\\n tmp = []\\n for _ in range(len(queue)):\\n node = queue.popleft()\\n tmp.append(node.val)\\n if node.right:\\n queue.append(node.right)\\n if node.left:\\n queue.append(node.left)\\n if rev:\\n ans.append(tmp)\\n else:\\n ans.append(reversed(tmp))\\n rev = not rev\\n \\n return ans\\n \\n \\n \",\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\\nfrom collections import deque\\nclass Solution:\\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n \\n if not root:\\n return []\\n\\n queue = deque()\\n\\n queue.append(root)\\n\\n result = []\\n alternate = False\\n\\n while queue:\\n\\n slate = []\\n queue_len = len(queue)\\n \\n\\n for _ in range(queue_len):\\n node = queue.popleft()\\n slate.append(node.val)\\n\\n if node.left:\\n queue.append(node.left)\\n\\n if node.right:\\n queue.append(node.right)\\n \\n if alternate:\\n result.append(slate[::-1])\\n else:\\n result.append(slate[:])\\n \\n alternate = not alternate\\n\\n return result\\n\",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n q = [root]\\n ans = []\\n l2r = True\\n while q:\\n next_level = []\\n nums = []\\n for node in q:\\n nums.append(node.val)\\n if node.left:\\n next_level.append(node.left)\\n if node.right:\\n next_level.append(node.right)\\n ans.append(nums if l2r else nums[::-1]) \\n l2r = not l2r\\n q = next_level\\n return ans\\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n queue=deque([root])\\n res=[]\\n while queue:\\n l=[]\\n for _ in range(len(queue)):\\n x=queue.popleft()\\n l.append(x.val)\\n if(x.left):\\n queue.append(x.left)\\n if(x.right):\\n queue.append(x.right)\\n res.append(l)\\n flag=True\\n for i in range(len(res)):\\n if(flag==False):\\n res[i]=res[i][::-1]\\n flag=True\\n else:\\n flag=False\\n return res\\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n result = []\\n qu = deque()\\n qu.append(root)\\n flag = -1\\n while qu:\\n tmp = []\\n children = []\\n flag *= -1\\n while qu:\\n current = qu.popleft()\\n tmp.append(current.val)\\n if current.left:\\n children.append(current.left)\\n if current.right:\\n children.append(current.right)\\n qu.extend(children)\\n if flag == -1:\\n tmp.reverse()\\n result.append(tmp)\\n return result\\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n \\n if not root:\\n return []\\n\\n queue = collections.deque([root])\\n left_to_right = 1\\n count=0\\n q_len = len(queue)\\n result = []\\n res = []\\n\\n while queue:\\n node = queue.popleft()\\n res.append(node.val)\\n count+=1\\n if node.left:\\n queue.append(node.left)\\n\\n if node.right:\\n queue.append(node.right)\\n\\n if count == q_len:\\n if left_to_right==1:\\n result.append(res[:])\\n else:\\n result.append(res[::-1])\\n count=0\\n q_len = len(queue)\\n left_to_right *= -1\\n res = []\\n \\n return result\",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n res = []\\n toCheck = deque([root])\\n currLevel = 0\\n while toCheck:\\n level = deque()\\n for _ in range(len(toCheck)):\\n curr = toCheck.popleft()\\n if currLevel % 2 == 1:\\n level.insert(0, curr.val)\\n else:\\n level.append(curr.val)\\n if curr.left:\\n toCheck.append(curr.left)\\n if curr.right:\\n toCheck.append(curr.right)\\n currLevel += 1\\n res.append(level)\\n return res\",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n result=[]\\n q=deque([root] if root else [])\\n while q:\\n level=[]\\n for i in range(len(q)):\\n node=q.popleft()\\n level.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n level=level if len(result)%2==0 else reversed(level)\\n result.append(level)\\n return result \",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root == None:\\n return []\\n Q = []\\n Elements = []\\n Q.append(root)\\n #print (Q)\\n while Q:\\n level_array = []\\n X = len(Q)\\n for i in range(X):\\n item = Q.pop(0)\\n if item.left:\\n Q.append(item.left)\\n if item.right:\\n Q.append(item.right)\\n level_array.append(item.val)\\n if len(Elements)%2==1:\\n level_array.reverse()\\n Elements.append(level_array) \\n print(Elements)\\n return Elements\\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\\nfrom collections import deque\\nclass Solution:\\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n \\n res = []\\n queue = deque([root])\\n left_to_right = True\\n \\n while queue:\\n level_size = len(queue)\\n level = deque()\\n \\n for _ in range(level_size):\\n node = queue.popleft()\\n if left_to_right:\\n level.append(node.val)\\n else:\\n level.appendleft(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n \\n res.append(list(level))\\n left_to_right = not left_to_right\\n return res\",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root is None:\\n return []\\n \\n q = deque()\\n q.append(root)\\n \\n ans = []\\n rev = False\\n while q:\\n curr = []\\n for i in range(0, len(q)):\\n u = q.popleft()\\n curr.append(u.val)\\n \\n if u.left is not None:\\n q.append(u.left)\\n \\n if u.right is not None:\\n q.append(u.right)\\n \\n if rev:\\n curr.reverse()\\n \\n ans.append(curr)\\n rev = not rev \\n \\n return ans\",\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return root\\n\\n layer = 1\\n q = deque()\\n q.append(root)\\n result = []\\n while q:\\n temp = []\\n l = len(q)\\n for i in range(0,l):\\n node = q.popleft()\\n temp.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n if layer%2==1:\\n result.append(temp)\\n else:\\n result.append(temp[::-1])\\n layer+=1\\n return result\",\n \"runtime\": \"43\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":48,"string":"48"},"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n res, right, q = [], False, deque()\n q.append(root)\n\n while q:\n qlen = len(q)\n level = []\n for i in range(qlen):\n node = q.popleft()\n if node:\n level.append(node.val)\n q.append(node.left)\n q.append(node.right)\n \n if level and right:\n res.append(level[::-1])\n elif level and not right:\n res.append(level)\n right = False if right else True\n return res","memory":"16200"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n level_order = []\n if not root:\n return level_order\n\n deque = []\n deque.append(root)\n zig = True\n while deque:\n num = len(deque)\n level = []\n for _ in range(num):\n curr = deque.pop(0)\n if zig:\n level.append(curr.val)\n else:\n level.insert(0, curr.val)\n\n if curr.left:\n deque.append(curr.left)\n if curr.right:\n deque.append(curr.right)\n\n zig = not zig\n level_order.append(level)\n\n return level_order \n","memory":"16300"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root is None:\n return []\n \n Q = []\n Elements = []\n\n Q.append(root)\n while Q:\n X = len(Q)\n array_level = []\n for i in range(X):\n item = Q.pop(0)\n\n if item.left:\n Q.append(item.left)\n if item.right:\n Q.append(item.right)\n\n array_level.append(item.val)\n Elements.append(array_level)\n \n for i in range(len(Elements)):\n if i % 2 == 1:\n Elements[i].reverse()\n \n return Elements\n\n","memory":"16400"},{"code":"class Solution:\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root is None:\n return\n result, zigzagDirection = [], 1\n q = [root]\n while q:\n level, queueLength = [], len(q)\n for i in range(queueLength):\n node = q.pop(0)\n level.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n result.append(level[::zigzagDirection])\n zigzagDirection *= -1\n return result","memory":"16500"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n res = []\n if not root:\n return res\n level = [root]\n even = True\n while level:\n val = []\n levelCurr = []\n for i in level:\n val.append(i.val)\n if i.left:\n levelCurr.append(i.left)\n if i.right:\n levelCurr.append(i.right)\n if even:\n res.append(val)\n even = False\n else:\n res.append(val[::-1])\n even = True\n level = levelCurr\n return res\n ","memory":"16600"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n q = [root]\n ans = []\n l2r = True\n while q:\n next_level = []\n nums = []\n for node in q:\n nums.append(node.val)\n if node.left:\n next_level.append(node.left)\n if node.right:\n next_level.append(node.right)\n ans.append(nums if l2r else nums[::-1]) \n l2r = not l2r\n q = next_level\n return ans\n ","memory":"16600"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root is None:\n return []\n Q = [root]\n ans = []\n while Q:\n l = []\n for i in range(len(Q)):\n node = Q.pop(0)\n l.append(node.val)\n if node.left:\n Q.append(node.left)\n if node.right:\n Q.append(node.right)\n ans.append(l)\n for i in range(1,len(ans)+1):\n if i%2==0:\n ans[i-1] = ans[i-1][::-1]\n return ans\n ","memory":"16700"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n ans = []\n direction = 1\n if not root:\n return ans\n queue = deque([root])\n\n while queue:\n level = []\n for _ in range(len(queue)):\n if direction:\n cur = queue.popleft()\n level.append(cur.val)\n if cur.left:\n queue.append(cur.left)\n if cur.right:\n queue.append(cur.right)\n else:\n cur = queue.pop()\n level.append(cur.val)\n if cur.right:\n queue.appendleft(cur.right)\n if cur.left:\n queue.appendleft(cur.left)\n \n direction = not direction\n ans.append(level)\n return ans","memory":"16700"},{"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\nfrom collections import deque\nclass Solution:\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n\n res = []\n # the level queue\n q = deque([(root, 0)])\n level_list = []\n while q: \n node, lv = q.popleft()\n if lv == len(res):\n res.append([])\n if lv % 2 == 0:\n res[lv].append(node.val)\n else:\n res[lv] = [node.val] + res[lv]\n\n \n\n if node.left is not None:\n q.append((node.left, lv + 1))\n if node.right is not None:\n q.append((node.right, lv + 1))\n\n return res\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n # output = []\n # def dfs(root, lv):\n # if not root:\n # return\n\n # if lv <= len(output) - 1 and lv % 2 == 0:\n # output[lv].append(root.val)\n\n # elif lv <= len(output) - 1 and lv % 2 != 0:\n # output[lv].insert(0, root.val)\n\n # else:\n # output.append([root.val])\n\n # dfs(root.left, lv + 1)\n # dfs(root.right, lv + 1)\n\n # dfs(root, 0)\n # return output","memory":"16800"},{"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root is None:\n return []\n all_levels = {}\n queue = []\n queue.append((root, 1))\n \n while queue:\n [cur, lv] = queue.pop(0)\n\n if lv in all_levels:\n all_levels[lv].append(cur.val)\n else:\n all_levels[lv] = [cur.val]\n \n if cur.left:\n queue.append((cur.left, lv+1))\n if cur.right:\n queue.append((cur.right, lv+1))\n \n res = []\n for lv in all_levels:\n if lv%2 == 0:\n res.append(all_levels[lv][::-1])\n else:\n res.append(all_levels[lv][:])\n return res\n","memory":"16800"}],"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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res, right, q = [], False, deque()\\n q.append(root)\\n\\n while q:\\n qlen = len(q)\\n level = []\\n for i in range(qlen):\\n node = q.popleft()\\n if node:\\n level.append(node.val)\\n q.append(node.left)\\n q.append(node.right)\\n \\n if level and right:\\n res.append(level[::-1])\\n elif level and not right:\\n res.append(level)\\n right = False if right else True\\n return res\",\n \"memory\": \"16200\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n level_order = []\\n if not root:\\n return level_order\\n\\n deque = []\\n deque.append(root)\\n zig = True\\n while deque:\\n num = len(deque)\\n level = []\\n for _ in range(num):\\n curr = deque.pop(0)\\n if zig:\\n level.append(curr.val)\\n else:\\n level.insert(0, curr.val)\\n\\n if curr.left:\\n deque.append(curr.left)\\n if curr.right:\\n deque.append(curr.right)\\n\\n zig = not zig\\n level_order.append(level)\\n\\n return level_order \\n\",\n \"memory\": \"16300\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root is None:\\n return []\\n \\n Q = []\\n Elements = []\\n\\n Q.append(root)\\n while Q:\\n X = len(Q)\\n array_level = []\\n for i in range(X):\\n item = Q.pop(0)\\n\\n if item.left:\\n Q.append(item.left)\\n if item.right:\\n Q.append(item.right)\\n\\n array_level.append(item.val)\\n Elements.append(array_level)\\n \\n for i in range(len(Elements)):\\n if i % 2 == 1:\\n Elements[i].reverse()\\n \\n return Elements\\n\\n\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root is None:\\n return\\n result, zigzagDirection = [], 1\\n q = [root]\\n while q:\\n level, queueLength = [], len(q)\\n for i in range(queueLength):\\n node = q.pop(0)\\n level.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n result.append(level[::zigzagDirection])\\n zigzagDirection *= -1\\n return result\",\n \"memory\": \"16500\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res = []\\n if not root:\\n return res\\n level = [root]\\n even = True\\n while level:\\n val = []\\n levelCurr = []\\n for i in level:\\n val.append(i.val)\\n if i.left:\\n levelCurr.append(i.left)\\n if i.right:\\n levelCurr.append(i.right)\\n if even:\\n res.append(val)\\n even = False\\n else:\\n res.append(val[::-1])\\n even = True\\n level = levelCurr\\n return res\\n \",\n \"memory\": \"16600\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n q = [root]\\n ans = []\\n l2r = True\\n while q:\\n next_level = []\\n nums = []\\n for node in q:\\n nums.append(node.val)\\n if node.left:\\n next_level.append(node.left)\\n if node.right:\\n next_level.append(node.right)\\n ans.append(nums if l2r else nums[::-1]) \\n l2r = not l2r\\n q = next_level\\n return ans\\n \",\n \"memory\": \"16600\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root is None:\\n return []\\n Q = [root]\\n ans = []\\n while Q:\\n l = []\\n for i in range(len(Q)):\\n node = Q.pop(0)\\n l.append(node.val)\\n if node.left:\\n Q.append(node.left)\\n if node.right:\\n Q.append(node.right)\\n ans.append(l)\\n for i in range(1,len(ans)+1):\\n if i%2==0:\\n ans[i-1] = ans[i-1][::-1]\\n return ans\\n \",\n \"memory\": \"16700\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n ans = []\\n direction = 1\\n if not root:\\n return ans\\n queue = deque([root])\\n\\n while queue:\\n level = []\\n for _ in range(len(queue)):\\n if direction:\\n cur = queue.popleft()\\n level.append(cur.val)\\n if cur.left:\\n queue.append(cur.left)\\n if cur.right:\\n queue.append(cur.right)\\n else:\\n cur = queue.pop()\\n level.append(cur.val)\\n if cur.right:\\n queue.appendleft(cur.right)\\n if cur.left:\\n queue.appendleft(cur.left)\\n \\n direction = not direction\\n ans.append(level)\\n return ans\",\n \"memory\": \"16700\"\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\\nfrom collections import deque\\nclass Solution:\\n def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n\\n res = []\\n # the level queue\\n q = deque([(root, 0)])\\n level_list = []\\n while q: \\n node, lv = q.popleft()\\n if lv == len(res):\\n res.append([])\\n if lv % 2 == 0:\\n res[lv].append(node.val)\\n else:\\n res[lv] = [node.val] + res[lv]\\n\\n \\n\\n if node.left is not None:\\n q.append((node.left, lv + 1))\\n if node.right is not None:\\n q.append((node.right, lv + 1))\\n\\n return res\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # output = []\\n # def dfs(root, lv):\\n # if not root:\\n # return\\n\\n # if lv <= len(output) - 1 and lv % 2 == 0:\\n # output[lv].append(root.val)\\n\\n # elif lv <= len(output) - 1 and lv % 2 != 0:\\n # output[lv].insert(0, root.val)\\n\\n # else:\\n # output.append([root.val])\\n\\n # dfs(root.left, lv + 1)\\n # dfs(root.right, lv + 1)\\n\\n # dfs(root, 0)\\n # return output\",\n \"memory\": \"16800\"\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 zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root is None:\\n return []\\n all_levels = {}\\n queue = []\\n queue.append((root, 1))\\n \\n while queue:\\n [cur, lv] = queue.pop(0)\\n\\n if lv in all_levels:\\n all_levels[lv].append(cur.val)\\n else:\\n all_levels[lv] = [cur.val]\\n \\n if cur.left:\\n queue.append((cur.left, lv+1))\\n if cur.right:\\n queue.append((cur.right, lv+1))\\n \\n res = []\\n for lv in all_levels:\\n if lv%2 == 0:\\n res.append(all_levels[lv][::-1])\\n else:\\n res.append(all_levels[lv][:])\\n return res\\n\",\n \"memory\": \"16800\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":10,"string":"10"}}},{"rowIdx":157,"cells":{"question_id":{"kind":"number","value":104,"string":"104"},"name":{"kind":"string","value":"maximum-depth-of-binary-tree"},"content":{"kind":"string","value":"<p>Given the <code>root</code> of a binary tree, return <em>its maximum depth</em>.</p>\n\n<p>A binary tree's <strong>maximum depth</strong> is the number of nodes along the longest path from the root node down to the farthest leaf node.</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/26/tmp-tree.jpg\" style=\"width: 400px; height: 277px;\" />\n<pre>\n<strong>Input:</strong> root = [3,9,20,null,null,15,7]\n<strong>Output:</strong> 3\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> root = [1,null,2]\n<strong>Output:</strong> 2\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>[0, 10<sup>4</sup>]</code>.</li>\n\t<li><code>-100 <= Node.val <= 100</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":76.08787320455049,"string":"76.087873"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["tree","depth-first-search","breadth-first-search","binary-tree"],"string":"[\n \"tree\",\n \"depth-first-search\",\n \"breadth-first-search\",\n \"binary-tree\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"13\", 0.0021], [\"15\", 0.0042], [\"16\", 0.0042], [\"18\", 0.0063], [\"19\", 0.0294], [\"20\", 0.0084], [\"21\", 0.0126], [\"22\", 0.0463], [\"23\", 0.1409], [\"24\", 0.1199], [\"25\", 0.1451], [\"26\", 0.2881], [\"27\", 0.774], [\"28\", 0.4795], [\"29\", 0.6246], [\"30\", 1.2577], [\"31\", 2.8099], [\"32\", 1.6531], [\"33\", 2.0485], [\"34\", 3.5544], [\"35\", 6.1518], [\"36\", 4.2737], [\"37\", 4.2232], [\"38\", 6.6545], [\"39\", 9.3171], [\"40\", 6.2843], [\"41\", 5.6975], [\"42\", 7.5609], [\"43\", 8.7135], [\"44\", 6.2128], [\"45\", 4.5955], [\"46\", 4.7132], [\"47\", 4.036]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"17000\", 0.0042], [\"17100\", 0.0147], [\"17200\", 0.0694], [\"17300\", 1.0474], [\"17400\", 4.1264], [\"17500\", 12.1711], [\"17600\", 40.2654]]}"},"rt_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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n return max(self.maxDepth(root.right)+1, self.maxDepth(root.left)+1)\n\n ","runtime":"16"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n ld = rd = 0\n if root.left is not None:\n ld = self.maxDepth(root.left)\n if root.right is not None:\n rd = self.maxDepth(root.right)\n \n return max([rd, ld]) + 1","runtime":"18"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n \n if root is None:\n return 0\n \n res = 0\n q = deque([root])\n\n while q:\n res += 1\n for _ in range(len(q)):\n node = q.popleft()\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n \n return res\n ","runtime":"19"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))","runtime":"20"},{"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\ndef dep(root):\n if root is None:\n return 0\n return max(dep(root.left),dep(root.right))+1\nclass Solution:\n def maxDepth(self, root: Optional[TreeNode]) -> int:\n ans = dep(root)\n return ans\n\n","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root is None:\n return 0\n return 1 + max(self.maxDepth(root.left),self.maxDepth(root.right))","runtime":"22"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n if root:\n if not root.right and not root.left:\n return 1\n left_height = self.maxDepth(root.left)\n right_heingt = self.maxDepth(root.right)\n return max(left_height, right_heingt) + 1\n\n ","runtime":"23"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n \n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))","runtime":"24"},{"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\nfrom collections import deque\n\nclass Solution:\n def maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n depth = 0\n q = deque([root])\n while q:\n for _ in range(len(q)):\n node = q.popleft()\n\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n depth += 1\n return depth\n","runtime":"25"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n max_depth=self.depthSearch(root,0)\n return max_depth\n\n def depthSearch(self,node,depth):\n if node is None:\n return depth\n leftd = self.depthSearch(node.left,depth+1)\n rightd = self.depthSearch(node.right,depth+1)\n max_depth = max(leftd,rightd)\n return max_depth\n\n # def maxDepth(self, root: Optional[TreeNode]) -> int:\n # if not root:\n # return 0\n \n # return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1\n\n ","runtime":"25"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n return 1+max(self.maxDepth(root.left),self.maxDepth(root.right))","runtime":"26"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n \n def dfs(root):\n if root is None:\n return 0\n \n return max(dfs(root.left), dfs(root.right)) + 1\n\n return dfs(root)\n\n","runtime":"26"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n\n if not root:\n return 0\n \n if not root.left and not root.right:\n return 1\n\n curr_depth = 0\n\n if root.left:\n curr_depth = max(curr_depth, self.maxDepth(root.left) + 1)\n\n if root.right:\n curr_depth = max(curr_depth, self.maxDepth(root.right) + 1)\n\n return curr_depth","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root is None : return 0\n return max(self.maxDepth(root.left) + 1, self.maxDepth(root.right) + 1)","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root == None:\n return 0\n \n left_depth = self.maxDepth(root.left)\n right_depth = self.maxDepth(root.right)\n\n return max(left_depth, right_depth) + 1\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\nclass Solution:\n def maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\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\nclass Solution:\n def maxDepth(self, root: Optional[TreeNode]) -> int:\n\n def dfs(root):\n\n if not root:\n return 0\n\n left = dfs(root.left)\n right = dfs(root.right)\n\n return max(left,right) +1\n\n dfs(root)\n\n return dfs(root)\n ","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n def traverse(node, depth):\n if not node:\n return depth\n \n return max(traverse(node.right, depth + 1), traverse(node.left, depth + 1))\n \n return traverse(root, 0)","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n # the max depth can be once again calculated recursively with a dfs algorithm \n # by identifying the max dept of the left subtree and right subtree for each node below the root.\n\n def dfs(node):\n if not node:\n return 0\n \n left_depth = dfs(node.left)\n right_depth = dfs(node.right)\n\n return max(left_depth, right_depth) +1\n\n return 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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root :\n return 0\n if not root.left and not root.right:\n return 1\n depth = [1]\n def traversal(node, currDepth):\n if(not node):\n return \n depth[0] = max(depth[0],currDepth)\n traversal(node.left,currDepth+1)\n traversal(node.right,currDepth+1)\n traversal(root,depth[0])\n return depth[0]\n \n\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 maxDepth(self, root: Optional[TreeNode]) -> int:\n def dfs(t, depth = 0):\n if not t:\n return depth\n return max(dfs(t.left, depth + 1), dfs(t.right, depth + 1))\n \n return dfs(root)","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\n ","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n '''\n Using Recursion\n '''\n if not root:\n return 0\n\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\n\n '''\n Using BFS\n '''\n if not root:\n return 0\n\n level = 0\n q = deque([root])\n while q:\n for i in range(len(q)):\n node = q.popleft()\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n level += 1\n return level","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n \n left_depth = 1 + self.maxDepth(root.left)\n right_depth = 1 + self.maxDepth(root.right)\n\n return max(left_depth, right_depth)\n ","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root == None:\n return 0\n \n return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root: return 0\n leftDepth = self.maxDepth(root.left) + 1\n rightDepth = self.maxDepth(root.right) + 1\n depth = max(leftDepth, rightDepth)\n return depth","runtime":"34"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root: return 0\n return 1 + max(self.maxDepth(root.left),self.maxDepth(root.right))\n\n\n\n if not root: return 0\n res = 0\n stk = [(root, 1)]\n\n while stk:\n node, level = stk.pop()\n if node:\n res = max(res, level)\n stk.append((node.right, level+1))\n stk.append((node.left, level+1))\n\n return res","runtime":"34"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n l=self.maxDepth(root.left)\n r=self.maxDepth(root.right)\n return max(l,r)+1\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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root: return 0\n\n depth = 1\n max_depth = 1\n stack = [(root, depth)]\n\n\n while stack:\n \n node, depth = stack.pop()\n\n if(not node.left and not node.right):\n max_depth = max(max_depth, depth)\n \n if node.left:\n stack.append((node.left, depth+1))\n if node.right:\n stack.append((node.right, depth+1))\n\n \n return max_depth\n\n\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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root == None:\n return 0\n\n lsubtree = self.maxDepth(root.left)\n rsubtree = self.maxDepth(root.right)\n\n return (1 + max(lsubtree, rsubtree))\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\n\n# Time complexity: O(n) : As we are traversing each node of tree.\n# Space complexity: O(Height of tree) : Recursive stack space\n\nclass Solution:\n def maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n return max(self.maxDepth(root.left),self.maxDepth(root.right))+1\n\n\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 maxDepth(self, root: Optional[TreeNode]) -> int:\n \n if not root:\n return 0\n\n def dfs(node, count):\n \n if not node:\n return count -1\n\n return max( dfs(node.left, count+1) , dfs(node.right, count+1) )\n\n return dfs(root, 1)\n\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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root == None:\n return 0 \n\n max_left = self.maxDepth(root.left)\n max_right = self.maxDepth(root.right)\n\n return max(max_left, max_right) + 1 \n \n ","runtime":"37"},{"code":"from collections import deque\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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root is None:\n return 0\n stack = []\n stack.append(root)\n depth = {}\n depth[root] = 1\n while stack:\n node = stack.pop()\n if node.left:\n stack.append(node.left)\n depth[node.left] = depth[node] + 1\n if node.right:\n stack.append(node.right)\n depth[node.right] = depth[node] + 1\n return max(depth.values())","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root is None:\n return 0\n height = 0\n queu = [root]\n while queu:\n size = len(queu)\n for i in range(size):\n current = queu.pop(0)\n if current.left is not None:\n queu.append(current.left)\n if current.right is not None:\n queu.append(current.right)\n \n height += 1\n return height\n","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root is None:\n return 0\n if root.left is None and root.right is None:\n return 1\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root : return 0\n return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 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\nclass Solution:\n def maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n q = [root]\n ans = 0\n while q:\n ans += 1\n next_level = []\n for node in q:\n if node.left:\n next_level.append(node.left)\n if node.right:\n next_level.append(node.right)\n q = next_level\n return ans\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 maxDepth(self, root: Optional[TreeNode]) -> int:\n '''\n Using Recursion\n '''\n if not root:\n return 0\n\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root == None:\n return 0\n\n left_depth = self.maxDepth(root.left)\n right_depth = self.maxDepth(root.right)\n return 1 + max(left_depth, right_depth)","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root == None:\n return 0\n\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\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 maxDepth(self, root: Optional[TreeNode]) -> int:\n \n if not root:\n return 0\n\n stack = [(root, 1)]\n maxDepth = 1\n\n while stack:\n cur = stack.pop()\n\n if not cur[0].left and not cur[0].right:\n maxDepth = max(maxDepth, cur[1])\n\n if cur[0].left:\n stack.append((cur[0].left, cur[1] + 1))\n if cur[0].right:\n stack.append((cur[0].right, cur[1] + 1))\n \n return maxDepth\n","runtime":"43"},{"code":"class Solution:\n def maxDepth(self, root: Optional[TreeNode]) -> int:\n def dfs(root, depth):\n if not root: return depth\n return max(dfs(root.left, depth + 1), dfs(root.right, depth + 1))\n \n return dfs(root, 0)\n ","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n ## DFS WITH INNER FUNCTION\n # def dfs(node):\n # if not node:\n # return 0\n \n # left = dfs(node.left)\n # right = dfs(node.right)\n\n # return 1 + max(left, right)\n \n # return dfs(root)\n\n\n ## DFS WITH NO INNER FUNCTION\n if not root:\n return 0\n\n left = self.maxDepth(root.left)\n right = self.maxDepth(root.right)\n\n return 1 + max(left, right)","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n \n def dfs(root):\n if root is None:\n return 0\n leftHeight = dfs(root.left)\n rightHeight = dfs(root.right)\n return 1 + max(leftHeight, rightHeight)\n\n return dfs(root)\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 maxDepth(self, root: Optional[TreeNode]) -> int:\n \n if not root:\n return 0\n max_L = self.maxDepth(root.left)\n max_R = self.maxDepth(root.right)\n return max(max_L, max_R) +1\n\n\n\n\n\n\n\n\n\n\n\n # if not root:\n # return 0\n\n # max_left = self.maxDepth(root.left)\n # max_right = self.maxDepth(root.right)\n\n # return max(max_left, max_right) +1\n\n\n\n\n\n\n\n\n\n # if not root:\n # return 0\n\n # left_depth = self.maxDepth(root.left)\n # right_depth = self.maxDepth(root.right)\n\n # return max(left_depth, right_depth)+1\n\n\n\n\n\n\n\n\n\n # if not root:\n # return 0\n # else:\n # left_depth = self.maxDepth(root.left)\n # right_depth = self.maxDepth(root.right)\n # return max(left_depth, right_depth)+1","runtime":"45"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root is None:\n return 0 \n left_depth = self.maxDepth(root.left)\n right_depth = self.maxDepth(root.right)\n return 1 + max(left_depth,right_depth)\n ","runtime":"45"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root == None:\n return 0\n\n lsubtree = self.maxDepth(root.left)\n rsubtree = self.maxDepth(root.right)\n\n depth = 1 + max(lsubtree, rsubtree)\n return depth\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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root is None:\n return 0\n l_depth = self.maxDepth(root.left)\n r_depth = self.maxDepth(root.right)\n return max(l_depth, r_depth)+1","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))","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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if root == None:\n return 0\n\n l = self.maxDepth(root.left)\n r = self.maxDepth(root.right)\n\n return 1 + max(l,r)\n ","runtime":"47"}],"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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n return max(self.maxDepth(root.right)+1, self.maxDepth(root.left)+1)\\n\\n \",\n \"runtime\": \"16\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n ld = rd = 0\\n if root.left is not None:\\n ld = self.maxDepth(root.left)\\n if root.right is not None:\\n rd = self.maxDepth(root.right)\\n \\n return max([rd, ld]) + 1\",\n \"runtime\": \"18\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n \\n if root is None:\\n return 0\\n \\n res = 0\\n q = deque([root])\\n\\n while q:\\n res += 1\\n for _ in range(len(q)):\\n node = q.popleft()\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n \\n return res\\n \",\n \"runtime\": \"19\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n\\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\",\n \"runtime\": \"20\"\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\\ndef dep(root):\\n if root is None:\\n return 0\\n return max(dep(root.left),dep(root.right))+1\\nclass Solution:\\n def maxDepth(self, root: Optional[TreeNode]) -> int:\\n ans = dep(root)\\n return ans\\n\\n\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root is None:\\n return 0\\n return 1 + max(self.maxDepth(root.left),self.maxDepth(root.right))\",\n \"runtime\": \"22\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n if root:\\n if not root.right and not root.left:\\n return 1\\n left_height = self.maxDepth(root.left)\\n right_heingt = self.maxDepth(root.right)\\n return max(left_height, right_heingt) + 1\\n\\n \",\n \"runtime\": \"23\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n \\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\",\n \"runtime\": \"24\"\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\\nfrom collections import deque\\n\\nclass Solution:\\n def maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n depth = 0\\n q = deque([root])\\n while q:\\n for _ in range(len(q)):\\n node = q.popleft()\\n\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n depth += 1\\n return depth\\n\",\n \"runtime\": \"25\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n max_depth=self.depthSearch(root,0)\\n return max_depth\\n\\n def depthSearch(self,node,depth):\\n if node is None:\\n return depth\\n leftd = self.depthSearch(node.left,depth+1)\\n rightd = self.depthSearch(node.right,depth+1)\\n max_depth = max(leftd,rightd)\\n return max_depth\\n\\n # def maxDepth(self, root: Optional[TreeNode]) -> int:\\n # if not root:\\n # return 0\\n \\n # return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1\\n\\n \",\n \"runtime\": \"25\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n return 1+max(self.maxDepth(root.left),self.maxDepth(root.right))\",\n \"runtime\": \"26\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n \\n def dfs(root):\\n if root is None:\\n return 0\\n \\n return max(dfs(root.left), dfs(root.right)) + 1\\n\\n return dfs(root)\\n\\n\",\n \"runtime\": \"26\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n\\n if not root:\\n return 0\\n \\n if not root.left and not root.right:\\n return 1\\n\\n curr_depth = 0\\n\\n if root.left:\\n curr_depth = max(curr_depth, self.maxDepth(root.left) + 1)\\n\\n if root.right:\\n curr_depth = max(curr_depth, self.maxDepth(root.right) + 1)\\n\\n return curr_depth\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root is None : return 0\\n return max(self.maxDepth(root.left) + 1, self.maxDepth(root.right) + 1)\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root == None:\\n return 0\\n \\n left_depth = self.maxDepth(root.left)\\n right_depth = self.maxDepth(root.right)\\n\\n return max(left_depth, right_depth) + 1\\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\\nclass Solution:\\n def maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\\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\\nclass Solution:\\n def maxDepth(self, root: Optional[TreeNode]) -> int:\\n\\n def dfs(root):\\n\\n if not root:\\n return 0\\n\\n left = dfs(root.left)\\n right = dfs(root.right)\\n\\n return max(left,right) +1\\n\\n dfs(root)\\n\\n return dfs(root)\\n \",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n def traverse(node, depth):\\n if not node:\\n return depth\\n \\n return max(traverse(node.right, depth + 1), traverse(node.left, depth + 1))\\n \\n return traverse(root, 0)\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n # the max depth can be once again calculated recursively with a dfs algorithm \\n # by identifying the max dept of the left subtree and right subtree for each node below the root.\\n\\n def dfs(node):\\n if not node:\\n return 0\\n \\n left_depth = dfs(node.left)\\n right_depth = dfs(node.right)\\n\\n return max(left_depth, right_depth) +1\\n\\n return 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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root :\\n return 0\\n if not root.left and not root.right:\\n return 1\\n depth = [1]\\n def traversal(node, currDepth):\\n if(not node):\\n return \\n depth[0] = max(depth[0],currDepth)\\n traversal(node.left,currDepth+1)\\n traversal(node.right,currDepth+1)\\n traversal(root,depth[0])\\n return depth[0]\\n \\n\\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n def dfs(t, depth = 0):\\n if not t:\\n return depth\\n return max(dfs(t.left, depth + 1), dfs(t.right, depth + 1))\\n \\n return dfs(root)\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\\n \",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n '''\\n Using Recursion\\n '''\\n if not root:\\n return 0\\n\\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\\n\\n '''\\n Using BFS\\n '''\\n if not root:\\n return 0\\n\\n level = 0\\n q = deque([root])\\n while q:\\n for i in range(len(q)):\\n node = q.popleft()\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n level += 1\\n return level\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n \\n left_depth = 1 + self.maxDepth(root.left)\\n right_depth = 1 + self.maxDepth(root.right)\\n\\n return max(left_depth, right_depth)\\n \",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root == None:\\n return 0\\n \\n return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root: return 0\\n leftDepth = self.maxDepth(root.left) + 1\\n rightDepth = self.maxDepth(root.right) + 1\\n depth = max(leftDepth, rightDepth)\\n return depth\",\n \"runtime\": \"34\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root: return 0\\n return 1 + max(self.maxDepth(root.left),self.maxDepth(root.right))\\n\\n\\n\\n if not root: return 0\\n res = 0\\n stk = [(root, 1)]\\n\\n while stk:\\n node, level = stk.pop()\\n if node:\\n res = max(res, level)\\n stk.append((node.right, level+1))\\n stk.append((node.left, level+1))\\n\\n return res\",\n \"runtime\": \"34\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n l=self.maxDepth(root.left)\\n r=self.maxDepth(root.right)\\n return max(l,r)+1\\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root: return 0\\n\\n depth = 1\\n max_depth = 1\\n stack = [(root, depth)]\\n\\n\\n while stack:\\n \\n node, depth = stack.pop()\\n\\n if(not node.left and not node.right):\\n max_depth = max(max_depth, depth)\\n \\n if node.left:\\n stack.append((node.left, depth+1))\\n if node.right:\\n stack.append((node.right, depth+1))\\n\\n \\n return max_depth\\n\\n\\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root == None:\\n return 0\\n\\n lsubtree = self.maxDepth(root.left)\\n rsubtree = self.maxDepth(root.right)\\n\\n return (1 + max(lsubtree, rsubtree))\\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\\n\\n# Time complexity: O(n) : As we are traversing each node of tree.\\n# Space complexity: O(Height of tree) : Recursive stack space\\n\\nclass Solution:\\n def maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n return max(self.maxDepth(root.left),self.maxDepth(root.right))+1\\n\\n\\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n \\n if not root:\\n return 0\\n\\n def dfs(node, count):\\n \\n if not node:\\n return count -1\\n\\n return max( dfs(node.left, count+1) , dfs(node.right, count+1) )\\n\\n return dfs(root, 1)\\n\\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root == None:\\n return 0 \\n\\n max_left = self.maxDepth(root.left)\\n max_right = self.maxDepth(root.right)\\n\\n return max(max_left, max_right) + 1 \\n \\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"from collections import deque\\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root is None:\\n return 0\\n stack = []\\n stack.append(root)\\n depth = {}\\n depth[root] = 1\\n while stack:\\n node = stack.pop()\\n if node.left:\\n stack.append(node.left)\\n depth[node.left] = depth[node] + 1\\n if node.right:\\n stack.append(node.right)\\n depth[node.right] = depth[node] + 1\\n return max(depth.values())\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root is None:\\n return 0\\n height = 0\\n queu = [root]\\n while queu:\\n size = len(queu)\\n for i in range(size):\\n current = queu.pop(0)\\n if current.left is not None:\\n queu.append(current.left)\\n if current.right is not None:\\n queu.append(current.right)\\n \\n height += 1\\n return height\\n\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root is None:\\n return 0\\n if root.left is None and root.right is None:\\n return 1\\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root : return 0\\n return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 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\\nclass Solution:\\n def maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n q = [root]\\n ans = 0\\n while q:\\n ans += 1\\n next_level = []\\n for node in q:\\n if node.left:\\n next_level.append(node.left)\\n if node.right:\\n next_level.append(node.right)\\n q = next_level\\n return ans\\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n '''\\n Using Recursion\\n '''\\n if not root:\\n return 0\\n\\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root == None:\\n return 0\\n\\n left_depth = self.maxDepth(root.left)\\n right_depth = self.maxDepth(root.right)\\n return 1 + max(left_depth, right_depth)\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root == None:\\n return 0\\n\\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n \\n if not root:\\n return 0\\n\\n stack = [(root, 1)]\\n maxDepth = 1\\n\\n while stack:\\n cur = stack.pop()\\n\\n if not cur[0].left and not cur[0].right:\\n maxDepth = max(maxDepth, cur[1])\\n\\n if cur[0].left:\\n stack.append((cur[0].left, cur[1] + 1))\\n if cur[0].right:\\n stack.append((cur[0].right, cur[1] + 1))\\n \\n return maxDepth\\n\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def maxDepth(self, root: Optional[TreeNode]) -> int:\\n def dfs(root, depth):\\n if not root: return depth\\n return max(dfs(root.left, depth + 1), dfs(root.right, depth + 1))\\n \\n return dfs(root, 0)\\n \",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n ## DFS WITH INNER FUNCTION\\n # def dfs(node):\\n # if not node:\\n # return 0\\n \\n # left = dfs(node.left)\\n # right = dfs(node.right)\\n\\n # return 1 + max(left, right)\\n \\n # return dfs(root)\\n\\n\\n ## DFS WITH NO INNER FUNCTION\\n if not root:\\n return 0\\n\\n left = self.maxDepth(root.left)\\n right = self.maxDepth(root.right)\\n\\n return 1 + max(left, right)\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n \\n def dfs(root):\\n if root is None:\\n return 0\\n leftHeight = dfs(root.left)\\n rightHeight = dfs(root.right)\\n return 1 + max(leftHeight, rightHeight)\\n\\n return dfs(root)\\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n \\n if not root:\\n return 0\\n max_L = self.maxDepth(root.left)\\n max_R = self.maxDepth(root.right)\\n return max(max_L, max_R) +1\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # if not root:\\n # return 0\\n\\n # max_left = self.maxDepth(root.left)\\n # max_right = self.maxDepth(root.right)\\n\\n # return max(max_left, max_right) +1\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # if not root:\\n # return 0\\n\\n # left_depth = self.maxDepth(root.left)\\n # right_depth = self.maxDepth(root.right)\\n\\n # return max(left_depth, right_depth)+1\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # if not root:\\n # return 0\\n # else:\\n # left_depth = self.maxDepth(root.left)\\n # right_depth = self.maxDepth(root.right)\\n # return max(left_depth, right_depth)+1\",\n \"runtime\": \"45\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root is None:\\n return 0 \\n left_depth = self.maxDepth(root.left)\\n right_depth = self.maxDepth(root.right)\\n return 1 + max(left_depth,right_depth)\\n \",\n \"runtime\": \"45\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root == None:\\n return 0\\n\\n lsubtree = self.maxDepth(root.left)\\n rsubtree = self.maxDepth(root.right)\\n\\n depth = 1 + max(lsubtree, rsubtree)\\n return depth\\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root is None:\\n return 0\\n l_depth = self.maxDepth(root.left)\\n r_depth = self.maxDepth(root.right)\\n return max(l_depth, r_depth)+1\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n\\n return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))\",\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if root == None:\\n return 0\\n\\n l = self.maxDepth(root.left)\\n r = self.maxDepth(root.right)\\n\\n return 1 + max(l,r)\\n \",\n \"runtime\": \"47\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":53,"string":"53"},"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n return self.solver(root)\n \n\n\n def solver(self, root: Optional[TreeNode]) -> int:\n if root == None:\n return 0\n \n max_depth_left = self.solver(root.left)\n max_depth_right = self.solver(root.right)\n\n return max(max_depth_left, max_depth_right) + 1","memory":"17000"},{"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# class Solution:\n# def maxDepth(self, root: Optional[TreeNode]) -> int:\n# if not root:\n# return 0\n \n# left = self.maxDepth(root.left)\n# right = self.maxDepth(root.right)\n# return 1+ max(left,right)\n\n\n# class Solution:\n# def maxDepth(self, root: Optional[TreeNode]) -> int:\n# if not root:\n# return 0\n \n# level = 0\n# q = deque([root])\n\n# while q:\n# for i in range(len(q)):\n# node = q.popleft()\n# if node.left:\n# q.append(node.left)\n \n# if node.right:\n# q.append(node.right)\n \n# level+=1\n\n# return level\n\nclass Solution:\n def maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n\n stack = [[root,1]]\n res = 1\n\n while stack:\n node, depth = stack.pop()\n\n if node:\n res = max(res, depth)\n stack.append([node.left,depth+1])\n stack.append([node.right,depth+1])\n\n return res\n","memory":"17100"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n if not root: return 0\n frontier = [(root, 1)]\n max_h = 0\n\n while frontier:\n curr, h = frontier.pop(0)\n\n max_h = max(h, max_h)\n\n if curr.left: frontier.append((curr.left, h + 1))\n if curr.right: frontier.append((curr.right, h + 1))\n\n return max_h\n\n \n","memory":"17200"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n\n if not root:\n return 0\n\n # BFS\n # queue = deque()\n\n # queue.append(root)\n\n # depth = 0\n\n # while queue:\n # size = len(queue)\n # while size > 0:\n # curr = queue.popleft()\n # if curr.left:\n # queue.append(curr.left)\n # if curr.right:\n # queue.append(curr.right)\n # size -= 1\n # depth += 1\n\n # return depth\n\n\n # Recursive DFS\n # left_depth = self.maxDepth(root.left)\n # right_depth = self.maxDepth(root.right)\n\n # return 1 + max(left_depth, right_depth)\n\n # DFS - stack\n\n stack = [(root, 1)]\n maxDepth = 0\n\n while stack:\n curr, depth = stack.pop()\n\n if not curr:\n continue\n\n maxDepth = max(maxDepth, depth)\n stack.append((curr.right, depth+1))\n stack.append((curr.left, depth+1))\n \n return maxDepth","memory":"17300"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n #DFS solution - Depth First Solution\n stack = [[root,1]]\n res = 0\n\n while stack:\n node,depth = stack.pop()\n if node:\n res = max(res,depth)\n stack.append([node.left, depth + 1])\n stack.append([node.right, depth + 1])\n return res\n\n # #BFS solution - Breath first - check each level. use queues\n # depth = 0\n # if root is None:\n # return depth\n # q = deque([root])\n # while q:\n # for i in range(len(q)):\n # node = q.popleft()\n # if node.left:\n # q.append(node.left)\n # if node.right:\n # q.append(node.right)\n # depth += 1\n \n # return depth\n # Recursive solution\n # depth = 0\n # if root is None:\n # return depth\n # depth = 1 + max(self.maxDepth(root.left),self.maxDepth(root.right))\n # return depth\n # # check_node = check_node.\n # # print(Check_node.val)","memory":"17300"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n stack = []\n maxHeight = 0\n\n if root:\n stack.append([root, 1])\n\n while len(stack) > 0:\n curr, height = stack.pop(0)\n maxHeight = max(maxHeight, height)\n if curr.left:\n stack.insert(0, [curr.left, height + 1])\n \n if curr.right:\n stack.insert(0, [curr.right, height + 1])\n\n return maxHeight","memory":"17400"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n # if not root:\n # return 0\n # left_dep = self.maxDepth(root.left)\n # right_dep = self.maxDepth(root.right)\n # return max(left_dep, right_dep) + 1\n if not root:\n return 0\n stack = []\n stack.append((root,1))\n max_depth = 0\n while stack:\n node, layer = stack.pop()\n max_depth = max(max_depth, layer)\n if node.right:\n stack.append((node.right, layer+1))\n if node.left:\n stack.append((node.left, layer+1))\n return max_depth","memory":"17400"}],"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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n return self.solver(root)\\n \\n\\n\\n def solver(self, root: Optional[TreeNode]) -> int:\\n if root == None:\\n return 0\\n \\n max_depth_left = self.solver(root.left)\\n max_depth_right = self.solver(root.right)\\n\\n return max(max_depth_left, max_depth_right) + 1\",\n \"memory\": \"17000\"\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# class Solution:\\n# def maxDepth(self, root: Optional[TreeNode]) -> int:\\n# if not root:\\n# return 0\\n \\n# left = self.maxDepth(root.left)\\n# right = self.maxDepth(root.right)\\n# return 1+ max(left,right)\\n\\n\\n# class Solution:\\n# def maxDepth(self, root: Optional[TreeNode]) -> int:\\n# if not root:\\n# return 0\\n \\n# level = 0\\n# q = deque([root])\\n\\n# while q:\\n# for i in range(len(q)):\\n# node = q.popleft()\\n# if node.left:\\n# q.append(node.left)\\n \\n# if node.right:\\n# q.append(node.right)\\n \\n# level+=1\\n\\n# return level\\n\\nclass Solution:\\n def maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n\\n stack = [[root,1]]\\n res = 1\\n\\n while stack:\\n node, depth = stack.pop()\\n\\n if node:\\n res = max(res, depth)\\n stack.append([node.left,depth+1])\\n stack.append([node.right,depth+1])\\n\\n return res\\n\",\n \"memory\": \"17100\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n if not root: return 0\\n frontier = [(root, 1)]\\n max_h = 0\\n\\n while frontier:\\n curr, h = frontier.pop(0)\\n\\n max_h = max(h, max_h)\\n\\n if curr.left: frontier.append((curr.left, h + 1))\\n if curr.right: frontier.append((curr.right, h + 1))\\n\\n return max_h\\n\\n \\n\",\n \"memory\": \"17200\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n\\n if not root:\\n return 0\\n\\n # BFS\\n # queue = deque()\\n\\n # queue.append(root)\\n\\n # depth = 0\\n\\n # while queue:\\n # size = len(queue)\\n # while size > 0:\\n # curr = queue.popleft()\\n # if curr.left:\\n # queue.append(curr.left)\\n # if curr.right:\\n # queue.append(curr.right)\\n # size -= 1\\n # depth += 1\\n\\n # return depth\\n\\n\\n # Recursive DFS\\n # left_depth = self.maxDepth(root.left)\\n # right_depth = self.maxDepth(root.right)\\n\\n # return 1 + max(left_depth, right_depth)\\n\\n # DFS - stack\\n\\n stack = [(root, 1)]\\n maxDepth = 0\\n\\n while stack:\\n curr, depth = stack.pop()\\n\\n if not curr:\\n continue\\n\\n maxDepth = max(maxDepth, depth)\\n stack.append((curr.right, depth+1))\\n stack.append((curr.left, depth+1))\\n \\n return maxDepth\",\n \"memory\": \"17300\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n #DFS solution - Depth First Solution\\n stack = [[root,1]]\\n res = 0\\n\\n while stack:\\n node,depth = stack.pop()\\n if node:\\n res = max(res,depth)\\n stack.append([node.left, depth + 1])\\n stack.append([node.right, depth + 1])\\n return res\\n\\n # #BFS solution - Breath first - check each level. use queues\\n # depth = 0\\n # if root is None:\\n # return depth\\n # q = deque([root])\\n # while q:\\n # for i in range(len(q)):\\n # node = q.popleft()\\n # if node.left:\\n # q.append(node.left)\\n # if node.right:\\n # q.append(node.right)\\n # depth += 1\\n \\n # return depth\\n # Recursive solution\\n # depth = 0\\n # if root is None:\\n # return depth\\n # depth = 1 + max(self.maxDepth(root.left),self.maxDepth(root.right))\\n # return depth\\n # # check_node = check_node.\\n # # print(Check_node.val)\",\n \"memory\": \"17300\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n stack = []\\n maxHeight = 0\\n\\n if root:\\n stack.append([root, 1])\\n\\n while len(stack) > 0:\\n curr, height = stack.pop(0)\\n maxHeight = max(maxHeight, height)\\n if curr.left:\\n stack.insert(0, [curr.left, height + 1])\\n \\n if curr.right:\\n stack.insert(0, [curr.right, height + 1])\\n\\n return maxHeight\",\n \"memory\": \"17400\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n # if not root:\\n # return 0\\n # left_dep = self.maxDepth(root.left)\\n # right_dep = self.maxDepth(root.right)\\n # return max(left_dep, right_dep) + 1\\n if not root:\\n return 0\\n stack = []\\n stack.append((root,1))\\n max_depth = 0\\n while stack:\\n node, layer = stack.pop()\\n max_depth = max(max_depth, layer)\\n if node.right:\\n stack.append((node.right, layer+1))\\n if node.left:\\n stack.append((node.left, layer+1))\\n return max_depth\",\n \"memory\": \"17400\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":7,"string":"7"}}},{"rowIdx":158,"cells":{"question_id":{"kind":"number","value":105,"string":"105"},"name":{"kind":"string","value":"construct-binary-tree-from-preorder-and-inorder-traversal"},"content":{"kind":"string","value":"<p>Given two integer arrays <code>preorder</code> and <code>inorder</code> where <code>preorder</code> is the preorder traversal of a binary tree and <code>inorder</code> is the inorder traversal of the same tree, construct and return <em>the binary tree</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/02/19/tree.jpg\" style=\"width: 277px; height: 302px;\" />\n<pre>\n<strong>Input:</strong> preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]\n<strong>Output:</strong> [3,9,20,null,null,15,7]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> preorder = [-1], inorder = [-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 <= preorder.length <= 3000</code></li>\n\t<li><code>inorder.length == preorder.length</code></li>\n\t<li><code>-3000 <= preorder[i], inorder[i] <= 3000</code></li>\n\t<li><code>preorder</code> and <code>inorder</code> consist of <strong>unique</strong> values.</li>\n\t<li>Each value of <code>inorder</code> also appears in <code>preorder</code>.</li>\n\t<li><code>preorder</code> is <strong>guaranteed</strong> to be the preorder traversal of the tree.</li>\n\t<li><code>inorder</code> is <strong>guaranteed</strong> to be the inorder traversal of the tree.</li>\n</ul>\n"},"acRate":{"kind":"number","value":64.97799339656703,"string":"64.977993"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","hash-table","divide-and-conquer","tree","binary-tree"],"string":"[\n \"array\",\n \"hash-table\",\n \"divide-and-conquer\",\n \"tree\",\n \"binary-tree\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"27\", 0.0112], [\"29\", 0.0336], [\"32\", 0.10070000000000001], [\"34\", 0.151], [\"37\", 0.5255], [\"39\", 0.5982000000000001], [\"42\", 1.9175], [\"44\", 2.3984], [\"46\", 3.6171], [\"49\", 3.5054], [\"51\", 4.7632], [\"54\", 2.2754000000000003], [\"56\", 2.5046], [\"59\", 0.738], [\"61\", 0.3075], [\"64\", 0.1621], [\"66\", 0.0336], [\"69\", 0.1062], [\"71\", 0.0838], [\"74\", 0.19569999999999999], [\"76\", 0.2572], [\"78\", 0.42500000000000004], [\"81\", 0.3634], [\"83\", 0.41370000000000007], [\"86\", 0.2627], [\"88\", 0.3634], [\"91\", 0.2963], [\"93\", 0.43610000000000004], [\"96\", 0.6316999999999999], [\"98\", 0.6317999999999999], [\"101\", 1.1181], [\"103\", 1.0453999999999999], [\"106\", 1.5486], [\"108\", 1.2410999999999999], [\"110\", 1.8896], [\"113\", 1.5486], [\"115\", 2.1301], [\"118\", 1.9679], [\"120\", 3.4605999999999995], [\"123\", 2.4878], [\"125\", 3.1364], [\"128\", 5.3950000000000005], [\"130\", 3.9302], [\"133\", 5.9205000000000005], [\"135\", 4.0365], [\"138\", 5.4677], [\"140\", 3.0412999999999997], [\"142\", 3.455], [\"145\", 1.9567], [\"147\", 2.4374000000000002], [\"150\", 1.1125], [\"152\", 1.0007000000000001], [\"155\", 0.5087999999999999], [\"157\", 0.5087], [\"160\", 0.43600000000000005], [\"162\", 0.2237], [\"165\", 0.2963], [\"167\", 0.15660000000000002], [\"170\", 0.1957], [\"172\", 0.1678], [\"174\", 0.246], [\"177\", 0.16770000000000002], [\"179\", 0.2963], [\"182\", 0.13419999999999999], [\"184\", 0.29069999999999996], [\"187\", 0.1733], [\"189\", 0.20679999999999998], [\"192\", 0.40809999999999996], [\"194\", 0.218], [\"197\", 0.34109999999999996], [\"199\", 0.21250000000000002], [\"202\", 0.3913], [\"204\", 0.246], [\"206\", 0.4249], [\"209\", 0.2963], [\"211\", 0.2851], [\"214\", 0.1901], [\"216\", 0.20129999999999998], [\"219\", 0.1118], [\"221\", 0.1845]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"17546\", 5.747199999999999], [\"18440\", 22.737199999999998], [\"19334\", 0.10639999999999997], [\"20228\", 0.0392], [\"21121\", 0.0336], [\"22015\", 0.0056], [\"22909\", 0.0168], [\"23803\", 0.0056], [\"24696\", 0.0056], [\"25590\", 0.0056], [\"26484\", 0.0056], [\"27378\", 0.0056], [\"28271\", 0.0112], [\"29165\", 0.0503], [\"30059\", 0.1565], [\"30953\", 0.4193], [\"31846\", 2.4878], [\"32740\", 4.2433], [\"33634\", 2.0462], [\"34528\", 0.7995], [\"35421\", 0.464], [\"36315\", 0.1733], [\"37209\", 0.1509], [\"38103\", 0.0895], [\"38996\", 0.0335], [\"39890\", 0.0503], [\"40784\", 0.0056], [\"41678\", 0.0056], [\"42571\", 0.0056], [\"43465\", 0.0056], [\"44359\", 0.0056], [\"45253\", 0.0056], [\"46146\", 0.0056], [\"47040\", 0.0056], [\"47934\", 0.0168], [\"48828\", 0.0391], [\"49721\", 0.0224], [\"50615\", 0.0335], [\"51509\", 0.0224], [\"52403\", 0.0056], [\"53296\", 0.0112], [\"54190\", 0.0168], [\"55084\", 0.0112], [\"55978\", 0.028], [\"56871\", 0.0335], [\"57765\", 0.0503], [\"58659\", 0.0727], [\"59553\", 0.4417], [\"60446\", 1.3138], [\"61340\", 1.9679], [\"62234\", 18.8237], [\"63128\", 23.4081], [\"64021\", 3.0022], [\"64915\", 1.4536], [\"65809\", 1.0063], [\"66703\", 2.3816]]}"},"rt_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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n n=len(inorder) #TC=O(2N); SC=O(N)\n inMap={}\n for i in range(n):\n inMap[inorder[i]]= i\n return self.build(preorder,0,n-1,inorder,0,n-1,inMap)\n \n def build(self,preorder,preStart,preEnd,inorder,inStart,inEnd,inMap):\n if preStart>preEnd or inStart>inEnd:\n return None\n root = TreeNode(preorder[preStart])\n rootPos = inMap[root.val]\n length = rootPos - inStart\n root.left = self.build(preorder, preStart+1,preStart + length,\n inorder,inStart,rootPos-1,inMap)\n root.right = self.build(preorder,preStart+length+1,preEnd,\n inorder,rootPos+1,inEnd,inMap)\n return root\n\n","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 '''\n FACTS\n 1. first value in preorder is always the root\n 2. in an inorder traversal, every value to the left of the root is in the subtree; every value to the right is in the right subtree\n\n ex. \n 3\n 9 20\n 15 7\n \n - preorder: [3, 9, 20, 15, 7], inorder: [9, 3, 15, 20, 7]\n root = 3\n --> subset preorder: [9, 20, 15, 7]\n --> left subtree according to inorder = [9]; right subtree = [15, 20, 7]\n \n 9 is only node of left subtree. Now deal with right subtree\n --> subset preorder: [20, 15, 7]\n \n right subtree root = 20\n --> find 20 in inorder: left tree = [15], right tree = [7] \n \n DONE\n\n Essentially, preorder tells us the roots of the subtrees, and inorder tells us how to partition our preorder subarrays to find more roots\n\n However, to do this, when we set the root, we need to find the index of the root in the inorder array\n - Can do so via the .index function in python, but that is O(n), and with the recursions, time complexity will be O(n^2)\n\n Instead, let's build a hash of the inorder array, so we can retrieve values from it in O(1) time\n\n O(n), O(n)\n '''\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]: \n #make hash for inorder array\n inorderHash = {inorder[i]: i for i in range(len(inorder))}\n\n return self.build(preorder, inorderHash, 0, len(inorder) - 1)\n \n #helper function to build\n def build(self, preorder, inorderHash, start, end):\n #start and end are the bounds for the recursion, if they ever cross, we have no more nodes left\n # ex. at 9, building root.left --> start = 0, end = 0 - 1 --> no more nodes\n if start > end: return\n \n #find the root value in the inorder array\n mid = inorderHash[preorder[0]]\n\n #remove the first node of postorder entirely, now that it's set as the root\n root = TreeNode(preorder.pop(0))\n\n #build left subtree: preorder spans from index 1 to mid (inclusive) \n #The index mid is equal to the number of nodes on the left subtree, so we can just use mid to slice preorder though it was derived from the inorder array\n root.left = self.build(preorder, inorderHash, start, mid - 1)\n root.right = self.build(preorder, inorderHash, mid + 1, end)\n\n return root\n\n#O(n), O(n)\n\n''' \n #O(n^2)\n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n\n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1 : mid + 1], inorder[:mid])\n root.right = self.buildTree(preorder[mid + 1 :], inorder[mid + 1 :])\n return root\n'''","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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n inOrderDict = { v:i for i,v in enumerate(inorder) }\n \n def helper(preStart, preEnd, inStart, inEnd) -> Optional[TreeNode]:\n if preStart > preEnd or inStart > inEnd:\n return None\n \n root = TreeNode(preorder[preStart])\n \n mid = inOrderDict[root.val]\n l = mid - inStart\n \n root.left = helper(preStart + 1, preStart + l, inStart, mid-1)\n root.right = helper(preStart + l + 1, preEnd, mid + 1, inEnd)\n return root\n\n return helper(0, len(preorder)-1, 0, len(inorder) - 1)\n ","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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n \n def dfs(start, end):\n nonlocal preIndx\n if start>end:\n return None\n \n rootVal = preorder[preIndx]\n rootIndx = dicti[rootVal]\n root = TreeNode(rootVal)\n\n preIndx+=1\n\n root.left = dfs(start, rootIndx-1)\n root.right = dfs(rootIndx+1, end)\n\n return root\n \n preIndx = 0\n\n dicti = {val:indx for indx, val in enumerate(inorder)}\n return dfs(0, len(inorder)-1)\n\n# time complexity: O(n)\n# space complexity: O(n)\n ","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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n dic = {}\n for i in range(len(inorder)):\n dic[inorder[i]] = i\n preorderIdx = [0]\n def buildTreePartition(preorder : List[int], left : int, right : int) -> Optional[TreeNode]:\n if left > right:\n return None\n rootVal = preorder[preorderIdx[0]]\n preorderIdx[0] += 1\n inorderIdx = dic[rootVal]\n root = TreeNode(rootVal)\n root.left = buildTreePartition(preorder, left, inorderIdx - 1)\n root.right = buildTreePartition(preorder, inorderIdx + 1, right)\n\n return root\n return buildTreePartition(preorder, 0, len(preorder) - 1)\n","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\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n\n # Create a map for quick index lookup in inorder traversal\n inorder_map = {val: idx for idx, val in enumerate(inorder)}\n\n def helper(pre_start, pre_end, in_start, in_end):\n if pre_start > pre_end:\n return None\n\n # The first element in preorder is the root\n root_val = preorder[pre_start]\n root = TreeNode(root_val)\n\n # Find the root in inorder\n inorder_index = inorder_map[root_val]\n\n # Calculate the size of the left subtree\n left_subtree_size = inorder_index - in_start\n\n # Recursively build left and right subtrees\n root.left = helper(pre_start + 1, pre_start + left_subtree_size, \n in_start, inorder_index - 1)\n root.right = helper(pre_start + left_subtree_size + 1, pre_end, \n inorder_index + 1, in_end)\n\n return root\n\n return helper(0, len(preorder) - 1, 0, len(inorder) - 1)","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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n inorder_map = {}\n for idx, num in enumerate(inorder):\n inorder_map[num] = idx\n\n def buildTreeHelper(pre_s, pre_e, preorder, in_s, in_e, inorder):\n if pre_s > pre_e or in_s > in_e: return\n\n root = TreeNode(preorder[pre_s])\n in_root = inorder_map[preorder[pre_s]]\n nums_left = in_root - in_s\n\n root.left = buildTreeHelper(pre_s + 1, pre_s + nums_left, preorder, in_s, in_root - 1, inorder)\n root.right = buildTreeHelper(pre_s + nums_left + 1, pre_e, preorder, in_root + 1, in_e, inorder)\n\n return root\n\n return buildTreeHelper(0, len(preorder) - 1, preorder, 0, len(inorder) - 1, inorder)","runtime":"34"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n stack = []\n inorder_index = 0\n\n dummy_node = TreeNode ()\n curr_node = dummy_node\n right = False\n\n for add_node in preorder:\n\n add_node = TreeNode(val = add_node)\n\n if right:\n curr_node.right = add_node\n right = False\n else:\n curr_node.left = add_node\n\n stack.append(add_node)\n\n curr_node = add_node\n\n while len(stack) > 0 and stack[-1].val == inorder[inorder_index]:\n curr_node = stack.pop()\n inorder_index += 1\n right = True\n\n\n\n return dummy_node.left\n","runtime":"34"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n inorderDict = {val: i for i, val in enumerate(inorder)}\n n = len(preorder)\n head = TreeNode()\n st = [(head,0,n-1)]\n idx = 0\n while st:\n node, l, r = st.pop()\n node.val = preorder[idx]\n inorderIdx = inorderDict[node.val]\n if inorderIdx + 1 <= r:\n node.right = TreeNode()\n st.append((node.right, inorderIdx + 1, r))\n if inorderIdx - 1 >= l:\n node.left = TreeNode()\n st.append((node.left, l , inorderIdx - 1))\n idx += 1\n\n return head","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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n index = 0\n inorder_map = {value: idx for idx, value in enumerate(inorder)}\n\n def helper(left, right):\n nonlocal index\n if left > right:\n return None\n\n curr = preorder[index]\n index += 1\n node = TreeNode(curr)\n\n if left == right:\n return node\n\n inorder_index = inorder_map[curr]\n node.left = helper(left, inorder_index - 1)\n node.right = helper(inorder_index + 1, right)\n\n return node\n\n return helper(0, len(inorder) - 1) ","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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return None\n\n preorder = deque(preorder)\n d = {}\n for i, v in enumerate(inorder):\n d[v] = i\n\n def recursive(preorder, d, start, end):\n # if start >= end: void left children, \n # if not preorder: tree finished and void right children \n if start >= end or not preorder:\n return None\n\n top = preorder.popleft()\n node = TreeNode(top)\n\n #leaf\n if start == end-1:\n return node\n\n node.left = recursive(preorder, d, start, d[top])\n node.right = recursive(preorder, d, d[top]+1, end)\n return node\n\n root = recursive(preorder, d, 0, len(inorder))\n return root","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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \n mapping = {}\n\n for i in range(len(inorder)):\n mapping[inorder[i]] = i\n \n preorder = collections.deque(preorder)\n\n def build(start, end):\n if start > end: return None\n\n root = TreeNode(preorder.popleft())\n mid = mapping[root.val]\n\n root.left = build(start, mid - 1)\n root.right = build(mid + 1, end)\n\n return root\n\n return build(0, len(preorder) - 1)\n ","runtime":"39"},{"code":"class Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n idx_mapping = {}\n curr = 0\n for i,val in enumerate(inorder):\n idx_mapping[val] = i\n\n def buildLeftRight(left:int, right:int):\n nonlocal curr\n if curr >= len(preorder):\n return None\n idx = idx_mapping[preorder[curr]]\n if not(left <= idx <= right):\n return None\n curr+=1\n new_node = TreeNode(inorder[idx])\n new_node.left = buildLeftRight(left,idx-1)\n new_node.right = buildLeftRight(idx+1,right)\n return new_node\n return buildLeftRight(0,len(preorder)-1)","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 recursion(self, left, right):\n if left > right:\n return None\n \n rootval = self.preOrder[self.preOrderIndex]\n mid = self.inorderMap[rootval]\n root = TreeNode(val=rootval)\n self.preOrderIndex += 1\n\n root.left = self.recursion(left, mid-1)\n root.right = self.recursion(mid+1, right)\n return root\n \n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n self.preOrderIndex = 0\n self.preOrder = preorder\n self.inorderMap = {number:index for index, number in enumerate(inorder)}\n return self.recursion(0, len(preorder)-1)","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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n hashmap={val:key for key, val in enumerate(inorder)}\n root=self._buildtree(preorder,0,len(preorder)-1,inorder,0,len(inorder)-1,hashmap)\n return root\n def _buildtree(self,preorder,pre_start,pre_end,inorder,instart,inend,hashmap):\n if pre_start>pre_end or instart>inend:\n return None\n root=TreeNode(preorder[pre_start])\n inroot=hashmap[root.val]\n rem_left=inroot-instart\n root.left=self._buildtree(preorder,pre_start+1,pre_start+rem_left,inorder,instart,inroot-1,hashmap)\n root.right=self._buildtree(preorder,pre_start+rem_left+1,pre_end,inorder,inroot+1,inend,hashmap)\n return root\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n def build_tree(i_preorder, i_inorder, size):\n if size <= 0:\n return None\n \n root_value = preorder[i_preorder]\n inorder_root_index = inorder_dict[root_value]\n left_tree = build_tree(i_preorder + 1, \n i_inorder, \n inorder_root_index - i_inorder)\n right_tree = build_tree(i_preorder + 1 + inorder_root_index - i_inorder,\n inorder_root_index + 1, \n size - inorder_root_index + i_inorder - 1)\n return TreeNode(root_value, left_tree, right_tree)\n \n inorder_dict = { value: i for i, value in enumerate(inorder) }\n return build_tree(0, 0, len(preorder))","runtime":"44"},{"code":"class Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n VAL_TO_INORDER_IDX = {inorder[i]: i for i in range(len(inorder))}\n\n def buildTreePartition(preorder, inorder_start, inorder_end):\n if not preorder or inorder_start < 0 or inorder_end > len(inorder):\n return None\n\n root_val = preorder[0]\n root_inorder_idx = VAL_TO_INORDER_IDX[root_val]\n if root_inorder_idx > inorder_end or root_inorder_idx < inorder_start:\n return None\n \n root = TreeNode(preorder.pop(0))\n root.left = buildTreePartition(preorder, inorder_start, root_inorder_idx - 1)\n root.right = buildTreePartition(preorder, root_inorder_idx + 1, inorder_end)\n\n return root\n\n return buildTreePartition(preorder, 0, len(inorder) - 1)","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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n def build_tree(i_preorder, i_inorder, size):\n if size <= 0:\n return None\n \n root_value = preorder[i_preorder]\n inorder_root_index = inorder_dict[root_value]\n left_tree = build_tree(i_preorder + 1, \n i_inorder, \n inorder_root_index - i_inorder)\n right_tree = build_tree(i_preorder + 1 + inorder_root_index - i_inorder,\n inorder_root_index + 1, \n size - inorder_root_index + i_inorder - 1)\n return TreeNode(root_value, left_tree, right_tree)\n \n inorder_dict = { value: i for i, value in enumerate(inorder) }\n return build_tree(0, 0, len(preorder))","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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n # if not inorder:\n # return None\n def array_to_tree(left, right):\n nonlocal preorder_index\n if left > right:\n return None\n\n root_value = preorder[preorder_index]\n root = TreeNode(root_value)\n preorder_index += 1\n\n root.left = array_to_tree(left, inorder_map[root_value] - 1)\n root.right = array_to_tree(inorder_map[root_value] + 1, right)\n\n return root\n\n preorder_index = 0\n inorder_map = {val: idx for idx, val in enumerate(inorder)}\n return array_to_tree(0, len(inorder) - 1)\n\n \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 cur_idx = 0\n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n mp = {}\n for idx, val in enumerate(inorder):\n mp[val] = idx\n \n def build(preorder, inorder, l, r) -> TreeNode:\n if(r - l + 1 < 1):\n return None\n\n root = preorder[self.cur_idx]\n self.cur_idx += 1\n m = mp[root]\n \n left = build(preorder, inorder, l, m-1)\n right = build(preorder, inorder, m+1, r)\n\n return TreeNode(val=root, left=left, right=right)\n\n return build(preorder, inorder, 0, len(inorder) - 1)","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 dfs(self, preorder, inorder, idxMap, left, right):\n if left > right:\n return None\n \n value = preorder[self.preorderIdx]\n newNode = TreeNode(value)\n\n self.preorderIdx += 1\n\n inorderIdx = idxMap[value]\n\n newNode.left = self.dfs(preorder, inorder, idxMap, left, inorderIdx - 1)\n newNode.right = self.dfs(preorder, inorder, idxMap, inorderIdx + 1, right)\n\n return newNode\n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n self.preorderIdx = 0\n\n idxMap = {val: idx for idx, val in enumerate(inorder)}\n\n return self.dfs(preorder, inorder, idxMap, 0, len(preorder) - 1)","runtime":"51"},{"code":"class Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \n mapping = {}\n\n for i in range(len(inorder)):\n mapping[inorder[i]] = i\n \n preorder = collections.deque(preorder)\n\n def build(start, end):\n if start > end: return None\n\n root = TreeNode(preorder.popleft())\n mid = mapping[root.val]\n\n root.left = build(start, mid - 1)\n root.right = build(mid + 1, end)\n\n return root\n\n return build(0, len(preorder) - 1)","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 def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n hm= collections.defaultdict(int)\n\n for i,val in enumerate(inorder):\n hm[val]=i\n \n index=[0]\n \n def helper(low,high):\n\n if low==high:\n return\n\n root = TreeNode(preorder[index[0]])\n index[0]+=1\n\n index_for_inorder = hm[root.val]\n root.left = helper(low,index_for_inorder)\n root.right = helper(index_for_inorder+1,high)\n\n return root\n \n return helper(0,len(preorder))\n\n\n ","runtime":"54"},{"code":"class Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n idx_mapping = {}\n curr = 0\n for i,val in enumerate(inorder):\n idx_mapping[val] = i\n\n def buildLeftRight(idx: int, left:int, right:int):\n nonlocal curr\n if not(left <= idx <= right):\n return None\n curr+=1\n new_node = TreeNode(inorder[idx])\n if curr < len(preorder):\n new_node.left = buildLeftRight(idx_mapping[preorder[curr]],left,idx-1)\n if curr < len(preorder):\n new_node.right = buildLeftRight(idx_mapping[preorder[curr]],idx+1,right)\n return new_node\n return buildLeftRight(idx_mapping[preorder[curr]],0,len(preorder)-1)","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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n index = 0\n mapping = {val: ix for ix, val in enumerate(inorder)}\n def helper(l,r):\n nonlocal index\n if l > r:\n return None\n \n curr = preorder[index]\n index +=1\n node = TreeNode(curr)\n if l == r:\n return node\n \n ix = mapping[curr]\n node.left = helper(l,ix -1)\n node.right = helper(ix+1, r)\n\n return node\n return helper(0,len(preorder)-1)","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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n def build_tree(i_preorder, i_inorder, size):\n if size <= 0:\n return None\n \n root_value = preorder[i_preorder]\n inorder_root_index = inorder_dict[root_value]\n left_tree = build_tree(i_preorder + 1, \n i_inorder, \n inorder_root_index - i_inorder)\n right_tree = build_tree(i_preorder + 1 + inorder_root_index - i_inorder,\n inorder_root_index + 1, \n size - inorder_root_index + i_inorder - 1)\n return TreeNode(root_value, left_tree, right_tree)\n \n inorder_dict = { value: i for i, value in enumerate(inorder) }\n return build_tree(0, 0, len(preorder))","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 \"\"\"\n root_val = 3, root_index = 1, start = 0, end = 5\n\n\n \"\"\"\n def _build_internal(self, start, end, preorder_queue, inorder_dict):\n if start > end:\n return None\n \n root_val = preorder_queue.popleft()\n root = TreeNode(root_val)\n root_index = inorder_dict.get(root_val)\n root.left = self._build_internal(start, root_index-1, preorder_queue, inorder_dict)\n root.right = self._build_internal(root_index+1, end, preorder_queue, inorder_dict)\n return root\n\n \n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n preorder_queue = deque(preorder)\n inorder_dict = dict()\n for i, e in enumerate(inorder):\n inorder_dict[e] = i\n n = len(preorder)\n return self._build_internal(0, n-1, preorder_queue, inorder_dict)\n ","runtime":"59"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n \n # Create a mapping from value to index in inorder list\n inorder_index_map = {value: idx for idx, value in enumerate(inorder)}\n \n def build_tree(pre_start: int, pre_end: int, in_start: int, in_end: int) -> Optional[TreeNode]:\n if pre_start > pre_end or in_start > in_end:\n return None\n \n # The root is the first element in preorder\n root_value = preorder[pre_start]\n root = TreeNode(root_value)\n \n # Find the root index in inorder list\n root_index_in_inorder = inorder_index_map[root_value]\n \n # Number of nodes in the left subtree\n left_subtree_size = root_index_in_inorder - in_start\n \n # Recursively build left and right subtrees\n root.left = build_tree(pre_start + 1, pre_start + left_subtree_size, in_start, root_index_in_inorder - 1)\n root.right = build_tree(pre_start + left_subtree_size + 1, pre_end, root_index_in_inorder + 1, in_end)\n \n return root\n \n # Initialize the recursive function\n return build_tree(0, len(preorder) - 1, 0, len(inorder) - 1)","runtime":"59"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n in_order = {val : index for index, val in enumerate(inorder)}\n\n def build(pre_start, pre_end, in_start, in_end):\n\n if pre_start > pre_end:\n return None\n\n # find root\n root_val = preorder[pre_start]\n root = TreeNode(root_val)\n\n # find root index in inorder\n in_index = in_order[root_val]\n\n # left sub size\n left_sub_size = in_index - in_start\n\n root.left = build(pre_start + 1, pre_start + left_sub_size, in_start, in_index - 1)\n root.right = build(pre_start + left_sub_size + 1, pre_end, in_index + 1, in_end)\n\n return root\n\n return build(0, len(preorder) - 1, 0, len(inorder) - 1)\n","runtime":"61"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n VAL_TO_INORDER_IDX = {inorder[i]: i for i in range(len(inorder))}\n print(VAL_TO_INORDER_IDX)\n def buildTreePartition(preorder, inorder_start, inorder_end):\n if not preorder or inorder_start < 0 or inorder_end > len(inorder):\n return None\n root_val = preorder[0]\n root_inorder_idx = VAL_TO_INORDER_IDX[root_val]\n if root_inorder_idx > inorder_end or root_inorder_idx < inorder_start:\n return None\n root = TreeNode(preorder.pop(0))\n root.left = buildTreePartition(preorder, inorder_start, root_inorder_idx - 1)\n root.right = buildTreePartition(preorder, root_inorder_idx + 1, inorder_end)\n return root\n return buildTreePartition(preorder, 0, len(inorder) - 1)\n","runtime":"61"},{"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 helper(self, preorder: List[int], inorder: List[int], root: Optional[TreeNode], inorder_map, left:int, right:int):\n #remove root from preorder\n #find index of root val in inorder list - left of index is root's left subtree and right of index is root's right subtree\n #build root's left subtree\n #build root's right subtree\n print(\"left: \", left)\n print(\"right: \", right)\n print(\"root: \", root.val if root else None)\n if len(preorder) == 0:\n return None\n elif left > right:\n return None\n elif left == right:\n new_node = TreeNode(preorder[0])\n preorder.pop(0)\n return new_node\n else:\n new_node = TreeNode(preorder[0])\n preorder.pop(0)\n root_index = inorder_map[new_node.val]\n left_subtree_left_bound = left\n left_subtree_right_bound = root_index-1\n right_subtree_left_bound = root_index+1\n right_subtree_right_bound = right\n \n new_node.left = self.helper(preorder, inorder, new_node, inorder_map, left_subtree_left_bound, left_subtree_right_bound)\n new_node.right = self.helper(preorder, inorder, new_node, inorder_map, right_subtree_left_bound, right_subtree_right_bound)\n\n return new_node\n\n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n #build hashmap to easily get the index of a value in inorder list\n inorder_map = {}\n for i in range(len(inorder)):\n inorder_map[inorder[i]] = i\n\n # dummy = TreeNode(0)\n root = self.helper(preorder, inorder, None, inorder_map, 0, len(inorder))\n\n\n return root","runtime":"64"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \n adj = {val: i for i, val in enumerate(inorder)}\n\n def tree(ins, ine, ps, pe):\n print(ins, ine, ps, pe)\n if ins > ine or ps > pe:\n return None\n print(ps)\n root = TreeNode(preorder[ps])\n in_root = adj[root.val]\n\n pre_right_start = ps + (in_root - ins) + 1\n\n\n root.left = tree(ins, in_root - 1, ps + 1, pre_right_start - 1)\n root.right = tree(in_root + 1, ine, pre_right_start, pe)\n\n return root\n\n return tree(0, len(inorder)-1, 0, len(inorder)-1)","runtime":"64"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n N = len(preorder)\n\n # in preorder, the root comes first, then the left\n # so we know the root is preorder[0], we find it's index\n # in inorder, and then the left of preorder[0] is the left\n # subtree and the right of preorder[0] is the right subtree\n # the next root of the left side is preorder[1] and so on\n\n lookup = {e: i for i, e in enumerate(inorder)}\n\n def build(i: int, l: int, r: int) -> Optional[TreeNode]:\n\n values = inorder[l:r+1]\n\n if N <= i or not values:\n return None\n\n\n val = preorder[i]\n j = lookup[val]\n\n node = TreeNode(val)\n if l <= j <= r:\n\n # inorder[l:j+1]\n \n left_length = j - l + 1\n\n node.left = build(i+1, l, j-1)\n # i + 1 is the root of the left subtree\n node.right = build(i + left_length, j+1, r)\n return node\n \n return build(0, 0, N-1)","runtime":"66"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n def helper(pre_start, pre_end, in_start, in_end) -> Optional[TreeNode]:\n if pre_start > pre_end:\n return None\n \n root_val = preorder[pre_start]\n root_idx = inorder.index(root_val)\n\n left_size = root_idx - in_start\n root = TreeNode(root_val)\n root.left = helper(pre_start + 1, pre_start + left_size, in_start, root_idx -1)\n root.right = helper(pre_start + left_size + 1, pre_end, root_idx + 1, in_end)\n return root\n \n return helper(0, len(preorder) - 1, 0, len(preorder) - 1)\n \n \n\n\n ","runtime":"66"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n mapping = {value: index for index, value in enumerate(inorder)}\n preorder = deque(preorder)\n\n def build(start, end):\n if start>end: return None\n root = TreeNode(preorder.popleft())\n mid = mapping[root.val]\n\n root.left = build(start, mid - 1)\n root.right = build(mid +1, end)\n\n return root\n \n return build(0, len(preorder)-1)","runtime":"69"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n return self.dfs(preorder, inorder, 0, len(preorder), 0, len(inorder))\n\n def dfs(self, preorder: List[int], inorder: List[int], pre_start: int, pre_end: int, in_start: int, in_end: int) -> Optional[TreeNode]:\n # base case\n if in_start >= in_end:\n return None\n \n parent_val = preorder[pre_start]\n root = TreeNode(parent_val)\n in_index = inorder.index(parent_val)\n left_size = in_index - in_start\n root.left = self.dfs(preorder, inorder, pre_start + 1, pre_start + left_size, in_start, in_index)\n root.right = self.dfs(preorder, inorder, pre_start + left_size + 1, pre_end, in_index + 1, in_end)\n\n return root","runtime":"69"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n currIdx = 0\n\n def dfs(start, end):\n nonlocal currIdx\n\n if start > end or end < start or currIdx >= len(preorder):\n return None\n\n nodeIdx = inorder.index(preorder[currIdx])\n node = TreeNode(preorder[currIdx])\n currIdx += 1\n\n node.left = dfs(start, nodeIdx - 1)\n node.right = dfs(nodeIdx + 1, end)\n\n\n return node\n\n return dfs(0, len(inorder) - 1)","runtime":"71"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def helper(preorder,inorder, sip, eip, sii, eii):\n if sip > eip:\n return None\n curr = TreeNode(preorder[sip])\n idx = inorder.index(preorder[sip])\n curr.left = helper(preorder, inorder, sip+1, sip+idx-sii, sii, idx-1)\n curr.right = helper(preorder, inorder, sip+idx-sii+1, eip, idx+1, eii)\n return curr\n return helper(preorder,inorder,0, len(preorder) - 1, 0, len(preorder)-1)\n","runtime":"71"},{"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\ndef build_tree_from_preorder_inorder(preorder, inorder, pre_start, pre_end, in_start, in_end):\n if pre_start > pre_end or in_start > in_end:\n return None\n\n root_data = preorder[pre_start] # The root is the first element in preorder\n root = TreeNode(root_data)\n\n inorder_index = inorder.index(root_data, in_start, in_end + 1) # Find the root in inorder\n\n # Calculate the size of the left subtree\n left_subtree_size = inorder_index - in_start\n\n # Recursively build the left and right subtrees\n root.left = build_tree_from_preorder_inorder(preorder, inorder, pre_start + 1, pre_start + left_subtree_size, in_start, inorder_index - 1)\n root.right = build_tree_from_preorder_inorder(preorder, inorder, pre_start + left_subtree_size + 1, pre_end, inorder_index + 1, in_end)\n \n return root\n\nclass Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n return build_tree_from_preorder_inorder(preorder,inorder,0,len(preorder)-1,0,len(inorder)-1)","runtime":"74"},{"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 build(self, preorder, inorder, start, end):\n if self.preorder_index>=len(preorder) or start > end:\n return None\n rootVal = preorder[self.preorder_index]\n self.preorder_index += 1\n root = TreeNode(rootVal)\n ind = inorder.index(rootVal)\n root.left = self.build(preorder, inorder, start, ind - 1)\n root.right = self.build(preorder, inorder, ind + 1, end)\n return root\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder) != len(inorder):\n return []\n self.preorder_index = 0\n root=self.build(preorder,inorder,0,len(preorder)-1)\n return root\n ","runtime":"74"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def helper(preIndex: int, inStart:int, inEnd:int) -> Optional[TreeNode]:\n node = TreeNode(preorder[preIndex])\n\n # print(f\"value: {preorder[preIndex]} left: {inStart} right: {inEnd}\")\n inIndex = inorder.index(preorder[preIndex], inStart, inEnd)\n if inIndex - inStart == 0:\n node.left = None\n else:\n node.left = helper(preIndex+1, inStart, inIndex)\n \n if inEnd - (inIndex + 1) == 0:\n node.right = None\n else:\n node.right = helper((preIndex+1)+(inIndex-inStart), inIndex+1, inEnd)\n\n return node\n \n return helper(0, 0, len(preorder))\n \n'''\ntime: O(n)\nspace: O(1)\n'''","runtime":"76"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n ## Stack definition:\n ## (node, start, end, index, which)\n ## - node: the tree node to process\n ## - start: start of the range in 'inorder'\n ## - end: end of the range in 'inorder'\n ## - index: index of root value in 'inorder'\n ## - which: indicates which child node to process in the next traversal\n\n ## Initially, push the root node into the stack\n root = TreeNode(preorder[0])\n stack = [(root, 0, len(inorder), inorder.index(root.val), 'LEFT')]\n ## Current index in 'preorder', start from 1, \n curIndex = 1\n while stack:\n node, start, end, index, which = stack.pop()\n ## Processing the left node\n if which == 'LEFT':\n ## Push the node back to the stack again to process its right node in the next traversal\n stack.append((node, start, end, index, 'RIGHT'))\n if start < index:\n lindex = inorder[start:index].index(preorder[curIndex]) + start\n node.left = TreeNode(preorder[curIndex])\n curIndex += 1\n stack.append((node.left, start, index, lindex, 'LEFT'))\n ## Processing the right node\n if which == 'RIGHT':\n if index+1 < end:\n rindex = inorder[index+1:end].index(preorder[curIndex]) + index + 1\n node.right = TreeNode(preorder[curIndex])\n curIndex += 1\n stack.append((node.right, index+1, end, rindex, 'LEFT'))\n\n return root","runtime":"76"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder or (len(preorder) != len(inorder)):\n return None \n\n n = len(preorder)\n \n def build(pL, pR, iL, iR):\n if pL > pR or iL > iR:\n return None\n if pL == pR:\n return TreeNode(preorder[pL])\n r = TreeNode(preorder[pL])\n mid = inorder.index(preorder[pL]) \n # Number of nodes in the left subtree\n left_size = mid - iL\n \n # Recursively build the left and right subtrees\n r.left = build(pL + 1, pL + left_size, iL, mid - 1)\n r.right = build(pL + left_size + 1, pR, mid + 1, iR)\n return r\n \n return build(0, n - 1, 0, n - 1)","runtime":"78"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def helper(l1, r1, l2, r2):\n if l1 == r1:\n return TreeNode(preorder[l1])\n root = TreeNode(preorder[l1])\n m = inorder.index(preorder[l1])\n #m - l2 + l1 \n left_node = helper(l1 + 1, l1 + m - l2, l2, m - 1) if l2 <= m - 1 else None\n right_node = helper(l1 + m - l2 + 1, r1, m + 1, r2) if m + 1 <= r2 else None\n root.left = left_node\n root.right = right_node\n return root\n return helper(0, len(preorder) - 1, 0, len(preorder) - 1)\n","runtime":"78"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n self.preIndex = 0\n \n def helper(pre, ino, l, r):\n if l>r:\n return \n root = TreeNode(pre[self.preIndex])\n i = ino.index(pre[self.preIndex])\n self.preIndex+=1\n\n root.left = helper(pre, ino, l, i-1)\n root.right = helper(pre, ino, i+1, r)\n\n return root\n \n return helper(preorder, inorder, 0, len(preorder)-1)","runtime":"81"},{"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.pre_i = 0\n\n def build_tree(self,\n preorder: List[int],\n inorder: List[int],\n in_start: int,\n in_end: int) -> Optional[TreeNode]:\n if in_start > in_end:\n return None\n\n node = TreeNode(preorder[self.pre_i])\n self.pre_i += 1\n\n if in_start == in_end:\n return node\n\n in_i = inorder[in_start:in_end + 1].index(node.val)\n\n node.left = self.build_tree(preorder, inorder, in_start, in_start + in_i - 1)\n node.right = self.build_tree(preorder, inorder, in_start + in_i + 1, in_end)\n\n return node\n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n return self.build_tree(preorder, inorder, 0, len(inorder) - 1)\n","runtime":"81"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n root_index = 0\n def helper(l, r):\n if r <= l:\n return None\n nonlocal root_index\n node = TreeNode(preorder[root_index])\n partition = inorder.index(preorder[root_index])\n root_index += 1\n node.left = helper(l, partition)\n node.right = helper(partition+1, r)\n return node\n\n return helper(0, len(preorder))","runtime":"83"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def build(preleft, preright, inleft, inright):\n if preleft == preright:\n return None\n \n root = TreeNode(preorder[preleft])\n index = inorder.index(root.val)\n treesize = index - inleft\n root.left = build(preleft+1, preleft+1+treesize, inleft, index)\n root.right = build(preleft+1+treesize, preright, index+1, inright)\n\n return root\n\n return build(0, len(preorder), 0, len(inorder))","runtime":"83"},{"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\nfrom collections import deque\nfrom itertools import takewhile\n\nclass Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def _build_tree(preorder_, inorder_):\n if inorder_:\n val = preorder_.popleft()\n ii = inorder_.index(val)\n return TreeNode(\n val=val,\n left=_build_tree(\n preorder_=preorder_,\n inorder_=inorder_[:ii],\n ),\n right=_build_tree(\n preorder_=preorder_,\n inorder_=inorder_[ii+1:],\n ),\n )\n return _build_tree(deque(preorder), inorder)","runtime":"86"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n return self.helper(preorder, inorder, 0, len(preorder), 0, len(preorder))\n\n def helper(self, preorder, inorder, ps, pe, ins, ine):\n if ps >= pe or ins >= ine:\n return None\n root = preorder[ps]\n idx = inorder.index(root)\n \n left = self.helper(preorder, inorder, ps + 1, pe - (ine - idx - 1), ins, idx)\n right = self.helper(preorder, inorder, pe - (ine - idx - 1), pe, idx + 1, ine)\n return TreeNode(val=root, left=left, right=right)","runtime":"86"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \"\"\"\n preorder = [3,9,20,15,7], \n inorder = [9,3,15,20,7]\n \n root.val = TreeNode(preorder[0]) # 3\n \n mid_idx = inorder.index(preorder[0])\n \n root.left = buildTree(preorder, inorder[:mid_idx]) # [9, 20, 15, 7] , [9]\n root.left = buildTree(preorder, inorder[:mid_idx]) # [20, 15, 7] , []\n \n root.right = buildTree(preorder, inorder[:mid_idx]) # [20, 15, 7] , [15, 20 ,7]\n \"\"\"\n if not preorder or not inorder:\n return\n \n root = TreeNode(preorder.pop(0))\n \n middle_idx = inorder.index(root.val)\n root.left = self.buildTree(preorder, inorder[:middle_idx])\n root.right = self.buildTree(preorder, inorder[middle_idx+1:])\n \n return root\n ","runtime":"88"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n # \n def build(preorder, pa, pb, inorder, ia, ib):\n if pb - pa == 0:\n return\n print(pb, pa)\n val = preorder[pa]\n node = TreeNode(val)\n i = inorder.index(val)\n\n node.left = build(preorder, pa+1, (i-ia)+pa+1, inorder, ia, i)\n node.right = build(preorder, (i - ia) + pa + 1, pb, inorder, i+1, ib)\n\n return node\n\n return build(preorder, 0, len(preorder), inorder, 0, len(inorder))\n\n","runtime":"88"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \"\"\"\n CLR\n LCR\n preorder = [3,9,20,15,7]\n\n inorder = [9,3,15,20,7]\n \"\"\"\n if not inorder: \n return None\n val = preorder.pop(0)\n root = TreeNode(val)\n index = inorder.index(val)\n root.left = self.buildTree(preorder, inorder[:index])\n root.right = self.buildTree(preorder, inorder[index+1:])\n return root","runtime":"91"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def build(preorder, inorder):\n if inorder:\n index = inorder.index(preorder.popleft())\n node = TreeNode(inorder[index])\n\n node.left = build(preorder, inorder[:index])\n node.right = build(preorder, inorder[index+1:])\n return node\n\n preorder = deque(preorder)\n return build(preorder, inorder)","runtime":"91"},{"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\nfrom collections import deque\nclass Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n preorder = deque(preorder)\n\n def build(preorder, inorder):\n if inorder:\n idx = inorder.index(preorder.popleft())\n root = TreeNode(inorder[idx])\n root.left = build(preorder, inorder[:idx])\n root.right = build(preorder, inorder[idx+1:])\n return root\n \n return build(preorder, inorder)\n ","runtime":"93"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \n if not preorder or not inorder:\n return None\n\n root_val = preorder.pop(0)\n root = TreeNode(root_val)\n\n inorder_index = inorder.index(root_val)\n\n root.left = self.buildTree(preorder, inorder[:inorder_index])\n root.right = self.buildTree(preorder, inorder[inorder_index + 1:])\n\n return root","runtime":"93"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if preorder == [-1] and inorder == [-1]:\n return TreeNode(-1)\n \n preorder = deque(preorder)\n\n def build(preorder, inorder):\n if inorder:\n idx = inorder.index(preorder.popleft())\n root = TreeNode(inorder[idx])\n\n root.left = build(preorder, inorder[:idx])\n root.right = build(preorder, inorder[idx+1:])\n\n return root\n\n return build(preorder, inorder)","runtime":"96"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n root_val = preorder[0]\n root = TreeNode(root_val)\n mid = inorder.index(root_val)\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\n root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])\n return root \n \n \n ","runtime":"96"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def build(preorder, inorder):\n if not inorder:\n return None\n idx = inorder.index(preorder.pop(0))\n node = TreeNode(inorder[idx])\n node.left = build(preorder, inorder[:idx])\n node.right = build(preorder, inorder[idx + 1:])\n return node\n root = build(preorder, inorder)\n return root\n \n \n\n ","runtime":"98"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def helper(preorder,inorder):\n if inorder:\n idx = inorder.index(preorder.pop(0))\n root = TreeNode(inorder[idx])\n root.left = helper(preorder, inorder[:idx])\n root.right = helper(preorder, inorder[idx+1:])\n return root\n return helper(preorder, inorder)\n","runtime":"103"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if inorder:\n index = inorder.index(preorder.pop(0))\n root = TreeNode(inorder[index])\n root.left = self.buildTree(preorder, inorder[:index])\n root.right = self.buildTree(preorder, inorder[index+1:])\n return root","runtime":"103"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not(preorder or inorder): return\n node = TreeNode(preorder[0])\n m = inorder.index(node.val)\n node.left = self.buildTree(preorder[1:m + 1], inorder[:m])\n node.right = self.buildTree(preorder[m + 1:], inorder[m + 1:])\n return node\n","runtime":"106"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if inorder:\n root = TreeNode(preorder.pop(0))\n root_index = inorder.index(root.val)\n root.left = self.buildTree(preorder, inorder[:root_index])\n root.right = self.buildTree(preorder, inorder[root_index + 1:])\n return root\n","runtime":"106"},{"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 buildTreeHelper(self, preorder, inorder):\n if not inorder:\n return None\n\n node = preorder.pop(0)\n index = inorder.index(node)\n \n binaryTree = TreeNode(node)\n\n binaryTree.left = self.buildTreeHelper(preorder, inorder[:index])\n binaryTree.right = self.buildTreeHelper(preorder, inorder[index+1:])\n\n return binaryTree\n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n return self.buildTreeHelper(preorder, inorder)\n","runtime":"108"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n def recurse(prerder, inorder):\n if len(inorder) == 0:\n return None\n\n val = preorder.pop(0)\n node = TreeNode(val)\n i = inorder.index(val)\n node.left = recurse(preorder, inorder[0:i])\n node.right = recurse(preorder, inorder[i+1:])\n\n return node\n \n return recurse(preorder, inorder)\n\n\n ","runtime":"108"},{"code":"# 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 buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:\n # Base case: If there are no elements to construct the tree\n if not preorder or not inorder:\n return None\n\n # The first element of preorder is the root\n root_val = preorder[0]\n root = TreeNode(root_val)\n\n # Find the index of the root in inorder\n inorder_index = inorder.index(root_val)\n\n # Recursively construct the left subtree\n # Left subtree: preorder[1:1+inorder_index], inorder[:inorder_index]\n root.left = self.buildTree(preorder[1:1+inorder_index], inorder[:inorder_index])\n\n # Recursively construct the right subtree\n # Right subtree: preorder[1+inorder_index:], inorder[inorder_index+1:]\n root.right = self.buildTree(preorder[1+inorder_index:], inorder[inorder_index+1:])\n\n return root","runtime":"110"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n rootVal = preorder.pop(0)\n mid = inorder.index(rootVal)\n root = TreeNode(rootVal)\n root.left = self.buildTree(preorder, inorder[:mid])\n root.right = self.buildTree(preorder, inorder[mid+1:])\n return root","runtime":"110"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if(inorder):\n root = TreeNode(preorder[0])\n idx = inorder.index(preorder.pop(0))\n root.left = self.buildTree(preorder,inorder[:idx])\n root.right = self.buildTree(preorder,inorder[idx+1:])\n return root ","runtime":"113"},{"code":"class Solution: \n def driver(self, preorder, inorder, preorderLocationHashmap, inorderLocationHashmap, startOffset):\n if preorder == []:#tree empty\n return None\n root = TreeNode(preorder[0], None, None)\n rootInorderLocation = inorderLocationHashmap[preorder[0]] - startOffset\n root.left = self.driver(preorder[1:rootInorderLocation+1], inorder[:rootInorderLocation], preorderLocationHashmap, inorderLocationHashmap, startOffset)\n root.right = self.driver(preorder[rootInorderLocation+1:], inorder[rootInorderLocation+1:], preorderLocationHashmap, inorderLocationHashmap, startOffset+rootInorderLocation+1)\n return root\n\n def buildTree(self, preorder, inorder):\n preorderLocationHashmap = {}\n inorderLocationHashmap = {}\n for index, orderItems in enumerate(zip(preorder, inorder)):\n preorderItem, inorderItem = orderItems\n preorderLocationHashmap[preorderItem] = index\n inorderLocationHashmap[inorderItem] = index\n return self.driver(preorder, inorder, preorderLocationHashmap, inorderLocationHashmap, 0)","runtime":"113"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return None\n root = TreeNode(preorder[0])\n ri = inorder.index(preorder[0])\n act_nodes = deque([(root, 0, ri, len(inorder))])\n for v in preorder[1:]:\n new_node = TreeNode(v)\n par_node, par_left, par_ni, par_right = act_nodes.pop()\n if par_left != par_ni and v in inorder[par_left:par_ni]:\n par_node.left = new_node\n nni = inorder.index(v, par_left, par_ni)\n if par_ni + 1 != par_right:\n act_nodes.append((par_node, par_ni, par_ni, par_right))\n if nni != par_left or nni != par_ni - 1:\n act_nodes.append((new_node, par_left, nni, par_ni))\n elif v in inorder[par_ni+1:par_right]:\n par_node.right = new_node\n nni = inorder.index(v, par_ni+1, par_right)\n if nni != par_ni+1 or nni != par_right - 1:\n act_nodes.append((new_node, par_ni+1, nni, par_right))\n return root","runtime":"115"},{"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 buildTree(self, node, val):\n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n\n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid+1:])\n\n\n return root","runtime":"115"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n \n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n\n root.left = self.buildTree(preorder[1 : mid + 1], inorder[ : mid])\n root.right = self.buildTree(preorder[mid + 1 : ], inorder[mid + 1 : ])\n\n return root","runtime":"118"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder and not inorder: return None\n\n root = TreeNode(preorder[0])\n mid_index = inorder.index(root.val)\n root.left = self.buildTree(preorder[1:1+mid_index], inorder[:mid_index])\n root.right = self.buildTree(preorder[1+mid_index:], inorder[mid_index+1:])\n\n return root\n","runtime":"118"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n root = TreeNode(val=preorder[0])\n inorderIndex = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1:inorderIndex+1],inorder[:inorderIndex])\n root.right = self.buildTree(preorder[inorderIndex+1:],inorder[inorderIndex+1:])\n return root","runtime":"120"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n\n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1 : mid + 1], inorder[:mid])\n root.right = self.buildTree(preorder[mid + 1 :], inorder[mid + 1 :])\n return root\n","runtime":"120"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder) == 0:\n return None\n node = TreeNode(val=preorder[0])\n if len(preorder) == 1:\n return node\n #root_index also = left tree size\n root_index = inorder.index(preorder[0])\n #print(preorder[1:root_index+1],inorder[0:root_index])\n #print(preorder[root_index+1:],inorder[root_index+1:])\n node.left = self.buildTree(preorder[1:root_index+1],inorder[0:root_index])\n node.right = self.buildTree(preorder[1+root_index:],inorder[root_index+1:])\n return node \n","runtime":"123"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder and not inorder:\n return\n \n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid + 1:])\n\n return root","runtime":"123"},{"code":"class Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder) < 1:\n return None\n idx = inorder.index(preorder[0])\n root = TreeNode(preorder[0])\n root.left = self.buildTree(preorder[1 : idx + 1], inorder[:idx])\n root.right = self.buildTree(preorder[idx + 1 :], inorder[idx + 1 :])\n return root","runtime":"125"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n\n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid + 1:])\n return root","runtime":"125"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1 : mid + 1], inorder[:mid])\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid + 1:])\n\n return root","runtime":"128"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n \n \n def traverse(preorder,inorder):\n\n if not preorder or not inorder:\n return None\n \n root = preorder[0]\n node = TreeNode(root)\n\n #leaf node\n if len(inorder)==1:\n return node\n\n mid = inorder.index(root)\n\n if mid>0:\n node.left = traverse(preorder[1:mid+1],inorder[0:mid])\n \n if mid<len(inorder):\n node.right = traverse(preorder[mid+1:],inorder[mid+1:])\n return node\n \n return traverse(preorder,inorder)","runtime":"128"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1:mid + 1], inorder[:mid])\n root.right = self.buildTree(preorder[mid+1:], inorder[mid + 1:])\n return root\n ","runtime":"130"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \"\"\"\n preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]\n\n 3\n 9 20\n \"\"\"\n\n def build_tree(preorder, inorder):\n\n # todo end rec\n if len(preorder) == 0 or len(inorder) == 0:\n return None\n\n node = TreeNode(preorder[0])\n off = inorder.index(preorder[0])\n leftupper = off\n node.left = build_tree(preorder[1:], inorder[:leftupper])\n node.right = build_tree(preorder[1+off:], inorder[leftupper+1:])\n return node\n return build_tree(preorder, inorder)\n\n ","runtime":"130"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n\n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1:mid + 1], inorder[:mid])\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid + 1:])\n return root","runtime":"133"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n \n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\n root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])\n\n return root","runtime":"133"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\n root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])\n return root","runtime":"135"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder: return None\n\n left_size = inorder.index(preorder[0])\n\n left = self.buildTree(preorder[1:1+left_size], inorder[:left_size])\n right = self.buildTree(preorder[1+left_size:], inorder[1+left_size:])\n\n return TreeNode(preorder[0], left, right)","runtime":"135"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return\n root=TreeNode(preorder[0])\n mid=inorder.index(preorder[0])\n root.left=self.buildTree(preorder[1:mid+1],inorder[:mid])\n root.right=self.buildTree(preorder[mid+1:],inorder[mid+1:])\n return root\n ","runtime":"138"},{"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 buildTree(self, preorder: list[int], inorder: list[int]) -> TreeNode:\n # Base case: if no elements are left in preorder or inorder, return None\n if not preorder or not inorder:\n return None\n\n # The first element in preorder is the root\n root_val = preorder[0]\n root = TreeNode(root_val)\n\n # Find the index of the root in the inorder array\n mid = inorder.index(root_val)\n\n # Recursively build the left and right subtrees\n # Left subtree: preorder[1:mid+1] (next left subtree size) and inorder[:mid] (left part of inorder)\n # Right subtree: preorder[mid+1:] (remaining right part) and inorder[mid+1:] (right part of inorder)\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\n root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])\n\n return root\n","runtime":"138"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n \n idx = inorder.index(preorder[0])\n root = ListNode(preorder[0])\n \n root.left = self.buildTree(preorder[1:idx+1],inorder[0:idx])\n root.right = self.buildTree(preorder[idx+1:],inorder[idx+1:])\n return root\n \n ","runtime":"140"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n\n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1:mid + 1], inorder[:mid])\n root.right = self.buildTree(preorder[mid+ 1:], inorder[mid+ 1:])\n return root\n ","runtime":"140"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n \n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n\n root.left = self.buildTree(preorder[1 : mid + 1], inorder[ : mid])\n root.right = self.buildTree(preorder[mid + 1 : ], inorder[mid + 1 :])\n return root\n ","runtime":"142"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n\n output = TreeNode(preorder[0])\n\n m = inorder.index(preorder[0])\n output.left = self.buildTree(preorder[1:m + 1], inorder[:m])\n output.right = self.buildTree(preorder[m + 1:], inorder[m + 1:])\n\n return output","runtime":"142"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return None\n \n root = TreeNode(preorder[0])\n root_index = inorder.index(preorder[0])\n\n left_size = root_index # 1\n right_size = len(inorder[root_index + 1:]) # 3\n\n root.left = self.buildTree(preorder[1: 1 + left_size], inorder[:root_index])\n root.right = self.buildTree(preorder[1+left_size: 1+left_size+right_size], inorder[root_index+1:])\n \n return root\n ","runtime":"145"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n preorder_stack = []\n postorder_stack = []\n \n root_val = preorder[0]\n in_order_root = inorder.index(root_val)\n root = TreeNode(val=root_val)\n root.left = self.buildTree(preorder[1:in_order_root+1], inorder[:in_order_root])\n root.right = self.buildTree(preorder[in_order_root+1:], inorder[in_order_root+1:])\n return root\n","runtime":"145"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n if not preorder:\n\n return None\n\n root=TreeNode(preorder[0])\n\n idx=inorder.index(preorder[0])\n\n root.left = self.buildTree(preorder[1:idx+1], inorder[:idx])\n \n root.right = self.buildTree(preorder[idx+1:], inorder[idx+1:])\n \n return root\n ","runtime":"147"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder) == 0:\n return None\n if len(preorder) == 1:\n return TreeNode(preorder[0])\n\n root_val = preorder[0]\n left_count = inorder.index(root_val)\n # right_count = len(preorder) - left_count - 1\n\n left = self.buildTree(preorder[1 : 1 + left_count], inorder[:left_count])\n right = self.buildTree(preorder[left_count + 1 :], inorder[left_count + 1 :])\n\n root = TreeNode(root_val)\n root.left = left\n root.right = right\n return root","runtime":"147"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \"\"\"\n 确实需要通过inorder.index(val)获得left_part, right_part\n 注意：preorder也需要分为leftm right两个部分\n \"\"\"\n if not preorder or not inorder:\n return None\n \n val = preorder[0]\n node = TreeNode(val)\n\n idx = inorder.index(val)\n left_inorder = inorder[0: idx]\n right_inorder = inorder[idx+1:]\n left_preorder = preorder[1: 1+len(left_inorder)]\n right_preorder = preorder[len(left_inorder)+1: ]\n\n node.left = self.buildTree(left_preorder, left_inorder)\n node.right = self.buildTree(right_preorder, right_inorder)\n return node\n\n ","runtime":"150"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return None\n \n root = TreeNode(preorder[0])\n i = inorder.index(preorder[0])\n \n # Build the left subtree\n root.left = self.buildTree(preorder[1:i+1], inorder[:i])\n\n # Build the right subtree\n root.right = self.buildTree(preorder[i+1:], inorder[i+1:])\n\n return root\n\n","runtime":"150"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n root_value = preorder[0]\n root = TreeNode(root_value)\n root_index = inorder.index(root_value)\n left_inorder = inorder[:root_index]\n right_inorder = inorder[root_index+1:]\n\n left_preorder = preorder[1:len(left_inorder)+1]\n right_preorder = preorder[len(left_inorder)+1:]\n root.left = self.buildTree(left_preorder, left_inorder)\n root.right = self.buildTree(right_preorder, right_inorder)\n\n return root\n ","runtime":"152"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n mid=inorder.index(preorder[0])\n return TreeNode(preorder[0], self.buildTree(preorder[1:mid+1],inorder[:mid]), self.buildTree(preorder[mid+1:],inorder[mid+1:]))\n \n","runtime":"152"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n # Base case: If either list is empty, return None\n if not preorder or not inorder:\n return None\n \n # The first element of preorder is the root of the tree\n root_val = preorder[0]\n root = TreeNode(root_val)\n \n # Find the index of the root in inorder list\n root_index = inorder.index(root_val)\n \n # Everything left of root_index in inorder is the left subtree\n # Everything right of root_index in inorder is the right subtree\n left_inorder = inorder[:root_index]\n right_inorder = inorder[root_index + 1:]\n \n # Length of left subtree will help to find corresponding elements in preorder\n left_preorder = preorder[1:len(left_inorder) + 1]\n right_preorder = preorder[len(left_inorder) + 1:]\n \n # Recursively build left and right subtrees\n root.left = self.buildTree(left_preorder, left_inorder)\n root.right = self.buildTree(right_preorder, right_inorder)\n \n return root\n ","runtime":"155"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if preorder is None:\n return None\n ctr = 0\n def buildUtil(preorder, inorder, l, r):\n nonlocal ctr\n if l>r or r<l:\n return None\n \n node = TreeNode(preorder[ctr])\n idx = self.find(preorder[ctr], inorder)\n ctr+=1\n node.left = buildUtil(preorder, inorder, l, idx-1)\n node.right = buildUtil(preorder, inorder, idx+1, r)\n return node\n \n return buildUtil(preorder, inorder, 0, len(preorder)-1)\n\n def find(self, val, inorder):\n for i,n in enumerate(inorder):\n if n == val:\n return i\n\n return 0\n\n\n ","runtime":"155"},{"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\"\"\"\ninorder -> L, N, R\npreorder = N, L, R\nso first element (say M) in preorder is root. In Inorder all nodes in left subtree of M are in location 0 to M-1 in inorder list and right subtree in M+1 to length.\n\nWe can divide the inorder and preorder based on this and call them recursively.\n\nroot: 3\n 0, 1, 2, 3, 4\npreorder = [3,9,20,15,7]\ninorder = [9,3,15,20,7]\n\n\nroot: left\npreorder = [9]\ninorder = [9]\n\nroot: right\npreorder = [20,15,7]\ninorder = [15,20,7]\n\n\"\"\"\n\nclass Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n rootVal = preorder[0]\n root = TreeNode(rootVal)\n subTreeLen = len(preorder)\n for i in range(subTreeLen):\n if inorder[i] == rootVal:\n leftSubtreeLen = i\n root.left = self.buildTree(preorder[1:1+i], inorder[0:i])\n\n # rightSubtreeLen = subTreelen - i + 1\n root.right = self.buildTree(preorder[1+i:subTreeLen+1], inorder[i+1:subTreeLen+1])\n break\n return root\n ","runtime":"157"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n return self.helper(preorder, inorder)\n\n def helper(self, preorder, inorder):\n if not preorder or not inorder:\n return None\n root = preorder[0]\n idx = inorder.index(root)\n \n inorder_left = inorder[:idx]\n inorder_right = inorder[idx + 1:]\n preorder_left = preorder[1:idx + 1]\n preorder_right = preorder[idx + 1:]\n\n left = self.helper(preorder_left, inorder_left)\n right = self.helper(preorder_right, inorder_right)\n return TreeNode(val=root, left=left, right=right)","runtime":"157"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return \n root=TreeNode()\n root.val=preorder.pop(0)\n idx=inorder.index(root.val)\n inorder_left=inorder[:idx]\n inorder_right=inorder[idx+1:]\n preorder_left=preorder[:len(inorder_left)]\n preorder_right=preorder[len(inorder_left):]\n root.left=self.buildTree(preorder_left,inorder_left)\n root.right=self.buildTree(preorder_right,inorder_right)\n return root\n \n \n \n \n \n \n ","runtime":"160"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n root = TreeNode(preorder[0])\n inorder_idx = inorder.index(preorder[0])\n index = inorder.index(preorder[0])\n \n root.left = self.buildTree(preorder[1:inorder_idx+1], inorder[:inorder_idx])\n root.right = self.buildTree(preorder[inorder_idx+1:], inorder[inorder_idx+1:])\n\n return root","runtime":"160"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \n def traverse(preorder,inorder):\n if not preorder:\n return None\n if not inorder:\n return None\n root = preorder[0]\n node = TreeNode(root)\n if len(inorder)==1:\n # print(f\"leaf node:{node.val}\")\n return node\n mid = 0\n for i in range(len(inorder)):\n if inorder[i]==root:\n mid = i\n \n # print(f\"root:{root}\")\n # print(f\"mid:{mid}, inorder:{inorder}\")\n inorderlen = len(inorder)\n\n \n \n\n if mid>0:\n # print(f\"left root:{preorder[1:mid+1]},inorder:{inorder[0:mid]}\")\n node.left = traverse(preorder[1:mid+1],inorder[0:mid])\n # preorder.pop(0)\n if mid<len(inorder):\n # print(f\"right root:{preorder[mid+1:]},inorder:{inorder[mid+1:inorderlen]}\")\n node.right = traverse(preorder[mid+1:],inorder[mid+1:inorderlen])\n return node\n \n return traverse(preorder,inorder)","runtime":"162"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n #first node in preorder is root\n #left of root node in inorder is left subtree, right of root node in inorder is right subtree\n #using found_root in inorder: \n #u get the left subtree by starting from the element to the right and going up to the index found in inorder\n\n if not preorder:\n return None\n root = TreeNode(preorder[0])\n root_index = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1:root_index+1], inorder[:root_index])\n root.right = self.buildTree(preorder[root_index+1:], inorder[root_index+1:])\n return root","runtime":"162"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder) == 0:\n return None\n \n root = TreeNode(preorder[0])\n left_subtree_count = inorder.index(preorder[0])\n if left_subtree_count > 0:\n root.left = self.buildTree(preorder[1:1 + left_subtree_count], inorder[:left_subtree_count])\n else:\n root.left = None\n\n right_subtree_count = len(inorder) - 1 - inorder.index(preorder[0])\n if right_subtree_count > 0:\n root.right = self.buildTree(preorder[1 + left_subtree_count:], inorder[left_subtree_count + 1:])\n else:\n root.right = None\n\n return root\n","runtime":"165"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not preorder:\n return\n root = TreeNode(preorder.pop(0))\n index = 0\n for i in range(len(inorder)):\n if inorder[i]==root.val:\n index = i\n root.left = self.buildTree(preorder,inorder[:index])\n root.right = self.buildTree(preorder,inorder[index+1:])\n return root\n \n \n\n\n \n\n\n ","runtime":"165"},{"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 buildTree(self, preorder, inorder):\n # Base case: if there are no elements to construct the tree\n if not preorder or not inorder:\n return None\n \n # The first element in preorder is the root of the current tree\n root_val = preorder[0]\n root = TreeNode(root_val)\n \n # Find the index of the root in inorder\n root_index_in_inorder = inorder.index(root_val)\n \n # Elements to the left of the root in inorder form the left subtree\n left_inorder = inorder[:root_index_in_inorder]\n # Elements to the right of the root in inorder form the right subtree\n right_inorder = inorder[root_index_in_inorder + 1:]\n \n # Corresponding preorder sublists for left and right subtrees\n left_preorder = preorder[1:1 + len(left_inorder)]\n right_preorder = preorder[1 + len(left_inorder):]\n \n # Recursively construct the left and right subtrees\n root.left = self.buildTree(left_preorder, left_inorder)\n root.right = self.buildTree(right_preorder, right_inorder)\n \n return root\n ","runtime":"167"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n p = 0\n\n def build_tree(preorder, inorder):\n nonlocal p\n N = len(inorder)\n\n if N<1:\n return None\n\n cur, p = preorder[p], p+1\n root = TreeNode(cur)\n k = 0\n for k in range(N):\n if inorder[k]==cur:\n break\n\n if k>=0:\n root.left = build_tree(preorder, inorder[:k])\n\n if N > k:\n root.right = build_tree(preorder, inorder[(k+1):])\n \n return root\n\n root = build_tree(preorder, inorder)\n return root\n ","runtime":"167"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not preorder:\n return None\n root = TreeNode(preorder[0])\n idx = inorder.index(root.val)\n left_inorder = inorder[:idx]\n right_inorder = inorder[idx+1:]\n left_preorder = preorder[1:len(left_inorder)+1]\n right_preorder = preorder[len(left_inorder)+1:]\n root.left = self.buildTree(left_preorder, left_inorder)\n root.right = self.buildTree(right_preorder, right_inorder)\n return root","runtime":"170"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n if len(inorder) == 0:\n return None\n\n root = preorder.pop(0)\n\n node = TreeNode(root)\n\n for i in range(len(inorder)):\n if inorder[i] == root:\n break\n\n node.left = self.buildTree(preorder, inorder[0:i])\n if i + 1 < len(inorder):\n node.right = self.buildTree(preorder, inorder[i + 1:])\n else:\n node.right = None\n\n return node","runtime":"170"},{"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 helper(self, i,inOrdS, inOrdE, preorder, inorder):\n\n if i>=len(preorder) or inOrdS>=inOrdE:\n return None\n\n r = TreeNode(preorder[i])\n\n # print(preorder[i], inOrdS, inOrdE)\n \n inOrdM = inOrdS\n while(inOrdM<inOrdE and inorder[inOrdM]!=r.val):\n inOrdM+=1\n\n r.left = self.helper(i+1, inOrdS,inOrdM, preorder, inorder)\n r.right = self.helper(i+1+(inOrdM-inOrdS), inOrdM+1,inOrdE, preorder, inorder)\n\n return r\n \n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n return self.helper(0,0,len(inorder), preorder, inorder)","runtime":"172"},{"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 pp = []\n def help(self, inorder, inorderd, l, r):\n if l >= r or r <= 0 or l >= len(inorder):\n return None\n if r-l == 1:\n self.pp.remove(inorder[l])\n return TreeNode(inorder[l], None, None)\n root = None\n s = set(inorder[l:r])\n for p in self.pp:\n if p in s:\n root = TreeNode(p, None, None)\n self.pp.remove(p)\n break\n ind = inorderd[p]\n root.left = self.help(inorder, inorderd, l, ind)\n root.right = self.help(inorder, inorderd, ind+1, r)\n return root\n \n \n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n inorderd = {}\n self.pp = preorder[::]\n for i in range(len(inorder)):\n n = inorder[i]\n inorderd[n] = i\n root = TreeNode(preorder[0], None, None)\n self.pp.remove(preorder[0])\n root.left = self.help(inorder, inorderd, 0, inorderd[root.val])\n root.right = self.help(inorder, inorderd, inorderd[root.val]+1, len(inorder))\n return root\n\n\n ","runtime":"172"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n pre_ind = 0\n def find(in_start, in_end):\n nonlocal pre_ind\n if in_start == in_end:\n return None\n\n for i in range(in_start, in_end):\n if inorder[i] == preorder[pre_ind]:\n this_node = TreeNode(val = inorder[i])\n pre_ind += 1\n this_node.left = find(in_start,i)\n this_node.right = find(i+1,in_end)\n return this_node\n\n return find(0,len(inorder))","runtime":"174"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n return self.helper(preorder, inorder, 0, len(preorder) - 1, 0, len(inorder) - 1)\n \n def helper(self, preorder: List[int], inorder: List[int], pl: int, pr: int, il: int, ir: int) -> Optional[TreeNode]:\n if pl > pr or il > ir or pl < 0 or il < 0 or pr >= len(preorder) or ir >= len(inorder):\n return None\n cur = TreeNode(preorder[pl])\n i = il\n while i <= ir:\n if inorder[i] == preorder[pl]:\n break\n i += 1\n \n left = self.helper(preorder, inorder, pl + 1, pl + i - il, il, i - 1)\n right = self.helper(preorder, inorder, pl + i - il + 1, pr, i + 1, ir)\n cur.left = left\n cur.right = right\n return cur\n ","runtime":"174"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder) <= 0:\n return\n \n root = preorder[0]\n i = 0\n \n while inorder[i] != root:\n i += 1\n \n l_subtree_sz = i\n \n root = TreeNode(root)\n if len(inorder) > 1:\n root.left = self.buildTree(preorder[1:l_subtree_sz + 1], inorder[0:l_subtree_sz])\n root.right = self.buildTree(preorder[l_subtree_sz + 1::], inorder[l_subtree_sz + 1::])\n \n return root\n \n ","runtime":"182"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n root = TreeNode(preorder[0])\n # Find # of values in left and right subtrees\n if (len(preorder) == len(inorder) == 1):\n return root\n leftIn = inorder[:inorder.index(preorder[0])]\n rightIn = inorder[inorder.index(preorder[0]) + 1:]\n\n leftPre = preorder[1 : len(leftIn) + 1]\n rightPre = preorder[len(leftIn) + 1:]\n \n if len(leftPre) > 0:\n root.left = self.buildTree(leftPre, leftIn)\n if len(rightPre) > 0:\n root.right = self.buildTree(rightPre, rightIn)\n return root","runtime":"182"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n # 如果参数是空列表，则返回空节点\n if not preorder:\n return None\n # 获得根节点的值\n root = preorder[0]\n # 获得根节点的左右孩子的前/中序遍历结果\n root_index = 0\n for i in range(len(inorder)):\n if inorder[i] == root:\n root_index = i\n break\n left_child_inorder = inorder[0: root_index]\n left_child_preorder = preorder[1: root_index + 1]\n right_child_inorder = inorder[root_index + 1:]\n right_child_preorder = preorder[root_index + 1:]\n # 构建并返回根节点\n return TreeNode(\n val=root, \n left=self.buildTree(preorder=left_child_preorder, inorder=left_child_inorder),\n right=self.buildTree(preorder=right_child_preorder, inorder=right_child_inorder),\n )","runtime":"184"},{"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 cur_idx = 0\n\n def build(self, preorder, inorder) -> TreeNode:\n if(len(inorder) == 0):\n return None\n\n root = preorder[self.cur_idx]\n self.cur_idx += 1\n\n if(len(inorder) == 1):\n return TreeNode(val=inorder[0])\n \n m = None\n for idx, val in enumerate(inorder):\n if(val == root):\n m = idx\n break\n \n left = self.build(preorder, inorder[0:m])\n right = self.build(preorder, inorder[m+1:])\n\n return TreeNode(val=root, left=left, right=right)\n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n return self.build(preorder, inorder)","runtime":"184"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n if not preorder or not inorder:\n return None\n root = TreeNode(preorder[0])\n\n # find root index in inorder\n idx = 0\n for i in range(len(inorder)):\n if root.val == inorder[i]:\n idx = i\n \n root.left = self.buildTree(preorder[1:1+idx], inorder[:idx])\n root.right = self.buildTree(preorder[idx+1:], inorder[idx+1:])\n\n return root","runtime":"187"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not preorder:\n return None\n\n tree_root = preorder[0]\n root = TreeNode(tree_root)\n for i in range(len(inorder)):\n index = 0\n if tree_root == inorder[i]:\n index = i\n break\n root.left = self.buildTree(preorder[1:1 + index], inorder[:index])\n root.right = self.buildTree(preorder[1 + index :], inorder[index + 1:])\n \n return root","runtime":"187"},{"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 findrootIndex(self, inorder, val):\n for i in range(len(inorder)):\n if inorder[i] == val:\n return i\n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n if len(preorder) == 0 or len (inorder) == 0:\n return None\n\n root = TreeNode(preorder[0])\n index = self.findrootIndex(inorder, root.val)\n root.left = self.buildTree(preorder[1:1+index], inorder[: index])\n root.right = self.buildTree(preorder[1+index:], inorder[index+1:])\n return root\n \n ","runtime":"189"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n root = TreeNode(preorder[0])\n\n preorder.pop(0)\n\n for i in range(len(inorder)):\n if inorder[i] == root.val:\n left = inorder[:i]\n right = inorder[i+1:]\n break\n \n if left:\n root.left = self.buildTree(preorder, left)\n if right: \n root.right = self.buildTree(preorder, right)\n \n return root","runtime":"189"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \n def traverse(preorder,inorder):\n if not preorder or not inorder:\n return None\n root = preorder[0]\n\n node = TreeNode(root)\n\n #leaf node\n if len(inorder)==1:\n return node\n\n mid = 0\n for i in range(len(inorder)):\n if inorder[i]==root:\n mid = i\n break\n \n\n if mid>0:\n # print(f\"left root:{preorder[1:mid+1]},inorder:{inorder[0:mid]}\")\n node.left = traverse(preorder[1:mid+1],inorder[0:mid])\n \n if mid<len(inorder):\n # print(f\"right root:{preorder[mid+1:]},inorder:{inorder[mid+1:inorderlen]}\")\n node.right = traverse(preorder[mid+1:],inorder[mid+1:])\n return node\n \n return traverse(preorder,inorder)","runtime":"192"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \n def traverse(preorder,inorder):\n if not preorder:\n return None\n if not inorder:\n return None\n root = preorder[0]\n node = TreeNode(root)\n if len(inorder)==1:\n # print(f\"leaf node:{node.val}\")\n return node\n mid = 0\n for i in range(len(inorder)):\n if inorder[i]==root:\n mid = i\n \n # print(f\"root:{root}\")\n # print(f\"mid:{mid}, inorder:{inorder}\")\n inorderlen = len(inorder)\n\n \n \n\n if mid>0:\n # print(f\"left root:{preorder[1:mid+1]},inorder:{inorder[0:mid]}\")\n node.left = traverse(preorder[1:mid+1],inorder[0:mid])\n # preorder.pop(0)\n if mid<len(inorder):\n # print(f\"right root:{preorder[mid+1:]},inorder:{inorder[mid+1:inorderlen]}\")\n node.right = traverse(preorder[mid+1:],inorder[mid+1:inorderlen])\n return node\n \n return traverse(preorder,inorder)","runtime":"192"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n assert(len(preorder) == len(inorder))\n if len(preorder) == 0:\n return None\n val = preorder[0]\n root = TreeNode(val)\n root_i = 0\n for i in range(len(inorder)):\n if inorder[i] == val:\n root_i = i\n break\n left_pre = preorder[1:root_i + 1]\n right_pre = preorder[root_i + 1:]\n left_in = inorder[:root_i]\n right_in = inorder[root_i + 1:]\n root.left = self.buildTree(left_pre, left_in)\n root.right = self.buildTree(right_pre, right_in)\n\n return root","runtime":"194"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def helper(pre_start, pre_end, in_start, in_end):\n if pre_start > pre_end:\n return None\n if pre_start == pre_end:\n return TreeNode(preorder[pre_start])\n root = TreeNode(preorder[pre_start])\n cnt = 0\n while inorder[in_start+cnt] != root.val:\n cnt += 1\n root.left = helper(pre_start+1, pre_start+cnt, in_start, in_start+cnt-1)\n root.right = helper(pre_start+cnt+1, pre_end, in_start+cnt+1, in_end)\n return root\n return helper(0, len(preorder)-1, 0, len(inorder)-1)\n ","runtime":"194"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n\n node = TreeNode(preorder[0])\n \n idx = None\n for i in range(len(inorder)):\n if inorder[i] == preorder[0]:\n idx = i\n \n node.left = self.buildTree(preorder[1:idx+1], inorder[:idx])\n node.right = self.buildTree(preorder[idx+1:], inorder[idx+1:])\n\n return node","runtime":"197"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder) == 0:\n return None\n elif len(preorder) == 1:\n return TreeNode(preorder[0])\n\n root = TreeNode(preorder[0])\n i = 0\n while inorder[i] != root.val:\n i += 1\n left = self.buildTree(preorder[1:i + 1], inorder[:i])\n right = self.buildTree(preorder[i + 1:], inorder[i + 1:])\n root.left = left\n root.right = right\n return root\n ","runtime":"197"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n i = 0\n while preorder[0] != inorder[i]:\n i += 1\n \n root = TreeNode(preorder[0])\n root.left = self.buildTree(preorder[1:i+1], inorder[0:i])\n root.right = self.buildTree(preorder[i+1:], inorder[i+1:])\n return root\n","runtime":"199"},{"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 buildTree(self, prd: List[int], ind: List[int]) -> Optional[TreeNode]:\n\n return self.tree(prd, ind)\n\n def tree(self, prd, ind):\n if not ind:\n return None\n \n r = prd[0]\n\n ri = 0\n for ri in range(len(ind)):\n if ind[ri]==r:\n break\n \n lind = ind[:ri]\n ls= len(lind)\n\n rind = ind[ri+1:]\n rn = len(rind)\n\n lprd = prd[1:ls+1]\n rprd = prd[ls+1:ls+1+rn]\n root = TreeNode(r)\n\n if lind:\n ll = self.tree(lprd, lind)\n root.left = ll\n if rind:\n rr = self.tree(rprd, rind)\n root.right = rr\n return root\n \n ","runtime":"199"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n p=preorder\n i=inorder\n if len(p)==0:\n return None\n if len(p)==1:\n g=TreeNode(p[0])\n return g\n if i[0]==p[0]:\n l1=preorder[1:]\n l2=inorder[1:]\n root=TreeNode(p[0])\n root.left=None\n root.right=self.buildTree(l1,l2)\n return root\n s=0\n while i[s]!=p[0]:\n s=s+1\n l1=i[:s]\n l2=p[1:s+1]\n lefttree=self.buildTree(l2,l1)\n r1=i[s+1:]\n r2=p[s+1:]\n righttree=self.buildTree(r2,r1)\n root=TreeNode(p[0])\n root.left=lefttree\n root.right=righttree\n return root\n\n ","runtime":"202"},{"code":"class Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return None\n root = TreeNode(preorder[0])\n for i, val in enumerate(inorder):\n if val == root.val:\n break\n inorder_left = inorder[:i]\n inorder_right = inorder[i+1:]\n preorder_left = preorder[1:1+i]\n preorder_right =preorder[i+1:]\n root.left = self.buildTree(preorder_left, inorder_left)\n root.right = self.buildTree(preorder_right, inorder_right)\n return root\n","runtime":"202"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def dfs(pre, post):\n if len(pre) == 0 or len(post) == 0:\n return None\n \n curNode = TreeNode(pre[0])\n postIndex = -1\n for i in range(len(post)):\n if post[i] == curNode.val:\n postIndex = i\n break\n\n curNode.left = dfs(pre[1:1+postIndex], post[:postIndex])\n curNode.right = dfs(pre[1+postIndex:], post[postIndex+1:])\n return curNode\n return dfs(preorder, inorder)","runtime":"204"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n i = 0\n while preorder[0] != inorder[i]:\n i += 1\n \n root = TreeNode(preorder[0])\n root.left = self.buildTree(preorder[1:i+1], inorder[0:i])\n root.right = self.buildTree(preorder[i+1:], inorder[i+1:])\n return root\n","runtime":"204"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not preorder:\n return None\n\n root = TreeNode(preorder[0])\n for i in range(len(inorder)):\n index = 0\n if preorder[0] == inorder[i]:\n index = i\n break\n root.left = self.buildTree(preorder[1:1 + index], inorder[:index])\n root.right = self.buildTree(preorder[1 + index :], inorder[index + 1:])\n \n return root","runtime":"206"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not preorder:\n return None\n\n root = TreeNode(preorder[0])\n for i in range(len(inorder)):\n index = 0\n if preorder[0] == inorder[i]:\n index = i\n break\n root.left = self.buildTree(preorder[1:1 + index], inorder[:index])\n root.right = self.buildTree(preorder[1 + index :], inorder[index + 1:])\n \n return root","runtime":"206"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder) == 0:\n return None\n root = TreeNode()\n root.val = preorder[0]\n\n if len(inorder) == 0:\n return None\n i = 0\n while inorder[i] != preorder[0]:\n i += 1\n root.left = self.buildTree(preorder[1:], inorder[:i])\n root.right = self.buildTree(preorder[i + 1:], inorder[i + 1:])\n return root\n","runtime":"209"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return None\n idx = -1\n for i, val in enumerate(inorder):\n if val == preorder[0]:\n idx = i\n break\n # print(idx)\n in_left = inorder[:idx]\n in_right = inorder[idx+1:]\n len_left = len(in_left)\n len_right = len(in_right)\n pr_left = preorder[1:len_left+1]\n pr_right = preorder[len_left+1:]\n\n # print(pr_left, in_left, pr_right, in_right)\n\n left = self.buildTree(pr_left, in_left)\n right = self.buildTree(pr_right, in_right)\n\n return TreeNode(preorder[0], left, right)","runtime":"209"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \"\"\"\n Return the root of a binary tree\n Args:\n preorder (list(int)): \n inorder (list(int)):\n\n \"\"\"\n # preorder[0] = root\n # everything before root in inorder is the left part of the tree, and therefore we can cut both list based on that\n if len(preorder) == 0:\n return None\n root_val = preorder[0]\n idx=0\n for i in inorder:\n if i == root_val:\n break\n idx+=1\n # Here, inorder[idx] == root_val\n left_inorder = inorder[:idx] \n right_inorder = inorder[idx+1:]\n left_preorder = preorder[1:idx+1]\n right_preorder = preorder[idx+1:]\n left_tree = self.buildTree(left_preorder, left_inorder)\n right_tree = self.buildTree(right_preorder, right_inorder)\n return TreeNode(root_val, left_tree, right_tree)\n","runtime":"211"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder) == 0:\n return\n root = TreeNode(preorder[0])\n for ind,val in enumerate(inorder):\n if val == root.val:\n break\n left_inorder,right_inorder = inorder[:ind],inorder[ind+1:]\n del preorder[0]\n left_preorder,right_preorder = preorder[:len(left_inorder)],preorder[len(left_inorder):]\n del inorder[ind]\n root.left = self.buildTree(left_preorder,left_inorder)\n root.right = self.buildTree(right_preorder,right_inorder)\n\n return root\n\n\n \n\n","runtime":"211"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n p=preorder\n i=inorder\n if len(p)==0:\n return None\n if len(p)==1:\n g=TreeNode(p[0])\n return g\n if i[0]==p[0]:\n l1=preorder[1:]\n l2=inorder[1:]\n root=TreeNode(p[0])\n root.left=None\n root.right=self.buildTree(l1,l2)\n return root\n s=0\n while i[s]!=p[0]:\n s=s+1\n l1=i[:s]\n l2=p[1:s+1]\n lefttree=self.buildTree(l2,l1)\n r1=i[s+1:]\n r2=p[s+1:]\n righttree=self.buildTree(r2,r1)\n root=TreeNode(p[0])\n root.left=lefttree\n root.right=righttree\n return root\n\n ","runtime":"214"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not preorder:\n return None\n\n root = TreeNode(preorder[0])\n for i in range(len(inorder)):\n index = 0\n if preorder[0] == inorder[i]:\n index = i\n break\n root.left = self.buildTree(preorder[1:1 + index], inorder[:index])\n root.right = self.buildTree(preorder[1 + index :], inorder[index + 1:])\n \n return root","runtime":"214"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n ri,left,right=0,0,0\n if len(preorder)==0:\n return None\n\n root = TreeNode(preorder[0])\n index = 0\n \n for i in range(len(inorder)):\n if inorder[i]==root.val:\n index=i\n break\n \n leftInOrder = inorder[:index]\n rightInOrder = inorder[index+1:]\n\n leftPreOrder=preorder[1:len(leftInOrder)+1]\n rightPreOrder=preorder[len(leftInOrder)+1:]\n\n root.left=self.buildTree(leftPreOrder,leftInOrder)\n root.right=self.buildTree(rightPreOrder,rightInOrder)\n \n return root\n","runtime":"216"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder) == 0 or len(inorder) == 0:\n return None\n elif len(inorder) == 1:\n return TreeNode(inorder[0])\n elif len(preorder) == 1:\n return TreeNode(preorder[0])\n root = TreeNode(preorder[0])\n index = self.getIndexOfItem(preorder[0], inorder)\n if index == -1:\n return None\n lengthLeft = len(inorder[:index + 1])\n root.left = self.buildTree(preorder[1:lengthLeft], inorder[:index])\n root.right = self.buildTree(preorder[lengthLeft:], inorder[lengthLeft:])\n return root\n\n def getIndexOfItem(self, item, lst):\n for index, k in enumerate(lst):\n if k == item:\n return index\n\n return -1 \n ","runtime":"216"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \n \n def build(preorder, inorder):\n #print(preorder, inorder)\n if not inorder:\n return None\n \n if len(preorder)==1:\n return TreeNode(preorder[0])\n \n root = preorder[0]\n index = None\n \n for i,v in enumerate(inorder):\n if v==root:\n index=i\n break\n #print(index) \n root_node =TreeNode(root)\n root_node.left = build(preorder[1:index+1], inorder[:index])\n root_node.right = build(preorder[index+1:], inorder[index+1:])\n \n return root_node\n \n \n return build(preorder, inorder)","runtime":"219"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \"\"\"\n Return the root of a binary tree\n Args:\n preorder (list(int)): \n inorder (list(int)):\n\n \"\"\"\n # preorder[0] = root\n # everything before root in inorder is the left part of the tree, and therefore we can cut both list based on that\n if len(preorder) == 0:\n return None\n root_val = preorder[0]\n idx=0\n for i in inorder:\n if i == root_val:\n break\n idx+=1\n # Here, inorder[idx] == root_val\n left_inorder = inorder[:idx] \n right_inorder = inorder[idx+1:]\n left_preorder = preorder[1:idx+1]\n right_preorder = preorder[idx+1:]\n left_tree = self.buildTree(left_preorder, left_inorder)\n right_tree = self.buildTree(right_preorder, right_inorder)\n return TreeNode(root_val, left_tree, right_tree)\n","runtime":"219"},{"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\ndef find_idx(l: Sequence[int], val: int) -> int:\n for (i, val2) in enumerate(l):\n if val == val2:\n return i\n raise ValueError(f\"{val=} not found in {l=}\")\n\nclass Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n assert len(preorder) == len(inorder), f\"different lengths for lists ({len(preorder)=} vs {len(inorder)=}): {preorder=} {inorder=}\"\n if not preorder:\n return None\n\n root_val = preorder[0]\n root_idx = find_idx(inorder, val=root_val)\n left_preorder = preorder[1:root_idx + 1]\n left_inorder = inorder[:root_idx]\n right_preorder = preorder[root_idx + 1:]\n right_inorder = inorder[root_idx + 1:]\n\n left_node = self.buildTree(preorder=left_preorder, inorder=left_inorder)\n right_node = self.buildTree(preorder=right_preorder, inorder=right_inorder)\n return TreeNode(val=root_val, left=left_node, right=right_node)","runtime":"221"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not preorder:\n return None\n\n newNode = TreeNode(val = preorder[0])\n\n newNode.left = self.buildTree(preorder[1:inorder.index(newNode.val) + 1],inorder[:inorder.index(newNode.val)])\n newNode.right = self.buildTree(preorder[inorder.index(newNode.val) + 1:],inorder[inorder.index(newNode.val)+1:])\n \n return newNode\n\n ","runtime":"221"}],"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n n=len(inorder) #TC=O(2N); SC=O(N)\\n inMap={}\\n for i in range(n):\\n inMap[inorder[i]]= i\\n return self.build(preorder,0,n-1,inorder,0,n-1,inMap)\\n \\n def build(self,preorder,preStart,preEnd,inorder,inStart,inEnd,inMap):\\n if preStart>preEnd or inStart>inEnd:\\n return None\\n root = TreeNode(preorder[preStart])\\n rootPos = inMap[root.val]\\n length = rootPos - inStart\\n root.left = self.build(preorder, preStart+1,preStart + length,\\n inorder,inStart,rootPos-1,inMap)\\n root.right = self.build(preorder,preStart+length+1,preEnd,\\n inorder,rootPos+1,inEnd,inMap)\\n return root\\n\\n\",\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 '''\\n FACTS\\n 1. first value in preorder is always the root\\n 2. in an inorder traversal, every value to the left of the root is in the subtree; every value to the right is in the right subtree\\n\\n ex. \\n 3\\n 9 20\\n 15 7\\n \\n - preorder: [3, 9, 20, 15, 7], inorder: [9, 3, 15, 20, 7]\\n root = 3\\n --> subset preorder: [9, 20, 15, 7]\\n --> left subtree according to inorder = [9]; right subtree = [15, 20, 7]\\n \\n 9 is only node of left subtree. Now deal with right subtree\\n --> subset preorder: [20, 15, 7]\\n \\n right subtree root = 20\\n --> find 20 in inorder: left tree = [15], right tree = [7] \\n \\n DONE\\n\\n Essentially, preorder tells us the roots of the subtrees, and inorder tells us how to partition our preorder subarrays to find more roots\\n\\n However, to do this, when we set the root, we need to find the index of the root in the inorder array\\n - Can do so via the .index function in python, but that is O(n), and with the recursions, time complexity will be O(n^2)\\n\\n Instead, let's build a hash of the inorder array, so we can retrieve values from it in O(1) time\\n\\n O(n), O(n)\\n '''\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]: \\n #make hash for inorder array\\n inorderHash = {inorder[i]: i for i in range(len(inorder))}\\n\\n return self.build(preorder, inorderHash, 0, len(inorder) - 1)\\n \\n #helper function to build\\n def build(self, preorder, inorderHash, start, end):\\n #start and end are the bounds for the recursion, if they ever cross, we have no more nodes left\\n # ex. at 9, building root.left --> start = 0, end = 0 - 1 --> no more nodes\\n if start > end: return\\n \\n #find the root value in the inorder array\\n mid = inorderHash[preorder[0]]\\n\\n #remove the first node of postorder entirely, now that it's set as the root\\n root = TreeNode(preorder.pop(0))\\n\\n #build left subtree: preorder spans from index 1 to mid (inclusive) \\n #The index mid is equal to the number of nodes on the left subtree, so we can just use mid to slice preorder though it was derived from the inorder array\\n root.left = self.build(preorder, inorderHash, start, mid - 1)\\n root.right = self.build(preorder, inorderHash, mid + 1, end)\\n\\n return root\\n\\n#O(n), O(n)\\n\\n''' \\n #O(n^2)\\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n\\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1 : mid + 1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid + 1 :], inorder[mid + 1 :])\\n return root\\n'''\",\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n inOrderDict = { v:i for i,v in enumerate(inorder) }\\n \\n def helper(preStart, preEnd, inStart, inEnd) -> Optional[TreeNode]:\\n if preStart > preEnd or inStart > inEnd:\\n return None\\n \\n root = TreeNode(preorder[preStart])\\n \\n mid = inOrderDict[root.val]\\n l = mid - inStart\\n \\n root.left = helper(preStart + 1, preStart + l, inStart, mid-1)\\n root.right = helper(preStart + l + 1, preEnd, mid + 1, inEnd)\\n return root\\n\\n return helper(0, len(preorder)-1, 0, len(inorder) - 1)\\n \",\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n \\n def dfs(start, end):\\n nonlocal preIndx\\n if start>end:\\n return None\\n \\n rootVal = preorder[preIndx]\\n rootIndx = dicti[rootVal]\\n root = TreeNode(rootVal)\\n\\n preIndx+=1\\n\\n root.left = dfs(start, rootIndx-1)\\n root.right = dfs(rootIndx+1, end)\\n\\n return root\\n \\n preIndx = 0\\n\\n dicti = {val:indx for indx, val in enumerate(inorder)}\\n return dfs(0, len(inorder)-1)\\n\\n# time complexity: O(n)\\n# space complexity: O(n)\\n \",\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n dic = {}\\n for i in range(len(inorder)):\\n dic[inorder[i]] = i\\n preorderIdx = [0]\\n def buildTreePartition(preorder : List[int], left : int, right : int) -> Optional[TreeNode]:\\n if left > right:\\n return None\\n rootVal = preorder[preorderIdx[0]]\\n preorderIdx[0] += 1\\n inorderIdx = dic[rootVal]\\n root = TreeNode(rootVal)\\n root.left = buildTreePartition(preorder, left, inorderIdx - 1)\\n root.right = buildTreePartition(preorder, inorderIdx + 1, right)\\n\\n return root\\n return buildTreePartition(preorder, 0, len(preorder) - 1)\\n\",\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\\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n\\n # Create a map for quick index lookup in inorder traversal\\n inorder_map = {val: idx for idx, val in enumerate(inorder)}\\n\\n def helper(pre_start, pre_end, in_start, in_end):\\n if pre_start > pre_end:\\n return None\\n\\n # The first element in preorder is the root\\n root_val = preorder[pre_start]\\n root = TreeNode(root_val)\\n\\n # Find the root in inorder\\n inorder_index = inorder_map[root_val]\\n\\n # Calculate the size of the left subtree\\n left_subtree_size = inorder_index - in_start\\n\\n # Recursively build left and right subtrees\\n root.left = helper(pre_start + 1, pre_start + left_subtree_size, \\n in_start, inorder_index - 1)\\n root.right = helper(pre_start + left_subtree_size + 1, pre_end, \\n inorder_index + 1, in_end)\\n\\n return root\\n\\n return helper(0, len(preorder) - 1, 0, len(inorder) - 1)\",\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n inorder_map = {}\\n for idx, num in enumerate(inorder):\\n inorder_map[num] = idx\\n\\n def buildTreeHelper(pre_s, pre_e, preorder, in_s, in_e, inorder):\\n if pre_s > pre_e or in_s > in_e: return\\n\\n root = TreeNode(preorder[pre_s])\\n in_root = inorder_map[preorder[pre_s]]\\n nums_left = in_root - in_s\\n\\n root.left = buildTreeHelper(pre_s + 1, pre_s + nums_left, preorder, in_s, in_root - 1, inorder)\\n root.right = buildTreeHelper(pre_s + nums_left + 1, pre_e, preorder, in_root + 1, in_e, inorder)\\n\\n return root\\n\\n return buildTreeHelper(0, len(preorder) - 1, preorder, 0, len(inorder) - 1, inorder)\",\n \"runtime\": \"34\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n stack = []\\n inorder_index = 0\\n\\n dummy_node = TreeNode ()\\n curr_node = dummy_node\\n right = False\\n\\n for add_node in preorder:\\n\\n add_node = TreeNode(val = add_node)\\n\\n if right:\\n curr_node.right = add_node\\n right = False\\n else:\\n curr_node.left = add_node\\n\\n stack.append(add_node)\\n\\n curr_node = add_node\\n\\n while len(stack) > 0 and stack[-1].val == inorder[inorder_index]:\\n curr_node = stack.pop()\\n inorder_index += 1\\n right = True\\n\\n\\n\\n return dummy_node.left\\n\",\n \"runtime\": \"34\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n inorderDict = {val: i for i, val in enumerate(inorder)}\\n n = len(preorder)\\n head = TreeNode()\\n st = [(head,0,n-1)]\\n idx = 0\\n while st:\\n node, l, r = st.pop()\\n node.val = preorder[idx]\\n inorderIdx = inorderDict[node.val]\\n if inorderIdx + 1 <= r:\\n node.right = TreeNode()\\n st.append((node.right, inorderIdx + 1, r))\\n if inorderIdx - 1 >= l:\\n node.left = TreeNode()\\n st.append((node.left, l , inorderIdx - 1))\\n idx += 1\\n\\n return head\",\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n index = 0\\n inorder_map = {value: idx for idx, value in enumerate(inorder)}\\n\\n def helper(left, right):\\n nonlocal index\\n if left > right:\\n return None\\n\\n curr = preorder[index]\\n index += 1\\n node = TreeNode(curr)\\n\\n if left == right:\\n return node\\n\\n inorder_index = inorder_map[curr]\\n node.left = helper(left, inorder_index - 1)\\n node.right = helper(inorder_index + 1, right)\\n\\n return node\\n\\n return helper(0, len(inorder) - 1) \",\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return None\\n\\n preorder = deque(preorder)\\n d = {}\\n for i, v in enumerate(inorder):\\n d[v] = i\\n\\n def recursive(preorder, d, start, end):\\n # if start >= end: void left children, \\n # if not preorder: tree finished and void right children \\n if start >= end or not preorder:\\n return None\\n\\n top = preorder.popleft()\\n node = TreeNode(top)\\n\\n #leaf\\n if start == end-1:\\n return node\\n\\n node.left = recursive(preorder, d, start, d[top])\\n node.right = recursive(preorder, d, d[top]+1, end)\\n return node\\n\\n root = recursive(preorder, d, 0, len(inorder))\\n return root\",\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\n mapping = {}\\n\\n for i in range(len(inorder)):\\n mapping[inorder[i]] = i\\n \\n preorder = collections.deque(preorder)\\n\\n def build(start, end):\\n if start > end: return None\\n\\n root = TreeNode(preorder.popleft())\\n mid = mapping[root.val]\\n\\n root.left = build(start, mid - 1)\\n root.right = build(mid + 1, end)\\n\\n return root\\n\\n return build(0, len(preorder) - 1)\\n \",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n idx_mapping = {}\\n curr = 0\\n for i,val in enumerate(inorder):\\n idx_mapping[val] = i\\n\\n def buildLeftRight(left:int, right:int):\\n nonlocal curr\\n if curr >= len(preorder):\\n return None\\n idx = idx_mapping[preorder[curr]]\\n if not(left <= idx <= right):\\n return None\\n curr+=1\\n new_node = TreeNode(inorder[idx])\\n new_node.left = buildLeftRight(left,idx-1)\\n new_node.right = buildLeftRight(idx+1,right)\\n return new_node\\n return buildLeftRight(0,len(preorder)-1)\",\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 recursion(self, left, right):\\n if left > right:\\n return None\\n \\n rootval = self.preOrder[self.preOrderIndex]\\n mid = self.inorderMap[rootval]\\n root = TreeNode(val=rootval)\\n self.preOrderIndex += 1\\n\\n root.left = self.recursion(left, mid-1)\\n root.right = self.recursion(mid+1, right)\\n return root\\n \\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n self.preOrderIndex = 0\\n self.preOrder = preorder\\n self.inorderMap = {number:index for index, number in enumerate(inorder)}\\n return self.recursion(0, len(preorder)-1)\",\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n hashmap={val:key for key, val in enumerate(inorder)}\\n root=self._buildtree(preorder,0,len(preorder)-1,inorder,0,len(inorder)-1,hashmap)\\n return root\\n def _buildtree(self,preorder,pre_start,pre_end,inorder,instart,inend,hashmap):\\n if pre_start>pre_end or instart>inend:\\n return None\\n root=TreeNode(preorder[pre_start])\\n inroot=hashmap[root.val]\\n rem_left=inroot-instart\\n root.left=self._buildtree(preorder,pre_start+1,pre_start+rem_left,inorder,instart,inroot-1,hashmap)\\n root.right=self._buildtree(preorder,pre_start+rem_left+1,pre_end,inorder,inroot+1,inend,hashmap)\\n return root\\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n def build_tree(i_preorder, i_inorder, size):\\n if size <= 0:\\n return None\\n \\n root_value = preorder[i_preorder]\\n inorder_root_index = inorder_dict[root_value]\\n left_tree = build_tree(i_preorder + 1, \\n i_inorder, \\n inorder_root_index - i_inorder)\\n right_tree = build_tree(i_preorder + 1 + inorder_root_index - i_inorder,\\n inorder_root_index + 1, \\n size - inorder_root_index + i_inorder - 1)\\n return TreeNode(root_value, left_tree, right_tree)\\n \\n inorder_dict = { value: i for i, value in enumerate(inorder) }\\n return build_tree(0, 0, len(preorder))\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n VAL_TO_INORDER_IDX = {inorder[i]: i for i in range(len(inorder))}\\n\\n def buildTreePartition(preorder, inorder_start, inorder_end):\\n if not preorder or inorder_start < 0 or inorder_end > len(inorder):\\n return None\\n\\n root_val = preorder[0]\\n root_inorder_idx = VAL_TO_INORDER_IDX[root_val]\\n if root_inorder_idx > inorder_end or root_inorder_idx < inorder_start:\\n return None\\n \\n root = TreeNode(preorder.pop(0))\\n root.left = buildTreePartition(preorder, inorder_start, root_inorder_idx - 1)\\n root.right = buildTreePartition(preorder, root_inorder_idx + 1, inorder_end)\\n\\n return root\\n\\n return buildTreePartition(preorder, 0, len(inorder) - 1)\",\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n def build_tree(i_preorder, i_inorder, size):\\n if size <= 0:\\n return None\\n \\n root_value = preorder[i_preorder]\\n inorder_root_index = inorder_dict[root_value]\\n left_tree = build_tree(i_preorder + 1, \\n i_inorder, \\n inorder_root_index - i_inorder)\\n right_tree = build_tree(i_preorder + 1 + inorder_root_index - i_inorder,\\n inorder_root_index + 1, \\n size - inorder_root_index + i_inorder - 1)\\n return TreeNode(root_value, left_tree, right_tree)\\n \\n inorder_dict = { value: i for i, value in enumerate(inorder) }\\n return build_tree(0, 0, len(preorder))\",\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n # if not inorder:\\n # return None\\n def array_to_tree(left, right):\\n nonlocal preorder_index\\n if left > right:\\n return None\\n\\n root_value = preorder[preorder_index]\\n root = TreeNode(root_value)\\n preorder_index += 1\\n\\n root.left = array_to_tree(left, inorder_map[root_value] - 1)\\n root.right = array_to_tree(inorder_map[root_value] + 1, right)\\n\\n return root\\n\\n preorder_index = 0\\n inorder_map = {val: idx for idx, val in enumerate(inorder)}\\n return array_to_tree(0, len(inorder) - 1)\\n\\n \\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 cur_idx = 0\\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n mp = {}\\n for idx, val in enumerate(inorder):\\n mp[val] = idx\\n \\n def build(preorder, inorder, l, r) -> TreeNode:\\n if(r - l + 1 < 1):\\n return None\\n\\n root = preorder[self.cur_idx]\\n self.cur_idx += 1\\n m = mp[root]\\n \\n left = build(preorder, inorder, l, m-1)\\n right = build(preorder, inorder, m+1, r)\\n\\n return TreeNode(val=root, left=left, right=right)\\n\\n return build(preorder, inorder, 0, len(inorder) - 1)\",\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 dfs(self, preorder, inorder, idxMap, left, right):\\n if left > right:\\n return None\\n \\n value = preorder[self.preorderIdx]\\n newNode = TreeNode(value)\\n\\n self.preorderIdx += 1\\n\\n inorderIdx = idxMap[value]\\n\\n newNode.left = self.dfs(preorder, inorder, idxMap, left, inorderIdx - 1)\\n newNode.right = self.dfs(preorder, inorder, idxMap, inorderIdx + 1, right)\\n\\n return newNode\\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n self.preorderIdx = 0\\n\\n idxMap = {val: idx for idx, val in enumerate(inorder)}\\n\\n return self.dfs(preorder, inorder, idxMap, 0, len(preorder) - 1)\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\n mapping = {}\\n\\n for i in range(len(inorder)):\\n mapping[inorder[i]] = i\\n \\n preorder = collections.deque(preorder)\\n\\n def build(start, end):\\n if start > end: return None\\n\\n root = TreeNode(preorder.popleft())\\n mid = mapping[root.val]\\n\\n root.left = build(start, mid - 1)\\n root.right = build(mid + 1, end)\\n\\n return root\\n\\n return build(0, len(preorder) - 1)\",\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 def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n hm= collections.defaultdict(int)\\n\\n for i,val in enumerate(inorder):\\n hm[val]=i\\n \\n index=[0]\\n \\n def helper(low,high):\\n\\n if low==high:\\n return\\n\\n root = TreeNode(preorder[index[0]])\\n index[0]+=1\\n\\n index_for_inorder = hm[root.val]\\n root.left = helper(low,index_for_inorder)\\n root.right = helper(index_for_inorder+1,high)\\n\\n return root\\n \\n return helper(0,len(preorder))\\n\\n\\n \",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n idx_mapping = {}\\n curr = 0\\n for i,val in enumerate(inorder):\\n idx_mapping[val] = i\\n\\n def buildLeftRight(idx: int, left:int, right:int):\\n nonlocal curr\\n if not(left <= idx <= right):\\n return None\\n curr+=1\\n new_node = TreeNode(inorder[idx])\\n if curr < len(preorder):\\n new_node.left = buildLeftRight(idx_mapping[preorder[curr]],left,idx-1)\\n if curr < len(preorder):\\n new_node.right = buildLeftRight(idx_mapping[preorder[curr]],idx+1,right)\\n return new_node\\n return buildLeftRight(idx_mapping[preorder[curr]],0,len(preorder)-1)\",\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n index = 0\\n mapping = {val: ix for ix, val in enumerate(inorder)}\\n def helper(l,r):\\n nonlocal index\\n if l > r:\\n return None\\n \\n curr = preorder[index]\\n index +=1\\n node = TreeNode(curr)\\n if l == r:\\n return node\\n \\n ix = mapping[curr]\\n node.left = helper(l,ix -1)\\n node.right = helper(ix+1, r)\\n\\n return node\\n return helper(0,len(preorder)-1)\",\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n def build_tree(i_preorder, i_inorder, size):\\n if size <= 0:\\n return None\\n \\n root_value = preorder[i_preorder]\\n inorder_root_index = inorder_dict[root_value]\\n left_tree = build_tree(i_preorder + 1, \\n i_inorder, \\n inorder_root_index - i_inorder)\\n right_tree = build_tree(i_preorder + 1 + inorder_root_index - i_inorder,\\n inorder_root_index + 1, \\n size - inorder_root_index + i_inorder - 1)\\n return TreeNode(root_value, left_tree, right_tree)\\n \\n inorder_dict = { value: i for i, value in enumerate(inorder) }\\n return build_tree(0, 0, len(preorder))\",\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 \\\"\\\"\\\"\\n root_val = 3, root_index = 1, start = 0, end = 5\\n\\n\\n \\\"\\\"\\\"\\n def _build_internal(self, start, end, preorder_queue, inorder_dict):\\n if start > end:\\n return None\\n \\n root_val = preorder_queue.popleft()\\n root = TreeNode(root_val)\\n root_index = inorder_dict.get(root_val)\\n root.left = self._build_internal(start, root_index-1, preorder_queue, inorder_dict)\\n root.right = self._build_internal(root_index+1, end, preorder_queue, inorder_dict)\\n return root\\n\\n \\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n preorder_queue = deque(preorder)\\n inorder_dict = dict()\\n for i, e in enumerate(inorder):\\n inorder_dict[e] = i\\n n = len(preorder)\\n return self._build_internal(0, n-1, preorder_queue, inorder_dict)\\n \",\n \"runtime\": \"59\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n \\n # Create a mapping from value to index in inorder list\\n inorder_index_map = {value: idx for idx, value in enumerate(inorder)}\\n \\n def build_tree(pre_start: int, pre_end: int, in_start: int, in_end: int) -> Optional[TreeNode]:\\n if pre_start > pre_end or in_start > in_end:\\n return None\\n \\n # The root is the first element in preorder\\n root_value = preorder[pre_start]\\n root = TreeNode(root_value)\\n \\n # Find the root index in inorder list\\n root_index_in_inorder = inorder_index_map[root_value]\\n \\n # Number of nodes in the left subtree\\n left_subtree_size = root_index_in_inorder - in_start\\n \\n # Recursively build left and right subtrees\\n root.left = build_tree(pre_start + 1, pre_start + left_subtree_size, in_start, root_index_in_inorder - 1)\\n root.right = build_tree(pre_start + left_subtree_size + 1, pre_end, root_index_in_inorder + 1, in_end)\\n \\n return root\\n \\n # Initialize the recursive function\\n return build_tree(0, len(preorder) - 1, 0, len(inorder) - 1)\",\n \"runtime\": \"59\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n in_order = {val : index for index, val in enumerate(inorder)}\\n\\n def build(pre_start, pre_end, in_start, in_end):\\n\\n if pre_start > pre_end:\\n return None\\n\\n # find root\\n root_val = preorder[pre_start]\\n root = TreeNode(root_val)\\n\\n # find root index in inorder\\n in_index = in_order[root_val]\\n\\n # left sub size\\n left_sub_size = in_index - in_start\\n\\n root.left = build(pre_start + 1, pre_start + left_sub_size, in_start, in_index - 1)\\n root.right = build(pre_start + left_sub_size + 1, pre_end, in_index + 1, in_end)\\n\\n return root\\n\\n return build(0, len(preorder) - 1, 0, len(inorder) - 1)\\n\",\n \"runtime\": \"61\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n VAL_TO_INORDER_IDX = {inorder[i]: i for i in range(len(inorder))}\\n print(VAL_TO_INORDER_IDX)\\n def buildTreePartition(preorder, inorder_start, inorder_end):\\n if not preorder or inorder_start < 0 or inorder_end > len(inorder):\\n return None\\n root_val = preorder[0]\\n root_inorder_idx = VAL_TO_INORDER_IDX[root_val]\\n if root_inorder_idx > inorder_end or root_inorder_idx < inorder_start:\\n return None\\n root = TreeNode(preorder.pop(0))\\n root.left = buildTreePartition(preorder, inorder_start, root_inorder_idx - 1)\\n root.right = buildTreePartition(preorder, root_inorder_idx + 1, inorder_end)\\n return root\\n return buildTreePartition(preorder, 0, len(inorder) - 1)\\n\",\n \"runtime\": \"61\"\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 helper(self, preorder: List[int], inorder: List[int], root: Optional[TreeNode], inorder_map, left:int, right:int):\\n #remove root from preorder\\n #find index of root val in inorder list - left of index is root's left subtree and right of index is root's right subtree\\n #build root's left subtree\\n #build root's right subtree\\n print(\\\"left: \\\", left)\\n print(\\\"right: \\\", right)\\n print(\\\"root: \\\", root.val if root else None)\\n if len(preorder) == 0:\\n return None\\n elif left > right:\\n return None\\n elif left == right:\\n new_node = TreeNode(preorder[0])\\n preorder.pop(0)\\n return new_node\\n else:\\n new_node = TreeNode(preorder[0])\\n preorder.pop(0)\\n root_index = inorder_map[new_node.val]\\n left_subtree_left_bound = left\\n left_subtree_right_bound = root_index-1\\n right_subtree_left_bound = root_index+1\\n right_subtree_right_bound = right\\n \\n new_node.left = self.helper(preorder, inorder, new_node, inorder_map, left_subtree_left_bound, left_subtree_right_bound)\\n new_node.right = self.helper(preorder, inorder, new_node, inorder_map, right_subtree_left_bound, right_subtree_right_bound)\\n\\n return new_node\\n\\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n #build hashmap to easily get the index of a value in inorder list\\n inorder_map = {}\\n for i in range(len(inorder)):\\n inorder_map[inorder[i]] = i\\n\\n # dummy = TreeNode(0)\\n root = self.helper(preorder, inorder, None, inorder_map, 0, len(inorder))\\n\\n\\n return root\",\n \"runtime\": \"64\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\n adj = {val: i for i, val in enumerate(inorder)}\\n\\n def tree(ins, ine, ps, pe):\\n print(ins, ine, ps, pe)\\n if ins > ine or ps > pe:\\n return None\\n print(ps)\\n root = TreeNode(preorder[ps])\\n in_root = adj[root.val]\\n\\n pre_right_start = ps + (in_root - ins) + 1\\n\\n\\n root.left = tree(ins, in_root - 1, ps + 1, pre_right_start - 1)\\n root.right = tree(in_root + 1, ine, pre_right_start, pe)\\n\\n return root\\n\\n return tree(0, len(inorder)-1, 0, len(inorder)-1)\",\n \"runtime\": \"64\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n N = len(preorder)\\n\\n # in preorder, the root comes first, then the left\\n # so we know the root is preorder[0], we find it's index\\n # in inorder, and then the left of preorder[0] is the left\\n # subtree and the right of preorder[0] is the right subtree\\n # the next root of the left side is preorder[1] and so on\\n\\n lookup = {e: i for i, e in enumerate(inorder)}\\n\\n def build(i: int, l: int, r: int) -> Optional[TreeNode]:\\n\\n values = inorder[l:r+1]\\n\\n if N <= i or not values:\\n return None\\n\\n\\n val = preorder[i]\\n j = lookup[val]\\n\\n node = TreeNode(val)\\n if l <= j <= r:\\n\\n # inorder[l:j+1]\\n \\n left_length = j - l + 1\\n\\n node.left = build(i+1, l, j-1)\\n # i + 1 is the root of the left subtree\\n node.right = build(i + left_length, j+1, r)\\n return node\\n \\n return build(0, 0, N-1)\",\n \"runtime\": \"66\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n def helper(pre_start, pre_end, in_start, in_end) -> Optional[TreeNode]:\\n if pre_start > pre_end:\\n return None\\n \\n root_val = preorder[pre_start]\\n root_idx = inorder.index(root_val)\\n\\n left_size = root_idx - in_start\\n root = TreeNode(root_val)\\n root.left = helper(pre_start + 1, pre_start + left_size, in_start, root_idx -1)\\n root.right = helper(pre_start + left_size + 1, pre_end, root_idx + 1, in_end)\\n return root\\n \\n return helper(0, len(preorder) - 1, 0, len(preorder) - 1)\\n \\n \\n\\n\\n \",\n \"runtime\": \"66\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n mapping = {value: index for index, value in enumerate(inorder)}\\n preorder = deque(preorder)\\n\\n def build(start, end):\\n if start>end: return None\\n root = TreeNode(preorder.popleft())\\n mid = mapping[root.val]\\n\\n root.left = build(start, mid - 1)\\n root.right = build(mid +1, end)\\n\\n return root\\n \\n return build(0, len(preorder)-1)\",\n \"runtime\": \"69\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n return self.dfs(preorder, inorder, 0, len(preorder), 0, len(inorder))\\n\\n def dfs(self, preorder: List[int], inorder: List[int], pre_start: int, pre_end: int, in_start: int, in_end: int) -> Optional[TreeNode]:\\n # base case\\n if in_start >= in_end:\\n return None\\n \\n parent_val = preorder[pre_start]\\n root = TreeNode(parent_val)\\n in_index = inorder.index(parent_val)\\n left_size = in_index - in_start\\n root.left = self.dfs(preorder, inorder, pre_start + 1, pre_start + left_size, in_start, in_index)\\n root.right = self.dfs(preorder, inorder, pre_start + left_size + 1, pre_end, in_index + 1, in_end)\\n\\n return root\",\n \"runtime\": \"69\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n currIdx = 0\\n\\n def dfs(start, end):\\n nonlocal currIdx\\n\\n if start > end or end < start or currIdx >= len(preorder):\\n return None\\n\\n nodeIdx = inorder.index(preorder[currIdx])\\n node = TreeNode(preorder[currIdx])\\n currIdx += 1\\n\\n node.left = dfs(start, nodeIdx - 1)\\n node.right = dfs(nodeIdx + 1, end)\\n\\n\\n return node\\n\\n return dfs(0, len(inorder) - 1)\",\n \"runtime\": \"71\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def helper(preorder,inorder, sip, eip, sii, eii):\\n if sip > eip:\\n return None\\n curr = TreeNode(preorder[sip])\\n idx = inorder.index(preorder[sip])\\n curr.left = helper(preorder, inorder, sip+1, sip+idx-sii, sii, idx-1)\\n curr.right = helper(preorder, inorder, sip+idx-sii+1, eip, idx+1, eii)\\n return curr\\n return helper(preorder,inorder,0, len(preorder) - 1, 0, len(preorder)-1)\\n\",\n \"runtime\": \"71\"\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\\ndef build_tree_from_preorder_inorder(preorder, inorder, pre_start, pre_end, in_start, in_end):\\n if pre_start > pre_end or in_start > in_end:\\n return None\\n\\n root_data = preorder[pre_start] # The root is the first element in preorder\\n root = TreeNode(root_data)\\n\\n inorder_index = inorder.index(root_data, in_start, in_end + 1) # Find the root in inorder\\n\\n # Calculate the size of the left subtree\\n left_subtree_size = inorder_index - in_start\\n\\n # Recursively build the left and right subtrees\\n root.left = build_tree_from_preorder_inorder(preorder, inorder, pre_start + 1, pre_start + left_subtree_size, in_start, inorder_index - 1)\\n root.right = build_tree_from_preorder_inorder(preorder, inorder, pre_start + left_subtree_size + 1, pre_end, inorder_index + 1, in_end)\\n \\n return root\\n\\nclass Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n return build_tree_from_preorder_inorder(preorder,inorder,0,len(preorder)-1,0,len(inorder)-1)\",\n \"runtime\": \"74\"\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 build(self, preorder, inorder, start, end):\\n if self.preorder_index>=len(preorder) or start > end:\\n return None\\n rootVal = preorder[self.preorder_index]\\n self.preorder_index += 1\\n root = TreeNode(rootVal)\\n ind = inorder.index(rootVal)\\n root.left = self.build(preorder, inorder, start, ind - 1)\\n root.right = self.build(preorder, inorder, ind + 1, end)\\n return root\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder) != len(inorder):\\n return []\\n self.preorder_index = 0\\n root=self.build(preorder,inorder,0,len(preorder)-1)\\n return root\\n \",\n \"runtime\": \"74\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def helper(preIndex: int, inStart:int, inEnd:int) -> Optional[TreeNode]:\\n node = TreeNode(preorder[preIndex])\\n\\n # print(f\\\"value: {preorder[preIndex]} left: {inStart} right: {inEnd}\\\")\\n inIndex = inorder.index(preorder[preIndex], inStart, inEnd)\\n if inIndex - inStart == 0:\\n node.left = None\\n else:\\n node.left = helper(preIndex+1, inStart, inIndex)\\n \\n if inEnd - (inIndex + 1) == 0:\\n node.right = None\\n else:\\n node.right = helper((preIndex+1)+(inIndex-inStart), inIndex+1, inEnd)\\n\\n return node\\n \\n return helper(0, 0, len(preorder))\\n \\n'''\\ntime: O(n)\\nspace: O(1)\\n'''\",\n \"runtime\": \"76\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n ## Stack definition:\\n ## (node, start, end, index, which)\\n ## - node: the tree node to process\\n ## - start: start of the range in 'inorder'\\n ## - end: end of the range in 'inorder'\\n ## - index: index of root value in 'inorder'\\n ## - which: indicates which child node to process in the next traversal\\n\\n ## Initially, push the root node into the stack\\n root = TreeNode(preorder[0])\\n stack = [(root, 0, len(inorder), inorder.index(root.val), 'LEFT')]\\n ## Current index in 'preorder', start from 1, \\n curIndex = 1\\n while stack:\\n node, start, end, index, which = stack.pop()\\n ## Processing the left node\\n if which == 'LEFT':\\n ## Push the node back to the stack again to process its right node in the next traversal\\n stack.append((node, start, end, index, 'RIGHT'))\\n if start < index:\\n lindex = inorder[start:index].index(preorder[curIndex]) + start\\n node.left = TreeNode(preorder[curIndex])\\n curIndex += 1\\n stack.append((node.left, start, index, lindex, 'LEFT'))\\n ## Processing the right node\\n if which == 'RIGHT':\\n if index+1 < end:\\n rindex = inorder[index+1:end].index(preorder[curIndex]) + index + 1\\n node.right = TreeNode(preorder[curIndex])\\n curIndex += 1\\n stack.append((node.right, index+1, end, rindex, 'LEFT'))\\n\\n return root\",\n \"runtime\": \"76\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder or (len(preorder) != len(inorder)):\\n return None \\n\\n n = len(preorder)\\n \\n def build(pL, pR, iL, iR):\\n if pL > pR or iL > iR:\\n return None\\n if pL == pR:\\n return TreeNode(preorder[pL])\\n r = TreeNode(preorder[pL])\\n mid = inorder.index(preorder[pL]) \\n # Number of nodes in the left subtree\\n left_size = mid - iL\\n \\n # Recursively build the left and right subtrees\\n r.left = build(pL + 1, pL + left_size, iL, mid - 1)\\n r.right = build(pL + left_size + 1, pR, mid + 1, iR)\\n return r\\n \\n return build(0, n - 1, 0, n - 1)\",\n \"runtime\": \"78\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def helper(l1, r1, l2, r2):\\n if l1 == r1:\\n return TreeNode(preorder[l1])\\n root = TreeNode(preorder[l1])\\n m = inorder.index(preorder[l1])\\n #m - l2 + l1 \\n left_node = helper(l1 + 1, l1 + m - l2, l2, m - 1) if l2 <= m - 1 else None\\n right_node = helper(l1 + m - l2 + 1, r1, m + 1, r2) if m + 1 <= r2 else None\\n root.left = left_node\\n root.right = right_node\\n return root\\n return helper(0, len(preorder) - 1, 0, len(preorder) - 1)\\n\",\n \"runtime\": \"78\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n self.preIndex = 0\\n \\n def helper(pre, ino, l, r):\\n if l>r:\\n return \\n root = TreeNode(pre[self.preIndex])\\n i = ino.index(pre[self.preIndex])\\n self.preIndex+=1\\n\\n root.left = helper(pre, ino, l, i-1)\\n root.right = helper(pre, ino, i+1, r)\\n\\n return root\\n \\n return helper(preorder, inorder, 0, len(preorder)-1)\",\n \"runtime\": \"81\"\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.pre_i = 0\\n\\n def build_tree(self,\\n preorder: List[int],\\n inorder: List[int],\\n in_start: int,\\n in_end: int) -> Optional[TreeNode]:\\n if in_start > in_end:\\n return None\\n\\n node = TreeNode(preorder[self.pre_i])\\n self.pre_i += 1\\n\\n if in_start == in_end:\\n return node\\n\\n in_i = inorder[in_start:in_end + 1].index(node.val)\\n\\n node.left = self.build_tree(preorder, inorder, in_start, in_start + in_i - 1)\\n node.right = self.build_tree(preorder, inorder, in_start + in_i + 1, in_end)\\n\\n return node\\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n return self.build_tree(preorder, inorder, 0, len(inorder) - 1)\\n\",\n \"runtime\": \"81\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n root_index = 0\\n def helper(l, r):\\n if r <= l:\\n return None\\n nonlocal root_index\\n node = TreeNode(preorder[root_index])\\n partition = inorder.index(preorder[root_index])\\n root_index += 1\\n node.left = helper(l, partition)\\n node.right = helper(partition+1, r)\\n return node\\n\\n return helper(0, len(preorder))\",\n \"runtime\": \"83\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def build(preleft, preright, inleft, inright):\\n if preleft == preright:\\n return None\\n \\n root = TreeNode(preorder[preleft])\\n index = inorder.index(root.val)\\n treesize = index - inleft\\n root.left = build(preleft+1, preleft+1+treesize, inleft, index)\\n root.right = build(preleft+1+treesize, preright, index+1, inright)\\n\\n return root\\n\\n return build(0, len(preorder), 0, len(inorder))\",\n \"runtime\": \"83\"\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\\nfrom collections import deque\\nfrom itertools import takewhile\\n\\nclass Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def _build_tree(preorder_, inorder_):\\n if inorder_:\\n val = preorder_.popleft()\\n ii = inorder_.index(val)\\n return TreeNode(\\n val=val,\\n left=_build_tree(\\n preorder_=preorder_,\\n inorder_=inorder_[:ii],\\n ),\\n right=_build_tree(\\n preorder_=preorder_,\\n inorder_=inorder_[ii+1:],\\n ),\\n )\\n return _build_tree(deque(preorder), inorder)\",\n \"runtime\": \"86\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n return self.helper(preorder, inorder, 0, len(preorder), 0, len(preorder))\\n\\n def helper(self, preorder, inorder, ps, pe, ins, ine):\\n if ps >= pe or ins >= ine:\\n return None\\n root = preorder[ps]\\n idx = inorder.index(root)\\n \\n left = self.helper(preorder, inorder, ps + 1, pe - (ine - idx - 1), ins, idx)\\n right = self.helper(preorder, inorder, pe - (ine - idx - 1), pe, idx + 1, ine)\\n return TreeNode(val=root, left=left, right=right)\",\n \"runtime\": \"86\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\\"\\\"\\\"\\n preorder = [3,9,20,15,7], \\n inorder = [9,3,15,20,7]\\n \\n root.val = TreeNode(preorder[0]) # 3\\n \\n mid_idx = inorder.index(preorder[0])\\n \\n root.left = buildTree(preorder, inorder[:mid_idx]) # [9, 20, 15, 7] , [9]\\n root.left = buildTree(preorder, inorder[:mid_idx]) # [20, 15, 7] , []\\n \\n root.right = buildTree(preorder, inorder[:mid_idx]) # [20, 15, 7] , [15, 20 ,7]\\n \\\"\\\"\\\"\\n if not preorder or not inorder:\\n return\\n \\n root = TreeNode(preorder.pop(0))\\n \\n middle_idx = inorder.index(root.val)\\n root.left = self.buildTree(preorder, inorder[:middle_idx])\\n root.right = self.buildTree(preorder, inorder[middle_idx+1:])\\n \\n return root\\n \",\n \"runtime\": \"88\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n # \\n def build(preorder, pa, pb, inorder, ia, ib):\\n if pb - pa == 0:\\n return\\n print(pb, pa)\\n val = preorder[pa]\\n node = TreeNode(val)\\n i = inorder.index(val)\\n\\n node.left = build(preorder, pa+1, (i-ia)+pa+1, inorder, ia, i)\\n node.right = build(preorder, (i - ia) + pa + 1, pb, inorder, i+1, ib)\\n\\n return node\\n\\n return build(preorder, 0, len(preorder), inorder, 0, len(inorder))\\n\\n\",\n \"runtime\": \"88\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\\"\\\"\\\"\\n CLR\\n LCR\\n preorder = [3,9,20,15,7]\\n\\n inorder = [9,3,15,20,7]\\n \\\"\\\"\\\"\\n if not inorder: \\n return None\\n val = preorder.pop(0)\\n root = TreeNode(val)\\n index = inorder.index(val)\\n root.left = self.buildTree(preorder, inorder[:index])\\n root.right = self.buildTree(preorder, inorder[index+1:])\\n return root\",\n \"runtime\": \"91\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def build(preorder, inorder):\\n if inorder:\\n index = inorder.index(preorder.popleft())\\n node = TreeNode(inorder[index])\\n\\n node.left = build(preorder, inorder[:index])\\n node.right = build(preorder, inorder[index+1:])\\n return node\\n\\n preorder = deque(preorder)\\n return build(preorder, inorder)\",\n \"runtime\": \"91\"\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\\nfrom collections import deque\\nclass Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n preorder = deque(preorder)\\n\\n def build(preorder, inorder):\\n if inorder:\\n idx = inorder.index(preorder.popleft())\\n root = TreeNode(inorder[idx])\\n root.left = build(preorder, inorder[:idx])\\n root.right = build(preorder, inorder[idx+1:])\\n return root\\n \\n return build(preorder, inorder)\\n \",\n \"runtime\": \"93\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\n if not preorder or not inorder:\\n return None\\n\\n root_val = preorder.pop(0)\\n root = TreeNode(root_val)\\n\\n inorder_index = inorder.index(root_val)\\n\\n root.left = self.buildTree(preorder, inorder[:inorder_index])\\n root.right = self.buildTree(preorder, inorder[inorder_index + 1:])\\n\\n return root\",\n \"runtime\": \"93\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if preorder == [-1] and inorder == [-1]:\\n return TreeNode(-1)\\n \\n preorder = deque(preorder)\\n\\n def build(preorder, inorder):\\n if inorder:\\n idx = inorder.index(preorder.popleft())\\n root = TreeNode(inorder[idx])\\n\\n root.left = build(preorder, inorder[:idx])\\n root.right = build(preorder, inorder[idx+1:])\\n\\n return root\\n\\n return build(preorder, inorder)\",\n \"runtime\": \"96\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n root_val = preorder[0]\\n root = TreeNode(root_val)\\n mid = inorder.index(root_val)\\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])\\n return root \\n \\n \\n \",\n \"runtime\": \"96\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def build(preorder, inorder):\\n if not inorder:\\n return None\\n idx = inorder.index(preorder.pop(0))\\n node = TreeNode(inorder[idx])\\n node.left = build(preorder, inorder[:idx])\\n node.right = build(preorder, inorder[idx + 1:])\\n return node\\n root = build(preorder, inorder)\\n return root\\n \\n \\n\\n \",\n \"runtime\": \"98\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def helper(preorder,inorder):\\n if inorder:\\n idx = inorder.index(preorder.pop(0))\\n root = TreeNode(inorder[idx])\\n root.left = helper(preorder, inorder[:idx])\\n root.right = helper(preorder, inorder[idx+1:])\\n return root\\n return helper(preorder, inorder)\\n\",\n \"runtime\": \"103\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if inorder:\\n index = inorder.index(preorder.pop(0))\\n root = TreeNode(inorder[index])\\n root.left = self.buildTree(preorder, inorder[:index])\\n root.right = self.buildTree(preorder, inorder[index+1:])\\n return root\",\n \"runtime\": \"103\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not(preorder or inorder): return\\n node = TreeNode(preorder[0])\\n m = inorder.index(node.val)\\n node.left = self.buildTree(preorder[1:m + 1], inorder[:m])\\n node.right = self.buildTree(preorder[m + 1:], inorder[m + 1:])\\n return node\\n\",\n \"runtime\": \"106\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if inorder:\\n root = TreeNode(preorder.pop(0))\\n root_index = inorder.index(root.val)\\n root.left = self.buildTree(preorder, inorder[:root_index])\\n root.right = self.buildTree(preorder, inorder[root_index + 1:])\\n return root\\n\",\n \"runtime\": \"106\"\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 buildTreeHelper(self, preorder, inorder):\\n if not inorder:\\n return None\\n\\n node = preorder.pop(0)\\n index = inorder.index(node)\\n \\n binaryTree = TreeNode(node)\\n\\n binaryTree.left = self.buildTreeHelper(preorder, inorder[:index])\\n binaryTree.right = self.buildTreeHelper(preorder, inorder[index+1:])\\n\\n return binaryTree\\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n return self.buildTreeHelper(preorder, inorder)\\n\",\n \"runtime\": \"108\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n def recurse(prerder, inorder):\\n if len(inorder) == 0:\\n return None\\n\\n val = preorder.pop(0)\\n node = TreeNode(val)\\n i = inorder.index(val)\\n node.left = recurse(preorder, inorder[0:i])\\n node.right = recurse(preorder, inorder[i+1:])\\n\\n return node\\n \\n return recurse(preorder, inorder)\\n\\n\\n \",\n \"runtime\": \"108\"\n },\n {\n \"code\": \"# 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 buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:\\n # Base case: If there are no elements to construct the tree\\n if not preorder or not inorder:\\n return None\\n\\n # The first element of preorder is the root\\n root_val = preorder[0]\\n root = TreeNode(root_val)\\n\\n # Find the index of the root in inorder\\n inorder_index = inorder.index(root_val)\\n\\n # Recursively construct the left subtree\\n # Left subtree: preorder[1:1+inorder_index], inorder[:inorder_index]\\n root.left = self.buildTree(preorder[1:1+inorder_index], inorder[:inorder_index])\\n\\n # Recursively construct the right subtree\\n # Right subtree: preorder[1+inorder_index:], inorder[inorder_index+1:]\\n root.right = self.buildTree(preorder[1+inorder_index:], inorder[inorder_index+1:])\\n\\n return root\",\n \"runtime\": \"110\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n rootVal = preorder.pop(0)\\n mid = inorder.index(rootVal)\\n root = TreeNode(rootVal)\\n root.left = self.buildTree(preorder, inorder[:mid])\\n root.right = self.buildTree(preorder, inorder[mid+1:])\\n return root\",\n \"runtime\": \"110\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if(inorder):\\n root = TreeNode(preorder[0])\\n idx = inorder.index(preorder.pop(0))\\n root.left = self.buildTree(preorder,inorder[:idx])\\n root.right = self.buildTree(preorder,inorder[idx+1:])\\n return root \",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution: \\n def driver(self, preorder, inorder, preorderLocationHashmap, inorderLocationHashmap, startOffset):\\n if preorder == []:#tree empty\\n return None\\n root = TreeNode(preorder[0], None, None)\\n rootInorderLocation = inorderLocationHashmap[preorder[0]] - startOffset\\n root.left = self.driver(preorder[1:rootInorderLocation+1], inorder[:rootInorderLocation], preorderLocationHashmap, inorderLocationHashmap, startOffset)\\n root.right = self.driver(preorder[rootInorderLocation+1:], inorder[rootInorderLocation+1:], preorderLocationHashmap, inorderLocationHashmap, startOffset+rootInorderLocation+1)\\n return root\\n\\n def buildTree(self, preorder, inorder):\\n preorderLocationHashmap = {}\\n inorderLocationHashmap = {}\\n for index, orderItems in enumerate(zip(preorder, inorder)):\\n preorderItem, inorderItem = orderItems\\n preorderLocationHashmap[preorderItem] = index\\n inorderLocationHashmap[inorderItem] = index\\n return self.driver(preorder, inorder, preorderLocationHashmap, inorderLocationHashmap, 0)\",\n \"runtime\": \"113\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return None\\n root = TreeNode(preorder[0])\\n ri = inorder.index(preorder[0])\\n act_nodes = deque([(root, 0, ri, len(inorder))])\\n for v in preorder[1:]:\\n new_node = TreeNode(v)\\n par_node, par_left, par_ni, par_right = act_nodes.pop()\\n if par_left != par_ni and v in inorder[par_left:par_ni]:\\n par_node.left = new_node\\n nni = inorder.index(v, par_left, par_ni)\\n if par_ni + 1 != par_right:\\n act_nodes.append((par_node, par_ni, par_ni, par_right))\\n if nni != par_left or nni != par_ni - 1:\\n act_nodes.append((new_node, par_left, nni, par_ni))\\n elif v in inorder[par_ni+1:par_right]:\\n par_node.right = new_node\\n nni = inorder.index(v, par_ni+1, par_right)\\n if nni != par_ni+1 or nni != par_right - 1:\\n act_nodes.append((new_node, par_ni+1, nni, par_right))\\n return root\",\n \"runtime\": \"115\"\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 buildTree(self, node, val):\\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n\\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid+1:])\\n\\n\\n return root\",\n \"runtime\": \"115\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n \\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n\\n root.left = self.buildTree(preorder[1 : mid + 1], inorder[ : mid])\\n root.right = self.buildTree(preorder[mid + 1 : ], inorder[mid + 1 : ])\\n\\n return root\",\n \"runtime\": \"118\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder and not inorder: return None\\n\\n root = TreeNode(preorder[0])\\n mid_index = inorder.index(root.val)\\n root.left = self.buildTree(preorder[1:1+mid_index], inorder[:mid_index])\\n root.right = self.buildTree(preorder[1+mid_index:], inorder[mid_index+1:])\\n\\n return root\\n\",\n \"runtime\": \"118\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n root = TreeNode(val=preorder[0])\\n inorderIndex = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1:inorderIndex+1],inorder[:inorderIndex])\\n root.right = self.buildTree(preorder[inorderIndex+1:],inorder[inorderIndex+1:])\\n return root\",\n \"runtime\": \"120\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n\\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1 : mid + 1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid + 1 :], inorder[mid + 1 :])\\n return root\\n\",\n \"runtime\": \"120\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder) == 0:\\n return None\\n node = TreeNode(val=preorder[0])\\n if len(preorder) == 1:\\n return node\\n #root_index also = left tree size\\n root_index = inorder.index(preorder[0])\\n #print(preorder[1:root_index+1],inorder[0:root_index])\\n #print(preorder[root_index+1:],inorder[root_index+1:])\\n node.left = self.buildTree(preorder[1:root_index+1],inorder[0:root_index])\\n node.right = self.buildTree(preorder[1+root_index:],inorder[root_index+1:])\\n return node \\n\",\n \"runtime\": \"123\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder and not inorder:\\n return\\n \\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n\\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid + 1:])\\n\\n return root\",\n \"runtime\": \"123\"\n },\n {\n \"code\": \"class Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder) < 1:\\n return None\\n idx = inorder.index(preorder[0])\\n root = TreeNode(preorder[0])\\n root.left = self.buildTree(preorder[1 : idx + 1], inorder[:idx])\\n root.right = self.buildTree(preorder[idx + 1 :], inorder[idx + 1 :])\\n return root\",\n \"runtime\": \"125\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n\\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid + 1:])\\n return root\",\n \"runtime\": \"125\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1 : mid + 1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid + 1:])\\n\\n return root\",\n \"runtime\": \"128\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n \\n \\n def traverse(preorder,inorder):\\n\\n if not preorder or not inorder:\\n return None\\n \\n root = preorder[0]\\n node = TreeNode(root)\\n\\n #leaf node\\n if len(inorder)==1:\\n return node\\n\\n mid = inorder.index(root)\\n\\n if mid>0:\\n node.left = traverse(preorder[1:mid+1],inorder[0:mid])\\n \\n if mid<len(inorder):\\n node.right = traverse(preorder[mid+1:],inorder[mid+1:])\\n return node\\n \\n return traverse(preorder,inorder)\",\n \"runtime\": \"128\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1:mid + 1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid+1:], inorder[mid + 1:])\\n return root\\n \",\n \"runtime\": \"130\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\\"\\\"\\\"\\n preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]\\n\\n 3\\n 9 20\\n \\\"\\\"\\\"\\n\\n def build_tree(preorder, inorder):\\n\\n # todo end rec\\n if len(preorder) == 0 or len(inorder) == 0:\\n return None\\n\\n node = TreeNode(preorder[0])\\n off = inorder.index(preorder[0])\\n leftupper = off\\n node.left = build_tree(preorder[1:], inorder[:leftupper])\\n node.right = build_tree(preorder[1+off:], inorder[leftupper+1:])\\n return node\\n return build_tree(preorder, inorder)\\n\\n \",\n \"runtime\": \"130\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n\\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1:mid + 1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid + 1:])\\n return root\",\n \"runtime\": \"133\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n \\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])\\n\\n return root\",\n \"runtime\": \"133\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])\\n return root\",\n \"runtime\": \"135\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder: return None\\n\\n left_size = inorder.index(preorder[0])\\n\\n left = self.buildTree(preorder[1:1+left_size], inorder[:left_size])\\n right = self.buildTree(preorder[1+left_size:], inorder[1+left_size:])\\n\\n return TreeNode(preorder[0], left, right)\",\n \"runtime\": \"135\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return\\n root=TreeNode(preorder[0])\\n mid=inorder.index(preorder[0])\\n root.left=self.buildTree(preorder[1:mid+1],inorder[:mid])\\n root.right=self.buildTree(preorder[mid+1:],inorder[mid+1:])\\n return root\\n \",\n \"runtime\": \"138\"\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 buildTree(self, preorder: list[int], inorder: list[int]) -> TreeNode:\\n # Base case: if no elements are left in preorder or inorder, return None\\n if not preorder or not inorder:\\n return None\\n\\n # The first element in preorder is the root\\n root_val = preorder[0]\\n root = TreeNode(root_val)\\n\\n # Find the index of the root in the inorder array\\n mid = inorder.index(root_val)\\n\\n # Recursively build the left and right subtrees\\n # Left subtree: preorder[1:mid+1] (next left subtree size) and inorder[:mid] (left part of inorder)\\n # Right subtree: preorder[mid+1:] (remaining right part) and inorder[mid+1:] (right part of inorder)\\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])\\n\\n return root\\n\",\n \"runtime\": \"138\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n \\n idx = inorder.index(preorder[0])\\n root = ListNode(preorder[0])\\n \\n root.left = self.buildTree(preorder[1:idx+1],inorder[0:idx])\\n root.right = self.buildTree(preorder[idx+1:],inorder[idx+1:])\\n return root\\n \\n \",\n \"runtime\": \"140\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n\\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1:mid + 1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid+ 1:], inorder[mid+ 1:])\\n return root\\n \",\n \"runtime\": \"140\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n \\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n\\n root.left = self.buildTree(preorder[1 : mid + 1], inorder[ : mid])\\n root.right = self.buildTree(preorder[mid + 1 : ], inorder[mid + 1 :])\\n return root\\n \",\n \"runtime\": \"142\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n\\n output = TreeNode(preorder[0])\\n\\n m = inorder.index(preorder[0])\\n output.left = self.buildTree(preorder[1:m + 1], inorder[:m])\\n output.right = self.buildTree(preorder[m + 1:], inorder[m + 1:])\\n\\n return output\",\n \"runtime\": \"142\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return None\\n \\n root = TreeNode(preorder[0])\\n root_index = inorder.index(preorder[0])\\n\\n left_size = root_index # 1\\n right_size = len(inorder[root_index + 1:]) # 3\\n\\n root.left = self.buildTree(preorder[1: 1 + left_size], inorder[:root_index])\\n root.right = self.buildTree(preorder[1+left_size: 1+left_size+right_size], inorder[root_index+1:])\\n \\n return root\\n \",\n \"runtime\": \"145\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n preorder_stack = []\\n postorder_stack = []\\n \\n root_val = preorder[0]\\n in_order_root = inorder.index(root_val)\\n root = TreeNode(val=root_val)\\n root.left = self.buildTree(preorder[1:in_order_root+1], inorder[:in_order_root])\\n root.right = self.buildTree(preorder[in_order_root+1:], inorder[in_order_root+1:])\\n return root\\n\",\n \"runtime\": \"145\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n if not preorder:\\n\\n return None\\n\\n root=TreeNode(preorder[0])\\n\\n idx=inorder.index(preorder[0])\\n\\n root.left = self.buildTree(preorder[1:idx+1], inorder[:idx])\\n \\n root.right = self.buildTree(preorder[idx+1:], inorder[idx+1:])\\n \\n return root\\n \",\n \"runtime\": \"147\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder) == 0:\\n return None\\n if len(preorder) == 1:\\n return TreeNode(preorder[0])\\n\\n root_val = preorder[0]\\n left_count = inorder.index(root_val)\\n # right_count = len(preorder) - left_count - 1\\n\\n left = self.buildTree(preorder[1 : 1 + left_count], inorder[:left_count])\\n right = self.buildTree(preorder[left_count + 1 :], inorder[left_count + 1 :])\\n\\n root = TreeNode(root_val)\\n root.left = left\\n root.right = right\\n return root\",\n \"runtime\": \"147\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\\"\\\"\\\"\\n 确实需要通过inorder.index(val)获得left_part, right_part\\n 注意：preorder也需要分为leftm right两个部分\\n \\\"\\\"\\\"\\n if not preorder or not inorder:\\n return None\\n \\n val = preorder[0]\\n node = TreeNode(val)\\n\\n idx = inorder.index(val)\\n left_inorder = inorder[0: idx]\\n right_inorder = inorder[idx+1:]\\n left_preorder = preorder[1: 1+len(left_inorder)]\\n right_preorder = preorder[len(left_inorder)+1: ]\\n\\n node.left = self.buildTree(left_preorder, left_inorder)\\n node.right = self.buildTree(right_preorder, right_inorder)\\n return node\\n\\n \",\n \"runtime\": \"150\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return None\\n \\n root = TreeNode(preorder[0])\\n i = inorder.index(preorder[0])\\n \\n # Build the left subtree\\n root.left = self.buildTree(preorder[1:i+1], inorder[:i])\\n\\n # Build the right subtree\\n root.right = self.buildTree(preorder[i+1:], inorder[i+1:])\\n\\n return root\\n\\n\",\n \"runtime\": \"150\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n root_value = preorder[0]\\n root = TreeNode(root_value)\\n root_index = inorder.index(root_value)\\n left_inorder = inorder[:root_index]\\n right_inorder = inorder[root_index+1:]\\n\\n left_preorder = preorder[1:len(left_inorder)+1]\\n right_preorder = preorder[len(left_inorder)+1:]\\n root.left = self.buildTree(left_preorder, left_inorder)\\n root.right = self.buildTree(right_preorder, right_inorder)\\n\\n return root\\n \",\n \"runtime\": \"152\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n mid=inorder.index(preorder[0])\\n return TreeNode(preorder[0], self.buildTree(preorder[1:mid+1],inorder[:mid]), self.buildTree(preorder[mid+1:],inorder[mid+1:]))\\n \\n\",\n \"runtime\": \"152\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n # Base case: If either list is empty, return None\\n if not preorder or not inorder:\\n return None\\n \\n # The first element of preorder is the root of the tree\\n root_val = preorder[0]\\n root = TreeNode(root_val)\\n \\n # Find the index of the root in inorder list\\n root_index = inorder.index(root_val)\\n \\n # Everything left of root_index in inorder is the left subtree\\n # Everything right of root_index in inorder is the right subtree\\n left_inorder = inorder[:root_index]\\n right_inorder = inorder[root_index + 1:]\\n \\n # Length of left subtree will help to find corresponding elements in preorder\\n left_preorder = preorder[1:len(left_inorder) + 1]\\n right_preorder = preorder[len(left_inorder) + 1:]\\n \\n # Recursively build left and right subtrees\\n root.left = self.buildTree(left_preorder, left_inorder)\\n root.right = self.buildTree(right_preorder, right_inorder)\\n \\n return root\\n \",\n \"runtime\": \"155\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if preorder is None:\\n return None\\n ctr = 0\\n def buildUtil(preorder, inorder, l, r):\\n nonlocal ctr\\n if l>r or r<l:\\n return None\\n \\n node = TreeNode(preorder[ctr])\\n idx = self.find(preorder[ctr], inorder)\\n ctr+=1\\n node.left = buildUtil(preorder, inorder, l, idx-1)\\n node.right = buildUtil(preorder, inorder, idx+1, r)\\n return node\\n \\n return buildUtil(preorder, inorder, 0, len(preorder)-1)\\n\\n def find(self, val, inorder):\\n for i,n in enumerate(inorder):\\n if n == val:\\n return i\\n\\n return 0\\n\\n\\n \",\n \"runtime\": \"155\"\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\\\"\\\"\\\"\\ninorder -> L, N, R\\npreorder = N, L, R\\nso first element (say M) in preorder is root. In Inorder all nodes in left subtree of M are in location 0 to M-1 in inorder list and right subtree in M+1 to length.\\n\\nWe can divide the inorder and preorder based on this and call them recursively.\\n\\nroot: 3\\n 0, 1, 2, 3, 4\\npreorder = [3,9,20,15,7]\\ninorder = [9,3,15,20,7]\\n\\n\\nroot: left\\npreorder = [9]\\ninorder = [9]\\n\\nroot: right\\npreorder = [20,15,7]\\ninorder = [15,20,7]\\n\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n rootVal = preorder[0]\\n root = TreeNode(rootVal)\\n subTreeLen = len(preorder)\\n for i in range(subTreeLen):\\n if inorder[i] == rootVal:\\n leftSubtreeLen = i\\n root.left = self.buildTree(preorder[1:1+i], inorder[0:i])\\n\\n # rightSubtreeLen = subTreelen - i + 1\\n root.right = self.buildTree(preorder[1+i:subTreeLen+1], inorder[i+1:subTreeLen+1])\\n break\\n return root\\n \",\n \"runtime\": \"157\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n return self.helper(preorder, inorder)\\n\\n def helper(self, preorder, inorder):\\n if not preorder or not inorder:\\n return None\\n root = preorder[0]\\n idx = inorder.index(root)\\n \\n inorder_left = inorder[:idx]\\n inorder_right = inorder[idx + 1:]\\n preorder_left = preorder[1:idx + 1]\\n preorder_right = preorder[idx + 1:]\\n\\n left = self.helper(preorder_left, inorder_left)\\n right = self.helper(preorder_right, inorder_right)\\n return TreeNode(val=root, left=left, right=right)\",\n \"runtime\": \"157\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return \\n root=TreeNode()\\n root.val=preorder.pop(0)\\n idx=inorder.index(root.val)\\n inorder_left=inorder[:idx]\\n inorder_right=inorder[idx+1:]\\n preorder_left=preorder[:len(inorder_left)]\\n preorder_right=preorder[len(inorder_left):]\\n root.left=self.buildTree(preorder_left,inorder_left)\\n root.right=self.buildTree(preorder_right,inorder_right)\\n return root\\n \\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"160\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n root = TreeNode(preorder[0])\\n inorder_idx = inorder.index(preorder[0])\\n index = inorder.index(preorder[0])\\n \\n root.left = self.buildTree(preorder[1:inorder_idx+1], inorder[:inorder_idx])\\n root.right = self.buildTree(preorder[inorder_idx+1:], inorder[inorder_idx+1:])\\n\\n return root\",\n \"runtime\": \"160\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\n def traverse(preorder,inorder):\\n if not preorder:\\n return None\\n if not inorder:\\n return None\\n root = preorder[0]\\n node = TreeNode(root)\\n if len(inorder)==1:\\n # print(f\\\"leaf node:{node.val}\\\")\\n return node\\n mid = 0\\n for i in range(len(inorder)):\\n if inorder[i]==root:\\n mid = i\\n \\n # print(f\\\"root:{root}\\\")\\n # print(f\\\"mid:{mid}, inorder:{inorder}\\\")\\n inorderlen = len(inorder)\\n\\n \\n \\n\\n if mid>0:\\n # print(f\\\"left root:{preorder[1:mid+1]},inorder:{inorder[0:mid]}\\\")\\n node.left = traverse(preorder[1:mid+1],inorder[0:mid])\\n # preorder.pop(0)\\n if mid<len(inorder):\\n # print(f\\\"right root:{preorder[mid+1:]},inorder:{inorder[mid+1:inorderlen]}\\\")\\n node.right = traverse(preorder[mid+1:],inorder[mid+1:inorderlen])\\n return node\\n \\n return traverse(preorder,inorder)\",\n \"runtime\": \"162\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n #first node in preorder is root\\n #left of root node in inorder is left subtree, right of root node in inorder is right subtree\\n #using found_root in inorder: \\n #u get the left subtree by starting from the element to the right and going up to the index found in inorder\\n\\n if not preorder:\\n return None\\n root = TreeNode(preorder[0])\\n root_index = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1:root_index+1], inorder[:root_index])\\n root.right = self.buildTree(preorder[root_index+1:], inorder[root_index+1:])\\n return root\",\n \"runtime\": \"162\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder) == 0:\\n return None\\n \\n root = TreeNode(preorder[0])\\n left_subtree_count = inorder.index(preorder[0])\\n if left_subtree_count > 0:\\n root.left = self.buildTree(preorder[1:1 + left_subtree_count], inorder[:left_subtree_count])\\n else:\\n root.left = None\\n\\n right_subtree_count = len(inorder) - 1 - inorder.index(preorder[0])\\n if right_subtree_count > 0:\\n root.right = self.buildTree(preorder[1 + left_subtree_count:], inorder[left_subtree_count + 1:])\\n else:\\n root.right = None\\n\\n return root\\n\",\n \"runtime\": \"165\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not preorder:\\n return\\n root = TreeNode(preorder.pop(0))\\n index = 0\\n for i in range(len(inorder)):\\n if inorder[i]==root.val:\\n index = i\\n root.left = self.buildTree(preorder,inorder[:index])\\n root.right = self.buildTree(preorder,inorder[index+1:])\\n return root\\n \\n \\n\\n\\n \\n\\n\\n \",\n \"runtime\": \"165\"\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 buildTree(self, preorder, inorder):\\n # Base case: if there are no elements to construct the tree\\n if not preorder or not inorder:\\n return None\\n \\n # The first element in preorder is the root of the current tree\\n root_val = preorder[0]\\n root = TreeNode(root_val)\\n \\n # Find the index of the root in inorder\\n root_index_in_inorder = inorder.index(root_val)\\n \\n # Elements to the left of the root in inorder form the left subtree\\n left_inorder = inorder[:root_index_in_inorder]\\n # Elements to the right of the root in inorder form the right subtree\\n right_inorder = inorder[root_index_in_inorder + 1:]\\n \\n # Corresponding preorder sublists for left and right subtrees\\n left_preorder = preorder[1:1 + len(left_inorder)]\\n right_preorder = preorder[1 + len(left_inorder):]\\n \\n # Recursively construct the left and right subtrees\\n root.left = self.buildTree(left_preorder, left_inorder)\\n root.right = self.buildTree(right_preorder, right_inorder)\\n \\n return root\\n \",\n \"runtime\": \"167\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n p = 0\\n\\n def build_tree(preorder, inorder):\\n nonlocal p\\n N = len(inorder)\\n\\n if N<1:\\n return None\\n\\n cur, p = preorder[p], p+1\\n root = TreeNode(cur)\\n k = 0\\n for k in range(N):\\n if inorder[k]==cur:\\n break\\n\\n if k>=0:\\n root.left = build_tree(preorder, inorder[:k])\\n\\n if N > k:\\n root.right = build_tree(preorder, inorder[(k+1):])\\n \\n return root\\n\\n root = build_tree(preorder, inorder)\\n return root\\n \",\n \"runtime\": \"167\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not preorder:\\n return None\\n root = TreeNode(preorder[0])\\n idx = inorder.index(root.val)\\n left_inorder = inorder[:idx]\\n right_inorder = inorder[idx+1:]\\n left_preorder = preorder[1:len(left_inorder)+1]\\n right_preorder = preorder[len(left_inorder)+1:]\\n root.left = self.buildTree(left_preorder, left_inorder)\\n root.right = self.buildTree(right_preorder, right_inorder)\\n return root\",\n \"runtime\": \"170\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n if len(inorder) == 0:\\n return None\\n\\n root = preorder.pop(0)\\n\\n node = TreeNode(root)\\n\\n for i in range(len(inorder)):\\n if inorder[i] == root:\\n break\\n\\n node.left = self.buildTree(preorder, inorder[0:i])\\n if i + 1 < len(inorder):\\n node.right = self.buildTree(preorder, inorder[i + 1:])\\n else:\\n node.right = None\\n\\n return node\",\n \"runtime\": \"170\"\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 helper(self, i,inOrdS, inOrdE, preorder, inorder):\\n\\n if i>=len(preorder) or inOrdS>=inOrdE:\\n return None\\n\\n r = TreeNode(preorder[i])\\n\\n # print(preorder[i], inOrdS, inOrdE)\\n \\n inOrdM = inOrdS\\n while(inOrdM<inOrdE and inorder[inOrdM]!=r.val):\\n inOrdM+=1\\n\\n r.left = self.helper(i+1, inOrdS,inOrdM, preorder, inorder)\\n r.right = self.helper(i+1+(inOrdM-inOrdS), inOrdM+1,inOrdE, preorder, inorder)\\n\\n return r\\n \\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n return self.helper(0,0,len(inorder), preorder, inorder)\",\n \"runtime\": \"172\"\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 pp = []\\n def help(self, inorder, inorderd, l, r):\\n if l >= r or r <= 0 or l >= len(inorder):\\n return None\\n if r-l == 1:\\n self.pp.remove(inorder[l])\\n return TreeNode(inorder[l], None, None)\\n root = None\\n s = set(inorder[l:r])\\n for p in self.pp:\\n if p in s:\\n root = TreeNode(p, None, None)\\n self.pp.remove(p)\\n break\\n ind = inorderd[p]\\n root.left = self.help(inorder, inorderd, l, ind)\\n root.right = self.help(inorder, inorderd, ind+1, r)\\n return root\\n \\n \\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n inorderd = {}\\n self.pp = preorder[::]\\n for i in range(len(inorder)):\\n n = inorder[i]\\n inorderd[n] = i\\n root = TreeNode(preorder[0], None, None)\\n self.pp.remove(preorder[0])\\n root.left = self.help(inorder, inorderd, 0, inorderd[root.val])\\n root.right = self.help(inorder, inorderd, inorderd[root.val]+1, len(inorder))\\n return root\\n\\n\\n \",\n \"runtime\": \"172\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n pre_ind = 0\\n def find(in_start, in_end):\\n nonlocal pre_ind\\n if in_start == in_end:\\n return None\\n\\n for i in range(in_start, in_end):\\n if inorder[i] == preorder[pre_ind]:\\n this_node = TreeNode(val = inorder[i])\\n pre_ind += 1\\n this_node.left = find(in_start,i)\\n this_node.right = find(i+1,in_end)\\n return this_node\\n\\n return find(0,len(inorder))\",\n \"runtime\": \"174\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n return self.helper(preorder, inorder, 0, len(preorder) - 1, 0, len(inorder) - 1)\\n \\n def helper(self, preorder: List[int], inorder: List[int], pl: int, pr: int, il: int, ir: int) -> Optional[TreeNode]:\\n if pl > pr or il > ir or pl < 0 or il < 0 or pr >= len(preorder) or ir >= len(inorder):\\n return None\\n cur = TreeNode(preorder[pl])\\n i = il\\n while i <= ir:\\n if inorder[i] == preorder[pl]:\\n break\\n i += 1\\n \\n left = self.helper(preorder, inorder, pl + 1, pl + i - il, il, i - 1)\\n right = self.helper(preorder, inorder, pl + i - il + 1, pr, i + 1, ir)\\n cur.left = left\\n cur.right = right\\n return cur\\n \",\n \"runtime\": \"174\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder) <= 0:\\n return\\n \\n root = preorder[0]\\n i = 0\\n \\n while inorder[i] != root:\\n i += 1\\n \\n l_subtree_sz = i\\n \\n root = TreeNode(root)\\n if len(inorder) > 1:\\n root.left = self.buildTree(preorder[1:l_subtree_sz + 1], inorder[0:l_subtree_sz])\\n root.right = self.buildTree(preorder[l_subtree_sz + 1::], inorder[l_subtree_sz + 1::])\\n \\n return root\\n \\n \",\n \"runtime\": \"182\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n root = TreeNode(preorder[0])\\n # Find # of values in left and right subtrees\\n if (len(preorder) == len(inorder) == 1):\\n return root\\n leftIn = inorder[:inorder.index(preorder[0])]\\n rightIn = inorder[inorder.index(preorder[0]) + 1:]\\n\\n leftPre = preorder[1 : len(leftIn) + 1]\\n rightPre = preorder[len(leftIn) + 1:]\\n \\n if len(leftPre) > 0:\\n root.left = self.buildTree(leftPre, leftIn)\\n if len(rightPre) > 0:\\n root.right = self.buildTree(rightPre, rightIn)\\n return root\",\n \"runtime\": \"182\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n # 如果参数是空列表，则返回空节点\\n if not preorder:\\n return None\\n # 获得根节点的值\\n root = preorder[0]\\n # 获得根节点的左右孩子的前/中序遍历结果\\n root_index = 0\\n for i in range(len(inorder)):\\n if inorder[i] == root:\\n root_index = i\\n break\\n left_child_inorder = inorder[0: root_index]\\n left_child_preorder = preorder[1: root_index + 1]\\n right_child_inorder = inorder[root_index + 1:]\\n right_child_preorder = preorder[root_index + 1:]\\n # 构建并返回根节点\\n return TreeNode(\\n val=root, \\n left=self.buildTree(preorder=left_child_preorder, inorder=left_child_inorder),\\n right=self.buildTree(preorder=right_child_preorder, inorder=right_child_inorder),\\n )\",\n \"runtime\": \"184\"\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 cur_idx = 0\\n\\n def build(self, preorder, inorder) -> TreeNode:\\n if(len(inorder) == 0):\\n return None\\n\\n root = preorder[self.cur_idx]\\n self.cur_idx += 1\\n\\n if(len(inorder) == 1):\\n return TreeNode(val=inorder[0])\\n \\n m = None\\n for idx, val in enumerate(inorder):\\n if(val == root):\\n m = idx\\n break\\n \\n left = self.build(preorder, inorder[0:m])\\n right = self.build(preorder, inorder[m+1:])\\n\\n return TreeNode(val=root, left=left, right=right)\\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n return self.build(preorder, inorder)\",\n \"runtime\": \"184\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n if not preorder or not inorder:\\n return None\\n root = TreeNode(preorder[0])\\n\\n # find root index in inorder\\n idx = 0\\n for i in range(len(inorder)):\\n if root.val == inorder[i]:\\n idx = i\\n \\n root.left = self.buildTree(preorder[1:1+idx], inorder[:idx])\\n root.right = self.buildTree(preorder[idx+1:], inorder[idx+1:])\\n\\n return root\",\n \"runtime\": \"187\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not preorder:\\n return None\\n\\n tree_root = preorder[0]\\n root = TreeNode(tree_root)\\n for i in range(len(inorder)):\\n index = 0\\n if tree_root == inorder[i]:\\n index = i\\n break\\n root.left = self.buildTree(preorder[1:1 + index], inorder[:index])\\n root.right = self.buildTree(preorder[1 + index :], inorder[index + 1:])\\n \\n return root\",\n \"runtime\": \"187\"\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 findrootIndex(self, inorder, val):\\n for i in range(len(inorder)):\\n if inorder[i] == val:\\n return i\\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n if len(preorder) == 0 or len (inorder) == 0:\\n return None\\n\\n root = TreeNode(preorder[0])\\n index = self.findrootIndex(inorder, root.val)\\n root.left = self.buildTree(preorder[1:1+index], inorder[: index])\\n root.right = self.buildTree(preorder[1+index:], inorder[index+1:])\\n return root\\n \\n \",\n \"runtime\": \"189\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n root = TreeNode(preorder[0])\\n\\n preorder.pop(0)\\n\\n for i in range(len(inorder)):\\n if inorder[i] == root.val:\\n left = inorder[:i]\\n right = inorder[i+1:]\\n break\\n \\n if left:\\n root.left = self.buildTree(preorder, left)\\n if right: \\n root.right = self.buildTree(preorder, right)\\n \\n return root\",\n \"runtime\": \"189\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\n def traverse(preorder,inorder):\\n if not preorder or not inorder:\\n return None\\n root = preorder[0]\\n\\n node = TreeNode(root)\\n\\n #leaf node\\n if len(inorder)==1:\\n return node\\n\\n mid = 0\\n for i in range(len(inorder)):\\n if inorder[i]==root:\\n mid = i\\n break\\n \\n\\n if mid>0:\\n # print(f\\\"left root:{preorder[1:mid+1]},inorder:{inorder[0:mid]}\\\")\\n node.left = traverse(preorder[1:mid+1],inorder[0:mid])\\n \\n if mid<len(inorder):\\n # print(f\\\"right root:{preorder[mid+1:]},inorder:{inorder[mid+1:inorderlen]}\\\")\\n node.right = traverse(preorder[mid+1:],inorder[mid+1:])\\n return node\\n \\n return traverse(preorder,inorder)\",\n \"runtime\": \"192\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\n def traverse(preorder,inorder):\\n if not preorder:\\n return None\\n if not inorder:\\n return None\\n root = preorder[0]\\n node = TreeNode(root)\\n if len(inorder)==1:\\n # print(f\\\"leaf node:{node.val}\\\")\\n return node\\n mid = 0\\n for i in range(len(inorder)):\\n if inorder[i]==root:\\n mid = i\\n \\n # print(f\\\"root:{root}\\\")\\n # print(f\\\"mid:{mid}, inorder:{inorder}\\\")\\n inorderlen = len(inorder)\\n\\n \\n \\n\\n if mid>0:\\n # print(f\\\"left root:{preorder[1:mid+1]},inorder:{inorder[0:mid]}\\\")\\n node.left = traverse(preorder[1:mid+1],inorder[0:mid])\\n # preorder.pop(0)\\n if mid<len(inorder):\\n # print(f\\\"right root:{preorder[mid+1:]},inorder:{inorder[mid+1:inorderlen]}\\\")\\n node.right = traverse(preorder[mid+1:],inorder[mid+1:inorderlen])\\n return node\\n \\n return traverse(preorder,inorder)\",\n \"runtime\": \"192\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n assert(len(preorder) == len(inorder))\\n if len(preorder) == 0:\\n return None\\n val = preorder[0]\\n root = TreeNode(val)\\n root_i = 0\\n for i in range(len(inorder)):\\n if inorder[i] == val:\\n root_i = i\\n break\\n left_pre = preorder[1:root_i + 1]\\n right_pre = preorder[root_i + 1:]\\n left_in = inorder[:root_i]\\n right_in = inorder[root_i + 1:]\\n root.left = self.buildTree(left_pre, left_in)\\n root.right = self.buildTree(right_pre, right_in)\\n\\n return root\",\n \"runtime\": \"194\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def helper(pre_start, pre_end, in_start, in_end):\\n if pre_start > pre_end:\\n return None\\n if pre_start == pre_end:\\n return TreeNode(preorder[pre_start])\\n root = TreeNode(preorder[pre_start])\\n cnt = 0\\n while inorder[in_start+cnt] != root.val:\\n cnt += 1\\n root.left = helper(pre_start+1, pre_start+cnt, in_start, in_start+cnt-1)\\n root.right = helper(pre_start+cnt+1, pre_end, in_start+cnt+1, in_end)\\n return root\\n return helper(0, len(preorder)-1, 0, len(inorder)-1)\\n \",\n \"runtime\": \"194\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n\\n node = TreeNode(preorder[0])\\n \\n idx = None\\n for i in range(len(inorder)):\\n if inorder[i] == preorder[0]:\\n idx = i\\n \\n node.left = self.buildTree(preorder[1:idx+1], inorder[:idx])\\n node.right = self.buildTree(preorder[idx+1:], inorder[idx+1:])\\n\\n return node\",\n \"runtime\": \"197\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder) == 0:\\n return None\\n elif len(preorder) == 1:\\n return TreeNode(preorder[0])\\n\\n root = TreeNode(preorder[0])\\n i = 0\\n while inorder[i] != root.val:\\n i += 1\\n left = self.buildTree(preorder[1:i + 1], inorder[:i])\\n right = self.buildTree(preorder[i + 1:], inorder[i + 1:])\\n root.left = left\\n root.right = right\\n return root\\n \",\n \"runtime\": \"197\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n i = 0\\n while preorder[0] != inorder[i]:\\n i += 1\\n \\n root = TreeNode(preorder[0])\\n root.left = self.buildTree(preorder[1:i+1], inorder[0:i])\\n root.right = self.buildTree(preorder[i+1:], inorder[i+1:])\\n return root\\n\",\n \"runtime\": \"199\"\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 buildTree(self, prd: List[int], ind: List[int]) -> Optional[TreeNode]:\\n\\n return self.tree(prd, ind)\\n\\n def tree(self, prd, ind):\\n if not ind:\\n return None\\n \\n r = prd[0]\\n\\n ri = 0\\n for ri in range(len(ind)):\\n if ind[ri]==r:\\n break\\n \\n lind = ind[:ri]\\n ls= len(lind)\\n\\n rind = ind[ri+1:]\\n rn = len(rind)\\n\\n lprd = prd[1:ls+1]\\n rprd = prd[ls+1:ls+1+rn]\\n root = TreeNode(r)\\n\\n if lind:\\n ll = self.tree(lprd, lind)\\n root.left = ll\\n if rind:\\n rr = self.tree(rprd, rind)\\n root.right = rr\\n return root\\n \\n \",\n \"runtime\": \"199\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n p=preorder\\n i=inorder\\n if len(p)==0:\\n return None\\n if len(p)==1:\\n g=TreeNode(p[0])\\n return g\\n if i[0]==p[0]:\\n l1=preorder[1:]\\n l2=inorder[1:]\\n root=TreeNode(p[0])\\n root.left=None\\n root.right=self.buildTree(l1,l2)\\n return root\\n s=0\\n while i[s]!=p[0]:\\n s=s+1\\n l1=i[:s]\\n l2=p[1:s+1]\\n lefttree=self.buildTree(l2,l1)\\n r1=i[s+1:]\\n r2=p[s+1:]\\n righttree=self.buildTree(r2,r1)\\n root=TreeNode(p[0])\\n root.left=lefttree\\n root.right=righttree\\n return root\\n\\n \",\n \"runtime\": \"202\"\n },\n {\n \"code\": \"class Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return None\\n root = TreeNode(preorder[0])\\n for i, val in enumerate(inorder):\\n if val == root.val:\\n break\\n inorder_left = inorder[:i]\\n inorder_right = inorder[i+1:]\\n preorder_left = preorder[1:1+i]\\n preorder_right =preorder[i+1:]\\n root.left = self.buildTree(preorder_left, inorder_left)\\n root.right = self.buildTree(preorder_right, inorder_right)\\n return root\\n\",\n \"runtime\": \"202\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def dfs(pre, post):\\n if len(pre) == 0 or len(post) == 0:\\n return None\\n \\n curNode = TreeNode(pre[0])\\n postIndex = -1\\n for i in range(len(post)):\\n if post[i] == curNode.val:\\n postIndex = i\\n break\\n\\n curNode.left = dfs(pre[1:1+postIndex], post[:postIndex])\\n curNode.right = dfs(pre[1+postIndex:], post[postIndex+1:])\\n return curNode\\n return dfs(preorder, inorder)\",\n \"runtime\": \"204\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n i = 0\\n while preorder[0] != inorder[i]:\\n i += 1\\n \\n root = TreeNode(preorder[0])\\n root.left = self.buildTree(preorder[1:i+1], inorder[0:i])\\n root.right = self.buildTree(preorder[i+1:], inorder[i+1:])\\n return root\\n\",\n \"runtime\": \"204\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not preorder:\\n return None\\n\\n root = TreeNode(preorder[0])\\n for i in range(len(inorder)):\\n index = 0\\n if preorder[0] == inorder[i]:\\n index = i\\n break\\n root.left = self.buildTree(preorder[1:1 + index], inorder[:index])\\n root.right = self.buildTree(preorder[1 + index :], inorder[index + 1:])\\n \\n return root\",\n \"runtime\": \"206\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not preorder:\\n return None\\n\\n root = TreeNode(preorder[0])\\n for i in range(len(inorder)):\\n index = 0\\n if preorder[0] == inorder[i]:\\n index = i\\n break\\n root.left = self.buildTree(preorder[1:1 + index], inorder[:index])\\n root.right = self.buildTree(preorder[1 + index :], inorder[index + 1:])\\n \\n return root\",\n \"runtime\": \"206\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder) == 0:\\n return None\\n root = TreeNode()\\n root.val = preorder[0]\\n\\n if len(inorder) == 0:\\n return None\\n i = 0\\n while inorder[i] != preorder[0]:\\n i += 1\\n root.left = self.buildTree(preorder[1:], inorder[:i])\\n root.right = self.buildTree(preorder[i + 1:], inorder[i + 1:])\\n return root\\n\",\n \"runtime\": \"209\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return None\\n idx = -1\\n for i, val in enumerate(inorder):\\n if val == preorder[0]:\\n idx = i\\n break\\n # print(idx)\\n in_left = inorder[:idx]\\n in_right = inorder[idx+1:]\\n len_left = len(in_left)\\n len_right = len(in_right)\\n pr_left = preorder[1:len_left+1]\\n pr_right = preorder[len_left+1:]\\n\\n # print(pr_left, in_left, pr_right, in_right)\\n\\n left = self.buildTree(pr_left, in_left)\\n right = self.buildTree(pr_right, in_right)\\n\\n return TreeNode(preorder[0], left, right)\",\n \"runtime\": \"209\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\\"\\\"\\\"\\n Return the root of a binary tree\\n Args:\\n preorder (list(int)): \\n inorder (list(int)):\\n\\n \\\"\\\"\\\"\\n # preorder[0] = root\\n # everything before root in inorder is the left part of the tree, and therefore we can cut both list based on that\\n if len(preorder) == 0:\\n return None\\n root_val = preorder[0]\\n idx=0\\n for i in inorder:\\n if i == root_val:\\n break\\n idx+=1\\n # Here, inorder[idx] == root_val\\n left_inorder = inorder[:idx] \\n right_inorder = inorder[idx+1:]\\n left_preorder = preorder[1:idx+1]\\n right_preorder = preorder[idx+1:]\\n left_tree = self.buildTree(left_preorder, left_inorder)\\n right_tree = self.buildTree(right_preorder, right_inorder)\\n return TreeNode(root_val, left_tree, right_tree)\\n\",\n \"runtime\": \"211\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder) == 0:\\n return\\n root = TreeNode(preorder[0])\\n for ind,val in enumerate(inorder):\\n if val == root.val:\\n break\\n left_inorder,right_inorder = inorder[:ind],inorder[ind+1:]\\n del preorder[0]\\n left_preorder,right_preorder = preorder[:len(left_inorder)],preorder[len(left_inorder):]\\n del inorder[ind]\\n root.left = self.buildTree(left_preorder,left_inorder)\\n root.right = self.buildTree(right_preorder,right_inorder)\\n\\n return root\\n\\n\\n \\n\\n\",\n \"runtime\": \"211\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n p=preorder\\n i=inorder\\n if len(p)==0:\\n return None\\n if len(p)==1:\\n g=TreeNode(p[0])\\n return g\\n if i[0]==p[0]:\\n l1=preorder[1:]\\n l2=inorder[1:]\\n root=TreeNode(p[0])\\n root.left=None\\n root.right=self.buildTree(l1,l2)\\n return root\\n s=0\\n while i[s]!=p[0]:\\n s=s+1\\n l1=i[:s]\\n l2=p[1:s+1]\\n lefttree=self.buildTree(l2,l1)\\n r1=i[s+1:]\\n r2=p[s+1:]\\n righttree=self.buildTree(r2,r1)\\n root=TreeNode(p[0])\\n root.left=lefttree\\n root.right=righttree\\n return root\\n\\n \",\n \"runtime\": \"214\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not preorder:\\n return None\\n\\n root = TreeNode(preorder[0])\\n for i in range(len(inorder)):\\n index = 0\\n if preorder[0] == inorder[i]:\\n index = i\\n break\\n root.left = self.buildTree(preorder[1:1 + index], inorder[:index])\\n root.right = self.buildTree(preorder[1 + index :], inorder[index + 1:])\\n \\n return root\",\n \"runtime\": \"214\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n ri,left,right=0,0,0\\n if len(preorder)==0:\\n return None\\n\\n root = TreeNode(preorder[0])\\n index = 0\\n \\n for i in range(len(inorder)):\\n if inorder[i]==root.val:\\n index=i\\n break\\n \\n leftInOrder = inorder[:index]\\n rightInOrder = inorder[index+1:]\\n\\n leftPreOrder=preorder[1:len(leftInOrder)+1]\\n rightPreOrder=preorder[len(leftInOrder)+1:]\\n\\n root.left=self.buildTree(leftPreOrder,leftInOrder)\\n root.right=self.buildTree(rightPreOrder,rightInOrder)\\n \\n return root\\n\",\n \"runtime\": \"216\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder) == 0 or len(inorder) == 0:\\n return None\\n elif len(inorder) == 1:\\n return TreeNode(inorder[0])\\n elif len(preorder) == 1:\\n return TreeNode(preorder[0])\\n root = TreeNode(preorder[0])\\n index = self.getIndexOfItem(preorder[0], inorder)\\n if index == -1:\\n return None\\n lengthLeft = len(inorder[:index + 1])\\n root.left = self.buildTree(preorder[1:lengthLeft], inorder[:index])\\n root.right = self.buildTree(preorder[lengthLeft:], inorder[lengthLeft:])\\n return root\\n\\n def getIndexOfItem(self, item, lst):\\n for index, k in enumerate(lst):\\n if k == item:\\n return index\\n\\n return -1 \\n \",\n \"runtime\": \"216\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\n \\n def build(preorder, inorder):\\n #print(preorder, inorder)\\n if not inorder:\\n return None\\n \\n if len(preorder)==1:\\n return TreeNode(preorder[0])\\n \\n root = preorder[0]\\n index = None\\n \\n for i,v in enumerate(inorder):\\n if v==root:\\n index=i\\n break\\n #print(index) \\n root_node =TreeNode(root)\\n root_node.left = build(preorder[1:index+1], inorder[:index])\\n root_node.right = build(preorder[index+1:], inorder[index+1:])\\n \\n return root_node\\n \\n \\n return build(preorder, inorder)\",\n \"runtime\": \"219\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\\"\\\"\\\"\\n Return the root of a binary tree\\n Args:\\n preorder (list(int)): \\n inorder (list(int)):\\n\\n \\\"\\\"\\\"\\n # preorder[0] = root\\n # everything before root in inorder is the left part of the tree, and therefore we can cut both list based on that\\n if len(preorder) == 0:\\n return None\\n root_val = preorder[0]\\n idx=0\\n for i in inorder:\\n if i == root_val:\\n break\\n idx+=1\\n # Here, inorder[idx] == root_val\\n left_inorder = inorder[:idx] \\n right_inorder = inorder[idx+1:]\\n left_preorder = preorder[1:idx+1]\\n right_preorder = preorder[idx+1:]\\n left_tree = self.buildTree(left_preorder, left_inorder)\\n right_tree = self.buildTree(right_preorder, right_inorder)\\n return TreeNode(root_val, left_tree, right_tree)\\n\",\n \"runtime\": \"219\"\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\\ndef find_idx(l: Sequence[int], val: int) -> int:\\n for (i, val2) in enumerate(l):\\n if val == val2:\\n return i\\n raise ValueError(f\\\"{val=} not found in {l=}\\\")\\n\\nclass Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n assert len(preorder) == len(inorder), f\\\"different lengths for lists ({len(preorder)=} vs {len(inorder)=}): {preorder=} {inorder=}\\\"\\n if not preorder:\\n return None\\n\\n root_val = preorder[0]\\n root_idx = find_idx(inorder, val=root_val)\\n left_preorder = preorder[1:root_idx + 1]\\n left_inorder = inorder[:root_idx]\\n right_preorder = preorder[root_idx + 1:]\\n right_inorder = inorder[root_idx + 1:]\\n\\n left_node = self.buildTree(preorder=left_preorder, inorder=left_inorder)\\n right_node = self.buildTree(preorder=right_preorder, inorder=right_inorder)\\n return TreeNode(val=root_val, left=left_node, right=right_node)\",\n \"runtime\": \"221\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not preorder:\\n return None\\n\\n newNode = TreeNode(val = preorder[0])\\n\\n newNode.left = self.buildTree(preorder[1:inorder.index(newNode.val) + 1],inorder[:inorder.index(newNode.val)])\\n newNode.right = self.buildTree(preorder[inorder.index(newNode.val) + 1:],inorder[inorder.index(newNode.val)+1:])\\n \\n return newNode\\n\\n \",\n \"runtime\": \"221\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":153,"string":"153"},"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n rootindex=inorder.index(preorder[0])\n inordermap = {val: idx for idx, val in enumerate(inorder)}\n rootnode=TreeNode(preorder[0])\n root=rootnode\n for i in range(1,len(preorder)):\n newnode=TreeNode(preorder[i])\n # print(preorder[i],root,rootnode)\n while True:\n # print(rootnode,inorder.index(preorder[i]),inorder.index(rootnode.val))\n if rootnode!=None and inordermap[preorder[i]]<inordermap[rootnode.val]:\n # print(\"inside less\")\n if rootnode.left==None:\n rootnode.left=newnode\n break\n else:\n rootnode=rootnode.left\n else:\n # print(\"insisde great\")\n if rootnode.right==None:\n rootnode.right=newnode\n break\n else:\n rootnode=rootnode.right\n rootnode=root\n return root\n\n\n\n ","memory":"17546"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n debug = False\n i, j = 0, 0\n root = TreeNode(preorder[0])\n stack = [root]\n \n while i < len(preorder):\n \n if debug: print(f'P0 i: {i} j:{j} stack: {stack}')\n while stack[-1].val != inorder[j]:\n i += 1\n stack[-1].left = TreeNode(preorder[i])\n stack.append(stack[-1].left)\n \n if i < len(preorder)-1: \n i+= 1\n else:\n break\n\n\n if debug: print(f'P1 i: {i} j:{j} stack: {stack}')\n\n while stack and inorder[j] == stack[-1].val:\n node = stack.pop()\n j+=1\n if debug: print(f'P2 i: {i} j:{j} stack: {stack}')\n node.right = TreeNode(preorder[i])\n stack.append(node.right)\n if debug: print(f'P3 i: {i} j:{j} stack: {stack}\\n') \n \n\n return root","memory":"17546"},{"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 cur_idx = 0\n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n mp = {}\n for idx, val in enumerate(inorder):\n mp[val] = idx\n \n def build(preorder, inorder, l, r) -> TreeNode:\n if(r - l + 1 < 1):\n return None\n\n root = preorder[self.cur_idx]\n self.cur_idx += 1\n m = mp[root]\n \n left = build(preorder, inorder, l, m-1)\n right = build(preorder, inorder, m+1, r)\n\n return TreeNode(val=root, left=left, right=right)\n\n return build(preorder, inorder, 0, len(inorder) - 1)","memory":"18440"},{"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\nfrom typing import List, Optional\n\n# Definition for a binary tree node.\nclass TreeNode:\n def __init__(self, val: int=0, left: 'Optional[TreeNode]'=None, right: 'Optional[TreeNode]'=None):\n self.val = val\n self.left = left\n self.right = right\n\nclass Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n # Edge case: if either list is empty, return None\n if not preorder or not inorder:\n return None\n\n # Build a hashmap to store value -> its index relations for inorder\n inorder_index_map = {value: idx for idx, value in enumerate(inorder)}\n\n # Initialize the current index in preorder traversal\n self.preorder_index = 0\n\n def build_tree(left_inorder: int, right_inorder: int) -> Optional[TreeNode]:\n # If there are no elements to construct the subtree\n if left_inorder > right_inorder:\n return None\n\n # Select the current element as the root and increment the index\n root_val = preorder[self.preorder_index]\n self.preorder_index += 1\n root = TreeNode(root_val)\n\n # Build left and right subtrees\n # Exclude inorder_index_map[root_val] to build left and right\n root.left = build_tree(left_inorder, inorder_index_map[root_val] - 1)\n root.right = build_tree(inorder_index_map[root_val] + 1, right_inorder)\n\n return root\n\n # Start with the entire range of inorder\n return build_tree(0, len(inorder) - 1)\n\n\n\n\n ","memory":"18440"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def _buildTree(pre_start, pre_end, in_start, in_end):\n if pre_start == pre_end:\n return TreeNode(preorder[pre_start])\n\n m = preorder[pre_start]\n m_inorder_idx = vals_idx[m]\n left_size = m_inorder_idx - in_start\n right_size = in_end - m_inorder_idx\n\n # for i in range(in_start, in_end + 1):\n # if inorder[i] == m:\n # m_inorder_idx = i\n # left_size = i - in_start\n # right_size = in_end - i\n # break\n \n m_node = TreeNode(m)\n\n pre_left_start = pre_start + 1\n pre_left_end = pre_left_start + left_size - 1\n pre_right_start = pre_left_end + 1\n pre_right_end = pre_end\n\n in_left_start = in_start\n in_left_end = m_inorder_idx - 1\n in_right_start = m_inorder_idx + 1\n in_right_end = in_end\n\n if left_size > 0:\n m_node.left = _buildTree(pre_left_start, pre_left_end, in_left_start, in_left_end)\n \n if right_size > 0:\n m_node.right = _buildTree(pre_right_start, pre_right_end, in_right_start, in_right_end)\n return m_node\n \n vals_idx = {inorder[i]: i for i in range(len(inorder))}\n return _buildTree(0, len(preorder) - 1, 0, len(inorder) - 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 def buildTree2(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]: \n def _buildTree(pstart, pend, istart, iend):\n if iend < istart:\n return None\n \n root_val = preorder[pstart]\n\n i = inorder_index_map[root_val]\n \n ileft_start = istart\n ileft_end = i - 1\n iright_start = i + 1\n iright_end = iend\n \n left_size = ileft_end - istart + 1\n right_size = iend - iright_start + 1\n\n pleft_start = pstart + 1\n pleft_end = pleft_start + left_size - 1\n pright_start = pleft_end + 1\n pright_end = pend\n \n left = _buildTree(pleft_start, pleft_end, ileft_start, ileft_end) if left_size else None\n right = _buildTree(pright_start, pright_end, iright_start, iright_end) if right_size else None\n return TreeNode(root_val, left, right)\n \n inorder_index_map = {letter: i for i, letter in enumerate(inorder)}\n return _buildTree(0, len(preorder) - 1, 0, len(inorder) - 1)\n","memory":"19334"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n # preorder: root left right\n # inorder: left root right\n n = len(inorder)\n mpre = {preorder[i]:i for i in range(n)}\n mpin = {inorder[i]:i for i in range(n)}\n \n def construct(a,b,p,q):\n # print(a,b,p,q)\n if a>b or p>q:\n return None\n if a==b:\n return TreeNode(val=preorder[a])\n root = preorder[a]\n node = TreeNode(val=root)\n idxin = mpin[root]\n # print(idxin)\n\n pleft,qleft = p,idxin-1\n pright,qright = idxin+1,q\n # left1,left2 = inorder[pleft],inorder[qleft]\n # right1,right2 = inorder[pright],inorder[qright]\n # aleft,bleft = mpre[left1],mpre[left2]\n # aright,bright = mpre[right1],mpre[right2]\n aleft,bleft = a+1,qleft-pleft+a+1\n aright,bright = max(a+1,bleft+1),b\n \n node.left = construct(aleft,bleft,pleft,qleft)\n node.right = construct(aright,bright,pright,qright)\n return node\n root = construct(0,n-1,0,n-1)\n return root","memory":"19334"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n p=0\n def buildtree(start,end):\n nonlocal p\n if(start>end):\n return None\n root=TreeNode(preorder[p])\n p=p+1\n j=pre[root.val]\n root.left=buildtree(start,j-1)\n root.right=buildtree(j+1,end)\n return root\n pre={}\n for i in range(len(inorder)):\n pre[inorder[i]]=i\n curr=buildtree(0,len(pre)-1)\n print(curr)\n return curr","memory":"20228"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return\n if len(preorder) == 1:\n return TreeNode(val=preorder[0])\n \n root = TreeNode(val = preorder.pop(0))\n leftPre, leftIn = [], []\n \n while inorder[0] != root.val:\n leftPre.append(preorder.pop(0))\n leftIn.append(inorder.pop(0))\n \n inorder.pop(0)\n left = self.buildTree(leftPre, leftIn)\n right = self.buildTree(preorder, inorder)\n\n root.left = left\n root.right = right\n return root\n","memory":"20228"},{"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\n def __init__(self):\n self.root = None\n self.count = 0\n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n return self.build(preorder, inorder, None)\n\n def build(self, preorder, inorder, curr):\n left_preorder = []\n left_inorder = []\n\n right_preorder = []\n right_inorder = []\n \n if len(preorder) == 0:\n return\n\n cur_node = preorder.pop(0)\n left_nodes = inorder.pop(0)\n while left_nodes != cur_node:\n left_preorder.append(preorder.pop(0))\n left_inorder.append(left_nodes)\n left_nodes = inorder.pop(0)\n\n\n while len(preorder) > 0:\n right_preorder.append(preorder.pop(0))\n right_inorder.append(inorder.pop(0))\n\n \n if self.count == 0:\n curr = TreeNode(cur_node)\n self.root = curr\n \n self.count += 1\n\n left = None\n if not len(left_preorder) == 0:\n left = TreeNode(left_preorder[0])\n curr.left = left\n\n right = None\n if not len(right_preorder) == 0:\n right = TreeNode(right_preorder[0])\n curr.right = right\n \n\n \n self.build(right_preorder, right_inorder, right)\n self.build(left_preorder, left_inorder, left)\n\n\n return self.root\n\n \n\n ","memory":"21121"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n val2i = {val:i for i, val in enumerate(inorder)}\n\n @cache\n def build(root_i, l, r):\n nonlocal val2i\n if l > r:\n return None\n val = preorder[root_i]\n pivot = val2i[val]\n node = TreeNode(val)\n node.left = build(root_i+1, l, pivot-1)\n node.right = build(root_i+pivot-l+1, pivot+1, r)\n return node\n \n return build(0, 0, len(preorder) - 1)","memory":"21121"},{"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\nimport numpy as np\n\nclass Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return\n #preorder_map = dict([(preorder[i],i) for i in range(len(preorder))])\n inorder_map = dict([(inorder[i],i) for i in range(len(inorder))])\n\n def recursiveBuildTree(preorder_rng, inorder_rng):\n root = TreeNode(preorder[preorder_rng[0]])\n if preorder_rng[1] - preorder_rng[0] == 1:\n return root\n \n inorder_root_idx = inorder_map[root.val]\n left_size = inorder_root_idx - inorder_rng[0]\n if left_size:\n preorder_rng_left = (preorder_rng[0]+1, preorder_rng[0] +1 + left_size)\n inorder_rng_left = (inorder_rng[0],inorder_root_idx)\n root.left = recursiveBuildTree(preorder_rng_left, inorder_rng_left)\n\n right_size = preorder_rng[1] - preorder_rng[0] -1 - left_size\n if right_size:\n preorder_rng_right = (preorder_rng[0] + 1 + left_size, preorder_rng[1])\n inorder_rng_right = (inorder_rng[0] + left_size + 1, inorder_rng[1])\n root.right = recursiveBuildTree(preorder_rng_right, inorder_rng_right)\n return root\n return recursiveBuildTree((0, len(preorder)), (0,len(preorder)))\n\n\n\n ","memory":"22015"},{"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\nimport numpy as np\n\nclass Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n def recursiveBuildTree(preorder, inorder):\n if len(preorder) == 0:\n return None\n root = TreeNode(preorder[0])\n if len(preorder) == 1:\n return root\n i = 0\n while inorder[i] != root.val:\n i += 1\n preorder_left = preorder[1:i+1]\n preorder_right = preorder[i+1:]\n inorder_left = inorder[0:i]\n inorder_right = inorder[i+1:]\n root.left = recursiveBuildTree(preorder_left, inorder_left)\n root.right = recursiveBuildTree(preorder_right, inorder_right)\n return root\n return recursiveBuildTree(np.array(preorder), np.array(inorder))\n\n\n\n ","memory":"22909"},{"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\nimport numpy as np\n\nclass Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n #preorder_map = dict([(preorder[i],i) for i in range(len(preorder))])\n inorder_map = dict([(inorder[i],i) for i in range(len(inorder))])\n\n def recursiveBuildTree(preorder_rng, inorder_rng):\n if preorder_rng[1] - preorder_rng[0] < 1:\n return None\n root = TreeNode(preorder[preorder_rng[0]])\n if preorder_rng[1] - preorder_rng[0] == 1:\n return root\n \n inorder_root_idx = inorder_map[root.val]\n left_size = inorder_root_idx - inorder_rng[0]\n preorder_rng_left = (preorder_rng[0]+1, preorder_rng[0] +1 + left_size)\n inorder_rng_left = (inorder_rng[0],inorder_root_idx)\n preorder_rng_right = (preorder_rng[0] + 1 + left_size, preorder_rng[1])\n inorder_rng_right = (inorder_rng[0] + left_size + 1, inorder_rng[1])\n root.left = recursiveBuildTree(preorder_rng_left, inorder_rng_left)\n root.right = recursiveBuildTree(preorder_rng_right, inorder_rng_right)\n return root\n return recursiveBuildTree((0, len(preorder)), (0,len(preorder)))\n\n\n\n ","memory":"22909"},{"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\nimport numpy as np\n\nclass Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n self.vis = {}\n self.preorder = preorder\n self.inorder = inorder\n root = self.createNode()\n return root\n\n def createNode(self) -> Optional[TreeNode]: \n cur_node = TreeNode(val=self.preorder[0])\n self.vis[self.preorder[0]] = 1\n\n if self.preorder[0] != self.inorder[0]:\n # still has left node\n del self.preorder[0]\n cur_node.left = self.createNode()\n else:\n # no node on the left\n del self.preorder[0]\n del self.inorder[0]\n \n if len(self.inorder) == 0:\n return cur_node\n \n\n if self.inorder[0] in self.vis:\n # no node on the right\n del self.inorder[0]\n return cur_node\n \n cur_node.right = self.createNode()\n return cur_node\n\n","memory":"23803"},{"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\nimport numpy as np\n\nclass Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n self.vis = {}\n self.preorder = preorder\n self.inorder = inorder\n root = self.createNode()\n # root = TreeNode(val=self.preorder[0])\n # self.vis[self.preorder[0]] = 1\n\n \n # if self.preorder[0] != self.inorder[0]:\n # del self.preorder[0]\n # # build left node\n # root.left = self.buildLeftNode()\n # else:\n # del self.preorder[0]\n # del self.inorder[0]\n \n # if len(self.inorder) > 0:\n # if self.inorder[0] in self.vis:\n # del self.inorder[0]\n # else: \n # right_node = TreeNode(val=self.preorder[0])\n # self.vis[self.preorder[0]] = 1\n # del self.preorder[0]\n # root.right = right_node\n # self.buildLeftNode(right_node)\n return root\n\n def createNode(self) -> Optional[TreeNode]: \n cur_node = TreeNode(val=self.preorder[0])\n self.vis[self.preorder[0]] = 1\n\n if self.preorder[0] != self.inorder[0]:\n # still has left node\n del self.preorder[0]\n cur_node.left = self.createNode()\n else:\n # no node on the left\n del self.preorder[0]\n del self.inorder[0]\n \n if len(self.inorder) == 0:\n # print('len(self.inorder) == 0')\n return cur_node\n \n\n if self.inorder[0] in self.vis:\n # no node on the right\n # print(f'For node {cur_node.val}, self.vis[{self.inorder[0]}]=true.')\n del self.inorder[0]\n return cur_node\n \n cur_node.right = self.createNode()\n return cur_node\n\n\n # def buildLeftNode(self, pre_node: TreeNode):\n if len(self.preorder) == 0:\n return\n\n left_node = TreeNode(val=self.preorder[0])\n self.vis[self.preorder[0]] = 1\n pre_node.left = left_node\n \n\n if self.preorder[0] != self.inorder[0]:\n del self.preorder[0]\n self.buildLeftNode(left_node)\n else:\n del self.preorder[0]\n del self.inorder[0]\n\n if len(self.preorder) == 0:\n return\n\n if self.inorder[0] in self.vis:\n del self.inorder[0]\n else: \n right_node = TreeNode(val=self.preorder[0])\n self.vis[self.preorder[0]] = 1\n del self.preorder[0]\n pre_node.right = right_node\n self.buildLeftNode(right_node)\n\n return\n\n","memory":"24696"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \"\"\"\n first thing in the preorder list is a root.\n what ever comes before it in the inorder list is to the left.\n Example: [3,9,20,15,7] (Pre) | [9,3,15,20,7] (In)\n 3 is a root. And 9 must be in the left subtree since 9 comes before 3 in the inorder\n So, tree becomes\n 3\n 9\n Now we have 20, and since it's after 3 in the inorder, it should be in the right subtree\n Now we're left with (pre) = [20,15,7], In = [15,20,7]\n 20 must be a root. \n \"\"\"\n preorder = deque(preorder)\n inorder = deque(inorder)\n def construct(preorder, inorder):\n if not preorder or not inorder:\n return None\n val = preorder.popleft()\n root = TreeNode(val=val)\n left_vals = deque()\n # print(root.val, preorder, left_vals, inorder)\n while inorder[0] != val:\n left_vals.append(inorder.popleft())\n inorder.popleft() # Remove the current one as well.\n # Now left_vals should be in the left sub tree with the remaining preorder as the correct order\n root.left = construct(preorder, left_vals)\n root.right = construct(preorder, inorder)\n return root\n return construct(preorder, inorder)","memory":"25590"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n\n def build_tree(pre_order, in_order):\n if not pre_order:\n return None\n\n val = pre_order.popleft()\n\n if not in_order:\n # print('no inorder found')\n return None\n \n node = TreeNode(val)\n # print(f'evaluating {val} {pre_order} and {in_order}')\n \n if len(in_order) == 1:\n # print(f'returning node - {node}')\n return node\n\n \n left_q = deque()\n right_q = deque()\n q = left_q\n while in_order:\n currval = in_order.popleft()\n if currval==node.val:\n q=right_q\n else:\n q.append(currval)\n\n # print(val, left_q, right_q)\n if left_q:\n node.left = build_tree(pre_order, left_q)\n if right_q:\n node.right = build_tree(pre_order, right_q)\n # print(f'return node - {node}')\n return node\n\n\n\n\n \n root = build_tree(deque(preorder), deque(inorder))\n return root\n\n\n\n\n","memory":"26484"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n # we know first value of preorder is root node\n # thus we can see everything less and greater than root node by looking at inorder\n # then we see we can split basically the tree into subtrees each with root node \n preorder = deque(preorder)\n def buildTreeAux(preorder, inorder):\n if inorder:\n val = preorder.popleft()\n node = TreeNode(val)\n valInd = inorder.index(val)\n node.left = buildTreeAux(preorder, inorder[:valInd])\n node.right = buildTreeAux(preorder, inorder[valInd+1:]) \n return node\n return buildTreeAux(preorder, inorder)\n\n\n \n ","memory":"27378"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if inorder:\n idx = inorder.index(preorder.pop(0))\n root = TreeNode(inorder[idx])\n root.left, root.right = self.buildTree(preorder, inorder[0:idx]), self.buildTree(preorder, inorder[idx+1:])\n return root","memory":"28271"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n #print(f\"pre {preorder} in {inorder}\")\n if not inorder:\n return None\n root = preorder.pop(0)\n if len(inorder) == 1:\n return TreeNode(root)\n \n root_index = inorder.index(root)\n left = self.buildTree(preorder, inorder[:root_index])\n right = self.buildTree(preorder, inorder[root_index+1:])\n return TreeNode(root, left, right)\n\n\n\n ","memory":"29165"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n # this relates to how to iterate each\n # I think the solution will be finding the root based on\n # the pre-order then going inorder and using that to build up...?\n\n if not preorder or not inorder:\n return None\n\n root = preorder.pop(0)\n root_idx = inorder.index(root)\n\n left = self.buildTree(preorder, inorder[:root_idx])\n right = self.buildTree(preorder, inorder[root_idx + 1:])\n return TreeNode(root, left, right)\n","memory":"30059"},{"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 cur_idx = 0\n\n def build(self, preorder, inorder) -> TreeNode:\n if(len(inorder) == 0):\n return None\n\n root = preorder[self.cur_idx]\n self.cur_idx += 1\n\n if(len(inorder) == 1):\n return TreeNode(val=inorder[0])\n \n m = None\n for idx, val in enumerate(inorder):\n if(val == root):\n m = idx\n break\n \n left = self.build(preorder, inorder[0:m])\n right = self.build(preorder, inorder[m+1:])\n\n return TreeNode(val=root, left=left, right=right)\n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n return self.build(preorder, inorder)","memory":"30953"},{"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 cur_idx = 0\n\n def build(self, preorder, inorder) -> TreeNode:\n if(len(inorder) == 0):\n return None\n\n root = preorder[self.cur_idx]\n self.cur_idx += 1\n\n if(len(inorder) == 1):\n return TreeNode(val=inorder[0])\n \n m = None\n for idx, val in enumerate(inorder):\n if(val == root):\n m = idx\n break\n \n left = self.build(preorder, inorder[0:m])\n right = self.build(preorder, inorder[m+1:])\n\n return TreeNode(val=root, left=left, right=right)\n\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n return self.build(preorder, inorder)","memory":"30953"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def helper(preorder,inorder):\n if inorder:\n idx = inorder.index(preorder.pop(0))\n root = TreeNode(inorder[idx])\n root.left = helper(preorder, inorder[:idx])\n root.right = helper(preorder, inorder[idx+1:])\n return root\n return helper(preorder, inorder)\n","memory":"31846"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \n def dfs(preorder, inorder): \n if len(inorder) == 0: \n return None\n index = inorder.index(preorder.pop(0))\n node = TreeNode(inorder[index])\n\n node.left = dfs(preorder, inorder[:index])\n node.right = dfs(preorder, inorder[index + 1:])\n\n return node\n return dfs(preorder, inorder)\n\n \n ","memory":"31846"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return None\n if not inorder:\n return None\n val_root = preorder.pop(0)\n root = TreeNode(val_root)\n index_of_inorder = inorder.index(val_root)\n root.left = self.buildTree(preorder, inorder[:index_of_inorder])\n root.right = self.buildTree(preorder, inorder[index_of_inorder+1:])\n return root","memory":"32740"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n q = deque(preorder)\n def build(preorder, inorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n root = TreeNode(preorder.popleft())\n index = -1\n try:\n index = inorder.index(root.val)\n except:\n pass\n root.left = build(preorder, inorder[:index])\n root.right = build(preorder, inorder[index+1:])\n return root\n return build(q, inorder)","memory":"33634"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder) == len(inorder) == 1:\n return TreeNode(preorder[0])\n\n # preorder -> root - left - right\n # inorder -> left - root - right\n preorder = deque(preorder)\n\n def build(preorder, inorder):\n if inorder:\n root_val = preorder.popleft()\n idx_root = inorder.index(root_val)\n root = TreeNode(inorder[idx_root])\n\n root.left = build(preorder, inorder[:idx_root])\n root.right = build(preorder, inorder[idx_root+1:])\n\n return root\n\n return build(preorder, inorder)\n ","memory":"33634"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def construct(preorder, inorder):\n if len(preorder)==0 or len(inorder)==0:\n return None\n rootVal = preorder.pop(0)\n index = inorder.index(rootVal)\n root = TreeNode(rootVal)\n left = inorder[:index]\n right = inorder[index+1:]\n root.left = construct(preorder, left)\n root.right = construct(preorder, right)\n return root\n return construct(preorder, inorder)\n ","memory":"34528"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n i = 0 \n def node_and_split(pre, inorder):\n nonlocal i\n if len(inorder) == 0:\n return None\n root = pre[i]\n i += 1\n rootNode = TreeNode(root)\n\n index = inorder.index(root)\n\n leftarr = inorder[:index]\n rightarr = inorder[index+1:]\n rootNode.left = node_and_split(pre, leftarr)\n rootNode.right = node_and_split(pre, rightarr)\n\n return rootNode\n return node_and_split(preorder, inorder)","memory":"35421"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \n ind = {}\n for ii, i in enumerate(preorder):\n ind[i] = ii\n \n # kakva je moja relacija sa cvorom desnim od mene\n \n def resolve(inord):\n if not inord:\n return\n mini_ind = -1\n mini_val = 1e9\n for ii, v in enumerate(inord):\n if mini_val == 1e9 or ind[v] < ind[mini_val]:\n mini_val = v\n mini_ind = ii\n root = TreeNode(mini_val)\n root.left = resolve(inord[:mini_ind])\n root.right = resolve(inord[mini_ind + 1:])\n return root\n root = resolve(inorder)\n return root\n\n\n\n \n ","memory":"36315"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n \n root = TreeNode(preorder[0])\n\n def pre(curr, left, right, pre_index):\n if pre_index >= len(preorder):\n return pre_index # Safeguard against index out of bounds\n \n # If left and right subtrees are empty, return pre_index\n if not left and not right:\n return pre_index\n\n pre_val = preorder[pre_index]\n \n # Process left subtree if pre_val is in the left subtree\n if pre_val in left:\n new_l = TreeNode(pre_val)\n curr.left = new_l\n l_ind = left.index(pre_val)\n left_subtree = safe_slice(left, 0, l_ind)\n right_subtree = safe_slice(left, l_ind + 1, len(left))\n\n pre_index = pre(curr.left, left_subtree, right_subtree, pre_index + 1)\n \n if pre_index < len(preorder): # Ensure pre_index is still valid\n pre_val = preorder[pre_index]\n\n # Process right subtree if pre_val is in the right subtree\n if pre_val in right:\n new_r = TreeNode(pre_val)\n curr.right = new_r\n r_ind = right.index(pre_val)\n left_subtree = safe_slice(right, 0, r_ind)\n right_subtree = safe_slice(right, r_ind + 1, len(right))\n\n pre_index = pre(curr.right, left_subtree, right_subtree, pre_index + 1)\n \n return pre_index # Return the updated pre_index\n\n # Helper function to safely slice the list\n def safe_slice(lst, start, end):\n if start >= len(lst) or start < 0 or end < 0 or start >= end:\n return []\n return lst[start:end]\n\n # Split the inorder list into left and right subtrees\n index = inorder.index(preorder[0])\n left = inorder[:index]\n right = inorder[index + 1:]\n\n # Start recursive construction of the tree\n pre(root, left, right, 1)\n\n return root\n ","memory":"37209"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n \n root = TreeNode(preorder[0])\n\n def pre(curr, left, right, pre_index):\n if pre_index >= len(preorder):\n return pre_index # Safeguard against index out of bounds\n \n # If left and right subtrees are empty, return pre_index\n if not left and not right:\n return pre_index\n\n pre_val = preorder[pre_index]\n \n # Process left subtree if pre_val is in the left subtree\n if pre_val in left:\n new_l = TreeNode(pre_val)\n curr.left = new_l\n l_ind = left.index(pre_val)\n left_subtree = safe_slice(left, 0, l_ind)\n right_subtree = safe_slice(left, l_ind + 1, len(left))\n\n pre_index = pre(curr.left, left_subtree, right_subtree, pre_index + 1)\n \n if pre_index < len(preorder): # Ensure pre_index is still valid\n pre_val = preorder[pre_index]\n\n # Process right subtree if pre_val is in the right subtree\n if pre_val in right:\n new_r = TreeNode(pre_val)\n curr.right = new_r\n r_ind = right.index(pre_val)\n left_subtree = safe_slice(right, 0, r_ind)\n right_subtree = safe_slice(right, r_ind + 1, len(right))\n\n pre_index = pre(curr.right, left_subtree, right_subtree, pre_index + 1)\n \n return pre_index # Return the updated pre_index\n\n # Helper function to safely slice the list\n def safe_slice(lst, start, end):\n if start >= len(lst) or start < 0 or end < 0 or start >= end:\n return []\n return lst[start:end]\n\n # Split the inorder list into left and right subtrees\n index = inorder.index(preorder[0])\n left = inorder[:index]\n right = inorder[index + 1:]\n\n # Start recursive construction of the tree\n pre(root, left, right, 1)\n\n return root","memory":"38103"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n root = TreeNode(preorder[0])\n \n def pre(curr, left, right, pre_index):\n if pre_index >= len(preorder):\n return pre_index\n if not left and not right:\n return pre_index\n pre_val = preorder[pre_index]\n \n if pre_val in left:\n new_l = TreeNode(pre_val)\n curr.left = new_l\n l_ind = left.index(pre_val)\n # Safe slicing for left and right parts of the subtree\n left_subtree = safe_slice(left, 0, l_ind)\n right_subtree = safe_slice(left, l_ind + 1, len(left))\n\n pre_index = pre(curr.left, left_subtree, right_subtree, pre_index+1)\n if pre_index < len(preorder):\n pre_val = preorder[pre_index]\n if pre_val in right:\n new_r = TreeNode(pre_val)\n curr.right = new_r\n r_ind = right.index(pre_val)\n left_subtree = safe_slice(right, 0, r_ind)\n right_subtree = safe_slice(right, r_ind + 1, len(right))\n \n pre_index = pre(curr.right, left_subtree, right_subtree, pre_index + 1)\n return pre_index\n\n \n # Helper function to safely slice the list\n def safe_slice(lst, start, end):\n if start >= len(lst) or start < 0 or end < 0 or start >= end:\n return []\n return lst[start:end]\n\n index = inorder.index(preorder[0])\n left = inorder[:index]\n right = inorder[index+1:]\n pre(root, left, right, 1)\n return root\n ","memory":"38103"},{"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 helper(self, val, val_arr):\n idx = val_arr.index(val)\n left_vals = val_arr[:idx]\n right_vals = val_arr[idx+1:] if idx+1 < len(val_arr) else []\n return left_vals, right_vals\n \n \n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \n stack=[]\n hashmap={}\n val = preorder.pop(0)\n root = TreeNode(val)\n stack.append(root)\n left_vals, right_vals = self.helper(val, inorder)\n hashmap[val]=[left_vals, right_vals]\n iter = root\n while preorder:\n \n val = preorder.pop(0)\n print(iter.val, \"val of iter\")\n print(val, \"val\")\n left_vals = hashmap[iter.val][0]\n right_vals = hashmap[iter.val][1]\n \n if val in left_vals:\n iter.left = TreeNode(val)\n left_vals_, right_vals_ = self.helper(val, left_vals)\n iter = iter.left\n hashmap[val] = [left_vals_, right_vals_]\n stack.append(iter)\n # print(\"iter in left\", iter)\n elif val in right_vals:\n iter.right = TreeNode(val)\n left_vals_, right_vals_ = self.helper(val, right_vals)\n iter = iter.right\n hashmap[val] = [left_vals_, right_vals_]\n stack.append(iter)\n # print(\"iter in right\", iter)\n else:\n iter = stack.pop()\n preorder.insert(0, val)\n # print(iter, \"iter in else\")\n return root\n ","memory":"38996"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n def recurse(preorder, inorder, preorder_ind: list[int]):\n\n # base cases\n if len(inorder) == 1: # leaf node\n root_obj = TreeNode(preorder[preorder_ind[0]])\n preorder_ind[0] += 1\n return root_obj\n elif len(inorder) == 0: # no node\n return None\n\n # first node of \"preorder\" is the root\n root = preorder[preorder_ind[0]]\n root_obj = TreeNode(root)\n preorder_ind[0] += 1\n\n\n # 1. find the root in inorder\n for i, node in enumerate(inorder):\n if node == root:\n # 2. recurse on left subtree\n root_obj.left = recurse(preorder, inorder[:i], preorder_ind)\n break\n \n\n # 3. recurse on right subtree\n root_obj.right = recurse(preorder, inorder[i+1:], preorder_ind)\n\n return root_obj\n \n return recurse(preorder, inorder, [0])\n","memory":"39890"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n subtrees = {}\n nodes = {}\n parents = {}\n\n root = preorder[0]\n nodes[root] = TreeNode(val=root)\n parents[root] = None\n\n root_index_inorder = inorder.index(root)\n subtrees[root] = (inorder[0: root_index_inorder], inorder[root_index_inorder + 1: len(inorder)])\n\n curr = root\n\n for i in range(1, len(preorder)):\n node_to_add = preorder[i]\n left_subtree, right_subtree = subtrees[curr]\n while True:\n if node_to_add in left_subtree:\n new_node = TreeNode(node_to_add)\n nodes[curr].left = new_node\n parents[node_to_add] = curr\n nodes[node_to_add] = new_node\n\n pivot = left_subtree.index(node_to_add)\n subtrees[node_to_add] = (left_subtree[0: pivot], left_subtree[pivot + 1: len(left_subtree)])\n curr = node_to_add\n break\n elif node_to_add in right_subtree:\n new_node = TreeNode(val=node_to_add)\n nodes[curr].right = new_node\n parents[node_to_add] = curr\n nodes[node_to_add] = new_node\n\n pivot = right_subtree.index(node_to_add)\n subtrees[node_to_add] = (right_subtree[0: pivot], right_subtree[pivot + 1: len(right_subtree)])\n curr = node_to_add\n break\n else:\n curr = parents[curr]\n left_subtree, right_subtree = subtrees[curr]\n\n return nodes[root]","memory":"40784"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n index_look_up = {inorder[i]:i for i in range(len(inorder))}\n root_val = preorder.pop(0)\n root = TreeNode(root_val)\n left_sub = (0, index_look_up[root_val]) \n right_sub = (index_look_up[root_val]+1, len(inorder))\n\n def build(parent, left_sub, right_sub):\n left_sub_tree = inorder[left_sub[0]: left_sub[1]]\n right_sub_tree = inorder[right_sub[0]: right_sub[1]]\n if len(preorder) == 0 or (len(left_sub_tree)==0 and len(right_sub_tree)==0):\n return\n \n next_val = preorder.pop(0)\n if next_val in left_sub_tree:\n # left sub tree build\n new_node = TreeNode(next_val)\n parent.left = new_node\n build(new_node, (left_sub[0], index_look_up[next_val]), (index_look_up[next_val]+1,left_sub[1]))\n \n # right sub tree build\n if len(preorder) == 0 or len(right_sub_tree)==0:\n return\n \n next_val = preorder.pop(0)\n assert next_val in right_sub_tree\n new_node = TreeNode(next_val)\n parent.right = new_node\n build(new_node, (right_sub[0], index_look_up[next_val]), (index_look_up[next_val]+1,right_sub[1]))\n \n elif next_val in right_sub_tree:\n # right sub tree build\n new_node = TreeNode(next_val)\n parent.right = new_node\n build(new_node, (right_sub[0], index_look_up[next_val]), (index_look_up[next_val]+1,right_sub[1]))\n\n return\n \n build(root, left_sub, right_sub)\n\n return root\n \n \n","memory":"41678"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def createNode(preorder, inorder):\n if inorder:\n num = preorder.pop(0)\n idx = inorder.index(num)\n node = TreeNode(num,None,None)\n node.left = self.buildTree(preorder,inorder[:idx])\n node.right = self.buildTree(preorder,inorder[idx+1:])\n return node\n return createNode(preorder, inorder)","memory":"42571"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n def dfs(preorder,inorder):\n if not inorder:\n return None\n rootValue = preorder.pop(0)\n root=TreeNode(rootValue)\n rootIndex = inorder.index(rootValue)\n leftInorder = inorder[:rootIndex]\n rightInorder = inorder[rootIndex+1:]\n left = self.buildTree(preorder,leftInorder)\n right = self.buildTree(preorder,rightInorder)\n root.left = left\n root.right = right\n return root\n return dfs(preorder,inorder)","memory":"43465"},{"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\n\nclass Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n self.in_map = {elem: idx for idx, elem in enumerate(inorder)}\n\n first = preorder[0]\n\n return self.rec_get_tree(first, -1, float(\"inf\"), preorder[1:])\n\n def rec_get_tree(self, val: int, lower, upper, preorder: list[int]):\n val_idx = self.in_map[val]\n\n left_node = None\n right_node = None\n\n for idx, elem in enumerate(preorder):\n elem_map_val = self.in_map[elem]\n\n if not lower < elem_map_val < upper:\n continue\n\n lt = elem_map_val < val_idx\n \n if (not left_node) and lt:\n func = lambda x: (x < val_idx) and parent_check(x)\n left_node = self.rec_get_tree(elem, lower, val_idx, preorder[idx+1:])\n \n elif (not right_node) and (not lt):\n func = lambda x: (x > val_idx) and parent_check(x)\n right_node = self.rec_get_tree(elem, val_idx, upper, preorder[idx+1:])\n\n if left_node and right_node:\n break\n\n return TreeNode(\n val=val, \n left=left_node,\n right=right_node\n )\n\n ","memory":"44359"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n\n i, left = 0, []\n\n while preorder[0] != inorder[i]:\n left.append(inorder[i])\n i += 1\n\n return TreeNode(preorder.pop(0), self.buildTree(preorder, left), self.buildTree(preorder, inorder[i + 1:]))","memory":"45253"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n\n i, left = 0, []\n\n while preorder[0] != inorder[i]:\n left.append(inorder[i])\n i += 1\n\n return TreeNode(preorder.pop(0), self.buildTree(preorder, left), self.buildTree(preorder, inorder[i + 1:]))","memory":"46146"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return None\n\n if len(preorder) == 1:\n return TreeNode(preorder[0])\n \n r_val = preorder.pop(0)\n # print(f\"root: {r_val}\")\n root = TreeNode(r_val)\n \n left_end_idx = inorder.index(r_val)\n left_inorder = inorder[:left_end_idx]\n left_preorder = []\n count = left_end_idx\n while count > 0:\n left_preorder.append(preorder.pop(0))\n count -= 1\n \n # print(f\"left inorder: {left_inorder}\")\n # print(f\"left preorder: {left_preorder}\")\n root.left = self.buildTree(left_preorder, left_inorder)\n\n right_inorder = inorder[left_end_idx+1:]\n # print(f\"right inorder: {right_inorder}\")\n # print(f\"right preorder: {preorder}\")\n root.right = self.buildTree(preorder, right_inorder)\n\n return root\n\n\n","memory":"47040"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return None\n if len(preorder) == 1:\n return TreeNode(val=preorder[0])\n\n root_val = preorder.pop(0)\n root_idx = inorder.index(root_val)\n root = TreeNode(root_val)\n\n left_inorder = inorder[:root_idx]\n left_preorder = []\n cnt = len(left_inorder)\n while cnt > 0:\n left_preorder.append(preorder.pop(0))\n cnt -= 1\n # print(left_preorder, left_inorder)\n root.left = self.buildTree(left_preorder, left_inorder)\n\n right_inorder = inorder[root_idx+1:]\n right_preorder = []\n cnt = len(right_inorder)\n while cnt > 0:\n right_preorder.append(preorder.pop(0))\n cnt -= 1\n # print(right_preorder, right_inorder)\n root.right = self.buildTree(right_preorder, right_inorder)\n \n return root\n\n ","memory":"47934"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return None\n if len(preorder) == 1:\n return TreeNode(val=preorder[0])\n\n root_val = preorder.pop(0)\n root_idx = inorder.index(root_val)\n root = TreeNode(root_val)\n\n left_inorder = inorder[:root_idx]\n left_preorder = []\n cnt = len(left_inorder)\n while cnt > 0:\n left_preorder.append(preorder.pop(0))\n cnt -= 1\n # print(left_preorder, left_inorder)\n root.left = self.buildTree(left_preorder, left_inorder)\n\n right_inorder = inorder[root_idx+1:]\n right_preorder = []\n cnt = len(right_inorder)\n while cnt > 0:\n right_preorder.append(preorder.pop(0))\n cnt -= 1\n # print(right_preorder, right_inorder)\n root.right = self.buildTree(right_preorder, right_inorder)\n \n return root\n\n ","memory":"47934"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder)==0 or len(inorder)==0: return None\n root_val = preorder.pop(0)\n root = TreeNode(root_val)\n i = 0\n inorder_left, inorder_right = [], []\n while i < len(inorder) and inorder[i] != root_val:\n inorder_left.append(inorder[i])\n i += 1\n i += 1\n while i < len(inorder):\n inorder_right.append(inorder[i])\n i += 1\n # print(root_val, preorder, inorder_left, inorder_right)\n root.left = self.buildTree(preorder, inorder_left)\n root.right = self.buildTree(preorder, inorder_right)\n return root","memory":"48828"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return None\n \n # preo\n def tree(preo, ino):\n if not ino:\n return None\n root = TreeNode(preorder.pop(0))\n i = 0\n left = []\n while ino[i] != root.val:\n left.append(ino[i])\n i+=1\n right = ino[i+1:]\n root.left = tree(preo, left)\n root.right = tree(preo, right)\n return root\n return tree(preorder, inorder)","memory":"49721"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \n inds = {}\n for (i,n) in enumerate(inorder):\n inds[n] = i\n \n def make_splits(num, rem_vals):\n \n l = [x for x in rem_vals if inds[x] < inds[num]]\n r = [x for x in rem_vals if inds[x] > inds[num]]\n \n return (l, r)\n \n def build_subtree(values):\n if len(values) ==0:\n return\n \n root_val = values[0]\n if len(values) == 1:\n return TreeNode(root_val)\n \n new_root = TreeNode(root_val)\n \n lefts, rights = make_splits(root_val, values[1:])\n \n # print(root_val, lefts,rights)\n new_root.left = build_subtree(lefts)\n new_root.right = build_subtree(rights)\n \n return new_root\n \n return build_subtree(preorder)\n \n \n \n \n \n \n \n \n \n \n \n ","memory":"50615"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n preorderIndex = {}\n for i in range(len(preorder)):\n preorderIndex[preorder[i]] = i\n \n def construct(inorderList):\n if not inorderList: return None\n\n curNode = inorderList[0]\n for elem in inorderList:\n if preorderIndex[elem] < preorderIndex[curNode]:\n curNode = elem\n leftTree = []\n rightTree = []\n found = False\n for elem in inorderList:\n if elem == curNode:\n found = True\n continue\n if found:\n rightTree.append(elem)\n else:\n leftTree.append(elem)\n\n root = TreeNode(curNode)\n root.left = construct(leftTree)\n root.right = construct(rightTree)\n return root\n \n return construct(inorder)","memory":"51509"},{"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\nfrom collections import deque\n\nclass Solution:\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder) == 1:\n return TreeNode(preorder[0])\n\n def dfs(node,preorder,inorder):\n if not node:\n return\n\n ind = inorder.index(node.val)\n\n #left_in = inorder[:ind]\n #right_in = inorder[ind+1:]\n left_in = []\n right_in = []\n for i,n in enumerate(inorder):\n if i < ind:\n left_in.append(n)\n elif i > ind:\n right_in.append(n)\n\n if not left_in and not right_in:\n return\n \n if left_in:\n left_pre = preorder.popleft()\n node.left = TreeNode(left_pre)\n dfs(node.left,preorder,left_in)\n if right_in:\n right_pre = preorder.popleft()\n node.right = TreeNode(right_pre)\n dfs(node.right,preorder,right_in)\n\n # finding root\n root = TreeNode(preorder[0])\n preord = deque(preorder)\n preord.popleft()\n dfs(root,preord,inorder)\n return root","memory":"52403"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n # preorder[0] is root\n # split in order around this value to give subtrees\n # recursively build\n if len(preorder) == 0:\n assert(len(inorder) == 0)\n return None\n # Can probably get rid of this case\n if len(preorder) == 1:\n assert(len(inorder) == 1)\n return TreeNode(val = preorder[0])\n \n root = preorder[0]\n i = inorder.index(root)\n leftIn = inorder[:i]\n rightIn = inorder[i+1:]\n leftPre = preorder[1:len(leftIn)+1]\n rightPre = preorder[len(leftIn)+1:]\n leftTree = self.buildTree(leftPre, leftIn)\n rightTree = self.buildTree(rightPre, rightIn)\n return TreeNode(val = root, left = leftTree, right = rightTree)\n ","memory":"53296"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n ans=TreeNode(preorder[0])\n idx=inorder.index(preorder[0])\n ans.left=self.buildTree(preorder[1:idx+1], inorder[:idx])\n ans.right=self.buildTree(preorder[idx+1:], inorder[idx+1:])\n return ans\n\n ","memory":"54190"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n # first node is the root, find the index in the inorder list. split left and right & recurse\n\n if len(inorder) == 0:\n return None\n \n root = preorder[0]\n\n root_index = inorder.index(root)\n\n left = inorder[0:root_index]\n right = inorder[root_index+1::]\n\n left_pre = preorder[1:len(left)+1]\n right_pre = preorder[len(left)+1::]\n\n return TreeNode(root, self.buildTree(left_pre, left), self.buildTree(right_pre, right))\n\n\n ","memory":"55084"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1: mid + 1], inorder[0: mid]) \n # 是前闭后开的\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid + 1:])\n return root\n # inorder.index() 函数来找到它在中序遍历中的位置。这个操作的时间复杂度是O(n)，\n # 树有n个节点，所以最坏情况下时间复杂度是O(n^2) ；\n # 每次递归调用时都切割了 preorder 和 inorder 列表，\n # 这会消耗额外的空间。最坏情况下，我们可能需要O(n)的额外空间\n # 由于每次切片和查找操作都需要线性时间，整体时间复杂度是O(n^2) 查找根节点的时间复杂度为 O(n)，切片操作的时间复杂度为O(n)，递归调用的时间复杂度为O(n) \n # 时间复杂度是O(n^2), 空间复杂度O(n)","memory":"55978"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \"\"\"\n build binary tree with pre-order and in-order sequence\n :param preorder:\n :param inorder:\n :return:\n \"\"\"\n if len(preorder) == 0:\n return None\n if len(preorder) != len(inorder):\n raise Exception(\"illegal tree data\")\n\n pos_root = inorder.index(preorder[0])\n\n if pos_root < 0:\n raise Exception(\"illegal tree data\")\n\n # create root\n left = None\n right = None\n if pos_root > 0:\n left = self.buildTree(preorder[1:pos_root+1], inorder[0:pos_root])\n if pos_root < len(inorder) - 1:\n right = self.buildTree(preorder[pos_root+1:], inorder[pos_root+1:])\n\n rootNode = TreeNode(preorder[0], left, right)\n\n return rootNode","memory":"56871"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n \n \"\"\"\n preorder = [3, 9, 20,15,7], \n inorder = [9, 3, 15,20,7]\n\n Inorder is like left, root, right\n Preorder is root, left, right\n\n From preorder we pick the root\n Find the index in inorder \n \"\"\"\n\n if len(preorder) == 0:\n return None\n\n if len(preorder) == 1:\n return TreeNode(preorder[0])\n\n # root node\n rooNodeVal = preorder[0]\n\n treeNode = TreeNode(rooNodeVal)\n\n inOrderIndex = inorder.index(rooNodeVal)\n\n \"\"\"\n preorder = [ 20, 15,7], \n inorder = [ 15, 20, 7]\n \"\"\"\n treeNode.left = self.buildTree(preorder[1: inOrderIndex + 1], inorder[0: inOrderIndex])\n treeNode.right = self.buildTree(preorder[inOrderIndex + 1: ], inorder[inOrderIndex + 1: ])\n\n return treeNode\n\n\n\n ","memory":"57765"},{"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# 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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n \n # The first element in preorder is always the root\n root = TreeNode(preorder[0])\n \n # Find the root in inorder\n mid = inorder.index(preorder[0])\n \n # Recursively construct left and right subtrees\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\n root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])\n \n return root","memory":"58659"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n if preorder == []:\n return None\n \n def get_index_of_root_in_inorder(inorder, element):\n\n for index in range(len(inorder)):\n if inorder[index] == element:\n return index\n \n root = TreeNode(preorder[0])\n index_of_root_in_inorder = get_index_of_root_in_inorder(inorder, preorder[0])\n no_of_elements_in_left = index_of_root_in_inorder\n no_of_elements_in_right = len(inorder) - index_of_root_in_inorder\n root.left = self.buildTree(preorder[1: 1 + index_of_root_in_inorder], inorder[:index_of_root_in_inorder])\n root.right = self.buildTree(preorder[1 + index_of_root_in_inorder:], inorder[index_of_root_in_inorder + 1:])\n return root\n ","memory":"59553"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder: return None\n\n left_size = inorder.index(preorder[0])\n\n left = self.buildTree(preorder[1:1+left_size], inorder[:left_size])\n right = self.buildTree(preorder[1+left_size:], inorder[1+left_size:])\n\n return TreeNode(preorder[0], left, right)","memory":"59553"},{"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 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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return None\n # The first element in preorder is the root of the current subtree\n # Find the index of the root in inorder\n root_inorder = inorder.index(preorder[0]) # this is also the number of nodes in the left subtree\n left_subtree = self.buildTree(preorder[1:root_inorder+1], inorder[:root_inorder])\n right_subtree = self.buildTree(preorder[root_inorder+1:], inorder[root_inorder+1:])\n return TreeNode(preorder[0], left_subtree, right_subtree)\n ","memory":"60446"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder) == 0:\n return None\n elif len(preorder) == 1:\n return TreeNode(val = preorder[0])\n else:\n val = preorder[0]\n i = 0 \n while i < len(inorder):\n if inorder[i] == val:\n break\n i += 1\n left = self.buildTree(preorder[1:i+1], inorder[:i])\n right = self.buildTree(preorder[i+1:], inorder[i+1:])\n return TreeNode(val, left, right)\n \n ","memory":"60446"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if len(preorder) == 0:\n return None\n if len(preorder) == 1:\n return TreeNode(preorder[0])\n\n root_val = preorder[0]\n left_count = inorder.index(root_val)\n # right_count = len(preorder) - left_count - 1\n\n left = self.buildTree(preorder[1 : 1 + left_count], inorder[:left_count])\n right = self.buildTree(preorder[left_count + 1 :], inorder[left_count + 1 :])\n\n root = TreeNode(root_val)\n root.left = left\n root.right = right\n return root","memory":"61340"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n \n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\n root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])\n\n return root","memory":"61340"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n\n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1:mid + 1], inorder[:mid])\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid + 1:])\n return root","memory":"62234"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder and not inorder:\n return\n \n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid + 1:])\n\n return root","memory":"62234"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n \n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n\n root.left = self.buildTree(preorder[1 : mid + 1], inorder[ : mid])\n root.right = self.buildTree(preorder[mid + 1 : ], inorder[mid + 1 :])\n return root\n ","memory":"63128"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n\n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1:mid + 1], inorder[:mid])\n root.right = self.buildTree(preorder[mid+ 1:], inorder[mid+ 1:])\n return root\n ","memory":"63128"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n # print(\"preorder\", preorder)\n # print(\"inorder\", inorder)\n if not preorder:\n return None\n root_val = preorder[0]\n for i in range(len(inorder)):\n if inorder[i] == root_val:\n inorder_left = inorder[:i]\n inorder_right = inorder[i+1:]\n preorder_left = preorder[1:len(inorder_left)+1]\n preorder_right = preorder[1+len(inorder_left):]\n return TreeNode(\n val=root_val,\n left=self.buildTree(preorder_left, inorder_left),\n right=self.buildTree(preorder_right, inorder_right),\n )\n","memory":"64021"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n\n if not preorder:\n return None\n root = TreeNode(preorder[0])\n mid = inorder.index(preorder[0])\n root.left = self.buildTree(preorder[1:mid+1], inorder[0: mid+1])\n root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])\n return root\n","memory":"64021"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n # 如果参数是空列表，则返回空节点\n if not preorder:\n return None\n # 获得根节点的值\n root = preorder[0]\n # 获得根节点的左右孩子的前/中序遍历结果\n root_index = 0\n for i in range(len(inorder)):\n if inorder[i] == root:\n root_index = i\n break\n left_child_inorder = inorder[0: root_index]\n left_child_preorder = preorder[1: root_index + 1]\n right_child_inorder = inorder[root_index + 1:]\n right_child_preorder = preorder[root_index + 1:]\n # 构建并返回根节点\n return TreeNode(\n val=root, \n left=self.buildTree(preorder=left_child_preorder, inorder=left_child_inorder),\n right=self.buildTree(preorder=right_child_preorder, inorder=right_child_inorder),\n )","memory":"64915"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder:\n return None\n \n root_value = preorder[0]\n root = TreeNode(root_value)\n idx = inorder.index(root_value)\n \n left = self.buildTree(preorder[1:idx+1], inorder[:idx])\n root.left = left\n right = self.buildTree(preorder[idx+1:], inorder[idx+1:])\n root.right = right\n \n return root\n","memory":"64915"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n self.current_tree = TreeNode(preorder[0])\n\n if len(preorder) == 1:\n return self.current_tree\n\n def build(preorder, inorder, currTreeNode):\n\n def divide(preorder, inorder,):\n p = 0\n currNode = preorder[0]\n\n while inorder[p] != currNode:\n p +=1\n \n left_inorder, right_inorder = inorder[:p], inorder[p+1:]\n left_preorder, right_preorder = preorder[1:p], preorder[p+1:]\n return left_inorder, left_preorder, right_inorder, right_preorder\n \n left_inorder, left_preorder, right_inorder, right_preorder = divide(preorder, inorder)\n currTreeNode.val = preorder[0]\n\n if len(left_inorder) == 1:\n newNode = TreeNode(left_inorder[0])\n currTreeNode.left = newNode\n elif left_inorder:\n newNode = TreeNode(left_inorder[0])\n currTreeNode.left = newNode\n build(left_preorder, left_inorder, currTreeNode.left)\n \n if len(right_inorder) == 1:\n newNode = TreeNode(right_inorder[0])\n currTreeNode.right = newNode\n elif right_inorder:\n newNode = TreeNode(right_inorder[0])\n currTreeNode.right = newNode\n build(right_preorder, right_inorder, currTreeNode.right)\n \n\n build(preorder,inorder, self.current_tree)\n\n return self.current_tree\n\n\n\n\n ","memory":"65809"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n positions: Dict[int, int] = dict()\n for i, x in enumerate(inorder):\n positions[x] = i\n return self.buildTreeWithDict(preorder, inorder, positions, 0)\n\n def buildTreeWithDict(\n self,\n preorder: List[int],\n inorder: List[int],\n inorder_positions: Dict[int, int],\n shift: int,\n ) -> Optional[TreeNode]:\n if len(preorder) == 0:\n return None\n if len(preorder) == 1:\n return TreeNode(preorder[0])\n\n root_val = preorder[0]\n left_count = inorder_positions[root_val] - shift\n\n root = TreeNode(root_val)\n root.left = self.buildTreeWithDict(\n preorder[1 : 1 + left_count],\n inorder[:left_count],\n inorder_positions,\n shift,\n )\n root.right = self.buildTreeWithDict(\n preorder[left_count + 1 :],\n inorder[left_count + 1 :],\n inorder_positions,\n shift + left_count + 1,\n )\n return root\n","memory":"66703"},{"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\n if not preorder or not inorder:\n return None\n preorder_stack = []\n postorder_stack = []\n \n root_val = preorder[0]\n in_order_root = inorder.index(root_val)\n root = TreeNode(val=root_val)\n root.left = self.buildTree(preorder[1:in_order_root+1], inorder[:in_order_root])\n root.right = self.buildTree(preorder[in_order_root+1:], inorder[in_order_root+1:])\n return root\n","memory":"66703"}],"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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n rootindex=inorder.index(preorder[0])\\n inordermap = {val: idx for idx, val in enumerate(inorder)}\\n rootnode=TreeNode(preorder[0])\\n root=rootnode\\n for i in range(1,len(preorder)):\\n newnode=TreeNode(preorder[i])\\n # print(preorder[i],root,rootnode)\\n while True:\\n # print(rootnode,inorder.index(preorder[i]),inorder.index(rootnode.val))\\n if rootnode!=None and inordermap[preorder[i]]<inordermap[rootnode.val]:\\n # print(\\\"inside less\\\")\\n if rootnode.left==None:\\n rootnode.left=newnode\\n break\\n else:\\n rootnode=rootnode.left\\n else:\\n # print(\\\"insisde great\\\")\\n if rootnode.right==None:\\n rootnode.right=newnode\\n break\\n else:\\n rootnode=rootnode.right\\n rootnode=root\\n return root\\n\\n\\n\\n \",\n \"memory\": \"17546\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n debug = False\\n i, j = 0, 0\\n root = TreeNode(preorder[0])\\n stack = [root]\\n \\n while i < len(preorder):\\n \\n if debug: print(f'P0 i: {i} j:{j} stack: {stack}')\\n while stack[-1].val != inorder[j]:\\n i += 1\\n stack[-1].left = TreeNode(preorder[i])\\n stack.append(stack[-1].left)\\n \\n if i < len(preorder)-1: \\n i+= 1\\n else:\\n break\\n\\n\\n if debug: print(f'P1 i: {i} j:{j} stack: {stack}')\\n\\n while stack and inorder[j] == stack[-1].val:\\n node = stack.pop()\\n j+=1\\n if debug: print(f'P2 i: {i} j:{j} stack: {stack}')\\n node.right = TreeNode(preorder[i])\\n stack.append(node.right)\\n if debug: print(f'P3 i: {i} j:{j} stack: {stack}\\\\n') \\n \\n\\n return root\",\n \"memory\": \"17546\"\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 cur_idx = 0\\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n mp = {}\\n for idx, val in enumerate(inorder):\\n mp[val] = idx\\n \\n def build(preorder, inorder, l, r) -> TreeNode:\\n if(r - l + 1 < 1):\\n return None\\n\\n root = preorder[self.cur_idx]\\n self.cur_idx += 1\\n m = mp[root]\\n \\n left = build(preorder, inorder, l, m-1)\\n right = build(preorder, inorder, m+1, r)\\n\\n return TreeNode(val=root, left=left, right=right)\\n\\n return build(preorder, inorder, 0, len(inorder) - 1)\",\n \"memory\": \"18440\"\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\\nfrom typing import List, Optional\\n\\n# Definition for a binary tree node.\\nclass TreeNode:\\n def __init__(self, val: int=0, left: 'Optional[TreeNode]'=None, right: 'Optional[TreeNode]'=None):\\n self.val = val\\n self.left = left\\n self.right = right\\n\\nclass Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n # Edge case: if either list is empty, return None\\n if not preorder or not inorder:\\n return None\\n\\n # Build a hashmap to store value -> its index relations for inorder\\n inorder_index_map = {value: idx for idx, value in enumerate(inorder)}\\n\\n # Initialize the current index in preorder traversal\\n self.preorder_index = 0\\n\\n def build_tree(left_inorder: int, right_inorder: int) -> Optional[TreeNode]:\\n # If there are no elements to construct the subtree\\n if left_inorder > right_inorder:\\n return None\\n\\n # Select the current element as the root and increment the index\\n root_val = preorder[self.preorder_index]\\n self.preorder_index += 1\\n root = TreeNode(root_val)\\n\\n # Build left and right subtrees\\n # Exclude inorder_index_map[root_val] to build left and right\\n root.left = build_tree(left_inorder, inorder_index_map[root_val] - 1)\\n root.right = build_tree(inorder_index_map[root_val] + 1, right_inorder)\\n\\n return root\\n\\n # Start with the entire range of inorder\\n return build_tree(0, len(inorder) - 1)\\n\\n\\n\\n\\n \",\n \"memory\": \"18440\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def _buildTree(pre_start, pre_end, in_start, in_end):\\n if pre_start == pre_end:\\n return TreeNode(preorder[pre_start])\\n\\n m = preorder[pre_start]\\n m_inorder_idx = vals_idx[m]\\n left_size = m_inorder_idx - in_start\\n right_size = in_end - m_inorder_idx\\n\\n # for i in range(in_start, in_end + 1):\\n # if inorder[i] == m:\\n # m_inorder_idx = i\\n # left_size = i - in_start\\n # right_size = in_end - i\\n # break\\n \\n m_node = TreeNode(m)\\n\\n pre_left_start = pre_start + 1\\n pre_left_end = pre_left_start + left_size - 1\\n pre_right_start = pre_left_end + 1\\n pre_right_end = pre_end\\n\\n in_left_start = in_start\\n in_left_end = m_inorder_idx - 1\\n in_right_start = m_inorder_idx + 1\\n in_right_end = in_end\\n\\n if left_size > 0:\\n m_node.left = _buildTree(pre_left_start, pre_left_end, in_left_start, in_left_end)\\n \\n if right_size > 0:\\n m_node.right = _buildTree(pre_right_start, pre_right_end, in_right_start, in_right_end)\\n return m_node\\n \\n vals_idx = {inorder[i]: i for i in range(len(inorder))}\\n return _buildTree(0, len(preorder) - 1, 0, len(inorder) - 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 def buildTree2(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]: \\n def _buildTree(pstart, pend, istart, iend):\\n if iend < istart:\\n return None\\n \\n root_val = preorder[pstart]\\n\\n i = inorder_index_map[root_val]\\n \\n ileft_start = istart\\n ileft_end = i - 1\\n iright_start = i + 1\\n iright_end = iend\\n \\n left_size = ileft_end - istart + 1\\n right_size = iend - iright_start + 1\\n\\n pleft_start = pstart + 1\\n pleft_end = pleft_start + left_size - 1\\n pright_start = pleft_end + 1\\n pright_end = pend\\n \\n left = _buildTree(pleft_start, pleft_end, ileft_start, ileft_end) if left_size else None\\n right = _buildTree(pright_start, pright_end, iright_start, iright_end) if right_size else None\\n return TreeNode(root_val, left, right)\\n \\n inorder_index_map = {letter: i for i, letter in enumerate(inorder)}\\n return _buildTree(0, len(preorder) - 1, 0, len(inorder) - 1)\\n\",\n \"memory\": \"19334\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n # preorder: root left right\\n # inorder: left root right\\n n = len(inorder)\\n mpre = {preorder[i]:i for i in range(n)}\\n mpin = {inorder[i]:i for i in range(n)}\\n \\n def construct(a,b,p,q):\\n # print(a,b,p,q)\\n if a>b or p>q:\\n return None\\n if a==b:\\n return TreeNode(val=preorder[a])\\n root = preorder[a]\\n node = TreeNode(val=root)\\n idxin = mpin[root]\\n # print(idxin)\\n\\n pleft,qleft = p,idxin-1\\n pright,qright = idxin+1,q\\n # left1,left2 = inorder[pleft],inorder[qleft]\\n # right1,right2 = inorder[pright],inorder[qright]\\n # aleft,bleft = mpre[left1],mpre[left2]\\n # aright,bright = mpre[right1],mpre[right2]\\n aleft,bleft = a+1,qleft-pleft+a+1\\n aright,bright = max(a+1,bleft+1),b\\n \\n node.left = construct(aleft,bleft,pleft,qleft)\\n node.right = construct(aright,bright,pright,qright)\\n return node\\n root = construct(0,n-1,0,n-1)\\n return root\",\n \"memory\": \"19334\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n p=0\\n def buildtree(start,end):\\n nonlocal p\\n if(start>end):\\n return None\\n root=TreeNode(preorder[p])\\n p=p+1\\n j=pre[root.val]\\n root.left=buildtree(start,j-1)\\n root.right=buildtree(j+1,end)\\n return root\\n pre={}\\n for i in range(len(inorder)):\\n pre[inorder[i]]=i\\n curr=buildtree(0,len(pre)-1)\\n print(curr)\\n return curr\",\n \"memory\": \"20228\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return\\n if len(preorder) == 1:\\n return TreeNode(val=preorder[0])\\n \\n root = TreeNode(val = preorder.pop(0))\\n leftPre, leftIn = [], []\\n \\n while inorder[0] != root.val:\\n leftPre.append(preorder.pop(0))\\n leftIn.append(inorder.pop(0))\\n \\n inorder.pop(0)\\n left = self.buildTree(leftPre, leftIn)\\n right = self.buildTree(preorder, inorder)\\n\\n root.left = left\\n root.right = right\\n return root\\n\",\n \"memory\": \"20228\"\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\\n def __init__(self):\\n self.root = None\\n self.count = 0\\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n return self.build(preorder, inorder, None)\\n\\n def build(self, preorder, inorder, curr):\\n left_preorder = []\\n left_inorder = []\\n\\n right_preorder = []\\n right_inorder = []\\n \\n if len(preorder) == 0:\\n return\\n\\n cur_node = preorder.pop(0)\\n left_nodes = inorder.pop(0)\\n while left_nodes != cur_node:\\n left_preorder.append(preorder.pop(0))\\n left_inorder.append(left_nodes)\\n left_nodes = inorder.pop(0)\\n\\n\\n while len(preorder) > 0:\\n right_preorder.append(preorder.pop(0))\\n right_inorder.append(inorder.pop(0))\\n\\n \\n if self.count == 0:\\n curr = TreeNode(cur_node)\\n self.root = curr\\n \\n self.count += 1\\n\\n left = None\\n if not len(left_preorder) == 0:\\n left = TreeNode(left_preorder[0])\\n curr.left = left\\n\\n right = None\\n if not len(right_preorder) == 0:\\n right = TreeNode(right_preorder[0])\\n curr.right = right\\n \\n\\n \\n self.build(right_preorder, right_inorder, right)\\n self.build(left_preorder, left_inorder, left)\\n\\n\\n return self.root\\n\\n \\n\\n \",\n \"memory\": \"21121\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n val2i = {val:i for i, val in enumerate(inorder)}\\n\\n @cache\\n def build(root_i, l, r):\\n nonlocal val2i\\n if l > r:\\n return None\\n val = preorder[root_i]\\n pivot = val2i[val]\\n node = TreeNode(val)\\n node.left = build(root_i+1, l, pivot-1)\\n node.right = build(root_i+pivot-l+1, pivot+1, r)\\n return node\\n \\n return build(0, 0, len(preorder) - 1)\",\n \"memory\": \"21121\"\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\\nimport numpy as np\\n\\nclass Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return\\n #preorder_map = dict([(preorder[i],i) for i in range(len(preorder))])\\n inorder_map = dict([(inorder[i],i) for i in range(len(inorder))])\\n\\n def recursiveBuildTree(preorder_rng, inorder_rng):\\n root = TreeNode(preorder[preorder_rng[0]])\\n if preorder_rng[1] - preorder_rng[0] == 1:\\n return root\\n \\n inorder_root_idx = inorder_map[root.val]\\n left_size = inorder_root_idx - inorder_rng[0]\\n if left_size:\\n preorder_rng_left = (preorder_rng[0]+1, preorder_rng[0] +1 + left_size)\\n inorder_rng_left = (inorder_rng[0],inorder_root_idx)\\n root.left = recursiveBuildTree(preorder_rng_left, inorder_rng_left)\\n\\n right_size = preorder_rng[1] - preorder_rng[0] -1 - left_size\\n if right_size:\\n preorder_rng_right = (preorder_rng[0] + 1 + left_size, preorder_rng[1])\\n inorder_rng_right = (inorder_rng[0] + left_size + 1, inorder_rng[1])\\n root.right = recursiveBuildTree(preorder_rng_right, inorder_rng_right)\\n return root\\n return recursiveBuildTree((0, len(preorder)), (0,len(preorder)))\\n\\n\\n\\n \",\n \"memory\": \"22015\"\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\\nimport numpy as np\\n\\nclass Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n def recursiveBuildTree(preorder, inorder):\\n if len(preorder) == 0:\\n return None\\n root = TreeNode(preorder[0])\\n if len(preorder) == 1:\\n return root\\n i = 0\\n while inorder[i] != root.val:\\n i += 1\\n preorder_left = preorder[1:i+1]\\n preorder_right = preorder[i+1:]\\n inorder_left = inorder[0:i]\\n inorder_right = inorder[i+1:]\\n root.left = recursiveBuildTree(preorder_left, inorder_left)\\n root.right = recursiveBuildTree(preorder_right, inorder_right)\\n return root\\n return recursiveBuildTree(np.array(preorder), np.array(inorder))\\n\\n\\n\\n \",\n \"memory\": \"22909\"\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\\nimport numpy as np\\n\\nclass Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n #preorder_map = dict([(preorder[i],i) for i in range(len(preorder))])\\n inorder_map = dict([(inorder[i],i) for i in range(len(inorder))])\\n\\n def recursiveBuildTree(preorder_rng, inorder_rng):\\n if preorder_rng[1] - preorder_rng[0] < 1:\\n return None\\n root = TreeNode(preorder[preorder_rng[0]])\\n if preorder_rng[1] - preorder_rng[0] == 1:\\n return root\\n \\n inorder_root_idx = inorder_map[root.val]\\n left_size = inorder_root_idx - inorder_rng[0]\\n preorder_rng_left = (preorder_rng[0]+1, preorder_rng[0] +1 + left_size)\\n inorder_rng_left = (inorder_rng[0],inorder_root_idx)\\n preorder_rng_right = (preorder_rng[0] + 1 + left_size, preorder_rng[1])\\n inorder_rng_right = (inorder_rng[0] + left_size + 1, inorder_rng[1])\\n root.left = recursiveBuildTree(preorder_rng_left, inorder_rng_left)\\n root.right = recursiveBuildTree(preorder_rng_right, inorder_rng_right)\\n return root\\n return recursiveBuildTree((0, len(preorder)), (0,len(preorder)))\\n\\n\\n\\n \",\n \"memory\": \"22909\"\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\\nimport numpy as np\\n\\nclass Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n self.vis = {}\\n self.preorder = preorder\\n self.inorder = inorder\\n root = self.createNode()\\n return root\\n\\n def createNode(self) -> Optional[TreeNode]: \\n cur_node = TreeNode(val=self.preorder[0])\\n self.vis[self.preorder[0]] = 1\\n\\n if self.preorder[0] != self.inorder[0]:\\n # still has left node\\n del self.preorder[0]\\n cur_node.left = self.createNode()\\n else:\\n # no node on the left\\n del self.preorder[0]\\n del self.inorder[0]\\n \\n if len(self.inorder) == 0:\\n return cur_node\\n \\n\\n if self.inorder[0] in self.vis:\\n # no node on the right\\n del self.inorder[0]\\n return cur_node\\n \\n cur_node.right = self.createNode()\\n return cur_node\\n\\n\",\n \"memory\": \"23803\"\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\\nimport numpy as np\\n\\nclass Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n self.vis = {}\\n self.preorder = preorder\\n self.inorder = inorder\\n root = self.createNode()\\n # root = TreeNode(val=self.preorder[0])\\n # self.vis[self.preorder[0]] = 1\\n\\n \\n # if self.preorder[0] != self.inorder[0]:\\n # del self.preorder[0]\\n # # build left node\\n # root.left = self.buildLeftNode()\\n # else:\\n # del self.preorder[0]\\n # del self.inorder[0]\\n \\n # if len(self.inorder) > 0:\\n # if self.inorder[0] in self.vis:\\n # del self.inorder[0]\\n # else: \\n # right_node = TreeNode(val=self.preorder[0])\\n # self.vis[self.preorder[0]] = 1\\n # del self.preorder[0]\\n # root.right = right_node\\n # self.buildLeftNode(right_node)\\n return root\\n\\n def createNode(self) -> Optional[TreeNode]: \\n cur_node = TreeNode(val=self.preorder[0])\\n self.vis[self.preorder[0]] = 1\\n\\n if self.preorder[0] != self.inorder[0]:\\n # still has left node\\n del self.preorder[0]\\n cur_node.left = self.createNode()\\n else:\\n # no node on the left\\n del self.preorder[0]\\n del self.inorder[0]\\n \\n if len(self.inorder) == 0:\\n # print('len(self.inorder) == 0')\\n return cur_node\\n \\n\\n if self.inorder[0] in self.vis:\\n # no node on the right\\n # print(f'For node {cur_node.val}, self.vis[{self.inorder[0]}]=true.')\\n del self.inorder[0]\\n return cur_node\\n \\n cur_node.right = self.createNode()\\n return cur_node\\n\\n\\n # def buildLeftNode(self, pre_node: TreeNode):\\n if len(self.preorder) == 0:\\n return\\n\\n left_node = TreeNode(val=self.preorder[0])\\n self.vis[self.preorder[0]] = 1\\n pre_node.left = left_node\\n \\n\\n if self.preorder[0] != self.inorder[0]:\\n del self.preorder[0]\\n self.buildLeftNode(left_node)\\n else:\\n del self.preorder[0]\\n del self.inorder[0]\\n\\n if len(self.preorder) == 0:\\n return\\n\\n if self.inorder[0] in self.vis:\\n del self.inorder[0]\\n else: \\n right_node = TreeNode(val=self.preorder[0])\\n self.vis[self.preorder[0]] = 1\\n del self.preorder[0]\\n pre_node.right = right_node\\n self.buildLeftNode(right_node)\\n\\n return\\n\\n\",\n \"memory\": \"24696\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\\"\\\"\\\"\\n first thing in the preorder list is a root.\\n what ever comes before it in the inorder list is to the left.\\n Example: [3,9,20,15,7] (Pre) | [9,3,15,20,7] (In)\\n 3 is a root. And 9 must be in the left subtree since 9 comes before 3 in the inorder\\n So, tree becomes\\n 3\\n 9\\n Now we have 20, and since it's after 3 in the inorder, it should be in the right subtree\\n Now we're left with (pre) = [20,15,7], In = [15,20,7]\\n 20 must be a root. \\n \\\"\\\"\\\"\\n preorder = deque(preorder)\\n inorder = deque(inorder)\\n def construct(preorder, inorder):\\n if not preorder or not inorder:\\n return None\\n val = preorder.popleft()\\n root = TreeNode(val=val)\\n left_vals = deque()\\n # print(root.val, preorder, left_vals, inorder)\\n while inorder[0] != val:\\n left_vals.append(inorder.popleft())\\n inorder.popleft() # Remove the current one as well.\\n # Now left_vals should be in the left sub tree with the remaining preorder as the correct order\\n root.left = construct(preorder, left_vals)\\n root.right = construct(preorder, inorder)\\n return root\\n return construct(preorder, inorder)\",\n \"memory\": \"25590\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n\\n def build_tree(pre_order, in_order):\\n if not pre_order:\\n return None\\n\\n val = pre_order.popleft()\\n\\n if not in_order:\\n # print('no inorder found')\\n return None\\n \\n node = TreeNode(val)\\n # print(f'evaluating {val} {pre_order} and {in_order}')\\n \\n if len(in_order) == 1:\\n # print(f'returning node - {node}')\\n return node\\n\\n \\n left_q = deque()\\n right_q = deque()\\n q = left_q\\n while in_order:\\n currval = in_order.popleft()\\n if currval==node.val:\\n q=right_q\\n else:\\n q.append(currval)\\n\\n # print(val, left_q, right_q)\\n if left_q:\\n node.left = build_tree(pre_order, left_q)\\n if right_q:\\n node.right = build_tree(pre_order, right_q)\\n # print(f'return node - {node}')\\n return node\\n\\n\\n\\n\\n \\n root = build_tree(deque(preorder), deque(inorder))\\n return root\\n\\n\\n\\n\\n\",\n \"memory\": \"26484\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n # we know first value of preorder is root node\\n # thus we can see everything less and greater than root node by looking at inorder\\n # then we see we can split basically the tree into subtrees each with root node \\n preorder = deque(preorder)\\n def buildTreeAux(preorder, inorder):\\n if inorder:\\n val = preorder.popleft()\\n node = TreeNode(val)\\n valInd = inorder.index(val)\\n node.left = buildTreeAux(preorder, inorder[:valInd])\\n node.right = buildTreeAux(preorder, inorder[valInd+1:]) \\n return node\\n return buildTreeAux(preorder, inorder)\\n\\n\\n \\n \",\n \"memory\": \"27378\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if inorder:\\n idx = inorder.index(preorder.pop(0))\\n root = TreeNode(inorder[idx])\\n root.left, root.right = self.buildTree(preorder, inorder[0:idx]), self.buildTree(preorder, inorder[idx+1:])\\n return root\",\n \"memory\": \"28271\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n #print(f\\\"pre {preorder} in {inorder}\\\")\\n if not inorder:\\n return None\\n root = preorder.pop(0)\\n if len(inorder) == 1:\\n return TreeNode(root)\\n \\n root_index = inorder.index(root)\\n left = self.buildTree(preorder, inorder[:root_index])\\n right = self.buildTree(preorder, inorder[root_index+1:])\\n return TreeNode(root, left, right)\\n\\n\\n\\n \",\n \"memory\": \"29165\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n # this relates to how to iterate each\\n # I think the solution will be finding the root based on\\n # the pre-order then going inorder and using that to build up...?\\n\\n if not preorder or not inorder:\\n return None\\n\\n root = preorder.pop(0)\\n root_idx = inorder.index(root)\\n\\n left = self.buildTree(preorder, inorder[:root_idx])\\n right = self.buildTree(preorder, inorder[root_idx + 1:])\\n return TreeNode(root, left, right)\\n\",\n \"memory\": \"30059\"\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 cur_idx = 0\\n\\n def build(self, preorder, inorder) -> TreeNode:\\n if(len(inorder) == 0):\\n return None\\n\\n root = preorder[self.cur_idx]\\n self.cur_idx += 1\\n\\n if(len(inorder) == 1):\\n return TreeNode(val=inorder[0])\\n \\n m = None\\n for idx, val in enumerate(inorder):\\n if(val == root):\\n m = idx\\n break\\n \\n left = self.build(preorder, inorder[0:m])\\n right = self.build(preorder, inorder[m+1:])\\n\\n return TreeNode(val=root, left=left, right=right)\\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n return self.build(preorder, inorder)\",\n \"memory\": \"30953\"\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 cur_idx = 0\\n\\n def build(self, preorder, inorder) -> TreeNode:\\n if(len(inorder) == 0):\\n return None\\n\\n root = preorder[self.cur_idx]\\n self.cur_idx += 1\\n\\n if(len(inorder) == 1):\\n return TreeNode(val=inorder[0])\\n \\n m = None\\n for idx, val in enumerate(inorder):\\n if(val == root):\\n m = idx\\n break\\n \\n left = self.build(preorder, inorder[0:m])\\n right = self.build(preorder, inorder[m+1:])\\n\\n return TreeNode(val=root, left=left, right=right)\\n\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n return self.build(preorder, inorder)\",\n \"memory\": \"30953\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def helper(preorder,inorder):\\n if inorder:\\n idx = inorder.index(preorder.pop(0))\\n root = TreeNode(inorder[idx])\\n root.left = helper(preorder, inorder[:idx])\\n root.right = helper(preorder, inorder[idx+1:])\\n return root\\n return helper(preorder, inorder)\\n\",\n \"memory\": \"31846\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\n def dfs(preorder, inorder): \\n if len(inorder) == 0: \\n return None\\n index = inorder.index(preorder.pop(0))\\n node = TreeNode(inorder[index])\\n\\n node.left = dfs(preorder, inorder[:index])\\n node.right = dfs(preorder, inorder[index + 1:])\\n\\n return node\\n return dfs(preorder, inorder)\\n\\n \\n \",\n \"memory\": \"31846\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return None\\n if not inorder:\\n return None\\n val_root = preorder.pop(0)\\n root = TreeNode(val_root)\\n index_of_inorder = inorder.index(val_root)\\n root.left = self.buildTree(preorder, inorder[:index_of_inorder])\\n root.right = self.buildTree(preorder, inorder[index_of_inorder+1:])\\n return root\",\n \"memory\": \"32740\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n q = deque(preorder)\\n def build(preorder, inorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n root = TreeNode(preorder.popleft())\\n index = -1\\n try:\\n index = inorder.index(root.val)\\n except:\\n pass\\n root.left = build(preorder, inorder[:index])\\n root.right = build(preorder, inorder[index+1:])\\n return root\\n return build(q, inorder)\",\n \"memory\": \"33634\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder) == len(inorder) == 1:\\n return TreeNode(preorder[0])\\n\\n # preorder -> root - left - right\\n # inorder -> left - root - right\\n preorder = deque(preorder)\\n\\n def build(preorder, inorder):\\n if inorder:\\n root_val = preorder.popleft()\\n idx_root = inorder.index(root_val)\\n root = TreeNode(inorder[idx_root])\\n\\n root.left = build(preorder, inorder[:idx_root])\\n root.right = build(preorder, inorder[idx_root+1:])\\n\\n return root\\n\\n return build(preorder, inorder)\\n \",\n \"memory\": \"33634\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def construct(preorder, inorder):\\n if len(preorder)==0 or len(inorder)==0:\\n return None\\n rootVal = preorder.pop(0)\\n index = inorder.index(rootVal)\\n root = TreeNode(rootVal)\\n left = inorder[:index]\\n right = inorder[index+1:]\\n root.left = construct(preorder, left)\\n root.right = construct(preorder, right)\\n return root\\n return construct(preorder, inorder)\\n \",\n \"memory\": \"34528\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n i = 0 \\n def node_and_split(pre, inorder):\\n nonlocal i\\n if len(inorder) == 0:\\n return None\\n root = pre[i]\\n i += 1\\n rootNode = TreeNode(root)\\n\\n index = inorder.index(root)\\n\\n leftarr = inorder[:index]\\n rightarr = inorder[index+1:]\\n rootNode.left = node_and_split(pre, leftarr)\\n rootNode.right = node_and_split(pre, rightarr)\\n\\n return rootNode\\n return node_and_split(preorder, inorder)\",\n \"memory\": \"35421\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\n ind = {}\\n for ii, i in enumerate(preorder):\\n ind[i] = ii\\n \\n # kakva je moja relacija sa cvorom desnim od mene\\n \\n def resolve(inord):\\n if not inord:\\n return\\n mini_ind = -1\\n mini_val = 1e9\\n for ii, v in enumerate(inord):\\n if mini_val == 1e9 or ind[v] < ind[mini_val]:\\n mini_val = v\\n mini_ind = ii\\n root = TreeNode(mini_val)\\n root.left = resolve(inord[:mini_ind])\\n root.right = resolve(inord[mini_ind + 1:])\\n return root\\n root = resolve(inorder)\\n return root\\n\\n\\n\\n \\n \",\n \"memory\": \"36315\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n \\n root = TreeNode(preorder[0])\\n\\n def pre(curr, left, right, pre_index):\\n if pre_index >= len(preorder):\\n return pre_index # Safeguard against index out of bounds\\n \\n # If left and right subtrees are empty, return pre_index\\n if not left and not right:\\n return pre_index\\n\\n pre_val = preorder[pre_index]\\n \\n # Process left subtree if pre_val is in the left subtree\\n if pre_val in left:\\n new_l = TreeNode(pre_val)\\n curr.left = new_l\\n l_ind = left.index(pre_val)\\n left_subtree = safe_slice(left, 0, l_ind)\\n right_subtree = safe_slice(left, l_ind + 1, len(left))\\n\\n pre_index = pre(curr.left, left_subtree, right_subtree, pre_index + 1)\\n \\n if pre_index < len(preorder): # Ensure pre_index is still valid\\n pre_val = preorder[pre_index]\\n\\n # Process right subtree if pre_val is in the right subtree\\n if pre_val in right:\\n new_r = TreeNode(pre_val)\\n curr.right = new_r\\n r_ind = right.index(pre_val)\\n left_subtree = safe_slice(right, 0, r_ind)\\n right_subtree = safe_slice(right, r_ind + 1, len(right))\\n\\n pre_index = pre(curr.right, left_subtree, right_subtree, pre_index + 1)\\n \\n return pre_index # Return the updated pre_index\\n\\n # Helper function to safely slice the list\\n def safe_slice(lst, start, end):\\n if start >= len(lst) or start < 0 or end < 0 or start >= end:\\n return []\\n return lst[start:end]\\n\\n # Split the inorder list into left and right subtrees\\n index = inorder.index(preorder[0])\\n left = inorder[:index]\\n right = inorder[index + 1:]\\n\\n # Start recursive construction of the tree\\n pre(root, left, right, 1)\\n\\n return root\\n \",\n \"memory\": \"37209\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n \\n root = TreeNode(preorder[0])\\n\\n def pre(curr, left, right, pre_index):\\n if pre_index >= len(preorder):\\n return pre_index # Safeguard against index out of bounds\\n \\n # If left and right subtrees are empty, return pre_index\\n if not left and not right:\\n return pre_index\\n\\n pre_val = preorder[pre_index]\\n \\n # Process left subtree if pre_val is in the left subtree\\n if pre_val in left:\\n new_l = TreeNode(pre_val)\\n curr.left = new_l\\n l_ind = left.index(pre_val)\\n left_subtree = safe_slice(left, 0, l_ind)\\n right_subtree = safe_slice(left, l_ind + 1, len(left))\\n\\n pre_index = pre(curr.left, left_subtree, right_subtree, pre_index + 1)\\n \\n if pre_index < len(preorder): # Ensure pre_index is still valid\\n pre_val = preorder[pre_index]\\n\\n # Process right subtree if pre_val is in the right subtree\\n if pre_val in right:\\n new_r = TreeNode(pre_val)\\n curr.right = new_r\\n r_ind = right.index(pre_val)\\n left_subtree = safe_slice(right, 0, r_ind)\\n right_subtree = safe_slice(right, r_ind + 1, len(right))\\n\\n pre_index = pre(curr.right, left_subtree, right_subtree, pre_index + 1)\\n \\n return pre_index # Return the updated pre_index\\n\\n # Helper function to safely slice the list\\n def safe_slice(lst, start, end):\\n if start >= len(lst) or start < 0 or end < 0 or start >= end:\\n return []\\n return lst[start:end]\\n\\n # Split the inorder list into left and right subtrees\\n index = inorder.index(preorder[0])\\n left = inorder[:index]\\n right = inorder[index + 1:]\\n\\n # Start recursive construction of the tree\\n pre(root, left, right, 1)\\n\\n return root\",\n \"memory\": \"38103\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n root = TreeNode(preorder[0])\\n \\n def pre(curr, left, right, pre_index):\\n if pre_index >= len(preorder):\\n return pre_index\\n if not left and not right:\\n return pre_index\\n pre_val = preorder[pre_index]\\n \\n if pre_val in left:\\n new_l = TreeNode(pre_val)\\n curr.left = new_l\\n l_ind = left.index(pre_val)\\n # Safe slicing for left and right parts of the subtree\\n left_subtree = safe_slice(left, 0, l_ind)\\n right_subtree = safe_slice(left, l_ind + 1, len(left))\\n\\n pre_index = pre(curr.left, left_subtree, right_subtree, pre_index+1)\\n if pre_index < len(preorder):\\n pre_val = preorder[pre_index]\\n if pre_val in right:\\n new_r = TreeNode(pre_val)\\n curr.right = new_r\\n r_ind = right.index(pre_val)\\n left_subtree = safe_slice(right, 0, r_ind)\\n right_subtree = safe_slice(right, r_ind + 1, len(right))\\n \\n pre_index = pre(curr.right, left_subtree, right_subtree, pre_index + 1)\\n return pre_index\\n\\n \\n # Helper function to safely slice the list\\n def safe_slice(lst, start, end):\\n if start >= len(lst) or start < 0 or end < 0 or start >= end:\\n return []\\n return lst[start:end]\\n\\n index = inorder.index(preorder[0])\\n left = inorder[:index]\\n right = inorder[index+1:]\\n pre(root, left, right, 1)\\n return root\\n \",\n \"memory\": \"38103\"\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 helper(self, val, val_arr):\\n idx = val_arr.index(val)\\n left_vals = val_arr[:idx]\\n right_vals = val_arr[idx+1:] if idx+1 < len(val_arr) else []\\n return left_vals, right_vals\\n \\n \\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\n stack=[]\\n hashmap={}\\n val = preorder.pop(0)\\n root = TreeNode(val)\\n stack.append(root)\\n left_vals, right_vals = self.helper(val, inorder)\\n hashmap[val]=[left_vals, right_vals]\\n iter = root\\n while preorder:\\n \\n val = preorder.pop(0)\\n print(iter.val, \\\"val of iter\\\")\\n print(val, \\\"val\\\")\\n left_vals = hashmap[iter.val][0]\\n right_vals = hashmap[iter.val][1]\\n \\n if val in left_vals:\\n iter.left = TreeNode(val)\\n left_vals_, right_vals_ = self.helper(val, left_vals)\\n iter = iter.left\\n hashmap[val] = [left_vals_, right_vals_]\\n stack.append(iter)\\n # print(\\\"iter in left\\\", iter)\\n elif val in right_vals:\\n iter.right = TreeNode(val)\\n left_vals_, right_vals_ = self.helper(val, right_vals)\\n iter = iter.right\\n hashmap[val] = [left_vals_, right_vals_]\\n stack.append(iter)\\n # print(\\\"iter in right\\\", iter)\\n else:\\n iter = stack.pop()\\n preorder.insert(0, val)\\n # print(iter, \\\"iter in else\\\")\\n return root\\n \",\n \"memory\": \"38996\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n def recurse(preorder, inorder, preorder_ind: list[int]):\\n\\n # base cases\\n if len(inorder) == 1: # leaf node\\n root_obj = TreeNode(preorder[preorder_ind[0]])\\n preorder_ind[0] += 1\\n return root_obj\\n elif len(inorder) == 0: # no node\\n return None\\n\\n # first node of \\\"preorder\\\" is the root\\n root = preorder[preorder_ind[0]]\\n root_obj = TreeNode(root)\\n preorder_ind[0] += 1\\n\\n\\n # 1. find the root in inorder\\n for i, node in enumerate(inorder):\\n if node == root:\\n # 2. recurse on left subtree\\n root_obj.left = recurse(preorder, inorder[:i], preorder_ind)\\n break\\n \\n\\n # 3. recurse on right subtree\\n root_obj.right = recurse(preorder, inorder[i+1:], preorder_ind)\\n\\n return root_obj\\n \\n return recurse(preorder, inorder, [0])\\n\",\n \"memory\": \"39890\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n subtrees = {}\\n nodes = {}\\n parents = {}\\n\\n root = preorder[0]\\n nodes[root] = TreeNode(val=root)\\n parents[root] = None\\n\\n root_index_inorder = inorder.index(root)\\n subtrees[root] = (inorder[0: root_index_inorder], inorder[root_index_inorder + 1: len(inorder)])\\n\\n curr = root\\n\\n for i in range(1, len(preorder)):\\n node_to_add = preorder[i]\\n left_subtree, right_subtree = subtrees[curr]\\n while True:\\n if node_to_add in left_subtree:\\n new_node = TreeNode(node_to_add)\\n nodes[curr].left = new_node\\n parents[node_to_add] = curr\\n nodes[node_to_add] = new_node\\n\\n pivot = left_subtree.index(node_to_add)\\n subtrees[node_to_add] = (left_subtree[0: pivot], left_subtree[pivot + 1: len(left_subtree)])\\n curr = node_to_add\\n break\\n elif node_to_add in right_subtree:\\n new_node = TreeNode(val=node_to_add)\\n nodes[curr].right = new_node\\n parents[node_to_add] = curr\\n nodes[node_to_add] = new_node\\n\\n pivot = right_subtree.index(node_to_add)\\n subtrees[node_to_add] = (right_subtree[0: pivot], right_subtree[pivot + 1: len(right_subtree)])\\n curr = node_to_add\\n break\\n else:\\n curr = parents[curr]\\n left_subtree, right_subtree = subtrees[curr]\\n\\n return nodes[root]\",\n \"memory\": \"40784\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n index_look_up = {inorder[i]:i for i in range(len(inorder))}\\n root_val = preorder.pop(0)\\n root = TreeNode(root_val)\\n left_sub = (0, index_look_up[root_val]) \\n right_sub = (index_look_up[root_val]+1, len(inorder))\\n\\n def build(parent, left_sub, right_sub):\\n left_sub_tree = inorder[left_sub[0]: left_sub[1]]\\n right_sub_tree = inorder[right_sub[0]: right_sub[1]]\\n if len(preorder) == 0 or (len(left_sub_tree)==0 and len(right_sub_tree)==0):\\n return\\n \\n next_val = preorder.pop(0)\\n if next_val in left_sub_tree:\\n # left sub tree build\\n new_node = TreeNode(next_val)\\n parent.left = new_node\\n build(new_node, (left_sub[0], index_look_up[next_val]), (index_look_up[next_val]+1,left_sub[1]))\\n \\n # right sub tree build\\n if len(preorder) == 0 or len(right_sub_tree)==0:\\n return\\n \\n next_val = preorder.pop(0)\\n assert next_val in right_sub_tree\\n new_node = TreeNode(next_val)\\n parent.right = new_node\\n build(new_node, (right_sub[0], index_look_up[next_val]), (index_look_up[next_val]+1,right_sub[1]))\\n \\n elif next_val in right_sub_tree:\\n # right sub tree build\\n new_node = TreeNode(next_val)\\n parent.right = new_node\\n build(new_node, (right_sub[0], index_look_up[next_val]), (index_look_up[next_val]+1,right_sub[1]))\\n\\n return\\n \\n build(root, left_sub, right_sub)\\n\\n return root\\n \\n \\n\",\n \"memory\": \"41678\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def createNode(preorder, inorder):\\n if inorder:\\n num = preorder.pop(0)\\n idx = inorder.index(num)\\n node = TreeNode(num,None,None)\\n node.left = self.buildTree(preorder,inorder[:idx])\\n node.right = self.buildTree(preorder,inorder[idx+1:])\\n return node\\n return createNode(preorder, inorder)\",\n \"memory\": \"42571\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n def dfs(preorder,inorder):\\n if not inorder:\\n return None\\n rootValue = preorder.pop(0)\\n root=TreeNode(rootValue)\\n rootIndex = inorder.index(rootValue)\\n leftInorder = inorder[:rootIndex]\\n rightInorder = inorder[rootIndex+1:]\\n left = self.buildTree(preorder,leftInorder)\\n right = self.buildTree(preorder,rightInorder)\\n root.left = left\\n root.right = right\\n return root\\n return dfs(preorder,inorder)\",\n \"memory\": \"43465\"\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\\n\\nclass Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n self.in_map = {elem: idx for idx, elem in enumerate(inorder)}\\n\\n first = preorder[0]\\n\\n return self.rec_get_tree(first, -1, float(\\\"inf\\\"), preorder[1:])\\n\\n def rec_get_tree(self, val: int, lower, upper, preorder: list[int]):\\n val_idx = self.in_map[val]\\n\\n left_node = None\\n right_node = None\\n\\n for idx, elem in enumerate(preorder):\\n elem_map_val = self.in_map[elem]\\n\\n if not lower < elem_map_val < upper:\\n continue\\n\\n lt = elem_map_val < val_idx\\n \\n if (not left_node) and lt:\\n func = lambda x: (x < val_idx) and parent_check(x)\\n left_node = self.rec_get_tree(elem, lower, val_idx, preorder[idx+1:])\\n \\n elif (not right_node) and (not lt):\\n func = lambda x: (x > val_idx) and parent_check(x)\\n right_node = self.rec_get_tree(elem, val_idx, upper, preorder[idx+1:])\\n\\n if left_node and right_node:\\n break\\n\\n return TreeNode(\\n val=val, \\n left=left_node,\\n right=right_node\\n )\\n\\n \",\n \"memory\": \"44359\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n\\n i, left = 0, []\\n\\n while preorder[0] != inorder[i]:\\n left.append(inorder[i])\\n i += 1\\n\\n return TreeNode(preorder.pop(0), self.buildTree(preorder, left), self.buildTree(preorder, inorder[i + 1:]))\",\n \"memory\": \"45253\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n\\n i, left = 0, []\\n\\n while preorder[0] != inorder[i]:\\n left.append(inorder[i])\\n i += 1\\n\\n return TreeNode(preorder.pop(0), self.buildTree(preorder, left), self.buildTree(preorder, inorder[i + 1:]))\",\n \"memory\": \"46146\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return None\\n\\n if len(preorder) == 1:\\n return TreeNode(preorder[0])\\n \\n r_val = preorder.pop(0)\\n # print(f\\\"root: {r_val}\\\")\\n root = TreeNode(r_val)\\n \\n left_end_idx = inorder.index(r_val)\\n left_inorder = inorder[:left_end_idx]\\n left_preorder = []\\n count = left_end_idx\\n while count > 0:\\n left_preorder.append(preorder.pop(0))\\n count -= 1\\n \\n # print(f\\\"left inorder: {left_inorder}\\\")\\n # print(f\\\"left preorder: {left_preorder}\\\")\\n root.left = self.buildTree(left_preorder, left_inorder)\\n\\n right_inorder = inorder[left_end_idx+1:]\\n # print(f\\\"right inorder: {right_inorder}\\\")\\n # print(f\\\"right preorder: {preorder}\\\")\\n root.right = self.buildTree(preorder, right_inorder)\\n\\n return root\\n\\n\\n\",\n \"memory\": \"47040\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return None\\n if len(preorder) == 1:\\n return TreeNode(val=preorder[0])\\n\\n root_val = preorder.pop(0)\\n root_idx = inorder.index(root_val)\\n root = TreeNode(root_val)\\n\\n left_inorder = inorder[:root_idx]\\n left_preorder = []\\n cnt = len(left_inorder)\\n while cnt > 0:\\n left_preorder.append(preorder.pop(0))\\n cnt -= 1\\n # print(left_preorder, left_inorder)\\n root.left = self.buildTree(left_preorder, left_inorder)\\n\\n right_inorder = inorder[root_idx+1:]\\n right_preorder = []\\n cnt = len(right_inorder)\\n while cnt > 0:\\n right_preorder.append(preorder.pop(0))\\n cnt -= 1\\n # print(right_preorder, right_inorder)\\n root.right = self.buildTree(right_preorder, right_inorder)\\n \\n return root\\n\\n \",\n \"memory\": \"47934\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return None\\n if len(preorder) == 1:\\n return TreeNode(val=preorder[0])\\n\\n root_val = preorder.pop(0)\\n root_idx = inorder.index(root_val)\\n root = TreeNode(root_val)\\n\\n left_inorder = inorder[:root_idx]\\n left_preorder = []\\n cnt = len(left_inorder)\\n while cnt > 0:\\n left_preorder.append(preorder.pop(0))\\n cnt -= 1\\n # print(left_preorder, left_inorder)\\n root.left = self.buildTree(left_preorder, left_inorder)\\n\\n right_inorder = inorder[root_idx+1:]\\n right_preorder = []\\n cnt = len(right_inorder)\\n while cnt > 0:\\n right_preorder.append(preorder.pop(0))\\n cnt -= 1\\n # print(right_preorder, right_inorder)\\n root.right = self.buildTree(right_preorder, right_inorder)\\n \\n return root\\n\\n \",\n \"memory\": \"47934\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder)==0 or len(inorder)==0: return None\\n root_val = preorder.pop(0)\\n root = TreeNode(root_val)\\n i = 0\\n inorder_left, inorder_right = [], []\\n while i < len(inorder) and inorder[i] != root_val:\\n inorder_left.append(inorder[i])\\n i += 1\\n i += 1\\n while i < len(inorder):\\n inorder_right.append(inorder[i])\\n i += 1\\n # print(root_val, preorder, inorder_left, inorder_right)\\n root.left = self.buildTree(preorder, inorder_left)\\n root.right = self.buildTree(preorder, inorder_right)\\n return root\",\n \"memory\": \"48828\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return None\\n \\n # preo\\n def tree(preo, ino):\\n if not ino:\\n return None\\n root = TreeNode(preorder.pop(0))\\n i = 0\\n left = []\\n while ino[i] != root.val:\\n left.append(ino[i])\\n i+=1\\n right = ino[i+1:]\\n root.left = tree(preo, left)\\n root.right = tree(preo, right)\\n return root\\n return tree(preorder, inorder)\",\n \"memory\": \"49721\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\n inds = {}\\n for (i,n) in enumerate(inorder):\\n inds[n] = i\\n \\n def make_splits(num, rem_vals):\\n \\n l = [x for x in rem_vals if inds[x] < inds[num]]\\n r = [x for x in rem_vals if inds[x] > inds[num]]\\n \\n return (l, r)\\n \\n def build_subtree(values):\\n if len(values) ==0:\\n return\\n \\n root_val = values[0]\\n if len(values) == 1:\\n return TreeNode(root_val)\\n \\n new_root = TreeNode(root_val)\\n \\n lefts, rights = make_splits(root_val, values[1:])\\n \\n # print(root_val, lefts,rights)\\n new_root.left = build_subtree(lefts)\\n new_root.right = build_subtree(rights)\\n \\n return new_root\\n \\n return build_subtree(preorder)\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \",\n \"memory\": \"50615\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n preorderIndex = {}\\n for i in range(len(preorder)):\\n preorderIndex[preorder[i]] = i\\n \\n def construct(inorderList):\\n if not inorderList: return None\\n\\n curNode = inorderList[0]\\n for elem in inorderList:\\n if preorderIndex[elem] < preorderIndex[curNode]:\\n curNode = elem\\n leftTree = []\\n rightTree = []\\n found = False\\n for elem in inorderList:\\n if elem == curNode:\\n found = True\\n continue\\n if found:\\n rightTree.append(elem)\\n else:\\n leftTree.append(elem)\\n\\n root = TreeNode(curNode)\\n root.left = construct(leftTree)\\n root.right = construct(rightTree)\\n return root\\n \\n return construct(inorder)\",\n \"memory\": \"51509\"\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\\nfrom collections import deque\\n\\nclass Solution:\\n def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder) == 1:\\n return TreeNode(preorder[0])\\n\\n def dfs(node,preorder,inorder):\\n if not node:\\n return\\n\\n ind = inorder.index(node.val)\\n\\n #left_in = inorder[:ind]\\n #right_in = inorder[ind+1:]\\n left_in = []\\n right_in = []\\n for i,n in enumerate(inorder):\\n if i < ind:\\n left_in.append(n)\\n elif i > ind:\\n right_in.append(n)\\n\\n if not left_in and not right_in:\\n return\\n \\n if left_in:\\n left_pre = preorder.popleft()\\n node.left = TreeNode(left_pre)\\n dfs(node.left,preorder,left_in)\\n if right_in:\\n right_pre = preorder.popleft()\\n node.right = TreeNode(right_pre)\\n dfs(node.right,preorder,right_in)\\n\\n # finding root\\n root = TreeNode(preorder[0])\\n preord = deque(preorder)\\n preord.popleft()\\n dfs(root,preord,inorder)\\n return root\",\n \"memory\": \"52403\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n # preorder[0] is root\\n # split in order around this value to give subtrees\\n # recursively build\\n if len(preorder) == 0:\\n assert(len(inorder) == 0)\\n return None\\n # Can probably get rid of this case\\n if len(preorder) == 1:\\n assert(len(inorder) == 1)\\n return TreeNode(val = preorder[0])\\n \\n root = preorder[0]\\n i = inorder.index(root)\\n leftIn = inorder[:i]\\n rightIn = inorder[i+1:]\\n leftPre = preorder[1:len(leftIn)+1]\\n rightPre = preorder[len(leftIn)+1:]\\n leftTree = self.buildTree(leftPre, leftIn)\\n rightTree = self.buildTree(rightPre, rightIn)\\n return TreeNode(val = root, left = leftTree, right = rightTree)\\n \",\n \"memory\": \"53296\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n ans=TreeNode(preorder[0])\\n idx=inorder.index(preorder[0])\\n ans.left=self.buildTree(preorder[1:idx+1], inorder[:idx])\\n ans.right=self.buildTree(preorder[idx+1:], inorder[idx+1:])\\n return ans\\n\\n \",\n \"memory\": \"54190\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n # first node is the root, find the index in the inorder list. split left and right & recurse\\n\\n if len(inorder) == 0:\\n return None\\n \\n root = preorder[0]\\n\\n root_index = inorder.index(root)\\n\\n left = inorder[0:root_index]\\n right = inorder[root_index+1::]\\n\\n left_pre = preorder[1:len(left)+1]\\n right_pre = preorder[len(left)+1::]\\n\\n return TreeNode(root, self.buildTree(left_pre, left), self.buildTree(right_pre, right))\\n\\n\\n \",\n \"memory\": \"55084\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1: mid + 1], inorder[0: mid]) \\n # 是前闭后开的\\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid + 1:])\\n return root\\n # inorder.index() 函数来找到它在中序遍历中的位置。这个操作的时间复杂度是O(n)，\\n # 树有n个节点，所以最坏情况下时间复杂度是O(n^2) ；\\n # 每次递归调用时都切割了 preorder 和 inorder 列表，\\n # 这会消耗额外的空间。最坏情况下，我们可能需要O(n)的额外空间\\n # 由于每次切片和查找操作都需要线性时间，整体时间复杂度是O(n^2) 查找根节点的时间复杂度为 O(n)，切片操作的时间复杂度为O(n)，递归调用的时间复杂度为O(n) \\n # 时间复杂度是O(n^2), 空间复杂度O(n)\",\n \"memory\": \"55978\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\\"\\\"\\\"\\n build binary tree with pre-order and in-order sequence\\n :param preorder:\\n :param inorder:\\n :return:\\n \\\"\\\"\\\"\\n if len(preorder) == 0:\\n return None\\n if len(preorder) != len(inorder):\\n raise Exception(\\\"illegal tree data\\\")\\n\\n pos_root = inorder.index(preorder[0])\\n\\n if pos_root < 0:\\n raise Exception(\\\"illegal tree data\\\")\\n\\n # create root\\n left = None\\n right = None\\n if pos_root > 0:\\n left = self.buildTree(preorder[1:pos_root+1], inorder[0:pos_root])\\n if pos_root < len(inorder) - 1:\\n right = self.buildTree(preorder[pos_root+1:], inorder[pos_root+1:])\\n\\n rootNode = TreeNode(preorder[0], left, right)\\n\\n return rootNode\",\n \"memory\": \"56871\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n \\n \\\"\\\"\\\"\\n preorder = [3, 9, 20,15,7], \\n inorder = [9, 3, 15,20,7]\\n\\n Inorder is like left, root, right\\n Preorder is root, left, right\\n\\n From preorder we pick the root\\n Find the index in inorder \\n \\\"\\\"\\\"\\n\\n if len(preorder) == 0:\\n return None\\n\\n if len(preorder) == 1:\\n return TreeNode(preorder[0])\\n\\n # root node\\n rooNodeVal = preorder[0]\\n\\n treeNode = TreeNode(rooNodeVal)\\n\\n inOrderIndex = inorder.index(rooNodeVal)\\n\\n \\\"\\\"\\\"\\n preorder = [ 20, 15,7], \\n inorder = [ 15, 20, 7]\\n \\\"\\\"\\\"\\n treeNode.left = self.buildTree(preorder[1: inOrderIndex + 1], inorder[0: inOrderIndex])\\n treeNode.right = self.buildTree(preorder[inOrderIndex + 1: ], inorder[inOrderIndex + 1: ])\\n\\n return treeNode\\n\\n\\n\\n \",\n \"memory\": \"57765\"\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# 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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n \\n # The first element in preorder is always the root\\n root = TreeNode(preorder[0])\\n \\n # Find the root in inorder\\n mid = inorder.index(preorder[0])\\n \\n # Recursively construct left and right subtrees\\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])\\n \\n return root\",\n \"memory\": \"58659\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n if preorder == []:\\n return None\\n \\n def get_index_of_root_in_inorder(inorder, element):\\n\\n for index in range(len(inorder)):\\n if inorder[index] == element:\\n return index\\n \\n root = TreeNode(preorder[0])\\n index_of_root_in_inorder = get_index_of_root_in_inorder(inorder, preorder[0])\\n no_of_elements_in_left = index_of_root_in_inorder\\n no_of_elements_in_right = len(inorder) - index_of_root_in_inorder\\n root.left = self.buildTree(preorder[1: 1 + index_of_root_in_inorder], inorder[:index_of_root_in_inorder])\\n root.right = self.buildTree(preorder[1 + index_of_root_in_inorder:], inorder[index_of_root_in_inorder + 1:])\\n return root\\n \",\n \"memory\": \"59553\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder: return None\\n\\n left_size = inorder.index(preorder[0])\\n\\n left = self.buildTree(preorder[1:1+left_size], inorder[:left_size])\\n right = self.buildTree(preorder[1+left_size:], inorder[1+left_size:])\\n\\n return TreeNode(preorder[0], left, right)\",\n \"memory\": \"59553\"\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 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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return None\\n # The first element in preorder is the root of the current subtree\\n # Find the index of the root in inorder\\n root_inorder = inorder.index(preorder[0]) # this is also the number of nodes in the left subtree\\n left_subtree = self.buildTree(preorder[1:root_inorder+1], inorder[:root_inorder])\\n right_subtree = self.buildTree(preorder[root_inorder+1:], inorder[root_inorder+1:])\\n return TreeNode(preorder[0], left_subtree, right_subtree)\\n \",\n \"memory\": \"60446\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder) == 0:\\n return None\\n elif len(preorder) == 1:\\n return TreeNode(val = preorder[0])\\n else:\\n val = preorder[0]\\n i = 0 \\n while i < len(inorder):\\n if inorder[i] == val:\\n break\\n i += 1\\n left = self.buildTree(preorder[1:i+1], inorder[:i])\\n right = self.buildTree(preorder[i+1:], inorder[i+1:])\\n return TreeNode(val, left, right)\\n \\n \",\n \"memory\": \"60446\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if len(preorder) == 0:\\n return None\\n if len(preorder) == 1:\\n return TreeNode(preorder[0])\\n\\n root_val = preorder[0]\\n left_count = inorder.index(root_val)\\n # right_count = len(preorder) - left_count - 1\\n\\n left = self.buildTree(preorder[1 : 1 + left_count], inorder[:left_count])\\n right = self.buildTree(preorder[left_count + 1 :], inorder[left_count + 1 :])\\n\\n root = TreeNode(root_val)\\n root.left = left\\n root.right = right\\n return root\",\n \"memory\": \"61340\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n \\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])\\n\\n return root\",\n \"memory\": \"61340\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n\\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1:mid + 1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid + 1:])\\n return root\",\n \"memory\": \"62234\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder and not inorder:\\n return\\n \\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n\\n root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid + 1:], inorder[mid + 1:])\\n\\n return root\",\n \"memory\": \"62234\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n \\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n\\n root.left = self.buildTree(preorder[1 : mid + 1], inorder[ : mid])\\n root.right = self.buildTree(preorder[mid + 1 : ], inorder[mid + 1 :])\\n return root\\n \",\n \"memory\": \"63128\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n\\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1:mid + 1], inorder[:mid])\\n root.right = self.buildTree(preorder[mid+ 1:], inorder[mid+ 1:])\\n return root\\n \",\n \"memory\": \"63128\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n # print(\\\"preorder\\\", preorder)\\n # print(\\\"inorder\\\", inorder)\\n if not preorder:\\n return None\\n root_val = preorder[0]\\n for i in range(len(inorder)):\\n if inorder[i] == root_val:\\n inorder_left = inorder[:i]\\n inorder_right = inorder[i+1:]\\n preorder_left = preorder[1:len(inorder_left)+1]\\n preorder_right = preorder[1+len(inorder_left):]\\n return TreeNode(\\n val=root_val,\\n left=self.buildTree(preorder_left, inorder_left),\\n right=self.buildTree(preorder_right, inorder_right),\\n )\\n\",\n \"memory\": \"64021\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n\\n if not preorder:\\n return None\\n root = TreeNode(preorder[0])\\n mid = inorder.index(preorder[0])\\n root.left = self.buildTree(preorder[1:mid+1], inorder[0: mid+1])\\n root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])\\n return root\\n\",\n \"memory\": \"64021\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n # 如果参数是空列表，则返回空节点\\n if not preorder:\\n return None\\n # 获得根节点的值\\n root = preorder[0]\\n # 获得根节点的左右孩子的前/中序遍历结果\\n root_index = 0\\n for i in range(len(inorder)):\\n if inorder[i] == root:\\n root_index = i\\n break\\n left_child_inorder = inorder[0: root_index]\\n left_child_preorder = preorder[1: root_index + 1]\\n right_child_inorder = inorder[root_index + 1:]\\n right_child_preorder = preorder[root_index + 1:]\\n # 构建并返回根节点\\n return TreeNode(\\n val=root, \\n left=self.buildTree(preorder=left_child_preorder, inorder=left_child_inorder),\\n right=self.buildTree(preorder=right_child_preorder, inorder=right_child_inorder),\\n )\",\n \"memory\": \"64915\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder:\\n return None\\n \\n root_value = preorder[0]\\n root = TreeNode(root_value)\\n idx = inorder.index(root_value)\\n \\n left = self.buildTree(preorder[1:idx+1], inorder[:idx])\\n root.left = left\\n right = self.buildTree(preorder[idx+1:], inorder[idx+1:])\\n root.right = right\\n \\n return root\\n\",\n \"memory\": \"64915\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n self.current_tree = TreeNode(preorder[0])\\n\\n if len(preorder) == 1:\\n return self.current_tree\\n\\n def build(preorder, inorder, currTreeNode):\\n\\n def divide(preorder, inorder,):\\n p = 0\\n currNode = preorder[0]\\n\\n while inorder[p] != currNode:\\n p +=1\\n \\n left_inorder, right_inorder = inorder[:p], inorder[p+1:]\\n left_preorder, right_preorder = preorder[1:p], preorder[p+1:]\\n return left_inorder, left_preorder, right_inorder, right_preorder\\n \\n left_inorder, left_preorder, right_inorder, right_preorder = divide(preorder, inorder)\\n currTreeNode.val = preorder[0]\\n\\n if len(left_inorder) == 1:\\n newNode = TreeNode(left_inorder[0])\\n currTreeNode.left = newNode\\n elif left_inorder:\\n newNode = TreeNode(left_inorder[0])\\n currTreeNode.left = newNode\\n build(left_preorder, left_inorder, currTreeNode.left)\\n \\n if len(right_inorder) == 1:\\n newNode = TreeNode(right_inorder[0])\\n currTreeNode.right = newNode\\n elif right_inorder:\\n newNode = TreeNode(right_inorder[0])\\n currTreeNode.right = newNode\\n build(right_preorder, right_inorder, currTreeNode.right)\\n \\n\\n build(preorder,inorder, self.current_tree)\\n\\n return self.current_tree\\n\\n\\n\\n\\n \",\n \"memory\": \"65809\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n positions: Dict[int, int] = dict()\\n for i, x in enumerate(inorder):\\n positions[x] = i\\n return self.buildTreeWithDict(preorder, inorder, positions, 0)\\n\\n def buildTreeWithDict(\\n self,\\n preorder: List[int],\\n inorder: List[int],\\n inorder_positions: Dict[int, int],\\n shift: int,\\n ) -> Optional[TreeNode]:\\n if len(preorder) == 0:\\n return None\\n if len(preorder) == 1:\\n return TreeNode(preorder[0])\\n\\n root_val = preorder[0]\\n left_count = inorder_positions[root_val] - shift\\n\\n root = TreeNode(root_val)\\n root.left = self.buildTreeWithDict(\\n preorder[1 : 1 + left_count],\\n inorder[:left_count],\\n inorder_positions,\\n shift,\\n )\\n root.right = self.buildTreeWithDict(\\n preorder[left_count + 1 :],\\n inorder[left_count + 1 :],\\n inorder_positions,\\n shift + left_count + 1,\\n )\\n return root\\n\",\n \"memory\": \"66703\"\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 buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:\\n if not preorder or not inorder:\\n return None\\n preorder_stack = []\\n postorder_stack = []\\n \\n root_val = preorder[0]\\n in_order_root = inorder.index(root_val)\\n root = TreeNode(val=root_val)\\n root.left = self.buildTree(preorder[1:in_order_root+1], inorder[:in_order_root])\\n root.right = self.buildTree(preorder[in_order_root+1:], inorder[in_order_root+1:])\\n return root\\n\",\n \"memory\": \"66703\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":75,"string":"75"}}},{"rowIdx":159,"cells":{"question_id":{"kind":"number","value":106,"string":"106"},"name":{"kind":"string","value":"construct-binary-tree-from-inorder-and-postorder-traversal"},"content":{"kind":"string","value":"<p>Given two integer arrays <code>inorder</code> and <code>postorder</code> where <code>inorder</code> is the inorder traversal of a binary tree and <code>postorder</code> is the postorder traversal of the same tree, construct and return <em>the binary tree</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/02/19/tree.jpg\" style=\"width: 277px; height: 302px;\" />\n<pre>\n<strong>Input:</strong> inorder = [9,3,15,20,7], postorder = [9,15,7,20,3]\n<strong>Output:</strong> [3,9,20,null,null,15,7]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> inorder = [-1], postorder = [-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 <= inorder.length <= 3000</code></li>\n\t<li><code>postorder.length == inorder.length</code></li>\n\t<li><code>-3000 <= inorder[i], postorder[i] <= 3000</code></li>\n\t<li><code>inorder</code> and <code>postorder</code> consist of <strong>unique</strong> values.</li>\n\t<li>Each value of <code>postorder</code> also appears in <code>inorder</code>.</li>\n\t<li><code>inorder</code> is <strong>guaranteed</strong> to be the inorder traversal of the tree.</li>\n\t<li><code>postorder</code> is <strong>guaranteed</strong> to be the postorder traversal of the tree.</li>\n</ul>\n"},"acRate":{"kind":"number","value":64.25683129333852,"string":"64.256831"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","hash-table","divide-and-conquer","tree","binary-tree"],"string":"[\n \"array\",\n \"hash-table\",\n \"divide-and-conquer\",\n \"tree\",\n \"binary-tree\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"27\", 0.048], [\"29\", 0.016], [\"31\", 0.032], [\"33\", 0.2558], [\"35\", 0.2877], [\"37\", 0.7511], [\"39\", 1.9658], [\"42\", 1.9179], [\"44\", 3.8836], [\"46\", 3.7558], [\"48\", 5.306], [\"50\", 5.3381], [\"52\", 5.290100000000001], [\"55\", 5.1302], [\"57\", 2.4772], [\"59\", 0.9909000000000001], [\"61\", 0.4475], [\"63\", 0.1118], [\"65\", 0.0639], [\"67\", 0.1119], [\"70\", 0.1119], [\"72\", 0.0639], [\"74\", 0.19180000000000003], [\"76\", 0.2877], [\"78\", 0.27170000000000005], [\"80\", 0.3356], [\"82\", 0.4156], [\"85\", 0.3516], [\"87\", 0.3516], [\"89\", 0.5434], [\"91\", 0.6073], [\"93\", 0.6393], [\"95\", 0.7033], [\"98\", 1.758], [\"100\", 1.1667], [\"102\", 1.5183], [\"104\", 1.9818], [\"106\", 1.9339], [\"108\", 1.9818], [\"110\", 2.1096], [\"113\", 2.4293], [\"115\", 1.3904], [\"117\", 1.3266], [\"119\", 1.4384], [\"121\", 1.4544000000000001], [\"123\", 1.774], [\"125\", 2.9566], [\"128\", 2.4453], [\"130\", 2.5412], [\"132\", 2.2055], [\"134\", 2.1256], [\"136\", 2.3014], [\"138\", 2.0457], [\"141\", 2.6051], [\"143\", 1.774], [\"145\", 1.5183], [\"147\", 1.4224], [\"149\", 1.0229], [\"151\", 0.6552], [\"153\", 0.4155], [\"156\", 0.7351], [\"158\", 0.3197], [\"160\", 0.2398], [\"162\", 0.2077], [\"164\", 0.1439], [\"166\", 0.1598], [\"168\", 0.23970000000000002], [\"171\", 0.1278], [\"173\", 0.14379999999999998], [\"175\", 0.1118], [\"177\", 0.1119], [\"179\", 0.0639], [\"181\", 0.14379999999999998], [\"184\", 0.1118], [\"186\", 0.0799], [\"188\", 0.0799], [\"190\", 0.1278], [\"192\", 0.1439], [\"194\", 0.1598], [\"196\", 0.1758]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"17400\", 0.032], [\"17600\", 0.0799], [\"17700\", 0.3196], [\"17800\", 0.5274], [\"17900\", 1.4863], [\"18000\", 1.2626], [\"18100\", 2.0617], [\"18200\", 6.4728], [\"18300\", 15.3908], [\"18400\", 5.6577], [\"18500\", 3.7558], [\"18600\", 3.8357], [\"18700\", 1.2786], [\"18800\", 0.1918], [\"18900\", 0.1918], [\"19000\", 0.2557], [\"19100\", 0.0799], [\"19200\", 0.016], [\"19300\", 0.016], [\"19400\", 0.016], [\"20100\", 0.016], [\"20700\", 0.016], [\"21200\", 0.016], [\"23300\", 0.016], [\"52300\", 0.016], [\"52400\", 0.032], [\"52600\", 0.0799], [\"52700\", 0.3516], [\"52800\", 0.911], [\"52900\", 8.8221], [\"53000\", 7.176], [\"53100\", 0.863], [\"53200\", 0.5114], [\"53300\", 0.2557], [\"53400\", 0.1918], [\"53500\", 0.0479], [\"54000\", 0.0479], [\"55500\", 0.016], [\"55600\", 0.032], [\"55700\", 0.016], [\"87400\", 0.016], [\"87500\", 0.0479], [\"87600\", 0.016], [\"87800\", 0.0639], [\"87900\", 0.0799], [\"88000\", 0.6872], [\"88100\", 1.3745], [\"88200\", 3.0206], [\"88300\", 14.7515], [\"88400\", 6.4088], [\"88500\", 1.4064], [\"88600\", 1.1507], [\"88700\", 1.8539]]}"},"rt_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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n def helper(l, r):\n if l>r:\n return None \n\n value = postorder.pop()\n node = TreeNode(value)\n\n node.right = helper(mapp[value]+1, r)\n node.left = helper(l, mapp[value]-1)\n\n return node\n\n\n\n mapp = {}\n\n for i in range(len(inorder)):\n mapp[inorder[i]] = i \n\n return helper(0, len(inorder)-1)","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n hmap = {val: idx for idx, val in enumerate(inorder)}\n def build(inStart, inEnd):\n if inStart > inEnd:\n return None\n root = TreeNode(postorder.pop())\n root.right = build(hmap[root.val] + 1, inEnd)\n root.left = build(inStart, hmap[root.val] - 1)\n return root \n return build(0, len(inorder)-1)","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]: \n print(postorder)\n def build(left, right):\n # if there are no elements to construct the tree\n if left > right:\n return None\n \n # select the preorder_index element as the root and increment it\n root = TreeNode(postorder.pop()) \n\n # build left and right subtree excluding inorder_index_map[root_value] element because it's the root\n root.right = build(inorder_hashmap[root.val]+1, right)\n root.left = build(left, inorder_hashmap[root.val]-1) \n \n return root\n \n \n # build a hashmap to store value -> its index relations\n inorder_hashmap = {}\n\n for i in range(len(inorder)):\n inorder_hashmap[inorder[i]] = i\n return build(0, len(inorder)-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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n inorderIdx = {v:i for i, v in enumerate(inorder)}\n def helper(l, r):\n if l > r:\n return None\n root = TreeNode(postorder.pop())\n idx = inorderIdx[root.val]\n root.right = helper(idx + 1, r)\n root.left = helper(l, idx - 1)\n return root\n return helper(0, len(inorder) - 1)","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n n = len(inorder)\n stack = []\n nodeset = set()\n postIndex = n - 1\n root = None\n\n p = n - 1\n i = n - 1\n\n while p >= 0:\n # node = None\n # print(stack)\n while True:\n node = TreeNode(postorder[p])\n\n if root == None:\n root = node\n \n if stack:\n # Check if the top of the stack is present in the tracked nodes\n if stack[-1] in nodeset: \n nodeset.remove(stack[-1])\n stack[-1].left = node\n stack.pop()\n else:\n stack[-1].right = node\n\n stack.append(node)\n p -= 1\n\n # Found the right most tree\n if postorder[p + 1] == inorder[i] or p < 0:\n break\n\n node = None\n \n # Remove all the right children from the inorder which have been placed before\n # Find a node such that it contains a left node but hasn't been tracked yet\n while stack and i >= 0 and stack[-1].val == inorder[i]:\n node = stack[-1]\n stack.pop()\n i -= 1\n \n # Put the node which contains a potential left node in the track nodes list\n if node:\n nodeset.add(node)\n stack.append(node)\n\n return root\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n inMap = {}\n for i in range(len(inorder)):\n inMap[inorder[i]] = i\n def construct(post, postStart, postEnd, In, inStart, inEnd):\n if postStart>=postEnd or inStart>=inEnd:\n return None\n rootVal = post[postEnd-1]\n root = TreeNode(rootVal)\n inRoot = inMap[rootVal]\n numsLeft = inRoot-inStart\n root.left = construct(post, postStart, postStart + numsLeft, In, inStart, inRoot)\n root.right = construct(post, postStart + numsLeft, postEnd-1, In, inRoot+1, inEnd)\n return root\n return construct(postorder, 0, len(postorder), inorder, 0, len(inorder))\n ","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n def helper(in_left, in_right):\n if in_left > in_right:\n return None\n node = postorder.pop()\n root = TreeNode(node)\n index = idx_map[node]\n root.right = helper(index+1, in_right)\n root.left = helper(in_left, index-1)\n\n return root\n\n\n idx_map = {val:idx for idx,val in enumerate(inorder)}\n return helper(0,len(inorder)-1 )","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n self.postOrderIndex = len(postorder)-1\n self.inorderDict = {}\n for index in range(len(inorder)):\n self.inorderDict[inorder[index]] = index\n return self.buildTreeDFS(postorder,0,len(postorder)-1)\n \n def buildTreeDFS(self,postorder,left,right):\n if left > right:\n return None\n else:\n value = postorder[self.postOrderIndex]\n self.postOrderIndex -= 1\n root = TreeNode(value)\n root.right = self.buildTreeDFS(postorder,self.inorderDict[value]+1,right)\n root.left = self.buildTreeDFS(postorder,left,self.inorderDict[value]-1)\n return root","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n inorderMap = {}\n for i,v in enumerate(inorder):\n inorderMap[v] = i\n\n def helper(low, high):\n if low > high:\n return None\n\n rootVal = postorder.pop()\n rootIndex = inorderMap[rootVal]\n root = TreeNode(rootVal)\n root.right = helper(rootIndex+1, high)\n root.left = helper(low, rootIndex-1)\n return root\n return helper(0, len(inorder)-1) \n\n ","runtime":"35"},{"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 buildTree(self, inorder: list[int], postorder: list[int]) -> TreeNode:\n # Create a map to quickly find the index of a value in inorder list\n inorder_map = {val: idx for idx, val in enumerate(inorder)}\n \n def helper(in_left, in_right):\n if in_left > in_right:\n return None\n \n # The last element in postorder is the root of the current subtree\n root_val = postorder.pop()\n root = TreeNode(root_val)\n \n # Find the index of the root in inorder to split left and right subtrees\n index = inorder_map[root_val]\n \n # Build the right subtree first because we are popping from the end of postorder\n root.right = helper(index + 1, in_right)\n # Build the left subtree\n root.left = helper(in_left, index - 1)\n \n return root\n \n return helper(0, len(inorder) - 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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n # intuition:\n # tail of post order is always head of tree, left of head in inorder is left tree, right of head val is right\n # recursion with indexes on inorder\n # maintain global index for post order\n # base: left > right: return None\n # recursive:\n # 1. save post order idx value into tree node\n # 2. decriment post order val\n # 3. find inorder index\n # 4. do right first, node.right = _helper(inorder_idx + 1, right)\n # 5. left -> helper (left, inorder_idx - 1)\n\n def _helper(left_iix, right_iix):\n if left_iix > right_iix:\n return None\n nonlocal post_idx\n head = TreeNode(val=postorder[post_idx])\n post_idx -= 1\n iidx = iidx_map[head.val]\n head.right = _helper(iidx+1, right_iix)\n head.left = _helper(left_iix, iidx-1)\n return head\n\n\n\n\n # run code\n post_idx = len(postorder)-1\n # make faster, use o(1) lookup for inorder idx\n iidx_map = {v:i for i,v in enumerate(inorder)}\n return _helper(0, len(inorder)-1)","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n inorderIdx = {v:i for i, v in enumerate(inorder)}\n\n def helper(l,r):\n if l > r:\n return None\n\n root = TreeNode(postorder.pop())\n\n idx = inorderIdx[root.val]\n root.right = helper(idx + 1, r)\n root.left = helper(l, idx - 1)\n return root\n\n return helper(0, len(inorder) - 1)\n \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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n inorder_idx = {v: i for i, v in enumerate(inorder)}\n\n def helper(l, r):\n if l > r:\n return None\n\n root = TreeNode(postorder.pop())\n\n idx = inorder_idx[root.val]\n root.right = helper(idx + 1, r)\n root.left = helper(l, idx - 1)\n print(root.val, root.left.val if root.left != None else None, root.right.val if root.right != None else None)\n return root\n return helper(0, len(inorder) - 1)","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 __init__(self):\n self.reverse_postorder_index = 0\n\n def helper(self, inorder, left, right, reverse_postorders):\n # Modified Preorder traversal (root, right, left)\n this_node = TreeNode(reverse_postorders[self.reverse_postorder_index])\n\n inorder_index = self.inorder_val_to_idx[reverse_postorders[self.reverse_postorder_index]]\n\n right_tree_size = right - inorder_index\n left_tree_size = inorder_index - left\n\n self.reverse_postorder_index += 1\n\n if right_tree_size > 0:\n this_node.right = self.helper(inorder, inorder_index + 1, right, reverse_postorders)\n if left_tree_size > 0:\n this_node.left = self.helper(inorder, left, inorder_index - 1, reverse_postorders)\n \n return this_node\n\n\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n self.inorder_val_to_idx = {val: idx for idx, val in enumerate(inorder)}\n postorder.reverse()\n\n return self.helper(inorder, 0, len(inorder) - 1, postorder)","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n val_idx = {inorder[i]: i for i in range(len(inorder))}\n n = len(inorder) \n \n def createTree(i_st, i_end):\n if i_st > i_end:\n return None\n \n node = TreeNode(postorder.pop())\n idx = val_idx[node.val]\n node.right = createTree(idx+1, i_end)\n node.left = createTree(i_st, idx-1)\n return node\n\n return createTree(0, n-1)","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 '''\n inorder = [left ... root ... right]\n postorder = [..... left right root]\n '''\n\n def dfs(self, inorder, postorder, idxMap, left, right):\n if left > right:\n return None\n\n value = postorder[self.postorderIdx]\n self.postorderIdx -= 1\n\n newNode = TreeNode(value)\n\n inorderIdx = idxMap[value]\n\n newNode.right = self.dfs(inorder, postorder, idxMap, inorderIdx + 1, right)\n newNode.left = self.dfs(inorder, postorder, idxMap, left, inorderIdx - 1)\n\n return newNode\n\n\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n n = len(inorder)\n \n idxMap = {value: idx for idx, value in enumerate(inorder)}\n self.postorderIdx = n - 1\n\n return self.dfs(inorder, postorder, idxMap, 0, n - 1)","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n mapping = {val: ix for ix, val in enumerate(inorder)}\n\n def helper(l,r):\n if l > r:\n return None\n \n curr = postorder.pop()\n node = TreeNode(curr)\n if l == r:\n return node\n \n ix = mapping[curr]\n\n node.right = helper(ix+1, r)\n node.left = helper(l, ix -1)\n\n return node\n \n return helper(0, len(postorder)-1)\n ","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\n def buildTree1(self,postorder,inorder,p1,p2,i1,i2,inorder_map):\n if p1 > p2:\n #print(\"p1,p2:\",p1,p2)\n return\n #print(\"p1:\",p1)\n #print(\"p2:\",p2)\n #print(\"i1:\",i1)\n #print(\"i2:\",i2)\n root = TreeNode(postorder[p2]) \n x = inorder_map[postorder[p2]] \n\n root.left = self.buildTree1(postorder,inorder,p1,x-i1+p1-1,i1,x-1,inorder_map) \n root.right = self.buildTree1(postorder,inorder,x-i1+p1,p2-1,x+1,i2,inorder_map)\n return root\n\n\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n inorder_map = {}\n i2 = len(inorder)\n\n for i in range(i2):\n inorder_map[inorder[i]] = i\n\n return(self.buildTree1(postorder,inorder,0,len(postorder)-1,0,i2-1,inorder_map)) \n\n\n ","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 \n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n mp = {}\n for idx, val in enumerate(inorder):\n mp[val] = idx\n \n cur_idx = len(postorder) - 1\n \n def build(inorder, postorder, l, r) -> TreeNode:\n if(r - l + 1 < 1):\n return None\n \n nonlocal cur_idx\n root = postorder[cur_idx]\n cur_idx -= 1\n m = mp[root]\n\n right = build(inorder, postorder, m+1, r)\n left = build(inorder, postorder, l, m-1)\n\n return TreeNode(root, left, right)\n \n return build(inorder, postorder, 0, len(inorder) - 1)","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n rightFirstOrder = postorder[::-1]\n indiceDict = {num: idx for idx, num in enumerate(inorder)}\n\n def helper(pl: int, pr: int, il: int, ir: int) -> Optional[TreeNode]:\n if pl > pr:\n return None\n root_val = rightFirstOrder[pl]\n root = TreeNode(root_val)\n\n ind_of_root_inorder = indiceDict[root_val]\n right_tree_size = ir - ind_of_root_inorder\n root.left = helper(pl + right_tree_size + 1, pr, il, ind_of_root_inorder - 1)\n root.right = helper(pl + 1, pl + right_tree_size, ind_of_root_inorder + 1, ir)\n return root\n return helper(0, len(postorder) - 1, 0, len(inorder) - 1) ","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n mapper = {v: i for i, v in enumerate(inorder)}\n\n def builder(l, r):\n if l > r:\n return None\n root = TreeNode(postorder.pop())\n val = mapper[root.val]\n root.right = builder(val + 1, r)\n root.left = builder(l, val - 1)\n return root\n\n return builder(0, len(inorder) - 1)","runtime":"52"},{"code":"class Solution:\n def buildTree(self, inorder: list[int], postorder: list[int]) -> TreeNode | None:\n in_index_map = dict(map(reversed, enumerate(inorder)))\n \n def build_tree(post_end: int, in_start: int, in_end: int) -> tuple[TreeNode | None, int]:\n if in_start >= in_end: return None, post_end\n \n root_val = postorder[post_end]\n root_index = in_index_map[root_val]\n \n r_tree, post_start = build_tree(post_end - 1, root_index + 1, in_end)\n l_tree, post_start = build_tree(post_start, in_start, root_index)\n \n return TreeNode(root_val, l_tree, r_tree), post_start\n \n return build_tree(len(postorder) - 1, 0, len(inorder))[0]\n","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n inorderidx = {v : i for i, v in enumerate(inorder)}\n\n def build(l, r):\n if l>r:\n return None\n\n root = TreeNode(postorder.pop())\n idx = inorderidx[root.val]\n \n root.right = build(idx+1, r)\n root.left = build(l, idx-1)\n\n return root\n\n return build(0, len(inorder)-1)\n\n \n ","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n in_map = {}\n for i in range(len(inorder)):\n in_map[inorder[i]] = i\n\n def dfs(inorder, instart, inend, postorder,poststart,postend,in_map):\n \n if instart > inend or poststart < postend:\n return\n\n curr = postorder[poststart]\n inorder_idx = in_map[curr]\n right_nums = inend - inorder_idx \n root = TreeNode(curr)\n\n root.right = dfs(inorder, inorder_idx + 1, inend, postorder, poststart - 1, poststart - right_nums, in_map)\n root.left = dfs(inorder, instart, inorder_idx - 1, postorder, poststart - right_nums - 1, postend, in_map)\n\n return root\n\n return dfs(inorder, 0, len(inorder)-1, postorder, len(postorder)-1, 0, in_map)\n\n ","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n indices = dict()\n for i in range(len(inorder)):\n indices[inorder[i]] = i\n\n return self.build(inorder, 0, len(inorder)-1, postorder, 0, len(postorder)-1, indices)\n \n def build(self, inorder, iStart, iEnd, postorder, pStart, pEnd, indices)-> Optional[TreeNode]:\n if pStart > pEnd or iStart >iEnd:\n return \n root = postorder[pEnd]\n node = TreeNode(val=root)\n\n index = indices[root]\n leftNodes = index - iStart # important case\n\n node.left = self.build(inorder, iStart, index-1, postorder, pStart, pStart+leftNodes-1, indices)\n node.right = self.build(inorder, index+1, iEnd, postorder, pStart+leftNodes, pEnd-1, indices)\n\n return node\n \n return node\n","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 def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n postorder = postorder[::-1]\n d = {}\n for i, x in enumerate(inorder):\n d[x] = i\n # 在inorder两边分治\n def dfs(root, left, right):\n if left > right:\n return None\n node = TreeNode(val=postorder[root])\n idx = d[postorder[root]]\n node.right = dfs(root+1, idx+1, right)\n node.left = dfs(root+right-idx+1, left, idx-1)\n return node\n\n return dfs(0, 0, len(postorder)-1)","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 def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n postorder = postorder[::-1]\n d = {}\n for i, x in enumerate(inorder):\n d[x] = i\n\n def dfs(root, left, right):\n if left > right:\n return None\n node = TreeNode(val=postorder[root])\n idx = d[postorder[root]]\n node.right = dfs(root+1, idx+1, right)\n node.left = dfs(root+right-idx+1, left, idx-1)\n return node\n\n return dfs(0, 0, len(postorder)-1)","runtime":"59"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> TreeNode:\n def helper(in_left: int, in_right: int) -> TreeNode:\n # if there are no elements to construct subtrees\n if in_left > in_right:\n return None\n\n # pick up the last element as a root\n val = postorder.pop()\n root = TreeNode(val)\n\n # root splits inorder list\n # into left and right subtrees\n index = idx_map[val]\n\n # build the right subtree\n root.right = helper(index + 1, in_right)\n # build the left subtree\n root.left = helper(in_left, index - 1)\n return root\n\n # build a hashmap value -> its index\n idx_map = {val: idx for idx, val in enumerate(inorder)}\n return helper(0, len(inorder) - 1)\n ","runtime":"59"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n inmap = {val:ind for ind,val in enumerate(inorder)}\n\n return self.build(inorder, 0,len(inorder)-1,postorder, 0,len(postorder)-1,inmap)\n\n def build(self, inorder, ins,ie ,postorder,ps, pe, inmap):\n if ps > pe or ins > ie:\n return None\n root = TreeNode(postorder[pe])\n inroot = inmap[root.val]\n\n numsleft = inroot - ins\n root.left = self.build(inorder, ins,inroot - 1 ,postorder,ps, ps + numsleft -1, inmap)\n root.right = self.build(inorder, inroot + 1,ie ,postorder,ps+numsleft, pe -1, inmap) \n return root","runtime":"61"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n mapping = {value: index for index,value in enumerate(inorder)}\n\n postorder = deque(postorder)\n\n def build(start,end):\n \n if start>end: return None\n root = TreeNode(postorder.pop())\n mid = mapping[root.val]\n root.right = build(mid +1, end)\n root.left = build(start, mid - 1)\n \n return root\n \n return build(0, len(postorder)-1)","runtime":"61"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n idx = {j:i for i, j in enumerate(inorder)}\n post_idx = len(postorder) - 1\n def build(left, right):\n nonlocal post_idx\n if left > right:\n return None\n print(post_idx, left, right)\n root_val = postorder[post_idx]\n post_idx -= 1\n root_idx = idx[root_val]\n root = TreeNode(root_val)\n root.right = build(root_idx + 1, right)\n root.left = build(left, root_idx - 1)\n return root\n return build(0, len(inorder) - 1)\n\n \n","runtime":"63"},{"code":"class Solution:\n def buildTree(\n self,\n inorder: list[int],\n postorder: list[int],\n ) -> TreeNode | None:\n inToIndex = {num: i for i, num in enumerate(inorder)}\n\n def build(\n inStart: int,\n inEnd: int,\n postStart: int,\n postEnd: int,\n ) -> TreeNode | None:\n if inStart > inEnd:\n return None\n\n rootVal = postorder[postEnd]\n rootInIndex = inToIndex[rootVal]\n leftSize = rootInIndex - inStart\n\n root = TreeNode(rootVal)\n root.left = build(inStart, rootInIndex - 1, postStart,\n postStart + leftSize - 1)\n root.right = build(rootInIndex + 1, inEnd, postStart + leftSize,\n postEnd - 1)\n return root\n\n return build(0, len(inorder) - 1, 0, len(postorder) - 1)","runtime":"63"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n def constructTree(inorder, postorder, inhash, sI, eI, sP, eP):\n\n if sI > eI:\n return\n\n ind = inhash[postorder[eP]]\n root = TreeNode(inorder[ind])\n lSize = ind - sI\n\n root.left = constructTree(inorder, postorder, inhash, sI, ind - 1, sP, sP + lSize - 1)\n root.right = constructTree(inorder, postorder, inhash, ind + 1, eI, sP + lSize, eP - 1)\n\n return root\n\n n = len(inorder)\n\n inhash = {}\n for i in range(n):\n inhash[inorder[i]] = i\n\n return constructTree(inorder, postorder, inhash, 0, n - 1, 0, n - 1)\n","runtime":"65"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n inorder=inorder[::-1]\n postorder=postorder[::-1]\n tree=TreeNode(postorder[0])\n self.idk(postorder.pop(0),inorder,postorder,tree)\n return tree\n def idk(self,mid,inorder,postorder,tree):\n right=inorder[0:inorder.index(mid)]\n left=inorder[inorder.index(mid)+1:len(inorder)]\n if (len(right)!=0):\n tree.right=TreeNode(postorder[0])\n org=tree\n tree=tree.right\n self.idk(postorder.pop(0),right,postorder,tree)\n tree=org\n if (len(left)!=0):\n tree.left=TreeNode(postorder[0])\n org=tree\n tree=tree.left\n self.idk(postorder.pop(0),left,postorder,tree)\n tree=org\n\n","runtime":"67"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n '''\n inorder = [1,9,2,3,15,20,7], postorder = [1,2,9,15,7,20,3]\n\n postorder[-1] is the root.\n idx -> index of postorder[-1] in inorder-> left subtree : inorder[:idx-1] and inorder[idx+1:] -> right subtree.\n\n for next, divide into \n look at postorder[:idx-1] as left subtree in postorder and postorder[idx:len-1] as right subtree\n\n\n\n '''\n\n\n def traversal(inOrder_start,inOrder_end):\n # print(inOrder_start,inOrder_end)\n\n if inOrder_start>=len(inorder) or inOrder_end<0 or inOrder_start>inOrder_end:\n return None\n\n root = TreeNode(postorder.pop())\n\n idx = inorder.index(root.val) # time complexity for this can be further reduced by storing inorder as a hashmap. because index() is O(N) and hashmap gives indices in O(1)\n\n root.right = traversal(idx+1,inOrder_end)\n root.left = traversal(inOrder_start,idx-1)\n \n return root\n \n return traversal(0,len(inorder)-1)","runtime":"67"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n def dfs(start, end, postorder_ind):\n if end == start:\n return None\n\n curr_root = postorder[postorder_ind]\n root_ind = inorder.index(curr_root)\n\n root_node = TreeNode(curr_root)\n\n root_node.right = dfs(root_ind + 1, end, postorder_ind - 1)\n root_node.left = dfs(start, root_ind, postorder_ind - 1 - (end - root_ind - 1))\n\n return root_node\n\n return dfs(0, len(postorder), len(postorder) - 1)\n \n '''\n reading\n\n construct binary binary tree from arrays of inorder and postorder\n\n info:\n\n what does inorder array tell us\n for any element, it tells us that anything to left of it is left in tree\n and same for right\n\n for post order, anything to left is part of its subtrees\n\n how to get division of when it is left and when it is right subtree?\n\n inorder can also tell us what partition is left and right subtree\n\n inorder doesn't tell us what is the root of that subtree\n can postorder tell us\n\n if we go in reverse of postorder, it can give us the roots if we go from right to left\n\n 9,3,15,20,7\n 3 is the root\n split [9], [15,20,7]\n go to right first\n next post order root is 20\n [15,20,7]\n split [15], [7]\n go right\n next postorder root is 7\n split none and return\n can go left now\n next postorder root is 15\n\n '''\n ","runtime":"70"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n self.inorder = inorder\n self.postorder = postorder\n return self.dfs(0, len(self.inorder)-1, 0, len(postorder)-1)\n\n def dfs(self, in_l, in_r, po_l, po_r):\n # If index out of range return an empty tree node\n if in_l > in_r or po_l > po_r:\n return None\n\n # Create the current parent node\n parent = TreeNode(self.postorder[po_r])\n\n # Index of the parent value in inorder array\n inorder_parent_idx = self.inorder.index(parent.val)\n\n # New index range for the left subtree: inorder\n new_in_left = in_l\n new_in_right = inorder_parent_idx - 1\n\n # New index range for the left subtree: postorder\n new_po_left = po_l\n new_po_right = po_l + (new_in_right - new_in_left)\n\n # Generate left and right subtree\n parent.left = self.dfs(new_in_left, new_in_right, new_po_left, new_po_right)\n parent.right = self.dfs(inorder_parent_idx+1, in_r, new_po_right+1, po_r-1)\n\n # Return the parent node\n return parent\n\n","runtime":"70"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n postorder_ind = [len(postorder) - 1]\n def dfs(start, end):\n if end == start:\n return None\n\n curr_root = postorder[postorder_ind[0]]\n postorder_ind[0] -= 1\n root_ind = inorder.index(curr_root)\n\n root_node = TreeNode(curr_root)\n\n root_node.right = dfs(root_ind + 1, end)\n root_node.left = dfs(start, root_ind)\n\n return root_node\n\n return dfs(0, len(postorder))\n \n '''\n reading\n\n construct binary binary tree from arrays of inorder and postorder\n\n info:\n\n what does inorder array tell us\n for any element, it tells us that anything to left of it is left in tree\n and same for right\n\n for post order, anything to left is part of its subtrees\n\n how to get division of when it is left and when it is right subtree?\n\n inorder can also tell us what partition is left and right subtree\n\n inorder doesn't tell us what is the root of that subtree\n can postorder tell us\n\n if we go in reverse of postorder, it can give us the roots if we go from right to left\n\n 9,3,15,20,7\n 3 is the root\n split [9], [15,20,7]\n go to right first\n next post order root is 20\n [15,20,7]\n split [15], [7]\n go right\n next postorder root is 7\n split none and return\n can go left now\n next postorder root is 15\n\n '''\n ","runtime":"72"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n root_idx = len(postorder) - 1\n \n def build_subtree(start_idx, end_idx):\n nonlocal root_idx\n if start_idx == end_idx:\n root_idx -= 1\n return TreeNode(val=inorder[start_idx])\n if start_idx > end_idx:\n return None\n \n sub_root = TreeNode(val=postorder[root_idx])\n inorder_root_idx = inorder.index(postorder[root_idx])\n root_idx -= 1\n # check the inorder_root_idx + 1\n sub_root.right = build_subtree(inorder_root_idx + 1, end_idx)\n sub_root.left = build_subtree(start_idx, inorder_root_idx - 1)\n return sub_root\n\n root = build_subtree(0, len(inorder) - 1)\n return root","runtime":"74"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n # from the last of postorder \n def helper(in_left, in_right):\n if in_left > in_right:\n return None \n\n val = postorder.pop()\n head = TreeNode(val)\n\n ind = inorder.index(val)\n\n head.right = helper(ind+1, in_right)\n head.left = helper(in_left, ind -1)\n \n return head\n\n return helper(0, len(inorder) - 1)\n\n \n \n ","runtime":"74"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n def help(i, j):\n if i > j:\n return None\n \n nonlocal post_index\n val = postorder[post_index]\n index = inorder.index(val)\n post_index -= 1\n\n root = TreeNode(val)\n root.right = help(index + 1, j)\n root.left = help(i, index - 1)\n return root\n \n post_index = len(postorder) - 1\n return help(0, len(inorder) - 1)","runtime":"76"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not postorder: return None\n\n def _build_tree_helper(left: int, right: int) -> TreeNode:\n if right < left: return\n node = TreeNode(postorder.pop())\n node_idx = inorder.index(node.val)\n node.right = _build_tree_helper(node_idx+1, right)\n node.left = _build_tree_helper(left, node_idx-1)\n return node\n \n return _build_tree_helper(0, len(inorder) - 1)","runtime":"76"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n n = len(inorder)\n idx = [n-1]\n def recurse(idx, left, right):\n if left>right:\n return None\n ele = postorder[idx[0]]\n idx[0]-=1\n node = TreeNode(ele)\n if left==right:\n return node\n ele_idx = inorder.index(ele, left, right+1)\n node.right= recurse(idx, ele_idx+1, right)\n node.left = recurse(idx, left, ele_idx-1)\n return node\n root = recurse(idx, 0, len(inorder)-1)\n return root","runtime":"78"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n def helper(left,right):\n if left > right:\n return None \n root=TreeNode(postorder.pop())\n index=inorder.index(root.val)\n root.right=helper(index+1,right)\n root.left=helper(left,index-1)\n return root\n return helper(0,len(inorder)-1)\n\n\n\n ","runtime":"78"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n #. 0 1 2. 3 \n # inorder : 8 9 10 3 15 20 7 \n #. ---L-- R ---Ri--\n # posorder: 8 10 9 3 15 20 7\n #. --L--- ---Ri-- R \n\n return self.solve(inorder, 0, len(inorder) - 1, postorder, 0, len(postorder) - 1) \n\n def solve(self, io, is_, ie, po, ps, pe): \n if is_ > ie or ps > pe: \n return \n\n root = TreeNode(po[pe]) \n i_r_idx = io.index(root.val) \n length = i_r_idx - is_ \n root.left = self.solve(io, is_, i_r_idx - 1, po, ps, ps + length - 1)\n root.right = self.solve(io, i_r_idx + 1, ie, po, ps + length, pe - 1)\n\n return root ","runtime":"80"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n #. 0 1 2. 3 \n # inorder : 8 9 10 3 15 20 7 \n #. ---L-- R ---Ri--\n # posorder: 8 10 9 3 15 20 7\n #. --L--- ---Ri-- R \n\n return self.solve(inorder, 0, len(inorder) - 1, postorder, 0, len(postorder) - 1) \n\n def solve(self, io, is_, ie, po, ps, pe): \n if is_ > ie or ps > pe: \n return \n\n root = TreeNode(po[pe]) \n i_r_idx = io.index(root.val) \n length = i_r_idx - is_ \n root.left = self.solve(io, is_, i_r_idx - 1, po, ps, ps + length - 1)\n root.right = self.solve(io, i_r_idx + 1, ie, po, ps + length, pe - 1)\n\n return root ","runtime":"80"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n return self.build(inorder, postorder, 0, len(inorder) - 1, 0, len(postorder) - 1)\n \n def build(self, inorder: List[int], postorder: List[int], in_start: int, in_end: int, post_start: int, post_end: int) -> Optional[TreeNode]:\n if in_start > in_end:\n return None\n \n root_val = postorder[post_end]\n root = TreeNode(root_val)\n\n root_inorder_idx = inorder.index(root_val)\n\n root.left = self.build(inorder, postorder, in_start, root_inorder_idx - 1, post_start, post_start + root_inorder_idx - in_start - 1)\n root.right = self.build(inorder, postorder, root_inorder_idx + 1, in_end, post_start + root_inorder_idx - in_start, post_end - 1)\n\n return root\n ","runtime":"82"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n postorder_ind = [len(postorder) - 1]\n def dfs(start, end):\n print(start, end)\n if end == start:\n return None\n if end - start == 1:\n postorder_ind[0] -= 1\n return TreeNode(inorder[start])\n curr_root = postorder[postorder_ind[0]]\n print(curr_root)\n postorder_ind[0] -= 1\n root_ind = inorder.index(curr_root)\n\n root_node = TreeNode(curr_root)\n\n root_node.right = dfs(root_ind + 1, end)\n root_node.left = dfs(start, root_ind)\n\n return root_node\n\n return dfs(0, len(postorder))\n \n '''\n reading\n\n construct binary binary tree from arrays of inorder and postorder\n\n info:\n\n what does inorder array tell us\n for any element, it tells us that anything to left of it is left in tree\n and same for right\n\n for post order, anything to left is part of its subtrees\n\n how to get division of when it is left and when it is right subtree?\n\n inorder can also tell us what partition is left and right subtree\n\n inorder doesn't tell us what is the root of that subtree\n can postorder tell us\n\n if we go in reverse of postorder, it can give us the roots if we go from right to left\n\n 9,3,15,20,7\n 3 is the root\n split [9], [15,20,7]\n go to right first\n next post order root is 20\n [15,20,7]\n split [15], [7]\n go right\n next postorder root is 7\n split none and return\n can go left now\n next postorder root is 15\n\n '''\n ","runtime":"82"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n '''\n inorder = [1,9,2,3,15,20,7], postorder = [1,2,9,15,7,20,3]\n\n postorder[-1] is the root.\n idx -> index of postorder[-1] in inorder-> left subtree : inorder[:idx-1] and inorder[idx+1:] -> right subtree.\n\n for next, divide into \n look at postorder[:idx-1] as left subtree in postorder and postorder[idx:len-1] as right subtree\n\n\n\n '''\n\n\n def traversal(inOrder_start,inOrder_end):\n # print(inOrder_start,inOrder_end)\n\n if inOrder_start>=len(inorder) or inOrder_end<0 or inOrder_start>inOrder_end:\n return None\n\n root = TreeNode(postorder.pop())\n\n idx = inorder.index(root.val)\n\n root.right = traversal(idx+1,inOrder_end)\n root.left = traversal(inOrder_start,idx-1)\n \n return root\n \n return traversal(0,len(inorder)-1)","runtime":"85"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n # 这个条件是必要的，因为在递归过程中，可能会遇到子树为空的情况。虽然题目给出了 1 <= inorder.length <= 3000，\n # 但这个条件描述的是输入的原始列表的长度，而不是递归过程中子问题的长度。\n # 如果在 inorder 或 postorder 中没有剩下任何元素（[]），意味着我们已经找到了一个叶子节点的子树部分，\n # 这部分子树是空的。此时，继续递归调用下去是没有意义的，因为没有节点可以构建了，所以应返回 None。\n\n # 当我们构建树时，inorder 和 postorder 列表在每次递归调用中都会被分割成左子树和右子树的部分。\n # 虽然理论上它们的长度应该一致，但由于分割过程的不同，有时可能会出现一个列表为空而另一个列表不为空的情况。\n # 通常来说是inorder为空\n if not inorder or not postorder:\n return None\n \n # 后序遍历的最后一个元素是当前树的根节点\n root_val = postorder.pop()\n root = TreeNode(root_val)\n \n # 在中序遍历中找到根节点的位置\n mid = inorder.index(root_val)\n \n # 递归构建右子树和左子树\n # 注意先构建右子树再构建左子树，因为后序遍历是先左后右最后根\n # 由于后序遍历的顺序是左 -> 右 -> 根，并且 postorder 列表的最右边的元素是根节点，倒数第二部分是右子树的元素，再往前才是左子树的元素。\n \n # 不需要对 postorder 列表进行切割，因为每次递归调用时，postorder.pop() 操作\n # 都会减少列表的大小，使得剩余部分可以直接用来构建子树。\n root.right = self.buildTree(inorder[mid+1:], postorder)\n root.left = self.buildTree(inorder[:mid], postorder)\n \n return root\n\n\n # 寻找根节点位置的操作：\n # 在每次递归调用中，我们需要在 inorder 列表中查找根节点的位置，inorder.index(root_val) 这一操作的时间复杂度是 O(n)。\n # 递归构建子树的操作：\n # 每次递归调用中，我们会将 inorder 列表分为两部分（左子树和右子树），继续递归调用。这会产生两个子问题，其规模分别是原问题的一部分。\n # 然而，每次递归调用中的查找操作都需要遍历 inorder 列表的部分，因此递归树的每一层都需要 O(n) 时间。递归树的深度为 O(n)，\n # 因此总的时间复杂度为 O(n^2)。\n\n # 递归调用栈的空间：\n # 因为递归深度最多为 n，空间复杂度为 O(n)。\n # 存储新树的空间：\n # 构建树的过程中，我们创建了 n 个新节点，空间复杂度为 O(n)。\n # 空间复杂度: O(n)","runtime":"85"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n def build(postorder, inorder):\n if inorder:\n p = postorder.pop()\n # print(\"Root: \", p, \"Post: \", postorder, \"Inorder: \", inorder)\n index = inorder.index(p)\n root = TreeNode(inorder[index])\n\n root.right = build(postorder, inorder[index+1:])\n root.left = build(postorder, inorder[:index])\n return root\n return build(postorder, inorder)\n ","runtime":"87"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> TreeNode:\n # # preorder - root, left, right\n \n # # inorder - left, root, right\n # # postorder - left, right, root\n \n # this is very nice recursive solution\n if not inorder:\n return None\n\n # taking the root of the tree or sub tree\n cur_val = postorder.pop()\n \n # finding the root index in inorder\n idx = inorder.index(cur_val)\n print(cur_val, idx)\n \n # now we have 2 trees\n # somehow we need to start from right\n right = self.buildTree(inorder[idx + 1:], postorder)\n left = self.buildTree(inorder[:idx], postorder)\n\n return TreeNode(cur_val, left, right)","runtime":"87"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n il = 0\n ir = len(inorder) - 1\n rp = len(postorder) - 1\n\n def findSubtree(il, ir, rp):\n if il > ir or rp < 0:\n return None\n \n root_val = postorder[rp]\n root_index = inorder.index(root_val)\n left_root = rp - (ir - root_index) - 1\n\n curr = TreeNode(root_val)\n curr.left = findSubtree(il, root_index - 1, left_root)\n curr.right = findSubtree(root_index + 1, ir, rp - 1)\n\n return curr\n\n return findSubtree(il, ir, rp)","runtime":"89"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n ## Initially, push the root node into the stack\n root = TreeNode(postorder[-1])\n stack = [(root, 0, len(inorder), inorder.index(root.val), 'RIGHT')]\n ## Current index in 'postorder', start from the end 'len(postorder)-2'\n curIndex = len(postorder)-2\n while stack:\n node, start, end, index, which = stack.pop()\n ## Processing the right node\n if which == 'RIGHT':\n ## Push the node back to the stack again to process its right node in the next traversal\n stack.append((node, start, end, index, 'LEFT'))\n if index+1 < end:\n rindex = inorder[index+1:end].index(postorder[curIndex]) + index + 1\n node.right = TreeNode(postorder[curIndex])\n curIndex -= 1\n stack.append((node.right, index+1, end, rindex, 'RIGHT'))\n ## Processing the left node\n if which == 'LEFT':\n if start < index:\n lindex = inorder[start:index].index(postorder[curIndex]) + start\n node.left = TreeNode(postorder[curIndex])\n curIndex -= 1\n stack.append((node.left, start, index, lindex, 'RIGHT'))\n ## End of while loop\n\n return root","runtime":"89"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n if (len(inorder)<=0):\n return\n root=TreeNode(postorder.pop())\n idx=inorder.index(root.val)\n root.right=self.buildTree(inorder[idx+1:],postorder)\n root.left=self.buildTree(inorder[:idx],postorder)\n return root","runtime":"91"},{"code":"# 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 buildTree(self, inorder, postorder):\n \n if not inorder:\n return None\n \n root_val = postorder.pop() # Extract root\n root = TreeNode(root_val)\n\n mid = inorder.index(root_val)\n root.right = self.buildTree(inorder[mid+1:], postorder)\n root.left = self.buildTree(inorder[:mid], postorder)\n\n return root","runtime":"91"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if inorder is None or postorder is None:\n return None\n if len(inorder) * len(postorder) == 0:\n return None\n \n head = postorder.pop()\n idx = inorder.index(head)\n right = self.buildTree(inorder[idx + 1:], postorder)\n left = self.buildTree(inorder[:idx], postorder)\n\n return TreeNode(val=head, left=left, right=right)\n ","runtime":"93"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n # print(f'{postorder=} {inorder=}')\n if not inorder:\n return None\n \n root = postorder.pop()\n # print(f'{root=}')\n i = inorder.index(root)\n right = self.buildTree(inorder[i+1:], postorder)\n left = self.buildTree(inorder[:i], postorder)\n # print(f'{root=} {left=} {right=}')\n return TreeNode(root, left, right)","runtime":"93"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n if not inorder or not postorder:\n return None\n \n root_val = postorder.pop()\n root = TreeNode(root_val)\n\n inorder_index= inorder.index(root_val)\n\n # We build the right subtree first because we are popping elements from the end of postorder array\n root.right = self.buildTree(inorder[inorder_index+1:],postorder)\n root.left = self.buildTree(inorder[:inorder_index], postorder)\n\n return root","runtime":"95"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n root = postorder.pop()\n if len(inorder) == 1:\n return TreeNode(root)\n \n root_index = inorder.index(root)\n\n right = self.buildTree(inorder[root_index+1:], postorder)\n left = self.buildTree(inorder[:root_index], postorder)\n\n return TreeNode(root, left, right)\n ","runtime":"95"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n # Base case\n if not inorder:\n return None\n\n # The last element in postorder is the root node\n root_val = postorder.pop()\n node = TreeNode(root_val)\n\n # Find the index of the root in inorder list\n index = inorder.index(root_val)\n\n # Recursively build the right and left subtrees\n # Important: build right subtree first since we are popping from postorder's end\n node.right = self.buildTree(inorder[index + 1:], postorder)\n node.left = self.buildTree(inorder[:index], postorder)\n \n return node\n","runtime":"98"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n # 这个条件是必要的，因为在递归过程中，可能会遇到子树为空的情况。虽然题目给出了 1 <= inorder.length <= 3000，\n # 但这个条件描述的是输入的原始列表的长度，而不是递归过程中子问题的长度。\n # 如果在 inorder 或 postorder 中没有剩下任何元素（[]），意味着我们已经找到了一个叶子节点的子树部分，\n # 这部分子树是空的。此时，继续递归调用下去是没有意义的，因为没有节点可以构建了，所以应返回 None。\n\n # 当我们构建树时，inorder 和 postorder 列表在每次递归调用中都会被分割成左子树和右子树的部分。\n # 虽然理论上它们的长度应该一致，但由于分割过程的不同，有时可能会出现一个列表为空而另一个列表不为空的情况。\n # 通常来说是inorder为空\n if not inorder or not postorder:\n return None\n \n # 后序遍历的最后一个元素是当前树的根节点\n root_val = postorder.pop()\n root = TreeNode(root_val)\n \n # 在中序遍历中找到根节点的位置\n mid = inorder.index(root_val)\n \n # 递归构建右子树和左子树\n # 注意先构建右子树再构建左子树，因为后序遍历是先左后右最后根\n # 由于后序遍历的顺序是左 -> 右 -> 根，并且 postorder 列表的最右边的元素是根节点，倒数第二部分是右子树的元素，再往前才是左子树的元素。\n \n # 不需要对 postorder 列表进行切割，因为每次递归调用时，postorder.pop() 操作\n # 都会减少列表的大小，使得剩余部分可以直接用来构建子树。\n root.right = self.buildTree(inorder[mid+1:], postorder)\n root.left = self.buildTree(inorder[:mid], postorder)\n \n return root\n","runtime":"98"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n node_val = postorder.pop()\n # print('postorder:', postorder)\n node = TreeNode(node_val)\n # print(node_val, inorder)\n inorder_index = inorder.index(node_val)\n \n # print(node_val)\n # print(inorder_index)\n left_inorder = inorder[:inorder_index]\n right_inorder = inorder[inorder_index + 1:]\n \n node.right = self.buildTree(right_inorder, postorder)\n node.left = self.buildTree(left_inorder, postorder)\n\n return node","runtime":"100"},{"code":"class Solution:\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n\n rootVal = postorder.pop()\n root = TreeNode(rootVal)\n\n rootIdx = inorder.index(rootVal)\n\n root.right = self.buildTree(inorder[rootIdx + 1:], postorder)\n root.left = self.buildTree(inorder[:rootIdx], postorder)\n\n return root ","runtime":"100"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n root_val = postorder.pop()\n root = TreeNode(root_val)\n \n inorder_index = inorder.index(root_val)\n \n root.right = self.buildTree(inorder[inorder_index+1:],postorder)\n root.left = self.buildTree(inorder[:inorder_index],postorder)\n\n return root","runtime":"102"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n #do not forget basecase\n if not inorder or not postorder:\n return None\n cur_val = postorder.pop()\n cur = TreeNode(cur_val)\n mid = inorder.index(cur_val)\n cur.left = self.buildTree(inorder[:mid], postorder[:mid])\n cur.right = self.buildTree(inorder[mid+1:], postorder[mid:])\n return cur\n","runtime":"102"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not postorder:\n return None\n root = TreeNode(postorder[-1])\n ri = inorder.index(postorder[-1])\n act_nodes = deque([(root, 0, ri, len(inorder))])\n for v in postorder[-2::-1]:\n new_node = TreeNode(v)\n par_node, par_left, par_ni, par_right = act_nodes.pop()\n if par_left != par_ni and v in inorder[par_left:par_ni]:\n par_node.left = new_node\n nni = inorder.index(v, par_left, par_ni)\n # if par_ni + 1 != par_right:\n # act_nodes.append((par_node, par_ni, par_ni, par_right))\n if nni != par_left or nni != par_ni - 1:\n act_nodes.append((new_node, par_left, nni, par_ni))\n elif v in inorder[par_ni + 1:par_right]:\n par_node.right = new_node\n nni = inorder.index(v, par_ni + 1, par_right)\n if par_left != par_ni:\n act_nodes.append((par_node, par_left, par_ni, par_ni+1))\n if nni != par_ni + 1 or nni != par_right - 1:\n act_nodes.append((new_node, par_ni + 1, nni, par_right))\n return root","runtime":"104"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n def build(self, inorder, postorder):\n if inorder:\n idx = inorder.index(postorder.pop())\n root = TreeNode(inorder[idx])\n\n root.right = build(self, inorder[idx+1:], postorder)\n root.left = build(self, inorder[:idx], postorder)\n return root\n return build(self, inorder, postorder)\n\n\n \n\n","runtime":"104"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n root = TreeNode(postorder.pop())\n mid = inorder.index(root.val)\n root.right = self.buildTree(inorder[mid+1:], postorder)\n root.left = self.buildTree(inorder[:mid], postorder)\n return root","runtime":"106"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder: return None\n root = TreeNode(postorder.pop())\n root_index_inorder = inorder.index(root.val)\n root.right = self.buildTree(inorder[root_index_inorder + 1:], postorder)\n root.left = self.buildTree(inorder[:root_index_inorder], postorder)\n return root\n ","runtime":"106"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(inorder) == 0 or len(postorder) == 0:\n return None\n root_elem = postorder.pop()\n root = TreeNode(root_elem)\n mid = inorder.index(root_elem)\n root.right = self.buildTree(inorder[mid + 1:], postorder)\n root.left = self.buildTree(inorder[:mid], postorder)\n return root\n ","runtime":"113"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(inorder) == 0:\n return None\n root = TreeNode(val=postorder.pop())\n mid = inorder.index(root.val)\n root.right = self.buildTree(inorder[mid + 1:], postorder)\n root.left = self.buildTree(inorder[:mid], postorder)\n return root\n","runtime":"113"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n\n root_val = postorder.pop()\n root = TreeNode(root_val)\n inorder_index = inorder.index(root_val)\n\n root.right = self.buildTree(inorder[inorder_index + 1:], postorder)\n root.left = self.buildTree(inorder[:inorder_index], postorder)\n\n return root","runtime":"115"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n head = None\n def build (inorder, postorder):\n if not inorder or not postorder:\n return \n root = TreeNode(postorder[-1])\n ind = inorder.index(postorder[-1])\n left_split = inorder[:ind]\n right_split=inorder[ind+1:]\n left_post = postorder[:ind]\n right_post = postorder[ind:-1]\n root.left = build(left_split,left_post)\n root.right = build(right_split, right_post)\n return root\n head = build(inorder,postorder)\n return head\n\n \n ","runtime":"115"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not postorder or not inorder:\n return None\n # print('------------------------------')\n # print(inorder)\n # print(postorder)\n root = TreeNode(postorder[-1])\n index = inorder.index(postorder[-1])\n\n root.left = self.buildTree(inorder[:index], postorder[:index])\n root.right = self.buildTree(inorder[index+1:], postorder[index:-1])\n return root","runtime":"117"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n n = len(inorder)\n if n == 1:\n \n return TreeNode(inorder[0])\n \n def dfs(inorder,postorder):\n if not inorder:\n \n return None\n \n root_val = postorder[-1]\n \n index = inorder.index(root_val)\n \n root = TreeNode(root_val)\n \n root.left = dfs(inorder[:index],postorder[:index])\n root.right = dfs(inorder[index+1:],postorder[index:-1])\n \n return root\n \n root = dfs(inorder,postorder)\n \n return root","runtime":"117"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n \n\n def build(inorder, postorder):\n if len(postorder) == 0:\n return None\n num = postorder.pop()\n node = TreeNode(num)\n idx = inorder.index(num)\n node.left = build(inorder[:idx], postorder[:idx])\n node.right = build(inorder[idx+1:], postorder[idx:])\n\n return node\n return build(inorder, postorder)","runtime":"119"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return\n # print(inorder, postorder)\n root = TreeNode(postorder[-1])\n mid = inorder.index(postorder[-1])\n \n root.right = self.buildTree(inorder[mid+1:], postorder[mid:-1])\n root.left = self.buildTree(inorder[:mid], postorder[:mid])\n \n return root\n","runtime":"119"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n if not inorder or not postorder:\n return None\n\n current = TreeNode()\n current.val = postorder[-1]\n\n current_idx = inorder.index(current.val)\n current.left = self.buildTree(inorder[:current_idx], postorder[:current_idx])\n current.right = self.buildTree(inorder[current_idx+1:], postorder[current_idx:-1])\n\n return current","runtime":"121"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n n = len(inorder)\n if n == 1:\n \n return TreeNode(inorder[0])\n \n def dfs(inorder,postorder):\n if not inorder:\n \n return None\n \n root_val = postorder[-1]\n \n index = inorder.index(root_val)\n \n root = TreeNode(root_val)\n \n root.left = dfs(inorder[:index],postorder[:index])\n root.right = dfs(inorder[index+1:],postorder[index:-1])\n \n return root\n \n root = dfs(inorder,postorder)\n \n return root","runtime":"121"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n root=TreeNode(postorder[-1])\n mid=inorder.index(postorder[-1])\n root.left=self.buildTree(inorder[:mid],postorder[:mid])\n root.right=self.buildTree(inorder[mid+1:],postorder[mid:-1])\n return root","runtime":"123"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(postorder) == 0:\n return None\n node = TreeNode(val=postorder[-1])\n if len(postorder) == 1:\n return node\n #root_index also = left tree size\n root_index = inorder.index(postorder[-1])\n #print(preorder[1:root_index+1],inorder[0:root_index])\n #print(preorder[root_index+1:],inorder[root_index+1:])\n node.left = self.buildTree(inorder[0:root_index],postorder[:root_index])\n node.right = self.buildTree(inorder[root_index+1:],postorder[root_index:-1])\n return node ","runtime":"123"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder: return None\n root = TreeNode(postorder[-1])\n pos = inorder.index(postorder[-1])\n root.left = self.buildTree(inorder[:pos],postorder[:pos])\n root.right = self.buildTree(inorder[pos+1:],postorder[pos:-1])\n return root\n\n ","runtime":"125"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n root = TreeNode(postorder[-1])\n inorder_idx = inorder.index(postorder[-1])\n # print(postorder[-1], inorder_idx, inorder[:inorder_idx], postorder[:inorder_idx], inorder[inorder_idx+1:], postorder[inorder_idx:-2])\n root.left = self.buildTree(inorder[:inorder_idx], postorder[:inorder_idx])\n root.right = self.buildTree(inorder[inorder_idx+1:], postorder[inorder_idx:-1])\n return root","runtime":"125"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n\n cur_root_val = postorder[-1]\n root = TreeNode(cur_root_val)\n index = inorder.index(cur_root_val)\n\n root.left = self.buildTree(inorder[:index], postorder[:index])\n root.right = self.buildTree(inorder[index+1:], postorder[index:-1]) # postorder[index:-1] 表示 从 index开始 到 倒数第二个元素, 所以是 postorder[index: -1]\n return root","runtime":"128"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return\n\n if len(inorder) == 1:\n return TreeNode(inorder[0])\n\n root_val = postorder[-1]\n root = TreeNode(root_val)\n\n rootindex = inorder.index(root_val)\n\n root.left = self.buildTree(inorder[:rootindex], postorder[:rootindex])\n root.right = self.buildTree(inorder[rootindex+1:], postorder[rootindex:-1])\n\n return root\n\n ","runtime":"128"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n root=TreeNode(postorder[-1])\n index=inorder.index(postorder[-1])\n root.left=self.buildTree(inorder[:index],postorder[:index])\n root.right=self.buildTree(inorder[index+1:],postorder[index:-1])\n return root\n ","runtime":"130"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(inorder) == 0:\n return None\n if len(inorder) == 1:\n return TreeNode(val=inorder[0])\n root_node = TreeNode(val=postorder[-1])\n root_node_val = postorder[-1]\n if postorder == inorder:\n left_subnode = self.buildTree(inorder[:-1], postorder[:-1])\n root_node.left = left_subnode\n return root_node\n i = 0\n while inorder[i] != root_node_val:\n i+= 1\n left_inorder = inorder[:i]\n right_inorder = inorder[i+1:]\n j = 0\n while postorder[j] in left_inorder:\n j += 1\n left_postorder = postorder[:j]\n right_postorder = postorder[j:-1]\n left_subtree = self.buildTree(left_inorder, left_postorder)\n right_subtree = self.buildTree(right_inorder, right_postorder)\n root_node.left = left_subtree\n root_node.right = right_subtree\n return root_node","runtime":"130"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n if not inorder:\n return None\n \n root_val = postorder[-1]\n root = TreeNode(root_val)\n \n idx = inorder.index(root_val)\n \n root.left = self.buildTree(inorder[:idx], postorder[:idx])\n root.right = self.buildTree(inorder[idx+1:], postorder[idx:-1])\n\n return root","runtime":"132"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n root_value = postorder[-1]\n root = TreeNode(root_value)\n idx = inorder.index(root_value)\n root.left = self.buildTree(inorder[:idx], postorder[:idx])\n root.right = self.buildTree(inorder[idx+1:], postorder[idx:-1])\n return root","runtime":"132"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n if not inorder and not postorder:\n return None\n\n root = postorder[-1]\n root_index = inorder.index(root)\n\n node = TreeNode(val=root)\n left_length = len(inorder[:root_index])\n\n node.left = self.buildTree(inorder[:root_index], postorder[:left_length])\n node.right = self.buildTree(inorder[root_index+1:], postorder[left_length:-1])\n return node\n ","runtime":"134"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n \n\n root = TreeNode(postorder[-1])\n mid = inorder.index(postorder[-1])\n\n root.left = self.buildTree(inorder[:mid], postorder[:mid])\n root.right = self.buildTree(inorder[mid+1:], postorder[mid:-1])\n return root","runtime":"134"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n root = TreeNode(postorder[len(postorder)-1])\n mid = inorder.index(postorder[len(postorder)-1])\n root.left = self.buildTree(inorder[:mid],postorder[:mid])\n root.right = self.buildTree(inorder[mid+1:],postorder[mid:-1])\n return root","runtime":"136"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(inorder) == 0:\n return None\n node = TreeNode(postorder[-1])\n index = inorder.index(postorder[-1])\n node.left = self.buildTree(inorder[0:index], postorder[0:index])\n node.right = self.buildTree(inorder[index + 1:len(inorder)], postorder[index:len(postorder) - 1])\n return node\n","runtime":"136"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not postorder:\n return None\n\n root_val = postorder[-1]\n i = inorder.index(root_val)\n\n left_in = inorder[:i]\n right_in = inorder[i+1:]\n\n left_post = postorder[:i]\n right_post = postorder[i:-1]\n \n return TreeNode(root_val, self.buildTree(left_in, left_post), self.buildTree(right_in, right_post))","runtime":"138"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n pos = inorder.index(postorder[-1]) if inorder else -1\n return TreeNode(postorder[-1], self.buildTree(inorder[:pos], postorder[:pos]), self.buildTree(inorder[pos+1:],postorder[pos:-1])) if pos > -1 else None","runtime":"138"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n \n root_val = postorder[-1]\n root = TreeNode(root_val)\n\n root_index = inorder.index(root_val)\n\n root.left = self.buildTree(inorder[:root_index], postorder[:root_index])\n root.right = self.buildTree(inorder[root_index+1:], postorder[root_index:-1])\n\n return root","runtime":"141"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n \n root = postorder[-1]\n idx = inorder.index(root)\n \n new_node = ListNode(root)\n new_node.left = self.buildTree(inorder[:idx], postorder[:idx])\n new_node.right = self.buildTree(inorder[idx + 1:], postorder[idx:-1])\n \n return new_node","runtime":"141"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n root=TreeNode(postorder[-1])\n index=inorder.index(postorder[-1])\n root.left=self.buildTree(inorder[:index],postorder[:index])\n root.right=self.buildTree(inorder[index+1:],postorder[index:-1])\n return root","runtime":"143"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n root = TreeNode(postorder[-1]) # L R Rt\n index = inorder.index(postorder[-1])\n root.left = self.buildTree(inorder[:index], postorder[:index])\n root.right = self.buildTree(inorder[index+1:], postorder[index:-1])\n return root","runtime":"143"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n head = None\n def build (inorder, postorder):\n if not inorder or not postorder:\n return \n root = TreeNode(postorder[-1])\n ind = inorder.index(postorder[-1])\n left_split = inorder[:ind]\n right_split=inorder[ind+1:]\n left_post = postorder[:ind]\n right_post = postorder[ind:-1]\n root.left = build(left_split,left_post)\n root.right = build(right_split, right_post)\n return root\n head = build(inorder,postorder)\n return head\n\n \n ","runtime":"145"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if inorder == []:\n return None\n \t\n root = postorder[-1]\n root_index = inorder.index(root)\n left_inorder, right_inorder = inorder[:root_index], inorder[root_index+1:]\n left_length = len(left_inorder)\n left_postorder, right_postorder = postorder[:left_length], postorder[left_length:-1]\n\n return TreeNode(root, self.buildTree(left_inorder, left_postorder), self.buildTree(right_inorder, right_postorder))","runtime":"145"},{"code":"from typing import List, 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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n \n # The last element in postorder is the root\n root_val = postorder.pop()\n root = TreeNode(root_val)\n \n # Find the index of the root in the inorder list\n root_index_inorder = inorder.index(root_val)\n \n # Split inorder list into left and right subtrees\n inorder_left = inorder[:root_index_inorder]\n inorder_right = inorder[root_index_inorder + 1:]\n \n # Split postorder list into left and right subtrees\n # Note: The length of the left subtree in both inorder and postorder lists is the same\n postorder_left = postorder[:len(inorder_left)]\n postorder_right = postorder[len(inorder_left):]\n \n # Recursively build the left and right subtrees\n root.left = self.buildTree(inorder_left, postorder_left)\n root.right = self.buildTree(inorder_right, postorder_right)\n \n return root\n\n# Helper function to print the tree (for debugging)\ndef printTree(node: TreeNode, level=0):\n if node is not None:\n printTree(node.right, level + 1)\n print(' ' * 4 * level + '->', node.val)\n printTree(node.left, level + 1)\n\n# Example usage:\nsolution = Solution()\ninorder = [9, 3, 15, 20, 7]\npostorder = [9, 15, 7, 20, 3]\nroot = solution.buildTree(inorder, postorder)\nprintTree(root)","runtime":"147"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n \n root_val = postorder[-1]\n root_idx = inorder.index(root_val)\n inorder_left = inorder[:root_idx]\n inorder_right = inorder[root_idx+1:]\n postorder_left = postorder[:root_idx]\n postorder_right = postorder[root_idx:-1]\n\n left_node = self.buildTree(inorder_left, postorder_left)\n right_node = self.buildTree(inorder_right, postorder_right)\n root = TreeNode(root_val, left_node, right_node)\n\n return root","runtime":"147"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not postorder: return\n # create a subtree root\n root = TreeNode(postorder[-1])\n # partition lists\n pivot = inorder.index(postorder[-1])\n root.left = self.buildTree(inorder[:pivot], postorder[:pivot])\n root.right = self.buildTree(inorder[pivot + 1:], postorder[pivot:-1])\n return root","runtime":"149"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n if len(inorder) == 1:\n return TreeNode(inorder[0])\n \n root_val = postorder.pop(-1)\n root_idx = inorder.index(root_val)\n root = TreeNode(val=root_val)\n\n left_inorder = inorder[:root_idx]\n right_inorder = inorder[root_idx+1:]\n\n left_postorder = postorder[:len(left_inorder)]\n right_postorder = postorder[len(left_inorder):]\n\n root.left = self.buildTree(left_inorder, left_postorder)\n root.right = self.buildTree(right_inorder, right_postorder)\n \n return root\n\n","runtime":"149"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n root_val=postorder[-1]\n root=TreeNode(root_val)\n root_index=inorder.index(root_val)\n\n left_inorder=inorder[:root_index]\n right_inorder=inorder[root_index+1:]\n\n left_postorder=postorder[:len(left_inorder)]\n right_postorder=postorder[len(left_inorder):-1]\n\n root.left=self.buildTree(left_inorder,left_postorder)\n root.right=self.buildTree(right_inorder,right_postorder)\n return root\n","runtime":"151"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n inorder_hash = {}\n postorder_hash = {}\n for idx in range(len(inorder)):\n inorder_hash[inorder[idx]] = idx\n for idx in range(len(postorder)):\n postorder_hash[postorder[idx]] = idx\n\n return self.helper(inorder, postorder, inorder_hash, postorder_hash)\n\n def helper(self, inorder, postorder, inorder_hash, postorder_hash):\n if len(inorder) == 1:\n return TreeNode(inorder[0])\n if len(inorder) == 0:\n return None\n #print(inorder, postorder)\n root_val = postorder[-1]\n root_idx = inorder.index(root_val)# inorder_hash[root_val]\n\n leftTree = self.helper(inorder[:root_idx], postorder[:root_idx], inorder_hash, postorder_hash)\n rightTree = self.helper(inorder[root_idx+1:], postorder[root_idx:len(postorder)-1], inorder_hash, postorder_hash)\n root = TreeNode(root_val, left=leftTree, right=rightTree)\n\n return root\n","runtime":"151"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not postorder or not inorder:\n return None\n \n val = postorder.pop()\n root = TreeNode(val)\n\n index = 0\n for i in range(len(inorder)):\n if inorder[i] == val:\n index = i\n \n root.right = self.buildTree(inorder[index+1:], postorder)\n root.left = self.buildTree(inorder[:index], postorder)\n\n return root","runtime":"153"},{"code":"\"\"\"\ninorder = Left Root Right\npostorder = Left Right Root\ni start i end [9, 3, 15, 20, 7] p start p end \n[9, 15, 7, 20, 3]\nroot val 3\ni start i end [9] p start p end \n[9]\nroot val 9\ni start i end [15, 20, 7] p start p end \n[15, 7, 20]\nroot val 20\ni start i end [15] p start p end \n[15, 7]\nroot val 7\ni start i end [9, 3, 15] p start p end \n[]\nroot val 15\ni start i end [9, 3] p start p end \n[]\nroot val 15\ni start i end [9, 3] p start p end \n[]\nroot val 9\ni start i end [3] p start p end \n[]\nroot val 3\ni start i end [7] p start p end \n[]\nroot val 7\n\n[9, ]\n\n inorder = [9,3,15,20,7]\n postorder = [9,15,7,20,3]\n\n\n 9 15 20 7\n 9 15 7 20\n\"\"\"\n\nclass Solution:\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n def helper(i_start, i_end, p_start, p_end):\n if i_start > i_end:\n return None\n\n root_index = -1\n root_val = postorder[p_end]\n root_node = TreeNode(val=root_val)\n # left inorder traversal\n for i in range(i_start, i_end + 1):\n node = inorder[i]\n if node == root_val:\n root_index = i\n # inorder x y z root a b \n # postorder x y z a b root\n\n left_len = root_index - 1 - i_start + 1\n\n left_tree = helper(i_start = i_start, i_end = root_index - 1, p_start = p_start, p_end = p_start + left_len - 1)\n right_tree = helper(i_start = root_index + 1, i_end = i_end, p_start = p_start + left_len, p_end = p_end - 1)\n \n root_node.left = left_tree\n root_node.right = right_tree\n return root_node\n\n n = len(inorder)\n return helper(0, n - 1, 0, n - 1)\n\n","runtime":"153"},{"code":"# Definition for a binary tree node.\nfrom typing import List\n\n\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\n\nclass Solution:\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n rootVal = postorder[-1]\n root = TreeNode(rootVal)\n if len(inorder) > 1 and len(postorder) > 1:\n index = inorder.index(rootVal)\n leftInorder = inorder[:index]\n rightInorder = inorder[index+1:]\n leftPostorder = postorder[:len(leftInorder)]\n rightPostorder = postorder[len(leftInorder): len(postorder)-1]\n if leftInorder and leftPostorder:\n root.left = self.buildTree(leftInorder, leftPostorder)\n else:\n root.left = None\n \n if rightInorder and rightPostorder:\n root.right = self.buildTree(rightInorder, rightPostorder)\n else:\n root.right = None\n return root\n else:\n return root\n","runtime":"156"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n if len(inorder)==1:\n return TreeNode(postorder[-1])\n root = TreeNode(postorder[-1])\n idx = inorder.index(postorder[-1])\n left_inorder = inorder[:idx]\n right_inorder = inorder[idx+1:]\n left_postorder = postorder[:idx]\n right_postorder = postorder[idx:-1]\n root.left = self.buildTree(left_inorder, left_postorder)\n root.right = self.buildTree(right_inorder, right_postorder)\n return root","runtime":"156"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(inorder) == 0:\n return\n root = TreeNode(postorder[-1])\n ind_inorder = inorder.index(root.val)\n left_inorder,right_inorder = inorder[:ind_inorder],inorder[ind_inorder+1:]\n del inorder[ind_inorder]\n del postorder[-1]\n left_postorder,right_postorder = postorder[:len(left_inorder)],postorder[-len(right_inorder):]\n \n root.left = self.buildTree(left_inorder,left_postorder)\n root.right = self.buildTree(right_inorder,right_postorder)\n return root","runtime":"158"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(inorder) == 0:\n return None\n if len(inorder) == 1:\n return TreeNode(inorder[0])\n\n mid = postorder[-1]\n\n idxInorder = inorder.index(mid)\n\n root = TreeNode(mid)\n\n root.left = self.buildTree(inorder[:idxInorder], postorder[:len(inorder[:idxInorder])])\n root.right = self.buildTree(inorder[idxInorder+1:], postorder[len(inorder[:idxInorder]):-1])\n \n return root\n ","runtime":"158"},{"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 # preorder: root -> left -> right [3,9,20,15,7]\n # inorder: left -> root -> right [9,3,15,20,7]\n # postorder: left -> right -> root [9,15,7,20,3]\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n def rec(inorder, postorder):\n if not inorder or not postorder:\n return None\n\n root = TreeNode(postorder[-1])\n if root.val in inorder:\n idx = inorder.index(root.val)\n else:\n return rec(inorder, postorder[:-1])\n root.left = rec(inorder[:idx], postorder[:-1])\n root.right = rec(inorder[idx+1:], postorder[:-1])\n return root\n return rec(inorder, postorder)\n","runtime":"160"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not postorder:\n return None\n root = TreeNode(postorder[-1])\n if len(postorder) == 1:\n return root\n inorder_idx = inorder.index(root.val)\n inorder_left = inorder[:inorder_idx]\n inorder_right = inorder[inorder_idx + 1:]\n\n postorder_left = postorder[:inorder_idx]\n postorder_right = postorder[inorder_idx:-1]\n\n root.left = self.buildTree(inorder_left, postorder_left)\n root.right = self.buildTree(inorder_right, postorder_right)\n return root\n","runtime":"160"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n def build(post: int, instart: int, inend: int):\n node = TreeNode(postorder[post])\n if instart == inend:\n return node\n\n if instart > inend:\n return None\n\n root = None\n\n for i in range(instart, inend + 1):\n if inorder[i] == postorder[post]:\n root = i\n\n node.left = build(post - (inend - root) - 1, instart, root - 1)\n node.right = build(post - 1, root + 1, inend)\n\n return node\n\n return build(len(postorder) - 1, 0, len(inorder) - 1)","runtime":"162"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n # 第一步: 特殊情况讨论: 树为空. (递归终止条件)\n if not postorder:\n return None\n\n # 第二步: 后序遍历的最后一个就是当前的中间节点.\n root_val = postorder[-1]\n root = TreeNode(root_val)\n\n # 第三步: 找切割点.\n separator_idx = inorder.index(root_val)\n\n # 第四步: 切割inorder数组. 得到inorder数组的左,右半边.\n inorder_left = inorder[:separator_idx]\n inorder_right = inorder[separator_idx + 1:]\n\n # 第五步: 切割postorder数组. 得到postorder数组的左,右半边.\n # 重点1: 中序数组大小一定跟后序数组大小是相同的.\n postorder_left = postorder[:len(inorder_left)]\n postorder_right = postorder[len(inorder_left): len(postorder) - 1]\n\n # 第六步: 递归\n root.left = self.buildTree(inorder_left, postorder_left)\n root.right = self.buildTree(inorder_right, postorder_right)\n # 第七步: 返回答案\n return root","runtime":"162"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(inorder) == 1:\n return TreeNode(inorder[0])\n \n def r(inorder,postorder):\n if len(inorder) == 0:\n return None\n if len(inorder) == 1:\n return TreeNode(inorder[0])\n \n root_val = postorder[-1]\n root_index_in = inorder.index(root_val)\n root_index_post = postorder.index(root_val)\n \n return TreeNode(\n val=root_val,\n left=r(inorder[:root_index_in],postorder[:root_index_in]),\n right=r(inorder[root_index_in+1:],postorder[root_index_in:-1])\n )\n \n return r(inorder,postorder)\n \n","runtime":"164"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n '''\n inorder = [9,3,15,20,7]\n postorder = [9,15,7,20,3]\n '''\n\n # base case\n if not inorder or not postorder:\n return None\n \n # main logic\n node_val = postorder[-1]\n \n node_idx = inorder.index(node_val)\n in_left_tree = inorder[:node_idx]\n in_right_tree = inorder[(node_idx+1):]\n \n post_left_tree = postorder[:len(in_left_tree)]\n post_right_tree = postorder[len(in_left_tree):-1]\n \n root = TreeNode(node_val)\n root.left = self.buildTree(in_left_tree, post_left_tree)\n root.right = self.buildTree(in_right_tree, post_right_tree)\n \n return root\n \n \n \n ","runtime":"164"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n\n val = postorder.pop()\n root = TreeNode(val)\n\n pivot_idx = 0\n for i in range(len(inorder)):\n if inorder[i] == val:\n pivot_idx = i\n break\n\n root.right = self.buildTree(inorder[pivot_idx + 1:], postorder)\n root.left = self.buildTree(inorder[:pivot_idx], postorder)\n return root","runtime":"166"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n x = self.helper(inorder, postorder)\n return x\n\n def helper(self, inorder, postorder):\n \n root = TreeNode()\n root.val = postorder[-1]\n self.L,self.R = [],[]\n \n LIn = inorder[:inorder.index(root.val)]\n LPost = postorder[0:len(LIn)]\n RIn = inorder[inorder.index(root.val)+1:]\n RPost = postorder[len(LIn):-1]\n\n # print(LIn)\n # print(RIn)\n # print(LPost)\n # print(RPost)\n \n if len(LIn) > 0:\n root.left = self.helper(LIn,LPost)\n if len(RIn) > 0:\n root.right = self.helper(RIn,RPost)\n\n return root\n\n ","runtime":"166"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None \n root_val = postorder.pop()\n # start_val = postorder[-1]\n root = TreeNode(root_val)\n for i in range(len(inorder)):\n if inorder[i] == root_val:\n index = i\n # index = inorder.index(root_val)\n root.right = self.buildTree(inorder[index+1:],postorder)\n\n\n root.left = self.buildTree(inorder[:index],postorder)\n\n return root\n ","runtime":"168"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(inorder) == 0:\n return None\n #print(inorder, postorder)\n rootIndex = inorder.index(postorder[-1])\n left_inorder = inorder[:rootIndex]\n left_postorder = postorder[:rootIndex]\n \n right_inorder = inorder[rootIndex + 1 :] \n right_postorder = postorder[rootIndex:len(postorder)-1]\n\n #print(left_postorder, right_postorder)\n #print(left_inorder, left_postorder)\n \n return TreeNode(postorder[-1], self.buildTree(left_inorder, left_postorder), self.buildTree(right_inorder, right_postorder))","runtime":"168"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n def build(post_end:int,in_start:int,in_end:int)->Optional[TreeNode]:\n nonlocal postorder,inorder\n p_node=TreeNode(postorder[post_end])\n if in_start==in_end:\n return p_node\n print((in_start,in_end,postorder[post_end]))\n idx=-1\n for i in range(in_start,in_end+1):\n if inorder[i]==postorder[post_end]:\n idx=i\n break\n print(idx)\n if idx!=in_start:\n p_node.left=build(post_end-(in_end-idx)-1,in_start,idx-1)\n if idx!=in_end:\n p_node.right=build(post_end-1,idx+1,in_end)\n return p_node\n return build(len(postorder)-1,0,len(inorder)-1)","runtime":"171"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if(len(inorder)==0 or len(postorder)==0):\n return None\n root = TreeNode(postorder[-1])\n index_in = inorder.index(postorder[-1])\n index_po = postorder.index(postorder[-1])\n root.left = self.buildTree(inorder[:index_in], postorder[:index_in])\n root.right = self.buildTree(inorder[index_in+1:], postorder[index_in:index_po])\n return root","runtime":"171"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(inorder) == 0:\n return None\n \n \n ans = TreeNode(postorder[len(postorder) - 1])\n rootPos = -1\n\n for i in range(len(inorder)):\n if inorder[i] == ans.val:\n rootPos = i\n break\n \n ans.left = self.buildTree(inorder[:rootPos], postorder[:rootPos])\n ans.right = self.buildTree(inorder[rootPos + 1:], postorder[rootPos:len(postorder) - 1])\n \n return ans\n ","runtime":"173"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n # base case\n if not inorder:\n return None\n \n root_val = postorder[-1]\n for i in range(len(inorder)):\n if inorder[i] == root_val:\n index = i\n break\n \n node = TreeNode(root_val)\n node.left = self.buildTree(inorder[: index], postorder[: index])\n node.right = self.buildTree(inorder[index + 1:], postorder[index : -1])\n\n return node ","runtime":"173"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n def build(ino, posto):\n if posto == []:\n return None\n v = posto[-1]\n index = 0\n for iv in ino:\n if v == iv:\n break\n index += 1\n\n pol = len(posto)\n node = TreeNode(v)\n if index != 0:\n node.left = build(ino[:index], posto[:index])\n node.right = build(ino[index+1:], posto[index:pol-1])\n\n return node\n\n return build(inorder, postorder)\n","runtime":"175"},{"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 buildTree(self, inorder: list[int], postorder: list[int]) -> 'Optional[TreeNode]':\n if len(inorder) == 0:\n return None\n\n root = TreeNode(postorder[-1])\n inend = 0\n\n rootval = postorder[-1]\n while True:\n if inorder[inend] == rootval:\n break\n inend += 1\n\n if inend:\n root.left = self.buildTree(inorder[:inend], postorder[:inend])\n if inend + 1 < len(inorder):\n root.right = self.buildTree(inorder[inend + 1:], postorder[inend: -1])\n\n return root\n\n return root","runtime":"175"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n \n node = TreeNode(postorder[-1]) \n postorder.remove(node.val)\n pos = inorder.index(node.val)\n node.left = self.buildTree(inorder[0:pos],postorder[0:pos]) \n node.right = self.buildTree(inorder[pos+1:],postorder[pos:]) \n return node\n \n ","runtime":"179"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n def build(inleft,inright,postleft,postright):\n if postleft > postright:\n return None\n \n root = TreeNode(postorder[postright])\n \n\n leftLen = 0\n for n in inorder:\n if n == root.val:\n break\n leftLen += 1\n\n left_len = leftLen - inleft\n root.left = build(inleft,leftLen-1,postleft,postleft+left_len-1)\n root.right = build(leftLen+1,inright,postleft+left_len,postright-1)\n\n return root\n \n return build(0,len(inorder)-1,0,len(postorder)-1)\n","runtime":"179"},{"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 findroot(self, inorder, val):\n for i in range(len(inorder)):\n if inorder[i] == val:\n return i\n\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(inorder) == 0 or len(postorder) == 0:\n return None\n\n root = TreeNode(postorder[len(postorder) - 1])\n rootValIndex = self.findroot(inorder, root.val)\n\n root.left = self.buildTree(inorder[:rootValIndex], postorder[0:rootValIndex])\n root.right = self.buildTree(inorder[rootValIndex+1:], postorder[rootValIndex:len(postorder)-1])\n\n return root \n\n ","runtime":"181"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n if len(postorder) == 0 or len(inorder) ==0:\n return None\n\n r = postorder[-1]\n\n lit,rit = [],[]\n for i in range(len(inorder)):\n if inorder[i] == r:\n lit = inorder[:i]\n rit = inorder[i+1:]\n \n lpt,rpt = postorder[:len(lit)],postorder[len(lit):-1]\n\n node = TreeNode(r)\n\n node.left = self.buildTree(lit,lpt)\n node.right = self.buildTree(rit,rpt)\n\n return node\n ","runtime":"181"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n n = len(postorder)\n if n == 1:\n return TreeNode(postorder[0])\n head = TreeNode(postorder[-1])\n for i in range(len(inorder)):\n if inorder[i] == head.val:\n left_idx = i\n head.left = self.buildTree(inorder[:left_idx], postorder[:left_idx])\n head.right = self.buildTree(inorder[left_idx + 1:], postorder[left_idx:n - 1])\n return head\n\n\n\n # in-order: left -> root -> right\n # post-order: left -> right -> root","runtime":"184"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n root = TreeNode(postorder[-1])\n\n root_pos = 0\n for i in range(0, len(inorder)):\n if inorder[i] == root.val:\n root_pos = i\n break\n\n le_child_num = root_pos\n ri_child_num = len(inorder) - 1 - le_child_num\n\n if le_child_num:\n root.left = self.buildTree(inorder[:root_pos], postorder[:root_pos])\n if ri_child_num:\n root.right = self.buildTree(inorder[root_pos + 1:], postorder[root_pos:-1])\n\n return root\n ","runtime":"184"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n def dfs(io, po):\n if len(io) == 0:\n return None\n \n val = po[-1]\n d = 0\n for i in range(len(io)):\n if io[i] == val:\n d = i\n break\n \n # print(val, d)\n # print(io[0:d], po[0:d])\n # print(io[d+1:], po[d:-1])\n left = dfs(io[0:d], po[0:d])\n right = dfs(io[d+1:], po[d:-1])\n\n node = TreeNode(val, left, right)\n return node\n \n return dfs(inorder, postorder)","runtime":"186"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if inorder == []:\n return None\n root = TreeNode(postorder[-1])\n for i in range(len(inorder)):\n if inorder[i] == root.val:\n break\n root.left = self.buildTree(inorder[0:i],postorder[0:i])\n root.right = self.buildTree(inorder[i+1:],postorder[i:-1])\n return root\n \n\n# post: kid-kid-r\n# in: kid-r-kid\n# post[-1] is r\n# find r idx in in: i\n# kid1 contains i nodes","runtime":"186"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return\n\n leftin = inorder[:inorder.index(postorder[-1])]\n rightin = inorder[inorder.index(postorder[-1])+1:]\n leftpost = postorder[:len(leftin)]\n rightpost = postorder[len(leftin):-1]\n node = TreeNode(val = postorder[-1], left = self.buildTree(leftin, leftpost), right = self.buildTree(rightin, rightpost))\n \n return node","runtime":"188"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n root = postorder[-1]\n n = len(inorder)\n if n == 1:\n return TreeNode(\n val=root\n )\n for i in range(n):\n if inorder[i] == root:\n root_index = i\n right_len = n - root_index - 1\n left_len = root_index\n # print(postorder[left_len:right_len + left_len])\n # print(postorder[:left_len])\n return TreeNode(\n val=root,\n left=self.buildTree(inorder[:root_index], postorder[:left_len]),\n right=self.buildTree(inorder[root_index + 1:], postorder[left_len:right_len + left_len])\n )","runtime":"188"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n # imap = dict()\n # for i in range(len(inorder)):\n # imap[inorder[i]] = i\n def helper(postord,inord):\n if len(postord) == 0 or len(inord) ==0:\n return None\n r = postord[-1]\n lit,rit = [],[]\n for i in range(len(inord)):\n if inord[i] == r:\n lit = inord[:i]\n rit = inord[i+1:]\n lpt,rpt = postord[:len(lit)],postord[len(lit):-1]\n # print('left : ',r,' ',lpt,' ',lit,' ')\n # print('right : ',r,' ',rpt,' ',rit,' ')\n node = TreeNode(r)\n node.left = helper(lpt,lit)\n node.right = helper(rpt,rit)\n\n return node\n\n return helper(postorder,inorder)\n ","runtime":"190"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not postorder:\n return None\n rootVal = postorder[-1]\n root = TreeNode(rootVal)\n\n for i in range(len(inorder)):\n if inorder[i] == rootVal:\n inorderIndex = i\n break\n \n leftInorder = inorder[:i]\n rightInorder = inorder[i+1:]\n\n leftPostorder = postorder[:len(leftInorder)]\n rightPostorder = postorder[len(leftInorder):-1]\n\n root.left = self.buildTree(leftInorder, leftPostorder)\n root.right = self.buildTree(rightInorder, rightPostorder)\n\n return root\n\n ","runtime":"190"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(postorder)==0:\n return None\n elif len(postorder)==1:\n return TreeNode(val=postorder[-1],left=None,right=None)\n else:\n pass\n val=postorder[-1]\n root=TreeNode(val=val)\n for i in range(len(inorder)):\n if inorder[i]==val:\n break\n inorder_l=inorder[:i]\n inorder_r=inorder[i+1:]\n postorder_l=postorder[:len(inorder_l)]\n postorder_r=postorder[len(inorder_l):-1]\n root.left=self.buildTree(inorder_l,postorder_l)\n root.right=self.buildTree(inorder_r,postorder_r)\n return root\n \n \n ","runtime":"192"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n i=inorder\n p=postorder\n if len(i)==0:\n return None\n if len(i)==1:\n return TreeNode(i[0])\n N=p[-1]\n s=0\n while i[s]!=N:\n s=s+1\n l1=i[:s]\n l2=p[:s]\n lefttree=self.buildTree(l1,l2)\n r1=i[s+1:]\n r2=p[s:-1]\n righttree=self.buildTree(r1,r2)\n root=TreeNode(N)\n root.left=lefttree\n root.right=righttree\n return root","runtime":"192"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n root = postorder[-1]\n n = len(inorder)\n if n == 1:\n return TreeNode(\n val=root\n )\n for i in range(n):\n if inorder[i] == root:\n root_index = i\n break\n right_len = n - root_index - 1\n left_len = root_index\n # print(postorder[left_len:right_len + left_len])\n # print(postorder[:left_len])\n return TreeNode(\n val=root,\n left=self.buildTree(inorder[:root_index], postorder[:left_len]),\n right=self.buildTree(inorder[root_index + 1:], postorder[left_len:right_len + left_len])\n )","runtime":"194"},{"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\n def search(self, node, inorder):\n for i in range(len(inorder)):\n if inorder[i] == node:\n return i\n return -1\n\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not postorder or not inorder:\n return None\n \n # The last element of postorder is the root of the current subtree\n rootData = postorder[-1]\n root = TreeNode(rootData)\n \n # Find the index of the root in the inorder list\n ind_root = self.search(rootData, inorder)\n if ind_root == -1:\n return None\n\n # Split inorder into left and right subtrees\n leftpart = inorder[:ind_root]\n rightpart = inorder[ind_root + 1:]\n\n # Compute the lengths of left and right subtrees\n lenleft = len(leftpart)\n \n # Recursively build the left and right subtrees\n leftchild = self.buildTree(leftpart, postorder[:lenleft])\n rightchild = self.buildTree(rightpart, postorder[lenleft:-1])\n \n root.left = leftchild\n root.right = rightchild\n \n return root\n ","runtime":"194"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n root = postorder[-1]\n n = len(inorder)\n if n == 1:\n return TreeNode(\n val=root\n )\n for i in range(n):\n if inorder[i] == root:\n root_index = i\n break\n right_len = n - root_index - 1\n left_len = root_index\n # print(postorder[left_len:right_len + left_len])\n # print(postorder[:left_len])\n return TreeNode(\n val=root,\n left=self.buildTree(inorder[:root_index], postorder[:left_len]),\n right=self.buildTree(inorder[root_index + 1:], postorder[left_len:right_len + left_len])\n )","runtime":"196"},{"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 traverse(self, inorder, postorder):\n if len(inorder) == 0:\n return None\n root_v = postorder[-1]\n b_idx = 0\n while inorder[b_idx] != root_v:\n b_idx += 1\n left_tree = self.traverse(inorder[:b_idx], postorder[:b_idx])\n right_tree = self.traverse(inorder[b_idx+1:], postorder[b_idx:-1])\n cur_node = TreeNode(root_v)\n cur_node.left = left_tree\n cur_node.right = right_tree\n\n return cur_node\n\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n root = self.traverse(inorder, postorder)\n return root\n \n\n ","runtime":"196"}],"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n def helper(l, r):\\n if l>r:\\n return None \\n\\n value = postorder.pop()\\n node = TreeNode(value)\\n\\n node.right = helper(mapp[value]+1, r)\\n node.left = helper(l, mapp[value]-1)\\n\\n return node\\n\\n\\n\\n mapp = {}\\n\\n for i in range(len(inorder)):\\n mapp[inorder[i]] = i \\n\\n return helper(0, len(inorder)-1)\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n hmap = {val: idx for idx, val in enumerate(inorder)}\\n def build(inStart, inEnd):\\n if inStart > inEnd:\\n return None\\n root = TreeNode(postorder.pop())\\n root.right = build(hmap[root.val] + 1, inEnd)\\n root.left = build(inStart, hmap[root.val] - 1)\\n return root \\n return build(0, len(inorder)-1)\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]: \\n print(postorder)\\n def build(left, right):\\n # if there are no elements to construct the tree\\n if left > right:\\n return None\\n \\n # select the preorder_index element as the root and increment it\\n root = TreeNode(postorder.pop()) \\n\\n # build left and right subtree excluding inorder_index_map[root_value] element because it's the root\\n root.right = build(inorder_hashmap[root.val]+1, right)\\n root.left = build(left, inorder_hashmap[root.val]-1) \\n \\n return root\\n \\n \\n # build a hashmap to store value -> its index relations\\n inorder_hashmap = {}\\n\\n for i in range(len(inorder)):\\n inorder_hashmap[inorder[i]] = i\\n return build(0, len(inorder)-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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n inorderIdx = {v:i for i, v in enumerate(inorder)}\\n def helper(l, r):\\n if l > r:\\n return None\\n root = TreeNode(postorder.pop())\\n idx = inorderIdx[root.val]\\n root.right = helper(idx + 1, r)\\n root.left = helper(l, idx - 1)\\n return root\\n return helper(0, len(inorder) - 1)\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n n = len(inorder)\\n stack = []\\n nodeset = set()\\n postIndex = n - 1\\n root = None\\n\\n p = n - 1\\n i = n - 1\\n\\n while p >= 0:\\n # node = None\\n # print(stack)\\n while True:\\n node = TreeNode(postorder[p])\\n\\n if root == None:\\n root = node\\n \\n if stack:\\n # Check if the top of the stack is present in the tracked nodes\\n if stack[-1] in nodeset: \\n nodeset.remove(stack[-1])\\n stack[-1].left = node\\n stack.pop()\\n else:\\n stack[-1].right = node\\n\\n stack.append(node)\\n p -= 1\\n\\n # Found the right most tree\\n if postorder[p + 1] == inorder[i] or p < 0:\\n break\\n\\n node = None\\n \\n # Remove all the right children from the inorder which have been placed before\\n # Find a node such that it contains a left node but hasn't been tracked yet\\n while stack and i >= 0 and stack[-1].val == inorder[i]:\\n node = stack[-1]\\n stack.pop()\\n i -= 1\\n \\n # Put the node which contains a potential left node in the track nodes list\\n if node:\\n nodeset.add(node)\\n stack.append(node)\\n\\n return root\\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n inMap = {}\\n for i in range(len(inorder)):\\n inMap[inorder[i]] = i\\n def construct(post, postStart, postEnd, In, inStart, inEnd):\\n if postStart>=postEnd or inStart>=inEnd:\\n return None\\n rootVal = post[postEnd-1]\\n root = TreeNode(rootVal)\\n inRoot = inMap[rootVal]\\n numsLeft = inRoot-inStart\\n root.left = construct(post, postStart, postStart + numsLeft, In, inStart, inRoot)\\n root.right = construct(post, postStart + numsLeft, postEnd-1, In, inRoot+1, inEnd)\\n return root\\n return construct(postorder, 0, len(postorder), inorder, 0, len(inorder))\\n \",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n def helper(in_left, in_right):\\n if in_left > in_right:\\n return None\\n node = postorder.pop()\\n root = TreeNode(node)\\n index = idx_map[node]\\n root.right = helper(index+1, in_right)\\n root.left = helper(in_left, index-1)\\n\\n return root\\n\\n\\n idx_map = {val:idx for idx,val in enumerate(inorder)}\\n return helper(0,len(inorder)-1 )\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n self.postOrderIndex = len(postorder)-1\\n self.inorderDict = {}\\n for index in range(len(inorder)):\\n self.inorderDict[inorder[index]] = index\\n return self.buildTreeDFS(postorder,0,len(postorder)-1)\\n \\n def buildTreeDFS(self,postorder,left,right):\\n if left > right:\\n return None\\n else:\\n value = postorder[self.postOrderIndex]\\n self.postOrderIndex -= 1\\n root = TreeNode(value)\\n root.right = self.buildTreeDFS(postorder,self.inorderDict[value]+1,right)\\n root.left = self.buildTreeDFS(postorder,left,self.inorderDict[value]-1)\\n return root\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n inorderMap = {}\\n for i,v in enumerate(inorder):\\n inorderMap[v] = i\\n\\n def helper(low, high):\\n if low > high:\\n return None\\n\\n rootVal = postorder.pop()\\n rootIndex = inorderMap[rootVal]\\n root = TreeNode(rootVal)\\n root.right = helper(rootIndex+1, high)\\n root.left = helper(low, rootIndex-1)\\n return root\\n return helper(0, len(inorder)-1) \\n\\n \",\n \"runtime\": \"35\"\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 buildTree(self, inorder: list[int], postorder: list[int]) -> TreeNode:\\n # Create a map to quickly find the index of a value in inorder list\\n inorder_map = {val: idx for idx, val in enumerate(inorder)}\\n \\n def helper(in_left, in_right):\\n if in_left > in_right:\\n return None\\n \\n # The last element in postorder is the root of the current subtree\\n root_val = postorder.pop()\\n root = TreeNode(root_val)\\n \\n # Find the index of the root in inorder to split left and right subtrees\\n index = inorder_map[root_val]\\n \\n # Build the right subtree first because we are popping from the end of postorder\\n root.right = helper(index + 1, in_right)\\n # Build the left subtree\\n root.left = helper(in_left, index - 1)\\n \\n return root\\n \\n return helper(0, len(inorder) - 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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n # intuition:\\n # tail of post order is always head of tree, left of head in inorder is left tree, right of head val is right\\n # recursion with indexes on inorder\\n # maintain global index for post order\\n # base: left > right: return None\\n # recursive:\\n # 1. save post order idx value into tree node\\n # 2. decriment post order val\\n # 3. find inorder index\\n # 4. do right first, node.right = _helper(inorder_idx + 1, right)\\n # 5. left -> helper (left, inorder_idx - 1)\\n\\n def _helper(left_iix, right_iix):\\n if left_iix > right_iix:\\n return None\\n nonlocal post_idx\\n head = TreeNode(val=postorder[post_idx])\\n post_idx -= 1\\n iidx = iidx_map[head.val]\\n head.right = _helper(iidx+1, right_iix)\\n head.left = _helper(left_iix, iidx-1)\\n return head\\n\\n\\n\\n\\n # run code\\n post_idx = len(postorder)-1\\n # make faster, use o(1) lookup for inorder idx\\n iidx_map = {v:i for i,v in enumerate(inorder)}\\n return _helper(0, len(inorder)-1)\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n inorderIdx = {v:i for i, v in enumerate(inorder)}\\n\\n def helper(l,r):\\n if l > r:\\n return None\\n\\n root = TreeNode(postorder.pop())\\n\\n idx = inorderIdx[root.val]\\n root.right = helper(idx + 1, r)\\n root.left = helper(l, idx - 1)\\n return root\\n\\n return helper(0, len(inorder) - 1)\\n \\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n inorder_idx = {v: i for i, v in enumerate(inorder)}\\n\\n def helper(l, r):\\n if l > r:\\n return None\\n\\n root = TreeNode(postorder.pop())\\n\\n idx = inorder_idx[root.val]\\n root.right = helper(idx + 1, r)\\n root.left = helper(l, idx - 1)\\n print(root.val, root.left.val if root.left != None else None, root.right.val if root.right != None else None)\\n return root\\n return helper(0, len(inorder) - 1)\",\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 __init__(self):\\n self.reverse_postorder_index = 0\\n\\n def helper(self, inorder, left, right, reverse_postorders):\\n # Modified Preorder traversal (root, right, left)\\n this_node = TreeNode(reverse_postorders[self.reverse_postorder_index])\\n\\n inorder_index = self.inorder_val_to_idx[reverse_postorders[self.reverse_postorder_index]]\\n\\n right_tree_size = right - inorder_index\\n left_tree_size = inorder_index - left\\n\\n self.reverse_postorder_index += 1\\n\\n if right_tree_size > 0:\\n this_node.right = self.helper(inorder, inorder_index + 1, right, reverse_postorders)\\n if left_tree_size > 0:\\n this_node.left = self.helper(inorder, left, inorder_index - 1, reverse_postorders)\\n \\n return this_node\\n\\n\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n self.inorder_val_to_idx = {val: idx for idx, val in enumerate(inorder)}\\n postorder.reverse()\\n\\n return self.helper(inorder, 0, len(inorder) - 1, postorder)\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n val_idx = {inorder[i]: i for i in range(len(inorder))}\\n n = len(inorder) \\n \\n def createTree(i_st, i_end):\\n if i_st > i_end:\\n return None\\n \\n node = TreeNode(postorder.pop())\\n idx = val_idx[node.val]\\n node.right = createTree(idx+1, i_end)\\n node.left = createTree(i_st, idx-1)\\n return node\\n\\n return createTree(0, n-1)\",\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 '''\\n inorder = [left ... root ... right]\\n postorder = [..... left right root]\\n '''\\n\\n def dfs(self, inorder, postorder, idxMap, left, right):\\n if left > right:\\n return None\\n\\n value = postorder[self.postorderIdx]\\n self.postorderIdx -= 1\\n\\n newNode = TreeNode(value)\\n\\n inorderIdx = idxMap[value]\\n\\n newNode.right = self.dfs(inorder, postorder, idxMap, inorderIdx + 1, right)\\n newNode.left = self.dfs(inorder, postorder, idxMap, left, inorderIdx - 1)\\n\\n return newNode\\n\\n\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n n = len(inorder)\\n \\n idxMap = {value: idx for idx, value in enumerate(inorder)}\\n self.postorderIdx = n - 1\\n\\n return self.dfs(inorder, postorder, idxMap, 0, n - 1)\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n mapping = {val: ix for ix, val in enumerate(inorder)}\\n\\n def helper(l,r):\\n if l > r:\\n return None\\n \\n curr = postorder.pop()\\n node = TreeNode(curr)\\n if l == r:\\n return node\\n \\n ix = mapping[curr]\\n\\n node.right = helper(ix+1, r)\\n node.left = helper(l, ix -1)\\n\\n return node\\n \\n return helper(0, len(postorder)-1)\\n \",\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\\n def buildTree1(self,postorder,inorder,p1,p2,i1,i2,inorder_map):\\n if p1 > p2:\\n #print(\\\"p1,p2:\\\",p1,p2)\\n return\\n #print(\\\"p1:\\\",p1)\\n #print(\\\"p2:\\\",p2)\\n #print(\\\"i1:\\\",i1)\\n #print(\\\"i2:\\\",i2)\\n root = TreeNode(postorder[p2]) \\n x = inorder_map[postorder[p2]] \\n\\n root.left = self.buildTree1(postorder,inorder,p1,x-i1+p1-1,i1,x-1,inorder_map) \\n root.right = self.buildTree1(postorder,inorder,x-i1+p1,p2-1,x+1,i2,inorder_map)\\n return root\\n\\n\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n inorder_map = {}\\n i2 = len(inorder)\\n\\n for i in range(i2):\\n inorder_map[inorder[i]] = i\\n\\n return(self.buildTree1(postorder,inorder,0,len(postorder)-1,0,i2-1,inorder_map)) \\n\\n\\n \",\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 \\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n mp = {}\\n for idx, val in enumerate(inorder):\\n mp[val] = idx\\n \\n cur_idx = len(postorder) - 1\\n \\n def build(inorder, postorder, l, r) -> TreeNode:\\n if(r - l + 1 < 1):\\n return None\\n \\n nonlocal cur_idx\\n root = postorder[cur_idx]\\n cur_idx -= 1\\n m = mp[root]\\n\\n right = build(inorder, postorder, m+1, r)\\n left = build(inorder, postorder, l, m-1)\\n\\n return TreeNode(root, left, right)\\n \\n return build(inorder, postorder, 0, len(inorder) - 1)\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n rightFirstOrder = postorder[::-1]\\n indiceDict = {num: idx for idx, num in enumerate(inorder)}\\n\\n def helper(pl: int, pr: int, il: int, ir: int) -> Optional[TreeNode]:\\n if pl > pr:\\n return None\\n root_val = rightFirstOrder[pl]\\n root = TreeNode(root_val)\\n\\n ind_of_root_inorder = indiceDict[root_val]\\n right_tree_size = ir - ind_of_root_inorder\\n root.left = helper(pl + right_tree_size + 1, pr, il, ind_of_root_inorder - 1)\\n root.right = helper(pl + 1, pl + right_tree_size, ind_of_root_inorder + 1, ir)\\n return root\\n return helper(0, len(postorder) - 1, 0, len(inorder) - 1) \",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n mapper = {v: i for i, v in enumerate(inorder)}\\n\\n def builder(l, r):\\n if l > r:\\n return None\\n root = TreeNode(postorder.pop())\\n val = mapper[root.val]\\n root.right = builder(val + 1, r)\\n root.left = builder(l, val - 1)\\n return root\\n\\n return builder(0, len(inorder) - 1)\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def buildTree(self, inorder: list[int], postorder: list[int]) -> TreeNode | None:\\n in_index_map = dict(map(reversed, enumerate(inorder)))\\n \\n def build_tree(post_end: int, in_start: int, in_end: int) -> tuple[TreeNode | None, int]:\\n if in_start >= in_end: return None, post_end\\n \\n root_val = postorder[post_end]\\n root_index = in_index_map[root_val]\\n \\n r_tree, post_start = build_tree(post_end - 1, root_index + 1, in_end)\\n l_tree, post_start = build_tree(post_start, in_start, root_index)\\n \\n return TreeNode(root_val, l_tree, r_tree), post_start\\n \\n return build_tree(len(postorder) - 1, 0, len(inorder))[0]\\n\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n inorderidx = {v : i for i, v in enumerate(inorder)}\\n\\n def build(l, r):\\n if l>r:\\n return None\\n\\n root = TreeNode(postorder.pop())\\n idx = inorderidx[root.val]\\n \\n root.right = build(idx+1, r)\\n root.left = build(l, idx-1)\\n\\n return root\\n\\n return build(0, len(inorder)-1)\\n\\n \\n \",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n in_map = {}\\n for i in range(len(inorder)):\\n in_map[inorder[i]] = i\\n\\n def dfs(inorder, instart, inend, postorder,poststart,postend,in_map):\\n \\n if instart > inend or poststart < postend:\\n return\\n\\n curr = postorder[poststart]\\n inorder_idx = in_map[curr]\\n right_nums = inend - inorder_idx \\n root = TreeNode(curr)\\n\\n root.right = dfs(inorder, inorder_idx + 1, inend, postorder, poststart - 1, poststart - right_nums, in_map)\\n root.left = dfs(inorder, instart, inorder_idx - 1, postorder, poststart - right_nums - 1, postend, in_map)\\n\\n return root\\n\\n return dfs(inorder, 0, len(inorder)-1, postorder, len(postorder)-1, 0, in_map)\\n\\n \",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n indices = dict()\\n for i in range(len(inorder)):\\n indices[inorder[i]] = i\\n\\n return self.build(inorder, 0, len(inorder)-1, postorder, 0, len(postorder)-1, indices)\\n \\n def build(self, inorder, iStart, iEnd, postorder, pStart, pEnd, indices)-> Optional[TreeNode]:\\n if pStart > pEnd or iStart >iEnd:\\n return \\n root = postorder[pEnd]\\n node = TreeNode(val=root)\\n\\n index = indices[root]\\n leftNodes = index - iStart # important case\\n\\n node.left = self.build(inorder, iStart, index-1, postorder, pStart, pStart+leftNodes-1, indices)\\n node.right = self.build(inorder, index+1, iEnd, postorder, pStart+leftNodes, pEnd-1, indices)\\n\\n return node\\n \\n return node\\n\",\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 def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n postorder = postorder[::-1]\\n d = {}\\n for i, x in enumerate(inorder):\\n d[x] = i\\n # 在inorder两边分治\\n def dfs(root, left, right):\\n if left > right:\\n return None\\n node = TreeNode(val=postorder[root])\\n idx = d[postorder[root]]\\n node.right = dfs(root+1, idx+1, right)\\n node.left = dfs(root+right-idx+1, left, idx-1)\\n return node\\n\\n return dfs(0, 0, len(postorder)-1)\",\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 def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n postorder = postorder[::-1]\\n d = {}\\n for i, x in enumerate(inorder):\\n d[x] = i\\n\\n def dfs(root, left, right):\\n if left > right:\\n return None\\n node = TreeNode(val=postorder[root])\\n idx = d[postorder[root]]\\n node.right = dfs(root+1, idx+1, right)\\n node.left = dfs(root+right-idx+1, left, idx-1)\\n return node\\n\\n return dfs(0, 0, len(postorder)-1)\",\n \"runtime\": \"59\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> TreeNode:\\n def helper(in_left: int, in_right: int) -> TreeNode:\\n # if there are no elements to construct subtrees\\n if in_left > in_right:\\n return None\\n\\n # pick up the last element as a root\\n val = postorder.pop()\\n root = TreeNode(val)\\n\\n # root splits inorder list\\n # into left and right subtrees\\n index = idx_map[val]\\n\\n # build the right subtree\\n root.right = helper(index + 1, in_right)\\n # build the left subtree\\n root.left = helper(in_left, index - 1)\\n return root\\n\\n # build a hashmap value -> its index\\n idx_map = {val: idx for idx, val in enumerate(inorder)}\\n return helper(0, len(inorder) - 1)\\n \",\n \"runtime\": \"59\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n inmap = {val:ind for ind,val in enumerate(inorder)}\\n\\n return self.build(inorder, 0,len(inorder)-1,postorder, 0,len(postorder)-1,inmap)\\n\\n def build(self, inorder, ins,ie ,postorder,ps, pe, inmap):\\n if ps > pe or ins > ie:\\n return None\\n root = TreeNode(postorder[pe])\\n inroot = inmap[root.val]\\n\\n numsleft = inroot - ins\\n root.left = self.build(inorder, ins,inroot - 1 ,postorder,ps, ps + numsleft -1, inmap)\\n root.right = self.build(inorder, inroot + 1,ie ,postorder,ps+numsleft, pe -1, inmap) \\n return root\",\n \"runtime\": \"61\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n mapping = {value: index for index,value in enumerate(inorder)}\\n\\n postorder = deque(postorder)\\n\\n def build(start,end):\\n \\n if start>end: return None\\n root = TreeNode(postorder.pop())\\n mid = mapping[root.val]\\n root.right = build(mid +1, end)\\n root.left = build(start, mid - 1)\\n \\n return root\\n \\n return build(0, len(postorder)-1)\",\n \"runtime\": \"61\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n idx = {j:i for i, j in enumerate(inorder)}\\n post_idx = len(postorder) - 1\\n def build(left, right):\\n nonlocal post_idx\\n if left > right:\\n return None\\n print(post_idx, left, right)\\n root_val = postorder[post_idx]\\n post_idx -= 1\\n root_idx = idx[root_val]\\n root = TreeNode(root_val)\\n root.right = build(root_idx + 1, right)\\n root.left = build(left, root_idx - 1)\\n return root\\n return build(0, len(inorder) - 1)\\n\\n \\n\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def buildTree(\\n self,\\n inorder: list[int],\\n postorder: list[int],\\n ) -> TreeNode | None:\\n inToIndex = {num: i for i, num in enumerate(inorder)}\\n\\n def build(\\n inStart: int,\\n inEnd: int,\\n postStart: int,\\n postEnd: int,\\n ) -> TreeNode | None:\\n if inStart > inEnd:\\n return None\\n\\n rootVal = postorder[postEnd]\\n rootInIndex = inToIndex[rootVal]\\n leftSize = rootInIndex - inStart\\n\\n root = TreeNode(rootVal)\\n root.left = build(inStart, rootInIndex - 1, postStart,\\n postStart + leftSize - 1)\\n root.right = build(rootInIndex + 1, inEnd, postStart + leftSize,\\n postEnd - 1)\\n return root\\n\\n return build(0, len(inorder) - 1, 0, len(postorder) - 1)\",\n \"runtime\": \"63\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n def constructTree(inorder, postorder, inhash, sI, eI, sP, eP):\\n\\n if sI > eI:\\n return\\n\\n ind = inhash[postorder[eP]]\\n root = TreeNode(inorder[ind])\\n lSize = ind - sI\\n\\n root.left = constructTree(inorder, postorder, inhash, sI, ind - 1, sP, sP + lSize - 1)\\n root.right = constructTree(inorder, postorder, inhash, ind + 1, eI, sP + lSize, eP - 1)\\n\\n return root\\n\\n n = len(inorder)\\n\\n inhash = {}\\n for i in range(n):\\n inhash[inorder[i]] = i\\n\\n return constructTree(inorder, postorder, inhash, 0, n - 1, 0, n - 1)\\n\",\n \"runtime\": \"65\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n inorder=inorder[::-1]\\n postorder=postorder[::-1]\\n tree=TreeNode(postorder[0])\\n self.idk(postorder.pop(0),inorder,postorder,tree)\\n return tree\\n def idk(self,mid,inorder,postorder,tree):\\n right=inorder[0:inorder.index(mid)]\\n left=inorder[inorder.index(mid)+1:len(inorder)]\\n if (len(right)!=0):\\n tree.right=TreeNode(postorder[0])\\n org=tree\\n tree=tree.right\\n self.idk(postorder.pop(0),right,postorder,tree)\\n tree=org\\n if (len(left)!=0):\\n tree.left=TreeNode(postorder[0])\\n org=tree\\n tree=tree.left\\n self.idk(postorder.pop(0),left,postorder,tree)\\n tree=org\\n\\n\",\n \"runtime\": \"67\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n '''\\n inorder = [1,9,2,3,15,20,7], postorder = [1,2,9,15,7,20,3]\\n\\n postorder[-1] is the root.\\n idx -> index of postorder[-1] in inorder-> left subtree : inorder[:idx-1] and inorder[idx+1:] -> right subtree.\\n\\n for next, divide into \\n look at postorder[:idx-1] as left subtree in postorder and postorder[idx:len-1] as right subtree\\n\\n\\n\\n '''\\n\\n\\n def traversal(inOrder_start,inOrder_end):\\n # print(inOrder_start,inOrder_end)\\n\\n if inOrder_start>=len(inorder) or inOrder_end<0 or inOrder_start>inOrder_end:\\n return None\\n\\n root = TreeNode(postorder.pop())\\n\\n idx = inorder.index(root.val) # time complexity for this can be further reduced by storing inorder as a hashmap. because index() is O(N) and hashmap gives indices in O(1)\\n\\n root.right = traversal(idx+1,inOrder_end)\\n root.left = traversal(inOrder_start,idx-1)\\n \\n return root\\n \\n return traversal(0,len(inorder)-1)\",\n \"runtime\": \"67\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n def dfs(start, end, postorder_ind):\\n if end == start:\\n return None\\n\\n curr_root = postorder[postorder_ind]\\n root_ind = inorder.index(curr_root)\\n\\n root_node = TreeNode(curr_root)\\n\\n root_node.right = dfs(root_ind + 1, end, postorder_ind - 1)\\n root_node.left = dfs(start, root_ind, postorder_ind - 1 - (end - root_ind - 1))\\n\\n return root_node\\n\\n return dfs(0, len(postorder), len(postorder) - 1)\\n \\n '''\\n reading\\n\\n construct binary binary tree from arrays of inorder and postorder\\n\\n info:\\n\\n what does inorder array tell us\\n for any element, it tells us that anything to left of it is left in tree\\n and same for right\\n\\n for post order, anything to left is part of its subtrees\\n\\n how to get division of when it is left and when it is right subtree?\\n\\n inorder can also tell us what partition is left and right subtree\\n\\n inorder doesn't tell us what is the root of that subtree\\n can postorder tell us\\n\\n if we go in reverse of postorder, it can give us the roots if we go from right to left\\n\\n 9,3,15,20,7\\n 3 is the root\\n split [9], [15,20,7]\\n go to right first\\n next post order root is 20\\n [15,20,7]\\n split [15], [7]\\n go right\\n next postorder root is 7\\n split none and return\\n can go left now\\n next postorder root is 15\\n\\n '''\\n \",\n \"runtime\": \"70\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n self.inorder = inorder\\n self.postorder = postorder\\n return self.dfs(0, len(self.inorder)-1, 0, len(postorder)-1)\\n\\n def dfs(self, in_l, in_r, po_l, po_r):\\n # If index out of range return an empty tree node\\n if in_l > in_r or po_l > po_r:\\n return None\\n\\n # Create the current parent node\\n parent = TreeNode(self.postorder[po_r])\\n\\n # Index of the parent value in inorder array\\n inorder_parent_idx = self.inorder.index(parent.val)\\n\\n # New index range for the left subtree: inorder\\n new_in_left = in_l\\n new_in_right = inorder_parent_idx - 1\\n\\n # New index range for the left subtree: postorder\\n new_po_left = po_l\\n new_po_right = po_l + (new_in_right - new_in_left)\\n\\n # Generate left and right subtree\\n parent.left = self.dfs(new_in_left, new_in_right, new_po_left, new_po_right)\\n parent.right = self.dfs(inorder_parent_idx+1, in_r, new_po_right+1, po_r-1)\\n\\n # Return the parent node\\n return parent\\n\\n\",\n \"runtime\": \"70\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n postorder_ind = [len(postorder) - 1]\\n def dfs(start, end):\\n if end == start:\\n return None\\n\\n curr_root = postorder[postorder_ind[0]]\\n postorder_ind[0] -= 1\\n root_ind = inorder.index(curr_root)\\n\\n root_node = TreeNode(curr_root)\\n\\n root_node.right = dfs(root_ind + 1, end)\\n root_node.left = dfs(start, root_ind)\\n\\n return root_node\\n\\n return dfs(0, len(postorder))\\n \\n '''\\n reading\\n\\n construct binary binary tree from arrays of inorder and postorder\\n\\n info:\\n\\n what does inorder array tell us\\n for any element, it tells us that anything to left of it is left in tree\\n and same for right\\n\\n for post order, anything to left is part of its subtrees\\n\\n how to get division of when it is left and when it is right subtree?\\n\\n inorder can also tell us what partition is left and right subtree\\n\\n inorder doesn't tell us what is the root of that subtree\\n can postorder tell us\\n\\n if we go in reverse of postorder, it can give us the roots if we go from right to left\\n\\n 9,3,15,20,7\\n 3 is the root\\n split [9], [15,20,7]\\n go to right first\\n next post order root is 20\\n [15,20,7]\\n split [15], [7]\\n go right\\n next postorder root is 7\\n split none and return\\n can go left now\\n next postorder root is 15\\n\\n '''\\n \",\n \"runtime\": \"72\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n root_idx = len(postorder) - 1\\n \\n def build_subtree(start_idx, end_idx):\\n nonlocal root_idx\\n if start_idx == end_idx:\\n root_idx -= 1\\n return TreeNode(val=inorder[start_idx])\\n if start_idx > end_idx:\\n return None\\n \\n sub_root = TreeNode(val=postorder[root_idx])\\n inorder_root_idx = inorder.index(postorder[root_idx])\\n root_idx -= 1\\n # check the inorder_root_idx + 1\\n sub_root.right = build_subtree(inorder_root_idx + 1, end_idx)\\n sub_root.left = build_subtree(start_idx, inorder_root_idx - 1)\\n return sub_root\\n\\n root = build_subtree(0, len(inorder) - 1)\\n return root\",\n \"runtime\": \"74\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n # from the last of postorder \\n def helper(in_left, in_right):\\n if in_left > in_right:\\n return None \\n\\n val = postorder.pop()\\n head = TreeNode(val)\\n\\n ind = inorder.index(val)\\n\\n head.right = helper(ind+1, in_right)\\n head.left = helper(in_left, ind -1)\\n \\n return head\\n\\n return helper(0, len(inorder) - 1)\\n\\n \\n \\n \",\n \"runtime\": \"74\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n def help(i, j):\\n if i > j:\\n return None\\n \\n nonlocal post_index\\n val = postorder[post_index]\\n index = inorder.index(val)\\n post_index -= 1\\n\\n root = TreeNode(val)\\n root.right = help(index + 1, j)\\n root.left = help(i, index - 1)\\n return root\\n \\n post_index = len(postorder) - 1\\n return help(0, len(inorder) - 1)\",\n \"runtime\": \"76\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not postorder: return None\\n\\n def _build_tree_helper(left: int, right: int) -> TreeNode:\\n if right < left: return\\n node = TreeNode(postorder.pop())\\n node_idx = inorder.index(node.val)\\n node.right = _build_tree_helper(node_idx+1, right)\\n node.left = _build_tree_helper(left, node_idx-1)\\n return node\\n \\n return _build_tree_helper(0, len(inorder) - 1)\",\n \"runtime\": \"76\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n n = len(inorder)\\n idx = [n-1]\\n def recurse(idx, left, right):\\n if left>right:\\n return None\\n ele = postorder[idx[0]]\\n idx[0]-=1\\n node = TreeNode(ele)\\n if left==right:\\n return node\\n ele_idx = inorder.index(ele, left, right+1)\\n node.right= recurse(idx, ele_idx+1, right)\\n node.left = recurse(idx, left, ele_idx-1)\\n return node\\n root = recurse(idx, 0, len(inorder)-1)\\n return root\",\n \"runtime\": \"78\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n def helper(left,right):\\n if left > right:\\n return None \\n root=TreeNode(postorder.pop())\\n index=inorder.index(root.val)\\n root.right=helper(index+1,right)\\n root.left=helper(left,index-1)\\n return root\\n return helper(0,len(inorder)-1)\\n\\n\\n\\n \",\n \"runtime\": \"78\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n #. 0 1 2. 3 \\n # inorder : 8 9 10 3 15 20 7 \\n #. ---L-- R ---Ri--\\n # posorder: 8 10 9 3 15 20 7\\n #. --L--- ---Ri-- R \\n\\n return self.solve(inorder, 0, len(inorder) - 1, postorder, 0, len(postorder) - 1) \\n\\n def solve(self, io, is_, ie, po, ps, pe): \\n if is_ > ie or ps > pe: \\n return \\n\\n root = TreeNode(po[pe]) \\n i_r_idx = io.index(root.val) \\n length = i_r_idx - is_ \\n root.left = self.solve(io, is_, i_r_idx - 1, po, ps, ps + length - 1)\\n root.right = self.solve(io, i_r_idx + 1, ie, po, ps + length, pe - 1)\\n\\n return root \",\n \"runtime\": \"80\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n #. 0 1 2. 3 \\n # inorder : 8 9 10 3 15 20 7 \\n #. ---L-- R ---Ri--\\n # posorder: 8 10 9 3 15 20 7\\n #. --L--- ---Ri-- R \\n\\n return self.solve(inorder, 0, len(inorder) - 1, postorder, 0, len(postorder) - 1) \\n\\n def solve(self, io, is_, ie, po, ps, pe): \\n if is_ > ie or ps > pe: \\n return \\n\\n root = TreeNode(po[pe]) \\n i_r_idx = io.index(root.val) \\n length = i_r_idx - is_ \\n root.left = self.solve(io, is_, i_r_idx - 1, po, ps, ps + length - 1)\\n root.right = self.solve(io, i_r_idx + 1, ie, po, ps + length, pe - 1)\\n\\n return root \",\n \"runtime\": \"80\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n return self.build(inorder, postorder, 0, len(inorder) - 1, 0, len(postorder) - 1)\\n \\n def build(self, inorder: List[int], postorder: List[int], in_start: int, in_end: int, post_start: int, post_end: int) -> Optional[TreeNode]:\\n if in_start > in_end:\\n return None\\n \\n root_val = postorder[post_end]\\n root = TreeNode(root_val)\\n\\n root_inorder_idx = inorder.index(root_val)\\n\\n root.left = self.build(inorder, postorder, in_start, root_inorder_idx - 1, post_start, post_start + root_inorder_idx - in_start - 1)\\n root.right = self.build(inorder, postorder, root_inorder_idx + 1, in_end, post_start + root_inorder_idx - in_start, post_end - 1)\\n\\n return root\\n \",\n \"runtime\": \"82\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n postorder_ind = [len(postorder) - 1]\\n def dfs(start, end):\\n print(start, end)\\n if end == start:\\n return None\\n if end - start == 1:\\n postorder_ind[0] -= 1\\n return TreeNode(inorder[start])\\n curr_root = postorder[postorder_ind[0]]\\n print(curr_root)\\n postorder_ind[0] -= 1\\n root_ind = inorder.index(curr_root)\\n\\n root_node = TreeNode(curr_root)\\n\\n root_node.right = dfs(root_ind + 1, end)\\n root_node.left = dfs(start, root_ind)\\n\\n return root_node\\n\\n return dfs(0, len(postorder))\\n \\n '''\\n reading\\n\\n construct binary binary tree from arrays of inorder and postorder\\n\\n info:\\n\\n what does inorder array tell us\\n for any element, it tells us that anything to left of it is left in tree\\n and same for right\\n\\n for post order, anything to left is part of its subtrees\\n\\n how to get division of when it is left and when it is right subtree?\\n\\n inorder can also tell us what partition is left and right subtree\\n\\n inorder doesn't tell us what is the root of that subtree\\n can postorder tell us\\n\\n if we go in reverse of postorder, it can give us the roots if we go from right to left\\n\\n 9,3,15,20,7\\n 3 is the root\\n split [9], [15,20,7]\\n go to right first\\n next post order root is 20\\n [15,20,7]\\n split [15], [7]\\n go right\\n next postorder root is 7\\n split none and return\\n can go left now\\n next postorder root is 15\\n\\n '''\\n \",\n \"runtime\": \"82\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n '''\\n inorder = [1,9,2,3,15,20,7], postorder = [1,2,9,15,7,20,3]\\n\\n postorder[-1] is the root.\\n idx -> index of postorder[-1] in inorder-> left subtree : inorder[:idx-1] and inorder[idx+1:] -> right subtree.\\n\\n for next, divide into \\n look at postorder[:idx-1] as left subtree in postorder and postorder[idx:len-1] as right subtree\\n\\n\\n\\n '''\\n\\n\\n def traversal(inOrder_start,inOrder_end):\\n # print(inOrder_start,inOrder_end)\\n\\n if inOrder_start>=len(inorder) or inOrder_end<0 or inOrder_start>inOrder_end:\\n return None\\n\\n root = TreeNode(postorder.pop())\\n\\n idx = inorder.index(root.val)\\n\\n root.right = traversal(idx+1,inOrder_end)\\n root.left = traversal(inOrder_start,idx-1)\\n \\n return root\\n \\n return traversal(0,len(inorder)-1)\",\n \"runtime\": \"85\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n # 这个条件是必要的，因为在递归过程中，可能会遇到子树为空的情况。虽然题目给出了 1 <= inorder.length <= 3000，\\n # 但这个条件描述的是输入的原始列表的长度，而不是递归过程中子问题的长度。\\n # 如果在 inorder 或 postorder 中没有剩下任何元素（[]），意味着我们已经找到了一个叶子节点的子树部分，\\n # 这部分子树是空的。此时，继续递归调用下去是没有意义的，因为没有节点可以构建了，所以应返回 None。\\n\\n # 当我们构建树时，inorder 和 postorder 列表在每次递归调用中都会被分割成左子树和右子树的部分。\\n # 虽然理论上它们的长度应该一致，但由于分割过程的不同，有时可能会出现一个列表为空而另一个列表不为空的情况。\\n # 通常来说是inorder为空\\n if not inorder or not postorder:\\n return None\\n \\n # 后序遍历的最后一个元素是当前树的根节点\\n root_val = postorder.pop()\\n root = TreeNode(root_val)\\n \\n # 在中序遍历中找到根节点的位置\\n mid = inorder.index(root_val)\\n \\n # 递归构建右子树和左子树\\n # 注意先构建右子树再构建左子树，因为后序遍历是先左后右最后根\\n # 由于后序遍历的顺序是左 -> 右 -> 根，并且 postorder 列表的最右边的元素是根节点，倒数第二部分是右子树的元素，再往前才是左子树的元素。\\n \\n # 不需要对 postorder 列表进行切割，因为每次递归调用时，postorder.pop() 操作\\n # 都会减少列表的大小，使得剩余部分可以直接用来构建子树。\\n root.right = self.buildTree(inorder[mid+1:], postorder)\\n root.left = self.buildTree(inorder[:mid], postorder)\\n \\n return root\\n\\n\\n # 寻找根节点位置的操作：\\n # 在每次递归调用中，我们需要在 inorder 列表中查找根节点的位置，inorder.index(root_val) 这一操作的时间复杂度是 O(n)。\\n # 递归构建子树的操作：\\n # 每次递归调用中，我们会将 inorder 列表分为两部分（左子树和右子树），继续递归调用。这会产生两个子问题，其规模分别是原问题的一部分。\\n # 然而，每次递归调用中的查找操作都需要遍历 inorder 列表的部分，因此递归树的每一层都需要 O(n) 时间。递归树的深度为 O(n)，\\n # 因此总的时间复杂度为 O(n^2)。\\n\\n # 递归调用栈的空间：\\n # 因为递归深度最多为 n，空间复杂度为 O(n)。\\n # 存储新树的空间：\\n # 构建树的过程中，我们创建了 n 个新节点，空间复杂度为 O(n)。\\n # 空间复杂度: O(n)\",\n \"runtime\": \"85\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n def build(postorder, inorder):\\n if inorder:\\n p = postorder.pop()\\n # print(\\\"Root: \\\", p, \\\"Post: \\\", postorder, \\\"Inorder: \\\", inorder)\\n index = inorder.index(p)\\n root = TreeNode(inorder[index])\\n\\n root.right = build(postorder, inorder[index+1:])\\n root.left = build(postorder, inorder[:index])\\n return root\\n return build(postorder, inorder)\\n \",\n \"runtime\": \"87\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> TreeNode:\\n # # preorder - root, left, right\\n \\n # # inorder - left, root, right\\n # # postorder - left, right, root\\n \\n # this is very nice recursive solution\\n if not inorder:\\n return None\\n\\n # taking the root of the tree or sub tree\\n cur_val = postorder.pop()\\n \\n # finding the root index in inorder\\n idx = inorder.index(cur_val)\\n print(cur_val, idx)\\n \\n # now we have 2 trees\\n # somehow we need to start from right\\n right = self.buildTree(inorder[idx + 1:], postorder)\\n left = self.buildTree(inorder[:idx], postorder)\\n\\n return TreeNode(cur_val, left, right)\",\n \"runtime\": \"87\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n il = 0\\n ir = len(inorder) - 1\\n rp = len(postorder) - 1\\n\\n def findSubtree(il, ir, rp):\\n if il > ir or rp < 0:\\n return None\\n \\n root_val = postorder[rp]\\n root_index = inorder.index(root_val)\\n left_root = rp - (ir - root_index) - 1\\n\\n curr = TreeNode(root_val)\\n curr.left = findSubtree(il, root_index - 1, left_root)\\n curr.right = findSubtree(root_index + 1, ir, rp - 1)\\n\\n return curr\\n\\n return findSubtree(il, ir, rp)\",\n \"runtime\": \"89\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n ## Initially, push the root node into the stack\\n root = TreeNode(postorder[-1])\\n stack = [(root, 0, len(inorder), inorder.index(root.val), 'RIGHT')]\\n ## Current index in 'postorder', start from the end 'len(postorder)-2'\\n curIndex = len(postorder)-2\\n while stack:\\n node, start, end, index, which = stack.pop()\\n ## Processing the right node\\n if which == 'RIGHT':\\n ## Push the node back to the stack again to process its right node in the next traversal\\n stack.append((node, start, end, index, 'LEFT'))\\n if index+1 < end:\\n rindex = inorder[index+1:end].index(postorder[curIndex]) + index + 1\\n node.right = TreeNode(postorder[curIndex])\\n curIndex -= 1\\n stack.append((node.right, index+1, end, rindex, 'RIGHT'))\\n ## Processing the left node\\n if which == 'LEFT':\\n if start < index:\\n lindex = inorder[start:index].index(postorder[curIndex]) + start\\n node.left = TreeNode(postorder[curIndex])\\n curIndex -= 1\\n stack.append((node.left, start, index, lindex, 'RIGHT'))\\n ## End of while loop\\n\\n return root\",\n \"runtime\": \"89\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n if (len(inorder)<=0):\\n return\\n root=TreeNode(postorder.pop())\\n idx=inorder.index(root.val)\\n root.right=self.buildTree(inorder[idx+1:],postorder)\\n root.left=self.buildTree(inorder[:idx],postorder)\\n return root\",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"# 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 buildTree(self, inorder, postorder):\\n \\n if not inorder:\\n return None\\n \\n root_val = postorder.pop() # Extract root\\n root = TreeNode(root_val)\\n\\n mid = inorder.index(root_val)\\n root.right = self.buildTree(inorder[mid+1:], postorder)\\n root.left = self.buildTree(inorder[:mid], postorder)\\n\\n return root\",\n \"runtime\": \"91\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if inorder is None or postorder is None:\\n return None\\n if len(inorder) * len(postorder) == 0:\\n return None\\n \\n head = postorder.pop()\\n idx = inorder.index(head)\\n right = self.buildTree(inorder[idx + 1:], postorder)\\n left = self.buildTree(inorder[:idx], postorder)\\n\\n return TreeNode(val=head, left=left, right=right)\\n \",\n \"runtime\": \"93\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n # print(f'{postorder=} {inorder=}')\\n if not inorder:\\n return None\\n \\n root = postorder.pop()\\n # print(f'{root=}')\\n i = inorder.index(root)\\n right = self.buildTree(inorder[i+1:], postorder)\\n left = self.buildTree(inorder[:i], postorder)\\n # print(f'{root=} {left=} {right=}')\\n return TreeNode(root, left, right)\",\n \"runtime\": \"93\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n if not inorder or not postorder:\\n return None\\n \\n root_val = postorder.pop()\\n root = TreeNode(root_val)\\n\\n inorder_index= inorder.index(root_val)\\n\\n # We build the right subtree first because we are popping elements from the end of postorder array\\n root.right = self.buildTree(inorder[inorder_index+1:],postorder)\\n root.left = self.buildTree(inorder[:inorder_index], postorder)\\n\\n return root\",\n \"runtime\": \"95\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n root = postorder.pop()\\n if len(inorder) == 1:\\n return TreeNode(root)\\n \\n root_index = inorder.index(root)\\n\\n right = self.buildTree(inorder[root_index+1:], postorder)\\n left = self.buildTree(inorder[:root_index], postorder)\\n\\n return TreeNode(root, left, right)\\n \",\n \"runtime\": \"95\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n # Base case\\n if not inorder:\\n return None\\n\\n # The last element in postorder is the root node\\n root_val = postorder.pop()\\n node = TreeNode(root_val)\\n\\n # Find the index of the root in inorder list\\n index = inorder.index(root_val)\\n\\n # Recursively build the right and left subtrees\\n # Important: build right subtree first since we are popping from postorder's end\\n node.right = self.buildTree(inorder[index + 1:], postorder)\\n node.left = self.buildTree(inorder[:index], postorder)\\n \\n return node\\n\",\n \"runtime\": \"98\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n # 这个条件是必要的，因为在递归过程中，可能会遇到子树为空的情况。虽然题目给出了 1 <= inorder.length <= 3000，\\n # 但这个条件描述的是输入的原始列表的长度，而不是递归过程中子问题的长度。\\n # 如果在 inorder 或 postorder 中没有剩下任何元素（[]），意味着我们已经找到了一个叶子节点的子树部分，\\n # 这部分子树是空的。此时，继续递归调用下去是没有意义的，因为没有节点可以构建了，所以应返回 None。\\n\\n # 当我们构建树时，inorder 和 postorder 列表在每次递归调用中都会被分割成左子树和右子树的部分。\\n # 虽然理论上它们的长度应该一致，但由于分割过程的不同，有时可能会出现一个列表为空而另一个列表不为空的情况。\\n # 通常来说是inorder为空\\n if not inorder or not postorder:\\n return None\\n \\n # 后序遍历的最后一个元素是当前树的根节点\\n root_val = postorder.pop()\\n root = TreeNode(root_val)\\n \\n # 在中序遍历中找到根节点的位置\\n mid = inorder.index(root_val)\\n \\n # 递归构建右子树和左子树\\n # 注意先构建右子树再构建左子树，因为后序遍历是先左后右最后根\\n # 由于后序遍历的顺序是左 -> 右 -> 根，并且 postorder 列表的最右边的元素是根节点，倒数第二部分是右子树的元素，再往前才是左子树的元素。\\n \\n # 不需要对 postorder 列表进行切割，因为每次递归调用时，postorder.pop() 操作\\n # 都会减少列表的大小，使得剩余部分可以直接用来构建子树。\\n root.right = self.buildTree(inorder[mid+1:], postorder)\\n root.left = self.buildTree(inorder[:mid], postorder)\\n \\n return root\\n\",\n \"runtime\": \"98\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n node_val = postorder.pop()\\n # print('postorder:', postorder)\\n node = TreeNode(node_val)\\n # print(node_val, inorder)\\n inorder_index = inorder.index(node_val)\\n \\n # print(node_val)\\n # print(inorder_index)\\n left_inorder = inorder[:inorder_index]\\n right_inorder = inorder[inorder_index + 1:]\\n \\n node.right = self.buildTree(right_inorder, postorder)\\n node.left = self.buildTree(left_inorder, postorder)\\n\\n return node\",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n\\n rootVal = postorder.pop()\\n root = TreeNode(rootVal)\\n\\n rootIdx = inorder.index(rootVal)\\n\\n root.right = self.buildTree(inorder[rootIdx + 1:], postorder)\\n root.left = self.buildTree(inorder[:rootIdx], postorder)\\n\\n return root \",\n \"runtime\": \"100\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n root_val = postorder.pop()\\n root = TreeNode(root_val)\\n \\n inorder_index = inorder.index(root_val)\\n \\n root.right = self.buildTree(inorder[inorder_index+1:],postorder)\\n root.left = self.buildTree(inorder[:inorder_index],postorder)\\n\\n return root\",\n \"runtime\": \"102\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n #do not forget basecase\\n if not inorder or not postorder:\\n return None\\n cur_val = postorder.pop()\\n cur = TreeNode(cur_val)\\n mid = inorder.index(cur_val)\\n cur.left = self.buildTree(inorder[:mid], postorder[:mid])\\n cur.right = self.buildTree(inorder[mid+1:], postorder[mid:])\\n return cur\\n\",\n \"runtime\": \"102\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not postorder:\\n return None\\n root = TreeNode(postorder[-1])\\n ri = inorder.index(postorder[-1])\\n act_nodes = deque([(root, 0, ri, len(inorder))])\\n for v in postorder[-2::-1]:\\n new_node = TreeNode(v)\\n par_node, par_left, par_ni, par_right = act_nodes.pop()\\n if par_left != par_ni and v in inorder[par_left:par_ni]:\\n par_node.left = new_node\\n nni = inorder.index(v, par_left, par_ni)\\n # if par_ni + 1 != par_right:\\n # act_nodes.append((par_node, par_ni, par_ni, par_right))\\n if nni != par_left or nni != par_ni - 1:\\n act_nodes.append((new_node, par_left, nni, par_ni))\\n elif v in inorder[par_ni + 1:par_right]:\\n par_node.right = new_node\\n nni = inorder.index(v, par_ni + 1, par_right)\\n if par_left != par_ni:\\n act_nodes.append((par_node, par_left, par_ni, par_ni+1))\\n if nni != par_ni + 1 or nni != par_right - 1:\\n act_nodes.append((new_node, par_ni + 1, nni, par_right))\\n return root\",\n \"runtime\": \"104\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n def build(self, inorder, postorder):\\n if inorder:\\n idx = inorder.index(postorder.pop())\\n root = TreeNode(inorder[idx])\\n\\n root.right = build(self, inorder[idx+1:], postorder)\\n root.left = build(self, inorder[:idx], postorder)\\n return root\\n return build(self, inorder, postorder)\\n\\n\\n \\n\\n\",\n \"runtime\": \"104\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n root = TreeNode(postorder.pop())\\n mid = inorder.index(root.val)\\n root.right = self.buildTree(inorder[mid+1:], postorder)\\n root.left = self.buildTree(inorder[:mid], postorder)\\n return root\",\n \"runtime\": \"106\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder: return None\\n root = TreeNode(postorder.pop())\\n root_index_inorder = inorder.index(root.val)\\n root.right = self.buildTree(inorder[root_index_inorder + 1:], postorder)\\n root.left = self.buildTree(inorder[:root_index_inorder], postorder)\\n return root\\n \",\n \"runtime\": \"106\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(inorder) == 0 or len(postorder) == 0:\\n return None\\n root_elem = postorder.pop()\\n root = TreeNode(root_elem)\\n mid = inorder.index(root_elem)\\n root.right = self.buildTree(inorder[mid + 1:], postorder)\\n root.left = self.buildTree(inorder[:mid], postorder)\\n return root\\n \",\n \"runtime\": \"113\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(inorder) == 0:\\n return None\\n root = TreeNode(val=postorder.pop())\\n mid = inorder.index(root.val)\\n root.right = self.buildTree(inorder[mid + 1:], postorder)\\n root.left = self.buildTree(inorder[:mid], postorder)\\n return root\\n\",\n \"runtime\": \"113\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n\\n root_val = postorder.pop()\\n root = TreeNode(root_val)\\n inorder_index = inorder.index(root_val)\\n\\n root.right = self.buildTree(inorder[inorder_index + 1:], postorder)\\n root.left = self.buildTree(inorder[:inorder_index], postorder)\\n\\n return root\",\n \"runtime\": \"115\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n head = None\\n def build (inorder, postorder):\\n if not inorder or not postorder:\\n return \\n root = TreeNode(postorder[-1])\\n ind = inorder.index(postorder[-1])\\n left_split = inorder[:ind]\\n right_split=inorder[ind+1:]\\n left_post = postorder[:ind]\\n right_post = postorder[ind:-1]\\n root.left = build(left_split,left_post)\\n root.right = build(right_split, right_post)\\n return root\\n head = build(inorder,postorder)\\n return head\\n\\n \\n \",\n \"runtime\": \"115\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not postorder or not inorder:\\n return None\\n # print('------------------------------')\\n # print(inorder)\\n # print(postorder)\\n root = TreeNode(postorder[-1])\\n index = inorder.index(postorder[-1])\\n\\n root.left = self.buildTree(inorder[:index], postorder[:index])\\n root.right = self.buildTree(inorder[index+1:], postorder[index:-1])\\n return root\",\n \"runtime\": \"117\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n n = len(inorder)\\n if n == 1:\\n \\n return TreeNode(inorder[0])\\n \\n def dfs(inorder,postorder):\\n if not inorder:\\n \\n return None\\n \\n root_val = postorder[-1]\\n \\n index = inorder.index(root_val)\\n \\n root = TreeNode(root_val)\\n \\n root.left = dfs(inorder[:index],postorder[:index])\\n root.right = dfs(inorder[index+1:],postorder[index:-1])\\n \\n return root\\n \\n root = dfs(inorder,postorder)\\n \\n return root\",\n \"runtime\": \"117\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n \\n\\n def build(inorder, postorder):\\n if len(postorder) == 0:\\n return None\\n num = postorder.pop()\\n node = TreeNode(num)\\n idx = inorder.index(num)\\n node.left = build(inorder[:idx], postorder[:idx])\\n node.right = build(inorder[idx+1:], postorder[idx:])\\n\\n return node\\n return build(inorder, postorder)\",\n \"runtime\": \"119\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return\\n # print(inorder, postorder)\\n root = TreeNode(postorder[-1])\\n mid = inorder.index(postorder[-1])\\n \\n root.right = self.buildTree(inorder[mid+1:], postorder[mid:-1])\\n root.left = self.buildTree(inorder[:mid], postorder[:mid])\\n \\n return root\\n\",\n \"runtime\": \"119\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n if not inorder or not postorder:\\n return None\\n\\n current = TreeNode()\\n current.val = postorder[-1]\\n\\n current_idx = inorder.index(current.val)\\n current.left = self.buildTree(inorder[:current_idx], postorder[:current_idx])\\n current.right = self.buildTree(inorder[current_idx+1:], postorder[current_idx:-1])\\n\\n return current\",\n \"runtime\": \"121\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n n = len(inorder)\\n if n == 1:\\n \\n return TreeNode(inorder[0])\\n \\n def dfs(inorder,postorder):\\n if not inorder:\\n \\n return None\\n \\n root_val = postorder[-1]\\n \\n index = inorder.index(root_val)\\n \\n root = TreeNode(root_val)\\n \\n root.left = dfs(inorder[:index],postorder[:index])\\n root.right = dfs(inorder[index+1:],postorder[index:-1])\\n \\n return root\\n \\n root = dfs(inorder,postorder)\\n \\n return root\",\n \"runtime\": \"121\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n root=TreeNode(postorder[-1])\\n mid=inorder.index(postorder[-1])\\n root.left=self.buildTree(inorder[:mid],postorder[:mid])\\n root.right=self.buildTree(inorder[mid+1:],postorder[mid:-1])\\n return root\",\n \"runtime\": \"123\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(postorder) == 0:\\n return None\\n node = TreeNode(val=postorder[-1])\\n if len(postorder) == 1:\\n return node\\n #root_index also = left tree size\\n root_index = inorder.index(postorder[-1])\\n #print(preorder[1:root_index+1],inorder[0:root_index])\\n #print(preorder[root_index+1:],inorder[root_index+1:])\\n node.left = self.buildTree(inorder[0:root_index],postorder[:root_index])\\n node.right = self.buildTree(inorder[root_index+1:],postorder[root_index:-1])\\n return node \",\n \"runtime\": \"123\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder: return None\\n root = TreeNode(postorder[-1])\\n pos = inorder.index(postorder[-1])\\n root.left = self.buildTree(inorder[:pos],postorder[:pos])\\n root.right = self.buildTree(inorder[pos+1:],postorder[pos:-1])\\n return root\\n\\n \",\n \"runtime\": \"125\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n root = TreeNode(postorder[-1])\\n inorder_idx = inorder.index(postorder[-1])\\n # print(postorder[-1], inorder_idx, inorder[:inorder_idx], postorder[:inorder_idx], inorder[inorder_idx+1:], postorder[inorder_idx:-2])\\n root.left = self.buildTree(inorder[:inorder_idx], postorder[:inorder_idx])\\n root.right = self.buildTree(inorder[inorder_idx+1:], postorder[inorder_idx:-1])\\n return root\",\n \"runtime\": \"125\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n\\n cur_root_val = postorder[-1]\\n root = TreeNode(cur_root_val)\\n index = inorder.index(cur_root_val)\\n\\n root.left = self.buildTree(inorder[:index], postorder[:index])\\n root.right = self.buildTree(inorder[index+1:], postorder[index:-1]) # postorder[index:-1] 表示 从 index开始 到 倒数第二个元素, 所以是 postorder[index: -1]\\n return root\",\n \"runtime\": \"128\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return\\n\\n if len(inorder) == 1:\\n return TreeNode(inorder[0])\\n\\n root_val = postorder[-1]\\n root = TreeNode(root_val)\\n\\n rootindex = inorder.index(root_val)\\n\\n root.left = self.buildTree(inorder[:rootindex], postorder[:rootindex])\\n root.right = self.buildTree(inorder[rootindex+1:], postorder[rootindex:-1])\\n\\n return root\\n\\n \",\n \"runtime\": \"128\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n root=TreeNode(postorder[-1])\\n index=inorder.index(postorder[-1])\\n root.left=self.buildTree(inorder[:index],postorder[:index])\\n root.right=self.buildTree(inorder[index+1:],postorder[index:-1])\\n return root\\n \",\n \"runtime\": \"130\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(inorder) == 0:\\n return None\\n if len(inorder) == 1:\\n return TreeNode(val=inorder[0])\\n root_node = TreeNode(val=postorder[-1])\\n root_node_val = postorder[-1]\\n if postorder == inorder:\\n left_subnode = self.buildTree(inorder[:-1], postorder[:-1])\\n root_node.left = left_subnode\\n return root_node\\n i = 0\\n while inorder[i] != root_node_val:\\n i+= 1\\n left_inorder = inorder[:i]\\n right_inorder = inorder[i+1:]\\n j = 0\\n while postorder[j] in left_inorder:\\n j += 1\\n left_postorder = postorder[:j]\\n right_postorder = postorder[j:-1]\\n left_subtree = self.buildTree(left_inorder, left_postorder)\\n right_subtree = self.buildTree(right_inorder, right_postorder)\\n root_node.left = left_subtree\\n root_node.right = right_subtree\\n return root_node\",\n \"runtime\": \"130\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n if not inorder:\\n return None\\n \\n root_val = postorder[-1]\\n root = TreeNode(root_val)\\n \\n idx = inorder.index(root_val)\\n \\n root.left = self.buildTree(inorder[:idx], postorder[:idx])\\n root.right = self.buildTree(inorder[idx+1:], postorder[idx:-1])\\n\\n return root\",\n \"runtime\": \"132\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n root_value = postorder[-1]\\n root = TreeNode(root_value)\\n idx = inorder.index(root_value)\\n root.left = self.buildTree(inorder[:idx], postorder[:idx])\\n root.right = self.buildTree(inorder[idx+1:], postorder[idx:-1])\\n return root\",\n \"runtime\": \"132\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n if not inorder and not postorder:\\n return None\\n\\n root = postorder[-1]\\n root_index = inorder.index(root)\\n\\n node = TreeNode(val=root)\\n left_length = len(inorder[:root_index])\\n\\n node.left = self.buildTree(inorder[:root_index], postorder[:left_length])\\n node.right = self.buildTree(inorder[root_index+1:], postorder[left_length:-1])\\n return node\\n \",\n \"runtime\": \"134\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n \\n\\n root = TreeNode(postorder[-1])\\n mid = inorder.index(postorder[-1])\\n\\n root.left = self.buildTree(inorder[:mid], postorder[:mid])\\n root.right = self.buildTree(inorder[mid+1:], postorder[mid:-1])\\n return root\",\n \"runtime\": \"134\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n root = TreeNode(postorder[len(postorder)-1])\\n mid = inorder.index(postorder[len(postorder)-1])\\n root.left = self.buildTree(inorder[:mid],postorder[:mid])\\n root.right = self.buildTree(inorder[mid+1:],postorder[mid:-1])\\n return root\",\n \"runtime\": \"136\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(inorder) == 0:\\n return None\\n node = TreeNode(postorder[-1])\\n index = inorder.index(postorder[-1])\\n node.left = self.buildTree(inorder[0:index], postorder[0:index])\\n node.right = self.buildTree(inorder[index + 1:len(inorder)], postorder[index:len(postorder) - 1])\\n return node\\n\",\n \"runtime\": \"136\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not postorder:\\n return None\\n\\n root_val = postorder[-1]\\n i = inorder.index(root_val)\\n\\n left_in = inorder[:i]\\n right_in = inorder[i+1:]\\n\\n left_post = postorder[:i]\\n right_post = postorder[i:-1]\\n \\n return TreeNode(root_val, self.buildTree(left_in, left_post), self.buildTree(right_in, right_post))\",\n \"runtime\": \"138\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n pos = inorder.index(postorder[-1]) if inorder else -1\\n return TreeNode(postorder[-1], self.buildTree(inorder[:pos], postorder[:pos]), self.buildTree(inorder[pos+1:],postorder[pos:-1])) if pos > -1 else None\",\n \"runtime\": \"138\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n \\n root_val = postorder[-1]\\n root = TreeNode(root_val)\\n\\n root_index = inorder.index(root_val)\\n\\n root.left = self.buildTree(inorder[:root_index], postorder[:root_index])\\n root.right = self.buildTree(inorder[root_index+1:], postorder[root_index:-1])\\n\\n return root\",\n \"runtime\": \"141\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n \\n root = postorder[-1]\\n idx = inorder.index(root)\\n \\n new_node = ListNode(root)\\n new_node.left = self.buildTree(inorder[:idx], postorder[:idx])\\n new_node.right = self.buildTree(inorder[idx + 1:], postorder[idx:-1])\\n \\n return new_node\",\n \"runtime\": \"141\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n root=TreeNode(postorder[-1])\\n index=inorder.index(postorder[-1])\\n root.left=self.buildTree(inorder[:index],postorder[:index])\\n root.right=self.buildTree(inorder[index+1:],postorder[index:-1])\\n return root\",\n \"runtime\": \"143\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n root = TreeNode(postorder[-1]) # L R Rt\\n index = inorder.index(postorder[-1])\\n root.left = self.buildTree(inorder[:index], postorder[:index])\\n root.right = self.buildTree(inorder[index+1:], postorder[index:-1])\\n return root\",\n \"runtime\": \"143\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n head = None\\n def build (inorder, postorder):\\n if not inorder or not postorder:\\n return \\n root = TreeNode(postorder[-1])\\n ind = inorder.index(postorder[-1])\\n left_split = inorder[:ind]\\n right_split=inorder[ind+1:]\\n left_post = postorder[:ind]\\n right_post = postorder[ind:-1]\\n root.left = build(left_split,left_post)\\n root.right = build(right_split, right_post)\\n return root\\n head = build(inorder,postorder)\\n return head\\n\\n \\n \",\n \"runtime\": \"145\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if inorder == []:\\n return None\\n \\t\\n root = postorder[-1]\\n root_index = inorder.index(root)\\n left_inorder, right_inorder = inorder[:root_index], inorder[root_index+1:]\\n left_length = len(left_inorder)\\n left_postorder, right_postorder = postorder[:left_length], postorder[left_length:-1]\\n\\n return TreeNode(root, self.buildTree(left_inorder, left_postorder), self.buildTree(right_inorder, right_postorder))\",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"from typing import List, 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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n \\n # The last element in postorder is the root\\n root_val = postorder.pop()\\n root = TreeNode(root_val)\\n \\n # Find the index of the root in the inorder list\\n root_index_inorder = inorder.index(root_val)\\n \\n # Split inorder list into left and right subtrees\\n inorder_left = inorder[:root_index_inorder]\\n inorder_right = inorder[root_index_inorder + 1:]\\n \\n # Split postorder list into left and right subtrees\\n # Note: The length of the left subtree in both inorder and postorder lists is the same\\n postorder_left = postorder[:len(inorder_left)]\\n postorder_right = postorder[len(inorder_left):]\\n \\n # Recursively build the left and right subtrees\\n root.left = self.buildTree(inorder_left, postorder_left)\\n root.right = self.buildTree(inorder_right, postorder_right)\\n \\n return root\\n\\n# Helper function to print the tree (for debugging)\\ndef printTree(node: TreeNode, level=0):\\n if node is not None:\\n printTree(node.right, level + 1)\\n print(' ' * 4 * level + '->', node.val)\\n printTree(node.left, level + 1)\\n\\n# Example usage:\\nsolution = Solution()\\ninorder = [9, 3, 15, 20, 7]\\npostorder = [9, 15, 7, 20, 3]\\nroot = solution.buildTree(inorder, postorder)\\nprintTree(root)\",\n \"runtime\": \"147\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n \\n root_val = postorder[-1]\\n root_idx = inorder.index(root_val)\\n inorder_left = inorder[:root_idx]\\n inorder_right = inorder[root_idx+1:]\\n postorder_left = postorder[:root_idx]\\n postorder_right = postorder[root_idx:-1]\\n\\n left_node = self.buildTree(inorder_left, postorder_left)\\n right_node = self.buildTree(inorder_right, postorder_right)\\n root = TreeNode(root_val, left_node, right_node)\\n\\n return root\",\n \"runtime\": \"147\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not postorder: return\\n # create a subtree root\\n root = TreeNode(postorder[-1])\\n # partition lists\\n pivot = inorder.index(postorder[-1])\\n root.left = self.buildTree(inorder[:pivot], postorder[:pivot])\\n root.right = self.buildTree(inorder[pivot + 1:], postorder[pivot:-1])\\n return root\",\n \"runtime\": \"149\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n if len(inorder) == 1:\\n return TreeNode(inorder[0])\\n \\n root_val = postorder.pop(-1)\\n root_idx = inorder.index(root_val)\\n root = TreeNode(val=root_val)\\n\\n left_inorder = inorder[:root_idx]\\n right_inorder = inorder[root_idx+1:]\\n\\n left_postorder = postorder[:len(left_inorder)]\\n right_postorder = postorder[len(left_inorder):]\\n\\n root.left = self.buildTree(left_inorder, left_postorder)\\n root.right = self.buildTree(right_inorder, right_postorder)\\n \\n return root\\n\\n\",\n \"runtime\": \"149\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n root_val=postorder[-1]\\n root=TreeNode(root_val)\\n root_index=inorder.index(root_val)\\n\\n left_inorder=inorder[:root_index]\\n right_inorder=inorder[root_index+1:]\\n\\n left_postorder=postorder[:len(left_inorder)]\\n right_postorder=postorder[len(left_inorder):-1]\\n\\n root.left=self.buildTree(left_inorder,left_postorder)\\n root.right=self.buildTree(right_inorder,right_postorder)\\n return root\\n\",\n \"runtime\": \"151\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n inorder_hash = {}\\n postorder_hash = {}\\n for idx in range(len(inorder)):\\n inorder_hash[inorder[idx]] = idx\\n for idx in range(len(postorder)):\\n postorder_hash[postorder[idx]] = idx\\n\\n return self.helper(inorder, postorder, inorder_hash, postorder_hash)\\n\\n def helper(self, inorder, postorder, inorder_hash, postorder_hash):\\n if len(inorder) == 1:\\n return TreeNode(inorder[0])\\n if len(inorder) == 0:\\n return None\\n #print(inorder, postorder)\\n root_val = postorder[-1]\\n root_idx = inorder.index(root_val)# inorder_hash[root_val]\\n\\n leftTree = self.helper(inorder[:root_idx], postorder[:root_idx], inorder_hash, postorder_hash)\\n rightTree = self.helper(inorder[root_idx+1:], postorder[root_idx:len(postorder)-1], inorder_hash, postorder_hash)\\n root = TreeNode(root_val, left=leftTree, right=rightTree)\\n\\n return root\\n\",\n \"runtime\": \"151\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not postorder or not inorder:\\n return None\\n \\n val = postorder.pop()\\n root = TreeNode(val)\\n\\n index = 0\\n for i in range(len(inorder)):\\n if inorder[i] == val:\\n index = i\\n \\n root.right = self.buildTree(inorder[index+1:], postorder)\\n root.left = self.buildTree(inorder[:index], postorder)\\n\\n return root\",\n \"runtime\": \"153\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\ninorder = Left Root Right\\npostorder = Left Right Root\\ni start i end [9, 3, 15, 20, 7] p start p end \\n[9, 15, 7, 20, 3]\\nroot val 3\\ni start i end [9] p start p end \\n[9]\\nroot val 9\\ni start i end [15, 20, 7] p start p end \\n[15, 7, 20]\\nroot val 20\\ni start i end [15] p start p end \\n[15, 7]\\nroot val 7\\ni start i end [9, 3, 15] p start p end \\n[]\\nroot val 15\\ni start i end [9, 3] p start p end \\n[]\\nroot val 15\\ni start i end [9, 3] p start p end \\n[]\\nroot val 9\\ni start i end [3] p start p end \\n[]\\nroot val 3\\ni start i end [7] p start p end \\n[]\\nroot val 7\\n\\n[9, ]\\n\\n inorder = [9,3,15,20,7]\\n postorder = [9,15,7,20,3]\\n\\n\\n 9 15 20 7\\n 9 15 7 20\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n def helper(i_start, i_end, p_start, p_end):\\n if i_start > i_end:\\n return None\\n\\n root_index = -1\\n root_val = postorder[p_end]\\n root_node = TreeNode(val=root_val)\\n # left inorder traversal\\n for i in range(i_start, i_end + 1):\\n node = inorder[i]\\n if node == root_val:\\n root_index = i\\n # inorder x y z root a b \\n # postorder x y z a b root\\n\\n left_len = root_index - 1 - i_start + 1\\n\\n left_tree = helper(i_start = i_start, i_end = root_index - 1, p_start = p_start, p_end = p_start + left_len - 1)\\n right_tree = helper(i_start = root_index + 1, i_end = i_end, p_start = p_start + left_len, p_end = p_end - 1)\\n \\n root_node.left = left_tree\\n root_node.right = right_tree\\n return root_node\\n\\n n = len(inorder)\\n return helper(0, n - 1, 0, n - 1)\\n\\n\",\n \"runtime\": \"153\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\nfrom typing import List\\n\\n\\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\\n\\nclass Solution:\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n rootVal = postorder[-1]\\n root = TreeNode(rootVal)\\n if len(inorder) > 1 and len(postorder) > 1:\\n index = inorder.index(rootVal)\\n leftInorder = inorder[:index]\\n rightInorder = inorder[index+1:]\\n leftPostorder = postorder[:len(leftInorder)]\\n rightPostorder = postorder[len(leftInorder): len(postorder)-1]\\n if leftInorder and leftPostorder:\\n root.left = self.buildTree(leftInorder, leftPostorder)\\n else:\\n root.left = None\\n \\n if rightInorder and rightPostorder:\\n root.right = self.buildTree(rightInorder, rightPostorder)\\n else:\\n root.right = None\\n return root\\n else:\\n return root\\n\",\n \"runtime\": \"156\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n if len(inorder)==1:\\n return TreeNode(postorder[-1])\\n root = TreeNode(postorder[-1])\\n idx = inorder.index(postorder[-1])\\n left_inorder = inorder[:idx]\\n right_inorder = inorder[idx+1:]\\n left_postorder = postorder[:idx]\\n right_postorder = postorder[idx:-1]\\n root.left = self.buildTree(left_inorder, left_postorder)\\n root.right = self.buildTree(right_inorder, right_postorder)\\n return root\",\n \"runtime\": \"156\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(inorder) == 0:\\n return\\n root = TreeNode(postorder[-1])\\n ind_inorder = inorder.index(root.val)\\n left_inorder,right_inorder = inorder[:ind_inorder],inorder[ind_inorder+1:]\\n del inorder[ind_inorder]\\n del postorder[-1]\\n left_postorder,right_postorder = postorder[:len(left_inorder)],postorder[-len(right_inorder):]\\n \\n root.left = self.buildTree(left_inorder,left_postorder)\\n root.right = self.buildTree(right_inorder,right_postorder)\\n return root\",\n \"runtime\": \"158\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(inorder) == 0:\\n return None\\n if len(inorder) == 1:\\n return TreeNode(inorder[0])\\n\\n mid = postorder[-1]\\n\\n idxInorder = inorder.index(mid)\\n\\n root = TreeNode(mid)\\n\\n root.left = self.buildTree(inorder[:idxInorder], postorder[:len(inorder[:idxInorder])])\\n root.right = self.buildTree(inorder[idxInorder+1:], postorder[len(inorder[:idxInorder]):-1])\\n \\n return root\\n \",\n \"runtime\": \"158\"\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 # preorder: root -> left -> right [3,9,20,15,7]\\n # inorder: left -> root -> right [9,3,15,20,7]\\n # postorder: left -> right -> root [9,15,7,20,3]\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n def rec(inorder, postorder):\\n if not inorder or not postorder:\\n return None\\n\\n root = TreeNode(postorder[-1])\\n if root.val in inorder:\\n idx = inorder.index(root.val)\\n else:\\n return rec(inorder, postorder[:-1])\\n root.left = rec(inorder[:idx], postorder[:-1])\\n root.right = rec(inorder[idx+1:], postorder[:-1])\\n return root\\n return rec(inorder, postorder)\\n\",\n \"runtime\": \"160\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not postorder:\\n return None\\n root = TreeNode(postorder[-1])\\n if len(postorder) == 1:\\n return root\\n inorder_idx = inorder.index(root.val)\\n inorder_left = inorder[:inorder_idx]\\n inorder_right = inorder[inorder_idx + 1:]\\n\\n postorder_left = postorder[:inorder_idx]\\n postorder_right = postorder[inorder_idx:-1]\\n\\n root.left = self.buildTree(inorder_left, postorder_left)\\n root.right = self.buildTree(inorder_right, postorder_right)\\n return root\\n\",\n \"runtime\": \"160\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n def build(post: int, instart: int, inend: int):\\n node = TreeNode(postorder[post])\\n if instart == inend:\\n return node\\n\\n if instart > inend:\\n return None\\n\\n root = None\\n\\n for i in range(instart, inend + 1):\\n if inorder[i] == postorder[post]:\\n root = i\\n\\n node.left = build(post - (inend - root) - 1, instart, root - 1)\\n node.right = build(post - 1, root + 1, inend)\\n\\n return node\\n\\n return build(len(postorder) - 1, 0, len(inorder) - 1)\",\n \"runtime\": \"162\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n # 第一步: 特殊情况讨论: 树为空. (递归终止条件)\\n if not postorder:\\n return None\\n\\n # 第二步: 后序遍历的最后一个就是当前的中间节点.\\n root_val = postorder[-1]\\n root = TreeNode(root_val)\\n\\n # 第三步: 找切割点.\\n separator_idx = inorder.index(root_val)\\n\\n # 第四步: 切割inorder数组. 得到inorder数组的左,右半边.\\n inorder_left = inorder[:separator_idx]\\n inorder_right = inorder[separator_idx + 1:]\\n\\n # 第五步: 切割postorder数组. 得到postorder数组的左,右半边.\\n # 重点1: 中序数组大小一定跟后序数组大小是相同的.\\n postorder_left = postorder[:len(inorder_left)]\\n postorder_right = postorder[len(inorder_left): len(postorder) - 1]\\n\\n # 第六步: 递归\\n root.left = self.buildTree(inorder_left, postorder_left)\\n root.right = self.buildTree(inorder_right, postorder_right)\\n # 第七步: 返回答案\\n return root\",\n \"runtime\": \"162\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(inorder) == 1:\\n return TreeNode(inorder[0])\\n \\n def r(inorder,postorder):\\n if len(inorder) == 0:\\n return None\\n if len(inorder) == 1:\\n return TreeNode(inorder[0])\\n \\n root_val = postorder[-1]\\n root_index_in = inorder.index(root_val)\\n root_index_post = postorder.index(root_val)\\n \\n return TreeNode(\\n val=root_val,\\n left=r(inorder[:root_index_in],postorder[:root_index_in]),\\n right=r(inorder[root_index_in+1:],postorder[root_index_in:-1])\\n )\\n \\n return r(inorder,postorder)\\n \\n\",\n \"runtime\": \"164\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n '''\\n inorder = [9,3,15,20,7]\\n postorder = [9,15,7,20,3]\\n '''\\n\\n # base case\\n if not inorder or not postorder:\\n return None\\n \\n # main logic\\n node_val = postorder[-1]\\n \\n node_idx = inorder.index(node_val)\\n in_left_tree = inorder[:node_idx]\\n in_right_tree = inorder[(node_idx+1):]\\n \\n post_left_tree = postorder[:len(in_left_tree)]\\n post_right_tree = postorder[len(in_left_tree):-1]\\n \\n root = TreeNode(node_val)\\n root.left = self.buildTree(in_left_tree, post_left_tree)\\n root.right = self.buildTree(in_right_tree, post_right_tree)\\n \\n return root\\n \\n \\n \\n \",\n \"runtime\": \"164\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n\\n val = postorder.pop()\\n root = TreeNode(val)\\n\\n pivot_idx = 0\\n for i in range(len(inorder)):\\n if inorder[i] == val:\\n pivot_idx = i\\n break\\n\\n root.right = self.buildTree(inorder[pivot_idx + 1:], postorder)\\n root.left = self.buildTree(inorder[:pivot_idx], postorder)\\n return root\",\n \"runtime\": \"166\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n x = self.helper(inorder, postorder)\\n return x\\n\\n def helper(self, inorder, postorder):\\n \\n root = TreeNode()\\n root.val = postorder[-1]\\n self.L,self.R = [],[]\\n \\n LIn = inorder[:inorder.index(root.val)]\\n LPost = postorder[0:len(LIn)]\\n RIn = inorder[inorder.index(root.val)+1:]\\n RPost = postorder[len(LIn):-1]\\n\\n # print(LIn)\\n # print(RIn)\\n # print(LPost)\\n # print(RPost)\\n \\n if len(LIn) > 0:\\n root.left = self.helper(LIn,LPost)\\n if len(RIn) > 0:\\n root.right = self.helper(RIn,RPost)\\n\\n return root\\n\\n \",\n \"runtime\": \"166\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None \\n root_val = postorder.pop()\\n # start_val = postorder[-1]\\n root = TreeNode(root_val)\\n for i in range(len(inorder)):\\n if inorder[i] == root_val:\\n index = i\\n # index = inorder.index(root_val)\\n root.right = self.buildTree(inorder[index+1:],postorder)\\n\\n\\n root.left = self.buildTree(inorder[:index],postorder)\\n\\n return root\\n \",\n \"runtime\": \"168\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(inorder) == 0:\\n return None\\n #print(inorder, postorder)\\n rootIndex = inorder.index(postorder[-1])\\n left_inorder = inorder[:rootIndex]\\n left_postorder = postorder[:rootIndex]\\n \\n right_inorder = inorder[rootIndex + 1 :] \\n right_postorder = postorder[rootIndex:len(postorder)-1]\\n\\n #print(left_postorder, right_postorder)\\n #print(left_inorder, left_postorder)\\n \\n return TreeNode(postorder[-1], self.buildTree(left_inorder, left_postorder), self.buildTree(right_inorder, right_postorder))\",\n \"runtime\": \"168\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n def build(post_end:int,in_start:int,in_end:int)->Optional[TreeNode]:\\n nonlocal postorder,inorder\\n p_node=TreeNode(postorder[post_end])\\n if in_start==in_end:\\n return p_node\\n print((in_start,in_end,postorder[post_end]))\\n idx=-1\\n for i in range(in_start,in_end+1):\\n if inorder[i]==postorder[post_end]:\\n idx=i\\n break\\n print(idx)\\n if idx!=in_start:\\n p_node.left=build(post_end-(in_end-idx)-1,in_start,idx-1)\\n if idx!=in_end:\\n p_node.right=build(post_end-1,idx+1,in_end)\\n return p_node\\n return build(len(postorder)-1,0,len(inorder)-1)\",\n \"runtime\": \"171\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if(len(inorder)==0 or len(postorder)==0):\\n return None\\n root = TreeNode(postorder[-1])\\n index_in = inorder.index(postorder[-1])\\n index_po = postorder.index(postorder[-1])\\n root.left = self.buildTree(inorder[:index_in], postorder[:index_in])\\n root.right = self.buildTree(inorder[index_in+1:], postorder[index_in:index_po])\\n return root\",\n \"runtime\": \"171\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(inorder) == 0:\\n return None\\n \\n \\n ans = TreeNode(postorder[len(postorder) - 1])\\n rootPos = -1\\n\\n for i in range(len(inorder)):\\n if inorder[i] == ans.val:\\n rootPos = i\\n break\\n \\n ans.left = self.buildTree(inorder[:rootPos], postorder[:rootPos])\\n ans.right = self.buildTree(inorder[rootPos + 1:], postorder[rootPos:len(postorder) - 1])\\n \\n return ans\\n \",\n \"runtime\": \"173\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n # base case\\n if not inorder:\\n return None\\n \\n root_val = postorder[-1]\\n for i in range(len(inorder)):\\n if inorder[i] == root_val:\\n index = i\\n break\\n \\n node = TreeNode(root_val)\\n node.left = self.buildTree(inorder[: index], postorder[: index])\\n node.right = self.buildTree(inorder[index + 1:], postorder[index : -1])\\n\\n return node \",\n \"runtime\": \"173\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n def build(ino, posto):\\n if posto == []:\\n return None\\n v = posto[-1]\\n index = 0\\n for iv in ino:\\n if v == iv:\\n break\\n index += 1\\n\\n pol = len(posto)\\n node = TreeNode(v)\\n if index != 0:\\n node.left = build(ino[:index], posto[:index])\\n node.right = build(ino[index+1:], posto[index:pol-1])\\n\\n return node\\n\\n return build(inorder, postorder)\\n\",\n \"runtime\": \"175\"\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 buildTree(self, inorder: list[int], postorder: list[int]) -> 'Optional[TreeNode]':\\n if len(inorder) == 0:\\n return None\\n\\n root = TreeNode(postorder[-1])\\n inend = 0\\n\\n rootval = postorder[-1]\\n while True:\\n if inorder[inend] == rootval:\\n break\\n inend += 1\\n\\n if inend:\\n root.left = self.buildTree(inorder[:inend], postorder[:inend])\\n if inend + 1 < len(inorder):\\n root.right = self.buildTree(inorder[inend + 1:], postorder[inend: -1])\\n\\n return root\\n\\n return root\",\n \"runtime\": \"175\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n \\n node = TreeNode(postorder[-1]) \\n postorder.remove(node.val)\\n pos = inorder.index(node.val)\\n node.left = self.buildTree(inorder[0:pos],postorder[0:pos]) \\n node.right = self.buildTree(inorder[pos+1:],postorder[pos:]) \\n return node\\n \\n \",\n \"runtime\": \"179\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n def build(inleft,inright,postleft,postright):\\n if postleft > postright:\\n return None\\n \\n root = TreeNode(postorder[postright])\\n \\n\\n leftLen = 0\\n for n in inorder:\\n if n == root.val:\\n break\\n leftLen += 1\\n\\n left_len = leftLen - inleft\\n root.left = build(inleft,leftLen-1,postleft,postleft+left_len-1)\\n root.right = build(leftLen+1,inright,postleft+left_len,postright-1)\\n\\n return root\\n \\n return build(0,len(inorder)-1,0,len(postorder)-1)\\n\",\n \"runtime\": \"179\"\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 findroot(self, inorder, val):\\n for i in range(len(inorder)):\\n if inorder[i] == val:\\n return i\\n\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(inorder) == 0 or len(postorder) == 0:\\n return None\\n\\n root = TreeNode(postorder[len(postorder) - 1])\\n rootValIndex = self.findroot(inorder, root.val)\\n\\n root.left = self.buildTree(inorder[:rootValIndex], postorder[0:rootValIndex])\\n root.right = self.buildTree(inorder[rootValIndex+1:], postorder[rootValIndex:len(postorder)-1])\\n\\n return root \\n\\n \",\n \"runtime\": \"181\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n if len(postorder) == 0 or len(inorder) ==0:\\n return None\\n\\n r = postorder[-1]\\n\\n lit,rit = [],[]\\n for i in range(len(inorder)):\\n if inorder[i] == r:\\n lit = inorder[:i]\\n rit = inorder[i+1:]\\n \\n lpt,rpt = postorder[:len(lit)],postorder[len(lit):-1]\\n\\n node = TreeNode(r)\\n\\n node.left = self.buildTree(lit,lpt)\\n node.right = self.buildTree(rit,rpt)\\n\\n return node\\n \",\n \"runtime\": \"181\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n n = len(postorder)\\n if n == 1:\\n return TreeNode(postorder[0])\\n head = TreeNode(postorder[-1])\\n for i in range(len(inorder)):\\n if inorder[i] == head.val:\\n left_idx = i\\n head.left = self.buildTree(inorder[:left_idx], postorder[:left_idx])\\n head.right = self.buildTree(inorder[left_idx + 1:], postorder[left_idx:n - 1])\\n return head\\n\\n\\n\\n # in-order: left -> root -> right\\n # post-order: left -> right -> root\",\n \"runtime\": \"184\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n root = TreeNode(postorder[-1])\\n\\n root_pos = 0\\n for i in range(0, len(inorder)):\\n if inorder[i] == root.val:\\n root_pos = i\\n break\\n\\n le_child_num = root_pos\\n ri_child_num = len(inorder) - 1 - le_child_num\\n\\n if le_child_num:\\n root.left = self.buildTree(inorder[:root_pos], postorder[:root_pos])\\n if ri_child_num:\\n root.right = self.buildTree(inorder[root_pos + 1:], postorder[root_pos:-1])\\n\\n return root\\n \",\n \"runtime\": \"184\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n def dfs(io, po):\\n if len(io) == 0:\\n return None\\n \\n val = po[-1]\\n d = 0\\n for i in range(len(io)):\\n if io[i] == val:\\n d = i\\n break\\n \\n # print(val, d)\\n # print(io[0:d], po[0:d])\\n # print(io[d+1:], po[d:-1])\\n left = dfs(io[0:d], po[0:d])\\n right = dfs(io[d+1:], po[d:-1])\\n\\n node = TreeNode(val, left, right)\\n return node\\n \\n return dfs(inorder, postorder)\",\n \"runtime\": \"186\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if inorder == []:\\n return None\\n root = TreeNode(postorder[-1])\\n for i in range(len(inorder)):\\n if inorder[i] == root.val:\\n break\\n root.left = self.buildTree(inorder[0:i],postorder[0:i])\\n root.right = self.buildTree(inorder[i+1:],postorder[i:-1])\\n return root\\n \\n\\n# post: kid-kid-r\\n# in: kid-r-kid\\n# post[-1] is r\\n# find r idx in in: i\\n# kid1 contains i nodes\",\n \"runtime\": \"186\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return\\n\\n leftin = inorder[:inorder.index(postorder[-1])]\\n rightin = inorder[inorder.index(postorder[-1])+1:]\\n leftpost = postorder[:len(leftin)]\\n rightpost = postorder[len(leftin):-1]\\n node = TreeNode(val = postorder[-1], left = self.buildTree(leftin, leftpost), right = self.buildTree(rightin, rightpost))\\n \\n return node\",\n \"runtime\": \"188\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n root = postorder[-1]\\n n = len(inorder)\\n if n == 1:\\n return TreeNode(\\n val=root\\n )\\n for i in range(n):\\n if inorder[i] == root:\\n root_index = i\\n right_len = n - root_index - 1\\n left_len = root_index\\n # print(postorder[left_len:right_len + left_len])\\n # print(postorder[:left_len])\\n return TreeNode(\\n val=root,\\n left=self.buildTree(inorder[:root_index], postorder[:left_len]),\\n right=self.buildTree(inorder[root_index + 1:], postorder[left_len:right_len + left_len])\\n )\",\n \"runtime\": \"188\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n # imap = dict()\\n # for i in range(len(inorder)):\\n # imap[inorder[i]] = i\\n def helper(postord,inord):\\n if len(postord) == 0 or len(inord) ==0:\\n return None\\n r = postord[-1]\\n lit,rit = [],[]\\n for i in range(len(inord)):\\n if inord[i] == r:\\n lit = inord[:i]\\n rit = inord[i+1:]\\n lpt,rpt = postord[:len(lit)],postord[len(lit):-1]\\n # print('left : ',r,' ',lpt,' ',lit,' ')\\n # print('right : ',r,' ',rpt,' ',rit,' ')\\n node = TreeNode(r)\\n node.left = helper(lpt,lit)\\n node.right = helper(rpt,rit)\\n\\n return node\\n\\n return helper(postorder,inorder)\\n \",\n \"runtime\": \"190\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not postorder:\\n return None\\n rootVal = postorder[-1]\\n root = TreeNode(rootVal)\\n\\n for i in range(len(inorder)):\\n if inorder[i] == rootVal:\\n inorderIndex = i\\n break\\n \\n leftInorder = inorder[:i]\\n rightInorder = inorder[i+1:]\\n\\n leftPostorder = postorder[:len(leftInorder)]\\n rightPostorder = postorder[len(leftInorder):-1]\\n\\n root.left = self.buildTree(leftInorder, leftPostorder)\\n root.right = self.buildTree(rightInorder, rightPostorder)\\n\\n return root\\n\\n \",\n \"runtime\": \"190\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(postorder)==0:\\n return None\\n elif len(postorder)==1:\\n return TreeNode(val=postorder[-1],left=None,right=None)\\n else:\\n pass\\n val=postorder[-1]\\n root=TreeNode(val=val)\\n for i in range(len(inorder)):\\n if inorder[i]==val:\\n break\\n inorder_l=inorder[:i]\\n inorder_r=inorder[i+1:]\\n postorder_l=postorder[:len(inorder_l)]\\n postorder_r=postorder[len(inorder_l):-1]\\n root.left=self.buildTree(inorder_l,postorder_l)\\n root.right=self.buildTree(inorder_r,postorder_r)\\n return root\\n \\n \\n \",\n \"runtime\": \"192\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n i=inorder\\n p=postorder\\n if len(i)==0:\\n return None\\n if len(i)==1:\\n return TreeNode(i[0])\\n N=p[-1]\\n s=0\\n while i[s]!=N:\\n s=s+1\\n l1=i[:s]\\n l2=p[:s]\\n lefttree=self.buildTree(l1,l2)\\n r1=i[s+1:]\\n r2=p[s:-1]\\n righttree=self.buildTree(r1,r2)\\n root=TreeNode(N)\\n root.left=lefttree\\n root.right=righttree\\n return root\",\n \"runtime\": \"192\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n root = postorder[-1]\\n n = len(inorder)\\n if n == 1:\\n return TreeNode(\\n val=root\\n )\\n for i in range(n):\\n if inorder[i] == root:\\n root_index = i\\n break\\n right_len = n - root_index - 1\\n left_len = root_index\\n # print(postorder[left_len:right_len + left_len])\\n # print(postorder[:left_len])\\n return TreeNode(\\n val=root,\\n left=self.buildTree(inorder[:root_index], postorder[:left_len]),\\n right=self.buildTree(inorder[root_index + 1:], postorder[left_len:right_len + left_len])\\n )\",\n \"runtime\": \"194\"\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\\n def search(self, node, inorder):\\n for i in range(len(inorder)):\\n if inorder[i] == node:\\n return i\\n return -1\\n\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not postorder or not inorder:\\n return None\\n \\n # The last element of postorder is the root of the current subtree\\n rootData = postorder[-1]\\n root = TreeNode(rootData)\\n \\n # Find the index of the root in the inorder list\\n ind_root = self.search(rootData, inorder)\\n if ind_root == -1:\\n return None\\n\\n # Split inorder into left and right subtrees\\n leftpart = inorder[:ind_root]\\n rightpart = inorder[ind_root + 1:]\\n\\n # Compute the lengths of left and right subtrees\\n lenleft = len(leftpart)\\n \\n # Recursively build the left and right subtrees\\n leftchild = self.buildTree(leftpart, postorder[:lenleft])\\n rightchild = self.buildTree(rightpart, postorder[lenleft:-1])\\n \\n root.left = leftchild\\n root.right = rightchild\\n \\n return root\\n \",\n \"runtime\": \"194\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n root = postorder[-1]\\n n = len(inorder)\\n if n == 1:\\n return TreeNode(\\n val=root\\n )\\n for i in range(n):\\n if inorder[i] == root:\\n root_index = i\\n break\\n right_len = n - root_index - 1\\n left_len = root_index\\n # print(postorder[left_len:right_len + left_len])\\n # print(postorder[:left_len])\\n return TreeNode(\\n val=root,\\n left=self.buildTree(inorder[:root_index], postorder[:left_len]),\\n right=self.buildTree(inorder[root_index + 1:], postorder[left_len:right_len + left_len])\\n )\",\n \"runtime\": \"196\"\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 traverse(self, inorder, postorder):\\n if len(inorder) == 0:\\n return None\\n root_v = postorder[-1]\\n b_idx = 0\\n while inorder[b_idx] != root_v:\\n b_idx += 1\\n left_tree = self.traverse(inorder[:b_idx], postorder[:b_idx])\\n right_tree = self.traverse(inorder[b_idx+1:], postorder[b_idx:-1])\\n cur_node = TreeNode(root_v)\\n cur_node.left = left_tree\\n cur_node.right = right_tree\\n\\n return cur_node\\n\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n root = self.traverse(inorder, postorder)\\n return root\\n \\n\\n \",\n \"runtime\": \"196\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":148,"string":"148"},"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(inorder) != len(postorder):\n return None\n\n in_map = {val: idx for idx, val in enumerate(inorder)}\n return self._buildTree(inorder, 0, len(inorder) - 1, postorder, 0, len(postorder) - 1, in_map)\n\n def _buildTree(self, inorder, in_start, in_end, postorder, post_start, post_end, in_map):\n if in_start > in_end or post_start > post_end:\n return None\n\n # The last element in postorder is the root of the tree/subtree\n root_val = postorder[post_end]\n root = TreeNode(root_val)\n\n # Find the index of the root in the inorder list\n in_root_idx = in_map[root_val]\n\n # Number of nodes in the left subtree\n nums_left = in_root_idx - in_start\n\n # Recursively build the left and right subtrees\n root.left = self._buildTree(inorder, in_start, in_root_idx - 1,\n postorder, post_start, post_start + nums_left - 1, in_map)\n root.right = self._buildTree(inorder, in_root_idx + 1, in_end,\n postorder, post_start + nums_left, post_end - 1, in_map)\n return root\n\n in_map = {val: idx for idx, val in enumerate(inorder)}\n return self._buildTree(inorder, 0, len(inorder) - 1, postorder, 0, len(postorder) - 1, in_map)\n\n def _buildTree(self, inorder: List[int], in_start: int, in_end: int, postorder: List[int], post_start: int, post_end: int, in_map: dict) -> Optional[TreeNode]:\n if in_start > in_end or post_start > post_end:\n return None\n\n # The last element in postorder is the root of the tree/subtree\n root_val = postorder[post_end]\n root = TreeNode(root_val)\n\n # Find the index of the root in the inorder list\n in_root_idx = in_map[root_val]\n\n # Number of nodes in the left subtree\n nums_left = in_root_idx - in_start\n\n # Recursively build the left and right subtrees\n root.left = self._buildTree(inorder, in_start, in_root_idx - 1,\n postorder, post_start, post_start + nums_left - 1, in_map)\n root.right = self._buildTree(inorder, in_root_idx + 1, in_end,\n postorder, post_start + nums_left, post_end - 1, in_map)\n return root","memory":"17400"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n def build(bound = None):\n if not inorder or inorder[-1] == bound: return None\n root = TreeNode(postorder.pop())\n root.right = build(root.val)\n inorder.pop()\n root.left = build(bound)\n return root\n\n return build()","memory":"17600"},{"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\n def recur(self, left_idx, right_idx):\n root_element = self.postorder.pop()\n curr_idx = self.inorder_idxs[root_element]\n right = None if curr_idx == right_idx else self.recur(curr_idx + 1, right_idx)\n left = None if curr_idx == left_idx else self.recur(left_idx, curr_idx - 1)\n return TreeNode(root_element, left, right)\n\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n n, self.inorder, self.postorder = len(inorder), inorder, postorder\n self.inorder_idxs = dict(zip(inorder, range(n)))\n return self.recur(0, n - 1)\n\n","memory":"17700"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n ## Initially, push the root node into the stack\n root = TreeNode(postorder[-1])\n stack = [(root, 0, len(inorder), inorder.index(root.val), 'RIGHT')]\n ## Current index in 'postorder', start from the end 'len(postorder)-2'\n curIndex = len(postorder)-2\n while stack:\n node, start, end, index, which = stack.pop()\n ## Processing the right node\n if which == 'RIGHT':\n ## Push the node back to the stack again to process its right node in the next traversal\n stack.append((node, start, end, index, 'LEFT'))\n if index+1 < end:\n rindex = inorder[index+1:end].index(postorder[curIndex]) + index + 1\n node.right = TreeNode(postorder[curIndex])\n curIndex -= 1\n stack.append((node.right, index+1, end, rindex, 'RIGHT'))\n ## Processing the left node\n if which == 'LEFT':\n if start < index:\n lindex = inorder[start:index].index(postorder[curIndex]) + start\n node.left = TreeNode(postorder[curIndex])\n curIndex -= 1\n stack.append((node.left, start, index, lindex, 'RIGHT'))\n ## End of while loop\n\n return root","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n def builder(l, r):\n if l > r:\n return None\n root = TreeNode(postorder.pop())\n val = inorder.index(root.val)\n root.right = builder(val + 1, r)\n root.left = builder(l, val - 1)\n return root\n\n return builder(0, len(inorder) - 1)","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not postorder:\n return None\n root = TreeNode(postorder[-1])\n ri = inorder.index(postorder[-1])\n act_nodes = deque([(root, 0, ri, len(inorder))])\n for v in postorder[-2::-1]:\n new_node = TreeNode(v)\n par_node, par_left, par_ni, par_right = act_nodes.pop()\n if par_left != par_ni and v in inorder[par_left:par_ni]:\n par_node.left = new_node\n nni = inorder.index(v, par_left, par_ni)\n if par_ni + 1 != par_right:\n act_nodes.append((par_node, par_ni, par_ni, par_right))\n if nni != par_left or nni != par_ni - 1:\n act_nodes.append((new_node, par_left, nni, par_ni))\n elif v in inorder[par_ni + 1:par_right]:\n par_node.right = new_node\n nni = inorder.index(v, par_ni + 1, par_right)\n if par_left != par_ni:\n act_nodes.append((par_node, par_left, par_ni, par_ni+1))\n if nni != par_ni + 1 or nni != par_right - 1:\n act_nodes.append((new_node, par_ni + 1, nni, par_right))\n return 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 __init__(self):\n self.post_i = None\n\n def build(self,\n inorder: List[int],\n postorder: List[int],\n in_start: int,\n in_end: int) -> TreeNode:\n if in_start > in_end:\n return None\n \n node = TreeNode(postorder[self.post_i])\n self.post_i -= 1\n\n if in_start == in_end:\n return node\n\n in_i = inorder[in_start:in_end + 1].index(node.val)\n\n node.right = self.build(inorder, postorder, in_start + in_i + 1, in_end)\n node.left = self.build(inorder, postorder, in_start, in_start + in_i - 1)\n\n return node\n\n\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n self.post_i = len(postorder) - 1\n\n return self.build(inorder, postorder, 0, len(inorder) - 1)","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n n = len(postorder)\n reverse = {}\n for i, x in enumerate(inorder):\n reverse[x] = i\n stack = [(postorder.pop(), 0, n - 1)]\n visited = [0]\n res = []\n while stack:\n node, start, end = stack[-1]\n if visited[-1] == 0:\n visited[-1] = 1\n if reverse[node] + 1 <= end:\n stack.append((postorder.pop(), reverse[node] + 1, end))\n visited.append(False)\n elif visited[-1] == 1:\n visited[-1] = 2\n if start <= reverse[node] - 1:\n stack.append((postorder.pop(), start, reverse[node] - 1))\n visited.append(False)\n else:\n stack.pop()\n visited.pop()\n cur = TreeNode(node)\n if start <= reverse[node] - 1:\n cur.left = res.pop()\n if reverse[node] + 1 <= end:\n cur.right = res.pop()\n res.append(cur)\n return res[0]","memory":"18000"},{"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 buildTree(self, inorder, postorder):\n # Step 1: Create a map to store the index of each value in the inorder list\n self.inorder_map = {val: idx for idx, val in enumerate(inorder)}\n\n self.inorder = inorder\n self.postorder = postorder\n \n # Step 2: Initialize a helper function with the necessary parameters\n return self.buildTreeHelper(0, len(inorder) - 1)\n \n def buildTreeHelper(self, in_start, in_end):\n # Step 3: Base case when there are no elements to construct the tree\n if in_start > in_end:\n return None\n \n # Step 4: The last element in postorder is the root\n root_val = self.postorder.pop()\n root = TreeNode(root_val)\n \n # Step 5: Find the index of the root value in the inorder traversal using the hash map\n inorder_index = self.inorder_map[root_val]\n \n # Step 6: Recursively build the right and left subtrees\n # Note: Build right subtree first because postorder is being processed from the end\n root.right = self.buildTreeHelper(inorder_index + 1, in_end)\n root.left = self.buildTreeHelper(in_start, inorder_index - 1)\n \n return root\n","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n s = {inorder[i]: i for i in range(len(inorder))}\n def build(start: int, end: int) -> Optional[TreeNode]:\n if not postorder or start < 0 or end >= len(inorder) or start > end:\n return None\n root = TreeNode(postorder.pop())\n index = s[root.val]\n root.right = build(index+1, end)\n root.left = build(start, index-1)\n return root\n return build(0, len(inorder)-1)","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 \n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n mp = {}\n for idx, val in enumerate(inorder):\n mp[val] = idx\n \n cur_idx = len(postorder) - 1\n \n def build(inorder, postorder, l, r) -> TreeNode:\n if(r - l + 1 < 1):\n return None\n \n nonlocal cur_idx\n root = postorder[cur_idx]\n cur_idx -= 1\n m = mp[root]\n\n right = build(inorder, postorder, m+1, r)\n left = build(inorder, postorder, l, m-1)\n\n return TreeNode(root, left, right)\n \n return build(inorder, postorder, 0, len(inorder) - 1)","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n val_idx = {inorder[i]: i for i in range(len(inorder))}\n n = len(inorder) \n \n def createTree(i_st, i_end):\n if i_st > i_end:\n return None\n \n node = TreeNode(postorder.pop())\n idx = val_idx[node.val]\n node.right = createTree(idx+1, i_end)\n node.left = createTree(i_st, idx-1)\n return node\n\n return createTree(0, n-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 '''\n inorder = [left ... root ... right]\n postorder = [..... left right root]\n '''\n\n def dfs(self, inorder, postorder, idxMap, left, right):\n if left > right:\n return None\n\n value = postorder[self.postorderIdx]\n self.postorderIdx -= 1\n\n newNode = TreeNode(value)\n\n inorderIdx = idxMap[value]\n\n newNode.right = self.dfs(inorder, postorder, idxMap, inorderIdx + 1, right)\n newNode.left = self.dfs(inorder, postorder, idxMap, left, inorderIdx - 1)\n\n return newNode\n\n\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n n = len(inorder)\n \n idxMap = {value: idx for idx, value in enumerate(inorder)}\n self.postorderIdx = n - 1\n\n return self.dfs(inorder, postorder, idxMap, 0, n - 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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n postorder = postorder[::-1]\n d = {}\n for i, x in enumerate(inorder):\n d[x] = i\n\n def dfs(root, left, right):\n if left > right:\n return None\n node = TreeNode(val=postorder[root])\n idx = d[postorder[root]]\n node.right = dfs(root+1, idx+1, right)\n node.left = dfs(root+right-idx+1, left, idx-1)\n return node\n\n return dfs(0, 0, len(postorder)-1)","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n postorder = postorder[::-1]\n d = {}\n for i, x in enumerate(inorder):\n d[x] = i\n # 在inorder两边分治\n def dfs(root, left, right):\n if left > right:\n return None\n node = TreeNode(val=postorder[root])\n idx = d[postorder[root]]\n node.right = dfs(root+1, idx+1, right)\n node.left = dfs(root+right-idx+1, left, idx-1)\n return node\n\n return dfs(0, 0, len(postorder)-1)","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n val_idx = {inorder[i]: i for i in range(len(inorder))}\n n = len(inorder) \n \n def createTree(i_st, i_end, p_s, p_end):\n if i_st > i_end or p_s > p_end:\n return None\n \n node = TreeNode(postorder[p_end])\n idx = val_idx[node.val]\n num_left_nodes = idx-i_st\n \n \n \n node.right = createTree(idx+1, i_end, p_s+num_left_nodes,p_end-1)\n node.left = createTree(i_st, idx-1, p_s, p_s+num_left_nodes-1)\n return node\n\n return createTree(0, n-1, 0, n-1)\n","memory":"18500"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n indexmap = {}\n for i in range(len(inorder)):\n indexmap[inorder[i]]=i\n return self.solve(inorder,0,len(inorder)-1,postorder,0,len(postorder)-1,indexmap)\n \n\n def solve(self,inorder,istart,iend,postorder,pstart,pend,indexmap):\n if istart>iend or pstart>pend:\n return None\n ele = postorder[pend]\n index = indexmap[ele]\n numsright = iend-index\n root = TreeNode(ele)\n root.left = self.solve(inorder,istart,index-1,postorder,pstart,pend-numsright-1,indexmap)\n root.right = self.solve(inorder,index+1,iend,postorder,pend-numsright,pend-1,indexmap)\n return root\n ","memory":"18500"},{"code":"class Solution:\n def buildTree(\n self,\n inorder: list[int],\n postorder: list[int],\n ) -> TreeNode | None:\n inToIndex = {num: i for i, num in enumerate(inorder)}\n\n def build(\n inStart: int,\n inEnd: int,\n postStart: int,\n postEnd: int,\n ) -> TreeNode | None:\n if inStart > inEnd:\n return None\n\n rootVal = postorder[postEnd]\n rootInIndex = inToIndex[rootVal]\n leftSize = rootInIndex - inStart\n\n root = TreeNode(rootVal)\n root.left = build(inStart, rootInIndex - 1, postStart,\n postStart + leftSize - 1)\n root.right = build(rootInIndex + 1, inEnd, postStart + leftSize,\n postEnd - 1)\n return root\n\n return build(0, len(inorder) - 1, 0, len(postorder) - 1)","memory":"18600"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n inMap = {}\n for i in range(len(inorder)):\n inMap[inorder[i]] = i\n def construct(post, postStart, postEnd, In, inStart, inEnd):\n if postStart>=postEnd or inStart>=inEnd:\n return None\n rootVal = post[postEnd-1]\n root = TreeNode(rootVal)\n inRoot = inMap[rootVal]\n numsLeft = inRoot-inStart\n root.left = construct(post, postStart, postStart + numsLeft, In, inStart, inRoot)\n root.right = construct(post, postStart + numsLeft, postEnd-1, In, inRoot+1, inEnd)\n return root\n return construct(postorder, 0, len(postorder), inorder, 0, len(inorder))\n ","memory":"18600"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n '''\n if not inorder:\n return\n\n if len(inorder) == 1:\n return TreeNode(inorder[0])\n\n root_val = postorder[-1]\n root = TreeNode(root_val)\n\n rootindex = inorder.index(root_val)\n\n root.left = self.buildTree(inorder[:rootindex], postorder[:rootindex])\n root.right = self.buildTree(inorder[rootindex+1:], postorder[rootindex:-1])\n\n return root\n '''\n '''\n 遞迴調用的深度：\n遞迴的深度在最壞情況下是 n（當樹退化成鏈表時），每次遞迴都會佔用記憶體堆疊。這部分空間複雜度是 O(n)。\n切片創建的新列表：\n每次遞迴調用會創建新的子列表，這些切片操作佔用了額外的空間。最壞情況下，每次創建的子列表的大小是 O(n)，而且每次遞迴都需要這樣的額外空間。因此，切片操作的空間複雜度是 O(n^2) \n time also O(n^2) 每次調用 index 都需要遍歷 inorder 列表，這是一個 O(n) 的操作，\n '''\n\n inorder_map = {val: index for index, val in enumerate(inorder)}\n\n def helper(il: int, ir: int, pl: int, pr: int):\n if ir < il or pr < pl:\n return None\n \n rootval = postorder[pr]\n root = TreeNode(rootval)\n\n rootindex = inorder_map[rootval]\n\n lefttreesize = rootindex - il\n\n root.left = helper(il, rootindex-1, pl, pl+lefttreesize-1)\n root.right = helper(rootindex+1, ir, pl+lefttreesize, pr-1)\n\n return root\n\n return helper(0, len(inorder)-1, 0, len(postorder)-1)\n\n\n ","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 def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n n = len(inorder)\n memoIn = {inorder[i]:i for i in range(n)}\n memoPost = {postorder[i]:i for i in range(n)}\n\n def arrToTree(pl: int, pr: int, il: int, ir: int) ->Optional[TreeNode]:\n print(pl, pr, il, ir)\n if pl > pr or il > ir:\n return None\n elif pl == pr:\n return TreeNode(postorder[pl])\n else:\n val = postorder[pr]\n index = memoIn[val]\n left = arrToTree(pl, pl+ index - il - 1, il, index-1)\n right = arrToTree(pl + index - il , pr-1, index+ 1, ir)\n return TreeNode(val, left, right)\n\n return arrToTree(0, n-1, 0, n-1)\n\n","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 def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n inMap={inorder[i]:i for i in range(len(inorder))}\n\n def build(postStart,postEnd,inStart,inEnd):\n if postStart>postEnd or inStart>inEnd:\n return None\n root_val=postorder[postEnd]\n root_ind=inMap[root_val]\n root=TreeNode(root_val)\n left_subtree_size=root_ind-inStart\n\n root.left=build(postStart,postStart+left_subtree_size-1,inStart,root_ind-1)\n root.right=build(postStart+left_subtree_size,postEnd-1,root_ind+1,inEnd)\n\n return root\n return build(0,len(postorder)-1,0,len(inorder)-1)\n\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n '''\n observations\n inorder - in order\n everything to the left of val is on left of tree\n same w/ right\n postorder - last element is root\n '''\n vals = {}\n for i in range(len(inorder)):\n vals[inorder[i]] = i\n def build(pl, pr, il, ir):\n if pl > pr:\n return None\n val = postorder[pr]\n node = TreeNode(val) # get node from right of pre\n # get number of vals on left and right side from inorder\n lCount = vals[val] - il\n rCount = ir - vals[val]\n im = il + lCount\n pm = pr - rCount\n node.left = build(pl, pm - 1, il, im - 1)\n node.right = build(pm, pr - 1, im + 1, ir)\n return node\n \n return build(0, len(postorder) - 1, 0, len(inorder) - 1)","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n # find mid\n # find left\n # find right\n n = len(inorder)\n\n if n == 1:\n return TreeNode(inorder[0])\n\n inorder_mapping = {inorder[i]: i for i in range(n)}\n\n def build(inorder_range, postorder_range):\n # inorder_range = [start, end]\n if (\n inorder_range[0] > inorder_range[1]\n or postorder_range[0] > postorder_range[1]\n ):\n return None\n\n print(inorder_range, postorder_range)\n\n root_index = postorder_range[1]\n root = TreeNode(postorder[root_index])\n\n mid = inorder_mapping[root.val]\n\n left_len = mid - inorder_range[0]\n left_pos_end = postorder_range[0] + left_len - 1\n\n right_len = inorder_range[1] - mid\n\n root.left = build(\n (inorder_range[0], mid - 1),\n (postorder_range[0], left_pos_end),\n )\n root.right = build(\n (mid + 1, inorder_range[1]), (left_pos_end + 1, postorder_range[1] - 1)\n )\n\n return root\n\n root = build((0, n - 1), (0, n - 1))\n return root\n","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n # find mid\n # find left\n # find right\n n = len(inorder)\n\n if n == 1:\n return TreeNode(inorder[0])\n\n inorder_mapping = {inorder[i]: i for i in range(n)}\n\n def build(inorder_range, postorder_range):\n # inorder_range = [start, end]\n if (\n inorder_range[0] > inorder_range[1]\n or postorder_range[0] > postorder_range[1]\n ):\n return None\n\n root_index = postorder_range[1]\n root = TreeNode(postorder[root_index])\n\n mid = inorder_mapping[root.val]\n\n left_len = mid - inorder_range[0]\n left_pos_end = postorder_range[0] + left_len - 1\n\n right_len = inorder_range[1] - mid\n\n root.left = build(\n (inorder_range[0], mid - 1),\n (postorder_range[0], left_pos_end),\n )\n root.right = build(\n (mid + 1, inorder_range[1]), (left_pos_end + 1, postorder_range[1] - 1)\n )\n\n return root\n\n root = build((0, n - 1), (0, n - 1))\n return root\n","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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n inorder_inds = dict() # val -> ind\n for ind, val in enumerate(inorder):\n inorder_inds[val] = ind\n \n def build_helper(in_left, in_right, post_left, post_right):\n if post_left > post_right:\n return None \n \n node = TreeNode(postorder[post_right])\n if post_left == post_right:\n return node\n node_val = postorder[post_right]\n ind = inorder_inds[node_val]\n \n left_in_left = in_left\n left_in_right = ind - 1\n right_in_left = ind + 1\n right_in_right = in_right\n \n left_length = left_in_right - left_in_left + 1 \n \n left_post_left = post_left\n left_post_right = post_left + left_length - 1\n right_post_left = post_left + left_length\n right_post_right = post_right - 1 \n \n node.left = build_helper(left_in_left, left_in_right, left_post_left, left_post_right)\n node.right = build_helper(right_in_left, right_in_right, right_post_left, right_post_right)\n return node \n \n return build_helper(0, len(inorder) - 1, 0, len(postorder) - 1)\n \n \n \n \n \n \n ","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 def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n nodesToIndex = {}\n n = len(inorder)\n for i in range(n):\n nodesToIndex[inorder[i]] = i\n\n def build(inStart, inEnd, postStart, postEnd):\n if inStart == inEnd:\n return TreeNode(postorder[postEnd])\n if inStart > inEnd or postStart > postEnd:\n return None\n\n print(postEnd)\n\n root = TreeNode(postorder[postEnd])\n rootIndex = nodesToIndex[root.val]\n inEndL = rootIndex - 1\n inStartL = inStart\n inStartR = rootIndex + 1\n inEndR = inEnd\n rightSubtreeSize = inEndR - inStartR + 1\n postEndR = postEnd - 1\n postStartR = postEnd - rightSubtreeSize\n postEndL = postStartR - 1\n postStartL = postStart\n\n print(root.val, inStartL, inEndL, postStartL, postEndL)\n print(inStartR, inEndR, postStartR, postEndR)\n root.left = build(inStartL, inEndL, postStartL, postEndL)\n\n root.right = build(inStartR, inEndR, postStartR, postEndR)\n\n return root\n return build(0, n - 1, 0, n - 1)\n \n","memory":"19100"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n head = TreeNode(postorder[-1])\n\n ind_inorder = {}\n for i, num in enumerate(inorder):\n ind_inorder[num] = i\n\n i_inds = [0, len(inorder)-1]\n p_inds = [0, len(postorder)-1]\n\n def build_tree(head, i_inds, p_inds):\n if i_inds[1] == i_inds[0]:\n return None\n\n l_i_inds = [i_inds[0], ind_inorder[head.val]-1]\n r_i_inds = [ind_inorder[head.val]+1, i_inds[1]]\n\n len_l = l_i_inds[1] - l_i_inds[0]\n len_r = r_i_inds[1] - r_i_inds[0]\n\n if len_l >= 0:\n l_p_inds = [p_inds[0], p_inds[0]+len_l]\n head.left = TreeNode(postorder[l_p_inds[1]])\n build_tree(head.left, l_i_inds, l_p_inds)\n if len_r >= 0:\n r_p_inds = [p_inds[0]+len_l+1, p_inds[1]-1]\n head.right = TreeNode(postorder[r_p_inds[1]])\n build_tree(head.right, r_i_inds, r_p_inds)\n\n\n build_tree(head, i_inds, p_inds)\n return head\n \n\n ","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\nclass Solution:\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n if len(inorder) == 0:\n return None\n if len(inorder) == 1:\n return TreeNode(inorder[0])\n \n inorder_nodes = {\n val: dict(node=TreeNode(val), index=i) for i, val in enumerate(inorder)\n }\n postorder_nodes = {\n val: dict(node=inorder_nodes[val][\"node\"], index=i)\n for i, val in enumerate(postorder)\n }\n\n def is_parent(current_val: int, comparison_val: int) -> bool:\n return postorder_nodes[current_val][\"index\"] < postorder_nodes[comparison_val][\"index\"]\n\n def get_left_child(poi: int) -> TreeNode:\n val = postorder[poi]\n ini = inorder_nodes[val][\"index\"]\n if ini == 0 or poi == 0:\n return None\n ini -= 1\n left_val = inorder[ini]\n if is_parent(val, left_val):\n return None\n\n right_val = val\n ini = inorder_nodes[val][\"index\"]\n if ini < len(inorder) - 1 and not is_parent(val, inorder[ini + 1]):\n right_val = inorder[ini + 1]\n\n child_poi = postorder_nodes[right_val][\"index\"] - 1\n child_val = postorder[child_poi]\n while inorder_nodes[val][\"index\"] < inorder_nodes[child_val][\"index\"]:\n if child_poi > 0:\n child_poi -= 1\n child_val = postorder[child_poi]\n else:\n child_val = inorder[inorder_nodes[child_val][\"index\"] - 1]\n\n return inorder_nodes[child_val][\"node\"]\n\n def get_right_child(poi: int) -> TreeNode:\n val = postorder[poi]\n ini = inorder_nodes[val][\"index\"]\n if inorder_nodes[val][\"index\"] == len(inorder) - 1 or poi == 0:\n return None\n ini += 1\n right_val = inorder[ini]\n if is_parent(val, right_val):\n return None\n child_val = postorder[poi-1]\n if inorder_nodes[child_val][\"index\"] < inorder_nodes[val][\"index\"]:\n return None\n return inorder_nodes[child_val][\"node\"]\n\n for i in range(len(postorder) - 1, -1, -1):\n val = postorder[i]\n node = postorder_nodes[val][\"node\"]\n node.left = get_left_child(i)\n node.right = get_right_child(i)\n\n return postorder_nodes[postorder[-1]][\"node\"]\n\n\n\"\"\"\n\n 3\n\n 9 20\n\n\n4 5 15 7\n \n 13\n 11 6\n\n\ninordrer = [4, 13 9, 5, 3, 11, 15, 20, 7, 6]\npostorder = [13, 4, 5, 9, 11, 15, 6, 7, 20, 3]\n\n\n\ni_count, p_count = 0, 0\n\nnode = TreeNode(postorder[p_count])\n\nif postorder[p_count] != inorder[i_count]:\n \n\n\nif postorder[0] == inorder[0]:\n i_count += 1\n p_count += 1\n new_node = TreeNode(inorder[i_count], left=node)\n node = new_node\n\n\n\n\n\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n head = TreeNode(postorder[-1])\n\n ind_inorder = {}\n for i, num in enumerate(inorder):\n ind_inorder[num] = i\n\n i_inds = [0, len(inorder)-1]\n p_inds = [0, len(postorder)-1]\n\n def build_tree(head, i_inds, p_inds):\n if i_inds[1] == i_inds[0]:\n return None\n\n l_i_inds = [i_inds[0], ind_inorder[head.val]-1]\n r_i_inds = [ind_inorder[head.val]+1, i_inds[1]]\n\n len_l = l_i_inds[1] - l_i_inds[0]\n len_r = r_i_inds[1] - r_i_inds[0]\n #print(l_i_inds, r_i_inds)\n\n if len_l >= 0:\n l_p_inds = [p_inds[0], p_inds[0]+len_l]\n #print(l_p_inds)\n head.left = TreeNode(postorder[l_p_inds[1]])\n build_tree(head.left, l_i_inds, l_p_inds)\n if len_r >= 0:\n r_p_inds = [p_inds[0]+len_l+1, p_inds[1]-1]\n #print(r_p_inds)\n head.right = TreeNode(postorder[r_p_inds[1]])\n build_tree(head.right, r_i_inds, r_p_inds)\n\n\n build_tree(head, i_inds, p_inds)\n return head\n \n\n ","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 def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n\n\n self.deep = 0\n \n def aux(node, is_idx, ie_idx, ps_idx, pe_idx):\n idx = inorder.index(node.val)\n print(f\"node:{node}, is_idx:{is_idx}, ie_idx:{ie_idx}, ps_idx:{ps_idx}, pe_idx:{pe_idx}\")\n # self.deep+=1\n # if self.deep > 5 or pe_idx <=0:\n # return\n \n if is_idx <= idx-1 and ps_idx<=ps_idx+(idx-is_idx)-1:\n node.left = TreeNode(val = postorder[ps_idx + (idx- is_idx)-1])\n aux(node.left, is_idx, idx-1, ps_idx , ps_idx + (idx - is_idx)-1)\n if idx+1 <= ie_idx and ps_idx+(idx-is_idx)<=pe_idx-1:\n node.right = TreeNode(val = postorder[pe_idx-1])\n aux(node.right, idx+1, ie_idx, ps_idx + (idx- is_idx), pe_idx-1)\n \n\n head = TreeNode(val = postorder[-1])\n \n aux(head, 0, len(inorder)-1, 0, len(inorder)-1)\n print(head)\n return head\n \n \n","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 def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n def buildsubtree(inorder, postorder):\n if not inorder:\n return None\n\n root = TreeNode(postorder.pop())\n left_inorder = []\n left_postorder = []\n while inorder and inorder[0] != root.val:\n left_inorder.append(inorder.pop(0))\n left_postorder.append(postorder.pop(0))\n inorder.pop(0)\n\n # now whatever's leftover in inorder and postorder is the right subtree\n lst = buildsubtree(left_inorder, left_postorder)\n rst = buildsubtree(inorder, postorder)\n\n root.left = lst\n root.right = rst\n\n return root\n\n return buildsubtree(inorder, postorder)\n","memory":"20700"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n if not inorder or not postorder:\n return None\n\n # # Approach 1: Brute force\n # root_val = postorder[-1]\n # root = TreeNode(val = root_val)\n\n # inorder_root_index = inorder.index(root_val)\n\n # # partition the sub arrays\n # left_inorder = inorder[:inorder_root_index]\n # right_inorder = inorder[inorder_root_index + 1:]\n # left_postorder = postorder[:len(left_inorder)]\n # right_postorder = postorder[len(left_inorder):-1]\n\n # root.left = self.buildTree(left_inorder, left_postorder)\n # root.right = self.buildTree(right_inorder, right_postorder)\n\n # return root\n\n # Approach 2: Optimal\n\n val_map = {val: idx for idx, val in enumerate(inorder)}\n\n def _build_tree(inorder_start, inorder_end, postorder_start, postorder_end):\n nonlocal inorder, postorder, val_map\n if inorder_start > inorder_end or postorder_start > postorder_end:\n return None\n \n root_val = postorder[postorder_end]\n root = TreeNode(val = root_val)\n root_inorder_index = val_map.get(root_val)\n\n left_subarray_size = root_inorder_index - inorder_start\n\n inorder_left, inorder_right = (inorder_start, root_inorder_index - 1), (root_inorder_index + 1, inorder_end)\n postorder_left, postorder_right = (postorder_start, postorder_start + left_subarray_size - 1), (postorder_start + left_subarray_size, postorder_end - 1)\n\n root.left = _build_tree(*inorder_left, *postorder_left)\n root.right = _build_tree(*inorder_right, *postorder_right)\n\n return root\n\n return _build_tree(0, len(inorder) - 1, 0, len(postorder) - 1)\n\n\n\n ","memory":"21200"},{"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 buildTree(self, inorder: list[int], postorder: list[int]) -> 'Optional[TreeNode]':\n if len(inorder) == 0:\n return None\n\n root = TreeNode(postorder[-1])\n newin = []\n newpost = []\n rootval = postorder[-1]\n while True:\n if inorder[0] == rootval:\n inorder.pop(0)\n break\n\n newin.append(inorder.pop(0))\n\n while len(newpost) < len(newin):\n newpost.append(postorder.pop(0))\n\n postorder.pop()\n\n if newin:\n root.left = self.buildTree(newin, newpost)\n if inorder:\n root.right = self.buildTree(inorder, postorder)\n\n return root","memory":"23300"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n\n def dfs(inorder, postorder):\n if not inorder or not postorder:\n return None\n\n root_val = postorder.pop()\n root = TreeNode(root_val)\n\n index = inorder.index(root_val)\n\n root.right = dfs(inorder[index + 1:], postorder)\n root.left = dfs(inorder[:index], postorder)\n\n return root\n\n return dfs(inorder, postorder)","memory":"52300"},{"code":"class Solution:\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n def build_tree(inorder, postorder):\n if not inorder:\n return None\n root_val = postorder.pop()\n root = TreeNode(root_val)\n index = inorder.index(root_val)\n root.right = build_tree(inorder[index + 1:], postorder)\n root.left = build_tree(inorder[:index], postorder)\n return root\n\n return build_tree(inorder, postorder)","memory":"52400"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n if inorder:\n val = postorder.pop()\n i = inorder.index(val)\n r = self.buildTree(inorder[i+1:], postorder)\n l = self.buildTree(inorder[:i], postorder)\n return TreeNode(val, l, r)\n \n \n \n \n \n \n \n \n \n \n # if inorder:\n # val = postorder.pop()\n # i = inorder.index(val)\n # right = self.buildTree(inorder[i+1:], postorder)\n # left = self.buildTree(inorder[:i], postorder)\n # return TreeNode(val, left, right)\n ","memory":"52600"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n root = TreeNode(postorder.pop())\n mid = inorder.index(root.val)\n root.right = self.buildTree(inorder[mid+1:], postorder)\n root.left = self.buildTree(inorder[:mid], postorder)\n return root","memory":"52700"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n if not inorder or not postorder:\n return None\n \n node = TreeNode(postorder.pop())\n mid = inorder.index(node.val)\n node.right = self.buildTree(inorder[mid+1:], postorder)\n node.left = self.buildTree(inorder[:mid], postorder)\n\n return node","memory":"52800"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n root = postorder.pop()\n if len(inorder) == 1:\n return TreeNode(root)\n \n root_index = inorder.index(root)\n\n right = self.buildTree(inorder[root_index+1:], postorder)\n left = self.buildTree(inorder[:root_index], postorder)\n\n return TreeNode(root, left, right)\n ","memory":"52800"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(inorder) == 0 or len(postorder) == 0:\n return None\n root_elem = postorder.pop()\n root = TreeNode(root_elem)\n mid = inorder.index(root_elem)\n root.right = self.buildTree(inorder[mid + 1:], postorder)\n root.left = self.buildTree(inorder[:mid], postorder)\n return root\n ","memory":"52900"},{"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# 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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n\n # Helper function to recursively build the tree\n def itsTree(inorder, postorder):\n if not inorder or not postorder:\n return None\n\n # The last element in postorder is the root\n ele = postorder.pop() # Pop from the end\n rootele = TreeNode(ele)\n\n # Find the index of the root element in inorder traversal\n ind = inorder.index(ele)\n\n # Recursively build the right subtree first, then the left subtree\n rootele.right = itsTree(inorder[ind + 1:], postorder) # Right subtree\n rootele.left = itsTree(inorder[:ind], postorder) # Left subtree\n\n return rootele\n\n return itsTree(inorder, postorder)\n","memory":"52900"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n node_val = postorder.pop()\n # print('postorder:', postorder)\n node = TreeNode(node_val)\n # print(node_val, inorder)\n inorder_index = inorder.index(node_val)\n \n # print(node_val)\n # print(inorder_index)\n left_inorder = inorder[:inorder_index]\n right_inorder = inorder[inorder_index + 1:]\n \n node.right = self.buildTree(right_inorder, postorder)\n node.left = self.buildTree(left_inorder, postorder)\n\n return node","memory":"53200"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n postorder = deque(postorder)\n\n def build(inorder):\n if(inorder):\n pop = postorder.pop()\n mid_idx = inorder.index(pop)\n node = TreeNode(pop)\n\n left, right = inorder[:mid_idx], inorder[mid_idx+1:]\n node.right = build(right)\n node.left = build(left)\n return node\n\n return None\n\n return build(inorder)\n ","memory":"53300"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n if len(inorder) == 1:\n return TreeNode(inorder[0])\n\n p = postorder\n i = inorder\n\n root = TreeNode(p[-1])\n\n def rec(root,index,ino):\n\n if root is None:\n return\n\n pivot = None\n for j in range(len(ino)):\n if ino[j] == root.val:\n pivot = j\n break\n l = ino[0:pivot]\n r = ino[pivot+1:]\n\n l_i = None\n\n if index-1 < 0:\n return\n\n if p[index-1] in r:\n root.right = TreeNode(p[index-1])\n for j in range(len(p)-1,-1,-1):\n if p[j] in l:\n root.left = TreeNode(p[j])\n l_i = j\n break\n\n elif p[index-1] in l:\n root.left = TreeNode(p[index-1]) \n\n rec(root.right,index-1,r) \n if l_i is not None:\n rec(root.left,l_i,l) \n else:\n rec(root.left,index-1,l) \n\n rec(root,len(p)-1,i)\n\n return root\n\n\n\n\n\n\n \n \n","memory":"53400"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n postOrderMap ={}\n\n for i in range(0,len(postorder)):\n postOrderMap[postorder[i]] = i\n \n def constructTree(treeNodes,postorder,root):\n\n if not treeNodes:\n return None\n if len(treeNodes) == 1:\n return TreeNode(treeNodes[0])\n maxIndex = -1\n for node in treeNodes:\n maxIndex = max(maxIndex,postOrderMap[node])\n \n maxIndex = treeNodes.index(postorder[maxIndex])\n leftTree = treeNodes[:maxIndex]\n rightTree = treeNodes[maxIndex+1:]\n\n root = TreeNode(treeNodes[maxIndex])\n root.left = constructTree(leftTree,postorder,root)\n root.right = constructTree(rightTree,postorder,root)\n\n return root\n\n\n\n rootValue = postorder[len(postorder)-1]\n inOrderIndex = inorder.index(rootValue)\n leftTree = inorder[:inOrderIndex]\n rightTree = inorder[inOrderIndex+1:]\n\n root = TreeNode(rootValue)\n root.left = constructTree(leftTree,postorder,root)\n root.right = constructTree(rightTree,postorder,root)\n\n return root\n\n\n\n ","memory":"53500"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n postOrderMap ={}\n\n for i in range(0,len(postorder)):\n postOrderMap[postorder[i]] = i\n \n def constructTree(treeNodes,postorder,root):\n\n if not treeNodes:\n return None\n if len(treeNodes) == 1:\n return TreeNode(treeNodes[0])\n maxIndex = -1\n for node in treeNodes:\n maxIndex = max(maxIndex,postOrderMap[node])\n \n maxIndex = treeNodes.index(postorder[maxIndex])\n leftTree = treeNodes[:maxIndex]\n rightTree = treeNodes[maxIndex+1:]\n\n root = TreeNode(treeNodes[maxIndex])\n root.left = constructTree(leftTree,postorder,root)\n root.right = constructTree(rightTree,postorder,root)\n\n return root\n\n rootValue = postorder[len(postorder)-1]\n inOrderIndex = inorder.index(rootValue)\n leftTree = inorder[:inOrderIndex]\n rightTree = inorder[inOrderIndex+1:]\n\n root = TreeNode(rootValue)\n root.left = constructTree(leftTree,postorder,root)\n root.right = constructTree(rightTree,postorder,root)\n\n return root\n\n\n\n ","memory":"53500"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n # in order: left node right\n # left right node\n in_dict = {elem:i for i, elem in enumerate(inorder)}\n post_dict = {elem:i for i, elem in enumerate(postorder)}\n print(post_dict)\n # now knowing this: we know the first most node is the left most in in order and post order\n # then it's the root:\n\n # so strategy should be start at node find corresponding index in in order\n # 3, 9, 1\n root = TreeNode(postorder[-1], None, None)\n # right s\n # because everything right\n # [12, 10, 9, 11, 3, 15, 20, 7]\n # [12, 10, 11, 9, 15, 7, 20, 3]\n\n # we use post to answer what's the root?\n # latest node is\n def construct_tree(post_ind, left, right):\n curr_elem = postorder[post_ind]\n\n curr_node = TreeNode(curr_elem, None, None)\n if left == right:\n return curr_node\n \n in_ind = in_dict[curr_elem]\n\n # next_post_index\n\n # everything between left and in_ind is the left tree\n # everything between in_ind + 1 and right is the right tree\n left_nodes = inorder[left:in_ind]\n right_nodes = inorder[in_ind + 1:right + 1]\n\n left_post_ind = -1\n for left_node in left_nodes:\n left_post_ind = max(left_post_ind, post_dict[left_node])\n \n right_post_ind = -1\n for right_node in right_nodes:\n right_post_ind = max(right_post_ind, post_dict[right_node])\n \n if left_post_ind != -1:\n curr_node.left = construct_tree(left_post_ind, left, in_ind - 1)\n if right_post_ind != -1:\n curr_node.right = construct_tree(right_post_ind, in_ind + 1, right)\n\n return curr_node\n \n tree = construct_tree(len(postorder) - 1, 0, len(inorder) - 1)\n return tree\n\n\n\n\n\n\n \n\n","memory":"54000"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n # in order: left node right\n # left right node\n in_dict = {elem:i for i, elem in enumerate(inorder)}\n post_dict = {elem:i for i, elem in enumerate(postorder)}\n print(post_dict)\n # now knowing this: we know the first most node is the left most in in order and post order\n # then it's the root:\n\n # so strategy should be start at node find corresponding index in in order\n # 3, 9, 1\n root = TreeNode(postorder[-1], None, None)\n # right s\n # because everything right\n # [12, 10, 9, 11, 3, 15, 20, 7]\n # [12, 10, 11, 9, 15, 7, 20, 3]\n\n # we use post to answer what's the root?\n # latest node is\n def construct_tree(post_ind, left, right):\n curr_elem = postorder[post_ind]\n\n curr_node = TreeNode(curr_elem, None, None)\n if left == right:\n return curr_node\n \n in_ind = in_dict[curr_elem]\n\n # next_post_index\n\n # everything between left and in_ind is the left tree\n # everything between in_ind + 1 and right is the right tree\n left_nodes = inorder[left:in_ind]\n right_nodes = inorder[in_ind + 1:right + 1]\n\n left_post_ind = -1\n\n for left_node in left_nodes:\n left_post_ind = max(left_post_ind, post_dict[left_node])\n \n right_post_ind = -1\n\n for right_node in right_nodes:\n right_post_ind = max(right_post_ind, post_dict[right_node])\n \n if left_post_ind != -1:\n curr_node.left = construct_tree(left_post_ind, left, in_ind - 1)\n \n if right_post_ind != -1:\n curr_node.right = construct_tree(right_post_ind, in_ind + 1, right)\n\n return curr_node\n \n tree = construct_tree(len(postorder) - 1, 0, len(inorder) - 1)\n return tree\n\n\n\n\n\n\n \n\n","memory":"54000"},{"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\nfrom collections import deque\nclass Solution:\n def build(self, vals):\n if len(vals) == 0:\n return None\n head = TreeNode(vals[-1])\n l_sub = []\n r_sub = []\n for val in vals[:-1]:\n if self.iof[val] < self.iof[vals[-1]]:\n l_sub.append(val)\n else:\n r_sub.append(val)\n head.left = self.build(l_sub)\n head.right = self.build(r_sub)\n return head\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n self.iof = {}\n for i, val in enumerate(inorder):\n self.iof[val] = i\n return self.build(postorder)\n \n ","memory":"55500"},{"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\ndef gen_node(node, postorder: list[int], inorder: list[int]):\n left = []\n right = []\n flag = False\n\n for i in inorder:\n if node.val == i:\n flag = True\n continue\n\n if not flag:\n right.append(i)\n else:\n left.append(i)\n\n if len(right):\n val = postorder.pop(0)\n node.right = TreeNode(val)\n gen_node(node.right, postorder, right)\n\n if len(left):\n val = postorder.pop(0)\n node.left = TreeNode(val)\n gen_node(node.left, postorder, left)\n\n\nclass Solution:\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not len(postorder):\n return None\n\n postorder.reverse()\n inorder.reverse()\n root = TreeNode(postorder.pop(0))\n\n gen_node(root, postorder, inorder)\n\n return root","memory":"55600"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n tree_head = [None]\n postorder_idx = [len(postorder) - 1]\n\n def construct_tree_from(vals_in_subtree: List[int]) -> Optional[TreeNode]:\n '''I should be able to iterate backward in the postorder list to get\n root nodes of each subtree\n Search for the postorder value in \"vals_in_subtree\". Values to the left\n are in the left subtree, values to the right are in the right subtree\n Recursively call the method on these subarrays\n :return: the root of this subtree (could be None)\n :note: every call of this function increments a \"global\" postorder_idx'''\n if postorder_idx[0] == -1:\n # print(f'tree creation already done')\n return None\n if len(vals_in_subtree) == 0:\n return None\n \n cur_node_val = postorder[postorder_idx[0]]\n cur_node = TreeNode(cur_node_val)\n if tree_head[0] is None:\n tree_head[0] = cur_node\n # print(f'{tree_head[0]=}')\n postorder_idx[0] -= 1\n\n cur_val_idx = vals_in_subtree.index(cur_node_val)\n right_subtree_vals = deepcopy(vals_in_subtree[cur_val_idx + 1:])\n left_subtree_vals = deepcopy(vals_in_subtree[:cur_val_idx])\n\n right_subtree_root = construct_tree_from(right_subtree_vals)\n cur_node.right = right_subtree_root\n left_subtree_root = construct_tree_from(left_subtree_vals)\n cur_node.left = left_subtree_root\n\n return cur_node\n\n construct_tree_from(inorder)\n return tree_head[0]","memory":"55700"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if len(inorder) == 0:\n return None\n \n midNodeVal = postorder[-1]\n\n midIndexInorder = 0\n while midIndexInorder < len(inorder):\n if inorder[midIndexInorder] == midNodeVal:\n break\n midIndexInorder += 1\n \n left = self.buildTree(inorder[:midIndexInorder], postorder[:midIndexInorder]) \n right = self.buildTree(inorder[midIndexInorder+1:], postorder[midIndexInorder: len(postorder)-1])\n\n midNode = TreeNode(midNodeVal, left, right)\n return midNode","memory":"87400"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n #print(\"\\npostorder = \", postorder,\" inorder = \", inorder)\n \n if len(postorder) == 1:\n return TreeNode(postorder[0])\n\n root = postorder[-1]\n \n\n index_root = inorder.index(root)\n\n ###logic\n if index_root > 0:\n left_node = self.buildTree(inorder[:index_root], postorder[:index_root])\n else:\n left_node = None\n\n if index_root < len(inorder)-1:\n right_node = self.buildTree(inorder[index_root+1:], postorder[index_root:len(postorder)-1])\n else:\n right_node = None\n \n r = TreeNode(root)\n r.left = left_node\n r.right = right_node\n\n #print(index_root)\n\n return r","memory":"87500"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n root_val=postorder[-1]\n root=TreeNode(root_val)\n mid=inorder.index(root_val)\n root.left=self.buildTree(inorder[:mid],postorder[:mid])\n root.right=self.buildTree(inorder[mid+1:],postorder[mid:-1])\n return root ","memory":"87600"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n\n if not inorder and not postorder:\n return None\n \n if len(inorder) == len(postorder) == 1:\n return TreeNode(inorder[0])\n\n cur_index = 0\n cur_val = postorder[-1]\n for i in range(len(inorder)):\n if inorder[i] == cur_val:\n cur_index = i\n break\n\n left = self.buildTree(inorder[:cur_index], postorder[:cur_index])\n right = self.buildTree(inorder[cur_index + 1:], postorder[cur_index:-1])\n cur_node = TreeNode(cur_val)\n cur_node.left = left\n cur_node.right = right\n return cur_node\n\n ","memory":"87800"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n ## 設定base case\n if not inorder or not postorder:\n return None\n\n ## 找root\n root_val = postorder[-1]\n root = TreeNode(root_val)\n root_index = inorder.index(root_val)\n\n ## 遞迴建tree\n root.left = self.buildTree(inorder[:root_index],postorder[:root_index])\n root.right = self.buildTree(inorder[root_index+1:],postorder[root_index:-1])\n\n return root\n\n","memory":"87900"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n def dfs(io, po):\n if len(io) == 0:\n return None\n \n val = po[-1]\n d = 0\n for i in range(len(io)):\n if io[i] == val:\n d = i\n break\n \n # print(val, d)\n # print(io[0:d], po[0:d])\n # print(io[d+1:], po[d:-1])\n left = dfs(io[0:d], po[0:d])\n right = dfs(io[d+1:], po[d:-1])\n\n node = TreeNode(val, left, right)\n return node\n \n return dfs(inorder, postorder)","memory":"88000"},{"code":"from collections import deque\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n def build(inorder,postorder):\n if len(inorder) == 0:\n return None\n\n rootValue = postorder[-1]\n i = inorder.index(rootValue)\n left = build(inorder[:i], postorder[:i])\n right = build(inorder[i+1:], postorder[i:-1])\n return TreeNode(rootValue,left,right)\n\n return build(inorder,postorder) \n \n","memory":"88100"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n root = postorder[-1]\n n = len(inorder)\n if n == 1:\n return TreeNode(\n val=root\n )\n for i in range(n):\n if inorder[i] == root:\n root_index = i\n break\n right_len = n - root_index - 1\n left_len = root_index\n # print(postorder[left_len:right_len + left_len])\n # print(postorder[:left_len])\n return TreeNode(\n val=root,\n left=self.buildTree(inorder[:root_index], postorder[:left_len]),\n right=self.buildTree(inorder[root_index + 1:], postorder[left_len:right_len + left_len])\n )","memory":"88200"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n root_value = postorder[-1]\n root = TreeNode(root_value)\n idx = inorder.index(root_value)\n root.left = self.buildTree(inorder[:idx], postorder[:idx])\n root.right = self.buildTree(inorder[idx+1:], postorder[idx:-1])\n return root","memory":"88200"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return None\n\n cur_root_val = postorder[-1]\n root = TreeNode(cur_root_val)\n index = inorder.index(cur_root_val)\n\n root.left = self.buildTree(inorder[:index], postorder[:index])\n root.right = self.buildTree(inorder[index+1:], postorder[index:-1]) # postorder[index:-1] 表示 从 index开始 到 倒数第二个元素, 所以是 postorder[index: -1]\n return root","memory":"88300"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder or not postorder:\n return\n # print(inorder, postorder)\n root = TreeNode(postorder[-1])\n mid = inorder.index(postorder[-1])\n \n root.right = self.buildTree(inorder[mid+1:], postorder[mid:-1])\n root.left = self.buildTree(inorder[:mid], postorder[:mid])\n \n return root\n","memory":"88300"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if not inorder:\n return None\n root = postorder[-1]\n n = len(inorder)\n if n == 1:\n return TreeNode(\n val=root\n )\n for i in range(n):\n if inorder[i] == root:\n root_index = i\n break\n right_len = n - root_index - 1\n left_len = root_index\n # print(postorder[left_len:right_len + left_len])\n # print(postorder[:left_len])\n return TreeNode(\n val=root,\n left=self.buildTree(inorder[:root_index], postorder[:left_len]),\n right=self.buildTree(inorder[root_index + 1:], postorder[left_len:right_len + left_len])\n )","memory":"88400"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n \n if not inorder or not postorder:\n return None\n\n current = TreeNode()\n current.val = postorder[-1]\n\n current_idx = inorder.index(current.val)\n current.left = self.buildTree(inorder[:current_idx], postorder[:current_idx])\n current.right = self.buildTree(inorder[current_idx+1:], postorder[current_idx:-1])\n\n return current","memory":"88400"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n\n if not inorder and not postorder:\n return None\n\n root = postorder[-1]\n root_index = inorder.index(root)\n\n node = TreeNode(val=root)\n left_length = len(inorder[:root_index])\n\n node.left = self.buildTree(inorder[:root_index], postorder[:left_length])\n node.right = self.buildTree(inorder[root_index+1:], postorder[left_length:-1])\n return node\n ","memory":"88500"},{"code":"\"\"\"\ninorder = Left Root Right\npostorder = Left Right Root\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n return self.helper(inorder, postorder)\n\n def helper(self, inorder, postorder):\n if not postorder:\n return None\n\n root_index = -1\n root_val = postorder[-1]\n root_node = TreeNode(val=root_val)\n n = len(inorder)\n # left inorder traversal\n for i, node in enumerate(inorder):\n if node == root_val:\n root_index = i\n \n left_tree = self.helper(inorder[0:root_index], postorder[0:root_index])\n right_tree = self.helper(inorder[root_index + 1:], postorder[root_index:n - 1])\n root_node.left = left_tree\n root_node.right = right_tree\n return root_node\n\n","memory":"88600"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n if inorder == []:\n return None\n \t\n root = postorder[-1]\n root_index = inorder.index(root)\n left_inorder, right_inorder = inorder[:root_index], inorder[root_index+1:]\n left_length = len(left_inorder)\n left_postorder, right_postorder = postorder[:left_length], postorder[left_length:-1]\n\n return TreeNode(root, self.buildTree(left_inorder, left_postorder), self.buildTree(right_inorder, right_postorder))","memory":"88700"},{"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n n=len(postorder)\n if n==0:\n return None\n root = TreeNode(postorder[n-1])\n if n==1:\n return root\n for i in range(n):\n if inorder[i]==root.val:\n index = i\n break\n leftInOrder = inorder[:index]\n rightInOrder = inorder[index+1:n]\n leftPostOrder = postorder[:len(leftInOrder)]\n rightPostOrder = postorder[len(leftPostOrder):n-1]\n # print(len(rightPostOrder))\n root.left=self.buildTree(leftInOrder,leftPostOrder)\n root.right=self.buildTree(rightInOrder,rightPostOrder)\n return root","memory":"88700"}],"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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(inorder) != len(postorder):\\n return None\\n\\n in_map = {val: idx for idx, val in enumerate(inorder)}\\n return self._buildTree(inorder, 0, len(inorder) - 1, postorder, 0, len(postorder) - 1, in_map)\\n\\n def _buildTree(self, inorder, in_start, in_end, postorder, post_start, post_end, in_map):\\n if in_start > in_end or post_start > post_end:\\n return None\\n\\n # The last element in postorder is the root of the tree/subtree\\n root_val = postorder[post_end]\\n root = TreeNode(root_val)\\n\\n # Find the index of the root in the inorder list\\n in_root_idx = in_map[root_val]\\n\\n # Number of nodes in the left subtree\\n nums_left = in_root_idx - in_start\\n\\n # Recursively build the left and right subtrees\\n root.left = self._buildTree(inorder, in_start, in_root_idx - 1,\\n postorder, post_start, post_start + nums_left - 1, in_map)\\n root.right = self._buildTree(inorder, in_root_idx + 1, in_end,\\n postorder, post_start + nums_left, post_end - 1, in_map)\\n return root\\n\\n in_map = {val: idx for idx, val in enumerate(inorder)}\\n return self._buildTree(inorder, 0, len(inorder) - 1, postorder, 0, len(postorder) - 1, in_map)\\n\\n def _buildTree(self, inorder: List[int], in_start: int, in_end: int, postorder: List[int], post_start: int, post_end: int, in_map: dict) -> Optional[TreeNode]:\\n if in_start > in_end or post_start > post_end:\\n return None\\n\\n # The last element in postorder is the root of the tree/subtree\\n root_val = postorder[post_end]\\n root = TreeNode(root_val)\\n\\n # Find the index of the root in the inorder list\\n in_root_idx = in_map[root_val]\\n\\n # Number of nodes in the left subtree\\n nums_left = in_root_idx - in_start\\n\\n # Recursively build the left and right subtrees\\n root.left = self._buildTree(inorder, in_start, in_root_idx - 1,\\n postorder, post_start, post_start + nums_left - 1, in_map)\\n root.right = self._buildTree(inorder, in_root_idx + 1, in_end,\\n postorder, post_start + nums_left, post_end - 1, in_map)\\n return root\",\n \"memory\": \"17400\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n def build(bound = None):\\n if not inorder or inorder[-1] == bound: return None\\n root = TreeNode(postorder.pop())\\n root.right = build(root.val)\\n inorder.pop()\\n root.left = build(bound)\\n return root\\n\\n return build()\",\n \"memory\": \"17600\"\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\\n def recur(self, left_idx, right_idx):\\n root_element = self.postorder.pop()\\n curr_idx = self.inorder_idxs[root_element]\\n right = None if curr_idx == right_idx else self.recur(curr_idx + 1, right_idx)\\n left = None if curr_idx == left_idx else self.recur(left_idx, curr_idx - 1)\\n return TreeNode(root_element, left, right)\\n\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n n, self.inorder, self.postorder = len(inorder), inorder, postorder\\n self.inorder_idxs = dict(zip(inorder, range(n)))\\n return self.recur(0, n - 1)\\n\\n\",\n \"memory\": \"17700\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n ## Initially, push the root node into the stack\\n root = TreeNode(postorder[-1])\\n stack = [(root, 0, len(inorder), inorder.index(root.val), 'RIGHT')]\\n ## Current index in 'postorder', start from the end 'len(postorder)-2'\\n curIndex = len(postorder)-2\\n while stack:\\n node, start, end, index, which = stack.pop()\\n ## Processing the right node\\n if which == 'RIGHT':\\n ## Push the node back to the stack again to process its right node in the next traversal\\n stack.append((node, start, end, index, 'LEFT'))\\n if index+1 < end:\\n rindex = inorder[index+1:end].index(postorder[curIndex]) + index + 1\\n node.right = TreeNode(postorder[curIndex])\\n curIndex -= 1\\n stack.append((node.right, index+1, end, rindex, 'RIGHT'))\\n ## Processing the left node\\n if which == 'LEFT':\\n if start < index:\\n lindex = inorder[start:index].index(postorder[curIndex]) + start\\n node.left = TreeNode(postorder[curIndex])\\n curIndex -= 1\\n stack.append((node.left, start, index, lindex, 'RIGHT'))\\n ## End of while loop\\n\\n return root\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n def builder(l, r):\\n if l > r:\\n return None\\n root = TreeNode(postorder.pop())\\n val = inorder.index(root.val)\\n root.right = builder(val + 1, r)\\n root.left = builder(l, val - 1)\\n return root\\n\\n return builder(0, len(inorder) - 1)\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not postorder:\\n return None\\n root = TreeNode(postorder[-1])\\n ri = inorder.index(postorder[-1])\\n act_nodes = deque([(root, 0, ri, len(inorder))])\\n for v in postorder[-2::-1]:\\n new_node = TreeNode(v)\\n par_node, par_left, par_ni, par_right = act_nodes.pop()\\n if par_left != par_ni and v in inorder[par_left:par_ni]:\\n par_node.left = new_node\\n nni = inorder.index(v, par_left, par_ni)\\n if par_ni + 1 != par_right:\\n act_nodes.append((par_node, par_ni, par_ni, par_right))\\n if nni != par_left or nni != par_ni - 1:\\n act_nodes.append((new_node, par_left, nni, par_ni))\\n elif v in inorder[par_ni + 1:par_right]:\\n par_node.right = new_node\\n nni = inorder.index(v, par_ni + 1, par_right)\\n if par_left != par_ni:\\n act_nodes.append((par_node, par_left, par_ni, par_ni+1))\\n if nni != par_ni + 1 or nni != par_right - 1:\\n act_nodes.append((new_node, par_ni + 1, nni, par_right))\\n return 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 __init__(self):\\n self.post_i = None\\n\\n def build(self,\\n inorder: List[int],\\n postorder: List[int],\\n in_start: int,\\n in_end: int) -> TreeNode:\\n if in_start > in_end:\\n return None\\n \\n node = TreeNode(postorder[self.post_i])\\n self.post_i -= 1\\n\\n if in_start == in_end:\\n return node\\n\\n in_i = inorder[in_start:in_end + 1].index(node.val)\\n\\n node.right = self.build(inorder, postorder, in_start + in_i + 1, in_end)\\n node.left = self.build(inorder, postorder, in_start, in_start + in_i - 1)\\n\\n return node\\n\\n\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n self.post_i = len(postorder) - 1\\n\\n return self.build(inorder, postorder, 0, len(inorder) - 1)\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n n = len(postorder)\\n reverse = {}\\n for i, x in enumerate(inorder):\\n reverse[x] = i\\n stack = [(postorder.pop(), 0, n - 1)]\\n visited = [0]\\n res = []\\n while stack:\\n node, start, end = stack[-1]\\n if visited[-1] == 0:\\n visited[-1] = 1\\n if reverse[node] + 1 <= end:\\n stack.append((postorder.pop(), reverse[node] + 1, end))\\n visited.append(False)\\n elif visited[-1] == 1:\\n visited[-1] = 2\\n if start <= reverse[node] - 1:\\n stack.append((postorder.pop(), start, reverse[node] - 1))\\n visited.append(False)\\n else:\\n stack.pop()\\n visited.pop()\\n cur = TreeNode(node)\\n if start <= reverse[node] - 1:\\n cur.left = res.pop()\\n if reverse[node] + 1 <= end:\\n cur.right = res.pop()\\n res.append(cur)\\n return res[0]\",\n \"memory\": \"18000\"\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 buildTree(self, inorder, postorder):\\n # Step 1: Create a map to store the index of each value in the inorder list\\n self.inorder_map = {val: idx for idx, val in enumerate(inorder)}\\n\\n self.inorder = inorder\\n self.postorder = postorder\\n \\n # Step 2: Initialize a helper function with the necessary parameters\\n return self.buildTreeHelper(0, len(inorder) - 1)\\n \\n def buildTreeHelper(self, in_start, in_end):\\n # Step 3: Base case when there are no elements to construct the tree\\n if in_start > in_end:\\n return None\\n \\n # Step 4: The last element in postorder is the root\\n root_val = self.postorder.pop()\\n root = TreeNode(root_val)\\n \\n # Step 5: Find the index of the root value in the inorder traversal using the hash map\\n inorder_index = self.inorder_map[root_val]\\n \\n # Step 6: Recursively build the right and left subtrees\\n # Note: Build right subtree first because postorder is being processed from the end\\n root.right = self.buildTreeHelper(inorder_index + 1, in_end)\\n root.left = self.buildTreeHelper(in_start, inorder_index - 1)\\n \\n return root\\n\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n s = {inorder[i]: i for i in range(len(inorder))}\\n def build(start: int, end: int) -> Optional[TreeNode]:\\n if not postorder or start < 0 or end >= len(inorder) or start > end:\\n return None\\n root = TreeNode(postorder.pop())\\n index = s[root.val]\\n root.right = build(index+1, end)\\n root.left = build(start, index-1)\\n return root\\n return build(0, len(inorder)-1)\",\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 \\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n mp = {}\\n for idx, val in enumerate(inorder):\\n mp[val] = idx\\n \\n cur_idx = len(postorder) - 1\\n \\n def build(inorder, postorder, l, r) -> TreeNode:\\n if(r - l + 1 < 1):\\n return None\\n \\n nonlocal cur_idx\\n root = postorder[cur_idx]\\n cur_idx -= 1\\n m = mp[root]\\n\\n right = build(inorder, postorder, m+1, r)\\n left = build(inorder, postorder, l, m-1)\\n\\n return TreeNode(root, left, right)\\n \\n return build(inorder, postorder, 0, len(inorder) - 1)\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n val_idx = {inorder[i]: i for i in range(len(inorder))}\\n n = len(inorder) \\n \\n def createTree(i_st, i_end):\\n if i_st > i_end:\\n return None\\n \\n node = TreeNode(postorder.pop())\\n idx = val_idx[node.val]\\n node.right = createTree(idx+1, i_end)\\n node.left = createTree(i_st, idx-1)\\n return node\\n\\n return createTree(0, n-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 '''\\n inorder = [left ... root ... right]\\n postorder = [..... left right root]\\n '''\\n\\n def dfs(self, inorder, postorder, idxMap, left, right):\\n if left > right:\\n return None\\n\\n value = postorder[self.postorderIdx]\\n self.postorderIdx -= 1\\n\\n newNode = TreeNode(value)\\n\\n inorderIdx = idxMap[value]\\n\\n newNode.right = self.dfs(inorder, postorder, idxMap, inorderIdx + 1, right)\\n newNode.left = self.dfs(inorder, postorder, idxMap, left, inorderIdx - 1)\\n\\n return newNode\\n\\n\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n n = len(inorder)\\n \\n idxMap = {value: idx for idx, value in enumerate(inorder)}\\n self.postorderIdx = n - 1\\n\\n return self.dfs(inorder, postorder, idxMap, 0, n - 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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n postorder = postorder[::-1]\\n d = {}\\n for i, x in enumerate(inorder):\\n d[x] = i\\n\\n def dfs(root, left, right):\\n if left > right:\\n return None\\n node = TreeNode(val=postorder[root])\\n idx = d[postorder[root]]\\n node.right = dfs(root+1, idx+1, right)\\n node.left = dfs(root+right-idx+1, left, idx-1)\\n return node\\n\\n return dfs(0, 0, len(postorder)-1)\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n postorder = postorder[::-1]\\n d = {}\\n for i, x in enumerate(inorder):\\n d[x] = i\\n # 在inorder两边分治\\n def dfs(root, left, right):\\n if left > right:\\n return None\\n node = TreeNode(val=postorder[root])\\n idx = d[postorder[root]]\\n node.right = dfs(root+1, idx+1, right)\\n node.left = dfs(root+right-idx+1, left, idx-1)\\n return node\\n\\n return dfs(0, 0, len(postorder)-1)\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n val_idx = {inorder[i]: i for i in range(len(inorder))}\\n n = len(inorder) \\n \\n def createTree(i_st, i_end, p_s, p_end):\\n if i_st > i_end or p_s > p_end:\\n return None\\n \\n node = TreeNode(postorder[p_end])\\n idx = val_idx[node.val]\\n num_left_nodes = idx-i_st\\n \\n \\n \\n node.right = createTree(idx+1, i_end, p_s+num_left_nodes,p_end-1)\\n node.left = createTree(i_st, idx-1, p_s, p_s+num_left_nodes-1)\\n return node\\n\\n return createTree(0, n-1, 0, n-1)\\n\",\n \"memory\": \"18500\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n indexmap = {}\\n for i in range(len(inorder)):\\n indexmap[inorder[i]]=i\\n return self.solve(inorder,0,len(inorder)-1,postorder,0,len(postorder)-1,indexmap)\\n \\n\\n def solve(self,inorder,istart,iend,postorder,pstart,pend,indexmap):\\n if istart>iend or pstart>pend:\\n return None\\n ele = postorder[pend]\\n index = indexmap[ele]\\n numsright = iend-index\\n root = TreeNode(ele)\\n root.left = self.solve(inorder,istart,index-1,postorder,pstart,pend-numsright-1,indexmap)\\n root.right = self.solve(inorder,index+1,iend,postorder,pend-numsright,pend-1,indexmap)\\n return root\\n \",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"class Solution:\\n def buildTree(\\n self,\\n inorder: list[int],\\n postorder: list[int],\\n ) -> TreeNode | None:\\n inToIndex = {num: i for i, num in enumerate(inorder)}\\n\\n def build(\\n inStart: int,\\n inEnd: int,\\n postStart: int,\\n postEnd: int,\\n ) -> TreeNode | None:\\n if inStart > inEnd:\\n return None\\n\\n rootVal = postorder[postEnd]\\n rootInIndex = inToIndex[rootVal]\\n leftSize = rootInIndex - inStart\\n\\n root = TreeNode(rootVal)\\n root.left = build(inStart, rootInIndex - 1, postStart,\\n postStart + leftSize - 1)\\n root.right = build(rootInIndex + 1, inEnd, postStart + leftSize,\\n postEnd - 1)\\n return root\\n\\n return build(0, len(inorder) - 1, 0, len(postorder) - 1)\",\n \"memory\": \"18600\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n inMap = {}\\n for i in range(len(inorder)):\\n inMap[inorder[i]] = i\\n def construct(post, postStart, postEnd, In, inStart, inEnd):\\n if postStart>=postEnd or inStart>=inEnd:\\n return None\\n rootVal = post[postEnd-1]\\n root = TreeNode(rootVal)\\n inRoot = inMap[rootVal]\\n numsLeft = inRoot-inStart\\n root.left = construct(post, postStart, postStart + numsLeft, In, inStart, inRoot)\\n root.right = construct(post, postStart + numsLeft, postEnd-1, In, inRoot+1, inEnd)\\n return root\\n return construct(postorder, 0, len(postorder), inorder, 0, len(inorder))\\n \",\n \"memory\": \"18600\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n '''\\n if not inorder:\\n return\\n\\n if len(inorder) == 1:\\n return TreeNode(inorder[0])\\n\\n root_val = postorder[-1]\\n root = TreeNode(root_val)\\n\\n rootindex = inorder.index(root_val)\\n\\n root.left = self.buildTree(inorder[:rootindex], postorder[:rootindex])\\n root.right = self.buildTree(inorder[rootindex+1:], postorder[rootindex:-1])\\n\\n return root\\n '''\\n '''\\n 遞迴調用的深度：\\n遞迴的深度在最壞情況下是 n（當樹退化成鏈表時），每次遞迴都會佔用記憶體堆疊。這部分空間複雜度是 O(n)。\\n切片創建的新列表：\\n每次遞迴調用會創建新的子列表，這些切片操作佔用了額外的空間。最壞情況下，每次創建的子列表的大小是 O(n)，而且每次遞迴都需要這樣的額外空間。因此，切片操作的空間複雜度是 O(n^2) \\n time also O(n^2) 每次調用 index 都需要遍歷 inorder 列表，這是一個 O(n) 的操作，\\n '''\\n\\n inorder_map = {val: index for index, val in enumerate(inorder)}\\n\\n def helper(il: int, ir: int, pl: int, pr: int):\\n if ir < il or pr < pl:\\n return None\\n \\n rootval = postorder[pr]\\n root = TreeNode(rootval)\\n\\n rootindex = inorder_map[rootval]\\n\\n lefttreesize = rootindex - il\\n\\n root.left = helper(il, rootindex-1, pl, pl+lefttreesize-1)\\n root.right = helper(rootindex+1, ir, pl+lefttreesize, pr-1)\\n\\n return root\\n\\n return helper(0, len(inorder)-1, 0, len(postorder)-1)\\n\\n\\n \",\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 def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n n = len(inorder)\\n memoIn = {inorder[i]:i for i in range(n)}\\n memoPost = {postorder[i]:i for i in range(n)}\\n\\n def arrToTree(pl: int, pr: int, il: int, ir: int) ->Optional[TreeNode]:\\n print(pl, pr, il, ir)\\n if pl > pr or il > ir:\\n return None\\n elif pl == pr:\\n return TreeNode(postorder[pl])\\n else:\\n val = postorder[pr]\\n index = memoIn[val]\\n left = arrToTree(pl, pl+ index - il - 1, il, index-1)\\n right = arrToTree(pl + index - il , pr-1, index+ 1, ir)\\n return TreeNode(val, left, right)\\n\\n return arrToTree(0, n-1, 0, n-1)\\n\\n\",\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 def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n inMap={inorder[i]:i for i in range(len(inorder))}\\n\\n def build(postStart,postEnd,inStart,inEnd):\\n if postStart>postEnd or inStart>inEnd:\\n return None\\n root_val=postorder[postEnd]\\n root_ind=inMap[root_val]\\n root=TreeNode(root_val)\\n left_subtree_size=root_ind-inStart\\n\\n root.left=build(postStart,postStart+left_subtree_size-1,inStart,root_ind-1)\\n root.right=build(postStart+left_subtree_size,postEnd-1,root_ind+1,inEnd)\\n\\n return root\\n return build(0,len(postorder)-1,0,len(inorder)-1)\\n\\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n '''\\n observations\\n inorder - in order\\n everything to the left of val is on left of tree\\n same w/ right\\n postorder - last element is root\\n '''\\n vals = {}\\n for i in range(len(inorder)):\\n vals[inorder[i]] = i\\n def build(pl, pr, il, ir):\\n if pl > pr:\\n return None\\n val = postorder[pr]\\n node = TreeNode(val) # get node from right of pre\\n # get number of vals on left and right side from inorder\\n lCount = vals[val] - il\\n rCount = ir - vals[val]\\n im = il + lCount\\n pm = pr - rCount\\n node.left = build(pl, pm - 1, il, im - 1)\\n node.right = build(pm, pr - 1, im + 1, ir)\\n return node\\n \\n return build(0, len(postorder) - 1, 0, len(inorder) - 1)\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n # find mid\\n # find left\\n # find right\\n n = len(inorder)\\n\\n if n == 1:\\n return TreeNode(inorder[0])\\n\\n inorder_mapping = {inorder[i]: i for i in range(n)}\\n\\n def build(inorder_range, postorder_range):\\n # inorder_range = [start, end]\\n if (\\n inorder_range[0] > inorder_range[1]\\n or postorder_range[0] > postorder_range[1]\\n ):\\n return None\\n\\n print(inorder_range, postorder_range)\\n\\n root_index = postorder_range[1]\\n root = TreeNode(postorder[root_index])\\n\\n mid = inorder_mapping[root.val]\\n\\n left_len = mid - inorder_range[0]\\n left_pos_end = postorder_range[0] + left_len - 1\\n\\n right_len = inorder_range[1] - mid\\n\\n root.left = build(\\n (inorder_range[0], mid - 1),\\n (postorder_range[0], left_pos_end),\\n )\\n root.right = build(\\n (mid + 1, inorder_range[1]), (left_pos_end + 1, postorder_range[1] - 1)\\n )\\n\\n return root\\n\\n root = build((0, n - 1), (0, n - 1))\\n return root\\n\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n # find mid\\n # find left\\n # find right\\n n = len(inorder)\\n\\n if n == 1:\\n return TreeNode(inorder[0])\\n\\n inorder_mapping = {inorder[i]: i for i in range(n)}\\n\\n def build(inorder_range, postorder_range):\\n # inorder_range = [start, end]\\n if (\\n inorder_range[0] > inorder_range[1]\\n or postorder_range[0] > postorder_range[1]\\n ):\\n return None\\n\\n root_index = postorder_range[1]\\n root = TreeNode(postorder[root_index])\\n\\n mid = inorder_mapping[root.val]\\n\\n left_len = mid - inorder_range[0]\\n left_pos_end = postorder_range[0] + left_len - 1\\n\\n right_len = inorder_range[1] - mid\\n\\n root.left = build(\\n (inorder_range[0], mid - 1),\\n (postorder_range[0], left_pos_end),\\n )\\n root.right = build(\\n (mid + 1, inorder_range[1]), (left_pos_end + 1, postorder_range[1] - 1)\\n )\\n\\n return root\\n\\n root = build((0, n - 1), (0, n - 1))\\n return root\\n\",\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n inorder_inds = dict() # val -> ind\\n for ind, val in enumerate(inorder):\\n inorder_inds[val] = ind\\n \\n def build_helper(in_left, in_right, post_left, post_right):\\n if post_left > post_right:\\n return None \\n \\n node = TreeNode(postorder[post_right])\\n if post_left == post_right:\\n return node\\n node_val = postorder[post_right]\\n ind = inorder_inds[node_val]\\n \\n left_in_left = in_left\\n left_in_right = ind - 1\\n right_in_left = ind + 1\\n right_in_right = in_right\\n \\n left_length = left_in_right - left_in_left + 1 \\n \\n left_post_left = post_left\\n left_post_right = post_left + left_length - 1\\n right_post_left = post_left + left_length\\n right_post_right = post_right - 1 \\n \\n node.left = build_helper(left_in_left, left_in_right, left_post_left, left_post_right)\\n node.right = build_helper(right_in_left, right_in_right, right_post_left, right_post_right)\\n return node \\n \\n return build_helper(0, len(inorder) - 1, 0, len(postorder) - 1)\\n \\n \\n \\n \\n \\n \\n \",\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 def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n nodesToIndex = {}\\n n = len(inorder)\\n for i in range(n):\\n nodesToIndex[inorder[i]] = i\\n\\n def build(inStart, inEnd, postStart, postEnd):\\n if inStart == inEnd:\\n return TreeNode(postorder[postEnd])\\n if inStart > inEnd or postStart > postEnd:\\n return None\\n\\n print(postEnd)\\n\\n root = TreeNode(postorder[postEnd])\\n rootIndex = nodesToIndex[root.val]\\n inEndL = rootIndex - 1\\n inStartL = inStart\\n inStartR = rootIndex + 1\\n inEndR = inEnd\\n rightSubtreeSize = inEndR - inStartR + 1\\n postEndR = postEnd - 1\\n postStartR = postEnd - rightSubtreeSize\\n postEndL = postStartR - 1\\n postStartL = postStart\\n\\n print(root.val, inStartL, inEndL, postStartL, postEndL)\\n print(inStartR, inEndR, postStartR, postEndR)\\n root.left = build(inStartL, inEndL, postStartL, postEndL)\\n\\n root.right = build(inStartR, inEndR, postStartR, postEndR)\\n\\n return root\\n return build(0, n - 1, 0, n - 1)\\n \\n\",\n \"memory\": \"19100\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n head = TreeNode(postorder[-1])\\n\\n ind_inorder = {}\\n for i, num in enumerate(inorder):\\n ind_inorder[num] = i\\n\\n i_inds = [0, len(inorder)-1]\\n p_inds = [0, len(postorder)-1]\\n\\n def build_tree(head, i_inds, p_inds):\\n if i_inds[1] == i_inds[0]:\\n return None\\n\\n l_i_inds = [i_inds[0], ind_inorder[head.val]-1]\\n r_i_inds = [ind_inorder[head.val]+1, i_inds[1]]\\n\\n len_l = l_i_inds[1] - l_i_inds[0]\\n len_r = r_i_inds[1] - r_i_inds[0]\\n\\n if len_l >= 0:\\n l_p_inds = [p_inds[0], p_inds[0]+len_l]\\n head.left = TreeNode(postorder[l_p_inds[1]])\\n build_tree(head.left, l_i_inds, l_p_inds)\\n if len_r >= 0:\\n r_p_inds = [p_inds[0]+len_l+1, p_inds[1]-1]\\n head.right = TreeNode(postorder[r_p_inds[1]])\\n build_tree(head.right, r_i_inds, r_p_inds)\\n\\n\\n build_tree(head, i_inds, p_inds)\\n return head\\n \\n\\n \",\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\\nclass Solution:\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n if len(inorder) == 0:\\n return None\\n if len(inorder) == 1:\\n return TreeNode(inorder[0])\\n \\n inorder_nodes = {\\n val: dict(node=TreeNode(val), index=i) for i, val in enumerate(inorder)\\n }\\n postorder_nodes = {\\n val: dict(node=inorder_nodes[val][\\\"node\\\"], index=i)\\n for i, val in enumerate(postorder)\\n }\\n\\n def is_parent(current_val: int, comparison_val: int) -> bool:\\n return postorder_nodes[current_val][\\\"index\\\"] < postorder_nodes[comparison_val][\\\"index\\\"]\\n\\n def get_left_child(poi: int) -> TreeNode:\\n val = postorder[poi]\\n ini = inorder_nodes[val][\\\"index\\\"]\\n if ini == 0 or poi == 0:\\n return None\\n ini -= 1\\n left_val = inorder[ini]\\n if is_parent(val, left_val):\\n return None\\n\\n right_val = val\\n ini = inorder_nodes[val][\\\"index\\\"]\\n if ini < len(inorder) - 1 and not is_parent(val, inorder[ini + 1]):\\n right_val = inorder[ini + 1]\\n\\n child_poi = postorder_nodes[right_val][\\\"index\\\"] - 1\\n child_val = postorder[child_poi]\\n while inorder_nodes[val][\\\"index\\\"] < inorder_nodes[child_val][\\\"index\\\"]:\\n if child_poi > 0:\\n child_poi -= 1\\n child_val = postorder[child_poi]\\n else:\\n child_val = inorder[inorder_nodes[child_val][\\\"index\\\"] - 1]\\n\\n return inorder_nodes[child_val][\\\"node\\\"]\\n\\n def get_right_child(poi: int) -> TreeNode:\\n val = postorder[poi]\\n ini = inorder_nodes[val][\\\"index\\\"]\\n if inorder_nodes[val][\\\"index\\\"] == len(inorder) - 1 or poi == 0:\\n return None\\n ini += 1\\n right_val = inorder[ini]\\n if is_parent(val, right_val):\\n return None\\n child_val = postorder[poi-1]\\n if inorder_nodes[child_val][\\\"index\\\"] < inorder_nodes[val][\\\"index\\\"]:\\n return None\\n return inorder_nodes[child_val][\\\"node\\\"]\\n\\n for i in range(len(postorder) - 1, -1, -1):\\n val = postorder[i]\\n node = postorder_nodes[val][\\\"node\\\"]\\n node.left = get_left_child(i)\\n node.right = get_right_child(i)\\n\\n return postorder_nodes[postorder[-1]][\\\"node\\\"]\\n\\n\\n\\\"\\\"\\\"\\n\\n 3\\n\\n 9 20\\n\\n\\n4 5 15 7\\n \\n 13\\n 11 6\\n\\n\\ninordrer = [4, 13 9, 5, 3, 11, 15, 20, 7, 6]\\npostorder = [13, 4, 5, 9, 11, 15, 6, 7, 20, 3]\\n\\n\\n\\ni_count, p_count = 0, 0\\n\\nnode = TreeNode(postorder[p_count])\\n\\nif postorder[p_count] != inorder[i_count]:\\n \\n\\n\\nif postorder[0] == inorder[0]:\\n i_count += 1\\n p_count += 1\\n new_node = TreeNode(inorder[i_count], left=node)\\n node = new_node\\n\\n\\n\\n\\n\\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n head = TreeNode(postorder[-1])\\n\\n ind_inorder = {}\\n for i, num in enumerate(inorder):\\n ind_inorder[num] = i\\n\\n i_inds = [0, len(inorder)-1]\\n p_inds = [0, len(postorder)-1]\\n\\n def build_tree(head, i_inds, p_inds):\\n if i_inds[1] == i_inds[0]:\\n return None\\n\\n l_i_inds = [i_inds[0], ind_inorder[head.val]-1]\\n r_i_inds = [ind_inorder[head.val]+1, i_inds[1]]\\n\\n len_l = l_i_inds[1] - l_i_inds[0]\\n len_r = r_i_inds[1] - r_i_inds[0]\\n #print(l_i_inds, r_i_inds)\\n\\n if len_l >= 0:\\n l_p_inds = [p_inds[0], p_inds[0]+len_l]\\n #print(l_p_inds)\\n head.left = TreeNode(postorder[l_p_inds[1]])\\n build_tree(head.left, l_i_inds, l_p_inds)\\n if len_r >= 0:\\n r_p_inds = [p_inds[0]+len_l+1, p_inds[1]-1]\\n #print(r_p_inds)\\n head.right = TreeNode(postorder[r_p_inds[1]])\\n build_tree(head.right, r_i_inds, r_p_inds)\\n\\n\\n build_tree(head, i_inds, p_inds)\\n return head\\n \\n\\n \",\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 def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n\\n\\n self.deep = 0\\n \\n def aux(node, is_idx, ie_idx, ps_idx, pe_idx):\\n idx = inorder.index(node.val)\\n print(f\\\"node:{node}, is_idx:{is_idx}, ie_idx:{ie_idx}, ps_idx:{ps_idx}, pe_idx:{pe_idx}\\\")\\n # self.deep+=1\\n # if self.deep > 5 or pe_idx <=0:\\n # return\\n \\n if is_idx <= idx-1 and ps_idx<=ps_idx+(idx-is_idx)-1:\\n node.left = TreeNode(val = postorder[ps_idx + (idx- is_idx)-1])\\n aux(node.left, is_idx, idx-1, ps_idx , ps_idx + (idx - is_idx)-1)\\n if idx+1 <= ie_idx and ps_idx+(idx-is_idx)<=pe_idx-1:\\n node.right = TreeNode(val = postorder[pe_idx-1])\\n aux(node.right, idx+1, ie_idx, ps_idx + (idx- is_idx), pe_idx-1)\\n \\n\\n head = TreeNode(val = postorder[-1])\\n \\n aux(head, 0, len(inorder)-1, 0, len(inorder)-1)\\n print(head)\\n return head\\n \\n \\n\",\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 def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n def buildsubtree(inorder, postorder):\\n if not inorder:\\n return None\\n\\n root = TreeNode(postorder.pop())\\n left_inorder = []\\n left_postorder = []\\n while inorder and inorder[0] != root.val:\\n left_inorder.append(inorder.pop(0))\\n left_postorder.append(postorder.pop(0))\\n inorder.pop(0)\\n\\n # now whatever's leftover in inorder and postorder is the right subtree\\n lst = buildsubtree(left_inorder, left_postorder)\\n rst = buildsubtree(inorder, postorder)\\n\\n root.left = lst\\n root.right = rst\\n\\n return root\\n\\n return buildsubtree(inorder, postorder)\\n\",\n \"memory\": \"20700\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n if not inorder or not postorder:\\n return None\\n\\n # # Approach 1: Brute force\\n # root_val = postorder[-1]\\n # root = TreeNode(val = root_val)\\n\\n # inorder_root_index = inorder.index(root_val)\\n\\n # # partition the sub arrays\\n # left_inorder = inorder[:inorder_root_index]\\n # right_inorder = inorder[inorder_root_index + 1:]\\n # left_postorder = postorder[:len(left_inorder)]\\n # right_postorder = postorder[len(left_inorder):-1]\\n\\n # root.left = self.buildTree(left_inorder, left_postorder)\\n # root.right = self.buildTree(right_inorder, right_postorder)\\n\\n # return root\\n\\n # Approach 2: Optimal\\n\\n val_map = {val: idx for idx, val in enumerate(inorder)}\\n\\n def _build_tree(inorder_start, inorder_end, postorder_start, postorder_end):\\n nonlocal inorder, postorder, val_map\\n if inorder_start > inorder_end or postorder_start > postorder_end:\\n return None\\n \\n root_val = postorder[postorder_end]\\n root = TreeNode(val = root_val)\\n root_inorder_index = val_map.get(root_val)\\n\\n left_subarray_size = root_inorder_index - inorder_start\\n\\n inorder_left, inorder_right = (inorder_start, root_inorder_index - 1), (root_inorder_index + 1, inorder_end)\\n postorder_left, postorder_right = (postorder_start, postorder_start + left_subarray_size - 1), (postorder_start + left_subarray_size, postorder_end - 1)\\n\\n root.left = _build_tree(*inorder_left, *postorder_left)\\n root.right = _build_tree(*inorder_right, *postorder_right)\\n\\n return root\\n\\n return _build_tree(0, len(inorder) - 1, 0, len(postorder) - 1)\\n\\n\\n\\n \",\n \"memory\": \"21200\"\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 buildTree(self, inorder: list[int], postorder: list[int]) -> 'Optional[TreeNode]':\\n if len(inorder) == 0:\\n return None\\n\\n root = TreeNode(postorder[-1])\\n newin = []\\n newpost = []\\n rootval = postorder[-1]\\n while True:\\n if inorder[0] == rootval:\\n inorder.pop(0)\\n break\\n\\n newin.append(inorder.pop(0))\\n\\n while len(newpost) < len(newin):\\n newpost.append(postorder.pop(0))\\n\\n postorder.pop()\\n\\n if newin:\\n root.left = self.buildTree(newin, newpost)\\n if inorder:\\n root.right = self.buildTree(inorder, postorder)\\n\\n return root\",\n \"memory\": \"23300\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n\\n def dfs(inorder, postorder):\\n if not inorder or not postorder:\\n return None\\n\\n root_val = postorder.pop()\\n root = TreeNode(root_val)\\n\\n index = inorder.index(root_val)\\n\\n root.right = dfs(inorder[index + 1:], postorder)\\n root.left = dfs(inorder[:index], postorder)\\n\\n return root\\n\\n return dfs(inorder, postorder)\",\n \"memory\": \"52300\"\n },\n {\n \"code\": \"class Solution:\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n def build_tree(inorder, postorder):\\n if not inorder:\\n return None\\n root_val = postorder.pop()\\n root = TreeNode(root_val)\\n index = inorder.index(root_val)\\n root.right = build_tree(inorder[index + 1:], postorder)\\n root.left = build_tree(inorder[:index], postorder)\\n return root\\n\\n return build_tree(inorder, postorder)\",\n \"memory\": \"52400\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n if inorder:\\n val = postorder.pop()\\n i = inorder.index(val)\\n r = self.buildTree(inorder[i+1:], postorder)\\n l = self.buildTree(inorder[:i], postorder)\\n return TreeNode(val, l, r)\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n # if inorder:\\n # val = postorder.pop()\\n # i = inorder.index(val)\\n # right = self.buildTree(inorder[i+1:], postorder)\\n # left = self.buildTree(inorder[:i], postorder)\\n # return TreeNode(val, left, right)\\n \",\n \"memory\": \"52600\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n root = TreeNode(postorder.pop())\\n mid = inorder.index(root.val)\\n root.right = self.buildTree(inorder[mid+1:], postorder)\\n root.left = self.buildTree(inorder[:mid], postorder)\\n return root\",\n \"memory\": \"52700\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n if not inorder or not postorder:\\n return None\\n \\n node = TreeNode(postorder.pop())\\n mid = inorder.index(node.val)\\n node.right = self.buildTree(inorder[mid+1:], postorder)\\n node.left = self.buildTree(inorder[:mid], postorder)\\n\\n return node\",\n \"memory\": \"52800\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n root = postorder.pop()\\n if len(inorder) == 1:\\n return TreeNode(root)\\n \\n root_index = inorder.index(root)\\n\\n right = self.buildTree(inorder[root_index+1:], postorder)\\n left = self.buildTree(inorder[:root_index], postorder)\\n\\n return TreeNode(root, left, right)\\n \",\n \"memory\": \"52800\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(inorder) == 0 or len(postorder) == 0:\\n return None\\n root_elem = postorder.pop()\\n root = TreeNode(root_elem)\\n mid = inorder.index(root_elem)\\n root.right = self.buildTree(inorder[mid + 1:], postorder)\\n root.left = self.buildTree(inorder[:mid], postorder)\\n return root\\n \",\n \"memory\": \"52900\"\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# 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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n\\n # Helper function to recursively build the tree\\n def itsTree(inorder, postorder):\\n if not inorder or not postorder:\\n return None\\n\\n # The last element in postorder is the root\\n ele = postorder.pop() # Pop from the end\\n rootele = TreeNode(ele)\\n\\n # Find the index of the root element in inorder traversal\\n ind = inorder.index(ele)\\n\\n # Recursively build the right subtree first, then the left subtree\\n rootele.right = itsTree(inorder[ind + 1:], postorder) # Right subtree\\n rootele.left = itsTree(inorder[:ind], postorder) # Left subtree\\n\\n return rootele\\n\\n return itsTree(inorder, postorder)\\n\",\n \"memory\": \"52900\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n node_val = postorder.pop()\\n # print('postorder:', postorder)\\n node = TreeNode(node_val)\\n # print(node_val, inorder)\\n inorder_index = inorder.index(node_val)\\n \\n # print(node_val)\\n # print(inorder_index)\\n left_inorder = inorder[:inorder_index]\\n right_inorder = inorder[inorder_index + 1:]\\n \\n node.right = self.buildTree(right_inorder, postorder)\\n node.left = self.buildTree(left_inorder, postorder)\\n\\n return node\",\n \"memory\": \"53200\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n postorder = deque(postorder)\\n\\n def build(inorder):\\n if(inorder):\\n pop = postorder.pop()\\n mid_idx = inorder.index(pop)\\n node = TreeNode(pop)\\n\\n left, right = inorder[:mid_idx], inorder[mid_idx+1:]\\n node.right = build(right)\\n node.left = build(left)\\n return node\\n\\n return None\\n\\n return build(inorder)\\n \",\n \"memory\": \"53300\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n if len(inorder) == 1:\\n return TreeNode(inorder[0])\\n\\n p = postorder\\n i = inorder\\n\\n root = TreeNode(p[-1])\\n\\n def rec(root,index,ino):\\n\\n if root is None:\\n return\\n\\n pivot = None\\n for j in range(len(ino)):\\n if ino[j] == root.val:\\n pivot = j\\n break\\n l = ino[0:pivot]\\n r = ino[pivot+1:]\\n\\n l_i = None\\n\\n if index-1 < 0:\\n return\\n\\n if p[index-1] in r:\\n root.right = TreeNode(p[index-1])\\n for j in range(len(p)-1,-1,-1):\\n if p[j] in l:\\n root.left = TreeNode(p[j])\\n l_i = j\\n break\\n\\n elif p[index-1] in l:\\n root.left = TreeNode(p[index-1]) \\n\\n rec(root.right,index-1,r) \\n if l_i is not None:\\n rec(root.left,l_i,l) \\n else:\\n rec(root.left,index-1,l) \\n\\n rec(root,len(p)-1,i)\\n\\n return root\\n\\n\\n\\n\\n\\n\\n \\n \\n\",\n \"memory\": \"53400\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n postOrderMap ={}\\n\\n for i in range(0,len(postorder)):\\n postOrderMap[postorder[i]] = i\\n \\n def constructTree(treeNodes,postorder,root):\\n\\n if not treeNodes:\\n return None\\n if len(treeNodes) == 1:\\n return TreeNode(treeNodes[0])\\n maxIndex = -1\\n for node in treeNodes:\\n maxIndex = max(maxIndex,postOrderMap[node])\\n \\n maxIndex = treeNodes.index(postorder[maxIndex])\\n leftTree = treeNodes[:maxIndex]\\n rightTree = treeNodes[maxIndex+1:]\\n\\n root = TreeNode(treeNodes[maxIndex])\\n root.left = constructTree(leftTree,postorder,root)\\n root.right = constructTree(rightTree,postorder,root)\\n\\n return root\\n\\n\\n\\n rootValue = postorder[len(postorder)-1]\\n inOrderIndex = inorder.index(rootValue)\\n leftTree = inorder[:inOrderIndex]\\n rightTree = inorder[inOrderIndex+1:]\\n\\n root = TreeNode(rootValue)\\n root.left = constructTree(leftTree,postorder,root)\\n root.right = constructTree(rightTree,postorder,root)\\n\\n return root\\n\\n\\n\\n \",\n \"memory\": \"53500\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n postOrderMap ={}\\n\\n for i in range(0,len(postorder)):\\n postOrderMap[postorder[i]] = i\\n \\n def constructTree(treeNodes,postorder,root):\\n\\n if not treeNodes:\\n return None\\n if len(treeNodes) == 1:\\n return TreeNode(treeNodes[0])\\n maxIndex = -1\\n for node in treeNodes:\\n maxIndex = max(maxIndex,postOrderMap[node])\\n \\n maxIndex = treeNodes.index(postorder[maxIndex])\\n leftTree = treeNodes[:maxIndex]\\n rightTree = treeNodes[maxIndex+1:]\\n\\n root = TreeNode(treeNodes[maxIndex])\\n root.left = constructTree(leftTree,postorder,root)\\n root.right = constructTree(rightTree,postorder,root)\\n\\n return root\\n\\n rootValue = postorder[len(postorder)-1]\\n inOrderIndex = inorder.index(rootValue)\\n leftTree = inorder[:inOrderIndex]\\n rightTree = inorder[inOrderIndex+1:]\\n\\n root = TreeNode(rootValue)\\n root.left = constructTree(leftTree,postorder,root)\\n root.right = constructTree(rightTree,postorder,root)\\n\\n return root\\n\\n\\n\\n \",\n \"memory\": \"53500\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n # in order: left node right\\n # left right node\\n in_dict = {elem:i for i, elem in enumerate(inorder)}\\n post_dict = {elem:i for i, elem in enumerate(postorder)}\\n print(post_dict)\\n # now knowing this: we know the first most node is the left most in in order and post order\\n # then it's the root:\\n\\n # so strategy should be start at node find corresponding index in in order\\n # 3, 9, 1\\n root = TreeNode(postorder[-1], None, None)\\n # right s\\n # because everything right\\n # [12, 10, 9, 11, 3, 15, 20, 7]\\n # [12, 10, 11, 9, 15, 7, 20, 3]\\n\\n # we use post to answer what's the root?\\n # latest node is\\n def construct_tree(post_ind, left, right):\\n curr_elem = postorder[post_ind]\\n\\n curr_node = TreeNode(curr_elem, None, None)\\n if left == right:\\n return curr_node\\n \\n in_ind = in_dict[curr_elem]\\n\\n # next_post_index\\n\\n # everything between left and in_ind is the left tree\\n # everything between in_ind + 1 and right is the right tree\\n left_nodes = inorder[left:in_ind]\\n right_nodes = inorder[in_ind + 1:right + 1]\\n\\n left_post_ind = -1\\n for left_node in left_nodes:\\n left_post_ind = max(left_post_ind, post_dict[left_node])\\n \\n right_post_ind = -1\\n for right_node in right_nodes:\\n right_post_ind = max(right_post_ind, post_dict[right_node])\\n \\n if left_post_ind != -1:\\n curr_node.left = construct_tree(left_post_ind, left, in_ind - 1)\\n if right_post_ind != -1:\\n curr_node.right = construct_tree(right_post_ind, in_ind + 1, right)\\n\\n return curr_node\\n \\n tree = construct_tree(len(postorder) - 1, 0, len(inorder) - 1)\\n return tree\\n\\n\\n\\n\\n\\n\\n \\n\\n\",\n \"memory\": \"54000\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n # in order: left node right\\n # left right node\\n in_dict = {elem:i for i, elem in enumerate(inorder)}\\n post_dict = {elem:i for i, elem in enumerate(postorder)}\\n print(post_dict)\\n # now knowing this: we know the first most node is the left most in in order and post order\\n # then it's the root:\\n\\n # so strategy should be start at node find corresponding index in in order\\n # 3, 9, 1\\n root = TreeNode(postorder[-1], None, None)\\n # right s\\n # because everything right\\n # [12, 10, 9, 11, 3, 15, 20, 7]\\n # [12, 10, 11, 9, 15, 7, 20, 3]\\n\\n # we use post to answer what's the root?\\n # latest node is\\n def construct_tree(post_ind, left, right):\\n curr_elem = postorder[post_ind]\\n\\n curr_node = TreeNode(curr_elem, None, None)\\n if left == right:\\n return curr_node\\n \\n in_ind = in_dict[curr_elem]\\n\\n # next_post_index\\n\\n # everything between left and in_ind is the left tree\\n # everything between in_ind + 1 and right is the right tree\\n left_nodes = inorder[left:in_ind]\\n right_nodes = inorder[in_ind + 1:right + 1]\\n\\n left_post_ind = -1\\n\\n for left_node in left_nodes:\\n left_post_ind = max(left_post_ind, post_dict[left_node])\\n \\n right_post_ind = -1\\n\\n for right_node in right_nodes:\\n right_post_ind = max(right_post_ind, post_dict[right_node])\\n \\n if left_post_ind != -1:\\n curr_node.left = construct_tree(left_post_ind, left, in_ind - 1)\\n \\n if right_post_ind != -1:\\n curr_node.right = construct_tree(right_post_ind, in_ind + 1, right)\\n\\n return curr_node\\n \\n tree = construct_tree(len(postorder) - 1, 0, len(inorder) - 1)\\n return tree\\n\\n\\n\\n\\n\\n\\n \\n\\n\",\n \"memory\": \"54000\"\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\\nfrom collections import deque\\nclass Solution:\\n def build(self, vals):\\n if len(vals) == 0:\\n return None\\n head = TreeNode(vals[-1])\\n l_sub = []\\n r_sub = []\\n for val in vals[:-1]:\\n if self.iof[val] < self.iof[vals[-1]]:\\n l_sub.append(val)\\n else:\\n r_sub.append(val)\\n head.left = self.build(l_sub)\\n head.right = self.build(r_sub)\\n return head\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n self.iof = {}\\n for i, val in enumerate(inorder):\\n self.iof[val] = i\\n return self.build(postorder)\\n \\n \",\n \"memory\": \"55500\"\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\\ndef gen_node(node, postorder: list[int], inorder: list[int]):\\n left = []\\n right = []\\n flag = False\\n\\n for i in inorder:\\n if node.val == i:\\n flag = True\\n continue\\n\\n if not flag:\\n right.append(i)\\n else:\\n left.append(i)\\n\\n if len(right):\\n val = postorder.pop(0)\\n node.right = TreeNode(val)\\n gen_node(node.right, postorder, right)\\n\\n if len(left):\\n val = postorder.pop(0)\\n node.left = TreeNode(val)\\n gen_node(node.left, postorder, left)\\n\\n\\nclass Solution:\\n def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not len(postorder):\\n return None\\n\\n postorder.reverse()\\n inorder.reverse()\\n root = TreeNode(postorder.pop(0))\\n\\n gen_node(root, postorder, inorder)\\n\\n return root\",\n \"memory\": \"55600\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n tree_head = [None]\\n postorder_idx = [len(postorder) - 1]\\n\\n def construct_tree_from(vals_in_subtree: List[int]) -> Optional[TreeNode]:\\n '''I should be able to iterate backward in the postorder list to get\\n root nodes of each subtree\\n Search for the postorder value in \\\"vals_in_subtree\\\". Values to the left\\n are in the left subtree, values to the right are in the right subtree\\n Recursively call the method on these subarrays\\n :return: the root of this subtree (could be None)\\n :note: every call of this function increments a \\\"global\\\" postorder_idx'''\\n if postorder_idx[0] == -1:\\n # print(f'tree creation already done')\\n return None\\n if len(vals_in_subtree) == 0:\\n return None\\n \\n cur_node_val = postorder[postorder_idx[0]]\\n cur_node = TreeNode(cur_node_val)\\n if tree_head[0] is None:\\n tree_head[0] = cur_node\\n # print(f'{tree_head[0]=}')\\n postorder_idx[0] -= 1\\n\\n cur_val_idx = vals_in_subtree.index(cur_node_val)\\n right_subtree_vals = deepcopy(vals_in_subtree[cur_val_idx + 1:])\\n left_subtree_vals = deepcopy(vals_in_subtree[:cur_val_idx])\\n\\n right_subtree_root = construct_tree_from(right_subtree_vals)\\n cur_node.right = right_subtree_root\\n left_subtree_root = construct_tree_from(left_subtree_vals)\\n cur_node.left = left_subtree_root\\n\\n return cur_node\\n\\n construct_tree_from(inorder)\\n return tree_head[0]\",\n \"memory\": \"55700\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if len(inorder) == 0:\\n return None\\n \\n midNodeVal = postorder[-1]\\n\\n midIndexInorder = 0\\n while midIndexInorder < len(inorder):\\n if inorder[midIndexInorder] == midNodeVal:\\n break\\n midIndexInorder += 1\\n \\n left = self.buildTree(inorder[:midIndexInorder], postorder[:midIndexInorder]) \\n right = self.buildTree(inorder[midIndexInorder+1:], postorder[midIndexInorder: len(postorder)-1])\\n\\n midNode = TreeNode(midNodeVal, left, right)\\n return midNode\",\n \"memory\": \"87400\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n #print(\\\"\\\\npostorder = \\\", postorder,\\\" inorder = \\\", inorder)\\n \\n if len(postorder) == 1:\\n return TreeNode(postorder[0])\\n\\n root = postorder[-1]\\n \\n\\n index_root = inorder.index(root)\\n\\n ###logic\\n if index_root > 0:\\n left_node = self.buildTree(inorder[:index_root], postorder[:index_root])\\n else:\\n left_node = None\\n\\n if index_root < len(inorder)-1:\\n right_node = self.buildTree(inorder[index_root+1:], postorder[index_root:len(postorder)-1])\\n else:\\n right_node = None\\n \\n r = TreeNode(root)\\n r.left = left_node\\n r.right = right_node\\n\\n #print(index_root)\\n\\n return r\",\n \"memory\": \"87500\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n root_val=postorder[-1]\\n root=TreeNode(root_val)\\n mid=inorder.index(root_val)\\n root.left=self.buildTree(inorder[:mid],postorder[:mid])\\n root.right=self.buildTree(inorder[mid+1:],postorder[mid:-1])\\n return root \",\n \"memory\": \"87600\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n\\n if not inorder and not postorder:\\n return None\\n \\n if len(inorder) == len(postorder) == 1:\\n return TreeNode(inorder[0])\\n\\n cur_index = 0\\n cur_val = postorder[-1]\\n for i in range(len(inorder)):\\n if inorder[i] == cur_val:\\n cur_index = i\\n break\\n\\n left = self.buildTree(inorder[:cur_index], postorder[:cur_index])\\n right = self.buildTree(inorder[cur_index + 1:], postorder[cur_index:-1])\\n cur_node = TreeNode(cur_val)\\n cur_node.left = left\\n cur_node.right = right\\n return cur_node\\n\\n \",\n \"memory\": \"87800\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n ## 設定base case\\n if not inorder or not postorder:\\n return None\\n\\n ## 找root\\n root_val = postorder[-1]\\n root = TreeNode(root_val)\\n root_index = inorder.index(root_val)\\n\\n ## 遞迴建tree\\n root.left = self.buildTree(inorder[:root_index],postorder[:root_index])\\n root.right = self.buildTree(inorder[root_index+1:],postorder[root_index:-1])\\n\\n return root\\n\\n\",\n \"memory\": \"87900\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n def dfs(io, po):\\n if len(io) == 0:\\n return None\\n \\n val = po[-1]\\n d = 0\\n for i in range(len(io)):\\n if io[i] == val:\\n d = i\\n break\\n \\n # print(val, d)\\n # print(io[0:d], po[0:d])\\n # print(io[d+1:], po[d:-1])\\n left = dfs(io[0:d], po[0:d])\\n right = dfs(io[d+1:], po[d:-1])\\n\\n node = TreeNode(val, left, right)\\n return node\\n \\n return dfs(inorder, postorder)\",\n \"memory\": \"88000\"\n },\n {\n \"code\": \"from collections import deque\\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n def build(inorder,postorder):\\n if len(inorder) == 0:\\n return None\\n\\n rootValue = postorder[-1]\\n i = inorder.index(rootValue)\\n left = build(inorder[:i], postorder[:i])\\n right = build(inorder[i+1:], postorder[i:-1])\\n return TreeNode(rootValue,left,right)\\n\\n return build(inorder,postorder) \\n \\n\",\n \"memory\": \"88100\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n root = postorder[-1]\\n n = len(inorder)\\n if n == 1:\\n return TreeNode(\\n val=root\\n )\\n for i in range(n):\\n if inorder[i] == root:\\n root_index = i\\n break\\n right_len = n - root_index - 1\\n left_len = root_index\\n # print(postorder[left_len:right_len + left_len])\\n # print(postorder[:left_len])\\n return TreeNode(\\n val=root,\\n left=self.buildTree(inorder[:root_index], postorder[:left_len]),\\n right=self.buildTree(inorder[root_index + 1:], postorder[left_len:right_len + left_len])\\n )\",\n \"memory\": \"88200\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n root_value = postorder[-1]\\n root = TreeNode(root_value)\\n idx = inorder.index(root_value)\\n root.left = self.buildTree(inorder[:idx], postorder[:idx])\\n root.right = self.buildTree(inorder[idx+1:], postorder[idx:-1])\\n return root\",\n \"memory\": \"88200\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return None\\n\\n cur_root_val = postorder[-1]\\n root = TreeNode(cur_root_val)\\n index = inorder.index(cur_root_val)\\n\\n root.left = self.buildTree(inorder[:index], postorder[:index])\\n root.right = self.buildTree(inorder[index+1:], postorder[index:-1]) # postorder[index:-1] 表示 从 index开始 到 倒数第二个元素, 所以是 postorder[index: -1]\\n return root\",\n \"memory\": \"88300\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder or not postorder:\\n return\\n # print(inorder, postorder)\\n root = TreeNode(postorder[-1])\\n mid = inorder.index(postorder[-1])\\n \\n root.right = self.buildTree(inorder[mid+1:], postorder[mid:-1])\\n root.left = self.buildTree(inorder[:mid], postorder[:mid])\\n \\n return root\\n\",\n \"memory\": \"88300\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if not inorder:\\n return None\\n root = postorder[-1]\\n n = len(inorder)\\n if n == 1:\\n return TreeNode(\\n val=root\\n )\\n for i in range(n):\\n if inorder[i] == root:\\n root_index = i\\n break\\n right_len = n - root_index - 1\\n left_len = root_index\\n # print(postorder[left_len:right_len + left_len])\\n # print(postorder[:left_len])\\n return TreeNode(\\n val=root,\\n left=self.buildTree(inorder[:root_index], postorder[:left_len]),\\n right=self.buildTree(inorder[root_index + 1:], postorder[left_len:right_len + left_len])\\n )\",\n \"memory\": \"88400\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n \\n if not inorder or not postorder:\\n return None\\n\\n current = TreeNode()\\n current.val = postorder[-1]\\n\\n current_idx = inorder.index(current.val)\\n current.left = self.buildTree(inorder[:current_idx], postorder[:current_idx])\\n current.right = self.buildTree(inorder[current_idx+1:], postorder[current_idx:-1])\\n\\n return current\",\n \"memory\": \"88400\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n\\n if not inorder and not postorder:\\n return None\\n\\n root = postorder[-1]\\n root_index = inorder.index(root)\\n\\n node = TreeNode(val=root)\\n left_length = len(inorder[:root_index])\\n\\n node.left = self.buildTree(inorder[:root_index], postorder[:left_length])\\n node.right = self.buildTree(inorder[root_index+1:], postorder[left_length:-1])\\n return node\\n \",\n \"memory\": \"88500\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\ninorder = Left Root Right\\npostorder = Left Right Root\\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n return self.helper(inorder, postorder)\\n\\n def helper(self, inorder, postorder):\\n if not postorder:\\n return None\\n\\n root_index = -1\\n root_val = postorder[-1]\\n root_node = TreeNode(val=root_val)\\n n = len(inorder)\\n # left inorder traversal\\n for i, node in enumerate(inorder):\\n if node == root_val:\\n root_index = i\\n \\n left_tree = self.helper(inorder[0:root_index], postorder[0:root_index])\\n right_tree = self.helper(inorder[root_index + 1:], postorder[root_index:n - 1])\\n root_node.left = left_tree\\n root_node.right = right_tree\\n return root_node\\n\\n\",\n \"memory\": \"88600\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n if inorder == []:\\n return None\\n \\t\\n root = postorder[-1]\\n root_index = inorder.index(root)\\n left_inorder, right_inorder = inorder[:root_index], inorder[root_index+1:]\\n left_length = len(left_inorder)\\n left_postorder, right_postorder = postorder[:left_length], postorder[left_length:-1]\\n\\n return TreeNode(root, self.buildTree(left_inorder, left_postorder), self.buildTree(right_inorder, right_postorder))\",\n \"memory\": \"88700\"\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 buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\\n n=len(postorder)\\n if n==0:\\n return None\\n root = TreeNode(postorder[n-1])\\n if n==1:\\n return root\\n for i in range(n):\\n if inorder[i]==root.val:\\n index = i\\n break\\n leftInOrder = inorder[:index]\\n rightInOrder = inorder[index+1:n]\\n leftPostOrder = postorder[:len(leftInOrder)]\\n rightPostOrder = postorder[len(leftPostOrder):n-1]\\n # print(len(rightPostOrder))\\n root.left=self.buildTree(leftInOrder,leftPostOrder)\\n root.right=self.buildTree(rightInOrder,rightPostOrder)\\n return root\",\n \"memory\": \"88700\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":69,"string":"69"}}},{"rowIdx":160,"cells":{"question_id":{"kind":"number","value":107,"string":"107"},"name":{"kind":"string","value":"binary-tree-level-order-traversal-ii"},"content":{"kind":"string","value":"<p>Given the <code>root</code> of a binary tree, return <em>the bottom-up level order traversal of its nodes' values</em>. (i.e., from left to right, level by level from leaf to root).</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/02/19/tree1.jpg\" style=\"width: 277px; height: 302px;\" />\n<pre>\n<strong>Input:</strong> root = [3,9,20,null,null,15,7]\n<strong>Output:</strong> [[15,7],[9,20],[3]]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> root = [1]\n<strong>Output:</strong> [[1]]\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> root = []\n<strong>Output:</strong> []\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>[0, 2000]</code>.</li>\n\t<li><code>-1000 <= Node.val <= 1000</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":64.30038721282986,"string":"64.300387"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["tree","breadth-first-search","binary-tree"],"string":"[\n \"tree\",\n \"breadth-first-search\",\n \"binary-tree\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16\", 0.0306], [\"17\", 0.0306], [\"19\", 0.1528], [\"21\", 0.0917], [\"22\", 0.2444], [\"23\", 0.2139], [\"24\", 0.4888], [\"25\", 0.4583], [\"26\", 0.6416], [\"27\", 1.711], [\"28\", 1.4971], [\"29\", 1.6804], [\"30\", 2.2915], [\"31\", 4.4913], [\"32\", 5.4079], [\"33\", 4.6135], [\"34\", 3.9413], [\"35\", 9.502], [\"36\", 7.3938], [\"37\", 6.1717], [\"38\", 5.3773], [\"39\", 8.8909], [\"40\", 7.3022], [\"41\", 5.7134], [\"42\", 4.7968], [\"43\", 5.2246], [\"44\", 3.9108]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16300\", 0.0306], [\"16400\", 0.0306], [\"16500\", 0.3972], [\"16600\", 7.6077], [\"16700\", 28.1393], [\"16800\", 48.3654]]}"},"rt_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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n\n visit = []\n\n def level_order_bottom(node, l):\n\n if node is None:\n return\n\n if l >= len(visit):\n visit.insert(0, [node.val])\n else:\n visit[-(l + 1)].append(node.val)\n\n level_order_bottom(node.left, l + 1)\n level_order_bottom(node.right, l + 1)\n\n level_order_bottom(root, 0)\n\n return visit\n","runtime":"16"},{"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n self.arr = []\n self.len = 0\n self.Idk_(root, 0)\n\n return self.arr[::-1]\n\n def Idk_(self, root, lvl):\n if not root: return\n\n if lvl == self.len:\n self.arr.append([])\n self.len += 1\n self.arr[lvl].append(root.val)\n\n self.Idk_(root.left, lvl + 1)\n self.Idk_(root.right, lvl + 1)","runtime":"17"},{"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n result = collections.deque()\n if root is None:\n return result\n queue = collections.deque([root])\n while len(queue) != 0:\n currentLength = len(queue)\n currentResult = []\n for currentIndex in range(0, currentLength):\n currentNode = queue.popleft()\n currentResult.append(currentNode.val)\n if currentNode.left is not None:\n queue.append(currentNode.left)\n if currentNode.right is not None:\n queue.append(currentNode.right)\n result.appendleft(currentResult)\n return result","runtime":"19"},{"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n ans = []\n def recurse(level, root):\n if root == None:\n return\n\n if len(ans) <= level:\n ans.append([root.val])\n else:\n ans[level] += [root.val]\n \n recurse(level + 1, root.left)\n recurse(level + 1, root.right)\n \n recurse(0, root)\n return ans[::-1]\n \n","runtime":"21"},{"code":"class Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n\n levels = []\n queue = deque([root])\n\n while queue:\n level = []\n for _ in range(len(queue)):\n node = queue.popleft()\n\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n\n level.append(node.val)\n\n levels.append(level)\n\n return levels[::-1]","runtime":"22"},{"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n res = []\n if not root:\n return []\n def traverse(root, depth):\n if len(res) - 1 < depth:\n res.append([root.val])\n else:\n res[depth].extend([root.val])\n if root.left:\n traverse(root.left, depth + 1)\n if root.right:\n traverse(root.right, depth + 1)\n traverse(root, 0)\n res.reverse()\n return res","runtime":"23"},{"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n temp = []\n q = deque()\n q.append(root)\n while q:\n temp.append([])\n for n in range(len(q)):\n node = q.popleft()\n if not node: continue\n temp[-1].append(node.val)\n q.append(node.left)\n q.append(node.right)\n if not temp[-1]: temp.pop()\n return reversed(temp)\n ","runtime":"24"},{"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\nfrom collections import deque \nclass Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root == None:\n return []\n q = deque()\n q.append(root)\n q.append(None)\n visited = []\n vect = []\n while q:\n curr = q.popleft()\n if (curr == None):\n visited.append(vect)\n if q:\n vect = []\n q.append(None)\n else:\n vect.append(curr.val)\n if (curr.left is not None):\n q.append(curr.left)\n if (curr.right is not None):\n q.append(curr.right)\n visited = visited[::-1]\n print(visited)\n return visited","runtime":"25"},{"code":"class Solution:\n\n def levelOrderBottom(self, root: TreeNode | None) -> list[list[int]]:\n\n if not root:\n\n return []\n\n ans = []\n\n q = collections.deque([root])\n\n while q:\n\n currLevel = []\n\n for _ in range(len(q)):\n\n node = q.popleft()\n\n currLevel.append(node.val)\n\n if node.left:\n\n q.append(node.left)\n\n if node.right:\n\n q.append(node.right)\n\n ans.append(currLevel)\n\n return ans[::-1]","runtime":"26"},{"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\nfrom collections import deque\n\nclass Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n\n q = deque([root])\n levels = []\n\n while q:\n level = []\n for _ in range(len(q)):\n node = q.popleft()\n level.append(node.val)\n if node.left is not None:\n q.append(node.left)\n if node.right is not None:\n q.append(node.right)\n\n levels.append(level)\n return levels[::-1]","runtime":"26"},{"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n res = []\n if root is None:\n return res\n q = deque()\n q.append(root)\n while q:\n level = []\n size= len(q)\n for i in range(size):\n node = q.popleft()\n level.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n res.append(level)\n return res[::-1]","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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n ans = []\n if root is None:\n return ans\n q = deque([root])\n while q:\n t = []\n for _ in range(len(q)):\n node = q.popleft()\n t.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n ans.append(t)\n return ans[::-1]","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\nclass Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n q, res = deque(), deque()\n q.append(root)\n while q:\n lenlevel = len(q)\n level = []\n for _ in range(lenlevel):\n node = q.popleft()\n if node:\n level.append(node.val)\n q.append(node.left)\n q.append(node.right)\n if level != []:\n res.appendleft(level)\n return res","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\nclass Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return\n\n queue = deque([root])\n ans = []\n\n while queue:\n n = len(queue)\n curr = []\n\n for _ in range(n):\n node = queue.popleft()\n curr.append(node.val)\n\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n ans.append(curr)\n \n return reversed(ans)\n","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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n \n queue = deque([root])\n result = []\n \n while queue:\n level_size = len(queue)\n level = []\n \n for _ in range(level_size):\n node = queue.popleft()\n level.append(node.val)\n \n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n \n result.append(level)\n \n return result[::-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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n \n \n\n res = []\n\n queue = deque()\n\n queue.append(root)\n\n while queue:\n\n level = []\n\n n = len(queue)\n\n for i in range(n):\n \n node = queue.popleft()\n\n if node:\n \n level.append(node.val)\n queue.append(node.left)\n queue.append(node.right)\n\n if level:\n res.append(level)\n\n return reversed(res)\n ","runtime":"30"},{"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\nclass Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n\n if not root:\n return []\n\n queue = deque([])\n queue.append(root)\n solutions = deque([])\n\n while queue:\n level_size = len(queue)\n level = []\n for _ in range(level_size):\n node = queue.popleft()\n \n level.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n\n solutions.appendleft(level)\n \n return solutions\n \n\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 height(self,root):\n if(not root):\n return 0\n return 1+max(self.height(root.left),self.height(root.right))\n \n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n visit=[]\n def levelOrder(root,l):\n if(not root):\n return None\n elif(l>=len(visit)):\n visit.insert(0,[root.val])\n else:\n visit[-(l+1)].append(root.val)\n levelOrder(root.left,l+1)\n levelOrder(root.right,l+1)\n levelOrder(root,0)\n return visit\n\n\n # self.theight=self.height(root)\n # def traversal(root,level,l):\n # if(root):\n # if level==1:\n # l.append(root.val)\n # else:\n # traversal(root.left,level-1,l)\n # traversal(root.right,level-1,l)\n # return l\n \n # self.l=[] \n # for i in range(1,self.theight+1):\n # self.l.append(traversal(root,i,[]))\n # self.l.reverse()\n # return self.l\n \n\n # self.l.append()\n # print(self.l)\n \n ","runtime":"31"},{"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\nclass Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n\n if not root:\n return []\n\n queue = deque([root])\n solutions = []\n\n while queue:\n level = []\n level_size = len(queue)\n\n for _ in range(level_size):\n node = queue.popleft()\n level.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n\n\n solutions.append(level)\n\n return solutions[::-1]\n\n \n\n\n\n ","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\nfrom collections import deque\n\nclass Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n # BFS\n queue = [[root]] # []\n bottom_up_level_order_traversal = deque() # [[15, 7], [9, 20], [3]]\n while queue:\n # pop an item\n curr_level = queue.pop() # [15, 7]\n bottom_up_level_order_traversal.appendleft([node.val for node in curr_level])\n level = []\n # get its child nodes (in the level) if exist\n for node in curr_level:\n if node.left:\n level.append(node.left)\n if node.right:\n level.append(node.right)\n # append to queue\n if level:\n queue.append(level)\n return list(bottom_up_level_order_traversal)\n ","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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if(root == None):\n return []\n q = [root]\n res = []\n while len(q) > 0:\n\n l = len(q)\n n = l\n newl = []\n \n while l > 0:\n l -= 1\n u = q.pop(0)\n newl.append(u.val)\n \n if(u.left != None):\n q.append(u.left)\n if(u.right != None):\n q.append(u.right)\n\n res.append(newl)\n \n res.reverse()\n\n return res","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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n \n current_unvisited = [root]\n next_unvisited = []\n out = []\n current_out = []\n while current_unvisited:\n current_node = current_unvisited[0]\n current_unvisited.remove(current_node)\n current_out.append(current_node.val)\n if current_node.left:\n next_unvisited.append(current_node.left)\n if current_node.right:\n next_unvisited.append(current_node.right)\n if not current_unvisited:\n out.append(current_out)\n current_out = []\n current_unvisited, next_unvisited = next_unvisited, []\n\n return reversed(out)","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\nfrom collections import deque\n\nclass Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n q = deque([root])\n if not root:\n return []\n result = []\n while q:\n level = []\n for _ in range(len(q)):\n node = q.popleft()\n if node:\n level.append(node.val)\n\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n result.append(level)\n result.reverse()\n return result\n \n","runtime":"34"},{"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n res = []\n if root is None:\n return res\n q = deque()\n q.append(root)\n while q:\n level = []\n size= len(q)\n for i in range(size):\n node = q.popleft()\n level.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n res.append(level)\n res.reverse()\n return res","runtime":"34"},{"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n visit=[]\n def levelOrder(root,l):\n if(not root):\n return None\n elif(l>=len(visit)):\n visit.insert(0,[root.val])\n else:\n visit[-(l+1)].append(root.val)\n levelOrder(root.left,l+1)\n levelOrder(root.right,l+1)\n levelOrder(root,0)\n return visit\n\n\n # self.theight=self.height(root)\n # def traversal(root,level,l):\n # if(root):\n # if level==1:\n # l.append(root.val)\n # else:\n # traversal(root.left,level-1,l)\n # traversal(root.right,level-1,l)\n # return l\n \n # self.l=[] \n # for i in range(1,self.theight+1):\n # self.l.append(traversal(root,i,[]))\n # self.l.reverse()\n # return self.l\n \n\n # self.l.append()\n # print(self.l)\n \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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root: return\n values = []\n q = deque()\n q.append(root)\n values.append([root.val])\n while q:\n val = []\n for i in range(len(q)):\n node = q.popleft()\n\n \n if node.left:\n q.append(node.left)\n val.append(node.left.val)\n if node.right:\n q.append(node.right)\n val.append(node.right.val)\n if val: values.append(val)\n \n return values[::-1]\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return None\n queue = collections.deque()\n queue.append(root)\n result = []\n while queue:\n level = []\n for i in range(len(queue)):\n cur = queue.popleft()\n level.append(cur.val)\n if cur.left:\n queue.append(cur.left)\n if cur.right:\n queue.append(cur.right)\n result.append(level)\n result.reverse()\n return result","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\nfrom collections import deque\nclass Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n \n que = deque([root])\n result = []\n\n while que:\n levels = []\n for _ in range(len(que)):\n cur = que.popleft()\n levels.append(cur.val)\n if cur.left:\n que.append(cur.left)\n if cur.right:\n que.append(cur.right)\n result.append(levels)\n \n return result[::-1]\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n res, q = [], deque([root] if root else [])\n\n while q:\n level = []\n for i in range(len(q)):\n node = q.popleft()\n level.append(node.val)\n if node.left: q.append(node.left) \n if node.right: q.append(node.right)\n if level:\n res.append(level)\n return 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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root is None:\n return []\n act_level = [root]\n rv = [[root.val]]\n while True:\n next_level = []\n next_level_val = []\n for act_node in act_level:\n if act_node is not None:\n if act_node.left:\n next_level.append(act_node.left)\n next_level_val.append(act_node.left.val)\n if act_node.right:\n next_level.append(act_node.right)\n next_level_val.append(act_node.right.val)\n if not next_level:\n break\n rv.append(next_level_val)\n act_level = next_level\n return rv[::-1]\n ","runtime":"37"},{"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\nclass Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n\n if not root:\n return []\n\n queue = deque([root])\n solutions = deque([])\n\n while queue:\n level = []\n level_size = len(queue)\n\n for _ in range(level_size):\n node = queue.popleft()\n level.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n\n\n solutions.appendleft(level)\n\n return solutions\n\n \n\n\n\n ","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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n q = deque()\n q.append(root)\n res = []\n\n while q:\n level_len = len(q)\n current_level = []\n for _ in range(level_len):\n cur_node = q.popleft()\n current_level.append(cur_node.val)\n if cur_node.left:\n q.append(cur_node.left)\n if cur_node.right:\n q.append(cur_node.right)\n res.append(current_level)\n return reversed(res)\n ","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\nfrom collections import deque \nclass Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if root is None:\n return []\n queue=deque([root])\n ans=[]\n while queue:\n children=len(queue)\n levelNodes=[]\n for i in range(children):\n node=queue.popleft()\n levelNodes.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n ans.append(levelNodes)\n return ans[::-1]\n ","runtime":"41"},{"code":"from typing import List, Optional\nfrom collections import deque\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n \n result = []\n queue = deque([root])\n \n while queue:\n level_size = len(queue)\n level_nodes = []\n \n for _ in range(level_size):\n node = queue.popleft()\n level_nodes.append(node.val)\n \n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n \n result.append(level_nodes)\n \n # Reverse the result to get bottom-up level order\n return result[::-1]\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n\n queue = deque([root])\n res = []\n while queue:\n level = []\n for i in range(len(queue)):\n node = queue.popleft()\n level.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n res.append(level)\n return res[::-1]","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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n queue = collections.deque()\n res = []\n if root is None:\n return res\n queue.append(root)\n\n while queue:\n cur_res = []\n size = len(queue)\n for _ in range(size):\n node = queue.popleft()\n cur_res.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n res.append(cur_res)\n \n res.reverse()\n\n return res","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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n # do a level order, but reverse it at the end\n if not root:\n return []\n queue = deque([root])\n res = []\n while (queue):\n level = []\n for _ in range(len(queue)):\n node = queue.popleft()\n level.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n res.append(level) \n\n res.reverse()\n return res\n","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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n \n if not root: return []\n\n q = deque()\n level_nodes = []\n curr = root\n q.append(root)\n\n while q: \n curr_nodes = []\n level_size = len(q)\n for _ in range(level_size):\n node = q.popleft()\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n\n curr_nodes.append(node.val)\n\n level_nodes.append(curr_nodes)\n \n return reversed(level_nodes)","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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n visit=[]\n def levelOrder(root,l):\n if(not root):\n return None\n elif(l>=len(visit)):\n visit.insert(0,[root.val])\n else:\n visit[-(l+1)].append(root.val)\n levelOrder(root.left,l+1)\n levelOrder(root.right,l+1)\n levelOrder(root,0)\n return visit\n\n\n # self.theight=self.height(root)\n # def traversal(root,level,l):\n # if(root):\n # if level==1:\n # l.append(root.val)\n # else:\n # traversal(root.left,level-1,l)\n # traversal(root.right,level-1,l)\n # return l\n \n # self.l=[] \n # for i in range(1,self.theight+1):\n # self.l.append(traversal(root,i,[]))\n # self.l.reverse()\n # return self.l\n \n\n # self.l.append()\n # print(self.l)\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root: return\n values = []\n q = deque()\n q.append(root)\n values.append([root.val])\n while q:\n val = []\n for i in range(len(q)):\n node = q.popleft()\n\n \n if node.left:\n q.append(node.left)\n val.append(node.left.val)\n if node.right:\n q.append(node.right)\n val.append(node.right.val)\n if val: values.append(val)\n \n return values[::-1]\n","runtime":"44"}],"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n\\n visit = []\\n\\n def level_order_bottom(node, l):\\n\\n if node is None:\\n return\\n\\n if l >= len(visit):\\n visit.insert(0, [node.val])\\n else:\\n visit[-(l + 1)].append(node.val)\\n\\n level_order_bottom(node.left, l + 1)\\n level_order_bottom(node.right, l + 1)\\n\\n level_order_bottom(root, 0)\\n\\n return visit\\n\",\n \"runtime\": \"16\"\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n self.arr = []\\n self.len = 0\\n self.Idk_(root, 0)\\n\\n return self.arr[::-1]\\n\\n def Idk_(self, root, lvl):\\n if not root: return\\n\\n if lvl == self.len:\\n self.arr.append([])\\n self.len += 1\\n self.arr[lvl].append(root.val)\\n\\n self.Idk_(root.left, lvl + 1)\\n self.Idk_(root.right, lvl + 1)\",\n \"runtime\": \"17\"\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n result = collections.deque()\\n if root is None:\\n return result\\n queue = collections.deque([root])\\n while len(queue) != 0:\\n currentLength = len(queue)\\n currentResult = []\\n for currentIndex in range(0, currentLength):\\n currentNode = queue.popleft()\\n currentResult.append(currentNode.val)\\n if currentNode.left is not None:\\n queue.append(currentNode.left)\\n if currentNode.right is not None:\\n queue.append(currentNode.right)\\n result.appendleft(currentResult)\\n return result\",\n \"runtime\": \"19\"\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n ans = []\\n def recurse(level, root):\\n if root == None:\\n return\\n\\n if len(ans) <= level:\\n ans.append([root.val])\\n else:\\n ans[level] += [root.val]\\n \\n recurse(level + 1, root.left)\\n recurse(level + 1, root.right)\\n \\n recurse(0, root)\\n return ans[::-1]\\n \\n\",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n\\n levels = []\\n queue = deque([root])\\n\\n while queue:\\n level = []\\n for _ in range(len(queue)):\\n node = queue.popleft()\\n\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n\\n level.append(node.val)\\n\\n levels.append(level)\\n\\n return levels[::-1]\",\n \"runtime\": \"22\"\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res = []\\n if not root:\\n return []\\n def traverse(root, depth):\\n if len(res) - 1 < depth:\\n res.append([root.val])\\n else:\\n res[depth].extend([root.val])\\n if root.left:\\n traverse(root.left, depth + 1)\\n if root.right:\\n traverse(root.right, depth + 1)\\n traverse(root, 0)\\n res.reverse()\\n return res\",\n \"runtime\": \"23\"\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n temp = []\\n q = deque()\\n q.append(root)\\n while q:\\n temp.append([])\\n for n in range(len(q)):\\n node = q.popleft()\\n if not node: continue\\n temp[-1].append(node.val)\\n q.append(node.left)\\n q.append(node.right)\\n if not temp[-1]: temp.pop()\\n return reversed(temp)\\n \",\n \"runtime\": \"24\"\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\\nfrom collections import deque \\nclass Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root == None:\\n return []\\n q = deque()\\n q.append(root)\\n q.append(None)\\n visited = []\\n vect = []\\n while q:\\n curr = q.popleft()\\n if (curr == None):\\n visited.append(vect)\\n if q:\\n vect = []\\n q.append(None)\\n else:\\n vect.append(curr.val)\\n if (curr.left is not None):\\n q.append(curr.left)\\n if (curr.right is not None):\\n q.append(curr.right)\\n visited = visited[::-1]\\n print(visited)\\n return visited\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n\\n def levelOrderBottom(self, root: TreeNode | None) -> list[list[int]]:\\n\\n if not root:\\n\\n return []\\n\\n ans = []\\n\\n q = collections.deque([root])\\n\\n while q:\\n\\n currLevel = []\\n\\n for _ in range(len(q)):\\n\\n node = q.popleft()\\n\\n currLevel.append(node.val)\\n\\n if node.left:\\n\\n q.append(node.left)\\n\\n if node.right:\\n\\n q.append(node.right)\\n\\n ans.append(currLevel)\\n\\n return ans[::-1]\",\n \"runtime\": \"26\"\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\\nfrom collections import deque\\n\\nclass Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n\\n q = deque([root])\\n levels = []\\n\\n while q:\\n level = []\\n for _ in range(len(q)):\\n node = q.popleft()\\n level.append(node.val)\\n if node.left is not None:\\n q.append(node.left)\\n if node.right is not None:\\n q.append(node.right)\\n\\n levels.append(level)\\n return levels[::-1]\",\n \"runtime\": \"26\"\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res = []\\n if root is None:\\n return res\\n q = deque()\\n q.append(root)\\n while q:\\n level = []\\n size= len(q)\\n for i in range(size):\\n node = q.popleft()\\n level.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n res.append(level)\\n return res[::-1]\",\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n ans = []\\n if root is None:\\n return ans\\n q = deque([root])\\n while q:\\n t = []\\n for _ in range(len(q)):\\n node = q.popleft()\\n t.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n ans.append(t)\\n return ans[::-1]\",\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\\nclass Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n q, res = deque(), deque()\\n q.append(root)\\n while q:\\n lenlevel = len(q)\\n level = []\\n for _ in range(lenlevel):\\n node = q.popleft()\\n if node:\\n level.append(node.val)\\n q.append(node.left)\\n q.append(node.right)\\n if level != []:\\n res.appendleft(level)\\n return res\",\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\\nclass Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return\\n\\n queue = deque([root])\\n ans = []\\n\\n while queue:\\n n = len(queue)\\n curr = []\\n\\n for _ in range(n):\\n node = queue.popleft()\\n curr.append(node.val)\\n\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n ans.append(curr)\\n \\n return reversed(ans)\\n\",\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n \\n queue = deque([root])\\n result = []\\n \\n while queue:\\n level_size = len(queue)\\n level = []\\n \\n for _ in range(level_size):\\n node = queue.popleft()\\n level.append(node.val)\\n \\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n \\n result.append(level)\\n \\n return result[::-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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n \\n \\n\\n res = []\\n\\n queue = deque()\\n\\n queue.append(root)\\n\\n while queue:\\n\\n level = []\\n\\n n = len(queue)\\n\\n for i in range(n):\\n \\n node = queue.popleft()\\n\\n if node:\\n \\n level.append(node.val)\\n queue.append(node.left)\\n queue.append(node.right)\\n\\n if level:\\n res.append(level)\\n\\n return reversed(res)\\n \",\n \"runtime\": \"30\"\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\\nclass Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n\\n if not root:\\n return []\\n\\n queue = deque([])\\n queue.append(root)\\n solutions = deque([])\\n\\n while queue:\\n level_size = len(queue)\\n level = []\\n for _ in range(level_size):\\n node = queue.popleft()\\n \\n level.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n\\n solutions.appendleft(level)\\n \\n return solutions\\n \\n\\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 height(self,root):\\n if(not root):\\n return 0\\n return 1+max(self.height(root.left),self.height(root.right))\\n \\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n visit=[]\\n def levelOrder(root,l):\\n if(not root):\\n return None\\n elif(l>=len(visit)):\\n visit.insert(0,[root.val])\\n else:\\n visit[-(l+1)].append(root.val)\\n levelOrder(root.left,l+1)\\n levelOrder(root.right,l+1)\\n levelOrder(root,0)\\n return visit\\n\\n\\n # self.theight=self.height(root)\\n # def traversal(root,level,l):\\n # if(root):\\n # if level==1:\\n # l.append(root.val)\\n # else:\\n # traversal(root.left,level-1,l)\\n # traversal(root.right,level-1,l)\\n # return l\\n \\n # self.l=[] \\n # for i in range(1,self.theight+1):\\n # self.l.append(traversal(root,i,[]))\\n # self.l.reverse()\\n # return self.l\\n \\n\\n # self.l.append()\\n # print(self.l)\\n \\n \",\n \"runtime\": \"31\"\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\\nclass Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n\\n if not root:\\n return []\\n\\n queue = deque([root])\\n solutions = []\\n\\n while queue:\\n level = []\\n level_size = len(queue)\\n\\n for _ in range(level_size):\\n node = queue.popleft()\\n level.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n\\n\\n solutions.append(level)\\n\\n return solutions[::-1]\\n\\n \\n\\n\\n\\n \",\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\\nfrom collections import deque\\n\\nclass Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n # BFS\\n queue = [[root]] # []\\n bottom_up_level_order_traversal = deque() # [[15, 7], [9, 20], [3]]\\n while queue:\\n # pop an item\\n curr_level = queue.pop() # [15, 7]\\n bottom_up_level_order_traversal.appendleft([node.val for node in curr_level])\\n level = []\\n # get its child nodes (in the level) if exist\\n for node in curr_level:\\n if node.left:\\n level.append(node.left)\\n if node.right:\\n level.append(node.right)\\n # append to queue\\n if level:\\n queue.append(level)\\n return list(bottom_up_level_order_traversal)\\n \",\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if(root == None):\\n return []\\n q = [root]\\n res = []\\n while len(q) > 0:\\n\\n l = len(q)\\n n = l\\n newl = []\\n \\n while l > 0:\\n l -= 1\\n u = q.pop(0)\\n newl.append(u.val)\\n \\n if(u.left != None):\\n q.append(u.left)\\n if(u.right != None):\\n q.append(u.right)\\n\\n res.append(newl)\\n \\n res.reverse()\\n\\n return res\",\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n \\n current_unvisited = [root]\\n next_unvisited = []\\n out = []\\n current_out = []\\n while current_unvisited:\\n current_node = current_unvisited[0]\\n current_unvisited.remove(current_node)\\n current_out.append(current_node.val)\\n if current_node.left:\\n next_unvisited.append(current_node.left)\\n if current_node.right:\\n next_unvisited.append(current_node.right)\\n if not current_unvisited:\\n out.append(current_out)\\n current_out = []\\n current_unvisited, next_unvisited = next_unvisited, []\\n\\n return reversed(out)\",\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\\nfrom collections import deque\\n\\nclass Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n q = deque([root])\\n if not root:\\n return []\\n result = []\\n while q:\\n level = []\\n for _ in range(len(q)):\\n node = q.popleft()\\n if node:\\n level.append(node.val)\\n\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n result.append(level)\\n result.reverse()\\n return result\\n \\n\",\n \"runtime\": \"34\"\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res = []\\n if root is None:\\n return res\\n q = deque()\\n q.append(root)\\n while q:\\n level = []\\n size= len(q)\\n for i in range(size):\\n node = q.popleft()\\n level.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n res.append(level)\\n res.reverse()\\n return res\",\n \"runtime\": \"34\"\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n visit=[]\\n def levelOrder(root,l):\\n if(not root):\\n return None\\n elif(l>=len(visit)):\\n visit.insert(0,[root.val])\\n else:\\n visit[-(l+1)].append(root.val)\\n levelOrder(root.left,l+1)\\n levelOrder(root.right,l+1)\\n levelOrder(root,0)\\n return visit\\n\\n\\n # self.theight=self.height(root)\\n # def traversal(root,level,l):\\n # if(root):\\n # if level==1:\\n # l.append(root.val)\\n # else:\\n # traversal(root.left,level-1,l)\\n # traversal(root.right,level-1,l)\\n # return l\\n \\n # self.l=[] \\n # for i in range(1,self.theight+1):\\n # self.l.append(traversal(root,i,[]))\\n # self.l.reverse()\\n # return self.l\\n \\n\\n # self.l.append()\\n # print(self.l)\\n \\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root: return\\n values = []\\n q = deque()\\n q.append(root)\\n values.append([root.val])\\n while q:\\n val = []\\n for i in range(len(q)):\\n node = q.popleft()\\n\\n \\n if node.left:\\n q.append(node.left)\\n val.append(node.left.val)\\n if node.right:\\n q.append(node.right)\\n val.append(node.right.val)\\n if val: values.append(val)\\n \\n return values[::-1]\\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return None\\n queue = collections.deque()\\n queue.append(root)\\n result = []\\n while queue:\\n level = []\\n for i in range(len(queue)):\\n cur = queue.popleft()\\n level.append(cur.val)\\n if cur.left:\\n queue.append(cur.left)\\n if cur.right:\\n queue.append(cur.right)\\n result.append(level)\\n result.reverse()\\n return result\",\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\\nfrom collections import deque\\nclass Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n \\n que = deque([root])\\n result = []\\n\\n while que:\\n levels = []\\n for _ in range(len(que)):\\n cur = que.popleft()\\n levels.append(cur.val)\\n if cur.left:\\n que.append(cur.left)\\n if cur.right:\\n que.append(cur.right)\\n result.append(levels)\\n \\n return result[::-1]\\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res, q = [], deque([root] if root else [])\\n\\n while q:\\n level = []\\n for i in range(len(q)):\\n node = q.popleft()\\n level.append(node.val)\\n if node.left: q.append(node.left) \\n if node.right: q.append(node.right)\\n if level:\\n res.append(level)\\n return 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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root is None:\\n return []\\n act_level = [root]\\n rv = [[root.val]]\\n while True:\\n next_level = []\\n next_level_val = []\\n for act_node in act_level:\\n if act_node is not None:\\n if act_node.left:\\n next_level.append(act_node.left)\\n next_level_val.append(act_node.left.val)\\n if act_node.right:\\n next_level.append(act_node.right)\\n next_level_val.append(act_node.right.val)\\n if not next_level:\\n break\\n rv.append(next_level_val)\\n act_level = next_level\\n return rv[::-1]\\n \",\n \"runtime\": \"37\"\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\\nclass Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n\\n if not root:\\n return []\\n\\n queue = deque([root])\\n solutions = deque([])\\n\\n while queue:\\n level = []\\n level_size = len(queue)\\n\\n for _ in range(level_size):\\n node = queue.popleft()\\n level.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n\\n\\n solutions.appendleft(level)\\n\\n return solutions\\n\\n \\n\\n\\n\\n \",\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n q = deque()\\n q.append(root)\\n res = []\\n\\n while q:\\n level_len = len(q)\\n current_level = []\\n for _ in range(level_len):\\n cur_node = q.popleft()\\n current_level.append(cur_node.val)\\n if cur_node.left:\\n q.append(cur_node.left)\\n if cur_node.right:\\n q.append(cur_node.right)\\n res.append(current_level)\\n return reversed(res)\\n \",\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\\nfrom collections import deque \\nclass Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if root is None:\\n return []\\n queue=deque([root])\\n ans=[]\\n while queue:\\n children=len(queue)\\n levelNodes=[]\\n for i in range(children):\\n node=queue.popleft()\\n levelNodes.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n ans.append(levelNodes)\\n return ans[::-1]\\n \",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"from typing import List, Optional\\nfrom collections import deque\\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n \\n result = []\\n queue = deque([root])\\n \\n while queue:\\n level_size = len(queue)\\n level_nodes = []\\n \\n for _ in range(level_size):\\n node = queue.popleft()\\n level_nodes.append(node.val)\\n \\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n \\n result.append(level_nodes)\\n \\n # Reverse the result to get bottom-up level order\\n return result[::-1]\\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n\\n queue = deque([root])\\n res = []\\n while queue:\\n level = []\\n for i in range(len(queue)):\\n node = queue.popleft()\\n level.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n res.append(level)\\n return res[::-1]\",\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n queue = collections.deque()\\n res = []\\n if root is None:\\n return res\\n queue.append(root)\\n\\n while queue:\\n cur_res = []\\n size = len(queue)\\n for _ in range(size):\\n node = queue.popleft()\\n cur_res.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n res.append(cur_res)\\n \\n res.reverse()\\n\\n return res\",\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n # do a level order, but reverse it at the end\\n if not root:\\n return []\\n queue = deque([root])\\n res = []\\n while (queue):\\n level = []\\n for _ in range(len(queue)):\\n node = queue.popleft()\\n level.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n res.append(level) \\n\\n res.reverse()\\n return res\\n\",\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n \\n if not root: return []\\n\\n q = deque()\\n level_nodes = []\\n curr = root\\n q.append(root)\\n\\n while q: \\n curr_nodes = []\\n level_size = len(q)\\n for _ in range(level_size):\\n node = q.popleft()\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n\\n curr_nodes.append(node.val)\\n\\n level_nodes.append(curr_nodes)\\n \\n return reversed(level_nodes)\",\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n visit=[]\\n def levelOrder(root,l):\\n if(not root):\\n return None\\n elif(l>=len(visit)):\\n visit.insert(0,[root.val])\\n else:\\n visit[-(l+1)].append(root.val)\\n levelOrder(root.left,l+1)\\n levelOrder(root.right,l+1)\\n levelOrder(root,0)\\n return visit\\n\\n\\n # self.theight=self.height(root)\\n # def traversal(root,level,l):\\n # if(root):\\n # if level==1:\\n # l.append(root.val)\\n # else:\\n # traversal(root.left,level-1,l)\\n # traversal(root.right,level-1,l)\\n # return l\\n \\n # self.l=[] \\n # for i in range(1,self.theight+1):\\n # self.l.append(traversal(root,i,[]))\\n # self.l.reverse()\\n # return self.l\\n \\n\\n # self.l.append()\\n # print(self.l)\\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root: return\\n values = []\\n q = deque()\\n q.append(root)\\n values.append([root.val])\\n while q:\\n val = []\\n for i in range(len(q)):\\n node = q.popleft()\\n\\n \\n if node.left:\\n q.append(node.left)\\n val.append(node.left.val)\\n if node.right:\\n q.append(node.right)\\n val.append(node.right.val)\\n if val: values.append(val)\\n \\n return values[::-1]\\n\",\n \"runtime\": \"44\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":40,"string":"40"},"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n q = deque([root])\n res = []\n while q:\n sub = []\n for _ in range(len(q)):\n curr = q.popleft()\n if curr.left:\n q.append(curr.left)\n if curr.right:\n q.append(curr.right)\n sub.append(curr.val)\n if sub:\n res.append(sub)\n return res[::-1]\n \n\n\n ","memory":"16300"},{"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n arr = []\n q = deque([(root, 0)])\n while q:\n curr, level = q.popleft()\n if curr:\n if len(arr) < level+1: arr.insert(0, [])\n arr[-1-level].append(curr.val)\n if curr.left: q.append((curr.left, level+1))\n if curr.right: q.append((curr.right, level+1))\n return arr","memory":"16400"},{"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n q = deque([root])\n levels = []\n while q:\n level = []\n for _ in range(len(q)):\n node = q.popleft()\n level.append(node.val)\n if node.left:\n q.append(node.left)\n if node.right:\n q.append(node.right)\n levels.append(level)\n \n levels.reverse()\n return levels","memory":"16500"},{"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n res, q = [], deque([root] if root else [])\n\n while q:\n level = []\n for i in range(len(q)):\n node = q.popleft()\n level.append(node.val)\n if node.left: q.append(node.left) \n if node.right: q.append(node.right)\n if level:\n res.append(level)\n return res[::-1]\n","memory":"16600"},{"code":"class Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if not root:\n return []\n\n levels = []\n queue = deque([root])\n\n while queue:\n level = []\n for _ in range(len(queue)):\n node = queue.popleft()\n\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n\n level.append(node.val)\n\n levels.append(level)\n\n return levels[::-1]","memory":"16600"},{"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\nclass Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n\n if not root:\n return []\n\n queue = deque([])\n queue.append(root)\n solutions = deque([])\n\n while queue:\n level_size = len(queue)\n level = []\n for _ in range(level_size):\n node = queue.popleft()\n \n level.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n\n solutions.appendleft(level)\n \n return solutions\n \n\n\n\n ","memory":"16700"},{"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\nclass Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n\n if not root:\n return []\n\n queue = deque([root])\n solutions = deque([])\n\n while queue:\n level = []\n level_size = len(queue)\n\n for _ in range(level_size):\n node = queue.popleft()\n level.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n\n\n solutions.appendleft(level)\n\n return solutions\n\n \n\n\n\n ","memory":"16700"},{"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\nclass Solution:\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n\n if not root:\n return []\n\n queue = deque([root])\n solutions = []\n\n while queue:\n level = []\n level_size = len(queue)\n\n for _ in range(level_size):\n node = queue.popleft()\n level.append(node.val)\n if node.left:\n queue.append(node.left)\n if node.right:\n queue.append(node.right)\n\n\n solutions.append(level)\n\n return solutions[::-1]\n\n \n\n\n\n ","memory":"16800"},{"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\n if(root == None):\n return []\n q = [root]\n res = []\n while len(q) > 0:\n\n l = len(q)\n n = l\n newl = []\n \n while l > 0:\n l -= 1\n u = q.pop(0)\n newl.append(u.val)\n \n if(u.left != None):\n q.append(u.left)\n if(u.right != None):\n q.append(u.right)\n\n res.append(newl)\n \n res.reverse()\n\n return res","memory":"16800"}],"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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n q = deque([root])\\n res = []\\n while q:\\n sub = []\\n for _ in range(len(q)):\\n curr = q.popleft()\\n if curr.left:\\n q.append(curr.left)\\n if curr.right:\\n q.append(curr.right)\\n sub.append(curr.val)\\n if sub:\\n res.append(sub)\\n return res[::-1]\\n \\n\\n\\n \",\n \"memory\": \"16300\"\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n arr = []\\n q = deque([(root, 0)])\\n while q:\\n curr, level = q.popleft()\\n if curr:\\n if len(arr) < level+1: arr.insert(0, [])\\n arr[-1-level].append(curr.val)\\n if curr.left: q.append((curr.left, level+1))\\n if curr.right: q.append((curr.right, level+1))\\n return arr\",\n \"memory\": \"16400\"\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n q = deque([root])\\n levels = []\\n while q:\\n level = []\\n for _ in range(len(q)):\\n node = q.popleft()\\n level.append(node.val)\\n if node.left:\\n q.append(node.left)\\n if node.right:\\n q.append(node.right)\\n levels.append(level)\\n \\n levels.reverse()\\n return levels\",\n \"memory\": \"16500\"\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n res, q = [], deque([root] if root else [])\\n\\n while q:\\n level = []\\n for i in range(len(q)):\\n node = q.popleft()\\n level.append(node.val)\\n if node.left: q.append(node.left) \\n if node.right: q.append(node.right)\\n if level:\\n res.append(level)\\n return res[::-1]\\n\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if not root:\\n return []\\n\\n levels = []\\n queue = deque([root])\\n\\n while queue:\\n level = []\\n for _ in range(len(queue)):\\n node = queue.popleft()\\n\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n\\n level.append(node.val)\\n\\n levels.append(level)\\n\\n return levels[::-1]\",\n \"memory\": \"16600\"\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\\nclass Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n\\n if not root:\\n return []\\n\\n queue = deque([])\\n queue.append(root)\\n solutions = deque([])\\n\\n while queue:\\n level_size = len(queue)\\n level = []\\n for _ in range(level_size):\\n node = queue.popleft()\\n \\n level.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n\\n solutions.appendleft(level)\\n \\n return solutions\\n \\n\\n\\n\\n \",\n \"memory\": \"16700\"\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\\nclass Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n\\n if not root:\\n return []\\n\\n queue = deque([root])\\n solutions = deque([])\\n\\n while queue:\\n level = []\\n level_size = len(queue)\\n\\n for _ in range(level_size):\\n node = queue.popleft()\\n level.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n\\n\\n solutions.appendleft(level)\\n\\n return solutions\\n\\n \\n\\n\\n\\n \",\n \"memory\": \"16700\"\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\\nclass Solution:\\n def levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n\\n if not root:\\n return []\\n\\n queue = deque([root])\\n solutions = []\\n\\n while queue:\\n level = []\\n level_size = len(queue)\\n\\n for _ in range(level_size):\\n node = queue.popleft()\\n level.append(node.val)\\n if node.left:\\n queue.append(node.left)\\n if node.right:\\n queue.append(node.right)\\n\\n\\n solutions.append(level)\\n\\n return solutions[::-1]\\n\\n \\n\\n\\n\\n \",\n \"memory\": \"16800\"\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 levelOrderBottom(self, root: Optional[TreeNode]) -> List[List[int]]:\\n if(root == None):\\n return []\\n q = [root]\\n res = []\\n while len(q) > 0:\\n\\n l = len(q)\\n n = l\\n newl = []\\n \\n while l > 0:\\n l -= 1\\n u = q.pop(0)\\n newl.append(u.val)\\n \\n if(u.left != None):\\n q.append(u.left)\\n if(u.right != None):\\n q.append(u.right)\\n\\n res.append(newl)\\n \\n res.reverse()\\n\\n return res\",\n \"memory\": \"16800\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":9,"string":"9"}}},{"rowIdx":161,"cells":{"question_id":{"kind":"number","value":108,"string":"108"},"name":{"kind":"string","value":"convert-sorted-array-to-binary-search-tree"},"content":{"kind":"string","value":"<p>Given an integer array <code>nums</code> where the elements are sorted in <strong>ascending order</strong>, convert <em>it to a </em><span data-keyword=\"height-balanced\"><strong><em>height-balanced</em></strong></span> <em>binary search tree</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/02/18/btree1.jpg\" style=\"width: 302px; height: 222px;\" />\n<pre>\n<strong>Input:</strong> nums = [-10,-3,0,5,9]\n<strong>Output:</strong> [0,-3,9,-10,null,5]\n<strong>Explanation:</strong> [0,-10,5,null,-3,null,9] is also accepted:\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/02/18/btree2.jpg\" style=\"width: 302px; height: 222px;\" />\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/02/18/btree.jpg\" style=\"width: 342px; height: 142px;\" />\n<pre>\n<strong>Input:</strong> nums = [1,3]\n<strong>Output:</strong> [3,1]\n<strong>Explanation:</strong> [1,null,3] and [3,1] are both height-balanced BSTs.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 10<sup>4</sup></code></li>\n\t<li><code>-10<sup>4</sup> <= nums[i] <= 10<sup>4</sup></code></li>\n\t<li><code>nums</code> is sorted in a <strong>strictly increasing</strong> order.</li>\n</ul>\n"},"acRate":{"kind":"number","value":72.60161774402903,"string":"72.601618"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["array","divide-and-conquer","tree","binary-search-tree","binary-tree"],"string":"[\n \"array\",\n \"divide-and-conquer\",\n \"tree\",\n \"binary-search-tree\",\n \"binary-tree\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"30\", 0.0087], [\"31\", 0.0174], [\"34\", 0.0087], [\"35\", 0.0174], [\"36\", 0.0435], [\"37\", 0.087], [\"38\", 0.1565], [\"39\", 0.1565], [\"40\", 0.4174], [\"41\", 0.4783], [\"42\", 0.6696], [\"43\", 0.8696], [\"44\", 1.2436], [\"45\", 1.8697], [\"46\", 2.0524], [\"47\", 2.148], [\"48\", 3.9656], [\"49\", 4.5656], [\"50\", 4.5395], [\"51\", 4.1917], [\"52\", 7.4267], [\"53\", 6.9397], [\"54\", 6.6788], [\"55\", 6.4701], [\"56\", 7.9659], [\"57\", 6.931], [\"58\", 5.9483], [\"59\", 5.2265], [\"60\", 5.1657], [\"61\", 3.6873], [\"62\", 3.0611]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"17200\", 0.0087], [\"17300\", 0.0087], [\"17400\", 0.0348], [\"17500\", 0.1739], [\"17600\", 2.5046], [\"17700\", 37.9163], [\"17800\", 49.8652]]}"},"rt_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 sortedArrayToBST(self, nums: List[int]) -> TreeNode:\n root = self.traversiton(nums, 0, len(nums)-1)\n return root\n\n def traversiton(self,nums,left,right):\n if left > right:\n return None\n mid = (left+right)//2\n root = TreeNode(nums[mid])\n root.left = self.traversiton(nums, left, mid-1)\n root.right = self.traversiton(nums, mid+1, right)\n return root\n\n ","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def build(start,end,nums):\n \n if start > end:\n return None\n if start == end:\n return TreeNode(nums[start])\n mid = (start+end)//2\n left = build(start,mid-1,nums)\n right = build(mid+1,end,nums)\n newNode = TreeNode(nums[mid],left,right)\n return newNode\n \n return build(0,len(nums)-1,nums)\n ","runtime":"31"},{"code":"class Solution:\n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def helper(start, end):\n if start > end:\n return None\n mid = (start + end) // 2\n root = TreeNode(nums[mid])\n root.left = helper(start,mid - 1)\n root.right = helper(mid + 1, end)\n return root\n return helper(0, len(nums) - 1)\n ","runtime":"34"},{"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\nfrom math import ceil\nclass Solution:\n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if not nums:\n return None\n n = len(nums)//2\n middle = nums[n]\n root = TreeNode(middle)\n root.left = self.sortedArrayToBST(nums[:n])\n root.right = self.sortedArrayToBST(nums[n+1:])\n return root\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 createTree(self, nums, start, end):\n if start > end:\n return None\n mid = (start + end)//2\n node = TreeNode(nums[mid])\n node.left = self.createTree(nums, start, mid-1)\n node.right = self.createTree(nums, mid+1, end)\n return node\n \n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n start = 0\n end = len(nums)-1\n node = self.createTree(nums, start, end)\n return node","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if nums:\n mid = len(nums) // 2\n\n root = TreeNode(nums[mid])\n\n root.left = self.sortedArrayToBST(nums[:mid])\n root.right = self.sortedArrayToBST(nums[mid+1:])\n\n return root\n else:\n return None","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n return self.toTree(nums, 0, len(nums)-1)\n\n def toTree(self, nums, left, right):\n if left > right:\n return None\n mid = floor((left + right) / 2)\n root = TreeNode(nums[mid])\n root.left = self.toTree(nums, left, mid-1)\n root.right = self.toTree(nums, mid+1, right)\n return root\n ","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def dfs(left, right):\n if left > right:\n return \n \n mid = (left + right) // 2\n\n root = TreeNode(nums[mid])\n root.left = dfs(left, mid - 1)\n root.right = dfs(mid + 1, right)\n return root\n \n return dfs(0, len(nums) - 1)","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n total_nums = len(nums)\n if not total_nums:\n return None\n\n mid_node = total_nums // 2\n return TreeNode(\n nums[mid_node], \n self.sortedArrayToBST(nums[:mid_node]), self.sortedArrayToBST(nums[mid_node + 1 :])\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n n = len(nums)\n if n == 0:\n return None\n \n left = self.sortedArrayToBST(nums[:n//2])\n right = self.sortedArrayToBST(nums[n//2+1:])\n return TreeNode(nums[n//2],left, right)","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if not nums:\n return\n n=len(nums)\n mid=n//2\n root=TreeNode(nums[mid])\n root.left=self.sortedArrayToBST(nums[:mid])\n root.right=self.sortedArrayToBST(nums[mid+1:])\n return root\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def helper(start,end):\n if start>end:\n return None\n mid = (start+end)//2\n rootNode = TreeNode(nums[mid])\n rootNode.left = helper(start,mid-1)\n rootNode.right = helper(mid+1,end)\n return rootNode\n return helper(0,len(nums)-1)","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if len(nums) == 0:\n return None\n mid = len(nums)//2\n root = TreeNode(nums[mid])\n root.left = self.sortedArrayToBST(nums[:mid])\n root.right = self.sortedArrayToBST(nums[mid+1:])\n return root\n\n","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\n\nclass Solution:\n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def helper(l,r):\n if l > r :\n return None\n m = (l + r) // 2\n root = TreeNode(nums[m])\n root.left = helper(l, m - 1)\n root.right = helper(m + 1, r)\n return root\n\n return helper(0, len(nums) - 1)\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if not nums:\n return\n mid = len(nums)//2\n if mid == 0:\n return TreeNode(nums[mid])\n l = nums[:mid]\n r = nums[mid+1:]\n return TreeNode(nums[mid],self.sortedArrayToBST(l),self.sortedArrayToBST(r))","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def dfs(l, r):\n if l > r:\n return None\n mid = (l + r) >> 1\n left = dfs(l, mid - 1)\n right = dfs(mid + 1, r)\n return TreeNode(nums[mid], left, right)\n\n return dfs(0, len(nums) - 1) ","runtime":"45"},{"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 convert(self, nums, low, high):\n if low > high or high < low:\n return None\n if low == high:\n return TreeNode(nums[low])\n mid = (low+high) // 2\n root = TreeNode(nums[mid]) # 0 # -10 \n root.left = self.convert(nums, low, mid-1) #[-10, -3]\n root.right = self.convert(nums, mid+1, high) #[5,9]\n return root\n \n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n # [-10,-3] [0] [5,9] 0 asks for left child root and right child root\n # [-10] [-3] -10 asks for left and right child roots if low=high return nums[low]\n # [5] [9]\n \n root = self.convert(nums, 0, len(nums)-1)\n return root","runtime":"45"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if not nums:\n return None\n \n mid = len(nums)//2\n root = TreeNode(nums[mid])\n root.left = self.sortedArrayToBST(nums[:mid])\n root.right = self.sortedArrayToBST(nums[mid+1:])\n\n return root","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def helper(l,r):\n if l > r:\n return None\n mid = (l+r) // 2\n root = TreeNode(nums[mid])\n root.left = helper(l,mid-1) \n root.right = helper(mid+1,r)\n return root\n return helper(0,len(nums)-1)\n ","runtime":"47"},{"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 sortedArrayToBST(self, nums: List[int]) -> TreeNode:\n # if no array\n if not nums:\n return None\n \n # middle element of array\n mid = len(nums) // 2\n \n # create the root node\n treeroot = TreeNode(nums[mid])\n\n # create the left and right subtrees recursively using the class struct\n treeroot.left = self.sortedArrayToBST(nums[:mid])\n treeroot.right = self.sortedArrayToBST(nums[mid+1:])\n \n return treeroot","runtime":"47"},{"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 sortedArrayToBST(self, nums: List[int]) -> TreeNode:\n # if no array\n if not nums:\n return None\n \n # middle element of array\n mid = len(nums) // 2\n \n # create the root node\n treeroot = TreeNode(nums[mid])\n\n # create the left and right subtrees recursively using the class struct\n treeroot.left = self.sortedArrayToBST(nums[:mid])\n treeroot.right = self.sortedArrayToBST(nums[mid+1:])\n \n return treeroot","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def recurse(left, right):\n if left > right:\n return None\n mid = (left + right) // 2\n node = TreeNode(nums[mid])\n node.left = recurse(left, mid - 1)\n node.right = recurse(mid + 1, right)\n return node\n return recurse(0, len(nums) - 1)","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def buildBST(nums, l, r):\n if l>r:\n return None\n mid = (l+r)//2\n root = TreeNode(nums[mid])\n root.left = buildBST(nums, l, mid-1)\n root.right = buildBST(nums, mid+1, r)\n return root\n return buildBST(nums, 0, len(nums)-1)","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def help(l,r):\n if l>r:\n return None\n else:\n mid=(l+r)//2\n root=TreeNode(nums[mid])\n root.left=help(l,mid-1)\n root.right=help(mid+1,r)\n return root\n return help(0,len(nums)-1)","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if len(nums)==0:\n return None\n mid=len(nums)//2\n root=TreeNode(nums[mid])\n root.left=self.sortedArrayToBST(nums[:mid])\n root.right=self.sortedArrayToBST(nums[mid+1:])\n return root ","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if not nums:\n return None\n \n mid = len(nums)//2\n root = TreeNode(nums[mid])\n root.left = self.sortedArrayToBST(nums[:mid])\n root.right = self.sortedArrayToBST(nums[mid+1:])\n\n return root","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def build(arr, left, right):\n if left > right:\n return None\n \n mid = left + (right - left) // 2\n node = TreeNode(arr[mid])\n node.left = build(arr, left, mid - 1)\n node.right = build(arr, mid + 1, right)\n return node\n\n if len(nums) == 0:\n return \n \n tree = build(nums, 0, len(nums) - 1)\n return tree","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 def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if not nums:\n return None\n \n mid = len(nums) // 2\n\n root = TreeNode(nums[mid])\n\n\n root.left = self.sortedArrayToBST(nums[:mid])\n root.right = self.sortedArrayToBST(nums[mid+1:])\n\n return root\n","runtime":"51"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if not nums:\n return None\n return self.helper(nums, 0, len(nums) - 1)\n \n def helper(self, nums: List[int], start: int, end: int) -> Optional[TreeNode]:\n if start > end:\n return None\n \n mid = (start + end) // 2\n root = TreeNode(nums[mid])\n root.left = self.helper(nums, start, mid - 1)\n root.right = self.helper(nums, mid + 1, end)\n \n return root","runtime":"52"},{"code":"#Python3 Code\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def helper(arr, s, e):\n if s > e:\n return None\n mid = s + (e - s) // 2\n node = TreeNode(arr[mid])\n node.left = helper(arr, s, mid - 1)\n node.right = helper(arr, mid + 1, e)\n return node\n \n n = len(nums)\n if n == 0:\n return None\n return helper(nums, 0, n - 1)","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if not nums:\n return None\n return self.helper(nums, 0, len(nums)-1)\n\n def helper(self, nums, start_index, end_index):\n if start_index > end_index:\n return None\n \n mid_index = (start_index + end_index) // 2\n\n node = TreeNode(nums[mid_index])\n node.left = self.helper(nums, start_index, mid_index-1)\n node.right = self.helper(nums, mid_index+1, end_index)\n\n return node\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def traversal(nums: List[int], l: int, r: int) -> TreeNode:\n if l > r:\n return None\n\n m = l + (r-l) // 2\n root = TreeNode(nums[m])\n root.left = traversal(nums, l, m-1)\n root.right = traversal(nums, m+1, r)\n return root\n\n return traversal(nums, 0, len(nums)-1)","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def helper(arr, s, e):\n if s > e:\n return None\n mid = s + (e - s) // 2\n node = TreeNode(arr[mid])\n node.left = helper(arr, s, mid - 1)\n node.right = helper(arr, mid + 1, e)\n return node\n \n n = len(nums)\n if n == 0:\n return None\n return helper(nums, 0, n - 1)","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if not len(nums):\n return None\n\n if len(nums) == 1:\n return TreeNode(nums[0])\n \n mid = int(len(nums)/2)\n root = TreeNode(nums[mid])\n root.left = self.sortedArrayToBST(nums[:mid])\n root.right = self.sortedArrayToBST(nums[mid+1:])\n return root","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def helper(start_idx, end_idx):\n if start_idx>end_idx:\n return None\n elif start_idx == end_idx:\n return TreeNode(val = nums[start_idx])\n else:\n mid = start_idx + (end_idx-start_idx)//2\n #print(f\"{nums[mid]} {start_idx}, {end_idx}\")\n node = TreeNode(val=nums[mid])\n node.left = helper(start_idx, mid-1)\n node.right = helper(mid+1, end_idx)\n\n return node\n #print(helper(0, len(nums)-1))\n return helper(0, len(nums)-1)","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 BuildTree(self, nums, start, end):\n if start > end:\n return None\n mid = (start + end)//2\n root = TreeNode(nums[mid], self.BuildTree(nums,start, mid-1), self.BuildTree(nums,mid+1, end))\n return root\n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n return self.BuildTree(nums, 0, len(nums)-1)","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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n\n if not nums:\n return None\n \n left = 0\n right = len(nums)\n mid = (left+right)//2\n root = TreeNode(nums[mid])\n root.left = self.sortedArrayToBST(nums[left:mid])\n root.right = self.sortedArrayToBST(nums[mid+1:right])\n return 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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if not len(nums):\n return None\n\n if len(nums) == 1:\n return TreeNode(nums[0])\n \n mid = int(len(nums)/2)\n root = TreeNode(nums[mid])\n root.left = self.sortedArrayToBST(nums[:mid])\n root.right = self.sortedArrayToBST(nums[mid+1:])\n return 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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def helper(start_idx, end_idx):\n if start_idx>end_idx:\n return None\n elif start_idx == end_idx:\n return TreeNode(val = nums[start_idx])\n else:\n mid = start_idx + (end_idx-start_idx)//2\n #print(f\"{nums[mid]} {start_idx}, {end_idx}\")\n node = TreeNode(val=nums[mid])\n node.left = helper(start_idx, mid-1)\n node.right = helper(mid+1, end_idx)\n\n return node\n #print(helper(0, len(nums)-1))\n return helper(0, len(nums)-1)","runtime":"57"},{"code":"class Solution:\n def sortedArrayToBST(self, nums: list[int]) -> TreeNode | None:\n def build(l: int, r: int) -> TreeNode | None:\n if l > r:\n return None\n m = (l + r) // 2\n return TreeNode(nums[m],\n build(l, m - 1),\n build(m + 1, r))\n\n return build(0, len(nums) - 1)\n ","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 def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if not nums: return None\n mid = len(nums)//2\n root = TreeNode(val = nums[mid])\n root.left = self.sortedArrayToBST(nums = nums[:mid])\n root.right = self.sortedArrayToBST(nums = nums[mid + 1:])\n \n return 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 def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n\n #we could do like a binary search on the array?\n def buildTree(left,right):\n if left>right:\n return None\n mid = left + (right - left)//2\n left = buildTree(left,mid-1)\n right = buildTree(mid+1,right)\n root = TreeNode(nums[mid], left, right)\n return root\n\n\n\n left,right = 0, len(nums)-1\n return buildTree(left, right)\n \n ","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 def solve(self,root,nums,low,high):\n if high<low:\n return None\n \n mid=(low+high)//2\n node=TreeNode(nums[mid])\n node.left=self.solve(node,nums,low,mid-1)\n node.right=self.solve(node,nums,mid+1,high)\n return node\n \n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n low=0\n high=len(nums)-1\n mid=(low+high)//2\n root=TreeNode(nums[mid])\n root.left=self.solve(root,nums,low,mid-1)\n root.right=self.solve(root,nums,mid+1,high)\n return root\n\n ","runtime":"60"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n frm, to = 0, len(nums) - 1\n if to == -1:\n return None\n return self.rec_helper(nums, frm, to)\n \n \n def rec_helper(self, nums: list[int], frm: int, to: int) -> TreeNode:\n if frm > to:\n return None\n mid = frm + (to - frm) // 2\n node = TreeNode(nums[mid])\n node.left = self.rec_helper(nums, frm, mid - 1)\n node.right = self.rec_helper(nums, mid + 1, to)\n return node","runtime":"60"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def build_tree(nums = nums, l = 0, r = len(nums)):\n if l >= r:\n return None\n\n m = l + ((r - l) >> 1)\n root = TreeNode(nums[m])\n root.left = build_tree(nums, l, m)\n root.right = build_tree(nums, m + 1, r)\n\n return root\n\n return build_tree()\n\n","runtime":"61"},{"code":"# Ordered array is in order traversal of binary search tree\n# The inverse is, left most element is the minimum, rightmost is the maximum\n# Take mid element, make it the root, take left most element make it the left child, right most the right child\n# Construct recursively using the left array (without mid and first) same for the right\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\n\n# nums = [1]\n# mid = 1 // 2 = 0\n# nums[0] -> 1\n# nums[0:mid] -> nums[0:0] -> []\n# nums[0+1:] -> nums[1:]\n\nclass Solution:\n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if not nums: return None\n mid = len(nums) // 2\n root = TreeNode(nums[mid])\n root.left = self.sortedArrayToBST(nums[0:mid])\n root.right = self.sortedArrayToBST(nums[mid+1:])\n return root\n\n\n ","runtime":"61"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if not nums:\n return None\n left = 0\n right = len(nums)\n mid = (left+right)//2\n return TreeNode(nums[mid], self.sortedArrayToBST(nums[:mid]), self.sortedArrayToBST(nums[mid+1:]))","runtime":"62"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def func(arr,start,end):\n if(start>end):\n return None\n mid = start+(end-start)//2\n node = TreeNode(arr[mid])\n node.left = func(arr,start,mid-1)\n node.right = func(arr,mid+1,end)\n return node\n if(len(nums)==0):\n return None\n return func(nums,0,len(nums)-1)","runtime":"62"}],"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 sortedArrayToBST(self, nums: List[int]) -> TreeNode:\\n root = self.traversiton(nums, 0, len(nums)-1)\\n return root\\n\\n def traversiton(self,nums,left,right):\\n if left > right:\\n return None\\n mid = (left+right)//2\\n root = TreeNode(nums[mid])\\n root.left = self.traversiton(nums, left, mid-1)\\n root.right = self.traversiton(nums, mid+1, right)\\n return root\\n\\n \",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def build(start,end,nums):\\n \\n if start > end:\\n return None\\n if start == end:\\n return TreeNode(nums[start])\\n mid = (start+end)//2\\n left = build(start,mid-1,nums)\\n right = build(mid+1,end,nums)\\n newNode = TreeNode(nums[mid],left,right)\\n return newNode\\n \\n return build(0,len(nums)-1,nums)\\n \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def helper(start, end):\\n if start > end:\\n return None\\n mid = (start + end) // 2\\n root = TreeNode(nums[mid])\\n root.left = helper(start,mid - 1)\\n root.right = helper(mid + 1, end)\\n return root\\n return helper(0, len(nums) - 1)\\n \",\n \"runtime\": \"34\"\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\\nfrom math import ceil\\nclass Solution:\\n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if not nums:\\n return None\\n n = len(nums)//2\\n middle = nums[n]\\n root = TreeNode(middle)\\n root.left = self.sortedArrayToBST(nums[:n])\\n root.right = self.sortedArrayToBST(nums[n+1:])\\n return root\\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 createTree(self, nums, start, end):\\n if start > end:\\n return None\\n mid = (start + end)//2\\n node = TreeNode(nums[mid])\\n node.left = self.createTree(nums, start, mid-1)\\n node.right = self.createTree(nums, mid+1, end)\\n return node\\n \\n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n start = 0\\n end = len(nums)-1\\n node = self.createTree(nums, start, end)\\n return node\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if nums:\\n mid = len(nums) // 2\\n\\n root = TreeNode(nums[mid])\\n\\n root.left = self.sortedArrayToBST(nums[:mid])\\n root.right = self.sortedArrayToBST(nums[mid+1:])\\n\\n return root\\n else:\\n return None\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n return self.toTree(nums, 0, len(nums)-1)\\n\\n def toTree(self, nums, left, right):\\n if left > right:\\n return None\\n mid = floor((left + right) / 2)\\n root = TreeNode(nums[mid])\\n root.left = self.toTree(nums, left, mid-1)\\n root.right = self.toTree(nums, mid+1, right)\\n return root\\n \",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def dfs(left, right):\\n if left > right:\\n return \\n \\n mid = (left + right) // 2\\n\\n root = TreeNode(nums[mid])\\n root.left = dfs(left, mid - 1)\\n root.right = dfs(mid + 1, right)\\n return root\\n \\n return dfs(0, len(nums) - 1)\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n total_nums = len(nums)\\n if not total_nums:\\n return None\\n\\n mid_node = total_nums // 2\\n return TreeNode(\\n nums[mid_node], \\n self.sortedArrayToBST(nums[:mid_node]), self.sortedArrayToBST(nums[mid_node + 1 :])\\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n n = len(nums)\\n if n == 0:\\n return None\\n \\n left = self.sortedArrayToBST(nums[:n//2])\\n right = self.sortedArrayToBST(nums[n//2+1:])\\n return TreeNode(nums[n//2],left, right)\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if not nums:\\n return\\n n=len(nums)\\n mid=n//2\\n root=TreeNode(nums[mid])\\n root.left=self.sortedArrayToBST(nums[:mid])\\n root.right=self.sortedArrayToBST(nums[mid+1:])\\n return root\\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def helper(start,end):\\n if start>end:\\n return None\\n mid = (start+end)//2\\n rootNode = TreeNode(nums[mid])\\n rootNode.left = helper(start,mid-1)\\n rootNode.right = helper(mid+1,end)\\n return rootNode\\n return helper(0,len(nums)-1)\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if len(nums) == 0:\\n return None\\n mid = len(nums)//2\\n root = TreeNode(nums[mid])\\n root.left = self.sortedArrayToBST(nums[:mid])\\n root.right = self.sortedArrayToBST(nums[mid+1:])\\n return root\\n\\n\",\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\\n\\nclass Solution:\\n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def helper(l,r):\\n if l > r :\\n return None\\n m = (l + r) // 2\\n root = TreeNode(nums[m])\\n root.left = helper(l, m - 1)\\n root.right = helper(m + 1, r)\\n return root\\n\\n return helper(0, len(nums) - 1)\\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if not nums:\\n return\\n mid = len(nums)//2\\n if mid == 0:\\n return TreeNode(nums[mid])\\n l = nums[:mid]\\n r = nums[mid+1:]\\n return TreeNode(nums[mid],self.sortedArrayToBST(l),self.sortedArrayToBST(r))\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def dfs(l, r):\\n if l > r:\\n return None\\n mid = (l + r) >> 1\\n left = dfs(l, mid - 1)\\n right = dfs(mid + 1, r)\\n return TreeNode(nums[mid], left, right)\\n\\n return dfs(0, len(nums) - 1) \",\n \"runtime\": \"45\"\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 convert(self, nums, low, high):\\n if low > high or high < low:\\n return None\\n if low == high:\\n return TreeNode(nums[low])\\n mid = (low+high) // 2\\n root = TreeNode(nums[mid]) # 0 # -10 \\n root.left = self.convert(nums, low, mid-1) #[-10, -3]\\n root.right = self.convert(nums, mid+1, high) #[5,9]\\n return root\\n \\n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n # [-10,-3] [0] [5,9] 0 asks for left child root and right child root\\n # [-10] [-3] -10 asks for left and right child roots if low=high return nums[low]\\n # [5] [9]\\n \\n root = self.convert(nums, 0, len(nums)-1)\\n return root\",\n \"runtime\": \"45\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if not nums:\\n return None\\n \\n mid = len(nums)//2\\n root = TreeNode(nums[mid])\\n root.left = self.sortedArrayToBST(nums[:mid])\\n root.right = self.sortedArrayToBST(nums[mid+1:])\\n\\n return root\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def helper(l,r):\\n if l > r:\\n return None\\n mid = (l+r) // 2\\n root = TreeNode(nums[mid])\\n root.left = helper(l,mid-1) \\n root.right = helper(mid+1,r)\\n return root\\n return helper(0,len(nums)-1)\\n \",\n \"runtime\": \"47\"\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 def sortedArrayToBST(self, nums: List[int]) -> TreeNode:\\n # if no array\\n if not nums:\\n return None\\n \\n # middle element of array\\n mid = len(nums) // 2\\n \\n # create the root node\\n treeroot = TreeNode(nums[mid])\\n\\n # create the left and right subtrees recursively using the class struct\\n treeroot.left = self.sortedArrayToBST(nums[:mid])\\n treeroot.right = self.sortedArrayToBST(nums[mid+1:])\\n \\n return treeroot\",\n \"runtime\": \"47\"\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 def sortedArrayToBST(self, nums: List[int]) -> TreeNode:\\n # if no array\\n if not nums:\\n return None\\n \\n # middle element of array\\n mid = len(nums) // 2\\n \\n # create the root node\\n treeroot = TreeNode(nums[mid])\\n\\n # create the left and right subtrees recursively using the class struct\\n treeroot.left = self.sortedArrayToBST(nums[:mid])\\n treeroot.right = self.sortedArrayToBST(nums[mid+1:])\\n \\n return treeroot\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def recurse(left, right):\\n if left > right:\\n return None\\n mid = (left + right) // 2\\n node = TreeNode(nums[mid])\\n node.left = recurse(left, mid - 1)\\n node.right = recurse(mid + 1, right)\\n return node\\n return recurse(0, len(nums) - 1)\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def buildBST(nums, l, r):\\n if l>r:\\n return None\\n mid = (l+r)//2\\n root = TreeNode(nums[mid])\\n root.left = buildBST(nums, l, mid-1)\\n root.right = buildBST(nums, mid+1, r)\\n return root\\n return buildBST(nums, 0, len(nums)-1)\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def help(l,r):\\n if l>r:\\n return None\\n else:\\n mid=(l+r)//2\\n root=TreeNode(nums[mid])\\n root.left=help(l,mid-1)\\n root.right=help(mid+1,r)\\n return root\\n return help(0,len(nums)-1)\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if len(nums)==0:\\n return None\\n mid=len(nums)//2\\n root=TreeNode(nums[mid])\\n root.left=self.sortedArrayToBST(nums[:mid])\\n root.right=self.sortedArrayToBST(nums[mid+1:])\\n return root \",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if not nums:\\n return None\\n \\n mid = len(nums)//2\\n root = TreeNode(nums[mid])\\n root.left = self.sortedArrayToBST(nums[:mid])\\n root.right = self.sortedArrayToBST(nums[mid+1:])\\n\\n return root\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def build(arr, left, right):\\n if left > right:\\n return None\\n \\n mid = left + (right - left) // 2\\n node = TreeNode(arr[mid])\\n node.left = build(arr, left, mid - 1)\\n node.right = build(arr, mid + 1, right)\\n return node\\n\\n if len(nums) == 0:\\n return \\n \\n tree = build(nums, 0, len(nums) - 1)\\n return tree\",\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 def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if not nums:\\n return None\\n \\n mid = len(nums) // 2\\n\\n root = TreeNode(nums[mid])\\n\\n\\n root.left = self.sortedArrayToBST(nums[:mid])\\n root.right = self.sortedArrayToBST(nums[mid+1:])\\n\\n return root\\n\",\n \"runtime\": \"51\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if not nums:\\n return None\\n return self.helper(nums, 0, len(nums) - 1)\\n \\n def helper(self, nums: List[int], start: int, end: int) -> Optional[TreeNode]:\\n if start > end:\\n return None\\n \\n mid = (start + end) // 2\\n root = TreeNode(nums[mid])\\n root.left = self.helper(nums, start, mid - 1)\\n root.right = self.helper(nums, mid + 1, end)\\n \\n return root\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"#Python3 Code\\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def helper(arr, s, e):\\n if s > e:\\n return None\\n mid = s + (e - s) // 2\\n node = TreeNode(arr[mid])\\n node.left = helper(arr, s, mid - 1)\\n node.right = helper(arr, mid + 1, e)\\n return node\\n \\n n = len(nums)\\n if n == 0:\\n return None\\n return helper(nums, 0, n - 1)\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if not nums:\\n return None\\n return self.helper(nums, 0, len(nums)-1)\\n\\n def helper(self, nums, start_index, end_index):\\n if start_index > end_index:\\n return None\\n \\n mid_index = (start_index + end_index) // 2\\n\\n node = TreeNode(nums[mid_index])\\n node.left = self.helper(nums, start_index, mid_index-1)\\n node.right = self.helper(nums, mid_index+1, end_index)\\n\\n return node\\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def traversal(nums: List[int], l: int, r: int) -> TreeNode:\\n if l > r:\\n return None\\n\\n m = l + (r-l) // 2\\n root = TreeNode(nums[m])\\n root.left = traversal(nums, l, m-1)\\n root.right = traversal(nums, m+1, r)\\n return root\\n\\n return traversal(nums, 0, len(nums)-1)\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def helper(arr, s, e):\\n if s > e:\\n return None\\n mid = s + (e - s) // 2\\n node = TreeNode(arr[mid])\\n node.left = helper(arr, s, mid - 1)\\n node.right = helper(arr, mid + 1, e)\\n return node\\n \\n n = len(nums)\\n if n == 0:\\n return None\\n return helper(nums, 0, n - 1)\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if not len(nums):\\n return None\\n\\n if len(nums) == 1:\\n return TreeNode(nums[0])\\n \\n mid = int(len(nums)/2)\\n root = TreeNode(nums[mid])\\n root.left = self.sortedArrayToBST(nums[:mid])\\n root.right = self.sortedArrayToBST(nums[mid+1:])\\n return root\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def helper(start_idx, end_idx):\\n if start_idx>end_idx:\\n return None\\n elif start_idx == end_idx:\\n return TreeNode(val = nums[start_idx])\\n else:\\n mid = start_idx + (end_idx-start_idx)//2\\n #print(f\\\"{nums[mid]} {start_idx}, {end_idx}\\\")\\n node = TreeNode(val=nums[mid])\\n node.left = helper(start_idx, mid-1)\\n node.right = helper(mid+1, end_idx)\\n\\n return node\\n #print(helper(0, len(nums)-1))\\n return helper(0, len(nums)-1)\",\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 BuildTree(self, nums, start, end):\\n if start > end:\\n return None\\n mid = (start + end)//2\\n root = TreeNode(nums[mid], self.BuildTree(nums,start, mid-1), self.BuildTree(nums,mid+1, end))\\n return root\\n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n return self.BuildTree(nums, 0, len(nums)-1)\",\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n\\n if not nums:\\n return None\\n \\n left = 0\\n right = len(nums)\\n mid = (left+right)//2\\n root = TreeNode(nums[mid])\\n root.left = self.sortedArrayToBST(nums[left:mid])\\n root.right = self.sortedArrayToBST(nums[mid+1:right])\\n return 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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if not len(nums):\\n return None\\n\\n if len(nums) == 1:\\n return TreeNode(nums[0])\\n \\n mid = int(len(nums)/2)\\n root = TreeNode(nums[mid])\\n root.left = self.sortedArrayToBST(nums[:mid])\\n root.right = self.sortedArrayToBST(nums[mid+1:])\\n return 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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def helper(start_idx, end_idx):\\n if start_idx>end_idx:\\n return None\\n elif start_idx == end_idx:\\n return TreeNode(val = nums[start_idx])\\n else:\\n mid = start_idx + (end_idx-start_idx)//2\\n #print(f\\\"{nums[mid]} {start_idx}, {end_idx}\\\")\\n node = TreeNode(val=nums[mid])\\n node.left = helper(start_idx, mid-1)\\n node.right = helper(mid+1, end_idx)\\n\\n return node\\n #print(helper(0, len(nums)-1))\\n return helper(0, len(nums)-1)\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def sortedArrayToBST(self, nums: list[int]) -> TreeNode | None:\\n def build(l: int, r: int) -> TreeNode | None:\\n if l > r:\\n return None\\n m = (l + r) // 2\\n return TreeNode(nums[m],\\n build(l, m - 1),\\n build(m + 1, r))\\n\\n return build(0, len(nums) - 1)\\n \",\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 def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if not nums: return None\\n mid = len(nums)//2\\n root = TreeNode(val = nums[mid])\\n root.left = self.sortedArrayToBST(nums = nums[:mid])\\n root.right = self.sortedArrayToBST(nums = nums[mid + 1:])\\n \\n return 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 def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n\\n #we could do like a binary search on the array?\\n def buildTree(left,right):\\n if left>right:\\n return None\\n mid = left + (right - left)//2\\n left = buildTree(left,mid-1)\\n right = buildTree(mid+1,right)\\n root = TreeNode(nums[mid], left, right)\\n return root\\n\\n\\n\\n left,right = 0, len(nums)-1\\n return buildTree(left, right)\\n \\n \",\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 def solve(self,root,nums,low,high):\\n if high<low:\\n return None\\n \\n mid=(low+high)//2\\n node=TreeNode(nums[mid])\\n node.left=self.solve(node,nums,low,mid-1)\\n node.right=self.solve(node,nums,mid+1,high)\\n return node\\n \\n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n low=0\\n high=len(nums)-1\\n mid=(low+high)//2\\n root=TreeNode(nums[mid])\\n root.left=self.solve(root,nums,low,mid-1)\\n root.right=self.solve(root,nums,mid+1,high)\\n return root\\n\\n \",\n \"runtime\": \"60\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n frm, to = 0, len(nums) - 1\\n if to == -1:\\n return None\\n return self.rec_helper(nums, frm, to)\\n \\n \\n def rec_helper(self, nums: list[int], frm: int, to: int) -> TreeNode:\\n if frm > to:\\n return None\\n mid = frm + (to - frm) // 2\\n node = TreeNode(nums[mid])\\n node.left = self.rec_helper(nums, frm, mid - 1)\\n node.right = self.rec_helper(nums, mid + 1, to)\\n return node\",\n \"runtime\": \"60\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def build_tree(nums = nums, l = 0, r = len(nums)):\\n if l >= r:\\n return None\\n\\n m = l + ((r - l) >> 1)\\n root = TreeNode(nums[m])\\n root.left = build_tree(nums, l, m)\\n root.right = build_tree(nums, m + 1, r)\\n\\n return root\\n\\n return build_tree()\\n\\n\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"# Ordered array is in order traversal of binary search tree\\n# The inverse is, left most element is the minimum, rightmost is the maximum\\n# Take mid element, make it the root, take left most element make it the left child, right most the right child\\n# Construct recursively using the left array (without mid and first) same for the right\\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\\n\\n# nums = [1]\\n# mid = 1 // 2 = 0\\n# nums[0] -> 1\\n# nums[0:mid] -> nums[0:0] -> []\\n# nums[0+1:] -> nums[1:]\\n\\nclass Solution:\\n def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if not nums: return None\\n mid = len(nums) // 2\\n root = TreeNode(nums[mid])\\n root.left = self.sortedArrayToBST(nums[0:mid])\\n root.right = self.sortedArrayToBST(nums[mid+1:])\\n return root\\n\\n\\n \",\n \"runtime\": \"61\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if not nums:\\n return None\\n left = 0\\n right = len(nums)\\n mid = (left+right)//2\\n return TreeNode(nums[mid], self.sortedArrayToBST(nums[:mid]), self.sortedArrayToBST(nums[mid+1:]))\",\n \"runtime\": \"62\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def func(arr,start,end):\\n if(start>end):\\n return None\\n mid = start+(end-start)//2\\n node = TreeNode(arr[mid])\\n node.left = func(arr,start,mid-1)\\n node.right = func(arr,mid+1,end)\\n return node\\n if(len(nums)==0):\\n return None\\n return func(nums,0,len(nums)-1)\",\n \"runtime\": \"62\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":48,"string":"48"},"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n \n if len(nums) == 0:\n return\n\n mid = len(nums)//2\n root = TreeNode(nums[mid])\n root.left = self.sortedArrayToBST(nums[:mid])\n root.right = self.sortedArrayToBST(nums[mid+1:])\n\n return root","memory":"17200"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n l = 0\n r = len(nums) - 1\n\n def helper(l ,r):\n if l > r:\n return None\n\n m = (l + r) // 2\n\n root = TreeNode(nums[m])\n root.left = helper(l, m -1)\n root.right = helper(m + 1, r)\n\n return root\n\n return helper(l, r) ","memory":"17300"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def makeTree(arr, l, r):\n if l > r:\n return None\n\n mid = (l + r) // 2\n \n node = TreeNode(val=nums[mid])\n node.left = makeTree(arr, l, mid - 1)\n node.right = makeTree(arr, mid + 1, r)\n \n return node\n\n return makeTree(nums, 0, len(nums) - 1)\n ","memory":"17400"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def solve(left, right):\n if left>right:\n return None\n mid = (left+right) // 2\n node = TreeNode(nums[mid])\n node.left = solve(left,mid-1)\n node.right = solve(mid+1, right)\n return node\n return solve(0,len(nums)-1)","memory":"17400"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if not nums:\n return None\n mid = len(nums) // 2\n root = TreeNode(nums[mid])\n root.left = self.sortedArrayToBST(nums[:mid])\n root.right = self.sortedArrayToBST(nums[mid+1:])\n return root\n ","memory":"17500"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if len(nums) == 0:\n return None\n mid=len(nums)//2\n root=TreeNode(nums[mid])\n root.left=self.sortedArrayToBST(nums[:mid])\n root.right=self.sortedArrayToBST(nums[mid+1:])\n return root\n\n ","memory":"17600"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n\n def back(l, r):\n\n if l >= r:\n return None\n\n mid = (r + l) // 2\n\n node = TreeNode(nums[mid])\n\n left = back(l, mid)\n right = back(mid + 1, r)\n\n node.left = left\n node.right = right\n\n return node\n\n return back(0, len(nums))\n\n\n # def back(arr):\n\n # if not arr:\n # return None\n\n # mid = len(arr) // 2\n\n # node = TreeNode(arr[mid])\n\n # left = back(arr[:mid])\n # right = back(arr[mid + 1:])\n\n # node.left = left\n # node.right = right\n\n # return node\n\n # return back(nums)\n","memory":"17600"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n def rec(s,e):\n if s > e or s < 0 or e >= len(nums): return None\n\n mid = ((s+e)//2)\n mnode = TreeNode(nums[mid])\n # print(mnode.val,s,e,mid)\n mnode.left = rec(s,mid-1)\n mnode.right = rec(mid+1, e)\n return mnode\n return rec(0, len(nums)-1)\n \n ","memory":"17700"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if len(nums) == 0:\n return None\n \n m = len(nums) // 2\n\n root = TreeNode(nums[m])\n\n root.left = self.sortedArrayToBST(nums[:m])\n root.right = self.sortedArrayToBST(nums[m+1:])\n\n return root\n\n","memory":"17700"},{"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if len(nums) == 0:\n return None\n\n if len(nums) == 1:\n return TreeNode(nums[0])\n\n if len(nums) == 2:\n root = TreeNode(nums[-1])\n root.left = TreeNode(nums[0])\n return root\n\n def helper(nums, left, right):\n if left > right:\n return None\n\n mid = (left + right) // 2\n node = TreeNode(nums[mid])\n if left < mid:\n node.left = helper(nums, left, mid - 1)\n if right > mid:\n node.right = helper(nums, mid + 1, right)\n\n return node\n root = helper(nums, 0, len(nums) - 1)\n return 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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n if len(nums) == 0:\n return None\n\n if len(nums) == 1:\n return TreeNode(nums[0])\n\n if len(nums) == 2:\n root = TreeNode(nums[-1])\n root.left = TreeNode(nums[0])\n return root\n\n def helper(left: int, right: int) -> Optional[TreeNode]:\n if left > right:\n return None\n\n mid = (left + right) // 2\n node = TreeNode(nums[mid])\n if left < mid:\n node.left = helper(left, mid - 1)\n if right > mid:\n node.right = helper(mid + 1, right)\n\n return node\n\n return helper(0, len(nums) - 1)\n","memory":"17800"}],"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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n \\n if len(nums) == 0:\\n return\\n\\n mid = len(nums)//2\\n root = TreeNode(nums[mid])\\n root.left = self.sortedArrayToBST(nums[:mid])\\n root.right = self.sortedArrayToBST(nums[mid+1:])\\n\\n return root\",\n \"memory\": \"17200\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n l = 0\\n r = len(nums) - 1\\n\\n def helper(l ,r):\\n if l > r:\\n return None\\n\\n m = (l + r) // 2\\n\\n root = TreeNode(nums[m])\\n root.left = helper(l, m -1)\\n root.right = helper(m + 1, r)\\n\\n return root\\n\\n return helper(l, r) \",\n \"memory\": \"17300\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def makeTree(arr, l, r):\\n if l > r:\\n return None\\n\\n mid = (l + r) // 2\\n \\n node = TreeNode(val=nums[mid])\\n node.left = makeTree(arr, l, mid - 1)\\n node.right = makeTree(arr, mid + 1, r)\\n \\n return node\\n\\n return makeTree(nums, 0, len(nums) - 1)\\n \",\n \"memory\": \"17400\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def solve(left, right):\\n if left>right:\\n return None\\n mid = (left+right) // 2\\n node = TreeNode(nums[mid])\\n node.left = solve(left,mid-1)\\n node.right = solve(mid+1, right)\\n return node\\n return solve(0,len(nums)-1)\",\n \"memory\": \"17400\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if not nums:\\n return None\\n mid = len(nums) // 2\\n root = TreeNode(nums[mid])\\n root.left = self.sortedArrayToBST(nums[:mid])\\n root.right = self.sortedArrayToBST(nums[mid+1:])\\n return root\\n \",\n \"memory\": \"17500\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if len(nums) == 0:\\n return None\\n mid=len(nums)//2\\n root=TreeNode(nums[mid])\\n root.left=self.sortedArrayToBST(nums[:mid])\\n root.right=self.sortedArrayToBST(nums[mid+1:])\\n return root\\n\\n \",\n \"memory\": \"17600\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n\\n def back(l, r):\\n\\n if l >= r:\\n return None\\n\\n mid = (r + l) // 2\\n\\n node = TreeNode(nums[mid])\\n\\n left = back(l, mid)\\n right = back(mid + 1, r)\\n\\n node.left = left\\n node.right = right\\n\\n return node\\n\\n return back(0, len(nums))\\n\\n\\n # def back(arr):\\n\\n # if not arr:\\n # return None\\n\\n # mid = len(arr) // 2\\n\\n # node = TreeNode(arr[mid])\\n\\n # left = back(arr[:mid])\\n # right = back(arr[mid + 1:])\\n\\n # node.left = left\\n # node.right = right\\n\\n # return node\\n\\n # return back(nums)\\n\",\n \"memory\": \"17600\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n def rec(s,e):\\n if s > e or s < 0 or e >= len(nums): return None\\n\\n mid = ((s+e)//2)\\n mnode = TreeNode(nums[mid])\\n # print(mnode.val,s,e,mid)\\n mnode.left = rec(s,mid-1)\\n mnode.right = rec(mid+1, e)\\n return mnode\\n return rec(0, len(nums)-1)\\n \\n \",\n \"memory\": \"17700\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if len(nums) == 0:\\n return None\\n \\n m = len(nums) // 2\\n\\n root = TreeNode(nums[m])\\n\\n root.left = self.sortedArrayToBST(nums[:m])\\n root.right = self.sortedArrayToBST(nums[m+1:])\\n\\n return root\\n\\n\",\n \"memory\": \"17700\"\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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if len(nums) == 0:\\n return None\\n\\n if len(nums) == 1:\\n return TreeNode(nums[0])\\n\\n if len(nums) == 2:\\n root = TreeNode(nums[-1])\\n root.left = TreeNode(nums[0])\\n return root\\n\\n def helper(nums, left, right):\\n if left > right:\\n return None\\n\\n mid = (left + right) // 2\\n node = TreeNode(nums[mid])\\n if left < mid:\\n node.left = helper(nums, left, mid - 1)\\n if right > mid:\\n node.right = helper(nums, mid + 1, right)\\n\\n return node\\n root = helper(nums, 0, len(nums) - 1)\\n return 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 sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\\n if len(nums) == 0:\\n return None\\n\\n if len(nums) == 1:\\n return TreeNode(nums[0])\\n\\n if len(nums) == 2:\\n root = TreeNode(nums[-1])\\n root.left = TreeNode(nums[0])\\n return root\\n\\n def helper(left: int, right: int) -> Optional[TreeNode]:\\n if left > right:\\n return None\\n\\n mid = (left + right) // 2\\n node = TreeNode(nums[mid])\\n if left < mid:\\n node.left = helper(left, mid - 1)\\n if right > mid:\\n node.right = helper(mid + 1, right)\\n\\n return node\\n\\n return helper(0, len(nums) - 1)\\n\",\n \"memory\": \"17800\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":11,"string":"11"}}},{"rowIdx":162,"cells":{"question_id":{"kind":"number","value":109,"string":"109"},"name":{"kind":"string","value":"convert-sorted-list-to-binary-search-tree"},"content":{"kind":"string","value":"<p>Given the <code>head</code> of a singly linked list where elements are sorted in <strong>ascending order</strong>, convert <em>it to a </em><span data-keyword=\"height-balanced\"><strong><em>height-balanced</em></strong></span> <em>binary search tree</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/08/17/linked.jpg\" style=\"width: 500px; height: 388px;\" />\n<pre>\n<strong>Input:</strong> head = [-10,-3,0,5,9]\n<strong>Output:</strong> [0,-3,9,-10,null,5]\n<strong>Explanation:</strong> One possible answer is [0,-3,9,-10,null,5], which represents the shown height balanced BST.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> head = []\n<strong>Output:</strong> []\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li>The number of nodes in <code>head</code> is in the range <code>[0, 2 * 10<sup>4</sup>]</code>.</li>\n\t<li><code>-10<sup>5</sup> <= Node.val <= 10<sup>5</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":62.737727705193095,"string":"62.737728"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["linked-list","divide-and-conquer","tree","binary-search-tree","binary-tree"],"string":"[\n \"linked-list\",\n \"divide-and-conquer\",\n \"tree\",\n \"binary-search-tree\",\n \"binary-tree\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"72\", 0.0415], [\"77\", 0.0415], [\"78\", 0.0415], [\"79\", 0.1246], [\"80\", 0.0415], [\"81\", 0.0831], [\"82\", 0.2493], [\"83\", 0.4155], [\"84\", 0.4985], [\"85\", 0.5401], [\"86\", 1.2879], [\"87\", 1.2048], [\"88\", 1.1633], [\"89\", 1.8695], [\"90\", 2.4927], [\"91\", 3.0744], [\"92\", 3.0328], [\"93\", 3.7391], [\"94\", 4.3207], [\"95\", 4.1545], [\"96\", 4.6115], [\"97\", 4.3207], [\"98\", 4.1545], [\"99\", 6.0656], [\"100\", 4.3623], [\"101\", 4.4869], [\"102\", 6.0656], [\"103\", 4.57], [\"104\", 4.6531], [\"105\", 3.8637], [\"106\", 2.9497], [\"107\", 2.6589], [\"108\", 2.2435], [\"109\", 1.7034], [\"110\", 2.2435], [\"111\", 1.6618], [\"112\", 1.3295], [\"113\", 1.0386], [\"114\", 0.7478], [\"115\", 0.914], [\"116\", 0.6647], [\"117\", 0.6232], [\"118\", 0.457]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"19200\", 0.0831], [\"19300\", 0.5401], [\"19400\", 2.3681], [\"19500\", 16.3689], [\"19600\", 17.5322], [\"19700\", 0.9555], [\"19800\", 0.0415], [\"19900\", 0.0415], [\"20000\", 0.0415], [\"20200\", 0.0415], [\"20400\", 0.1246], [\"20500\", 0.1246], [\"20600\", 0.3324], [\"20700\", 3.5729], [\"20800\", 19.9418], [\"20900\", 18.8617], [\"21000\", 4.0715], [\"21100\", 6.4811]]}"},"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\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 sortedListToBST(self, head: ListNode) -> TreeNode:\n if not head:\n return None\n if not head.next:\n return TreeNode(head.val)\n middle = self.getMiddle(head)\n root = TreeNode(middle.val)\n root.right = self.sortedListToBST(middle.next)\n middle.next = None\n root.left = self.sortedListToBST(head)\n return root\n \n def getMiddle(self, head: ListNode) -> ListNode:\n fast = head\n slow = head\n prev = head\n while fast and fast.next:\n fast = fast.next.next\n prev = slow\n slow = slow.next\n prev.next = None\n return slow ","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\n# Definition for a binary tree node.\nclass TreeNode:\n def __init__(self, val=0, left=None, right=None):\n self.left = left\n self.val = val\n self.right = right\nclass Solution:\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n temp=[]\n while head:\n temp.append(head.val)\n head=head.next\n def construct(temp,i,n):\n if i>n:\n return None\n mid=(i+n)//2\n root=TreeNode(temp[mid])\n root.left=construct(temp,i,mid-1)\n root.right=construct(temp,mid+1,n)\n return root\n n=len(temp)-1\n root=construct(temp,0,n)\n return root\n ","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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n arr = []\n curr = head\n while curr:\n arr.append(curr.val)\n curr = curr.next\n def helper(l,r):\n if l>r:\n return None\n m = (l+r)//2\n root = TreeNode(arr[m])\n root.right = helper(m+1,r)\n root.left = helper(l,m-1)\n return root\n return helper(0, len(arr)-1)","runtime":"78"},{"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# 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 dfs(self, l, h):\n if l>h:\n return None\n m = l + (h-l)//2\n ls = self.dfs(l, m-1)\n root = TreeNode(self.node.val)\n self.node = self.node.next\n root.left = ls\n root.right = self.dfs(m+1, h)\n return root\n\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if not head:\n return head\n if not head.next:\n return TreeNode(head.val)\n fast = head\n self.node = head\n l = 0\n while(fast):\n l += 1\n fast = fast.next\n return self.dfs(0, l-1)\n\n\n ","runtime":"79"},{"code":"from typing import Optional\nfrom collections import deque\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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n # Convert the linked list to an array\n def convert_to_array(head):\n array = []\n while head:\n array.append(head.val)\n head = head.next\n return array\n \n # Recursive function to convert sorted array to BST\n def sorted_array_to_bst(start, end):\n if start > end:\n return None\n \n mid = (start + end) // 2\n root = TreeNode(array[mid])\n \n root.left = sorted_array_to_bst(start, mid - 1)\n root.right = sorted_array_to_bst(mid + 1, end)\n \n return root\n \n # Convert linked list to array\n array = convert_to_array(head)\n \n # Build BST from sorted array\n return sorted_array_to_bst(0, len(array) - 1)\n","runtime":"80"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n\n if not head:\n return None\n if not head.next:\n return TreeNode(head.val)\n\n slow, fast = head, head.next.next\n \n while fast and fast.next:\n fast = fast.next.next\n slow = slow.next\n \n root = slow.next\n slow.next = None\n rootNode = TreeNode(root.val)\n \n rootNode.left = self.sortedListToBST(head)\n rootNode.right = self.sortedListToBST(root.next)\n\n return rootNode\n \n","runtime":"81"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n \n arr = []\n \n while head:\n arr.append(head.val)\n head = head.next\n \n def recur(left, right):\n if left > right:\n return None\n \n mid = (left + right) // 2\n \n node = ListNode(arr[mid])\n node.left = recur(left, mid - 1)\n node.right = recur(mid + 1, right)\n \n return node\n \n return recur(0, len(arr) - 1)\n ","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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def find_size(head):\n ptr = head\n size = 0\n while ptr:\n size += 1\n ptr = ptr.next\n return size\n\n size = find_size(head)\n self.current = head\n\n def convert(l, r):\n if l > r:\n return None\n mid = (l + r) // 2\n\n # First, construct the left subtree\n left = convert(l, mid - 1)\n\n # The parent node is the current node in the list\n node = TreeNode(self.current.val)\n node.left = left\n\n # Move to the next list node\n self.current = self.current.next\n\n # Construct the right subtree\n node.right = convert(mid + 1, r)\n return node\n\n return convert(0, size - 1)\n","runtime":"83"},{"code":"class Solution:\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if not head:\n return None\n if not head.next:\n return TreeNode(head.val)\n \n def find_middle(left, right):\n slow = left\n fast = left\n while fast != right and fast.next != right:\n slow = slow.next\n fast = fast.next.next\n return slow\n \n def convert_list_to_bst(left, right):\n if left == right:\n return None\n \n mid = find_middle(left, right)\n node = TreeNode(mid.val)\n \n node.left = convert_list_to_bst(left, mid)\n node.right = convert_list_to_bst(mid.next, right)\n \n return node\n \n return convert_list_to_bst(head, None)\n","runtime":"84"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def findmid(head):\n slow = fast = head\n while fast and fast.next:\n pre = slow\n slow = slow.next\n fast = fast.next.next\n return pre, slow\n\n def dfs(head):\n if not head: return None\n if not head.next:\n return TreeNode(val=head.val)\n pre, mid = findmid(head)\n node = TreeNode(val=mid.val)\n nxt = mid.next\n pre.next = None\n node.left = dfs(head)\n node.right = dfs(nxt)\n return node\n\n return dfs(head)\n\n ","runtime":"85"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n temp=head\n values=[]\n while temp:\n values.append(temp.val)\n temp=temp.next\n \n def create(arr):\n if len(arr)==0:\n return None\n elif len(arr)==1:\n return TreeNode(arr[0])\n else:\n n=len(arr)\n mid=n//2\n root=TreeNode(arr[mid])\n root.left=create(arr[:mid])\n root.right=create(arr[mid+1:])\n return root\n \n return create(values)","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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n array = []\n while head != None :\n array.append(head.val)\n head = head.next \n if len(array) == 0 : return None\n return self.convert(array)\n\n\n def convert(self,array,prev = None, pointer = None) :\n if len(array) == 0: return \n elif len(array) == 1 :\n if prev is not None :\n if pointer == 0 :\n prev.left = TreeNode(array[0])\n else:\n prev.right = TreeNode(array[0])\n return \n else:\n return TreeNode(array[0])\n root = TreeNode(array[int(len(array)/2)])\n if prev != None :\n if pointer == 0:\n prev.left = root\n else:\n prev.right = root\n self.convert(array[0:int(len(array)/2)],root,0)\n self.convert(array[int(len(array)/2)+1: len(array)],root,1)\n return root","runtime":"87"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n p=head\n l=[]\n while(p):\n l.append(p.val)\n p=p.next\n def bst(l):\n if(len(l)>0):\n mid=len(l)//2\n root=TreeNode(l[mid])\n if(root):\n root.left=bst(l[:mid])\n root.right=bst(l[mid+1:])\n return root\n else:\n return None\n return bst(l)\n\n \n ","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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n inorder = []\n while head:\n inorder.append(head.val)\n head = head.next\n\n def bst(inorder):\n if not inorder:\n return None\n\n mid = len(inorder) // 2\n node = TreeNode(inorder[mid])\n\n node.left = bst(inorder[:mid])\n node.right = bst(inorder[mid + 1 :])\n\n return node\n\n return bst(inorder)\n","runtime":"89"},{"code":"class Solution:\n\n def sortedListToBST(self, head: ListNode) -> TreeNode:\n\n def findMid(head: ListNode) -> ListNode:\n\n prev = None\n\n slow = head\n\n fast = head\n\n while fast and fast.next:\n\n prev = slow\n\n slow = slow.next\n\n fast = fast.next.next\n\n prev.next = None\n\n return slow\n\n if not head:\n\n return None\n\n if not head.next:\n\n return TreeNode(head.val)\n\n mid = findMid(head)\n\n root = TreeNode(mid.val)\n\n root.left = self.sortedListToBST(head)\n\n root.right = self.sortedListToBST(mid.next)\n\n return root","runtime":"89"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n\n if not head:\n return None\n\n slow, fast = head, head\n while fast and fast.next:\n slow = slow.next\n fast = fast.next.next\n\n mid = slow\n\n cur = head\n while cur and cur.next != mid:\n cur = cur.next\n if cur:\n cur.next = None\n\n root = TreeNode(mid.val)\n root.left = self.sortedListToBST(head) if head != mid else None\n root.right = self.sortedListToBST(mid.next)\n\n return root\n ","runtime":"90"},{"code":"class Solution:\n def sortedListToBST(self, head: ListNode) -> TreeNode:\n def findMiddle(left, right):\n slow, fast = left, left\n while fast != right and fast.next != right:\n slow = slow.next\n fast = fast.next.next\n return slow\n \n def convertListToBST(left, right):\n if left == right:\n return None\n \n mid = findMiddle(left, right)\n root = TreeNode(mid.val)\n root.left = convertListToBST(left, mid)\n root.right = convertListToBST(mid.next, right)\n return root\n \n return convertListToBST(head, None)","runtime":"90"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if not head: return None\n\n nums = []\n while head:\n nums.append(head.val)\n head = head.next\n ## End of while loop\n\n length = len(nums)\n index = length // 2\n root = TreeNode(nums[index])\n stack = [(root, 0, length, index, 'LEFT')]\n while stack:\n node, start, end, index, which = stack.pop()\n if which == 'LEFT':\n stack.append((node, start, end, index, 'RIGHT'))\n if start < index:\n lindex = (start+index)//2\n node.left = TreeNode(nums[lindex])\n stack.append((node.left, start, index, lindex, 'LEFT'))\n else:\n if index+1 < end:\n rindex = (index+1+end)//2\n node.right = TreeNode(nums[rindex])\n stack.append((node.right, index+1, end, rindex, 'LEFT'))\n\n return root","runtime":"91"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n main_list = []\n while head:\n main_list.append(head.val)\n head = head.next\n\n # the median is the root node\n def recursive(curr_list):\n if curr_list == []:\n return None\n\n mid = len(curr_list)//2\n root = TreeNode(curr_list[mid])\n if len(curr_list) == 1:\n return root\n \n root.left = recursive(curr_list[:mid])\n root.right = recursive(curr_list[mid+1:])\n return root\n \n return recursive(main_list)\n ","runtime":"91"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if not head: \n return None\n if not head.next:\n return TreeNode(head.val)\n s = f = head\n pre = None\n while f and f.next:\n pre = s\n s = s.next\n f = f.next.next\n pre.next = None\n root = TreeNode(s.val)\n root.left = self.sortedListToBST(head)\n root.right = self.sortedListToBST(s.next)\n return root\n \n \n ","runtime":"92"},{"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# 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 findMidLinkedList(self, head):\n if not head:\n return None\n \n pre = None\n slow = head\n fast = head\n\n while fast and fast.next:\n pre = slow\n slow = slow.next\n fast = fast.next.next\n \n if pre:\n pre.next = None\n \n return slow\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if not head:\n return None\n if not head.next:\n return TreeNode(val=head.val)\n \n mid = self.findMidLinkedList(head)\n if not mid: \n return None\n root = TreeNode(mid.val)\n root.left = self.sortedListToBST(head)\n root.right = self.sortedListToBST(mid.next)\n\n return root","runtime":"92"},{"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# 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 sortedListToBST(self, head: ListNode) -> TreeNode:\n if not head:\n return None\n if not head.next:\n return TreeNode(head.val)\n \n midNode = self.getMiddle(head)\n root = TreeNode(midNode.val)\n root.right = self.sortedListToBST(midNode.next)\n midNode.next = None\n root.left = self.sortedListToBST(head)\n return root\n\n def getMiddle(self, head: ListNode) -> ListNode:\n fast = head\n slow = head \n prev = None\n\n while fast and fast.next:\n prev = slow\n fast = fast.next.next\n slow = slow.next\n prev.next = None\n return slow\n ","runtime":"93"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n\n if not head:\n return None\n \n if not head.next: \n return TreeNode(head.val)\n\n prev, slow, fast = None, head, head \n\n while fast and fast.next:\n prev = slow\n slow = slow.next\n fast = fast.next.next\n \n if prev: \n prev.next = None\n \n root = TreeNode(slow.val)\n root.right = self.sortedListToBST(slow.next)\n root.left = self.sortedListToBST(head)\n return root\n \n \n\n\n \n ","runtime":"93"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if not head:\n return None\n \n if head.next == None:\n return TreeNode(head.val)\n \n prev = ListNode(-1, head)\n slow = fast = head\n while fast and fast.next:\n prev = prev.next\n slow = slow.next\n fast = fast.next.next\n \n prev.next = None\n\n root = TreeNode(\n val = slow.val,\n left = self.sortedListToBST(head),\n right = self.sortedListToBST(slow.next)\n )\n\n return root","runtime":"94"},{"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# 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 sortedListToBST(self, head: ListNode) -> TreeNode:\n def buildBST(nums, start, end):\n if start > end:\n return None\n mid = (start + end) >> 1\n return TreeNode(\n nums[mid], buildBST(nums, start, mid - 1), buildBST(nums, mid + 1, end)\n )\n\n nums = []\n while head:\n nums.append(head.val)\n head = head.next\n return buildBST(nums, 0, len(nums) - 1)","runtime":"95"},{"code":"from typing import Optional\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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def find_middle(left: Optional[ListNode], right: Optional[ListNode]) -> Optional[ListNode]:\n slow = left\n fast = left\n while fast != right and fast.next != right:\n slow = slow.next\n fast = fast.next.next\n return slow\n \n def convert_list_to_bst(left: Optional[ListNode], right: Optional[ListNode]) -> Optional[TreeNode]:\n if left == right:\n return None\n \n mid = find_middle(left, right)\n node = TreeNode(mid.val)\n \n node.left = convert_list_to_bst(left, mid)\n node.right = convert_list_to_bst(mid.next, right)\n \n return node\n \n return convert_list_to_bst(head, None)\n","runtime":"95"},{"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# 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\n def listtoarray(self,head:ListNode)->list:\n vals=[]\n while head:\n # print('head',head)\n vals.append(head.val)\n head=head.next\n return vals\n def sortedListToBST(self, head: ListNode) -> TreeNode: \n\n values = self.listtoarray(head)\n \n def sortedArrayToBST(left: int, right: int) -> Optional[TreeNode]:\n if left > right:\n return None\n \n mid = (left + right) // 2\n root = TreeNode(values[mid])\n root.left = sortedArrayToBST(left, mid - 1)\n root.right = sortedArrayToBST(mid + 1, right)\n return root\n \n return sortedArrayToBST(0, len(values) - 1)\n \n \n\n ","runtime":"96"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if head == None:\n return None\n if head.next == None:\n return TreeNode(head.val, None, None)\n \n prev = None\n slow = head\n fast = head\n while fast != None and fast.next != None:\n prev = slow\n slow = slow.next\n fast = fast.next.next\n \n if prev != None:\n prev.next = None\n\n current_root = TreeNode(slow.val, None, None)\n left_root = self.sortedListToBST(head)\n right_root = self.sortedListToBST(slow.next)\n \n current_root.left = left_root\n current_root.right = right_root\n\n return current_root","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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def dfs(node, stopNode):\n if not node or node == stopNode:\n return None\n \n if node.next == stopNode:\n return TreeNode(node.val)\n\n tail = node\n middle = node\n turn = 0\n while tail and tail != stopNode:\n if turn == 1:\n middle = middle.next\n turn = 1 - turn\n tail = tail.next\n \n myRoot = TreeNode(middle.val)\n myRoot.left = dfs(node, middle)\n myRoot.right = dfs(middle.next, stopNode)\n return myRoot\n \n return dfs(head, None)\n\n ","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\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\n\nclass Solution:\n def findMiddle(self, head: ListNode) -> ListNode:\n # This helper function finds the middle node of the linked list\n prev = None\n slow = head\n fast = head\n \n # Move fast pointer two steps and slow pointer one step until fast reaches the end\n while fast and fast.next:\n prev = slow\n slow = slow.next\n fast = fast.next.next\n \n # Disconnect the left half from the middle to split the list\n if prev:\n prev.next = None\n \n return slow\n \n def sortedListToBST(self, head: ListNode) -> TreeNode:\n # Base cases\n if not head:\n return None\n if not head.next:\n return TreeNode(head.val)\n \n # Find the middle of the list\n mid = self.findMiddle(head)\n \n # The middle element becomes the root\n root = TreeNode(mid.val)\n \n # Recursively convert the left half to the left subtree\n root.left = self.sortedListToBST(head)\n \n # Recursively convert the right half to the right subtree\n root.right = self.sortedListToBST(mid.next)\n \n return root\n","runtime":"98"},{"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# 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 convertListToValues(self, head):\n out = []\n while head:\n out.append(head.val)\n head = head.next\n return out\n\n def convertListToBST(self, l, r, listt):\n if l > r:\n return None\n\n midpoint = (l + r) // 2\n curr_val = listt[midpoint]\n node = TreeNode(curr_val)\n if l == r:\n return node\n node.left = self.convertListToBST(l, midpoint - 1, listt)\n node.right = self.convertListToBST(midpoint + 1, r, listt)\n return node\n\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n values = self.convertListToValues(head)\n return self.convertListToBST(0, len(values) - 1, values)","runtime":"98"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n\n if not head:\n return None\n\n def printer(node):\n print(node)\n if not node:\n return None\n printer(node.left)\n printer(node.right)\n \n \n\n def find_mid(node, last):\n\n slow = node\n fast = node\n\n while fast != last and fast.next != last:\n slow = slow.next\n fast = fast.next.next\n\n return slow\n\n # print(find_mid(head, None))\n\n \n def back(l, r):\n \n if l == r:\n return None\n\n mid = find_mid(l, r)\n\n node = TreeNode(mid.val)\n\n node.left = back(l, mid)\n node.right = back(mid.next, r)\n\n return node\n \n printer(None)\n\n return back(head, None)\n\n","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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n # height balancing only needs to be done if less than 2**depth\n\n # start in the middle\n # m - l - r \n\n # root = Node(head[m])\n # left = head[l]\n # right = head[r]\n # root.left = left\n node = head\n nums = []\n # nums.append(node)\n while node:\n nums.append(node.val)\n node = node.next\n\n\n def helper(l, r):\n if l > r: \n return None\n \n m = (l+r)//2\n node = TreeNode(nums[m])\n node.left = helper(l, m-1)\n node.right = helper(m+1, r)\n return node\n return helper(0, len(nums)-1)\n\n\n m = len(head)//2\n root = TreeNode(head[m])\n l, r = m-1, m+1\n if l > 0:\n root.left = TreeNode(head[l])\n sortedListToBST()\n if r < len(head):\n root.right = TreeNode(head[r])\n \n\n\n l, r = m-1, m+1\n q = deque()\n q.append(root)\n while l > 0 or r < len(head):\n pass\n \n while len(q) > 0:\n node = q.popleft()\n leftNode = head[l]\n rightNode = head[r]\n if l > 0:\n # append last left element\n pass\n else:\n # append last right element\n pass\n ","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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if not head:\n return head\n if not head.next:\n return TreeNode(head.val)\n mid = self.findMid(head)\n next = mid.next\n mid.next = None\n root = TreeNode(mid.val)\n root.left = self.sortedListToBST(head)\n root.right = self.sortedListToBST(next)\n return root\n \n def findMid(self,head):\n fast = head\n slow = head\n prev = None\n while fast and fast.next:\n fast = fast.next.next\n prev = slow\n slow = slow.next\n if prev:\n prev.next = None\n return slow","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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n lst = []\n cur = head\n while cur:\n lst.append(cur.val)\n cur = cur.next\n\n def dfs(i, j):\n if i > j: return\n root = (i+j) // 2\n return TreeNode(val=lst[root], left=dfs(i, root-1), right=dfs(root+1, j))\n\n return dfs(0, len(lst)-1)\n ","runtime":"101"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def findmiddle(start: Optional[ListNode], end: Optional[ListNode]) -> Optional[ListNode]:\n slow = fast = start\n while fast != end and fast.next != end:\n slow = slow.next\n fast = fast.next.next\n return slow\n if not head:\n return None\n def convert(start: Optional[ListNode], end: Optional[ListNode]) -> Optional[TreeNode]:\n if start == end:\n return None\n mid = findmiddle(start, end)\n node = TreeNode(mid.val)\n node.left = convert(start, mid)\n node.right = convert(mid.next, end)\n return node\n return convert(head, None)","runtime":"102"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def middle(curr = None):\n if curr:\n prev = slow = fast = curr\n while fast and fast.next:\n prev = slow\n slow = slow.next\n fast = fast.next.next\n return prev\n def helper(curr=None):\n if curr:\n pre_mid = middle(curr)\n if not pre_mid.next:\n return TreeNode(pre_mid.val)\n parent = pre_mid.next\n pre_mid.next = None\n root = TreeNode(parent.val)\n root.right = helper(parent.next) \n root.left = helper(curr)\n return root\n return helper(head)\n ","runtime":"102"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n\n def ln(node):\n cnt = 0\n while node:\n cnt += 1\n node = node.next\n return cnt\n \n l = ln(head)\n\n def back(l, r): \n nonlocal head\n \n if l == r:\n return None\n\n mid = (l + r) // 2\n\n left = back(l, mid)\n\n node = TreeNode(head.val)\n node.left = left\n\n head = head.next \n \n node.right = back(mid + 1, r)\n \n return node\n \n return back(0, l)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n # if not head:\n # return None\n\n # def printer(node):\n # print(node)\n # if not node:\n # return None\n # printer(node.left)\n # printer(node.right)\n \n \n\n # def find_mid(node, last):\n\n # slow = node\n # fast = node\n\n # while fast != last and fast.next != last:\n # slow = slow.next\n # fast = fast.next.next\n\n # return slow\n\n # def back(l, r):\n \n # if l == r:\n # return None\n\n # mid = find_mid(l, r)\n\n # node = TreeNode(mid.val)\n\n # node.left = back(l, mid)\n # node.right = back(mid.next, r)\n\n # return node\n \n # printer(None)\n\n # return back(head, None)\n\n","runtime":"103"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if not head:\n return None\n if not head.next:\n return TreeNode(head.val)\n slow = fast = head\n pre = None\n\n while fast and fast.next:\n pre = slow\n slow = slow.next\n fast = fast.next.next\n \n root = TreeNode(slow.val)\n pre.next = None\n root.left = self.sortedListToBST(head)\n root.right = self.sortedListToBST(slow.next)\n return root","runtime":"103"},{"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# 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 \n def sortedListToBST(self, head):\n if(head == None):\n return None\n \n if(head.next == None):\n return TreeNode(head.val)\n\n slow = head\n fast = head\n before = head\n \n while fast != None and fast.next != None:\n before = slow\n slow = slow.next\n fast = fast.next.next\n\n right = slow.next\n if(before != None):\n before.next = None\n\n root = TreeNode(slow.val)\n\n root.left = self.sortedListToBST(head)\n root.right = self.sortedListToBST(right)\n\n return root","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\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 sortedListToBST(self, head: ListNode) -> TreeNode:\n def buildBST(nums, start, end):\n if start > end:\n return None\n mid = (start + end) >> 1\n return TreeNode(\n nums[mid], buildBST(nums, start, mid - 1), buildBST(nums, mid + 1, end)\n )\n\n nums = []\n while head:\n nums.append(head.val)\n head = head.next\n return buildBST(nums, 0, len(nums) - 1)\n ","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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def findmid(head):\n slow = fast = head\n while fast and fast.next and fast.next.next and fast.next.next.next:\n slow = slow.next\n fast = fast.next.next\n return slow\n\n def dfs(head):\n if not head: return None\n if not head.next:\n return TreeNode(val=head.val)\n mid = findmid(head)\n node = TreeNode(val=mid.next.val)\n nxt = mid.next.next\n mid.next = None\n node.left = dfs(head)\n node.right = dfs(nxt)\n return node\n\n return dfs(head)\n\n ","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\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 flatList(self, head):\n flattenList = []\n while(head):\n flattenList.append(head.val)\n head = head.next\n return flattenList\n \n def arrayToBST(self, nums):\n n = len(nums)\n if n == 0:\n return None\n\n middleIndex = n // 2\n middleValue = nums.pop(middleIndex)\n return TreeNode(middleValue, self.arrayToBST(nums[:middleIndex]), self.arrayToBST(nums[middleIndex:]))\n\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n nums = self.flatList(head)\n return self.arrayToBST(nums)","runtime":"108"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if not head:\n return None\n if not head.next:\n return TreeNode(head.val)\n slow, fast = head, head.next.next\n while fast and fast.next:\n slow = slow.next\n fast = fast.next.next\n root = TreeNode(slow.next.val)\n root.right = self.sortedListToBST(slow.next.next)\n slow.next = None\n root.left = self.sortedListToBST(head)\n return root\n\n\n","runtime":"109"},{"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# 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\n def length(self, head):\n n = 0\n while head:\n n += 1\n head = head.next\n \n return n\n\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n\n def inorder(left, right):\n nonlocal head\n if left > right:\n return None\n\n mid = (left + right) // 2\n left = inorder(left, mid - 1)\n\n root = TreeNode(head.val)\n root.left = left\n\n head = head.next\n\n root.right = inorder(mid + 1, right)\n return root\n \n return inorder(0, self.length(head) - 1)","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\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 flatList(self, head):\n flattenList = []\n while(head):\n flattenList.append(head.val)\n head = head.next\n return flattenList\n \n def arrayToBST(self, nums):\n n = len(nums)\n if n == 0:\n return None\n\n middleIndex = n // 2\n middleValue = nums.pop(middleIndex)\n return TreeNode(middleValue, self.arrayToBST(nums[:middleIndex]), self.arrayToBST(nums[middleIndex:]))\n\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n nums = self.flatList(head)\n return self.arrayToBST(nums)","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\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 BST(self, vals):\n m = len(vals)//2\n root = TreeNode(vals[m])\n left,right = [],[]\n for i in range(len(vals)):\n if i<m: left.append(vals[i])\n if i>m: right.append(vals[i])\n if len(left)>0: root.left = self.BST(left)\n if len(right)>0: root.right = self.BST(right)\n return root\n\n def getvals(self,head):\n out = []\n if head==None: return out\n out.append(head.val)\n while head.next:\n head=head.next\n out.append(head.val)\n return out\n\n\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if head==None: return None\n vals = self.getvals(head)\n if len(vals)==0: return TreeNode(vals[0])\n return self.BST(vals)\n","runtime":"111"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def toBST(head, tail):\n if head == tail:\n return None\n\n slow, fast = head, head\n\n while fast != tail and fast.next != tail:\n slow = slow.next\n fast = fast.next.next\n\n node = TreeNode(val=slow.val)\n node.left = toBST(head, slow)\n node.right = toBST(slow.next, tail)\n\n return node\n\n return toBST(head, None)\n\n \n\n ","runtime":"111"},{"code":"class Solution:\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n nums = []\n curr = head\n while curr:\n nums.append(curr.val)\n curr = curr.next\n\n def bst(nums, l, r):\n if l > r:\n return\n mid = (l + r) // 2\n node = TreeNode(nums[mid])\n node.left = bst(nums, l, mid - 1)\n node.right = bst(nums, mid + 1, r)\n return node\n\n return bst(nums, 0, len(nums) - 1)\n","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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n # function to find the middle of linked list \n def middle(head):\n prev = None\n slow = head\n fast = head\n\n while fast and fast.next:\n prev = slow\n fast = fast.next.next\n slow = slow.next\n if prev:\n prev.next = None\n return slow\n\n if not head:\n return None\n \n mid = middle(head)\n root = TreeNode(mid.val)\n\n if head == mid:\n return root\n root.left = self.sortedListToBST(head)\n root.right = self.sortedListToBST(mid.next)\n\n return root","runtime":"113"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n nums = []\n while head is not None:\n nums.append(head.val)\n head = head.next\n \n def dfs(l, r):\n if l > r:\n return None\n mid = (l + r)//2\n root = TreeNode(nums[mid])\n \n root.left = dfs(l, mid - 1)\n root.right = dfs(mid + 1, r)\n return root\n \n return dfs(0, len(nums) - 1)","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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def addMiddle(left, right):\n if right < left:\n return\n mid = (left + right) // 2\n self.insert(tree, nodeList[mid])\n addMiddle(left, mid-1)\n addMiddle(mid+1, right)\n \n nodeList = []\n curr = head\n while curr:\n nodeList.append(curr.val)\n curr = curr.next\n \n tree = TreeNode(float('inf'))\n addMiddle(0, len(nodeList)-1)\n return tree.left\n \n def insert(self, node, val):\n if val < node.val:\n if node.left:\n self.insert(node.left, val)\n else:\n node.left = TreeNode(val)\n else:\n if node.right:\n self.insert(node.right, val)\n else:\n node.right = TreeNode(val)","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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if head==None:\n return None\n if head.next==None:\n return TreeNode(head.val)\n slow,fast=head,head.next\n while fast.next and fast.next.next:\n slow=slow.next\n fast=fast.next.next\n mid=slow.next\n slow.next=None\n root=TreeNode(mid.val)\n root.left=self.sortedListToBST(head)\n root.right=self.sortedListToBST(mid.next)\n return root\n #please upvote me it would encourage me alot","runtime":"116"},{"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# 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\n def findMiddle(self, head: ListNode) -> ListNode:\n\n prev = None\n slow = head\n fast = head\n\n while fast and fast.next:\n prev = slow\n slow = slow.next\n fast = fast.next.next\n \n if prev:\n prev.next = None\n \n return slow\n\n def sortedListToBST(self, head: ListNode) -> TreeNode:\n\n if not head:\n return None\n \n mid = self.findMiddle(head)\n root = TreeNode(mid.val)\n\n if head == mid:\n return root\n\n root.left = self.sortedListToBST(head)\n root.right = self.sortedListToBST(mid.next)\n return root\n ","runtime":"117"},{"code":"class Solution:\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if not head: return None\n if not head.next: return TreeNode(head.val)\n\n prev, slow, fast = None, head, head\n while fast and fast.next:\n prev = slow\n slow = slow.next\n fast = fast.next.next\n \n prev.next = None\n root = TreeNode(slow.val)\n root.left = self.sortedListToBST(head)\n root.right = self.sortedListToBST(slow.next)\n return root\n \n ","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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def addMiddle(left, right):\n if right < left:\n return\n mid = (left + right) // 2\n self.insert(tree, nodeList[mid])\n addMiddle(left, mid-1)\n addMiddle(mid+1, right)\n \n nodeList = []\n curr = head\n while curr:\n nodeList.append(curr.val)\n curr = curr.next\n \n tree = TreeNode(float('inf'))\n addMiddle(0, len(nodeList)-1)\n return tree.left\n \n def insert(self, node, val):\n if val < node.val:\n if node.left:\n self.insert(node.left, val)\n else:\n node.left = TreeNode(val)\n else:\n if node.right:\n self.insert(node.right, val)\n else:\n node.right = TreeNode(val)","runtime":"118"}],"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\\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 sortedListToBST(self, head: ListNode) -> TreeNode:\\n if not head:\\n return None\\n if not head.next:\\n return TreeNode(head.val)\\n middle = self.getMiddle(head)\\n root = TreeNode(middle.val)\\n root.right = self.sortedListToBST(middle.next)\\n middle.next = None\\n root.left = self.sortedListToBST(head)\\n return root\\n \\n def getMiddle(self, head: ListNode) -> ListNode:\\n fast = head\\n slow = head\\n prev = head\\n while fast and fast.next:\\n fast = fast.next.next\\n prev = slow\\n slow = slow.next\\n prev.next = None\\n return slow \",\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\\n# Definition for a binary tree node.\\nclass TreeNode:\\n def __init__(self, val=0, left=None, right=None):\\n self.left = left\\n self.val = val\\n self.right = right\\nclass Solution:\\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n temp=[]\\n while head:\\n temp.append(head.val)\\n head=head.next\\n def construct(temp,i,n):\\n if i>n:\\n return None\\n mid=(i+n)//2\\n root=TreeNode(temp[mid])\\n root.left=construct(temp,i,mid-1)\\n root.right=construct(temp,mid+1,n)\\n return root\\n n=len(temp)-1\\n root=construct(temp,0,n)\\n return root\\n \",\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n arr = []\\n curr = head\\n while curr:\\n arr.append(curr.val)\\n curr = curr.next\\n def helper(l,r):\\n if l>r:\\n return None\\n m = (l+r)//2\\n root = TreeNode(arr[m])\\n root.right = helper(m+1,r)\\n root.left = helper(l,m-1)\\n return root\\n return helper(0, len(arr)-1)\",\n \"runtime\": \"78\"\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# 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 dfs(self, l, h):\\n if l>h:\\n return None\\n m = l + (h-l)//2\\n ls = self.dfs(l, m-1)\\n root = TreeNode(self.node.val)\\n self.node = self.node.next\\n root.left = ls\\n root.right = self.dfs(m+1, h)\\n return root\\n\\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if not head:\\n return head\\n if not head.next:\\n return TreeNode(head.val)\\n fast = head\\n self.node = head\\n l = 0\\n while(fast):\\n l += 1\\n fast = fast.next\\n return self.dfs(0, l-1)\\n\\n\\n \",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"from typing import Optional\\nfrom collections import deque\\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n # Convert the linked list to an array\\n def convert_to_array(head):\\n array = []\\n while head:\\n array.append(head.val)\\n head = head.next\\n return array\\n \\n # Recursive function to convert sorted array to BST\\n def sorted_array_to_bst(start, end):\\n if start > end:\\n return None\\n \\n mid = (start + end) // 2\\n root = TreeNode(array[mid])\\n \\n root.left = sorted_array_to_bst(start, mid - 1)\\n root.right = sorted_array_to_bst(mid + 1, end)\\n \\n return root\\n \\n # Convert linked list to array\\n array = convert_to_array(head)\\n \\n # Build BST from sorted array\\n return sorted_array_to_bst(0, len(array) - 1)\\n\",\n \"runtime\": \"80\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n\\n if not head:\\n return None\\n if not head.next:\\n return TreeNode(head.val)\\n\\n slow, fast = head, head.next.next\\n \\n while fast and fast.next:\\n fast = fast.next.next\\n slow = slow.next\\n \\n root = slow.next\\n slow.next = None\\n rootNode = TreeNode(root.val)\\n \\n rootNode.left = self.sortedListToBST(head)\\n rootNode.right = self.sortedListToBST(root.next)\\n\\n return rootNode\\n \\n\",\n \"runtime\": \"81\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n \\n arr = []\\n \\n while head:\\n arr.append(head.val)\\n head = head.next\\n \\n def recur(left, right):\\n if left > right:\\n return None\\n \\n mid = (left + right) // 2\\n \\n node = ListNode(arr[mid])\\n node.left = recur(left, mid - 1)\\n node.right = recur(mid + 1, right)\\n \\n return node\\n \\n return recur(0, len(arr) - 1)\\n \",\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def find_size(head):\\n ptr = head\\n size = 0\\n while ptr:\\n size += 1\\n ptr = ptr.next\\n return size\\n\\n size = find_size(head)\\n self.current = head\\n\\n def convert(l, r):\\n if l > r:\\n return None\\n mid = (l + r) // 2\\n\\n # First, construct the left subtree\\n left = convert(l, mid - 1)\\n\\n # The parent node is the current node in the list\\n node = TreeNode(self.current.val)\\n node.left = left\\n\\n # Move to the next list node\\n self.current = self.current.next\\n\\n # Construct the right subtree\\n node.right = convert(mid + 1, r)\\n return node\\n\\n return convert(0, size - 1)\\n\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if not head:\\n return None\\n if not head.next:\\n return TreeNode(head.val)\\n \\n def find_middle(left, right):\\n slow = left\\n fast = left\\n while fast != right and fast.next != right:\\n slow = slow.next\\n fast = fast.next.next\\n return slow\\n \\n def convert_list_to_bst(left, right):\\n if left == right:\\n return None\\n \\n mid = find_middle(left, right)\\n node = TreeNode(mid.val)\\n \\n node.left = convert_list_to_bst(left, mid)\\n node.right = convert_list_to_bst(mid.next, right)\\n \\n return node\\n \\n return convert_list_to_bst(head, None)\\n\",\n \"runtime\": \"84\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def findmid(head):\\n slow = fast = head\\n while fast and fast.next:\\n pre = slow\\n slow = slow.next\\n fast = fast.next.next\\n return pre, slow\\n\\n def dfs(head):\\n if not head: return None\\n if not head.next:\\n return TreeNode(val=head.val)\\n pre, mid = findmid(head)\\n node = TreeNode(val=mid.val)\\n nxt = mid.next\\n pre.next = None\\n node.left = dfs(head)\\n node.right = dfs(nxt)\\n return node\\n\\n return dfs(head)\\n\\n \",\n \"runtime\": \"85\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n temp=head\\n values=[]\\n while temp:\\n values.append(temp.val)\\n temp=temp.next\\n \\n def create(arr):\\n if len(arr)==0:\\n return None\\n elif len(arr)==1:\\n return TreeNode(arr[0])\\n else:\\n n=len(arr)\\n mid=n//2\\n root=TreeNode(arr[mid])\\n root.left=create(arr[:mid])\\n root.right=create(arr[mid+1:])\\n return root\\n \\n return create(values)\",\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n array = []\\n while head != None :\\n array.append(head.val)\\n head = head.next \\n if len(array) == 0 : return None\\n return self.convert(array)\\n\\n\\n def convert(self,array,prev = None, pointer = None) :\\n if len(array) == 0: return \\n elif len(array) == 1 :\\n if prev is not None :\\n if pointer == 0 :\\n prev.left = TreeNode(array[0])\\n else:\\n prev.right = TreeNode(array[0])\\n return \\n else:\\n return TreeNode(array[0])\\n root = TreeNode(array[int(len(array)/2)])\\n if prev != None :\\n if pointer == 0:\\n prev.left = root\\n else:\\n prev.right = root\\n self.convert(array[0:int(len(array)/2)],root,0)\\n self.convert(array[int(len(array)/2)+1: len(array)],root,1)\\n return root\",\n \"runtime\": \"87\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n p=head\\n l=[]\\n while(p):\\n l.append(p.val)\\n p=p.next\\n def bst(l):\\n if(len(l)>0):\\n mid=len(l)//2\\n root=TreeNode(l[mid])\\n if(root):\\n root.left=bst(l[:mid])\\n root.right=bst(l[mid+1:])\\n return root\\n else:\\n return None\\n return bst(l)\\n\\n \\n \",\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n inorder = []\\n while head:\\n inorder.append(head.val)\\n head = head.next\\n\\n def bst(inorder):\\n if not inorder:\\n return None\\n\\n mid = len(inorder) // 2\\n node = TreeNode(inorder[mid])\\n\\n node.left = bst(inorder[:mid])\\n node.right = bst(inorder[mid + 1 :])\\n\\n return node\\n\\n return bst(inorder)\\n\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n\\n def sortedListToBST(self, head: ListNode) -> TreeNode:\\n\\n def findMid(head: ListNode) -> ListNode:\\n\\n prev = None\\n\\n slow = head\\n\\n fast = head\\n\\n while fast and fast.next:\\n\\n prev = slow\\n\\n slow = slow.next\\n\\n fast = fast.next.next\\n\\n prev.next = None\\n\\n return slow\\n\\n if not head:\\n\\n return None\\n\\n if not head.next:\\n\\n return TreeNode(head.val)\\n\\n mid = findMid(head)\\n\\n root = TreeNode(mid.val)\\n\\n root.left = self.sortedListToBST(head)\\n\\n root.right = self.sortedListToBST(mid.next)\\n\\n return root\",\n \"runtime\": \"89\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n\\n if not head:\\n return None\\n\\n slow, fast = head, head\\n while fast and fast.next:\\n slow = slow.next\\n fast = fast.next.next\\n\\n mid = slow\\n\\n cur = head\\n while cur and cur.next != mid:\\n cur = cur.next\\n if cur:\\n cur.next = None\\n\\n root = TreeNode(mid.val)\\n root.left = self.sortedListToBST(head) if head != mid else None\\n root.right = self.sortedListToBST(mid.next)\\n\\n return root\\n \",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"class Solution:\\n def sortedListToBST(self, head: ListNode) -> TreeNode:\\n def findMiddle(left, right):\\n slow, fast = left, left\\n while fast != right and fast.next != right:\\n slow = slow.next\\n fast = fast.next.next\\n return slow\\n \\n def convertListToBST(left, right):\\n if left == right:\\n return None\\n \\n mid = findMiddle(left, right)\\n root = TreeNode(mid.val)\\n root.left = convertListToBST(left, mid)\\n root.right = convertListToBST(mid.next, right)\\n return root\\n \\n return convertListToBST(head, None)\",\n \"runtime\": \"90\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if not head: return None\\n\\n nums = []\\n while head:\\n nums.append(head.val)\\n head = head.next\\n ## End of while loop\\n\\n length = len(nums)\\n index = length // 2\\n root = TreeNode(nums[index])\\n stack = [(root, 0, length, index, 'LEFT')]\\n while stack:\\n node, start, end, index, which = stack.pop()\\n if which == 'LEFT':\\n stack.append((node, start, end, index, 'RIGHT'))\\n if start < index:\\n lindex = (start+index)//2\\n node.left = TreeNode(nums[lindex])\\n stack.append((node.left, start, index, lindex, 'LEFT'))\\n else:\\n if index+1 < end:\\n rindex = (index+1+end)//2\\n node.right = TreeNode(nums[rindex])\\n stack.append((node.right, index+1, end, rindex, 'LEFT'))\\n\\n return root\",\n \"runtime\": \"91\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n main_list = []\\n while head:\\n main_list.append(head.val)\\n head = head.next\\n\\n # the median is the root node\\n def recursive(curr_list):\\n if curr_list == []:\\n return None\\n\\n mid = len(curr_list)//2\\n root = TreeNode(curr_list[mid])\\n if len(curr_list) == 1:\\n return root\\n \\n root.left = recursive(curr_list[:mid])\\n root.right = recursive(curr_list[mid+1:])\\n return root\\n \\n return recursive(main_list)\\n \",\n \"runtime\": \"91\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if not head: \\n return None\\n if not head.next:\\n return TreeNode(head.val)\\n s = f = head\\n pre = None\\n while f and f.next:\\n pre = s\\n s = s.next\\n f = f.next.next\\n pre.next = None\\n root = TreeNode(s.val)\\n root.left = self.sortedListToBST(head)\\n root.right = self.sortedListToBST(s.next)\\n return root\\n \\n \\n \",\n \"runtime\": \"92\"\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# 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 findMidLinkedList(self, head):\\n if not head:\\n return None\\n \\n pre = None\\n slow = head\\n fast = head\\n\\n while fast and fast.next:\\n pre = slow\\n slow = slow.next\\n fast = fast.next.next\\n \\n if pre:\\n pre.next = None\\n \\n return slow\\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if not head:\\n return None\\n if not head.next:\\n return TreeNode(val=head.val)\\n \\n mid = self.findMidLinkedList(head)\\n if not mid: \\n return None\\n root = TreeNode(mid.val)\\n root.left = self.sortedListToBST(head)\\n root.right = self.sortedListToBST(mid.next)\\n\\n return root\",\n \"runtime\": \"92\"\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# 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 sortedListToBST(self, head: ListNode) -> TreeNode:\\n if not head:\\n return None\\n if not head.next:\\n return TreeNode(head.val)\\n \\n midNode = self.getMiddle(head)\\n root = TreeNode(midNode.val)\\n root.right = self.sortedListToBST(midNode.next)\\n midNode.next = None\\n root.left = self.sortedListToBST(head)\\n return root\\n\\n def getMiddle(self, head: ListNode) -> ListNode:\\n fast = head\\n slow = head \\n prev = None\\n\\n while fast and fast.next:\\n prev = slow\\n fast = fast.next.next\\n slow = slow.next\\n prev.next = None\\n return slow\\n \",\n \"runtime\": \"93\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n\\n if not head:\\n return None\\n \\n if not head.next: \\n return TreeNode(head.val)\\n\\n prev, slow, fast = None, head, head \\n\\n while fast and fast.next:\\n prev = slow\\n slow = slow.next\\n fast = fast.next.next\\n \\n if prev: \\n prev.next = None\\n \\n root = TreeNode(slow.val)\\n root.right = self.sortedListToBST(slow.next)\\n root.left = self.sortedListToBST(head)\\n return root\\n \\n \\n\\n\\n \\n \",\n \"runtime\": \"93\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if not head:\\n return None\\n \\n if head.next == None:\\n return TreeNode(head.val)\\n \\n prev = ListNode(-1, head)\\n slow = fast = head\\n while fast and fast.next:\\n prev = prev.next\\n slow = slow.next\\n fast = fast.next.next\\n \\n prev.next = None\\n\\n root = TreeNode(\\n val = slow.val,\\n left = self.sortedListToBST(head),\\n right = self.sortedListToBST(slow.next)\\n )\\n\\n return root\",\n \"runtime\": \"94\"\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# 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 sortedListToBST(self, head: ListNode) -> TreeNode:\\n def buildBST(nums, start, end):\\n if start > end:\\n return None\\n mid = (start + end) >> 1\\n return TreeNode(\\n nums[mid], buildBST(nums, start, mid - 1), buildBST(nums, mid + 1, end)\\n )\\n\\n nums = []\\n while head:\\n nums.append(head.val)\\n head = head.next\\n return buildBST(nums, 0, len(nums) - 1)\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"from typing import Optional\\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def find_middle(left: Optional[ListNode], right: Optional[ListNode]) -> Optional[ListNode]:\\n slow = left\\n fast = left\\n while fast != right and fast.next != right:\\n slow = slow.next\\n fast = fast.next.next\\n return slow\\n \\n def convert_list_to_bst(left: Optional[ListNode], right: Optional[ListNode]) -> Optional[TreeNode]:\\n if left == right:\\n return None\\n \\n mid = find_middle(left, right)\\n node = TreeNode(mid.val)\\n \\n node.left = convert_list_to_bst(left, mid)\\n node.right = convert_list_to_bst(mid.next, right)\\n \\n return node\\n \\n return convert_list_to_bst(head, None)\\n\",\n \"runtime\": \"95\"\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# 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\\n def listtoarray(self,head:ListNode)->list:\\n vals=[]\\n while head:\\n # print('head',head)\\n vals.append(head.val)\\n head=head.next\\n return vals\\n def sortedListToBST(self, head: ListNode) -> TreeNode: \\n\\n values = self.listtoarray(head)\\n \\n def sortedArrayToBST(left: int, right: int) -> Optional[TreeNode]:\\n if left > right:\\n return None\\n \\n mid = (left + right) // 2\\n root = TreeNode(values[mid])\\n root.left = sortedArrayToBST(left, mid - 1)\\n root.right = sortedArrayToBST(mid + 1, right)\\n return root\\n \\n return sortedArrayToBST(0, len(values) - 1)\\n \\n \\n\\n \",\n \"runtime\": \"96\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if head == None:\\n return None\\n if head.next == None:\\n return TreeNode(head.val, None, None)\\n \\n prev = None\\n slow = head\\n fast = head\\n while fast != None and fast.next != None:\\n prev = slow\\n slow = slow.next\\n fast = fast.next.next\\n \\n if prev != None:\\n prev.next = None\\n\\n current_root = TreeNode(slow.val, None, None)\\n left_root = self.sortedListToBST(head)\\n right_root = self.sortedListToBST(slow.next)\\n \\n current_root.left = left_root\\n current_root.right = right_root\\n\\n return current_root\",\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def dfs(node, stopNode):\\n if not node or node == stopNode:\\n return None\\n \\n if node.next == stopNode:\\n return TreeNode(node.val)\\n\\n tail = node\\n middle = node\\n turn = 0\\n while tail and tail != stopNode:\\n if turn == 1:\\n middle = middle.next\\n turn = 1 - turn\\n tail = tail.next\\n \\n myRoot = TreeNode(middle.val)\\n myRoot.left = dfs(node, middle)\\n myRoot.right = dfs(middle.next, stopNode)\\n return myRoot\\n \\n return dfs(head, None)\\n\\n \",\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\\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\\n\\nclass Solution:\\n def findMiddle(self, head: ListNode) -> ListNode:\\n # This helper function finds the middle node of the linked list\\n prev = None\\n slow = head\\n fast = head\\n \\n # Move fast pointer two steps and slow pointer one step until fast reaches the end\\n while fast and fast.next:\\n prev = slow\\n slow = slow.next\\n fast = fast.next.next\\n \\n # Disconnect the left half from the middle to split the list\\n if prev:\\n prev.next = None\\n \\n return slow\\n \\n def sortedListToBST(self, head: ListNode) -> TreeNode:\\n # Base cases\\n if not head:\\n return None\\n if not head.next:\\n return TreeNode(head.val)\\n \\n # Find the middle of the list\\n mid = self.findMiddle(head)\\n \\n # The middle element becomes the root\\n root = TreeNode(mid.val)\\n \\n # Recursively convert the left half to the left subtree\\n root.left = self.sortedListToBST(head)\\n \\n # Recursively convert the right half to the right subtree\\n root.right = self.sortedListToBST(mid.next)\\n \\n return root\\n\",\n \"runtime\": \"98\"\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# 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 convertListToValues(self, head):\\n out = []\\n while head:\\n out.append(head.val)\\n head = head.next\\n return out\\n\\n def convertListToBST(self, l, r, listt):\\n if l > r:\\n return None\\n\\n midpoint = (l + r) // 2\\n curr_val = listt[midpoint]\\n node = TreeNode(curr_val)\\n if l == r:\\n return node\\n node.left = self.convertListToBST(l, midpoint - 1, listt)\\n node.right = self.convertListToBST(midpoint + 1, r, listt)\\n return node\\n\\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n values = self.convertListToValues(head)\\n return self.convertListToBST(0, len(values) - 1, values)\",\n \"runtime\": \"98\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n\\n if not head:\\n return None\\n\\n def printer(node):\\n print(node)\\n if not node:\\n return None\\n printer(node.left)\\n printer(node.right)\\n \\n \\n\\n def find_mid(node, last):\\n\\n slow = node\\n fast = node\\n\\n while fast != last and fast.next != last:\\n slow = slow.next\\n fast = fast.next.next\\n\\n return slow\\n\\n # print(find_mid(head, None))\\n\\n \\n def back(l, r):\\n \\n if l == r:\\n return None\\n\\n mid = find_mid(l, r)\\n\\n node = TreeNode(mid.val)\\n\\n node.left = back(l, mid)\\n node.right = back(mid.next, r)\\n\\n return node\\n \\n printer(None)\\n\\n return back(head, None)\\n\\n\",\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n # height balancing only needs to be done if less than 2**depth\\n\\n # start in the middle\\n # m - l - r \\n\\n # root = Node(head[m])\\n # left = head[l]\\n # right = head[r]\\n # root.left = left\\n node = head\\n nums = []\\n # nums.append(node)\\n while node:\\n nums.append(node.val)\\n node = node.next\\n\\n\\n def helper(l, r):\\n if l > r: \\n return None\\n \\n m = (l+r)//2\\n node = TreeNode(nums[m])\\n node.left = helper(l, m-1)\\n node.right = helper(m+1, r)\\n return node\\n return helper(0, len(nums)-1)\\n\\n\\n m = len(head)//2\\n root = TreeNode(head[m])\\n l, r = m-1, m+1\\n if l > 0:\\n root.left = TreeNode(head[l])\\n sortedListToBST()\\n if r < len(head):\\n root.right = TreeNode(head[r])\\n \\n\\n\\n l, r = m-1, m+1\\n q = deque()\\n q.append(root)\\n while l > 0 or r < len(head):\\n pass\\n \\n while len(q) > 0:\\n node = q.popleft()\\n leftNode = head[l]\\n rightNode = head[r]\\n if l > 0:\\n # append last left element\\n pass\\n else:\\n # append last right element\\n pass\\n \",\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if not head:\\n return head\\n if not head.next:\\n return TreeNode(head.val)\\n mid = self.findMid(head)\\n next = mid.next\\n mid.next = None\\n root = TreeNode(mid.val)\\n root.left = self.sortedListToBST(head)\\n root.right = self.sortedListToBST(next)\\n return root\\n \\n def findMid(self,head):\\n fast = head\\n slow = head\\n prev = None\\n while fast and fast.next:\\n fast = fast.next.next\\n prev = slow\\n slow = slow.next\\n if prev:\\n prev.next = None\\n return slow\",\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n lst = []\\n cur = head\\n while cur:\\n lst.append(cur.val)\\n cur = cur.next\\n\\n def dfs(i, j):\\n if i > j: return\\n root = (i+j) // 2\\n return TreeNode(val=lst[root], left=dfs(i, root-1), right=dfs(root+1, j))\\n\\n return dfs(0, len(lst)-1)\\n \",\n \"runtime\": \"101\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def findmiddle(start: Optional[ListNode], end: Optional[ListNode]) -> Optional[ListNode]:\\n slow = fast = start\\n while fast != end and fast.next != end:\\n slow = slow.next\\n fast = fast.next.next\\n return slow\\n if not head:\\n return None\\n def convert(start: Optional[ListNode], end: Optional[ListNode]) -> Optional[TreeNode]:\\n if start == end:\\n return None\\n mid = findmiddle(start, end)\\n node = TreeNode(mid.val)\\n node.left = convert(start, mid)\\n node.right = convert(mid.next, end)\\n return node\\n return convert(head, None)\",\n \"runtime\": \"102\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def middle(curr = None):\\n if curr:\\n prev = slow = fast = curr\\n while fast and fast.next:\\n prev = slow\\n slow = slow.next\\n fast = fast.next.next\\n return prev\\n def helper(curr=None):\\n if curr:\\n pre_mid = middle(curr)\\n if not pre_mid.next:\\n return TreeNode(pre_mid.val)\\n parent = pre_mid.next\\n pre_mid.next = None\\n root = TreeNode(parent.val)\\n root.right = helper(parent.next) \\n root.left = helper(curr)\\n return root\\n return helper(head)\\n \",\n \"runtime\": \"102\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n\\n def ln(node):\\n cnt = 0\\n while node:\\n cnt += 1\\n node = node.next\\n return cnt\\n \\n l = ln(head)\\n\\n def back(l, r): \\n nonlocal head\\n \\n if l == r:\\n return None\\n\\n mid = (l + r) // 2\\n\\n left = back(l, mid)\\n\\n node = TreeNode(head.val)\\n node.left = left\\n\\n head = head.next \\n \\n node.right = back(mid + 1, r)\\n \\n return node\\n \\n return back(0, l)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # if not head:\\n # return None\\n\\n # def printer(node):\\n # print(node)\\n # if not node:\\n # return None\\n # printer(node.left)\\n # printer(node.right)\\n \\n \\n\\n # def find_mid(node, last):\\n\\n # slow = node\\n # fast = node\\n\\n # while fast != last and fast.next != last:\\n # slow = slow.next\\n # fast = fast.next.next\\n\\n # return slow\\n\\n # def back(l, r):\\n \\n # if l == r:\\n # return None\\n\\n # mid = find_mid(l, r)\\n\\n # node = TreeNode(mid.val)\\n\\n # node.left = back(l, mid)\\n # node.right = back(mid.next, r)\\n\\n # return node\\n \\n # printer(None)\\n\\n # return back(head, None)\\n\\n\",\n \"runtime\": \"103\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if not head:\\n return None\\n if not head.next:\\n return TreeNode(head.val)\\n slow = fast = head\\n pre = None\\n\\n while fast and fast.next:\\n pre = slow\\n slow = slow.next\\n fast = fast.next.next\\n \\n root = TreeNode(slow.val)\\n pre.next = None\\n root.left = self.sortedListToBST(head)\\n root.right = self.sortedListToBST(slow.next)\\n return root\",\n \"runtime\": \"103\"\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# 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 \\n def sortedListToBST(self, head):\\n if(head == None):\\n return None\\n \\n if(head.next == None):\\n return TreeNode(head.val)\\n\\n slow = head\\n fast = head\\n before = head\\n \\n while fast != None and fast.next != None:\\n before = slow\\n slow = slow.next\\n fast = fast.next.next\\n\\n right = slow.next\\n if(before != None):\\n before.next = None\\n\\n root = TreeNode(slow.val)\\n\\n root.left = self.sortedListToBST(head)\\n root.right = self.sortedListToBST(right)\\n\\n return root\",\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\\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 sortedListToBST(self, head: ListNode) -> TreeNode:\\n def buildBST(nums, start, end):\\n if start > end:\\n return None\\n mid = (start + end) >> 1\\n return TreeNode(\\n nums[mid], buildBST(nums, start, mid - 1), buildBST(nums, mid + 1, end)\\n )\\n\\n nums = []\\n while head:\\n nums.append(head.val)\\n head = head.next\\n return buildBST(nums, 0, len(nums) - 1)\\n \",\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def findmid(head):\\n slow = fast = head\\n while fast and fast.next and fast.next.next and fast.next.next.next:\\n slow = slow.next\\n fast = fast.next.next\\n return slow\\n\\n def dfs(head):\\n if not head: return None\\n if not head.next:\\n return TreeNode(val=head.val)\\n mid = findmid(head)\\n node = TreeNode(val=mid.next.val)\\n nxt = mid.next.next\\n mid.next = None\\n node.left = dfs(head)\\n node.right = dfs(nxt)\\n return node\\n\\n return dfs(head)\\n\\n \",\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\\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 flatList(self, head):\\n flattenList = []\\n while(head):\\n flattenList.append(head.val)\\n head = head.next\\n return flattenList\\n \\n def arrayToBST(self, nums):\\n n = len(nums)\\n if n == 0:\\n return None\\n\\n middleIndex = n // 2\\n middleValue = nums.pop(middleIndex)\\n return TreeNode(middleValue, self.arrayToBST(nums[:middleIndex]), self.arrayToBST(nums[middleIndex:]))\\n\\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n nums = self.flatList(head)\\n return self.arrayToBST(nums)\",\n \"runtime\": \"108\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if not head:\\n return None\\n if not head.next:\\n return TreeNode(head.val)\\n slow, fast = head, head.next.next\\n while fast and fast.next:\\n slow = slow.next\\n fast = fast.next.next\\n root = TreeNode(slow.next.val)\\n root.right = self.sortedListToBST(slow.next.next)\\n slow.next = None\\n root.left = self.sortedListToBST(head)\\n return root\\n\\n\\n\",\n \"runtime\": \"109\"\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# 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\\n def length(self, head):\\n n = 0\\n while head:\\n n += 1\\n head = head.next\\n \\n return n\\n\\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n\\n def inorder(left, right):\\n nonlocal head\\n if left > right:\\n return None\\n\\n mid = (left + right) // 2\\n left = inorder(left, mid - 1)\\n\\n root = TreeNode(head.val)\\n root.left = left\\n\\n head = head.next\\n\\n root.right = inorder(mid + 1, right)\\n return root\\n \\n return inorder(0, self.length(head) - 1)\",\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\\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 flatList(self, head):\\n flattenList = []\\n while(head):\\n flattenList.append(head.val)\\n head = head.next\\n return flattenList\\n \\n def arrayToBST(self, nums):\\n n = len(nums)\\n if n == 0:\\n return None\\n\\n middleIndex = n // 2\\n middleValue = nums.pop(middleIndex)\\n return TreeNode(middleValue, self.arrayToBST(nums[:middleIndex]), self.arrayToBST(nums[middleIndex:]))\\n\\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n nums = self.flatList(head)\\n return self.arrayToBST(nums)\",\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\\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 BST(self, vals):\\n m = len(vals)//2\\n root = TreeNode(vals[m])\\n left,right = [],[]\\n for i in range(len(vals)):\\n if i<m: left.append(vals[i])\\n if i>m: right.append(vals[i])\\n if len(left)>0: root.left = self.BST(left)\\n if len(right)>0: root.right = self.BST(right)\\n return root\\n\\n def getvals(self,head):\\n out = []\\n if head==None: return out\\n out.append(head.val)\\n while head.next:\\n head=head.next\\n out.append(head.val)\\n return out\\n\\n\\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if head==None: return None\\n vals = self.getvals(head)\\n if len(vals)==0: return TreeNode(vals[0])\\n return self.BST(vals)\\n\",\n \"runtime\": \"111\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def toBST(head, tail):\\n if head == tail:\\n return None\\n\\n slow, fast = head, head\\n\\n while fast != tail and fast.next != tail:\\n slow = slow.next\\n fast = fast.next.next\\n\\n node = TreeNode(val=slow.val)\\n node.left = toBST(head, slow)\\n node.right = toBST(slow.next, tail)\\n\\n return node\\n\\n return toBST(head, None)\\n\\n \\n\\n \",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"class Solution:\\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n nums = []\\n curr = head\\n while curr:\\n nums.append(curr.val)\\n curr = curr.next\\n\\n def bst(nums, l, r):\\n if l > r:\\n return\\n mid = (l + r) // 2\\n node = TreeNode(nums[mid])\\n node.left = bst(nums, l, mid - 1)\\n node.right = bst(nums, mid + 1, r)\\n return node\\n\\n return bst(nums, 0, len(nums) - 1)\\n\",\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n # function to find the middle of linked list \\n def middle(head):\\n prev = None\\n slow = head\\n fast = head\\n\\n while fast and fast.next:\\n prev = slow\\n fast = fast.next.next\\n slow = slow.next\\n if prev:\\n prev.next = None\\n return slow\\n\\n if not head:\\n return None\\n \\n mid = middle(head)\\n root = TreeNode(mid.val)\\n\\n if head == mid:\\n return root\\n root.left = self.sortedListToBST(head)\\n root.right = self.sortedListToBST(mid.next)\\n\\n return root\",\n \"runtime\": \"113\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n nums = []\\n while head is not None:\\n nums.append(head.val)\\n head = head.next\\n \\n def dfs(l, r):\\n if l > r:\\n return None\\n mid = (l + r)//2\\n root = TreeNode(nums[mid])\\n \\n root.left = dfs(l, mid - 1)\\n root.right = dfs(mid + 1, r)\\n return root\\n \\n return dfs(0, len(nums) - 1)\",\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def addMiddle(left, right):\\n if right < left:\\n return\\n mid = (left + right) // 2\\n self.insert(tree, nodeList[mid])\\n addMiddle(left, mid-1)\\n addMiddle(mid+1, right)\\n \\n nodeList = []\\n curr = head\\n while curr:\\n nodeList.append(curr.val)\\n curr = curr.next\\n \\n tree = TreeNode(float('inf'))\\n addMiddle(0, len(nodeList)-1)\\n return tree.left\\n \\n def insert(self, node, val):\\n if val < node.val:\\n if node.left:\\n self.insert(node.left, val)\\n else:\\n node.left = TreeNode(val)\\n else:\\n if node.right:\\n self.insert(node.right, val)\\n else:\\n node.right = TreeNode(val)\",\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if head==None:\\n return None\\n if head.next==None:\\n return TreeNode(head.val)\\n slow,fast=head,head.next\\n while fast.next and fast.next.next:\\n slow=slow.next\\n fast=fast.next.next\\n mid=slow.next\\n slow.next=None\\n root=TreeNode(mid.val)\\n root.left=self.sortedListToBST(head)\\n root.right=self.sortedListToBST(mid.next)\\n return root\\n #please upvote me it would encourage me alot\",\n \"runtime\": \"116\"\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# 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\\n def findMiddle(self, head: ListNode) -> ListNode:\\n\\n prev = None\\n slow = head\\n fast = head\\n\\n while fast and fast.next:\\n prev = slow\\n slow = slow.next\\n fast = fast.next.next\\n \\n if prev:\\n prev.next = None\\n \\n return slow\\n\\n def sortedListToBST(self, head: ListNode) -> TreeNode:\\n\\n if not head:\\n return None\\n \\n mid = self.findMiddle(head)\\n root = TreeNode(mid.val)\\n\\n if head == mid:\\n return root\\n\\n root.left = self.sortedListToBST(head)\\n root.right = self.sortedListToBST(mid.next)\\n return root\\n \",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"class Solution:\\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if not head: return None\\n if not head.next: return TreeNode(head.val)\\n\\n prev, slow, fast = None, head, head\\n while fast and fast.next:\\n prev = slow\\n slow = slow.next\\n fast = fast.next.next\\n \\n prev.next = None\\n root = TreeNode(slow.val)\\n root.left = self.sortedListToBST(head)\\n root.right = self.sortedListToBST(slow.next)\\n return root\\n \\n \",\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def addMiddle(left, right):\\n if right < left:\\n return\\n mid = (left + right) // 2\\n self.insert(tree, nodeList[mid])\\n addMiddle(left, mid-1)\\n addMiddle(mid+1, right)\\n \\n nodeList = []\\n curr = head\\n while curr:\\n nodeList.append(curr.val)\\n curr = curr.next\\n \\n tree = TreeNode(float('inf'))\\n addMiddle(0, len(nodeList)-1)\\n return tree.left\\n \\n def insert(self, node, val):\\n if val < node.val:\\n if node.left:\\n self.insert(node.left, val)\\n else:\\n node.left = TreeNode(val)\\n else:\\n if node.right:\\n self.insert(node.right, val)\\n else:\\n node.right = TreeNode(val)\",\n \"runtime\": \"118\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":56,"string":"56"},"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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n # list is already sorted in ascending order\n # height-balanced tree cond1: diff of depth of left and right trees is 1 at most\n # height-balanced tree cond2: all subtrees are height-balanced\n\n # proposed algo:\n # divide and conquer\n # find midpoint using a slow and a fast pointer\n # link left, root, and right\n\n if not head:\n return None\n\n prev, slow, fast = None, head, head\n\n while fast.next and fast.next.next:\n fast = fast.next.next\n prev = slow\n slow = slow.next\n \n # now our slow pointer is the midpoint\n root = slow\n # detach the left half\n if prev:\n prev.next = None\n root.left = self.sortedListToBST(head)\n else:\n root.left = None\n\n if slow.next:\n root.right = self.sortedListToBST(slow.next)\n else:\n root.right = None\n\n return root\n","memory":"19200"},{"code":"class Solution:\n def sortedListToBST(self, head: ListNode) -> TreeNode:\n def findMid(head: ListNode) -> ListNode:\n prev = None\n slow = head\n fast = head\n\n while fast and fast.next:\n prev = slow\n slow = slow.next\n fast = fast.next.next\n prev.next = None\n\n return slow\n\n if not head:\n return None\n if not head.next:\n return TreeNode(head.val)\n\n mid = findMid(head)\n root = TreeNode(mid.val)\n root.left = self.sortedListToBST(head)\n root.right = self.sortedListToBST(mid.next)\n return root","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\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 findMiddle(self, head: ListNode) -> ListNode:\n # Use the slow and fast pointer approach to find the middle of the linked list\n prev = None\n slow = head\n fast = head\n \n # Move fast by two steps and slow by one step\n while fast and fast.next:\n prev = slow\n slow = slow.next\n fast = fast.next.next\n \n # Disconnect the left half from the middle\n if prev:\n prev.next = None\n \n return slow\n \n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n # Base case: If the head is None, return None\n if not head:\n return None\n \n # Find the middle of the linked list\n mid = self.findMiddle(head)\n \n # The middle element becomes the root\n root = TreeNode(mid.val)\n \n # Base case: If there's only one element, return the root\n if head == mid:\n return root\n \n # Recursively construct the left and right subtrees\n root.left = self.sortedListToBST(head)\n root.right = self.sortedListToBST(mid.next)\n \n return root","memory":"19400"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if head == None:\n return None\n if head.next is None:\n #only one node\n return TreeNode(head.val)\n prev = None\n fast_ptr = head\n slow_ptr = head\n\n while(fast_ptr and fast_ptr.next):\n prev = slow_ptr\n slow_ptr = slow_ptr.next\n fast_ptr = fast_ptr.next.next\n \n if prev:\n prev.next = None\n mid = slow_ptr\n #mid is a node not a value\n cur = TreeNode(mid.val)\n cur.right = self.sortedListToBST(mid.next)\n # mid = None(useless since the next previous node of mid is still point to an address)\n cur.left = self.sortedListToBST(head)\n return cur","memory":"19400"},{"code":"class Solution:\n\n def sortedListToBST(self, head: ListNode) -> TreeNode:\n\n def findMid(head: ListNode) -> ListNode:\n\n prev = None\n\n slow = head\n\n fast = head\n\n while fast and fast.next:\n\n prev = slow\n\n slow = slow.next\n\n fast = fast.next.next\n\n prev.next = None\n\n return slow\n\n if not head:\n\n return None\n\n if not head.next:\n\n return TreeNode(head.val)\n\n mid = findMid(head)\n\n root = TreeNode(mid.val)\n\n root.left = self.sortedListToBST(head)\n\n root.right = self.sortedListToBST(mid.next)\n\n return root","memory":"19500"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if not head:\n return head\n if not head.next:\n return TreeNode(head.val)\n mid = self.findMid(head)\n next = mid.next\n mid.next = None\n root = TreeNode(mid.val)\n root.left = self.sortedListToBST(head)\n root.right = self.sortedListToBST(next)\n return root\n \n def findMid(self,head):\n fast = head\n slow = head\n prev = None\n while fast and fast.next:\n fast = fast.next.next\n prev = slow\n slow = slow.next\n if prev:\n prev.next = None\n return slow","memory":"19500"},{"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# 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 \n def sortedListToBST(self, head):\n if(head == None):\n return None\n \n if(head.next == None):\n return TreeNode(head.val)\n\n slow = head\n fast = head\n before = head\n \n while fast != None and fast.next != None:\n before = slow\n slow = slow.next\n fast = fast.next.next\n\n right = slow.next\n if(before != None):\n before.next = None\n\n root = TreeNode(slow.val)\n\n root.left = self.sortedListToBST(head)\n root.right = self.sortedListToBST(right)\n\n return root","memory":"19600"},{"code":"class Solution:\n def sortedListToBST(self, head: ListNode) -> TreeNode:\n if not head:\n return None\n if not head.next:\n return TreeNode(head.val)\n slow, fast = head, head.next.next\n while fast and fast.next:\n slow = slow.next\n fast = fast.next.next\n root = TreeNode(slow.next.val)\n root.right = self.sortedListToBST(slow.next.next)\n slow.next = None\n root.left = self.sortedListToBST(head)\n return root","memory":"19600"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def middle(curr = None):\n # find the middle of the list\n if curr:\n prev = slow = fast = curr\n while fast and fast.next:\n prev = slow\n slow = slow.next\n fast = fast.next.next\n return prev\n def helper(curr=None):\n if curr:\n pre_mid = middle(curr)\n # if the middle node is the most right node return the node\n if not pre_mid.next:\n return TreeNode(pre_mid.val)\n\n # parent node is the \n parent = pre_mid.next\n\n # break the list in half\n pre_mid.next = None\n\n # make the root the parent \n root = TreeNode(parent.val)\n root.right = helper(parent.next) \n root.left = helper(curr)\n return root\n return helper(head)","memory":"19700"},{"code":"class Solution:\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def build(node=head):\n if node is None:\n return None\n\n if node.next is None:\n return TreeNode(node.val)\n\n slow = fast = node\n preslow = ListNode(next=slow)\n while fast is not None and fast.next is not None:\n slow = slow.next\n preslow = preslow.next\n fast = fast.next.next\n preslow.next = None\n\n return TreeNode(slow.val, build(node), build(slow.next))\n\n return build()\n","memory":"19700"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def helper(start, end):\n if start > end:\n return None\n mid = (start + end) // 2\n curr = head\n for _ in range(mid):\n curr = curr.next\n root = TreeNode(curr.val)\n left = helper(start, mid - 1)\n right = helper(mid + 1, end)\n root.left = left\n root.right = right\n return root\n curr = head\n n = 0\n while curr:\n curr = curr.next\n n += 1\n return helper(0, n - 1)\n \n ","memory":"19800"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n \n # get middle\n cur = head\n count = 0\n while cur:\n count += 1\n cur = cur.next\n print(count)\n\n if count == 0:\n return None\n elif count == 1:\n return TreeNode(head.val)\n elif count == 2:\n return TreeNode(head.val,None,TreeNode(head.next.val))\n else:\n # split\n cur = head\n prev = None\n for _ in range(count//2):\n prev = cur\n cur = cur.next\n \n root_val = cur.val\n cur = cur.next\n\n prev.next = None\n left = head\n right = cur\n return TreeNode(root_val,self.sortedListToBST(left),self.sortedListToBST(right))\n","memory":"19900"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if not head:\n return None\n nodesIdx = {}\n curr = head\n i = -1\n while curr:\n i += 1\n nodesIdx[i] = curr\n curr = curr.next\n root = self.makeTree(nodesIdx, 0, i)\n return root\n \n\n def makeTree(self, nodesIdxDict, start, end) -> Optional[TreeNode]:\n if start > end:\n return None\n mid = start + (end - start) // 2\n root = nodesIdxDict[mid]\n root.left = self.makeTree(nodesIdxDict, start, mid - 1)\n root.right = self.makeTree(nodesIdxDict, mid + 1, end)\n return root\n ","memory":"20000"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n # this can be done recursively by\n # always taking the middle\n # and then taking the next middles\n # and next middles\n # etc etc\n if head is None:\n return None\n nodes = []\n while head is not None:\n nodes.append(head)\n head = head.next\n\n q= deque(maxlen=len(nodes))\n q.append((0, len(nodes)-1))\n while len(q) > 0:\n # for each item in the current level,\n # set its left and right\n start,end = q.popleft()\n middle = (start+end)//2\n node = nodes[middle]\n # set left\n if start > middle-1:\n node.left = None\n else:\n node.left = nodes[(start+middle-1)//2]\n q.append((start, middle-1))\n \n # set right\n if middle+1 > end:\n node.right = None\n else:\n node.right = nodes[(middle+1 + end)//2]\n q.append((middle+1, end))\n \n return nodes[(0 + len(nodes)-1)//2]","memory":"20200"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if not head: return None\n if not head.next: return TreeNode(head.val)\n mid = self.find_mid(head)\n node = TreeNode(mid.val)\n mid.left = self.sortedListToBST(head)\n mid.right = self.sortedListToBST(mid.next)\n return mid\n\n\n def find_mid(self, node):\n prev,curr,nxt = None, node,node\n while nxt and nxt.next:\n prev,curr,nxt = curr, curr.next, nxt.next.next\n prev.next = None\n return curr\n ","memory":"20400"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def middle(curr):\n if not curr:\n return\n prev = slow = fast = curr\n \n while fast and fast.next:\n prev = slow\n slow = slow.next\n fast = fast.next.next\n \n return prev\n\n def helper(curr):\n if not curr:\n return\n \n pre_mid = middle(curr)\n print(pre_mid.val)\n \n if not pre_mid.next:\n return TreeNode(pre_mid.val)\n \n root = pre_mid.next\n pre_mid.next = None\n root.right = helper(root.next) \n root.left = helper(curr)\n \n return root\n\n return helper(head)\n ","memory":"20500"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def middle(curr):\n if not curr:\n return\n prev = slow = fast = curr\n \n while fast and fast.next:\n prev = slow\n slow = slow.next\n fast = fast.next.next\n \n return prev\n\n def helper(curr):\n if not curr:\n return\n \n pre_mid = middle(curr)\n print(pre_mid.val)\n \n if not pre_mid.next:\n return TreeNode(pre_mid.val)\n \n root = pre_mid.next\n pre_mid.next = None\n root.right = helper(root.next) \n root.left = helper(curr)\n \n return root\n\n return helper(head)\n ","memory":"20500"},{"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# 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 findLength(self, head):\n if not head: \n return 0\n return 1 + self.findLength(head.next)\n \n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n if not head:\n return\n if not head.next:\n return TreeNode(head.val)\n length = self.findLength(head)\n rootIdx = length // 2\n cur = 0\n curN = head\n while cur != rootIdx - 1:\n curN = curN.next\n cur += 1\n root = TreeNode(curN.next.val)\n leftTree = head\n if curN.next.next:\n rightTree = curN.next.next\n curN.next.next = None\n root.right = self.sortedListToBST(rightTree)\n curN.next = None\n root.left = self.sortedListToBST(leftTree)\n return root\n","memory":"20600"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n length = 0\n node_list = []\n while head:\n length += 1\n node_list.append(head.val)\n head = head.next\n\n def transverse(self, node_list):\n lenh = len(node_list)//2\n if node_list:\n root = TreeNode(node_list[lenh])\n root.left = transverse(self,node_list[:lenh])\n root.right = transverse(self,node_list[lenh+1:])\n return root\n \n return transverse(self, node_list)\n\n \n \n\n ","memory":"20700"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n p=head\n l=[]\n while(p):\n l.append(p.val)\n p=p.next\n def bst(l):\n if(len(l)>0):\n mid=len(l)//2\n root=TreeNode(l[mid])\n if(root):\n root.left=bst(l[:mid])\n root.right=bst(l[mid+1:])\n return root\n else:\n return None\n return bst(l)\n\n \n ","memory":"20800"},{"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# 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 sortedListToBST(self, head: ListNode) -> TreeNode:\n def buildBST(nums, start, end):\n if start > end:\n return None\n mid = (start + end) >> 1\n return TreeNode(\n nums[mid], buildBST(nums, start, mid - 1), buildBST(nums, mid + 1, end)\n )\n\n nums = []\n while head:\n nums.append(head.val)\n head = head.next\n return buildBST(nums, 0, len(nums) - 1)","memory":"20800"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n\n if not head:\n return None\n\n def printer(node):\n print(node)\n if not node:\n return None\n printer(node.left)\n printer(node.right)\n \n \n\n def find_mid(node, last):\n\n slow = node\n fast = node\n\n while fast != last and fast.next != last:\n slow = slow.next\n fast = fast.next.next\n\n return slow\n\n # print(find_mid(head, None))\n\n \n def back(l, r):\n \n if l == r:\n return None\n\n mid = find_mid(l, r)\n\n node = TreeNode(mid.val)\n\n node.left = back(l, mid)\n node.right = back(mid.next, r)\n\n return node\n \n printer(None)\n\n return back(head, None)\n\n","memory":"20900"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n\n def ln(node):\n cnt = 0\n while node:\n cnt += 1\n node = node.next\n return cnt\n \n l = ln(head)\n\n def back(l, r): \n nonlocal head\n \n if l == r:\n return None\n\n mid = (l + r) // 2\n\n left = back(l, mid)\n\n node = TreeNode(head.val)\n node.left = left\n\n head = head.next \n \n node.right = back(mid + 1, r)\n \n return node\n \n return back(0, l)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n # if not head:\n # return None\n\n # def printer(node):\n # print(node)\n # if not node:\n # return None\n # printer(node.left)\n # printer(node.right)\n \n \n\n # def find_mid(node, last):\n\n # slow = node\n # fast = node\n\n # while fast != last and fast.next != last:\n # slow = slow.next\n # fast = fast.next.next\n\n # return slow\n\n # def back(l, r):\n \n # if l == r:\n # return None\n\n # mid = find_mid(l, r)\n\n # node = TreeNode(mid.val)\n\n # node.left = back(l, mid)\n # node.right = back(mid.next, r)\n\n # return node\n \n # printer(None)\n\n # return back(head, None)\n\n","memory":"20900"},{"code":"from typing import Optional\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\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def find_middle(left: Optional[ListNode], right: Optional[ListNode]) -> Optional[ListNode]:\n slow = left\n fast = left\n while fast != right and fast.next != right:\n slow = slow.next\n fast = fast.next.next\n return slow\n \n def convert_list_to_bst(left: Optional[ListNode], right: Optional[ListNode]) -> Optional[TreeNode]:\n if left == right:\n return None\n \n mid = find_middle(left, right)\n node = TreeNode(mid.val)\n \n node.left = convert_list_to_bst(left, mid)\n node.right = convert_list_to_bst(mid.next, right)\n \n return node\n \n return convert_list_to_bst(head, None)\n","memory":"21000"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def findmiddle(start: Optional[ListNode], end: Optional[ListNode]) -> Optional[ListNode]:\n slow = fast = start\n while fast != end and fast.next != end:\n slow = slow.next\n fast = fast.next.next\n return slow\n if not head:\n return None\n def convert(start: Optional[ListNode], end: Optional[ListNode]) -> Optional[TreeNode]:\n if start == end:\n return None\n mid = findmiddle(start, end)\n node = TreeNode(mid.val)\n node.left = convert(start, mid)\n node.right = convert(mid.next, end)\n return node\n return convert(head, None)","memory":"21000"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n lst = []\n cur = head\n while cur:\n lst.append(cur.val)\n cur = cur.next\n\n def dfs(i, j):\n if i > j: return\n root = (i+j) // 2\n return TreeNode(val=lst[root], left=dfs(i, root-1), right=dfs(root+1, j))\n\n return dfs(0, len(lst)-1)\n ","memory":"21100"},{"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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\n def addMiddle(left, right):\n if right < left:\n return\n mid = (left + right) // 2\n self.insert(tree, nodeList[mid])\n addMiddle(left, mid-1)\n addMiddle(mid+1, right)\n \n nodeList = []\n curr = head\n while curr:\n nodeList.append(curr.val)\n curr = curr.next\n \n tree = TreeNode(float('inf'))\n addMiddle(0, len(nodeList)-1)\n return tree.left\n \n def insert(self, node, val):\n if val < node.val:\n if node.left:\n self.insert(node.left, val)\n else:\n node.left = TreeNode(val)\n else:\n if node.right:\n self.insert(node.right, val)\n else:\n node.right = TreeNode(val)","memory":"21100"}],"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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n # list is already sorted in ascending order\\n # height-balanced tree cond1: diff of depth of left and right trees is 1 at most\\n # height-balanced tree cond2: all subtrees are height-balanced\\n\\n # proposed algo:\\n # divide and conquer\\n # find midpoint using a slow and a fast pointer\\n # link left, root, and right\\n\\n if not head:\\n return None\\n\\n prev, slow, fast = None, head, head\\n\\n while fast.next and fast.next.next:\\n fast = fast.next.next\\n prev = slow\\n slow = slow.next\\n \\n # now our slow pointer is the midpoint\\n root = slow\\n # detach the left half\\n if prev:\\n prev.next = None\\n root.left = self.sortedListToBST(head)\\n else:\\n root.left = None\\n\\n if slow.next:\\n root.right = self.sortedListToBST(slow.next)\\n else:\\n root.right = None\\n\\n return root\\n\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"class Solution:\\n def sortedListToBST(self, head: ListNode) -> TreeNode:\\n def findMid(head: ListNode) -> ListNode:\\n prev = None\\n slow = head\\n fast = head\\n\\n while fast and fast.next:\\n prev = slow\\n slow = slow.next\\n fast = fast.next.next\\n prev.next = None\\n\\n return slow\\n\\n if not head:\\n return None\\n if not head.next:\\n return TreeNode(head.val)\\n\\n mid = findMid(head)\\n root = TreeNode(mid.val)\\n root.left = self.sortedListToBST(head)\\n root.right = self.sortedListToBST(mid.next)\\n return root\",\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\\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 findMiddle(self, head: ListNode) -> ListNode:\\n # Use the slow and fast pointer approach to find the middle of the linked list\\n prev = None\\n slow = head\\n fast = head\\n \\n # Move fast by two steps and slow by one step\\n while fast and fast.next:\\n prev = slow\\n slow = slow.next\\n fast = fast.next.next\\n \\n # Disconnect the left half from the middle\\n if prev:\\n prev.next = None\\n \\n return slow\\n \\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n # Base case: If the head is None, return None\\n if not head:\\n return None\\n \\n # Find the middle of the linked list\\n mid = self.findMiddle(head)\\n \\n # The middle element becomes the root\\n root = TreeNode(mid.val)\\n \\n # Base case: If there's only one element, return the root\\n if head == mid:\\n return root\\n \\n # Recursively construct the left and right subtrees\\n root.left = self.sortedListToBST(head)\\n root.right = self.sortedListToBST(mid.next)\\n \\n return root\",\n \"memory\": \"19400\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if head == None:\\n return None\\n if head.next is None:\\n #only one node\\n return TreeNode(head.val)\\n prev = None\\n fast_ptr = head\\n slow_ptr = head\\n\\n while(fast_ptr and fast_ptr.next):\\n prev = slow_ptr\\n slow_ptr = slow_ptr.next\\n fast_ptr = fast_ptr.next.next\\n \\n if prev:\\n prev.next = None\\n mid = slow_ptr\\n #mid is a node not a value\\n cur = TreeNode(mid.val)\\n cur.right = self.sortedListToBST(mid.next)\\n # mid = None(useless since the next previous node of mid is still point to an address)\\n cur.left = self.sortedListToBST(head)\\n return cur\",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"class Solution:\\n\\n def sortedListToBST(self, head: ListNode) -> TreeNode:\\n\\n def findMid(head: ListNode) -> ListNode:\\n\\n prev = None\\n\\n slow = head\\n\\n fast = head\\n\\n while fast and fast.next:\\n\\n prev = slow\\n\\n slow = slow.next\\n\\n fast = fast.next.next\\n\\n prev.next = None\\n\\n return slow\\n\\n if not head:\\n\\n return None\\n\\n if not head.next:\\n\\n return TreeNode(head.val)\\n\\n mid = findMid(head)\\n\\n root = TreeNode(mid.val)\\n\\n root.left = self.sortedListToBST(head)\\n\\n root.right = self.sortedListToBST(mid.next)\\n\\n return root\",\n \"memory\": \"19500\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if not head:\\n return head\\n if not head.next:\\n return TreeNode(head.val)\\n mid = self.findMid(head)\\n next = mid.next\\n mid.next = None\\n root = TreeNode(mid.val)\\n root.left = self.sortedListToBST(head)\\n root.right = self.sortedListToBST(next)\\n return root\\n \\n def findMid(self,head):\\n fast = head\\n slow = head\\n prev = None\\n while fast and fast.next:\\n fast = fast.next.next\\n prev = slow\\n slow = slow.next\\n if prev:\\n prev.next = None\\n return slow\",\n \"memory\": \"19500\"\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# 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 \\n def sortedListToBST(self, head):\\n if(head == None):\\n return None\\n \\n if(head.next == None):\\n return TreeNode(head.val)\\n\\n slow = head\\n fast = head\\n before = head\\n \\n while fast != None and fast.next != None:\\n before = slow\\n slow = slow.next\\n fast = fast.next.next\\n\\n right = slow.next\\n if(before != None):\\n before.next = None\\n\\n root = TreeNode(slow.val)\\n\\n root.left = self.sortedListToBST(head)\\n root.right = self.sortedListToBST(right)\\n\\n return root\",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"class Solution:\\n def sortedListToBST(self, head: ListNode) -> TreeNode:\\n if not head:\\n return None\\n if not head.next:\\n return TreeNode(head.val)\\n slow, fast = head, head.next.next\\n while fast and fast.next:\\n slow = slow.next\\n fast = fast.next.next\\n root = TreeNode(slow.next.val)\\n root.right = self.sortedListToBST(slow.next.next)\\n slow.next = None\\n root.left = self.sortedListToBST(head)\\n return root\",\n \"memory\": \"19600\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def middle(curr = None):\\n # find the middle of the list\\n if curr:\\n prev = slow = fast = curr\\n while fast and fast.next:\\n prev = slow\\n slow = slow.next\\n fast = fast.next.next\\n return prev\\n def helper(curr=None):\\n if curr:\\n pre_mid = middle(curr)\\n # if the middle node is the most right node return the node\\n if not pre_mid.next:\\n return TreeNode(pre_mid.val)\\n\\n # parent node is the \\n parent = pre_mid.next\\n\\n # break the list in half\\n pre_mid.next = None\\n\\n # make the root the parent \\n root = TreeNode(parent.val)\\n root.right = helper(parent.next) \\n root.left = helper(curr)\\n return root\\n return helper(head)\",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"class Solution:\\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def build(node=head):\\n if node is None:\\n return None\\n\\n if node.next is None:\\n return TreeNode(node.val)\\n\\n slow = fast = node\\n preslow = ListNode(next=slow)\\n while fast is not None and fast.next is not None:\\n slow = slow.next\\n preslow = preslow.next\\n fast = fast.next.next\\n preslow.next = None\\n\\n return TreeNode(slow.val, build(node), build(slow.next))\\n\\n return build()\\n\",\n \"memory\": \"19700\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def helper(start, end):\\n if start > end:\\n return None\\n mid = (start + end) // 2\\n curr = head\\n for _ in range(mid):\\n curr = curr.next\\n root = TreeNode(curr.val)\\n left = helper(start, mid - 1)\\n right = helper(mid + 1, end)\\n root.left = left\\n root.right = right\\n return root\\n curr = head\\n n = 0\\n while curr:\\n curr = curr.next\\n n += 1\\n return helper(0, n - 1)\\n \\n \",\n \"memory\": \"19800\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n \\n # get middle\\n cur = head\\n count = 0\\n while cur:\\n count += 1\\n cur = cur.next\\n print(count)\\n\\n if count == 0:\\n return None\\n elif count == 1:\\n return TreeNode(head.val)\\n elif count == 2:\\n return TreeNode(head.val,None,TreeNode(head.next.val))\\n else:\\n # split\\n cur = head\\n prev = None\\n for _ in range(count//2):\\n prev = cur\\n cur = cur.next\\n \\n root_val = cur.val\\n cur = cur.next\\n\\n prev.next = None\\n left = head\\n right = cur\\n return TreeNode(root_val,self.sortedListToBST(left),self.sortedListToBST(right))\\n\",\n \"memory\": \"19900\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if not head:\\n return None\\n nodesIdx = {}\\n curr = head\\n i = -1\\n while curr:\\n i += 1\\n nodesIdx[i] = curr\\n curr = curr.next\\n root = self.makeTree(nodesIdx, 0, i)\\n return root\\n \\n\\n def makeTree(self, nodesIdxDict, start, end) -> Optional[TreeNode]:\\n if start > end:\\n return None\\n mid = start + (end - start) // 2\\n root = nodesIdxDict[mid]\\n root.left = self.makeTree(nodesIdxDict, start, mid - 1)\\n root.right = self.makeTree(nodesIdxDict, mid + 1, end)\\n return root\\n \",\n \"memory\": \"20000\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n # this can be done recursively by\\n # always taking the middle\\n # and then taking the next middles\\n # and next middles\\n # etc etc\\n if head is None:\\n return None\\n nodes = []\\n while head is not None:\\n nodes.append(head)\\n head = head.next\\n\\n q= deque(maxlen=len(nodes))\\n q.append((0, len(nodes)-1))\\n while len(q) > 0:\\n # for each item in the current level,\\n # set its left and right\\n start,end = q.popleft()\\n middle = (start+end)//2\\n node = nodes[middle]\\n # set left\\n if start > middle-1:\\n node.left = None\\n else:\\n node.left = nodes[(start+middle-1)//2]\\n q.append((start, middle-1))\\n \\n # set right\\n if middle+1 > end:\\n node.right = None\\n else:\\n node.right = nodes[(middle+1 + end)//2]\\n q.append((middle+1, end))\\n \\n return nodes[(0 + len(nodes)-1)//2]\",\n \"memory\": \"20200\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if not head: return None\\n if not head.next: return TreeNode(head.val)\\n mid = self.find_mid(head)\\n node = TreeNode(mid.val)\\n mid.left = self.sortedListToBST(head)\\n mid.right = self.sortedListToBST(mid.next)\\n return mid\\n\\n\\n def find_mid(self, node):\\n prev,curr,nxt = None, node,node\\n while nxt and nxt.next:\\n prev,curr,nxt = curr, curr.next, nxt.next.next\\n prev.next = None\\n return curr\\n \",\n \"memory\": \"20400\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def middle(curr):\\n if not curr:\\n return\\n prev = slow = fast = curr\\n \\n while fast and fast.next:\\n prev = slow\\n slow = slow.next\\n fast = fast.next.next\\n \\n return prev\\n\\n def helper(curr):\\n if not curr:\\n return\\n \\n pre_mid = middle(curr)\\n print(pre_mid.val)\\n \\n if not pre_mid.next:\\n return TreeNode(pre_mid.val)\\n \\n root = pre_mid.next\\n pre_mid.next = None\\n root.right = helper(root.next) \\n root.left = helper(curr)\\n \\n return root\\n\\n return helper(head)\\n \",\n \"memory\": \"20500\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def middle(curr):\\n if not curr:\\n return\\n prev = slow = fast = curr\\n \\n while fast and fast.next:\\n prev = slow\\n slow = slow.next\\n fast = fast.next.next\\n \\n return prev\\n\\n def helper(curr):\\n if not curr:\\n return\\n \\n pre_mid = middle(curr)\\n print(pre_mid.val)\\n \\n if not pre_mid.next:\\n return TreeNode(pre_mid.val)\\n \\n root = pre_mid.next\\n pre_mid.next = None\\n root.right = helper(root.next) \\n root.left = helper(curr)\\n \\n return root\\n\\n return helper(head)\\n \",\n \"memory\": \"20500\"\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# 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 findLength(self, head):\\n if not head: \\n return 0\\n return 1 + self.findLength(head.next)\\n \\n def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n if not head:\\n return\\n if not head.next:\\n return TreeNode(head.val)\\n length = self.findLength(head)\\n rootIdx = length // 2\\n cur = 0\\n curN = head\\n while cur != rootIdx - 1:\\n curN = curN.next\\n cur += 1\\n root = TreeNode(curN.next.val)\\n leftTree = head\\n if curN.next.next:\\n rightTree = curN.next.next\\n curN.next.next = None\\n root.right = self.sortedListToBST(rightTree)\\n curN.next = None\\n root.left = self.sortedListToBST(leftTree)\\n return root\\n\",\n \"memory\": \"20600\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n length = 0\\n node_list = []\\n while head:\\n length += 1\\n node_list.append(head.val)\\n head = head.next\\n\\n def transverse(self, node_list):\\n lenh = len(node_list)//2\\n if node_list:\\n root = TreeNode(node_list[lenh])\\n root.left = transverse(self,node_list[:lenh])\\n root.right = transverse(self,node_list[lenh+1:])\\n return root\\n \\n return transverse(self, node_list)\\n\\n \\n \\n\\n \",\n \"memory\": \"20700\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n p=head\\n l=[]\\n while(p):\\n l.append(p.val)\\n p=p.next\\n def bst(l):\\n if(len(l)>0):\\n mid=len(l)//2\\n root=TreeNode(l[mid])\\n if(root):\\n root.left=bst(l[:mid])\\n root.right=bst(l[mid+1:])\\n return root\\n else:\\n return None\\n return bst(l)\\n\\n \\n \",\n \"memory\": \"20800\"\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# 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 sortedListToBST(self, head: ListNode) -> TreeNode:\\n def buildBST(nums, start, end):\\n if start > end:\\n return None\\n mid = (start + end) >> 1\\n return TreeNode(\\n nums[mid], buildBST(nums, start, mid - 1), buildBST(nums, mid + 1, end)\\n )\\n\\n nums = []\\n while head:\\n nums.append(head.val)\\n head = head.next\\n return buildBST(nums, 0, len(nums) - 1)\",\n \"memory\": \"20800\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n\\n if not head:\\n return None\\n\\n def printer(node):\\n print(node)\\n if not node:\\n return None\\n printer(node.left)\\n printer(node.right)\\n \\n \\n\\n def find_mid(node, last):\\n\\n slow = node\\n fast = node\\n\\n while fast != last and fast.next != last:\\n slow = slow.next\\n fast = fast.next.next\\n\\n return slow\\n\\n # print(find_mid(head, None))\\n\\n \\n def back(l, r):\\n \\n if l == r:\\n return None\\n\\n mid = find_mid(l, r)\\n\\n node = TreeNode(mid.val)\\n\\n node.left = back(l, mid)\\n node.right = back(mid.next, r)\\n\\n return node\\n \\n printer(None)\\n\\n return back(head, None)\\n\\n\",\n \"memory\": \"20900\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n\\n def ln(node):\\n cnt = 0\\n while node:\\n cnt += 1\\n node = node.next\\n return cnt\\n \\n l = ln(head)\\n\\n def back(l, r): \\n nonlocal head\\n \\n if l == r:\\n return None\\n\\n mid = (l + r) // 2\\n\\n left = back(l, mid)\\n\\n node = TreeNode(head.val)\\n node.left = left\\n\\n head = head.next \\n \\n node.right = back(mid + 1, r)\\n \\n return node\\n \\n return back(0, l)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # if not head:\\n # return None\\n\\n # def printer(node):\\n # print(node)\\n # if not node:\\n # return None\\n # printer(node.left)\\n # printer(node.right)\\n \\n \\n\\n # def find_mid(node, last):\\n\\n # slow = node\\n # fast = node\\n\\n # while fast != last and fast.next != last:\\n # slow = slow.next\\n # fast = fast.next.next\\n\\n # return slow\\n\\n # def back(l, r):\\n \\n # if l == r:\\n # return None\\n\\n # mid = find_mid(l, r)\\n\\n # node = TreeNode(mid.val)\\n\\n # node.left = back(l, mid)\\n # node.right = back(mid.next, r)\\n\\n # return node\\n \\n # printer(None)\\n\\n # return back(head, None)\\n\\n\",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"from typing import Optional\\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\\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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def find_middle(left: Optional[ListNode], right: Optional[ListNode]) -> Optional[ListNode]:\\n slow = left\\n fast = left\\n while fast != right and fast.next != right:\\n slow = slow.next\\n fast = fast.next.next\\n return slow\\n \\n def convert_list_to_bst(left: Optional[ListNode], right: Optional[ListNode]) -> Optional[TreeNode]:\\n if left == right:\\n return None\\n \\n mid = find_middle(left, right)\\n node = TreeNode(mid.val)\\n \\n node.left = convert_list_to_bst(left, mid)\\n node.right = convert_list_to_bst(mid.next, right)\\n \\n return node\\n \\n return convert_list_to_bst(head, None)\\n\",\n \"memory\": \"21000\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def findmiddle(start: Optional[ListNode], end: Optional[ListNode]) -> Optional[ListNode]:\\n slow = fast = start\\n while fast != end and fast.next != end:\\n slow = slow.next\\n fast = fast.next.next\\n return slow\\n if not head:\\n return None\\n def convert(start: Optional[ListNode], end: Optional[ListNode]) -> Optional[TreeNode]:\\n if start == end:\\n return None\\n mid = findmiddle(start, end)\\n node = TreeNode(mid.val)\\n node.left = convert(start, mid)\\n node.right = convert(mid.next, end)\\n return node\\n return convert(head, None)\",\n \"memory\": \"21000\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n lst = []\\n cur = head\\n while cur:\\n lst.append(cur.val)\\n cur = cur.next\\n\\n def dfs(i, j):\\n if i > j: return\\n root = (i+j) // 2\\n return TreeNode(val=lst[root], left=dfs(i, root-1), right=dfs(root+1, j))\\n\\n return dfs(0, len(lst)-1)\\n \",\n \"memory\": \"21100\"\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# 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 sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:\\n def addMiddle(left, right):\\n if right < left:\\n return\\n mid = (left + right) // 2\\n self.insert(tree, nodeList[mid])\\n addMiddle(left, mid-1)\\n addMiddle(mid+1, right)\\n \\n nodeList = []\\n curr = head\\n while curr:\\n nodeList.append(curr.val)\\n curr = curr.next\\n \\n tree = TreeNode(float('inf'))\\n addMiddle(0, len(nodeList)-1)\\n return tree.left\\n \\n def insert(self, node, val):\\n if val < node.val:\\n if node.left:\\n self.insert(node.left, val)\\n else:\\n node.left = TreeNode(val)\\n else:\\n if node.right:\\n self.insert(node.right, val)\\n else:\\n node.right = TreeNode(val)\",\n \"memory\": \"21100\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":27,"string":"27"}}},{"rowIdx":163,"cells":{"question_id":{"kind":"number","value":110,"string":"110"},"name":{"kind":"string","value":"balanced-binary-tree"},"content":{"kind":"string","value":"<p>Given a binary tree, determine if it is <span data-keyword=\"height-balanced\"><strong>height-balanced</strong></span>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/10/06/balance_1.jpg\" style=\"width: 342px; height: 221px;\" />\n<pre>\n<strong>Input:</strong> root = [3,9,20,null,null,15,7]\n<strong>Output:</strong> true\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/10/06/balance_2.jpg\" style=\"width: 452px; height: 301px;\" />\n<pre>\n<strong>Input:</strong> root = [1,2,2,3,3,null,null,4,4]\n<strong>Output:</strong> false\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> root = []\n<strong>Output:</strong> true\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>[0, 5000]</code>.</li>\n\t<li><code>-10<sup>4</sup> <= Node.val <= 10<sup>4</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":53.38499626083725,"string":"53.384996"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["tree","depth-first-search","binary-tree"],"string":"[\n \"tree\",\n \"depth-first-search\",\n \"binary-tree\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"21\", 0.0044], [\"22\", 0.0089], [\"23\", 0.0133], [\"24\", 0.0266], [\"26\", 0.0754], [\"27\", 0.1376], [\"28\", 0.1597], [\"29\", 0.1376], [\"30\", 0.3017], [\"31\", 0.6168], [\"32\", 0.5635], [\"33\", 0.6079], [\"34\", 1.1892], [\"35\", 1.8592], [\"36\", 1.8548], [\"37\", 2.0678], [\"38\", 3.0307], [\"39\", 4.2022], [\"40\", 3.9049], [\"41\", 3.998], [\"42\", 5.1961], [\"43\", 6.4341], [\"44\", 6.159], [\"45\", 5.6266], [\"46\", 6.3898], [\"47\", 6.5007], [\"48\", 5.9727], [\"49\", 5.2361], [\"50\", 4.4373], [\"51\", 4.2332], [\"52\", 3.3857], [\"53\", 3.1061], [\"54\", 2.3385], [\"55\", 1.9125], [\"56\", 1.2691], [\"57\", 1.2203]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16600\", 0.0044], [\"16900\", 0.0044], [\"17000\", 0.0044], [\"17100\", 0.0799], [\"17200\", 0.2396], [\"17300\", 0.355], [\"17400\", 0.4215], [\"17500\", 5.0009], [\"17600\", 28.7407], [\"17700\", 43.1221]]}"},"rt_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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def check(Node):\n if Node == None: return 0\n\n lh = check(Node.left)\n rh = check(Node.right)\n if lh == -1 or rh == -1 : return -1\n if abs(lh-rh) > 1: return -1\n\n return max(lh,rh) + 1\n\n if check(root) == -1: return False\n \n return True","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def check_height(node):\n if not node:\n return 0 \n # Check the height of the left subtree\n left_height = check_height(node.left)\n\n if left_height == -1:\n return -1 # Left subtree is not balanced\n \n # Check the height of the right subtree\n right_height = check_height(node.right)\n if right_height == -1:\n return -1 # Right subtree is not balanced\n \n # If the current node's subtree is unbalanced\n if abs(left_height - right_height) > 1:\n return -1\n \n # Return the height of the current node's subtree\n return max(left_height, right_height) + 1\n \n # Start the post-order traversal from the root\n return check_height(root) != -1","runtime":"22"},{"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def check_height(node):\n if node is None:\n return (0, True)\n \n left_height, left_balance_status = check_height(node.left)\n right_height, right_balance_status = check_height(node.right)\n \n return (\n 1 + max(left_height, right_height), \n (\n (abs(left_height - right_height) <= 1) and \n (left_balance_status) and \n (right_balance_status)\n )\n )\n \n height, status = check_height(root)\n return status\n \n\n\n","runtime":"23"},{"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n \n def getHeight(node):\n if not node:\n return 0\n leftHeight = getHeight(node.left)\n rightHeight = getHeight(node.right)\n if leftHeight == -1 or rightHeight == -1 or abs(leftHeight - rightHeight) > 1:\n return -1\n return 1 + max(leftHeight, rightHeight)\n\n return getHeight(root) != -1","runtime":"24"},{"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n if root is None:\n return True\n return self.balance(root)[1]\n def balance(self,root):\n if root is None:\n return [0,True]\n left = self.balance(root.left)\n right = self.balance(root.right)\n if (left[1] and right[1] and abs(left[0]-right[0])<2):\n valid = True\n else:\n valid = False\n return [1+max(left[0],right[0]),valid]\n ","runtime":"26"},{"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n \n \n \n def f(node,bal):\n \n if not node:\n return 0,True\n \n left = 0\n bal1,bal2 = False,False\n if bal:\n \n left,bal1 = f(node.left,bal)\n right =0\n \n if bal: \n \n right,bal2 = f(node.right,bal)\n \n bal = not(abs(left - right) > 1) and bal1 and bal2\n \n return 1 + max(left,right) ,bal\n \n res,is_bal = f(root,True)\n \n return is_bal\n \n ","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def solve(node):\n if not node:\n return 0\n l = solve(node.left)\n r = solve(node.right)\n\n if l > r + 1 or r > l + 1 or l == -1 or r == -1:\n return -1\n return max(l, r) + 1\n\n return True if solve(root) != -1 else False","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def dfs(root):\n if root is None:\n return [True,0]\n left,right=dfs(root.left),dfs(root.right)\n balanced=left[0] and right[0] and abs(left[1]-right[1])<=1\n return [balanced,1+max(left[1],right[1])]\n return dfs(root)[0]","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\nclass Solution:\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n def dfs(node):\n if not node:\n return [-1, True]\n\n left_height, left_balanced = dfs(node.left)\n right_height, right_balanced = dfs(node.right)\n\n balanced = right_balanced and left_balanced and abs(right_height - left_height) < 2\n\n return (1 + max(left_height, right_height), balanced)\n\n return dfs(root)[1]\n #return is_balanced(root)","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\nclass Solution:\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n \n def dfs(node):\n if not node:\n return [True, 0] # have to keep track of nodes beneath if balanced or not\n \n left, right = dfs(node.left), dfs(node.right)\n if left[0] and right[0] and abs(left[1] - right[1]) <= 1:\n return [True, 1 + max(left[1], right[1])]\n else:\n return [False, 1 + max(left[1], right[1])]\n\n return dfs(root)[0]\n","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\n def getHeight(self, root):\n if not root:\n return 0\n\n if not root.left and not root.right:\n return 1\n\n leftH = self.getHeight(root.left)\n rightH = self.getHeight(root.right)\n\n if leftH == -1 or rightH == -1:\n return -1\n \n if abs(leftH - rightH) > 1:\n return -1\n \n return max(leftH, rightH) + 1\n\n\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n\n return self.getHeight(root) != -1\n\n \n ","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def check(root):\n\n if root is None:\n\n return 0\n\n left = check(root.left)\n\n right = check(root.right)\n\n if left == -1 or right == -1 or abs(left - right) > 1:\n\n return -1\n\n return 1 + max(left, right)\n\n \n\n return check(root) != -1\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 isBalanced(self, root):\n\n def dfs(node):\n if node is None:\n return 0\n\n leftHeight = dfs(node.left)\n\n if leftHeight == -math.inf:\n return -math.inf\n\n rightHeight = dfs(node.right)\n\n if rightHeight == -math.inf:\n return -math.inf\n\n if abs(rightHeight - leftHeight) > 1:\n return -math.inf\n else:\n return 1 + max(leftHeight, rightHeight)\n\n return False if dfs(root) < 0 else True\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\n\ndef findDepth(node):\n if node == None:\n return 0\n else: \n return 1+ max( findDepth(node.right), findDepth(node.left))\n\nclass Solution:\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n if root == None:\n return True\n\n return abs(findDepth(root.right) - findDepth(root.left)) < 2 and self.isBalanced(root.right) and self.isBalanced(root.left) \n","runtime":"32"},{"code":"class Solution(object):\n def isBalanced(self, root):\n return (self.Height(root) >= 0)\n def Height(self, root):\n if root is None: return 0\n leftheight, rightheight = self.Height(root.left), self.Height(root.right)\n if leftheight < 0 or rightheight < 0 or abs(leftheight - rightheight) > 1: return -1\n return max(leftheight, rightheight) + 1","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def help(root):\n if not root:\n return [True,0]\n left,right=help(root.left),help(root.right)\n balanced=(left[0] and right[0]) and abs(left[1]-right[1])<=1\n return [balanced,1+max(left[1],right[1])]\n return help(root)[0]\n ","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n\n def dfs(root):\n if not root:\n return True, 0\n l = dfs(root.left)\n r = dfs(root.right)\n cond = l[0] and r[0] and (abs(r[1] - l[1]) < 2)\n return cond, max(r[1], l[1]) + 1 \n \n return dfs(root)[0]","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 Solution1:\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n \n left = self.balance(root.left)\n right = self.balance(root.right)\n\n if abs(left - right) > 1:\n return False\n\n return self.isBalanced(root.left) and self.isBalanced(root.right)\n\n def balance(self, root):\n if not root:\n return 0\n\n return 1 + max(self.balance(root.right), self.balance(root.left))\n\nclass Solution:\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n def check(Node):\n if Node == None: return 0\n\n lh = check(Node.left)\n rh = check(Node.right)\n if lh == -1 or rh == -1 : return -1\n if abs(lh-rh) > 1: return -1\n\n return max(lh,rh) + 1\n\n if check(root) == -1: return False\n \n return True","runtime":"34"},{"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def height(node):\n if node == None:\n return 0\n lh = height(node.left)\n rh = height(node.right)\n if lh == -1 or rh == -1:\n return -1\n\n if lh - rh > 1 or rh - lh > 1:\n return -1\n return 1 + max(lh,rh)\n\n \n h = height(root)\n if h == -1:\n return False\n return True\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n return(self.Height(root)>=0)\n def Height(self,root):\n if root is None:\n return 0\n lh=self.Height(root.left)\n rh=self.Height(root.right)\n if lh<0 or rh<0 or abs(lh-rh)>1:\n return -1\n return max(lh,rh)+1\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n self.ischk = True\n def depth(node):\n if not node:\n return 0\n \n leftn = depth(node.left)\n rightn = depth(node.right)\n\n if leftn is None or rightn is None: \n return None\n\n if leftn - rightn > 1 or leftn - rightn < -1:\n self.ischk = False\n else:\n return max(leftn, rightn) + 1\n\n depth(root)\n return self.ischk","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n return self.dfs(root)[0]\n \n def dfs(self, node: Optional[TreeNode]) -> [bool, int]:\n if not node:\n return [True, 0]\n\n left, right = self.dfs(node.left), self.dfs(node.right)\n\n balanced = (left[0] and right[0] and abs(left[1] - right[1]) <= 1)\n\n return [balanced, 1 + max(left[1], right[1])]","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def height(node):\n if node == None:\n return 0\n lh = height(node.left)\n rh = height(node.right)\n if lh == -1 or rh == -1:\n return -1\n if rh - lh > 1 or lh - rh > 1:\n return -1\n return 1 + max(lh,rh)\n \n h = height(root)\n if h == -1:\n return False\n return True\n\n\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def Height(node):\n if not node:\n return 0 \n \n lh = Height(node.left)\n if lh == -1:\n return -1 \n \n rh = Height(node.right)\n if rh == -1:\n return -1 \n \n if abs(lh - rh) > 1:\n return -1 \n \n return 1 + max(lh, rh) \n \n return Height(root) != -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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n ans = [True]\n def Height(node):\n if node is None:\n return -1\n leftheight = Height(node.left)\n rightheight = Height(node.right)\n if abs(leftheight-rightheight)>1:\n ans[0] = False\n return 0\n return 1+max(leftheight,rightheight)\\\n \n Height(root)\n return ans[0]\n ","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n balanced = [True]\n def check(node):\n if not node:\n return 0\n lh = check(node.left)\n if not balanced[0]:\n return False\n rh = check(node.right)\n if(abs(lh - rh) > 1):\n balanced[0] = False\n return 0\n return (1 + max(lh,rh))\n check(root)\n return balanced[0]","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n if root is None:\n return True\n lh = self.isBalanced(root.left)\n if lh == 0:\n return 0\n rh = self.isBalanced(root.right)\n if rh == 0:\n return 0\n if (abs(lh - rh) > 1):\n return 0\n else:\n return max(lh, rh) + 1\n ","runtime":"39"},{"code":"# 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\nclass Solution:\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n def dfs(node: Optional[TreeNode]) -> int:\n if not node: return [True, 0]\n l, r = dfs(node.left), dfs(node.right)\n b = (l[0] and r[0] and abs(l[1] - r[1]) <= 1)\n return [b, 1 + max(l[1], r[1])]\n return dfs(root)[0]","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def dfs(root):\n if root==None:\n return [True,0]\n left,right=dfs(root.left),dfs(root.right)\n balanced=left[0] and right[0] and abs(left[1]-right[1])<=1\n return [balanced,1+max(left[1],right[1])]\n return dfs(root)[0]\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n\n # def getHeight(root):\n # if not root:\n # return 0\n # leftHeight, rightHeight = getHeight(root.left), getHeight(root.right)\n\n # if leftHeight < 0 or rightHeight < 0 or abs(leftHeight - rightHeight) > 1:\n # return 0\n # return max(leftHeight, rightHeight) + 1\n\n # return (getHeight(root) >= 0)\n\n def dfs(node: Optional[TreeNode]) -> int:\n if not node: return [True, 0]\n leftNode, rightNode = dfs(node.left), dfs(node.right)\n balanced = (leftNode[0] and rightNode[0] and abs(leftNode[1] - rightNode[1]) <= 1)\n return [balanced, 1 + max(leftNode[1], rightNode[1])]\n return dfs(root)[0]\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n balanced=[True]\n def height(root):\n if not root:\n return 0\n left_height=height(root.left)\n if balanced[0] is False:\n return 0\n right_height=height(root.right)\n if abs(left_height-right_height)>1:\n balanced[0]=False\n return 0\n return 1+max(left_height,right_height)\n height(root)\n return balanced[0]","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n balanced=[True]\n def height(root):\n if not root:\n return 0\n left_height=height(root.left)\n right_height=height(root.right)\n if abs(left_height-right_height)>1:\n balanced[0]=False\n return 0\n return 1+max(left_height,right_height)\n height(root)\n return balanced[0]","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n balanced = [True]\n def height(root):\n if not root:\n return 0\n \n ldepth = height(root.left)\n if balanced[0] is False:\n return 0\n \n rdepth = height(root.right)\n if abs(ldepth - rdepth) > 1:\n balanced[0] = False\n return 0\n return max(ldepth, rdepth) + 1\n\n height(root)\n return balanced[0]","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 isBalanced(self, root: Optional[TreeNode]) -> bool: \n if root: \n if abs(self.subDepth(root.left)-self.subDepth(root.right)) > 1:\n return False\n if not self.isBalanced(root.left):\n return False\n if not self.isBalanced(root.right):\n return False\n return True\n \n def subDepth(self, root):\n if not root:\n return 0\n return 1 + max(self.subDepth(root.left), self.subDepth(root.right))\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n \n left = self.depth(root.left)\n right = self.depth(root.right)\n\n return (abs(left - right) < 2) and self.isBalanced(root.left) and self.isBalanced(root.right)\n\n @cache\n def depth(self, node):\n if not node: return 0\n return max(self.depth(node.left), self.depth(node.right)) + 1\n","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n self.flag = True\n def dfs(cur):\n if not cur:\n return 0\n left = dfs(cur.left)\n right = dfs(cur.right)\n if abs(left-right)>1:\n self.flag = False\n return 1+max(left, right)\n dfs(root)\n return self.flag","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n # 同时返回高度 和 是否平衡 不平衡返回None\n def check(root):\n if not root:\n return 0\n ll = check(root.left)\n rr = check(root.right)\n if ll is not None and rr is not None and abs(ll - rr) <=1:\n return 1 + max(ll, rr)\n else:\n return None\n \n return check(root) is not None","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n\n def dfs(root):\n if not root: return [True,0]\n\n left,right = dfs(root.left), dfs(root.right)\n balanced = (left[0] and right[0] and\n abs(left[1]-right[1]) <= 1)\n\n return [balanced, 1+ max(left[1], right[1])]\n return dfs(root)[0]\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n\n def getHeight(root):\n if not root:\n return 0\n leftHeight, rightHeight = getHeight(root.left), getHeight(root.right)\n\n if leftHeight < 0 or rightHeight < 0 or abs(leftHeight - rightHeight) > 1:\n return -1\n return max(leftHeight, rightHeight) + 1\n\n return (getHeight(root) >= 0)\n\n ","runtime":"45"},{"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def dfs(node: Optional[TreeNode]) -> int:\n if not node:\n return [True, 0]\n l, r = dfs(node.left), dfs(node.right)\n b = (l[0] and r[0] and abs(l[1] - r[1]) <= 1)\n return [b, 1 + max(l[1], r[1])]\n return dfs(root)[0]","runtime":"45"},{"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def dfs(root):\n if not root:\n return [True,0] \n left = dfs(root.left)\n right = dfs(root.right)\n\n balanced = left[0] and right[0] and (abs(left[1]-right[1]))<=1\n\n return [balanced,1+max(left[1],right[1])]\n return dfs(root)[0]\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def dfs(root):\n if not root:\n return [True,0]\n left,right=dfs(root.left),dfs(root.right)\n balanced=(left[0]) and right[0] and abs(left[1]-right[1])<=1\n return [balanced,1+max(left[1],right[1])]\n return dfs(root)[0]","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def height(root):\n if root is None:\n return 0\n l, r = height(root.left), height(root.right)\n if l == -1 or r == -1 or abs(l - r) > 1:\n return -1\n return 1 + max(l, r)\n\n return height(root) >= 0","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n balanced=[True]\n def height(root):\n if not root:\n return 0\n left_height=height(root.left)\n right_height=height(root.right)\n if abs(left_height-right_height)>1:\n balanced[0]=False\n return 0\n return 1+max(left_height,right_height)\n height(root)\n return balanced[0]","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n global balance \n balance = True\n def height(node):\n global balance\n if not node:\n return 0\n left_height = height(node.left)\n right_height = height(node.right)\n if abs(left_height-right_height)>1:\n balance = False\n return 0\n return 1 + max(left_height,right_height)\n height(root)\n return balance","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 Solution1:\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n \n left = self.balance(root.left)\n right = self.balance(root.right)\n\n if abs(left - right) > 1:\n return False\n\n return self.isBalanced(root.left) and self.isBalanced(root.right)\n\n def balance(self, root):\n if not root:\n return 0\n\n return 1 + max(self.balance(root.right), self.balance(root.left))\n\nclass Solution:\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n def check(Node):\n if Node == None: return 0\n\n lh = check(Node.left)\n rh = check(Node.right)\n if lh == -1 or rh == -1 : return -1\n if abs(lh-rh) > 1: return -1\n\n return max(lh,rh) + 1\n\n if check(root) == -1: return False\n \n return True","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n balanced=[True]\n def height(root):\n if root is None:\n return 0\n \n left_root=height(root.left)\n if balanced[0] is False:\n return 0\n right_root=height(root.right)\n\n if(abs(left_root-right_root)>1):\n balanced[0]=False\n return 0\n return max(left_root,right_root)+1\n height(root)\n return balanced[0]\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def dfs(node):\n if not node:\n return True, 0\n lb, lh = dfs(node.left)\n rb, rh = dfs(node.right)\n return lb and rb and abs(lh - rh) <= 1, max(lh, rh) + 1\n\n b, _ = dfs(root)\n return b","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n #DFS\n self.max_height = 0\n if not root:\n return True\n def dfs(curr):\n if not curr:\n return 0\n left_height = dfs(curr.left)\n right_height = dfs(curr.right)\n curr_max = max(right_height, left_height) - min(right_height, left_height)\n self.max_height = max(self.max_height, curr_max)\n return 1 + max(left_height, right_height)\n dfs(root)\n if (self.max_height > 1):\n return False\n else:\n return 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\nfrom queue import LifoQueue\nclass Solution:\n def height_diff(self, root: TreeNode):\n if root is None:\n return 0\n\n left_height = self.height_diff(root.left)\n right_height = self.height_diff(root.right)\n\n if left_height == -1 or right_height == -1:\n return -1\n\n if abs(left_height-right_height) > 1:\n return -1\n\n return max(left_height, right_height) + 1\n \n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n if root is None:\n return True\n \n if self.height_diff(root) == -1:\n return False\n \n return True\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n if root is None:\n return True\n\n lHeight = self.findHeight(root.left)\n rHeight = self.findHeight(root.right)\n\n if abs(lHeight - rHeight)<=1 and self.isBalanced(root.left) is True and self.isBalanced(root.right) is True:\n return True\n\n return False\n\n def findHeight(self,node):\n if node is None:\n return 0\n\n lHeight = self.findHeight(node.left)\n rHeight = self.findHeight(node.right)\n\n return max(lHeight,rHeight) + 1","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 def isBalanced(self, root: Optional[TreeNode]) -> bool:\n def dfs(root):\n if not root:\n return [True, 0]\n\n left = dfs(root.left)\n right = dfs(root.right)\n\n balanced = left[0] and right[0] and abs(left[1] - right[1]) <= 1\n return [balanced, 1 + max(left[1], right[1])]\n \n return dfs(root)[0]","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 def isBalanced(self, root: Optional[TreeNode]) -> bool:\n \n def checkBalance(node):\n if not node:\n return 0 \n\n left_height = checkBalance(node.left)\n if left_height == -1:\n return -1 \n\n right_height = checkBalance(node.right)\n if right_height == -1:\n return -1\n\n if abs(left_height - right_height) > 1:\n return -1\n\n return max(left_height, right_height) + 1\n\n return checkBalance(root) != -1\n\n\n ","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n bool = True\n def recurse(node):\n if not node:\n nonlocal bool\n return 0\n left = recurse(node.left)\n right = recurse(node.right)\n if left - right != 1 and left - right != 0 and left - right != -1:\n bool = False\n return max(left,right)+1\n recurse(root)\n return bool","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n def findDepth(root,depth):\n if not root:\n return depth\n else:\n return max(findDepth(root.left,depth+1), findDepth(root.right,depth+1))\n if abs(findDepth(root.left,0)-findDepth(root.right,0))>1:\n return False\n else:\n return (self.isBalanced(root.left)) and (self.isBalanced(root.right))\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\nclass Solution:\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n def findDepth(root,depth):\n if not root:\n return depth\n else:\n return max(findDepth(root.left,depth+1), findDepth(root.right,depth+1))\n if abs(findDepth(root.left,0)-findDepth(root.right,0))>1:\n return False\n else:\n return (self.isBalanced(root.left)) and (self.isBalanced(root.right))\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\nclass Solution:\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n def dfs(node: Optional[TreeNode]) -> int:\n if not node:\n return [True, 0]\n l, r = dfs(node.left), dfs(node.right)\n b = (l[0] and r[0] and abs(l[1] - r[1]) <= 1)\n return [b, 1 + max(l[1], r[1])]\n return dfs(root)[0]","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n def dfs(root):\n if not root:\n return [True, 0]\n\n left, right = dfs(root.left), dfs(root.right)\n isBalanced = left[0] and right[0] and abs(left[1] - right[1]) <= 1\n\n return [isBalanced, 1 + max(left[1], right[1])]\n\n return dfs(root)[0]","runtime":"54"},{"code":"class Solution:\n def isBalanced(self, root: TreeNode | None) -> bool:\n if not root:\n return True\n\n def maxDepth(root: TreeNode | None) -> int:\n if not root:\n return 0\n return 1 + max(maxDepth(root.left), maxDepth(root.right))\n\n return (abs(maxDepth(root.left) - maxDepth(root.right)) <= 1 and\n self.isBalanced(root.left) and\n self.isBalanced(root.right))","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n\n # def getHeight(root):\n # if not root:\n # return 0\n # leftHeight, rightHeight = getHeight(root.left), getHeight(root.right)\n\n # if leftHeight < 0 or rightHeight < 0 or abs(leftHeight - rightHeight) > 1:\n # return 0\n # return max(leftHeight, rightHeight) + 1\n\n # return (getHeight(root) >= 0)\n\n def dfs(node: Optional[TreeNode]) -> int:\n if not node: return [True, 0]\n leftNode, rightNode = dfs(node.left), dfs(node.right)\n balanced = (leftNode[0] and rightNode[0] and abs(leftNode[1] - rightNode[1]) <= 1)\n return [balanced, 1 + max(leftNode[1], rightNode[1])]\n return dfs(root)[0]\n ","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n if root is None:\n return True\n\n lHeight = self.findHeight(root.left)\n rHeight = self.findHeight(root.right)\n\n if abs(lHeight - rHeight)<=1 and self.isBalanced(root.left) is True and self.isBalanced(root.right) is True:\n return True\n\n return False\n\n def findHeight(self,node):\n if node is None:\n return 0\n\n lHeight = self.findHeight(node.left)\n rHeight = self.findHeight(node.right)\n\n return max(lHeight,rHeight) + 1","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 isBalanced(self, root: Optional[TreeNode]) -> bool: \n if root: \n if abs(self.subDepth(root.left)-self.subDepth(root.right)) > 1:\n return False\n if not self.isBalanced(root.left):\n return False\n if not self.isBalanced(root.right):\n return False\n return True\n \n def subDepth(self, root):\n if not root:\n return 0\n return 1 + max(self.subDepth(root.left), self.subDepth(root.right))\n","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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n\n #to track the height\n def dfs(root):\n if not root:\n return [True, 0]\n left = dfs(root.left)\n right = dfs(root.right)\n balanced = left[0] and right[0] and abs(left[1] - right[1]) <= 1\n return [balanced, 1 + max(left[1], right[1])]\n \n return dfs(root)[0]\n ","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 def isBalanced(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n def findDepth(root,depth):\n if not root:\n return depth\n else:\n return max(findDepth(root.left,depth+1), findDepth(root.right,depth+1))\n if abs(findDepth(root.left,0)-findDepth(root.right,0))>1:\n return False\n else:\n return (self.isBalanced(root.left)) and (self.isBalanced(root.right))\n \n ","runtime":"57"}],"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def check(Node):\\n if Node == None: return 0\\n\\n lh = check(Node.left)\\n rh = check(Node.right)\\n if lh == -1 or rh == -1 : return -1\\n if abs(lh-rh) > 1: return -1\\n\\n return max(lh,rh) + 1\\n\\n if check(root) == -1: return False\\n \\n return True\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def check_height(node):\\n if not node:\\n return 0 \\n # Check the height of the left subtree\\n left_height = check_height(node.left)\\n\\n if left_height == -1:\\n return -1 # Left subtree is not balanced\\n \\n # Check the height of the right subtree\\n right_height = check_height(node.right)\\n if right_height == -1:\\n return -1 # Right subtree is not balanced\\n \\n # If the current node's subtree is unbalanced\\n if abs(left_height - right_height) > 1:\\n return -1\\n \\n # Return the height of the current node's subtree\\n return max(left_height, right_height) + 1\\n \\n # Start the post-order traversal from the root\\n return check_height(root) != -1\",\n \"runtime\": \"22\"\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def check_height(node):\\n if node is None:\\n return (0, True)\\n \\n left_height, left_balance_status = check_height(node.left)\\n right_height, right_balance_status = check_height(node.right)\\n \\n return (\\n 1 + max(left_height, right_height), \\n (\\n (abs(left_height - right_height) <= 1) and \\n (left_balance_status) and \\n (right_balance_status)\\n )\\n )\\n \\n height, status = check_height(root)\\n return status\\n \\n\\n\\n\",\n \"runtime\": \"23\"\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n \\n def getHeight(node):\\n if not node:\\n return 0\\n leftHeight = getHeight(node.left)\\n rightHeight = getHeight(node.right)\\n if leftHeight == -1 or rightHeight == -1 or abs(leftHeight - rightHeight) > 1:\\n return -1\\n return 1 + max(leftHeight, rightHeight)\\n\\n return getHeight(root) != -1\",\n \"runtime\": \"24\"\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if root is None:\\n return True\\n return self.balance(root)[1]\\n def balance(self,root):\\n if root is None:\\n return [0,True]\\n left = self.balance(root.left)\\n right = self.balance(root.right)\\n if (left[1] and right[1] and abs(left[0]-right[0])<2):\\n valid = True\\n else:\\n valid = False\\n return [1+max(left[0],right[0]),valid]\\n \",\n \"runtime\": \"26\"\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n \\n \\n \\n def f(node,bal):\\n \\n if not node:\\n return 0,True\\n \\n left = 0\\n bal1,bal2 = False,False\\n if bal:\\n \\n left,bal1 = f(node.left,bal)\\n right =0\\n \\n if bal: \\n \\n right,bal2 = f(node.right,bal)\\n \\n bal = not(abs(left - right) > 1) and bal1 and bal2\\n \\n return 1 + max(left,right) ,bal\\n \\n res,is_bal = f(root,True)\\n \\n return is_bal\\n \\n \",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def solve(node):\\n if not node:\\n return 0\\n l = solve(node.left)\\n r = solve(node.right)\\n\\n if l > r + 1 or r > l + 1 or l == -1 or r == -1:\\n return -1\\n return max(l, r) + 1\\n\\n return True if solve(root) != -1 else False\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def dfs(root):\\n if root is None:\\n return [True,0]\\n left,right=dfs(root.left),dfs(root.right)\\n balanced=left[0] and right[0] and abs(left[1]-right[1])<=1\\n return [balanced,1+max(left[1],right[1])]\\n return dfs(root)[0]\",\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\\nclass Solution:\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def dfs(node):\\n if not node:\\n return [-1, True]\\n\\n left_height, left_balanced = dfs(node.left)\\n right_height, right_balanced = dfs(node.right)\\n\\n balanced = right_balanced and left_balanced and abs(right_height - left_height) < 2\\n\\n return (1 + max(left_height, right_height), balanced)\\n\\n return dfs(root)[1]\\n #return is_balanced(root)\",\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\\nclass Solution:\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n \\n def dfs(node):\\n if not node:\\n return [True, 0] # have to keep track of nodes beneath if balanced or not\\n \\n left, right = dfs(node.left), dfs(node.right)\\n if left[0] and right[0] and abs(left[1] - right[1]) <= 1:\\n return [True, 1 + max(left[1], right[1])]\\n else:\\n return [False, 1 + max(left[1], right[1])]\\n\\n return dfs(root)[0]\\n\",\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\\n def getHeight(self, root):\\n if not root:\\n return 0\\n\\n if not root.left and not root.right:\\n return 1\\n\\n leftH = self.getHeight(root.left)\\n rightH = self.getHeight(root.right)\\n\\n if leftH == -1 or rightH == -1:\\n return -1\\n \\n if abs(leftH - rightH) > 1:\\n return -1\\n \\n return max(leftH, rightH) + 1\\n\\n\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n\\n return self.getHeight(root) != -1\\n\\n \\n \",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def check(root):\\n\\n if root is None:\\n\\n return 0\\n\\n left = check(root.left)\\n\\n right = check(root.right)\\n\\n if left == -1 or right == -1 or abs(left - right) > 1:\\n\\n return -1\\n\\n return 1 + max(left, right)\\n\\n \\n\\n return check(root) != -1\\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 isBalanced(self, root):\\n\\n def dfs(node):\\n if node is None:\\n return 0\\n\\n leftHeight = dfs(node.left)\\n\\n if leftHeight == -math.inf:\\n return -math.inf\\n\\n rightHeight = dfs(node.right)\\n\\n if rightHeight == -math.inf:\\n return -math.inf\\n\\n if abs(rightHeight - leftHeight) > 1:\\n return -math.inf\\n else:\\n return 1 + max(leftHeight, rightHeight)\\n\\n return False if dfs(root) < 0 else True\\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\\n\\ndef findDepth(node):\\n if node == None:\\n return 0\\n else: \\n return 1+ max( findDepth(node.right), findDepth(node.left))\\n\\nclass Solution:\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if root == None:\\n return True\\n\\n return abs(findDepth(root.right) - findDepth(root.left)) < 2 and self.isBalanced(root.right) and self.isBalanced(root.left) \\n\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution(object):\\n def isBalanced(self, root):\\n return (self.Height(root) >= 0)\\n def Height(self, root):\\n if root is None: return 0\\n leftheight, rightheight = self.Height(root.left), self.Height(root.right)\\n if leftheight < 0 or rightheight < 0 or abs(leftheight - rightheight) > 1: return -1\\n return max(leftheight, rightheight) + 1\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def help(root):\\n if not root:\\n return [True,0]\\n left,right=help(root.left),help(root.right)\\n balanced=(left[0] and right[0]) and abs(left[1]-right[1])<=1\\n return [balanced,1+max(left[1],right[1])]\\n return help(root)[0]\\n \",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n\\n def dfs(root):\\n if not root:\\n return True, 0\\n l = dfs(root.left)\\n r = dfs(root.right)\\n cond = l[0] and r[0] and (abs(r[1] - l[1]) < 2)\\n return cond, max(r[1], l[1]) + 1 \\n \\n return dfs(root)[0]\",\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 Solution1:\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n \\n left = self.balance(root.left)\\n right = self.balance(root.right)\\n\\n if abs(left - right) > 1:\\n return False\\n\\n return self.isBalanced(root.left) and self.isBalanced(root.right)\\n\\n def balance(self, root):\\n if not root:\\n return 0\\n\\n return 1 + max(self.balance(root.right), self.balance(root.left))\\n\\nclass Solution:\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def check(Node):\\n if Node == None: return 0\\n\\n lh = check(Node.left)\\n rh = check(Node.right)\\n if lh == -1 or rh == -1 : return -1\\n if abs(lh-rh) > 1: return -1\\n\\n return max(lh,rh) + 1\\n\\n if check(root) == -1: return False\\n \\n return True\",\n \"runtime\": \"34\"\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def height(node):\\n if node == None:\\n return 0\\n lh = height(node.left)\\n rh = height(node.right)\\n if lh == -1 or rh == -1:\\n return -1\\n\\n if lh - rh > 1 or rh - lh > 1:\\n return -1\\n return 1 + max(lh,rh)\\n\\n \\n h = height(root)\\n if h == -1:\\n return False\\n return True\\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n return(self.Height(root)>=0)\\n def Height(self,root):\\n if root is None:\\n return 0\\n lh=self.Height(root.left)\\n rh=self.Height(root.right)\\n if lh<0 or rh<0 or abs(lh-rh)>1:\\n return -1\\n return max(lh,rh)+1\\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n self.ischk = True\\n def depth(node):\\n if not node:\\n return 0\\n \\n leftn = depth(node.left)\\n rightn = depth(node.right)\\n\\n if leftn is None or rightn is None: \\n return None\\n\\n if leftn - rightn > 1 or leftn - rightn < -1:\\n self.ischk = False\\n else:\\n return max(leftn, rightn) + 1\\n\\n depth(root)\\n return self.ischk\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n return self.dfs(root)[0]\\n \\n def dfs(self, node: Optional[TreeNode]) -> [bool, int]:\\n if not node:\\n return [True, 0]\\n\\n left, right = self.dfs(node.left), self.dfs(node.right)\\n\\n balanced = (left[0] and right[0] and abs(left[1] - right[1]) <= 1)\\n\\n return [balanced, 1 + max(left[1], right[1])]\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def height(node):\\n if node == None:\\n return 0\\n lh = height(node.left)\\n rh = height(node.right)\\n if lh == -1 or rh == -1:\\n return -1\\n if rh - lh > 1 or lh - rh > 1:\\n return -1\\n return 1 + max(lh,rh)\\n \\n h = height(root)\\n if h == -1:\\n return False\\n return True\\n\\n\\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def Height(node):\\n if not node:\\n return 0 \\n \\n lh = Height(node.left)\\n if lh == -1:\\n return -1 \\n \\n rh = Height(node.right)\\n if rh == -1:\\n return -1 \\n \\n if abs(lh - rh) > 1:\\n return -1 \\n \\n return 1 + max(lh, rh) \\n \\n return Height(root) != -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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n ans = [True]\\n def Height(node):\\n if node is None:\\n return -1\\n leftheight = Height(node.left)\\n rightheight = Height(node.right)\\n if abs(leftheight-rightheight)>1:\\n ans[0] = False\\n return 0\\n return 1+max(leftheight,rightheight)\\\\\\n \\n Height(root)\\n return ans[0]\\n \",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n balanced = [True]\\n def check(node):\\n if not node:\\n return 0\\n lh = check(node.left)\\n if not balanced[0]:\\n return False\\n rh = check(node.right)\\n if(abs(lh - rh) > 1):\\n balanced[0] = False\\n return 0\\n return (1 + max(lh,rh))\\n check(root)\\n return balanced[0]\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if root is None:\\n return True\\n lh = self.isBalanced(root.left)\\n if lh == 0:\\n return 0\\n rh = self.isBalanced(root.right)\\n if rh == 0:\\n return 0\\n if (abs(lh - rh) > 1):\\n return 0\\n else:\\n return max(lh, rh) + 1\\n \",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"# 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\\nclass Solution:\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def dfs(node: Optional[TreeNode]) -> int:\\n if not node: return [True, 0]\\n l, r = dfs(node.left), dfs(node.right)\\n b = (l[0] and r[0] and abs(l[1] - r[1]) <= 1)\\n return [b, 1 + max(l[1], r[1])]\\n return dfs(root)[0]\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def dfs(root):\\n if root==None:\\n return [True,0]\\n left,right=dfs(root.left),dfs(root.right)\\n balanced=left[0] and right[0] and abs(left[1]-right[1])<=1\\n return [balanced,1+max(left[1],right[1])]\\n return dfs(root)[0]\\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n\\n # def getHeight(root):\\n # if not root:\\n # return 0\\n # leftHeight, rightHeight = getHeight(root.left), getHeight(root.right)\\n\\n # if leftHeight < 0 or rightHeight < 0 or abs(leftHeight - rightHeight) > 1:\\n # return 0\\n # return max(leftHeight, rightHeight) + 1\\n\\n # return (getHeight(root) >= 0)\\n\\n def dfs(node: Optional[TreeNode]) -> int:\\n if not node: return [True, 0]\\n leftNode, rightNode = dfs(node.left), dfs(node.right)\\n balanced = (leftNode[0] and rightNode[0] and abs(leftNode[1] - rightNode[1]) <= 1)\\n return [balanced, 1 + max(leftNode[1], rightNode[1])]\\n return dfs(root)[0]\\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n balanced=[True]\\n def height(root):\\n if not root:\\n return 0\\n left_height=height(root.left)\\n if balanced[0] is False:\\n return 0\\n right_height=height(root.right)\\n if abs(left_height-right_height)>1:\\n balanced[0]=False\\n return 0\\n return 1+max(left_height,right_height)\\n height(root)\\n return balanced[0]\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n balanced=[True]\\n def height(root):\\n if not root:\\n return 0\\n left_height=height(root.left)\\n right_height=height(root.right)\\n if abs(left_height-right_height)>1:\\n balanced[0]=False\\n return 0\\n return 1+max(left_height,right_height)\\n height(root)\\n return balanced[0]\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n balanced = [True]\\n def height(root):\\n if not root:\\n return 0\\n \\n ldepth = height(root.left)\\n if balanced[0] is False:\\n return 0\\n \\n rdepth = height(root.right)\\n if abs(ldepth - rdepth) > 1:\\n balanced[0] = False\\n return 0\\n return max(ldepth, rdepth) + 1\\n\\n height(root)\\n return balanced[0]\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool: \\n if root: \\n if abs(self.subDepth(root.left)-self.subDepth(root.right)) > 1:\\n return False\\n if not self.isBalanced(root.left):\\n return False\\n if not self.isBalanced(root.right):\\n return False\\n return True\\n \\n def subDepth(self, root):\\n if not root:\\n return 0\\n return 1 + max(self.subDepth(root.left), self.subDepth(root.right))\\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n \\n left = self.depth(root.left)\\n right = self.depth(root.right)\\n\\n return (abs(left - right) < 2) and self.isBalanced(root.left) and self.isBalanced(root.right)\\n\\n @cache\\n def depth(self, node):\\n if not node: return 0\\n return max(self.depth(node.left), self.depth(node.right)) + 1\\n\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n self.flag = True\\n def dfs(cur):\\n if not cur:\\n return 0\\n left = dfs(cur.left)\\n right = dfs(cur.right)\\n if abs(left-right)>1:\\n self.flag = False\\n return 1+max(left, right)\\n dfs(root)\\n return self.flag\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n # 同时返回高度 和 是否平衡 不平衡返回None\\n def check(root):\\n if not root:\\n return 0\\n ll = check(root.left)\\n rr = check(root.right)\\n if ll is not None and rr is not None and abs(ll - rr) <=1:\\n return 1 + max(ll, rr)\\n else:\\n return None\\n \\n return check(root) is not None\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n\\n def dfs(root):\\n if not root: return [True,0]\\n\\n left,right = dfs(root.left), dfs(root.right)\\n balanced = (left[0] and right[0] and\\n abs(left[1]-right[1]) <= 1)\\n\\n return [balanced, 1+ max(left[1], right[1])]\\n return dfs(root)[0]\\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n\\n def getHeight(root):\\n if not root:\\n return 0\\n leftHeight, rightHeight = getHeight(root.left), getHeight(root.right)\\n\\n if leftHeight < 0 or rightHeight < 0 or abs(leftHeight - rightHeight) > 1:\\n return -1\\n return max(leftHeight, rightHeight) + 1\\n\\n return (getHeight(root) >= 0)\\n\\n \",\n \"runtime\": \"45\"\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def dfs(node: Optional[TreeNode]) -> int:\\n if not node:\\n return [True, 0]\\n l, r = dfs(node.left), dfs(node.right)\\n b = (l[0] and r[0] and abs(l[1] - r[1]) <= 1)\\n return [b, 1 + max(l[1], r[1])]\\n return dfs(root)[0]\",\n \"runtime\": \"45\"\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def dfs(root):\\n if not root:\\n return [True,0] \\n left = dfs(root.left)\\n right = dfs(root.right)\\n\\n balanced = left[0] and right[0] and (abs(left[1]-right[1]))<=1\\n\\n return [balanced,1+max(left[1],right[1])]\\n return dfs(root)[0]\\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def dfs(root):\\n if not root:\\n return [True,0]\\n left,right=dfs(root.left),dfs(root.right)\\n balanced=(left[0]) and right[0] and abs(left[1]-right[1])<=1\\n return [balanced,1+max(left[1],right[1])]\\n return dfs(root)[0]\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def height(root):\\n if root is None:\\n return 0\\n l, r = height(root.left), height(root.right)\\n if l == -1 or r == -1 or abs(l - r) > 1:\\n return -1\\n return 1 + max(l, r)\\n\\n return height(root) >= 0\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n balanced=[True]\\n def height(root):\\n if not root:\\n return 0\\n left_height=height(root.left)\\n right_height=height(root.right)\\n if abs(left_height-right_height)>1:\\n balanced[0]=False\\n return 0\\n return 1+max(left_height,right_height)\\n height(root)\\n return balanced[0]\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n global balance \\n balance = True\\n def height(node):\\n global balance\\n if not node:\\n return 0\\n left_height = height(node.left)\\n right_height = height(node.right)\\n if abs(left_height-right_height)>1:\\n balance = False\\n return 0\\n return 1 + max(left_height,right_height)\\n height(root)\\n return balance\",\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 Solution1:\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n \\n left = self.balance(root.left)\\n right = self.balance(root.right)\\n\\n if abs(left - right) > 1:\\n return False\\n\\n return self.isBalanced(root.left) and self.isBalanced(root.right)\\n\\n def balance(self, root):\\n if not root:\\n return 0\\n\\n return 1 + max(self.balance(root.right), self.balance(root.left))\\n\\nclass Solution:\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def check(Node):\\n if Node == None: return 0\\n\\n lh = check(Node.left)\\n rh = check(Node.right)\\n if lh == -1 or rh == -1 : return -1\\n if abs(lh-rh) > 1: return -1\\n\\n return max(lh,rh) + 1\\n\\n if check(root) == -1: return False\\n \\n return True\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n balanced=[True]\\n def height(root):\\n if root is None:\\n return 0\\n \\n left_root=height(root.left)\\n if balanced[0] is False:\\n return 0\\n right_root=height(root.right)\\n\\n if(abs(left_root-right_root)>1):\\n balanced[0]=False\\n return 0\\n return max(left_root,right_root)+1\\n height(root)\\n return balanced[0]\\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def dfs(node):\\n if not node:\\n return True, 0\\n lb, lh = dfs(node.left)\\n rb, rh = dfs(node.right)\\n return lb and rb and abs(lh - rh) <= 1, max(lh, rh) + 1\\n\\n b, _ = dfs(root)\\n return b\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n #DFS\\n self.max_height = 0\\n if not root:\\n return True\\n def dfs(curr):\\n if not curr:\\n return 0\\n left_height = dfs(curr.left)\\n right_height = dfs(curr.right)\\n curr_max = max(right_height, left_height) - min(right_height, left_height)\\n self.max_height = max(self.max_height, curr_max)\\n return 1 + max(left_height, right_height)\\n dfs(root)\\n if (self.max_height > 1):\\n return False\\n else:\\n return 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\\nfrom queue import LifoQueue\\nclass Solution:\\n def height_diff(self, root: TreeNode):\\n if root is None:\\n return 0\\n\\n left_height = self.height_diff(root.left)\\n right_height = self.height_diff(root.right)\\n\\n if left_height == -1 or right_height == -1:\\n return -1\\n\\n if abs(left_height-right_height) > 1:\\n return -1\\n\\n return max(left_height, right_height) + 1\\n \\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if root is None:\\n return True\\n \\n if self.height_diff(root) == -1:\\n return False\\n \\n return True\\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if root is None:\\n return True\\n\\n lHeight = self.findHeight(root.left)\\n rHeight = self.findHeight(root.right)\\n\\n if abs(lHeight - rHeight)<=1 and self.isBalanced(root.left) is True and self.isBalanced(root.right) is True:\\n return True\\n\\n return False\\n\\n def findHeight(self,node):\\n if node is None:\\n return 0\\n\\n lHeight = self.findHeight(node.left)\\n rHeight = self.findHeight(node.right)\\n\\n return max(lHeight,rHeight) + 1\",\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 def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def dfs(root):\\n if not root:\\n return [True, 0]\\n\\n left = dfs(root.left)\\n right = dfs(root.right)\\n\\n balanced = left[0] and right[0] and abs(left[1] - right[1]) <= 1\\n return [balanced, 1 + max(left[1], right[1])]\\n \\n return dfs(root)[0]\",\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 def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n \\n def checkBalance(node):\\n if not node:\\n return 0 \\n\\n left_height = checkBalance(node.left)\\n if left_height == -1:\\n return -1 \\n\\n right_height = checkBalance(node.right)\\n if right_height == -1:\\n return -1\\n\\n if abs(left_height - right_height) > 1:\\n return -1\\n\\n return max(left_height, right_height) + 1\\n\\n return checkBalance(root) != -1\\n\\n\\n \",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n bool = True\\n def recurse(node):\\n if not node:\\n nonlocal bool\\n return 0\\n left = recurse(node.left)\\n right = recurse(node.right)\\n if left - right != 1 and left - right != 0 and left - right != -1:\\n bool = False\\n return max(left,right)+1\\n recurse(root)\\n return bool\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n def findDepth(root,depth):\\n if not root:\\n return depth\\n else:\\n return max(findDepth(root.left,depth+1), findDepth(root.right,depth+1))\\n if abs(findDepth(root.left,0)-findDepth(root.right,0))>1:\\n return False\\n else:\\n return (self.isBalanced(root.left)) and (self.isBalanced(root.right))\\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\\nclass Solution:\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n def findDepth(root,depth):\\n if not root:\\n return depth\\n else:\\n return max(findDepth(root.left,depth+1), findDepth(root.right,depth+1))\\n if abs(findDepth(root.left,0)-findDepth(root.right,0))>1:\\n return False\\n else:\\n return (self.isBalanced(root.left)) and (self.isBalanced(root.right))\\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\\nclass Solution:\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def dfs(node: Optional[TreeNode]) -> int:\\n if not node:\\n return [True, 0]\\n l, r = dfs(node.left), dfs(node.right)\\n b = (l[0] and r[0] and abs(l[1] - r[1]) <= 1)\\n return [b, 1 + max(l[1], r[1])]\\n return dfs(root)[0]\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n def dfs(root):\\n if not root:\\n return [True, 0]\\n\\n left, right = dfs(root.left), dfs(root.right)\\n isBalanced = left[0] and right[0] and abs(left[1] - right[1]) <= 1\\n\\n return [isBalanced, 1 + max(left[1], right[1])]\\n\\n return dfs(root)[0]\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def isBalanced(self, root: TreeNode | None) -> bool:\\n if not root:\\n return True\\n\\n def maxDepth(root: TreeNode | None) -> int:\\n if not root:\\n return 0\\n return 1 + max(maxDepth(root.left), maxDepth(root.right))\\n\\n return (abs(maxDepth(root.left) - maxDepth(root.right)) <= 1 and\\n self.isBalanced(root.left) and\\n self.isBalanced(root.right))\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n\\n # def getHeight(root):\\n # if not root:\\n # return 0\\n # leftHeight, rightHeight = getHeight(root.left), getHeight(root.right)\\n\\n # if leftHeight < 0 or rightHeight < 0 or abs(leftHeight - rightHeight) > 1:\\n # return 0\\n # return max(leftHeight, rightHeight) + 1\\n\\n # return (getHeight(root) >= 0)\\n\\n def dfs(node: Optional[TreeNode]) -> int:\\n if not node: return [True, 0]\\n leftNode, rightNode = dfs(node.left), dfs(node.right)\\n balanced = (leftNode[0] and rightNode[0] and abs(leftNode[1] - rightNode[1]) <= 1)\\n return [balanced, 1 + max(leftNode[1], rightNode[1])]\\n return dfs(root)[0]\\n \",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if root is None:\\n return True\\n\\n lHeight = self.findHeight(root.left)\\n rHeight = self.findHeight(root.right)\\n\\n if abs(lHeight - rHeight)<=1 and self.isBalanced(root.left) is True and self.isBalanced(root.right) is True:\\n return True\\n\\n return False\\n\\n def findHeight(self,node):\\n if node is None:\\n return 0\\n\\n lHeight = self.findHeight(node.left)\\n rHeight = self.findHeight(node.right)\\n\\n return max(lHeight,rHeight) + 1\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool: \\n if root: \\n if abs(self.subDepth(root.left)-self.subDepth(root.right)) > 1:\\n return False\\n if not self.isBalanced(root.left):\\n return False\\n if not self.isBalanced(root.right):\\n return False\\n return True\\n \\n def subDepth(self, root):\\n if not root:\\n return 0\\n return 1 + max(self.subDepth(root.left), self.subDepth(root.right))\\n\",\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n\\n #to track the height\\n def dfs(root):\\n if not root:\\n return [True, 0]\\n left = dfs(root.left)\\n right = dfs(root.right)\\n balanced = left[0] and right[0] and abs(left[1] - right[1]) <= 1\\n return [balanced, 1 + max(left[1], right[1])]\\n \\n return dfs(root)[0]\\n \",\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 def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n def findDepth(root,depth):\\n if not root:\\n return depth\\n else:\\n return max(findDepth(root.left,depth+1), findDepth(root.right,depth+1))\\n if abs(findDepth(root.left,0)-findDepth(root.right,0))>1:\\n return False\\n else:\\n return (self.isBalanced(root.left)) and (self.isBalanced(root.right))\\n \\n \",\n \"runtime\": \"57\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":64,"string":"64"},"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n # if root == None:\n # return True\n def depth(root):\n if root == None:\n return 0\n left = depth(root.left)\n right = depth(root.right)\n if left == -1 or right == -1:\n return -1\n if abs(left - right) > 1:\n return -1\n return max(left, right) + 1\n return depth(root) != -1\n ","memory":"16600"},{"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n bal = True\n\n def dfs(curr):\n if not curr: return 0\n\n left = 1 + dfs(curr.left)\n right = 1 + dfs(curr.right)\n\n nonlocal bal\n if abs(left - right) > 1:\n bal = False\n \n return max(left, right)\n \n dfs(root)\n return bal","memory":"16900"},{"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 maxDepth(self, root: Optional[TreeNode]) -> int:\n\n if not root:\n return 0\n\n queue = []\n\n queue.append((root, 1))\n\n maxD = 1\n\n while(len(queue) > 0):\n \n el, depth = queue.pop(0)\n maxD = depth\n if el:\n if el.left:\n queue.append((el.left, depth + 1)) \n if el.right:\n queue.append((el.right, depth + 1)) \n \n return maxD\n\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n\n if not root:\n return True\n d1 = self.maxDepth(root.left)\n d2 = self.maxDepth(root.right)\n\n if abs(d1 - d2) > 1:\n return False\n \n return self.isBalanced(root.left) and self.isBalanced(root.right)\n ","memory":"17000"},{"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n stack = [root]\n depths = {}\n last_left = False\n last_right = None\n while stack:\n node = stack[-1]\n if node.left and not last_left:\n stack.append(node.left)\n else:\n if node.right and last_right != node.right:\n stack.append(node.right)\n last_left = False\n else:\n stack.pop()\n left, right = depths.get(node.left,0), depths.get(node.right,0)\n if abs(left - right) > 1: return False\n depths[node] = 1 + max(left,right)\n last_right = node\n last_left = True\n return True\n \n\n\n ","memory":"17100"},{"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# class Solution:\n# def isBalanced(self, root: Optional[TreeNode]) -> bool:\n# return self.getHight(root) != -1\n\n# def getHight(self, node):\n# if not node:\n# return 0\n# leftHeight = self.getHight(node.left)\n# rightHeight = self.getHight(node.right)\n# if leftHeight == -1 or rightHeight == -1 or abs(leftHeight - rightHeight) > 1:\n# return -1\n# return max(leftHeight, rightHeight) + 1\n\nclass Solution:\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n \n height_map = {}\n stack = [root]\n while stack:\n node = stack.pop()\n if node:\n stack.append(node)\n stack.append(None)\n if node.left: stack.append(node.left)\n if node.right: stack.append(node.right)\n else:\n real_node = stack.pop()\n left, right = height_map.get(real_node.left, 0), height_map.get(real_node.right, 0)\n if abs(left - right) > 1:\n return False\n height_map[real_node] = 1 + max(left, right)\n return True","memory":"17200"},{"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n\n if not root:\n return True\n\n\n\n def getDepth(root):\n stack = [(root,1)]\n deep = 1\n while stack:\n node,depth = stack.pop()\n deep = max(deep,depth)\n if node.left:\n stack.append((node.left,depth+1))\n if node.right:\n stack.append((node.right,depth+1))\n return deep\n \n left = 0\n right = 0\n\n if root.left:\n left = getDepth(root.left)\n \n if root.right:\n right = getDepth(root.right)\n\n return abs(left-right) < 2 and self.isBalanced(root.left) and self.isBalanced(root.right)\n \n\n\n\n\n \n\n ","memory":"17300"},{"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 l(self,root):\n if not root:\n return 0\n queue=collections.deque([root])\n level=0\n while queue:\n for _ in range(len(queue)):\n cur=queue.popleft()\n if cur.left:\n queue.append(cur.left)\n if cur.right:\n queue.append(cur.right)\n level+=1\n return level\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n queue=collections.deque([root])\n while queue:\n cur=queue.popleft()\n ll=self.l(cur.left)\n lr=self.l(cur.right)\n if abs(ll-lr)>1:\n return False\n if cur.left:\n queue.append(cur.left)\n if cur.right:\n queue.append(cur.right)\n return True","memory":"17300"},{"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n \n #dfs\n def dfs(node):\n if not node: return 0\n\n l = dfs(node.left)\n if l == -1: return -1\n\n r = dfs(node.right)\n if r == -1: return -1\n\n if abs(l - r) > 1: return -1\n\n return max(l, r) + 1\n\n return dfs(root) != -1","memory":"17400"},{"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n\n if not root:\n return True\n \n left, right = self.maxDepth(root.left), self.maxDepth(root.right)\n\n if abs(left -right) > 1:\n return False\n return self.isBalanced(root.left) and self.isBalanced(root.right)\n\n \n def maxDepth(self, root):\n if not root:\n return True\n return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1\n \n\n\n\n\n\n \n ","memory":"17400"},{"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n if root is None:\n return True\n\n lHeight = self.findHeight(root.left)\n rHeight = self.findHeight(root.right)\n\n if abs(lHeight - rHeight)<=1 and self.isBalanced(root.left) is True and self.isBalanced(root.right) is True:\n return True\n\n return False\n\n def findHeight(self,node):\n if node is None:\n return 0\n\n lHeight = self.findHeight(node.left)\n rHeight = self.findHeight(node.right)\n\n return max(lHeight,rHeight) + 1","memory":"17500"},{"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\ndef findDepth(node):\n if node == None:\n return 0\n else: \n return 1+ max( findDepth(node.right), findDepth(node.left))\n\nclass Solution:\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n if root == None:\n return True\n\n return abs(findDepth(root.right) - findDepth(root.left)) < 2 and self.isBalanced(root.right) and self.isBalanced(root.left) \n","memory":"17500"},{"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\ndef travel(root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n \n lh = travel(root.left)\n rh = travel(root.right)\n\n if lh == -1 or rh == -1:\n return -1\n \n elif abs(lh - rh) > 1:\n return -1\n\n return 1 + max(lh,rh)\n \n \n\n # if math.max(rh - lh) > 1:\n # return False\n \n\nclass Solution:\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n return travel(root) > -1\n \n \n \n ","memory":"17600"},{"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\n def getHeight(self, root):\n if not root:\n return 0\n\n leftH = self.getHeight(root.left)\n rightH = self.getHeight(root.right)\n\n if leftH == -1 or rightH == -1:\n return -1\n \n if abs(leftH - rightH) > 1:\n return -1\n \n return max(leftH, rightH) + 1\n\n\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\n if not root:\n return True\n\n return self.getHeight(root) != -1\n\n \n ","memory":"17600"},{"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\n\n def dfs(node):\n if not node:\n return 0\n \n leftHeight = dfs(node.left)\n rightHeight = dfs(node.right)\n\n if leftHeight == -1 or rightHeight == -1:\n return -1\n\n if abs(leftHeight-rightHeight) > 1:\n return -1\n \n return max(leftHeight,rightHeight) + 1\n \n return False if dfs(root) == -1 else True\n\n ","memory":"17700"}],"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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n # if root == None:\\n # return True\\n def depth(root):\\n if root == None:\\n return 0\\n left = depth(root.left)\\n right = depth(root.right)\\n if left == -1 or right == -1:\\n return -1\\n if abs(left - right) > 1:\\n return -1\\n return max(left, right) + 1\\n return depth(root) != -1\\n \",\n \"memory\": \"16600\"\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n bal = True\\n\\n def dfs(curr):\\n if not curr: return 0\\n\\n left = 1 + dfs(curr.left)\\n right = 1 + dfs(curr.right)\\n\\n nonlocal bal\\n if abs(left - right) > 1:\\n bal = False\\n \\n return max(left, right)\\n \\n dfs(root)\\n return bal\",\n \"memory\": \"16900\"\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 maxDepth(self, root: Optional[TreeNode]) -> int:\\n\\n if not root:\\n return 0\\n\\n queue = []\\n\\n queue.append((root, 1))\\n\\n maxD = 1\\n\\n while(len(queue) > 0):\\n \\n el, depth = queue.pop(0)\\n maxD = depth\\n if el:\\n if el.left:\\n queue.append((el.left, depth + 1)) \\n if el.right:\\n queue.append((el.right, depth + 1)) \\n \\n return maxD\\n\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n\\n if not root:\\n return True\\n d1 = self.maxDepth(root.left)\\n d2 = self.maxDepth(root.right)\\n\\n if abs(d1 - d2) > 1:\\n return False\\n \\n return self.isBalanced(root.left) and self.isBalanced(root.right)\\n \",\n \"memory\": \"17000\"\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n stack = [root]\\n depths = {}\\n last_left = False\\n last_right = None\\n while stack:\\n node = stack[-1]\\n if node.left and not last_left:\\n stack.append(node.left)\\n else:\\n if node.right and last_right != node.right:\\n stack.append(node.right)\\n last_left = False\\n else:\\n stack.pop()\\n left, right = depths.get(node.left,0), depths.get(node.right,0)\\n if abs(left - right) > 1: return False\\n depths[node] = 1 + max(left,right)\\n last_right = node\\n last_left = True\\n return True\\n \\n\\n\\n \",\n \"memory\": \"17100\"\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# class Solution:\\n# def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n# return self.getHight(root) != -1\\n\\n# def getHight(self, node):\\n# if not node:\\n# return 0\\n# leftHeight = self.getHight(node.left)\\n# rightHeight = self.getHight(node.right)\\n# if leftHeight == -1 or rightHeight == -1 or abs(leftHeight - rightHeight) > 1:\\n# return -1\\n# return max(leftHeight, rightHeight) + 1\\n\\nclass Solution:\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n \\n height_map = {}\\n stack = [root]\\n while stack:\\n node = stack.pop()\\n if node:\\n stack.append(node)\\n stack.append(None)\\n if node.left: stack.append(node.left)\\n if node.right: stack.append(node.right)\\n else:\\n real_node = stack.pop()\\n left, right = height_map.get(real_node.left, 0), height_map.get(real_node.right, 0)\\n if abs(left - right) > 1:\\n return False\\n height_map[real_node] = 1 + max(left, right)\\n return True\",\n \"memory\": \"17200\"\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n\\n if not root:\\n return True\\n\\n\\n\\n def getDepth(root):\\n stack = [(root,1)]\\n deep = 1\\n while stack:\\n node,depth = stack.pop()\\n deep = max(deep,depth)\\n if node.left:\\n stack.append((node.left,depth+1))\\n if node.right:\\n stack.append((node.right,depth+1))\\n return deep\\n \\n left = 0\\n right = 0\\n\\n if root.left:\\n left = getDepth(root.left)\\n \\n if root.right:\\n right = getDepth(root.right)\\n\\n return abs(left-right) < 2 and self.isBalanced(root.left) and self.isBalanced(root.right)\\n \\n\\n\\n\\n\\n \\n\\n \",\n \"memory\": \"17300\"\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 l(self,root):\\n if not root:\\n return 0\\n queue=collections.deque([root])\\n level=0\\n while queue:\\n for _ in range(len(queue)):\\n cur=queue.popleft()\\n if cur.left:\\n queue.append(cur.left)\\n if cur.right:\\n queue.append(cur.right)\\n level+=1\\n return level\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n queue=collections.deque([root])\\n while queue:\\n cur=queue.popleft()\\n ll=self.l(cur.left)\\n lr=self.l(cur.right)\\n if abs(ll-lr)>1:\\n return False\\n if cur.left:\\n queue.append(cur.left)\\n if cur.right:\\n queue.append(cur.right)\\n return True\",\n \"memory\": \"17300\"\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n \\n #dfs\\n def dfs(node):\\n if not node: return 0\\n\\n l = dfs(node.left)\\n if l == -1: return -1\\n\\n r = dfs(node.right)\\n if r == -1: return -1\\n\\n if abs(l - r) > 1: return -1\\n\\n return max(l, r) + 1\\n\\n return dfs(root) != -1\",\n \"memory\": \"17400\"\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n\\n if not root:\\n return True\\n \\n left, right = self.maxDepth(root.left), self.maxDepth(root.right)\\n\\n if abs(left -right) > 1:\\n return False\\n return self.isBalanced(root.left) and self.isBalanced(root.right)\\n\\n \\n def maxDepth(self, root):\\n if not root:\\n return True\\n return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1\\n \\n\\n\\n\\n\\n\\n \\n \",\n \"memory\": \"17400\"\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if root is None:\\n return True\\n\\n lHeight = self.findHeight(root.left)\\n rHeight = self.findHeight(root.right)\\n\\n if abs(lHeight - rHeight)<=1 and self.isBalanced(root.left) is True and self.isBalanced(root.right) is True:\\n return True\\n\\n return False\\n\\n def findHeight(self,node):\\n if node is None:\\n return 0\\n\\n lHeight = self.findHeight(node.left)\\n rHeight = self.findHeight(node.right)\\n\\n return max(lHeight,rHeight) + 1\",\n \"memory\": \"17500\"\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\\ndef findDepth(node):\\n if node == None:\\n return 0\\n else: \\n return 1+ max( findDepth(node.right), findDepth(node.left))\\n\\nclass Solution:\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if root == None:\\n return True\\n\\n return abs(findDepth(root.right) - findDepth(root.left)) < 2 and self.isBalanced(root.right) and self.isBalanced(root.left) \\n\",\n \"memory\": \"17500\"\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\\ndef travel(root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n \\n lh = travel(root.left)\\n rh = travel(root.right)\\n\\n if lh == -1 or rh == -1:\\n return -1\\n \\n elif abs(lh - rh) > 1:\\n return -1\\n\\n return 1 + max(lh,rh)\\n \\n \\n\\n # if math.max(rh - lh) > 1:\\n # return False\\n \\n\\nclass Solution:\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n return travel(root) > -1\\n \\n \\n \\n \",\n \"memory\": \"17600\"\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\\n def getHeight(self, root):\\n if not root:\\n return 0\\n\\n leftH = self.getHeight(root.left)\\n rightH = self.getHeight(root.right)\\n\\n if leftH == -1 or rightH == -1:\\n return -1\\n \\n if abs(leftH - rightH) > 1:\\n return -1\\n \\n return max(leftH, rightH) + 1\\n\\n\\n def isBalanced(self, root: Optional[TreeNode]) -> bool:\\n if not root:\\n return True\\n\\n return self.getHeight(root) != -1\\n\\n \\n \",\n \"memory\": \"17600\"\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 isBalanced(self, root: Optional[TreeNode]) -> bool:\\n\\n def dfs(node):\\n if not node:\\n return 0\\n \\n leftHeight = dfs(node.left)\\n rightHeight = dfs(node.right)\\n\\n if leftHeight == -1 or rightHeight == -1:\\n return -1\\n\\n if abs(leftHeight-rightHeight) > 1:\\n return -1\\n \\n return max(leftHeight,rightHeight) + 1\\n \\n return False if dfs(root) == -1 else True\\n\\n \",\n \"memory\": \"17700\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":14,"string":"14"}}},{"rowIdx":164,"cells":{"question_id":{"kind":"number","value":268,"string":"268"},"name":{"kind":"string","value":"missing-number"},"content":{"kind":"string","value":"<p>Given an array <code>nums</code> containing <code>n</code> distinct numbers in the range <code>[0, n]</code>, return <em>the only number in the range that is missing from the array.</em></p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [3,0,1]\n<strong>Output:</strong> 2\n<strong>Explanation:</strong> n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [0,1]\n<strong>Output:</strong> 2\n<strong>Explanation:</strong> n = 2 since there are 2 numbers, so all numbers are in the range [0,2]. 2 is the missing number in the range since it does not appear in nums.\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [9,6,4,2,3,5,7,0,1]\n<strong>Output:</strong> 8\n<strong>Explanation:</strong> n = 9 since there are 9 numbers, so all numbers are in the range [0,9]. 8 is the missing number in the range since it does not appear in nums.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>n == nums.length</code></li>\n\t<li><code>1 <= n <= 10<sup>4</sup></code></li>\n\t<li><code>0 <= nums[i] <= n</code></li>\n\t<li>All the numbers of <code>nums</code> are <strong>unique</strong>.</li>\n</ul>\n\n<p> </p>\n<p><strong>Follow up:</strong> Could you implement a solution using only <code>O(1)</code> extra space complexity and <code>O(n)</code> runtime complexity?</p>\n"},"acRate":{"kind":"number","value":68.09006733316384,"string":"68.090067"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["array","hash-table","math","binary-search","bit-manipulation","sorting"],"string":"[\n \"array\",\n \"hash-table\",\n \"math\",\n \"binary-search\",\n \"bit-manipulation\",\n \"sorting\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"33\", 0.09100000000000001], [\"53\", 0.0315], [\"73\", 0.0175], [\"94\", 18.361599999999996], [\"114\", 62.673700000000004], [\"134\", 2.5714000000000006], [\"155\", 0.17500000000000007], [\"175\", 0.16100000000000003], [\"196\", 0.028], [\"216\", 0.0245], [\"236\", 0.0175], [\"257\", 0.0175], [\"277\", 0.014], [\"297\", 0.014], [\"318\", 0.014], [\"338\", 0.014], [\"358\", 0.007], [\"379\", 0.0035], [\"399\", 0.0175], [\"420\", 0.0035], [\"440\", 0.0035], [\"460\", 0.0035], [\"481\", 0.0035], [\"501\", 0.0035], [\"521\", 0.0035], [\"542\", 0.0035], [\"562\", 0.0035], [\"582\", 0.007], [\"603\", 0.0035], [\"623\", 0.0035], [\"644\", 0.0035], [\"664\", 0.0035], [\"684\", 0.007], [\"705\", 0.0105], [\"725\", 0.0035], [\"745\", 0.0035], [\"766\", 0.007], [\"786\", 0.0035], [\"806\", 0.0035], [\"827\", 0.0035], [\"847\", 0.0035], [\"868\", 0.0035], [\"888\", 0.035], [\"908\", 0.0245], [\"929\", 0.0105], [\"949\", 0.021], [\"969\", 0.0105], [\"990\", 0.007], [\"1010\", 0.0175], [\"1030\", 0.0105], [\"1051\", 0.0105], [\"1071\", 0.0035], [\"1092\", 0.0035], [\"1112\", 0.0035], [\"1132\", 0.007], [\"1153\", 0.0035], [\"1173\", 0.0035], [\"1193\", 0.0035], [\"1214\", 0.0035], [\"1234\", 0.0035], [\"1254\", 0.0035], [\"1275\", 0.007], [\"1295\", 0.0175], [\"1316\", 0.07000000000000002], [\"1336\", 0.16800000000000004], [\"1356\", 0.15050000000000005], [\"1377\", 0.14700000000000005], [\"1397\", 0.16100000000000003], [\"1417\", 0.17150000000000007], [\"1438\", 0.12250000000000003], [\"1458\", 0.15750000000000003], [\"1478\", 0.6934], [\"1499\", 1.4717], [\"1519\", 1.4473], [\"1540\", 1.2017], [\"1560\", 1.0756999999999999], [\"1580\", 1.0055], [\"1601\", 0.8332999999999998], [\"1621\", 0.8231], [\"1641\", 0.7247]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16900\", 0.007], [\"17100\", 0.0175], [\"17200\", 0.0876], [\"17300\", 0.0701], [\"17400\", 0.049], [\"17500\", 0.2523], [\"17600\", 3.9344], [\"17700\", 44.8446], [\"17800\", 32.9538], [\"17900\", 3.0936], [\"18000\", 1.8498], [\"18100\", 1.2017], [\"18200\", 0.3153], [\"18300\", 0.2558], [\"18400\", 1.9129], [\"18500\", 4.0045]]}"},"rt_list":{"kind":"list like","value":[{"code":"def missingNumber(nums: List[int]) -> int:\n return ((n:=len(nums)) * (n+1) // 2) - sum(nums)\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f\"{missingNumber(case)}\\n\")\nexit(0)","runtime":"33"},{"code":"def missingNumber(nums: List[int]) -> int:\n return ((n:=len(nums)) * (n+1) // 2) - sum(nums)\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f\"{missingNumber(case)}\\n\")\nexit(0)","runtime":"33"},{"code":"def missingNumber(nums: List[int]) -> int:\n return ((n:=len(nums)) * (n+1) // 2) - sum(nums)\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f\"{missingNumber(case)}\\n\")\nexit(0)\n","runtime":"53"},{"code":"def missingNumber(nums: List[int]) -> int:\n return ((n:=len(nums)) * (n+1) // 2) - sum(nums)\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f\"{missingNumber(case)}\\n\")\nexit(0)","runtime":"53"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n=len(nums)\n total=(n*(n+1))//2\n lsum= sum(nums)\n return total-lsum","runtime":"73"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n sum_ = n*(n+1)/2\n return int(sum_ - sum(nums))\n ","runtime":"73"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n=len(nums)\n sumNum=sum(nums)\n total_sum=n*(n+1)//2\n return total_sum-sumNum ","runtime":"94"},{"code":"from typing import List\n\nclass Solution:\n def missingNumber(self, nums: List[int]) -> int:\n # Cria uma lista de 0 até n\n new_list = list(range(0, len(nums) + 1))\n \n # Encontra a diferença entre new_list e nums\n diference = set(new_list) - set(nums)\n \n # Se houver diferença, retorna o único número faltante\n if diference:\n return diference.pop()","runtime":"94"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n=len(nums)\n sum_1=n*(n+1)//2\n sum_2=sum(nums)\n missingnumber=sum_1-sum_2\n return missingnumber\n ","runtime":"114"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n total = 0\n curr = 0\n for i in range (n + 1):\n total += i\n for i in range (n):\n curr += nums[i]\n \n return total - curr\n\n\n\n ","runtime":"114"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n \n for i in range(n):\n if nums[i] != i:\n return i\n \n return n","runtime":"134"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums = sorted(nums)\n if nums[0] != 0:\n return 0\n for i in range(len(nums)-1):\n if (nums[i] + 2) == nums[i+1]:\n return nums[i] + 1\n \n return len(nums)\n\n ","runtime":"134"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n first = nums[0]\n if first != 0:\n return 0\n if len(nums) == 1:\n if first == 1:\n return 0\n else:\n return 1\n for num in range(1, len(nums)):\n if nums[num] - 1 != first:\n return first + 1\n else:\n print(num)\n print(first)\n first = nums[num]\n return len(nums)\n ","runtime":"155"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums_s = sorted(nums)\n i = 0\n print(nums_s)\n for num in nums_s:\n print(f'i={i}, num={num}')\n if num != i:\n return i\n i += 1\n \n # Edge case, last value is missing\n return len(nums)","runtime":"155"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n a=[]\n for i in range(len(nums)+1):\n a.append(i)\n print(a)\n nums.sort()\n for i in nums:\n a.remove(i)\n return a[0]\n ","runtime":"196"},{"code":"from typing import List\n\nclass Solution:\n def partition(self, arr: List[int], l: int, r: int) -> int:\n pivot = arr[r]\n i = l - 1\n for j in range(l, r):\n if arr[j] <= pivot:\n i += 1\n arr[i], arr[j] = arr[j], arr[i]\n arr[i + 1], arr[r] = arr[r], arr[i + 1]\n return i + 1\n\n def quick_sort(self, arr: List[int], l: int, r: int):\n if l < r:\n pi = self.partition(arr, l, r)\n self.quick_sort(arr, l, pi - 1)\n self.quick_sort(arr, pi + 1, r)\n\n def missingNumber(self, nums: List[int]) -> int:\n self.quick_sort(nums, 0, len(nums) - 1)\n for i in range(len(nums)):\n if nums[i] != i:\n return i\n return len(nums)\n","runtime":"196"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n l = len(nums)\n for i in range(l):\n print(i, ' - ', nums[i], ' = ', i - nums[i])\n l += i - nums[i]\n print(l)\n return l","runtime":"216"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n res = len(nums)\n print(f\"Initial res = {res} (length of nums)\")\n\n for i in range(len(nums)):\n print(f\"\\nIteration {i}:\")\n print(f\" Current index i = {i}\")\n print(f\" Current value nums[{i}] = {nums[i]}\")\n res += i - nums[i]\n print(f\" Updated res = {res} (after adding i and subtracting nums[{i}])\")\n \n print(f\"\\nFinal result: missing number = {res}\")\n return res\n","runtime":"216"},{"code":"class Solution:\n def mergeSort(self, array):\n if len(array) > 1:\n \n # r is the point where the array is divided into two subarrays\n r = len(array) // 2\n L = array[:r]\n M = array[r:]\n \n # Sort the two halves\n self.mergeSort(L)\n self.mergeSort(M)\n \n i = j = k = 0\n \n # Until we reach either end of either L or M, pick larger among\n # elements L and M and place them in the correct position at array[k]\n while i < len(L) and j < len(M):\n if L[i] < M[j]:\n array[k] = L[i]\n i += 1\n else:\n array[k] = M[j]\n j += 1\n k += 1\n \n # When we run out of elements in either L or M,\n # pick up the remaining elements and put in array[k]\n while i < len(L):\n array[k] = L[i]\n i += 1\n k += 1\n \n while j < len(M):\n array[k] = M[j]\n j += 1\n k += 1\n \n def missingNumber(self, nums: list[int]) -> int:\n length = len(nums)\n self.mergeSort(nums)\n \n counter = 0\n while counter < length:\n cur_val = nums[counter]\n if cur_val == counter:\n counter += 1\n continue \n else:\n return counter\n \n return length","runtime":"236"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n def mn(nums1):\n if(len(nums1)>1):\n middle=len(nums1)//2\n leftmid=nums1[:middle]\n rightmid=nums1[middle:]\n left=mn(leftmid)\n right=mn(rightmid)\n i=j=k=0\n while i<len(left) and j<len(right):\n if left[i]<right[j]:\n nums1[k]=left[i]\n k+=1\n i+=1\n else:\n nums1[k]=right[j]\n j+=1\n k+=1\n \n while i<len(left):\n nums1[k]=left[i]\n i+=1\n k+=1\n while j<len(right):\n nums1[k]=right[j]\n j+=1\n k+=1\n return(nums1)\n n=mn(nums)\n print(n)\n for i in range(0,len(n)-1):\n if n[i+1]-n[i] ==2:\n return i+1\n if n[0]!=0:\n return 0\n else:\n return len(n)\n\n\n\n ","runtime":"236"},{"code":"import numpy as np\nclass Solution:\n def missingNumber(self, nums: List[int]) -> int:\n a,b = 0,0\n for i in range(len(nums)+1):\n a^=i\n for j in nums:\n b^=j\n return a^b\n\n\n","runtime":"257"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n if 0 not in nums: return 0\n total = math.factorial(len(nums))\n newtotal = 1\n for num in nums:\n if num != 0:\n newtotal *= num\n \n return total // newtotal","runtime":"257"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n \n if 0 not in nums:\n return 0\n \n if 1 not in nums:\n return 1\n\n total = 1\n\n for num in nums:\n if num != 0:\n total *= num\n\n left = int(factorial(max(nums)) / total)\n\n if left == 1:\n return max(nums) + 1\n\n return left","runtime":"277"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n prod = 1\n zero = False\n for i in nums:\n if i:\n prod *= i\n else:\n zero = True\n\n return 0 if not zero else int(math.factorial(n) / prod)","runtime":"277"},{"code":"import numpy as np\nclass Solution:\n def missingNumber(self, nums: List[int]) -> int:\n # solved by me:\n # n = len(nums)\n \n # while n>=0:\n # if n not in nums:\n # return n\n # else:\n # n = n-1\n\n\n # Another way to solve it with mem o(1) and time o(n):\n res = len(nums)\n\n for i in range(len(nums)):\n #print(\"Res\", res)\n #print(i, nums[i])\n res+= i - nums[i]\n #print(res)\n return res \n\n","runtime":"297"},{"code":"import numpy as np\nclass Solution:\n # def missingNumber(self, nums: List[int]) -> int:\n # def missingNumber(self, num):\n def missingNumber(self, nums):\n # def return_n(nums):\n len_nums = len(nums)\n nums = sorted(nums)\n\n if nums[0] != 0:\n return 0\n\n for idx in range(len_nums - 1):\n if nums[idx] + 1 != nums[idx + 1]:\n return nums[idx] + 1\n\n return len_nums\n ","runtime":"297"},{"code":"import numpy as np\n\n\nclass Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n sum1 = (n*(n+1))//2\n sum2 = sum(nums)\n return sum1-sum2","runtime":"318"},{"code":"import numpy as np\nclass Solution:\n # def missingNumber(self, nums: List[int]) -> int:\n # def missingNumber(self, num):\n def missingNumber(self, nums):\n # def solve(nums: list) -> int:\n x = set(nums)\n for i in range(0, len(nums) + 1):\n if i in x:\n continue\n return i\n ","runtime":"318"},{"code":"import numpy as np\nclass Solution:\n def missingNumber(self, nums: List[int]) -> int:\n # solved by me:\n # n = len(nums)\n \n # while n>=0:\n # if n not in nums:\n # return n\n # else:\n # n = n-1\n\n\n # Another way to solve it with mem o(1) and time o(n):\n res = len(nums)\n\n for i in range(len(nums)):\n print(\"Res\", res)\n print(i, nums[i])\n res+= i - nums[i]\n print(res)\n return res \n\n","runtime":"338"},{"code":"import numpy as np\nclass Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n left = ((n+1)*n)//2\n return left - np.sum(nums)\n ","runtime":"338"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n factorial = 1\n for i in range(1, len(nums) + 1):\n factorial *= i\n\n product = 1\n is_null = False\n for num in nums:\n if num == 0:\n is_null = True\n else:\n product *= num\n \n if not is_null:\n return 0\n else:\n return factorial // product","runtime":"358"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n product = 1\n is_seen_zero = False\n\n factorial = 1\n\n for i in range(len(nums)):\n if nums[i] == 0:\n is_seen_zero = True\n else:\n product *= nums[i]\n\n factorial *= (i + 1)\n\n\n if not is_seen_zero:\n return 0\n else:\n return factorial // product","runtime":"379"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n nums.sort()\n\n for i in range(n + 1):\n low = 0\n high = len(nums) - 1\n while low <= high:\n mid = (low + high) // 2\n guess = nums[mid]\n print(f\"{i} and {nums[mid]}\")\n if i == guess:\n break\n elif i < guess:\n high = mid - 1\n else:\n low = mid + 1\n if low > high:\n return i\n \n \n\n","runtime":"399"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n # [0,1,2,3]\n # n = 4\n # If all number where there the max -> 4! = 24\n # Actual amount -> 1*2*3 = 6\n # Missing number -> 24 / 6 = 4\n n = len(nums)\n maxV = 1\n actual = 1\n foundZero = False\n for i in range(len(nums)):\n if nums[i] == 0:\n foundZero = True\n # To keep track of max amout\n if i != 0:\n maxV = maxV * i\n # Keep track of actual\n if nums[i] != 0:\n actual = actual * nums[i]\n if foundZero == False:\n return 0\n return (maxV * len(nums)) // actual\n ","runtime":"399"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n\n maximum = len(nums)\n answer = 0\n \n while maximum > 0:\n if maximum in nums:\n maximum -= 1\n else:\n answer = maximum\n break\n \n return answer\n ","runtime":"420"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n max_num = len(nums)\n\n while max_num >= 0:\n if max_num not in nums:\n return max_num\n max_num -=1","runtime":"440"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n x_max = len(nums)\n while x_max in nums:\n x_max = x_max-1\n \n return x_max\n \n \n \n ","runtime":"460"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n while n in nums:\n n = n-1\n return n","runtime":"481"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n\n length = len(nums) + 1\n\n while length >= 0:\n if length - 1 not in nums: \n return length - 1\n length -= 1\n \n ","runtime":"501"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n\n length = len(nums) + 1\n\n while length >= 0:\n if length - 1 not in nums: \n return length - 1\n length -= 1\n \n ","runtime":"521"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n\n length = len(nums)\n\n while length >= 0:\n if length not in nums: \n return length\n length -= 1\n \n ","runtime":"542"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n while(n >= 0):\n if n not in nums:\n return n\n n -= 1\n \n\n \n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n","runtime":"562"},{"code":"\nclass Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n=len(nums)\n for i in range(n,-1,-1):\n if i not in nums:\n return int(i)\n\n ","runtime":"582"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums_count=len(nums)\n while nums_count:\n if nums_count not in nums:\n return nums_count\n nums_count -= 1\n return 0\n ","runtime":"603"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n m=len(nums)\n for i in range(m+1):\n diff=m-i\n\n if diff not in nums:\n return diff\n return -1\n\n ","runtime":"623"},{"code":"class Solution:\n def missingNumber(self, nums: list[int]) -> int:\n n = len(nums)\n \n for i in range(n + 1):\n diff = n - i\n \n if diff not in nums:\n return diff\n return -1","runtime":"644"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n while(n >= 0):\n if n not in nums:\n return n\n n -= 1\n \n","runtime":"664"},{"code":"class Solution:\n def missingNumber(self, nums: list[int]) -> int:\n n = len(nums)\n \n for i in range(n + 1):\n diff = n - i\n \n if diff not in nums:\n return diff\n return -1\n \n ","runtime":"684"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n max_num = len(nums)\n\n while max_num >= 0:\n if max_num not in nums:\n return max_num\n max_num -=1\n ","runtime":"705"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n\n length = len(nums) + 1\n\n while length >= 0:\n if length - 1 not in nums: \n return length - 1\n length -= 1\n \n ","runtime":"725"},{"code":"class Solution:\n def missingNumber(self, nums: list[int]) -> int:\n n = len(nums)\n \n for i in range(n + 1):\n diff = n - i\n \n if diff not in nums:\n return diff\n return -1","runtime":"745"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n if len(nums) == 1:\n return abs(len(nums) - nums[0])\n\n if 0 not in nums:\n return 0\n for i in range(len(nums)):\n if abs(len(nums) - i) not in nums:\n print(len(nums) - i)\n return abs(len(nums) - i)\n return -1","runtime":"766"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n max = nums[0]\n for i in range(len(nums)):\n if(nums[i]>max):\n max = nums[i]\n temp = max\n while True:\n if(temp<0):\n break\n if temp not in nums:\n return temp\n temp -= 1\n return (max+1)","runtime":"786"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n \n for i in range(n + 1):\n diff = n - i\n \n if diff not in nums:\n return diff\n return -1","runtime":"806"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n x = max(nums)\n while(x>0):\n if x-1 not in nums:\n return x-1\n x-=1\n return max(nums)+1","runtime":"827"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for i in range(len(nums),-1,-1):\n if i not in nums:\n return i","runtime":"847"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n length = len(nums)\n while length > -1:\n if length not in nums:\n return length\n else:\n length = length - 1\n\n\n\n '''\n max = nums[0]\n for x in nums:\n if x > max:\n max = x\n '''","runtime":"868"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)# n = 9\n\n for i in range(n + 1): # [0,1,2,3,4,5,6,7,8,9]\n diff = n - i # diff = 9-1 = 8\n\n if diff not in nums:# if 8 not in nums[9,6,4,2,3,5,7,0,1]\n return diff # return 8\n return - 1","runtime":"888"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n=len(nums)\n for i in range(n+1):\n diff = n-i\n if diff not in nums:\n return diff\n \n return -1\n","runtime":"888"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n length = len(nums)\n while length in nums:\n length -= 1\n return length","runtime":"908"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for i in range(len(nums),0,-1):\n if i not in nums:\n return i\n return 0","runtime":"908"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n i=len(nums)\n for i in range(len(nums),-1,-1):\n print(i)\n if i not in nums:\n break\n return i\n ","runtime":"929"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n if len(nums) == 1:\n return abs(len(nums) - nums[0])\n\n if 0 not in nums:\n return 0\n for i in range(len(nums)):\n if abs(len(nums) - i) not in nums:\n print(len(nums) - i)\n return abs(len(nums) - i)\n return -1","runtime":"929"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n a = max(nums)\n b = min(nums)\n for i in range(1,len(nums)):\n if b+i not in nums:\n return b+i\n elif a-i not in nums:\n return a-i\n if b == 1 :\n return 0\n elif len(nums) == 1:\n if nums[0] == 0:\n return nums[0] + 1\n return nums[0] - 1\n return a+1\n ","runtime":"949"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n while n>=0:\n if n not in nums:\n return n\n n-=1","runtime":"949"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n\n l = 0\n r = len(nums)\n \n while l <= r:\n if l not in nums:\n return l\n if r not in nums:\n return r\n l += 1\n r -= 1\n","runtime":"969"},{"code":"class Solution:\n def missingNumber(self, nums: list[int]) -> int:\n n = len(nums)\n \n for i in range(n + 1):\n diff = n - i\n \n if diff not in nums:\n return diff\n return -1","runtime":"969"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n i = 0\n j = len(nums)\n while i != j:\n if i in nums:\n i += 1\n else: \n return i\n if j in nums:\n j -= 1\n else: \n return j\n return i","runtime":"990"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n\n # we know that every number in nums is unique\n product = 1\n for i in range(1, len(nums)+1):\n product *= i\n\n found0 = False\n for number in nums:\n if number != 0:\n product //= number\n else:\n found0 = True\n\n if not found0:\n return 0\n else:\n return product\n\n\n \n\n \n\n ","runtime":"990"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n sort = len(nums)\n while sort != 0:\n if sort not in nums:\n return sort\n sort-=1\n return 0","runtime":"1010"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n if 0 not in nums:\n return 0\n mx=max(nums)\n def factorial(num):\n if num==0:\n return 1\n else:\n return num*factorial(num-1)\n current=int(factorial(mx))\n for i in nums:\n if i !=0:\n current//=i\n if current==1:\n if 1 not in nums:\n return 1\n else:\n return mx+1\n else:\n return int(current)","runtime":"1010"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for num in nums:\n if num - 1 in nums:\n pass\n elif num!=0:\n return num - 1\n for num in nums:\n if num + 1 in nums:\n pass\n else:\n return num + 1\n","runtime":"1030"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n length = len(nums)\n while length in nums:\n length -= 1\n return length","runtime":"1030"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n i = 0\n j = len(nums)\n while i <= j:\n if i not in nums:\n return i\n if j not in nums:\n return j\n i += 1\n j -= 1\n\n #for i in range(0, len(nums)+1):\n # if i not in nums:\n # return i","runtime":"1051"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n \n for num in nums:\n ans = len(nums) - num\n if not(ans in nums):\n return ans\n return 1","runtime":"1071"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for i in nums:\n if i != 0:\n if i-1 not in nums:\n return i-1\n return len(nums)\n ","runtime":"1092"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n i=len(nums)\n while(i>=0):\n if i in nums:\n i=i-1\n continue\n \n else:\n return i ","runtime":"1112"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for i in range(len(nums)):\n if nums[i] > 0 and nums[i] - 1 not in nums:\n return nums[i] - 1\n return max(nums) + 1\n\n ","runtime":"1132"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort() \n for i in range(0, len(nums) + 1):\n if i not in nums:\n return i\n return 0\n \n","runtime":"1153"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n for i in range(n+1):\n if i not in nums:\n return i\n","runtime":"1173"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n i=len(nums)\n while i>=0:\n if i not in nums:\n return i\n else:\n i-=1","runtime":"1193"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n m = 0\n for i in range(len(nums)):\n if m not in nums:\n return m\n m += 1\n return m\n ","runtime":"1214"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n # max_int = max(nums)\n if(max(nums) == len(nums)-1):\n return max(nums)+1\n else:\n # sum_int = 0\n for i in range(len(nums)+1):\n try:\n nums.remove(i)\n except:\n return i\n # sum_int += i\n # if(i != len(nums)):\n # sum_int -= nums[i]\n # return sum_int\n\n ","runtime":"1234"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n h={}\n for i in range(len(nums)+1):\n if i not in h:\n if i not in nums:\n return i\n h[nums[i]]=1\n \n \n \n ","runtime":"1254"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n for i in range(0,len(nums)+1):\n if i not in nums:\n return i\n ","runtime":"1275"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n temp_set=set(nums)\n result=list(temp_set)\n dist_num=len(result)\n print(dist_num)\n for i in range(dist_num+1):\n if i not in result:\n return i\n ","runtime":"1295"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n for i in range((len(nums)+1)):\n if i not in nums:\n return i\n\n return 0","runtime":"1295"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n for i in range(len(nums)+1):\n if i not in nums:\n return i","runtime":"1316"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n for i in range(n+1):\n if i not in nums:\n return i","runtime":"1316"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n\n nums.sort()\n #if n == 1:\n #return 0\n\n for i in range(0,len(nums)):\n if i not in nums:\n return i\n return nums[-1] + 1","runtime":"1336"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums=sorted(nums)\n for i in range(0,len(nums)):\n if nums[0]==1:\n return 0\n elif nums[i]+1 in nums and nums[0]==0:\n continue\n else:\n return nums[i]+1\n","runtime":"1336"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n for i in range(len(nums)+1):\n if i not in nums:\n return i","runtime":"1356"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n for i in range(len(nums)+1):\n if i not in nums:\n return i\n else:\n continue\n \n","runtime":"1356"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n lenNums=len(nums)\n nums.sort()\n numArr=[i for i in range(0,lenNums+1)]\n for num in numArr:\n if num not in nums:\n return num\n \n\n\n ","runtime":"1377"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n for i in range(0,len(nums)+1):\n if i not in nums:\n return i \n ","runtime":"1377"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n c=[]\n nums.sort()\n l=len(nums)\n for i in range(l+1):\n c.append(i)\n for i in c:\n if i not in nums:\n return i\n ","runtime":"1397"},{"code":"class Solution:\n def missingNumber(self, l: List[int]) -> int:\n l.sort()\n for i in range(len(l)+1):\n if i not in l:\n return i","runtime":"1397"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n for i in range(len(nums)+1):\n if i not in nums:\n return i\n","runtime":"1417"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n for i in range(len(nums)+1):\n if i not in nums:\n return i","runtime":"1417"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for x in range(len(nums)+1):\n if x not in nums:\n return x","runtime":"1438"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n maxNum = len(nums)\n for i in range(0, maxNum + 1):\n if i not in nums:\n return i\n\n ","runtime":"1438"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for i in range(len(nums)+1):\n if i not in nums:\n return i","runtime":"1458"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for i in range(len(nums)+1):\n if i not in nums:\n return i\n\n ","runtime":"1458"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n return next(i for i in range(len(nums)+1) if i not in nums)\n \n ","runtime":"1478"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n for i in range(n + 1):\n if i not in nums:\n return i","runtime":"1478"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n=len(nums)\n for i in range(n+1):\n if (i not in nums):\n return i","runtime":"1499"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n m=max(nums)\n for i in range(m+2):\n if i not in nums:\n return i\n\n ","runtime":"1499"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums) + 1\n for i in range(0,n):\n if i not in nums:\n return i","runtime":"1519"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n total = sum(nums)\n for i in range(0,n):\n if i not in nums:\n return i\n return n","runtime":"1519"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n\n length = len(nums)\n\n for i in range(0,length+1):\n if i not in nums:\n return i\n \n ","runtime":"1540"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for i in range(0,len(nums)+1):\n if i not in nums :\n return i","runtime":"1540"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for x in range(len(nums) + 1):\n if x not in nums:\n return x","runtime":"1560"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for i in range(len(nums)+1):\n if i not in nums:\n return i\n\n ","runtime":"1560"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n \n for i in range(len(nums)+1):\n if i not in nums:\n return i\n ","runtime":"1580"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n i = 0\n while i < len(nums)+1:\n if i not in nums:\n return i\n i+=1\n return 0","runtime":"1580"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for i in range(len(nums) + 1):\n if i not in nums:\n return i","runtime":"1601"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n leng = len(nums) + 1\n for i in range(leng):\n if i not in nums:\n return i\n\n ","runtime":"1601"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n max_val = max(nums)\n min_val = min(nums)\n for i in range(len(nums)+1):\n if i not in nums:\n return i ","runtime":"1621"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for i in range(len(nums)+1):\n if i not in nums:\n return i","runtime":"1621"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for i in range(len(nums)):\n if i not in nums:\n return i\n return len(nums)","runtime":"1641"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n i = 0\n while(i in (nums)):\n i = i + 1\n \n return i\n\n ","runtime":"1641"}],"string":"[\n {\n \"code\": \"def missingNumber(nums: List[int]) -> int:\\n return ((n:=len(nums)) * (n+1) // 2) - sum(nums)\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f\\\"{missingNumber(case)}\\\\n\\\")\\nexit(0)\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"def missingNumber(nums: List[int]) -> int:\\n return ((n:=len(nums)) * (n+1) // 2) - sum(nums)\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f\\\"{missingNumber(case)}\\\\n\\\")\\nexit(0)\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"def missingNumber(nums: List[int]) -> int:\\n return ((n:=len(nums)) * (n+1) // 2) - sum(nums)\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f\\\"{missingNumber(case)}\\\\n\\\")\\nexit(0)\\n\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"def missingNumber(nums: List[int]) -> int:\\n return ((n:=len(nums)) * (n+1) // 2) - sum(nums)\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f\\\"{missingNumber(case)}\\\\n\\\")\\nexit(0)\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n=len(nums)\\n total=(n*(n+1))//2\\n lsum= sum(nums)\\n return total-lsum\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n sum_ = n*(n+1)/2\\n return int(sum_ - sum(nums))\\n \",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n=len(nums)\\n sumNum=sum(nums)\\n total_sum=n*(n+1)//2\\n return total_sum-sumNum \",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n # Cria uma lista de 0 até n\\n new_list = list(range(0, len(nums) + 1))\\n \\n # Encontra a diferença entre new_list e nums\\n diference = set(new_list) - set(nums)\\n \\n # Se houver diferença, retorna o único número faltante\\n if diference:\\n return diference.pop()\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n=len(nums)\\n sum_1=n*(n+1)//2\\n sum_2=sum(nums)\\n missingnumber=sum_1-sum_2\\n return missingnumber\\n \",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n total = 0\\n curr = 0\\n for i in range (n + 1):\\n total += i\\n for i in range (n):\\n curr += nums[i]\\n \\n return total - curr\\n\\n\\n\\n \",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n n = len(nums)\\n \\n for i in range(n):\\n if nums[i] != i:\\n return i\\n \\n return n\",\n \"runtime\": \"134\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums = sorted(nums)\\n if nums[0] != 0:\\n return 0\\n for i in range(len(nums)-1):\\n if (nums[i] + 2) == nums[i+1]:\\n return nums[i] + 1\\n \\n return len(nums)\\n\\n \",\n \"runtime\": \"134\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n first = nums[0]\\n if first != 0:\\n return 0\\n if len(nums) == 1:\\n if first == 1:\\n return 0\\n else:\\n return 1\\n for num in range(1, len(nums)):\\n if nums[num] - 1 != first:\\n return first + 1\\n else:\\n print(num)\\n print(first)\\n first = nums[num]\\n return len(nums)\\n \",\n \"runtime\": \"155\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums_s = sorted(nums)\\n i = 0\\n print(nums_s)\\n for num in nums_s:\\n print(f'i={i}, num={num}')\\n if num != i:\\n return i\\n i += 1\\n \\n # Edge case, last value is missing\\n return len(nums)\",\n \"runtime\": \"155\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n a=[]\\n for i in range(len(nums)+1):\\n a.append(i)\\n print(a)\\n nums.sort()\\n for i in nums:\\n a.remove(i)\\n return a[0]\\n \",\n \"runtime\": \"196\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def partition(self, arr: List[int], l: int, r: int) -> int:\\n pivot = arr[r]\\n i = l - 1\\n for j in range(l, r):\\n if arr[j] <= pivot:\\n i += 1\\n arr[i], arr[j] = arr[j], arr[i]\\n arr[i + 1], arr[r] = arr[r], arr[i + 1]\\n return i + 1\\n\\n def quick_sort(self, arr: List[int], l: int, r: int):\\n if l < r:\\n pi = self.partition(arr, l, r)\\n self.quick_sort(arr, l, pi - 1)\\n self.quick_sort(arr, pi + 1, r)\\n\\n def missingNumber(self, nums: List[int]) -> int:\\n self.quick_sort(nums, 0, len(nums) - 1)\\n for i in range(len(nums)):\\n if nums[i] != i:\\n return i\\n return len(nums)\\n\",\n \"runtime\": \"196\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n l = len(nums)\\n for i in range(l):\\n print(i, ' - ', nums[i], ' = ', i - nums[i])\\n l += i - nums[i]\\n print(l)\\n return l\",\n \"runtime\": \"216\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n res = len(nums)\\n print(f\\\"Initial res = {res} (length of nums)\\\")\\n\\n for i in range(len(nums)):\\n print(f\\\"\\\\nIteration {i}:\\\")\\n print(f\\\" Current index i = {i}\\\")\\n print(f\\\" Current value nums[{i}] = {nums[i]}\\\")\\n res += i - nums[i]\\n print(f\\\" Updated res = {res} (after adding i and subtracting nums[{i}])\\\")\\n \\n print(f\\\"\\\\nFinal result: missing number = {res}\\\")\\n return res\\n\",\n \"runtime\": \"216\"\n },\n {\n \"code\": \"class Solution:\\n def mergeSort(self, array):\\n if len(array) > 1:\\n \\n # r is the point where the array is divided into two subarrays\\n r = len(array) // 2\\n L = array[:r]\\n M = array[r:]\\n \\n # Sort the two halves\\n self.mergeSort(L)\\n self.mergeSort(M)\\n \\n i = j = k = 0\\n \\n # Until we reach either end of either L or M, pick larger among\\n # elements L and M and place them in the correct position at array[k]\\n while i < len(L) and j < len(M):\\n if L[i] < M[j]:\\n array[k] = L[i]\\n i += 1\\n else:\\n array[k] = M[j]\\n j += 1\\n k += 1\\n \\n # When we run out of elements in either L or M,\\n # pick up the remaining elements and put in array[k]\\n while i < len(L):\\n array[k] = L[i]\\n i += 1\\n k += 1\\n \\n while j < len(M):\\n array[k] = M[j]\\n j += 1\\n k += 1\\n \\n def missingNumber(self, nums: list[int]) -> int:\\n length = len(nums)\\n self.mergeSort(nums)\\n \\n counter = 0\\n while counter < length:\\n cur_val = nums[counter]\\n if cur_val == counter:\\n counter += 1\\n continue \\n else:\\n return counter\\n \\n return length\",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n def mn(nums1):\\n if(len(nums1)>1):\\n middle=len(nums1)//2\\n leftmid=nums1[:middle]\\n rightmid=nums1[middle:]\\n left=mn(leftmid)\\n right=mn(rightmid)\\n i=j=k=0\\n while i<len(left) and j<len(right):\\n if left[i]<right[j]:\\n nums1[k]=left[i]\\n k+=1\\n i+=1\\n else:\\n nums1[k]=right[j]\\n j+=1\\n k+=1\\n \\n while i<len(left):\\n nums1[k]=left[i]\\n i+=1\\n k+=1\\n while j<len(right):\\n nums1[k]=right[j]\\n j+=1\\n k+=1\\n return(nums1)\\n n=mn(nums)\\n print(n)\\n for i in range(0,len(n)-1):\\n if n[i+1]-n[i] ==2:\\n return i+1\\n if n[0]!=0:\\n return 0\\n else:\\n return len(n)\\n\\n\\n\\n \",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n a,b = 0,0\\n for i in range(len(nums)+1):\\n a^=i\\n for j in nums:\\n b^=j\\n return a^b\\n\\n\\n\",\n \"runtime\": \"257\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n if 0 not in nums: return 0\\n total = math.factorial(len(nums))\\n newtotal = 1\\n for num in nums:\\n if num != 0:\\n newtotal *= num\\n \\n return total // newtotal\",\n \"runtime\": \"257\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n \\n if 0 not in nums:\\n return 0\\n \\n if 1 not in nums:\\n return 1\\n\\n total = 1\\n\\n for num in nums:\\n if num != 0:\\n total *= num\\n\\n left = int(factorial(max(nums)) / total)\\n\\n if left == 1:\\n return max(nums) + 1\\n\\n return left\",\n \"runtime\": \"277\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n prod = 1\\n zero = False\\n for i in nums:\\n if i:\\n prod *= i\\n else:\\n zero = True\\n\\n return 0 if not zero else int(math.factorial(n) / prod)\",\n \"runtime\": \"277\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n # solved by me:\\n # n = len(nums)\\n \\n # while n>=0:\\n # if n not in nums:\\n # return n\\n # else:\\n # n = n-1\\n\\n\\n # Another way to solve it with mem o(1) and time o(n):\\n res = len(nums)\\n\\n for i in range(len(nums)):\\n #print(\\\"Res\\\", res)\\n #print(i, nums[i])\\n res+= i - nums[i]\\n #print(res)\\n return res \\n\\n\",\n \"runtime\": \"297\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n # def missingNumber(self, nums: List[int]) -> int:\\n # def missingNumber(self, num):\\n def missingNumber(self, nums):\\n # def return_n(nums):\\n len_nums = len(nums)\\n nums = sorted(nums)\\n\\n if nums[0] != 0:\\n return 0\\n\\n for idx in range(len_nums - 1):\\n if nums[idx] + 1 != nums[idx + 1]:\\n return nums[idx] + 1\\n\\n return len_nums\\n \",\n \"runtime\": \"297\"\n },\n {\n \"code\": \"import numpy as np\\n\\n\\nclass Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n sum1 = (n*(n+1))//2\\n sum2 = sum(nums)\\n return sum1-sum2\",\n \"runtime\": \"318\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n # def missingNumber(self, nums: List[int]) -> int:\\n # def missingNumber(self, num):\\n def missingNumber(self, nums):\\n # def solve(nums: list) -> int:\\n x = set(nums)\\n for i in range(0, len(nums) + 1):\\n if i in x:\\n continue\\n return i\\n \",\n \"runtime\": \"318\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n # solved by me:\\n # n = len(nums)\\n \\n # while n>=0:\\n # if n not in nums:\\n # return n\\n # else:\\n # n = n-1\\n\\n\\n # Another way to solve it with mem o(1) and time o(n):\\n res = len(nums)\\n\\n for i in range(len(nums)):\\n print(\\\"Res\\\", res)\\n print(i, nums[i])\\n res+= i - nums[i]\\n print(res)\\n return res \\n\\n\",\n \"runtime\": \"338\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n left = ((n+1)*n)//2\\n return left - np.sum(nums)\\n \",\n \"runtime\": \"338\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n factorial = 1\\n for i in range(1, len(nums) + 1):\\n factorial *= i\\n\\n product = 1\\n is_null = False\\n for num in nums:\\n if num == 0:\\n is_null = True\\n else:\\n product *= num\\n \\n if not is_null:\\n return 0\\n else:\\n return factorial // product\",\n \"runtime\": \"358\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n product = 1\\n is_seen_zero = False\\n\\n factorial = 1\\n\\n for i in range(len(nums)):\\n if nums[i] == 0:\\n is_seen_zero = True\\n else:\\n product *= nums[i]\\n\\n factorial *= (i + 1)\\n\\n\\n if not is_seen_zero:\\n return 0\\n else:\\n return factorial // product\",\n \"runtime\": \"379\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n nums.sort()\\n\\n for i in range(n + 1):\\n low = 0\\n high = len(nums) - 1\\n while low <= high:\\n mid = (low + high) // 2\\n guess = nums[mid]\\n print(f\\\"{i} and {nums[mid]}\\\")\\n if i == guess:\\n break\\n elif i < guess:\\n high = mid - 1\\n else:\\n low = mid + 1\\n if low > high:\\n return i\\n \\n \\n\\n\",\n \"runtime\": \"399\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n # [0,1,2,3]\\n # n = 4\\n # If all number where there the max -> 4! = 24\\n # Actual amount -> 1*2*3 = 6\\n # Missing number -> 24 / 6 = 4\\n n = len(nums)\\n maxV = 1\\n actual = 1\\n foundZero = False\\n for i in range(len(nums)):\\n if nums[i] == 0:\\n foundZero = True\\n # To keep track of max amout\\n if i != 0:\\n maxV = maxV * i\\n # Keep track of actual\\n if nums[i] != 0:\\n actual = actual * nums[i]\\n if foundZero == False:\\n return 0\\n return (maxV * len(nums)) // actual\\n \",\n \"runtime\": \"399\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n\\n maximum = len(nums)\\n answer = 0\\n \\n while maximum > 0:\\n if maximum in nums:\\n maximum -= 1\\n else:\\n answer = maximum\\n break\\n \\n return answer\\n \",\n \"runtime\": \"420\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n max_num = len(nums)\\n\\n while max_num >= 0:\\n if max_num not in nums:\\n return max_num\\n max_num -=1\",\n \"runtime\": \"440\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n x_max = len(nums)\\n while x_max in nums:\\n x_max = x_max-1\\n \\n return x_max\\n \\n \\n \\n \",\n \"runtime\": \"460\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n while n in nums:\\n n = n-1\\n return n\",\n \"runtime\": \"481\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n\\n length = len(nums) + 1\\n\\n while length >= 0:\\n if length - 1 not in nums: \\n return length - 1\\n length -= 1\\n \\n \",\n \"runtime\": \"501\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n\\n length = len(nums) + 1\\n\\n while length >= 0:\\n if length - 1 not in nums: \\n return length - 1\\n length -= 1\\n \\n \",\n \"runtime\": \"521\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n\\n length = len(nums)\\n\\n while length >= 0:\\n if length not in nums: \\n return length\\n length -= 1\\n \\n \",\n \"runtime\": \"542\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n while(n >= 0):\\n if n not in nums:\\n return n\\n n -= 1\\n \\n\\n \\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"562\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n=len(nums)\\n for i in range(n,-1,-1):\\n if i not in nums:\\n return int(i)\\n\\n \",\n \"runtime\": \"582\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums_count=len(nums)\\n while nums_count:\\n if nums_count not in nums:\\n return nums_count\\n nums_count -= 1\\n return 0\\n \",\n \"runtime\": \"603\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n m=len(nums)\\n for i in range(m+1):\\n diff=m-i\\n\\n if diff not in nums:\\n return diff\\n return -1\\n\\n \",\n \"runtime\": \"623\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: list[int]) -> int:\\n n = len(nums)\\n \\n for i in range(n + 1):\\n diff = n - i\\n \\n if diff not in nums:\\n return diff\\n return -1\",\n \"runtime\": \"644\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n while(n >= 0):\\n if n not in nums:\\n return n\\n n -= 1\\n \\n\",\n \"runtime\": \"664\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: list[int]) -> int:\\n n = len(nums)\\n \\n for i in range(n + 1):\\n diff = n - i\\n \\n if diff not in nums:\\n return diff\\n return -1\\n \\n \",\n \"runtime\": \"684\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n max_num = len(nums)\\n\\n while max_num >= 0:\\n if max_num not in nums:\\n return max_num\\n max_num -=1\\n \",\n \"runtime\": \"705\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n\\n length = len(nums) + 1\\n\\n while length >= 0:\\n if length - 1 not in nums: \\n return length - 1\\n length -= 1\\n \\n \",\n \"runtime\": \"725\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: list[int]) -> int:\\n n = len(nums)\\n \\n for i in range(n + 1):\\n diff = n - i\\n \\n if diff not in nums:\\n return diff\\n return -1\",\n \"runtime\": \"745\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n if len(nums) == 1:\\n return abs(len(nums) - nums[0])\\n\\n if 0 not in nums:\\n return 0\\n for i in range(len(nums)):\\n if abs(len(nums) - i) not in nums:\\n print(len(nums) - i)\\n return abs(len(nums) - i)\\n return -1\",\n \"runtime\": \"766\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n max = nums[0]\\n for i in range(len(nums)):\\n if(nums[i]>max):\\n max = nums[i]\\n temp = max\\n while True:\\n if(temp<0):\\n break\\n if temp not in nums:\\n return temp\\n temp -= 1\\n return (max+1)\",\n \"runtime\": \"786\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n \\n for i in range(n + 1):\\n diff = n - i\\n \\n if diff not in nums:\\n return diff\\n return -1\",\n \"runtime\": \"806\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n x = max(nums)\\n while(x>0):\\n if x-1 not in nums:\\n return x-1\\n x-=1\\n return max(nums)+1\",\n \"runtime\": \"827\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for i in range(len(nums),-1,-1):\\n if i not in nums:\\n return i\",\n \"runtime\": \"847\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n length = len(nums)\\n while length > -1:\\n if length not in nums:\\n return length\\n else:\\n length = length - 1\\n\\n\\n\\n '''\\n max = nums[0]\\n for x in nums:\\n if x > max:\\n max = x\\n '''\",\n \"runtime\": \"868\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)# n = 9\\n\\n for i in range(n + 1): # [0,1,2,3,4,5,6,7,8,9]\\n diff = n - i # diff = 9-1 = 8\\n\\n if diff not in nums:# if 8 not in nums[9,6,4,2,3,5,7,0,1]\\n return diff # return 8\\n return - 1\",\n \"runtime\": \"888\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n=len(nums)\\n for i in range(n+1):\\n diff = n-i\\n if diff not in nums:\\n return diff\\n \\n return -1\\n\",\n \"runtime\": \"888\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n length = len(nums)\\n while length in nums:\\n length -= 1\\n return length\",\n \"runtime\": \"908\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for i in range(len(nums),0,-1):\\n if i not in nums:\\n return i\\n return 0\",\n \"runtime\": \"908\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n i=len(nums)\\n for i in range(len(nums),-1,-1):\\n print(i)\\n if i not in nums:\\n break\\n return i\\n \",\n \"runtime\": \"929\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n if len(nums) == 1:\\n return abs(len(nums) - nums[0])\\n\\n if 0 not in nums:\\n return 0\\n for i in range(len(nums)):\\n if abs(len(nums) - i) not in nums:\\n print(len(nums) - i)\\n return abs(len(nums) - i)\\n return -1\",\n \"runtime\": \"929\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n a = max(nums)\\n b = min(nums)\\n for i in range(1,len(nums)):\\n if b+i not in nums:\\n return b+i\\n elif a-i not in nums:\\n return a-i\\n if b == 1 :\\n return 0\\n elif len(nums) == 1:\\n if nums[0] == 0:\\n return nums[0] + 1\\n return nums[0] - 1\\n return a+1\\n \",\n \"runtime\": \"949\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n while n>=0:\\n if n not in nums:\\n return n\\n n-=1\",\n \"runtime\": \"949\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n\\n l = 0\\n r = len(nums)\\n \\n while l <= r:\\n if l not in nums:\\n return l\\n if r not in nums:\\n return r\\n l += 1\\n r -= 1\\n\",\n \"runtime\": \"969\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: list[int]) -> int:\\n n = len(nums)\\n \\n for i in range(n + 1):\\n diff = n - i\\n \\n if diff not in nums:\\n return diff\\n return -1\",\n \"runtime\": \"969\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n i = 0\\n j = len(nums)\\n while i != j:\\n if i in nums:\\n i += 1\\n else: \\n return i\\n if j in nums:\\n j -= 1\\n else: \\n return j\\n return i\",\n \"runtime\": \"990\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n\\n # we know that every number in nums is unique\\n product = 1\\n for i in range(1, len(nums)+1):\\n product *= i\\n\\n found0 = False\\n for number in nums:\\n if number != 0:\\n product //= number\\n else:\\n found0 = True\\n\\n if not found0:\\n return 0\\n else:\\n return product\\n\\n\\n \\n\\n \\n\\n \",\n \"runtime\": \"990\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n sort = len(nums)\\n while sort != 0:\\n if sort not in nums:\\n return sort\\n sort-=1\\n return 0\",\n \"runtime\": \"1010\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n if 0 not in nums:\\n return 0\\n mx=max(nums)\\n def factorial(num):\\n if num==0:\\n return 1\\n else:\\n return num*factorial(num-1)\\n current=int(factorial(mx))\\n for i in nums:\\n if i !=0:\\n current//=i\\n if current==1:\\n if 1 not in nums:\\n return 1\\n else:\\n return mx+1\\n else:\\n return int(current)\",\n \"runtime\": \"1010\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for num in nums:\\n if num - 1 in nums:\\n pass\\n elif num!=0:\\n return num - 1\\n for num in nums:\\n if num + 1 in nums:\\n pass\\n else:\\n return num + 1\\n\",\n \"runtime\": \"1030\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n length = len(nums)\\n while length in nums:\\n length -= 1\\n return length\",\n \"runtime\": \"1030\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n i = 0\\n j = len(nums)\\n while i <= j:\\n if i not in nums:\\n return i\\n if j not in nums:\\n return j\\n i += 1\\n j -= 1\\n\\n #for i in range(0, len(nums)+1):\\n # if i not in nums:\\n # return i\",\n \"runtime\": \"1051\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n \\n for num in nums:\\n ans = len(nums) - num\\n if not(ans in nums):\\n return ans\\n return 1\",\n \"runtime\": \"1071\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for i in nums:\\n if i != 0:\\n if i-1 not in nums:\\n return i-1\\n return len(nums)\\n \",\n \"runtime\": \"1092\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n i=len(nums)\\n while(i>=0):\\n if i in nums:\\n i=i-1\\n continue\\n \\n else:\\n return i \",\n \"runtime\": \"1112\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for i in range(len(nums)):\\n if nums[i] > 0 and nums[i] - 1 not in nums:\\n return nums[i] - 1\\n return max(nums) + 1\\n\\n \",\n \"runtime\": \"1132\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort() \\n for i in range(0, len(nums) + 1):\\n if i not in nums:\\n return i\\n return 0\\n \\n\",\n \"runtime\": \"1153\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n n = len(nums)\\n for i in range(n+1):\\n if i not in nums:\\n return i\\n\",\n \"runtime\": \"1173\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n i=len(nums)\\n while i>=0:\\n if i not in nums:\\n return i\\n else:\\n i-=1\",\n \"runtime\": \"1193\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n m = 0\\n for i in range(len(nums)):\\n if m not in nums:\\n return m\\n m += 1\\n return m\\n \",\n \"runtime\": \"1214\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n # max_int = max(nums)\\n if(max(nums) == len(nums)-1):\\n return max(nums)+1\\n else:\\n # sum_int = 0\\n for i in range(len(nums)+1):\\n try:\\n nums.remove(i)\\n except:\\n return i\\n # sum_int += i\\n # if(i != len(nums)):\\n # sum_int -= nums[i]\\n # return sum_int\\n\\n \",\n \"runtime\": \"1234\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n h={}\\n for i in range(len(nums)+1):\\n if i not in h:\\n if i not in nums:\\n return i\\n h[nums[i]]=1\\n \\n \\n \\n \",\n \"runtime\": \"1254\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n for i in range(0,len(nums)+1):\\n if i not in nums:\\n return i\\n \",\n \"runtime\": \"1275\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n temp_set=set(nums)\\n result=list(temp_set)\\n dist_num=len(result)\\n print(dist_num)\\n for i in range(dist_num+1):\\n if i not in result:\\n return i\\n \",\n \"runtime\": \"1295\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n for i in range((len(nums)+1)):\\n if i not in nums:\\n return i\\n\\n return 0\",\n \"runtime\": \"1295\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n for i in range(len(nums)+1):\\n if i not in nums:\\n return i\",\n \"runtime\": \"1316\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n n = len(nums)\\n for i in range(n+1):\\n if i not in nums:\\n return i\",\n \"runtime\": \"1316\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n\\n nums.sort()\\n #if n == 1:\\n #return 0\\n\\n for i in range(0,len(nums)):\\n if i not in nums:\\n return i\\n return nums[-1] + 1\",\n \"runtime\": \"1336\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums=sorted(nums)\\n for i in range(0,len(nums)):\\n if nums[0]==1:\\n return 0\\n elif nums[i]+1 in nums and nums[0]==0:\\n continue\\n else:\\n return nums[i]+1\\n\",\n \"runtime\": \"1336\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n for i in range(len(nums)+1):\\n if i not in nums:\\n return i\",\n \"runtime\": \"1356\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n for i in range(len(nums)+1):\\n if i not in nums:\\n return i\\n else:\\n continue\\n \\n\",\n \"runtime\": \"1356\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n lenNums=len(nums)\\n nums.sort()\\n numArr=[i for i in range(0,lenNums+1)]\\n for num in numArr:\\n if num not in nums:\\n return num\\n \\n\\n\\n \",\n \"runtime\": \"1377\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n for i in range(0,len(nums)+1):\\n if i not in nums:\\n return i \\n \",\n \"runtime\": \"1377\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n c=[]\\n nums.sort()\\n l=len(nums)\\n for i in range(l+1):\\n c.append(i)\\n for i in c:\\n if i not in nums:\\n return i\\n \",\n \"runtime\": \"1397\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, l: List[int]) -> int:\\n l.sort()\\n for i in range(len(l)+1):\\n if i not in l:\\n return i\",\n \"runtime\": \"1397\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n for i in range(len(nums)+1):\\n if i not in nums:\\n return i\\n\",\n \"runtime\": \"1417\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n for i in range(len(nums)+1):\\n if i not in nums:\\n return i\",\n \"runtime\": \"1417\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for x in range(len(nums)+1):\\n if x not in nums:\\n return x\",\n \"runtime\": \"1438\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n maxNum = len(nums)\\n for i in range(0, maxNum + 1):\\n if i not in nums:\\n return i\\n\\n \",\n \"runtime\": \"1438\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for i in range(len(nums)+1):\\n if i not in nums:\\n return i\",\n \"runtime\": \"1458\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for i in range(len(nums)+1):\\n if i not in nums:\\n return i\\n\\n \",\n \"runtime\": \"1458\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n return next(i for i in range(len(nums)+1) if i not in nums)\\n \\n \",\n \"runtime\": \"1478\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n for i in range(n + 1):\\n if i not in nums:\\n return i\",\n \"runtime\": \"1478\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n=len(nums)\\n for i in range(n+1):\\n if (i not in nums):\\n return i\",\n \"runtime\": \"1499\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n m=max(nums)\\n for i in range(m+2):\\n if i not in nums:\\n return i\\n\\n \",\n \"runtime\": \"1499\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums) + 1\\n for i in range(0,n):\\n if i not in nums:\\n return i\",\n \"runtime\": \"1519\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n total = sum(nums)\\n for i in range(0,n):\\n if i not in nums:\\n return i\\n return n\",\n \"runtime\": \"1519\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n\\n length = len(nums)\\n\\n for i in range(0,length+1):\\n if i not in nums:\\n return i\\n \\n \",\n \"runtime\": \"1540\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for i in range(0,len(nums)+1):\\n if i not in nums :\\n return i\",\n \"runtime\": \"1540\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for x in range(len(nums) + 1):\\n if x not in nums:\\n return x\",\n \"runtime\": \"1560\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for i in range(len(nums)+1):\\n if i not in nums:\\n return i\\n\\n \",\n \"runtime\": \"1560\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n \\n for i in range(len(nums)+1):\\n if i not in nums:\\n return i\\n \",\n \"runtime\": \"1580\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n i = 0\\n while i < len(nums)+1:\\n if i not in nums:\\n return i\\n i+=1\\n return 0\",\n \"runtime\": \"1580\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for i in range(len(nums) + 1):\\n if i not in nums:\\n return i\",\n \"runtime\": \"1601\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n leng = len(nums) + 1\\n for i in range(leng):\\n if i not in nums:\\n return i\\n\\n \",\n \"runtime\": \"1601\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n max_val = max(nums)\\n min_val = min(nums)\\n for i in range(len(nums)+1):\\n if i not in nums:\\n return i \",\n \"runtime\": \"1621\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for i in range(len(nums)+1):\\n if i not in nums:\\n return i\",\n \"runtime\": \"1621\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for i in range(len(nums)):\\n if i not in nums:\\n return i\\n return len(nums)\",\n \"runtime\": \"1641\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n i = 0\\n while(i in (nums)):\\n i = i + 1\\n \\n return i\\n\\n \",\n \"runtime\": \"1641\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":121,"string":"121"},"mm_list":{"kind":"list like","value":[{"code":"# class Solution:\n# def missingNumber(self, nums: List[int]) -> int:\n\n# n = len(nums)\n# nums.append(-1)\n# missing = n\n\n# i = 0\n# if n > 0:\n# next = i + 1\n \n# while i <= n:\n# curr = nums[i]\n# while curr != i and curr != -1:\n# nums[curr], nums[i] = nums[i], nums[curr]\n# curr = nums[i]\n# if nums[i] == i:\n# i = next\n# next = i + 1\n# elif nums[i] == -1:\n# missing = i\n# i = next\n# next = i + 1\n \n# return missing\n\n\nclass Solution:\n def missingNumber(self, nums: list[int]) -> int:\n n = len(nums)\n missing = [-1] * (n + 1)\n i = n - 1\n while i >= 0:\n missing[nums[i]] = 0\n nums.pop()\n i -= 1\n return missing.index(-1)","memory":"16900"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n res = 0\n for i in range(n + 1):\n res = res ^ i\n for i in nums:\n res = res ^ i\n\n return res","memory":"17100"},{"code":"def missingNumber(nums: List[int]) -> int:\n return ((n:=len(nums)) * (n+1) // 2) - sum(nums)\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f\"{missingNumber(case)}\\n\")\nexit(0)","memory":"17200"},{"code":"def missingNumber(nums: List[int]) -> int:\n return ((n:=len(nums)) * (n+1) // 2) - sum(nums)\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f\"{missingNumber(case)}\\n\")\nexit(0)","memory":"17200"},{"code":"# # class Solution:\n# # def missingNumber(self, nums: List[int]) -> int:\n# # nums.sort()\n# # if len(nums) <= 1:\n# # if nums[0] > 0:\n# # return 0\n# # else:\n# # return 1\n# # else:\n# # for i in range(0, len(nums)):\n# # if nums[i]+1 not in nums and nums[i] + 1 < max(nums):\n# # return nums[i]+1\n# # elif 0 not in nums:\n# # return 0\n# # elif nums[i] + 1 > max(nums):\n# # return nums[i]+1\n\n# class Solution:\n# def missingNumber(self, nums: List[int]) -> int:\n# n=len(nums)\n# sumNum=sum(nums)\n# total_sum=n*(n+1)//2\n# return total_sum-sumNum \n\ndef missingNumber(nums: List[int]) -> int:\n return ((n:=len(nums)) * (n+1) // 2) - sum(nums)\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f\"{missingNumber(case)}\\n\")\nexit(0)","memory":"17300"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n=len(nums)\n sums=(n*(n+1))//2\n s2=0\n for i in range(len(nums)):\n s2+=nums[i]\n return sums-s2\n \n\n ","memory":"17400"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n return int(len(nums) * (len(nums) + 1) / 2 - sum(nums))","memory":"17500"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n for i in range(len(nums)):\n if i != nums[i]:\n return i\n return len(nums)","memory":"17500"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n=len(nums)\n return ((n*(n+1))//2)-sum(nums)","memory":"17600"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n for i in range(len(nums)+1):\n if not i in nums:\n return i\n return []","memory":"17600"},{"code":"'''\nGiven an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.\n\nso length of arr is n+1\n number of numbers = len of array\n'''\nclass Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums.sort()\n missingNum = 0\n num = 0\n for i in range(len(nums)):\n if nums[i] != num:\n break\n else:\n num += 1\n return num\n\n \n","memory":"17700"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n\n l = len(nums)\n sum1 = 0\n sum2 = 0\n\n for i in range(l+1):\n sum1 += i\n \n for j in nums:\n sum2 += j\n \n return (sum1 - sum2)","memory":"17700"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n n = len(nums)\n total = n * (n+1) // 2\n actual = sum(nums)\n return total - actual\n \n","memory":"17800"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n res = {}\n for i in range(len(nums) + 1):\n res[i] = False\n \n for num in nums:\n res[num] = True\n \n for key, value in res.items():\n if not value:\n return key\n return len(res) + 1\n","memory":"18000"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n \n numbers = {}\n \n \n for i in range(len(nums)):\n numbers[nums[i]] = i\n \n \n for i in range(len(nums)):\n if i not in numbers:\n return i\n \n return len(nums)\n ","memory":"18000"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n counts = Counter(nums)\n for i in range(len(nums)+1):\n if i not in counts:\n return i\n return 0","memory":"18100"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums[:] = sorted(nums)\n for i in range(len(nums)):\n print(i)\n if not (nums[i] == i):\n return i\n return i+1","memory":"18100"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums = set(nums)\n if 0 not in nums:\n return 0\n for i in nums:\n if i-1 not in nums and i!=min(nums):\n return i-1\n return i+1","memory":"18200"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n total = (len(nums)*(len(nums) + 1)) // 2\n diff = sum(nums)\n return total-diff\n\nclass Solution:\n def missingNumber(self, nums: List[int]) -> int:\n number_set = {n for n in range(len(nums)+1)}\n\n print(number_set)\n for i in range(len(nums)):\n print(nums[i])\n if nums[i] not in number_set:\n return nums[i]\n\n def missingNumber(self, nums: List[int]) -> int:\n number_set = set(nums)\n\n for i in range(len(nums)+1):\n if i not in number_set:\n return i\n\n# def missingNumber(self, nums: List[int]) -> int:\n# full_number_set = {n for n in range(len(nums)+1)}\n# partial_number_set = set(nums)\n# return list(full_number_set-partial_number_set)[0]\n\n# class Solution:\n# def missingNumber(self, nums: List[int]) -> int:\n# nums.extend([n for n in range(len(nums)+1)])\n# res = 0\n# for num in nums:\n# res = res ^ num\n# return res\n\n# class Solution:\n# def missingNumber(self, nums: List[int]) -> int:\n# res = len(nums)\n\n# for i in range(len(nums)):\n# res += i - nums[i]\n# return res\n\n# class Solution:\n# def missingNumber(self, nums: List[int]) -> int:\n# return sum([n for n in range(len(nums)+1)]) - sum(nums)","memory":"18200"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n a = set(range(len(nums)+1))\n print(a)\n\n for i in nums:\n if i in a:\n a.remove(i)\n\n for item in a:\n return item","memory":"18300"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n nums = set(nums)\n for i in range(len(nums)+1):\n if i not in nums:\n return i\n ","memory":"18400"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n found_nums = set()\n max_num = 0\n for num in nums:\n found_nums.add(num)\n max_num = max(max_num, num)\n for i in range(max_num+1):\n if i not in found_nums:\n return i\n return max_num+1","memory":"18400"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n\n pool = set([i for i in range(len(nums) + 1)])\n\n for num in nums:\n pool.remove(num)\n\n return list(pool)[0]\n","memory":"18500"},{"code":"class Solution:\n def missingNumber(self, nums: List[int]) -> int:\n numSet = set(nums)\n n = len(nums) + 1\n for i in range(n):\n if i not in numSet:\n return i","memory":"18500"}],"string":"[\n {\n \"code\": \"# class Solution:\\n# def missingNumber(self, nums: List[int]) -> int:\\n\\n# n = len(nums)\\n# nums.append(-1)\\n# missing = n\\n\\n# i = 0\\n# if n > 0:\\n# next = i + 1\\n \\n# while i <= n:\\n# curr = nums[i]\\n# while curr != i and curr != -1:\\n# nums[curr], nums[i] = nums[i], nums[curr]\\n# curr = nums[i]\\n# if nums[i] == i:\\n# i = next\\n# next = i + 1\\n# elif nums[i] == -1:\\n# missing = i\\n# i = next\\n# next = i + 1\\n \\n# return missing\\n\\n\\nclass Solution:\\n def missingNumber(self, nums: list[int]) -> int:\\n n = len(nums)\\n missing = [-1] * (n + 1)\\n i = n - 1\\n while i >= 0:\\n missing[nums[i]] = 0\\n nums.pop()\\n i -= 1\\n return missing.index(-1)\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n res = 0\\n for i in range(n + 1):\\n res = res ^ i\\n for i in nums:\\n res = res ^ i\\n\\n return res\",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"def missingNumber(nums: List[int]) -> int:\\n return ((n:=len(nums)) * (n+1) // 2) - sum(nums)\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f\\\"{missingNumber(case)}\\\\n\\\")\\nexit(0)\",\n \"memory\": \"17200\"\n },\n {\n \"code\": \"def missingNumber(nums: List[int]) -> int:\\n return ((n:=len(nums)) * (n+1) // 2) - sum(nums)\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f\\\"{missingNumber(case)}\\\\n\\\")\\nexit(0)\",\n \"memory\": \"17200\"\n },\n {\n \"code\": \"# # class Solution:\\n# # def missingNumber(self, nums: List[int]) -> int:\\n# # nums.sort()\\n# # if len(nums) <= 1:\\n# # if nums[0] > 0:\\n# # return 0\\n# # else:\\n# # return 1\\n# # else:\\n# # for i in range(0, len(nums)):\\n# # if nums[i]+1 not in nums and nums[i] + 1 < max(nums):\\n# # return nums[i]+1\\n# # elif 0 not in nums:\\n# # return 0\\n# # elif nums[i] + 1 > max(nums):\\n# # return nums[i]+1\\n\\n# class Solution:\\n# def missingNumber(self, nums: List[int]) -> int:\\n# n=len(nums)\\n# sumNum=sum(nums)\\n# total_sum=n*(n+1)//2\\n# return total_sum-sumNum \\n\\ndef missingNumber(nums: List[int]) -> int:\\n return ((n:=len(nums)) * (n+1) // 2) - sum(nums)\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f\\\"{missingNumber(case)}\\\\n\\\")\\nexit(0)\",\n \"memory\": \"17300\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n=len(nums)\\n sums=(n*(n+1))//2\\n s2=0\\n for i in range(len(nums)):\\n s2+=nums[i]\\n return sums-s2\\n \\n\\n \",\n \"memory\": \"17400\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n return int(len(nums) * (len(nums) + 1) / 2 - sum(nums))\",\n \"memory\": \"17500\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n for i in range(len(nums)):\\n if i != nums[i]:\\n return i\\n return len(nums)\",\n \"memory\": \"17500\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n=len(nums)\\n return ((n*(n+1))//2)-sum(nums)\",\n \"memory\": \"17600\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n for i in range(len(nums)+1):\\n if not i in nums:\\n return i\\n return []\",\n \"memory\": \"17600\"\n },\n {\n \"code\": \"'''\\nGiven an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.\\n\\nso length of arr is n+1\\n number of numbers = len of array\\n'''\\nclass Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums.sort()\\n missingNum = 0\\n num = 0\\n for i in range(len(nums)):\\n if nums[i] != num:\\n break\\n else:\\n num += 1\\n return num\\n\\n \\n\",\n \"memory\": \"17700\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n\\n l = len(nums)\\n sum1 = 0\\n sum2 = 0\\n\\n for i in range(l+1):\\n sum1 += i\\n \\n for j in nums:\\n sum2 += j\\n \\n return (sum1 - sum2)\",\n \"memory\": \"17700\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n n = len(nums)\\n total = n * (n+1) // 2\\n actual = sum(nums)\\n return total - actual\\n \\n\",\n \"memory\": \"17800\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n res = {}\\n for i in range(len(nums) + 1):\\n res[i] = False\\n \\n for num in nums:\\n res[num] = True\\n \\n for key, value in res.items():\\n if not value:\\n return key\\n return len(res) + 1\\n\",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n \\n numbers = {}\\n \\n \\n for i in range(len(nums)):\\n numbers[nums[i]] = i\\n \\n \\n for i in range(len(nums)):\\n if i not in numbers:\\n return i\\n \\n return len(nums)\\n \",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n counts = Counter(nums)\\n for i in range(len(nums)+1):\\n if i not in counts:\\n return i\\n return 0\",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums[:] = sorted(nums)\\n for i in range(len(nums)):\\n print(i)\\n if not (nums[i] == i):\\n return i\\n return i+1\",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums = set(nums)\\n if 0 not in nums:\\n return 0\\n for i in nums:\\n if i-1 not in nums and i!=min(nums):\\n return i-1\\n return i+1\",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n total = (len(nums)*(len(nums) + 1)) // 2\\n diff = sum(nums)\\n return total-diff\\n\\nclass Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n number_set = {n for n in range(len(nums)+1)}\\n\\n print(number_set)\\n for i in range(len(nums)):\\n print(nums[i])\\n if nums[i] not in number_set:\\n return nums[i]\\n\\n def missingNumber(self, nums: List[int]) -> int:\\n number_set = set(nums)\\n\\n for i in range(len(nums)+1):\\n if i not in number_set:\\n return i\\n\\n# def missingNumber(self, nums: List[int]) -> int:\\n# full_number_set = {n for n in range(len(nums)+1)}\\n# partial_number_set = set(nums)\\n# return list(full_number_set-partial_number_set)[0]\\n\\n# class Solution:\\n# def missingNumber(self, nums: List[int]) -> int:\\n# nums.extend([n for n in range(len(nums)+1)])\\n# res = 0\\n# for num in nums:\\n# res = res ^ num\\n# return res\\n\\n# class Solution:\\n# def missingNumber(self, nums: List[int]) -> int:\\n# res = len(nums)\\n\\n# for i in range(len(nums)):\\n# res += i - nums[i]\\n# return res\\n\\n# class Solution:\\n# def missingNumber(self, nums: List[int]) -> int:\\n# return sum([n for n in range(len(nums)+1)]) - sum(nums)\",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n a = set(range(len(nums)+1))\\n print(a)\\n\\n for i in nums:\\n if i in a:\\n a.remove(i)\\n\\n for item in a:\\n return item\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n nums = set(nums)\\n for i in range(len(nums)+1):\\n if i not in nums:\\n return i\\n \",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n found_nums = set()\\n max_num = 0\\n for num in nums:\\n found_nums.add(num)\\n max_num = max(max_num, num)\\n for i in range(max_num+1):\\n if i not in found_nums:\\n return i\\n return max_num+1\",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n\\n pool = set([i for i in range(len(nums) + 1)])\\n\\n for num in nums:\\n pool.remove(num)\\n\\n return list(pool)[0]\\n\",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"class Solution:\\n def missingNumber(self, nums: List[int]) -> int:\\n numSet = set(nums)\\n n = len(nums) + 1\\n for i in range(n):\\n if i not in numSet:\\n return i\",\n \"memory\": \"18500\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":24,"string":"24"}}},{"rowIdx":165,"cells":{"question_id":{"kind":"number","value":273,"string":"273"},"name":{"kind":"string","value":"integer-to-english-words"},"content":{"kind":"string","value":"<p>Convert a non-negative integer <code>num</code> to its English words representation.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> num = 123\n<strong>Output:</strong> "One Hundred Twenty Three"\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> num = 12345\n<strong>Output:</strong> "Twelve Thousand Three Hundred Forty Five"\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> num = 1234567\n<strong>Output:</strong> "One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven"\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>0 <= num <= 2<sup>31</sup> - 1</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":34.01562330243457,"string":"34.015623"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["math","string","recursion"],"string":"[\n \"math\",\n \"string\",\n \"recursion\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"12\", 0.0073], [\"14\", 0.0073], [\"15\", 0.0293], [\"16\", 0.0183], [\"17\", 0.0147], [\"18\", 0.0367], [\"19\", 0.0953], [\"20\", 0.1173], [\"21\", 0.088], [\"22\", 0.2456], [\"23\", 0.5314], [\"24\", 0.6927], [\"25\", 0.4142], [\"26\", 0.9713], [\"27\", 1.8656], [\"28\", 2.3017], [\"29\", 1.9938], [\"30\", 2.518], [\"31\", 4.5778], [\"32\", 4.9223], [\"33\", 4.739], [\"34\", 4.7464], [\"35\", 7.4659], [\"36\", 7.8801], [\"37\", 6.7256], [\"38\", 6.1428], [\"39\", 7.6785], [\"40\", 7.0811], [\"41\", 5.9375], [\"42\", 4.8013], [\"43\", 4.2296], [\"44\", 3.6102]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"15900\", 0.0037], [\"16000\", 0.0037], [\"16100\", 0.0073], [\"16200\", 0.0037], [\"16300\", 0.1063], [\"16400\", 1.8362], [\"16500\", 14.459], [\"16600\", 30.8496], [\"16700\", 36.2117]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n\n ones_map = {\n 1: \"One\", \n 2: \"Two\", \n 3: \"Three\", \n 4: \"Four\", \n 5: \"Five\", \n 6: \"Six\", \n 7: \"Seven\", \n 8: \"Eight\", \n 9: \"Nine\",\n 10: \"Ten\", \n 11: \"Eleven\", \n 12: \"Twelve\", \n 13: \"Thirteen\", \n 14: \"Fourteen\", \n 15: \"Fifteen\", \n 16: \"Sixteen\", \n 17: \"Seventeen\", \n 18: \"Eighteen\", \n 19: \"Nineteen\"\n }\n \n tens_map = {\n 20: \"Twenty\",\n 30: \"Thirty\",\n 40: \"Forty\",\n 50: \"Fifty\",\n 60: \"Sixty\",\n 70: \"Seventy\",\n 80: \"Eighty\",\n 90: \"Ninety\"\n }\n\n def stringify(n):\n res = []\n hundreds = n // 100\n if hundreds:\n res.append(ones_map[hundreds] + \" Hundred\")\n last_two = n % 100 \n if last_two >= 20:\n tens, ones = last_two // 10, last_two % 10\n res.append(tens_map[tens * 10])\n if ones:\n res.append(ones_map[ones])\n elif last_two:\n res.append(ones_map[last_two])\n return \" \".join(res)\n \n large_num_postfix = [\"\", \" Thousand\", \" Million\", \" Billion\"]\n curr = 0\n res = []\n\n while num:\n digits = num % 1000\n s = stringify(digits)\n if s:\n res.append(s + large_num_postfix[curr])\n num //= 1000\n curr += 1\n\n res.reverse()\n return \" \".join(res)","runtime":"12"},{"code":"class Solution:\n # Dictionary to store words for numbers\n number_to_words_map = {\n 1000000000: \"Billion\", 1000000: \"Million\", 1000: \"Thousand\",\n 100: \"Hundred\", 90: \"Ninety\", 80: \"Eighty\", 70: \"Seventy\",\n 60: \"Sixty\", 50: \"Fifty\", 40: \"Forty\", 30: \"Thirty\",\n 20: \"Twenty\", 19: \"Nineteen\", 18: \"Eighteen\", 17: \"Seventeen\",\n 16: \"Sixteen\", 15: \"Fifteen\", 14: \"Fourteen\", 13: \"Thirteen\",\n 12: \"Twelve\", 11: \"Eleven\", 10: \"Ten\", 9: \"Nine\", 8: \"Eight\",\n 7: \"Seven\", 6: \"Six\", 5: \"Five\", 4: \"Four\", 3: \"Three\",\n 2: \"Two\", 1: \"One\"\n }\n\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n\n for value, word in self.number_to_words_map.items():\n # Check if the number is greater than or equal to the current unit\n if num >= value:\n # Convert the quotient to words if the current unit is 100 or greater\n prefix = (self.numberToWords(num // value) + \" \") if num >= 100 else \"\"\n\n # Get the word for the current unit\n unit = word\n\n # Convert the remainder to words if it's not zero\n suffix = \"\" if num % value == 0 else \" \" + self.numberToWords(num % value)\n\n return prefix + unit + suffix\n\n return \"\"","runtime":"14"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n\n belowTwenty = [\"\", \"One\", \"Two\", \"Three\",\n \"Four\", \"Five\", \"Six\", \"Seven\",\n \"Eight\", \"Nine\", \"Ten\", \"Eleven\",\n \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\",\n \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n tens = [\"\", \"Ten\", \"Twenty\", \"Thirty\", \"Forty\",\n \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n\n def helper(num: int) -> str:\n if num < 20:\n s = belowTwenty[num]\n elif num < 100:\n s = tens[num // 10] + \" \" + belowTwenty[num % 10]\n elif num < 1000:\n s = helper(num // 100) + \" Hundred \" + helper(num % 100)\n elif num < 1000000:\n s = helper(num // 1000) + \" Thousand \" + helper(num % 1000)\n elif num < 1000000000:\n s = helper(num // 1000000) + \" Million \" + \\\n helper(num % 1000000)\n else:\n s = helper(num // 1000000000) + \" Billion \" + \\\n helper(num % 1000000000)\n\n return s.strip()\n\n return helper(num)","runtime":"14"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n \n bigString = [\"Thousand\", \"Million\", \"Billion\"]\n result = self.numberToWordsHelper(num % 1000)\n num //= 1000\n \n for i in range(len(bigString)):\n if num > 0 and num % 1000 > 0:\n result = self.numberToWordsHelper(num % 1000) + bigString[i] + \" \" + result\n num //= 1000\n \n return result.strip()\n\n def numberToWordsHelper(self, num: int) -> str:\n digitString = [\"Zero\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\"]\n teenString = [\"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n tenString = [\"\", \"\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n \n result = \"\"\n if num > 99:\n result += digitString[num // 100] + \" Hundred \"\n \n num %= 100\n if num < 20 and num > 9:\n result += teenString[num - 10] + \" \"\n else:\n if num >= 20:\n result += tenString[num // 10] + \" \"\n num %= 10\n if num > 0:\n result += digitString[num] + \" \"\n \n return result","runtime":"15"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n d = {0: \"Zero\",\n 1: \"One\",\n 2: \"Two\",\n 3: \"Three\",\n 4: \"Four\",\n 5: \"Five\",\n 6: \"Six\",\n 7: \"Seven\",\n 8: \"Eight\",\n 9: \"Nine\",\n 10: \"Ten\",\n 11: \"Eleven\",\n 12: \"Twelve\",\n 13: \"Thirteen\",\n 14: \"Fourteen\",\n 15: \"Fifteen\",\n 16: \"Sixteen\",\n 17: \"Seventeen\",\n 18: \"Eighteen\",\n 19: \"Nineteen\",\n 20: \"Twenty\",\n 30: \"Thirty\",\n 40: \"Forty\",\n 50: \"Fifty\",\n 60: \"Sixty\",\n 70: \"Seventy\",\n 80: \"Eighty\",\n 90: \"Ninety\",\n 100: \"Hundred\",\n 1000: \"Thousand\",\n 1000000: \"Million\",\n 1000000000: \"Billion\"}\n\n if num == 0:\n return d[0]\n\n res = []\n\n # parse 3 digit numbers:\n def parse(num, exp):\n if exp == 3:\n return\n # check if theres anything from 11 to 19:\n if exp == 0 and 11 <= num % 100 <= 19:\n res.append(d[num % 100])\n parse(num // 100, exp + 2)\n else:\n digit = num % 10\n\n if digit != 0:\n if exp == 2: \n res.append(d[100])\n res.append(d[digit])\n else:\n res.append(d[digit * (10 ** exp)])\n\n parse(num // 10, exp + 1)\n\n def recurse(num, exp):\n if num == 0:\n return \n\n three_digit = num % 1000\n if three_digit != 0:\n if exp != 0:\n res.append(d[10 ** exp])\n parse(three_digit, 0)\n recurse(num // 1000, exp + 3)\n\n recurse(num, 0)\n res = res[::-1]\n\n return \" \".join(res)\n\n\n\n\n\n\n\n\n\n ","runtime":"15"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n\n if num==0:\n return \"Zero\"\n ones=[\"\",\"One\",'Two', 'Three' ,'Four' ,'Five', 'Six' ,'Seven' ,'Eight', 'Nine']\n teens=[\"\",'Eleven', 'Twelve', 'Thirteen' ,'Fourteen' ,'Fifteen', 'Sixteen' ,'Seventeen', 'Eighteen' ,'Nineteen']\n tens=[\"\",'Ten', 'Twenty', 'Thirty' ,'Forty' ,'Fifty', 'Sixty', 'Seventy', 'Eighty' ,'Ninety' ]\n\n\n def hun(t):\n ans=\"\"\n ans+=ones[t//100]+' Hundred '\n t=t%100\n if t%10==0:\n ans+=tens[t//10]\n t=t%10\n elif t<10:\n ans+=ones[t]\n t=0\n elif t>10 and t<20:\n ans+=teens[t%10]\n t=0\n else:\n ans+=tens[t//10]+\" \"+ones[t%10]\n return ans\n\n def thous(t):\n ans=\"\"\n ans+=ones[t//100]\n t=t%100\n if t%10==0:\n ans+=tens[t//10]\n t=0\n elif t<10:\n ans+=ones[t]\n t=0\n elif t>10 and t<20:\n ans+=teens[t%10]\n t=0\n elif t<100:\n ans+=tens[t//10]+\" \"+ones[t%10]\n else:\n ans=hun(t%1000)\n return ans+' Thousand '\n\n\n\n ans=\"\"\n \n while num>0:\n if num>=1000000000:\n t=num//1000000000\n if t%10==0:\n ans+=tens[t//10]\n elif t<10:\n ans+=ones[t]\n elif t>10 and t<20:\n ans+=teens[t%10]\n elif t<100:\n ans+=tens[t//10]+\" \"+ones[t%10]\n elif t>=1000:\n ans+=thous(t)\n elif t>100:\n ans+=hun(t)\n ans+=' Billion '\n num=num%1000000000\n\n\n if num>=1000000:\n t=num//1000000\n if t%10==0 and t<100:\n ans+=tens[t//10]\n elif t<10:\n ans+=ones[t]\n elif t>10 and t<20:\n ans+=teens[t%10]\n elif t<100:\n ans+=tens[t//10]+\" \"+ones[t%10]\n elif t>=1000:\n ans+=thous(t)\n elif t>=100:\n ans+=hun(t)\n ans+=' Million '\n num=num%1000000\n if num>=1000:\n if num//1000>=100 and num//1000<1000:\n ans+=hun(num//1000)+\" Thousand \"\n else:\n ans+=thous(num//1000)\n num=num%1000\n if num>0:\n t=num\n if t>=100:\n ans+=hun(t)\n else:\n if t%10==0:\n ans+=tens[t//10]\n elif t<10:\n ans+=ones[t]\n elif t>10 and t<20:\n ans+=teens[t%10]\n else:\n ans+=tens[t//10]+\" \"+ones[t%10]\n num=0\n return \" \".join(ans.split())\n\n \n\n","runtime":"16"},{"code":"class Solution:\n \n def numberToWords(self, num: int) -> str:\n belowTen = {0: \"\",\n 1: \"One\",\n 2: \"Two\",\n 3: \"Three\",\n 4: \"Four\",\n 5: \"Five\",\n 6: \"Six\",\n 7: \"Seven\",\n 8: \"Eight\",\n 9: \"Nine\"\n }\n\n belowTwenty = {\n 10: \"Ten\",\n 11: \"Eleven\",\n 12: \"Twelve\",\n 13: \"Thirteen\",\n 14: \"Fourteen\",\n 15: \"Fifteen\",\n 16: \"Sixteen\",\n 17: \"Seventeen\",\n 18: \"Eighteen\",\n 19: \"Nineteen\"\n }\n \n belowHundred = {\n 2: \"Twenty\",\n 3: \"Thirty\",\n 4: \"Forty\",\n 5: \"Fifty\",\n 6: \"Sixty\",\n 7: \"Seventy\",\n 8: \"Eighty\",\n 9: \"Ninety\"\n }\n \n def solve(num):\n if num < 10:\n return belowTen[num]\n if num < 20:\n return belowTwenty[num]\n if num < 100:\n return (\n belowHundred[num//10] + \n (\" \" + belowTen[num%10] if (num%10 != 0) else \"\")\n )\n if num < 1000:\n return (\n solve(num//100) + \" Hundred\" +\n (\" \" + solve(num%100) if (num%100 != 0) else \"\")\n )\n if num < 1000000:\n return (\n solve(num//1000) + \" Thousand\" +\n (\" \" + solve(num%1000) if (num%1000 != 0) else \"\")\n )\n if num < 1000000000:\n return (\n solve(num//1000000) + \" Million\" +\n (\" \" + solve(num%1000000) if (num%1000000 != 0) else \"\")\n )\n return (\n solve(num//1000000000) + \" Billion\" +\n (\" \" + solve(num%1000000000) if (num%1000000000 != 0) else \"\")\n )\n \n if num == 0:\n return \"Zero\"\n return solve(num)\n","runtime":"16"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if not num:\n return \"Zero\"\n \n ones_map = {\n 1: \"One\",\n 2: \"Two\", \n 3: \"Three\", \n 4: \"Four\",\n 5: \"Five\", \n 6: \"Six\",\n 7: \"Seven\",\n 8: \"Eight\",\n 9: \"Nine\",\n 10: \"Ten\",\n 11: \"Eleven\",\n 12: \"Twelve\", \n 13: \"Thirteen\", \n 14: \"Fourteen\",\n 15: \"Fifteen\", \n 16: \"Sixteen\",\n 17: \"Seventeen\",\n 18: \"Eighteen\",\n 19: \"Nineteen\",\n }\n\n tens_map = {\n 20: \"Twenty\",\n 30: \"Thirty\",\n 40: \"Forty\", \n 50: \"Fifty\",\n 60: \"Sixty\",\n 70: \"Seventy\",\n 80: \"Eighty\",\n 90: \"Ninety\"\n }\n \n def get_string(n):\n res = []\n hundreds = n // 100\n if hundreds:\n res.append(ones_map[hundreds] + \" Hundred\")\n last_2 = n % 100\n if last_2 >= 20:\n tens, ones = last_2 // 10, last_2 % 10\n res.append(tens_map[tens * 10])\n if ones:\n res.append(ones_map[ones])\n elif last_2:\n res.append(ones_map[last_2])\n return \" \".join(res)\n\n prefix = [\"\", \" Thousand\", \" Million\", \" Billion\"]\n i = 0\n res = []\n while num:\n digits = num % 1000\n s = get_string(digits)\n if s:\n res.append(s + prefix[i])\n i += 1\n num = num // 1000\n res.reverse()\n return \" \".join(res)","runtime":"17"},{"code":"class Solution:\n number_to_words_map = {\n 1000000000: \"Billion\", 1000000: \"Million\", 1000: \"Thousand\",\n 100: \"Hundred\", 90: \"Ninety\", 80: \"Eighty\", 70: \"Seventy\",\n 60: \"Sixty\", 50: \"Fifty\", 40: \"Forty\", 30: \"Thirty\",\n 20: \"Twenty\", 19: \"Nineteen\", 18: \"Eighteen\", 17: \"Seventeen\",\n 16: \"Sixteen\", 15: \"Fifteen\", 14: \"Fourteen\", 13: \"Thirteen\",\n 12: \"Twelve\", 11: \"Eleven\", 10: \"Ten\", 9: \"Nine\", 8: \"Eight\",\n 7: \"Seven\", 6: \"Six\", 5: \"Five\", 4: \"Four\", 3: \"Three\",\n 2: \"Two\", 1: \"One\"\n }\n\n def numberToWords(self, num: int) -> str:\n\n if num == 0:\n return \"Zero\"\n \n for val, word in self.number_to_words_map.items():\n if num >= val:\n prefix = (self.numberToWords(num//val) + \" \") if num >= 100 else \"\"\n unit = word\n suffix = \"\" if num % val == 0 else \" \" + self.numberToWords(num % val)\n\n return prefix + unit + suffix\n \n return \"\"","runtime":"18"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num==0:\n return \"Zero\"\n bigString=[\"Thousand\", \"Million\", \"Billion\"]\n result=self.numberToWordsHelper(num % 1000)\n num//=1000\n for i in range(len(bigString)):\n if num>0 and num%1000 > 0:\n result=self.numberToWordsHelper(num % 1000)+bigString[i]+\" \"+result\n num//=1000\n return result.strip()\n def numberToWordsHelper(self, num: int) -> str:\n digitString = [\"Zero\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\"]\n teenString = [\"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n tenString = [\"\", \"\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n result = \"\"\n if num>99:\n result+=digitString[num//100]+\" \"+\"Hundred\"+\" \"\n num%=100\n if num<20 and num>9:\n result+=teenString[num-10]+\" \"\n else:\n if num>=20:\n result+=tenString[num//10]+ \" \"\n num%=10\n if num>0:\n result+=digitString[num]+\" \"\n return result","runtime":"19"},{"code":"class Solution:\n bten = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\"]\n btwenty = [\"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n bhundred = [\"\", \"Ten\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"] \n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n else:\n return self.ConvertToWords(num)\n def ConvertToWords(self,num:int) ->str:\n if num<10:\n return self.bten[num]\n if num<20:\n return self.btwenty[num-10]\n if num<100:\n return self.bhundred[num//10]+(\" \"+ self.ConvertToWords(num%10) if num%10!=0 else \"\")\n if num<1000:\n return self.ConvertToWords(num//100)+\" Hundred\"+(\" \"+self.ConvertToWords(num%100) if num%100!=0 else \"\")\n if num<1000000:\n return self.ConvertToWords(num//1000)+\" Thousand\"+(\" \"+self.ConvertToWords(num%1000) if num%1000!=0 else \"\")\n if num<10**9:\n return self.ConvertToWords(num//10**6)+\" Million\"+(\" \"+self.ConvertToWords(num%10**6) if num%10**6!=0 else \"\")\n return self.ConvertToWords(num//10**9)+\" Billion\"+(\" \"+self.ConvertToWords(num%10**9) if num%10**9!=0 else \"\")","runtime":"20"},{"code":"class Solution:\n number_to_words_map = {\n 1000000000: \"Billion\", 1000000: \"Million\", 1000: \"Thousand\",\n 100: \"Hundred\", 90: \"Ninety\", 80: \"Eighty\", 70: \"Seventy\",\n 60: \"Sixty\", 50: \"Fifty\", 40: \"Forty\", 30: \"Thirty\",\n 20: \"Twenty\", 19: \"Nineteen\", 18: \"Eighteen\", 17: \"Seventeen\",\n 16: \"Sixteen\", 15: \"Fifteen\", 14: \"Fourteen\", 13: \"Thirteen\",\n 12: \"Twelve\", 11: \"Eleven\", 10: \"Ten\", 9: \"Nine\", 8: \"Eight\",\n 7: \"Seven\", 6: \"Six\", 5: \"Five\", 4: \"Four\", 3: \"Three\",\n 2: \"Two\", 1: \"One\"\n }\n\n def numberToWords(self, num: int) -> str:\n if num == 0: \n return \"Zero\"\n \n for value, unit in self.number_to_words_map.items():\n if num >= value: \n prefix = (self.numberToWords(num // value) + \" \") if num >= 100 else \"\"\n suffix = \"\" if num % value == 0 else \" \" + self.numberToWords(num % value) \n return prefix + unit + suffix\n return \"\"\n ","runtime":"21"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n\n ret = []\n numToEnglish = {\n 1: \"One\",\n 2: \"Two\",\n 3: \"Three\",\n 4: \"Four\",\n 5: \"Five\",\n 6: \"Six\",\n 7: \"Seven\",\n 8: \"Eight\",\n 9: \"Nine\",\n 10: \"Ten\",\n 11: \"Eleven\",\n 12: \"Twelve\",\n 13: \"Thirteen\",\n 14: \"Fourteen\",\n 15: \"Fifteen\",\n 16: \"Sixteen\",\n 17: \"Seventeen\",\n 18: \"Eighteen\",\n 19: \"Nineteen\",\n 20: \"Twenty\",\n 30: \"Thirty\",\n 40: \"Forty\",\n 50: \"Fifty\",\n 60: \"Sixty\",\n 70: \"Seventy\",\n 80: \"Eighty\",\n 90: \"Ninety\",\n 100: \"Hundred\",\n 1000: \"Thousand\",\n 1000000: \"Million\",\n 1000000000: \"Billion\"\n }\n\n divisors = [1000000000, 1000000, 1000, 100]\n for divisor in divisors:\n multiples = num // divisor\n if multiples > 0:\n ret.extend(self.numberToWords(multiples).split(\" \"))\n ret.append(numToEnglish[divisor])\n num -= (multiples * divisor)\n \n # focus on tens\n ten_multiples = num // 10\n if ten_multiples > 1:\n ret.append(numToEnglish[ten_multiples * 10])\n num -= (ten_multiples * 10)\n \n # focus on ones\n if num > 0:\n ret.append(numToEnglish[num])\n \n return \" \".join(ret)","runtime":"22"},{"code":"class Solution:\n first20=['Zero','One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine', 'Ten', 'Eleven', 'Twelve', 'Thirteen', 'Fourteen', 'Fifteen', 'Sixteen', 'Seventeen', 'Eighteen', 'Nineteen']\n tens=[\"Zero\",\"Ten\",\"Twenty\",\"Thirty\",\"Forty\",\"Fifty\",\"Sixty\",\"Seventy\",\"Eighty\",\"Ninety\"]\n def numberToWords(self, num: int) -> str:\n if num==0:return 'Zero'\n x=[]\n if num<1000:\n if num//100!=0:\n x.append(self.first20[(num//100)%10]+\" Hundred\")\n num%=100\n if num>19:\n x.append(self.tens[(num//10)%10])\n num%=10\n if num==0:\n pass\n else:\n x.append(self.first20[num])\n elif num<10**6:\n x=[self.numberToWords((num//(10**3))%10**3)+\" Thousand\", self.numberToWords(num%(10**3))]\n elif num<10**9:\n x=[self.numberToWords((num//(10**6))%10**6)+\" Million\", self.numberToWords((num%(10**6)))]\n elif num<10**12:\n x=[self.numberToWords((num//(10**9))%10**9)+\" Billion\", self.numberToWords((num%(10**9)))]\n return \" \".join(filter(lambda x:x!='Zero', x))\n","runtime":"23"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n \n # Define arrays for words representing numbers\n below_twenty = ['Zero', 'One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine', 'Ten', 'Eleven', 'Twelve', 'Thirteen', 'Fourteen', 'Fifteen', 'Sixteen', 'Seventeen', 'Eighteen', 'Nineteen']\n tens = ['', '', 'Twenty', 'Thirty', 'Forty', 'Fifty', 'Sixty', 'Seventy', 'Eighty', 'Ninety']\n thousands = ['', 'Thousand', 'Million', 'Billion']\n \n def calculate(num):\n if num == 0:\n return ''\n elif num < 20:\n return below_twenty[num] + ' '\n elif num < 100:\n return tens[num // 10] + ' ' + calculate(num % 10)\n else:\n return below_twenty[num // 100] + ' Hundred ' + calculate(num % 100)\n \n if num == 0:\n return 'Zero'\n \n result = ''\n i = 0\n \n while num > 0:\n if num % 1000 != 0:\n result = calculate(num % 1000) + thousands[i] + ' ' + result\n num //= 1000\n i += 1\n \n return result.strip()","runtime":"24"},{"code":"class Solution:\n # Arrays to store words for numbers less than 10, 20, and 100\n below_ten = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\"]\n below_twenty = [\"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n below_hundred = [\"\", \"Ten\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n\n # Main function to convert a number to English words\n def numberToWords(self, num: int) -> str:\n # Handle the special case where the number is zero\n if num == 0:\n return \"Zero\"\n # Call the helper function to start the conversion\n return self._convert_to_words(num)\n\n # Recursive function to convert numbers to words\n # Handles numbers based on their ranges: <10, <20, <100, <1000, <1000000, <1000000000, and >=1000000000\n def _convert_to_words(self, num: int) -> str:\n if num < 10:\n return self.below_ten[num]\n if num < 20:\n return self.below_twenty[num - 10]\n if num < 100:\n return self.below_hundred[num // 10] + (\" \" + self._convert_to_words(num % 10) if num % 10 != 0 else \"\")\n if num < 1000:\n return self._convert_to_words(num // 100) + \" Hundred\" + (\" \" + self._convert_to_words(num % 100) if num % 100 != 0 else \"\")\n if num < 1000000:\n return self._convert_to_words(num // 1000) + \" Thousand\" + (\" \" + self._convert_to_words(num % 1000) if num % 1000 != 0 else \"\")\n if num < 1000000000:\n return self._convert_to_words(num // 1000000) + \" Million\" + (\" \" + self._convert_to_words(num % 1000000) if num % 1000000 != 0 else \"\")\n return self._convert_to_words(num // 1000000000) + \" Billion\" + (\" \" + self._convert_to_words(num % 1000000000) if num % 1000000000 != 0 else \"\")","runtime":"25"},{"code":"class Solution:\n # Python3: Dictionaries are ordered by insertion\n wordMap = {\n 1000000000: \"Billion\", 1000000: \"Million\", 1000: \"Thousand\",\n 100: \"Hundred\", 90: \"Ninety\", 80: \"Eighty\", 70: \"Seventy\",\n 60: \"Sixty\", 50: \"Fifty\", 40: \"Forty\", 30: \"Thirty\",\n 20: \"Twenty\", 19: \"Nineteen\", 18: \"Eighteen\", 17: \"Seventeen\",\n 16: \"Sixteen\", 15: \"Fifteen\", 14: \"Fourteen\", 13: \"Thirteen\",\n 12: \"Twelve\", 11: \"Eleven\", 10: \"Ten\", 9: \"Nine\", 8: \"Eight\",\n 7: \"Seven\", 6: \"Six\", 5: \"Five\", 4: \"Four\", 3: \"Three\",\n 2: \"Two\", 1: \"One\"\n }\n\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n\n for denomination in self.wordMap.keys():\n if num >= denomination:\n # Get prefix\n prefix = \"\"\n if num >= 100:\n prefix = self.numberToWords(num // denomination) + \" \"\n\n # Get current unit\n unit = self.wordMap[denomination]\n\n # Get suffix, aka from the remainder\n suffix = \"\"\n if num % denomination > 0:\n suffix = \" \" + self.numberToWords(num % denomination)\n\n return prefix + unit + suffix\n\n return \"\"\n\n # lessThan20Map = { 0: \"\", 1: \"One\", 2: \"Two\", 3: \"Three\", 4: \"Four\", 5: \"Five\",\n # 6: \"Six\", 7: \"Seven\", 8: \"Eight\", 9: \"Nine\", 10: \"Ten\",\n # 11: \"Eleven\" , 12: \"Twelve\", 13: \"Thirteen\", 14: \"Fourteen\",\n # 15: \"Fifteen\", 16: \"Sixteen\", 17: \"Seventeen\", 18: \"Eighteen\",\n # 19: \"Nineteen\"}\n # tensMap = { 0: \"\", 1: \"Ten\", 2: \"Twenty\", 3: \"Thirty\", 4: \"Forty\", 5: \"Fifty\",\n # 6: \"Sixty\", 7: \"Seventy\", 8: \"Eighty\", 9: \"Ninety\"}\n # thousandsMap = { 0: \"\", 1: \"Thousand\", 2: \"Million\", 3: \"Billion\" }\n\n # def getWords(n):\n # if n == 0:\n # return \"\"\n # elif n < 20:\n # return [lessThan20Map[n]]\n # elif n < 100:\n # return [tensMap[n // 10]] + getWords(n % 10)\n # else:\n # return [lessThan20Map[n // 100], \"Hundred\"] + getWords(n % 100)\n\n # i = 0\n # res = []\n # while num > 0:\n # if num % 1000 != 0:\n # res = getWords(num % 1000) + [thousandsMap[i]] + res\n # num = num // 1000\n # i += 1\n\n # return \" \".join(res).strip()","runtime":"26"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n '''\n things I will notice:\n output is a string\n input is a number\n\n two digits are our pattern: they can be broken into \n 1 - 19\n 20-30-40-50...90\n\n keep track of prefixes\n\n i want to process numbers in 3's and I want to skip anything with 0's basically\n '''\n if num == 0: return \"Zero\"\n\n teens = {1:'One', 2:'Two', 3:'Three', 4:'Four', 5:'Five',6:'Six', 7:'Seven', 8:'Eight', 9:'Nine', 10:'Ten', 11:'Eleven', 12:'Twelve', 13:'Thirteen', 14:'Fourteen', 15:'Fifteen', 16:'Sixteen', 17:'Seventeen', 18:'Eighteen', 19:'Nineteen'}\n\n tens = {20:'Twenty', 30:'Thirty', 40:'Forty', 50:'Fifty', 60:'Sixty', 70:'Seventy', 80:'Eighty', 90:'Ninety'}\n\n postfix = ['', ' Thousand', ' Million', ' Billion']\n\n def processNum(n):\n tmp = []\n if n != 0 and n <= 99:\n if n in teens: return [teens[n]]\n if n in tens: return [tens[n]]\n \n d = n % 10\n n = n - d\n\n tmp.append(tens[n] + ' ' + teens[d])\n return tmp\n\n elif n != 0 and n > 99:\n twos = n % 100\n twos = processNum(twos)\n n = n // 100\n if twos != ['']:\n tmp = [teens[n] + ' Hundred'] + twos\n else:\n tmp = [teens[n] + ' Hundred']\n \n return tmp\n return ['']\n\n res = []\n i = 0\n while num:\n digits = num % 1000\n num = num // 1000\n\n digits = processNum(digits)\n\n \n if digits != ['']:\n res = [' '.join(digits) + postfix[i]] + res\n i += 1\n \n return ' ' .join(res)\n","runtime":"27"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n\n ones_map = {\n 1: \"One\",\n 2: \"Two\",\n 3: \"Three\",\n 4: \"Four\",\n 5: \"Five\",\n 6: \"Six\",\n 7: \"Seven\",\n 8: \"Eight\",\n 9: \"Nine\",\n 10: \"Ten\",\n 11: \"Eleven\",\n 12: \"Twelve\",\n 13: \"Thirteen\",\n 14: \"Fourteen\",\n 15: \"Fifteen\",\n 16: \"Sixteen\",\n 17: \"Seventeen\",\n 18: \"Eighteen\",\n 19: \"Nineteen\",\n }\n tens_map = {\n 20: \"Twenty\",\n 30: \"Thirty\",\n 40: \"Forty\",\n 50: \"Fifty\",\n 60: \"Sixty\",\n 70: \"Seventy\",\n 80: \"Eighty\",\n 90: \"Ninety\",\n }\n\n def get_words(digits):\n words = []\n # hundred\n hundred_digit = digits // 100\n if hundred_digit:\n words += [ones_map[hundred_digit], \"Hundred\"]\n \n rest_two = digits % 100\n if rest_two >= 20:\n ten_digit = rest_two // 10\n single_digit = rest_two % 10\n if ten_digit:\n words += [tens_map[ten_digit * 10]]\n if single_digit:\n words += [ones_map[single_digit]]\n else:\n if rest_two:\n words += [ones_map[rest_two]]\n \n return words\n\n\n postfix = [\"\", \"Thousand\", \"Million\", \"Billion\"]\n res = []\n i = 0\n while num:\n digits = num % 1000\n words = get_words(digits)\n print(words)\n if postfix[i]:\n if words:\n res = words + [postfix[i]] + res\n else:\n if words:\n res = words + res\n num = num // 1000\n i += 1\n return \" \".join(res)\n\n","runtime":"28"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n \n d = {1: \"One\", 2: \"Two\", 3: \"Three\", 4: \"Four\", 5: \"Five\", 6: \"Six\", 7: \"Seven\", 8: \"Eight\", 9: \"Nine\",\n 10: \"Ten\", 11: \"Eleven\", 12: \"Twelve\", 13: \"Thirteen\", 14: \"Fourteen\", 15: \"Fifteen\", 16: \"Sixteen\",\n 17: \"Seventeen\", 18: \"Eighteen\", 19: \"Nineteen\", 20: \"Twenty\", 30: \"Thirty\", 40: \"Forty\", 50: \"Fifty\",\n 60: \"Sixty\", 70: \"Seventy\", 80: \"Eighty\", 90: \"Ninety\"}\n \n def belowThousand(n):\n if n == 0:\n return \"\"\n elif n < 20:\n return d[n] + \" \"\n elif n < 100:\n return d[n // 10 * 10] + \" \" + belowThousand(n % 10)\n else:\n return d[n // 100] + \" Hundred \" + belowThousand(n % 100)\n \n def helper(n):\n if n >= 1000000000:\n return belowThousand(n // 1000000000) + \"Billion \" + helper(n % 1000000000)\n elif n >= 1000000:\n return belowThousand(n // 1000000) + \"Million \" + helper(n % 1000000)\n elif n >= 1000:\n return belowThousand(n // 1000) + \"Thousand \" + helper(n % 1000)\n else:\n return belowThousand(n)\n \n return helper(num).strip()\n","runtime":"28"},{"code":"class Solution:\n def __init__(self):\n self.number_to_words_map = {\n 1000000000: \"Billion\", 1000000: \"Million\", 1000: \"Thousand\",\n 100: \"Hundred\", 90: \"Ninety\", 80: \"Eighty\", 70: \"Seventy\",\n 60: \"Sixty\", 50: \"Fifty\", 40: \"Forty\", 30: \"Thirty\",\n 20: \"Twenty\", 19: \"Nineteen\", 18: \"Eighteen\", 17: \"Seventeen\",\n 16: \"Sixteen\", 15: \"Fifteen\", 14: \"Fourteen\", 13: \"Thirteen\",\n 12: \"Twelve\", 11: \"Eleven\", 10: \"Ten\", 9: \"Nine\", 8: \"Eight\",\n 7: \"Seven\", 6: \"Six\", 5: \"Five\", 4: \"Four\", 3: \"Three\",\n 2: \"Two\", 1: \"One\"\n }\n\n def numberToWords(self, num: int) -> str:\n if num == 0 :\n return \"Zero\"\n \n for value, word in self.number_to_words_map.items():\n if num>= value:\n prefix = (self.numberToWords(num//value) + \" \") if num>=100 else \"\"\n\n unit = word\n\n suffix = (\" \" + self.numberToWords(num%value)) if num%value > 0 else \"\"\n return prefix + unit + suffix","runtime":"29"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n result = \"\"\n\n if num == 0:\n return \"Zero\"\n\n big_nums = [\"\", \"Thousand\", \"Million\", \"Billion\"]\n\n for big in big_nums:\n if num > 0 and num % 1000 > 0:\n result = self.helper(num % 1000) + big + \" \" + result\n\n num //= 1000\n \n return result.strip()\n\n def helper(self, num: int) -> str:\n digit = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\"]\n teen = [\"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n tens = [\"\", \"\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n result = \"\"\n\n if num > 99:\n result += digit[num // 100] + \" Hundred \"\n num %= 100\n \n if num > 9:\n if num < 20:\n result += teen[num % 10] + \" \"\n num = 0\n else:\n result += tens[num // 10] + \" \"\n num %= 10\n\n if num > 0:\n result += digit[num] + \" \"\n\n return result","runtime":"29"},{"code":"class Solution:\n def ones(self, num: str) -> str:\n assert len(num) == 1\n if int(num) == 0:\n return \"\"\n words = {\n str(i + 1): w\n for i, w in enumerate(\n [\"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\"]\n )\n }\n return words[num]\n\n def teens(self, num: str) -> str:\n assert len(num) == 2\n value = int(num)\n assert 9 < value < 20\n words = {\n str(i + 10): w\n for i, w in enumerate(\n [\n \"Ten\",\n \"Eleven\",\n \"Twelve\",\n \"Thirteen\",\n \"Fourteen\",\n \"Fifteen\",\n \"Sixteen\",\n \"Seventeen\",\n \"Eighteen\",\n \"Nineteen\",\n ]\n )\n }\n return words[num]\n\n def tens(self, num: str) -> str:\n assert len(num) == 2\n value = int(num)\n if value == 0:\n return \"\"\n assert value < 100\n words = {\n str(i + 2): w\n for i, w in enumerate(\n [\n \"Twenty\",\n \"Thirty\",\n \"Forty\",\n \"Fifty\",\n \"Sixty\",\n \"Seventy\",\n \"Eighty\",\n \"Ninety\",\n ]\n )\n }\n if value < 10:\n return self.ones(num[1])\n elif value < 20:\n return self.teens(num)\n elif value < 100:\n return f\"{words[num[0]]} {self.ones(num[1])}\".strip()\n return \"\"\n\n def hundreds(self, num: str) -> str:\n assert len(num) == 3\n value = int(num)\n if value == 0:\n return \"\"\n assert value < 1000\n if value < 100:\n return self.tens(num[1:3])\n elif value < 1000:\n return f\"{self.ones(num[0])} Hundred {self.tens(num[1:3])}\".strip()\n\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return 'Zero'\n digits = str(num)\n in_words = self.hundreds(f\"{digits[-3:]:0>3}\")\n if digits[-6:-3] and int(digits[-6:-3]) > 0:\n in_words = f\"{self.hundreds(f'{digits[-6:-3]:0>3}')} Thousand {in_words}\".strip()\n if digits[-9:-6] and int(digits[-9:-6]) > 0:\n in_words = f\"{self.hundreds(f'{digits[-9:-6]:0>3}')} Million {in_words}\".strip()\n if digits[-12:-9] and int(digits[-12:-9]) > 0:\n in_words = f\"{self.hundreds(f'{digits[-12:-9]:0>3}')} Billion {in_words}\".strip()\n return in_words\n","runtime":"30"},{"code":"singles = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \n \"Six\", \"Seven\", \"Eight\", \"Nine\"]\nteens = [\"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \n \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\ntens = [\"\", \"Ten\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \n \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\nthousands = [\"\", \"Thousand\", \"Million\", \"Billion\"]\n\nclass Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n\n def toEnglish(num: int) -> str:\n s = \"\"\n if num >= 100:\n s += singles[num // 100] + \" Hundred \"\n num %= 100\n if num >= 20:\n s += tens[num // 10] + \" \"\n num %= 10\n if 0 < num < 10:\n s += singles[num] + \" \"\n elif num >= 10:\n s += teens[num - 10] + \" \"\n return s\n\n s = \"\"\n unit = int(1e9)\n for i in range(3, -1, -1):\n curNum = num // unit\n if curNum:\n num -= curNum * unit\n s += toEnglish(curNum) + thousands[i] + \" \"\n unit //= 1000\n return s.strip()\n ","runtime":"31"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n info1={1: 'One', 2: 'Two', 3: 'Three', 4: 'Four', \n 5: 'Five', 6: 'Six', 7: 'Seven', 8: 'Eight', 9: 'Nine'}\n info2={10: 'Ten', 11: 'Eleven', 12: 'Twelve', 13: 'Thirteen',\n 14: 'Fourteen', 15: 'Fifteen', 16: 'Sixteen', 17: 'Seventeen',\n 18: 'Eighteen', 19: 'Nineteen'}\n info3={2: 'Twenty', 3: 'Thirty', 4: 'Forty', 5: 'Fifty',\n 6: 'Sixty', 7: 'Seventy', 8: 'Eighty', 9: 'Ninety'}\n order=['', 'Thousand', 'Million', 'Billion']\n \n def process2(num):\n if num>=100:\n return None\n if num==0:\n return \"\"\n if num<10:\n return info1[num]\n if num<20:\n return info2[num]\n res=[info3[num//10]]\n if num%10:\n res.append(info1[num%10])\n return ' '.join(res)\n \n def process3(num):\n if num>=1000:\n return None\n res=[]\n if num//100>0:\n res.append(info1[num//100])\n res.append('Hundred')\n tp=process2(num%100)\n if tp:\n res.append(tp)\n return ' '.join(res)\n \n if num==0:\n return 'Zero'\n res=[]\n for k in range(4):\n cur=process3(num%1000)\n tp_res=[]\n if cur:\n tp_res.append(cur)\n if order[k]:\n tp_res.append(order[k])\n tp_res=' '.join(tp_res)\n if tp_res:\n res.append(tp_res)\n num=num//1000\n if num==0:\n break\n return ' '.join(res[::-1])","runtime":"31"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n\n number_map = {\n 1: \"One\", 2: \"Two\", 3: \"Three\", 4: \"Four\", 5: \"Five\", 6: \"Six\", \n 7: \"Seven\", 8: \"Eight\", 9: \"Nine\", 10: \"Ten\", 11: \"Eleven\", 12: \"Twelve\", \n 13: \"Thirteen\", 14: \"Fourteen\", 15: \"Fifteen\", 16: \"Sixteen\", 17: \"Seventeen\", \n 18: \"Eighteen\", 19: \"Nineteen\", 20: \"Twenty\", 30: \"Thirty\", 40: \"Forty\", \n 50: \"Fifty\", 60: \"Sixty\", 70: \"Seventy\", 80: \"Eighty\", 90: \"Ninety\"\n }\n\n # Helper function to convert numbers below 1000\n def helper(n):\n if n == 0:\n return \"\"\n elif n < 20:\n return number_map[n] + \" \"\n elif n < 100:\n return number_map[n // 10 * 10] + \" \" + helper(n % 10)\n else:\n return number_map[n // 100] + \" Hundred \" + helper(n % 100)\n\n billion = num // 1_000_000_000\n million = (num // 1_000_000) % 1_000\n thousand = (num // 1_000) % 1_000\n remainder = num % 1_000\n\n result = \"\"\n if billion:\n result += helper(billion) + \"Billion \"\n if million:\n result += helper(million) + \"Million \"\n if thousand:\n result += helper(thousand) + \"Thousand \"\n if remainder:\n result += helper(remainder)\n\n return result.strip()\n\n# Example Usage:\nsolution = Solution()\nprint(solution.numberToWords(1234567891)) # Output: \"One Billion Two Hundred Thirty Four Million Five Hundred Sixty Seven Thousand Eight Hundred Ninety One\"\n","runtime":"32"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n\n ones_map = {\n 1: \"One\",\n 2: \"Two\",\n 3: \"Three\",\n 4: \"Four\",\n 5: \"Five\",\n 6: \"Six\",\n 7: \"Seven\",\n 8: \"Eight\",\n 9: \"Nine\",\n 10: \"Ten\",\n 11: \"Eleven\",\n 12: \"Twelve\",\n 13: \"Thirteen\",\n 14: \"Fourteen\",\n 15: \"Fifteen\",\n 16: \"Sixteen\",\n 17: \"Seventeen\",\n 18: \"Eighteen\",\n 19: \"Nineteen\",\n }\n tens_map = {\n 20: \"Twenty\",\n 30: \"Thirty\",\n 40: \"Forty\",\n 50: \"Fifty\",\n 60: \"Sixty\",\n 70: \"Seventy\",\n 80: \"Eighty\",\n 90: \"Ninety\",\n }\n def get_words(digits):\n words = []\n # 123, 103, 012, 120\n hundred_check = digits // 100\n if hundred_check:\n words += [ones_map[hundred_check], \"Hundred\"]\n last_two = digits % 100\n if last_two >= 20:\n second_digit = last_two // 10\n third_digit = last_two % 10\n if second_digit:\n words += [tens_map[second_digit * 10]]\n if third_digit:\n words += [ones_map[third_digit]]\n else:\n if last_two:\n words += [ones_map[last_two]]\n print(digits)\n print(words)\n return words\n\n # 2,123,456,789\n postfix = [\"\", \"Thousand\", \"Million\", \"Billion\"]\n i = 0\n res = []\n while num:\n digits = num % 1000\n if postfix[i]:\n words = get_words(digits)\n if words:\n words += [postfix[i]]\n else:\n words = get_words(digits)\n res = words + res\n num //= 1000\n i += 1\n \n return \" \".join(res)\n","runtime":"32"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n info1={1: 'One', 2: 'Two', 3: \"Three\", 4: 'Four',\n 5: 'Five', 6: 'Six', 7: 'Seven', 8: 'Eight', \n 9: 'Nine'}\n info2={10: 'Ten', 11: 'Eleven', 12: 'Twelve', 13: 'Thirteen',\n 14: 'Fourteen', 15: 'Fifteen', 16: 'Sixteen',\n 17: 'Seventeen', 18: 'Eighteen', 19: 'Nineteen'}\n info3={2: 'Twenty', 3: 'Thirty', 4: 'Forty', 5: 'Fifty', 6: 'Sixty',\n 7: 'Seventy', 8: 'Eighty', 9: 'Ninety'}\n \n order = ['', 'Thousand', 'Million', 'Billion']\n if num==0:\n return 'Zero'\n \n def process2(it):\n if it>=100:\n return None\n if it==0:\n return \"\"\n if it<10:\n return info1[it]\n if it<20:\n return info2[it]\n a, b=it//10, it%10\n res=[info3[a]]\n if b!=0:\n res.append(info1[b])\n return ' '.join(res)\n \n def process3(it):\n if it>=1000:\n return None\n a, b=it//100, it%100\n res=[]\n if a>0:\n res.append(info1[a])\n res.append('Hundred')\n tp=process2(b)\n if tp:\n res.append(tp)\n return ' '.join(res)\n \n ans=[]\n for k in range(4):\n tp=process3(num%1000)\n tp_res=[]\n if tp:\n tp_res.append(tp)\n if order[k]:\n tp_res.append(order[k])\n tp_res=' '.join(tp_res)\n if tp_res:\n ans.append(tp_res)\n num=num//1000\n if num==0:\n break\n return ' '.join(ans[::-1])","runtime":"33"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n \n # Define English words for various number ranges\n below_20 = ['','One','Two','Three','Four','Five','Six','Seven','Eight','Nine','Ten',\n 'Eleven','Twelve','Thirteen','Fourteen','Fifteen','Sixteen','Seventeen',\n 'Eighteen','Nineteen']\n tens = ['', '', 'Twenty', 'Thirty', 'Forty', 'Fifty', 'Sixty', 'Seventy', 'Eighty', 'Ninety']\n thousands = ['', 'Thousand', 'Million', 'Billion']\n \n # Helper function to convert numbers < 1000 to words\n def helper(n):\n if n == 0:\n return ''\n elif n < 20:\n return below_20[n] + ' '\n elif n < 100:\n return tens[n // 10] + ' ' + helper(n % 10)\n else:\n return below_20[n // 100] + ' Hundred ' + helper(n % 100)\n \n # Convert the number to words by processing each thousand-segment\n res = ''\n for i, word in enumerate(thousands):\n if num % 1000 != 0:\n res = helper(num % 1000) + word + ' ' + res\n num //= 1000\n \n return res.strip()\n","runtime":"33"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n ones = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\"]\n tens = [\"\", \"Ten\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n teens = [\"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n suffixes = [\"\", \"Thousand\", \"Million\", \"Billion\", \"Trillion\", \"Quadrillion\", \"Quintillion\", \"Sextillion\", \"Septillion\", \"Octillion\", \"Nonillion\", \"Decillion\"]\n words = []\n i = 0\n while num > 0:\n triplet = num % 1000\n num = num // 1000\n if triplet == 0:\n i += 1\n continue\n temp = []\n if triplet // 100 > 0:\n temp.append(ones[triplet // 100])\n temp.append(\"Hundred\")\n if triplet % 100 >= 10 and triplet % 100 <= 19:\n temp.append(teens[triplet % 10])\n else:\n if triplet % 100 >= 20:\n temp.append(tens[triplet % 100 // 10])\n if triplet % 10 > 0:\n temp.append(ones[triplet % 10])\n if i > 0:\n temp.append(suffixes[i])\n words = temp + words\n i += 1\n return \" \".join(words)","runtime":"34"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n\n if num == 0:\n return \"Zero\"\n res = []\n if num >= 10**9:\n three, num = num // 10**9, num % 10**9\n res += [self._convert_three(three), \"Billion\"]\n if num >= 10**6:\n three, num = num // 10**6, num % 10**6\n res += [self._convert_three(three), \"Million\"]\n if num >= 10**3:\n three, num = num // 10**3, num % 10**3\n res += [self._convert_three(three), \"Thousand\"]\n res += [self._convert_three(num)]\n return \" \".join(word for word in res if word != \"\")\n\n \n def _convert_three(self, num: int) -> str:\n below_ten = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\"]\n below_twenty = [\"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n below_hundred = [\"\", \"Ten\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n res = []\n if num >= 10**2:\n one, num = num // 10**2, num % 10**2\n res += [below_ten[one], \"Hundred\"]\n if num >= 20:\n one, num = num // 10, num % 10\n res += [below_hundred[one]]\n if num >= 10:\n res += [below_twenty[num-10]]\n num = 0\n if num > 0:\n res += [below_ten[num]]\n return \" \".join(res)\n \n","runtime":"34"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return 'Zero'\n nums = {0: '', 1: 'One', 2: 'Two', 3: 'Three', 4: 'Four', 5: 'Five', 6: 'Six', 7: 'Seven', 8: 'Eight', 9: 'Nine'}\n decs = {2: 'Twenty', 3: 'Thirty', 4: 'Forty', 5: 'Fifty', 6: 'Sixty', 7: 'Seventy', 8: 'Eighty', 9: 'Ninety'}\n tens = {0: 'Ten', 1:'Eleven', 2: 'Twelve', 3: 'Thirteen', 4: 'Fourteen', 5: 'Fifteen', 6: 'Sixteen', 7: 'Seventeen', 8: 'Eighteen', 9: 'Nineteen'}\n # Function to convert numbers < 1000 to words\n def hundreds(x):\n res = []\n h = x // 100\n x %= 100\n if h > 0:\n res.append(nums[h])\n res.append('Hundred')\n d = x // 10\n x %= 10\n if d > 1:\n res.append(decs[d])\n res.append(nums[x])\n elif d == 1:\n res.append(tens[x])\n else:\n res.append(nums[x])\n return res\n\n # Main conversion function\n def convert_chunk(num, unit):\n if num:\n res.extend(hundreds(num))\n if unit:\n res.append(unit)\n\n # Initialize result list\n res = []\n\n # Break the number into billions, millions, thousands, and the rest\n convert_chunk(num // 1000000000, 'Billion')\n num %= 1000000000\n convert_chunk(num // 1000000, 'Million')\n num %= 1000000\n convert_chunk(num // 1000, 'Thousand')\n num %= 1000\n convert_chunk(num, '')\n\n return ' '.join([i for i in res if i])","runtime":"35"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n ones = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\"]\n tens = [\"\", \"Ten\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n teens = [\"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n suffixes = [\"\", \"Thousand\", \"Million\", \"Billion\"]\n words = []\n i = 0\n while num > 0:\n triplet = num % 1000\n num = num // 1000\n if triplet == 0:\n i += 1\n continue\n temp = []\n if triplet // 100 > 0:\n temp.append(ones[triplet // 100])\n temp.append(\"Hundred\")\n if triplet % 100 >= 10 and triplet % 100 <= 19:\n temp.append(teens[triplet % 10])\n else:\n if triplet % 100 >= 20:\n temp.append(tens[triplet % 100 // 10])\n if triplet % 10 > 0:\n temp.append(ones[triplet % 10])\n if i > 0:\n temp.append(suffixes[i])\n words = temp + words\n i += 1\n return \" \".join(words)\n \n\n\n ","runtime":"35"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n\n ones_map = {\n 1 : \"One\",\n 2 : \"Two\",\n 3 : \"Three\",\n 4 : \"Four\",\n 5 : \"Five\",\n 6 : \"Six\",\n 7 : \"Seven\",\n 8 : \"Eight\",\n 9 : \"Nine\",\n 10 : \"Ten\",\n 11 : \"Eleven\",\n 12 : \"Twelve\",\n 13 : \"Thirteen\",\n 14 : \"Fourteen\",\n 15 : \"Fifteen\",\n 16 : \"Sixteen\",\n 17 : \"Seventeen\",\n 18 : \"Eighteen\",\n 19 : \"Nineteen\"\n }\n\n twos_map = {\n 20 : \"Twenty\",\n 30 : \"Thirty\",\n 40 : \"Forty\",\n 50 : \"Fifty\",\n 60 : \"Sixty\",\n 70 : \"Seventy\",\n 80 : \"Eighty\",\n 90 : \"Ninety\"\n }\n\n def get_string(n):\n res = []\n hund = n//100\n if hund:\n hundreds = (ones_map[hund] + \" Hundred\")\n res.append(hundreds)\n last_2 = n%100\n if last_2>=20:\n twos,ones = last_2//10,last_2%10\n res.append(twos_map[twos*10])\n if ones:\n res.append(ones_map[ones])\n elif last_2:\n res.append(ones_map[last_2])\n return \" \".join(res)\n \n\n res = []\n prefix = [\"\",\" Thousand\",\" Million\",\" Billion\"]\n i=0\n while num:\n \n dig = num%1000\n s = get_string(dig)\n if s:\n res.append(s+prefix[i])\n num//=1000\n i+=1\n res.reverse()\n return \" \".join(res)\n\n ","runtime":"36"},{"code":"singles = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \n \"Six\", \"Seven\", \"Eight\", \"Nine\"]\nteens = [\"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \n \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\ntens = [\"\", \"Ten\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \n \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\nthousands = [\"\", \"Thousand\", \"Million\", \"Billion\"]\n\nclass Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n\n def toEnglish(num: int) -> str:\n s = \"\"\n if num >= 100:\n s += singles[num // 100] + \" Hundred \"\n num %= 100\n if num >= 20:\n s += tens[num // 10] + \" \"\n num %= 10\n if 0 < num < 10:\n s += singles[num] + \" \"\n elif num >= 10:\n s += teens[num - 10] + \" \"\n return s\n\n s = \"\"\n unit = int(1e9)\n for i in range(3, -1, -1):\n curNum = num // unit\n if curNum:\n num -= curNum * unit\n s += toEnglish(curNum) + thousands[i] + \" \"\n unit //= 1000\n return s.strip()\n ","runtime":"36"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n \n converter = {1:\"One\",2:'Two',3:'Three',4:'Four',5:'Five',6:'Six',7:'Seven', 8:\"Eight\", 9:'Nine',10:'Ten',11:\"Eleven\",12:'Twelve',13:'Thirteen',14:'Fourteen',15:'Fifteen',16:\"Sixteen\",17:'Seventeen',18:\"Eighteen\",19:\"Nineteen\",20:\"Twenty\",30:\"Thirty\",40:\"Forty\",50:\"Fifty\",60:\"Sixty\",70:\"Seventy\", 80:\"Eighty\",90:\"Ninety\"}\n \n def hundreds(number):\n ans = []\n if number >= 100:\n hundreds_digit,number = divmod(number,100)\n ans.append(converter[hundreds_digit])\n ans.append(\"Hundred\")\n if number > 20:\n tens_digit,number = divmod(number,10)\n ans.append(converter[tens_digit*10])\n if number > 0:\n ans.append(converter[number])\n return \" \".join(ans)\n sol = []\n digit,num = divmod(num,10**9)\n \n if digit:\n sol.append(hundreds(digit))\n sol.append(\"Billion\")\n \n digit,num = divmod(num,10**6)\n \n if digit:\n sol.append(hundreds(digit))\n sol.append(\"Million\")\n \n digit,num = divmod(num,10**3)\n \n if digit:\n sol.append(hundreds(digit))\n sol.append(\"Thousand\")\n if num:\n sol.append(hundreds(num))\n return \" \".join(sol)\n \n ","runtime":"37"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n\n d = {\n 0: \"Zero\",\n 1: \"One\",\n 2: \"Two\",\n 3: \"Three\",\n 4: \"Four\",\n 5: \"Five\",\n 6: \"Six\",\n 7: \"Seven\",\n 8: \"Eight\",\n 9: \"Nine\",\n 10: \"Ten\",\n 11: \"Eleven\",\n 12: \"Twelve\",\n 13: \"Thirteen\",\n 14: \"Fourteen\",\n 15: \"Fifteen\",\n 16: \"Sixteen\",\n 17: \"Seventeen\",\n 18: \"Eighteen\",\n 19: \"Nineteen\",\n 20: \"Twenty\",\n 30: \"Thirty\",\n 40: \"Forty\",\n 50: \"Fifty\",\n 60: \"Sixty\",\n 70: \"Seventy\",\n 80: \"Eighty\",\n 90: \"Ninety\",\n 100: \"Hundred\",\n 1000: \"Thousand\",\n 1000000: \"Million\",\n 1000000000: \"Billion\"\n }\n \n '''\n Thousand, Million, Billion are outside of this scope.\n We only need to handle numbers from zero to a hundred.\n If in teens or 0, special case. Otherwise, follow a strict recursive formula\n '''\n def chunk(num):\n og = num\n assert(num >= 0 and num <= 999)\n if num == 0:\n return d[num] + \" \"\n if num >= 10 and num <= 19:\n return d[num] + \" \"\n\n hundreds = 0\n tens = 0\n ones = 0\n res = \"\"\n\n if num > 0:\n ones = num % 10\n num //= 10\n if num > 0:\n tens = num % 10\n num //= 10\n if num > 0:\n hundreds = num % 10\n num //= 10\n \n if hundreds > 0:\n res += d[hundreds] + \" Hundred \"\n if tens > 0 or ones > 0:\n snum = (tens * 10) + ones\n if snum == 0 or (snum >= 10 and snum <= 19):\n res += d[snum]\n else:\n if tens > 0:\n res += d[tens * 10] + \" \"\n if ones > 0:\n res += d[ones] + \" \"\n\n return res\n\n if num <= 999:\n return chunk(num).strip()\n\n res = \"\"\n billions = 0\n millions = 0\n thousands = 0\n rest = 0\n\n if num > 0:\n rest = num % 1000\n num //= 1000\n if num > 0:\n thousands = num % 1000\n num //= 1000\n if num > 0:\n millions = num % 1000\n num //= 1000\n if num > 0:\n billions = num % 1000\n num //= 1000\n \n if billions > 0:\n res += chunk(billions).strip() + \" Billion \"\n if millions > 0:\n res += chunk(millions).strip() + \" Million \"\n if thousands > 0:\n res += chunk(thousands).strip() + \" Thousand \"\n if rest > 0:\n res += chunk(rest)\n\n return res.strip()\n\n\n \n","runtime":"37"},{"code":"ones = [\n \"\",\n \"One\",\n \"Two\",\n \"Three\",\n \"Four\",\n \"Five\",\n \"Six\",\n \"Seven\",\n \"Eight\",\n \"Nine\",\n]\nltwenty = [\n \"Ten\",\n \"Eleven\",\n \"Twelve\",\n \"Thirteen\",\n \"Fourteen\",\n \"Fifteen\",\n \"Sixteen\",\n \"Seventeen\",\n \"Eighteen\",\n \"Nineteen\",\n]\ntens = [\n \"\",\n \"Ten\",\n \"Twenty\",\n \"Thirty\",\n \"Forty\",\n \"Fifty\",\n \"Sixty\",\n \"Seventy\",\n \"Eighty\",\n \"Ninety\",\n]\n\nclass Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n def convert_1000(num: int) -> list[str]:\n assert 0 <= num <= 999\n res = []\n if num >= 100:\n h = num // 100\n res = [ones[h], \"Hundred\"]\n num = num % 100\n if 11 <= num <= 19:\n res = res + [ltwenty[num-10]]\n else:\n t = num // 10\n o = num % 10\n res = res + [tens[t], ones[o]]\n return res\n\n res = []\n if n1k := num % 1000:\n res = convert_1000(n1k) + res\n num = num // 1000\n if n1k := num % 1000:\n res = convert_1000(n1k) + [\"Thousand\"] + res\n num = num // 1000\n if n1k := num % 1000:\n res = convert_1000(n1k) + [\"Million\"] + res\n num = num // 1000\n if n1k := num % 1000:\n res = convert_1000(n1k) + [\"Billion\"] + res\n res = [s for s in res if s]\n return \" \".join(res)\n ","runtime":"38"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n d = {0: \"Zero\",\n 1: \"One\",\n 2: \"Two\",\n 3: \"Three\",\n 4: \"Four\",\n 5: \"Five\",\n 6: \"Six\",\n 7: \"Seven\",\n 8: \"Eight\",\n 9: \"Nine\",\n 10: \"Ten\",\n 11: \"Eleven\",\n 12: \"Twelve\",\n 13: \"Thirteen\",\n 14: \"Fourteen\",\n 15: \"Fifteen\",\n 16: \"Sixteen\",\n 17: \"Seventeen\",\n 18: \"Eighteen\",\n 19: \"Nineteen\",\n 20: \"Twenty\",\n 30: \"Thirty\",\n 40: \"Forty\",\n 50: \"Fifty\",\n 60: \"Sixty\",\n 70: \"Seventy\",\n 80: \"Eighty\",\n 90: \"Ninety\",\n 100: \"Hundred\",\n 1000: \"Thousand\",\n 1000000: \"Million\",\n 1000000000: \"Billion\"\n }\n if num<21:\n return d[num]\n numDigits=math.floor(math.log10(num)+1)\n currNum=num\n res=\"\"\n i=numDigits\n while i>0:\n \n # print(currNum%(10**(i-1)))\n # print(currNum//(10**(i-2)))\n # print(10**(i-1))\n #if i==1:\n if currNum==0:\n return res.strip()\n numDigits=math.floor(math.log10(currNum)+1)\n temp=currNum-currNum%(10**(numDigits-1))\n if currNum<21 and currNum>0:\n res+=d[currNum]\n return res\n \n if numDigits<=2:\n \n res+=d[temp]\n if numDigits>=2:\n res+=\" \"\n currNum=(currNum%(10**(numDigits-1)))\n elif currNum//(10**(numDigits-1)) in d and numDigits>3 and 10**(numDigits-1) in d:\n res+=d[currNum//(10**(numDigits-1))]+\" \"+d[(10**(numDigits-1))]+\" \" \n currNum=(currNum%(10**(numDigits-1)))\n #i-=1\n elif numDigits>3:\n if currNum//(10**(numDigits-2)) in d and (10**(numDigits-2)) in d:\n res+=d[currNum//(10**(numDigits-2))]+\" \"+d[(10**(numDigits-2))]+\" \" \n currNum=(currNum%(10**(numDigits-1)))%(10**(numDigits-2))\n #i-=1\n else:\n numDigits-=(numDigits%3)\n temp=currNum//(10**(numDigits))\n if temp<10:\n res+=d[currNum//(10**(numDigits-1))]+\" \"+d[100]+\" \"\n currNum=(currNum%(10**(numDigits-1)))\n if currNum==0 or math.floor(math.log10(currNum)+1)+2<numDigits:\n res+=d[(10**(numDigits-3))]+\" \"\n #i-=1\n \n else:\n newDigits=math.floor(math.log10(temp)+1)\n bleh=temp%(10**(newDigits-1))\n temp=temp-bleh\n res+=d[temp]+\" \"+d[bleh]+\" \"+d[(10**(numDigits))]+\" \"\n currNum=(currNum%(10**(numDigits)))\n \n else: \n res+=d[currNum//(10**(numDigits-1))]+\" \"+d[100]+\" \"\n currNum=(currNum%(10**(numDigits-1)))\n i-=1\n return res","runtime":"38"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n billion = pow(10, 9)\n million = pow(10, 6)\n thousand = pow(10, 3)\n hundred = pow(10, 2)\n remainder = -1\n unique = ['One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine', 'Ten', \n 'Eleven', 'Twelve', 'Thirteen', 'Fourteen', 'Fifteen', 'Sixteen', 'Seventeen', 'Eighteen', 'Nineteen', 'Twenty', 'Thirty', 'Forty', 'Fifty', 'Sixty', 'Seventy', 'Eighty', 'Ninety']\n\n final_string = ''\n if num >= billion: \n remainder = num % billion\n final_string += self.numberToWords(int(num / billion)) + \" Billion\"\n elif num >= million:\n remainder = num % million\n final_string += self.numberToWords(int(num / million)) + \" Million\"\n elif num >= thousand:\n remainder = num % thousand\n final_string += self.numberToWords(int(num / thousand)) + \" Thousand\"\n elif num >= hundred:\n remainder = num % hundred\n final_string += self.numberToWords(int(num / hundred)) + \" Hundred\"\n elif num >= 20:\n remainder = num % 10\n final_string += unique[int(num / 10) - 2 + 19]\n elif num >= 1:\n return unique[num - 1]\n else:\n return 'Zero'\n \n if remainder > 0:\n return final_string + \" \" + self.numberToWords(remainder)\n return final_string\n \n","runtime":"39"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n # 2,147,483,647 is the max\n # 0 is the min\n if num == 0:\n return \"Zero\"\n\n number_dict = {\n 1: \"One\", 2: \"Two\", 3: \"Three\", 4: \"Four\", 5: \"Five\", 6: \"Six\",\n 7: \"Seven\", 8: \"Eight\", 9: \"Nine\", 10: \"Ten\", 11: \"Eleven\", 12: \"Twelve\",\n 13: \"Thirteen\", 14: \"Fourteen\", 15: \"Fifteen\", 16: \"Sixteen\", 17: \"Seventeen\",\n 18: \"Eighteen\", 19: \"Nineteen\", 20: \"Twenty\", 30: \"Thirty\", 40: \"Forty\", \n 50: \"Fifty\", 60: \"Sixty\", 70: \"Seventy\", 80: \"Eighty\", 90: \"Ninety\"\n }\n\n if num in number_dict:\n return number_dict.get(num)\n\n suffix = {\n 100: \"Hundred\", 1000: \"Thousand\", 1000000: \"Million\", 1000000000: \"Billion\"\n }\n\n if num in suffix:\n return \"One \" + suffix.get(num)\n\n res, tmp, base = \"\", \"\", \"\"\n n = len(str(num))\n index = 0\n for i in range(n-1, -1, -1):\n if len(tmp) < 3:\n tmp = str(num)[i] + tmp\n\n if int(\"1\" + (\"0\" * (index))) in suffix:\n base = suffix.get(int(\"1\" + (\"0\" * (index))))\n\n if len(tmp) == 3 or i == 0:\n if index >= 3:\n con = self.conversion(tmp, number_dict, suffix) \n if con:\n res = con + \" \" + base + \" \" + res\n else:\n res = self.conversion(tmp, number_dict, suffix) + res\n tmp = \"\"\n index += 1\n return res.strip()\n \n def conversion(self, num, number_dict, suffix):\n res = \"\"\n n = len(num)\n for i in range(n):\n digit = num[i]\n zeros = \"1\" + (\"0\" * (n-1))\n nth_num = int(digit) * int(zeros)\n if digit != \"0\":\n if int(num[i:]) in number_dict:\n return res + number_dict.get(int(num[i:]))\n elif nth_num in suffix:\n res += number_dict.get(int(digit)) + \" \" + suffix.get(nth_num) + \" \"\n elif nth_num in number_dict:\n res += number_dict.get(nth_num) + \" \"\n elif int(zeros) in suffix:\n res += number_dict.get(int(digit)) + \" \" + suffix.get(int(zeros)) + \" \"\n n -= 1\n return res.strip()","runtime":"39"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n \n # Dictionaries for specific number wordings\n below_20 = [\n 'Zero', 'One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine',\n 'Ten', 'Eleven', 'Twelve', 'Thirteen', 'Fourteen', 'Fifteen', 'Sixteen', 'Seventeen', 'Eighteen', 'Nineteen'\n ]\n \n tens = [\n '', '', 'Twenty', 'Thirty', 'Forty', 'Fifty', 'Sixty', 'Seventy', 'Eighty', 'Ninety'\n ]\n \n thousands = ['', 'Thousand', 'Million', 'Billion']\n\n def helper(n):\n if n == 0:\n return ''\n elif n < 20:\n return below_20[n] + ' '\n elif n < 100:\n return tens[n//10] + ' ' + helper(n % 10)\n else:\n return below_20[n // 100] + ' Hundred ' + helper(n % 100)\n \n res = ''\n i = 0\n\n while num > 0:\n if num % 1000 != 0:\n res = helper(num % 1000) + thousands[i] + ' ' + res\n num //= 1000\n i += 1\n return res.strip()\n\n","runtime":"40"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n info1={1: 'One', 2: 'Two', 3: 'Three', 4: 'Four', \n 5: 'Five', 6: 'Six', 7: 'Seven', 8: 'Eight', 9: 'Nine'}\n info2={10: 'Ten', 11: 'Eleven', 12: 'Twelve', 13: 'Thirteen',\n 14: 'Fourteen', 15: 'Fifteen', 16: 'Sixteen', 17: 'Seventeen',\n 18: 'Eighteen', 19: 'Nineteen'}\n info3={2: 'Twenty', 3: 'Thirty', 4: 'Forty', 5: 'Fifty',\n 6: 'Sixty', 7: 'Seventy', 8: 'Eighty', 9: 'Ninety'}\n order=['', 'Thousand', 'Million', 'Billion']\n \n def process2(num):\n if num>=100:\n return None\n if num==0:\n return \"\"\n if num<10:\n return info1[num]\n if num<20:\n return info2[num]\n res=[info3[num//10]]\n if num%10:\n res.append(info1[num%10])\n return ' '.join(res)\n \n def process3(num):\n if num>=1000:\n return None\n res=[]\n if num//100>0:\n res.append(info1[num//100])\n res.append('Hundred')\n tp=process2(num%100)\n if tp:\n res.append(tp)\n return ' '.join(res)\n if num==0:\n return 'Zero'\n res=[]\n for k in range(4):\n cur=process3(num%1000)\n tp_res=[]\n if cur:\n tp_res.append(cur)\n if order[k]:\n tp_res.append(order[k])\n tp_res=' '.join(tp_res)\n if tp_res:\n res.append(tp_res)\n num=num//1000\n if num==0:\n break\n return ' '.join(res[::-1])","runtime":"40"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n ones = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\"]\n tens = [\"\", \"Ten\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n teens = [\"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n suffixes = [\"\", \"Thousand\", \"Million\", \"Billion\", \"Trillion\", \"Quadrillion\", \"Quintillion\", \"Sextillion\", \"Septillion\", \"Octillion\", \"Nonillion\", \"Decillion\"]\n words = []\n i = 0\n while num > 0:\n triplet = num % 1000\n num = num // 1000\n if triplet == 0:\n i += 1\n continue\n temp = []\n if triplet // 100 > 0:\n temp.append(ones[triplet // 100])\n temp.append(\"Hundred\")\n if triplet % 100 >= 10 and triplet % 100 <= 19:\n temp.append(teens[triplet % 10])\n else:\n if triplet % 100 >= 20:\n temp.append(tens[triplet % 100 // 10])\n if triplet % 10 > 0:\n temp.append(ones[triplet % 10])\n if i > 0:\n temp.append(suffixes[i])\n words = temp + words\n i += 1\n return \" \".join(words)\n \n\n\n ","runtime":"41"},{"code":"class Solution:\n def numberToWords(self, num):\n if num == 0:\n return \"Zero\"\n \n def one(num):\n switcher = {\n 1: \"One\", 2: \"Two\", 3: \"Three\", 4: \"Four\",\n 5: \"Five\", 6: \"Six\", 7: \"Seven\", 8: \"Eight\", 9: \"Nine\"\n }\n return switcher.get(num, \"\")\n \n def two_less_20(num):\n switcher = {\n 10: \"Ten\", 11: \"Eleven\", 12: \"Twelve\", 13: \"Thirteen\",\n 14: \"Fourteen\", 15: \"Fifteen\", 16: \"Sixteen\", 17: \"Seventeen\",\n 18: \"Eighteen\", 19: \"Nineteen\"\n }\n return switcher.get(num, \"\")\n \n def ten(num):\n switcher = {\n 2: \"Twenty\", 3: \"Thirty\", 4: \"Forty\", 5: \"Fifty\",\n 6: \"Sixty\", 7: \"Seventy\", 8: \"Eighty\", 9: \"Ninety\"\n }\n return switcher.get(num, \"\")\n \n def two(num):\n if not num:\n return \"\"\n elif num < 10:\n return one(num)\n elif num < 20:\n return two_less_20(num)\n else:\n tenner = num // 10\n rest = num - tenner * 10\n return ten(tenner) + (\"\" if not rest else \" \" + one(rest))\n \n def three(num):\n hundred = num // 100\n rest = num - hundred * 100\n if hundred and rest:\n return one(hundred) + \" Hundred \" + two(rest)\n elif not hundred and rest:\n return two(rest)\n elif hundred and not rest:\n return one(hundred) + \" Hundred\"\n else:\n return \"\"\n \n def helper(num):\n billion = num // 1000000000\n million = (num % 1000000000) // 1000000\n thousand = (num % 1000000) // 1000\n remainder = num % 1000\n \n res = \"\"\n if billion:\n res += three(billion) + \" Billion\"\n if million:\n res += (\" \" if res else \"\") + three(million) + \" Million\"\n if thousand:\n res += (\" \" if res else \"\") + three(thousand) + \" Thousand\"\n if remainder:\n res += (\" \" if res else \"\") + three(remainder)\n \n return res\n \n return helper(num).strip()\n","runtime":"41"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n les20 = [\n \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\", \"Ten\",\n \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"\n ]\n tens = [\"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n\n \n def helper(num):\n if not num:\n return []\n elif 1 <= num < 20:\n return [les20[num - 1]] \n elif 20 <= num < 100:\n return [tens[num // 10 - 2]] + helper(num % 10)\n elif 100 <= num < 1000:\n return helper(num // 100) + [\"Hundred\"] + helper(num % 100)\n else:\n for p, unit in enumerate([\"Billion\", \"Million\", \"Thousand\"]):\n thres = 10 ** (3 * (3 - p))\n if num >= thres:\n return helper(num // thres) + [unit] + helper(num % thres)\n \n res = helper(num)\n\n return \" \".join(res) if res else \"Zero\"","runtime":"42"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0: \n return \"Zero\"\n ones = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\", \"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n tens = [\"\", \"\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n thousands = [\"\", \"Thousand\", \"Million\", \"Billion\"]\n \n res = \"\" \n groupIndex = 0\n\n while num > 0: \n if num % 1000 != 0: \n groupRes = \"\" \n part = num % 1000 \n\n if part >= 100: \n groupRes += ones[part // 100] + \" Hundred \" \n part %= 100 \n \n if part >= 20: \n groupRes += tens[part // 10] + \" \"\n part %= 10\n \n if part > 0: \n groupRes += ones[part] + \" \"\n\n groupRes += thousands[groupIndex] + \" \"\n res = groupRes + res\n \n num //= 1000 \n groupIndex += 1 \n return res.strip() ","runtime":"42"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n info1={1: 'One', 2: 'Two', 3: 'Three', 4: 'Four', \n 5: 'Five', 6: 'Six', 7: 'Seven', 8: 'Eight', 9: 'Nine'}\n info2={10: 'Ten', 11: 'Eleven', 12: 'Twelve', 13: 'Thirteen',\n 14: 'Fourteen', 15: 'Fifteen', 16: 'Sixteen', 17: 'Seventeen',\n 18: 'Eighteen', 19: 'Nineteen'}\n info3={2: 'Twenty', 3: 'Thirty', 4: 'Forty', 5: 'Fifty',\n 6: 'Sixty', 7: 'Seventy', 8: 'Eighty', 9: 'Ninety'}\n order=['', 'Thousand', 'Million', 'Billion']\n \n def process2(num):\n if num>=100:\n return None\n if num==0:\n return \"\"\n if num<10:\n return info1[num]\n if num<20:\n return info2[num]\n res=[info3[num//10]]\n if num%10:\n res.append(info1[num%10])\n return ' '.join(res)\n \n def process3(num):\n if num>=1000:\n return None\n res=[]\n if num//100>0:\n res.append(info1[num//100])\n res.append('Hundred')\n tp=process2(num%100)\n if tp:\n res.append(tp)\n return ' '.join(res)\n if num==0:\n return 'Zero'\n res=[]\n for k in range(4):\n cur=process3(num%1000)\n tp_res=[]\n if cur:\n tp_res.append(cur)\n if order[k]:\n tp_res.append(order[k])\n tp_res=' '.join(tp_res)\n if tp_res:\n res.append(tp_res)\n num=num//1000\n if num==0:\n break\n return ' '.join(res[::-1])","runtime":"43"}],"string":"[\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n ones_map = {\\n 1: \\\"One\\\", \\n 2: \\\"Two\\\", \\n 3: \\\"Three\\\", \\n 4: \\\"Four\\\", \\n 5: \\\"Five\\\", \\n 6: \\\"Six\\\", \\n 7: \\\"Seven\\\", \\n 8: \\\"Eight\\\", \\n 9: \\\"Nine\\\",\\n 10: \\\"Ten\\\", \\n 11: \\\"Eleven\\\", \\n 12: \\\"Twelve\\\", \\n 13: \\\"Thirteen\\\", \\n 14: \\\"Fourteen\\\", \\n 15: \\\"Fifteen\\\", \\n 16: \\\"Sixteen\\\", \\n 17: \\\"Seventeen\\\", \\n 18: \\\"Eighteen\\\", \\n 19: \\\"Nineteen\\\"\\n }\\n \\n tens_map = {\\n 20: \\\"Twenty\\\",\\n 30: \\\"Thirty\\\",\\n 40: \\\"Forty\\\",\\n 50: \\\"Fifty\\\",\\n 60: \\\"Sixty\\\",\\n 70: \\\"Seventy\\\",\\n 80: \\\"Eighty\\\",\\n 90: \\\"Ninety\\\"\\n }\\n\\n def stringify(n):\\n res = []\\n hundreds = n // 100\\n if hundreds:\\n res.append(ones_map[hundreds] + \\\" Hundred\\\")\\n last_two = n % 100 \\n if last_two >= 20:\\n tens, ones = last_two // 10, last_two % 10\\n res.append(tens_map[tens * 10])\\n if ones:\\n res.append(ones_map[ones])\\n elif last_two:\\n res.append(ones_map[last_two])\\n return \\\" \\\".join(res)\\n \\n large_num_postfix = [\\\"\\\", \\\" Thousand\\\", \\\" Million\\\", \\\" Billion\\\"]\\n curr = 0\\n res = []\\n\\n while num:\\n digits = num % 1000\\n s = stringify(digits)\\n if s:\\n res.append(s + large_num_postfix[curr])\\n num //= 1000\\n curr += 1\\n\\n res.reverse()\\n return \\\" \\\".join(res)\",\n \"runtime\": \"12\"\n },\n {\n \"code\": \"class Solution:\\n # Dictionary to store words for numbers\\n number_to_words_map = {\\n 1000000000: \\\"Billion\\\", 1000000: \\\"Million\\\", 1000: \\\"Thousand\\\",\\n 100: \\\"Hundred\\\", 90: \\\"Ninety\\\", 80: \\\"Eighty\\\", 70: \\\"Seventy\\\",\\n 60: \\\"Sixty\\\", 50: \\\"Fifty\\\", 40: \\\"Forty\\\", 30: \\\"Thirty\\\",\\n 20: \\\"Twenty\\\", 19: \\\"Nineteen\\\", 18: \\\"Eighteen\\\", 17: \\\"Seventeen\\\",\\n 16: \\\"Sixteen\\\", 15: \\\"Fifteen\\\", 14: \\\"Fourteen\\\", 13: \\\"Thirteen\\\",\\n 12: \\\"Twelve\\\", 11: \\\"Eleven\\\", 10: \\\"Ten\\\", 9: \\\"Nine\\\", 8: \\\"Eight\\\",\\n 7: \\\"Seven\\\", 6: \\\"Six\\\", 5: \\\"Five\\\", 4: \\\"Four\\\", 3: \\\"Three\\\",\\n 2: \\\"Two\\\", 1: \\\"One\\\"\\n }\\n\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n for value, word in self.number_to_words_map.items():\\n # Check if the number is greater than or equal to the current unit\\n if num >= value:\\n # Convert the quotient to words if the current unit is 100 or greater\\n prefix = (self.numberToWords(num // value) + \\\" \\\") if num >= 100 else \\\"\\\"\\n\\n # Get the word for the current unit\\n unit = word\\n\\n # Convert the remainder to words if it's not zero\\n suffix = \\\"\\\" if num % value == 0 else \\\" \\\" + self.numberToWords(num % value)\\n\\n return prefix + unit + suffix\\n\\n return \\\"\\\"\",\n \"runtime\": \"14\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n belowTwenty = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\",\\n \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\",\\n \\\"Eight\\\", \\\"Nine\\\", \\\"Ten\\\", \\\"Eleven\\\",\\n \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\",\\n \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n tens = [\\\"\\\", \\\"Ten\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\",\\n \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n\\n def helper(num: int) -> str:\\n if num < 20:\\n s = belowTwenty[num]\\n elif num < 100:\\n s = tens[num // 10] + \\\" \\\" + belowTwenty[num % 10]\\n elif num < 1000:\\n s = helper(num // 100) + \\\" Hundred \\\" + helper(num % 100)\\n elif num < 1000000:\\n s = helper(num // 1000) + \\\" Thousand \\\" + helper(num % 1000)\\n elif num < 1000000000:\\n s = helper(num // 1000000) + \\\" Million \\\" + \\\\\\n helper(num % 1000000)\\n else:\\n s = helper(num // 1000000000) + \\\" Billion \\\" + \\\\\\n helper(num % 1000000000)\\n\\n return s.strip()\\n\\n return helper(num)\",\n \"runtime\": \"14\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n \\n bigString = [\\\"Thousand\\\", \\\"Million\\\", \\\"Billion\\\"]\\n result = self.numberToWordsHelper(num % 1000)\\n num //= 1000\\n \\n for i in range(len(bigString)):\\n if num > 0 and num % 1000 > 0:\\n result = self.numberToWordsHelper(num % 1000) + bigString[i] + \\\" \\\" + result\\n num //= 1000\\n \\n return result.strip()\\n\\n def numberToWordsHelper(self, num: int) -> str:\\n digitString = [\\\"Zero\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\n teenString = [\\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n tenString = [\\\"\\\", \\\"\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n \\n result = \\\"\\\"\\n if num > 99:\\n result += digitString[num // 100] + \\\" Hundred \\\"\\n \\n num %= 100\\n if num < 20 and num > 9:\\n result += teenString[num - 10] + \\\" \\\"\\n else:\\n if num >= 20:\\n result += tenString[num // 10] + \\\" \\\"\\n num %= 10\\n if num > 0:\\n result += digitString[num] + \\\" \\\"\\n \\n return result\",\n \"runtime\": \"15\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n d = {0: \\\"Zero\\\",\\n 1: \\\"One\\\",\\n 2: \\\"Two\\\",\\n 3: \\\"Three\\\",\\n 4: \\\"Four\\\",\\n 5: \\\"Five\\\",\\n 6: \\\"Six\\\",\\n 7: \\\"Seven\\\",\\n 8: \\\"Eight\\\",\\n 9: \\\"Nine\\\",\\n 10: \\\"Ten\\\",\\n 11: \\\"Eleven\\\",\\n 12: \\\"Twelve\\\",\\n 13: \\\"Thirteen\\\",\\n 14: \\\"Fourteen\\\",\\n 15: \\\"Fifteen\\\",\\n 16: \\\"Sixteen\\\",\\n 17: \\\"Seventeen\\\",\\n 18: \\\"Eighteen\\\",\\n 19: \\\"Nineteen\\\",\\n 20: \\\"Twenty\\\",\\n 30: \\\"Thirty\\\",\\n 40: \\\"Forty\\\",\\n 50: \\\"Fifty\\\",\\n 60: \\\"Sixty\\\",\\n 70: \\\"Seventy\\\",\\n 80: \\\"Eighty\\\",\\n 90: \\\"Ninety\\\",\\n 100: \\\"Hundred\\\",\\n 1000: \\\"Thousand\\\",\\n 1000000: \\\"Million\\\",\\n 1000000000: \\\"Billion\\\"}\\n\\n if num == 0:\\n return d[0]\\n\\n res = []\\n\\n # parse 3 digit numbers:\\n def parse(num, exp):\\n if exp == 3:\\n return\\n # check if theres anything from 11 to 19:\\n if exp == 0 and 11 <= num % 100 <= 19:\\n res.append(d[num % 100])\\n parse(num // 100, exp + 2)\\n else:\\n digit = num % 10\\n\\n if digit != 0:\\n if exp == 2: \\n res.append(d[100])\\n res.append(d[digit])\\n else:\\n res.append(d[digit * (10 ** exp)])\\n\\n parse(num // 10, exp + 1)\\n\\n def recurse(num, exp):\\n if num == 0:\\n return \\n\\n three_digit = num % 1000\\n if three_digit != 0:\\n if exp != 0:\\n res.append(d[10 ** exp])\\n parse(three_digit, 0)\\n recurse(num // 1000, exp + 3)\\n\\n recurse(num, 0)\\n res = res[::-1]\\n\\n return \\\" \\\".join(res)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"15\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n\\n if num==0:\\n return \\\"Zero\\\"\\n ones=[\\\"\\\",\\\"One\\\",'Two', 'Three' ,'Four' ,'Five', 'Six' ,'Seven' ,'Eight', 'Nine']\\n teens=[\\\"\\\",'Eleven', 'Twelve', 'Thirteen' ,'Fourteen' ,'Fifteen', 'Sixteen' ,'Seventeen', 'Eighteen' ,'Nineteen']\\n tens=[\\\"\\\",'Ten', 'Twenty', 'Thirty' ,'Forty' ,'Fifty', 'Sixty', 'Seventy', 'Eighty' ,'Ninety' ]\\n\\n\\n def hun(t):\\n ans=\\\"\\\"\\n ans+=ones[t//100]+' Hundred '\\n t=t%100\\n if t%10==0:\\n ans+=tens[t//10]\\n t=t%10\\n elif t<10:\\n ans+=ones[t]\\n t=0\\n elif t>10 and t<20:\\n ans+=teens[t%10]\\n t=0\\n else:\\n ans+=tens[t//10]+\\\" \\\"+ones[t%10]\\n return ans\\n\\n def thous(t):\\n ans=\\\"\\\"\\n ans+=ones[t//100]\\n t=t%100\\n if t%10==0:\\n ans+=tens[t//10]\\n t=0\\n elif t<10:\\n ans+=ones[t]\\n t=0\\n elif t>10 and t<20:\\n ans+=teens[t%10]\\n t=0\\n elif t<100:\\n ans+=tens[t//10]+\\\" \\\"+ones[t%10]\\n else:\\n ans=hun(t%1000)\\n return ans+' Thousand '\\n\\n\\n\\n ans=\\\"\\\"\\n \\n while num>0:\\n if num>=1000000000:\\n t=num//1000000000\\n if t%10==0:\\n ans+=tens[t//10]\\n elif t<10:\\n ans+=ones[t]\\n elif t>10 and t<20:\\n ans+=teens[t%10]\\n elif t<100:\\n ans+=tens[t//10]+\\\" \\\"+ones[t%10]\\n elif t>=1000:\\n ans+=thous(t)\\n elif t>100:\\n ans+=hun(t)\\n ans+=' Billion '\\n num=num%1000000000\\n\\n\\n if num>=1000000:\\n t=num//1000000\\n if t%10==0 and t<100:\\n ans+=tens[t//10]\\n elif t<10:\\n ans+=ones[t]\\n elif t>10 and t<20:\\n ans+=teens[t%10]\\n elif t<100:\\n ans+=tens[t//10]+\\\" \\\"+ones[t%10]\\n elif t>=1000:\\n ans+=thous(t)\\n elif t>=100:\\n ans+=hun(t)\\n ans+=' Million '\\n num=num%1000000\\n if num>=1000:\\n if num//1000>=100 and num//1000<1000:\\n ans+=hun(num//1000)+\\\" Thousand \\\"\\n else:\\n ans+=thous(num//1000)\\n num=num%1000\\n if num>0:\\n t=num\\n if t>=100:\\n ans+=hun(t)\\n else:\\n if t%10==0:\\n ans+=tens[t//10]\\n elif t<10:\\n ans+=ones[t]\\n elif t>10 and t<20:\\n ans+=teens[t%10]\\n else:\\n ans+=tens[t//10]+\\\" \\\"+ones[t%10]\\n num=0\\n return \\\" \\\".join(ans.split())\\n\\n \\n\\n\",\n \"runtime\": \"16\"\n },\n {\n \"code\": \"class Solution:\\n \\n def numberToWords(self, num: int) -> str:\\n belowTen = {0: \\\"\\\",\\n 1: \\\"One\\\",\\n 2: \\\"Two\\\",\\n 3: \\\"Three\\\",\\n 4: \\\"Four\\\",\\n 5: \\\"Five\\\",\\n 6: \\\"Six\\\",\\n 7: \\\"Seven\\\",\\n 8: \\\"Eight\\\",\\n 9: \\\"Nine\\\"\\n }\\n\\n belowTwenty = {\\n 10: \\\"Ten\\\",\\n 11: \\\"Eleven\\\",\\n 12: \\\"Twelve\\\",\\n 13: \\\"Thirteen\\\",\\n 14: \\\"Fourteen\\\",\\n 15: \\\"Fifteen\\\",\\n 16: \\\"Sixteen\\\",\\n 17: \\\"Seventeen\\\",\\n 18: \\\"Eighteen\\\",\\n 19: \\\"Nineteen\\\"\\n }\\n \\n belowHundred = {\\n 2: \\\"Twenty\\\",\\n 3: \\\"Thirty\\\",\\n 4: \\\"Forty\\\",\\n 5: \\\"Fifty\\\",\\n 6: \\\"Sixty\\\",\\n 7: \\\"Seventy\\\",\\n 8: \\\"Eighty\\\",\\n 9: \\\"Ninety\\\"\\n }\\n \\n def solve(num):\\n if num < 10:\\n return belowTen[num]\\n if num < 20:\\n return belowTwenty[num]\\n if num < 100:\\n return (\\n belowHundred[num//10] + \\n (\\\" \\\" + belowTen[num%10] if (num%10 != 0) else \\\"\\\")\\n )\\n if num < 1000:\\n return (\\n solve(num//100) + \\\" Hundred\\\" +\\n (\\\" \\\" + solve(num%100) if (num%100 != 0) else \\\"\\\")\\n )\\n if num < 1000000:\\n return (\\n solve(num//1000) + \\\" Thousand\\\" +\\n (\\\" \\\" + solve(num%1000) if (num%1000 != 0) else \\\"\\\")\\n )\\n if num < 1000000000:\\n return (\\n solve(num//1000000) + \\\" Million\\\" +\\n (\\\" \\\" + solve(num%1000000) if (num%1000000 != 0) else \\\"\\\")\\n )\\n return (\\n solve(num//1000000000) + \\\" Billion\\\" +\\n (\\\" \\\" + solve(num%1000000000) if (num%1000000000 != 0) else \\\"\\\")\\n )\\n \\n if num == 0:\\n return \\\"Zero\\\"\\n return solve(num)\\n\",\n \"runtime\": \"16\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if not num:\\n return \\\"Zero\\\"\\n \\n ones_map = {\\n 1: \\\"One\\\",\\n 2: \\\"Two\\\", \\n 3: \\\"Three\\\", \\n 4: \\\"Four\\\",\\n 5: \\\"Five\\\", \\n 6: \\\"Six\\\",\\n 7: \\\"Seven\\\",\\n 8: \\\"Eight\\\",\\n 9: \\\"Nine\\\",\\n 10: \\\"Ten\\\",\\n 11: \\\"Eleven\\\",\\n 12: \\\"Twelve\\\", \\n 13: \\\"Thirteen\\\", \\n 14: \\\"Fourteen\\\",\\n 15: \\\"Fifteen\\\", \\n 16: \\\"Sixteen\\\",\\n 17: \\\"Seventeen\\\",\\n 18: \\\"Eighteen\\\",\\n 19: \\\"Nineteen\\\",\\n }\\n\\n tens_map = {\\n 20: \\\"Twenty\\\",\\n 30: \\\"Thirty\\\",\\n 40: \\\"Forty\\\", \\n 50: \\\"Fifty\\\",\\n 60: \\\"Sixty\\\",\\n 70: \\\"Seventy\\\",\\n 80: \\\"Eighty\\\",\\n 90: \\\"Ninety\\\"\\n }\\n \\n def get_string(n):\\n res = []\\n hundreds = n // 100\\n if hundreds:\\n res.append(ones_map[hundreds] + \\\" Hundred\\\")\\n last_2 = n % 100\\n if last_2 >= 20:\\n tens, ones = last_2 // 10, last_2 % 10\\n res.append(tens_map[tens * 10])\\n if ones:\\n res.append(ones_map[ones])\\n elif last_2:\\n res.append(ones_map[last_2])\\n return \\\" \\\".join(res)\\n\\n prefix = [\\\"\\\", \\\" Thousand\\\", \\\" Million\\\", \\\" Billion\\\"]\\n i = 0\\n res = []\\n while num:\\n digits = num % 1000\\n s = get_string(digits)\\n if s:\\n res.append(s + prefix[i])\\n i += 1\\n num = num // 1000\\n res.reverse()\\n return \\\" \\\".join(res)\",\n \"runtime\": \"17\"\n },\n {\n \"code\": \"class Solution:\\n number_to_words_map = {\\n 1000000000: \\\"Billion\\\", 1000000: \\\"Million\\\", 1000: \\\"Thousand\\\",\\n 100: \\\"Hundred\\\", 90: \\\"Ninety\\\", 80: \\\"Eighty\\\", 70: \\\"Seventy\\\",\\n 60: \\\"Sixty\\\", 50: \\\"Fifty\\\", 40: \\\"Forty\\\", 30: \\\"Thirty\\\",\\n 20: \\\"Twenty\\\", 19: \\\"Nineteen\\\", 18: \\\"Eighteen\\\", 17: \\\"Seventeen\\\",\\n 16: \\\"Sixteen\\\", 15: \\\"Fifteen\\\", 14: \\\"Fourteen\\\", 13: \\\"Thirteen\\\",\\n 12: \\\"Twelve\\\", 11: \\\"Eleven\\\", 10: \\\"Ten\\\", 9: \\\"Nine\\\", 8: \\\"Eight\\\",\\n 7: \\\"Seven\\\", 6: \\\"Six\\\", 5: \\\"Five\\\", 4: \\\"Four\\\", 3: \\\"Three\\\",\\n 2: \\\"Two\\\", 1: \\\"One\\\"\\n }\\n\\n def numberToWords(self, num: int) -> str:\\n\\n if num == 0:\\n return \\\"Zero\\\"\\n \\n for val, word in self.number_to_words_map.items():\\n if num >= val:\\n prefix = (self.numberToWords(num//val) + \\\" \\\") if num >= 100 else \\\"\\\"\\n unit = word\\n suffix = \\\"\\\" if num % val == 0 else \\\" \\\" + self.numberToWords(num % val)\\n\\n return prefix + unit + suffix\\n \\n return \\\"\\\"\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num==0:\\n return \\\"Zero\\\"\\n bigString=[\\\"Thousand\\\", \\\"Million\\\", \\\"Billion\\\"]\\n result=self.numberToWordsHelper(num % 1000)\\n num//=1000\\n for i in range(len(bigString)):\\n if num>0 and num%1000 > 0:\\n result=self.numberToWordsHelper(num % 1000)+bigString[i]+\\\" \\\"+result\\n num//=1000\\n return result.strip()\\n def numberToWordsHelper(self, num: int) -> str:\\n digitString = [\\\"Zero\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\n teenString = [\\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n tenString = [\\\"\\\", \\\"\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n result = \\\"\\\"\\n if num>99:\\n result+=digitString[num//100]+\\\" \\\"+\\\"Hundred\\\"+\\\" \\\"\\n num%=100\\n if num<20 and num>9:\\n result+=teenString[num-10]+\\\" \\\"\\n else:\\n if num>=20:\\n result+=tenString[num//10]+ \\\" \\\"\\n num%=10\\n if num>0:\\n result+=digitString[num]+\\\" \\\"\\n return result\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n bten = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\n btwenty = [\\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n bhundred = [\\\"\\\", \\\"Ten\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"] \\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n else:\\n return self.ConvertToWords(num)\\n def ConvertToWords(self,num:int) ->str:\\n if num<10:\\n return self.bten[num]\\n if num<20:\\n return self.btwenty[num-10]\\n if num<100:\\n return self.bhundred[num//10]+(\\\" \\\"+ self.ConvertToWords(num%10) if num%10!=0 else \\\"\\\")\\n if num<1000:\\n return self.ConvertToWords(num//100)+\\\" Hundred\\\"+(\\\" \\\"+self.ConvertToWords(num%100) if num%100!=0 else \\\"\\\")\\n if num<1000000:\\n return self.ConvertToWords(num//1000)+\\\" Thousand\\\"+(\\\" \\\"+self.ConvertToWords(num%1000) if num%1000!=0 else \\\"\\\")\\n if num<10**9:\\n return self.ConvertToWords(num//10**6)+\\\" Million\\\"+(\\\" \\\"+self.ConvertToWords(num%10**6) if num%10**6!=0 else \\\"\\\")\\n return self.ConvertToWords(num//10**9)+\\\" Billion\\\"+(\\\" \\\"+self.ConvertToWords(num%10**9) if num%10**9!=0 else \\\"\\\")\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n number_to_words_map = {\\n 1000000000: \\\"Billion\\\", 1000000: \\\"Million\\\", 1000: \\\"Thousand\\\",\\n 100: \\\"Hundred\\\", 90: \\\"Ninety\\\", 80: \\\"Eighty\\\", 70: \\\"Seventy\\\",\\n 60: \\\"Sixty\\\", 50: \\\"Fifty\\\", 40: \\\"Forty\\\", 30: \\\"Thirty\\\",\\n 20: \\\"Twenty\\\", 19: \\\"Nineteen\\\", 18: \\\"Eighteen\\\", 17: \\\"Seventeen\\\",\\n 16: \\\"Sixteen\\\", 15: \\\"Fifteen\\\", 14: \\\"Fourteen\\\", 13: \\\"Thirteen\\\",\\n 12: \\\"Twelve\\\", 11: \\\"Eleven\\\", 10: \\\"Ten\\\", 9: \\\"Nine\\\", 8: \\\"Eight\\\",\\n 7: \\\"Seven\\\", 6: \\\"Six\\\", 5: \\\"Five\\\", 4: \\\"Four\\\", 3: \\\"Three\\\",\\n 2: \\\"Two\\\", 1: \\\"One\\\"\\n }\\n\\n def numberToWords(self, num: int) -> str:\\n if num == 0: \\n return \\\"Zero\\\"\\n \\n for value, unit in self.number_to_words_map.items():\\n if num >= value: \\n prefix = (self.numberToWords(num // value) + \\\" \\\") if num >= 100 else \\\"\\\"\\n suffix = \\\"\\\" if num % value == 0 else \\\" \\\" + self.numberToWords(num % value) \\n return prefix + unit + suffix\\n return \\\"\\\"\\n \",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n ret = []\\n numToEnglish = {\\n 1: \\\"One\\\",\\n 2: \\\"Two\\\",\\n 3: \\\"Three\\\",\\n 4: \\\"Four\\\",\\n 5: \\\"Five\\\",\\n 6: \\\"Six\\\",\\n 7: \\\"Seven\\\",\\n 8: \\\"Eight\\\",\\n 9: \\\"Nine\\\",\\n 10: \\\"Ten\\\",\\n 11: \\\"Eleven\\\",\\n 12: \\\"Twelve\\\",\\n 13: \\\"Thirteen\\\",\\n 14: \\\"Fourteen\\\",\\n 15: \\\"Fifteen\\\",\\n 16: \\\"Sixteen\\\",\\n 17: \\\"Seventeen\\\",\\n 18: \\\"Eighteen\\\",\\n 19: \\\"Nineteen\\\",\\n 20: \\\"Twenty\\\",\\n 30: \\\"Thirty\\\",\\n 40: \\\"Forty\\\",\\n 50: \\\"Fifty\\\",\\n 60: \\\"Sixty\\\",\\n 70: \\\"Seventy\\\",\\n 80: \\\"Eighty\\\",\\n 90: \\\"Ninety\\\",\\n 100: \\\"Hundred\\\",\\n 1000: \\\"Thousand\\\",\\n 1000000: \\\"Million\\\",\\n 1000000000: \\\"Billion\\\"\\n }\\n\\n divisors = [1000000000, 1000000, 1000, 100]\\n for divisor in divisors:\\n multiples = num // divisor\\n if multiples > 0:\\n ret.extend(self.numberToWords(multiples).split(\\\" \\\"))\\n ret.append(numToEnglish[divisor])\\n num -= (multiples * divisor)\\n \\n # focus on tens\\n ten_multiples = num // 10\\n if ten_multiples > 1:\\n ret.append(numToEnglish[ten_multiples * 10])\\n num -= (ten_multiples * 10)\\n \\n # focus on ones\\n if num > 0:\\n ret.append(numToEnglish[num])\\n \\n return \\\" \\\".join(ret)\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n first20=['Zero','One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine', 'Ten', 'Eleven', 'Twelve', 'Thirteen', 'Fourteen', 'Fifteen', 'Sixteen', 'Seventeen', 'Eighteen', 'Nineteen']\\n tens=[\\\"Zero\\\",\\\"Ten\\\",\\\"Twenty\\\",\\\"Thirty\\\",\\\"Forty\\\",\\\"Fifty\\\",\\\"Sixty\\\",\\\"Seventy\\\",\\\"Eighty\\\",\\\"Ninety\\\"]\\n def numberToWords(self, num: int) -> str:\\n if num==0:return 'Zero'\\n x=[]\\n if num<1000:\\n if num//100!=0:\\n x.append(self.first20[(num//100)%10]+\\\" Hundred\\\")\\n num%=100\\n if num>19:\\n x.append(self.tens[(num//10)%10])\\n num%=10\\n if num==0:\\n pass\\n else:\\n x.append(self.first20[num])\\n elif num<10**6:\\n x=[self.numberToWords((num//(10**3))%10**3)+\\\" Thousand\\\", self.numberToWords(num%(10**3))]\\n elif num<10**9:\\n x=[self.numberToWords((num//(10**6))%10**6)+\\\" Million\\\", self.numberToWords((num%(10**6)))]\\n elif num<10**12:\\n x=[self.numberToWords((num//(10**9))%10**9)+\\\" Billion\\\", self.numberToWords((num%(10**9)))]\\n return \\\" \\\".join(filter(lambda x:x!='Zero', x))\\n\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n \\n # Define arrays for words representing numbers\\n below_twenty = ['Zero', 'One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine', 'Ten', 'Eleven', 'Twelve', 'Thirteen', 'Fourteen', 'Fifteen', 'Sixteen', 'Seventeen', 'Eighteen', 'Nineteen']\\n tens = ['', '', 'Twenty', 'Thirty', 'Forty', 'Fifty', 'Sixty', 'Seventy', 'Eighty', 'Ninety']\\n thousands = ['', 'Thousand', 'Million', 'Billion']\\n \\n def calculate(num):\\n if num == 0:\\n return ''\\n elif num < 20:\\n return below_twenty[num] + ' '\\n elif num < 100:\\n return tens[num // 10] + ' ' + calculate(num % 10)\\n else:\\n return below_twenty[num // 100] + ' Hundred ' + calculate(num % 100)\\n \\n if num == 0:\\n return 'Zero'\\n \\n result = ''\\n i = 0\\n \\n while num > 0:\\n if num % 1000 != 0:\\n result = calculate(num % 1000) + thousands[i] + ' ' + result\\n num //= 1000\\n i += 1\\n \\n return result.strip()\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n # Arrays to store words for numbers less than 10, 20, and 100\\n below_ten = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\n below_twenty = [\\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n below_hundred = [\\\"\\\", \\\"Ten\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n\\n # Main function to convert a number to English words\\n def numberToWords(self, num: int) -> str:\\n # Handle the special case where the number is zero\\n if num == 0:\\n return \\\"Zero\\\"\\n # Call the helper function to start the conversion\\n return self._convert_to_words(num)\\n\\n # Recursive function to convert numbers to words\\n # Handles numbers based on their ranges: <10, <20, <100, <1000, <1000000, <1000000000, and >=1000000000\\n def _convert_to_words(self, num: int) -> str:\\n if num < 10:\\n return self.below_ten[num]\\n if num < 20:\\n return self.below_twenty[num - 10]\\n if num < 100:\\n return self.below_hundred[num // 10] + (\\\" \\\" + self._convert_to_words(num % 10) if num % 10 != 0 else \\\"\\\")\\n if num < 1000:\\n return self._convert_to_words(num // 100) + \\\" Hundred\\\" + (\\\" \\\" + self._convert_to_words(num % 100) if num % 100 != 0 else \\\"\\\")\\n if num < 1000000:\\n return self._convert_to_words(num // 1000) + \\\" Thousand\\\" + (\\\" \\\" + self._convert_to_words(num % 1000) if num % 1000 != 0 else \\\"\\\")\\n if num < 1000000000:\\n return self._convert_to_words(num // 1000000) + \\\" Million\\\" + (\\\" \\\" + self._convert_to_words(num % 1000000) if num % 1000000 != 0 else \\\"\\\")\\n return self._convert_to_words(num // 1000000000) + \\\" Billion\\\" + (\\\" \\\" + self._convert_to_words(num % 1000000000) if num % 1000000000 != 0 else \\\"\\\")\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n # Python3: Dictionaries are ordered by insertion\\n wordMap = {\\n 1000000000: \\\"Billion\\\", 1000000: \\\"Million\\\", 1000: \\\"Thousand\\\",\\n 100: \\\"Hundred\\\", 90: \\\"Ninety\\\", 80: \\\"Eighty\\\", 70: \\\"Seventy\\\",\\n 60: \\\"Sixty\\\", 50: \\\"Fifty\\\", 40: \\\"Forty\\\", 30: \\\"Thirty\\\",\\n 20: \\\"Twenty\\\", 19: \\\"Nineteen\\\", 18: \\\"Eighteen\\\", 17: \\\"Seventeen\\\",\\n 16: \\\"Sixteen\\\", 15: \\\"Fifteen\\\", 14: \\\"Fourteen\\\", 13: \\\"Thirteen\\\",\\n 12: \\\"Twelve\\\", 11: \\\"Eleven\\\", 10: \\\"Ten\\\", 9: \\\"Nine\\\", 8: \\\"Eight\\\",\\n 7: \\\"Seven\\\", 6: \\\"Six\\\", 5: \\\"Five\\\", 4: \\\"Four\\\", 3: \\\"Three\\\",\\n 2: \\\"Two\\\", 1: \\\"One\\\"\\n }\\n\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n for denomination in self.wordMap.keys():\\n if num >= denomination:\\n # Get prefix\\n prefix = \\\"\\\"\\n if num >= 100:\\n prefix = self.numberToWords(num // denomination) + \\\" \\\"\\n\\n # Get current unit\\n unit = self.wordMap[denomination]\\n\\n # Get suffix, aka from the remainder\\n suffix = \\\"\\\"\\n if num % denomination > 0:\\n suffix = \\\" \\\" + self.numberToWords(num % denomination)\\n\\n return prefix + unit + suffix\\n\\n return \\\"\\\"\\n\\n # lessThan20Map = { 0: \\\"\\\", 1: \\\"One\\\", 2: \\\"Two\\\", 3: \\\"Three\\\", 4: \\\"Four\\\", 5: \\\"Five\\\",\\n # 6: \\\"Six\\\", 7: \\\"Seven\\\", 8: \\\"Eight\\\", 9: \\\"Nine\\\", 10: \\\"Ten\\\",\\n # 11: \\\"Eleven\\\" , 12: \\\"Twelve\\\", 13: \\\"Thirteen\\\", 14: \\\"Fourteen\\\",\\n # 15: \\\"Fifteen\\\", 16: \\\"Sixteen\\\", 17: \\\"Seventeen\\\", 18: \\\"Eighteen\\\",\\n # 19: \\\"Nineteen\\\"}\\n # tensMap = { 0: \\\"\\\", 1: \\\"Ten\\\", 2: \\\"Twenty\\\", 3: \\\"Thirty\\\", 4: \\\"Forty\\\", 5: \\\"Fifty\\\",\\n # 6: \\\"Sixty\\\", 7: \\\"Seventy\\\", 8: \\\"Eighty\\\", 9: \\\"Ninety\\\"}\\n # thousandsMap = { 0: \\\"\\\", 1: \\\"Thousand\\\", 2: \\\"Million\\\", 3: \\\"Billion\\\" }\\n\\n # def getWords(n):\\n # if n == 0:\\n # return \\\"\\\"\\n # elif n < 20:\\n # return [lessThan20Map[n]]\\n # elif n < 100:\\n # return [tensMap[n // 10]] + getWords(n % 10)\\n # else:\\n # return [lessThan20Map[n // 100], \\\"Hundred\\\"] + getWords(n % 100)\\n\\n # i = 0\\n # res = []\\n # while num > 0:\\n # if num % 1000 != 0:\\n # res = getWords(num % 1000) + [thousandsMap[i]] + res\\n # num = num // 1000\\n # i += 1\\n\\n # return \\\" \\\".join(res).strip()\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n '''\\n things I will notice:\\n output is a string\\n input is a number\\n\\n two digits are our pattern: they can be broken into \\n 1 - 19\\n 20-30-40-50...90\\n\\n keep track of prefixes\\n\\n i want to process numbers in 3's and I want to skip anything with 0's basically\\n '''\\n if num == 0: return \\\"Zero\\\"\\n\\n teens = {1:'One', 2:'Two', 3:'Three', 4:'Four', 5:'Five',6:'Six', 7:'Seven', 8:'Eight', 9:'Nine', 10:'Ten', 11:'Eleven', 12:'Twelve', 13:'Thirteen', 14:'Fourteen', 15:'Fifteen', 16:'Sixteen', 17:'Seventeen', 18:'Eighteen', 19:'Nineteen'}\\n\\n tens = {20:'Twenty', 30:'Thirty', 40:'Forty', 50:'Fifty', 60:'Sixty', 70:'Seventy', 80:'Eighty', 90:'Ninety'}\\n\\n postfix = ['', ' Thousand', ' Million', ' Billion']\\n\\n def processNum(n):\\n tmp = []\\n if n != 0 and n <= 99:\\n if n in teens: return [teens[n]]\\n if n in tens: return [tens[n]]\\n \\n d = n % 10\\n n = n - d\\n\\n tmp.append(tens[n] + ' ' + teens[d])\\n return tmp\\n\\n elif n != 0 and n > 99:\\n twos = n % 100\\n twos = processNum(twos)\\n n = n // 100\\n if twos != ['']:\\n tmp = [teens[n] + ' Hundred'] + twos\\n else:\\n tmp = [teens[n] + ' Hundred']\\n \\n return tmp\\n return ['']\\n\\n res = []\\n i = 0\\n while num:\\n digits = num % 1000\\n num = num // 1000\\n\\n digits = processNum(digits)\\n\\n \\n if digits != ['']:\\n res = [' '.join(digits) + postfix[i]] + res\\n i += 1\\n \\n return ' ' .join(res)\\n\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n ones_map = {\\n 1: \\\"One\\\",\\n 2: \\\"Two\\\",\\n 3: \\\"Three\\\",\\n 4: \\\"Four\\\",\\n 5: \\\"Five\\\",\\n 6: \\\"Six\\\",\\n 7: \\\"Seven\\\",\\n 8: \\\"Eight\\\",\\n 9: \\\"Nine\\\",\\n 10: \\\"Ten\\\",\\n 11: \\\"Eleven\\\",\\n 12: \\\"Twelve\\\",\\n 13: \\\"Thirteen\\\",\\n 14: \\\"Fourteen\\\",\\n 15: \\\"Fifteen\\\",\\n 16: \\\"Sixteen\\\",\\n 17: \\\"Seventeen\\\",\\n 18: \\\"Eighteen\\\",\\n 19: \\\"Nineteen\\\",\\n }\\n tens_map = {\\n 20: \\\"Twenty\\\",\\n 30: \\\"Thirty\\\",\\n 40: \\\"Forty\\\",\\n 50: \\\"Fifty\\\",\\n 60: \\\"Sixty\\\",\\n 70: \\\"Seventy\\\",\\n 80: \\\"Eighty\\\",\\n 90: \\\"Ninety\\\",\\n }\\n\\n def get_words(digits):\\n words = []\\n # hundred\\n hundred_digit = digits // 100\\n if hundred_digit:\\n words += [ones_map[hundred_digit], \\\"Hundred\\\"]\\n \\n rest_two = digits % 100\\n if rest_two >= 20:\\n ten_digit = rest_two // 10\\n single_digit = rest_two % 10\\n if ten_digit:\\n words += [tens_map[ten_digit * 10]]\\n if single_digit:\\n words += [ones_map[single_digit]]\\n else:\\n if rest_two:\\n words += [ones_map[rest_two]]\\n \\n return words\\n\\n\\n postfix = [\\\"\\\", \\\"Thousand\\\", \\\"Million\\\", \\\"Billion\\\"]\\n res = []\\n i = 0\\n while num:\\n digits = num % 1000\\n words = get_words(digits)\\n print(words)\\n if postfix[i]:\\n if words:\\n res = words + [postfix[i]] + res\\n else:\\n if words:\\n res = words + res\\n num = num // 1000\\n i += 1\\n return \\\" \\\".join(res)\\n\\n\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n \\n d = {1: \\\"One\\\", 2: \\\"Two\\\", 3: \\\"Three\\\", 4: \\\"Four\\\", 5: \\\"Five\\\", 6: \\\"Six\\\", 7: \\\"Seven\\\", 8: \\\"Eight\\\", 9: \\\"Nine\\\",\\n 10: \\\"Ten\\\", 11: \\\"Eleven\\\", 12: \\\"Twelve\\\", 13: \\\"Thirteen\\\", 14: \\\"Fourteen\\\", 15: \\\"Fifteen\\\", 16: \\\"Sixteen\\\",\\n 17: \\\"Seventeen\\\", 18: \\\"Eighteen\\\", 19: \\\"Nineteen\\\", 20: \\\"Twenty\\\", 30: \\\"Thirty\\\", 40: \\\"Forty\\\", 50: \\\"Fifty\\\",\\n 60: \\\"Sixty\\\", 70: \\\"Seventy\\\", 80: \\\"Eighty\\\", 90: \\\"Ninety\\\"}\\n \\n def belowThousand(n):\\n if n == 0:\\n return \\\"\\\"\\n elif n < 20:\\n return d[n] + \\\" \\\"\\n elif n < 100:\\n return d[n // 10 * 10] + \\\" \\\" + belowThousand(n % 10)\\n else:\\n return d[n // 100] + \\\" Hundred \\\" + belowThousand(n % 100)\\n \\n def helper(n):\\n if n >= 1000000000:\\n return belowThousand(n // 1000000000) + \\\"Billion \\\" + helper(n % 1000000000)\\n elif n >= 1000000:\\n return belowThousand(n // 1000000) + \\\"Million \\\" + helper(n % 1000000)\\n elif n >= 1000:\\n return belowThousand(n // 1000) + \\\"Thousand \\\" + helper(n % 1000)\\n else:\\n return belowThousand(n)\\n \\n return helper(num).strip()\\n\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.number_to_words_map = {\\n 1000000000: \\\"Billion\\\", 1000000: \\\"Million\\\", 1000: \\\"Thousand\\\",\\n 100: \\\"Hundred\\\", 90: \\\"Ninety\\\", 80: \\\"Eighty\\\", 70: \\\"Seventy\\\",\\n 60: \\\"Sixty\\\", 50: \\\"Fifty\\\", 40: \\\"Forty\\\", 30: \\\"Thirty\\\",\\n 20: \\\"Twenty\\\", 19: \\\"Nineteen\\\", 18: \\\"Eighteen\\\", 17: \\\"Seventeen\\\",\\n 16: \\\"Sixteen\\\", 15: \\\"Fifteen\\\", 14: \\\"Fourteen\\\", 13: \\\"Thirteen\\\",\\n 12: \\\"Twelve\\\", 11: \\\"Eleven\\\", 10: \\\"Ten\\\", 9: \\\"Nine\\\", 8: \\\"Eight\\\",\\n 7: \\\"Seven\\\", 6: \\\"Six\\\", 5: \\\"Five\\\", 4: \\\"Four\\\", 3: \\\"Three\\\",\\n 2: \\\"Two\\\", 1: \\\"One\\\"\\n }\\n\\n def numberToWords(self, num: int) -> str:\\n if num == 0 :\\n return \\\"Zero\\\"\\n \\n for value, word in self.number_to_words_map.items():\\n if num>= value:\\n prefix = (self.numberToWords(num//value) + \\\" \\\") if num>=100 else \\\"\\\"\\n\\n unit = word\\n\\n suffix = (\\\" \\\" + self.numberToWords(num%value)) if num%value > 0 else \\\"\\\"\\n return prefix + unit + suffix\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n result = \\\"\\\"\\n\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n big_nums = [\\\"\\\", \\\"Thousand\\\", \\\"Million\\\", \\\"Billion\\\"]\\n\\n for big in big_nums:\\n if num > 0 and num % 1000 > 0:\\n result = self.helper(num % 1000) + big + \\\" \\\" + result\\n\\n num //= 1000\\n \\n return result.strip()\\n\\n def helper(self, num: int) -> str:\\n digit = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\n teen = [\\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n tens = [\\\"\\\", \\\"\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n result = \\\"\\\"\\n\\n if num > 99:\\n result += digit[num // 100] + \\\" Hundred \\\"\\n num %= 100\\n \\n if num > 9:\\n if num < 20:\\n result += teen[num % 10] + \\\" \\\"\\n num = 0\\n else:\\n result += tens[num // 10] + \\\" \\\"\\n num %= 10\\n\\n if num > 0:\\n result += digit[num] + \\\" \\\"\\n\\n return result\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def ones(self, num: str) -> str:\\n assert len(num) == 1\\n if int(num) == 0:\\n return \\\"\\\"\\n words = {\\n str(i + 1): w\\n for i, w in enumerate(\\n [\\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\n )\\n }\\n return words[num]\\n\\n def teens(self, num: str) -> str:\\n assert len(num) == 2\\n value = int(num)\\n assert 9 < value < 20\\n words = {\\n str(i + 10): w\\n for i, w in enumerate(\\n [\\n \\\"Ten\\\",\\n \\\"Eleven\\\",\\n \\\"Twelve\\\",\\n \\\"Thirteen\\\",\\n \\\"Fourteen\\\",\\n \\\"Fifteen\\\",\\n \\\"Sixteen\\\",\\n \\\"Seventeen\\\",\\n \\\"Eighteen\\\",\\n \\\"Nineteen\\\",\\n ]\\n )\\n }\\n return words[num]\\n\\n def tens(self, num: str) -> str:\\n assert len(num) == 2\\n value = int(num)\\n if value == 0:\\n return \\\"\\\"\\n assert value < 100\\n words = {\\n str(i + 2): w\\n for i, w in enumerate(\\n [\\n \\\"Twenty\\\",\\n \\\"Thirty\\\",\\n \\\"Forty\\\",\\n \\\"Fifty\\\",\\n \\\"Sixty\\\",\\n \\\"Seventy\\\",\\n \\\"Eighty\\\",\\n \\\"Ninety\\\",\\n ]\\n )\\n }\\n if value < 10:\\n return self.ones(num[1])\\n elif value < 20:\\n return self.teens(num)\\n elif value < 100:\\n return f\\\"{words[num[0]]} {self.ones(num[1])}\\\".strip()\\n return \\\"\\\"\\n\\n def hundreds(self, num: str) -> str:\\n assert len(num) == 3\\n value = int(num)\\n if value == 0:\\n return \\\"\\\"\\n assert value < 1000\\n if value < 100:\\n return self.tens(num[1:3])\\n elif value < 1000:\\n return f\\\"{self.ones(num[0])} Hundred {self.tens(num[1:3])}\\\".strip()\\n\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return 'Zero'\\n digits = str(num)\\n in_words = self.hundreds(f\\\"{digits[-3:]:0>3}\\\")\\n if digits[-6:-3] and int(digits[-6:-3]) > 0:\\n in_words = f\\\"{self.hundreds(f'{digits[-6:-3]:0>3}')} Thousand {in_words}\\\".strip()\\n if digits[-9:-6] and int(digits[-9:-6]) > 0:\\n in_words = f\\\"{self.hundreds(f'{digits[-9:-6]:0>3}')} Million {in_words}\\\".strip()\\n if digits[-12:-9] and int(digits[-12:-9]) > 0:\\n in_words = f\\\"{self.hundreds(f'{digits[-12:-9]:0>3}')} Billion {in_words}\\\".strip()\\n return in_words\\n\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"singles = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\n \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\nteens = [\\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\n \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\ntens = [\\\"\\\", \\\"Ten\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\n \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\nthousands = [\\\"\\\", \\\"Thousand\\\", \\\"Million\\\", \\\"Billion\\\"]\\n\\nclass Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n def toEnglish(num: int) -> str:\\n s = \\\"\\\"\\n if num >= 100:\\n s += singles[num // 100] + \\\" Hundred \\\"\\n num %= 100\\n if num >= 20:\\n s += tens[num // 10] + \\\" \\\"\\n num %= 10\\n if 0 < num < 10:\\n s += singles[num] + \\\" \\\"\\n elif num >= 10:\\n s += teens[num - 10] + \\\" \\\"\\n return s\\n\\n s = \\\"\\\"\\n unit = int(1e9)\\n for i in range(3, -1, -1):\\n curNum = num // unit\\n if curNum:\\n num -= curNum * unit\\n s += toEnglish(curNum) + thousands[i] + \\\" \\\"\\n unit //= 1000\\n return s.strip()\\n \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n info1={1: 'One', 2: 'Two', 3: 'Three', 4: 'Four', \\n 5: 'Five', 6: 'Six', 7: 'Seven', 8: 'Eight', 9: 'Nine'}\\n info2={10: 'Ten', 11: 'Eleven', 12: 'Twelve', 13: 'Thirteen',\\n 14: 'Fourteen', 15: 'Fifteen', 16: 'Sixteen', 17: 'Seventeen',\\n 18: 'Eighteen', 19: 'Nineteen'}\\n info3={2: 'Twenty', 3: 'Thirty', 4: 'Forty', 5: 'Fifty',\\n 6: 'Sixty', 7: 'Seventy', 8: 'Eighty', 9: 'Ninety'}\\n order=['', 'Thousand', 'Million', 'Billion']\\n \\n def process2(num):\\n if num>=100:\\n return None\\n if num==0:\\n return \\\"\\\"\\n if num<10:\\n return info1[num]\\n if num<20:\\n return info2[num]\\n res=[info3[num//10]]\\n if num%10:\\n res.append(info1[num%10])\\n return ' '.join(res)\\n \\n def process3(num):\\n if num>=1000:\\n return None\\n res=[]\\n if num//100>0:\\n res.append(info1[num//100])\\n res.append('Hundred')\\n tp=process2(num%100)\\n if tp:\\n res.append(tp)\\n return ' '.join(res)\\n \\n if num==0:\\n return 'Zero'\\n res=[]\\n for k in range(4):\\n cur=process3(num%1000)\\n tp_res=[]\\n if cur:\\n tp_res.append(cur)\\n if order[k]:\\n tp_res.append(order[k])\\n tp_res=' '.join(tp_res)\\n if tp_res:\\n res.append(tp_res)\\n num=num//1000\\n if num==0:\\n break\\n return ' '.join(res[::-1])\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n number_map = {\\n 1: \\\"One\\\", 2: \\\"Two\\\", 3: \\\"Three\\\", 4: \\\"Four\\\", 5: \\\"Five\\\", 6: \\\"Six\\\", \\n 7: \\\"Seven\\\", 8: \\\"Eight\\\", 9: \\\"Nine\\\", 10: \\\"Ten\\\", 11: \\\"Eleven\\\", 12: \\\"Twelve\\\", \\n 13: \\\"Thirteen\\\", 14: \\\"Fourteen\\\", 15: \\\"Fifteen\\\", 16: \\\"Sixteen\\\", 17: \\\"Seventeen\\\", \\n 18: \\\"Eighteen\\\", 19: \\\"Nineteen\\\", 20: \\\"Twenty\\\", 30: \\\"Thirty\\\", 40: \\\"Forty\\\", \\n 50: \\\"Fifty\\\", 60: \\\"Sixty\\\", 70: \\\"Seventy\\\", 80: \\\"Eighty\\\", 90: \\\"Ninety\\\"\\n }\\n\\n # Helper function to convert numbers below 1000\\n def helper(n):\\n if n == 0:\\n return \\\"\\\"\\n elif n < 20:\\n return number_map[n] + \\\" \\\"\\n elif n < 100:\\n return number_map[n // 10 * 10] + \\\" \\\" + helper(n % 10)\\n else:\\n return number_map[n // 100] + \\\" Hundred \\\" + helper(n % 100)\\n\\n billion = num // 1_000_000_000\\n million = (num // 1_000_000) % 1_000\\n thousand = (num // 1_000) % 1_000\\n remainder = num % 1_000\\n\\n result = \\\"\\\"\\n if billion:\\n result += helper(billion) + \\\"Billion \\\"\\n if million:\\n result += helper(million) + \\\"Million \\\"\\n if thousand:\\n result += helper(thousand) + \\\"Thousand \\\"\\n if remainder:\\n result += helper(remainder)\\n\\n return result.strip()\\n\\n# Example Usage:\\nsolution = Solution()\\nprint(solution.numberToWords(1234567891)) # Output: \\\"One Billion Two Hundred Thirty Four Million Five Hundred Sixty Seven Thousand Eight Hundred Ninety One\\\"\\n\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n ones_map = {\\n 1: \\\"One\\\",\\n 2: \\\"Two\\\",\\n 3: \\\"Three\\\",\\n 4: \\\"Four\\\",\\n 5: \\\"Five\\\",\\n 6: \\\"Six\\\",\\n 7: \\\"Seven\\\",\\n 8: \\\"Eight\\\",\\n 9: \\\"Nine\\\",\\n 10: \\\"Ten\\\",\\n 11: \\\"Eleven\\\",\\n 12: \\\"Twelve\\\",\\n 13: \\\"Thirteen\\\",\\n 14: \\\"Fourteen\\\",\\n 15: \\\"Fifteen\\\",\\n 16: \\\"Sixteen\\\",\\n 17: \\\"Seventeen\\\",\\n 18: \\\"Eighteen\\\",\\n 19: \\\"Nineteen\\\",\\n }\\n tens_map = {\\n 20: \\\"Twenty\\\",\\n 30: \\\"Thirty\\\",\\n 40: \\\"Forty\\\",\\n 50: \\\"Fifty\\\",\\n 60: \\\"Sixty\\\",\\n 70: \\\"Seventy\\\",\\n 80: \\\"Eighty\\\",\\n 90: \\\"Ninety\\\",\\n }\\n def get_words(digits):\\n words = []\\n # 123, 103, 012, 120\\n hundred_check = digits // 100\\n if hundred_check:\\n words += [ones_map[hundred_check], \\\"Hundred\\\"]\\n last_two = digits % 100\\n if last_two >= 20:\\n second_digit = last_two // 10\\n third_digit = last_two % 10\\n if second_digit:\\n words += [tens_map[second_digit * 10]]\\n if third_digit:\\n words += [ones_map[third_digit]]\\n else:\\n if last_two:\\n words += [ones_map[last_two]]\\n print(digits)\\n print(words)\\n return words\\n\\n # 2,123,456,789\\n postfix = [\\\"\\\", \\\"Thousand\\\", \\\"Million\\\", \\\"Billion\\\"]\\n i = 0\\n res = []\\n while num:\\n digits = num % 1000\\n if postfix[i]:\\n words = get_words(digits)\\n if words:\\n words += [postfix[i]]\\n else:\\n words = get_words(digits)\\n res = words + res\\n num //= 1000\\n i += 1\\n \\n return \\\" \\\".join(res)\\n\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n info1={1: 'One', 2: 'Two', 3: \\\"Three\\\", 4: 'Four',\\n 5: 'Five', 6: 'Six', 7: 'Seven', 8: 'Eight', \\n 9: 'Nine'}\\n info2={10: 'Ten', 11: 'Eleven', 12: 'Twelve', 13: 'Thirteen',\\n 14: 'Fourteen', 15: 'Fifteen', 16: 'Sixteen',\\n 17: 'Seventeen', 18: 'Eighteen', 19: 'Nineteen'}\\n info3={2: 'Twenty', 3: 'Thirty', 4: 'Forty', 5: 'Fifty', 6: 'Sixty',\\n 7: 'Seventy', 8: 'Eighty', 9: 'Ninety'}\\n \\n order = ['', 'Thousand', 'Million', 'Billion']\\n if num==0:\\n return 'Zero'\\n \\n def process2(it):\\n if it>=100:\\n return None\\n if it==0:\\n return \\\"\\\"\\n if it<10:\\n return info1[it]\\n if it<20:\\n return info2[it]\\n a, b=it//10, it%10\\n res=[info3[a]]\\n if b!=0:\\n res.append(info1[b])\\n return ' '.join(res)\\n \\n def process3(it):\\n if it>=1000:\\n return None\\n a, b=it//100, it%100\\n res=[]\\n if a>0:\\n res.append(info1[a])\\n res.append('Hundred')\\n tp=process2(b)\\n if tp:\\n res.append(tp)\\n return ' '.join(res)\\n \\n ans=[]\\n for k in range(4):\\n tp=process3(num%1000)\\n tp_res=[]\\n if tp:\\n tp_res.append(tp)\\n if order[k]:\\n tp_res.append(order[k])\\n tp_res=' '.join(tp_res)\\n if tp_res:\\n ans.append(tp_res)\\n num=num//1000\\n if num==0:\\n break\\n return ' '.join(ans[::-1])\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n \\n # Define English words for various number ranges\\n below_20 = ['','One','Two','Three','Four','Five','Six','Seven','Eight','Nine','Ten',\\n 'Eleven','Twelve','Thirteen','Fourteen','Fifteen','Sixteen','Seventeen',\\n 'Eighteen','Nineteen']\\n tens = ['', '', 'Twenty', 'Thirty', 'Forty', 'Fifty', 'Sixty', 'Seventy', 'Eighty', 'Ninety']\\n thousands = ['', 'Thousand', 'Million', 'Billion']\\n \\n # Helper function to convert numbers < 1000 to words\\n def helper(n):\\n if n == 0:\\n return ''\\n elif n < 20:\\n return below_20[n] + ' '\\n elif n < 100:\\n return tens[n // 10] + ' ' + helper(n % 10)\\n else:\\n return below_20[n // 100] + ' Hundred ' + helper(n % 100)\\n \\n # Convert the number to words by processing each thousand-segment\\n res = ''\\n for i, word in enumerate(thousands):\\n if num % 1000 != 0:\\n res = helper(num % 1000) + word + ' ' + res\\n num //= 1000\\n \\n return res.strip()\\n\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n ones = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\n tens = [\\\"\\\", \\\"Ten\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n teens = [\\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n suffixes = [\\\"\\\", \\\"Thousand\\\", \\\"Million\\\", \\\"Billion\\\", \\\"Trillion\\\", \\\"Quadrillion\\\", \\\"Quintillion\\\", \\\"Sextillion\\\", \\\"Septillion\\\", \\\"Octillion\\\", \\\"Nonillion\\\", \\\"Decillion\\\"]\\n words = []\\n i = 0\\n while num > 0:\\n triplet = num % 1000\\n num = num // 1000\\n if triplet == 0:\\n i += 1\\n continue\\n temp = []\\n if triplet // 100 > 0:\\n temp.append(ones[triplet // 100])\\n temp.append(\\\"Hundred\\\")\\n if triplet % 100 >= 10 and triplet % 100 <= 19:\\n temp.append(teens[triplet % 10])\\n else:\\n if triplet % 100 >= 20:\\n temp.append(tens[triplet % 100 // 10])\\n if triplet % 10 > 0:\\n temp.append(ones[triplet % 10])\\n if i > 0:\\n temp.append(suffixes[i])\\n words = temp + words\\n i += 1\\n return \\\" \\\".join(words)\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n\\n if num == 0:\\n return \\\"Zero\\\"\\n res = []\\n if num >= 10**9:\\n three, num = num // 10**9, num % 10**9\\n res += [self._convert_three(three), \\\"Billion\\\"]\\n if num >= 10**6:\\n three, num = num // 10**6, num % 10**6\\n res += [self._convert_three(three), \\\"Million\\\"]\\n if num >= 10**3:\\n three, num = num // 10**3, num % 10**3\\n res += [self._convert_three(three), \\\"Thousand\\\"]\\n res += [self._convert_three(num)]\\n return \\\" \\\".join(word for word in res if word != \\\"\\\")\\n\\n \\n def _convert_three(self, num: int) -> str:\\n below_ten = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\n below_twenty = [\\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n below_hundred = [\\\"\\\", \\\"Ten\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n res = []\\n if num >= 10**2:\\n one, num = num // 10**2, num % 10**2\\n res += [below_ten[one], \\\"Hundred\\\"]\\n if num >= 20:\\n one, num = num // 10, num % 10\\n res += [below_hundred[one]]\\n if num >= 10:\\n res += [below_twenty[num-10]]\\n num = 0\\n if num > 0:\\n res += [below_ten[num]]\\n return \\\" \\\".join(res)\\n \\n\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return 'Zero'\\n nums = {0: '', 1: 'One', 2: 'Two', 3: 'Three', 4: 'Four', 5: 'Five', 6: 'Six', 7: 'Seven', 8: 'Eight', 9: 'Nine'}\\n decs = {2: 'Twenty', 3: 'Thirty', 4: 'Forty', 5: 'Fifty', 6: 'Sixty', 7: 'Seventy', 8: 'Eighty', 9: 'Ninety'}\\n tens = {0: 'Ten', 1:'Eleven', 2: 'Twelve', 3: 'Thirteen', 4: 'Fourteen', 5: 'Fifteen', 6: 'Sixteen', 7: 'Seventeen', 8: 'Eighteen', 9: 'Nineteen'}\\n # Function to convert numbers < 1000 to words\\n def hundreds(x):\\n res = []\\n h = x // 100\\n x %= 100\\n if h > 0:\\n res.append(nums[h])\\n res.append('Hundred')\\n d = x // 10\\n x %= 10\\n if d > 1:\\n res.append(decs[d])\\n res.append(nums[x])\\n elif d == 1:\\n res.append(tens[x])\\n else:\\n res.append(nums[x])\\n return res\\n\\n # Main conversion function\\n def convert_chunk(num, unit):\\n if num:\\n res.extend(hundreds(num))\\n if unit:\\n res.append(unit)\\n\\n # Initialize result list\\n res = []\\n\\n # Break the number into billions, millions, thousands, and the rest\\n convert_chunk(num // 1000000000, 'Billion')\\n num %= 1000000000\\n convert_chunk(num // 1000000, 'Million')\\n num %= 1000000\\n convert_chunk(num // 1000, 'Thousand')\\n num %= 1000\\n convert_chunk(num, '')\\n\\n return ' '.join([i for i in res if i])\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n ones = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\n tens = [\\\"\\\", \\\"Ten\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n teens = [\\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n suffixes = [\\\"\\\", \\\"Thousand\\\", \\\"Million\\\", \\\"Billion\\\"]\\n words = []\\n i = 0\\n while num > 0:\\n triplet = num % 1000\\n num = num // 1000\\n if triplet == 0:\\n i += 1\\n continue\\n temp = []\\n if triplet // 100 > 0:\\n temp.append(ones[triplet // 100])\\n temp.append(\\\"Hundred\\\")\\n if triplet % 100 >= 10 and triplet % 100 <= 19:\\n temp.append(teens[triplet % 10])\\n else:\\n if triplet % 100 >= 20:\\n temp.append(tens[triplet % 100 // 10])\\n if triplet % 10 > 0:\\n temp.append(ones[triplet % 10])\\n if i > 0:\\n temp.append(suffixes[i])\\n words = temp + words\\n i += 1\\n return \\\" \\\".join(words)\\n \\n\\n\\n \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n ones_map = {\\n 1 : \\\"One\\\",\\n 2 : \\\"Two\\\",\\n 3 : \\\"Three\\\",\\n 4 : \\\"Four\\\",\\n 5 : \\\"Five\\\",\\n 6 : \\\"Six\\\",\\n 7 : \\\"Seven\\\",\\n 8 : \\\"Eight\\\",\\n 9 : \\\"Nine\\\",\\n 10 : \\\"Ten\\\",\\n 11 : \\\"Eleven\\\",\\n 12 : \\\"Twelve\\\",\\n 13 : \\\"Thirteen\\\",\\n 14 : \\\"Fourteen\\\",\\n 15 : \\\"Fifteen\\\",\\n 16 : \\\"Sixteen\\\",\\n 17 : \\\"Seventeen\\\",\\n 18 : \\\"Eighteen\\\",\\n 19 : \\\"Nineteen\\\"\\n }\\n\\n twos_map = {\\n 20 : \\\"Twenty\\\",\\n 30 : \\\"Thirty\\\",\\n 40 : \\\"Forty\\\",\\n 50 : \\\"Fifty\\\",\\n 60 : \\\"Sixty\\\",\\n 70 : \\\"Seventy\\\",\\n 80 : \\\"Eighty\\\",\\n 90 : \\\"Ninety\\\"\\n }\\n\\n def get_string(n):\\n res = []\\n hund = n//100\\n if hund:\\n hundreds = (ones_map[hund] + \\\" Hundred\\\")\\n res.append(hundreds)\\n last_2 = n%100\\n if last_2>=20:\\n twos,ones = last_2//10,last_2%10\\n res.append(twos_map[twos*10])\\n if ones:\\n res.append(ones_map[ones])\\n elif last_2:\\n res.append(ones_map[last_2])\\n return \\\" \\\".join(res)\\n \\n\\n res = []\\n prefix = [\\\"\\\",\\\" Thousand\\\",\\\" Million\\\",\\\" Billion\\\"]\\n i=0\\n while num:\\n \\n dig = num%1000\\n s = get_string(dig)\\n if s:\\n res.append(s+prefix[i])\\n num//=1000\\n i+=1\\n res.reverse()\\n return \\\" \\\".join(res)\\n\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"singles = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\n \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\nteens = [\\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\n \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\ntens = [\\\"\\\", \\\"Ten\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\n \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\nthousands = [\\\"\\\", \\\"Thousand\\\", \\\"Million\\\", \\\"Billion\\\"]\\n\\nclass Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n def toEnglish(num: int) -> str:\\n s = \\\"\\\"\\n if num >= 100:\\n s += singles[num // 100] + \\\" Hundred \\\"\\n num %= 100\\n if num >= 20:\\n s += tens[num // 10] + \\\" \\\"\\n num %= 10\\n if 0 < num < 10:\\n s += singles[num] + \\\" \\\"\\n elif num >= 10:\\n s += teens[num - 10] + \\\" \\\"\\n return s\\n\\n s = \\\"\\\"\\n unit = int(1e9)\\n for i in range(3, -1, -1):\\n curNum = num // unit\\n if curNum:\\n num -= curNum * unit\\n s += toEnglish(curNum) + thousands[i] + \\\" \\\"\\n unit //= 1000\\n return s.strip()\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n \\n converter = {1:\\\"One\\\",2:'Two',3:'Three',4:'Four',5:'Five',6:'Six',7:'Seven', 8:\\\"Eight\\\", 9:'Nine',10:'Ten',11:\\\"Eleven\\\",12:'Twelve',13:'Thirteen',14:'Fourteen',15:'Fifteen',16:\\\"Sixteen\\\",17:'Seventeen',18:\\\"Eighteen\\\",19:\\\"Nineteen\\\",20:\\\"Twenty\\\",30:\\\"Thirty\\\",40:\\\"Forty\\\",50:\\\"Fifty\\\",60:\\\"Sixty\\\",70:\\\"Seventy\\\", 80:\\\"Eighty\\\",90:\\\"Ninety\\\"}\\n \\n def hundreds(number):\\n ans = []\\n if number >= 100:\\n hundreds_digit,number = divmod(number,100)\\n ans.append(converter[hundreds_digit])\\n ans.append(\\\"Hundred\\\")\\n if number > 20:\\n tens_digit,number = divmod(number,10)\\n ans.append(converter[tens_digit*10])\\n if number > 0:\\n ans.append(converter[number])\\n return \\\" \\\".join(ans)\\n sol = []\\n digit,num = divmod(num,10**9)\\n \\n if digit:\\n sol.append(hundreds(digit))\\n sol.append(\\\"Billion\\\")\\n \\n digit,num = divmod(num,10**6)\\n \\n if digit:\\n sol.append(hundreds(digit))\\n sol.append(\\\"Million\\\")\\n \\n digit,num = divmod(num,10**3)\\n \\n if digit:\\n sol.append(hundreds(digit))\\n sol.append(\\\"Thousand\\\")\\n if num:\\n sol.append(hundreds(num))\\n return \\\" \\\".join(sol)\\n \\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n\\n d = {\\n 0: \\\"Zero\\\",\\n 1: \\\"One\\\",\\n 2: \\\"Two\\\",\\n 3: \\\"Three\\\",\\n 4: \\\"Four\\\",\\n 5: \\\"Five\\\",\\n 6: \\\"Six\\\",\\n 7: \\\"Seven\\\",\\n 8: \\\"Eight\\\",\\n 9: \\\"Nine\\\",\\n 10: \\\"Ten\\\",\\n 11: \\\"Eleven\\\",\\n 12: \\\"Twelve\\\",\\n 13: \\\"Thirteen\\\",\\n 14: \\\"Fourteen\\\",\\n 15: \\\"Fifteen\\\",\\n 16: \\\"Sixteen\\\",\\n 17: \\\"Seventeen\\\",\\n 18: \\\"Eighteen\\\",\\n 19: \\\"Nineteen\\\",\\n 20: \\\"Twenty\\\",\\n 30: \\\"Thirty\\\",\\n 40: \\\"Forty\\\",\\n 50: \\\"Fifty\\\",\\n 60: \\\"Sixty\\\",\\n 70: \\\"Seventy\\\",\\n 80: \\\"Eighty\\\",\\n 90: \\\"Ninety\\\",\\n 100: \\\"Hundred\\\",\\n 1000: \\\"Thousand\\\",\\n 1000000: \\\"Million\\\",\\n 1000000000: \\\"Billion\\\"\\n }\\n \\n '''\\n Thousand, Million, Billion are outside of this scope.\\n We only need to handle numbers from zero to a hundred.\\n If in teens or 0, special case. Otherwise, follow a strict recursive formula\\n '''\\n def chunk(num):\\n og = num\\n assert(num >= 0 and num <= 999)\\n if num == 0:\\n return d[num] + \\\" \\\"\\n if num >= 10 and num <= 19:\\n return d[num] + \\\" \\\"\\n\\n hundreds = 0\\n tens = 0\\n ones = 0\\n res = \\\"\\\"\\n\\n if num > 0:\\n ones = num % 10\\n num //= 10\\n if num > 0:\\n tens = num % 10\\n num //= 10\\n if num > 0:\\n hundreds = num % 10\\n num //= 10\\n \\n if hundreds > 0:\\n res += d[hundreds] + \\\" Hundred \\\"\\n if tens > 0 or ones > 0:\\n snum = (tens * 10) + ones\\n if snum == 0 or (snum >= 10 and snum <= 19):\\n res += d[snum]\\n else:\\n if tens > 0:\\n res += d[tens * 10] + \\\" \\\"\\n if ones > 0:\\n res += d[ones] + \\\" \\\"\\n\\n return res\\n\\n if num <= 999:\\n return chunk(num).strip()\\n\\n res = \\\"\\\"\\n billions = 0\\n millions = 0\\n thousands = 0\\n rest = 0\\n\\n if num > 0:\\n rest = num % 1000\\n num //= 1000\\n if num > 0:\\n thousands = num % 1000\\n num //= 1000\\n if num > 0:\\n millions = num % 1000\\n num //= 1000\\n if num > 0:\\n billions = num % 1000\\n num //= 1000\\n \\n if billions > 0:\\n res += chunk(billions).strip() + \\\" Billion \\\"\\n if millions > 0:\\n res += chunk(millions).strip() + \\\" Million \\\"\\n if thousands > 0:\\n res += chunk(thousands).strip() + \\\" Thousand \\\"\\n if rest > 0:\\n res += chunk(rest)\\n\\n return res.strip()\\n\\n\\n \\n\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"ones = [\\n \\\"\\\",\\n \\\"One\\\",\\n \\\"Two\\\",\\n \\\"Three\\\",\\n \\\"Four\\\",\\n \\\"Five\\\",\\n \\\"Six\\\",\\n \\\"Seven\\\",\\n \\\"Eight\\\",\\n \\\"Nine\\\",\\n]\\nltwenty = [\\n \\\"Ten\\\",\\n \\\"Eleven\\\",\\n \\\"Twelve\\\",\\n \\\"Thirteen\\\",\\n \\\"Fourteen\\\",\\n \\\"Fifteen\\\",\\n \\\"Sixteen\\\",\\n \\\"Seventeen\\\",\\n \\\"Eighteen\\\",\\n \\\"Nineteen\\\",\\n]\\ntens = [\\n \\\"\\\",\\n \\\"Ten\\\",\\n \\\"Twenty\\\",\\n \\\"Thirty\\\",\\n \\\"Forty\\\",\\n \\\"Fifty\\\",\\n \\\"Sixty\\\",\\n \\\"Seventy\\\",\\n \\\"Eighty\\\",\\n \\\"Ninety\\\",\\n]\\n\\nclass Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n def convert_1000(num: int) -> list[str]:\\n assert 0 <= num <= 999\\n res = []\\n if num >= 100:\\n h = num // 100\\n res = [ones[h], \\\"Hundred\\\"]\\n num = num % 100\\n if 11 <= num <= 19:\\n res = res + [ltwenty[num-10]]\\n else:\\n t = num // 10\\n o = num % 10\\n res = res + [tens[t], ones[o]]\\n return res\\n\\n res = []\\n if n1k := num % 1000:\\n res = convert_1000(n1k) + res\\n num = num // 1000\\n if n1k := num % 1000:\\n res = convert_1000(n1k) + [\\\"Thousand\\\"] + res\\n num = num // 1000\\n if n1k := num % 1000:\\n res = convert_1000(n1k) + [\\\"Million\\\"] + res\\n num = num // 1000\\n if n1k := num % 1000:\\n res = convert_1000(n1k) + [\\\"Billion\\\"] + res\\n res = [s for s in res if s]\\n return \\\" \\\".join(res)\\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n d = {0: \\\"Zero\\\",\\n 1: \\\"One\\\",\\n 2: \\\"Two\\\",\\n 3: \\\"Three\\\",\\n 4: \\\"Four\\\",\\n 5: \\\"Five\\\",\\n 6: \\\"Six\\\",\\n 7: \\\"Seven\\\",\\n 8: \\\"Eight\\\",\\n 9: \\\"Nine\\\",\\n 10: \\\"Ten\\\",\\n 11: \\\"Eleven\\\",\\n 12: \\\"Twelve\\\",\\n 13: \\\"Thirteen\\\",\\n 14: \\\"Fourteen\\\",\\n 15: \\\"Fifteen\\\",\\n 16: \\\"Sixteen\\\",\\n 17: \\\"Seventeen\\\",\\n 18: \\\"Eighteen\\\",\\n 19: \\\"Nineteen\\\",\\n 20: \\\"Twenty\\\",\\n 30: \\\"Thirty\\\",\\n 40: \\\"Forty\\\",\\n 50: \\\"Fifty\\\",\\n 60: \\\"Sixty\\\",\\n 70: \\\"Seventy\\\",\\n 80: \\\"Eighty\\\",\\n 90: \\\"Ninety\\\",\\n 100: \\\"Hundred\\\",\\n 1000: \\\"Thousand\\\",\\n 1000000: \\\"Million\\\",\\n 1000000000: \\\"Billion\\\"\\n }\\n if num<21:\\n return d[num]\\n numDigits=math.floor(math.log10(num)+1)\\n currNum=num\\n res=\\\"\\\"\\n i=numDigits\\n while i>0:\\n \\n # print(currNum%(10**(i-1)))\\n # print(currNum//(10**(i-2)))\\n # print(10**(i-1))\\n #if i==1:\\n if currNum==0:\\n return res.strip()\\n numDigits=math.floor(math.log10(currNum)+1)\\n temp=currNum-currNum%(10**(numDigits-1))\\n if currNum<21 and currNum>0:\\n res+=d[currNum]\\n return res\\n \\n if numDigits<=2:\\n \\n res+=d[temp]\\n if numDigits>=2:\\n res+=\\\" \\\"\\n currNum=(currNum%(10**(numDigits-1)))\\n elif currNum//(10**(numDigits-1)) in d and numDigits>3 and 10**(numDigits-1) in d:\\n res+=d[currNum//(10**(numDigits-1))]+\\\" \\\"+d[(10**(numDigits-1))]+\\\" \\\" \\n currNum=(currNum%(10**(numDigits-1)))\\n #i-=1\\n elif numDigits>3:\\n if currNum//(10**(numDigits-2)) in d and (10**(numDigits-2)) in d:\\n res+=d[currNum//(10**(numDigits-2))]+\\\" \\\"+d[(10**(numDigits-2))]+\\\" \\\" \\n currNum=(currNum%(10**(numDigits-1)))%(10**(numDigits-2))\\n #i-=1\\n else:\\n numDigits-=(numDigits%3)\\n temp=currNum//(10**(numDigits))\\n if temp<10:\\n res+=d[currNum//(10**(numDigits-1))]+\\\" \\\"+d[100]+\\\" \\\"\\n currNum=(currNum%(10**(numDigits-1)))\\n if currNum==0 or math.floor(math.log10(currNum)+1)+2<numDigits:\\n res+=d[(10**(numDigits-3))]+\\\" \\\"\\n #i-=1\\n \\n else:\\n newDigits=math.floor(math.log10(temp)+1)\\n bleh=temp%(10**(newDigits-1))\\n temp=temp-bleh\\n res+=d[temp]+\\\" \\\"+d[bleh]+\\\" \\\"+d[(10**(numDigits))]+\\\" \\\"\\n currNum=(currNum%(10**(numDigits)))\\n \\n else: \\n res+=d[currNum//(10**(numDigits-1))]+\\\" \\\"+d[100]+\\\" \\\"\\n currNum=(currNum%(10**(numDigits-1)))\\n i-=1\\n return res\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n billion = pow(10, 9)\\n million = pow(10, 6)\\n thousand = pow(10, 3)\\n hundred = pow(10, 2)\\n remainder = -1\\n unique = ['One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine', 'Ten', \\n 'Eleven', 'Twelve', 'Thirteen', 'Fourteen', 'Fifteen', 'Sixteen', 'Seventeen', 'Eighteen', 'Nineteen', 'Twenty', 'Thirty', 'Forty', 'Fifty', 'Sixty', 'Seventy', 'Eighty', 'Ninety']\\n\\n final_string = ''\\n if num >= billion: \\n remainder = num % billion\\n final_string += self.numberToWords(int(num / billion)) + \\\" Billion\\\"\\n elif num >= million:\\n remainder = num % million\\n final_string += self.numberToWords(int(num / million)) + \\\" Million\\\"\\n elif num >= thousand:\\n remainder = num % thousand\\n final_string += self.numberToWords(int(num / thousand)) + \\\" Thousand\\\"\\n elif num >= hundred:\\n remainder = num % hundred\\n final_string += self.numberToWords(int(num / hundred)) + \\\" Hundred\\\"\\n elif num >= 20:\\n remainder = num % 10\\n final_string += unique[int(num / 10) - 2 + 19]\\n elif num >= 1:\\n return unique[num - 1]\\n else:\\n return 'Zero'\\n \\n if remainder > 0:\\n return final_string + \\\" \\\" + self.numberToWords(remainder)\\n return final_string\\n \\n\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n # 2,147,483,647 is the max\\n # 0 is the min\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n number_dict = {\\n 1: \\\"One\\\", 2: \\\"Two\\\", 3: \\\"Three\\\", 4: \\\"Four\\\", 5: \\\"Five\\\", 6: \\\"Six\\\",\\n 7: \\\"Seven\\\", 8: \\\"Eight\\\", 9: \\\"Nine\\\", 10: \\\"Ten\\\", 11: \\\"Eleven\\\", 12: \\\"Twelve\\\",\\n 13: \\\"Thirteen\\\", 14: \\\"Fourteen\\\", 15: \\\"Fifteen\\\", 16: \\\"Sixteen\\\", 17: \\\"Seventeen\\\",\\n 18: \\\"Eighteen\\\", 19: \\\"Nineteen\\\", 20: \\\"Twenty\\\", 30: \\\"Thirty\\\", 40: \\\"Forty\\\", \\n 50: \\\"Fifty\\\", 60: \\\"Sixty\\\", 70: \\\"Seventy\\\", 80: \\\"Eighty\\\", 90: \\\"Ninety\\\"\\n }\\n\\n if num in number_dict:\\n return number_dict.get(num)\\n\\n suffix = {\\n 100: \\\"Hundred\\\", 1000: \\\"Thousand\\\", 1000000: \\\"Million\\\", 1000000000: \\\"Billion\\\"\\n }\\n\\n if num in suffix:\\n return \\\"One \\\" + suffix.get(num)\\n\\n res, tmp, base = \\\"\\\", \\\"\\\", \\\"\\\"\\n n = len(str(num))\\n index = 0\\n for i in range(n-1, -1, -1):\\n if len(tmp) < 3:\\n tmp = str(num)[i] + tmp\\n\\n if int(\\\"1\\\" + (\\\"0\\\" * (index))) in suffix:\\n base = suffix.get(int(\\\"1\\\" + (\\\"0\\\" * (index))))\\n\\n if len(tmp) == 3 or i == 0:\\n if index >= 3:\\n con = self.conversion(tmp, number_dict, suffix) \\n if con:\\n res = con + \\\" \\\" + base + \\\" \\\" + res\\n else:\\n res = self.conversion(tmp, number_dict, suffix) + res\\n tmp = \\\"\\\"\\n index += 1\\n return res.strip()\\n \\n def conversion(self, num, number_dict, suffix):\\n res = \\\"\\\"\\n n = len(num)\\n for i in range(n):\\n digit = num[i]\\n zeros = \\\"1\\\" + (\\\"0\\\" * (n-1))\\n nth_num = int(digit) * int(zeros)\\n if digit != \\\"0\\\":\\n if int(num[i:]) in number_dict:\\n return res + number_dict.get(int(num[i:]))\\n elif nth_num in suffix:\\n res += number_dict.get(int(digit)) + \\\" \\\" + suffix.get(nth_num) + \\\" \\\"\\n elif nth_num in number_dict:\\n res += number_dict.get(nth_num) + \\\" \\\"\\n elif int(zeros) in suffix:\\n res += number_dict.get(int(digit)) + \\\" \\\" + suffix.get(int(zeros)) + \\\" \\\"\\n n -= 1\\n return res.strip()\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n \\n # Dictionaries for specific number wordings\\n below_20 = [\\n 'Zero', 'One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine',\\n 'Ten', 'Eleven', 'Twelve', 'Thirteen', 'Fourteen', 'Fifteen', 'Sixteen', 'Seventeen', 'Eighteen', 'Nineteen'\\n ]\\n \\n tens = [\\n '', '', 'Twenty', 'Thirty', 'Forty', 'Fifty', 'Sixty', 'Seventy', 'Eighty', 'Ninety'\\n ]\\n \\n thousands = ['', 'Thousand', 'Million', 'Billion']\\n\\n def helper(n):\\n if n == 0:\\n return ''\\n elif n < 20:\\n return below_20[n] + ' '\\n elif n < 100:\\n return tens[n//10] + ' ' + helper(n % 10)\\n else:\\n return below_20[n // 100] + ' Hundred ' + helper(n % 100)\\n \\n res = ''\\n i = 0\\n\\n while num > 0:\\n if num % 1000 != 0:\\n res = helper(num % 1000) + thousands[i] + ' ' + res\\n num //= 1000\\n i += 1\\n return res.strip()\\n\\n\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n info1={1: 'One', 2: 'Two', 3: 'Three', 4: 'Four', \\n 5: 'Five', 6: 'Six', 7: 'Seven', 8: 'Eight', 9: 'Nine'}\\n info2={10: 'Ten', 11: 'Eleven', 12: 'Twelve', 13: 'Thirteen',\\n 14: 'Fourteen', 15: 'Fifteen', 16: 'Sixteen', 17: 'Seventeen',\\n 18: 'Eighteen', 19: 'Nineteen'}\\n info3={2: 'Twenty', 3: 'Thirty', 4: 'Forty', 5: 'Fifty',\\n 6: 'Sixty', 7: 'Seventy', 8: 'Eighty', 9: 'Ninety'}\\n order=['', 'Thousand', 'Million', 'Billion']\\n \\n def process2(num):\\n if num>=100:\\n return None\\n if num==0:\\n return \\\"\\\"\\n if num<10:\\n return info1[num]\\n if num<20:\\n return info2[num]\\n res=[info3[num//10]]\\n if num%10:\\n res.append(info1[num%10])\\n return ' '.join(res)\\n \\n def process3(num):\\n if num>=1000:\\n return None\\n res=[]\\n if num//100>0:\\n res.append(info1[num//100])\\n res.append('Hundred')\\n tp=process2(num%100)\\n if tp:\\n res.append(tp)\\n return ' '.join(res)\\n if num==0:\\n return 'Zero'\\n res=[]\\n for k in range(4):\\n cur=process3(num%1000)\\n tp_res=[]\\n if cur:\\n tp_res.append(cur)\\n if order[k]:\\n tp_res.append(order[k])\\n tp_res=' '.join(tp_res)\\n if tp_res:\\n res.append(tp_res)\\n num=num//1000\\n if num==0:\\n break\\n return ' '.join(res[::-1])\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n ones = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\n tens = [\\\"\\\", \\\"Ten\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n teens = [\\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n suffixes = [\\\"\\\", \\\"Thousand\\\", \\\"Million\\\", \\\"Billion\\\", \\\"Trillion\\\", \\\"Quadrillion\\\", \\\"Quintillion\\\", \\\"Sextillion\\\", \\\"Septillion\\\", \\\"Octillion\\\", \\\"Nonillion\\\", \\\"Decillion\\\"]\\n words = []\\n i = 0\\n while num > 0:\\n triplet = num % 1000\\n num = num // 1000\\n if triplet == 0:\\n i += 1\\n continue\\n temp = []\\n if triplet // 100 > 0:\\n temp.append(ones[triplet // 100])\\n temp.append(\\\"Hundred\\\")\\n if triplet % 100 >= 10 and triplet % 100 <= 19:\\n temp.append(teens[triplet % 10])\\n else:\\n if triplet % 100 >= 20:\\n temp.append(tens[triplet % 100 // 10])\\n if triplet % 10 > 0:\\n temp.append(ones[triplet % 10])\\n if i > 0:\\n temp.append(suffixes[i])\\n words = temp + words\\n i += 1\\n return \\\" \\\".join(words)\\n \\n\\n\\n \",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num):\\n if num == 0:\\n return \\\"Zero\\\"\\n \\n def one(num):\\n switcher = {\\n 1: \\\"One\\\", 2: \\\"Two\\\", 3: \\\"Three\\\", 4: \\\"Four\\\",\\n 5: \\\"Five\\\", 6: \\\"Six\\\", 7: \\\"Seven\\\", 8: \\\"Eight\\\", 9: \\\"Nine\\\"\\n }\\n return switcher.get(num, \\\"\\\")\\n \\n def two_less_20(num):\\n switcher = {\\n 10: \\\"Ten\\\", 11: \\\"Eleven\\\", 12: \\\"Twelve\\\", 13: \\\"Thirteen\\\",\\n 14: \\\"Fourteen\\\", 15: \\\"Fifteen\\\", 16: \\\"Sixteen\\\", 17: \\\"Seventeen\\\",\\n 18: \\\"Eighteen\\\", 19: \\\"Nineteen\\\"\\n }\\n return switcher.get(num, \\\"\\\")\\n \\n def ten(num):\\n switcher = {\\n 2: \\\"Twenty\\\", 3: \\\"Thirty\\\", 4: \\\"Forty\\\", 5: \\\"Fifty\\\",\\n 6: \\\"Sixty\\\", 7: \\\"Seventy\\\", 8: \\\"Eighty\\\", 9: \\\"Ninety\\\"\\n }\\n return switcher.get(num, \\\"\\\")\\n \\n def two(num):\\n if not num:\\n return \\\"\\\"\\n elif num < 10:\\n return one(num)\\n elif num < 20:\\n return two_less_20(num)\\n else:\\n tenner = num // 10\\n rest = num - tenner * 10\\n return ten(tenner) + (\\\"\\\" if not rest else \\\" \\\" + one(rest))\\n \\n def three(num):\\n hundred = num // 100\\n rest = num - hundred * 100\\n if hundred and rest:\\n return one(hundred) + \\\" Hundred \\\" + two(rest)\\n elif not hundred and rest:\\n return two(rest)\\n elif hundred and not rest:\\n return one(hundred) + \\\" Hundred\\\"\\n else:\\n return \\\"\\\"\\n \\n def helper(num):\\n billion = num // 1000000000\\n million = (num % 1000000000) // 1000000\\n thousand = (num % 1000000) // 1000\\n remainder = num % 1000\\n \\n res = \\\"\\\"\\n if billion:\\n res += three(billion) + \\\" Billion\\\"\\n if million:\\n res += (\\\" \\\" if res else \\\"\\\") + three(million) + \\\" Million\\\"\\n if thousand:\\n res += (\\\" \\\" if res else \\\"\\\") + three(thousand) + \\\" Thousand\\\"\\n if remainder:\\n res += (\\\" \\\" if res else \\\"\\\") + three(remainder)\\n \\n return res\\n \\n return helper(num).strip()\\n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n les20 = [\\n \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\", \\\"Ten\\\",\\n \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"\\n ]\\n tens = [\\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n\\n \\n def helper(num):\\n if not num:\\n return []\\n elif 1 <= num < 20:\\n return [les20[num - 1]] \\n elif 20 <= num < 100:\\n return [tens[num // 10 - 2]] + helper(num % 10)\\n elif 100 <= num < 1000:\\n return helper(num // 100) + [\\\"Hundred\\\"] + helper(num % 100)\\n else:\\n for p, unit in enumerate([\\\"Billion\\\", \\\"Million\\\", \\\"Thousand\\\"]):\\n thres = 10 ** (3 * (3 - p))\\n if num >= thres:\\n return helper(num // thres) + [unit] + helper(num % thres)\\n \\n res = helper(num)\\n\\n return \\\" \\\".join(res) if res else \\\"Zero\\\"\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0: \\n return \\\"Zero\\\"\\n ones = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\", \\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n tens = [\\\"\\\", \\\"\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n thousands = [\\\"\\\", \\\"Thousand\\\", \\\"Million\\\", \\\"Billion\\\"]\\n \\n res = \\\"\\\" \\n groupIndex = 0\\n\\n while num > 0: \\n if num % 1000 != 0: \\n groupRes = \\\"\\\" \\n part = num % 1000 \\n\\n if part >= 100: \\n groupRes += ones[part // 100] + \\\" Hundred \\\" \\n part %= 100 \\n \\n if part >= 20: \\n groupRes += tens[part // 10] + \\\" \\\"\\n part %= 10\\n \\n if part > 0: \\n groupRes += ones[part] + \\\" \\\"\\n\\n groupRes += thousands[groupIndex] + \\\" \\\"\\n res = groupRes + res\\n \\n num //= 1000 \\n groupIndex += 1 \\n return res.strip() \",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n info1={1: 'One', 2: 'Two', 3: 'Three', 4: 'Four', \\n 5: 'Five', 6: 'Six', 7: 'Seven', 8: 'Eight', 9: 'Nine'}\\n info2={10: 'Ten', 11: 'Eleven', 12: 'Twelve', 13: 'Thirteen',\\n 14: 'Fourteen', 15: 'Fifteen', 16: 'Sixteen', 17: 'Seventeen',\\n 18: 'Eighteen', 19: 'Nineteen'}\\n info3={2: 'Twenty', 3: 'Thirty', 4: 'Forty', 5: 'Fifty',\\n 6: 'Sixty', 7: 'Seventy', 8: 'Eighty', 9: 'Ninety'}\\n order=['', 'Thousand', 'Million', 'Billion']\\n \\n def process2(num):\\n if num>=100:\\n return None\\n if num==0:\\n return \\\"\\\"\\n if num<10:\\n return info1[num]\\n if num<20:\\n return info2[num]\\n res=[info3[num//10]]\\n if num%10:\\n res.append(info1[num%10])\\n return ' '.join(res)\\n \\n def process3(num):\\n if num>=1000:\\n return None\\n res=[]\\n if num//100>0:\\n res.append(info1[num//100])\\n res.append('Hundred')\\n tp=process2(num%100)\\n if tp:\\n res.append(tp)\\n return ' '.join(res)\\n if num==0:\\n return 'Zero'\\n res=[]\\n for k in range(4):\\n cur=process3(num%1000)\\n tp_res=[]\\n if cur:\\n tp_res.append(cur)\\n if order[k]:\\n tp_res.append(order[k])\\n tp_res=' '.join(tp_res)\\n if tp_res:\\n res.append(tp_res)\\n num=num//1000\\n if num==0:\\n break\\n return ' '.join(res[::-1])\",\n \"runtime\": \"43\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":48,"string":"48"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def numberToWords(self,num: int) -> str:\n if num == 0: return \"Zero\"\n digits = list(map(int,str(num)))[::-1]\n if len(digits) % 3 == 2: digits.append(0) #make it a multiple of 3\n elif len(digits) % 3 == 1: \n digits.append(0)\n digits.append(0)\n\n #words\n # \"Hundred\"\n u_digit = [\"\",\"One\",\"Two\",\"Three\",\"Four\",\"Five\",\"Six\",\"Seven\",\"Eight\",\"Nine\",\n \"Ten\",\"Eleven\",\"Twelve\",\"Thirteen\",\"Fourteen\",\"Fifteen\",\"Sixteen\",\"Seventeen\",\"Eighteen\",\"Nineteen\"]\n d_digit = [\"\",\"\",\"Twenty\",\"Thirty\",\"Forty\",\"Fifty\",\"Sixty\",\"Seventy\",\"Eighty\",\"Ninety\"]\n scale = [\"\",\"Thousand\",\"Million\",\"Billion\"]\n\n res = []\n scale_id = 0\n for i in range(0,len(digits),3):\n val = \"\"\n #centenas\n if digits[i+2] > 0: val += f\"{u_digit[digits[i+2]]} Hundred \" if digits[i+1] != 0 or digits[i] != 0 else f\"{u_digit[digits[i+2]]} Hundred\"\n #dezenas\n if digits[i+1] < 2: \n number = digits[i+1]*10+digits[i]\n val += f\"{u_digit[number]}\"\n #unidades\n else: \n val += f\"{d_digit[digits[i+1]]}{u_digit[digits[i]]}\" if digits[i+1] == 0 or digits[i] == 0 else f\"{d_digit[digits[i+1]]} {u_digit[digits[i]]}\"\n \n if scale_id != 0 and val != \"\":\n print(val)\n val += f\" {scale[scale_id]}\"\n\n res.insert(0,val.strip())\n scale_id += 1\n \n res = [item for item in res if item != \"\"]\n return \" \".join(res).strip()","memory":"15900"},{"code":"class Solution:\n # Arrays to store words for numbers less than 10, 20, and 100\n below_ten = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\"]\n below_twenty = [\"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n below_hundred = [\"\", \"Ten\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n\n # Main function to convert a number to English words\n def numberToWords(self, num: int) -> str:\n # Handle the special case where the number is zero\n if num == 0:\n return \"Zero\"\n # Call the helper function to start the conversion\n return self._convert_to_words(num)\n\n # Recursive function to convert numbers to words\n # Handles numbers based on their ranges: <10, <20, <100, <1000, <1000000, <1000000000, and >=1000000000\n def _convert_to_words(self, num: int) -> str:\n if num < 10:\n return self.below_ten[num]\n if num < 20:\n return self.below_twenty[num - 10]\n if num < 100:\n return self.below_hundred[num // 10] + (\" \" + self._convert_to_words(num % 10) if num % 10 != 0 else \"\")\n if num < 1000:\n return self._convert_to_words(num // 100) + \" Hundred\" + (\" \" + self._convert_to_words(num % 100) if num % 100 != 0 else \"\")\n if num < 1000000:\n return self._convert_to_words(num // 1000) + \" Thousand\" + (\" \" + self._convert_to_words(num % 1000) if num % 1000 != 0 else \"\")\n if num < 1000000000:\n return self._convert_to_words(num // 1000000) + \" Million\" + (\" \" + self._convert_to_words(num % 1000000) if num % 1000000 != 0 else \"\")\n return self._convert_to_words(num // 1000000000) + \" Billion\" + (\" \" + self._convert_to_words(num % 1000000000) if num % 1000000000 != 0 else \"\")","memory":"16000"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n # Handle the special case where the number is zero\n if num == 0:\n return \"Zero\"\n\n # Arrays to store words for single digits, tens, and thousands\n ones = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\", \"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n tens = [\"\", \"\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n thousands = [\"\", \"Thousand\", \"Million\", \"Billion\"]\n\n # StringBuilder to accumulate the result\n result = \"\"\n group_index = 0\n\n # Process the number in chunks of 1000\n while num > 0:\n # Process the last three digits\n if num % 1000 != 0:\n group_result = \"\"\n part = num % 1000\n\n # Handle hundreds\n if part >= 100:\n group_result += ones[part // 100] + \" Hundred \"\n part %= 100\n\n # Handle tens and units\n if part >= 20:\n group_result += tens[part // 10] + \" \"\n part %= 10\n\n # Handle units\n if part > 0:\n group_result += ones[part] + \" \"\n\n # Append the scale (thousand, million, billion) for the current group\n group_result += thousands[group_index] + \" \"\n # Insert the group result at the beginning of the final result\n result = group_result + result\n # Move to the next chunk of 1000\n num //= 1000\n group_index += 1\n\n return result.strip()","memory":"16100"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return 'Zero'\n\n below20 = [\n '', 'One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine',\n 'Ten', 'Eleven', 'Twelve', 'Thirteen', 'Fourteen', 'Fifteen', 'Sixteen', 'Seventeen', 'Eighteen', 'Nineteen'\n ]\n tens = ['', '', 'Twenty', 'Thirty', 'Forty', 'Fifty', 'Sixty', 'Seventy', 'Eighty', 'Ninety']\n thousands = ['', 'Thousand', 'Million', 'Billion', 'Trillion']\n\n def hundreds(num: int) -> str:\n if num < 20:\n return below20[num]\n elif num < 100:\n arr = [tens[num // 10]]\n if num % 10 != 0:\n arr.append(below20[num % 10])\n return ' '.join(arr)\n else:\n arr = [below20[num // 100], 'Hundred']\n if num % 100 != 0:\n arr.append(hundreds(num % 100))\n return ' '.join(arr)\n\n txts = []\n i = 0\n while num != 0:\n if num % 1000 != 0:\n if 0 < i:\n txts.insert(0, thousands[i])\n txts.insert(0, hundreds(num % 1000))\n num //= 1000\n i += 1\n return ' '.join(txts)","memory":"16100"},{"code":"class Solution: \n def numberToWords(self, num: int) -> str:\n if num == 0 : return 'Zero' #if condition to handle zero\n d = {1000000000 : 'Billion',1000000 : 'Million',1000 : 'Thousand',100 : 'Hundred', \n\t\t90:'Ninety',80:'Eighty',70:'Seventy',60:'Sixty',50: 'Fifty', 40 : 'Forty', 30 : 'Thirty', 20 : 'Twenty',\n\t\t19 :'Nineteen',18 :'Eighteen',17:'Seventeen',16:'Sixteen',15:'Fifteen',14:'Fourteen',13:'Thirteen',12:'Twelve',11:'Eleven',\n\t\t10:'Ten',9:'Nine',8:'Eight',7:'Seven',6:'Six',5:'Five',4:'Four',3:'Three',2:'Two',1:'One'} \n ans = \"\" \n for key, value in d.items(): \n if num//key>0 : \n x = num//key \n if key >= 100 : \n ans += self.numberToWords(x) + ' '\n ans += value + \" \"\n num = num%key \n return ans.strip() ","memory":"16200"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n\n # Arrays to store words for single digits, tens, and thousands\n ones = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\", \"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n tens = [\"\", \"\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n thousands = [\"\", \"Thousand\", \"Million\", \"Billion\"]\n\n result = \"\"\n group_index = 0\n n = num\n # Process the number in chunks of 1000\n \n while(n>0):\n rem = n%1000\n if rem != 0:\n group_result = \"\"\n \n if rem>= 100:\n group_result += ones[rem//100] + \" Hundred \"\n rem = rem%100\n \n if rem >= 20:\n group_result += tens[rem//10] + \" \"\n rem = rem%10\n \n if rem > 0:\n group_result += ones[rem] + \" \"\n \n group_result += thousands[group_index] + \" \"\n result = group_result + result\n\n n = n//1000\n group_index += 1\n\n return result.strip()\n\n","memory":"16300"},{"code":"class Solution:\n # Arrays to store words for numbers less than 10, 20, and 100\n below_ten = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\"]\n below_twenty = [\"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\n below_hundred = [\"\", \"Ten\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n\n # Main function to convert a number to English words\n def numberToWords(self, num: int) -> str:\n # Handle the special case where the number is zero\n if num == 0:\n return \"Zero\"\n # Call the helper function to start the conversion\n return self._convert_to_words(num)\n\n # Recursive function to convert numbers to words\n # Handles numbers based on their ranges: <10, <20, <100, <1000, <1000000, <1000000000, and >=1000000000\n def _convert_to_words(self, num: int) -> str:\n if num < 10:\n return self.below_ten[num]\n if num < 20:\n return self.below_twenty[num - 10]\n if num < 100:\n return self.below_hundred[num // 10] + (\" \" + self._convert_to_words(num % 10) if num % 10 != 0 else \"\")\n if num < 1000:\n return self._convert_to_words(num // 100) + \" Hundred\" + (\" \" + self._convert_to_words(num % 100) if num % 100 != 0 else \"\")\n if num < 1000000:\n return self._convert_to_words(num // 1000) + \" Thousand\" + (\" \" + self._convert_to_words(num % 1000) if num % 1000 != 0 else \"\")\n if num < 1000000000:\n return self._convert_to_words(num // 1000000) + \" Million\" + (\" \" + self._convert_to_words(num % 1000000) if num % 1000000 != 0 else \"\")\n return self._convert_to_words(num // 1000000000) + \" Billion\" + (\" \" + self._convert_to_words(num % 1000000000) if num % 1000000000 != 0 else \"\")","memory":"16400"},{"code":"class Solution:\n # Python3: Dictionaries are ordered by insertion\n wordMap = {\n 1000000000: \"Billion\", 1000000: \"Million\", 1000: \"Thousand\",\n 100: \"Hundred\", 90: \"Ninety\", 80: \"Eighty\", 70: \"Seventy\",\n 60: \"Sixty\", 50: \"Fifty\", 40: \"Forty\", 30: \"Thirty\",\n 20: \"Twenty\", 19: \"Nineteen\", 18: \"Eighteen\", 17: \"Seventeen\",\n 16: \"Sixteen\", 15: \"Fifteen\", 14: \"Fourteen\", 13: \"Thirteen\",\n 12: \"Twelve\", 11: \"Eleven\", 10: \"Ten\", 9: \"Nine\", 8: \"Eight\",\n 7: \"Seven\", 6: \"Six\", 5: \"Five\", 4: \"Four\", 3: \"Three\",\n 2: \"Two\", 1: \"One\"\n }\n\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n\n for denomination in self.wordMap.keys():\n if num >= denomination:\n # Get prefix\n prefix = \"\"\n if num >= 100:\n prefix = self.numberToWords(num // denomination) + \" \"\n\n # Get current unit\n unit = self.wordMap[denomination]\n\n # Get suffix, aka from the remainder\n suffix = \"\"\n if num % denomination > 0:\n suffix = \" \" + self.numberToWords(num % denomination)\n\n return prefix + unit + suffix\n\n return \"\"\n\n # lessThan20Map = { 0: \"\", 1: \"One\", 2: \"Two\", 3: \"Three\", 4: \"Four\", 5: \"Five\",\n # 6: \"Six\", 7: \"Seven\", 8: \"Eight\", 9: \"Nine\", 10: \"Ten\",\n # 11: \"Eleven\" , 12: \"Twelve\", 13: \"Thirteen\", 14: \"Fourteen\",\n # 15: \"Fifteen\", 16: \"Sixteen\", 17: \"Seventeen\", 18: \"Eighteen\",\n # 19: \"Nineteen\"}\n # tensMap = { 0: \"\", 1: \"Ten\", 2: \"Twenty\", 3: \"Thirty\", 4: \"Forty\", 5: \"Fifty\",\n # 6: \"Sixty\", 7: \"Seventy\", 8: \"Eighty\", 9: \"Ninety\"}\n # thousandsMap = { 0: \"\", 1: \"Thousand\", 2: \"Million\", 3: \"Billion\" }\n\n # def getWords(n):\n # if n == 0:\n # return \"\"\n # elif n < 20:\n # return [lessThan20Map[n]]\n # elif n < 100:\n # return [tensMap[n // 10]] + getWords(n % 10)\n # else:\n # return [lessThan20Map[n // 100], \"Hundred\"] + getWords(n % 100)\n\n # i = 0\n # res = []\n # while num > 0:\n # if num % 1000 != 0:\n # res = getWords(num % 1000) + [thousandsMap[i]] + res\n # num = num // 1000\n # i += 1\n\n # return \" \".join(res).strip()","memory":"16500"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return 'Zero'\n nums = {0: '', 1: 'One', 2: 'Two', 3: 'Three', 4: 'Four', 5: 'Five', 6: 'Six', 7: 'Seven', 8: 'Eight', 9: 'Nine'}\n decs = {2: 'Twenty', 3: 'Thirty', 4: 'Forty', 5: 'Fifty', 6: 'Sixty', 7: 'Seventy', 8: 'Eighty', 9: 'Ninety'}\n tens = {0: 'Ten', 1:'Eleven', 2: 'Twelve', 3: 'Thirteen', 4: 'Fourteen', 5: 'Fifteen', 6: 'Sixteen', 7: 'Seventeen', 8: 'Eighteen', 9: 'Nineteen'}\n # Function to convert numbers < 1000 to words\n def hundreds(x):\n res = []\n h = x // 100\n x %= 100\n if h > 0:\n res.append(nums[h])\n res.append('Hundred')\n d = x // 10\n x %= 10\n if d > 1:\n res.append(decs[d])\n res.append(nums[x])\n elif d == 1:\n res.append(tens[x])\n else:\n res.append(nums[x])\n return res\n\n # Main conversion function\n def convert_chunk(num, unit):\n if num:\n res.extend(hundreds(num))\n if unit:\n res.append(unit)\n\n # Initialize result list\n res = []\n\n # Break the number into billions, millions, thousands, and the rest\n convert_chunk(num // 1000000000, 'Billion')\n num %= 1000000000\n convert_chunk(num // 1000000, 'Million')\n num %= 1000000\n convert_chunk(num // 1000, 'Thousand')\n num %= 1000\n convert_chunk(num, '')\n\n return ' '.join([i for i in res if i])","memory":"16500"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n les20 = [\n \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\", \"Ten\",\n \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"\n ]\n tens = [\"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\n\n \n def helper(num):\n if not num:\n return []\n elif 1 <= num < 20:\n return [les20[num - 1]] \n elif 20 <= num < 100:\n return [tens[num // 10 - 2]] + helper(num % 10)\n elif 100 <= num < 1000:\n return helper(num // 100) + [\"Hundred\"] + helper(num % 100)\n else:\n for p, unit in enumerate([\"Billion\", \"Million\", \"Thousand\"]):\n thres = 10 ** (3 * (3 - p))\n if num >= thres:\n return helper(num // thres) + [unit] + helper(num % thres)\n \n res = helper(num)\n\n return \" \".join(res) if res else \"Zero\"","memory":"16600"},{"code":"class Solution:\n def __init__(self):\n self.number_to_words_map = {\n 1000000000: \"Billion\", 1000000: \"Million\", 1000: \"Thousand\",\n 100: \"Hundred\", 90: \"Ninety\", 80: \"Eighty\", 70: \"Seventy\",\n 60: \"Sixty\", 50: \"Fifty\", 40: \"Forty\", 30: \"Thirty\",\n 20: \"Twenty\", 19: \"Nineteen\", 18: \"Eighteen\", 17: \"Seventeen\",\n 16: \"Sixteen\", 15: \"Fifteen\", 14: \"Fourteen\", 13: \"Thirteen\",\n 12: \"Twelve\", 11: \"Eleven\", 10: \"Ten\", 9: \"Nine\", 8: \"Eight\",\n 7: \"Seven\", 6: \"Six\", 5: \"Five\", 4: \"Four\", 3: \"Three\",\n 2: \"Two\", 1: \"One\"\n }\n\n def numberToWords(self, num: int) -> str:\n if num == 0 :\n return \"Zero\"\n \n for value, word in self.number_to_words_map.items():\n if num>= value:\n prefix = (self.numberToWords(num//value) + \" \") if num>=100 else \"\"\n\n unit = word\n\n suffix = (\" \" + self.numberToWords(num%value)) if num%value > 0 else \"\"\n return prefix + unit + suffix","memory":"16600"},{"code":"class Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n \n # Dictionaries for specific number wordings\n below_20 = [\n 'Zero', 'One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine',\n 'Ten', 'Eleven', 'Twelve', 'Thirteen', 'Fourteen', 'Fifteen', 'Sixteen', 'Seventeen', 'Eighteen', 'Nineteen'\n ]\n \n tens = [\n '', '', 'Twenty', 'Thirty', 'Forty', 'Fifty', 'Sixty', 'Seventy', 'Eighty', 'Ninety'\n ]\n \n thousands = ['', 'Thousand', 'Million', 'Billion']\n\n def helper(n):\n if n == 0:\n return ''\n elif n < 20:\n return below_20[n] + ' '\n elif n < 100:\n return tens[n//10] + ' ' + helper(n % 10)\n else:\n return below_20[n // 100] + ' Hundred ' + helper(n % 100)\n \n res = ''\n i = 0\n\n while num > 0:\n if num % 1000 != 0:\n res = helper(num % 1000) + thousands[i] + ' ' + res\n num //= 1000\n i += 1\n return res.strip()\n\n","memory":"16700"},{"code":"singles = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \n \"Six\", \"Seven\", \"Eight\", \"Nine\"]\nteens = [\"Ten\", \"Eleven\", \"Twelve\", \"Thirteen\", \"Fourteen\", \n \"Fifteen\", \"Sixteen\", \"Seventeen\", \"Eighteen\", \"Nineteen\"]\ntens = [\"\", \"Ten\", \"Twenty\", \"Thirty\", \"Forty\", \"Fifty\", \n \"Sixty\", \"Seventy\", \"Eighty\", \"Ninety\"]\nthousands = [\"\", \"Thousand\", \"Million\", \"Billion\"]\n\nclass Solution:\n def numberToWords(self, num: int) -> str:\n if num == 0:\n return \"Zero\"\n\n def toEnglish(num: int) -> str:\n s = \"\"\n if num >= 100:\n s += singles[num // 100] + \" Hundred \"\n num %= 100\n if num >= 20:\n s += tens[num // 10] + \" \"\n num %= 10\n if 0 < num < 10:\n s += singles[num] + \" \"\n elif num >= 10:\n s += teens[num - 10] + \" \"\n return s\n\n s = \"\"\n unit = int(1e9)\n for i in range(3, -1, -1):\n curNum = num // unit\n if curNum:\n num -= curNum * unit\n s += toEnglish(curNum) + thousands[i] + \" \"\n unit //= 1000\n return s.strip()\n ","memory":"16700"}],"string":"[\n {\n \"code\": \"class Solution:\\n def numberToWords(self,num: int) -> str:\\n if num == 0: return \\\"Zero\\\"\\n digits = list(map(int,str(num)))[::-1]\\n if len(digits) % 3 == 2: digits.append(0) #make it a multiple of 3\\n elif len(digits) % 3 == 1: \\n digits.append(0)\\n digits.append(0)\\n\\n #words\\n # \\\"Hundred\\\"\\n u_digit = [\\\"\\\",\\\"One\\\",\\\"Two\\\",\\\"Three\\\",\\\"Four\\\",\\\"Five\\\",\\\"Six\\\",\\\"Seven\\\",\\\"Eight\\\",\\\"Nine\\\",\\n \\\"Ten\\\",\\\"Eleven\\\",\\\"Twelve\\\",\\\"Thirteen\\\",\\\"Fourteen\\\",\\\"Fifteen\\\",\\\"Sixteen\\\",\\\"Seventeen\\\",\\\"Eighteen\\\",\\\"Nineteen\\\"]\\n d_digit = [\\\"\\\",\\\"\\\",\\\"Twenty\\\",\\\"Thirty\\\",\\\"Forty\\\",\\\"Fifty\\\",\\\"Sixty\\\",\\\"Seventy\\\",\\\"Eighty\\\",\\\"Ninety\\\"]\\n scale = [\\\"\\\",\\\"Thousand\\\",\\\"Million\\\",\\\"Billion\\\"]\\n\\n res = []\\n scale_id = 0\\n for i in range(0,len(digits),3):\\n val = \\\"\\\"\\n #centenas\\n if digits[i+2] > 0: val += f\\\"{u_digit[digits[i+2]]} Hundred \\\" if digits[i+1] != 0 or digits[i] != 0 else f\\\"{u_digit[digits[i+2]]} Hundred\\\"\\n #dezenas\\n if digits[i+1] < 2: \\n number = digits[i+1]*10+digits[i]\\n val += f\\\"{u_digit[number]}\\\"\\n #unidades\\n else: \\n val += f\\\"{d_digit[digits[i+1]]}{u_digit[digits[i]]}\\\" if digits[i+1] == 0 or digits[i] == 0 else f\\\"{d_digit[digits[i+1]]} {u_digit[digits[i]]}\\\"\\n \\n if scale_id != 0 and val != \\\"\\\":\\n print(val)\\n val += f\\\" {scale[scale_id]}\\\"\\n\\n res.insert(0,val.strip())\\n scale_id += 1\\n \\n res = [item for item in res if item != \\\"\\\"]\\n return \\\" \\\".join(res).strip()\",\n \"memory\": \"15900\"\n },\n {\n \"code\": \"class Solution:\\n # Arrays to store words for numbers less than 10, 20, and 100\\n below_ten = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\n below_twenty = [\\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n below_hundred = [\\\"\\\", \\\"Ten\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n\\n # Main function to convert a number to English words\\n def numberToWords(self, num: int) -> str:\\n # Handle the special case where the number is zero\\n if num == 0:\\n return \\\"Zero\\\"\\n # Call the helper function to start the conversion\\n return self._convert_to_words(num)\\n\\n # Recursive function to convert numbers to words\\n # Handles numbers based on their ranges: <10, <20, <100, <1000, <1000000, <1000000000, and >=1000000000\\n def _convert_to_words(self, num: int) -> str:\\n if num < 10:\\n return self.below_ten[num]\\n if num < 20:\\n return self.below_twenty[num - 10]\\n if num < 100:\\n return self.below_hundred[num // 10] + (\\\" \\\" + self._convert_to_words(num % 10) if num % 10 != 0 else \\\"\\\")\\n if num < 1000:\\n return self._convert_to_words(num // 100) + \\\" Hundred\\\" + (\\\" \\\" + self._convert_to_words(num % 100) if num % 100 != 0 else \\\"\\\")\\n if num < 1000000:\\n return self._convert_to_words(num // 1000) + \\\" Thousand\\\" + (\\\" \\\" + self._convert_to_words(num % 1000) if num % 1000 != 0 else \\\"\\\")\\n if num < 1000000000:\\n return self._convert_to_words(num // 1000000) + \\\" Million\\\" + (\\\" \\\" + self._convert_to_words(num % 1000000) if num % 1000000 != 0 else \\\"\\\")\\n return self._convert_to_words(num // 1000000000) + \\\" Billion\\\" + (\\\" \\\" + self._convert_to_words(num % 1000000000) if num % 1000000000 != 0 else \\\"\\\")\",\n \"memory\": \"16000\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n # Handle the special case where the number is zero\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n # Arrays to store words for single digits, tens, and thousands\\n ones = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\", \\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n tens = [\\\"\\\", \\\"\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n thousands = [\\\"\\\", \\\"Thousand\\\", \\\"Million\\\", \\\"Billion\\\"]\\n\\n # StringBuilder to accumulate the result\\n result = \\\"\\\"\\n group_index = 0\\n\\n # Process the number in chunks of 1000\\n while num > 0:\\n # Process the last three digits\\n if num % 1000 != 0:\\n group_result = \\\"\\\"\\n part = num % 1000\\n\\n # Handle hundreds\\n if part >= 100:\\n group_result += ones[part // 100] + \\\" Hundred \\\"\\n part %= 100\\n\\n # Handle tens and units\\n if part >= 20:\\n group_result += tens[part // 10] + \\\" \\\"\\n part %= 10\\n\\n # Handle units\\n if part > 0:\\n group_result += ones[part] + \\\" \\\"\\n\\n # Append the scale (thousand, million, billion) for the current group\\n group_result += thousands[group_index] + \\\" \\\"\\n # Insert the group result at the beginning of the final result\\n result = group_result + result\\n # Move to the next chunk of 1000\\n num //= 1000\\n group_index += 1\\n\\n return result.strip()\",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return 'Zero'\\n\\n below20 = [\\n '', 'One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine',\\n 'Ten', 'Eleven', 'Twelve', 'Thirteen', 'Fourteen', 'Fifteen', 'Sixteen', 'Seventeen', 'Eighteen', 'Nineteen'\\n ]\\n tens = ['', '', 'Twenty', 'Thirty', 'Forty', 'Fifty', 'Sixty', 'Seventy', 'Eighty', 'Ninety']\\n thousands = ['', 'Thousand', 'Million', 'Billion', 'Trillion']\\n\\n def hundreds(num: int) -> str:\\n if num < 20:\\n return below20[num]\\n elif num < 100:\\n arr = [tens[num // 10]]\\n if num % 10 != 0:\\n arr.append(below20[num % 10])\\n return ' '.join(arr)\\n else:\\n arr = [below20[num // 100], 'Hundred']\\n if num % 100 != 0:\\n arr.append(hundreds(num % 100))\\n return ' '.join(arr)\\n\\n txts = []\\n i = 0\\n while num != 0:\\n if num % 1000 != 0:\\n if 0 < i:\\n txts.insert(0, thousands[i])\\n txts.insert(0, hundreds(num % 1000))\\n num //= 1000\\n i += 1\\n return ' '.join(txts)\",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution: \\n def numberToWords(self, num: int) -> str:\\n if num == 0 : return 'Zero' #if condition to handle zero\\n d = {1000000000 : 'Billion',1000000 : 'Million',1000 : 'Thousand',100 : 'Hundred', \\n\\t\\t90:'Ninety',80:'Eighty',70:'Seventy',60:'Sixty',50: 'Fifty', 40 : 'Forty', 30 : 'Thirty', 20 : 'Twenty',\\n\\t\\t19 :'Nineteen',18 :'Eighteen',17:'Seventeen',16:'Sixteen',15:'Fifteen',14:'Fourteen',13:'Thirteen',12:'Twelve',11:'Eleven',\\n\\t\\t10:'Ten',9:'Nine',8:'Eight',7:'Seven',6:'Six',5:'Five',4:'Four',3:'Three',2:'Two',1:'One'} \\n ans = \\\"\\\" \\n for key, value in d.items(): \\n if num//key>0 : \\n x = num//key \\n if key >= 100 : \\n ans += self.numberToWords(x) + ' '\\n ans += value + \\\" \\\"\\n num = num%key \\n return ans.strip() \",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n # Arrays to store words for single digits, tens, and thousands\\n ones = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\", \\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n tens = [\\\"\\\", \\\"\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n thousands = [\\\"\\\", \\\"Thousand\\\", \\\"Million\\\", \\\"Billion\\\"]\\n\\n result = \\\"\\\"\\n group_index = 0\\n n = num\\n # Process the number in chunks of 1000\\n \\n while(n>0):\\n rem = n%1000\\n if rem != 0:\\n group_result = \\\"\\\"\\n \\n if rem>= 100:\\n group_result += ones[rem//100] + \\\" Hundred \\\"\\n rem = rem%100\\n \\n if rem >= 20:\\n group_result += tens[rem//10] + \\\" \\\"\\n rem = rem%10\\n \\n if rem > 0:\\n group_result += ones[rem] + \\\" \\\"\\n \\n group_result += thousands[group_index] + \\\" \\\"\\n result = group_result + result\\n\\n n = n//1000\\n group_index += 1\\n\\n return result.strip()\\n\\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n # Arrays to store words for numbers less than 10, 20, and 100\\n below_ten = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\n below_twenty = [\\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\n below_hundred = [\\\"\\\", \\\"Ten\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n\\n # Main function to convert a number to English words\\n def numberToWords(self, num: int) -> str:\\n # Handle the special case where the number is zero\\n if num == 0:\\n return \\\"Zero\\\"\\n # Call the helper function to start the conversion\\n return self._convert_to_words(num)\\n\\n # Recursive function to convert numbers to words\\n # Handles numbers based on their ranges: <10, <20, <100, <1000, <1000000, <1000000000, and >=1000000000\\n def _convert_to_words(self, num: int) -> str:\\n if num < 10:\\n return self.below_ten[num]\\n if num < 20:\\n return self.below_twenty[num - 10]\\n if num < 100:\\n return self.below_hundred[num // 10] + (\\\" \\\" + self._convert_to_words(num % 10) if num % 10 != 0 else \\\"\\\")\\n if num < 1000:\\n return self._convert_to_words(num // 100) + \\\" Hundred\\\" + (\\\" \\\" + self._convert_to_words(num % 100) if num % 100 != 0 else \\\"\\\")\\n if num < 1000000:\\n return self._convert_to_words(num // 1000) + \\\" Thousand\\\" + (\\\" \\\" + self._convert_to_words(num % 1000) if num % 1000 != 0 else \\\"\\\")\\n if num < 1000000000:\\n return self._convert_to_words(num // 1000000) + \\\" Million\\\" + (\\\" \\\" + self._convert_to_words(num % 1000000) if num % 1000000 != 0 else \\\"\\\")\\n return self._convert_to_words(num // 1000000000) + \\\" Billion\\\" + (\\\" \\\" + self._convert_to_words(num % 1000000000) if num % 1000000000 != 0 else \\\"\\\")\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n # Python3: Dictionaries are ordered by insertion\\n wordMap = {\\n 1000000000: \\\"Billion\\\", 1000000: \\\"Million\\\", 1000: \\\"Thousand\\\",\\n 100: \\\"Hundred\\\", 90: \\\"Ninety\\\", 80: \\\"Eighty\\\", 70: \\\"Seventy\\\",\\n 60: \\\"Sixty\\\", 50: \\\"Fifty\\\", 40: \\\"Forty\\\", 30: \\\"Thirty\\\",\\n 20: \\\"Twenty\\\", 19: \\\"Nineteen\\\", 18: \\\"Eighteen\\\", 17: \\\"Seventeen\\\",\\n 16: \\\"Sixteen\\\", 15: \\\"Fifteen\\\", 14: \\\"Fourteen\\\", 13: \\\"Thirteen\\\",\\n 12: \\\"Twelve\\\", 11: \\\"Eleven\\\", 10: \\\"Ten\\\", 9: \\\"Nine\\\", 8: \\\"Eight\\\",\\n 7: \\\"Seven\\\", 6: \\\"Six\\\", 5: \\\"Five\\\", 4: \\\"Four\\\", 3: \\\"Three\\\",\\n 2: \\\"Two\\\", 1: \\\"One\\\"\\n }\\n\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n for denomination in self.wordMap.keys():\\n if num >= denomination:\\n # Get prefix\\n prefix = \\\"\\\"\\n if num >= 100:\\n prefix = self.numberToWords(num // denomination) + \\\" \\\"\\n\\n # Get current unit\\n unit = self.wordMap[denomination]\\n\\n # Get suffix, aka from the remainder\\n suffix = \\\"\\\"\\n if num % denomination > 0:\\n suffix = \\\" \\\" + self.numberToWords(num % denomination)\\n\\n return prefix + unit + suffix\\n\\n return \\\"\\\"\\n\\n # lessThan20Map = { 0: \\\"\\\", 1: \\\"One\\\", 2: \\\"Two\\\", 3: \\\"Three\\\", 4: \\\"Four\\\", 5: \\\"Five\\\",\\n # 6: \\\"Six\\\", 7: \\\"Seven\\\", 8: \\\"Eight\\\", 9: \\\"Nine\\\", 10: \\\"Ten\\\",\\n # 11: \\\"Eleven\\\" , 12: \\\"Twelve\\\", 13: \\\"Thirteen\\\", 14: \\\"Fourteen\\\",\\n # 15: \\\"Fifteen\\\", 16: \\\"Sixteen\\\", 17: \\\"Seventeen\\\", 18: \\\"Eighteen\\\",\\n # 19: \\\"Nineteen\\\"}\\n # tensMap = { 0: \\\"\\\", 1: \\\"Ten\\\", 2: \\\"Twenty\\\", 3: \\\"Thirty\\\", 4: \\\"Forty\\\", 5: \\\"Fifty\\\",\\n # 6: \\\"Sixty\\\", 7: \\\"Seventy\\\", 8: \\\"Eighty\\\", 9: \\\"Ninety\\\"}\\n # thousandsMap = { 0: \\\"\\\", 1: \\\"Thousand\\\", 2: \\\"Million\\\", 3: \\\"Billion\\\" }\\n\\n # def getWords(n):\\n # if n == 0:\\n # return \\\"\\\"\\n # elif n < 20:\\n # return [lessThan20Map[n]]\\n # elif n < 100:\\n # return [tensMap[n // 10]] + getWords(n % 10)\\n # else:\\n # return [lessThan20Map[n // 100], \\\"Hundred\\\"] + getWords(n % 100)\\n\\n # i = 0\\n # res = []\\n # while num > 0:\\n # if num % 1000 != 0:\\n # res = getWords(num % 1000) + [thousandsMap[i]] + res\\n # num = num // 1000\\n # i += 1\\n\\n # return \\\" \\\".join(res).strip()\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return 'Zero'\\n nums = {0: '', 1: 'One', 2: 'Two', 3: 'Three', 4: 'Four', 5: 'Five', 6: 'Six', 7: 'Seven', 8: 'Eight', 9: 'Nine'}\\n decs = {2: 'Twenty', 3: 'Thirty', 4: 'Forty', 5: 'Fifty', 6: 'Sixty', 7: 'Seventy', 8: 'Eighty', 9: 'Ninety'}\\n tens = {0: 'Ten', 1:'Eleven', 2: 'Twelve', 3: 'Thirteen', 4: 'Fourteen', 5: 'Fifteen', 6: 'Sixteen', 7: 'Seventeen', 8: 'Eighteen', 9: 'Nineteen'}\\n # Function to convert numbers < 1000 to words\\n def hundreds(x):\\n res = []\\n h = x // 100\\n x %= 100\\n if h > 0:\\n res.append(nums[h])\\n res.append('Hundred')\\n d = x // 10\\n x %= 10\\n if d > 1:\\n res.append(decs[d])\\n res.append(nums[x])\\n elif d == 1:\\n res.append(tens[x])\\n else:\\n res.append(nums[x])\\n return res\\n\\n # Main conversion function\\n def convert_chunk(num, unit):\\n if num:\\n res.extend(hundreds(num))\\n if unit:\\n res.append(unit)\\n\\n # Initialize result list\\n res = []\\n\\n # Break the number into billions, millions, thousands, and the rest\\n convert_chunk(num // 1000000000, 'Billion')\\n num %= 1000000000\\n convert_chunk(num // 1000000, 'Million')\\n num %= 1000000\\n convert_chunk(num // 1000, 'Thousand')\\n num %= 1000\\n convert_chunk(num, '')\\n\\n return ' '.join([i for i in res if i])\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n les20 = [\\n \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\", \\\"Ten\\\",\\n \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"\\n ]\\n tens = [\\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\n\\n \\n def helper(num):\\n if not num:\\n return []\\n elif 1 <= num < 20:\\n return [les20[num - 1]] \\n elif 20 <= num < 100:\\n return [tens[num // 10 - 2]] + helper(num % 10)\\n elif 100 <= num < 1000:\\n return helper(num // 100) + [\\\"Hundred\\\"] + helper(num % 100)\\n else:\\n for p, unit in enumerate([\\\"Billion\\\", \\\"Million\\\", \\\"Thousand\\\"]):\\n thres = 10 ** (3 * (3 - p))\\n if num >= thres:\\n return helper(num // thres) + [unit] + helper(num % thres)\\n \\n res = helper(num)\\n\\n return \\\" \\\".join(res) if res else \\\"Zero\\\"\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.number_to_words_map = {\\n 1000000000: \\\"Billion\\\", 1000000: \\\"Million\\\", 1000: \\\"Thousand\\\",\\n 100: \\\"Hundred\\\", 90: \\\"Ninety\\\", 80: \\\"Eighty\\\", 70: \\\"Seventy\\\",\\n 60: \\\"Sixty\\\", 50: \\\"Fifty\\\", 40: \\\"Forty\\\", 30: \\\"Thirty\\\",\\n 20: \\\"Twenty\\\", 19: \\\"Nineteen\\\", 18: \\\"Eighteen\\\", 17: \\\"Seventeen\\\",\\n 16: \\\"Sixteen\\\", 15: \\\"Fifteen\\\", 14: \\\"Fourteen\\\", 13: \\\"Thirteen\\\",\\n 12: \\\"Twelve\\\", 11: \\\"Eleven\\\", 10: \\\"Ten\\\", 9: \\\"Nine\\\", 8: \\\"Eight\\\",\\n 7: \\\"Seven\\\", 6: \\\"Six\\\", 5: \\\"Five\\\", 4: \\\"Four\\\", 3: \\\"Three\\\",\\n 2: \\\"Two\\\", 1: \\\"One\\\"\\n }\\n\\n def numberToWords(self, num: int) -> str:\\n if num == 0 :\\n return \\\"Zero\\\"\\n \\n for value, word in self.number_to_words_map.items():\\n if num>= value:\\n prefix = (self.numberToWords(num//value) + \\\" \\\") if num>=100 else \\\"\\\"\\n\\n unit = word\\n\\n suffix = (\\\" \\\" + self.numberToWords(num%value)) if num%value > 0 else \\\"\\\"\\n return prefix + unit + suffix\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n \\n # Dictionaries for specific number wordings\\n below_20 = [\\n 'Zero', 'One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine',\\n 'Ten', 'Eleven', 'Twelve', 'Thirteen', 'Fourteen', 'Fifteen', 'Sixteen', 'Seventeen', 'Eighteen', 'Nineteen'\\n ]\\n \\n tens = [\\n '', '', 'Twenty', 'Thirty', 'Forty', 'Fifty', 'Sixty', 'Seventy', 'Eighty', 'Ninety'\\n ]\\n \\n thousands = ['', 'Thousand', 'Million', 'Billion']\\n\\n def helper(n):\\n if n == 0:\\n return ''\\n elif n < 20:\\n return below_20[n] + ' '\\n elif n < 100:\\n return tens[n//10] + ' ' + helper(n % 10)\\n else:\\n return below_20[n // 100] + ' Hundred ' + helper(n % 100)\\n \\n res = ''\\n i = 0\\n\\n while num > 0:\\n if num % 1000 != 0:\\n res = helper(num % 1000) + thousands[i] + ' ' + res\\n num //= 1000\\n i += 1\\n return res.strip()\\n\\n\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"singles = [\\\"\\\", \\\"One\\\", \\\"Two\\\", \\\"Three\\\", \\\"Four\\\", \\\"Five\\\", \\n \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\nteens = [\\\"Ten\\\", \\\"Eleven\\\", \\\"Twelve\\\", \\\"Thirteen\\\", \\\"Fourteen\\\", \\n \\\"Fifteen\\\", \\\"Sixteen\\\", \\\"Seventeen\\\", \\\"Eighteen\\\", \\\"Nineteen\\\"]\\ntens = [\\\"\\\", \\\"Ten\\\", \\\"Twenty\\\", \\\"Thirty\\\", \\\"Forty\\\", \\\"Fifty\\\", \\n \\\"Sixty\\\", \\\"Seventy\\\", \\\"Eighty\\\", \\\"Ninety\\\"]\\nthousands = [\\\"\\\", \\\"Thousand\\\", \\\"Million\\\", \\\"Billion\\\"]\\n\\nclass Solution:\\n def numberToWords(self, num: int) -> str:\\n if num == 0:\\n return \\\"Zero\\\"\\n\\n def toEnglish(num: int) -> str:\\n s = \\\"\\\"\\n if num >= 100:\\n s += singles[num // 100] + \\\" Hundred \\\"\\n num %= 100\\n if num >= 20:\\n s += tens[num // 10] + \\\" \\\"\\n num %= 10\\n if 0 < num < 10:\\n s += singles[num] + \\\" \\\"\\n elif num >= 10:\\n s += teens[num - 10] + \\\" \\\"\\n return s\\n\\n s = \\\"\\\"\\n unit = int(1e9)\\n for i in range(3, -1, -1):\\n curNum = num // unit\\n if curNum:\\n num -= curNum * unit\\n s += toEnglish(curNum) + thousands[i] + \\\" \\\"\\n unit //= 1000\\n return s.strip()\\n \",\n \"memory\": \"16700\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":13,"string":"13"}}},{"rowIdx":166,"cells":{"question_id":{"kind":"number","value":274,"string":"274"},"name":{"kind":"string","value":"h-index"},"content":{"kind":"string","value":"<p>Given an array of integers <code>citations</code> where <code>citations[i]</code> is the number of citations a researcher received for their <code>i<sup>th</sup></code> paper, return <em>the researcher's h-index</em>.</p>\n\n<p>According to the <a href=\"https://en.wikipedia.org/wiki/H-index\" target=\"_blank\">definition of h-index on Wikipedia</a>: The h-index is defined as the maximum value of <code>h</code> such that the given researcher has published at least <code>h</code> papers that have each been cited at least <code>h</code> times.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> citations = [3,0,6,1,5]\n<strong>Output:</strong> 3\n<strong>Explanation:</strong> [3,0,6,1,5] means the researcher has 5 papers in total and each of them had received 3, 0, 6, 1, 5 citations respectively.\nSince the researcher has 3 papers with at least 3 citations each and the remaining two with no more than 3 citations each, their h-index is 3.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> citations = [1,3,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>n == citations.length</code></li>\n\t<li><code>1 <= n <= 5000</code></li>\n\t<li><code>0 <= citations[i] <= 1000</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":39.359813772285115,"string":"39.359814"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","sorting","counting-sort"],"string":"[\n \"array\",\n \"sorting\",\n \"counting-sort\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18\", 0.0409], [\"21\", 0.1162], [\"24\", 0.3825], [\"27\", 1.4478], [\"30\", 4.6234], [\"33\", 9.765699999999999], [\"36\", 13.665199999999999], [\"39\", 18.432000000000002], [\"42\", 19.955], [\"45\", 12.2653], [\"47\", 5.9346], [\"50\", 1.4546999999999999], [\"53\", 0.4781], [\"56\", 0.3483], [\"59\", 0.3073], [\"62\", 0.2459], [\"65\", 0.16390000000000002], [\"68\", 0.0888], [\"71\", 0.0819], [\"74\", 0.0684], [\"77\", 0.0956], [\"80\", 0.0478], [\"83\", 0.10250000000000001], [\"86\", 0.0683], [\"89\", 0.0888], [\"92\", 0.0409], [\"95\", 0.1024], [\"98\", 0.0819], [\"101\", 0.0342], [\"104\", 0.0342], [\"106\", 0.0683], [\"109\", 0.041], [\"112\", 0.0751], [\"115\", 0.0955], [\"118\", 0.1571], [\"121\", 0.1776], [\"124\", 0.12300000000000001], [\"127\", 0.0752], [\"130\", 0.09570000000000001], [\"133\", 0.10239999999999999], [\"136\", 0.16390000000000002], [\"139\", 0.1913], [\"142\", 0.20490000000000003], [\"145\", 0.1366], [\"148\", 0.0682], [\"151\", 0.0751], [\"154\", 0.0888], [\"157\", 0.0546], [\"160\", 0.0409], [\"163\", 0.0341], [\"165\", 0.0478], [\"168\", 0.061399999999999996], [\"171\", 0.0819], [\"174\", 0.10930000000000001], [\"177\", 0.041], [\"180\", 0.0751], [\"183\", 0.0479], [\"186\", 0.0683], [\"189\", 0.0682], [\"192\", 0.082], [\"195\", 0.0819], [\"198\", 0.1161], [\"201\", 0.0888], [\"204\", 0.14350000000000002], [\"207\", 0.1024], [\"210\", 0.0819], [\"213\", 0.0615], [\"216\", 0.0479], [\"219\", 0.0273], [\"222\", 0.0683], [\"224\", 0.0137], [\"227\", 0.0887], [\"230\", 0.0682], [\"233\", 0.10239999999999999], [\"236\", 0.09559999999999999], [\"239\", 0.0956], [\"242\", 0.0956], [\"245\", 0.0546], [\"248\", 0.1366], [\"251\", 0.061399999999999996]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16100\", 0.0068], [\"16200\", 0.0068], [\"16400\", 0.0137], [\"16500\", 0.0888], [\"16600\", 1.038], [\"16700\", 12.0399], [\"16800\", 28.1158], [\"16900\", 44.7722]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n \n citations = sorted(citations, reverse = True)\n for i in range(len(citations)):\n if citations[i] <= i:\n return i\n\n return len(citations)","runtime":"18"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort(reverse=True)\n n = len(citations)\n for i in range(n):\n if citations[i] < i + 1:\n return i\n return n","runtime":"18"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort()\n citations.reverse()\n max_h = 0\n for i, c in enumerate(citations):\n if c >= i + 1:\n max_h = max(max_h, i+1)\n return max_h\n\n\n\n\n\n \n # citations.sort()\n # citations.reverse()\n # max_h = 0\n # for i, c in enumerate(citations):\n # if c >= (i + 1):\n # max_h = max(max_h, i + 1)\n # return max_h\n ","runtime":"21"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h_idx = 0\n citations.sort(reverse=True)\n for i in range(len(citations)):\n if i + 1 <= citations[i]:\n h_idx += 1\n return h_idx\n","runtime":"21"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort()\n\n h = 0\n if citations[0] > 0:\n h = 1\n\n for i in range(len(citations)):\n if citations[i] <= len(citations) - i:\n h = citations[i]\n\n else:\n if len(citations) - i > h:\n h = len(citations) - i \n\n return h","runtime":"24"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n N = len(citations)\n bucket = [0] * (N + 1)\n\n for c in citations:\n bucket[min(N, c)] += 1\n \n right = N\n total = 0\n print(bucket)\n while right >= 0:\n total += bucket[right]\n print(total)\n if total >= right:\n return right\n right -= 1\n return 0\n \n","runtime":"24"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n # result = 0\n # for i in range(1, len(citations)+1):\n # count = 0\n # for citation in citations:\n # if citation >= i:\n # count += 1\n # if count >= i:\n # result = i\n # return result\n\n def gte(citations, m):\n count = 0\n for citation in citations:\n if citation >= m:\n count += 1\n return count\n\n mc = max(citations)\n l, r = 0, mc\n while l <= r:\n m = (l+r)//2\n c = gte(citations, m)\n if c >= m:\n l = m+1\n h = m\n else:\n r = m-1\n return h","runtime":"27"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort(reverse=True)\n h=0\n for i,c in enumerate(citations):\n if c>i:\n h+=1\n else:\n break\n return h","runtime":"27"},{"code":"class Solution:\n \"\"\"\n [3, 0, 6, 1, 5] - > [0, 1, 3, 5, 6]\n\n [3, 0, 6, 1, 5] - > [6, 5, 3, 1, 0]\n\n [4, 4, 0, 0] -> [4, 4, 0, 0]\n\n key: # of citations\n val: is the number of papers that are >= the # of citations\n {6:1, 5:2, 3:3, 1:4, 0:5}\n So the valid h set is {0, 1, 3}, and the max h is 3\n\n A valid h is defined by # of citations <= # of papers\n\n Maximum h is equal to the number of papers\n Minimum h_index is 0 because each reasearcher\n has at least one paper if they were cited once\n \"\"\"\n def hIndex(self, citations: List[int]) -> int:\n \n if len(citations) == 1:\n if citations[0] == 0:\n return 0\n else:\n return 1\n \n # First we will sort citations in descending order\n citations.sort(reverse=True)\n\n #n = len(citations)\n\n max_h = 0\n\n for i in range(len(citations)):\n num_citations = citations[i]\n\n # The number of papers with greater than or equal citations\n # [0, i+1] So it includes the current index of paper i\n num_papers = i + 1\n\n # Checking if there is a valid h value here\n if num_citations >= num_papers:\n max_h = max(num_papers, max_h)\n\n\n return max_h\n\n \n\n\n","runtime":"30"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort()\n cts=len(citations)\n ans=0\n flag=True\n for j,i in enumerate(citations):\n\n if i>=cts:\n if cts>ans:\n ans=cts\n cts=cts-1\n return ans","runtime":"30"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort(reverse=True)\n mnm = citations[0]\n index = 1 if mnm > 0 else 0\n for i in range(1, len(citations)):\n mnm = min(mnm, citations[i])\n index = max(index, i+1 if mnm >= i+1 else -1)\n \n return index","runtime":"33"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort()\n cur_max = 0\n count = 0\n j = 0\n while j < len(citations) and citations[j] == 0:\n j += 1\n if j < len(citations):\n cur_max = min(citations[j], len(citations) - j)\n for i in range(j, len(citations)):\n if citations[i] <= len(citations) - i:\n cur_max = max(cur_max, citations[i])\n cur_max = max(cur_max, min(len(citations) - i, citations[i]))\n \n \n return cur_max","runtime":"33"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations = sorted(citations)[::-1]\n cnt = 0\n for cit in citations:\n if cit > cnt:\n cnt += 1\n else:\n break\n return cnt\n","runtime":"36"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort(reverse = True)\n n = len(citations)\n h_index = [0] * n\n h_index[0] = 0 if citations[0] == 0 else 1\n for i in range(1,n):\n if citations[i] >= h_index[i-1] + 1:\n h_index[i] = h_index[i-1] + 1\n else:\n h_index[i] = h_index[i-1]\n return h_index[-1]\n ","runtime":"36"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort()\n l = len(citations)\n\n for i in range(l):\n if (l-i) <= citations[i]:\n return l-i\n return 0","runtime":"39"},{"code":"from typing import List\n\nclass Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort(reverse=True) # Sort the citations in descending order\n h = 0 # Initialize h-index\n \n for i, citation in enumerate(citations):\n if citation >= i + 1: # Compare citation count with 1-based index\n h = i + 1 # Update h-index\n else:\n break # No further papers can contribute to the h-index\n \n return h\n","runtime":"39"},{"code":"class Solution:\n\n def quick_sort(self, sequence, start=0, end=None):\n\n if end is None:\n end = len(sequence)-1\n\n if start >= end:\n return \n\n pivot = sequence[end]\n aux_idx = start - 1\n for i in range(start, end):\n if sequence[i] > pivot:\n aux_idx += 1\n sequence[aux_idx], sequence[i] = sequence[i], sequence[aux_idx]\n\n sequence[aux_idx+1], sequence[end] = sequence[end], sequence[aux_idx+1]\n\n self.quick_sort(sequence, start=start, end=aux_idx)\n self.quick_sort(sequence, start=aux_idx+2, end=end)\n\n\n def quick_sort_and_get_h(self, sequence, start=0, end=None):\n\n hmax = 0\n\n if end is None:\n end = len(sequence)-1\n\n if start >= end:\n if start == end and sequence[start] >= start+1:\n hmax = start+1\n return hmax\n\n pivot = sequence[end]\n aux_idx = start - 1\n for i in range(start, end):\n if sequence[i] > pivot:\n aux_idx += 1\n sequence[aux_idx], sequence[i] = sequence[i], sequence[aux_idx]\n\n sequence[aux_idx+1], sequence[end] = sequence[end], sequence[aux_idx+1]\n\n if sequence[aux_idx+1] >= aux_idx+2:\n h = aux_idx+2\n if h > hmax:\n hmax = h \n\n h = self.quick_sort_and_get_h(sequence, start=start, end=aux_idx)\n if h > hmax:\n hmax = h\n h = self.quick_sort_and_get_h(sequence, start=aux_idx+2, end=end)\n if h > hmax:\n hmax = h\n\n return hmax\n\n def hIndex(self, citations: List[int]) -> int:\n\n # brut force\n # runtime: O(n*2), space: O(1)\n \"\"\"\n hmax = 0\n for h in range(len(citations)):\n idx_cit = 0\n hcount = 0\n while idx_cit < len(citations):\n if citations[idx_cit] >= h:\n hcount += 1\n if hcount == h:\n hmax = hcount\n break\n return hmax\n \"\"\"\n #\n # runtime: O(n*2), space: O(n)\n \"\"\"\n citations_count_dct = {_cit: 0 for _cit in range(1,len(citations)+1)}\n h = 0\n for _cit in citations:\n for i in range(h+1,min(_cit+1, len(citations)+1)):\n citations_count_dct[i] += 1\n if citations_count_dct[i] == i:\n h = i\n del citations_count_dct[i]\n return h\n \"\"\"\n\n # First sort and then iterate through the ordered citations\n # runtime: O(n log n), space: O(1)\n \"\"\"\n self.quick_sort(citations) # O(n log n)\n\n # O(n)\n h=0\n for idx, cit in enumerate(citations):\n if cit >= idx+1:\n h = idx+1\n return h\n \"\"\"\n\n # Sort and directly find h-index\n # runtime: O(n log n), space: O(1)\n \"\"\"\n return self.quick_sort_and_get_h(citations)\n \"\"\"\n\n n_cits = len(citations)\n h_count = {idx: 0 for idx in range(n_cits+1)} # runtime: O(n), space: O(n)\n largest_h = len(citations)\n h_necessary_cits = largest_h - h_count[largest_h]\n\n\n # for loop: runtime O(n), space: O(n)\n for cit_idx, cit in enumerate(citations):\n\n # add its citations to count\n h_contribution = min(cit, largest_h)\n h_count[h_contribution] += 1\n h_necessary_cits = largest_h - h_count[largest_h]\n\n remaining_cits = n_cits - 1 - cit_idx\n if h_necessary_cits > remaining_cits:\n # largest_h is no longer possible\n\n # transfer its citations to previous h-index and remove it\n h_count[largest_h-1] += h_count[largest_h]\n del h_count[largest_h]\n\n # obtain new larget h-index and necessary citations\n largest_h -= 1\n h_necessary_cits = largest_h - h_count[largest_h]\n \n if h_necessary_cits <= 0:\n return largest_h\n\n return 0\n","runtime":"42"},{"code":"class Solution:\n\n def quick_sort(self, sequence, start=0, end=None):\n\n if end is None:\n end = len(sequence)-1\n\n if start >= end:\n return \n\n pivot = sequence[end]\n aux_idx = start - 1\n for i in range(start, end):\n if sequence[i] > pivot:\n aux_idx += 1\n sequence[aux_idx], sequence[i] = sequence[i], sequence[aux_idx]\n\n sequence[aux_idx+1], sequence[end] = sequence[end], sequence[aux_idx+1]\n\n self.quick_sort(sequence, start=start, end=aux_idx)\n self.quick_sort(sequence, start=aux_idx+2, end=end)\n\n\n def quick_sort_and_get_h(self, sequence, start=0, end=None):\n\n hmax = 0\n\n if end is None:\n end = len(sequence)-1\n\n if start >= end:\n if start == end and sequence[start] >= start+1:\n hmax = start+1\n return hmax\n\n pivot = sequence[end]\n aux_idx = start - 1\n for i in range(start, end):\n if sequence[i] > pivot:\n aux_idx += 1\n sequence[aux_idx], sequence[i] = sequence[i], sequence[aux_idx]\n\n sequence[aux_idx+1], sequence[end] = sequence[end], sequence[aux_idx+1]\n\n if sequence[aux_idx+1] >= aux_idx+2:\n h = aux_idx+2\n if h > hmax:\n hmax = h \n\n h = self.quick_sort_and_get_h(sequence, start=start, end=aux_idx)\n if h > hmax:\n hmax = h\n h = self.quick_sort_and_get_h(sequence, start=aux_idx+2, end=end)\n if h > hmax:\n hmax = h\n\n return hmax\n\n def hIndex(self, citations: List[int]) -> int:\n\n # brut force\n # runtime: O(n*2), space: O(1)\n \"\"\"\n hmax = 0\n for h in range(len(citations)):\n idx_cit = 0\n hcount = 0\n while idx_cit < len(citations):\n if citations[idx_cit] >= h:\n hcount += 1\n if hcount == h:\n hmax = hcount\n break\n return hmax\n \"\"\"\n #\n # runtime: O(n*2), space: O(n)\n \"\"\"\n citations_count_dct = {_cit: 0 for _cit in range(1,len(citations)+1)}\n h = 0\n for _cit in citations:\n for i in range(h+1,min(_cit+1, len(citations)+1)):\n citations_count_dct[i] += 1\n if citations_count_dct[i] == i:\n h = i\n del citations_count_dct[i]\n return h\n \"\"\"\n\n # First sort and then iterate through the ordered citations\n # runtime: O(n log n), space: O(1)\n \"\"\"\n self.quick_sort(citations) # O(n log n)\n\n # O(n)\n h=0\n print(citations)\n for idx, cit in enumerate(citations):\n if cit >= idx+1:\n h = idx+1\n return h\n \"\"\"\n\n # better approach, if we sort in decreasing order\n citations.sort()\n len_citations = len(citations)\n for idx, cit in enumerate(citations):\n if len_citations - idx <= cit:\n return len_citations - idx\n return 0\n\n\n # Sort and directly find h-index\n # runtime: O(n log n), space: O(1)\n \"\"\"\n return self.quick_sort_and_get_h(citations)\n \"\"\"\n \"\"\"\n n_cits = len(citations)\n h_count = {idx: 0 for idx in range(n_cits+1)} # runtime: O(n), space: O(n)\n largest_h = len(citations)\n h_necessary_cits = largest_h - h_count[largest_h]\n\n\n # for loop: runtime O(n), space: O(n)\n for cit_idx, cit in enumerate(citations):\n\n # add its citations to count\n h_contribution = min(cit, largest_h)\n h_count[h_contribution] += 1\n h_necessary_cits = largest_h - h_count[largest_h]\n\n remaining_cits = n_cits - 1 - cit_idx\n if h_necessary_cits > remaining_cits:\n # largest_h is no longer possible\n\n # transfer its citations to previous h-index and remove it\n h_count[largest_h-1] += h_count[largest_h]\n del h_count[largest_h]\n\n # obtain new larget h-index and necessary citations\n largest_h -= 1\n h_necessary_cits = largest_h - h_count[largest_h]\n \n if h_necessary_cits <= 0:\n return largest_h\n\n return 0\n \"\"\"","runtime":"42"},{"code":"class Solution:\n\n def quick_sort(self, sequence, start=0, end=None):\n\n if end is None:\n end = len(sequence)-1\n\n if start >= end:\n return \n\n pivot = sequence[end]\n aux_idx = start - 1\n for i in range(start, end):\n if sequence[i] > pivot:\n aux_idx += 1\n sequence[aux_idx], sequence[i] = sequence[i], sequence[aux_idx]\n\n sequence[aux_idx+1], sequence[end] = sequence[end], sequence[aux_idx+1]\n\n self.quick_sort(sequence, start=start, end=aux_idx)\n self.quick_sort(sequence, start=aux_idx+2, end=end)\n\n\n def quick_sort_and_get_h(self, sequence, start=0, end=None):\n\n hmax = 0\n\n if end is None:\n end = len(sequence)-1\n\n if start >= end:\n if start == end and sequence[start] >= start+1:\n hmax = start+1\n return hmax\n\n pivot = sequence[end]\n aux_idx = start - 1\n for i in range(start, end):\n if sequence[i] > pivot:\n aux_idx += 1\n sequence[aux_idx], sequence[i] = sequence[i], sequence[aux_idx]\n\n sequence[aux_idx+1], sequence[end] = sequence[end], sequence[aux_idx+1]\n\n if sequence[aux_idx+1] >= aux_idx+2:\n h = aux_idx+2\n if h > hmax:\n hmax = h \n\n h = self.quick_sort_and_get_h(sequence, start=start, end=aux_idx)\n if h > hmax:\n hmax = h\n h = self.quick_sort_and_get_h(sequence, start=aux_idx+2, end=end)\n if h > hmax:\n hmax = h\n\n return hmax\n\n def hIndex(self, citations: List[int]) -> int:\n\n # brut force\n # runtime: O(n*2), space: O(1)\n \"\"\"\n hmax = 0\n for h in range(len(citations)):\n idx_cit = 0\n hcount = 0\n while idx_cit < len(citations):\n if citations[idx_cit] >= h:\n hcount += 1\n if hcount == h:\n hmax = hcount\n break\n return hmax\n \"\"\"\n #\n # runtime: O(n*2), space: O(n)\n \"\"\"\n citations_count_dct = {_cit: 0 for _cit in range(1,len(citations)+1)}\n h = 0\n for _cit in citations:\n for i in range(h+1,min(_cit+1, len(citations)+1)):\n citations_count_dct[i] += 1\n if citations_count_dct[i] == i:\n h = i\n del citations_count_dct[i]\n return h\n \"\"\"\n\n # First sort and then iterate through the ordered citations\n # runtime: O(n log n), space: O(1)\n \"\"\"\n self.quick_sort(citations) # O(n log n)\n\n # O(n)\n h=0\n for idx, cit in enumerate(citations):\n if cit >= idx+1:\n h = idx+1\n return h\n \"\"\"\n\n # Sort and directly find h-index\n # runtime: O(n log n), space: O(1)\n \"\"\"\n return self.quick_sort_and_get_h(citations)\n \"\"\"\n\n n_cits = len(citations)\n h_count = {idx: 0 for idx in range(n_cits+1)}\n largest_h = len(citations)\n h_necessary_cits = largest_h - h_count[largest_h]\n\n for cit_idx, cit in enumerate(citations):\n\n # add its citations to count\n h_contribution = min(cit, largest_h)\n h_count[h_contribution] += 1\n h_necessary_cits = largest_h - h_count[largest_h]\n\n #if h_contribution < largest_h and h_necessary_cits > cit_idx:\n remaining_cits = n_cits - 1 - cit_idx\n #print(h_count, cit, largest_h, h_contribution, h_necessary_cits, remaining_cits)\n if h_necessary_cits > remaining_cits:\n # largest_h is no longer possible\n\n # transfer its citations to previous h-index and remove it\n h_count[largest_h-1] += h_count[largest_h]\n del h_count[largest_h]\n\n # obtain new larget h-index and necessary citations\n largest_h -= 1\n h_necessary_cits = largest_h - h_count[largest_h]\n \n if h_necessary_cits <= 0:\n return largest_h\n #print(largest_h, h_necessary_cits, h_count)\n return 0\n","runtime":"45"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort(reverse=False)\n h=0\n n = len(citations)\n for i,v in enumerate(citations):\n if v>=n-i:\n h=max(h,n-i)\n return h","runtime":"45"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort(reverse=True)\n if citations[0] == 0:\n return 0\n print(citations)\n for i in range(len(citations)):\n if citations[i] < (i + 1):\n return i\n\n return len(citations)\n\n ","runtime":"47"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n def num(l, x):\n out = 0\n for i in l:\n if i >= x:\n out += 1\n return out\n \n temp = citations\n temp.sort(reverse=True) # Sort in descending order to process citations from highest to lowest\n \n for i in range(len(temp)):\n if temp[i] >= i + 1: # Compare with the index + 1\n h = i + 1\n else:\n break\n \n return h if 'h' in locals() else 0 # Return h if it's defined, otherwise return 0\n","runtime":"47"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n if len(citations) <= 1:\n return 1 if citations[0] != 0 else 0\n citations.sort()\n ans = -1\n\n for i in range(len(citations)):\n ans = max(ans, min(len(citations) - i, citations[i]))\n\n return ans ","runtime":"50"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n for h in range(min(len(citations), max(citations)), -1, -1):\n cited_at_least_h_times = len([c for c in citations if c >= h])\n if cited_at_least_h_times >= h:\n return h\n","runtime":"50"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort()\n\n testNumber = citations[-1]\n while(True):\n\n if(testNumber <= len(citations)):\n change = False\n for i in range(testNumber):\n i = len(citations) - i - 1\n if(citations[i] < testNumber):\n change = True\n testNumber = testNumber - 1\n break\n if(change == False):\n return testNumber\n\n else:\n testNumber = testNumber - 1\n \n return -1\n\n\n\n \n ","runtime":"53"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n result = 0\n citations.sort()\n\n for i,val in enumerate(citations):\n if len(citations[i:]) <= val:\n result = max(result, len(citations[i:]))\n # print(val, len(citations[i:]))\n # result = min(val, len(citations[i:]))\n \n return result","runtime":"53"},{"code":"class Solution:\n def hIndex(self, citations: list[int]) -> int:\n # Sort the citations in descending order\n citations.sort(reverse=True)\n \n # Find the h-index\n h = 0\n for i, citation in enumerate(citations):\n if citation >= i + 1:\n h = i + 1\n else:\n break\n \n return h\n\n# Test the function\ncitations = [3, 0, 6, 1, 5]\nprint(Solution().hIndex(citations)) # Output: 3\n \n","runtime":"56"},{"code":"class Solution:\n\n def qsort(self, inlist):\n if inlist == []: \n return []\n else:\n pivot = inlist[0]\n lesser = self.qsort([x for x in inlist[1:] if x < pivot])\n greater = self.qsort([x for x in inlist[1:] if x >= pivot])\n return lesser + [pivot] + greater\n\n def hIndex(self, citations: List[int]) -> int:\n hindex = 0\n sort_citations = self.qsort(citations)\n size = len(citations)\n print(sort_citations)\n for i in range(len(sort_citations)):\n print(hindex, i, sort_citations[i], len(sort_citations)-i)\n if sort_citations[size-(i+1)] >= (i+1):\n hindex += 1\n else:\n break\n\n \n return hindex","runtime":"56"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n for h in range(min(len(citations), max(citations)), -1, -1):\n cited_at_least_h_times = len([c for c in citations if c >= h])\n if cited_at_least_h_times >= h:\n return h\n","runtime":"59"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n counter = {}\n n = len(citations)\n max_citations = max(citations)\n max_h = min(n, max_citations)\n\n\n \n\n print(f'max_h: {max_h}')\n for h in range(max_h, 0, -1):\n ## print(h)\n gt_h = [i >= h for i in citations]\n n_gt_h = sum(gt_h)\n ## print(f'n_gt_h: {n_gt_h}, h: {h}')\n if n_gt_h >= h:\n return h\n\n return 0\n ","runtime":"59"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n counter = {}\n n = len(citations)\n max_citations = max(citations)\n max_h = min(n, max_citations)\n\n\n \n\n print(f'max_h: {max_h}')\n for h in range(max_h, 0, -1):\n print(h)\n gt_h = [i >= h for i in citations]\n n_gt_h = sum(gt_h)\n print(f'n_gt_h: {n_gt_h}, h: {h}')\n if n_gt_h >= h:\n return h\n\n return 0\n ","runtime":"62"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h=min(len(citations),max(citations))\n for i in range(h,0,-1):\n count=0\n for j in range(len(citations)):\n count+=(citations[j]>=i)\n if count<h:\n h-=1\n else:\n return h\n return h","runtime":"62"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h, counter = 0, 0\n\n while True:\n h += 1\n for e in citations:\n if e >= h: \n counter += 1 \n if counter >= h:\n break\n if counter < h:\n return h - 1\n counter = 0","runtime":"65"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = 0\n stop = False\n max_cit = max(citations)\n while not stop:\n count = sum (cita >= max_cit for cita in citations)\n if count >= max_cit:\n stop = True\n h = max_cit\n else : \n max_cit -= 1\n return h\n\n ","runtime":"65"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n count = [0] * 1001\n '''\n [3,0,6,1,5]\n [5,4,3,3,2,2,1]\n 0,1,2,3,4,5,6\n '''\n for cite in citations:\n count[cite] += 1\n print(count)\n for i in range(len(count)-2, -1, -1):\n count[i] = count[i+1] + count[i]\n print(count)\n for i in range(len(count)-1, -1, -1):\n print(count[i])\n if i <= count[i]:\n return i\n return -1\n","runtime":"68"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n count = [0] * 1001\n '''\n [3,0,6,1,5]\n [5,4,3,3,2,2,1]\n 0,1,2,3,4,5,6\n '''\n for cite in citations:\n count[cite] += 1\n print(count)\n for i in range(len(count)-2, -1, -1):\n count[i] = count[i+1] + count[i]\n print(count)\n for i in range(len(count)-1, -1, -1):\n print(count[i])\n if i <= count[i]:\n return i\n return -1\n","runtime":"68"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h=min(len(citations),max(citations))\n for i in range(h,0,-1):\n count=0\n for j in range(len(citations)):\n count+=(citations[j]>=i)\n if count<h:\n h-=1\n else:\n return h\n return h","runtime":"71"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = max(citations)\n while h >= 0:\n count = sum(cites >= h for cites in citations)\n if count >= h:\n return h\n h -= 1\n \n return h","runtime":"71"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n hash = {}\n h_index = 0\n for c in citations:\n for i in range(h_index, c+1):\n hash[i] = 1 + hash.get(i, 0)\n if hash[i] >= i:\n h_index = i\n return h_index\n","runtime":"74"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n #have a for loop to go through each num\n #continue for loop as long as we're trying to meet this condition\n #have a counter and if counter is less than h continnue the loop\n #if we see a number that is greater than or equal to h we increment counter\n \n return self.hValid(0, citations) \n\n def hValid(self, h, arr):\n counter = 0\n for number in arr:\n if counter == h:\n return self.hValid(h+1, arr)\n break\n else:\n if number >= h:\n counter += 1\n return self.hValid(h+1, arr) if counter == h else h-1\n\n\n # 0 - just called hvalid 3\n # 1 - called h valid 3\n # 2 - call h valid return 3\n # 3 - call h valid at the return statenent returns 3\n # 4 - returns h -1 which is 3","runtime":"74"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h_index = 1\n citations = [cit for cit in citations if cit >= h_index]\n num_greater_citations = len(citations)\n while num_greater_citations >= h_index:\n h_index += 1\n citations = [cit for cit in citations if cit >= h_index]\n num_greater_citations = len(citations)\n return h_index -1","runtime":"77"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n max_h = 0\n for h in range(min(len(citations), max(citations)) + 1):\n citations = [c for c in citations if c >= h]\n if len(citations) >= h and h > max_h:\n max_h = h\n\n return max_h\n","runtime":"77"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n m = max(citations)\n while True:\n f = filter(lambda c: c >= m, citations)\n count = sum(1 for _ in f)\n if count < m:\n m -= 1\n else:\n return m","runtime":"80"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations = [i for i in citations if i != 0]\n if citations == []:\n return 0\n citations.sort()\n h = min(citations[0], len(citations))\n for i in range(len(citations)):\n if citations[i] > len(citations[i:]):\n h = max(h, len(citations[i:]))\n continue\n h = min(citations[i], len(citations[i:]))\n return h","runtime":"80"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n cntMax = 0\n for j in range(1000):\n\n cnt=0\n for i in citations:\n if i>j:\n cnt+=1\n if cnt > j:\n break\n if cntMax < cnt:\n cntMax = cnt\n if j>len(citations)-1:\n break\n return cntMax","runtime":"83"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n if len(citations) == 0:\n return 0\n \n index = 0 \n for i in range(1, len(citations) + 1):\n citations_ = []\n for j in citations:\n if j >= i:\n citations_.append(j)\n \n if len(citations_) >= i:\n index = i\n\n citations = citations_\n\n return index","runtime":"83"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n data = {}\n\n for x in citations:\n if x not in data:\n data[x] = 1\n else:\n data[x] += 1\n\n keys = sorted(data.keys())\n N = len(citations)\n n = N\n for h in range(N+1, -1, -1):\n s = 0\n for key in keys:\n if key >= h:\n s += data[key]\n \n if s >= h:\n return h\n\n \n","runtime":"89"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = 1\n cnt = 0\n i = 0\n\n while i < len(citations):\n # check if curr greater than citation\n if citations[i] >= h:\n cnt += 1\n # h += 1 and restart\n if cnt == h and i != (len(citations) - 1):\n i = 0\n cnt = 0\n h += 1\n continue\n i += 1\n\n if cnt >= h:\n return h\n else:\n return h - 1","runtime":"89"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = min(min(citations), len(citations))\n while len(citations) > h:\n h = min(citations)\n if h >= len(citations): return len(citations)\n citations = [x for x in citations if x > h]\n if len(citations) < h: return h\n \n return len(citations)\n","runtime":"92"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = min(min(citations), len(citations))\n while len(citations) > h:\n h = min(citations)\n if h >= len(citations): return len(citations)\n citations = [x for x in citations if x > h]\n if len(citations) < h: return h\n \n return len(citations)\n","runtime":"92"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n data = {}\n\n for x in citations:\n if x not in data:\n data[x] = 1\n else:\n data[x] += 1\n\n keys = data.keys()\n N = len(citations)\n n = N\n for h in range(N+1, -1, -1):\n s = 0\n for key in keys:\n if key >= h:\n s += data[key]\n \n if s >= h:\n return h\n\n \n","runtime":"95"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n potentials = [0]\n cur_h = 0\n citations.sort()\n for citation in citations:\n if citation > cur_h:\n potentials.append(citation)\n # try increase the cur_h\n while cur_h <= len(potentials):\n cur_h += 1\n\n # remove those lower than the cur_h\n removals = []\n for num in potentials:\n if num >= cur_h:\n removals.append(num)\n \n if len(removals) < cur_h:\n break\n else:\n potentials = removals\n cur_h -= 1\n \n return cur_h\n \n","runtime":"95"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n ans = 0\n ans_d = {}\n for i in citations:\n if i > ans:\n k = ans+1\n for j in range(k,i+1):\n if j not in ans_d:\n ans_d[j] = 1\n else:\n ans_d[j] += 1\n if ans_d[j] >= j and k > ans:\n ans = j\n return ans","runtime":"98"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n i = 0\n array = []\n while i <= len([citation for citation in citations if citation >= i]):\n array.append(i)\n i += 1\n\n return max(array)","runtime":"98"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n # we can create a list of length of the array. \n h_index_list = [0]*(len(citations)+1)\n # first index is number of papers cited at least 0 time\n # second index is number of papers cited at least 2 times\n for citation in citations:\n h_index_list[:citation+1] = [x+1 for x in h_index_list[:citation+1]]\n h_max = 0\n h_index = 0\n for i, h in enumerate(h_index_list):\n if h >= i:\n h_max = max(h_max, i) \n return h_max\n\n # sorted the paper first. \n sorted_citations = sorted(citations, reverse=False)\n for i, citation in sorted_citations:\n if citation >= i + 1:\n continue\n else:\n return citation - 1\n \n\n\n\n\n ","runtime":"101"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n\n citations.sort()\n maxK = 0\n temp = -1\n while temp <= 0:\n temp = maxK\n for i in range(len(citations)):\n \n if citations[i] >= maxK:\n temp -= 1\n \n if temp <= 0:\n maxK += 1\n break\n\n if maxK == 0:\n return 0\n \n return maxK-1\n \n ","runtime":"101"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n hIindex = 0\n sorted_citations = sorted(citations)\n for i in range(len(citations) + 1):\n count = 0\n for n in sorted_citations:\n if n >= i:\n count += 1\n\n if count >= i:\n hIndex = i\n else:\n break\n \n return hIndex\n ","runtime":"104"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n\n citations.sort()\n maxK = 0\n temp = -1\n while temp <= 0:\n temp = maxK\n for i in range(len(citations)):\n \n if citations[i] >= maxK:\n temp -= 1\n \n if temp <= 0:\n maxK += 1\n break\n\n if maxK == 0:\n return 0\n \n return maxK-1\n \n ","runtime":"104"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n max = 0\n curr = -1\n citations = sorted(citations)\n for i in range(len(citations)):\n temp = 0\n if citations[i] > curr:\n curr = citations[i]\n for j in range(i, len(citations)):\n if citations[j] >= curr:\n temp += 1\n if min(temp, curr) > max:\n max = min(temp, curr)\n return max","runtime":"106"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = {}\n h_index = 0\n n_papers = len(citations)\n for c in citations:\n for i in range(h_index,min(c, n_papers)+1):\n # print(h)\n if i not in h.keys():\n h[i] = 1\n else:\n h[i]+=1\n if h[i] >= i and i > h_index:\n h_index = i\n return h_index\n ","runtime":"106"},{"code":"from collections import defaultdict\nclass Solution:\n def hIndex(self, citations: List[int]) -> int:\n d=defaultdict(int)\n citations_sorted=sorted(citations,reverse=True)\n prev=citations_sorted[0]\n for j in citations_sorted:\n for i in range(0,j+1):\n d[i]+=1\n for x in range(prev,j,-1):\n if x<=d[x]:\n return x\n for x in range(citations_sorted[-1],-1,-1):\n if x<=d[x]:\n return x\n\n\n","runtime":"109"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort(reverse=True)\n H_ind=float('-inf')\n max_cit=max(citations)+1\n curr_count=0\n for i in range(1,max_cit):\n if(i<=len(citations) ):\n curr_count=len([k for k in citations if k>=i ])\n if(curr_count>=i):\n curr_h=i\n H_ind=max(H_ind,curr_h)\n else:\n break\n if H_ind==float('-inf'):\n H_ind=0\n return H_ind","runtime":"109"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = {}\n h_index = 0\n for c in citations:\n if c > h_index:\n for i in range(h_index,c+1):\n # print(h)\n if i not in h.keys():\n h[i] = 1\n else:\n h[i]+=1\n if h[i] >= i and i > h_index:\n h_index = i\n return h_index\n ","runtime":"112"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort()\n max_hIndex = 0\n for i in range(citations[-1]+1):\n papers = 0\n for j in citations:\n if j >= i:\n papers += 1\n\n if papers >= i:\n max_hIndex = i\n else:\n return max_hIndex\n return max_hIndex\n\n\n \"\"\"\n if citations[0] > length:\n return length\n\n\n for i in range(length):\n hIndex_tmp = citations[i]\n if len(citations[i:]) >= hIndex_tmp:\n if hIndex_tmp > max_hIndex:\n max_hIndex = hIndex_tmp\n else:\n return max_hIndex\n return max_hIndex\n \"\"\"","runtime":"112"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n counts = {}\n for item in citations:\n if item in counts.keys():\n counts[item] += 1\n else:\n counts[item] = 1\n h = 0\n for i in range(len(citations)+1):\n cit_count = 0\n for item in counts.keys():\n if item >= i:\n cit_count += counts[item]\n if cit_count >= i and i > h:\n h = i\n return h\n","runtime":"115"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n\n for hIndex in range(n):\n count = 0\n for citation in citations:\n if citation > hIndex:\n count += 1\n \n if hIndex >= count:\n return hIndex\n return n\n","runtime":"115"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n mx=0\n for i in range(max(citations)+1):\n x=0\n for j in citations:\n if j>=i:x+=1\n if x>=i and i>mx:mx=i\n return mx\n \n\n","runtime":"118"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n\n n = len(citations)\n\n \n for l in range(0,n+1):\n #count how many paper has at least l citation\n count = [1 for cite in citations if cite>=l]\n if len(count)<l:\n return l-1 \n \n return n\n\n\n ","runtime":"118"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = 0\n max_num = max(citations)\n for i in range(1, max_num + 1):\n papers_over_i = [i for c in citations if c >= i]\n num_papers = len(papers_over_i)\n if num_papers >= i and i >= h :\n h = i\n\n return h","runtime":"121"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort()\n mx=0\n for i in range(max(citations)+1):\n x=0\n for j in citations:\n if j>=i:x+=1\n if x>=i and i>mx:mx=i\n return mx\n \n\n","runtime":"121"},{"code":"from copy import deepcopy\nclass Solution:\n def hIndex(self, citations: List[int]) -> int:\n cur_h = 0\n while(True):\n s = 0\n for c in citations:\n if c>=cur_h:\n s+=1\n\n if s>=cur_h:\n cur_h+=1\n else:\n return cur_h-1\n ","runtime":"124"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n\n # n^2 implementation\n h = 0\n for v in range(1, max(citations)+1):\n h_count = 0\n for c in citations:\n if c >= v:\n h_count += 1\n\n if h_count >= v:\n h = v\n return h\n\n","runtime":"124"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = 0\n count = 0\n while count >= h:\n count = 0\n h += 1 \n for num in citations:\n if num >= h:\n count += 1\n \n return h - 1\n ","runtime":"127"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n maximum = 0\n count = 0\n for i in range(1, max(citations)+1):\n for n in citations:\n if n>=i:\n count += 1\n if count >= i:\n maximum = i\n count = 0\n return maximum\n\n\n","runtime":"127"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n hcond = True\n loops = 0\n while hcond == True:\n citations = [cite for cite in citations if cite > 0]\n loops += 1\n if loops <= len(citations):\n hcond = True\n else:\n hcond = False\n\n citations = [cite - 1 for cite in citations]\n\n return loops - 1","runtime":"130"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n max_h = len(citations)\n min_h = 0\n h = (max_h + min_h) // 2\n best_h = None\n while True:\n c = 0\n for i in citations:\n if i >= h:\n c += 1\n if c < h:\n h -= 1\n if best_h != None:\n return best_h\n else:\n best_h = h\n h += 1\n print(h)\n\n","runtime":"130"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n N = len(citations)\n hindex = [0]*N\n result = 0\n for i in range(N):\n for j in range(min(N,citations[i])):\n hindex[j] += 1\n print(hindex)\n for k in range(N):\n if hindex[k] >= k+1:\n result = k+1\n return result","runtime":"133"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n def counting_sort(arr):\n n = len(arr)\n count = [0] * (n + 1)\n\n for num in arr:\n for i in range(min(num + 1, n + 1)):\n count[i] += 1\n return count\n\n count = counting_sort(citations)\n h_index = 0\n for i, val in enumerate(count):\n if val >= i:\n h_index = i\n else:\n break\n return h_index","runtime":"133"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n psbl_index = max(citations)\n highest_h = 0\n if psbl_index == 0:\n return 0\n while psbl_index > 0:\n\n counter = 0\n for n in citations:\n\n if n >= psbl_index:\n counter += 1\n if counter >= psbl_index:\n highest_h = max(psbl_index, highest_h)\n psbl_index -= 1\n return highest_h","runtime":"136"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n def counting_sort(arr):\n n = len(arr)\n count = [0] * (n + 1)\n\n for num in arr:\n for i in range(min(num + 1, n + 1)):\n count[i] += 1\n return count\n\n count = counting_sort(citations)\n h_index = 0\n for i, val in enumerate(count):\n if val >= i:\n h_index = i\n return h_index","runtime":"136"},{"code":"class Solution:\n '''\n - h-index has point of inflection\n -- after certain h-index it will become invalid and stay that way\n - we can do count sort and keep a >= count of each citation\n - then do binary search on possible h-index\n '''\n def hIndex(self, citations: List[int]) -> int:\n #there are at least this many citations\n citation_count = [0]*(len(citations)+2)\n\n for c in citations:\n for i in range(min(c+1, len(citations)+1)):\n citation_count[i] += 1\n # print(citation_count)\n for i in range(len(citations)+1, -1, -1):\n if(citation_count[i] >= i):\n return i","runtime":"139"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n maxCita = max(citations)\n stack = [0] * (maxCita + 1)\n for cita in citations:\n for i in range(cita+1):\n stack[i] += 1\n for i in range(len(stack)-1,-1,-1):\n if stack[i] >= i:\n return i\n\n ","runtime":"139"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n length = len(citations)\n stack = [0] * (length + 1)\n for cita in citations:\n for i in range(min(cita,length)+1):\n stack[i] += 1\n for i in range(len(stack)-1,-1,-1):\n if stack[i] >= i:\n return i\n\n ","runtime":"142"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n maxCitations = 0\n for y in range(len(citations)):\n if len([x for x in citations if x >= y + 1]) >= y + 1:\n maxCitations = y + 1\n else:\n break\n\n return maxCitations\n ","runtime":"142"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h_index = [0 for i in range(max(citations))]\n for citation in citations:\n citation_idx = citation-1\n for i in range(citation_idx, -1, -1):\n h_index[i] += 1\n best = 0\n for i in range(len(h_index)):\n is_candidate = h_index[i] >= i + 1\n if is_candidate:\n best = i + 1\n return best\n\n \n \n ","runtime":"145"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n sorted_citations = sorted(citations)\n print(sorted_citations)\n # counts = list(Counter(citations)).sort(key=lambda item: item[1])\n # print(count)\n \n result = 0\n for number in range(0,sorted_citations[len(sorted_citations)-1]+1):\n print('00000000000000000000')\n current_count = sum(1 for x in sorted_citations if x >= number)\n print('number', number)\n print('current_count', current_count)\n if number > result and current_count >= number:\n result = number\n print('-------------------')\n return result\n ","runtime":"145"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n arr = [0] * (max(citations) + 1)\n for n in citations:\n for x in range(1, n +1):\n arr[x] += 1\n for y in range(len(arr) -1, -1, -1):\n if arr[y] >= y:\n return y","runtime":"148"},{"code":"class Solution:\n '''\n - h-index has point of inflection\n -- after certain h-index it will become invalid and stay that way\n - we can do count sort and keep a >= count of each citation\n - then do binary search on possible h-index\n '''\n def hIndex(self, citations: List[int]) -> int:\n #there are at least this many citations\n citation_count = [0]*(len(citations)+2)\n\n for c in citations:\n for i in range(min(c+1, len(citations)+1)):\n citation_count[i] += 1\n # print(citation_count)\n for i in range(len(citations)+1, -1, -1):\n if(citation_count[i] >= i):\n return i","runtime":"148"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n # hIndex <= len(citations)\n n = len(citations)\n h = [0] * (n+1)\n for c in citations:\n for i in range(min(c+1, n+1)):\n h[i] += 1\n # print(h)\n for i in range(n, -1, -1):\n if h[i] >= i:\n return i\n\n # citations.sort()\n # n = len(citations)\n # for i in range(n):\n # h = citations[i]\n # num_greater_or_equal = n-i","runtime":"151"},{"code":"class Solution:\n def count_citations(self, citations: List[int], element: int) -> int:\n count = 0\n for i in range(len(citations)):\n if citations[i] >= element:\n count += 1\n return count\n\n def hIndex(self, citations: List[int]) -> int:\n h_index = 0\n citations.sort()\n for i in range(len(citations)):\n count = self.count_citations(citations, i + 1)\n if i + 1 > count:\n break\n h_index += 1\n \n return h_index","runtime":"151"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n\n if len(citations) == 1:\n if citations[0] != 0:\n return 1\n else:\n return 0\n\n citations.sort()\n hindex = 0\n curr = 0\n while curr <= len(citations):\n print(hindex)\n count = 0\n for i in range(len(citations)):\n if citations[i] > hindex:\n count+=1\n if count >= curr:\n hindex = curr\n else:\n break\n curr += 1\n return hindex\n \n\n\n \n ","runtime":"154"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort()\n m: int = 0\n\n for i in range(len(citations)):\n if citations[i] < m:\n continue\n curr_count = 1\n l = i + 1\n r = len(citations) - 1\n while l <= r:\n if curr_count > citations[i]:\n break\n if citations[l] >= citations[i]:\n curr_count += 1\n if l != r and citations[r] >= citations[i]:\n curr_count += 1\n l += 1\n r -= 1\n \n print(f' c_c={curr_count}, citations[i]={citations[i]}')\n if curr_count >= citations[i]:\n m = citations[i]\n elif curr_count > m:\n m = curr_count\n\n return m\n ","runtime":"154"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n paper_count = [0 for i in range(len(citations))]\n for i in range(len(citations)):\n idx = citations[i]-1\n if(idx >= len(citations)):\n idx = len(citations)-1\n while(idx >=0):\n paper_count[idx]+=1\n idx-=1\n print(paper_count)\n for i in range(len(paper_count)-1, -1, -1):\n if(paper_count[i] >= i+1):\n return i+1\n return 0\n\n\n\n\n\n\n\n# hIDX = 0\n# minimum = 0\n# isWork = True\n# for i in range(len(citations)):\n# counter = 0\n# isWork = True\n# for j in range(len(citations)):\n# if(citations[j] < len(citations)-i):\n# # print(counter)\n# counter+=1\n# if(len(citations) - counter < len(citations) - i):\n# #print(\"HERE AT \" + str(len(citations) - counter) + str(len(citations)-i))\n# isWork = False\n# break\n# if(isWork):\n# return len(citations)-i\n# return 0","runtime":"157"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n counts = [0] * (n + 1)\n # print(\"counts: {}\".format(counts))\n for c in range(n):\n v = citations[c]\n # print(\"c: {}, v: {}\".format(c, v))\n for i in range(min(n, v) + 1):\n if i == 0:\n continue\n counts[i] += 1\n # print(\"i: {}, counts: {}\".format(i, counts))\n \n r = range(n, 0, -1)\n # print(\"scan range: {}\".format(r))\n for i in r:\n v = counts[i]\n # print(\"scan i: {}, v: {}\".format(i, v))\n if v >= i:\n return i\n return 0","runtime":"157"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n # if citations==[1,2,2]:\n # return 2\n # citation=list(set(citations))\n citations.sort()\n ans=0\n while True: \n cnt=0\n for i in range(len(citations)):\n # for j in range(len(citation)):\n # if citation[i]>ans:\n # cnt+=1\n # else:\n # break\n if ans<=citations[i]:\n cnt+=1\n if cnt>=ans:\n ans+=1\n else:\n return ans-1 \n return ans-1\n","runtime":"160"},{"code":"class Solution:\n '''\n - h-index has point of inflection\n -- after certain h-index it will become invalid and stay that way\n - we can do count sort and keep a >= count of each citation\n - then do binary search on possible h-index\n '''\n def hIndex(self, citations: List[int]) -> int:\n #there are at least this many citations\n citation_count = [0]*(len(citations)+2)\n\n for c in citations:\n for i in range(min(c+1, len(citations)+1)):\n citation_count[i] += 1\n # print(citation_count)\n for i in range(len(citations)+1, -1, -1):\n if(citation_count[i] >= i):\n return i","runtime":"160"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n d = [0 for _ in range(5001)]\n for x in citations:\n for i in range(1,x+1):\n d[i] += 1\n mx = 0\n for i, x in enumerate(d):\n if x >= i:\n mx = max(i, mx)\n return mx","runtime":"163"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = -1\n test = True\n\n while test == True:\n temp = 0\n for i in range(len(citations)):\n if citations[i] > h:\n temp += 1\n\n if temp >= h + 1:\n\n print(h)\n h += 1\n else: \n test = False\n\n return h\n\n\n ","runtime":"163"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n N = len(citations)\n if N == 1:\n return 1 if citations[0] else 0\n\n for h in range(N + 1):\n cnt = 0\n for j in range(N):\n if citations[j] >= h:\n cnt += 1\n if cnt < h:\n h -= 1\n break\n\n return h\n \n ","runtime":"165"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = 1\n counter = 0\n while True:\n for i in range(0, len(citations)):\n if citations[i] >= h:\n counter += 1\n if counter < h:\n return h - 1\n counter = 0\n h += 1","runtime":"165"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n citations.sort()\n self.quicksort(citations, 0, n-1)\n \n for i in range(0, n):\n rest = n-i\n \n if rest <= citations[i]:\n return rest\n return 0\n \n \n def quicksort(self, arr, low, high):\n if low < high:\n p = self.partition(arr, low, high)\n self.quicksort(arr, low, p-1)\n self.quicksort(arr, p+1, high)\n def partition(self, arr, low, high):\n p = arr[high]\n i = low -1\n for j in range(i, high):\n if arr[j] < p:\n i+=1\n arr[j], arr[i] = arr[i], arr[j]\n arr[i+1], arr[high] = arr[high], arr[i+1]\n return i+1\n","runtime":"168"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n \n h = 0\n for i in range(1, len(citations) + 1):\n current = sum(x >= i for x in citations)\n if current < i:\n break\n else:\n h = i\n \n return h","runtime":"168"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n c = 1\n for p in citations:\n a = 0\n for i in citations:\n if (i - c) >= 0:\n a += 1\n if a >= c:\n c += 1\n else:\n break\n return (c-1)\n \n","runtime":"171"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = 1\n num_papers = 0\n res = []\n\n while h!= -1:\n for i in range(len(citations)):\n if citations[i] >= h:\n num_papers += 1\n \n \n if num_papers >= h:\n res.append(h)\n h += 1\n \n else:\n return h-1\n h = -1\n break\n \n num_papers = 0\n ","runtime":"171"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n ss = 0\n index_h = 0\n for i in range(1,len(citations)+1):\n ss = sum(x >= i for x in citations)\n if ss>=i:\n index_h=i\n elif index_h>0:\n break\n return index_h\n\n ","runtime":"174"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h=0\n leng=len(citations)\n if leng==1 and citations[0]==0:\n return 0\n elif leng==1 and citations[0]>0:\n return 1\n for i in range(0,leng+2):\n temp=sum(k >= i for k in citations)\n print('temp',temp,'i',i)\n if temp>=i:\n continue\n else:\n return i-1\n ","runtime":"174"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations = sorted(citations)\n citations = list(filter(lambda x : x > 0, citations))[::-1]\n if len(citations) == 0:\n return 0\n for i in range(len(citations)):\n print(citations, i)\n if citations[i] <= i:\n return i\n return len(citations)\n ","runtime":"180"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n #[3,8,0,6,1,5] remove 0s\n #[3,8,6,1,5] h=1\n\n #[2,7,5,0,4] remove 0s\n #[2,7,5,4] h=2\n\n\n #[1,6,4,3] h=3\n\n #[0,5,3,2] remove 0s\n #[5,3,2] h=4\n\n h = 0\n while h <= len(citations):\n citations = [c for c in citations if c != 0]\n for i in range(len(citations)):\n citations[i] -= 1\n\n h += 1 \n \n return h-1\n\n","runtime":"180"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h_list = []\n for citation in citations:\n if citation not in h_list:\n num_citation = sum(1 for x in citations if x >= citation)\n if num_citation >= citation:\n h_list.append(citation)\n else:\n h_list.append(num_citation)\n \n return max(h_list)\n ","runtime":"183"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n ans = 0\n for h in range(0, 5001):\n nonNegative = 0\n for c in citations:\n if c - h >= 0:\n nonNegative += 1\n if nonNegative < h:\n ans = h - 1\n break\n return ans","runtime":"183"},{"code":"import numpy as np\n\nclass Solution:\n def hIndex(self, citations: List[int]) -> int:\n count_per_citations = np.zeros(max(citations) + 1)\n for citation in citations:\n count_per_citations[:citation+1] += 1\n print(count_per_citations)\n \n max_h = 0\n for i in range(len(count_per_citations)):\n if count_per_citations[i] >= i:\n max_h = i\n else:\n return max_h\n return max_h","runtime":"186"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n z = defaultdict(set)\n for i in range(len(citations)):\n for j in range(citations[i]):\n z[j].add(i)\n i = 0\n while(len(z[i]) > i):\n i += 1\n return i","runtime":"186"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n sorted_citations = sorted(citations)\n cit_counts = {n: 0 for n in range(max(sorted_citations) + 1)} # keys: num citations, values num papers\n for citation_count in sorted_citations:\n for n in range(citation_count + 1):\n cit_counts[n] += 1\n\n return max(cc for cc, num_papers in cit_counts.items() if num_papers >= cc)\n \n","runtime":"189"},{"code":"import numpy as np\n\nclass Solution:\n def hIndex(self, citations: List[int]) -> int:\n sorted_citations = np.array(sorted(citations))\n counts = 1 + np.arange(len(sorted_citations))[::-1]\n hindex = 0\n\n for i, cit in enumerate(sorted_citations):\n if cit >= counts[i] and counts[i] > hindex:\n hindex = counts[i]\n\n return hindex","runtime":"189"},{"code":"class Solution:\n '''\n - a more efficient solution is to not interate and update entire dict\n - only \n '''\n def hIndex(self, citations: List[int]) -> int:\n #there are at least this many citations\n citation_count = defaultdict(int)\n\n for c in citations:\n for i in range(min(c+1, len(citations)+1)):\n citation_count[i] += 1\n # print(citation_count)\n for i in range(len(citations)+1, -1, -1):\n if(citation_count[i] >= i):\n return i","runtime":"192"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n #[3,8,0,6,1,5] remove 0s\n #[3,8,6,1,5] h=1\n\n #[2,7,5,0,4] remove 0s\n #[2,7,5,4] h=2\n\n #[1,6,4,3] h=3\n\n #[0,5,3,2] remove 0s\n #[5,3,2] h=4\n \n h = 0\n while h <= len(citations):\n citations = [c for c in citations if c != 0]\n for i in range(len(citations)):\n citations[i] -= 1\n\n h += 1 \n \n return h-1\n\n","runtime":"192"},{"code":"import numpy as np\n\nclass Solution:\n def hIndex(self, citations: List[int]) -> int:\n n=len(citations)\n citations=np.sort(citations)\n if max(citations)==0:\n return 0\n else:\n i = 0\n while i <= n:\n if citations[i] >= n-i:\n return n-i\n i+=1\n","runtime":"195"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n d = defaultdict(int)\n\n n = len(citations)\n\n for i in range(0,n):\n for i in range(1,citations[i]+1):\n d[i] +=1\n\n ans = 0\n for k,v in d.items():\n if v >= k:\n ans = max(ans,k)\n\n return ans\n","runtime":"195"},{"code":"import numpy as np\n\nclass Solution:\n def hIndex(self, citations: List[int]) -> int:\n count_per_citations = np.zeros(max(citations) + 1)\n for citation in citations:\n count_per_citations[:citation+1] += 1\n \n max_h = 0\n for i in range(len(count_per_citations)):\n if count_per_citations[i] >= i:\n max_h = i\n else:\n return max_h\n return max_h","runtime":"198"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n d = collections.defaultdict(lambda: 0)\n \n for c in citations:\n for i in range(c+1):\n d[i] += 1\n \n arr = []\n \n for e in d.keys():\n if e <= d[e]:\n arr.append(e)\n \n return max(arr)\n ","runtime":"198"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n c_max = max(citations)\n h = 0\n for i in range(c_max + 1):\n n = 0\n for j in range(len(citations)):\n if citations[j] >= i:\n n += 1\n if n >= i:\n h = i\n print(\"i, j, n, h\", i, j, n, h)\n\n return(h)\n ","runtime":"201"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n if len(citations) == 1 and citations[0] >= 1: return 1\n citations.sort(reverse = True)\n i, h, = 0, 0\n while i < len(citations):\n c = [x for x in citations if x >= citations[i]] \n if len(c) >= citations[i] and h < citations[i]:\n return citations[i]\n else:\n c = [x for x in citations if x >= (i + 1)] \n # print(f\"c: {c}\")\n # print(f\"i+1: {(i + 1)} len(c): {len(c)}\")\n if len(c) >= (i + 1) and h < (i + 1):\n h = (i + 1)\n # print(f\"h: {h}\")\n i += 1\n # print(h)\n return h","runtime":"201"},{"code":"class Solution:\n '''\n - h-index has point of inflection\n -- after certain h-index it will become invalid and stay that way\n - we can do count sort and keep a >= count of each citation\n - then do binary search on possible h-index\n '''\n def hIndex(self, citations: List[int]) -> int:\n #there are at least this many citations\n citation_count = defaultdict(int)\n\n for c in citations:\n for i in range(min(c+1, len(citations)+1)):\n citation_count[i] += 1\n # print(citation_count)\n for i in range(len(citations)+1, -1, -1):\n if(citation_count[i] >= i):\n return i","runtime":"204"},{"code":"import numpy as np\n\nclass Solution:\n def hIndex(self, citations: List[int]) -> int:\n sorted_citations = sorted(citations, reverse=True)\n h_idx = 0\n for i in range(len(sorted_citations)):\n h_idx = max(h_idx, min(i + 1, sorted_citations[i]))\n # if i + 1 >= sorted_citations[i]:\n # return sorted_citations[i]\n return h_idx","runtime":"204"},{"code":"from typing import Final\n\n\nclass Solution:\n MAX_CITATIONS: Final[int] = 1000\n\n def hIndex(self, citations: list[int]) -> int:\n # method 1: linear search for h\n for h in range(Solution.MAX_CITATIONS + 1):\n if not self.checkH(citations, h):\n return h - 1\n return Solution.MAX_CITATIONS\n\n # method 2: binary search for h\n # min_h = 0\n # max_h = min(max(citations), len(citations))\n # h: int = max_h // 2\n\n def checkH(self, citations: list[int], h: int) -> bool:\n return len(list(filter(lambda e: e >= h, citations))) >= h","runtime":"207"},{"code":"class Solution:\n '''\n - h-index has point of inflection\n -- after certain h-index it will become invalid and stay that way\n - we can do count sort and keep a >= count of each citation\n - then do binary search on possible h-index\n '''\n def hIndex(self, citations: List[int]) -> int:\n #there are at least this many citations\n citation_count = defaultdict(int)\n\n for c in citations:\n for i in range(c+1):\n citation_count[i] += 1\n # print(citation_count)\n for i in range(max(citations)+1, -1, -1):\n if(citation_count[i] >= i):\n return i\n \n \n \n\n ","runtime":"207"},{"code":"class Solution:\n '''\n - a more efficient solution is to not interate and update entire dict\n - only \n '''\n def hIndex(self, citations: List[int]) -> int:\n #there are at least this many citations\n citation_count = defaultdict(int)\n\n for c in citations:\n for i in range(min(c+1, len(citations)+1)):\n citation_count[i] += 1\n # print(citation_count)\n for i in range(len(citations)+1, -1, -1):\n if(citation_count[i] >= i):\n return i","runtime":"210"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n if len(citations) == 1:\n return min(1, citations[0])\n\n dict = defaultdict(int)\n\n for i in citations:\n for j in range(i, 0, -1):\n dict[j] += 1\n\n def helper(k):\n if dict[k] < k:\n return 0\n return k\n\n if not dict:\n return 0\n \n #return largest key k such that dict[k] >= k\n return max(dict, key=helper)","runtime":"210"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n # n^2 sol\n res = 0\n\n for i in range(1, 1000):\n num_citations_needed = i\n\n for j in range(len(citations)): \n if citations[j] >= i:\n num_citations_needed -= 1\n \n if num_citations_needed <= 0:\n res = max(res, i) \n \n return res\n ","runtime":"213"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n counter = defaultdict(lambda: 0)\n\n for count in citations:\n for i in range(count + 1):\n counter[i] += 1\n \n return max(h for h in counter if counter[h] >= h)\n","runtime":"213"},{"code":"class Solution:\n '''\n - h-index has point of inflection\n -- after certain h-index it will become invalid and stay that way\n - we can do count sort and keep a >= count of each citation\n - then do binary search on possible h-index\n '''\n def hIndex(self, citations: List[int]) -> int:\n #there are at least this many citations\n citation_count = defaultdict(int)\n\n for c in citations:\n for i in range(c+1):\n citation_count[i] += 1\n # print(citation_count)\n for i in range(max(citations)+1, -1, -1):\n if(citation_count[i] >= i):\n return i\n \n \n \n\n ","runtime":"216"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort()\n count_dict = defaultdict(int)\n\n result, i = 0, 0\n \n # [0, 1, 3, 5, 6]\n\n while i != len(citations):\n if citations[i] < result:\n i += 1\n elif citations[i] >= result:\n for j in range(0, min(citations[i], len(citations) + 1)):\n count_dict[j] += 1\n if count_dict[result] > result:\n result += 1\n i += 1\n return result","runtime":"216"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n # last bucket holds all values larger than size of arr n\n buckets = {i:0 for i in range(n+1)}\n for cite in citations:\n if cite >= n:\n buckets[n] += 1\n temp = min(cite, n-1) \n while temp != 0:\n buckets[temp] += 1\n temp -= 1\n for key in sorted(list(buckets.keys()), reverse=True):\n print(\"Curr H:\\t\", key, \"Count:\\t\", buckets[key])\n if key <= buckets[key]:\n return key\n return 0","runtime":"219"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n \n\n from collections import defaultdict\n\n d = defaultdict(int)\n\n for ind,item in enumerate(citations):\n for i in range(item):\n d[i+1] += 1\n\n # print(d)\n k = 0\n for k,v in d.items():\n\n if v < k:\n break\n\n else:\n return k if d else 0\n\n\n return k-1 if d else 0\n","runtime":"219"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n for i in range(n, -1, -1):\n if len([c for c in citations if c >= i]) >= i:\n return i\n","runtime":"222"},{"code":"import numpy as np\n\nclass Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n h = 0\n citations = np.array(citations)\n\n for i in range(1, n+ 1):\n n_citatios = np.sum(citations >= i)\n if n_citatios >= i:\n h = i\n return h\n ","runtime":"222"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n \n # TERRIBLE SOLUTION \n # if len(citations) == 1 and citations[0] > 0:\n # return 1\n # if len(citations) == 1 and citations[0] == 0:\n # return 0\n # you could sort and iterate from the highest to lowest and when len(curr)>= i, just return i\n \n # max_so_far = 0\n # for i in range(0, len(citations) + 1):\n # curr = [x for x in citations if x >= i]\n # if len(curr) >= i:\n # x = i\n # else:\n # x= 0\n # max_so_far = max(max_so_far, x)\n # return max_so_far\n\n # Same sort of idea but still terrible runtime\n # sorted_citations = sorted(citations)\n # max_so_far = 0\n # for i in range(len(citations), -1, -1):\n # curr = [x for x in citations if x >= i]\n # if len(curr) >= i:\n # return i\n # return max_so_far\n\n # sorted_citations = sorted(citations)\n max_so_far = 0\n for i in range(len(citations), -1, -1):\n curr = [x for x in citations if x >= i]\n if len(curr) >= i:\n return i\n return max_so_far","runtime":"224"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = 0\n counter = len(citations)\n while counter >= 0:\n new = [x for x in citations if x >= counter]\n if len(new) >= counter:\n h = counter\n return h\n counter -= 1\n return h\n \n ","runtime":"227"},{"code":"import numpy as np\n\nclass Solution:\n def hIndex(self, citations: List[int]) -> int:\n count_per_citations = np.zeros(max(citations) + 1)\n for citation in citations:\n count_per_citations[:citation+1] += 1\n for i in range(len(count_per_citations) - 1, -1, -1):\n if count_per_citations[i] >= i:\n return i\n return 0","runtime":"227"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n max_h_num = len(citations)\n h_num = 0\n for h in reversed(range(max_h_num +1)):\n enough_cit = [x for x in citations if x >= h]\n # print(len(enough_cit))\n # print(f'h number {h}')\n if h <= len(enough_cit):\n return h\n return h_num\n ","runtime":"230"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n # citations.sort()\n # h_max = min(citations[-1], len(citations))\n h_max = len(citations)\n\n while 1:\n account = len([num for num in citations if num >= h_max])\n if account >= h_max:\n return h_max\n h_max -= 1\n\n\n","runtime":"230"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n for i in range(len(citations),0,-1):\n reviewed = [x for x in citations if x >= i]\n if len(reviewed) >= i:\n return(i)\n return 0","runtime":"233"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n\n cite_dict = {k:0 for k in citations}\n for i in citations:\n for k in cite_dict.keys():\n if i>=k:\n cite_dict[k] += 1\n\n best_score = 0\n # cases where author has many papers and fewer citation se.g. [3,0,6,1,5]\n for k,v in sorted( cite_dict.items(), reverse=True ):\n if v>=k and k>best_score:\n best_score = k\n \n #cases where fewer papers and more citations e.g. [11, 15]\n for v,k in sorted(zip(cite_dict.values(), cite_dict.keys()), reverse = True):\n if k>=v and v>best_score:\n best_score = v\n \n return best_score","runtime":"233"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n \n # TERRIBLE SOLUTION \n # if len(citations) == 1 and citations[0] > 0:\n # return 1\n # if len(citations) == 1 and citations[0] == 0:\n # return 0\n # you could sort and iterate from the highest to lowest and when len(curr)>= i, just return i\n sorted_citations = sorted(citations)\n max_so_far = 0\n for i in range(len(citations), -1, -1):\n curr = [x for x in citations if x >= i]\n if len(curr) >= i:\n return i\n \n ","runtime":"236"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n \"\"\"\n hIndex is max h such that there are at least citations[i] each >= h\n [3, 0, 6, 1, 5]\n 3 6 5\n 0 6 1 5\n 6\n 1 5\n\n 4: 4 4\n\n [0, 3, 2, 0]\n 0: 0, 3\n 3: 3\n 2: 3\n \"\"\"\n citation_to_geq_count = {}\n for citation in citations:\n if citation not in citation_to_geq_count:\n citation_to_geq_count[citation] = 0\n for citation in citations:\n for key in citation_to_geq_count:\n if citation >= key:\n citation_to_geq_count[key] += 1\n if citation not in citation_to_geq_count:\n citation_to_geq_count[citation] = 1\n max_h_val = float('-inf')\n for key in citation_to_geq_count:\n if citation_to_geq_count[key] >= key:\n max_h_val = max(max_h_val, key)\n elif key > citation_to_geq_count[key]:\n max_h_val = max(max_h_val, citation_to_geq_count[key])\n return max_h_val","runtime":"236"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = {}\n for i in range(len(citations)):\n n = citations[i]\n for j in range(1, n + 1):\n if j not in h:\n h[j] = 1\n else:\n h[j] += 1\n print(sorted(h.keys()))\n print(h)\n for citations in sorted(h.keys(), reverse=True):\n if citations <= h[citations]:\n return citations\n return 0","runtime":"239"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n for i in reversed(range(len(citations)+1)):\n if len([x for x in citations if x >= i]) >= i:\n return i\n","runtime":"239"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n # array\n # ith paper received citations[i] number of citations\n # h-index = maximum value of h such that the given researcher has ublished at least h papers that have been cited at least h times\n '''\n Brute Force:\n Try all h from 1 to len(citations)\n \n and see if there exists sum(paper for paper in citations if paper >= h)\n \n this is O(N^2)\n '''\n h_index = 0\n for h in reversed(range(0, len(citations)+1)):\n count = sum(1 for citation in citations if citation >= h)\n if count >= h:\n return h\n ","runtime":"242"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n d = {i: 0 for i in citations}\n for i in citations:\n for k in d:\n if k <= i:\n d[k] += 1\n h = 0\n for k, v in d.items():\n if k > h and v > h:\n h = min(k, v)\n return h","runtime":"242"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n length = len(citations)\n\n h_map = {}\n for i in range(length):\n for j in range(1,citations[i]+1):\n if not j in h_map:\n h_map[j] = 1\n else:\n h_map[j] += 1\n h_index = 0\n for item in h_map.items():\n if item[0] <= item[1]:\n h_index = item[0]\n return h_index\n \n","runtime":"245"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n cit_geq = {}\n for citation in citations:\n cit_geq[citation] = 0\n max_h = 0\n for citation in citations:\n for key in cit_geq:\n if citation >= key:\n cit_geq[key] += 1\n for key in cit_geq:\n h_ind = min(key, cit_geq[key])\n max_h = max(max_h, h_ind)\n return max_h","runtime":"245"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n greed = max(citations)\n d = {}\n for cit in citations:\n for v in range(cit+1):\n if v in d:\n d[v] +=1\n else:\n d[v]=1\n for i in range(greed, 0, -1):\n if d[i] >= i:\n return i\n return 0","runtime":"248"},{"code":"class Solution:\n def hIndex(self, citations: list[int]) -> int:\n h_index_map = {}\n for citation in citations:\n for val in range(1, citation+1):\n if val in h_index_map:\n h_index_map[val] += 1\n else:\n h_index_map[val] = 1\n \n h_index = 0\n for index in list(h_index_map.keys())[::-1]:\n if h_index_map[index] >= index:\n h_index = index\n break\n return h_index\n ","runtime":"248"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n for maxNum in range(len(citations), -1, -1):\n foundMax = False\n # if x papers have been cited at least x times\n currCount = 0\n for x in citations:\n if x >= maxNum:\n currCount += 1\n if currCount >= maxNum:\n return maxNum\n return 0\n","runtime":"251"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n if sum(citations) == 0:\n return 0\n for i in range(len(citations), -1, -1):\n if len([a for a in citations if a >= i ]) >= i:\n return i\n return 1","runtime":"251"}],"string":"[\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n \\n citations = sorted(citations, reverse = True)\\n for i in range(len(citations)):\\n if citations[i] <= i:\\n return i\\n\\n return len(citations)\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort(reverse=True)\\n n = len(citations)\\n for i in range(n):\\n if citations[i] < i + 1:\\n return i\\n return n\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort()\\n citations.reverse()\\n max_h = 0\\n for i, c in enumerate(citations):\\n if c >= i + 1:\\n max_h = max(max_h, i+1)\\n return max_h\\n\\n\\n\\n\\n\\n \\n # citations.sort()\\n # citations.reverse()\\n # max_h = 0\\n # for i, c in enumerate(citations):\\n # if c >= (i + 1):\\n # max_h = max(max_h, i + 1)\\n # return max_h\\n \",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h_idx = 0\\n citations.sort(reverse=True)\\n for i in range(len(citations)):\\n if i + 1 <= citations[i]:\\n h_idx += 1\\n return h_idx\\n\",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort()\\n\\n h = 0\\n if citations[0] > 0:\\n h = 1\\n\\n for i in range(len(citations)):\\n if citations[i] <= len(citations) - i:\\n h = citations[i]\\n\\n else:\\n if len(citations) - i > h:\\n h = len(citations) - i \\n\\n return h\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n N = len(citations)\\n bucket = [0] * (N + 1)\\n\\n for c in citations:\\n bucket[min(N, c)] += 1\\n \\n right = N\\n total = 0\\n print(bucket)\\n while right >= 0:\\n total += bucket[right]\\n print(total)\\n if total >= right:\\n return right\\n right -= 1\\n return 0\\n \\n\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n # result = 0\\n # for i in range(1, len(citations)+1):\\n # count = 0\\n # for citation in citations:\\n # if citation >= i:\\n # count += 1\\n # if count >= i:\\n # result = i\\n # return result\\n\\n def gte(citations, m):\\n count = 0\\n for citation in citations:\\n if citation >= m:\\n count += 1\\n return count\\n\\n mc = max(citations)\\n l, r = 0, mc\\n while l <= r:\\n m = (l+r)//2\\n c = gte(citations, m)\\n if c >= m:\\n l = m+1\\n h = m\\n else:\\n r = m-1\\n return h\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort(reverse=True)\\n h=0\\n for i,c in enumerate(citations):\\n if c>i:\\n h+=1\\n else:\\n break\\n return h\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n \\\"\\\"\\\"\\n [3, 0, 6, 1, 5] - > [0, 1, 3, 5, 6]\\n\\n [3, 0, 6, 1, 5] - > [6, 5, 3, 1, 0]\\n\\n [4, 4, 0, 0] -> [4, 4, 0, 0]\\n\\n key: # of citations\\n val: is the number of papers that are >= the # of citations\\n {6:1, 5:2, 3:3, 1:4, 0:5}\\n So the valid h set is {0, 1, 3}, and the max h is 3\\n\\n A valid h is defined by # of citations <= # of papers\\n\\n Maximum h is equal to the number of papers\\n Minimum h_index is 0 because each reasearcher\\n has at least one paper if they were cited once\\n \\\"\\\"\\\"\\n def hIndex(self, citations: List[int]) -> int:\\n \\n if len(citations) == 1:\\n if citations[0] == 0:\\n return 0\\n else:\\n return 1\\n \\n # First we will sort citations in descending order\\n citations.sort(reverse=True)\\n\\n #n = len(citations)\\n\\n max_h = 0\\n\\n for i in range(len(citations)):\\n num_citations = citations[i]\\n\\n # The number of papers with greater than or equal citations\\n # [0, i+1] So it includes the current index of paper i\\n num_papers = i + 1\\n\\n # Checking if there is a valid h value here\\n if num_citations >= num_papers:\\n max_h = max(num_papers, max_h)\\n\\n\\n return max_h\\n\\n \\n\\n\\n\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort()\\n cts=len(citations)\\n ans=0\\n flag=True\\n for j,i in enumerate(citations):\\n\\n if i>=cts:\\n if cts>ans:\\n ans=cts\\n cts=cts-1\\n return ans\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort(reverse=True)\\n mnm = citations[0]\\n index = 1 if mnm > 0 else 0\\n for i in range(1, len(citations)):\\n mnm = min(mnm, citations[i])\\n index = max(index, i+1 if mnm >= i+1 else -1)\\n \\n return index\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort()\\n cur_max = 0\\n count = 0\\n j = 0\\n while j < len(citations) and citations[j] == 0:\\n j += 1\\n if j < len(citations):\\n cur_max = min(citations[j], len(citations) - j)\\n for i in range(j, len(citations)):\\n if citations[i] <= len(citations) - i:\\n cur_max = max(cur_max, citations[i])\\n cur_max = max(cur_max, min(len(citations) - i, citations[i]))\\n \\n \\n return cur_max\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations = sorted(citations)[::-1]\\n cnt = 0\\n for cit in citations:\\n if cit > cnt:\\n cnt += 1\\n else:\\n break\\n return cnt\\n\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort(reverse = True)\\n n = len(citations)\\n h_index = [0] * n\\n h_index[0] = 0 if citations[0] == 0 else 1\\n for i in range(1,n):\\n if citations[i] >= h_index[i-1] + 1:\\n h_index[i] = h_index[i-1] + 1\\n else:\\n h_index[i] = h_index[i-1]\\n return h_index[-1]\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort()\\n l = len(citations)\\n\\n for i in range(l):\\n if (l-i) <= citations[i]:\\n return l-i\\n return 0\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort(reverse=True) # Sort the citations in descending order\\n h = 0 # Initialize h-index\\n \\n for i, citation in enumerate(citations):\\n if citation >= i + 1: # Compare citation count with 1-based index\\n h = i + 1 # Update h-index\\n else:\\n break # No further papers can contribute to the h-index\\n \\n return h\\n\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n\\n def quick_sort(self, sequence, start=0, end=None):\\n\\n if end is None:\\n end = len(sequence)-1\\n\\n if start >= end:\\n return \\n\\n pivot = sequence[end]\\n aux_idx = start - 1\\n for i in range(start, end):\\n if sequence[i] > pivot:\\n aux_idx += 1\\n sequence[aux_idx], sequence[i] = sequence[i], sequence[aux_idx]\\n\\n sequence[aux_idx+1], sequence[end] = sequence[end], sequence[aux_idx+1]\\n\\n self.quick_sort(sequence, start=start, end=aux_idx)\\n self.quick_sort(sequence, start=aux_idx+2, end=end)\\n\\n\\n def quick_sort_and_get_h(self, sequence, start=0, end=None):\\n\\n hmax = 0\\n\\n if end is None:\\n end = len(sequence)-1\\n\\n if start >= end:\\n if start == end and sequence[start] >= start+1:\\n hmax = start+1\\n return hmax\\n\\n pivot = sequence[end]\\n aux_idx = start - 1\\n for i in range(start, end):\\n if sequence[i] > pivot:\\n aux_idx += 1\\n sequence[aux_idx], sequence[i] = sequence[i], sequence[aux_idx]\\n\\n sequence[aux_idx+1], sequence[end] = sequence[end], sequence[aux_idx+1]\\n\\n if sequence[aux_idx+1] >= aux_idx+2:\\n h = aux_idx+2\\n if h > hmax:\\n hmax = h \\n\\n h = self.quick_sort_and_get_h(sequence, start=start, end=aux_idx)\\n if h > hmax:\\n hmax = h\\n h = self.quick_sort_and_get_h(sequence, start=aux_idx+2, end=end)\\n if h > hmax:\\n hmax = h\\n\\n return hmax\\n\\n def hIndex(self, citations: List[int]) -> int:\\n\\n # brut force\\n # runtime: O(n*2), space: O(1)\\n \\\"\\\"\\\"\\n hmax = 0\\n for h in range(len(citations)):\\n idx_cit = 0\\n hcount = 0\\n while idx_cit < len(citations):\\n if citations[idx_cit] >= h:\\n hcount += 1\\n if hcount == h:\\n hmax = hcount\\n break\\n return hmax\\n \\\"\\\"\\\"\\n #\\n # runtime: O(n*2), space: O(n)\\n \\\"\\\"\\\"\\n citations_count_dct = {_cit: 0 for _cit in range(1,len(citations)+1)}\\n h = 0\\n for _cit in citations:\\n for i in range(h+1,min(_cit+1, len(citations)+1)):\\n citations_count_dct[i] += 1\\n if citations_count_dct[i] == i:\\n h = i\\n del citations_count_dct[i]\\n return h\\n \\\"\\\"\\\"\\n\\n # First sort and then iterate through the ordered citations\\n # runtime: O(n log n), space: O(1)\\n \\\"\\\"\\\"\\n self.quick_sort(citations) # O(n log n)\\n\\n # O(n)\\n h=0\\n for idx, cit in enumerate(citations):\\n if cit >= idx+1:\\n h = idx+1\\n return h\\n \\\"\\\"\\\"\\n\\n # Sort and directly find h-index\\n # runtime: O(n log n), space: O(1)\\n \\\"\\\"\\\"\\n return self.quick_sort_and_get_h(citations)\\n \\\"\\\"\\\"\\n\\n n_cits = len(citations)\\n h_count = {idx: 0 for idx in range(n_cits+1)} # runtime: O(n), space: O(n)\\n largest_h = len(citations)\\n h_necessary_cits = largest_h - h_count[largest_h]\\n\\n\\n # for loop: runtime O(n), space: O(n)\\n for cit_idx, cit in enumerate(citations):\\n\\n # add its citations to count\\n h_contribution = min(cit, largest_h)\\n h_count[h_contribution] += 1\\n h_necessary_cits = largest_h - h_count[largest_h]\\n\\n remaining_cits = n_cits - 1 - cit_idx\\n if h_necessary_cits > remaining_cits:\\n # largest_h is no longer possible\\n\\n # transfer its citations to previous h-index and remove it\\n h_count[largest_h-1] += h_count[largest_h]\\n del h_count[largest_h]\\n\\n # obtain new larget h-index and necessary citations\\n largest_h -= 1\\n h_necessary_cits = largest_h - h_count[largest_h]\\n \\n if h_necessary_cits <= 0:\\n return largest_h\\n\\n return 0\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n\\n def quick_sort(self, sequence, start=0, end=None):\\n\\n if end is None:\\n end = len(sequence)-1\\n\\n if start >= end:\\n return \\n\\n pivot = sequence[end]\\n aux_idx = start - 1\\n for i in range(start, end):\\n if sequence[i] > pivot:\\n aux_idx += 1\\n sequence[aux_idx], sequence[i] = sequence[i], sequence[aux_idx]\\n\\n sequence[aux_idx+1], sequence[end] = sequence[end], sequence[aux_idx+1]\\n\\n self.quick_sort(sequence, start=start, end=aux_idx)\\n self.quick_sort(sequence, start=aux_idx+2, end=end)\\n\\n\\n def quick_sort_and_get_h(self, sequence, start=0, end=None):\\n\\n hmax = 0\\n\\n if end is None:\\n end = len(sequence)-1\\n\\n if start >= end:\\n if start == end and sequence[start] >= start+1:\\n hmax = start+1\\n return hmax\\n\\n pivot = sequence[end]\\n aux_idx = start - 1\\n for i in range(start, end):\\n if sequence[i] > pivot:\\n aux_idx += 1\\n sequence[aux_idx], sequence[i] = sequence[i], sequence[aux_idx]\\n\\n sequence[aux_idx+1], sequence[end] = sequence[end], sequence[aux_idx+1]\\n\\n if sequence[aux_idx+1] >= aux_idx+2:\\n h = aux_idx+2\\n if h > hmax:\\n hmax = h \\n\\n h = self.quick_sort_and_get_h(sequence, start=start, end=aux_idx)\\n if h > hmax:\\n hmax = h\\n h = self.quick_sort_and_get_h(sequence, start=aux_idx+2, end=end)\\n if h > hmax:\\n hmax = h\\n\\n return hmax\\n\\n def hIndex(self, citations: List[int]) -> int:\\n\\n # brut force\\n # runtime: O(n*2), space: O(1)\\n \\\"\\\"\\\"\\n hmax = 0\\n for h in range(len(citations)):\\n idx_cit = 0\\n hcount = 0\\n while idx_cit < len(citations):\\n if citations[idx_cit] >= h:\\n hcount += 1\\n if hcount == h:\\n hmax = hcount\\n break\\n return hmax\\n \\\"\\\"\\\"\\n #\\n # runtime: O(n*2), space: O(n)\\n \\\"\\\"\\\"\\n citations_count_dct = {_cit: 0 for _cit in range(1,len(citations)+1)}\\n h = 0\\n for _cit in citations:\\n for i in range(h+1,min(_cit+1, len(citations)+1)):\\n citations_count_dct[i] += 1\\n if citations_count_dct[i] == i:\\n h = i\\n del citations_count_dct[i]\\n return h\\n \\\"\\\"\\\"\\n\\n # First sort and then iterate through the ordered citations\\n # runtime: O(n log n), space: O(1)\\n \\\"\\\"\\\"\\n self.quick_sort(citations) # O(n log n)\\n\\n # O(n)\\n h=0\\n print(citations)\\n for idx, cit in enumerate(citations):\\n if cit >= idx+1:\\n h = idx+1\\n return h\\n \\\"\\\"\\\"\\n\\n # better approach, if we sort in decreasing order\\n citations.sort()\\n len_citations = len(citations)\\n for idx, cit in enumerate(citations):\\n if len_citations - idx <= cit:\\n return len_citations - idx\\n return 0\\n\\n\\n # Sort and directly find h-index\\n # runtime: O(n log n), space: O(1)\\n \\\"\\\"\\\"\\n return self.quick_sort_and_get_h(citations)\\n \\\"\\\"\\\"\\n \\\"\\\"\\\"\\n n_cits = len(citations)\\n h_count = {idx: 0 for idx in range(n_cits+1)} # runtime: O(n), space: O(n)\\n largest_h = len(citations)\\n h_necessary_cits = largest_h - h_count[largest_h]\\n\\n\\n # for loop: runtime O(n), space: O(n)\\n for cit_idx, cit in enumerate(citations):\\n\\n # add its citations to count\\n h_contribution = min(cit, largest_h)\\n h_count[h_contribution] += 1\\n h_necessary_cits = largest_h - h_count[largest_h]\\n\\n remaining_cits = n_cits - 1 - cit_idx\\n if h_necessary_cits > remaining_cits:\\n # largest_h is no longer possible\\n\\n # transfer its citations to previous h-index and remove it\\n h_count[largest_h-1] += h_count[largest_h]\\n del h_count[largest_h]\\n\\n # obtain new larget h-index and necessary citations\\n largest_h -= 1\\n h_necessary_cits = largest_h - h_count[largest_h]\\n \\n if h_necessary_cits <= 0:\\n return largest_h\\n\\n return 0\\n \\\"\\\"\\\"\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n\\n def quick_sort(self, sequence, start=0, end=None):\\n\\n if end is None:\\n end = len(sequence)-1\\n\\n if start >= end:\\n return \\n\\n pivot = sequence[end]\\n aux_idx = start - 1\\n for i in range(start, end):\\n if sequence[i] > pivot:\\n aux_idx += 1\\n sequence[aux_idx], sequence[i] = sequence[i], sequence[aux_idx]\\n\\n sequence[aux_idx+1], sequence[end] = sequence[end], sequence[aux_idx+1]\\n\\n self.quick_sort(sequence, start=start, end=aux_idx)\\n self.quick_sort(sequence, start=aux_idx+2, end=end)\\n\\n\\n def quick_sort_and_get_h(self, sequence, start=0, end=None):\\n\\n hmax = 0\\n\\n if end is None:\\n end = len(sequence)-1\\n\\n if start >= end:\\n if start == end and sequence[start] >= start+1:\\n hmax = start+1\\n return hmax\\n\\n pivot = sequence[end]\\n aux_idx = start - 1\\n for i in range(start, end):\\n if sequence[i] > pivot:\\n aux_idx += 1\\n sequence[aux_idx], sequence[i] = sequence[i], sequence[aux_idx]\\n\\n sequence[aux_idx+1], sequence[end] = sequence[end], sequence[aux_idx+1]\\n\\n if sequence[aux_idx+1] >= aux_idx+2:\\n h = aux_idx+2\\n if h > hmax:\\n hmax = h \\n\\n h = self.quick_sort_and_get_h(sequence, start=start, end=aux_idx)\\n if h > hmax:\\n hmax = h\\n h = self.quick_sort_and_get_h(sequence, start=aux_idx+2, end=end)\\n if h > hmax:\\n hmax = h\\n\\n return hmax\\n\\n def hIndex(self, citations: List[int]) -> int:\\n\\n # brut force\\n # runtime: O(n*2), space: O(1)\\n \\\"\\\"\\\"\\n hmax = 0\\n for h in range(len(citations)):\\n idx_cit = 0\\n hcount = 0\\n while idx_cit < len(citations):\\n if citations[idx_cit] >= h:\\n hcount += 1\\n if hcount == h:\\n hmax = hcount\\n break\\n return hmax\\n \\\"\\\"\\\"\\n #\\n # runtime: O(n*2), space: O(n)\\n \\\"\\\"\\\"\\n citations_count_dct = {_cit: 0 for _cit in range(1,len(citations)+1)}\\n h = 0\\n for _cit in citations:\\n for i in range(h+1,min(_cit+1, len(citations)+1)):\\n citations_count_dct[i] += 1\\n if citations_count_dct[i] == i:\\n h = i\\n del citations_count_dct[i]\\n return h\\n \\\"\\\"\\\"\\n\\n # First sort and then iterate through the ordered citations\\n # runtime: O(n log n), space: O(1)\\n \\\"\\\"\\\"\\n self.quick_sort(citations) # O(n log n)\\n\\n # O(n)\\n h=0\\n for idx, cit in enumerate(citations):\\n if cit >= idx+1:\\n h = idx+1\\n return h\\n \\\"\\\"\\\"\\n\\n # Sort and directly find h-index\\n # runtime: O(n log n), space: O(1)\\n \\\"\\\"\\\"\\n return self.quick_sort_and_get_h(citations)\\n \\\"\\\"\\\"\\n\\n n_cits = len(citations)\\n h_count = {idx: 0 for idx in range(n_cits+1)}\\n largest_h = len(citations)\\n h_necessary_cits = largest_h - h_count[largest_h]\\n\\n for cit_idx, cit in enumerate(citations):\\n\\n # add its citations to count\\n h_contribution = min(cit, largest_h)\\n h_count[h_contribution] += 1\\n h_necessary_cits = largest_h - h_count[largest_h]\\n\\n #if h_contribution < largest_h and h_necessary_cits > cit_idx:\\n remaining_cits = n_cits - 1 - cit_idx\\n #print(h_count, cit, largest_h, h_contribution, h_necessary_cits, remaining_cits)\\n if h_necessary_cits > remaining_cits:\\n # largest_h is no longer possible\\n\\n # transfer its citations to previous h-index and remove it\\n h_count[largest_h-1] += h_count[largest_h]\\n del h_count[largest_h]\\n\\n # obtain new larget h-index and necessary citations\\n largest_h -= 1\\n h_necessary_cits = largest_h - h_count[largest_h]\\n \\n if h_necessary_cits <= 0:\\n return largest_h\\n #print(largest_h, h_necessary_cits, h_count)\\n return 0\\n\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort(reverse=False)\\n h=0\\n n = len(citations)\\n for i,v in enumerate(citations):\\n if v>=n-i:\\n h=max(h,n-i)\\n return h\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort(reverse=True)\\n if citations[0] == 0:\\n return 0\\n print(citations)\\n for i in range(len(citations)):\\n if citations[i] < (i + 1):\\n return i\\n\\n return len(citations)\\n\\n \",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n def num(l, x):\\n out = 0\\n for i in l:\\n if i >= x:\\n out += 1\\n return out\\n \\n temp = citations\\n temp.sort(reverse=True) # Sort in descending order to process citations from highest to lowest\\n \\n for i in range(len(temp)):\\n if temp[i] >= i + 1: # Compare with the index + 1\\n h = i + 1\\n else:\\n break\\n \\n return h if 'h' in locals() else 0 # Return h if it's defined, otherwise return 0\\n\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n if len(citations) <= 1:\\n return 1 if citations[0] != 0 else 0\\n citations.sort()\\n ans = -1\\n\\n for i in range(len(citations)):\\n ans = max(ans, min(len(citations) - i, citations[i]))\\n\\n return ans \",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n for h in range(min(len(citations), max(citations)), -1, -1):\\n cited_at_least_h_times = len([c for c in citations if c >= h])\\n if cited_at_least_h_times >= h:\\n return h\\n\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort()\\n\\n testNumber = citations[-1]\\n while(True):\\n\\n if(testNumber <= len(citations)):\\n change = False\\n for i in range(testNumber):\\n i = len(citations) - i - 1\\n if(citations[i] < testNumber):\\n change = True\\n testNumber = testNumber - 1\\n break\\n if(change == False):\\n return testNumber\\n\\n else:\\n testNumber = testNumber - 1\\n \\n return -1\\n\\n\\n\\n \\n \",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n result = 0\\n citations.sort()\\n\\n for i,val in enumerate(citations):\\n if len(citations[i:]) <= val:\\n result = max(result, len(citations[i:]))\\n # print(val, len(citations[i:]))\\n # result = min(val, len(citations[i:]))\\n \\n return result\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: list[int]) -> int:\\n # Sort the citations in descending order\\n citations.sort(reverse=True)\\n \\n # Find the h-index\\n h = 0\\n for i, citation in enumerate(citations):\\n if citation >= i + 1:\\n h = i + 1\\n else:\\n break\\n \\n return h\\n\\n# Test the function\\ncitations = [3, 0, 6, 1, 5]\\nprint(Solution().hIndex(citations)) # Output: 3\\n \\n\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n\\n def qsort(self, inlist):\\n if inlist == []: \\n return []\\n else:\\n pivot = inlist[0]\\n lesser = self.qsort([x for x in inlist[1:] if x < pivot])\\n greater = self.qsort([x for x in inlist[1:] if x >= pivot])\\n return lesser + [pivot] + greater\\n\\n def hIndex(self, citations: List[int]) -> int:\\n hindex = 0\\n sort_citations = self.qsort(citations)\\n size = len(citations)\\n print(sort_citations)\\n for i in range(len(sort_citations)):\\n print(hindex, i, sort_citations[i], len(sort_citations)-i)\\n if sort_citations[size-(i+1)] >= (i+1):\\n hindex += 1\\n else:\\n break\\n\\n \\n return hindex\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n for h in range(min(len(citations), max(citations)), -1, -1):\\n cited_at_least_h_times = len([c for c in citations if c >= h])\\n if cited_at_least_h_times >= h:\\n return h\\n\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n counter = {}\\n n = len(citations)\\n max_citations = max(citations)\\n max_h = min(n, max_citations)\\n\\n\\n \\n\\n print(f'max_h: {max_h}')\\n for h in range(max_h, 0, -1):\\n ## print(h)\\n gt_h = [i >= h for i in citations]\\n n_gt_h = sum(gt_h)\\n ## print(f'n_gt_h: {n_gt_h}, h: {h}')\\n if n_gt_h >= h:\\n return h\\n\\n return 0\\n \",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n counter = {}\\n n = len(citations)\\n max_citations = max(citations)\\n max_h = min(n, max_citations)\\n\\n\\n \\n\\n print(f'max_h: {max_h}')\\n for h in range(max_h, 0, -1):\\n print(h)\\n gt_h = [i >= h for i in citations]\\n n_gt_h = sum(gt_h)\\n print(f'n_gt_h: {n_gt_h}, h: {h}')\\n if n_gt_h >= h:\\n return h\\n\\n return 0\\n \",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h=min(len(citations),max(citations))\\n for i in range(h,0,-1):\\n count=0\\n for j in range(len(citations)):\\n count+=(citations[j]>=i)\\n if count<h:\\n h-=1\\n else:\\n return h\\n return h\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h, counter = 0, 0\\n\\n while True:\\n h += 1\\n for e in citations:\\n if e >= h: \\n counter += 1 \\n if counter >= h:\\n break\\n if counter < h:\\n return h - 1\\n counter = 0\",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = 0\\n stop = False\\n max_cit = max(citations)\\n while not stop:\\n count = sum (cita >= max_cit for cita in citations)\\n if count >= max_cit:\\n stop = True\\n h = max_cit\\n else : \\n max_cit -= 1\\n return h\\n\\n \",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n count = [0] * 1001\\n '''\\n [3,0,6,1,5]\\n [5,4,3,3,2,2,1]\\n 0,1,2,3,4,5,6\\n '''\\n for cite in citations:\\n count[cite] += 1\\n print(count)\\n for i in range(len(count)-2, -1, -1):\\n count[i] = count[i+1] + count[i]\\n print(count)\\n for i in range(len(count)-1, -1, -1):\\n print(count[i])\\n if i <= count[i]:\\n return i\\n return -1\\n\",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n count = [0] * 1001\\n '''\\n [3,0,6,1,5]\\n [5,4,3,3,2,2,1]\\n 0,1,2,3,4,5,6\\n '''\\n for cite in citations:\\n count[cite] += 1\\n print(count)\\n for i in range(len(count)-2, -1, -1):\\n count[i] = count[i+1] + count[i]\\n print(count)\\n for i in range(len(count)-1, -1, -1):\\n print(count[i])\\n if i <= count[i]:\\n return i\\n return -1\\n\",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h=min(len(citations),max(citations))\\n for i in range(h,0,-1):\\n count=0\\n for j in range(len(citations)):\\n count+=(citations[j]>=i)\\n if count<h:\\n h-=1\\n else:\\n return h\\n return h\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = max(citations)\\n while h >= 0:\\n count = sum(cites >= h for cites in citations)\\n if count >= h:\\n return h\\n h -= 1\\n \\n return h\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n hash = {}\\n h_index = 0\\n for c in citations:\\n for i in range(h_index, c+1):\\n hash[i] = 1 + hash.get(i, 0)\\n if hash[i] >= i:\\n h_index = i\\n return h_index\\n\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n #have a for loop to go through each num\\n #continue for loop as long as we're trying to meet this condition\\n #have a counter and if counter is less than h continnue the loop\\n #if we see a number that is greater than or equal to h we increment counter\\n \\n return self.hValid(0, citations) \\n\\n def hValid(self, h, arr):\\n counter = 0\\n for number in arr:\\n if counter == h:\\n return self.hValid(h+1, arr)\\n break\\n else:\\n if number >= h:\\n counter += 1\\n return self.hValid(h+1, arr) if counter == h else h-1\\n\\n\\n # 0 - just called hvalid 3\\n # 1 - called h valid 3\\n # 2 - call h valid return 3\\n # 3 - call h valid at the return statenent returns 3\\n # 4 - returns h -1 which is 3\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h_index = 1\\n citations = [cit for cit in citations if cit >= h_index]\\n num_greater_citations = len(citations)\\n while num_greater_citations >= h_index:\\n h_index += 1\\n citations = [cit for cit in citations if cit >= h_index]\\n num_greater_citations = len(citations)\\n return h_index -1\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n max_h = 0\\n for h in range(min(len(citations), max(citations)) + 1):\\n citations = [c for c in citations if c >= h]\\n if len(citations) >= h and h > max_h:\\n max_h = h\\n\\n return max_h\\n\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n m = max(citations)\\n while True:\\n f = filter(lambda c: c >= m, citations)\\n count = sum(1 for _ in f)\\n if count < m:\\n m -= 1\\n else:\\n return m\",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations = [i for i in citations if i != 0]\\n if citations == []:\\n return 0\\n citations.sort()\\n h = min(citations[0], len(citations))\\n for i in range(len(citations)):\\n if citations[i] > len(citations[i:]):\\n h = max(h, len(citations[i:]))\\n continue\\n h = min(citations[i], len(citations[i:]))\\n return h\",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n cntMax = 0\\n for j in range(1000):\\n\\n cnt=0\\n for i in citations:\\n if i>j:\\n cnt+=1\\n if cnt > j:\\n break\\n if cntMax < cnt:\\n cntMax = cnt\\n if j>len(citations)-1:\\n break\\n return cntMax\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n if len(citations) == 0:\\n return 0\\n \\n index = 0 \\n for i in range(1, len(citations) + 1):\\n citations_ = []\\n for j in citations:\\n if j >= i:\\n citations_.append(j)\\n \\n if len(citations_) >= i:\\n index = i\\n\\n citations = citations_\\n\\n return index\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n data = {}\\n\\n for x in citations:\\n if x not in data:\\n data[x] = 1\\n else:\\n data[x] += 1\\n\\n keys = sorted(data.keys())\\n N = len(citations)\\n n = N\\n for h in range(N+1, -1, -1):\\n s = 0\\n for key in keys:\\n if key >= h:\\n s += data[key]\\n \\n if s >= h:\\n return h\\n\\n \\n\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = 1\\n cnt = 0\\n i = 0\\n\\n while i < len(citations):\\n # check if curr greater than citation\\n if citations[i] >= h:\\n cnt += 1\\n # h += 1 and restart\\n if cnt == h and i != (len(citations) - 1):\\n i = 0\\n cnt = 0\\n h += 1\\n continue\\n i += 1\\n\\n if cnt >= h:\\n return h\\n else:\\n return h - 1\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = min(min(citations), len(citations))\\n while len(citations) > h:\\n h = min(citations)\\n if h >= len(citations): return len(citations)\\n citations = [x for x in citations if x > h]\\n if len(citations) < h: return h\\n \\n return len(citations)\\n\",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = min(min(citations), len(citations))\\n while len(citations) > h:\\n h = min(citations)\\n if h >= len(citations): return len(citations)\\n citations = [x for x in citations if x > h]\\n if len(citations) < h: return h\\n \\n return len(citations)\\n\",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n data = {}\\n\\n for x in citations:\\n if x not in data:\\n data[x] = 1\\n else:\\n data[x] += 1\\n\\n keys = data.keys()\\n N = len(citations)\\n n = N\\n for h in range(N+1, -1, -1):\\n s = 0\\n for key in keys:\\n if key >= h:\\n s += data[key]\\n \\n if s >= h:\\n return h\\n\\n \\n\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n potentials = [0]\\n cur_h = 0\\n citations.sort()\\n for citation in citations:\\n if citation > cur_h:\\n potentials.append(citation)\\n # try increase the cur_h\\n while cur_h <= len(potentials):\\n cur_h += 1\\n\\n # remove those lower than the cur_h\\n removals = []\\n for num in potentials:\\n if num >= cur_h:\\n removals.append(num)\\n \\n if len(removals) < cur_h:\\n break\\n else:\\n potentials = removals\\n cur_h -= 1\\n \\n return cur_h\\n \\n\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n ans = 0\\n ans_d = {}\\n for i in citations:\\n if i > ans:\\n k = ans+1\\n for j in range(k,i+1):\\n if j not in ans_d:\\n ans_d[j] = 1\\n else:\\n ans_d[j] += 1\\n if ans_d[j] >= j and k > ans:\\n ans = j\\n return ans\",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n i = 0\\n array = []\\n while i <= len([citation for citation in citations if citation >= i]):\\n array.append(i)\\n i += 1\\n\\n return max(array)\",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n # we can create a list of length of the array. \\n h_index_list = [0]*(len(citations)+1)\\n # first index is number of papers cited at least 0 time\\n # second index is number of papers cited at least 2 times\\n for citation in citations:\\n h_index_list[:citation+1] = [x+1 for x in h_index_list[:citation+1]]\\n h_max = 0\\n h_index = 0\\n for i, h in enumerate(h_index_list):\\n if h >= i:\\n h_max = max(h_max, i) \\n return h_max\\n\\n # sorted the paper first. \\n sorted_citations = sorted(citations, reverse=False)\\n for i, citation in sorted_citations:\\n if citation >= i + 1:\\n continue\\n else:\\n return citation - 1\\n \\n\\n\\n\\n\\n \",\n \"runtime\": \"101\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n\\n citations.sort()\\n maxK = 0\\n temp = -1\\n while temp <= 0:\\n temp = maxK\\n for i in range(len(citations)):\\n \\n if citations[i] >= maxK:\\n temp -= 1\\n \\n if temp <= 0:\\n maxK += 1\\n break\\n\\n if maxK == 0:\\n return 0\\n \\n return maxK-1\\n \\n \",\n \"runtime\": \"101\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n hIindex = 0\\n sorted_citations = sorted(citations)\\n for i in range(len(citations) + 1):\\n count = 0\\n for n in sorted_citations:\\n if n >= i:\\n count += 1\\n\\n if count >= i:\\n hIndex = i\\n else:\\n break\\n \\n return hIndex\\n \",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n\\n citations.sort()\\n maxK = 0\\n temp = -1\\n while temp <= 0:\\n temp = maxK\\n for i in range(len(citations)):\\n \\n if citations[i] >= maxK:\\n temp -= 1\\n \\n if temp <= 0:\\n maxK += 1\\n break\\n\\n if maxK == 0:\\n return 0\\n \\n return maxK-1\\n \\n \",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n max = 0\\n curr = -1\\n citations = sorted(citations)\\n for i in range(len(citations)):\\n temp = 0\\n if citations[i] > curr:\\n curr = citations[i]\\n for j in range(i, len(citations)):\\n if citations[j] >= curr:\\n temp += 1\\n if min(temp, curr) > max:\\n max = min(temp, curr)\\n return max\",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = {}\\n h_index = 0\\n n_papers = len(citations)\\n for c in citations:\\n for i in range(h_index,min(c, n_papers)+1):\\n # print(h)\\n if i not in h.keys():\\n h[i] = 1\\n else:\\n h[i]+=1\\n if h[i] >= i and i > h_index:\\n h_index = i\\n return h_index\\n \",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n d=defaultdict(int)\\n citations_sorted=sorted(citations,reverse=True)\\n prev=citations_sorted[0]\\n for j in citations_sorted:\\n for i in range(0,j+1):\\n d[i]+=1\\n for x in range(prev,j,-1):\\n if x<=d[x]:\\n return x\\n for x in range(citations_sorted[-1],-1,-1):\\n if x<=d[x]:\\n return x\\n\\n\\n\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort(reverse=True)\\n H_ind=float('-inf')\\n max_cit=max(citations)+1\\n curr_count=0\\n for i in range(1,max_cit):\\n if(i<=len(citations) ):\\n curr_count=len([k for k in citations if k>=i ])\\n if(curr_count>=i):\\n curr_h=i\\n H_ind=max(H_ind,curr_h)\\n else:\\n break\\n if H_ind==float('-inf'):\\n H_ind=0\\n return H_ind\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = {}\\n h_index = 0\\n for c in citations:\\n if c > h_index:\\n for i in range(h_index,c+1):\\n # print(h)\\n if i not in h.keys():\\n h[i] = 1\\n else:\\n h[i]+=1\\n if h[i] >= i and i > h_index:\\n h_index = i\\n return h_index\\n \",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort()\\n max_hIndex = 0\\n for i in range(citations[-1]+1):\\n papers = 0\\n for j in citations:\\n if j >= i:\\n papers += 1\\n\\n if papers >= i:\\n max_hIndex = i\\n else:\\n return max_hIndex\\n return max_hIndex\\n\\n\\n \\\"\\\"\\\"\\n if citations[0] > length:\\n return length\\n\\n\\n for i in range(length):\\n hIndex_tmp = citations[i]\\n if len(citations[i:]) >= hIndex_tmp:\\n if hIndex_tmp > max_hIndex:\\n max_hIndex = hIndex_tmp\\n else:\\n return max_hIndex\\n return max_hIndex\\n \\\"\\\"\\\"\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n counts = {}\\n for item in citations:\\n if item in counts.keys():\\n counts[item] += 1\\n else:\\n counts[item] = 1\\n h = 0\\n for i in range(len(citations)+1):\\n cit_count = 0\\n for item in counts.keys():\\n if item >= i:\\n cit_count += counts[item]\\n if cit_count >= i and i > h:\\n h = i\\n return h\\n\",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n\\n for hIndex in range(n):\\n count = 0\\n for citation in citations:\\n if citation > hIndex:\\n count += 1\\n \\n if hIndex >= count:\\n return hIndex\\n return n\\n\",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n mx=0\\n for i in range(max(citations)+1):\\n x=0\\n for j in citations:\\n if j>=i:x+=1\\n if x>=i and i>mx:mx=i\\n return mx\\n \\n\\n\",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n\\n n = len(citations)\\n\\n \\n for l in range(0,n+1):\\n #count how many paper has at least l citation\\n count = [1 for cite in citations if cite>=l]\\n if len(count)<l:\\n return l-1 \\n \\n return n\\n\\n\\n \",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = 0\\n max_num = max(citations)\\n for i in range(1, max_num + 1):\\n papers_over_i = [i for c in citations if c >= i]\\n num_papers = len(papers_over_i)\\n if num_papers >= i and i >= h :\\n h = i\\n\\n return h\",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort()\\n mx=0\\n for i in range(max(citations)+1):\\n x=0\\n for j in citations:\\n if j>=i:x+=1\\n if x>=i and i>mx:mx=i\\n return mx\\n \\n\\n\",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"from copy import deepcopy\\nclass Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n cur_h = 0\\n while(True):\\n s = 0\\n for c in citations:\\n if c>=cur_h:\\n s+=1\\n\\n if s>=cur_h:\\n cur_h+=1\\n else:\\n return cur_h-1\\n \",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n\\n # n^2 implementation\\n h = 0\\n for v in range(1, max(citations)+1):\\n h_count = 0\\n for c in citations:\\n if c >= v:\\n h_count += 1\\n\\n if h_count >= v:\\n h = v\\n return h\\n\\n\",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = 0\\n count = 0\\n while count >= h:\\n count = 0\\n h += 1 \\n for num in citations:\\n if num >= h:\\n count += 1\\n \\n return h - 1\\n \",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n maximum = 0\\n count = 0\\n for i in range(1, max(citations)+1):\\n for n in citations:\\n if n>=i:\\n count += 1\\n if count >= i:\\n maximum = i\\n count = 0\\n return maximum\\n\\n\\n\",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n hcond = True\\n loops = 0\\n while hcond == True:\\n citations = [cite for cite in citations if cite > 0]\\n loops += 1\\n if loops <= len(citations):\\n hcond = True\\n else:\\n hcond = False\\n\\n citations = [cite - 1 for cite in citations]\\n\\n return loops - 1\",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n max_h = len(citations)\\n min_h = 0\\n h = (max_h + min_h) // 2\\n best_h = None\\n while True:\\n c = 0\\n for i in citations:\\n if i >= h:\\n c += 1\\n if c < h:\\n h -= 1\\n if best_h != None:\\n return best_h\\n else:\\n best_h = h\\n h += 1\\n print(h)\\n\\n\",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n N = len(citations)\\n hindex = [0]*N\\n result = 0\\n for i in range(N):\\n for j in range(min(N,citations[i])):\\n hindex[j] += 1\\n print(hindex)\\n for k in range(N):\\n if hindex[k] >= k+1:\\n result = k+1\\n return result\",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n def counting_sort(arr):\\n n = len(arr)\\n count = [0] * (n + 1)\\n\\n for num in arr:\\n for i in range(min(num + 1, n + 1)):\\n count[i] += 1\\n return count\\n\\n count = counting_sort(citations)\\n h_index = 0\\n for i, val in enumerate(count):\\n if val >= i:\\n h_index = i\\n else:\\n break\\n return h_index\",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n psbl_index = max(citations)\\n highest_h = 0\\n if psbl_index == 0:\\n return 0\\n while psbl_index > 0:\\n\\n counter = 0\\n for n in citations:\\n\\n if n >= psbl_index:\\n counter += 1\\n if counter >= psbl_index:\\n highest_h = max(psbl_index, highest_h)\\n psbl_index -= 1\\n return highest_h\",\n \"runtime\": \"136\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n def counting_sort(arr):\\n n = len(arr)\\n count = [0] * (n + 1)\\n\\n for num in arr:\\n for i in range(min(num + 1, n + 1)):\\n count[i] += 1\\n return count\\n\\n count = counting_sort(citations)\\n h_index = 0\\n for i, val in enumerate(count):\\n if val >= i:\\n h_index = i\\n return h_index\",\n \"runtime\": \"136\"\n },\n {\n \"code\": \"class Solution:\\n '''\\n - h-index has point of inflection\\n -- after certain h-index it will become invalid and stay that way\\n - we can do count sort and keep a >= count of each citation\\n - then do binary search on possible h-index\\n '''\\n def hIndex(self, citations: List[int]) -> int:\\n #there are at least this many citations\\n citation_count = [0]*(len(citations)+2)\\n\\n for c in citations:\\n for i in range(min(c+1, len(citations)+1)):\\n citation_count[i] += 1\\n # print(citation_count)\\n for i in range(len(citations)+1, -1, -1):\\n if(citation_count[i] >= i):\\n return i\",\n \"runtime\": \"139\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n maxCita = max(citations)\\n stack = [0] * (maxCita + 1)\\n for cita in citations:\\n for i in range(cita+1):\\n stack[i] += 1\\n for i in range(len(stack)-1,-1,-1):\\n if stack[i] >= i:\\n return i\\n\\n \",\n \"runtime\": \"139\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n length = len(citations)\\n stack = [0] * (length + 1)\\n for cita in citations:\\n for i in range(min(cita,length)+1):\\n stack[i] += 1\\n for i in range(len(stack)-1,-1,-1):\\n if stack[i] >= i:\\n return i\\n\\n \",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n maxCitations = 0\\n for y in range(len(citations)):\\n if len([x for x in citations if x >= y + 1]) >= y + 1:\\n maxCitations = y + 1\\n else:\\n break\\n\\n return maxCitations\\n \",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h_index = [0 for i in range(max(citations))]\\n for citation in citations:\\n citation_idx = citation-1\\n for i in range(citation_idx, -1, -1):\\n h_index[i] += 1\\n best = 0\\n for i in range(len(h_index)):\\n is_candidate = h_index[i] >= i + 1\\n if is_candidate:\\n best = i + 1\\n return best\\n\\n \\n \\n \",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n sorted_citations = sorted(citations)\\n print(sorted_citations)\\n # counts = list(Counter(citations)).sort(key=lambda item: item[1])\\n # print(count)\\n \\n result = 0\\n for number in range(0,sorted_citations[len(sorted_citations)-1]+1):\\n print('00000000000000000000')\\n current_count = sum(1 for x in sorted_citations if x >= number)\\n print('number', number)\\n print('current_count', current_count)\\n if number > result and current_count >= number:\\n result = number\\n print('-------------------')\\n return result\\n \",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n arr = [0] * (max(citations) + 1)\\n for n in citations:\\n for x in range(1, n +1):\\n arr[x] += 1\\n for y in range(len(arr) -1, -1, -1):\\n if arr[y] >= y:\\n return y\",\n \"runtime\": \"148\"\n },\n {\n \"code\": \"class Solution:\\n '''\\n - h-index has point of inflection\\n -- after certain h-index it will become invalid and stay that way\\n - we can do count sort and keep a >= count of each citation\\n - then do binary search on possible h-index\\n '''\\n def hIndex(self, citations: List[int]) -> int:\\n #there are at least this many citations\\n citation_count = [0]*(len(citations)+2)\\n\\n for c in citations:\\n for i in range(min(c+1, len(citations)+1)):\\n citation_count[i] += 1\\n # print(citation_count)\\n for i in range(len(citations)+1, -1, -1):\\n if(citation_count[i] >= i):\\n return i\",\n \"runtime\": \"148\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n # hIndex <= len(citations)\\n n = len(citations)\\n h = [0] * (n+1)\\n for c in citations:\\n for i in range(min(c+1, n+1)):\\n h[i] += 1\\n # print(h)\\n for i in range(n, -1, -1):\\n if h[i] >= i:\\n return i\\n\\n # citations.sort()\\n # n = len(citations)\\n # for i in range(n):\\n # h = citations[i]\\n # num_greater_or_equal = n-i\",\n \"runtime\": \"151\"\n },\n {\n \"code\": \"class Solution:\\n def count_citations(self, citations: List[int], element: int) -> int:\\n count = 0\\n for i in range(len(citations)):\\n if citations[i] >= element:\\n count += 1\\n return count\\n\\n def hIndex(self, citations: List[int]) -> int:\\n h_index = 0\\n citations.sort()\\n for i in range(len(citations)):\\n count = self.count_citations(citations, i + 1)\\n if i + 1 > count:\\n break\\n h_index += 1\\n \\n return h_index\",\n \"runtime\": \"151\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n\\n if len(citations) == 1:\\n if citations[0] != 0:\\n return 1\\n else:\\n return 0\\n\\n citations.sort()\\n hindex = 0\\n curr = 0\\n while curr <= len(citations):\\n print(hindex)\\n count = 0\\n for i in range(len(citations)):\\n if citations[i] > hindex:\\n count+=1\\n if count >= curr:\\n hindex = curr\\n else:\\n break\\n curr += 1\\n return hindex\\n \\n\\n\\n \\n \",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort()\\n m: int = 0\\n\\n for i in range(len(citations)):\\n if citations[i] < m:\\n continue\\n curr_count = 1\\n l = i + 1\\n r = len(citations) - 1\\n while l <= r:\\n if curr_count > citations[i]:\\n break\\n if citations[l] >= citations[i]:\\n curr_count += 1\\n if l != r and citations[r] >= citations[i]:\\n curr_count += 1\\n l += 1\\n r -= 1\\n \\n print(f' c_c={curr_count}, citations[i]={citations[i]}')\\n if curr_count >= citations[i]:\\n m = citations[i]\\n elif curr_count > m:\\n m = curr_count\\n\\n return m\\n \",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n paper_count = [0 for i in range(len(citations))]\\n for i in range(len(citations)):\\n idx = citations[i]-1\\n if(idx >= len(citations)):\\n idx = len(citations)-1\\n while(idx >=0):\\n paper_count[idx]+=1\\n idx-=1\\n print(paper_count)\\n for i in range(len(paper_count)-1, -1, -1):\\n if(paper_count[i] >= i+1):\\n return i+1\\n return 0\\n\\n\\n\\n\\n\\n\\n\\n# hIDX = 0\\n# minimum = 0\\n# isWork = True\\n# for i in range(len(citations)):\\n# counter = 0\\n# isWork = True\\n# for j in range(len(citations)):\\n# if(citations[j] < len(citations)-i):\\n# # print(counter)\\n# counter+=1\\n# if(len(citations) - counter < len(citations) - i):\\n# #print(\\\"HERE AT \\\" + str(len(citations) - counter) + str(len(citations)-i))\\n# isWork = False\\n# break\\n# if(isWork):\\n# return len(citations)-i\\n# return 0\",\n \"runtime\": \"157\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n counts = [0] * (n + 1)\\n # print(\\\"counts: {}\\\".format(counts))\\n for c in range(n):\\n v = citations[c]\\n # print(\\\"c: {}, v: {}\\\".format(c, v))\\n for i in range(min(n, v) + 1):\\n if i == 0:\\n continue\\n counts[i] += 1\\n # print(\\\"i: {}, counts: {}\\\".format(i, counts))\\n \\n r = range(n, 0, -1)\\n # print(\\\"scan range: {}\\\".format(r))\\n for i in r:\\n v = counts[i]\\n # print(\\\"scan i: {}, v: {}\\\".format(i, v))\\n if v >= i:\\n return i\\n return 0\",\n \"runtime\": \"157\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n # if citations==[1,2,2]:\\n # return 2\\n # citation=list(set(citations))\\n citations.sort()\\n ans=0\\n while True: \\n cnt=0\\n for i in range(len(citations)):\\n # for j in range(len(citation)):\\n # if citation[i]>ans:\\n # cnt+=1\\n # else:\\n # break\\n if ans<=citations[i]:\\n cnt+=1\\n if cnt>=ans:\\n ans+=1\\n else:\\n return ans-1 \\n return ans-1\\n\",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"class Solution:\\n '''\\n - h-index has point of inflection\\n -- after certain h-index it will become invalid and stay that way\\n - we can do count sort and keep a >= count of each citation\\n - then do binary search on possible h-index\\n '''\\n def hIndex(self, citations: List[int]) -> int:\\n #there are at least this many citations\\n citation_count = [0]*(len(citations)+2)\\n\\n for c in citations:\\n for i in range(min(c+1, len(citations)+1)):\\n citation_count[i] += 1\\n # print(citation_count)\\n for i in range(len(citations)+1, -1, -1):\\n if(citation_count[i] >= i):\\n return i\",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n d = [0 for _ in range(5001)]\\n for x in citations:\\n for i in range(1,x+1):\\n d[i] += 1\\n mx = 0\\n for i, x in enumerate(d):\\n if x >= i:\\n mx = max(i, mx)\\n return mx\",\n \"runtime\": \"163\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = -1\\n test = True\\n\\n while test == True:\\n temp = 0\\n for i in range(len(citations)):\\n if citations[i] > h:\\n temp += 1\\n\\n if temp >= h + 1:\\n\\n print(h)\\n h += 1\\n else: \\n test = False\\n\\n return h\\n\\n\\n \",\n \"runtime\": \"163\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n N = len(citations)\\n if N == 1:\\n return 1 if citations[0] else 0\\n\\n for h in range(N + 1):\\n cnt = 0\\n for j in range(N):\\n if citations[j] >= h:\\n cnt += 1\\n if cnt < h:\\n h -= 1\\n break\\n\\n return h\\n \\n \",\n \"runtime\": \"165\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = 1\\n counter = 0\\n while True:\\n for i in range(0, len(citations)):\\n if citations[i] >= h:\\n counter += 1\\n if counter < h:\\n return h - 1\\n counter = 0\\n h += 1\",\n \"runtime\": \"165\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n citations.sort()\\n self.quicksort(citations, 0, n-1)\\n \\n for i in range(0, n):\\n rest = n-i\\n \\n if rest <= citations[i]:\\n return rest\\n return 0\\n \\n \\n def quicksort(self, arr, low, high):\\n if low < high:\\n p = self.partition(arr, low, high)\\n self.quicksort(arr, low, p-1)\\n self.quicksort(arr, p+1, high)\\n def partition(self, arr, low, high):\\n p = arr[high]\\n i = low -1\\n for j in range(i, high):\\n if arr[j] < p:\\n i+=1\\n arr[j], arr[i] = arr[i], arr[j]\\n arr[i+1], arr[high] = arr[high], arr[i+1]\\n return i+1\\n\",\n \"runtime\": \"168\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n \\n h = 0\\n for i in range(1, len(citations) + 1):\\n current = sum(x >= i for x in citations)\\n if current < i:\\n break\\n else:\\n h = i\\n \\n return h\",\n \"runtime\": \"168\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n c = 1\\n for p in citations:\\n a = 0\\n for i in citations:\\n if (i - c) >= 0:\\n a += 1\\n if a >= c:\\n c += 1\\n else:\\n break\\n return (c-1)\\n \\n\",\n \"runtime\": \"171\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = 1\\n num_papers = 0\\n res = []\\n\\n while h!= -1:\\n for i in range(len(citations)):\\n if citations[i] >= h:\\n num_papers += 1\\n \\n \\n if num_papers >= h:\\n res.append(h)\\n h += 1\\n \\n else:\\n return h-1\\n h = -1\\n break\\n \\n num_papers = 0\\n \",\n \"runtime\": \"171\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n ss = 0\\n index_h = 0\\n for i in range(1,len(citations)+1):\\n ss = sum(x >= i for x in citations)\\n if ss>=i:\\n index_h=i\\n elif index_h>0:\\n break\\n return index_h\\n\\n \",\n \"runtime\": \"174\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h=0\\n leng=len(citations)\\n if leng==1 and citations[0]==0:\\n return 0\\n elif leng==1 and citations[0]>0:\\n return 1\\n for i in range(0,leng+2):\\n temp=sum(k >= i for k in citations)\\n print('temp',temp,'i',i)\\n if temp>=i:\\n continue\\n else:\\n return i-1\\n \",\n \"runtime\": \"174\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations = sorted(citations)\\n citations = list(filter(lambda x : x > 0, citations))[::-1]\\n if len(citations) == 0:\\n return 0\\n for i in range(len(citations)):\\n print(citations, i)\\n if citations[i] <= i:\\n return i\\n return len(citations)\\n \",\n \"runtime\": \"180\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n #[3,8,0,6,1,5] remove 0s\\n #[3,8,6,1,5] h=1\\n\\n #[2,7,5,0,4] remove 0s\\n #[2,7,5,4] h=2\\n\\n\\n #[1,6,4,3] h=3\\n\\n #[0,5,3,2] remove 0s\\n #[5,3,2] h=4\\n\\n h = 0\\n while h <= len(citations):\\n citations = [c for c in citations if c != 0]\\n for i in range(len(citations)):\\n citations[i] -= 1\\n\\n h += 1 \\n \\n return h-1\\n\\n\",\n \"runtime\": \"180\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h_list = []\\n for citation in citations:\\n if citation not in h_list:\\n num_citation = sum(1 for x in citations if x >= citation)\\n if num_citation >= citation:\\n h_list.append(citation)\\n else:\\n h_list.append(num_citation)\\n \\n return max(h_list)\\n \",\n \"runtime\": \"183\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n ans = 0\\n for h in range(0, 5001):\\n nonNegative = 0\\n for c in citations:\\n if c - h >= 0:\\n nonNegative += 1\\n if nonNegative < h:\\n ans = h - 1\\n break\\n return ans\",\n \"runtime\": \"183\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n count_per_citations = np.zeros(max(citations) + 1)\\n for citation in citations:\\n count_per_citations[:citation+1] += 1\\n print(count_per_citations)\\n \\n max_h = 0\\n for i in range(len(count_per_citations)):\\n if count_per_citations[i] >= i:\\n max_h = i\\n else:\\n return max_h\\n return max_h\",\n \"runtime\": \"186\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n z = defaultdict(set)\\n for i in range(len(citations)):\\n for j in range(citations[i]):\\n z[j].add(i)\\n i = 0\\n while(len(z[i]) > i):\\n i += 1\\n return i\",\n \"runtime\": \"186\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n sorted_citations = sorted(citations)\\n cit_counts = {n: 0 for n in range(max(sorted_citations) + 1)} # keys: num citations, values num papers\\n for citation_count in sorted_citations:\\n for n in range(citation_count + 1):\\n cit_counts[n] += 1\\n\\n return max(cc for cc, num_papers in cit_counts.items() if num_papers >= cc)\\n \\n\",\n \"runtime\": \"189\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n sorted_citations = np.array(sorted(citations))\\n counts = 1 + np.arange(len(sorted_citations))[::-1]\\n hindex = 0\\n\\n for i, cit in enumerate(sorted_citations):\\n if cit >= counts[i] and counts[i] > hindex:\\n hindex = counts[i]\\n\\n return hindex\",\n \"runtime\": \"189\"\n },\n {\n \"code\": \"class Solution:\\n '''\\n - a more efficient solution is to not interate and update entire dict\\n - only \\n '''\\n def hIndex(self, citations: List[int]) -> int:\\n #there are at least this many citations\\n citation_count = defaultdict(int)\\n\\n for c in citations:\\n for i in range(min(c+1, len(citations)+1)):\\n citation_count[i] += 1\\n # print(citation_count)\\n for i in range(len(citations)+1, -1, -1):\\n if(citation_count[i] >= i):\\n return i\",\n \"runtime\": \"192\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n #[3,8,0,6,1,5] remove 0s\\n #[3,8,6,1,5] h=1\\n\\n #[2,7,5,0,4] remove 0s\\n #[2,7,5,4] h=2\\n\\n #[1,6,4,3] h=3\\n\\n #[0,5,3,2] remove 0s\\n #[5,3,2] h=4\\n \\n h = 0\\n while h <= len(citations):\\n citations = [c for c in citations if c != 0]\\n for i in range(len(citations)):\\n citations[i] -= 1\\n\\n h += 1 \\n \\n return h-1\\n\\n\",\n \"runtime\": \"192\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n=len(citations)\\n citations=np.sort(citations)\\n if max(citations)==0:\\n return 0\\n else:\\n i = 0\\n while i <= n:\\n if citations[i] >= n-i:\\n return n-i\\n i+=1\\n\",\n \"runtime\": \"195\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n d = defaultdict(int)\\n\\n n = len(citations)\\n\\n for i in range(0,n):\\n for i in range(1,citations[i]+1):\\n d[i] +=1\\n\\n ans = 0\\n for k,v in d.items():\\n if v >= k:\\n ans = max(ans,k)\\n\\n return ans\\n\",\n \"runtime\": \"195\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n count_per_citations = np.zeros(max(citations) + 1)\\n for citation in citations:\\n count_per_citations[:citation+1] += 1\\n \\n max_h = 0\\n for i in range(len(count_per_citations)):\\n if count_per_citations[i] >= i:\\n max_h = i\\n else:\\n return max_h\\n return max_h\",\n \"runtime\": \"198\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n d = collections.defaultdict(lambda: 0)\\n \\n for c in citations:\\n for i in range(c+1):\\n d[i] += 1\\n \\n arr = []\\n \\n for e in d.keys():\\n if e <= d[e]:\\n arr.append(e)\\n \\n return max(arr)\\n \",\n \"runtime\": \"198\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n c_max = max(citations)\\n h = 0\\n for i in range(c_max + 1):\\n n = 0\\n for j in range(len(citations)):\\n if citations[j] >= i:\\n n += 1\\n if n >= i:\\n h = i\\n print(\\\"i, j, n, h\\\", i, j, n, h)\\n\\n return(h)\\n \",\n \"runtime\": \"201\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n if len(citations) == 1 and citations[0] >= 1: return 1\\n citations.sort(reverse = True)\\n i, h, = 0, 0\\n while i < len(citations):\\n c = [x for x in citations if x >= citations[i]] \\n if len(c) >= citations[i] and h < citations[i]:\\n return citations[i]\\n else:\\n c = [x for x in citations if x >= (i + 1)] \\n # print(f\\\"c: {c}\\\")\\n # print(f\\\"i+1: {(i + 1)} len(c): {len(c)}\\\")\\n if len(c) >= (i + 1) and h < (i + 1):\\n h = (i + 1)\\n # print(f\\\"h: {h}\\\")\\n i += 1\\n # print(h)\\n return h\",\n \"runtime\": \"201\"\n },\n {\n \"code\": \"class Solution:\\n '''\\n - h-index has point of inflection\\n -- after certain h-index it will become invalid and stay that way\\n - we can do count sort and keep a >= count of each citation\\n - then do binary search on possible h-index\\n '''\\n def hIndex(self, citations: List[int]) -> int:\\n #there are at least this many citations\\n citation_count = defaultdict(int)\\n\\n for c in citations:\\n for i in range(min(c+1, len(citations)+1)):\\n citation_count[i] += 1\\n # print(citation_count)\\n for i in range(len(citations)+1, -1, -1):\\n if(citation_count[i] >= i):\\n return i\",\n \"runtime\": \"204\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n sorted_citations = sorted(citations, reverse=True)\\n h_idx = 0\\n for i in range(len(sorted_citations)):\\n h_idx = max(h_idx, min(i + 1, sorted_citations[i]))\\n # if i + 1 >= sorted_citations[i]:\\n # return sorted_citations[i]\\n return h_idx\",\n \"runtime\": \"204\"\n },\n {\n \"code\": \"from typing import Final\\n\\n\\nclass Solution:\\n MAX_CITATIONS: Final[int] = 1000\\n\\n def hIndex(self, citations: list[int]) -> int:\\n # method 1: linear search for h\\n for h in range(Solution.MAX_CITATIONS + 1):\\n if not self.checkH(citations, h):\\n return h - 1\\n return Solution.MAX_CITATIONS\\n\\n # method 2: binary search for h\\n # min_h = 0\\n # max_h = min(max(citations), len(citations))\\n # h: int = max_h // 2\\n\\n def checkH(self, citations: list[int], h: int) -> bool:\\n return len(list(filter(lambda e: e >= h, citations))) >= h\",\n \"runtime\": \"207\"\n },\n {\n \"code\": \"class Solution:\\n '''\\n - h-index has point of inflection\\n -- after certain h-index it will become invalid and stay that way\\n - we can do count sort and keep a >= count of each citation\\n - then do binary search on possible h-index\\n '''\\n def hIndex(self, citations: List[int]) -> int:\\n #there are at least this many citations\\n citation_count = defaultdict(int)\\n\\n for c in citations:\\n for i in range(c+1):\\n citation_count[i] += 1\\n # print(citation_count)\\n for i in range(max(citations)+1, -1, -1):\\n if(citation_count[i] >= i):\\n return i\\n \\n \\n \\n\\n \",\n \"runtime\": \"207\"\n },\n {\n \"code\": \"class Solution:\\n '''\\n - a more efficient solution is to not interate and update entire dict\\n - only \\n '''\\n def hIndex(self, citations: List[int]) -> int:\\n #there are at least this many citations\\n citation_count = defaultdict(int)\\n\\n for c in citations:\\n for i in range(min(c+1, len(citations)+1)):\\n citation_count[i] += 1\\n # print(citation_count)\\n for i in range(len(citations)+1, -1, -1):\\n if(citation_count[i] >= i):\\n return i\",\n \"runtime\": \"210\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n if len(citations) == 1:\\n return min(1, citations[0])\\n\\n dict = defaultdict(int)\\n\\n for i in citations:\\n for j in range(i, 0, -1):\\n dict[j] += 1\\n\\n def helper(k):\\n if dict[k] < k:\\n return 0\\n return k\\n\\n if not dict:\\n return 0\\n \\n #return largest key k such that dict[k] >= k\\n return max(dict, key=helper)\",\n \"runtime\": \"210\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n # n^2 sol\\n res = 0\\n\\n for i in range(1, 1000):\\n num_citations_needed = i\\n\\n for j in range(len(citations)): \\n if citations[j] >= i:\\n num_citations_needed -= 1\\n \\n if num_citations_needed <= 0:\\n res = max(res, i) \\n \\n return res\\n \",\n \"runtime\": \"213\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n counter = defaultdict(lambda: 0)\\n\\n for count in citations:\\n for i in range(count + 1):\\n counter[i] += 1\\n \\n return max(h for h in counter if counter[h] >= h)\\n\",\n \"runtime\": \"213\"\n },\n {\n \"code\": \"class Solution:\\n '''\\n - h-index has point of inflection\\n -- after certain h-index it will become invalid and stay that way\\n - we can do count sort and keep a >= count of each citation\\n - then do binary search on possible h-index\\n '''\\n def hIndex(self, citations: List[int]) -> int:\\n #there are at least this many citations\\n citation_count = defaultdict(int)\\n\\n for c in citations:\\n for i in range(c+1):\\n citation_count[i] += 1\\n # print(citation_count)\\n for i in range(max(citations)+1, -1, -1):\\n if(citation_count[i] >= i):\\n return i\\n \\n \\n \\n\\n \",\n \"runtime\": \"216\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort()\\n count_dict = defaultdict(int)\\n\\n result, i = 0, 0\\n \\n # [0, 1, 3, 5, 6]\\n\\n while i != len(citations):\\n if citations[i] < result:\\n i += 1\\n elif citations[i] >= result:\\n for j in range(0, min(citations[i], len(citations) + 1)):\\n count_dict[j] += 1\\n if count_dict[result] > result:\\n result += 1\\n i += 1\\n return result\",\n \"runtime\": \"216\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n # last bucket holds all values larger than size of arr n\\n buckets = {i:0 for i in range(n+1)}\\n for cite in citations:\\n if cite >= n:\\n buckets[n] += 1\\n temp = min(cite, n-1) \\n while temp != 0:\\n buckets[temp] += 1\\n temp -= 1\\n for key in sorted(list(buckets.keys()), reverse=True):\\n print(\\\"Curr H:\\\\t\\\", key, \\\"Count:\\\\t\\\", buckets[key])\\n if key <= buckets[key]:\\n return key\\n return 0\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n \\n\\n from collections import defaultdict\\n\\n d = defaultdict(int)\\n\\n for ind,item in enumerate(citations):\\n for i in range(item):\\n d[i+1] += 1\\n\\n # print(d)\\n k = 0\\n for k,v in d.items():\\n\\n if v < k:\\n break\\n\\n else:\\n return k if d else 0\\n\\n\\n return k-1 if d else 0\\n\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n for i in range(n, -1, -1):\\n if len([c for c in citations if c >= i]) >= i:\\n return i\\n\",\n \"runtime\": \"222\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n h = 0\\n citations = np.array(citations)\\n\\n for i in range(1, n+ 1):\\n n_citatios = np.sum(citations >= i)\\n if n_citatios >= i:\\n h = i\\n return h\\n \",\n \"runtime\": \"222\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n \\n # TERRIBLE SOLUTION \\n # if len(citations) == 1 and citations[0] > 0:\\n # return 1\\n # if len(citations) == 1 and citations[0] == 0:\\n # return 0\\n # you could sort and iterate from the highest to lowest and when len(curr)>= i, just return i\\n \\n # max_so_far = 0\\n # for i in range(0, len(citations) + 1):\\n # curr = [x for x in citations if x >= i]\\n # if len(curr) >= i:\\n # x = i\\n # else:\\n # x= 0\\n # max_so_far = max(max_so_far, x)\\n # return max_so_far\\n\\n # Same sort of idea but still terrible runtime\\n # sorted_citations = sorted(citations)\\n # max_so_far = 0\\n # for i in range(len(citations), -1, -1):\\n # curr = [x for x in citations if x >= i]\\n # if len(curr) >= i:\\n # return i\\n # return max_so_far\\n\\n # sorted_citations = sorted(citations)\\n max_so_far = 0\\n for i in range(len(citations), -1, -1):\\n curr = [x for x in citations if x >= i]\\n if len(curr) >= i:\\n return i\\n return max_so_far\",\n \"runtime\": \"224\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = 0\\n counter = len(citations)\\n while counter >= 0:\\n new = [x for x in citations if x >= counter]\\n if len(new) >= counter:\\n h = counter\\n return h\\n counter -= 1\\n return h\\n \\n \",\n \"runtime\": \"227\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n count_per_citations = np.zeros(max(citations) + 1)\\n for citation in citations:\\n count_per_citations[:citation+1] += 1\\n for i in range(len(count_per_citations) - 1, -1, -1):\\n if count_per_citations[i] >= i:\\n return i\\n return 0\",\n \"runtime\": \"227\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n max_h_num = len(citations)\\n h_num = 0\\n for h in reversed(range(max_h_num +1)):\\n enough_cit = [x for x in citations if x >= h]\\n # print(len(enough_cit))\\n # print(f'h number {h}')\\n if h <= len(enough_cit):\\n return h\\n return h_num\\n \",\n \"runtime\": \"230\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n # citations.sort()\\n # h_max = min(citations[-1], len(citations))\\n h_max = len(citations)\\n\\n while 1:\\n account = len([num for num in citations if num >= h_max])\\n if account >= h_max:\\n return h_max\\n h_max -= 1\\n\\n\\n\",\n \"runtime\": \"230\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n for i in range(len(citations),0,-1):\\n reviewed = [x for x in citations if x >= i]\\n if len(reviewed) >= i:\\n return(i)\\n return 0\",\n \"runtime\": \"233\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n\\n cite_dict = {k:0 for k in citations}\\n for i in citations:\\n for k in cite_dict.keys():\\n if i>=k:\\n cite_dict[k] += 1\\n\\n best_score = 0\\n # cases where author has many papers and fewer citation se.g. [3,0,6,1,5]\\n for k,v in sorted( cite_dict.items(), reverse=True ):\\n if v>=k and k>best_score:\\n best_score = k\\n \\n #cases where fewer papers and more citations e.g. [11, 15]\\n for v,k in sorted(zip(cite_dict.values(), cite_dict.keys()), reverse = True):\\n if k>=v and v>best_score:\\n best_score = v\\n \\n return best_score\",\n \"runtime\": \"233\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n \\n # TERRIBLE SOLUTION \\n # if len(citations) == 1 and citations[0] > 0:\\n # return 1\\n # if len(citations) == 1 and citations[0] == 0:\\n # return 0\\n # you could sort and iterate from the highest to lowest and when len(curr)>= i, just return i\\n sorted_citations = sorted(citations)\\n max_so_far = 0\\n for i in range(len(citations), -1, -1):\\n curr = [x for x in citations if x >= i]\\n if len(curr) >= i:\\n return i\\n \\n \",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n \\\"\\\"\\\"\\n hIndex is max h such that there are at least citations[i] each >= h\\n [3, 0, 6, 1, 5]\\n 3 6 5\\n 0 6 1 5\\n 6\\n 1 5\\n\\n 4: 4 4\\n\\n [0, 3, 2, 0]\\n 0: 0, 3\\n 3: 3\\n 2: 3\\n \\\"\\\"\\\"\\n citation_to_geq_count = {}\\n for citation in citations:\\n if citation not in citation_to_geq_count:\\n citation_to_geq_count[citation] = 0\\n for citation in citations:\\n for key in citation_to_geq_count:\\n if citation >= key:\\n citation_to_geq_count[key] += 1\\n if citation not in citation_to_geq_count:\\n citation_to_geq_count[citation] = 1\\n max_h_val = float('-inf')\\n for key in citation_to_geq_count:\\n if citation_to_geq_count[key] >= key:\\n max_h_val = max(max_h_val, key)\\n elif key > citation_to_geq_count[key]:\\n max_h_val = max(max_h_val, citation_to_geq_count[key])\\n return max_h_val\",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = {}\\n for i in range(len(citations)):\\n n = citations[i]\\n for j in range(1, n + 1):\\n if j not in h:\\n h[j] = 1\\n else:\\n h[j] += 1\\n print(sorted(h.keys()))\\n print(h)\\n for citations in sorted(h.keys(), reverse=True):\\n if citations <= h[citations]:\\n return citations\\n return 0\",\n \"runtime\": \"239\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n for i in reversed(range(len(citations)+1)):\\n if len([x for x in citations if x >= i]) >= i:\\n return i\\n\",\n \"runtime\": \"239\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n # array\\n # ith paper received citations[i] number of citations\\n # h-index = maximum value of h such that the given researcher has ublished at least h papers that have been cited at least h times\\n '''\\n Brute Force:\\n Try all h from 1 to len(citations)\\n \\n and see if there exists sum(paper for paper in citations if paper >= h)\\n \\n this is O(N^2)\\n '''\\n h_index = 0\\n for h in reversed(range(0, len(citations)+1)):\\n count = sum(1 for citation in citations if citation >= h)\\n if count >= h:\\n return h\\n \",\n \"runtime\": \"242\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n d = {i: 0 for i in citations}\\n for i in citations:\\n for k in d:\\n if k <= i:\\n d[k] += 1\\n h = 0\\n for k, v in d.items():\\n if k > h and v > h:\\n h = min(k, v)\\n return h\",\n \"runtime\": \"242\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n length = len(citations)\\n\\n h_map = {}\\n for i in range(length):\\n for j in range(1,citations[i]+1):\\n if not j in h_map:\\n h_map[j] = 1\\n else:\\n h_map[j] += 1\\n h_index = 0\\n for item in h_map.items():\\n if item[0] <= item[1]:\\n h_index = item[0]\\n return h_index\\n \\n\",\n \"runtime\": \"245\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n cit_geq = {}\\n for citation in citations:\\n cit_geq[citation] = 0\\n max_h = 0\\n for citation in citations:\\n for key in cit_geq:\\n if citation >= key:\\n cit_geq[key] += 1\\n for key in cit_geq:\\n h_ind = min(key, cit_geq[key])\\n max_h = max(max_h, h_ind)\\n return max_h\",\n \"runtime\": \"245\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n greed = max(citations)\\n d = {}\\n for cit in citations:\\n for v in range(cit+1):\\n if v in d:\\n d[v] +=1\\n else:\\n d[v]=1\\n for i in range(greed, 0, -1):\\n if d[i] >= i:\\n return i\\n return 0\",\n \"runtime\": \"248\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: list[int]) -> int:\\n h_index_map = {}\\n for citation in citations:\\n for val in range(1, citation+1):\\n if val in h_index_map:\\n h_index_map[val] += 1\\n else:\\n h_index_map[val] = 1\\n \\n h_index = 0\\n for index in list(h_index_map.keys())[::-1]:\\n if h_index_map[index] >= index:\\n h_index = index\\n break\\n return h_index\\n \",\n \"runtime\": \"248\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n for maxNum in range(len(citations), -1, -1):\\n foundMax = False\\n # if x papers have been cited at least x times\\n currCount = 0\\n for x in citations:\\n if x >= maxNum:\\n currCount += 1\\n if currCount >= maxNum:\\n return maxNum\\n return 0\\n\",\n \"runtime\": \"251\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n if sum(citations) == 0:\\n return 0\\n for i in range(len(citations), -1, -1):\\n if len([a for a in citations if a >= i ]) >= i:\\n return i\\n return 1\",\n \"runtime\": \"251\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":155,"string":"155"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n # 0, 1, 3, 5, 6\n citations.sort(key=lambda c: -c)\n h_index = 0\n print(citations)\n while h_index < len(citations) and citations[h_index] >= h_index + 1:\n print(h_index)\n h_index += 1\n return h_index","memory":"16100"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n citations.sort()\n\n for i,v in enumerate(citations):\n if n - i <= v:\n return n - i\n return 0\n","memory":"16200"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations = sorted(citations, reverse=True)\n return sum(i<j for i ,j in enumerate(citations))\n ","memory":"16400"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort(reverse=True)\n for i in range(len(citations)):\n if citations[i] <= i:\n return i\n return len(citations)","memory":"16500"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n result = 0\n for i in range(1, len(citations)+1):\n count = 0\n for citation in citations:\n if citation >= i:\n count += 1\n if count >= i:\n result = i\n return result","memory":"16600"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n \n h=0\n citations.sort(reverse=True)\n \n for i in range(len(citations)):\n if citations[i]>=i+1:\n h+=1\n else:\n return h\n \n return len(citations)","memory":"16600"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations = sorted(citations)[::-1]\n cnt = 0\n for cit in citations:\n if cit > cnt:\n cnt += 1\n else:\n break\n return cnt\n","memory":"16700"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h = min(min(citations), len(citations))\n while len(citations) > h:\n h = min(citations)\n if h >= len(citations): return len(citations)\n citations = [x for x in citations if x > h]\n if len(citations) < h: return h\n \n return len(citations)\n","memory":"16700"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort()\n N = len(citations)\n h = -1\n for i in range(N):\n if citations[i]>=N-i:\n h = i\n break\n if h<0:\n return 0\n return N-h\n ","memory":"16800"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n counter = {}\n n = len(citations)\n max_citations = max(citations)\n max_h = min(n, max_citations)\n count_arr = [0]*(max_citations+1)\n\n for citation in citations:\n count_arr[citation] += 1\n\n for h in range(max_h, 0, -1):\n if sum(count_arr[h:]) >= h:\n return h\n\n return 0\n\n\n \n \"\"\"\n ## print(f'max_h: {max_h}')\n for h in range(max_h, 0, -1):\n ## print(h)\n gt_h = [i >= h for i in citations]\n n_gt_h = sum(gt_h)\n ## print(f'n_gt_h: {n_gt_h}, h: {h}')\n if n_gt_h >= h:\n return h\n\n return 0\n \"\"\"\n ","memory":"16800"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort(reverse = True)\n h = 0\n for i in range(len(citations)):\n if citations[i] >= i+1:\n h += 1\n return h\n \n ","memory":"16900"}],"string":"[\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n # 0, 1, 3, 5, 6\\n citations.sort(key=lambda c: -c)\\n h_index = 0\\n print(citations)\\n while h_index < len(citations) and citations[h_index] >= h_index + 1:\\n print(h_index)\\n h_index += 1\\n return h_index\",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n citations.sort()\\n\\n for i,v in enumerate(citations):\\n if n - i <= v:\\n return n - i\\n return 0\\n\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations = sorted(citations, reverse=True)\\n return sum(i<j for i ,j in enumerate(citations))\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort(reverse=True)\\n for i in range(len(citations)):\\n if citations[i] <= i:\\n return i\\n return len(citations)\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n result = 0\\n for i in range(1, len(citations)+1):\\n count = 0\\n for citation in citations:\\n if citation >= i:\\n count += 1\\n if count >= i:\\n result = i\\n return result\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n \\n h=0\\n citations.sort(reverse=True)\\n \\n for i in range(len(citations)):\\n if citations[i]>=i+1:\\n h+=1\\n else:\\n return h\\n \\n return len(citations)\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations = sorted(citations)[::-1]\\n cnt = 0\\n for cit in citations:\\n if cit > cnt:\\n cnt += 1\\n else:\\n break\\n return cnt\\n\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h = min(min(citations), len(citations))\\n while len(citations) > h:\\n h = min(citations)\\n if h >= len(citations): return len(citations)\\n citations = [x for x in citations if x > h]\\n if len(citations) < h: return h\\n \\n return len(citations)\\n\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort()\\n N = len(citations)\\n h = -1\\n for i in range(N):\\n if citations[i]>=N-i:\\n h = i\\n break\\n if h<0:\\n return 0\\n return N-h\\n \",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n counter = {}\\n n = len(citations)\\n max_citations = max(citations)\\n max_h = min(n, max_citations)\\n count_arr = [0]*(max_citations+1)\\n\\n for citation in citations:\\n count_arr[citation] += 1\\n\\n for h in range(max_h, 0, -1):\\n if sum(count_arr[h:]) >= h:\\n return h\\n\\n return 0\\n\\n\\n \\n \\\"\\\"\\\"\\n ## print(f'max_h: {max_h}')\\n for h in range(max_h, 0, -1):\\n ## print(h)\\n gt_h = [i >= h for i in citations]\\n n_gt_h = sum(gt_h)\\n ## print(f'n_gt_h: {n_gt_h}, h: {h}')\\n if n_gt_h >= h:\\n return h\\n\\n return 0\\n \\\"\\\"\\\"\\n \",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort(reverse = True)\\n h = 0\\n for i in range(len(citations)):\\n if citations[i] >= i+1:\\n h += 1\\n return h\\n \\n \",\n \"memory\": \"16900\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":11,"string":"11"}}},{"rowIdx":167,"cells":{"question_id":{"kind":"number","value":275,"string":"275"},"name":{"kind":"string","value":"h-index-ii"},"content":{"kind":"string","value":"<p>Given an array of integers <code>citations</code> where <code>citations[i]</code> is the number of citations a researcher received for their <code>i<sup>th</sup></code> paper and <code>citations</code> is sorted in <strong>ascending order</strong>, return <em>the researcher's h-index</em>.</p>\n\n<p>According to the <a href=\"https://en.wikipedia.org/wiki/H-index\" target=\"_blank\">definition of h-index on Wikipedia</a>: The h-index is defined as the maximum value of <code>h</code> such that the given researcher has published at least <code>h</code> papers that have each been cited at least <code>h</code> times.</p>\n\n<p>You must write an algorithm that runs in logarithmic time.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> citations = [0,1,3,5,6]\n<strong>Output:</strong> 3\n<strong>Explanation:</strong> [0,1,3,5,6] means the researcher has 5 papers in total and each of them had received 0, 1, 3, 5, 6 citations respectively.\nSince the researcher has 3 papers with at least 3 citations each and the remaining two with no more than 3 citations each, their h-index is 3.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> citations = [1,2,100]\n<strong>Output:</strong> 2\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>n == citations.length</code></li>\n\t<li><code>1 <= n <= 10<sup>5</sup></code></li>\n\t<li><code>0 <= citations[i] <= 1000</code></li>\n\t<li><code>citations</code> is sorted in <strong>ascending order</strong>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":38.43534875120896,"string":"38.435349"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","binary-search"],"string":"[\n \"array\",\n \"binary-search\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"42\", 0.1119], [\"90\", 0.0559], [\"95\", 0.0559], [\"96\", 0.0559], [\"97\", 0.1119], [\"98\", 0.0559], [\"99\", 0.1678], [\"100\", 0.1119], [\"101\", 0.5034], [\"102\", 0.5593], [\"103\", 0.7271], [\"104\", 0.8389], [\"105\", 1.2864], [\"106\", 1.1745], [\"107\", 2.2931], [\"108\", 2.4609], [\"109\", 2.9083], [\"110\", 3.4676], [\"111\", 3.6913], [\"112\", 3.9709], [\"113\", 4.3624], [\"114\", 5.5928], [\"115\", 5.5369], [\"116\", 5.8166], [\"117\", 5.6488], [\"118\", 5.7606], [\"119\", 4.698], [\"120\", 5.4251], [\"121\", 4.7539], [\"122\", 5.5928], [\"123\", 4.1946], [\"124\", 2.7405], [\"125\", 2.2931], [\"126\", 2.2371], [\"127\", 2.0694], [\"128\", 0.8389], [\"129\", 1.2304], [\"130\", 0.783]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"20100\", 0.1119], [\"22900\", 0.2237], [\"23000\", 0.5593], [\"23100\", 1.4541], [\"23200\", 3.7472], [\"23300\", 19.1834], [\"23400\", 60.8501]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n left, right = 0, len(citations) - 1\n res = 0\n\n while left <= right:\n mid = (left + right) // 2\n if citations[mid] >= len(citations) - mid:\n res = len(citations) - mid\n right = mid - 1\n else:\n left = mid + 1\n \n return res\n\nwith open(\"user.out\", \"w\") as f:\n for i in map(loads, stdin):\n print(Solution().hIndex(i), file=f)\nexit(0) ","runtime":"42"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n if not citations:\n return 0\n \n start, end = 0, len(citations)\n while start + 1 < end:\n mid = start + (end - start) // 2\n if self.has_h_index_no_less_than_k(mid, citations):\n start = mid\n else:\n end = mid\n if self.has_h_index_no_less_than_k(end, citations):\n return end\n else:\n return start\n \n def has_h_index_no_less_than_k(self, k, citations):\n if k == 0:\n return True\n idx = len(citations) - k\n return citations[idx] >= k","runtime":"90"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n if citations[-1] == 0:\n return 0 \n \n n = len(citations)\n left = 0\n right = n - 1\n while left <= right:\n mid = left + (right - left) // 2\n\n # Can I say H-index is n - mid?\n if citations[mid] >= n - mid:\n h_index = n - mid\n right = mid - 1\n else:\n left = mid + 1\n return h_index","runtime":"95"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n l,r = 0,len(citations)\n\n # try to find the first value which is too small\n while l < r:\n mid = l + (r-l)//2\n #mid is too big or is good\n if citations[mid] >= (len(citations) - mid):\n r = mid \n #mid is too small\n else:\n l = mid + 1\n\n return len(citations) - l","runtime":"96"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n for i, c in enumerate(citations):\n if c >= n - i:\n return n - i\n return 0","runtime":"97"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n l, r = citations[0], citations[-1]\n if citations[0] >= n:\n return n\n while l < r:\n m = ceil((l + r) / 2)\n if m <= n and m <= citations[-m]:\n l = m\n else:\n r = m - 1\n return l\n","runtime":"98"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n # citations, n = citations[::-1], len(citations)\n # for i in range(n):\n # if citations[i] <= i:\n # return i\n\n # return n\n\n n = len(citations)\n \n return n - bisect_left(range(n), True, key=lambda x: not citations[x] < n - x)\n\n n = len(citations)\n l, r = 0, n - 1\n while l < r:\n mid = (l + r) // 2\n\n if citations[mid] < n - mid:\n l = mid + 1\n else:\n r = mid\n\n return n - l\n","runtime":"99"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n left, right = 0, len(citations)\n while left <= right:\n mid = (right + left) // 2\n if citations[-mid] >= mid:\n left = mid + 1\n else:\n right = mid - 1\n return right","runtime":"100"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n left, right =0, len(citations)\n while left <= right:\n mid = (right + left) // 2\n if citations[-mid] >= mid:\n left = mid + 1\n else: right = mid - 1\n return right","runtime":"101"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n left, right = 0, n - 1\n \n while left <= right:\n mid = (left + right) // 2\n h = n - mid\n \n if citations[mid] == h:\n return h\n elif citations[mid] < h:\n left = mid + 1\n else:\n right = mid - 1\n \n return n - left","runtime":"102"},{"code":"# Data Structures and Algorithm Used:\n# Binary search to find the maximum h-index in a sorted array.\n\n# Short Intuition:\n# Use binary search to efficiently find the maximum h-index by comparing citations[mid] with n - mid.\n\n# Detailed Intuition:\n# - We use binary search on the sorted citations array to find the maximum h where h = n - mid and citations[mid] >= h.\n# - The key insight is that for a valid h-index, citations[mid] should be greater than or equal to h = n - mid.\n# - Adjust the search space based on this condition until the correct h-index is found.\n\n# Pseudocode:\n# 1. Initialize low and high pointers to 0 and len(citations) - 1.\n# 2. Perform binary search:\n# a. Calculate mid.\n# b. Calculate h = n - mid.\n# c. If citations[mid] >= h, move the search space to the right.\n# d. If citations[mid] < h, move the search space to the left.\n# 3. Return the h-index.\n\nclass Solution:\n def hIndex(self, citations):\n n = len(citations)\n low, high = 0, n - 1\n \n while low <= high:\n mid = (low + high) // 2\n h = n - mid\n \n if citations[mid] == h:\n return h\n elif citations[mid] < h:\n low = mid + 1\n else:\n high = mid - 1\n \n # If no exact match is found, return n - low\n return n - low\n\n# Time Complexity:\n# - O(log n) due to the binary search over the sorted array.\n\n# Space Complexity:\n# - O(1) since we are only using a few variables.\n","runtime":"103"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n # find value where i >= citations[i]\n # left most value of i >= citations[i]\n\n l, r = 0, len(citations) - 1\n result = -1\n while l <= r:\n mid = l + (r - l) // 2\n\n h_published_papers = len(citations) - mid\n h_citations = mid + 1\n if citations[mid] >= h_published_papers:\n result = h_published_papers\n r = mid - 1\n else:\n l = mid + 1\n\n if result == -1:\n return 0\n return result\n # farthest right of i+1 > citations[i], such that cited at least h times\n\n ","runtime":"104"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n left = 0\n right = n-1\n while left <= right:\n middle = (left + right) //2\n if citations[middle] >= n- middle:\n right = middle-1\n else:\n left = middle +1\n return n-left\n","runtime":"105"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n l, r = 0, len(citations) - 1\n h = 0\n\n while l <= r:\n mid = (l + r) // 2\n\n if citations[mid] >= (len(citations) - mid):\n r = mid - 1\n h = max(h, len(citations) - mid)\n else:\n l = mid + 1\n \n return h\n ","runtime":"106"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n l, r = 0, n - 1\n while l <= r:\n mid = (l + r) // 2\n if citations[mid] == n - mid:\n return n - mid\n elif citations[mid] < n - mid:\n l = mid + 1\n else:\n r = mid - 1\n return n - l\n ","runtime":"107"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n\n n = len(citations)\n \n def valid(h):\n l, r = 0, n - 1\n\n while l <= r:\n m = (l + r) >> 1\n\n if citations[m] < h:\n l = m + 1\n else:\n r = m - 1\n\n return n - l >= h\n\n l, r = 0, citations[n - 1]\n res = 0\n\n while l <= r:\n m = (l + r) >> 1\n\n if valid(m):\n res = m\n l = m + 1\n else:\n r = m - 1\n\n return res","runtime":"108"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n l, r = 0, len(citations) - 1\n n = len(citations)\n\n while l <= r:\n m = l + (r - l) // 2\n if citations[m] >= n - m:\n r = m - 1\n else:\n l = m + 1\n \n return n - l","runtime":"109"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n start = 0\n n = len(citations)\n if n == 1:\n return min(1, citations[0])\n end = n - 1\n\n ans = 0 \n while(start<=end):\n mid = ( start + end ) // 2\n if citations[mid] <= n -mid :\n ans = max(ans, citations[mid])\n start = mid + 1\n else:\n end = mid - 1\n ans = max(ans,n -mid )\n return ans\n ","runtime":"110"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n if citations[-1] == 0:\n return 0 \n \n n = len(citations)\n left = 0\n right = n - 1\n while left <= right:\n mid = left + (right - left) // 2\n\n # Can I say H-index is n - mid?\n if citations[mid] >= n - mid:\n h_index = n - mid\n right = mid - 1\n else:\n left = mid + 1\n return h_index","runtime":"111"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n left = 0\n right = n-1\n\n ans = 0\n\n while left <= right:\n mid = (left+right)//2\n if citations[mid] >= n-mid:\n ans = n-mid\n right = mid-1\n else:\n left = mid+1\n return ans","runtime":"112"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n left, right = 0, n - 1\n\n while left <= right:\n mid = (left + right) // 2\n if citations[mid] == n - mid:\n return citations[mid]\n elif citations[mid] < n - mid:\n left = mid + 1\n else:\n right = mid - 1\n\n return n - left","runtime":"112"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n l, r = 0, len(citations) - 1\n n = len(citations)\n\n while l <= r:\n m = l + (r - l) // 2\n if citations[m] >= n - m:\n r = m - 1\n else:\n l = m + 1\n \n return n - l","runtime":"113"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n left, right = 0, n - 1\n while left <= right:\n mid = (left + right) // 2\n target = n - mid\n if citations[mid] == target:\n return n - mid\n elif citations[mid] < target:\n left = mid + 1\n else:\n right = mid - 1\n \n return n - left","runtime":"113"},{"code":"class Solution:\n def hIndex(self, citations):\n left, right = 0, len(citations) - 1\n h_index = 0\n \n while left <= right:\n mid = (left + right) // 2\n # The number of papers with at least citations[mid] citations\n papers_with_at_least_citations = len(citations) - mid\n if citations[mid] >= papers_with_at_least_citations:\n h_index = papers_with_at_least_citations\n right = mid - 1\n else:\n left = mid + 1\n \n return h_index\n","runtime":"114"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n left = 0\n right = n-1\n while left < right:\n middle = (left + right + 1) // 2\n if n - middle < citations[middle]:\n right = middle - 1\n else:\n left = middle\n return n - left - (citations[left] < n - left)\n ","runtime":"115"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n left, right = 0, n - 1\n while left <= right:\n mid = (left + right) // 2\n if citations[mid] == n - mid:\n return n - mid\n elif citations[mid] < n - mid:\n left = mid + 1\n else:\n right = mid - 1\n \n return n - left","runtime":"115"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n\n\n lo = 0\n hi = len(citations) - 1\n\n while lo <= hi:\n\n mid = lo + (hi - lo) // 2\n if citations[mid] == len(citations) - mid:\n return citations[mid]\n elif citations[mid] < len(citations) - mid :\n lo = mid + 1\n else:\n hi = mid - 1\n \n\n\n return len(citations) - lo\n\n\n\n\n\n ","runtime":"116"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n l=0\n r=len(citations)\n while l<r:\n m=(l+r)//2\n if citations[m]>len(citations)-1-m:\n r=m\n else:\n l=m+1\n return len(citations)-l\n ","runtime":"116"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n c=citations\n n=len(c)\n l=0\n r=n-1\n k=0\n # if len(c)==1:\n # if c[0]==0:\n # return 0\n # return 1\n while l<=r:\n mid=(l+r)//2\n k=n-mid\n if c[mid]==k:\n return k\n elif c[mid]<k:\n l=mid+1\n else:\n r=mid-1\n return n-l\n\n ","runtime":"117"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n=len(citations)\n l=0\n h=n-1\n while l<=h:\n mid=(l+h)//2\n diff=n-mid\n if citations[mid]==diff:\n return diff\n elif citations[mid]>diff:\n h=mid-1\n else:\n l=mid+1\n return n-l","runtime":"117"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n left = 0\n right = n-1\n while left <= right:\n middle = (left + right + 1) // 2\n if n - middle <= citations[middle]:\n right = middle - 1\n else:\n left = middle + 1\n return n - left\n ","runtime":"118"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n\n count = 0\n numPapers = 0\n\n for i in range(len(citations) - 1, -1, -1):\n if citations[i] > numPapers:\n numPapers += 1\n else:\n return numPapers\n return numPapers\n \n ","runtime":"118"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n\n\n l, r = 0, len(citations)-1\n while l<=r:\n midd = (l+r)//2\n if citations[midd] == len(citations) - midd:\n return len(citations) - midd\n elif citations[midd] > len(citations) - midd:\n r = midd -1\n else:\n l = midd + 1\n if 0<=l<len(citations):\n return len(citations) - l\n elif l>=len(citations):\n return 0\n else:\n return len(citations)\n ","runtime":"119"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n if n < 2:\n return min(1, citations[0])\n low, high = 0, n - 1\n\n max_result = 0\n while low <= high:\n mid = (high + low) // 2\n \n if citations[mid] >= (n - mid):\n max_result = max(max_result, n - mid)\n high = mid - 1\n else:\n low = mid + 1\n\n return max_result","runtime":"120"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n=len(citations)\n if citations[-1]==0:\n return 0\n if citations[0]>=n:\n return n\n l=1\n h=n-1\n while(l<=h):\n mid=(l+h)//2\n if citations[n-mid]>=mid:\n ans= mid\n l=mid+1\n else:\n h=mid-1\n return ans\n\n\n ","runtime":"120"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n low, high = 0, n - 1\n while low <= high:\n mid = (low + high) // 2\n if citations[mid] >= n - mid:\n high = mid - 1\n else:\n low = mid + 1\n \n return n - low","runtime":"121"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n left = 0\n right = n - 1\n while left <= right:\n mid = left + (right-left)//2\n if citations[mid] == n-mid:\n return n - mid\n elif citations[mid] < n-mid:\n left = mid+1\n else: right = mid-1\n \n return n-left\n \n \n\n ","runtime":"121"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n citations.sort()\n count = 0\n while citations:\n cite = citations.pop()\n count += 1\n if cite < count:\n return count - 1\n \n return count","runtime":"122"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n l, r = 0, len(citations) - 1\n n = len(citations)\n while l <= r:\n m = l + (r - l) // 2\n if citations[m] >= n - m:\n r = m - 1\n else:\n l = m + 1 \n return n - l\n \n ","runtime":"122"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n left, right = 0, n - 1\n while left <= right:\n mid = (left + right) // 2\n if citations[mid] == n - mid:\n return n - mid\n elif citations[mid] < n - mid:\n left = mid + 1\n else:\n right = mid - 1\n \n return n - left","runtime":"123"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n\n\n def givenH(h):\n s=0\n n=len(citations)\n if( n-h < len(citations) and n-h >= 0 and citations[n-h] >= h):\n return True\n\n return False\n\n \n f=1\n l=len(citations)\n ans=0\n while(f<=l):\n m = f + (l-f)//2\n if(givenH(m)):\n ans=max(m,ans)\n f=m+1\n else:\n l=m-1\n return ans\n\n\n\n ","runtime":"124"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n left, right = 0, n - 1\n \n while left <= right:\n mid = left + (right - left) // 2\n h = n - mid\n \n if citations[mid] == h:\n return h\n elif citations[mid] < h:\n left = mid + 1\n else:\n right = mid - 1\n \n return n - left","runtime":"125"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n l, r = 0, n-1\n while l <= r:\n mid = (l+r)//2\n if citations[mid] == n - mid:\n return n - mid\n elif citations[mid] > n - mid:\n r = mid - 1\n else:\n l = mid + 1\n return n - l\n","runtime":"126"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n h_index = len(citations)\n i = 0\n\n while i < len(citations) and h_index > citations[i] and h_index > 0:\n i += 1\n h_index -= 1\n\n return h_index","runtime":"127"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n i = 0\n for c in citations:\n if c >= n-i: \n return n - i\n else: i += 1\n return 0\n \n \n\n ","runtime":"128"},{"code":"class Solution:\n def hIndex(self, c: List[int]) -> int:\n return max(min(c[i],len(c)-i) for i in range(len(c)))","runtime":"128"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n i = 0\n for c in citations:\n if c >= n-i: \n return n - i\n else: i += 1\n return 0\n \n \n\n ","runtime":"129"},{"code":"class Solution:\n def hIndex(self, citations):\n L = len(citations)\n for i in range(L):\n if L - i <= citations[i]: return L - i\n return 0","runtime":"130"}],"string":"[\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n left, right = 0, len(citations) - 1\\n res = 0\\n\\n while left <= right:\\n mid = (left + right) // 2\\n if citations[mid] >= len(citations) - mid:\\n res = len(citations) - mid\\n right = mid - 1\\n else:\\n left = mid + 1\\n \\n return res\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n for i in map(loads, stdin):\\n print(Solution().hIndex(i), file=f)\\nexit(0) \",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n if not citations:\\n return 0\\n \\n start, end = 0, len(citations)\\n while start + 1 < end:\\n mid = start + (end - start) // 2\\n if self.has_h_index_no_less_than_k(mid, citations):\\n start = mid\\n else:\\n end = mid\\n if self.has_h_index_no_less_than_k(end, citations):\\n return end\\n else:\\n return start\\n \\n def has_h_index_no_less_than_k(self, k, citations):\\n if k == 0:\\n return True\\n idx = len(citations) - k\\n return citations[idx] >= k\",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n if citations[-1] == 0:\\n return 0 \\n \\n n = len(citations)\\n left = 0\\n right = n - 1\\n while left <= right:\\n mid = left + (right - left) // 2\\n\\n # Can I say H-index is n - mid?\\n if citations[mid] >= n - mid:\\n h_index = n - mid\\n right = mid - 1\\n else:\\n left = mid + 1\\n return h_index\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n l,r = 0,len(citations)\\n\\n # try to find the first value which is too small\\n while l < r:\\n mid = l + (r-l)//2\\n #mid is too big or is good\\n if citations[mid] >= (len(citations) - mid):\\n r = mid \\n #mid is too small\\n else:\\n l = mid + 1\\n\\n return len(citations) - l\",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n for i, c in enumerate(citations):\\n if c >= n - i:\\n return n - i\\n return 0\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n l, r = citations[0], citations[-1]\\n if citations[0] >= n:\\n return n\\n while l < r:\\n m = ceil((l + r) / 2)\\n if m <= n and m <= citations[-m]:\\n l = m\\n else:\\n r = m - 1\\n return l\\n\",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n # citations, n = citations[::-1], len(citations)\\n # for i in range(n):\\n # if citations[i] <= i:\\n # return i\\n\\n # return n\\n\\n n = len(citations)\\n \\n return n - bisect_left(range(n), True, key=lambda x: not citations[x] < n - x)\\n\\n n = len(citations)\\n l, r = 0, n - 1\\n while l < r:\\n mid = (l + r) // 2\\n\\n if citations[mid] < n - mid:\\n l = mid + 1\\n else:\\n r = mid\\n\\n return n - l\\n\",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n left, right = 0, len(citations)\\n while left <= right:\\n mid = (right + left) // 2\\n if citations[-mid] >= mid:\\n left = mid + 1\\n else:\\n right = mid - 1\\n return right\",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n left, right =0, len(citations)\\n while left <= right:\\n mid = (right + left) // 2\\n if citations[-mid] >= mid:\\n left = mid + 1\\n else: right = mid - 1\\n return right\",\n \"runtime\": \"101\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n left, right = 0, n - 1\\n \\n while left <= right:\\n mid = (left + right) // 2\\n h = n - mid\\n \\n if citations[mid] == h:\\n return h\\n elif citations[mid] < h:\\n left = mid + 1\\n else:\\n right = mid - 1\\n \\n return n - left\",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"# Data Structures and Algorithm Used:\\n# Binary search to find the maximum h-index in a sorted array.\\n\\n# Short Intuition:\\n# Use binary search to efficiently find the maximum h-index by comparing citations[mid] with n - mid.\\n\\n# Detailed Intuition:\\n# - We use binary search on the sorted citations array to find the maximum h where h = n - mid and citations[mid] >= h.\\n# - The key insight is that for a valid h-index, citations[mid] should be greater than or equal to h = n - mid.\\n# - Adjust the search space based on this condition until the correct h-index is found.\\n\\n# Pseudocode:\\n# 1. Initialize low and high pointers to 0 and len(citations) - 1.\\n# 2. Perform binary search:\\n# a. Calculate mid.\\n# b. Calculate h = n - mid.\\n# c. If citations[mid] >= h, move the search space to the right.\\n# d. If citations[mid] < h, move the search space to the left.\\n# 3. Return the h-index.\\n\\nclass Solution:\\n def hIndex(self, citations):\\n n = len(citations)\\n low, high = 0, n - 1\\n \\n while low <= high:\\n mid = (low + high) // 2\\n h = n - mid\\n \\n if citations[mid] == h:\\n return h\\n elif citations[mid] < h:\\n low = mid + 1\\n else:\\n high = mid - 1\\n \\n # If no exact match is found, return n - low\\n return n - low\\n\\n# Time Complexity:\\n# - O(log n) due to the binary search over the sorted array.\\n\\n# Space Complexity:\\n# - O(1) since we are only using a few variables.\\n\",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n # find value where i >= citations[i]\\n # left most value of i >= citations[i]\\n\\n l, r = 0, len(citations) - 1\\n result = -1\\n while l <= r:\\n mid = l + (r - l) // 2\\n\\n h_published_papers = len(citations) - mid\\n h_citations = mid + 1\\n if citations[mid] >= h_published_papers:\\n result = h_published_papers\\n r = mid - 1\\n else:\\n l = mid + 1\\n\\n if result == -1:\\n return 0\\n return result\\n # farthest right of i+1 > citations[i], such that cited at least h times\\n\\n \",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n left = 0\\n right = n-1\\n while left <= right:\\n middle = (left + right) //2\\n if citations[middle] >= n- middle:\\n right = middle-1\\n else:\\n left = middle +1\\n return n-left\\n\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n l, r = 0, len(citations) - 1\\n h = 0\\n\\n while l <= r:\\n mid = (l + r) // 2\\n\\n if citations[mid] >= (len(citations) - mid):\\n r = mid - 1\\n h = max(h, len(citations) - mid)\\n else:\\n l = mid + 1\\n \\n return h\\n \",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n l, r = 0, n - 1\\n while l <= r:\\n mid = (l + r) // 2\\n if citations[mid] == n - mid:\\n return n - mid\\n elif citations[mid] < n - mid:\\n l = mid + 1\\n else:\\n r = mid - 1\\n return n - l\\n \",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n\\n n = len(citations)\\n \\n def valid(h):\\n l, r = 0, n - 1\\n\\n while l <= r:\\n m = (l + r) >> 1\\n\\n if citations[m] < h:\\n l = m + 1\\n else:\\n r = m - 1\\n\\n return n - l >= h\\n\\n l, r = 0, citations[n - 1]\\n res = 0\\n\\n while l <= r:\\n m = (l + r) >> 1\\n\\n if valid(m):\\n res = m\\n l = m + 1\\n else:\\n r = m - 1\\n\\n return res\",\n \"runtime\": \"108\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n l, r = 0, len(citations) - 1\\n n = len(citations)\\n\\n while l <= r:\\n m = l + (r - l) // 2\\n if citations[m] >= n - m:\\n r = m - 1\\n else:\\n l = m + 1\\n \\n return n - l\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n start = 0\\n n = len(citations)\\n if n == 1:\\n return min(1, citations[0])\\n end = n - 1\\n\\n ans = 0 \\n while(start<=end):\\n mid = ( start + end ) // 2\\n if citations[mid] <= n -mid :\\n ans = max(ans, citations[mid])\\n start = mid + 1\\n else:\\n end = mid - 1\\n ans = max(ans,n -mid )\\n return ans\\n \",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n if citations[-1] == 0:\\n return 0 \\n \\n n = len(citations)\\n left = 0\\n right = n - 1\\n while left <= right:\\n mid = left + (right - left) // 2\\n\\n # Can I say H-index is n - mid?\\n if citations[mid] >= n - mid:\\n h_index = n - mid\\n right = mid - 1\\n else:\\n left = mid + 1\\n return h_index\",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n left = 0\\n right = n-1\\n\\n ans = 0\\n\\n while left <= right:\\n mid = (left+right)//2\\n if citations[mid] >= n-mid:\\n ans = n-mid\\n right = mid-1\\n else:\\n left = mid+1\\n return ans\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n left, right = 0, n - 1\\n\\n while left <= right:\\n mid = (left + right) // 2\\n if citations[mid] == n - mid:\\n return citations[mid]\\n elif citations[mid] < n - mid:\\n left = mid + 1\\n else:\\n right = mid - 1\\n\\n return n - left\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n l, r = 0, len(citations) - 1\\n n = len(citations)\\n\\n while l <= r:\\n m = l + (r - l) // 2\\n if citations[m] >= n - m:\\n r = m - 1\\n else:\\n l = m + 1\\n \\n return n - l\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n left, right = 0, n - 1\\n while left <= right:\\n mid = (left + right) // 2\\n target = n - mid\\n if citations[mid] == target:\\n return n - mid\\n elif citations[mid] < target:\\n left = mid + 1\\n else:\\n right = mid - 1\\n \\n return n - left\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations):\\n left, right = 0, len(citations) - 1\\n h_index = 0\\n \\n while left <= right:\\n mid = (left + right) // 2\\n # The number of papers with at least citations[mid] citations\\n papers_with_at_least_citations = len(citations) - mid\\n if citations[mid] >= papers_with_at_least_citations:\\n h_index = papers_with_at_least_citations\\n right = mid - 1\\n else:\\n left = mid + 1\\n \\n return h_index\\n\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n left = 0\\n right = n-1\\n while left < right:\\n middle = (left + right + 1) // 2\\n if n - middle < citations[middle]:\\n right = middle - 1\\n else:\\n left = middle\\n return n - left - (citations[left] < n - left)\\n \",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n left, right = 0, n - 1\\n while left <= right:\\n mid = (left + right) // 2\\n if citations[mid] == n - mid:\\n return n - mid\\n elif citations[mid] < n - mid:\\n left = mid + 1\\n else:\\n right = mid - 1\\n \\n return n - left\",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n\\n\\n lo = 0\\n hi = len(citations) - 1\\n\\n while lo <= hi:\\n\\n mid = lo + (hi - lo) // 2\\n if citations[mid] == len(citations) - mid:\\n return citations[mid]\\n elif citations[mid] < len(citations) - mid :\\n lo = mid + 1\\n else:\\n hi = mid - 1\\n \\n\\n\\n return len(citations) - lo\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n l=0\\n r=len(citations)\\n while l<r:\\n m=(l+r)//2\\n if citations[m]>len(citations)-1-m:\\n r=m\\n else:\\n l=m+1\\n return len(citations)-l\\n \",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n c=citations\\n n=len(c)\\n l=0\\n r=n-1\\n k=0\\n # if len(c)==1:\\n # if c[0]==0:\\n # return 0\\n # return 1\\n while l<=r:\\n mid=(l+r)//2\\n k=n-mid\\n if c[mid]==k:\\n return k\\n elif c[mid]<k:\\n l=mid+1\\n else:\\n r=mid-1\\n return n-l\\n\\n \",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n=len(citations)\\n l=0\\n h=n-1\\n while l<=h:\\n mid=(l+h)//2\\n diff=n-mid\\n if citations[mid]==diff:\\n return diff\\n elif citations[mid]>diff:\\n h=mid-1\\n else:\\n l=mid+1\\n return n-l\",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n left = 0\\n right = n-1\\n while left <= right:\\n middle = (left + right + 1) // 2\\n if n - middle <= citations[middle]:\\n right = middle - 1\\n else:\\n left = middle + 1\\n return n - left\\n \",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n\\n count = 0\\n numPapers = 0\\n\\n for i in range(len(citations) - 1, -1, -1):\\n if citations[i] > numPapers:\\n numPapers += 1\\n else:\\n return numPapers\\n return numPapers\\n \\n \",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n\\n\\n l, r = 0, len(citations)-1\\n while l<=r:\\n midd = (l+r)//2\\n if citations[midd] == len(citations) - midd:\\n return len(citations) - midd\\n elif citations[midd] > len(citations) - midd:\\n r = midd -1\\n else:\\n l = midd + 1\\n if 0<=l<len(citations):\\n return len(citations) - l\\n elif l>=len(citations):\\n return 0\\n else:\\n return len(citations)\\n \",\n \"runtime\": \"119\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n if n < 2:\\n return min(1, citations[0])\\n low, high = 0, n - 1\\n\\n max_result = 0\\n while low <= high:\\n mid = (high + low) // 2\\n \\n if citations[mid] >= (n - mid):\\n max_result = max(max_result, n - mid)\\n high = mid - 1\\n else:\\n low = mid + 1\\n\\n return max_result\",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n=len(citations)\\n if citations[-1]==0:\\n return 0\\n if citations[0]>=n:\\n return n\\n l=1\\n h=n-1\\n while(l<=h):\\n mid=(l+h)//2\\n if citations[n-mid]>=mid:\\n ans= mid\\n l=mid+1\\n else:\\n h=mid-1\\n return ans\\n\\n\\n \",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n low, high = 0, n - 1\\n while low <= high:\\n mid = (low + high) // 2\\n if citations[mid] >= n - mid:\\n high = mid - 1\\n else:\\n low = mid + 1\\n \\n return n - low\",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n left = 0\\n right = n - 1\\n while left <= right:\\n mid = left + (right-left)//2\\n if citations[mid] == n-mid:\\n return n - mid\\n elif citations[mid] < n-mid:\\n left = mid+1\\n else: right = mid-1\\n \\n return n-left\\n \\n \\n\\n \",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n citations.sort()\\n count = 0\\n while citations:\\n cite = citations.pop()\\n count += 1\\n if cite < count:\\n return count - 1\\n \\n return count\",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n l, r = 0, len(citations) - 1\\n n = len(citations)\\n while l <= r:\\n m = l + (r - l) // 2\\n if citations[m] >= n - m:\\n r = m - 1\\n else:\\n l = m + 1 \\n return n - l\\n \\n \",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n left, right = 0, n - 1\\n while left <= right:\\n mid = (left + right) // 2\\n if citations[mid] == n - mid:\\n return n - mid\\n elif citations[mid] < n - mid:\\n left = mid + 1\\n else:\\n right = mid - 1\\n \\n return n - left\",\n \"runtime\": \"123\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n\\n\\n def givenH(h):\\n s=0\\n n=len(citations)\\n if( n-h < len(citations) and n-h >= 0 and citations[n-h] >= h):\\n return True\\n\\n return False\\n\\n \\n f=1\\n l=len(citations)\\n ans=0\\n while(f<=l):\\n m = f + (l-f)//2\\n if(givenH(m)):\\n ans=max(m,ans)\\n f=m+1\\n else:\\n l=m-1\\n return ans\\n\\n\\n\\n \",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n left, right = 0, n - 1\\n \\n while left <= right:\\n mid = left + (right - left) // 2\\n h = n - mid\\n \\n if citations[mid] == h:\\n return h\\n elif citations[mid] < h:\\n left = mid + 1\\n else:\\n right = mid - 1\\n \\n return n - left\",\n \"runtime\": \"125\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n l, r = 0, n-1\\n while l <= r:\\n mid = (l+r)//2\\n if citations[mid] == n - mid:\\n return n - mid\\n elif citations[mid] > n - mid:\\n r = mid - 1\\n else:\\n l = mid + 1\\n return n - l\\n\",\n \"runtime\": \"126\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n h_index = len(citations)\\n i = 0\\n\\n while i < len(citations) and h_index > citations[i] and h_index > 0:\\n i += 1\\n h_index -= 1\\n\\n return h_index\",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n i = 0\\n for c in citations:\\n if c >= n-i: \\n return n - i\\n else: i += 1\\n return 0\\n \\n \\n\\n \",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, c: List[int]) -> int:\\n return max(min(c[i],len(c)-i) for i in range(len(c)))\",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n i = 0\\n for c in citations:\\n if c >= n-i: \\n return n - i\\n else: i += 1\\n return 0\\n \\n \\n\\n \",\n \"runtime\": \"129\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations):\\n L = len(citations)\\n for i in range(L):\\n if L - i <= citations[i]: return L - i\\n return 0\",\n \"runtime\": \"130\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":48,"string":"48"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n left, right = 0, len(citations) - 1\n res = 0\n\n while left <= right:\n mid = (left + right) // 2\n if citations[mid] >= len(citations) - mid:\n res = len(citations) - mid\n right = mid - 1\n else:\n left = mid + 1\n \n return res\n\nwith open(\"user.out\", \"w\") as f:\n for i in map(loads, stdin):\n print(Solution().hIndex(i), file=f)\nexit(0) ","memory":"20100"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n #good(h) means h is 0 or citations[n - h] >= h\n #not good(h) means h>0 and \n \n n = len(citations)\n left, right = 0, n+1\n while left < right:\n h = left + (right - left)//2\n print(h)\n if h > 0 and citations[n - h] < h:\n right = h\n else:\n left = h + 1\n return left - 1\n \n","memory":"22900"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n start = 0\n stop = n\n while start < stop:\n mid = (start + stop) // 2\n if citations[mid] >= n - mid:\n stop = mid\n else:\n start = mid + 1\n print('start', start)\n print('n - start', n - start)\n # print('citations[start]', citations[start])\n # arr[start] >= n - start\n # [start, n-1] counted n - start ， all >= n - start\n # if start == 0 and citations[0] < n:\n # return 0 \n\n return n - start\n","memory":"23000"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n if citations[-1] == 0:\n return 0\n return bin_search(1, len(citations)+1, lambda x: diff(x, citations))\n\ndef diff(k, citations):\n return k - citations[-k]\n\n\ndef bin_search(l, h, func):\n while l < h - 1:\n print(l, h)\n m = (l+h) // 2\n if func(m) <= 0:\n l = m\n else:\n h = m\n return l\n","memory":"23000"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n\n n = len(citations)\n \n def valid(h):\n l, r = 0, n - 1\n idx = 0\n\n while l <= r:\n m = (l + r) >> 1\n\n if citations[m] < h:\n l = m + 1\n else:\n idx = m\n r = m - 1\n\n return n - idx >= h\n\n l, r = 0, citations[n - 1]\n res = 0\n\n while l <= r:\n m = (l + r) >> 1\n\n if valid(m):\n res = m\n l = m + 1\n else:\n r = m - 1\n\n return res","memory":"23100"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n left, right = 0, len(citations)\n while left <= right:\n mid = (right + left) // 2\n if citations[-mid] >= mid:\n left = mid + 1\n else:\n right = mid - 1\n return right","memory":"23200"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n n = len(citations)\n i = 0\n for c in citations:\n if c >= n-i: \n return n - i\n else: i += 1\n return 0\n \n \n\n ","memory":"23200"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n start = 0\n n = len(citations)\n if n == 1:\n return min(1, citations[0])\n end = n - 1\n\n ans = 0 \n while(start<=end):\n mid = ( start + end ) // 2\n if citations[mid] <= n -mid :\n ans = max(ans, citations[mid])\n start = mid + 1\n else:\n end = mid - 1\n ans = max(ans,n -mid )\n return ans\n ","memory":"23300"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n\n count = 0\n numPapers = 0\n\n for i in range(len(citations) - 1, -1, -1):\n if citations[i] > numPapers:\n numPapers += 1\n else:\n return numPapers\n return numPapers\n \n ","memory":"23300"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n l, r = 0, len(citations) - 1\n n = len(citations)\n\n while l <= r:\n m = l + (r - l) // 2\n if citations[m] >= n - m:\n r = m - 1\n else:\n l = m + 1\n \n return n - l","memory":"23400"},{"code":"class Solution:\n def hIndex(self, citations: List[int]) -> int:\n l, r = 0, len(citations) - 1\n n = len(citations)\n\n while l <= r:\n m = l + (r - l) // 2\n if citations[m] >= n - m:\n r = m - 1\n else:\n l = m + 1\n \n return n - l","memory":"23400"}],"string":"[\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n left, right = 0, len(citations) - 1\\n res = 0\\n\\n while left <= right:\\n mid = (left + right) // 2\\n if citations[mid] >= len(citations) - mid:\\n res = len(citations) - mid\\n right = mid - 1\\n else:\\n left = mid + 1\\n \\n return res\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n for i in map(loads, stdin):\\n print(Solution().hIndex(i), file=f)\\nexit(0) \",\n \"memory\": \"20100\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n #good(h) means h is 0 or citations[n - h] >= h\\n #not good(h) means h>0 and \\n \\n n = len(citations)\\n left, right = 0, n+1\\n while left < right:\\n h = left + (right - left)//2\\n print(h)\\n if h > 0 and citations[n - h] < h:\\n right = h\\n else:\\n left = h + 1\\n return left - 1\\n \\n\",\n \"memory\": \"22900\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n start = 0\\n stop = n\\n while start < stop:\\n mid = (start + stop) // 2\\n if citations[mid] >= n - mid:\\n stop = mid\\n else:\\n start = mid + 1\\n print('start', start)\\n print('n - start', n - start)\\n # print('citations[start]', citations[start])\\n # arr[start] >= n - start\\n # [start, n-1] counted n - start ， all >= n - start\\n # if start == 0 and citations[0] < n:\\n # return 0 \\n\\n return n - start\\n\",\n \"memory\": \"23000\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n if citations[-1] == 0:\\n return 0\\n return bin_search(1, len(citations)+1, lambda x: diff(x, citations))\\n\\ndef diff(k, citations):\\n return k - citations[-k]\\n\\n\\ndef bin_search(l, h, func):\\n while l < h - 1:\\n print(l, h)\\n m = (l+h) // 2\\n if func(m) <= 0:\\n l = m\\n else:\\n h = m\\n return l\\n\",\n \"memory\": \"23000\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n\\n n = len(citations)\\n \\n def valid(h):\\n l, r = 0, n - 1\\n idx = 0\\n\\n while l <= r:\\n m = (l + r) >> 1\\n\\n if citations[m] < h:\\n l = m + 1\\n else:\\n idx = m\\n r = m - 1\\n\\n return n - idx >= h\\n\\n l, r = 0, citations[n - 1]\\n res = 0\\n\\n while l <= r:\\n m = (l + r) >> 1\\n\\n if valid(m):\\n res = m\\n l = m + 1\\n else:\\n r = m - 1\\n\\n return res\",\n \"memory\": \"23100\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n left, right = 0, len(citations)\\n while left <= right:\\n mid = (right + left) // 2\\n if citations[-mid] >= mid:\\n left = mid + 1\\n else:\\n right = mid - 1\\n return right\",\n \"memory\": \"23200\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n n = len(citations)\\n i = 0\\n for c in citations:\\n if c >= n-i: \\n return n - i\\n else: i += 1\\n return 0\\n \\n \\n\\n \",\n \"memory\": \"23200\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n start = 0\\n n = len(citations)\\n if n == 1:\\n return min(1, citations[0])\\n end = n - 1\\n\\n ans = 0 \\n while(start<=end):\\n mid = ( start + end ) // 2\\n if citations[mid] <= n -mid :\\n ans = max(ans, citations[mid])\\n start = mid + 1\\n else:\\n end = mid - 1\\n ans = max(ans,n -mid )\\n return ans\\n \",\n \"memory\": \"23300\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n\\n count = 0\\n numPapers = 0\\n\\n for i in range(len(citations) - 1, -1, -1):\\n if citations[i] > numPapers:\\n numPapers += 1\\n else:\\n return numPapers\\n return numPapers\\n \\n \",\n \"memory\": \"23300\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n l, r = 0, len(citations) - 1\\n n = len(citations)\\n\\n while l <= r:\\n m = l + (r - l) // 2\\n if citations[m] >= n - m:\\n r = m - 1\\n else:\\n l = m + 1\\n \\n return n - l\",\n \"memory\": \"23400\"\n },\n {\n \"code\": \"class Solution:\\n def hIndex(self, citations: List[int]) -> int:\\n l, r = 0, len(citations) - 1\\n n = len(citations)\\n\\n while l <= r:\\n m = l + (r - l) // 2\\n if citations[m] >= n - m:\\n r = m - 1\\n else:\\n l = m + 1\\n \\n return n - l\",\n \"memory\": \"23400\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":11,"string":"11"}}},{"rowIdx":168,"cells":{"question_id":{"kind":"number","value":171,"string":"171"},"name":{"kind":"string","value":"excel-sheet-column-number"},"content":{"kind":"string","value":"<p>Given a string <code>columnTitle</code> that represents the column title as appears in an Excel sheet, return <em>its corresponding column number</em>.</p>\n\n<p>For example:</p>\n\n<pre>\nA -> 1\nB -> 2\nC -> 3\n...\nZ -> 26\nAA -> 27\nAB -> 28 \n...\n</pre>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> columnTitle = "A"\n<strong>Output:</strong> 1\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> columnTitle = "AB"\n<strong>Output:</strong> 28\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> columnTitle = "ZY"\n<strong>Output:</strong> 701\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= columnTitle.length <= 7</code></li>\n\t<li><code>columnTitle</code> consists only of uppercase English letters.</li>\n\t<li><code>columnTitle</code> is in the range <code>["A", "FXSHRXW"]</code>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":64.49202327688204,"string":"64.492023"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["math","string"],"string":"[\n \"math\",\n \"string\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"15\", 0.0493], [\"16\", 0.0493], [\"18\", 0.0493], [\"19\", 0.0739], [\"20\", 0.0986], [\"21\", 0.1232], [\"22\", 0.419], [\"23\", 0.6655], [\"24\", 0.9613], [\"25\", 0.4683], [\"26\", 1.1585], [\"27\", 1.4789], [\"28\", 2.6128], [\"29\", 2.0705], [\"30\", 2.5881], [\"31\", 4.0424], [\"32\", 5.9404], [\"33\", 5.0037], [\"34\", 4.6586], [\"35\", 6.9756], [\"36\", 7.8876], [\"37\", 7.5672], [\"38\", 5.8418], [\"39\", 7.2714], [\"40\", 7.37], [\"41\", 6.0882], [\"42\", 4.3875], [\"43\", 4.2396], [\"44\", 3.5248]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16200\", 0.3944], [\"16300\", 7.3946], [\"16400\", 26.7193], [\"16500\", 47.1038]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n res = 0\n for ch in columnTitle:\n res = res * 26 + (ord(ch) - 64)\n return res","runtime":"15"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n result = 0\n for i in range(len(columnTitle)):\n single_char = columnTitle[-i-1]\n result += (ord(single_char) - 64) * pow(26, i)\n return result","runtime":"16"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n count = 0\n base = ord('A')\n for c in columnTitle:\n currentVal = ord(c) - base + 1\n count *= 26\n count += currentVal\n return count","runtime":"18"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n count = 0\n for c in columnTitle:\n currentVal = ord(c) - ord('A') + 1\n count = count * 26 + currentVal\n return count","runtime":"19"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n # return ord(columnTitle[0] - 64) \n number = 0\n for i in columnTitle:\n number = number*26 + (ord(i)-64)\n return number \n \n ","runtime":"20"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n count = 0\n for c in columnTitle:\n currentVal = ord(c) - ord('A') + 1\n count = count * 26 + currentVal\n return count\n\n ","runtime":"21"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n count = 0\n for s in columnTitle:\n currentVal = ord(s) - ord('A') + 1\n count = count * 26 + currentVal\n return count","runtime":"22"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n ans = 0\n for i in columnTitle:\n ans = (ans * 26) + ord(i) - 64\n return ans","runtime":"23"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n result = 0\n for char in columnTitle:\n value = ord(char) -ord('A') + 1\n result = result*26 + value\n return result\n ","runtime":"24"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n result = 0\n for index, char in enumerate(list(columnTitle)[::-1]):\n result += 26**index * (ord(char)-64)\n return result","runtime":"24"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n column_number = 0\n magnitude = 1\n\n for i in reversed(range(len(columnTitle))):\n column_number += (magnitude * (ord(columnTitle[i]) - 64))\n magnitude *= 26\n\n return column_number\n ","runtime":"25"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n ans = 0\n for i in range(len(columnTitle)):\n ans = ans + (26**i)*(ord(columnTitle[-1-i])-64)\n print(ans)\n return ans \n\n ","runtime":"26"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n return functools.reduce(lambda subtotal, c:\n subtotal * 26 + ord(c) - ord('@'), columnTitle, 0)","runtime":"27"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n s = list(columnTitle)\n res = 0\n i = 0\n while s:\n c = s.pop()\n res += 26**i * (ord(c) - 64)\n i += 1\n \n return res","runtime":"28"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n tot=0\n n=len(columnTitle)\n for c in columnTitle:\n tot=tot*26+ord(c)-64\n \n return tot\n ","runtime":"28"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n result = 0\n for c in list(columnTitle):\n letter_idx = (ord(c) - ord(\"A\")) + 1\n result = result * 26 + letter_idx\n return result\n\n ","runtime":"29"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n count = 0\n for c in columnTitle:\n currentVal = ord(c) - ord('A') + 1\n count = count * 26 + currentVal\n return count","runtime":"30"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n r = 0\n for c in columnTitle:\n r = r * 26 + (ord(c) - 64)\n return r\n\n ","runtime":"31"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n result = 0\n for char in columnTitle:\n result = result * 26 + (ord(char) - ord('A') + 1)\n return result\n\n ","runtime":"31"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n ans = 0\n for c in map(ord, columnTitle):\n ans = ans * 26 + c - ord(\"A\") + 1\n return ans\n ","runtime":"32"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n res = 0\n # Stupid code:\n # for i in range(len(columnTitle)-1, -1, -1):\n # c = columnTitle[i]\n # # print(c)\n # numericVal = (ord(c) - ord('A') + 1) * 26**(len(columnTitle)-i-1)\n # # print(numericVal)\n # res += numericVal\n # Better code:\n for c in columnTitle:\n res = 26*res + ord(c)-ord('A') + 1\n\n return res","runtime":"32"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n counter = 0\n for x in columnTitle:\n temp = ord(x) - ord('A')+1\n counter = counter * 26 + temp\n return counter","runtime":"33"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n a=0\n n=len(columnTitle)\n for i in range(n):\n a += (ord(columnTitle[i])-64)*26**(n-i-1)\n return a","runtime":"33"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n # columnTitle = \"AB\"\n ctL = list(columnTitle)\n ctL.reverse()\n # print(ctL)\n ctr = 0\n ret = 0\n for i in ctL:\n ret += (ord(i)-64) * (26 ** ctr)\n ctr += 1\n return ret\n \n ","runtime":"34"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n count =0 \n for char in columnTitle:\n val = ord(char) - ord('A') +1\n count = count *26 + val\n return count\n ","runtime":"35"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n char_list = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n char_map = {}\n\n for i in range(len(char_list)): \n char_map[char_list[i]] = i+1\n\n output = 0\n for c in columnTitle: \n output = 26*output + char_map[c]\n return output\n","runtime":"35"},{"code":"class Solution:\n def titleToNumber(self, column_title: str) -> int:\n digit_multiplier = 0\n column_number = 0\n for i in range(len(column_title) - 1, -1, -1): # iterating in reverse \n letter_to_int = ord(column_title[i]) - ord('A') + 1\n column_number += (letter_to_int * pow(26, digit_multiplier))\n digit_multiplier += 1 \n return column_number\n","runtime":"36"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n result = 0\n for char in columnTitle:\n result = result * 26 + (ord(char) - ord('A') + 1)\n return result","runtime":"36"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n s=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n sum=0\n for i in range(len(columnTitle)):\n sum=sum+26**(len(columnTitle)-i-1)*(s.index(columnTitle[i])+1)\n return sum\n\n ","runtime":"37"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n s=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n columnTitle=columnTitle[::-1]\n sum=0\n for i in range(len(columnTitle)):\n sum=sum+26**(i)*(s.index(columnTitle[i])+1)\n return sum\n\n ","runtime":"37"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n s=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n sum=0\n n=len(columnTitle)\n for i in range(n):\n sum=sum+26**(n-i-1)*(s.index(columnTitle[i])+1)\n return sum\n\n ","runtime":"38"},{"code":"class Solution:\n def titleToNumber(self, column_title: str) -> int:\n digit_multiplier = 0\n column_number = 0\n for i in range(len(column_title) - 1, -1, -1): # iterating in reverse \n letter_to_int = ord(column_title[i]) - ord('A') + 1\n print(letter_to_int, digit_multiplier) \n column_number += (letter_to_int * pow(26, digit_multiplier))\n digit_multiplier += 1 \n return column_number\n","runtime":"38"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n result = 0\n for char in columnTitle:\n result = result*26 + (ord(char) - ord('A') + 1)\n return result\n ","runtime":"39"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n index = 1\n ans = ord(columnTitle[0]) - ord('A') + 1\n while index < len(columnTitle):\n ans = ans * 26 + ord(columnTitle[index]) - ord('A') + 1\n index += 1\n return ans\n","runtime":"39"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n a=0\n n=len(columnTitle)\n for i in range(n):\n a += (ord(columnTitle[i])-64)*26**(n-i-1)\n return a","runtime":"40"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n ans = 0\n for i in range(len(columnTitle)):\n ans = ans * 26 + (ord(columnTitle[i]) - ord('A') + 1)\n return ans","runtime":"40"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n n = len(columnTitle)\n ans = 0\n\n for i in range(n):\n ans *= 26\n ans += ord(columnTitle[i]) - 64\n\n return ans\n\n","runtime":"41"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n ans = 0\n mul = 0\n for i in range(len(columnTitle)-1, -1, -1):\n char =columnTitle[i]\n ans += (26 ** mul) * (ord(char)-ord('A')+1)\n mul += 1\n return ans\n ","runtime":"41"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n s=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n d={}\n for i in range(len(s)):\n d[s[i]]=i+1\n sum=0\n n=len(columnTitle)\n for i in range(n):\n sum=sum+26**(n-i-1)*d[columnTitle[i]]\n return sum\n\n ","runtime":"42"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n a=0\n for i in range(len(columnTitle)):\n a*=26\n a=a+(ord(columnTitle[i])-64)\n return a\n\n ","runtime":"42"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n count = 0\n for c in columnTitle:\n currentVal = ord(c) - ord('A') + 1\n count = count * 26 + currentVal\n return count","runtime":"43"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n res=0\n for c in columnTitle:\n res=res*26+(ord(c)-ord('A')+1)\n return res","runtime":"44"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n\n number = 0\n l = len(columnTitle)\n\n for i in range(l):\n\n number += (ord(columnTitle[i]) - ord('A') + 1)*(26**(l - i - 1))\n\n return number\n \n\n ","runtime":"44"}],"string":"[\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n res = 0\\n for ch in columnTitle:\\n res = res * 26 + (ord(ch) - 64)\\n return res\",\n \"runtime\": \"15\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n result = 0\\n for i in range(len(columnTitle)):\\n single_char = columnTitle[-i-1]\\n result += (ord(single_char) - 64) * pow(26, i)\\n return result\",\n \"runtime\": \"16\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n count = 0\\n base = ord('A')\\n for c in columnTitle:\\n currentVal = ord(c) - base + 1\\n count *= 26\\n count += currentVal\\n return count\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n count = 0\\n for c in columnTitle:\\n currentVal = ord(c) - ord('A') + 1\\n count = count * 26 + currentVal\\n return count\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n # return ord(columnTitle[0] - 64) \\n number = 0\\n for i in columnTitle:\\n number = number*26 + (ord(i)-64)\\n return number \\n \\n \",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n count = 0\\n for c in columnTitle:\\n currentVal = ord(c) - ord('A') + 1\\n count = count * 26 + currentVal\\n return count\\n\\n \",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n count = 0\\n for s in columnTitle:\\n currentVal = ord(s) - ord('A') + 1\\n count = count * 26 + currentVal\\n return count\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n ans = 0\\n for i in columnTitle:\\n ans = (ans * 26) + ord(i) - 64\\n return ans\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n result = 0\\n for char in columnTitle:\\n value = ord(char) -ord('A') + 1\\n result = result*26 + value\\n return result\\n \",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n result = 0\\n for index, char in enumerate(list(columnTitle)[::-1]):\\n result += 26**index * (ord(char)-64)\\n return result\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n column_number = 0\\n magnitude = 1\\n\\n for i in reversed(range(len(columnTitle))):\\n column_number += (magnitude * (ord(columnTitle[i]) - 64))\\n magnitude *= 26\\n\\n return column_number\\n \",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n ans = 0\\n for i in range(len(columnTitle)):\\n ans = ans + (26**i)*(ord(columnTitle[-1-i])-64)\\n print(ans)\\n return ans \\n\\n \",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n return functools.reduce(lambda subtotal, c:\\n subtotal * 26 + ord(c) - ord('@'), columnTitle, 0)\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n s = list(columnTitle)\\n res = 0\\n i = 0\\n while s:\\n c = s.pop()\\n res += 26**i * (ord(c) - 64)\\n i += 1\\n \\n return res\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n tot=0\\n n=len(columnTitle)\\n for c in columnTitle:\\n tot=tot*26+ord(c)-64\\n \\n return tot\\n \",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n result = 0\\n for c in list(columnTitle):\\n letter_idx = (ord(c) - ord(\\\"A\\\")) + 1\\n result = result * 26 + letter_idx\\n return result\\n\\n \",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n count = 0\\n for c in columnTitle:\\n currentVal = ord(c) - ord('A') + 1\\n count = count * 26 + currentVal\\n return count\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n r = 0\\n for c in columnTitle:\\n r = r * 26 + (ord(c) - 64)\\n return r\\n\\n \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n result = 0\\n for char in columnTitle:\\n result = result * 26 + (ord(char) - ord('A') + 1)\\n return result\\n\\n \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n ans = 0\\n for c in map(ord, columnTitle):\\n ans = ans * 26 + c - ord(\\\"A\\\") + 1\\n return ans\\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n res = 0\\n # Stupid code:\\n # for i in range(len(columnTitle)-1, -1, -1):\\n # c = columnTitle[i]\\n # # print(c)\\n # numericVal = (ord(c) - ord('A') + 1) * 26**(len(columnTitle)-i-1)\\n # # print(numericVal)\\n # res += numericVal\\n # Better code:\\n for c in columnTitle:\\n res = 26*res + ord(c)-ord('A') + 1\\n\\n return res\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n counter = 0\\n for x in columnTitle:\\n temp = ord(x) - ord('A')+1\\n counter = counter * 26 + temp\\n return counter\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n a=0\\n n=len(columnTitle)\\n for i in range(n):\\n a += (ord(columnTitle[i])-64)*26**(n-i-1)\\n return a\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n # columnTitle = \\\"AB\\\"\\n ctL = list(columnTitle)\\n ctL.reverse()\\n # print(ctL)\\n ctr = 0\\n ret = 0\\n for i in ctL:\\n ret += (ord(i)-64) * (26 ** ctr)\\n ctr += 1\\n return ret\\n \\n \",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n count =0 \\n for char in columnTitle:\\n val = ord(char) - ord('A') +1\\n count = count *26 + val\\n return count\\n \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n char_list = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n char_map = {}\\n\\n for i in range(len(char_list)): \\n char_map[char_list[i]] = i+1\\n\\n output = 0\\n for c in columnTitle: \\n output = 26*output + char_map[c]\\n return output\\n\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, column_title: str) -> int:\\n digit_multiplier = 0\\n column_number = 0\\n for i in range(len(column_title) - 1, -1, -1): # iterating in reverse \\n letter_to_int = ord(column_title[i]) - ord('A') + 1\\n column_number += (letter_to_int * pow(26, digit_multiplier))\\n digit_multiplier += 1 \\n return column_number\\n\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n result = 0\\n for char in columnTitle:\\n result = result * 26 + (ord(char) - ord('A') + 1)\\n return result\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n s=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n sum=0\\n for i in range(len(columnTitle)):\\n sum=sum+26**(len(columnTitle)-i-1)*(s.index(columnTitle[i])+1)\\n return sum\\n\\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n s=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n columnTitle=columnTitle[::-1]\\n sum=0\\n for i in range(len(columnTitle)):\\n sum=sum+26**(i)*(s.index(columnTitle[i])+1)\\n return sum\\n\\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n s=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n sum=0\\n n=len(columnTitle)\\n for i in range(n):\\n sum=sum+26**(n-i-1)*(s.index(columnTitle[i])+1)\\n return sum\\n\\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, column_title: str) -> int:\\n digit_multiplier = 0\\n column_number = 0\\n for i in range(len(column_title) - 1, -1, -1): # iterating in reverse \\n letter_to_int = ord(column_title[i]) - ord('A') + 1\\n print(letter_to_int, digit_multiplier) \\n column_number += (letter_to_int * pow(26, digit_multiplier))\\n digit_multiplier += 1 \\n return column_number\\n\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n result = 0\\n for char in columnTitle:\\n result = result*26 + (ord(char) - ord('A') + 1)\\n return result\\n \",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n index = 1\\n ans = ord(columnTitle[0]) - ord('A') + 1\\n while index < len(columnTitle):\\n ans = ans * 26 + ord(columnTitle[index]) - ord('A') + 1\\n index += 1\\n return ans\\n\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n a=0\\n n=len(columnTitle)\\n for i in range(n):\\n a += (ord(columnTitle[i])-64)*26**(n-i-1)\\n return a\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n ans = 0\\n for i in range(len(columnTitle)):\\n ans = ans * 26 + (ord(columnTitle[i]) - ord('A') + 1)\\n return ans\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n n = len(columnTitle)\\n ans = 0\\n\\n for i in range(n):\\n ans *= 26\\n ans += ord(columnTitle[i]) - 64\\n\\n return ans\\n\\n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n ans = 0\\n mul = 0\\n for i in range(len(columnTitle)-1, -1, -1):\\n char =columnTitle[i]\\n ans += (26 ** mul) * (ord(char)-ord('A')+1)\\n mul += 1\\n return ans\\n \",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n s=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n d={}\\n for i in range(len(s)):\\n d[s[i]]=i+1\\n sum=0\\n n=len(columnTitle)\\n for i in range(n):\\n sum=sum+26**(n-i-1)*d[columnTitle[i]]\\n return sum\\n\\n \",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n a=0\\n for i in range(len(columnTitle)):\\n a*=26\\n a=a+(ord(columnTitle[i])-64)\\n return a\\n\\n \",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n count = 0\\n for c in columnTitle:\\n currentVal = ord(c) - ord('A') + 1\\n count = count * 26 + currentVal\\n return count\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n res=0\\n for c in columnTitle:\\n res=res*26+(ord(c)-ord('A')+1)\\n return res\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n\\n number = 0\\n l = len(columnTitle)\\n\\n for i in range(l):\\n\\n number += (ord(columnTitle[i]) - ord('A') + 1)*(26**(l - i - 1))\\n\\n return number\\n \\n\\n \",\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 titleToNumber(self, columnTitle: str) -> int:\n result =0 \n for char in columnTitle:\n result=result*26+(ord(char)-ord('A')+1)\n \n return result\n\n ","memory":"16200"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n s=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n sum=0\n for i in range(len(columnTitle)):\n sum=sum+26**(len(columnTitle)-i-1)*(s.index(columnTitle[i])+1)\n return sum\n\n ","memory":"16300"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n\n number = 0\n l = len(columnTitle)\n\n for i in range(l):\n\n number += (ord(columnTitle[i]) - ord('A') + 1)*(26**(l - i - 1))\n\n return number\n \n\n ","memory":"16300"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n s=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n columnTitle=columnTitle[::-1]\n sum=0\n for i in range(len(columnTitle)):\n sum=sum+26**(i)*(s.index(columnTitle[i])+1)\n return sum\n\n ","memory":"16400"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n result = 0\n for char in columnTitle:\n result = result*26 + (ord(char) - ord('A') + 1)\n return result\n ","memory":"16400"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n s=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n d={}\n for i in range(len(s)):\n d[s[i]]=i+1\n sum=0\n n=len(columnTitle)\n for i in range(n):\n sum=sum+26**(n-i-1)*d[columnTitle[i]]\n return sum\n\n ","memory":"16500"},{"code":"class Solution:\n def titleToNumber(self, columnTitle: str) -> int:\n s=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n sum=0\n n=len(columnTitle)\n for i in range(n):\n sum=sum+26**(n-i-1)*(s.index(columnTitle[i])+1)\n return sum\n\n ","memory":"16500"}],"string":"[\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n result =0 \\n for char in columnTitle:\\n result=result*26+(ord(char)-ord('A')+1)\\n \\n return result\\n\\n \",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n s=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n sum=0\\n for i in range(len(columnTitle)):\\n sum=sum+26**(len(columnTitle)-i-1)*(s.index(columnTitle[i])+1)\\n return sum\\n\\n \",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n\\n number = 0\\n l = len(columnTitle)\\n\\n for i in range(l):\\n\\n number += (ord(columnTitle[i]) - ord('A') + 1)*(26**(l - i - 1))\\n\\n return number\\n \\n\\n \",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n s=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n columnTitle=columnTitle[::-1]\\n sum=0\\n for i in range(len(columnTitle)):\\n sum=sum+26**(i)*(s.index(columnTitle[i])+1)\\n return sum\\n\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n result = 0\\n for char in columnTitle:\\n result = result*26 + (ord(char) - ord('A') + 1)\\n return result\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n s=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n d={}\\n for i in range(len(s)):\\n d[s[i]]=i+1\\n sum=0\\n n=len(columnTitle)\\n for i in range(n):\\n sum=sum+26**(n-i-1)*d[columnTitle[i]]\\n return sum\\n\\n \",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def titleToNumber(self, columnTitle: str) -> int:\\n s=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n sum=0\\n n=len(columnTitle)\\n for i in range(n):\\n sum=sum+26**(n-i-1)*(s.index(columnTitle[i])+1)\\n return sum\\n\\n \",\n \"memory\": \"16500\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":7,"string":"7"}}},{"rowIdx":169,"cells":{"question_id":{"kind":"number","value":172,"string":"172"},"name":{"kind":"string","value":"factorial-trailing-zeroes"},"content":{"kind":"string","value":"<p>Given an integer <code>n</code>, return <em>the number of trailing zeroes in </em><code>n!</code>.</p>\n\n<p>Note that <code>n! = n * (n - 1) * (n - 2) * ... * 3 * 2 * 1</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 3\n<strong>Output:</strong> 0\n<strong>Explanation:</strong> 3! = 6, no trailing zero.\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> 1\n<strong>Explanation:</strong> 5! = 120, one trailing zero.\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 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>0 <= n <= 10<sup>4</sup></code></li>\n</ul>\n\n<p> </p>\n<p><strong>Follow up:</strong> Could you write a solution that works in logarithmic time complexity?</p>\n"},"acRate":{"kind":"number","value":43.82364921615065,"string":"43.823649"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["math"],"string":"[\n \"math\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"74\", 74.21220000000002], [\"193\", 3.155], [\"312\", 2.1370000000000013], [\"431\", 1.2584000000000006], [\"549\", 0.9996000000000006], [\"668\", 0.1599], [\"787\", 0.23999999999999996], [\"906\", 0.14], [\"1025\", 0.06], [\"1144\", 0.0999], [\"1263\", 0.02], [\"1382\", 0.06], [\"1501\", 0.02], [\"1619\", 0.02], [\"1738\", 0.02], [\"1857\", 0.02], [\"1976\", 0.02], [\"2095\", 0.02], [\"2214\", 0.02], [\"2333\", 0.9391000000000003], [\"2452\", 0.1], [\"2571\", 0.02], [\"2689\", 0.02], [\"2808\", 0.02], [\"2927\", 0.0799], [\"3046\", 0.02], [\"3165\", 0.02], [\"3284\", 0.02], [\"3403\", 0.02], [\"3522\", 0.02], [\"3641\", 0.02], [\"3759\", 0.0399], [\"3878\", 0.02], [\"3997\", 0.02], [\"4116\", 0.6791000000000001], [\"4235\", 1.2986000000000006], [\"4354\", 0.14], [\"4473\", 0.4198000000000001], [\"4592\", 0.16], [\"4711\", 0.04], [\"4829\", 0.04], [\"4948\", 0.04], [\"5067\", 0.06], [\"5186\", 0.02], [\"5305\", 0.02], [\"5424\", 0.02], [\"5543\", 0.02], [\"5662\", 0.02], [\"5781\", 0.02], [\"5899\", 0.16], [\"6018\", 0.02], [\"6137\", 0.08], [\"6256\", 0.06], [\"6375\", 0.1], [\"6494\", 0.02], [\"6613\", 0.02], [\"6732\", 0.04], [\"6851\", 0.02], [\"6969\", 0.02], [\"7088\", 0.02], [\"7207\", 0.02], [\"7326\", 0.02], [\"7445\", 0.02], [\"7564\", 0.0799], [\"7683\", 2.4761000000000006], [\"7802\", 0.36000000000000004], [\"7921\", 0.02], [\"8039\", 0.02], [\"8158\", 0.02], [\"8277\", 0.02], [\"8396\", 0.02], [\"8515\", 0.02], [\"8634\", 0.0599], [\"8753\", 0.02], [\"8872\", 0.0399], [\"8991\", 0.0399], [\"9109\", 0.0399], [\"9228\", 0.02], [\"9347\", 0.02], [\"9466\", 4.0326999999999975]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"15900\", 0.02], [\"16100\", 0.0399], [\"16200\", 0.7784], [\"16300\", 7.6846], [\"16400\", 23.992], [\"16500\", 40.3194], [\"16600\", 14.5509], [\"16700\", 4.5309], [\"16800\", 2.3952]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n count=0\n while(n>0):\n count+=n//5\n n=n//5\n return count\n ","runtime":"74"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n cnt = 0\n while n:\n cnt += n // 5\n n //= 5\n return cnt","runtime":"74"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n zeros = 0\n while n > 0:\n num = n\n while num % 5 == 0:\n num //= 5\n zeros += 1\n n -= 1\n return zeros","runtime":"193"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n<5:\n return 0\n num = 5\n count = 0\n while num<=n:\n temp = num\n while temp%5==0:\n count+=1\n temp = temp//5\n num+=1\n return count\n\n \n ","runtime":"193"},{"code":"import math\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n if n < 2:\n return 0\n twos = 0\n fives = 0\n perfect_twos = {2**i : i for i in range(1, int(math.log(n,2))+1)}\n perfect_fives = {5**i : i for i in range(1, int(math.log(n,5))+1)}\n for i in range(2,n+1):\n while i % 2 == 0:\n twos += 1\n i //= 2\n while i % 5 == 0:\n fives += 1\n i //= 5\n return min(twos, fives)\n\n ","runtime":"312"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n count_2 = 0\n count_5 = 0\n\n for i in range(1, n + 1):\n while i % 2 == 0:\n count_2 += 1\n i //= 2\n\n while i % 5 == 0:\n count_5 += 1\n i //= 5\n\n return min(count_2, count_5)\n","runtime":"312"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n e2 = 0\n e5 = 0\n for i in range(n):\n current = i + 1\n while not current % 2:\n e2 = e2 + 1\n current = current / 2\n current = i + 1\n while not current % 5:\n e5 = e5 + 1\n current = current / 5\n m = e5 if e5 < e2 else e2\n return m\n","runtime":"431"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n twos = 0\n fives = 0\n\n for num in range(1,n+1):\n while num % 5 ==0:\n fives += 1\n num = num/5\n while num%2 == 0:\n twos += 1\n num = num/2\n\n res = min(twos, fives)\n\n return res\n\n\n ","runtime":"431"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n d = {5:0, 2:0}\n for i in range(1, n+1):\n tmp = i\n proc = i\n while proc % 5 == 0:\n d[5] += 1\n proc = proc/5\n proc = i\n while proc % 2 == 0:\n d[2] += 1\n proc = proc/2\n print(d)\n return min(d.values())","runtime":"549"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n count_5 = 0\n count_2 = 0\n for i in range(1,n+1):\n while True:\n if i%2==0:\n i/=2\n count_2+=1\n elif i%5==0:\n i/=5\n count_5+=1\n else:\n break\n return min(count_2,count_5)","runtime":"549"},{"code":"'''\nTo make 0:\n- multiples of 10\n- 2 and a 5\n\n5 4 3 2 1 = 20 * 6 = 120\n\nIdea: min(# 2's, # 5's)\n'''\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n def count_number_of_factors(num, factor):\n count = 0\n while num:\n num, mod = divmod(num, factor)\n if mod != 0:\n return count\n count += 1\n return count\n count_of_2 = 0\n count_of_5 = 0\n for i in range(1, n+1):\n count_of_2 += count_number_of_factors(i, 2)\n count_of_5 += count_number_of_factors(i, 5)\n return min(count_of_2, count_of_5)","runtime":"668"},{"code":"# Calculate n factorial, convert to string, count trailing zeroes\n1242151231 * 1000\n1111111111000\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n factorial, count = 1, 0\n while n > 0:\n factorial *= n\n factorial %= 1e10\n while factorial % 10 == 0:\n factorial //= 10\n count += 1\n n -= 1\n\n return count","runtime":"668"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n def count_factors(n: int, div: int) -> tuple[int, int]:\n count = 0\n \n while True:\n if n % div == 0:\n n //= div\n count += 1\n else:\n break\n \n return (n, count)\n\n tens = fives = twos = 0\n \n while n > 0:\n m = n\n m, f = count_factors(m, 10)\n tens += f\n m, f = count_factors(m, 5)\n fives += f\n m, f = count_factors(m, 2) \n twos += f\n n -= 1\n \n return tens + min(twos, fives)","runtime":"787"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n\n def getNumTwosAndNumFives(i):\n numTwos = 0\n numTwosInFactor = 1\n factor = 2\n while i > 0 and i % 2 == 0:\n while i % factor == 0:\n numTwos += numTwosInFactor\n i //= factor\n factor *= 2\n numTwosInFactor += 1\n factor //= 2\n numTwosInFactor -= 1\n\n numFives = 0\n numFivesInFactor = 1\n factor = 5\n while i > 0 and i % 5 == 0:\n while i % factor == 0:\n numFives += numFivesInFactor\n i //= factor\n factor *= 5\n numFivesInFactor += 1\n factor //= 5\n numFivesInFactor -= 1\n return numTwos, numFives\n\n f = [[] for _ in range(2)]\n f[0] = [0, 0]\n\n for i in range(1, n+1):\n prevNumTwos, prevNumFives = f[(i-1)%2]\n numTwos, numFives = getNumTwosAndNumFives(i)\n f[i%2] = [prevNumTwos + numTwos, prevNumFives + numFives]\n\n return min(f[n%2])\n","runtime":"787"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n dic = dict()\n m2 = 0\n m5 = 0\n for i in range(1, n+1):\n m2 += self.get_q_number(i, 2, dic)\n m5 += self.get_q_number(i, 5, dic)\n\n return min(m2, m5)\n\n\n \n def get_q_number(self, n, q, dic):\n\n if n%q != 0 or n == 1:\n return 0\n\n elif (n,q) in dic:\n return dic[(n, q)]\n\n else : \n dic[(n, q)] = 1 + self.get_q_number(n/q, q, dic)\n return dic[(n, q)]\n\n\n ","runtime":"906"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n num_5 = 0\n num_2 = 0\n for i in range(1, n+1):\n while i > 0:\n if i % 5 == 0:\n num_5 += 1\n i /= 5\n if i % 2 == 0:\n num_2 += 1\n i /= 2\n if i % 5 != 0 and i % 2 != 0 and i > 0:\n break\n \n res = 0\n while num_5 > 0 and num_2 > 0:\n num_5 -= 1\n num_2 -= 1\n res += 1\n \n \n\n return res\n","runtime":"906"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n\n factor_cache = [{0: 0}, {0: 0}]\n factor_list = [2,5]\n\n def factor_count(n, i):\n d = factor_list[i]\n count = 0\n\n if n in factor_cache[i]:\n return factor_cache[i][n]\n\n if n % d == 0:\n factor_cache[i][n] = factor_count(n/d,i) + 1\n else:\n factor_cache[i][n] = 0\n\n return factor_cache[i][n]\n\n for i in range(n+1):\n factor_count(i,0)\n factor_count(i,1)\n\n sum_2s = sum(x for x in factor_cache[0].values())\n sum_5s = sum(x for x in factor_cache[1].values())\n \n # print(factor_cache)\n\n return min(sum_2s, sum_5s)\n \n\n\n ","runtime":"1025"},{"code":"import numpy as np\n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n n_fives=0\n for x_ in np.arange(5,n+1,5):\n z_=x_\n \n while np.mod(z_,5)==0:\n z_=z_//5\n #print(\"z_={},x_={}\".format(z_,x_))\n n_fives+=1\n\n return n_fives\n ","runtime":"1025"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n cnt2=0\n cnt5=0\n for j in range(n+1):\n i=j\n while i%2==0 and i>1:\n cnt2+=1\n i=i//2\n i=j\n while i%5==0 and i>1:\n cnt5+=1\n i=i//5\n print(cnt2,cnt5)\n return min(cnt2,cnt5)\n\n ","runtime":"1144"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n num_2 = 0\n num_5 = 0\n num_10 = 0\n for i in range(1, n+1):\n cur = i\n while cur != 0 and cur % 10 == 0:\n num_10 += 1\n cur = cur / 10\n while cur != 0 and cur % 2 == 0:\n num_2 += 1\n cur = cur / 2\n while cur != 0 and cur % 5 == 0:\n num_5 += 1\n cur = cur / 5\n print(cur)\n\n return num_10 + min(num_2,num_5)","runtime":"1144"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n count = 0\n \n num = 1\n for i in range(1,n+1):\n num *= i\n \n Num = str(num)\n c = 0\n for j in range(len(Num))[::-1]:\n if Num[j] == '0':\n c +=1\n else:\n break\n Num = Num + \"A\" \n Num = Num[:-1-c]\n Num = Num[-10:]\n \n count += c\n num = int(Num)\n \n \n return count\n \n ","runtime":"1263"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n count = 0\n \n num = 1\n for i in range(1,n+1):\n num *= i\n \n Num = str(num)\n c = 0\n for j in range(len(Num))[::-1]:\n if Num[j] == '0':\n c +=1\n else:\n break\n Num = Num + \"A\" \n Num = Num[:-1-c]\n Num = Num[-10:]\n \n count += c\n num = int(Num)\n \n \n return count\n \n ","runtime":"1382"},{"code":"class Solution:\n def get_fives_and_twos(self, n) -> int:\n t = 0\n while n % 2 == 0:\n n = n / 2\n t += 1\n f = 0\n while n % 5 == 0:\n n = n // 5\n f += 1\n\n return (t, f)\n\n def trailingZeroes(self, n: int) -> int:\n num_twos = 0\n num_fives = 0\n for i in range(1, n + 1):\n (t, f) = self.get_fives_and_twos(i)\n print(t,f)\n num_twos += t\n num_fives += f\n\n return min(num_twos, num_fives)\n ","runtime":"1382"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n < 5:\n return 0\n prod = 1\n n_zeros = 0\n for i in range(2, n+1):\n i_str = str(i)\n if i_str[-1] in {\"0\", \"2\", \"5\"}:\n prod *= i\n while prod % 10 == 0 and prod > 0:\n prod = prod // 10\n n_zeros += 1\n while prod % 10 == 0 and prod > 0:\n prod = prod // 10\n n_zeros += 1\n return n_zeros","runtime":"1501"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n zeroes = 0\n if n < 5:\n return 0\n \n even = 2\n five = 5\n nums = list()\n while even <= n and five <= n:\n if five % 10 == 0:\n num = five\n five += 5\n elif even % 10 == 0:\n even += 2\n continue\n else:\n num = even * five\n even += 2\n five += 5\n nums.append(num)\n return self.get_zeroes(self.mult(nums))\n \n def get_zeroes(self, num: int) -> int:\n count = 0\n while num % 10 == 0:\n num = num // 10\n count += 1\n return count\n \n def mult(self, nums: list[int]) -> int:\n o = 1\n for i in nums:\n o*=i\n return o\n","runtime":"1619"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n zeroes = 0\n if n < 5:\n return 0\n \n even = 2\n five = 5\n nums = list()\n while even <= n and five <= n:\n if five % 10 == 0:\n num = five\n five += 5\n elif even % 10 == 0:\n even += 2\n continue\n else:\n num = even * five\n even += 2\n five += 5\n nums.append(num)\n return self.get_zeroes(self.mult(nums))\n \n def get_zeroes(self, num: int) -> int:\n count = 0\n while num % 10 == 0:\n num = num // 10\n count += 1\n return count\n \n def mult(self, nums: list[int]) -> int:\n o = 1\n for i in nums:\n o*=i\n return o\n","runtime":"1738"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n fact = 1\n \n for i in range(1,n+1):\n fact = fact * i\n \n # print(fact)\n count = 0\n \n while n>0:\n count+=n//5\n n = n//5\n return count\n\n while fact > 0:\n last = fact % 10\n fact = fact//10\n\n if last == 0:\n count+=1\n else:\n break\n\n return count","runtime":"1857"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n mp = {}\n mp[10] = 0\n mp[5] = 0\n mp[2] = 0\n r = 1\n for i in range(1, n+1):\n r*=i\n if i>=5 and i%5 == 0:\n x = i\n while(x%5==0):\n mp[5]+=1\n x = x//5\n ans=mp[5]\n return ans\n","runtime":"1976"},{"code":"class Solution:\n\n def trailingZeroes(self, n: int) -> int:\n if n < 5:\n return 0\n\n fact = 1\n count = 0\n for i in range(1, n+1):\n cp = i\n while cp % 5 == 0:\n cp = cp // 5\n count += 1\n\n fact *= i\n \n return count\n\n ","runtime":"2095"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n sys.set_int_max_str_digits(100000)\n n_fab = str(math.factorial(n))\n return len(n_fab) - len(n_fab.rstrip('0'))","runtime":"2214"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n sys.set_int_max_str_digits(10**5)\n from math import factorial\n x = str(factorial(n))\n x_rstrip = x.rstrip('0')\n return len(x) - len(x_rstrip)","runtime":"2333"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n == 0:\n return 0\n sys.set_int_max_str_digits(100000)\n fn = str(factorial(n))\n \n return len(fn) - len(fn.rstrip('0'))\n\n \n def factorial(x):\n if x == 1:\n return 1\n else:\n return (x * factorial(x-1))","runtime":"2333"},{"code":"import sys\nsys.set_int_max_str_digits(0)\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n f = math.factorial(n)\n\n s = [i for i in str(f)]\n # print(s, len(s))\n ans = 0\n for i in range(len(s)-1, -1, -1):\n # print(i, s[i])\n if s[i]!='0':\n return ans\n ans+=1\n ","runtime":"2452"},{"code":"import math\nimport sys\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n sys.set_int_max_str_digits(0)\n c = math.factorial(n)\n # print(c) \n l = [i for i in str(c)]\n m = 0\n for i in range(1,len(l)+1):\n if l[-i]=='0':\n m +=1\n if l[-i]!= '0':\n break\n return m\n","runtime":"2452"},{"code":"from decimal import Decimal, getcontext\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n getcontext().prec = n + 1 # Set precision to handle large factorials\n a=Decimal(math.factorial(n))\n\n k=list(str(a))\n c=0\n for i in range(-1,-len(k),-1):\n if k[i]=='0':\n c=c+1\n else:\n break\n return c","runtime":"2571"},{"code":"import sys\nsys.set_int_max_str_digits(0)\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n if n<1:\n return 0\n count = 0\n c = factorial(n)\n lst = [int(d) for d in str(c)]\n for i in range(lst.count(0)):\n if lst[-1]==0:\n count+=1\n lst.pop()\n else:\n break\n return count","runtime":"2689"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n zero = [0]\n \n def log5(n):\n return log(n)/log(5)\n\n def fact(n):\n if n==0:\n return 1\n\n i = n\n while i>= 5:\n if i%5 == 0:\n zero[0] += 1\n i = i/5\n \n return n * fact(n-1)\n\n fact(n)\n return int(zero[0])","runtime":"2808"},{"code":"import math\n\nclass Solution:\n def find_primes_linear(self, num, div, total_divs):\n while int(num) == num:\n num /= div\n total_divs += 1\n total_divs -= 1\n return num * div\n \n def find_primes_binary_search(self, num, div):\n # num < div**k ->log(num) < klog(div) ->\n # k > log(num)/log(div) -> k = math.ceil(log(num)/log(div))\n l, r = 0, math.ceil(math.log(num)/math.log(div))\n while l < r - 1:\n m = (l + r)//2\n div_num = num / div**m\n if div_num == int(div_num):\n l = m\n else:\n r = m\n \n div_num = num / div**r\n if div_num == int(div_num):\n return r\n return l\n\n\n def trailingZeroes(self, n: int) -> int:\n twos, fives = 0, 0\n for num in range(1, n+1):\n twos += self.find_primes_binary_search(num, 2)\n fives += self.find_primes_binary_search(num, 5)\n\n return min(twos, fives)","runtime":"2927"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n n_fact = math.factorial(n)\n left = 0 \n right = 10 ** 4\n while right-left > 1: \n mid = (left+right) // 2 \n if n_fact % (10 ** mid) == 0: #there are at least mid zeros!\n left = mid\n else: \n right = mid \n if n_fact % (10 ** left) == 0: \n return left \n elif n_fact % (10 ** right) == 0: \n return right","runtime":"2927"},{"code":"import math\n\ndef binary_search(x):\n n = int(math.log10(x)) + 1\n a, b = 0, n\n while abs(a - b) > 1:\n c = (a + b) // 2\n if x % (10 ** (n - c)) == 0:\n b = c\n else:\n a = c\n return n - a - 1\n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n m = math.factorial(n)\n return binary_search(m)\n","runtime":"3046"},{"code":"def memo(f):\n cache = {}\n def inner_f(x):\n if x not in cache:\n cache[x] = f(x)\n return cache[x]\n return inner_f\n@memo\ndef fact(n):\n if n<=1:\n return n\n else: return n*fact(n-1) \nimport sys\nsys.set_int_max_str_digits(50000) \nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n f=fact(n)\n if f==0: return 0\n\n else: return (len(str(f))-len(str(f).strip('0')))\n \n ","runtime":"3165"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n fact=1\n for i in range(1,n+1):\n fact=fact*i\n sys.set_int_max_str_digits(100000)\n factstr= str(fact)\n factstr1=factstr.strip('0')\n return len(factstr)-len(factstr1)\n","runtime":"3284"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n fact = 1\n sys.set_int_max_str_digits(1000000000)\n for i in range(1, n+1):\n fact *= i\n fact = str(fact)\n if fact[-1] == \"0\":\n if len(fact) == 1:\n return 0\n count = 0\n for i in range(len(fact)-1, -1, -1):\n if fact[i] == \"0\":\n count += 1\n else:\n break\n return count\n\n\n\n return 0","runtime":"3403"},{"code":"import sys\nsys.set_int_max_str_digits(0)\n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n if n == 0:\n return 0\n\n factorial = n\n count = 0\n\n for i in range(1, n):\n factorial *= i\n for i in str(factorial)[::-1]:\n if i == \"0\":\n count += 1\n else:\n break\n return count\n ","runtime":"3522"},{"code":"import sys\nsys.set_int_max_str_digits(0)\n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n \n if n == 0:\n return 0\n \n ans = 1\n for i in range(1, n+1):\n ans = ans * i\n \n # print(ans)\n \n ans = str(ans)\n \n count = 0 \n for i in reversed(ans):\n if i != \"0\":\n break\n count += 1\n \n return count\n ","runtime":"3641"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n f = 1\n ct = 0\n for i in range(1, n + 1):\n f *= i\n \n s1 = str(f)\n s2 = s1[::-1]\n for e in s2:\n if(e == '0'):\n ct += 1\n else:\n break\n\n return ct\n \nsys.set_int_max_str_digits(1000000)\n","runtime":"3759"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n\n anss = 1\n\n for x in range(1,n+1):\n anss = anss * x\n \n count = 0\n sys.set_int_max_str_digits(100000)\n \n anss = str(anss)\n \n for x in anss[::-1]:\n if x == \"0\":\n count += 1\n else:\n break\n \n return count\n \n\n ","runtime":"3878"},{"code":"import sys\nsys.set_int_max_str_digits(1000000000)\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n if n ==0 or n==1:\n return 0\n fac=1\n for i in range(2,n+1):\n fac=fac*i\n \n fac=str(fac)\n i=len(fac)-1\n j=0\n while fac[i]=='0':\n i-=1\n j+=1\n \n return j\n","runtime":"3997"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n prod = 1\n for i in range(1,n + 1): \n prod = prod * i\n \n sys.set_int_max_str_digits(100000)\n \n string = str(prod)\n \n res = 0\n for i in range(len(string) - 1,-1,-1):\n if string[i] == '0':\n res += 1\n else:\n break\n return res\n","runtime":"4116"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n f=1\n for i in range(1,n+1):\n f=f*i\n sys.set_int_max_str_digits(100000)\n l=list(str(f))\n ans=0\n for i in range(len(l)-1,-1,-1):\n if l[i]=='0':\n ans+=1\n if l[i]!='0':\n break\n return ans ","runtime":"4116"},{"code":"import sys\nsys.set_int_max_str_digits(0)\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n \n def recursion(n):\n if n==0:\n return 1\n return n * recursion(n-1)\n \n temp = str(recursion(n))[::-1]\n count = 0\n for i in range(len(temp)):\n if temp[i]=='0':\n count =count + 1\n else:\n return count\n\n\n","runtime":"4354"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n sys.set_int_max_str_digits(0)\n\n def fact(n):\n if n == 0 or n == 1:\n return 1\n return n * fact(n-1)\n\n res = str(fact(n))\n count = 0\n\n for i in range(len(res)-1, -1, -1):\n if res[i] == '0':\n count+=1\n else:\n break\n\n return count","runtime":"4354"},{"code":"sys.set_int_max_str_digits(500000)\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n def factorial(n=n):\n factorial=1\n while n>0:\n factorial *= n\n n-=1\n \n return factorial\n \n factorial = str(factorial(n))[::-1]\n\n ans=0\n for a in range(len(factorial)):\n if factorial[a]=='0':\n ans+=1\n else :\n break\n\n return ans\n\n\n","runtime":"4473"},{"code":"sys.set_int_max_str_digits(99999)\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n count = 0\n if n == 0:\n return 0\n fac = n-1\n sums = n\n while fac != 0:\n sums *= fac\n fac -=1\n sumstring = str(sums)[::-1]\n if sumstring[0] != '0':\n return 0\n i = 0\n while sumstring[i] == '0':\n i+=1\n return i\n \n ","runtime":"4473"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n total = 1\n def factorial(num: int):\n nonlocal total\n if num < 1:\n return \n\n total *= num\n factorial(num-1)\n\n sys.set_int_max_str_digits(100000)\n factorial(n)\n \n totalStr = str(total)\n trailing_count = 0\n for i in range(-1, -len(totalStr)-1, -1):\n if totalStr[i] != \"0\":\n return trailing_count\n trailing_count += 1\n return trailing_count\n","runtime":"4592"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n import sys\n sys.set_int_max_str_digits(0)\n if n==0:\n return 0\n i=1\n while n!=1:\n i=i*n\n n-=1\n a=list(str(i))[::-1]\n j=0\n while a[j]=='0':\n j+=1\n return j\n\n \n \n ","runtime":"4592"},{"code":"class Solution:\n sys.set_int_max_str_digits(9000000)\n def trailingZeroes(self, n: int) -> int:\n import math\n res=math.factorial(n)\n s_res=str(res)\n return len(s_res)-len(str(int(s_res[::-1])))\n\n ","runtime":"4711"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n <= 0:\n return 0\n fac = n\n n -= 1\n while n >= 1:\n fac *= n\n n -= 1\n sys.set_int_max_str_digits(100000)\n res = [int(x) for x in str(fac)]\n count = 0\n for i in range(len(res) - 1, -1, -1):\n if res[i] == 0:\n count += 1\n else:\n break\n return count\n","runtime":"4711"},{"code":"from collections import Counter\nfrom typing import List\n\n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n def prime_factors(x: int) -> Counter:\n factors = list()\n while x % 2 == 0:\n factors.append(2)\n x //= 2\n i = 3\n while i <= math.sqrt(x):\n while x % i == 0:\n x //= i\n factors.append(i)\n i += 2\n\n if x != 1:\n factors.append(x)\n return Counter(factors)\n\n zeroes = 0\n c = Counter({2: 0, 5: 0})\n for i in range(2, n + 1):\n primes = prime_factors(i)\n c[2] += primes[2]\n c[5] += primes[5]\n return min(c[2], c[5])","runtime":"4829"},{"code":"\nimport math\nfrom datetime import datetime\n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n \n # f = math.factorial(n)\n # nb_5 = 0\n # nb_2 = 0\n\n # while n > 1:\n # while True:\n # d, r = divmod(f,5)\n # if r == 0:\n # f = d\n # nb_5 += 1\n # else:\n # break\n \n # # print(f'nb_5:{nb_5}')\n # while True:\n # d, r = divmod(f,2)\n # if r == 0:\n # f = d\n # nb_2 += 1\n # else:\n # break\n\n # n -= 1\n\n # return min(nb_2, nb_5)\n\n factorial = 1\n while n > 0:\n factorial *= n\n n -=1\n\n trailing_zeros = 1 # optimization - start\n hi = 10**4\n lo = 0\n print(f'------------factorial: {factorial if factorial < 1e6 else \"\" }')\n while lo < hi:\n mid = ((hi - lo) // 2) + lo + 1\n if factorial % (10 ** mid) == 0:\n lo = mid\n else:\n hi = mid - 1\n\n return lo\n\n \n\n ","runtime":"4829"},{"code":"\nfrom datetime import datetime\n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n\n factorial = 1\n while n > 0:\n factorial *= n\n n -=1\n\n trailing_zeros = 1 # optimization - start\n hi = 10**4\n lo = 0\n print(f'------------factorial: {factorial if factorial < 1e6 else \"\" }')\n while lo < hi:\n mid = ((hi - lo) // 2) + lo + 1\n if factorial % (10 ** mid) == 0:\n lo = mid\n else:\n hi = mid - 1\n\n return lo\n ","runtime":"4948"},{"code":"dp = defaultdict(int)\ndp[0] = 1\ndp[1] = 1\ndp[2] = 2\n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n counter = 0\n low = 0\n high = 10\n num = 1\n for i in range(1, n+1): \n num = num * i\n\n if(num % 10 == 0):\n num = num // 10\n counter += 1\n\n while(num % 10 == 0):\n middle = low + (high - low) // 2\n if((num % 10 ** middle) == 0):\n num = num // 10 ** middle\n counter += middle\n else:\n high = middle\n\n return counter\n\n\ndef factorial(num):\n if(num == 1 or num == 0 or num == 2):\n return dp[num]\n elif(dp[num - 1] == 0):\n dp[num - 1] = factorial(num - 1)\n return dp[num - 1] * num","runtime":"4948"},{"code":"import sys\nsys.set_int_max_str_digits(100000)\nclass Solution:\n def __init__(self):\n self.total = 0\n\n def factorial(self, n, counter = 1, total = 0):\n if counter < n:\n if total:\n total *= (n - counter)\n else:\n total = n\n total *= (n - counter)\n \n if total > self.total:\n self.total = total\n\n self.factorial(n, counter = counter + 1, total = total)\n \n\n\n def trailingZeroes(self, n: int) -> int:\n if n < 5:\n return 0\n \n counter = 0\n self.factorial(n)\n \n for s in str(self.total)[::-1]:\n if s == \"0\":\n counter += 1\n else:\n return counter","runtime":"5067"},{"code":"# BINARY_SEARCH(array, target):\n# low ← 0\n# high ← length(array) - 1\n\n# while low ≤ high:\n# mid ← (low + high) / 2\n\n# if array[mid] == target:\n# return mid // Target found at index mid\n# else if array[mid] < target:\n# low ← mid + 1 // Search the right half\n# else:\n# high ← mid - 1 // Search the left half\n\n# return -1 // Target not found\n \nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n res = factorial(n)\n\n if res % 10 != 0:\n return 0\n\n high = 10_000\n low = 0\n\n while low <= high:\n mid = (low + high) // 2\n\n mod = res % (10 ** mid) # this should be zero\n mod_p1 = res % (10 ** (mid+1)) # this should be non-zero\n\n # print(f'{res=}, {mid=}, {mod=}, {mod_p1=}')\n\n if mod == 0 and mod_p1 != 0:\n return mid\n\n elif mod == mod_p1 == 0:\n # number is too small\n low = mid + 1\n else:\n high = mid - 1","runtime":"5067"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n\n if n == 0:\n return 0\n\n fac = 1\n for i in range(1, n+1):\n fac = fac * i\n\n cnt = 0\n \n while fac > 0:\n s, r = divmod(fac, 10)\n if r == 0:\n cnt += 1\n else:\n return cnt\n fac = s\n\n return cnt\n \n\n \n ","runtime":"5186"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n fact = 1\n for i in range(2, n+1):\n fact *= i\n \n count = 0\n q, r = divmod(fact, 10)\n while r == 0:\n q, r = divmod(q, 10)\n count += 1\n \n if r == 0:\n count += 1\n \n return count\n ","runtime":"5305"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n\n if n == 0:\n return 0\n\n fac = 1\n for i in range(1, n+1):\n fac = fac * i\n\n cnt = 0\n \n while fac > 0:\n s, r = divmod(fac, 10)\n if r == 0:\n cnt += 1\n else:\n return cnt\n fac = s\n\n return cnt\n \n\n \n ","runtime":"5424"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n factorial = 1\n for i in range(n):\n factorial *= i+1\n\n trailing_zeroes = 0\n while factorial > 0:\n factorial, digit = divmod(factorial, 10)\n if digit == 0:\n trailing_zeroes += 1\n else:\n break\n return trailing_zeroes\n ","runtime":"5543"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n total = 1\n\n for i in range(2, n + 1):\n total *= i\n \n ans = 0\n second = 0\n\n while second == 0:\n total, second = divmod(total, 10)\n ans += 1\n \n return ans - 1","runtime":"5662"},{"code":"# 172. Factorial Trailing Zeroes (Medium)\n# https://leetcode.com/problems/factorial-trailing-zeroes\nfrom functools import reduce\n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n \"\"\"\n Calculate n factorial and get the number of zeros at the end of the number\n return cnt_trailing_zeroes\n\n Example 1:\n n = 3\n 3! = 3 x 2 x 1 = 6\n\n return 0\n\n Example 2:\n n = 5\n 5! = 5 x 4 x 3 x 2 x 1 = 120\n\n return 1\n\n Example 3:\n n = 0\n return 0\n \"\"\"\n if n == 0:\n return 0\n\n factorial = reduce(lambda a,b: a*b, range(1, n+1), 1)\n\n cnt = 0\n s = factorial\n while s > 0:\n s, r = divmod(s, 10)\n if r == 0:\n cnt += 1\n else:\n return cnt\n\n return cnt\n ","runtime":"5781"},{"code":"# 172. Factorial Trailing Zeroes (Medium)\n# https://leetcode.com/problems/factorial-trailing-zeroes\nfrom functools import reduce\n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n \"\"\"\n Calculate n factorial and get the number of zeros at the end of the number\n return cnt_trailing_zeroes\n\n Example 1:\n n = 3\n 3! = 3 x 2 x 1 = 6\n\n return 0\n\n Example 2:\n n = 5\n 5! = 5 x 4 x 3 x 2 x 1 = 120\n\n return 1\n\n Example 3:\n n = 0\n return 0\n \"\"\"\n if n == 0:\n return 0\n\n factorial = reduce(lambda a,b: a*b, range(1, n+1), 1)\n\n cnt = 0\n s = factorial\n while s > 0:\n s, r = divmod(s, 10)\n if r == 0:\n cnt += 1\n else:\n return cnt\n\n return cnt\n ","runtime":"5899"},{"code":"import sys\n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n\n sys.set_int_max_str_digits(0)\n\n s = 1\n for i in range(n):\n s += s * i\n\n ss = str(s)\n ss = ss[::-1]\n t = 0\n\n for i in range(len(ss)):\n print(ss[i])\n if ss[i] != '0':\n break\n t += 1\n\n return t","runtime":"5899"},{"code":"import sys\nsys.set_int_max_str_digits(0)\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n r=1\n for i in range(1,n+1):\n r*=i\n t=len(str(r))\n s=len(str(r).strip('0'))\n return t-s\n ","runtime":"6018"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n == 0:\n return 0\n \n factorial = 1\n while n:\n factorial *= n\n n -= 1\n \n retVal = 0\n rem = 0\n while True:\n factorial, rem = divmod(factorial, 10)\n if rem != 0:\n break\n retVal += 1\n \n return retVal\n","runtime":"6137"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n == 0:\n return 0\n \n factorial = 1\n while n:\n factorial *= n\n n -= 1\n \n retVal = 0\n rem = 0\n while True:\n factorial, rem = divmod(factorial, 10)\n if rem != 0:\n break\n retVal += 1\n \n return retVal\n","runtime":"6137"},{"code":"\nimport sys\nsys.set_int_max_str_digits(100000000) \n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n def fact(n):\n if n==1 or n==0:\n return 1\n else:\n return n*fact(n-1)\n a=fact(n)\n print(a)\n count=0\n j=str(a)\n k=j[::-1]\n print(k)\n print(len(k))\n for i in range(len(k)):\n \n if k[i]!='0':\n break\n elif k[i]=='0':\n \n count+=1\n \n return count\n\n\n ","runtime":"6256"},{"code":"\nimport sys\nsys.set_int_max_str_digits(100000000) \n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n def fact(n):\n if n==1 or n==0:\n return 1\n else:\n return n*fact(n-1)\n a=fact(n)\n print(a)\n count=0\n j=str(a)\n k=j[::-1]\n print(k)\n print(len(k))\n for i in range(len(k)):\n \n if k[i]!='0':\n break\n elif k[i]=='0':\n \n count+=1\n \n return count\n\n\n ","runtime":"6256"},{"code":"\nimport sys\nsys.set_int_max_str_digits(100000000) \n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n def fact(n):\n if n==1 or n==0:\n return 1\n else:\n return n*fact(n-1)\n a=fact(n)\n print(a)\n count=0\n j=str(a)\n k=j[::-1]\n print(k)\n print(len(k))\n for i in range(len(k)):\n \n if k[i]!='0':\n break\n elif k[i]=='0':\n \n count+=1\n \n return count\n\n\n ","runtime":"6375"},{"code":"\nimport sys\nsys.set_int_max_str_digits(100000000) \n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n def fact(n):\n if n==1 or n==0:\n return 1\n else:\n return n*fact(n-1)\n a=fact(n)\n print(a)\n count=0\n j=str(a)\n k=j[::-1]\n print(k)\n print(len(k))\n for i in range(len(k)):\n \n if k[i]!='0':\n break\n elif k[i]=='0':\n \n count+=1\n \n return count\n\n\n ","runtime":"6375"},{"code":"import sys\nsys.set_int_max_str_digits(10000000)\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n fact = [1]\n for i in range(1, n+1):\n fact.append(fact[i-1]*i)\n return len(str(fact[-1])) - len(str(fact[-1]).rstrip('0')) \n","runtime":"6494"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n import sys\n sys.set_int_max_str_digits(0)\n l=[]\n l1=[]\n fact=1\n for i in range(1,n+1):\n fact=fact*i\n a=str(fact)\n b=len(a)\n if '0' not in a:\n return 0\n else:\n if '0' in a:\n x=a[::-1]\n z=int(x)\n r=list(map(int, str(z)))\n e=len(r)\n q=abs(b-e)\n return q\n\n ","runtime":"6613"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n import sys\n sys.set_int_max_str_digits(0)\n l=[]\n l1=[]\n fact=1\n for i in range(1,n+1):\n fact=fact*i\n a=str(fact)\n b=len(a)\n if '0' not in a:\n return 0\n else:\n if '0' in a:\n x=a[::-1]\n z=int(x)\n r=list(map(int, str(z)))\n e=len(r)\n q=abs(b-e)\n return q\n\n ","runtime":"6732"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n fact=1\n while n>1:\n fact=fact*n\n n=n-1\n import sys\n sys.set_int_max_str_digits(0)\n map(int, str(fact)) \n list=[int(x) for x in str(fact)]\n count=0\n for i in range(len(list)):\n if list[i]==0:\n count=count+1\n else:\n count=0\n return count\n \n\n\n \n\n \n\n \n\n ","runtime":"6732"},{"code":"class Solution:\n dp = defaultdict()\n def trailingZeroes(self, n: int) -> int:\n if n<=3:\n return 0\n def getFact(temp_n):\n if temp_n in self.dp:\n return self.dp[temp_n]\n if temp_n == 1:\n return 1\n self.dp[temp_n] = temp_n*getFact(temp_n-1)\n return self.dp[temp_n]\n res = 0\n fact_n = getFact(n)\n while fact_n%10 == 0:\n fact_n//=10\n res+=1\n return res","runtime":"6851"},{"code":"class Solution:\n hashmap = {0:1}\n def trailingZeroes(self, n: int) -> int:\n ans = self.factor(n)\n res = 0\n while True:\n r = ans%10\n #print(r, ans,ans//10, res)\n if r == 0:\n res += 1\n ans = ans//10\n else:\n return res\n def factor(self, n):\n res = 1\n if n in self.hashmap:\n return self.hashmap[n]\n else:\n res = n*self.factor(n-1)\n self.hashmap[n] = res\n return res\n","runtime":"6969"},{"code":"dp=[1]*10001\nfor i in range(1,10001):\n dp[i]=dp[i-1]*i\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n zc,num=0,dp[n]\n while num:\n if not num%10:\n zc+=1\n num//=10\n else:\n break\n return zc","runtime":"7088"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n value = math.factorial(n)\n ans = 0\n while value%10 == 0:\n ans+=1\n value = value//10\n return ans","runtime":"7207"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n x=math.factorial(n)\n zer=0\n while x%10==0:\n x//=10\n zer+=1\n return zer","runtime":"7326"},{"code":"import math\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n x=math.factorial(n)\n c=0\n while True:\n r=x%10\n if r==0:\n c+=1\n else:\n break\n x=x//10\n return c ","runtime":"7445"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n factorial = math.factorial(n)\n count = 0\n\n while (factorial % 10 == 0) :\n factorial = factorial // 10\n count += 1\n \n return count","runtime":"7564"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n\n # Calculate n!\n n_factorial = math.factorial(n)\n # for i in range(2, n + 1):\n # n_factorial *= i\n\n # Count how many 0's are on the end.\n zero_count = 0\n while n_factorial % 10 == 0:\n zero_count += 1\n n_factorial //= 10\n\n return zero_count","runtime":"7564"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n\n num = int(math.factorial(n))\n\n res = 0 \n\n while True:\n if (num % 10) == 0:\n res += 1 \n \n else:\n return res\n\n num = num//10\n ","runtime":"7683"},{"code":"import math\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n k = math.factorial(n)\n if(n == 0):\n return 0\n count = 0\n while(k % 10 == 0):\n k //= 10\n count += 1\n return count","runtime":"7683"},{"code":"from math import *\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n p=factorial(n)\n count=0\n while(p>0):\n rem=p%10\n if(rem!=0):\n return count\n count+=1\n p=p//10\n return count \n \n \n \n\n ","runtime":"7802"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n result = factorial(n)\n count = 0\n while (result > 0):\n if (result % 10 == 0):\n count += 1\n result = result // 10\n else:\n break\n return count\n \n def factorial(self, n: int) -> int:\n if n == 0 or n == 1:\n return n\n return n * self.factorial(n - 1)","runtime":"7802"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n == 0:\n return 0\n\n accum = list(range(n + 1))[1:]\n\n while len(accum) >= 2:\n accum_temp = []\n ind = 0\n while ind < len(accum):\n if ind < len(accum) - 1:\n accum_temp.append(accum[ind] * accum[ind + 1])\n ind += 2\n else:\n accum_temp.append(accum[ind])\n ind += 1\n accum = accum_temp[:]\n\n result = accum[0]\n cnt = 0\n\n while result > 0:\n if result % 10 == 0:\n cnt += 1\n result = int(result // 10)\n else:\n break\n \n return cnt","runtime":"7921"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n import sys\n sys.set_int_max_str_digits(0)\n \n res = 1\n\n for i in range(1,n+1):\n res = res*i\n\n c = 0\n print(str(res)[::-1])\n for i in str(res)[::-1]:\n print(i)\n if i == '0':\n c+=1\n else:\n break \n\n\n print(res, c)\n return c","runtime":"8039"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n count=0\n fact=1\n for i in range(1,n+1):\n fact=fact*i\n if(fact==0):\n return 0\n else:\n while(fact>0):\n rem=fact%10\n if(rem==0):\n count+=1\n if(rem!=0):\n break\n fact//=10\n return count\n \n ","runtime":"8158"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n == 0:\n return 0 \n num = 1\n for i in range(2, n + 1):\n num *= i\n res = 0\n while num % 10 == 0:\n res += 1\n num //= 10\n return res","runtime":"8277"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n<=0 :\n return 0\n f=1\n i=1\n c=0\n while i<=n :\n f*=i\n i+=1\n while f%10==0 :\n f=f//10\n c+=1 \n return c","runtime":"8396"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n f=1\n if n==0:\n return 0\n else:\n for i in range(1,n+1):\n f=f*i\n c=0\n res=[]\n while f%10==0:\n c+=1\n f=f//10\n return c\n \n \n ","runtime":"8515"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n c=0\n a=1\n x=0\n for i in range(1,n+1):\n a=a*i\n while x==0:\n x=a%10\n if x==0:\n c=c+1\n a=a//10\n return c","runtime":"8634"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n res = 1\n \n for i in range(1, n + 1):\n res *= i\n # print(res)\n zeros = 0\n while res % 10 == 0:\n zeros += 1\n res = res // 10\n return zeros","runtime":"8753"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n == 0:\n return 0\n\n fact = 1\n for i in range(2,n+1):\n fact *= i\n\n count = 0\n while fact % 10 == 0:\n count += 1\n fact = fact//10\n\n return count \n \n","runtime":"8872"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n # Calculate n!\n n_factorial = 1\n for i in range(2, n + 1):\n n_factorial *= i\n\n # Count how many 0's are on the end.\n zero_count = 0\n while n_factorial % 10 == 0:\n zero_count += 1\n n_factorial //= 10\n\n return zero_count\n\n rv = 0\n factor = 5\n while n / factor > 0:\n rv += n // factor\n factor *= 5\n return rv","runtime":"8991"},{"code":"from math import prod\n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n fact = prod(range(1, n + 1))\n\n # divide by 10 factors\n num_zeros = 0\n while fact % 10 == 0:\n num_zeros += 1\n fact //= 10\n\n return num_zeros\n","runtime":"9109"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n==0:\n return 0\n fact=1\n for i in range(1,n+1):\n fact=fact*i\n ans=0\n while(fact!=0):\n if fact%10==0:\n fact=fact//10\n ans=ans+1\n else:\n break \n return ans\n\n ","runtime":"9228"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n == 0:\n return 0\n factorial = 1\n for i in range(1, n + 1):\n factorial *= i\n trailing_zeroes = 0\n # print(factorial)\n while factorial % 10 == 0:\n trailing_zeroes += 1\n factorial = factorial // 10\n return trailing_zeroes\n \n\n ","runtime":"9347"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n fact = 1\n for num in range(2, n + 1):\n fact *= num\n\n count=0\n while fact % 10 == 0:\n count+=1\n fact //=10\n return count\n ","runtime":"9466"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n==0:\n return 0\n fact=1\n for i in range(1,n+1):\n fact=fact*i\n count=0\n while fact>0:\n if fact%10==0:\n count+=1\n else:\n break\n fact//=10\n return count\n\n ","runtime":"9466"}],"string":"[\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n count=0\\n while(n>0):\\n count+=n//5\\n n=n//5\\n return count\\n \",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n cnt = 0\\n while n:\\n cnt += n // 5\\n n //= 5\\n return cnt\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n zeros = 0\\n while n > 0:\\n num = n\\n while num % 5 == 0:\\n num //= 5\\n zeros += 1\\n n -= 1\\n return zeros\",\n \"runtime\": \"193\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n<5:\\n return 0\\n num = 5\\n count = 0\\n while num<=n:\\n temp = num\\n while temp%5==0:\\n count+=1\\n temp = temp//5\\n num+=1\\n return count\\n\\n \\n \",\n \"runtime\": \"193\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n < 2:\\n return 0\\n twos = 0\\n fives = 0\\n perfect_twos = {2**i : i for i in range(1, int(math.log(n,2))+1)}\\n perfect_fives = {5**i : i for i in range(1, int(math.log(n,5))+1)}\\n for i in range(2,n+1):\\n while i % 2 == 0:\\n twos += 1\\n i //= 2\\n while i % 5 == 0:\\n fives += 1\\n i //= 5\\n return min(twos, fives)\\n\\n \",\n \"runtime\": \"312\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n count_2 = 0\\n count_5 = 0\\n\\n for i in range(1, n + 1):\\n while i % 2 == 0:\\n count_2 += 1\\n i //= 2\\n\\n while i % 5 == 0:\\n count_5 += 1\\n i //= 5\\n\\n return min(count_2, count_5)\\n\",\n \"runtime\": \"312\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n e2 = 0\\n e5 = 0\\n for i in range(n):\\n current = i + 1\\n while not current % 2:\\n e2 = e2 + 1\\n current = current / 2\\n current = i + 1\\n while not current % 5:\\n e5 = e5 + 1\\n current = current / 5\\n m = e5 if e5 < e2 else e2\\n return m\\n\",\n \"runtime\": \"431\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n twos = 0\\n fives = 0\\n\\n for num in range(1,n+1):\\n while num % 5 ==0:\\n fives += 1\\n num = num/5\\n while num%2 == 0:\\n twos += 1\\n num = num/2\\n\\n res = min(twos, fives)\\n\\n return res\\n\\n\\n \",\n \"runtime\": \"431\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n d = {5:0, 2:0}\\n for i in range(1, n+1):\\n tmp = i\\n proc = i\\n while proc % 5 == 0:\\n d[5] += 1\\n proc = proc/5\\n proc = i\\n while proc % 2 == 0:\\n d[2] += 1\\n proc = proc/2\\n print(d)\\n return min(d.values())\",\n \"runtime\": \"549\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n count_5 = 0\\n count_2 = 0\\n for i in range(1,n+1):\\n while True:\\n if i%2==0:\\n i/=2\\n count_2+=1\\n elif i%5==0:\\n i/=5\\n count_5+=1\\n else:\\n break\\n return min(count_2,count_5)\",\n \"runtime\": \"549\"\n },\n {\n \"code\": \"'''\\nTo make 0:\\n- multiples of 10\\n- 2 and a 5\\n\\n5 4 3 2 1 = 20 * 6 = 120\\n\\nIdea: min(# 2's, # 5's)\\n'''\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n def count_number_of_factors(num, factor):\\n count = 0\\n while num:\\n num, mod = divmod(num, factor)\\n if mod != 0:\\n return count\\n count += 1\\n return count\\n count_of_2 = 0\\n count_of_5 = 0\\n for i in range(1, n+1):\\n count_of_2 += count_number_of_factors(i, 2)\\n count_of_5 += count_number_of_factors(i, 5)\\n return min(count_of_2, count_of_5)\",\n \"runtime\": \"668\"\n },\n {\n \"code\": \"# Calculate n factorial, convert to string, count trailing zeroes\\n1242151231 * 1000\\n1111111111000\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n factorial, count = 1, 0\\n while n > 0:\\n factorial *= n\\n factorial %= 1e10\\n while factorial % 10 == 0:\\n factorial //= 10\\n count += 1\\n n -= 1\\n\\n return count\",\n \"runtime\": \"668\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n def count_factors(n: int, div: int) -> tuple[int, int]:\\n count = 0\\n \\n while True:\\n if n % div == 0:\\n n //= div\\n count += 1\\n else:\\n break\\n \\n return (n, count)\\n\\n tens = fives = twos = 0\\n \\n while n > 0:\\n m = n\\n m, f = count_factors(m, 10)\\n tens += f\\n m, f = count_factors(m, 5)\\n fives += f\\n m, f = count_factors(m, 2) \\n twos += f\\n n -= 1\\n \\n return tens + min(twos, fives)\",\n \"runtime\": \"787\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n\\n def getNumTwosAndNumFives(i):\\n numTwos = 0\\n numTwosInFactor = 1\\n factor = 2\\n while i > 0 and i % 2 == 0:\\n while i % factor == 0:\\n numTwos += numTwosInFactor\\n i //= factor\\n factor *= 2\\n numTwosInFactor += 1\\n factor //= 2\\n numTwosInFactor -= 1\\n\\n numFives = 0\\n numFivesInFactor = 1\\n factor = 5\\n while i > 0 and i % 5 == 0:\\n while i % factor == 0:\\n numFives += numFivesInFactor\\n i //= factor\\n factor *= 5\\n numFivesInFactor += 1\\n factor //= 5\\n numFivesInFactor -= 1\\n return numTwos, numFives\\n\\n f = [[] for _ in range(2)]\\n f[0] = [0, 0]\\n\\n for i in range(1, n+1):\\n prevNumTwos, prevNumFives = f[(i-1)%2]\\n numTwos, numFives = getNumTwosAndNumFives(i)\\n f[i%2] = [prevNumTwos + numTwos, prevNumFives + numFives]\\n\\n return min(f[n%2])\\n\",\n \"runtime\": \"787\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n dic = dict()\\n m2 = 0\\n m5 = 0\\n for i in range(1, n+1):\\n m2 += self.get_q_number(i, 2, dic)\\n m5 += self.get_q_number(i, 5, dic)\\n\\n return min(m2, m5)\\n\\n\\n \\n def get_q_number(self, n, q, dic):\\n\\n if n%q != 0 or n == 1:\\n return 0\\n\\n elif (n,q) in dic:\\n return dic[(n, q)]\\n\\n else : \\n dic[(n, q)] = 1 + self.get_q_number(n/q, q, dic)\\n return dic[(n, q)]\\n\\n\\n \",\n \"runtime\": \"906\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n num_5 = 0\\n num_2 = 0\\n for i in range(1, n+1):\\n while i > 0:\\n if i % 5 == 0:\\n num_5 += 1\\n i /= 5\\n if i % 2 == 0:\\n num_2 += 1\\n i /= 2\\n if i % 5 != 0 and i % 2 != 0 and i > 0:\\n break\\n \\n res = 0\\n while num_5 > 0 and num_2 > 0:\\n num_5 -= 1\\n num_2 -= 1\\n res += 1\\n \\n \\n\\n return res\\n\",\n \"runtime\": \"906\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n\\n factor_cache = [{0: 0}, {0: 0}]\\n factor_list = [2,5]\\n\\n def factor_count(n, i):\\n d = factor_list[i]\\n count = 0\\n\\n if n in factor_cache[i]:\\n return factor_cache[i][n]\\n\\n if n % d == 0:\\n factor_cache[i][n] = factor_count(n/d,i) + 1\\n else:\\n factor_cache[i][n] = 0\\n\\n return factor_cache[i][n]\\n\\n for i in range(n+1):\\n factor_count(i,0)\\n factor_count(i,1)\\n\\n sum_2s = sum(x for x in factor_cache[0].values())\\n sum_5s = sum(x for x in factor_cache[1].values())\\n \\n # print(factor_cache)\\n\\n return min(sum_2s, sum_5s)\\n \\n\\n\\n \",\n \"runtime\": \"1025\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n n_fives=0\\n for x_ in np.arange(5,n+1,5):\\n z_=x_\\n \\n while np.mod(z_,5)==0:\\n z_=z_//5\\n #print(\\\"z_={},x_={}\\\".format(z_,x_))\\n n_fives+=1\\n\\n return n_fives\\n \",\n \"runtime\": \"1025\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n cnt2=0\\n cnt5=0\\n for j in range(n+1):\\n i=j\\n while i%2==0 and i>1:\\n cnt2+=1\\n i=i//2\\n i=j\\n while i%5==0 and i>1:\\n cnt5+=1\\n i=i//5\\n print(cnt2,cnt5)\\n return min(cnt2,cnt5)\\n\\n \",\n \"runtime\": \"1144\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n num_2 = 0\\n num_5 = 0\\n num_10 = 0\\n for i in range(1, n+1):\\n cur = i\\n while cur != 0 and cur % 10 == 0:\\n num_10 += 1\\n cur = cur / 10\\n while cur != 0 and cur % 2 == 0:\\n num_2 += 1\\n cur = cur / 2\\n while cur != 0 and cur % 5 == 0:\\n num_5 += 1\\n cur = cur / 5\\n print(cur)\\n\\n return num_10 + min(num_2,num_5)\",\n \"runtime\": \"1144\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n count = 0\\n \\n num = 1\\n for i in range(1,n+1):\\n num *= i\\n \\n Num = str(num)\\n c = 0\\n for j in range(len(Num))[::-1]:\\n if Num[j] == '0':\\n c +=1\\n else:\\n break\\n Num = Num + \\\"A\\\" \\n Num = Num[:-1-c]\\n Num = Num[-10:]\\n \\n count += c\\n num = int(Num)\\n \\n \\n return count\\n \\n \",\n \"runtime\": \"1263\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n count = 0\\n \\n num = 1\\n for i in range(1,n+1):\\n num *= i\\n \\n Num = str(num)\\n c = 0\\n for j in range(len(Num))[::-1]:\\n if Num[j] == '0':\\n c +=1\\n else:\\n break\\n Num = Num + \\\"A\\\" \\n Num = Num[:-1-c]\\n Num = Num[-10:]\\n \\n count += c\\n num = int(Num)\\n \\n \\n return count\\n \\n \",\n \"runtime\": \"1382\"\n },\n {\n \"code\": \"class Solution:\\n def get_fives_and_twos(self, n) -> int:\\n t = 0\\n while n % 2 == 0:\\n n = n / 2\\n t += 1\\n f = 0\\n while n % 5 == 0:\\n n = n // 5\\n f += 1\\n\\n return (t, f)\\n\\n def trailingZeroes(self, n: int) -> int:\\n num_twos = 0\\n num_fives = 0\\n for i in range(1, n + 1):\\n (t, f) = self.get_fives_and_twos(i)\\n print(t,f)\\n num_twos += t\\n num_fives += f\\n\\n return min(num_twos, num_fives)\\n \",\n \"runtime\": \"1382\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n < 5:\\n return 0\\n prod = 1\\n n_zeros = 0\\n for i in range(2, n+1):\\n i_str = str(i)\\n if i_str[-1] in {\\\"0\\\", \\\"2\\\", \\\"5\\\"}:\\n prod *= i\\n while prod % 10 == 0 and prod > 0:\\n prod = prod // 10\\n n_zeros += 1\\n while prod % 10 == 0 and prod > 0:\\n prod = prod // 10\\n n_zeros += 1\\n return n_zeros\",\n \"runtime\": \"1501\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n zeroes = 0\\n if n < 5:\\n return 0\\n \\n even = 2\\n five = 5\\n nums = list()\\n while even <= n and five <= n:\\n if five % 10 == 0:\\n num = five\\n five += 5\\n elif even % 10 == 0:\\n even += 2\\n continue\\n else:\\n num = even * five\\n even += 2\\n five += 5\\n nums.append(num)\\n return self.get_zeroes(self.mult(nums))\\n \\n def get_zeroes(self, num: int) -> int:\\n count = 0\\n while num % 10 == 0:\\n num = num // 10\\n count += 1\\n return count\\n \\n def mult(self, nums: list[int]) -> int:\\n o = 1\\n for i in nums:\\n o*=i\\n return o\\n\",\n \"runtime\": \"1619\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n zeroes = 0\\n if n < 5:\\n return 0\\n \\n even = 2\\n five = 5\\n nums = list()\\n while even <= n and five <= n:\\n if five % 10 == 0:\\n num = five\\n five += 5\\n elif even % 10 == 0:\\n even += 2\\n continue\\n else:\\n num = even * five\\n even += 2\\n five += 5\\n nums.append(num)\\n return self.get_zeroes(self.mult(nums))\\n \\n def get_zeroes(self, num: int) -> int:\\n count = 0\\n while num % 10 == 0:\\n num = num // 10\\n count += 1\\n return count\\n \\n def mult(self, nums: list[int]) -> int:\\n o = 1\\n for i in nums:\\n o*=i\\n return o\\n\",\n \"runtime\": \"1738\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n fact = 1\\n \\n for i in range(1,n+1):\\n fact = fact * i\\n \\n # print(fact)\\n count = 0\\n \\n while n>0:\\n count+=n//5\\n n = n//5\\n return count\\n\\n while fact > 0:\\n last = fact % 10\\n fact = fact//10\\n\\n if last == 0:\\n count+=1\\n else:\\n break\\n\\n return count\",\n \"runtime\": \"1857\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n mp = {}\\n mp[10] = 0\\n mp[5] = 0\\n mp[2] = 0\\n r = 1\\n for i in range(1, n+1):\\n r*=i\\n if i>=5 and i%5 == 0:\\n x = i\\n while(x%5==0):\\n mp[5]+=1\\n x = x//5\\n ans=mp[5]\\n return ans\\n\",\n \"runtime\": \"1976\"\n },\n {\n \"code\": \"class Solution:\\n\\n def trailingZeroes(self, n: int) -> int:\\n if n < 5:\\n return 0\\n\\n fact = 1\\n count = 0\\n for i in range(1, n+1):\\n cp = i\\n while cp % 5 == 0:\\n cp = cp // 5\\n count += 1\\n\\n fact *= i\\n \\n return count\\n\\n \",\n \"runtime\": \"2095\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n sys.set_int_max_str_digits(100000)\\n n_fab = str(math.factorial(n))\\n return len(n_fab) - len(n_fab.rstrip('0'))\",\n \"runtime\": \"2214\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n sys.set_int_max_str_digits(10**5)\\n from math import factorial\\n x = str(factorial(n))\\n x_rstrip = x.rstrip('0')\\n return len(x) - len(x_rstrip)\",\n \"runtime\": \"2333\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n == 0:\\n return 0\\n sys.set_int_max_str_digits(100000)\\n fn = str(factorial(n))\\n \\n return len(fn) - len(fn.rstrip('0'))\\n\\n \\n def factorial(x):\\n if x == 1:\\n return 1\\n else:\\n return (x * factorial(x-1))\",\n \"runtime\": \"2333\"\n },\n {\n \"code\": \"import sys\\nsys.set_int_max_str_digits(0)\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n f = math.factorial(n)\\n\\n s = [i for i in str(f)]\\n # print(s, len(s))\\n ans = 0\\n for i in range(len(s)-1, -1, -1):\\n # print(i, s[i])\\n if s[i]!='0':\\n return ans\\n ans+=1\\n \",\n \"runtime\": \"2452\"\n },\n {\n \"code\": \"import math\\nimport sys\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n sys.set_int_max_str_digits(0)\\n c = math.factorial(n)\\n # print(c) \\n l = [i for i in str(c)]\\n m = 0\\n for i in range(1,len(l)+1):\\n if l[-i]=='0':\\n m +=1\\n if l[-i]!= '0':\\n break\\n return m\\n\",\n \"runtime\": \"2452\"\n },\n {\n \"code\": \"from decimal import Decimal, getcontext\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n getcontext().prec = n + 1 # Set precision to handle large factorials\\n a=Decimal(math.factorial(n))\\n\\n k=list(str(a))\\n c=0\\n for i in range(-1,-len(k),-1):\\n if k[i]=='0':\\n c=c+1\\n else:\\n break\\n return c\",\n \"runtime\": \"2571\"\n },\n {\n \"code\": \"import sys\\nsys.set_int_max_str_digits(0)\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n<1:\\n return 0\\n count = 0\\n c = factorial(n)\\n lst = [int(d) for d in str(c)]\\n for i in range(lst.count(0)):\\n if lst[-1]==0:\\n count+=1\\n lst.pop()\\n else:\\n break\\n return count\",\n \"runtime\": \"2689\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n zero = [0]\\n \\n def log5(n):\\n return log(n)/log(5)\\n\\n def fact(n):\\n if n==0:\\n return 1\\n\\n i = n\\n while i>= 5:\\n if i%5 == 0:\\n zero[0] += 1\\n i = i/5\\n \\n return n * fact(n-1)\\n\\n fact(n)\\n return int(zero[0])\",\n \"runtime\": \"2808\"\n },\n {\n \"code\": \"import math\\n\\nclass Solution:\\n def find_primes_linear(self, num, div, total_divs):\\n while int(num) == num:\\n num /= div\\n total_divs += 1\\n total_divs -= 1\\n return num * div\\n \\n def find_primes_binary_search(self, num, div):\\n # num < div**k ->log(num) < klog(div) ->\\n # k > log(num)/log(div) -> k = math.ceil(log(num)/log(div))\\n l, r = 0, math.ceil(math.log(num)/math.log(div))\\n while l < r - 1:\\n m = (l + r)//2\\n div_num = num / div**m\\n if div_num == int(div_num):\\n l = m\\n else:\\n r = m\\n \\n div_num = num / div**r\\n if div_num == int(div_num):\\n return r\\n return l\\n\\n\\n def trailingZeroes(self, n: int) -> int:\\n twos, fives = 0, 0\\n for num in range(1, n+1):\\n twos += self.find_primes_binary_search(num, 2)\\n fives += self.find_primes_binary_search(num, 5)\\n\\n return min(twos, fives)\",\n \"runtime\": \"2927\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n n_fact = math.factorial(n)\\n left = 0 \\n right = 10 ** 4\\n while right-left > 1: \\n mid = (left+right) // 2 \\n if n_fact % (10 ** mid) == 0: #there are at least mid zeros!\\n left = mid\\n else: \\n right = mid \\n if n_fact % (10 ** left) == 0: \\n return left \\n elif n_fact % (10 ** right) == 0: \\n return right\",\n \"runtime\": \"2927\"\n },\n {\n \"code\": \"import math\\n\\ndef binary_search(x):\\n n = int(math.log10(x)) + 1\\n a, b = 0, n\\n while abs(a - b) > 1:\\n c = (a + b) // 2\\n if x % (10 ** (n - c)) == 0:\\n b = c\\n else:\\n a = c\\n return n - a - 1\\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n m = math.factorial(n)\\n return binary_search(m)\\n\",\n \"runtime\": \"3046\"\n },\n {\n \"code\": \"def memo(f):\\n cache = {}\\n def inner_f(x):\\n if x not in cache:\\n cache[x] = f(x)\\n return cache[x]\\n return inner_f\\n@memo\\ndef fact(n):\\n if n<=1:\\n return n\\n else: return n*fact(n-1) \\nimport sys\\nsys.set_int_max_str_digits(50000) \\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n f=fact(n)\\n if f==0: return 0\\n\\n else: return (len(str(f))-len(str(f).strip('0')))\\n \\n \",\n \"runtime\": \"3165\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n fact=1\\n for i in range(1,n+1):\\n fact=fact*i\\n sys.set_int_max_str_digits(100000)\\n factstr= str(fact)\\n factstr1=factstr.strip('0')\\n return len(factstr)-len(factstr1)\\n\",\n \"runtime\": \"3284\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n fact = 1\\n sys.set_int_max_str_digits(1000000000)\\n for i in range(1, n+1):\\n fact *= i\\n fact = str(fact)\\n if fact[-1] == \\\"0\\\":\\n if len(fact) == 1:\\n return 0\\n count = 0\\n for i in range(len(fact)-1, -1, -1):\\n if fact[i] == \\\"0\\\":\\n count += 1\\n else:\\n break\\n return count\\n\\n\\n\\n return 0\",\n \"runtime\": \"3403\"\n },\n {\n \"code\": \"import sys\\nsys.set_int_max_str_digits(0)\\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n == 0:\\n return 0\\n\\n factorial = n\\n count = 0\\n\\n for i in range(1, n):\\n factorial *= i\\n for i in str(factorial)[::-1]:\\n if i == \\\"0\\\":\\n count += 1\\n else:\\n break\\n return count\\n \",\n \"runtime\": \"3522\"\n },\n {\n \"code\": \"import sys\\nsys.set_int_max_str_digits(0)\\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n \\n if n == 0:\\n return 0\\n \\n ans = 1\\n for i in range(1, n+1):\\n ans = ans * i\\n \\n # print(ans)\\n \\n ans = str(ans)\\n \\n count = 0 \\n for i in reversed(ans):\\n if i != \\\"0\\\":\\n break\\n count += 1\\n \\n return count\\n \",\n \"runtime\": \"3641\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n f = 1\\n ct = 0\\n for i in range(1, n + 1):\\n f *= i\\n \\n s1 = str(f)\\n s2 = s1[::-1]\\n for e in s2:\\n if(e == '0'):\\n ct += 1\\n else:\\n break\\n\\n return ct\\n \\nsys.set_int_max_str_digits(1000000)\\n\",\n \"runtime\": \"3759\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n\\n anss = 1\\n\\n for x in range(1,n+1):\\n anss = anss * x\\n \\n count = 0\\n sys.set_int_max_str_digits(100000)\\n \\n anss = str(anss)\\n \\n for x in anss[::-1]:\\n if x == \\\"0\\\":\\n count += 1\\n else:\\n break\\n \\n return count\\n \\n\\n \",\n \"runtime\": \"3878\"\n },\n {\n \"code\": \"import sys\\nsys.set_int_max_str_digits(1000000000)\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n ==0 or n==1:\\n return 0\\n fac=1\\n for i in range(2,n+1):\\n fac=fac*i\\n \\n fac=str(fac)\\n i=len(fac)-1\\n j=0\\n while fac[i]=='0':\\n i-=1\\n j+=1\\n \\n return j\\n\",\n \"runtime\": \"3997\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n prod = 1\\n for i in range(1,n + 1): \\n prod = prod * i\\n \\n sys.set_int_max_str_digits(100000)\\n \\n string = str(prod)\\n \\n res = 0\\n for i in range(len(string) - 1,-1,-1):\\n if string[i] == '0':\\n res += 1\\n else:\\n break\\n return res\\n\",\n \"runtime\": \"4116\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n f=1\\n for i in range(1,n+1):\\n f=f*i\\n sys.set_int_max_str_digits(100000)\\n l=list(str(f))\\n ans=0\\n for i in range(len(l)-1,-1,-1):\\n if l[i]=='0':\\n ans+=1\\n if l[i]!='0':\\n break\\n return ans \",\n \"runtime\": \"4116\"\n },\n {\n \"code\": \"import sys\\nsys.set_int_max_str_digits(0)\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n \\n def recursion(n):\\n if n==0:\\n return 1\\n return n * recursion(n-1)\\n \\n temp = str(recursion(n))[::-1]\\n count = 0\\n for i in range(len(temp)):\\n if temp[i]=='0':\\n count =count + 1\\n else:\\n return count\\n\\n\\n\",\n \"runtime\": \"4354\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n sys.set_int_max_str_digits(0)\\n\\n def fact(n):\\n if n == 0 or n == 1:\\n return 1\\n return n * fact(n-1)\\n\\n res = str(fact(n))\\n count = 0\\n\\n for i in range(len(res)-1, -1, -1):\\n if res[i] == '0':\\n count+=1\\n else:\\n break\\n\\n return count\",\n \"runtime\": \"4354\"\n },\n {\n \"code\": \"sys.set_int_max_str_digits(500000)\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n def factorial(n=n):\\n factorial=1\\n while n>0:\\n factorial *= n\\n n-=1\\n \\n return factorial\\n \\n factorial = str(factorial(n))[::-1]\\n\\n ans=0\\n for a in range(len(factorial)):\\n if factorial[a]=='0':\\n ans+=1\\n else :\\n break\\n\\n return ans\\n\\n\\n\",\n \"runtime\": \"4473\"\n },\n {\n \"code\": \"sys.set_int_max_str_digits(99999)\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n count = 0\\n if n == 0:\\n return 0\\n fac = n-1\\n sums = n\\n while fac != 0:\\n sums *= fac\\n fac -=1\\n sumstring = str(sums)[::-1]\\n if sumstring[0] != '0':\\n return 0\\n i = 0\\n while sumstring[i] == '0':\\n i+=1\\n return i\\n \\n \",\n \"runtime\": \"4473\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n total = 1\\n def factorial(num: int):\\n nonlocal total\\n if num < 1:\\n return \\n\\n total *= num\\n factorial(num-1)\\n\\n sys.set_int_max_str_digits(100000)\\n factorial(n)\\n \\n totalStr = str(total)\\n trailing_count = 0\\n for i in range(-1, -len(totalStr)-1, -1):\\n if totalStr[i] != \\\"0\\\":\\n return trailing_count\\n trailing_count += 1\\n return trailing_count\\n\",\n \"runtime\": \"4592\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n import sys\\n sys.set_int_max_str_digits(0)\\n if n==0:\\n return 0\\n i=1\\n while n!=1:\\n i=i*n\\n n-=1\\n a=list(str(i))[::-1]\\n j=0\\n while a[j]=='0':\\n j+=1\\n return j\\n\\n \\n \\n \",\n \"runtime\": \"4592\"\n },\n {\n \"code\": \"class Solution:\\n sys.set_int_max_str_digits(9000000)\\n def trailingZeroes(self, n: int) -> int:\\n import math\\n res=math.factorial(n)\\n s_res=str(res)\\n return len(s_res)-len(str(int(s_res[::-1])))\\n\\n \",\n \"runtime\": \"4711\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n <= 0:\\n return 0\\n fac = n\\n n -= 1\\n while n >= 1:\\n fac *= n\\n n -= 1\\n sys.set_int_max_str_digits(100000)\\n res = [int(x) for x in str(fac)]\\n count = 0\\n for i in range(len(res) - 1, -1, -1):\\n if res[i] == 0:\\n count += 1\\n else:\\n break\\n return count\\n\",\n \"runtime\": \"4711\"\n },\n {\n \"code\": \"from collections import Counter\\nfrom typing import List\\n\\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n def prime_factors(x: int) -> Counter:\\n factors = list()\\n while x % 2 == 0:\\n factors.append(2)\\n x //= 2\\n i = 3\\n while i <= math.sqrt(x):\\n while x % i == 0:\\n x //= i\\n factors.append(i)\\n i += 2\\n\\n if x != 1:\\n factors.append(x)\\n return Counter(factors)\\n\\n zeroes = 0\\n c = Counter({2: 0, 5: 0})\\n for i in range(2, n + 1):\\n primes = prime_factors(i)\\n c[2] += primes[2]\\n c[5] += primes[5]\\n return min(c[2], c[5])\",\n \"runtime\": \"4829\"\n },\n {\n \"code\": \"\\nimport math\\nfrom datetime import datetime\\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n \\n # f = math.factorial(n)\\n # nb_5 = 0\\n # nb_2 = 0\\n\\n # while n > 1:\\n # while True:\\n # d, r = divmod(f,5)\\n # if r == 0:\\n # f = d\\n # nb_5 += 1\\n # else:\\n # break\\n \\n # # print(f'nb_5:{nb_5}')\\n # while True:\\n # d, r = divmod(f,2)\\n # if r == 0:\\n # f = d\\n # nb_2 += 1\\n # else:\\n # break\\n\\n # n -= 1\\n\\n # return min(nb_2, nb_5)\\n\\n factorial = 1\\n while n > 0:\\n factorial *= n\\n n -=1\\n\\n trailing_zeros = 1 # optimization - start\\n hi = 10**4\\n lo = 0\\n print(f'------------factorial: {factorial if factorial < 1e6 else \\\"\\\" }')\\n while lo < hi:\\n mid = ((hi - lo) // 2) + lo + 1\\n if factorial % (10 ** mid) == 0:\\n lo = mid\\n else:\\n hi = mid - 1\\n\\n return lo\\n\\n \\n\\n \",\n \"runtime\": \"4829\"\n },\n {\n \"code\": \"\\nfrom datetime import datetime\\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n\\n factorial = 1\\n while n > 0:\\n factorial *= n\\n n -=1\\n\\n trailing_zeros = 1 # optimization - start\\n hi = 10**4\\n lo = 0\\n print(f'------------factorial: {factorial if factorial < 1e6 else \\\"\\\" }')\\n while lo < hi:\\n mid = ((hi - lo) // 2) + lo + 1\\n if factorial % (10 ** mid) == 0:\\n lo = mid\\n else:\\n hi = mid - 1\\n\\n return lo\\n \",\n \"runtime\": \"4948\"\n },\n {\n \"code\": \"dp = defaultdict(int)\\ndp[0] = 1\\ndp[1] = 1\\ndp[2] = 2\\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n counter = 0\\n low = 0\\n high = 10\\n num = 1\\n for i in range(1, n+1): \\n num = num * i\\n\\n if(num % 10 == 0):\\n num = num // 10\\n counter += 1\\n\\n while(num % 10 == 0):\\n middle = low + (high - low) // 2\\n if((num % 10 ** middle) == 0):\\n num = num // 10 ** middle\\n counter += middle\\n else:\\n high = middle\\n\\n return counter\\n\\n\\ndef factorial(num):\\n if(num == 1 or num == 0 or num == 2):\\n return dp[num]\\n elif(dp[num - 1] == 0):\\n dp[num - 1] = factorial(num - 1)\\n return dp[num - 1] * num\",\n \"runtime\": \"4948\"\n },\n {\n \"code\": \"import sys\\nsys.set_int_max_str_digits(100000)\\nclass Solution:\\n def __init__(self):\\n self.total = 0\\n\\n def factorial(self, n, counter = 1, total = 0):\\n if counter < n:\\n if total:\\n total *= (n - counter)\\n else:\\n total = n\\n total *= (n - counter)\\n \\n if total > self.total:\\n self.total = total\\n\\n self.factorial(n, counter = counter + 1, total = total)\\n \\n\\n\\n def trailingZeroes(self, n: int) -> int:\\n if n < 5:\\n return 0\\n \\n counter = 0\\n self.factorial(n)\\n \\n for s in str(self.total)[::-1]:\\n if s == \\\"0\\\":\\n counter += 1\\n else:\\n return counter\",\n \"runtime\": \"5067\"\n },\n {\n \"code\": \"# BINARY_SEARCH(array, target):\\n# low ← 0\\n# high ← length(array) - 1\\n\\n# while low ≤ high:\\n# mid ← (low + high) / 2\\n\\n# if array[mid] == target:\\n# return mid // Target found at index mid\\n# else if array[mid] < target:\\n# low ← mid + 1 // Search the right half\\n# else:\\n# high ← mid - 1 // Search the left half\\n\\n# return -1 // Target not found\\n \\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n res = factorial(n)\\n\\n if res % 10 != 0:\\n return 0\\n\\n high = 10_000\\n low = 0\\n\\n while low <= high:\\n mid = (low + high) // 2\\n\\n mod = res % (10 ** mid) # this should be zero\\n mod_p1 = res % (10 ** (mid+1)) # this should be non-zero\\n\\n # print(f'{res=}, {mid=}, {mod=}, {mod_p1=}')\\n\\n if mod == 0 and mod_p1 != 0:\\n return mid\\n\\n elif mod == mod_p1 == 0:\\n # number is too small\\n low = mid + 1\\n else:\\n high = mid - 1\",\n \"runtime\": \"5067\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n\\n if n == 0:\\n return 0\\n\\n fac = 1\\n for i in range(1, n+1):\\n fac = fac * i\\n\\n cnt = 0\\n \\n while fac > 0:\\n s, r = divmod(fac, 10)\\n if r == 0:\\n cnt += 1\\n else:\\n return cnt\\n fac = s\\n\\n return cnt\\n \\n\\n \\n \",\n \"runtime\": \"5186\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n fact = 1\\n for i in range(2, n+1):\\n fact *= i\\n \\n count = 0\\n q, r = divmod(fact, 10)\\n while r == 0:\\n q, r = divmod(q, 10)\\n count += 1\\n \\n if r == 0:\\n count += 1\\n \\n return count\\n \",\n \"runtime\": \"5305\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n\\n if n == 0:\\n return 0\\n\\n fac = 1\\n for i in range(1, n+1):\\n fac = fac * i\\n\\n cnt = 0\\n \\n while fac > 0:\\n s, r = divmod(fac, 10)\\n if r == 0:\\n cnt += 1\\n else:\\n return cnt\\n fac = s\\n\\n return cnt\\n \\n\\n \\n \",\n \"runtime\": \"5424\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n factorial = 1\\n for i in range(n):\\n factorial *= i+1\\n\\n trailing_zeroes = 0\\n while factorial > 0:\\n factorial, digit = divmod(factorial, 10)\\n if digit == 0:\\n trailing_zeroes += 1\\n else:\\n break\\n return trailing_zeroes\\n \",\n \"runtime\": \"5543\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n total = 1\\n\\n for i in range(2, n + 1):\\n total *= i\\n \\n ans = 0\\n second = 0\\n\\n while second == 0:\\n total, second = divmod(total, 10)\\n ans += 1\\n \\n return ans - 1\",\n \"runtime\": \"5662\"\n },\n {\n \"code\": \"# 172. Factorial Trailing Zeroes (Medium)\\n# https://leetcode.com/problems/factorial-trailing-zeroes\\nfrom functools import reduce\\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n \\\"\\\"\\\"\\n Calculate n factorial and get the number of zeros at the end of the number\\n return cnt_trailing_zeroes\\n\\n Example 1:\\n n = 3\\n 3! = 3 x 2 x 1 = 6\\n\\n return 0\\n\\n Example 2:\\n n = 5\\n 5! = 5 x 4 x 3 x 2 x 1 = 120\\n\\n return 1\\n\\n Example 3:\\n n = 0\\n return 0\\n \\\"\\\"\\\"\\n if n == 0:\\n return 0\\n\\n factorial = reduce(lambda a,b: a*b, range(1, n+1), 1)\\n\\n cnt = 0\\n s = factorial\\n while s > 0:\\n s, r = divmod(s, 10)\\n if r == 0:\\n cnt += 1\\n else:\\n return cnt\\n\\n return cnt\\n \",\n \"runtime\": \"5781\"\n },\n {\n \"code\": \"# 172. Factorial Trailing Zeroes (Medium)\\n# https://leetcode.com/problems/factorial-trailing-zeroes\\nfrom functools import reduce\\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n \\\"\\\"\\\"\\n Calculate n factorial and get the number of zeros at the end of the number\\n return cnt_trailing_zeroes\\n\\n Example 1:\\n n = 3\\n 3! = 3 x 2 x 1 = 6\\n\\n return 0\\n\\n Example 2:\\n n = 5\\n 5! = 5 x 4 x 3 x 2 x 1 = 120\\n\\n return 1\\n\\n Example 3:\\n n = 0\\n return 0\\n \\\"\\\"\\\"\\n if n == 0:\\n return 0\\n\\n factorial = reduce(lambda a,b: a*b, range(1, n+1), 1)\\n\\n cnt = 0\\n s = factorial\\n while s > 0:\\n s, r = divmod(s, 10)\\n if r == 0:\\n cnt += 1\\n else:\\n return cnt\\n\\n return cnt\\n \",\n \"runtime\": \"5899\"\n },\n {\n \"code\": \"import sys\\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n\\n sys.set_int_max_str_digits(0)\\n\\n s = 1\\n for i in range(n):\\n s += s * i\\n\\n ss = str(s)\\n ss = ss[::-1]\\n t = 0\\n\\n for i in range(len(ss)):\\n print(ss[i])\\n if ss[i] != '0':\\n break\\n t += 1\\n\\n return t\",\n \"runtime\": \"5899\"\n },\n {\n \"code\": \"import sys\\nsys.set_int_max_str_digits(0)\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n r=1\\n for i in range(1,n+1):\\n r*=i\\n t=len(str(r))\\n s=len(str(r).strip('0'))\\n return t-s\\n \",\n \"runtime\": \"6018\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n == 0:\\n return 0\\n \\n factorial = 1\\n while n:\\n factorial *= n\\n n -= 1\\n \\n retVal = 0\\n rem = 0\\n while True:\\n factorial, rem = divmod(factorial, 10)\\n if rem != 0:\\n break\\n retVal += 1\\n \\n return retVal\\n\",\n \"runtime\": \"6137\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n == 0:\\n return 0\\n \\n factorial = 1\\n while n:\\n factorial *= n\\n n -= 1\\n \\n retVal = 0\\n rem = 0\\n while True:\\n factorial, rem = divmod(factorial, 10)\\n if rem != 0:\\n break\\n retVal += 1\\n \\n return retVal\\n\",\n \"runtime\": \"6137\"\n },\n {\n \"code\": \"\\nimport sys\\nsys.set_int_max_str_digits(100000000) \\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n def fact(n):\\n if n==1 or n==0:\\n return 1\\n else:\\n return n*fact(n-1)\\n a=fact(n)\\n print(a)\\n count=0\\n j=str(a)\\n k=j[::-1]\\n print(k)\\n print(len(k))\\n for i in range(len(k)):\\n \\n if k[i]!='0':\\n break\\n elif k[i]=='0':\\n \\n count+=1\\n \\n return count\\n\\n\\n \",\n \"runtime\": \"6256\"\n },\n {\n \"code\": \"\\nimport sys\\nsys.set_int_max_str_digits(100000000) \\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n def fact(n):\\n if n==1 or n==0:\\n return 1\\n else:\\n return n*fact(n-1)\\n a=fact(n)\\n print(a)\\n count=0\\n j=str(a)\\n k=j[::-1]\\n print(k)\\n print(len(k))\\n for i in range(len(k)):\\n \\n if k[i]!='0':\\n break\\n elif k[i]=='0':\\n \\n count+=1\\n \\n return count\\n\\n\\n \",\n \"runtime\": \"6256\"\n },\n {\n \"code\": \"\\nimport sys\\nsys.set_int_max_str_digits(100000000) \\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n def fact(n):\\n if n==1 or n==0:\\n return 1\\n else:\\n return n*fact(n-1)\\n a=fact(n)\\n print(a)\\n count=0\\n j=str(a)\\n k=j[::-1]\\n print(k)\\n print(len(k))\\n for i in range(len(k)):\\n \\n if k[i]!='0':\\n break\\n elif k[i]=='0':\\n \\n count+=1\\n \\n return count\\n\\n\\n \",\n \"runtime\": \"6375\"\n },\n {\n \"code\": \"\\nimport sys\\nsys.set_int_max_str_digits(100000000) \\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n def fact(n):\\n if n==1 or n==0:\\n return 1\\n else:\\n return n*fact(n-1)\\n a=fact(n)\\n print(a)\\n count=0\\n j=str(a)\\n k=j[::-1]\\n print(k)\\n print(len(k))\\n for i in range(len(k)):\\n \\n if k[i]!='0':\\n break\\n elif k[i]=='0':\\n \\n count+=1\\n \\n return count\\n\\n\\n \",\n \"runtime\": \"6375\"\n },\n {\n \"code\": \"import sys\\nsys.set_int_max_str_digits(10000000)\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n fact = [1]\\n for i in range(1, n+1):\\n fact.append(fact[i-1]*i)\\n return len(str(fact[-1])) - len(str(fact[-1]).rstrip('0')) \\n\",\n \"runtime\": \"6494\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n import sys\\n sys.set_int_max_str_digits(0)\\n l=[]\\n l1=[]\\n fact=1\\n for i in range(1,n+1):\\n fact=fact*i\\n a=str(fact)\\n b=len(a)\\n if '0' not in a:\\n return 0\\n else:\\n if '0' in a:\\n x=a[::-1]\\n z=int(x)\\n r=list(map(int, str(z)))\\n e=len(r)\\n q=abs(b-e)\\n return q\\n\\n \",\n \"runtime\": \"6613\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n import sys\\n sys.set_int_max_str_digits(0)\\n l=[]\\n l1=[]\\n fact=1\\n for i in range(1,n+1):\\n fact=fact*i\\n a=str(fact)\\n b=len(a)\\n if '0' not in a:\\n return 0\\n else:\\n if '0' in a:\\n x=a[::-1]\\n z=int(x)\\n r=list(map(int, str(z)))\\n e=len(r)\\n q=abs(b-e)\\n return q\\n\\n \",\n \"runtime\": \"6732\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n fact=1\\n while n>1:\\n fact=fact*n\\n n=n-1\\n import sys\\n sys.set_int_max_str_digits(0)\\n map(int, str(fact)) \\n list=[int(x) for x in str(fact)]\\n count=0\\n for i in range(len(list)):\\n if list[i]==0:\\n count=count+1\\n else:\\n count=0\\n return count\\n \\n\\n\\n \\n\\n \\n\\n \\n\\n \",\n \"runtime\": \"6732\"\n },\n {\n \"code\": \"class Solution:\\n dp = defaultdict()\\n def trailingZeroes(self, n: int) -> int:\\n if n<=3:\\n return 0\\n def getFact(temp_n):\\n if temp_n in self.dp:\\n return self.dp[temp_n]\\n if temp_n == 1:\\n return 1\\n self.dp[temp_n] = temp_n*getFact(temp_n-1)\\n return self.dp[temp_n]\\n res = 0\\n fact_n = getFact(n)\\n while fact_n%10 == 0:\\n fact_n//=10\\n res+=1\\n return res\",\n \"runtime\": \"6851\"\n },\n {\n \"code\": \"class Solution:\\n hashmap = {0:1}\\n def trailingZeroes(self, n: int) -> int:\\n ans = self.factor(n)\\n res = 0\\n while True:\\n r = ans%10\\n #print(r, ans,ans//10, res)\\n if r == 0:\\n res += 1\\n ans = ans//10\\n else:\\n return res\\n def factor(self, n):\\n res = 1\\n if n in self.hashmap:\\n return self.hashmap[n]\\n else:\\n res = n*self.factor(n-1)\\n self.hashmap[n] = res\\n return res\\n\",\n \"runtime\": \"6969\"\n },\n {\n \"code\": \"dp=[1]*10001\\nfor i in range(1,10001):\\n dp[i]=dp[i-1]*i\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n zc,num=0,dp[n]\\n while num:\\n if not num%10:\\n zc+=1\\n num//=10\\n else:\\n break\\n return zc\",\n \"runtime\": \"7088\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n value = math.factorial(n)\\n ans = 0\\n while value%10 == 0:\\n ans+=1\\n value = value//10\\n return ans\",\n \"runtime\": \"7207\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n x=math.factorial(n)\\n zer=0\\n while x%10==0:\\n x//=10\\n zer+=1\\n return zer\",\n \"runtime\": \"7326\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n x=math.factorial(n)\\n c=0\\n while True:\\n r=x%10\\n if r==0:\\n c+=1\\n else:\\n break\\n x=x//10\\n return c \",\n \"runtime\": \"7445\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n factorial = math.factorial(n)\\n count = 0\\n\\n while (factorial % 10 == 0) :\\n factorial = factorial // 10\\n count += 1\\n \\n return count\",\n \"runtime\": \"7564\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n\\n # Calculate n!\\n n_factorial = math.factorial(n)\\n # for i in range(2, n + 1):\\n # n_factorial *= i\\n\\n # Count how many 0's are on the end.\\n zero_count = 0\\n while n_factorial % 10 == 0:\\n zero_count += 1\\n n_factorial //= 10\\n\\n return zero_count\",\n \"runtime\": \"7564\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n\\n num = int(math.factorial(n))\\n\\n res = 0 \\n\\n while True:\\n if (num % 10) == 0:\\n res += 1 \\n \\n else:\\n return res\\n\\n num = num//10\\n \",\n \"runtime\": \"7683\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n k = math.factorial(n)\\n if(n == 0):\\n return 0\\n count = 0\\n while(k % 10 == 0):\\n k //= 10\\n count += 1\\n return count\",\n \"runtime\": \"7683\"\n },\n {\n \"code\": \"from math import *\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n p=factorial(n)\\n count=0\\n while(p>0):\\n rem=p%10\\n if(rem!=0):\\n return count\\n count+=1\\n p=p//10\\n return count \\n \\n \\n \\n\\n \",\n \"runtime\": \"7802\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n result = factorial(n)\\n count = 0\\n while (result > 0):\\n if (result % 10 == 0):\\n count += 1\\n result = result // 10\\n else:\\n break\\n return count\\n \\n def factorial(self, n: int) -> int:\\n if n == 0 or n == 1:\\n return n\\n return n * self.factorial(n - 1)\",\n \"runtime\": \"7802\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n == 0:\\n return 0\\n\\n accum = list(range(n + 1))[1:]\\n\\n while len(accum) >= 2:\\n accum_temp = []\\n ind = 0\\n while ind < len(accum):\\n if ind < len(accum) - 1:\\n accum_temp.append(accum[ind] * accum[ind + 1])\\n ind += 2\\n else:\\n accum_temp.append(accum[ind])\\n ind += 1\\n accum = accum_temp[:]\\n\\n result = accum[0]\\n cnt = 0\\n\\n while result > 0:\\n if result % 10 == 0:\\n cnt += 1\\n result = int(result // 10)\\n else:\\n break\\n \\n return cnt\",\n \"runtime\": \"7921\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n import sys\\n sys.set_int_max_str_digits(0)\\n \\n res = 1\\n\\n for i in range(1,n+1):\\n res = res*i\\n\\n c = 0\\n print(str(res)[::-1])\\n for i in str(res)[::-1]:\\n print(i)\\n if i == '0':\\n c+=1\\n else:\\n break \\n\\n\\n print(res, c)\\n return c\",\n \"runtime\": \"8039\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n count=0\\n fact=1\\n for i in range(1,n+1):\\n fact=fact*i\\n if(fact==0):\\n return 0\\n else:\\n while(fact>0):\\n rem=fact%10\\n if(rem==0):\\n count+=1\\n if(rem!=0):\\n break\\n fact//=10\\n return count\\n \\n \",\n \"runtime\": \"8158\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n == 0:\\n return 0 \\n num = 1\\n for i in range(2, n + 1):\\n num *= i\\n res = 0\\n while num % 10 == 0:\\n res += 1\\n num //= 10\\n return res\",\n \"runtime\": \"8277\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n<=0 :\\n return 0\\n f=1\\n i=1\\n c=0\\n while i<=n :\\n f*=i\\n i+=1\\n while f%10==0 :\\n f=f//10\\n c+=1 \\n return c\",\n \"runtime\": \"8396\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n f=1\\n if n==0:\\n return 0\\n else:\\n for i in range(1,n+1):\\n f=f*i\\n c=0\\n res=[]\\n while f%10==0:\\n c+=1\\n f=f//10\\n return c\\n \\n \\n \",\n \"runtime\": \"8515\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n c=0\\n a=1\\n x=0\\n for i in range(1,n+1):\\n a=a*i\\n while x==0:\\n x=a%10\\n if x==0:\\n c=c+1\\n a=a//10\\n return c\",\n \"runtime\": \"8634\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n res = 1\\n \\n for i in range(1, n + 1):\\n res *= i\\n # print(res)\\n zeros = 0\\n while res % 10 == 0:\\n zeros += 1\\n res = res // 10\\n return zeros\",\n \"runtime\": \"8753\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n == 0:\\n return 0\\n\\n fact = 1\\n for i in range(2,n+1):\\n fact *= i\\n\\n count = 0\\n while fact % 10 == 0:\\n count += 1\\n fact = fact//10\\n\\n return count \\n \\n\",\n \"runtime\": \"8872\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n # Calculate n!\\n n_factorial = 1\\n for i in range(2, n + 1):\\n n_factorial *= i\\n\\n # Count how many 0's are on the end.\\n zero_count = 0\\n while n_factorial % 10 == 0:\\n zero_count += 1\\n n_factorial //= 10\\n\\n return zero_count\\n\\n rv = 0\\n factor = 5\\n while n / factor > 0:\\n rv += n // factor\\n factor *= 5\\n return rv\",\n \"runtime\": \"8991\"\n },\n {\n \"code\": \"from math import prod\\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n fact = prod(range(1, n + 1))\\n\\n # divide by 10 factors\\n num_zeros = 0\\n while fact % 10 == 0:\\n num_zeros += 1\\n fact //= 10\\n\\n return num_zeros\\n\",\n \"runtime\": \"9109\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n==0:\\n return 0\\n fact=1\\n for i in range(1,n+1):\\n fact=fact*i\\n ans=0\\n while(fact!=0):\\n if fact%10==0:\\n fact=fact//10\\n ans=ans+1\\n else:\\n break \\n return ans\\n\\n \",\n \"runtime\": \"9228\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n == 0:\\n return 0\\n factorial = 1\\n for i in range(1, n + 1):\\n factorial *= i\\n trailing_zeroes = 0\\n # print(factorial)\\n while factorial % 10 == 0:\\n trailing_zeroes += 1\\n factorial = factorial // 10\\n return trailing_zeroes\\n \\n\\n \",\n \"runtime\": \"9347\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n fact = 1\\n for num in range(2, n + 1):\\n fact *= num\\n\\n count=0\\n while fact % 10 == 0:\\n count+=1\\n fact //=10\\n return count\\n \",\n \"runtime\": \"9466\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n==0:\\n return 0\\n fact=1\\n for i in range(1,n+1):\\n fact=fact*i\\n count=0\\n while fact>0:\\n if fact%10==0:\\n count+=1\\n else:\\n break\\n fact//=10\\n return count\\n\\n \",\n \"runtime\": \"9466\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":110,"string":"110"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n m = 5\n ans = 0\n while n//m > 0:\n ans += n//m\n m *= 5\n return ans\n \n ","memory":"16100"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n < 25: return n // 5\n return n//5 + self.trailingZeroes(n//5)","memory":"16200"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n val = 5\n zeroes = 0\n while (val <= n):\n zeroes += (n//val)\n val *= 5\n return zeroes","memory":"16300"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n count = 0\n while n >= 5:\n n //= 5\n count += n\n return count","memory":"16300"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n fives = 0\n i = 5\n while i <= n:\n fives += n//i\n i *= 5\n return fives","memory":"16400"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n count = 0\n for i in range(n, 0, -1):\n while i % 5 == 0:\n i //= 5\n count += 1\n return count","memory":"16400"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n count = 0\n while n > 0:\n n //= 5\n count += n\n return count","memory":"16500"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n j = 1\n for i in range(1,n+1):\n j *= i\n z = 0\n while True:\n if j%10 == 0:\n j = j//10\n z += 1\n else:\n break \n return z","memory":"16500"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n res = 0\n while(n):\n res += n//5\n n = n // 5\n return res\n \n ","memory":"16600"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n j = 1\n for i in range(1,n+1):\n j *= i\n z = 0\n while True:\n if j%10 == 0:\n j = j//10\n z += 1\n else:\n break \n return z","memory":"16600"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n if n == 0:\n return 0\n fact = 1\n count = 0\n for i in range(1,n+1):\n fact *= i\n while fact%10 == 0:\n count += 1\n fact //= 10\n \n return count","memory":"16700"},{"code":"class Solution:\n def trailingZeroes(self, n: int) -> int:\n mp = {}\n mp[10] = 0\n mp[5] = 0\n mp[2] = 0\n r = 1\n for i in range(5, n+1, 5):\n r*=i\n if i>=5 and i%5 == 0:\n x = i\n while(x%5==0):\n mp[5]+=1\n x = x//5\n ans=mp[5]\n return ans\n","memory":"16700"},{"code":"# Calculate n factorial, convert to string, count trailing zeroes\n1242151231 * 1000\n1111111111000\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n factorial, count = 1, 0\n while n > 0:\n factorial *= n\n factorial %= 1e10\n while factorial % 10 == 0:\n factorial //= 10\n count += 1\n n -= 1\n\n return count","memory":"16800"},{"code":"import sys\nsys.set_int_max_str_digits(50000)\n\nclass Solution:\n def trailingZeroes(self, n: int) -> int:\n \n \n total = 1\n for idx in range(1, n+1):\n total *= idx\n\n \n arr = str(total)[::-1]\n\n trailing = 0\n for i in arr:\n if int(i) == 0: trailing += 1\n else: break\n\n\n return trailing\n\n\n","memory":"16800"}],"string":"[\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n m = 5\\n ans = 0\\n while n//m > 0:\\n ans += n//m\\n m *= 5\\n return ans\\n \\n \",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n < 25: return n // 5\\n return n//5 + self.trailingZeroes(n//5)\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n val = 5\\n zeroes = 0\\n while (val <= n):\\n zeroes += (n//val)\\n val *= 5\\n return zeroes\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n count = 0\\n while n >= 5:\\n n //= 5\\n count += n\\n return count\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n fives = 0\\n i = 5\\n while i <= n:\\n fives += n//i\\n i *= 5\\n return fives\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n count = 0\\n for i in range(n, 0, -1):\\n while i % 5 == 0:\\n i //= 5\\n count += 1\\n return count\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n count = 0\\n while n > 0:\\n n //= 5\\n count += n\\n return count\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n j = 1\\n for i in range(1,n+1):\\n j *= i\\n z = 0\\n while True:\\n if j%10 == 0:\\n j = j//10\\n z += 1\\n else:\\n break \\n return z\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n res = 0\\n while(n):\\n res += n//5\\n n = n // 5\\n return res\\n \\n \",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n j = 1\\n for i in range(1,n+1):\\n j *= i\\n z = 0\\n while True:\\n if j%10 == 0:\\n j = j//10\\n z += 1\\n else:\\n break \\n return z\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n if n == 0:\\n return 0\\n fact = 1\\n count = 0\\n for i in range(1,n+1):\\n fact *= i\\n while fact%10 == 0:\\n count += 1\\n fact //= 10\\n \\n return count\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def trailingZeroes(self, n: int) -> int:\\n mp = {}\\n mp[10] = 0\\n mp[5] = 0\\n mp[2] = 0\\n r = 1\\n for i in range(5, n+1, 5):\\n r*=i\\n if i>=5 and i%5 == 0:\\n x = i\\n while(x%5==0):\\n mp[5]+=1\\n x = x//5\\n ans=mp[5]\\n return ans\\n\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"# Calculate n factorial, convert to string, count trailing zeroes\\n1242151231 * 1000\\n1111111111000\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n factorial, count = 1, 0\\n while n > 0:\\n factorial *= n\\n factorial %= 1e10\\n while factorial % 10 == 0:\\n factorial //= 10\\n count += 1\\n n -= 1\\n\\n return count\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"import sys\\nsys.set_int_max_str_digits(50000)\\n\\nclass Solution:\\n def trailingZeroes(self, n: int) -> int:\\n \\n \\n total = 1\\n for idx in range(1, n+1):\\n total *= idx\\n\\n \\n arr = str(total)[::-1]\\n\\n trailing = 0\\n for i in arr:\\n if int(i) == 0: trailing += 1\\n else: break\\n\\n\\n return trailing\\n\\n\\n\",\n \"memory\": \"16800\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":14,"string":"14"}}},{"rowIdx":170,"cells":{"question_id":{"kind":"number","value":173,"string":"173"},"name":{"kind":"string","value":"binary-search-tree-iterator"},"content":{"kind":"string","value":"<p>Implement the <code>BSTIterator</code> class that represents an iterator over the <strong><a href=\"https://en.wikipedia.org/wiki/Tree_traversal#In-order_(LNR)\" target=\"_blank\">in-order traversal</a></strong> of a binary search tree (BST):</p>\n\n<ul>\n\t<li><code>BSTIterator(TreeNode root)</code> Initializes an object of the <code>BSTIterator</code> class. The <code>root</code> of the BST is given as part of the constructor. The pointer should be initialized to a non-existent number smaller than any element in the BST.</li>\n\t<li><code>boolean hasNext()</code> Returns <code>true</code> if there exists a number in the traversal to the right of the pointer, otherwise returns <code>false</code>.</li>\n\t<li><code>int next()</code> Moves the pointer to the right, then returns the number at the pointer.</li>\n</ul>\n\n<p>Notice that by initializing the pointer to a non-existent smallest number, the first call to <code>next()</code> will return the smallest element in the BST.</p>\n\n<p>You may assume that <code>next()</code> calls will always be valid. That is, there will be at least a next number in the in-order traversal when <code>next()</code> is called.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2018/12/25/bst-tree.png\" style=\"width: 189px; height: 178px;\" />\n<pre>\n<strong>Input</strong>\n["BSTIterator", "next", "next", "hasNext", "next", "hasNext", "next", "hasNext", "next", "hasNext"]\n[[[7, 3, 15, null, null, 9, 20]], [], [], [], [], [], [], [], [], []]\n<strong>Output</strong>\n[null, 3, 7, true, 9, true, 15, true, 20, false]\n\n<strong>Explanation</strong>\nBSTIterator bSTIterator = new BSTIterator([7, 3, 15, null, null, 9, 20]);\nbSTIterator.next(); // return 3\nbSTIterator.next(); // return 7\nbSTIterator.hasNext(); // return True\nbSTIterator.next(); // return 9\nbSTIterator.hasNext(); // return True\nbSTIterator.next(); // return 15\nbSTIterator.hasNext(); // return True\nbSTIterator.next(); // return 20\nbSTIterator.hasNext(); // return False\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>5</sup>]</code>.</li>\n\t<li><code>0 <= Node.val <= 10<sup>6</sup></code></li>\n\t<li>At most <code>10<sup>5</sup></code> calls will be made to <code>hasNext</code>, and <code>next</code>.</li>\n</ul>\n\n<p> </p>\n<p><strong>Follow up:</strong></p>\n\n<ul>\n\t<li>Could you implement <code>next()</code> and <code>hasNext()</code> to run in average <code>O(1)</code> time and use <code>O(h)</code> memory, where <code>h</code> is the height of the tree?</li>\n</ul>\n"},"acRate":{"kind":"number","value":73.0801491713957,"string":"73.080149"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["stack","tree","design","binary-search-tree","binary-tree","iterator"],"string":"[\n \"stack\",\n \"tree\",\n \"design\",\n \"binary-search-tree\",\n \"binary-tree\",\n \"iterator\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"32\", 0.0141], [\"34\", 0.0141], [\"35\", 0.0282], [\"36\", 0.0141], [\"37\", 0.0282], [\"38\", 0.0141], [\"39\", 0.1127], [\"40\", 0.1127], [\"41\", 0.0563], [\"42\", 0.3944], [\"43\", 0.338], [\"44\", 0.5915], [\"45\", 0.5211], [\"46\", 1.0704], [\"47\", 1.1268], [\"48\", 1.2254], [\"49\", 1.9577], [\"50\", 2.6761], [\"51\", 2.6056], [\"52\", 3.0282], [\"53\", 3.9155], [\"54\", 4.5211], [\"55\", 4.5634], [\"56\", 4.662], [\"57\", 6.3662], [\"58\", 6.5352], [\"59\", 5.9155], [\"60\", 5.8873], [\"61\", 5.8873], [\"62\", 6.3944], [\"63\", 5.3521], [\"64\", 4.2676], [\"65\", 4.1127], [\"66\", 3.2113], [\"67\", 2.8028], [\"68\", 2.0563], [\"69\", 1.6338]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"21400\", 0.0141], [\"21600\", 0.0141], [\"21700\", 0.0704], [\"21800\", 0.6338], [\"21900\", 4.1831], [\"22000\", 17.4648], [\"22100\", 6.9859], [\"22200\", 0.9718], [\"22300\", 5.0845], [\"22400\", 14.7465], [\"22500\", 31.0], [\"22600\", 13.4507]]}"},"rt_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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n self._push_left(root)\n\n def _push_left(self, node: Optional[TreeNode]):\n while node:\n self.stack.append(node)\n node = node.left\n\n def next(self) -> int:\n node = self.stack.pop()\n if node.right:\n self._push_left(node.right)\n return node.val\n\n def hasNext(self) -> bool:\n return len(self.stack) > 0\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n self.add_all_lefts(root)\n \n def add_all_lefts(self, root):\n while root:\n self.stack.append(root)\n root = root.left\n\n def next(self) -> int:\n node = self.stack.pop()\n # 题目保证 next 不会乱掉\n res = node.val\n\n node = node.right\n # 如果有 RIGHT，把所有 RIGHT 入栈\n self.add_all_lefts(node)\n return res \n\n def hasNext(self) -> bool:\n return bool(self.stack)\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"34"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.root = root\n self.arr = []\n self.curr_index = 0 \n \n # use an index and array to track\n self.inorder(self.root)\n print(self.arr)\n\n def inorder(self, node):\n if node is not None:\n if node.left is not None:\n self.inorder(node.left)\n self.arr.append(node.val)\n if node.right is not None:\n self.inorder(node.right)\n\n\n def next(self) -> int:\n next = self.arr[self.curr_index]\n self.curr_index += 1\n return next\n \n def hasNext(self) -> bool:\n return self.curr_index < len(self.arr)\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n t = root\n while t:\n self.stack.append(t)\n t = t.left\n \n\n def next(self) -> int:\n res = self.stack.pop()\n t = res.right\n while t:\n self.stack.append(t)\n t = t.left\n return res.val\n\n def hasNext(self) -> bool:\n return self.stack\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n while root:\n self.stack.append(root)\n root = root.left\n\n def next(self) -> int:\n tmp = self.stack.pop()\n ans = tmp.val\n cur = tmp.right\n while cur:\n self.stack.append(cur)\n cur = cur.left\n return ans\n\n def hasNext(self) -> bool:\n if self.stack:\n return True\n return False\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n cur = root\n while cur:\n self.stack.append(cur)\n cur = cur.left\n\n def next(self) -> int:\n out = self.stack.pop()\n cur = out.right\n while cur:\n self.stack.append(cur)\n cur = cur.left\n return out.val\n\n def hasNext(self) -> bool:\n return self.stack != []\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.elts = deque(self.precompute(root))\n \n\n def next(self) -> int:\n return self.elts.popleft() if self.hasNext() else -1\n \n def hasNext(self) -> bool:\n return self.elts\n\n def precompute(self, node):\n elts = []\n stack = []\n curr = node\n while curr or stack:\n while curr:\n stack.append(curr)\n curr = curr.left\n curr = stack.pop()\n elts.append(curr.val)\n curr = curr.right\n return elts\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n # preorder: root, left, right\n # inorder: left, root, right <--\n # postorder: left, right, root\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n while root:\n self.stack.append(root)\n root = root.left\n\n self.node = root\n\n\n def next(self) -> int:\n nxt = self.stack.pop()\n temp = nxt.right\n while temp:\n self.stack.append(temp)\n temp = temp.left\n return nxt.val\n \n\n def hasNext(self) -> bool:\n if self.stack:\n return True\n return False\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n \n def __init__(self, root: Optional[TreeNode]):\n self.list = []\n self.pushtree(root)\n\n def pushtree(self, node):\n while node:\n self.list.append(node)\n node = node.left\n\n def next(self) -> int:\n node = self.list.pop()\n self.pushtree(node.right)\n return node.val\n \n def hasNext(self) -> bool:\n return True if len(self.list) else False \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.cache = []\n self._exhaust_left_branch(root)\n \n def _exhaust_left_branch(self, node):\n while node:\n self.cache.append(node)\n node = node.left\n\n def next(self) -> int:\n curr_node = self.cache.pop()\n if curr_node.right:\n self._exhaust_left_branch(curr_node.right)\n return curr_node.val\n \n def hasNext(self) -> bool:\n return len(self.cache) > 0\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.iot = []\n self.traverse(root, self.iot)\n self.index = 0\n\n def next(self) -> int:\n value = self.iot[self.index]\n self.index += 1\n return value\n\n def hasNext(self) -> bool:\n if self.index < len(self.iot):\n return True\n return False\n\n def traverse(self, node, arr):\n if not node:\n return\n\n self.traverse(node.left, arr)\n arr.append(node.val)\n self.traverse(node.right, arr)\n\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n def __init__(self, root: Optional[TreeNode]):\n self.inorder = deque()\n curr = root\n arr = []\n\n while arr or curr:\n if curr:\n arr.append(curr)\n curr = curr.left\n else:\n parent = arr.pop()\n self.inorder.append(parent.val)\n curr = parent.right\n\n\n def next(self) -> int:\n return self.inorder.popleft()\n\n def hasNext(self) -> bool:\n return bool(self.inorder)\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"44"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, x: int):\n# self.val = x\n# self.left = None\n# self.right = None\n\n\nclass BSTIterator:\n\n def __init__(self, root: TreeNode) -> None:\n\n # Stack for the recursion simulation\n self.stack = []\n\n # Remember that the algorithm starts with a call to the helper function\n # with the root node as the input\n self._leftmost_inorder(root)\n\n def _leftmost_inorder(self, root: TreeNode) -> None:\n\n # For a given node, add all the elements in the leftmost branch of the tree\n # under it to the stack.\n while root:\n self.stack.append(root)\n root = root.left\n\n def next(self) -> int:\n \"\"\"\n @return the next smallest number\n \"\"\"\n # Node at the top of the stack is the next smallest element\n topmost_node = self.stack.pop()\n\n # Need to maintain the invariant. If the node has a right child, call the\n # helper function for the right child\n if topmost_node.right:\n self._leftmost_inorder(topmost_node.right)\n return topmost_node.val\n\n def hasNext(self) -> bool:\n \"\"\"\n @return whether we have a next smallest number\n \"\"\"\n return len(self.stack) > 0\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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n # Array containing all the nodes in the sorted order\n self.nodes_sorted = []\n\n # Pointer to the next smallest element in the BST\n self.index = -1\n\n # Call to flatten the input binary search tree\n self._inorder(root)\n\n \n def _inorder(self, root: TreeNode) -> None:\n \"\"\"\n In order traversal go left, print, right and return if next is none\n \"\"\"\n if not root:\n return\n self._inorder(root.left)\n self.nodes_sorted.append(root.val)\n self._inorder(root.right)\n\n def next(self) -> int:\n \"\"\"\n Whenever next is called, return the next at the smallest index\n \"\"\"\n self.index += 1\n return self.nodes_sorted[self.index]\n\n \n def hasNext(self) -> bool:\n \"\"\"\n If the binary tree has a next\n \"\"\"\n return self.index + 1 < len(self.nodes_sorted)\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"45"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.li = []\n self.order(root)\n self.curr = 0\n\n\n def order(self, root:Optional[TreeNode]): \n if not root: \n return \n self.order(root.left)\n self.li.append(root.val)\n self.order(root.right)\n \n\n def next(self) -> int:\n ans = -1\n if self.curr < len(self.li): \n ans = self.li[self.curr]\n self.curr+=1\n return ans\n \n\n def hasNext(self) -> bool:\n return self.curr < len(self.li)\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"45"},{"code":"from collections import deque\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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = deque() \n self.current = root\n while self.current:\n self.stack.append(self.current)\n self.current = self.current.left\n self.current = self.stack.pop()\n\n def next(self) -> int:\n if not self.hasNext():\n return None\n\n result = self.current.val\n\n if self.current.right:\n self.current = self.current.right\n while self.current:\n self.stack.append(self.current)\n self.current = self.current.left\n self.current = self.stack.pop()\n elif len(self.stack) == 0:\n self.current = None\n else:\n next_candidate = self.current\n while next_candidate.val <= self.current.val and len(self.stack) > 0:\n next_candidate = self.stack.pop()\n if next_candidate.val <= self.current.val:\n self.current = None\n else:\n self.current = next_candidate\n\n return result\n\n def hasNext(self) -> bool:\n return self.current is not None\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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\nfrom collections import deque\nclass BSTIterator:\n\n def findMax(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if root is None:\n return root\n while root.right is not None:\n root = root.right\n return root\n\n def morris(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\n if root is None:\n return root\n while root.left is not None:\n left = root.left\n left_max = self.findMax(left)\n root.left = None\n left_max.right = root\n root = left\n return root\n\n def __init__(self, root: Optional[TreeNode]):\n self.root = self.morris(root) \n\n def next(self) -> int:\n if self.root.left is not None:\n self.root = self.morris(self.root)\n v = self.root.val\n self.root = self.root.right\n return v\n\n def hasNext(self) -> bool:\n return self.root is not None\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = collections.deque([])\n self.cur = root\n self.goRight = False\n\n def next(self) -> int:\n while self.cur:\n self.stack.appendleft(self.cur)\n self.cur = self.cur.left\n\n self.cur = self.stack.popleft()\n val = self.cur.val\n self.cur = self.cur.right\n return val\n \n\n def hasNext(self) -> bool:\n temp = self.cur\n if temp and temp.left:\n temp = temp.left\n return True\n elif temp:\n return True\n elif not temp and self.stack:\n temp2 = self.stack.popleft()\n res = temp2.val\n self.stack.appendleft(temp2)\n return True\n return False\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n while root:\n self.stack.append(root)\n root = root.left\n \n def next(self) -> int:\n rtnVal = self.stack.pop()\n # If there is a right node, that means there may be smaller values\n if rtnVal.right:\n temp = rtnVal.right\n self.stack.append(temp)\n while temp.left:\n self.stack.append(temp.left)\n temp = temp.left\n return rtnVal.val\n\n def hasNext(self) -> bool:\n return self.stack\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]): \n self.stack = []\n self.pushAll(root)\n \n\n def next(self) -> int:\n node = self.stack.pop() # this node is the root of a subtree, and its left child has already been explored or it doesn't exist.\n\n # since current root and left child/subtree has been explored, now we push in the right child/subtree\n self.pushAll(node.right)\n\n return node.val\n \n\n def hasNext(self) -> bool:\n if len(self.stack) != 0:\n return True \n else:\n return False\n\n \n # push the current node and all its left children/grandchildren\n def pushAll(self, node):\n\n while node is not None:\n self.stack.append(node)\n node = node.left\n\n\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n # in-order -> left -> root -> right\n # -> left -> curr -> right\n \n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n self.get_left_most(root)\n\n def get_left_most(self, root: Optional[TreeNode]):\n while root:\n self.stack.append(root)\n root = root.left\n\n def next(self) -> int:\n node = self.stack.pop()\n \n if node.right:\n self.get_left_most(node.right)\n \n return node.val\n\n def hasNext(self) -> bool:\n return len(self.stack) > 0\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n # Stack to simulate in-order traversal\n self.stack = []\n \n # Initialize the stack with the leftmost path of the tree\n self._leftmost_inorder(root)\n\n def _leftmost_inorder(self, node):\n # Add all the leftmost nodes to the stack\n while node:\n self.stack.append(node)\n node = node.left\n\n def next(self) -> int:\n # Pop the topmost element from the stack (next smallest element)\n topmost_node = self.stack.pop()\n \n # If the node has a right child, process the right subtree\n if topmost_node.right:\n self._leftmost_inorder(topmost_node.right)\n \n # Return the value of the node\n return topmost_node.val\n\n def hasNext(self) -> bool:\n # Return True if there are still nodes in the stack\n return len(self.stack) > 0\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.node = None\n self.stack = []\n node = root\n while node:\n self.stack.append(node)\n node = node.left\n \n\n def add_to_stack(self, node):\n while node:\n self.stack.append(node)\n node = node.left\n \n\n def next(self) -> int:\n node = self.stack.pop()\n if node.right:\n self.add_to_stack(node.right)\n return node.val\n \n\n def hasNext(self) -> bool:\n return len(self.stack) != 0\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n # seflf.root = root\n # sel.i = 0\n \n \n # def inorder(root,arr):\n # if root is None:\n # return None\n # inorder(root.left,arr)\n # arr.append(root.val)\n # inorder(root.right,arr)\n # return arr\n # self.arr = inorder(root,[])\n self.stack =[]\n self.add_all_lefts(root)\n \n def add_all_lefts(self,root):\n while root:\n self.stack.append(root)\n root = root.left\n \n\n def next(self) -> int:\n # val = self.arr[self.i]\n # self.i+=1\n # return val\n node = self.stack.pop()\n res = node.val\n node = node.right\n self.add_all_lefts(node)\n return res \n\n \n \n\n def hasNext(self) -> bool:\n # if self.i+1>len(self.arr):\n # return False\n # return True\n return bool(self.stack)\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n self.push(root)\n\n def next(self) -> int:\n treeNode = self.stack.pop()\n self.push(treeNode.right)\n return treeNode.val\n \n def hasNext(self) -> bool:\n return len(self.stack) > 0\n \n def push(self,root):\n while root != None:\n self.stack.append(root)\n root = root.left\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n self._left_inorder(root)\n\n def _left_inorder(self, node: Optional[TreeNode]):\n while node:\n self.stack.append(node)\n node = node.left\n\n def next(self) -> int:\n current = self.stack.pop()\n if current.right:\n self._left_inorder(current.right)\n return current.val\n\n def hasNext(self) -> bool:\n return len(self.stack) > 0\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.res = []\n self.idx = 0\n self.cur = root\n self.stack = [] \n while self.cur or self.stack:\n while self.cur:\n self.stack.append(self.cur)\n self.cur = self.cur.left\n self.cur = self.stack.pop()\n self.res.append(self.cur.val)\n self.cur = self.cur.right\n def next(self) -> int:\n val = self.res[self.idx]\n self.idx += 1\n return val\n\n def hasNext(self) -> bool:\n return self.idx < len(self.res) \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.node = None\n self.stack = []\n node = root\n while node:\n self.stack.append(node)\n node = node.left\n \n\n def add_to_stack(self, node):\n while node:\n self.stack.append(node)\n node = node.left\n \n\n def next(self) -> int:\n node = self.stack.pop()\n if node.right:\n self.add_to_stack(node.right)\n return node.val\n \n\n def hasNext(self) -> bool:\n return len(self.stack) != 0\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.values = []\n self._in_order(root)\n self._ptr = 0\n def next(self) -> int:\n value = self.values[self._ptr]\n self._ptr += 1\n return value\n\n def hasNext(self) -> bool:\n return len(self.values) > self._ptr\n\n def _in_order(self, node):\n if not node:\n return\n self._in_order(node.left)\n self.values.append(node.val)\n self._in_order(node.right)\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.head = None\n self.node = root\n\n def next(self) -> int:\n if self.hasNext():\n res = self.head.val\n self.head = None\n return res\n \n return None\n\n def hasNext(self) -> bool:\n if self.head:\n return True\n \n node = self.node\n while node:\n if node.left:\n flag = node.left\n while flag.right and flag.right is not node:\n flag = flag.right\n \n # if left not visited:\n if flag.right is None:\n flag.right = node\n node = node.left\n else:\n self.head = node\n flag.right = None\n node = node.right\n break\n else:\n self.head = node\n node = node.right\n break\n\n self.node = node\n\n return self.head\n\n\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n currNode = root\n while currNode:\n self.stack.append(currNode)\n currNode = currNode.left\n \n\n def next(self) -> int:\n nextElem = self.stack.pop()\n\n currNode = nextElem\n\n if currNode.right:\n currNode = currNode.right\n while currNode:\n self.stack.append(currNode)\n currNode = currNode.left\n\n return nextElem.val\n \n \n def hasNext(self) -> bool:\n if self.stack and len(self.stack):\n return True\n return False \n\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.heap = []\n while root:\n self.heap.append(root)\n root = root.left\n return\n\n def next(self) -> int:\n node = self.heap.pop()\n if node.right:\n r = node.right\n while r:\n self.heap.append(r)\n r = r.left\n return node.val\n\n def hasNext(self) -> bool:\n return len(self.heap)\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n self._pushLeft(root)\n #self.curr_pointer = 0\n #self.inorder_traversal = self.inorder(root)\n\n def next(self) -> int:\n #next = self.inorder_traversal[self.curr_pointer]\n #self.curr_pointer += 1\n #return next\n if self.hasNext():\n next = self.stack.pop()\n self._pushLeft(next.right)\n return next.val\n return -1\n \n \n def hasNext(self) -> bool:\n #return self.curr_pointer < len(self.inorder_traversal)\n return len(self.stack) > 0\n\n def _pushLeft(self, root):\n while root:\n self.stack.append(root)\n root = root.left\n \n\n def inorder(self, root):\n if root is None:\n return []\n return self.inorder(root.left) + [root.val] + self.inorder(root.right)\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n\n self.res = []\n self.init = -1\n\n def inorder(node):\n\n if not node:\n return\n \n inorder(node.left)\n self.res.append(node.val)\n inorder(node.right)\n\n return\n\n inorder(root)\n self.N = len(self.res)\n \n\n def next(self) -> int:\n\n self.init += 1\n return self.res[self.init]\n \n\n def hasNext(self) -> bool:\n\n if self.init + 1 < self.N:\n return True\n else:\n return False\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"55"},{"code":"class BSTIterator:\n stack: collections.deque[TreeNode]\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = collections.deque()\n self.insert(root)\n\n def next(self) -> int:\n while self.stack[0].left != None or self.stack[0].right != None:\n item = self.stack.popleft()\n self.insert(item)\n return self.stack.popleft().val\n\n def hasNext(self) -> bool:\n \n return len(self.stack) > 0\n\n def insert(self, root):\n left = root.left\n right = root.right\n root.left = root.right = None\n\n \n if right:\n self.stack.appendleft(right)\n self.stack.appendleft(root)\n if left:\n self.stack.appendleft(left)\n","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.node = None\n self.stack = []\n node = root\n while node:\n self.stack.append(node)\n node = node.left\n \n\n def add_to_stack(self, node):\n while node:\n self.stack.append(node)\n node = node.left\n \n\n def next(self) -> int:\n node = self.stack.pop()\n if node.right:\n self.add_to_stack(node.right)\n return node.val\n \n\n def hasNext(self) -> bool:\n return len(self.stack) != 0\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n # def __init__(self, root: Optional[TreeNode]):\n # self.root = root\n # self.curr = root\n \n\n # def next(self) -> int:\n\n \n\n # def hasNext(self) -> bool:\n \n def __init__(self, root):\n \"\"\"\n :type root: TreeNode\n \"\"\"\n self.stack = []\n while root:\n self.stack.append(root)\n root = root.left\n \n\n def next(self):\n \"\"\"\n :rtype: int\n \"\"\"\n node=self.stack.pop()\n r = node.right\n while r:\n self.stack.append(r)\n r = r.left\n return node.val\n \n\n def hasNext(self):\n \"\"\"\n :rtype: bool\n \"\"\"\n return self.stack\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.arr = [-1]\n self.inorder(root)\n self.index = 0\n\n def next(self) -> int:\n self.index += 1\n return self.arr[self.index]\n\n def hasNext(self) -> bool:\n if (self.index + 1) < len(self.arr):\n return True\n return False\n \n def inorder(self, root):\n if not root:\n return\n self.inorder(root.left)\n self.arr.append(root.val)\n self.inorder(root.right)\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.node = None\n self.stack = []\n node = root\n while node:\n self.stack.append(node)\n node = node.left\n \n\n def add_to_stack(self, node):\n while node:\n self.stack.append(node)\n node = node.left\n \n\n def next(self) -> int:\n node = self.stack.pop()\n if node.right:\n self.add_to_stack(node.right)\n return node.val\n \n\n def hasNext(self) -> bool:\n return len(self.stack) != 0\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n\n def inorder(root):\n\n if root != None:\n return inorder(root.left) + [root.val] + inorder(root.right)\n else:\n return []\n \n self.sorted_list = inorder(root)\n self.cur_index = 0\n \n\n def next(self) -> int:\n self.cur_index += 1\n return self.sorted_list[self.cur_index - 1]\n\n def hasNext(self) -> bool:\n return self.cur_index < len(self.sorted_list)\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n self.push(root)\n \n\n def next(self) -> int:\n temp = self.stack.pop()\n self.push(temp.right)\n return temp.val\n \n\n def hasNext(self) -> bool:\n return self.stack\n \n def push(self, node):\n while node:\n self.stack.append(node)\n node = node.left\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"59"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.root = root\n self.flat = []\n\n def aux_dfs(node):\n if node.left:\n aux_dfs(node.left)\n self.flat.append(node.val)\n if node.right:\n aux_dfs(node.right)\n aux_dfs(root)\n self.idx = -1\n\n def next(self) -> int:\n self.idx += 1\n return self.flat[self.idx]\n\n def hasNext(self) -> bool:\n return self.idx + 1 < len(self.flat)\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"59"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.__in_order = []\n\n def populate(node: TreeNode) -> None:\n if node:\n if node.left: populate(node.left)\n self.__in_order.append(node.val)\n if node.right: populate(node.right)\n populate(root)\n self.__length = len(self.__in_order)\n self.__i = 0\n\n def next(self) -> int:\n val = self.__in_order[self.__i]\n self.__i += 1\n return val\n\n def hasNext(self) -> bool:\n return self.__i < self.__length\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"60"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]): \n self.stack = []\n self.pushAll(root)\n \n\n def next(self) -> int:\n node = self.stack.pop() # this node is the root of a subtree, and its left child has already been explored or it doesn't exist.\n\n # since current root and left child/subtree has been explored, now we push in the right child/subtree\n self.pushAll(node.right)\n\n return node.val\n \n\n def hasNext(self) -> bool:\n if len(self.stack) != 0:\n return True \n else:\n return False\n\n \n # push the current node and all its left children/grandchildren\n def pushAll(self, node):\n\n while node is not None:\n self.stack.append(node)\n node = node.left\n\n\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"60"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n while root:\n self.stack.append(root)\n root = root.left\n\n def next(self) -> int:\n node = self.stack.pop()\n curr = node.right\n while curr:\n self.stack.append(curr)\n curr = curr.left\n return node.val\n\n def hasNext(self) -> bool:\n return self.stack != []\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"61"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.traversal = []\n self.traverse(root)\n self.len_traversal = len(self.traversal)\n self.iterator = -1\n\n def traverse(self, root):\n if not root: return\n self.traverse(root.left)\n self.traversal.append(root.val)\n self.traverse(root.right)\n\n def next(self) -> int:\n self.iterator += 1\n return self.traversal[self.iterator]\n\n def hasNext(self) -> bool:\n return self.iterator + 1 <= self.len_traversal - 1\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"62"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.cur = root\n self.lastVal = -float(\"inf\")\n self.maxVal = root.val if root else -float(\"inf\")\n while root.right:\n root = root.right\n self.maxVal = max(self.maxVal,root.val)\n self.stack = []\n \n def next(self) -> int:\n while self.stack or self.cur:\n while self.cur:\n self.stack.append(self.cur)\n self.cur = self.cur.left\n if self.stack:\n self.cur = self.stack.pop()\n self.lastVal = self.cur.val\n self.cur = self.cur.right\n return self.lastVal\n \n\n def hasNext(self) -> bool:\n return self.lastVal < self.maxVal\n\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"62"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n\n self.arr = []\n\n def inorder(node):\n if not node:\n return\n inorder(node.left)\n self.arr.append(node.val)\n inorder(node.right)\n\n inorder(root)\n self.pointer = -1 \n\n def next(self) -> int:\n self.pointer += 1\n return self.arr[self.pointer]\n \n \n def hasNext(self) -> bool:\n return self.pointer + 1 < len(self.arr)\n \n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()\n\n\n\"\"\"\nTC = O(n)\nSC = O(n)\n\"\"\"","runtime":"63"},{"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 BSTIterator:\n st = []\n def __init__(self, root: Optional[TreeNode]):\n def inorder(root):\n if not root:\n return None\n inorder(root.left)\n self.st.append(root.val)\n inorder(root.right)\n inorder(root)\n\n def next(self) -> int:\n return self.st.pop(0)\n\n def hasNext(self) -> bool:\n return len(self.st)> 0\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"63"},{"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 BSTIterator:\n\n def populate_inorder(self, root):\n if root is None:\n return []\n \n traversal = self.populate_inorder(root.left)\n traversal += [root.val]\n traversal += self.populate_inorder(root.right)\n return traversal\n\n def __init__(self, root: Optional[TreeNode]):\n self.in_order = self.populate_inorder(root)\n self.idx = 0\n\n def next(self) -> int:\n node = self.in_order[self.idx]\n self.idx += 1\n return node\n\n def hasNext(self) -> bool:\n return self.idx < len(self.in_order)\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"64"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.curr_pointer = 0\n self.inorder_traversal = self.inorder(root)\n\n def next(self) -> int:\n next = self.inorder_traversal[self.curr_pointer]\n self.curr_pointer += 1\n return next\n \n def hasNext(self) -> bool:\n return self.curr_pointer < len(self.inorder_traversal)\n\n def inorder(self, root):\n if root is None:\n return []\n return self.inorder(root.left) + [root.val] + self.inorder(root.right)\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"64"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.traversal = []\n \n def inorder(node):\n if node:\n if node.left:\n inorder(node.left)\n self.traversal.append(node.val)\n if node.right:\n inorder(node.right)\n inorder(root)\n self.index = -1\n\n def next(self) -> int:\n self.index += 1\n return self.traversal[self.index]\n \n\n def hasNext(self) -> bool:\n return self.index + 1 < len(self.traversal)\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"65"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n self.add_left(root)\n \n def add_left(self, cur):\n while cur:\n self.stack.append(cur)\n cur = cur.left\n\n def next(self) -> int:\n # [7, 15, 9]\n cur = self.stack.pop()\n ans = cur\n if cur.right:\n cur = cur.right\n self.add_left(cur)\n return ans.val\n\n\n def hasNext(self) -> bool:\n return len(self.stack)\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"65"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n self.push(root)\n\n def next(self) -> int:\n treeNode = self.stack.pop()\n self.push(treeNode.right)\n return treeNode.val\n \n def hasNext(self) -> bool:\n return len(self.stack) > 0\n \n def push(self,root):\n while root != None:\n self.stack.append(root)\n root = root.left\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"66"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.node = None\n self.stack = []\n self.add_to_stack(root)\n \n\n def add_to_stack(self, node):\n while node:\n self.stack.append(node)\n node = node.left\n \n\n def next(self) -> int:\n node = self.stack.pop()\n if node.right:\n self.add_to_stack(node.right)\n return node.val\n \n\n def hasNext(self) -> bool:\n return len(self.stack) != 0\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"67"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n while root:\n self.stack.append(root)\n root = root.left\n\n def next(self) -> int:\n node = self.stack.pop()\n right = node.right\n while right:\n self.stack.append(right)\n right = right.left\n return node.val\n\n def hasNext(self) -> bool:\n if self.stack:\n return True\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"67"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n while root:\n self.stack.append(root)\n root = root.left\n \n\n def next(self) -> int:\n res = self.stack.pop()\n cur = res.right\n while cur:\n self.stack.append(cur)\n cur = cur.left\n \n return res.val\n\n\n def hasNext(self) -> bool:\n return self.stack\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"68"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n self.curr_node = root\n \n\n def next(self) -> int:\n while self.curr_node:\n self.stack.append(self.curr_node)\n self.curr_node = self.curr_node.left\n self.curr_node = self.stack.pop()\n next_val = self.curr_node.val\n self.curr_node = self.curr_node.right\n return next_val\n \n\n def hasNext(self) -> bool:\n return self.stack or self.curr_node\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"69"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.current = root\n self.stack = []\n\n while root:\n self.stack.append(root)\n root = root.left\n \n\n def next(self) -> int:\n top = self.stack.pop()\n if top.right:\n current = top.right\n while current:\n self.stack.append(current)\n current = current.left\n return top.val\n \n def hasNext(self) -> bool:\n return len(self.stack) > 0\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","runtime":"69"}],"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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n self._push_left(root)\\n\\n def _push_left(self, node: Optional[TreeNode]):\\n while node:\\n self.stack.append(node)\\n node = node.left\\n\\n def next(self) -> int:\\n node = self.stack.pop()\\n if node.right:\\n self._push_left(node.right)\\n return node.val\\n\\n def hasNext(self) -> bool:\\n return len(self.stack) > 0\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n self.add_all_lefts(root)\\n \\n def add_all_lefts(self, root):\\n while root:\\n self.stack.append(root)\\n root = root.left\\n\\n def next(self) -> int:\\n node = self.stack.pop()\\n # 题目保证 next 不会乱掉\\n res = node.val\\n\\n node = node.right\\n # 如果有 RIGHT，把所有 RIGHT 入栈\\n self.add_all_lefts(node)\\n return res \\n\\n def hasNext(self) -> bool:\\n return bool(self.stack)\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"34\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.root = root\\n self.arr = []\\n self.curr_index = 0 \\n \\n # use an index and array to track\\n self.inorder(self.root)\\n print(self.arr)\\n\\n def inorder(self, node):\\n if node is not None:\\n if node.left is not None:\\n self.inorder(node.left)\\n self.arr.append(node.val)\\n if node.right is not None:\\n self.inorder(node.right)\\n\\n\\n def next(self) -> int:\\n next = self.arr[self.curr_index]\\n self.curr_index += 1\\n return next\\n \\n def hasNext(self) -> bool:\\n return self.curr_index < len(self.arr)\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n t = root\\n while t:\\n self.stack.append(t)\\n t = t.left\\n \\n\\n def next(self) -> int:\\n res = self.stack.pop()\\n t = res.right\\n while t:\\n self.stack.append(t)\\n t = t.left\\n return res.val\\n\\n def hasNext(self) -> bool:\\n return self.stack\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n while root:\\n self.stack.append(root)\\n root = root.left\\n\\n def next(self) -> int:\\n tmp = self.stack.pop()\\n ans = tmp.val\\n cur = tmp.right\\n while cur:\\n self.stack.append(cur)\\n cur = cur.left\\n return ans\\n\\n def hasNext(self) -> bool:\\n if self.stack:\\n return True\\n return False\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n cur = root\\n while cur:\\n self.stack.append(cur)\\n cur = cur.left\\n\\n def next(self) -> int:\\n out = self.stack.pop()\\n cur = out.right\\n while cur:\\n self.stack.append(cur)\\n cur = cur.left\\n return out.val\\n\\n def hasNext(self) -> bool:\\n return self.stack != []\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.elts = deque(self.precompute(root))\\n \\n\\n def next(self) -> int:\\n return self.elts.popleft() if self.hasNext() else -1\\n \\n def hasNext(self) -> bool:\\n return self.elts\\n\\n def precompute(self, node):\\n elts = []\\n stack = []\\n curr = node\\n while curr or stack:\\n while curr:\\n stack.append(curr)\\n curr = curr.left\\n curr = stack.pop()\\n elts.append(curr.val)\\n curr = curr.right\\n return elts\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n # preorder: root, left, right\\n # inorder: left, root, right <--\\n # postorder: left, right, root\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n while root:\\n self.stack.append(root)\\n root = root.left\\n\\n self.node = root\\n\\n\\n def next(self) -> int:\\n nxt = self.stack.pop()\\n temp = nxt.right\\n while temp:\\n self.stack.append(temp)\\n temp = temp.left\\n return nxt.val\\n \\n\\n def hasNext(self) -> bool:\\n if self.stack:\\n return True\\n return False\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n \\n def __init__(self, root: Optional[TreeNode]):\\n self.list = []\\n self.pushtree(root)\\n\\n def pushtree(self, node):\\n while node:\\n self.list.append(node)\\n node = node.left\\n\\n def next(self) -> int:\\n node = self.list.pop()\\n self.pushtree(node.right)\\n return node.val\\n \\n def hasNext(self) -> bool:\\n return True if len(self.list) else False \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.cache = []\\n self._exhaust_left_branch(root)\\n \\n def _exhaust_left_branch(self, node):\\n while node:\\n self.cache.append(node)\\n node = node.left\\n\\n def next(self) -> int:\\n curr_node = self.cache.pop()\\n if curr_node.right:\\n self._exhaust_left_branch(curr_node.right)\\n return curr_node.val\\n \\n def hasNext(self) -> bool:\\n return len(self.cache) > 0\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.iot = []\\n self.traverse(root, self.iot)\\n self.index = 0\\n\\n def next(self) -> int:\\n value = self.iot[self.index]\\n self.index += 1\\n return value\\n\\n def hasNext(self) -> bool:\\n if self.index < len(self.iot):\\n return True\\n return False\\n\\n def traverse(self, node, arr):\\n if not node:\\n return\\n\\n self.traverse(node.left, arr)\\n arr.append(node.val)\\n self.traverse(node.right, arr)\\n\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n def __init__(self, root: Optional[TreeNode]):\\n self.inorder = deque()\\n curr = root\\n arr = []\\n\\n while arr or curr:\\n if curr:\\n arr.append(curr)\\n curr = curr.left\\n else:\\n parent = arr.pop()\\n self.inorder.append(parent.val)\\n curr = parent.right\\n\\n\\n def next(self) -> int:\\n return self.inorder.popleft()\\n\\n def hasNext(self) -> bool:\\n return bool(self.inorder)\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, x: int):\\n# self.val = x\\n# self.left = None\\n# self.right = None\\n\\n\\nclass BSTIterator:\\n\\n def __init__(self, root: TreeNode) -> None:\\n\\n # Stack for the recursion simulation\\n self.stack = []\\n\\n # Remember that the algorithm starts with a call to the helper function\\n # with the root node as the input\\n self._leftmost_inorder(root)\\n\\n def _leftmost_inorder(self, root: TreeNode) -> None:\\n\\n # For a given node, add all the elements in the leftmost branch of the tree\\n # under it to the stack.\\n while root:\\n self.stack.append(root)\\n root = root.left\\n\\n def next(self) -> int:\\n \\\"\\\"\\\"\\n @return the next smallest number\\n \\\"\\\"\\\"\\n # Node at the top of the stack is the next smallest element\\n topmost_node = self.stack.pop()\\n\\n # Need to maintain the invariant. If the node has a right child, call the\\n # helper function for the right child\\n if topmost_node.right:\\n self._leftmost_inorder(topmost_node.right)\\n return topmost_node.val\\n\\n def hasNext(self) -> bool:\\n \\\"\\\"\\\"\\n @return whether we have a next smallest number\\n \\\"\\\"\\\"\\n return len(self.stack) > 0\\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n # Array containing all the nodes in the sorted order\\n self.nodes_sorted = []\\n\\n # Pointer to the next smallest element in the BST\\n self.index = -1\\n\\n # Call to flatten the input binary search tree\\n self._inorder(root)\\n\\n \\n def _inorder(self, root: TreeNode) -> None:\\n \\\"\\\"\\\"\\n In order traversal go left, print, right and return if next is none\\n \\\"\\\"\\\"\\n if not root:\\n return\\n self._inorder(root.left)\\n self.nodes_sorted.append(root.val)\\n self._inorder(root.right)\\n\\n def next(self) -> int:\\n \\\"\\\"\\\"\\n Whenever next is called, return the next at the smallest index\\n \\\"\\\"\\\"\\n self.index += 1\\n return self.nodes_sorted[self.index]\\n\\n \\n def hasNext(self) -> bool:\\n \\\"\\\"\\\"\\n If the binary tree has a next\\n \\\"\\\"\\\"\\n return self.index + 1 < len(self.nodes_sorted)\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"45\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.li = []\\n self.order(root)\\n self.curr = 0\\n\\n\\n def order(self, root:Optional[TreeNode]): \\n if not root: \\n return \\n self.order(root.left)\\n self.li.append(root.val)\\n self.order(root.right)\\n \\n\\n def next(self) -> int:\\n ans = -1\\n if self.curr < len(self.li): \\n ans = self.li[self.curr]\\n self.curr+=1\\n return ans\\n \\n\\n def hasNext(self) -> bool:\\n return self.curr < len(self.li)\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"from collections import deque\\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = deque() \\n self.current = root\\n while self.current:\\n self.stack.append(self.current)\\n self.current = self.current.left\\n self.current = self.stack.pop()\\n\\n def next(self) -> int:\\n if not self.hasNext():\\n return None\\n\\n result = self.current.val\\n\\n if self.current.right:\\n self.current = self.current.right\\n while self.current:\\n self.stack.append(self.current)\\n self.current = self.current.left\\n self.current = self.stack.pop()\\n elif len(self.stack) == 0:\\n self.current = None\\n else:\\n next_candidate = self.current\\n while next_candidate.val <= self.current.val and len(self.stack) > 0:\\n next_candidate = self.stack.pop()\\n if next_candidate.val <= self.current.val:\\n self.current = None\\n else:\\n self.current = next_candidate\\n\\n return result\\n\\n def hasNext(self) -> bool:\\n return self.current is not None\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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\\nfrom collections import deque\\nclass BSTIterator:\\n\\n def findMax(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if root is None:\\n return root\\n while root.right is not None:\\n root = root.right\\n return root\\n\\n def morris(self, root: Optional[TreeNode]) -> Optional[TreeNode]:\\n if root is None:\\n return root\\n while root.left is not None:\\n left = root.left\\n left_max = self.findMax(left)\\n root.left = None\\n left_max.right = root\\n root = left\\n return root\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.root = self.morris(root) \\n\\n def next(self) -> int:\\n if self.root.left is not None:\\n self.root = self.morris(self.root)\\n v = self.root.val\\n self.root = self.root.right\\n return v\\n\\n def hasNext(self) -> bool:\\n return self.root is not None\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = collections.deque([])\\n self.cur = root\\n self.goRight = False\\n\\n def next(self) -> int:\\n while self.cur:\\n self.stack.appendleft(self.cur)\\n self.cur = self.cur.left\\n\\n self.cur = self.stack.popleft()\\n val = self.cur.val\\n self.cur = self.cur.right\\n return val\\n \\n\\n def hasNext(self) -> bool:\\n temp = self.cur\\n if temp and temp.left:\\n temp = temp.left\\n return True\\n elif temp:\\n return True\\n elif not temp and self.stack:\\n temp2 = self.stack.popleft()\\n res = temp2.val\\n self.stack.appendleft(temp2)\\n return True\\n return False\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n while root:\\n self.stack.append(root)\\n root = root.left\\n \\n def next(self) -> int:\\n rtnVal = self.stack.pop()\\n # If there is a right node, that means there may be smaller values\\n if rtnVal.right:\\n temp = rtnVal.right\\n self.stack.append(temp)\\n while temp.left:\\n self.stack.append(temp.left)\\n temp = temp.left\\n return rtnVal.val\\n\\n def hasNext(self) -> bool:\\n return self.stack\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]): \\n self.stack = []\\n self.pushAll(root)\\n \\n\\n def next(self) -> int:\\n node = self.stack.pop() # this node is the root of a subtree, and its left child has already been explored or it doesn't exist.\\n\\n # since current root and left child/subtree has been explored, now we push in the right child/subtree\\n self.pushAll(node.right)\\n\\n return node.val\\n \\n\\n def hasNext(self) -> bool:\\n if len(self.stack) != 0:\\n return True \\n else:\\n return False\\n\\n \\n # push the current node and all its left children/grandchildren\\n def pushAll(self, node):\\n\\n while node is not None:\\n self.stack.append(node)\\n node = node.left\\n\\n\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n # in-order -> left -> root -> right\\n # -> left -> curr -> right\\n \\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n self.get_left_most(root)\\n\\n def get_left_most(self, root: Optional[TreeNode]):\\n while root:\\n self.stack.append(root)\\n root = root.left\\n\\n def next(self) -> int:\\n node = self.stack.pop()\\n \\n if node.right:\\n self.get_left_most(node.right)\\n \\n return node.val\\n\\n def hasNext(self) -> bool:\\n return len(self.stack) > 0\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n # Stack to simulate in-order traversal\\n self.stack = []\\n \\n # Initialize the stack with the leftmost path of the tree\\n self._leftmost_inorder(root)\\n\\n def _leftmost_inorder(self, node):\\n # Add all the leftmost nodes to the stack\\n while node:\\n self.stack.append(node)\\n node = node.left\\n\\n def next(self) -> int:\\n # Pop the topmost element from the stack (next smallest element)\\n topmost_node = self.stack.pop()\\n \\n # If the node has a right child, process the right subtree\\n if topmost_node.right:\\n self._leftmost_inorder(topmost_node.right)\\n \\n # Return the value of the node\\n return topmost_node.val\\n\\n def hasNext(self) -> bool:\\n # Return True if there are still nodes in the stack\\n return len(self.stack) > 0\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.node = None\\n self.stack = []\\n node = root\\n while node:\\n self.stack.append(node)\\n node = node.left\\n \\n\\n def add_to_stack(self, node):\\n while node:\\n self.stack.append(node)\\n node = node.left\\n \\n\\n def next(self) -> int:\\n node = self.stack.pop()\\n if node.right:\\n self.add_to_stack(node.right)\\n return node.val\\n \\n\\n def hasNext(self) -> bool:\\n return len(self.stack) != 0\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n # seflf.root = root\\n # sel.i = 0\\n \\n \\n # def inorder(root,arr):\\n # if root is None:\\n # return None\\n # inorder(root.left,arr)\\n # arr.append(root.val)\\n # inorder(root.right,arr)\\n # return arr\\n # self.arr = inorder(root,[])\\n self.stack =[]\\n self.add_all_lefts(root)\\n \\n def add_all_lefts(self,root):\\n while root:\\n self.stack.append(root)\\n root = root.left\\n \\n\\n def next(self) -> int:\\n # val = self.arr[self.i]\\n # self.i+=1\\n # return val\\n node = self.stack.pop()\\n res = node.val\\n node = node.right\\n self.add_all_lefts(node)\\n return res \\n\\n \\n \\n\\n def hasNext(self) -> bool:\\n # if self.i+1>len(self.arr):\\n # return False\\n # return True\\n return bool(self.stack)\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n self.push(root)\\n\\n def next(self) -> int:\\n treeNode = self.stack.pop()\\n self.push(treeNode.right)\\n return treeNode.val\\n \\n def hasNext(self) -> bool:\\n return len(self.stack) > 0\\n \\n def push(self,root):\\n while root != None:\\n self.stack.append(root)\\n root = root.left\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n self._left_inorder(root)\\n\\n def _left_inorder(self, node: Optional[TreeNode]):\\n while node:\\n self.stack.append(node)\\n node = node.left\\n\\n def next(self) -> int:\\n current = self.stack.pop()\\n if current.right:\\n self._left_inorder(current.right)\\n return current.val\\n\\n def hasNext(self) -> bool:\\n return len(self.stack) > 0\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.res = []\\n self.idx = 0\\n self.cur = root\\n self.stack = [] \\n while self.cur or self.stack:\\n while self.cur:\\n self.stack.append(self.cur)\\n self.cur = self.cur.left\\n self.cur = self.stack.pop()\\n self.res.append(self.cur.val)\\n self.cur = self.cur.right\\n def next(self) -> int:\\n val = self.res[self.idx]\\n self.idx += 1\\n return val\\n\\n def hasNext(self) -> bool:\\n return self.idx < len(self.res) \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.node = None\\n self.stack = []\\n node = root\\n while node:\\n self.stack.append(node)\\n node = node.left\\n \\n\\n def add_to_stack(self, node):\\n while node:\\n self.stack.append(node)\\n node = node.left\\n \\n\\n def next(self) -> int:\\n node = self.stack.pop()\\n if node.right:\\n self.add_to_stack(node.right)\\n return node.val\\n \\n\\n def hasNext(self) -> bool:\\n return len(self.stack) != 0\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.values = []\\n self._in_order(root)\\n self._ptr = 0\\n def next(self) -> int:\\n value = self.values[self._ptr]\\n self._ptr += 1\\n return value\\n\\n def hasNext(self) -> bool:\\n return len(self.values) > self._ptr\\n\\n def _in_order(self, node):\\n if not node:\\n return\\n self._in_order(node.left)\\n self.values.append(node.val)\\n self._in_order(node.right)\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.head = None\\n self.node = root\\n\\n def next(self) -> int:\\n if self.hasNext():\\n res = self.head.val\\n self.head = None\\n return res\\n \\n return None\\n\\n def hasNext(self) -> bool:\\n if self.head:\\n return True\\n \\n node = self.node\\n while node:\\n if node.left:\\n flag = node.left\\n while flag.right and flag.right is not node:\\n flag = flag.right\\n \\n # if left not visited:\\n if flag.right is None:\\n flag.right = node\\n node = node.left\\n else:\\n self.head = node\\n flag.right = None\\n node = node.right\\n break\\n else:\\n self.head = node\\n node = node.right\\n break\\n\\n self.node = node\\n\\n return self.head\\n\\n\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n currNode = root\\n while currNode:\\n self.stack.append(currNode)\\n currNode = currNode.left\\n \\n\\n def next(self) -> int:\\n nextElem = self.stack.pop()\\n\\n currNode = nextElem\\n\\n if currNode.right:\\n currNode = currNode.right\\n while currNode:\\n self.stack.append(currNode)\\n currNode = currNode.left\\n\\n return nextElem.val\\n \\n \\n def hasNext(self) -> bool:\\n if self.stack and len(self.stack):\\n return True\\n return False \\n\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.heap = []\\n while root:\\n self.heap.append(root)\\n root = root.left\\n return\\n\\n def next(self) -> int:\\n node = self.heap.pop()\\n if node.right:\\n r = node.right\\n while r:\\n self.heap.append(r)\\n r = r.left\\n return node.val\\n\\n def hasNext(self) -> bool:\\n return len(self.heap)\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n self._pushLeft(root)\\n #self.curr_pointer = 0\\n #self.inorder_traversal = self.inorder(root)\\n\\n def next(self) -> int:\\n #next = self.inorder_traversal[self.curr_pointer]\\n #self.curr_pointer += 1\\n #return next\\n if self.hasNext():\\n next = self.stack.pop()\\n self._pushLeft(next.right)\\n return next.val\\n return -1\\n \\n \\n def hasNext(self) -> bool:\\n #return self.curr_pointer < len(self.inorder_traversal)\\n return len(self.stack) > 0\\n\\n def _pushLeft(self, root):\\n while root:\\n self.stack.append(root)\\n root = root.left\\n \\n\\n def inorder(self, root):\\n if root is None:\\n return []\\n return self.inorder(root.left) + [root.val] + self.inorder(root.right)\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n\\n self.res = []\\n self.init = -1\\n\\n def inorder(node):\\n\\n if not node:\\n return\\n \\n inorder(node.left)\\n self.res.append(node.val)\\n inorder(node.right)\\n\\n return\\n\\n inorder(root)\\n self.N = len(self.res)\\n \\n\\n def next(self) -> int:\\n\\n self.init += 1\\n return self.res[self.init]\\n \\n\\n def hasNext(self) -> bool:\\n\\n if self.init + 1 < self.N:\\n return True\\n else:\\n return False\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class BSTIterator:\\n stack: collections.deque[TreeNode]\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = collections.deque()\\n self.insert(root)\\n\\n def next(self) -> int:\\n while self.stack[0].left != None or self.stack[0].right != None:\\n item = self.stack.popleft()\\n self.insert(item)\\n return self.stack.popleft().val\\n\\n def hasNext(self) -> bool:\\n \\n return len(self.stack) > 0\\n\\n def insert(self, root):\\n left = root.left\\n right = root.right\\n root.left = root.right = None\\n\\n \\n if right:\\n self.stack.appendleft(right)\\n self.stack.appendleft(root)\\n if left:\\n self.stack.appendleft(left)\\n\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.node = None\\n self.stack = []\\n node = root\\n while node:\\n self.stack.append(node)\\n node = node.left\\n \\n\\n def add_to_stack(self, node):\\n while node:\\n self.stack.append(node)\\n node = node.left\\n \\n\\n def next(self) -> int:\\n node = self.stack.pop()\\n if node.right:\\n self.add_to_stack(node.right)\\n return node.val\\n \\n\\n def hasNext(self) -> bool:\\n return len(self.stack) != 0\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n # def __init__(self, root: Optional[TreeNode]):\\n # self.root = root\\n # self.curr = root\\n \\n\\n # def next(self) -> int:\\n\\n \\n\\n # def hasNext(self) -> bool:\\n \\n def __init__(self, root):\\n \\\"\\\"\\\"\\n :type root: TreeNode\\n \\\"\\\"\\\"\\n self.stack = []\\n while root:\\n self.stack.append(root)\\n root = root.left\\n \\n\\n def next(self):\\n \\\"\\\"\\\"\\n :rtype: int\\n \\\"\\\"\\\"\\n node=self.stack.pop()\\n r = node.right\\n while r:\\n self.stack.append(r)\\n r = r.left\\n return node.val\\n \\n\\n def hasNext(self):\\n \\\"\\\"\\\"\\n :rtype: bool\\n \\\"\\\"\\\"\\n return self.stack\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.arr = [-1]\\n self.inorder(root)\\n self.index = 0\\n\\n def next(self) -> int:\\n self.index += 1\\n return self.arr[self.index]\\n\\n def hasNext(self) -> bool:\\n if (self.index + 1) < len(self.arr):\\n return True\\n return False\\n \\n def inorder(self, root):\\n if not root:\\n return\\n self.inorder(root.left)\\n self.arr.append(root.val)\\n self.inorder(root.right)\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.node = None\\n self.stack = []\\n node = root\\n while node:\\n self.stack.append(node)\\n node = node.left\\n \\n\\n def add_to_stack(self, node):\\n while node:\\n self.stack.append(node)\\n node = node.left\\n \\n\\n def next(self) -> int:\\n node = self.stack.pop()\\n if node.right:\\n self.add_to_stack(node.right)\\n return node.val\\n \\n\\n def hasNext(self) -> bool:\\n return len(self.stack) != 0\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n\\n def inorder(root):\\n\\n if root != None:\\n return inorder(root.left) + [root.val] + inorder(root.right)\\n else:\\n return []\\n \\n self.sorted_list = inorder(root)\\n self.cur_index = 0\\n \\n\\n def next(self) -> int:\\n self.cur_index += 1\\n return self.sorted_list[self.cur_index - 1]\\n\\n def hasNext(self) -> bool:\\n return self.cur_index < len(self.sorted_list)\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n self.push(root)\\n \\n\\n def next(self) -> int:\\n temp = self.stack.pop()\\n self.push(temp.right)\\n return temp.val\\n \\n\\n def hasNext(self) -> bool:\\n return self.stack\\n \\n def push(self, node):\\n while node:\\n self.stack.append(node)\\n node = node.left\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"59\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.root = root\\n self.flat = []\\n\\n def aux_dfs(node):\\n if node.left:\\n aux_dfs(node.left)\\n self.flat.append(node.val)\\n if node.right:\\n aux_dfs(node.right)\\n aux_dfs(root)\\n self.idx = -1\\n\\n def next(self) -> int:\\n self.idx += 1\\n return self.flat[self.idx]\\n\\n def hasNext(self) -> bool:\\n return self.idx + 1 < len(self.flat)\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"59\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.__in_order = []\\n\\n def populate(node: TreeNode) -> None:\\n if node:\\n if node.left: populate(node.left)\\n self.__in_order.append(node.val)\\n if node.right: populate(node.right)\\n populate(root)\\n self.__length = len(self.__in_order)\\n self.__i = 0\\n\\n def next(self) -> int:\\n val = self.__in_order[self.__i]\\n self.__i += 1\\n return val\\n\\n def hasNext(self) -> bool:\\n return self.__i < self.__length\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"60\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]): \\n self.stack = []\\n self.pushAll(root)\\n \\n\\n def next(self) -> int:\\n node = self.stack.pop() # this node is the root of a subtree, and its left child has already been explored or it doesn't exist.\\n\\n # since current root and left child/subtree has been explored, now we push in the right child/subtree\\n self.pushAll(node.right)\\n\\n return node.val\\n \\n\\n def hasNext(self) -> bool:\\n if len(self.stack) != 0:\\n return True \\n else:\\n return False\\n\\n \\n # push the current node and all its left children/grandchildren\\n def pushAll(self, node):\\n\\n while node is not None:\\n self.stack.append(node)\\n node = node.left\\n\\n\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"60\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n while root:\\n self.stack.append(root)\\n root = root.left\\n\\n def next(self) -> int:\\n node = self.stack.pop()\\n curr = node.right\\n while curr:\\n self.stack.append(curr)\\n curr = curr.left\\n return node.val\\n\\n def hasNext(self) -> bool:\\n return self.stack != []\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"61\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.traversal = []\\n self.traverse(root)\\n self.len_traversal = len(self.traversal)\\n self.iterator = -1\\n\\n def traverse(self, root):\\n if not root: return\\n self.traverse(root.left)\\n self.traversal.append(root.val)\\n self.traverse(root.right)\\n\\n def next(self) -> int:\\n self.iterator += 1\\n return self.traversal[self.iterator]\\n\\n def hasNext(self) -> bool:\\n return self.iterator + 1 <= self.len_traversal - 1\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"62\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.cur = root\\n self.lastVal = -float(\\\"inf\\\")\\n self.maxVal = root.val if root else -float(\\\"inf\\\")\\n while root.right:\\n root = root.right\\n self.maxVal = max(self.maxVal,root.val)\\n self.stack = []\\n \\n def next(self) -> int:\\n while self.stack or self.cur:\\n while self.cur:\\n self.stack.append(self.cur)\\n self.cur = self.cur.left\\n if self.stack:\\n self.cur = self.stack.pop()\\n self.lastVal = self.cur.val\\n self.cur = self.cur.right\\n return self.lastVal\\n \\n\\n def hasNext(self) -> bool:\\n return self.lastVal < self.maxVal\\n\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"62\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n\\n self.arr = []\\n\\n def inorder(node):\\n if not node:\\n return\\n inorder(node.left)\\n self.arr.append(node.val)\\n inorder(node.right)\\n\\n inorder(root)\\n self.pointer = -1 \\n\\n def next(self) -> int:\\n self.pointer += 1\\n return self.arr[self.pointer]\\n \\n \\n def hasNext(self) -> bool:\\n return self.pointer + 1 < len(self.arr)\\n \\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\\n\\n\\n\\\"\\\"\\\"\\nTC = O(n)\\nSC = O(n)\\n\\\"\\\"\\\"\",\n \"runtime\": \"63\"\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 BSTIterator:\\n st = []\\n def __init__(self, root: Optional[TreeNode]):\\n def inorder(root):\\n if not root:\\n return None\\n inorder(root.left)\\n self.st.append(root.val)\\n inorder(root.right)\\n inorder(root)\\n\\n def next(self) -> int:\\n return self.st.pop(0)\\n\\n def hasNext(self) -> bool:\\n return len(self.st)> 0\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"63\"\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 BSTIterator:\\n\\n def populate_inorder(self, root):\\n if root is None:\\n return []\\n \\n traversal = self.populate_inorder(root.left)\\n traversal += [root.val]\\n traversal += self.populate_inorder(root.right)\\n return traversal\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.in_order = self.populate_inorder(root)\\n self.idx = 0\\n\\n def next(self) -> int:\\n node = self.in_order[self.idx]\\n self.idx += 1\\n return node\\n\\n def hasNext(self) -> bool:\\n return self.idx < len(self.in_order)\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"64\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.curr_pointer = 0\\n self.inorder_traversal = self.inorder(root)\\n\\n def next(self) -> int:\\n next = self.inorder_traversal[self.curr_pointer]\\n self.curr_pointer += 1\\n return next\\n \\n def hasNext(self) -> bool:\\n return self.curr_pointer < len(self.inorder_traversal)\\n\\n def inorder(self, root):\\n if root is None:\\n return []\\n return self.inorder(root.left) + [root.val] + self.inorder(root.right)\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"64\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.traversal = []\\n \\n def inorder(node):\\n if node:\\n if node.left:\\n inorder(node.left)\\n self.traversal.append(node.val)\\n if node.right:\\n inorder(node.right)\\n inorder(root)\\n self.index = -1\\n\\n def next(self) -> int:\\n self.index += 1\\n return self.traversal[self.index]\\n \\n\\n def hasNext(self) -> bool:\\n return self.index + 1 < len(self.traversal)\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"65\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n self.add_left(root)\\n \\n def add_left(self, cur):\\n while cur:\\n self.stack.append(cur)\\n cur = cur.left\\n\\n def next(self) -> int:\\n # [7, 15, 9]\\n cur = self.stack.pop()\\n ans = cur\\n if cur.right:\\n cur = cur.right\\n self.add_left(cur)\\n return ans.val\\n\\n\\n def hasNext(self) -> bool:\\n return len(self.stack)\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"65\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n self.push(root)\\n\\n def next(self) -> int:\\n treeNode = self.stack.pop()\\n self.push(treeNode.right)\\n return treeNode.val\\n \\n def hasNext(self) -> bool:\\n return len(self.stack) > 0\\n \\n def push(self,root):\\n while root != None:\\n self.stack.append(root)\\n root = root.left\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"66\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.node = None\\n self.stack = []\\n self.add_to_stack(root)\\n \\n\\n def add_to_stack(self, node):\\n while node:\\n self.stack.append(node)\\n node = node.left\\n \\n\\n def next(self) -> int:\\n node = self.stack.pop()\\n if node.right:\\n self.add_to_stack(node.right)\\n return node.val\\n \\n\\n def hasNext(self) -> bool:\\n return len(self.stack) != 0\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"67\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n while root:\\n self.stack.append(root)\\n root = root.left\\n\\n def next(self) -> int:\\n node = self.stack.pop()\\n right = node.right\\n while right:\\n self.stack.append(right)\\n right = right.left\\n return node.val\\n\\n def hasNext(self) -> bool:\\n if self.stack:\\n return True\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"67\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n while root:\\n self.stack.append(root)\\n root = root.left\\n \\n\\n def next(self) -> int:\\n res = self.stack.pop()\\n cur = res.right\\n while cur:\\n self.stack.append(cur)\\n cur = cur.left\\n \\n return res.val\\n\\n\\n def hasNext(self) -> bool:\\n return self.stack\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"68\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n self.curr_node = root\\n \\n\\n def next(self) -> int:\\n while self.curr_node:\\n self.stack.append(self.curr_node)\\n self.curr_node = self.curr_node.left\\n self.curr_node = self.stack.pop()\\n next_val = self.curr_node.val\\n self.curr_node = self.curr_node.right\\n return next_val\\n \\n\\n def hasNext(self) -> bool:\\n return self.stack or self.curr_node\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"69\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.current = root\\n self.stack = []\\n\\n while root:\\n self.stack.append(root)\\n root = root.left\\n \\n\\n def next(self) -> int:\\n top = self.stack.pop()\\n if top.right:\\n current = top.right\\n while current:\\n self.stack.append(current)\\n current = current.left\\n return top.val\\n \\n def hasNext(self) -> bool:\\n return len(self.stack) > 0\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"runtime\": \"69\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":59,"string":"59"},"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n # array containing all the nodes in the sorted order\n self.nodes_sorted = []\n\n # pointer to the next smallest element in the BST\n self.index = -1\n\n # call to flatten the input binary search tree\n self._inorder(root)\n\n def _inorder(self, root: TreeNode) -> None:\n if not root:\n return \n self._inorder(root.left)\n self.nodes_sorted.append(root.val)\n self._inorder(root.right)\n\n def next(self) -> int:\n # return the smallest number\n self.index += 1\n return self.nodes_sorted[self.index]\n\n def hasNext(self) -> bool:\n # return whether we have a next smallest number\n return self.index + 1 < len(self.nodes_sorted)\n \n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"21400"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.st = [root]\n\n def next(self) -> int:\n while self.st and self.st[-1].left:\n top = self.st.pop()\n self.st.append(top)\n self.st.append(top.left)\n top.left = None\n top = self.st.pop()\n if top.right:\n self.st.append(top.right)\n return top.val\n \n\n def hasNext(self) -> bool:\n return len(self.st) > 0\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"21600"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n arr = []\n # LNR\n\n def travis(node, arr):\n if node:\n travis(node.left, arr)\n arr.append(node.val)\n travis(node.right, arr)\n \n if root:\n travis(root, arr)\n self.arr = arr\n\n def next(self) -> int:\n val = self.arr.pop(0)\n return val\n\n def hasNext(self) -> bool:\n if self.arr != []:\n return True\n return False\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"21700"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n empty_list = []\n self.nodes = self.traverse(root, empty_list)\n\n print(self.nodes)\n\n def traverse(self, root: Optional[TreeNode], lst):\n if (root is None):\n return []\n if (root.left is not None):\n self.traverse(root.left, lst)\n lst.append(root.val)\n if (root.right is not None and root.left is None):\n lst.append(root.val)\n self.traverse(root.right, lst)\n elif (root.right is not None):\n self.traverse(root.right, lst)\n if (root.left is None and root.right is None):\n lst.append(root.val)\n return lst\n\n \n\n def next(self) -> int:\n val = self.nodes[0]\n if (len(self.nodes) == 1):\n self.nodes = []\n else:\n self.nodes = self.nodes[1:]\n return val\n\n \n\n def hasNext(self) -> bool:\n return len(self.nodes) > 0\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"21800"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n\n self.arr = []\n\n def inorder(node):\n if not node:\n return\n inorder(node.left)\n self.arr.append(node.val)\n inorder(node.right)\n\n inorder(root)\n self.pointer = -1 \n\n def next(self) -> int:\n self.pointer += 1\n return self.arr[self.pointer]\n \n \n def hasNext(self) -> bool:\n return self.pointer + 1 < len(self.arr)\n \n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()\n\n\n\"\"\"\nTC = O(n)\nSC = O(n)\n\"\"\"","memory":"21900"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.res = []\n self.idx = 0\n self.cur = root\n self.stack = [] \n while self.cur or self.stack:\n while self.cur:\n self.stack.append(self.cur)\n self.cur = self.cur.left\n self.cur = self.stack.pop()\n self.res.append(self.cur.val)\n self.cur = self.cur.right\n def next(self) -> int:\n val = self.res[self.idx]\n self.idx += 1\n return val\n\n def hasNext(self) -> bool:\n return self.idx < len(self.res) \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"21900"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.__in_order = []\n\n def populate(node: TreeNode) -> None:\n if node:\n if node.left: populate(node.left)\n self.__in_order.append(node.val)\n if node.right: populate(node.right)\n populate(root)\n self.__length = len(self.__in_order)\n self.__i = 0\n\n def next(self) -> int:\n val = self.__in_order[self.__i]\n self.__i += 1\n return val\n\n def hasNext(self) -> bool:\n return self.__i < self.__length\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"22000"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.traversal = []\n \n def inorder(node):\n if node:\n if node.left:\n inorder(node.left)\n self.traversal.append(node.val)\n if node.right:\n inorder(node.right)\n inorder(root)\n self.index = -1\n\n def next(self) -> int:\n self.index += 1\n return self.traversal[self.index]\n \n\n def hasNext(self) -> bool:\n return self.index + 1 < len(self.traversal)\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"22000"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]): \n self.stack = []\n self.pushAll(root)\n \n\n def next(self) -> int:\n node = self.stack.pop() # this node is the root of a subtree, and its left child has already been explored or it doesn't exist.\n\n # since current root and left child/subtree has been explored, now we push in the right child/subtree\n self.pushAll(node.right)\n\n return node.val\n \n\n def hasNext(self) -> bool:\n if len(self.stack) != 0:\n return True \n else:\n return False\n\n \n # push the current node and all its left children/grandchildren\n def pushAll(self, node):\n\n while node is not None:\n self.stack.append(node)\n node = node.left\n\n\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"22100"},{"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 BSTIterator:\n def __init__(self, root: Optional[TreeNode]):\n self.inorder = deque()\n curr = root\n arr = []\n\n while arr or curr:\n if curr:\n arr.append(curr)\n curr = curr.left\n else:\n parent = arr.pop()\n self.inorder.append(parent.val)\n curr = parent.right\n\n\n def next(self) -> int:\n return self.inorder.popleft()\n\n def hasNext(self) -> bool:\n return bool(self.inorder)\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"22100"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n curr = root\n while curr:\n self.stack.append(curr)\n curr = curr.left\n\n\n def next(self) -> int:\n curr = self.stack.pop()\n val = curr.val\n curr= curr.right\n while curr:\n self.stack.append(curr)\n curr = curr.left\n return val\n\n\n \n\n def hasNext(self) -> bool:\n if len(self.stack) > 0:\n return True\n else:\n return False\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"22200"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n while root:\n self.stack.append(root)\n root = root.left\n\n def next(self) -> int:\n if not self.hasNext():\n return None\n ans = self.stack.pop()\n p = ans.right\n \n while p:\n self.stack.append(p)\n p = p.left\n\n return ans.val\n\n def hasNext(self) -> bool:\n return len(self.stack) > 0\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"22200"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]): \n self.stack = []\n self.pushAll(root)\n \n\n def next(self) -> int:\n node = self.stack.pop() # this node is the root of a subtree, and its left child has already been explored or it doesn't exist.\n\n # since current root and left child/subtree has been explored, now we push in the right child/subtree\n self.pushAll(node.right)\n\n return node.val\n \n\n def hasNext(self) -> bool:\n if len(self.stack) != 0:\n return True \n else:\n return False\n\n \n # push the current node and all its left children/grandchildren\n def pushAll(self, node):\n\n while node is not None:\n self.stack.append(node)\n node = node.left\n\n\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"22300"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n # seflf.root = root\n # sel.i = 0\n \n \n # def inorder(root,arr):\n # if root is None:\n # return None\n # inorder(root.left,arr)\n # arr.append(root.val)\n # inorder(root.right,arr)\n # return arr\n # self.arr = inorder(root,[])\n self.stack =[]\n self.add_all_lefts(root)\n \n def add_all_lefts(self,root):\n while root:\n self.stack.append(root)\n root = root.left\n \n\n def next(self) -> int:\n # val = self.arr[self.i]\n # self.i+=1\n # return val\n node = self.stack.pop()\n res = node.val\n node = node.right\n self.add_all_lefts(node)\n return res \n\n \n \n\n def hasNext(self) -> bool:\n # if self.i+1>len(self.arr):\n # return False\n # return True\n return bool(self.stack)\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"22300"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n self.push(root)\n \n\n def next(self) -> int:\n temp = self.stack.pop()\n self.push(temp.right)\n return temp.val\n \n\n def hasNext(self) -> bool:\n return self.stack\n \n def push(self, node):\n while node:\n self.stack.append(node)\n node = node.left\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"22400"},{"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 BSTIterator:\n # in-order -> left -> root -> right\n # -> left -> curr -> right\n \n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n self.get_left_most(root)\n\n def get_left_most(self, root: Optional[TreeNode]):\n while root:\n self.stack.append(root)\n root = root.left\n\n def next(self) -> int:\n node = self.stack.pop()\n \n if node.right:\n self.get_left_most(node.right)\n \n return node.val\n\n def hasNext(self) -> bool:\n return len(self.stack) > 0\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"22400"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = []\n self._push_left(root)\n\n def _push_left(self, node):\n while node:\n self.stack.append(node)\n node = node.left\n\n def next(self) -> int:\n node = self.stack.pop()\n if node.right:\n self._push_left(node.right)\n return node.val\n\n def hasNext(self) -> bool:\n return len(self.stack) > 0\n \n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"22500"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = deque()\n if root:\n self.stack.appendleft(root)\n temp = root\n while temp.left:\n self.stack.appendleft(temp.left)\n temp = temp.left\n \n\n def next(self) -> int:\n val = self.stack[0].val\n popped = self.stack.popleft()\n if popped.right:\n self.stack.appendleft(popped.right)\n temp = popped.right\n while temp.left:\n self.stack.appendleft(temp.left)\n temp = temp.left\n return val\n\n def hasNext(self) -> bool:\n return len(self.stack) != 0\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"22500"},{"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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.root = root\n self.flat = []\n\n def aux_dfs(node):\n if node.left:\n aux_dfs(node.left)\n self.flat.append(node.val)\n if node.right:\n aux_dfs(node.right)\n aux_dfs(root)\n self.idx = -1\n\n def next(self) -> int:\n self.idx += 1\n return self.flat[self.idx]\n\n def hasNext(self) -> bool:\n return self.idx + 1 < len(self.flat)\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"22600"},{"code":"from collections import deque\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 BSTIterator:\n\n def __init__(self, root: Optional[TreeNode]):\n self.stack = deque() \n self.current = root\n while self.current:\n self.stack.append(self.current)\n self.current = self.current.left\n self.current = self.stack.pop()\n\n def next(self) -> int:\n if not self.hasNext():\n return None\n\n result = self.current.val\n\n if self.current.right:\n self.current = self.current.right\n while self.current:\n self.stack.append(self.current)\n self.current = self.current.left\n self.current = self.stack.pop()\n elif len(self.stack) == 0:\n self.current = None\n else:\n next_candidate = self.current\n while next_candidate.val <= self.current.val and len(self.stack) > 0:\n next_candidate = self.stack.pop()\n if next_candidate.val <= self.current.val:\n self.current = None\n else:\n self.current = next_candidate\n\n return result\n\n def hasNext(self) -> bool:\n return self.current is not None\n\n\n# Your BSTIterator object will be instantiated and called as such:\n# obj = BSTIterator(root)\n# param_1 = obj.next()\n# param_2 = obj.hasNext()","memory":"22600"}],"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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n # array containing all the nodes in the sorted order\\n self.nodes_sorted = []\\n\\n # pointer to the next smallest element in the BST\\n self.index = -1\\n\\n # call to flatten the input binary search tree\\n self._inorder(root)\\n\\n def _inorder(self, root: TreeNode) -> None:\\n if not root:\\n return \\n self._inorder(root.left)\\n self.nodes_sorted.append(root.val)\\n self._inorder(root.right)\\n\\n def next(self) -> int:\\n # return the smallest number\\n self.index += 1\\n return self.nodes_sorted[self.index]\\n\\n def hasNext(self) -> bool:\\n # return whether we have a next smallest number\\n return self.index + 1 < len(self.nodes_sorted)\\n \\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"21400\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.st = [root]\\n\\n def next(self) -> int:\\n while self.st and self.st[-1].left:\\n top = self.st.pop()\\n self.st.append(top)\\n self.st.append(top.left)\\n top.left = None\\n top = self.st.pop()\\n if top.right:\\n self.st.append(top.right)\\n return top.val\\n \\n\\n def hasNext(self) -> bool:\\n return len(self.st) > 0\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"21600\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n arr = []\\n # LNR\\n\\n def travis(node, arr):\\n if node:\\n travis(node.left, arr)\\n arr.append(node.val)\\n travis(node.right, arr)\\n \\n if root:\\n travis(root, arr)\\n self.arr = arr\\n\\n def next(self) -> int:\\n val = self.arr.pop(0)\\n return val\\n\\n def hasNext(self) -> bool:\\n if self.arr != []:\\n return True\\n return False\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"21700\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n empty_list = []\\n self.nodes = self.traverse(root, empty_list)\\n\\n print(self.nodes)\\n\\n def traverse(self, root: Optional[TreeNode], lst):\\n if (root is None):\\n return []\\n if (root.left is not None):\\n self.traverse(root.left, lst)\\n lst.append(root.val)\\n if (root.right is not None and root.left is None):\\n lst.append(root.val)\\n self.traverse(root.right, lst)\\n elif (root.right is not None):\\n self.traverse(root.right, lst)\\n if (root.left is None and root.right is None):\\n lst.append(root.val)\\n return lst\\n\\n \\n\\n def next(self) -> int:\\n val = self.nodes[0]\\n if (len(self.nodes) == 1):\\n self.nodes = []\\n else:\\n self.nodes = self.nodes[1:]\\n return val\\n\\n \\n\\n def hasNext(self) -> bool:\\n return len(self.nodes) > 0\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"21800\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n\\n self.arr = []\\n\\n def inorder(node):\\n if not node:\\n return\\n inorder(node.left)\\n self.arr.append(node.val)\\n inorder(node.right)\\n\\n inorder(root)\\n self.pointer = -1 \\n\\n def next(self) -> int:\\n self.pointer += 1\\n return self.arr[self.pointer]\\n \\n \\n def hasNext(self) -> bool:\\n return self.pointer + 1 < len(self.arr)\\n \\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\\n\\n\\n\\\"\\\"\\\"\\nTC = O(n)\\nSC = O(n)\\n\\\"\\\"\\\"\",\n \"memory\": \"21900\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.res = []\\n self.idx = 0\\n self.cur = root\\n self.stack = [] \\n while self.cur or self.stack:\\n while self.cur:\\n self.stack.append(self.cur)\\n self.cur = self.cur.left\\n self.cur = self.stack.pop()\\n self.res.append(self.cur.val)\\n self.cur = self.cur.right\\n def next(self) -> int:\\n val = self.res[self.idx]\\n self.idx += 1\\n return val\\n\\n def hasNext(self) -> bool:\\n return self.idx < len(self.res) \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"21900\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.__in_order = []\\n\\n def populate(node: TreeNode) -> None:\\n if node:\\n if node.left: populate(node.left)\\n self.__in_order.append(node.val)\\n if node.right: populate(node.right)\\n populate(root)\\n self.__length = len(self.__in_order)\\n self.__i = 0\\n\\n def next(self) -> int:\\n val = self.__in_order[self.__i]\\n self.__i += 1\\n return val\\n\\n def hasNext(self) -> bool:\\n return self.__i < self.__length\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"22000\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.traversal = []\\n \\n def inorder(node):\\n if node:\\n if node.left:\\n inorder(node.left)\\n self.traversal.append(node.val)\\n if node.right:\\n inorder(node.right)\\n inorder(root)\\n self.index = -1\\n\\n def next(self) -> int:\\n self.index += 1\\n return self.traversal[self.index]\\n \\n\\n def hasNext(self) -> bool:\\n return self.index + 1 < len(self.traversal)\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"22000\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]): \\n self.stack = []\\n self.pushAll(root)\\n \\n\\n def next(self) -> int:\\n node = self.stack.pop() # this node is the root of a subtree, and its left child has already been explored or it doesn't exist.\\n\\n # since current root and left child/subtree has been explored, now we push in the right child/subtree\\n self.pushAll(node.right)\\n\\n return node.val\\n \\n\\n def hasNext(self) -> bool:\\n if len(self.stack) != 0:\\n return True \\n else:\\n return False\\n\\n \\n # push the current node and all its left children/grandchildren\\n def pushAll(self, node):\\n\\n while node is not None:\\n self.stack.append(node)\\n node = node.left\\n\\n\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"22100\"\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 BSTIterator:\\n def __init__(self, root: Optional[TreeNode]):\\n self.inorder = deque()\\n curr = root\\n arr = []\\n\\n while arr or curr:\\n if curr:\\n arr.append(curr)\\n curr = curr.left\\n else:\\n parent = arr.pop()\\n self.inorder.append(parent.val)\\n curr = parent.right\\n\\n\\n def next(self) -> int:\\n return self.inorder.popleft()\\n\\n def hasNext(self) -> bool:\\n return bool(self.inorder)\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"22100\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n curr = root\\n while curr:\\n self.stack.append(curr)\\n curr = curr.left\\n\\n\\n def next(self) -> int:\\n curr = self.stack.pop()\\n val = curr.val\\n curr= curr.right\\n while curr:\\n self.stack.append(curr)\\n curr = curr.left\\n return val\\n\\n\\n \\n\\n def hasNext(self) -> bool:\\n if len(self.stack) > 0:\\n return True\\n else:\\n return False\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"22200\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n while root:\\n self.stack.append(root)\\n root = root.left\\n\\n def next(self) -> int:\\n if not self.hasNext():\\n return None\\n ans = self.stack.pop()\\n p = ans.right\\n \\n while p:\\n self.stack.append(p)\\n p = p.left\\n\\n return ans.val\\n\\n def hasNext(self) -> bool:\\n return len(self.stack) > 0\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"22200\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]): \\n self.stack = []\\n self.pushAll(root)\\n \\n\\n def next(self) -> int:\\n node = self.stack.pop() # this node is the root of a subtree, and its left child has already been explored or it doesn't exist.\\n\\n # since current root and left child/subtree has been explored, now we push in the right child/subtree\\n self.pushAll(node.right)\\n\\n return node.val\\n \\n\\n def hasNext(self) -> bool:\\n if len(self.stack) != 0:\\n return True \\n else:\\n return False\\n\\n \\n # push the current node and all its left children/grandchildren\\n def pushAll(self, node):\\n\\n while node is not None:\\n self.stack.append(node)\\n node = node.left\\n\\n\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"22300\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n # seflf.root = root\\n # sel.i = 0\\n \\n \\n # def inorder(root,arr):\\n # if root is None:\\n # return None\\n # inorder(root.left,arr)\\n # arr.append(root.val)\\n # inorder(root.right,arr)\\n # return arr\\n # self.arr = inorder(root,[])\\n self.stack =[]\\n self.add_all_lefts(root)\\n \\n def add_all_lefts(self,root):\\n while root:\\n self.stack.append(root)\\n root = root.left\\n \\n\\n def next(self) -> int:\\n # val = self.arr[self.i]\\n # self.i+=1\\n # return val\\n node = self.stack.pop()\\n res = node.val\\n node = node.right\\n self.add_all_lefts(node)\\n return res \\n\\n \\n \\n\\n def hasNext(self) -> bool:\\n # if self.i+1>len(self.arr):\\n # return False\\n # return True\\n return bool(self.stack)\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"22300\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n self.push(root)\\n \\n\\n def next(self) -> int:\\n temp = self.stack.pop()\\n self.push(temp.right)\\n return temp.val\\n \\n\\n def hasNext(self) -> bool:\\n return self.stack\\n \\n def push(self, node):\\n while node:\\n self.stack.append(node)\\n node = node.left\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"22400\"\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 BSTIterator:\\n # in-order -> left -> root -> right\\n # -> left -> curr -> right\\n \\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n self.get_left_most(root)\\n\\n def get_left_most(self, root: Optional[TreeNode]):\\n while root:\\n self.stack.append(root)\\n root = root.left\\n\\n def next(self) -> int:\\n node = self.stack.pop()\\n \\n if node.right:\\n self.get_left_most(node.right)\\n \\n return node.val\\n\\n def hasNext(self) -> bool:\\n return len(self.stack) > 0\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"22400\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = []\\n self._push_left(root)\\n\\n def _push_left(self, node):\\n while node:\\n self.stack.append(node)\\n node = node.left\\n\\n def next(self) -> int:\\n node = self.stack.pop()\\n if node.right:\\n self._push_left(node.right)\\n return node.val\\n\\n def hasNext(self) -> bool:\\n return len(self.stack) > 0\\n \\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"22500\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = deque()\\n if root:\\n self.stack.appendleft(root)\\n temp = root\\n while temp.left:\\n self.stack.appendleft(temp.left)\\n temp = temp.left\\n \\n\\n def next(self) -> int:\\n val = self.stack[0].val\\n popped = self.stack.popleft()\\n if popped.right:\\n self.stack.appendleft(popped.right)\\n temp = popped.right\\n while temp.left:\\n self.stack.appendleft(temp.left)\\n temp = temp.left\\n return val\\n\\n def hasNext(self) -> bool:\\n return len(self.stack) != 0\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"22500\"\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.root = root\\n self.flat = []\\n\\n def aux_dfs(node):\\n if node.left:\\n aux_dfs(node.left)\\n self.flat.append(node.val)\\n if node.right:\\n aux_dfs(node.right)\\n aux_dfs(root)\\n self.idx = -1\\n\\n def next(self) -> int:\\n self.idx += 1\\n return self.flat[self.idx]\\n\\n def hasNext(self) -> bool:\\n return self.idx + 1 < len(self.flat)\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"22600\"\n },\n {\n \"code\": \"from collections import deque\\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 BSTIterator:\\n\\n def __init__(self, root: Optional[TreeNode]):\\n self.stack = deque() \\n self.current = root\\n while self.current:\\n self.stack.append(self.current)\\n self.current = self.current.left\\n self.current = self.stack.pop()\\n\\n def next(self) -> int:\\n if not self.hasNext():\\n return None\\n\\n result = self.current.val\\n\\n if self.current.right:\\n self.current = self.current.right\\n while self.current:\\n self.stack.append(self.current)\\n self.current = self.current.left\\n self.current = self.stack.pop()\\n elif len(self.stack) == 0:\\n self.current = None\\n else:\\n next_candidate = self.current\\n while next_candidate.val <= self.current.val and len(self.stack) > 0:\\n next_candidate = self.stack.pop()\\n if next_candidate.val <= self.current.val:\\n self.current = None\\n else:\\n self.current = next_candidate\\n\\n return result\\n\\n def hasNext(self) -> bool:\\n return self.current is not None\\n\\n\\n# Your BSTIterator object will be instantiated and called as such:\\n# obj = BSTIterator(root)\\n# param_1 = obj.next()\\n# param_2 = obj.hasNext()\",\n \"memory\": \"22600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":20,"string":"20"}}},{"rowIdx":171,"cells":{"question_id":{"kind":"number","value":174,"string":"174"},"name":{"kind":"string","value":"dungeon-game"},"content":{"kind":"string","value":"<p>The demons had captured the princess and imprisoned her in <strong>the bottom-right corner</strong> of a <code>dungeon</code>. The <code>dungeon</code> consists of <code>m x n</code> rooms laid out in a 2D grid. Our valiant knight was initially positioned in <strong>the top-left room</strong> and must fight his way through <code>dungeon</code> to rescue the princess.</p>\n\n<p>The knight has an initial health point represented by a positive integer. If at any point his health point drops to <code>0</code> or below, he dies immediately.</p>\n\n<p>Some of the rooms are guarded by demons (represented by negative integers), so the knight loses health upon entering these rooms; other rooms are either empty (represented as 0) or contain magic orbs that increase the knight's health (represented by positive integers).</p>\n\n<p>To reach the princess as quickly as possible, the knight decides to move only <strong>rightward</strong> or <strong>downward</strong> in each step.</p>\n\n<p>Return <em>the knight's minimum initial health so that he can rescue the princess</em>.</p>\n\n<p><strong>Note</strong> that any room can contain threats or power-ups, even the first room the knight enters and the bottom-right room where the princess is imprisoned.</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/13/dungeon-grid-1.jpg\" style=\"width: 253px; height: 253px;\" />\n<pre>\n<strong>Input:</strong> dungeon = [[-2,-3,3],[-5,-10,1],[10,30,-5]]\n<strong>Output:</strong> 7\n<strong>Explanation:</strong> The initial health of the knight must be at least 7 if he follows the optimal path: RIGHT-> RIGHT -> DOWN -> DOWN.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> dungeon = [[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>m == dungeon.length</code></li>\n\t<li><code>n == dungeon[i].length</code></li>\n\t<li><code>1 <= m, n <= 200</code></li>\n\t<li><code>-1000 <= dungeon[i][j] <= 1000</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":38.48974720270643,"string":"38.489747"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["array","dynamic-programming","matrix"],"string":"[\n \"array\",\n \"dynamic-programming\",\n \"matrix\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"36\", 0.0808], [\"39\", 0.0808], [\"46\", 0.0808], [\"47\", 0.1617], [\"48\", 0.1617], [\"49\", 0.0808], [\"50\", 0.5659], [\"51\", 0.485], [\"52\", 0.1617], [\"53\", 0.5659], [\"54\", 0.9701], [\"55\", 0.8892], [\"56\", 1.4551], [\"57\", 1.8593], [\"58\", 3.3145], [\"59\", 2.7486], [\"60\", 2.6677], [\"61\", 4.3654], [\"62\", 4.4462], [\"63\", 3.3145], [\"64\", 4.5271], [\"65\", 5.3355], [\"66\", 7.3565], [\"67\", 6.0631], [\"68\", 5.9822], [\"69\", 5.4163], [\"70\", 4.3654], [\"71\", 4.4462], [\"72\", 3.7187], [\"73\", 3.4762], [\"74\", 2.9911], [\"75\", 2.4252], [\"76\", 1.6168], [\"77\", 1.4551], [\"78\", 1.0509], [\"79\", 1.2935], [\"80\", 1.4551], [\"81\", 0.4042], [\"82\", 0.3234], [\"83\", 0.4042], [\"84\", 0.2425], [\"85\", 0.4042], [\"86\", 0.1617], [\"87\", 0.1617], [\"88\", 0.1617], [\"91\", 0.0808], [\"93\", 0.1617], [\"94\", 0.0808], [\"95\", 0.0808], [\"96\", 0.0808], [\"97\", 0.0808], [\"98\", 0.0808], [\"103\", 0.1617], [\"116\", 0.0808], [\"125\", 0.0808], [\"126\", 0.0808], [\"130\", 0.0808], [\"131\", 0.0808], [\"141\", 0.0808]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"17100\", 0.1617], [\"17200\", 0.0808], [\"17300\", 0.0808], [\"17400\", 2.1827], [\"17500\", 15.9256], [\"17600\", 23.9289], [\"17700\", 15.7639], [\"17800\", 9.62], [\"17900\", 7.4373], [\"18000\", 4.8504], [\"18100\", 1.9402], [\"18200\", 0.3234], [\"18300\", 0.485], [\"18400\", 0.2425], [\"18500\", 0.2425], [\"18600\", 0.2425], [\"18700\", 0.2425], [\"18900\", 0.1617], [\"19000\", 0.4042], [\"19100\", 0.5659], [\"19200\", 2.021], [\"19300\", 0.8892], [\"19400\", 0.485], [\"19500\", 0.8892], [\"19600\", 1.4551], [\"19700\", 0.2425], [\"19800\", 0.2425], [\"19900\", 0.485], [\"20000\", 2.4252]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n height, width = len(dungeon), len(dungeon[0])\n m, n = height - 1, width - 1\n dp = [ [0] * width for _ in range(height) ]\n dp[m][n] = max(1,1 - dungeon[m][n])\n for r in range(m-1,-1,-1):\n dp[r][n] = max(1,dp[r+1][n] - dungeon[r][n])\n for c in range(n-1,-1,-1):\n dp[m][c] = max(1, dp[m][c+1] - dungeon[m][c])\n for r in range(m-1,-1,-1):\n for c in range(n-1,-1,-1):\n dp[r][c] = max(1, min( dp[r+1][c], dp[r][c+1] ) - dungeon[r][c] )\n return dp[0][0]\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(Solution().calculateMinimumHP(nums),file=f)\nexit(0)\n\n\n ","runtime":"36"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n dp = [[float('inf')] * n for _ in range(m)]\n dp[m - 1][n - 1] = max(1, 1 - dungeon[m - 1][n - 1])\n \n for j in range(n - 2, -1, -1):\n dp[m - 1][j] = max(1, dp[m - 1][j + 1] - dungeon[m - 1][j])\n \n for i in range(m - 2, -1, -1):\n dp[i][n - 1] = max(1, dp[i + 1][n - 1] - dungeon[i][n - 1])\n \n for i in range(m - 2, -1, -1):\n for j in range(n - 2, -1, -1):\n minHPOnExit = min(dp[i + 1][j], dp[i][j + 1])\n dp[i][j] = max(1, minHPOnExit - dungeon[i][j])\n \n return dp[0][0]\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(Solution().calculateMinimumHP(nums),file=f)\nexit(0)","runtime":"39"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n \n # Create a 2D dp array initialized with infinity\n dp = [[float('inf')] * n for _ in range(m)]\n \n # Bottom-up approach: start from the princess's cell\n dp[m-1][n-1] = max(1, 1 - dungeon[m-1][n-1])\n \n # Fill the last row (bottom row)\n for j in range(n-2, -1, -1):\n dp[m-1][j] = max(1, dp[m-1][j+1] - dungeon[m-1][j])\n \n # Fill the last column (rightmost column)\n for i in range(m-2, -1, -1):\n dp[i][n-1] = max(1, dp[i+1][n-1] - dungeon[i][n-1])\n \n # Fill the rest of the dp table\n for i in range(m-2, -1, -1):\n for j in range(n-2, -1, -1):\n min_health_on_exit = min(dp[i+1][j], dp[i][j+1])\n dp[i][j] = max(1, min_health_on_exit - dungeon[i][j])\n \n return dp[0][0]\n","runtime":"46"},{"code":"class Solution:\n MAX = int(1E9)\n\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n dp = [[Solution.MAX] * (n+1) for _ in range(m+1)]\n dp[m-1][n], dp[m][n-1] = 1, 1\n for i in range(m-1,-1,-1):\n for j in range(n-1,-1,-1):\n dp[i][j] = max(min(dp[i+1][j],dp[i][j+1])-dungeon[i][j],1)\n\n return dp[0][0]","runtime":"47"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n \n # Initialize the dp table with the maximum possible value\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\n \n # The knight needs at least 1 health point to survive\n dp[m][n - 1] = 1\n dp[m - 1][n] = 1\n \n # Fill the dp table\n for i in range(m - 1, -1, -1):\n for j in range(n - 1, -1, -1):\n need = min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j]\n dp[i][j] = max(1, need)\n \n return dp[0][0]\n\n# Example usage:\nsolution = Solution()\ndungeon = [[-2, -3, 3], [-5, -10, 1], [10, 30, -5]]\nprint(solution.calculateMinimumHP(dungeon)) # Output: 7","runtime":"48"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n rows, cols = len(dungeon), len(dungeon[0])\n dp = [[float('inf')] * (cols + 1) for _ in range(rows + 1)]\n dp[rows - 1][cols], dp[rows][cols - 1] = 1, 1\n\n for i in range(rows - 1, -1, -1):\n for j in range(cols - 1, -1, -1):\n dp[i][j] = max(min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j], 1)\n\n return dp[0][0]","runtime":"49"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n \n # Initialize the DP table with positive infinity\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\n \n # The knight needs at least 1 health to survive\n dp[m][n - 1] = 1\n dp[m - 1][n] = 1\n \n # Fill the DP table from bottom-right to top-left\n for i in range(m - 1, -1, -1):\n for j in range(n - 1, -1, -1):\n needed_health = min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j]\n dp[i][j] = max(1, needed_health)\n \n return dp[0][0]\n\n# Example usage:\nsolution = Solution()\ndungeon = [[-2, -3, 3], [-5, -10, 1], [10, 30, -5]]\nprint(solution.calculateMinimumHP(dungeon)) # Output: 7","runtime":"50"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n dp = [[0 for _ in range(len(dungeon[0]))] for _ in range(len(dungeon))]\n if dungeon[-1][-1] < 0:\n dp[-1][-1] = 1 - dungeon[-1][-1]\n else:\n dp[-1][-1] = 1\n \n for i in range(len(dungeon) - 2, -1, -1):\n dp[i][len(dungeon[0]) - 1] = max(1, dp[i + 1][len(dungeon[0]) - 1] - dungeon[i][len(dungeon[0]) - 1])\n for j in range(len(dungeon[0]) - 2, -1, -1):\n dp[len(dungeon) - 1][j] = max(1, dp[len(dungeon) - 1][j + 1] - dungeon[len(dungeon) - 1][j])\n\n for i in range(len(dp) - 2, -1, -1):\n for j in range(len(dp[0]) - 2, -1, -1):\n next_cell = min(dp[i+1][j], dp[i][j+1])\n dp[i][j] = max(1, next_cell - dungeon[i][j])\n\n print(dp)\n \n return dp[0][0]\n","runtime":"51"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m=len(dungeon)-1\n n=len(dungeon[0])-1\n val=1-dungeon[m][n]\n if val<=0:\n val=1\n dungeon[m][n]=val\n for i in range(m,-1,-1):\n for j in range(n,-1,-1):\n if i==m and j!=n:\n val=dungeon[i][j+1]-dungeon[i][j]\n if val<=0:\n val=1\n dungeon[i][j]=val\n elif j==n and i!=m:\n val=dungeon[i+1][j]-dungeon[i][j]\n if val<=0:\n val=1\n dungeon[i][j]=val\n elif i!=m or j!=n:\n val=min(dungeon[i+1][j]-dungeon[i][j],dungeon[i][j+1]-dungeon[i][j])\n if val<=0:\n val=1\n dungeon[i][j]=val\n return dungeon[0][0]","runtime":"52"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n lastRow = len(dungeon) - 1\n lastCol = len(dungeon[0]) - 1\n \n\n dp0 = [1_000_000_000_000] * (lastCol + 2)\n dp1 = [1_000_000_000_000] * (lastCol + 2)\n\n dp0[lastCol] = 1\n dp1[lastCol + 1] = 1\n\n for row in range(lastRow, -1, -1):\n for col in range(lastCol, -1, -1):\n dp1[col] = max(1, min(dp0[col], dp1[col + 1]) - dungeon[row][col])\n dp0, dp1 = dp1, dp0\n for i in range(lastCol + 2):\n dp1[i] = 1_000_000_000_000\n return dp0[0]","runtime":"53"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n if not dungeon or not dungeon[0]:\n return 1\n \n m, n = len(dungeon), len(dungeon[0])\n \n # Initialize DP table with a large number\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\n # The princess needs at least 1 health to be rescued\n dp[m][n-1] = dp[m-1][n] = 1\n \n # Fill the DP table from bottom-right to top-left\n for i in range(m - 1, -1, -1):\n for j in range(n - 1, -1, -1):\n # Minimum health needed to enter this cell\n minHealth = min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j]\n # Health should not be less than 1\n dp[i][j] = max(1, minHealth)\n \n # The top-left cell gives us the answer\n return dp[0][0]\n\n# Test the solution\nsolution = Solution()\ndungeon = [[-2,-3,3],[-5,-10,1],[10,30,-5]]\nprint(solution.calculateMinimumHP(dungeon)) # Should print 7","runtime":"54"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n # Initialize the dp table with infinity\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\n dp[m][n - 1] = dp[m - 1][n] = 1 # set the health needed at the princess's cell\n \n # Traverse the dungeon from bottom-right to top-left\n for i in range(m - 1, -1, -1):\n for j in range(n - 1, -1, -1):\n min_health_needed = min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j]\n dp[i][j] = max(min_health_needed, 1)\n \n return dp[0][0]","runtime":"55"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n \n # Initialize the dp table with positive infinity\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\n \n # Base case: minimum health required at the princess's cell\n dp[m][n - 1] = 1\n dp[m - 1][n] = 1\n \n # Fill the dp table\n for i in range(m - 1, -1, -1):\n for j in range(n - 1, -1, -1):\n min_health_required = min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j]\n dp[i][j] = max(1, min_health_required)\n \n return dp[0][0]\n\n# Example usage:\nsolution = Solution()\ndungeon = [[-2, -3, 3], [-5, -10, 1], [10, 30, -5]]\nprint(solution.calculateMinimumHP(dungeon)) # Output: 7","runtime":"56"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n \n # Initialize the DP table with positive infinity\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\n \n # Base case: To survive at the princess cell, the knight needs at least 1 health point\n dp[m][n - 1] = dp[m - 1][n] = 1\n \n # Fill the DP table from bottom-right to top-left\n for i in range(m - 1, -1, -1):\n for j in range(n - 1, -1, -1):\n dp[i][j] = max(min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j], 1)\n \n return dp[0][0]\n\n# Example usage:\nsolution = Solution()\ndungeon = [[-2, -3, 3], [-5, -10, 1], [10, 30, -5]]\nprint(solution.calculateMinimumHP(dungeon)) # Output: 7","runtime":"56"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n \n m=len(dungeon)\n n=len(dungeon[0])\n dp=[[float('inf')]*(n+1) for i in range(m+1)]\n dp[m][n-1]=dp[m-1][n]=1\n min_health=1\n for i in range(m-1,-1,-1):\n for j in range(n-1,-1,-1):\n min_health=min(dp[i][j+1],dp[i+1][j])\n dp[i][j]=max(1,min_health-dungeon[i][j])\n return dp[0][0]\n \n \n \n","runtime":"57"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n\n @cache \n def min_health(i, j):\n if i >= m or j >= n:\n return float('inf')\n \n if i == m - 1 and j == n - 1:\n return max(1, 1 - dungeon[i][j])\n \n right = min_health(i, j + 1)\n down = min_health(i + 1, j)\n min_health_needed = min(right, down) - dungeon[i][j]\n return max(1, min_health_needed)\n \n return min_health(0, 0)\n","runtime":"58"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n \n # Create a dp table of size m x n\n dp = [[float('inf')] * n for _ in range(m)]\n \n # Base case: health needed at the bottom-right corner\n dp[m-1][n-1] = max(1, 1 - dungeon[m-1][n-1])\n \n # Fill the last row (moving right)\n for j in range(n-2, -1, -1):\n dp[m-1][j] = max(1, dp[m-1][j+1] - dungeon[m-1][j])\n \n # Fill the last column (moving down)\n for i in range(m-2, -1, -1):\n dp[i][n-1] = max(1, dp[i+1][n-1] - dungeon[i][n-1])\n \n # Fill the rest of the dp table\n for i in range(m-2, -1, -1):\n for j in range(n-2, -1, -1):\n min_health_on_exit = min(dp[i+1][j], dp[i][j+1])\n dp[i][j] = max(1, min_health_on_exit - dungeon[i][j])\n \n # The answer is the minimum initial health needed at the top-left corner\n return dp[0][0]\n","runtime":"58"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n\n m, n = len(dungeon), len(dungeon[0])\n\n dp = [[0 for _ in range(n+1)] for _ in range(m+1)]\n\n def minPath():\n for i in range(m - 1, -1, -1):\n for j in range(n - 1, -1, -1):\n if i == m - 1 and j == n - 1:\n dp[i][j] = 1 + max(0, - dungeon[i][j])\n else:\n val_h = 1e10 if i + 1 > m - 1 else dp[i + 1][j]\n val_v = 1e10 if j + 1 > n - 1 else dp[i][j + 1]\n dp[i][j] = max(1, - dungeon[i][j] + min(val_h, val_v))\n\n return dp[0][0]\n\n return minPath()\n\n \n\n ","runtime":"59"},{"code":"class Solution:\n def calculateMinimumHP(self, grid: List[List[int]]) -> int:\n INF = float('inf')\n rows = len(grid)\n cols = len(grid[0])\n if rows == 1 and cols == 1:\n if grid[0][0] >= 0:\n return 1\n return -grid[0][0] + 1\n dp = [[INF] * cols for i in range(rows)]\n dp[rows - 1][cols - 1] = max(1, 1 - grid[rows - 1][cols - 1])\n for r in range(rows-2,-1,-1):\n dp[r][cols-1] = max(1, dp[r + 1][cols-1] - grid[r][cols-1])\n for c in range(cols-2,-1,-1):\n dp[rows - 1][c] = max(1, dp[rows - 1][c + 1] - grid[rows - 1][c])\n for r in range(rows - 2, -1 , -1):\n for c in range(cols - 2 , -1 , -1):\n need = min(dp[r + 1][c], dp[r][c + 1])\n dp[r][c] = max(1, need - grid[r][c])\n return dp[0][0]\n ","runtime":"59"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m , n = len(dungeon), len(dungeon[0])\n dp = [[0] * n for _ in range(m)]\n dp[-1][-1] = max(-1 * dungeon[-1][-1], 0)\n for i in range(m-1, -1 , -1):\n for j in range(n-1, -1, -1):\n if i < m-1 and j < n-1:\n dp[i][j] = -1 * min(dungeon[i][j]-min(dp[i+1][j], dp[i][j+1]), 0)\n if i == m-1 and j < n-1:\n dp[i][j] = -1 * min(dungeon[i][j]- dp[i][j+1], 0) \n continue\n if i < m-1 and j == n-1: \n dp[i][j] = -1 * min(dungeon[i][j]- dp[i+1][j], 0) \n continue\n return dp[0][0] + 1","runtime":"60"},{"code":"class Solution:\n def calculateMinimumHP(self, grid: List[List[int]]) -> int:\n INF = float('inf')\n rows = len(grid)\n cols = len(grid[0])\n if rows == 1 and cols == 1:\n if grid[0][0] >= 0:\n return 1\n return -grid[0][0] + 1\n dp = [[INF] * cols for i in range(rows)]\n dp[rows - 1][cols - 1] = max(1, 1 - grid[rows - 1][cols - 1])\n for r in range(rows-2,-1,-1):\n dp[r][cols-1] = max(1, dp[r + 1][cols-1] - grid[r][cols-1])\n for c in range(cols-2,-1,-1):\n dp[rows - 1][c] = max(1, dp[rows - 1][c + 1] - grid[rows - 1][c])\n for r in range(rows - 2, -1 , -1):\n for c in range(cols - 2 , -1 , -1):\n need = min(dp[r + 1][c], dp[r][c + 1])\n dp[r][c] = max(1, need - grid[r][c])\n return dp[0][0]\n ","runtime":"60"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n if not dungeon or not dungeon[0]:\n return 0\n rows, cols = len(dungeon), len(dungeon[0])\n a = [[float('inf')] * (cols + 1) for _ in range(rows + 1)]\n a[rows][cols - 1] = a[rows - 1][cols] = 1\n \n for i in range(rows - 1, -1, -1):\n for j in range(cols - 1, -1, -1):\n min_health = min(a[i + 1][j], a[i][j + 1]) - dungeon[i][j]\n a[i][j] = max(min_health, 1)\n \n return a[0][0] \n","runtime":"61"},{"code":"class Solution:\n def calculateMinimumHP(self, grid: List[List[int]]) -> int:\n INF = float('inf')\n rows = len(grid)\n cols = len(grid[0])\n if rows == 1 and cols == 1:\n if grid[0][0] >= 0:\n return 1\n return -grid[0][0] + 1\n dp = [[INF] * cols for i in range(rows)]\n dp[rows - 1][cols - 1] = max(1, 1 - grid[rows - 1][cols - 1])\n for r in range(rows-2,-1,-1):\n dp[r][cols-1] = max(1, dp[r + 1][cols-1] - grid[r][cols-1])\n for c in range(cols-2,-1,-1):\n dp[rows - 1][c] = max(1, dp[rows - 1][c + 1] - grid[rows - 1][c])\n for r in range(rows - 2, -1 , -1):\n for c in range(cols - 2 , -1 , -1):\n need = min(dp[r + 1][c], dp[r][c + 1])\n dp[r][c] = max(1, need - grid[r][c])\n return dp[0][0]\n ","runtime":"62"},{"code":"from typing import List\n\nclass Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n \n m = len(dungeon)\n n = len(dungeon[0])\n \n # Initialize memoization table with None (for uncalculated states)\n memo = [[None] * n for _ in range(m)]\n \n # Define the recursive function with memoization\n def solve(i, j):\n # If we go out of bounds, return a very large number (invalid path)\n if i >= m or j >= n:\n return float('inf')\n \n # If we are at the bottom-right cell, calculate the minimum health\n if i == m - 1 and j == n - 1:\n return max(1, 1 - dungeon[i][j])\n \n # If the result has already been computed, return it\n if memo[i][j] is not None:\n return memo[i][j]\n \n # Recursively calculate the minimum health needed by moving right or down\n right = solve(i, j + 1)\n down = solve(i + 1, j)\n \n # Choose the path that requires less health\n min_health_on_exit = min(right, down)\n \n # Calculate the minimum health needed to enter the current cell\n memo[i][j] = max(1, min_health_on_exit - dungeon[i][j])\n \n return memo[i][j]\n \n # Start the recursion from the top-left corner\n return solve(0, 0)\n","runtime":"63"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m , n = len(dungeon), len(dungeon[0])\n dp = [[0] * n for _ in range(m)]\n dp[-1][-1] = max(-1 * dungeon[-1][-1], 0)\n for i in range(m-1, -1 , -1):\n for j in range(n-1, -1, -1):\n if i < m-1 and j < n-1:\n dp[i][j] = -1 * min(dungeon[i][j]-min(dp[i+1][j], dp[i][j+1]), 0)\n if i == m-1 and j < n-1:\n dp[i][j] = -1 * min(dungeon[i][j]- dp[i][j+1], 0) \n continue\n if i < m-1 and j == n-1: \n dp[i][j] = -1 * min(dungeon[i][j]- dp[i+1][j], 0) \n return dp[0][0] + 1","runtime":"64"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n # Create a DP table with extra row and column filled with infinity\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\n # The knight needs at least 1 health point to reach the princess\n dp[m][n - 1] = dp[m - 1][n] = 1\n\n # Iterate from bottom-right to top-left\n for i in reversed(range(m)):\n for j in reversed(range(n)):\n # Minimum health needed to move to the next cell\n min_health = min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j]\n # Ensure the knight's health is at least 1\n dp[i][j] = max(min_health, 1)\n\n return dp[0][0]\n ","runtime":"65"},{"code":"# f(i, j) = max(1, -dungeon[i][j] + min(f(i+1, j), f(i, j+1)))\n# base case : if i == n-1. and j == m-1, return max(1, -dungeon[n-1][m-1] + 1)\n# return f(0, 0)\n\nclass Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n n, m = len(dungeon), len(dungeon[0])\n dp = [[-1 for j in range(m)] for i in range(n)]\n def helper(i, j):\n if i == n-1 and j == m-1:\n return max(1, -dungeon[i][j] + 1)\n if dp[i][j] != -1:\n return dp[i][j]\n count = float('inf')\n if i + 1 < n:\n count = min(count, helper(i+1, j))\n if j + 1 < m:\n count = min(count, helper(i, j+1))\n count = max(1, -dungeon[i][j] + count)\n dp[i][j] = count\n return count\n ans= helper(0, 0)\n return ans\n ","runtime":"66"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n dp = [[float('inf') for _ in range(n+1)] for _ in range(m+1)]\n\n dp[m][n-1] = 1\n dp[m-1][n] = 1\n\n for i in range(m-1, -1, -1):\n for j in range(n-1, -1, -1):\n dp[i][j] = max(1, min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j])\n \n return dp[0][0]","runtime":"66"},{"code":"class Solution:\n def calculateMinimumHP(self, d: List[List[int]]) -> int:\n m=len(d)\n n=len(d[0])\n dp=[[0]*n for _ in range(m)]\n #base case \n if d[m-1][n-1]<0:\n dp[m-1][n-1]=abs(d[m-1][n-1])+1\n else:\n dp[m-1][n-1]=1\n for i in range(m-1,-1,-1):\n for j in range(n-1,-1,-1):\n if i==m-1 and j==n-1:\n continue\n if i==m-1:\n if d[i][j]>0:\n if d[i][j]>=dp[i][j+1]:\n dp[i][j]=1\n else:\n dp[i][j]=dp[i][j+1]-d[i][j]\n else:\n dp[i][j]= abs(d[i][j])+dp[i][j+1]\n if j==n-1:\n if d[i][j]>0:\n if d[i][j]>=dp[i+1][j]:\n dp[i][j]=1\n else:\n dp[i][j]=dp[i+1][j]-d[i][j]\n else:\n dp[i][j]= abs(d[i][j])+dp[i+1][j]\n elif i<m-1 and j<n-1:\n mini=min(dp[i][j+1],dp[i+1][j])\n if d[i][j]<=0:\n dp[i][j]=abs(d[i][j])+mini\n else:\n if d[i][j]<mini:\n dp[i][j]=mini-d[i][j]\n else:\n dp[i][j]=1 \n return dp[0][0]\n\n \n ","runtime":"67"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n dp = [[1e9]*n for _ in range(m)]\n \n for i in range(m-1, -1, -1):\n for j in range(n-1, -1,-1):\n if i==m-1 and j==n-1:\n dp[i][j] = -dungeon[i][j]+1 if dungeon[i][j]<0 else 1\n continue\n elif j+1>n-1:\n res = dp[i+1][j]- dungeon[i][j]\n elif i+1>m-1:\n res = dp[i][j+1]- dungeon[i][j]\n else:\n res = min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j]\n dp[i][j] = res if res >0 else 1\n return dp[0][0] if dp[0][0]>0 else 1\n\n ","runtime":"68"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n \n # Create DP table with an extra row and column\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\n \n # Set the \"goal\" cell\n dp[m][n-1] = dp[m-1][n] = 1\n \n # Fill the DP table from bottom-right to top-left\n for i in range(m - 1, -1, -1):\n for j in range(n - 1, -1, -1):\n dp[i][j] = max(1, min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j])\n \n return dp[0][0]","runtime":"68"},{"code":"from collections import deque\nclass Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m,n=len(dungeon),len(dungeon[0])\n dp=[[float('inf')]*(n+1) for _ in range(m+1)]\n dp[m][n-1]=dp[m-1][n]=1\n for i in range(m-1,-1,-1):\n for j in range(n-1,-1,-1):\n mh=min(dp[i+1][j],dp[i][j+1])-dungeon[i][j]\n dp[i][j]=max(mh,1)\n return dp[0][0]","runtime":"69"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n\n # Top left corner is (0,0)\n #Top bottom corner is (len(matrix)-1, len(matrix[0]-1))\n # every time we move right or down? how I will be at the next tile\n # health drops or increase \n # Let's say I inittially start with health zero \n # I drop at -2, move downward or right ---> I want to see which step to take\n #based on the current state\n # So something like A*, where you can check all the routes but take the one \n # with minimum ---> doing a BFS\n # directions are [(0, 1), (1, 0)]\n # start and end for bfs\n # I just need to do the minimum path\n rows, cols = len(dungeon), len(dungeon[0])\n \n # This will store the minimum initial health needed at each room to survive\n memo = {}\n\n # Backtracking function to compute minimum health needed from current position\n def backtrack(r, c):\n # If we are out of bounds, return a large number (invalid path)\n if r >= rows or c >= cols:\n return float('inf')\n\n # Base case: when we reach the princess (bottom-right corner)\n if r == rows - 1 and c == cols - 1:\n return max(1, 1 - dungeon[r][c])\n\n # Check if we've already computed the minimum health for this position\n if (r, c) in memo:\n return memo[(r, c)]\n\n # Recur for both possible moves: right and down\n health_needed_right = backtrack(r, c + 1)\n health_needed_down = backtrack(r + 1, c)\n\n # Choose the better of the two moves\n min_health_on_exit = min(health_needed_right, health_needed_down)\n\n # Calculate the minimum health required at this room\n min_health_required = max(1, min_health_on_exit - dungeon[r][c])\n\n # Memorize the result for future lookups\n memo[(r, c)] = min_health_required\n\n return min_health_required\n\n # Start the backtracking from the top-left corner\n return backtrack(0, 0)","runtime":"70"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n lastRow = len(dungeon) - 1\n lastCol = len(dungeon[0]) - 1\n \n\n dp0 = [1_000_000_000_000] * (lastCol + 2)\n dp1 = [1_000_000_000_000] * (lastCol + 2)\n\n dp0[lastCol] = 1\n dp1[lastCol + 1] = 1\n\n for row in range(lastRow, -1, -1):\n for col in range(lastCol, -1, -1):\n minHealth = min(dp0[col], dp1[col + 1]) - dungeon[row][col]\n dp1[col] = max(1, minHealth)\n dp0, dp1 = dp1, dp0\n for i in range(lastCol + 2):\n dp1[i] = 1_000_000_000_000\n return dp0[0]","runtime":"70"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n dp = [[float('inf') for _ in range(n+1)] for _ in range(m+1)]\n\n dp[m][n-1] = 1\n dp[m-1][n] = 1\n\n for i in range(m-1, -1, -1):\n for j in range(n-1, -1, -1):\n dp[i][j] = max(1, min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j])\n \n return dp[0][0]","runtime":"71"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n dp = [[1e9]*n for _ in range(m)]\n \n for i in range(m-1, -1, -1):\n for j in range(n-1, -1,-1):\n if i==m-1 and j==n-1:\n dp[i][j] = -dungeon[i][j]+1 if dungeon[i][j]<0 else 1\n continue\n right = dp[i][j + 1] if j < n - 1 else float('inf')\n down = dp[i + 1][j] if i < m - 1 else float('inf')\n dp[i][j] = max(1, min(right, down) - dungeon[i][j])\n return dp[0][0] if dp[0][0]>0 else 1\n\n ","runtime":"72"},{"code":"class Solution:\n def calculateMinimumHP(self, grid: List[List[int]]) -> int:\n INF = float('inf')\n rows = len(grid)\n cols = len(grid[0])\n if rows == 1 and cols == 1:\n if grid[0][0] >= 0:\n return 1\n return -grid[0][0] + 1\n dp = [[INF] * cols for i in range(rows)]\n dp[rows - 1][cols - 1] = max(1, 1 - grid[rows - 1][cols - 1])\n for r in range(rows-2,-1,-1):\n dp[r][cols-1] = max(1, dp[r + 1][cols-1] - grid[r][cols-1])\n for c in range(cols-2,-1,-1):\n dp[rows - 1][c] = max(1, dp[rows - 1][c + 1] - grid[rows - 1][c])\n for r in range(rows - 2, -1 , -1):\n for c in range(cols - 2 , -1 , -1):\n need = min(dp[r + 1][c], dp[r][c + 1])\n dp[r][c] = max(1, need - grid[r][c])\n return dp[0][0]\n ","runtime":"73"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n \n \n m, n = len(dungeon), len(dungeon[0])\n memo = {}\n \n def dfs(i, j):\n # Base case: out of bounds\n if i == m or j == n:\n return float('inf')\n \n # Reached the princess\n if i == m - 1 and j == n - 1:\n return max(1, 1 - dungeon[i][j])\n \n # Check if we've already calculated this\n if (i, j) in memo:\n return memo[(i, j)]\n \n # Recursive case: go right or down\n right = dfs(i, j + 1)\n down = dfs(i + 1, j)\n \n min_health = min(right, down) - dungeon[i][j]\n memo[(i, j)] = max(1, min_health)\n return memo[(i, j)]\n \n return dfs(0, 0)","runtime":"74"},{"code":"# f(i, j) = max(1, -dungeon[i][j] + min(f(i+1, j), f(i, j+1)))\n# base case : if i == n-1. and j == m-1, return max(1, -dungeon[n-1][m-1] + 1)\n# return f(0, 0)\n\nclass Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n n, m = len(dungeon), len(dungeon[0])\n dp = [[-1 for j in range(m)] for i in range(n)]\n def helper(i, j):\n if i == n-1 and j == m-1:\n return max(1, -dungeon[i][j] + 1)\n if dp[i][j] != -1:\n return dp[i][j]\n count = float('inf')\n if i + 1 < n:\n count = min(count, helper(i+1, j))\n if j + 1 < m:\n count = min(count, helper(i, j+1))\n count = max(1, -dungeon[i][j] + count)\n dp[i][j] = count\n return count\n ans= helper(0, 0)\n return ans\n ","runtime":"75"},{"code":"\n\nclass Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n n, m = len(dungeon), len(dungeon[0])\n dp = [[-1 for j in range(m)] for i in range(n)]\n def helper(i, j):\n if i == n-1 and j == m-1:\n return 1\n if dp[i][j] != -1:\n return dp[i][j]\n count = float('inf')\n if i + 1 < n:\n count = min(count, -dungeon[i+1][j] + helper(i+1, j))\n if j + 1 < m:\n count = min(count, -dungeon[i][j+1] + helper(i, j+1))\n count = max(1, count)\n dp[i][j] = count\n return count\n return max(1, helper(0, 0) - dungeon[0][0])\n ","runtime":"76"},{"code":"\n\nclass Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n n, m = len(dungeon), len(dungeon[0])\n dp = [[-1 for j in range(m)] for i in range(n)]\n def helper(i, j):\n if i == n-1 and j == m-1:\n return 1\n if dp[i][j] != -1:\n return dp[i][j]\n count = float('inf')\n if i + 1 < n:\n count = min(count, -dungeon[i+1][j] + helper(i+1, j))\n if j + 1 < m:\n count = min(count, -dungeon[i][j+1] + helper(i, j+1))\n count = max(1, count)\n dp[i][j] = count\n return count\n return max(1, helper(0, 0) - dungeon[0][0])\n ","runtime":"77"},{"code":"class Solution:\n def calculateMinimumHPDP(self, dungeon, DP, health, i, j):\n if DP[i][j] is not None:\n return DP[i][j]\n\n m = len(dungeon)\n n = len(dungeon[0])\n\n if i == m - 1 and j == n - 1:\n DP[i][j] = min(health[i][j], 0)\n elif i == m - 1:\n DP[i][j] = min(self.calculateMinimumHPDP(dungeon, DP, health, i, j+1) + dungeon[i][j], 0)\n elif j == n - 1:\n DP[i][j] = min(self.calculateMinimumHPDP(dungeon, DP, health, i+1, j) + dungeon[i][j], 0)\n else:\n DP[i][j] = min(max(self.calculateMinimumHPDP(dungeon, DP, health, i, j+1),\n self.calculateMinimumHPDP(dungeon, DP, health, i+1, j)) + dungeon[i][j], 0)\n return DP[i][j]\n\n def computeMinHealth(self, dungeon):\n m = len(dungeon)\n n = len(dungeon[0])\n health = [[None for _ in range(n)] for _ in range(m)]\n\n for i in range(m):\n for j in range(n):\n ind_i = m - i - 1\n ind_j = n - j - 1\n if ind_i == m - 1 and ind_j == n - 1:\n health[ind_i][ind_j] = dungeon[ind_i][ind_j]\n elif ind_i == m - 1:\n health[ind_i][ind_j] = min(dungeon[ind_i][ind_j], dungeon[ind_i][ind_j] + health[ind_i][ind_j+1])\n elif ind_j == n - 1:\n health[ind_i][ind_j] = min(dungeon[ind_i][ind_j], dungeon[ind_i][ind_j] + health[ind_i + 1][ind_j])\n else:\n health[ind_i][ind_j] = min(dungeon[ind_i][ind_j],\n dungeon[ind_i][ind_j] + min(health[ind_i][ind_j + 1], health[ind_i + 1][ind_j])\n )\n return health\n\n def calculateMinimumHP(self, dungeon):\n m = len(dungeon)\n n = len(dungeon[0])\n DP = [[None for _ in range(n)] for _ in range(m)]\n health = self.computeMinHealth(dungeon)\n min_hp = self.calculateMinimumHPDP(dungeon, DP, health,0, 0)\n min_hp = min(0, min_hp)\n return -min_hp + 1\n ","runtime":"78"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n\n\n\n for row in reversed(range(len(dungeon))):\n \n for col in reversed(range(len(dungeon[0]))):\n \n if col == len(dungeon[0]) - 1:\n if row < len(dungeon) - 1:\n dungeon[row][col] = min(dungeon[row][col], dungeon[row][col] + dungeon[row + 1][col])\n continue\n elif row == len(dungeon) - 1:\n #print(f'{row=} {col=}')\n dungeon[row][col] = min(dungeon[row][col], dungeon[row][col] + dungeon[row][col + 1])\n continue\n\n path_d = min(dungeon[row][col], dungeon[row][col] + dungeon[row + 1][col])\n path_r = min(dungeon[row][col], dungeon[row][col] + dungeon[row][col + 1])\n dungeon[row][col] = max(path_r, path_d)\n \n if dungeon[0][0] >= 0:\n return 1\n \n return abs(dungeon[0][0]) + 1\n\n\n ","runtime":"79"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n \n @lru_cache(None)\n def dp(i, j):\n if i >= len(dungeon) or j >= len(dungeon[0]): return float('inf')\n if i == len(dungeon)-1 and j == len(dungeon[0])-1: return max(1, 1- dungeon[i][j])\n return max(1, - dungeon[i][j] + min(dp(i, j+1), dp(i+1, j)))\n \n return dp(0,0)\n\n ","runtime":"80"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n\n memo = {}\n directions = [(1,0), (0, 1)]\n\n def backTrack(r, c):\n if r == len(dungeon) - 1 and c == len(dungeon[0]) - 1:\n return max(1, 1 - dungeon[r][c])\n\n if (r, c) in memo:\n return memo[(r, c)]\n \n min_health_next_step = float('inf')\n \n for dx, dy in directions:\n r2, c2 = r + dx, c + dy\n if 0 <= r2 < len(dungeon) and 0 <= c2 < len(dungeon[0]):\n min_health_next_step = min(min_health_next_step, backTrack(r2, c2))\n\n \n min_health_required = max(1, min_health_next_step - dungeon[r][c])\n\n \n memo[(r, c)] = min_health_required\n\n return min_health_required\n \n return backTrack(0, 0)\n\n","runtime":"80"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n r = len(dungeon)\n c = len(dungeon[0])\n d = dungeon\n @cache\n def help(i=0, j=0):\n if i+1 == r and j+1 == c:\n return 1 if d[i][j] > 0 else -1 * d[i][j] + 1\n if(i == r or j == c):\n return 9999999999\n\n down = help(i+1, j)\n right = help(i, j+1)\n\n minHealth = min(down, right) - d[i][j]\n\n return 1 if minHealth <= 0 else minHealth\n\n return help()","runtime":"81"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n \"\"\"\n 7:14\n\n DP\n O(nm)\n \"\"\"\n self.dungeon = dungeon\n self.height = len(dungeon)\n self.width = len(dungeon[0])\n return self.calculateMinimumHPHelper(0,0,{})\n # return max((-options[1][1]) + 1, 1)\n\n def calculateMinimumHPHelper(self, i, j, memo):\n \"\"\"\n memo will store - \n\n the minimum hp we need from this point forward\n which will be at least 1\n\n \"\"\"\n key = (i,j)\n if key in memo:\n return memo[key]\n\n if i >= self.height:\n return float(\"inf\")\n if j >= self.width:\n return float(\"inf\")\n\n val = self.dungeon[i][j]\n if i == self.height-1 and j == self.width-1:\n memo[key] = max(-val+1, 1)\n return memo[key]\n \n right = self.calculateMinimumHPHelper(i, j+1, memo)\n down = self.calculateMinimumHPHelper(i+1, j, memo)\n memo[key] = max(1, min(right, down)-val)\n return memo[key]\n\n # def calculateMinimumHPHelper(self, i, j, memo):\n # \"\"\"\n # memo will store two tuples\n # (\n # (best_current_health, corresponding_worst_health_in_path)\n # (current_health, best_corresponding_worst_health_in_path)\n # )\n # the best health loss from this point forward and the \n # worst health loss along the best path forward\n # \"\"\"\n # key = (i,j)\n # if key in memo:\n # return memo[key]\n \n # if i >= self.height:\n # return [(-float(\"inf\"), -float(\"inf\")), (-float(\"inf\"), -float(\"inf\"))]\n # if j >= self.width:\n # return [(-float(\"inf\"), -float(\"inf\")), (-float(\"inf\"), -float(\"inf\"))]\n \n # val = self.dungeon[i][j]\n # if i == self.height-1 and j == self.width-1:\n # memo[key] = [(val, val), (val, val)]\n # return memo[key]\n\n # possibilities = []\n # possibilities.extend(self.calculateMinimumHPHelper(i, j+1, memo))\n # possibilities.extend(self.calculateMinimumHPHelper(i+1, j, memo))\n\n # options = []\n # for [curr, worst] in possibilities:\n # options.append((min(val, val+curr), min(val+curr, val, worst)))\n # # print(\"Here options\", i, j, options)\n # options.sort(key=lambda x: x[0])\n # best_curr = options[-1]\n\n # options.sort(key=lambda x: x[1])\n # best_worst = options[-1]\n # memo[key] = (best_curr, best_worst)\n \n\n # # if i == self.height-1:\n # # right_curr, right_worst = self.calculateMinimumHPHelper(i, j+1, memo)\n # # new_curr = self.dungeon[i][j] + right_curr\n # # memo[key] = new_curr, min(new_curr, right_worst)\n # # return memo[key]\n # # if j == self.width-1:\n # # down_curr, down_worst = self.calculateMinimumHPHelper(i, j+1, memo)\n # # memo[key] = self.dungeon[i][j] + self.calculateMinimumHPHelper(i+1, j, memo)\n # # return memo[key]\n # # right = self.dungeon[i][j] + self.calculateMinimumHPHelper(i, j+1, memo)\n # # down = self.dungeon[i][j] + self.calculateMinimumHPHelper(i+1, j, memo)\n # # memo[key] = max(right, down)\n # return memo[key]\n \n \n\n ","runtime":"82"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n n, m = len(dungeon), len(dungeon[0])\n storage = [[1 for _ in range(m)] for _ in range(n)]\n storage[-1][-1] = min(dungeon[-1][-1], 0)\n stack = [(n - 1, m - 1)]\n def get_dependency(a, b):\n res = []\n if a + 1 < n:\n res.append((a + 1, b))\n if b + 1 < m:\n res.append((a, b + 1))\n return res\n def is_ready(a, b):\n if a + 1 < n and storage[a + 1][b] == 1:\n return False\n if b + 1 < m and storage[a][b + 1] == 1:\n return False\n return True\n def is_visited(a, b):\n return storage[a][b] != 1\n def get_next(a, b):\n res = []\n if a - 1 >= 0 and is_ready(a - 1, b) and not is_visited(a - 1, b):\n res.append((a - 1, b))\n if b - 1 >= 0 and is_ready(a, b - 1) and not is_visited(a, b - 1):\n res.append((a, b - 1))\n return res\n while stack:\n cur = stack[-1]\n stack = stack[:-1]\n candidates = get_next(*cur)\n for cand in candidates:\n a, b = cand\n dependencies = get_dependency(a, b)\n smallest_damage = -1 * 10 ** 9\n for dep in dependencies:\n c, d = dep\n smallest_damage = max(storage[c][d], smallest_damage)\n if storage[c][d] > smallest_damage:\n smallest_damage = storage[c][d]\n cand_damage = min(smallest_damage, 0) + dungeon[a][b]\n storage[a][b] = min(cand_damage, 0)\n stack.append(cand)\n return 1 + storage[0][0] * -1","runtime":"83"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n memo = {}\n\n def minimumHealth(i, j) -> int:\n if i >= len(dungeon) or j >= len(dungeon[0]):\n return None\n\n if (i, j) in memo:\n return memo[(i, j)]\n\n down = minimumHealth(i + 1, j)\n right = minimumHealth(i, j + 1)\n\n if down and right:\n minPath = min(down, right)\n\n elif down:\n minPath = down\n\n elif right:\n minPath = right\n\n else: # at the end\n if dungeon[i][j] >= 0:\n memo[(i, j)] = 1\n\n else:\n memo[(i, j)] = dungeon[i][j] * -1 + 1\n \n return memo[(i, j)]\n \n memo[(i, j)] = max(minPath - dungeon[i][j], 1)\n return memo[(i, j)]\n\n return minimumHealth(0, 0)\n\n \n","runtime":"84"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n\n n = len(dungeon)\n m = len(dungeon[0])\n\n h = {}\n\n\n def dfs(i, j, val, minVal):\n\n if i == n-1 and j == m-1:\n return dungeon[i][j]\n\n key = (i, j)\n\n if key in h:\n return h[key]\n \n res = float('-inf')\n\n if i + 1 < n:\n res = max(res, dfs(i+1, j, val, minVal))\n \n if j + 1 < m:\n res = max(res, dfs(i, j+1, val, minVal))\n \n h[key] = min(res + dungeon[i][j], dungeon[i][j])\n return h[key]\n \n \n\n res = dfs(0, 0, 0, 1)\n\n if res > 0:\n return 1\n\n return abs(res) + 1\n\n ","runtime":"85"},{"code":"# f(i, j) = max(1, -dungeon[i][j] + min(f(i+1, j), f(i, j+1)))\n# base case : if i == n-1. and j == m-1, return max(1, -dungeon[n-1][m-1] + 1)\n# return f(0, 0)\n\nclass Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n n, m = len(dungeon), len(dungeon[0])\n dp = [[-1 for j in range(m)] for i in range(n)]\n def helper(i, j):\n if i == n-1 and j == m-1:\n return max(1, -dungeon[i][j] + 1)\n if dp[i][j] != -1:\n return dp[i][j]\n count = float('inf')\n if i + 1 < n:\n count = min(count, helper(i+1, j))\n if j + 1 < m:\n count = min(count, helper(i, j+1))\n count = max(1, -dungeon[i][j] + count)\n dp[i][j] = count\n return count\n ans= helper(0, 0)\n return ans\n ","runtime":"86"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n n, m = len(dungeon), len(dungeon[0])\n\n # dp = [ [ 0 for _ in range(m) ] for _ in range(n) ]\n # dp = 1 if dungeon[0][0] > 0 else abs(dungeon[0][0]) + 1\n # for i in range(1, m):\n # dungeon[0][i] = (1, dungeon[0][i - 1] + (1 - dunfeon[0][i])\n # for i in range(1, m):\n # dungeon[i] += dungeon[i - 1]\n \n # for i in range(1, n):\n # for j in range(1, m):\n\n @cache\n def dp(row, col):\n print(row, col)\n if row == n - 1 and col == m - 1:\n return 1 if dungeon[row][col] > 0 else abs(dungeon[row][col]) + 1\n left = float(\"inf\") if col >= m - 1 else dp(row, col + 1)\n bottom = float(\"inf\") if row >= n - 1 else dp(row + 1, col)\n \n return min( max(1, left - dungeon[row][col]), max(1, bottom - dungeon[row][col]) )\n return dp(0, 0)\n\n ","runtime":"87"},{"code":"class Solution:\n def calculateMinimumHP(self, arr: List[List[int]]) -> int:\n n = len(arr)\n m = len(arr[0])\n def solve(idx1, idx2, cache):\n if idx1 >= n or idx2 >= m:\n return float('inf')\n if idx1 == n-1 and idx2 == m-1:\n return 1 if arr[-1][-1] >= 0 else -arr[-1][-1] + 1\n \n if (idx1, idx2) in cache:\n return cache[(idx1, idx2)]\n \n option1 = solve(idx1 + 1, idx2, cache)\n option2 = solve(idx1, idx2 + 1, cache)\n cache[(idx1, idx2)] = min(option1, option2) - arr[idx1][idx2]\n if cache[(idx1, idx2)] <= 0:\n cache[(idx1, idx2)] = 1\n return cache[(idx1, idx2)]\n cache = {}\n res = solve(0, 0, cache)\n print(cache)\n return res","runtime":"88"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n\n n = len(dungeon)\n m = len(dungeon[0])\n\n h = {}\n\n\n def dfs(i, j, val, minVal):\n\n if i == n-1 and j == m-1:\n return dungeon[i][j]\n\n key = (i, j)\n\n if key in h:\n return h[key]\n \n res = float('-inf')\n\n if i + 1 < n:\n res = max(res, dfs(i+1, j, val, minVal))\n \n if j + 1 < m:\n res = max(res, dfs(i, j+1, val, minVal))\n \n h[key] = min(res + dungeon[i][j], dungeon[i][j])\n return h[key]\n \n \n\n res = dfs(0, 0, 0, 1)\n\n if res > 0:\n return 1\n\n return abs(res) + 1\n\n ","runtime":"91"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n atLeast = [[0 for i in range(len(dungeon[0]))] for j in range(len(dungeon))]\n\n for i in range(len(dungeon)-1, -1, -1):\n for j in range(len(dungeon[0])-1, -1, -1):\n if i == len(dungeon) - 1 and j == len(dungeon[0]) - 1:\n atLeast[i][j] = max(1, (-1)*dungeon[i][j]+1)\n else:\n atLeast[i][j] = max(1, (-1)*dungeon[i][j]+1)\n if i >= len(dungeon)-1:\n atLeast[i][j] = max(atLeast[i][j], (-1)*dungeon[i][j] + atLeast[i][j+1])\n elif j >= len(dungeon[0])-1:\n atLeast[i][j] = max(atLeast[i][j], (-1)*dungeon[i][j] + atLeast[i+1][j])\n else:\n atLeast[i][j] = max(atLeast[i][j], min((-1)*dungeon[i][j] + atLeast[i][j+1], (-1)*dungeon[i][j] + atLeast[i+1][j]))\n print(i, j, atLeast[i][j])\n \n return atLeast[0][0]","runtime":"93"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n dp = [[float('inf') for _ in range(n+1)] for _ in range(m+1)]\n for i in range(m-1,-1,-1):\n for j in range(n-1,-1,-1):\n if i == m-1 and j == n-1:\n print(\"1:\")\n print(i, j)\n require = 0\n elif j == n-1:\n print(\"2:\")\n print(i, j) \n require = max(dp[i+1][j], 0)\n \n elif i == m-1:\n print(\"3:\")\n print(i, j)\n require = max(dp[i][j+1], 0)\n else:\n print(\"4:\")\n print(i, j) \n require = max(min(dp[i+1][j], dp[i][j+1]),0)\n \n print(require)\n if dungeon[i][j] >= 0:\n dp[i][j] = max(require - dungeon[i][j], 1)\n else:\n dp[i][j] = max(require - dungeon[i][j], -dungeon[i][j] + 1)\n return dp[0][0]","runtime":"94"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m = len(dungeon)\n n = len(dungeon[0])\n \n pq = [(max(1, 1 - dungeon[-1][-1]), m - 1, n - 1)]\n dist = [[float('inf')] * n for _ in range(m)]\n dist[-1][-1] = max(1, 1 - dungeon[-1][-1])\n directions = [(-1, 0), (0, -1)]\n \n while pq:\n curr, x, y = heapq.heappop(pq)\n for dx, dy in directions:\n nx, ny = x + dx, y + dy\n if 0 <= nx < m and 0 <= ny < n:\n req = max(1, curr - dungeon[nx][ny])\n if req < dist[nx][ny]:\n dist[nx][ny] = req\n heapq.heappush(pq, (req, nx, ny))\n return dist[0][0]\n\n","runtime":"95"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n directions = [(-1,0), (0,-1)]\n # dp[(x,y)] = [lowest health needed to get from (x,y) to end]\n dp = {(len(dungeon)-1,len(dungeon[0])-1): -dungeon[-1][-1] + 1}\n queue = deque([(len(dungeon)-1,len(dungeon[0])-1)])\n \n for i in range(len(dungeon)-1 + len(dungeon[0])-1):\n new_queue = deque()\n while(queue):\n x,y = queue.popleft()\n for dx,dy in directions:\n if 0 <= x+dx < len(dungeon) and 0 <= y+dy < len(dungeon[x+dx]):\n if (x+dx, y+dy) not in dp:\n dp[(x+dx, y+dy)] = dp[(x,y)] - dungeon[x+dx][y+dy]\n new_queue.append((x+dx,y+dy))\n else:\n dp[(x+dx, y+dy)] = min(dp[(x+dx,y+dy)], dp[(x,y)] - dungeon[x+dx][y+dy])\n for (x,y) in new_queue:\n dp[(x,y)] = max(dp[(x,y)], -dungeon[x][y] + 1)\n queue = new_queue\n print(dp)\n return max(dp[(0,0)], 1)\n \n \n # while queue:\n # new_queue = deque()\n # while(queue):\n # x,y = queue.popleft()\n # for dx,dy in directions:\n # if 0 <= x+dx < len(dungeon) and 0 <= y+dy < len(dungeon[x+dx]):\n # if (x+dx, y+dy) not in dp:\n # dp[(x+dx,y+dy)] = [dp[(x,y)][0] + dungeon[x+dx][y+dy],\n # min(dp[(x,y)][1], dp[(x,y)][0] + dungeon[x+dx][y+dy])]\n # new_queue.append((x+dx,y+dy))\n # else:\n # dp[(x+dx,y+dy)][0] = max(dp[(x+dx,y+dy)][0], dp[(x,y)][0] + dungeon[x+dx][y+dy])\n # new_way = min(dungeon[x][y], dp[(x,y)][0] + dungeon[x+dx][y+dy])\n # dp[(x+dx,y+dy)][1] = max(dp[(x+dx,y+dy)][1], new_way)\n # queue = new_queue\n # print(dp)\n # if dp[(len(dungeon)-1, len(dungeon[0])-1)][1] < 0:\n # return -dp[(len(dungeon)-1, len(dungeon[0])-1)][1] + 1\n # else:\n # return 1\n ","runtime":"96"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n n = len(dungeon)\n m = len(dungeon[0])\n\n dp = [[100**100 for _ in range(m+1)] for _ in range(n+1)]\n print(dp)\n \n for i in range(n-1, -1, -1):\n for j in range(m-1, -1, -1):\n print(i,j)\n if i is n-1 and j is m-1:\n dp[i][j] = max(1, -dungeon[i][j] + 1)\n continue\n dp[i][j] = max(1, min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j])\n return dp[0][0]","runtime":"97"},{"code":"import heapq\nfrom typing import List\n\nclass Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m = len(dungeon)\n n = len(dungeon[0])\n \n pq = [(max(1, 1 - dungeon[-1][-1]), m - 1, n - 1)]\n dist = [[float('inf')] * n for _ in range(m)]\n dist[-1][-1] = max(1, 1 - dungeon[-1][-1])\n directions = [(-1, 0), (0, -1)]\n \n while pq:\n curr_health, x, y = heapq.heappop(pq)\n for dx, dy in directions:\n nx, ny = x + dx, y + dy\n if 0 <= nx < m and 0 <= ny < n:\n req = max(1, curr_health - dungeon[nx][ny])\n if req < dist[nx][ny]:\n dist[nx][ny] = req\n heapq.heappush(pq, (req, nx, ny))\n \n return dist[0][0]\n\n","runtime":"98"},{"code":"from pprint import pprint\nimport heapq\nclass Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n pprint(dungeon)\n\n n,m = len(dungeon), len(dungeon[0]) \n #@cache \n #memo = [[-1] * m for _ in range(n)]\n \n @cache \n def dfs(i,j):\n \n\n if i == n-1 and j == m -1:\n return 1 if dungeon[i][j] >= 0 else -dungeon[i][j] + 1\n \n if i == n or j == m:\n return 10000\n\n res = dungeon[i][j] - min(\n dfs(i,j+1),\n dfs(i+1,j)\n ) \n res = 1 if res >= 0 else -res \n return res \n # memo[i][j] = 1 if res >= 0 else -res \n # return memo[i][j]\n \n return dfs(0,0)\n \n ","runtime":"103"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n n,m=len(dungeon),len(dungeon[0])\n memo=[[-1 for _ in range(201)] for _ in range(201)]\n\n def dp(r,c):\n if r>=n or c>=m:\n return float('inf')\n \n if r==n-1 and c==m-1:\n if dungeon[r][c]<0:\n return 1 - dungeon[r][c]\n return 1\n\n if memo[r][c] == -1:\n val=min(dp(r+1,c),dp(r,c+1))\n\n if dungeon[r][c]>=val:\n memo[r][c]=1\n else:\n memo[r][c]=val - dungeon[r][c]\n\n return memo[r][c]\n\n return dp(0,0)\n","runtime":"116"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n dp = [[list() for _ in range(n)] for _ in range(m)]\n \n def getHealth(health, d):\n h, c = health\n if c + d <= 0:\n return (h + 1 - (c + d), 1)\n else:\n return (h, c + d)\n dp[0][0].append(getHealth((1,1), dungeon[0][0]))\n\n for i in range(1, m):\n dp[i][0].append(getHealth(dp[i-1][0][0], dungeon[i][0]))\n for j in range(1, n):\n dp[0][j].append(getHealth(dp[0][j-1][0], dungeon[0][j]))\n \n for i in range(1, m):\n for j in range(1, n):\n d = dungeon[i][j]\n best = defaultdict(lambda: -math.inf)\n for health in chain(dp[i-1][j], dp[i][j-1]):\n h, c = getHealth(health, d)\n best[h] = max(best[h], c - h)\n h = min(best)\n d = best[h]\n dp[i][j].append((h, h + d))\n for h1, d1 in sorted(best.items())[1:]:\n if d1 > d:\n dp[i][j].append((h1, h1 + d1))\n d = d1\n\n # print(dp)\n return min(dp[m-1][n-1])[0]","runtime":"125"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n\n def check(health):\n dp = dungeon[0][:]\n dp[0] += health\n if dp[0] <= 0:\n return False\n for i in range(1, len(dp)):\n dp[i] += dp[i - 1]\n if dp[i] <= 0:\n dp[i] = -inf\n for r in range(1, m):\n curr = dungeon[r][:]\n for c in range(n):\n if c == 0:\n curr[c] += dp[c]\n else:\n curr[c] += max(dp[c], curr[c - 1])\n if curr[c] <= 0:\n curr[c] = -inf\n dp = curr[:]\n return dp[-1] > 0\n\n left = 1\n right = 1\n for row in dungeon:\n for val in row:\n if val < 0:\n right -= val\n while left <= right:\n mid = (left + right) // 2\n if check(mid):\n right = mid - 1\n else:\n left = mid + 1\n return left\n","runtime":"126"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n left = 0\n right = 0\n m = len(dungeon)\n n = len(dungeon[0])\n print(m, n)\n s = 0\n if m == 1 and n == 1:\n right = abs(dungeon[0][0]) + 1\n else:\n if n > 1:\n for j in range(n):\n s += dungeon[0][j]\n print(s)\n if s <= 0:\n right -= s - 1\n if m > 1:\n for i in range(m):\n s += dungeon[i][n - 1]\n if s <= 0:\n right -= s - 1\n INF = -100000000\n val = 0\n print(right)\n while left <= right:\n mid = (left + right) // 2\n F = [ [0] * n for i in range(m)]\n F[0][0] = mid + dungeon[0][0]\n if F[0][0] <= 0:\n left = mid + 1\n else:\n for i in range(1, m):\n F[i][0] = F[i - 1][0] + dungeon[i][0]\n if F[i][0] <= 0:\n F[i][0] = INF\n\n for j in range(1, n):\n F[0][j] = F[0][j - 1] + dungeon[0][j]\n if F[0][j] <= 0:\n F[0][j] = INF\n\n for i in range(1, m):\n for j in range(1, n):\n F[i][j] = max(F[i - 1][j], F[i][j - 1]) + dungeon[i][j]\n if F[i][j] <= 0:\n F[i][j] = INF\n if F[m - 1][n - 1] <= 0:\n left = mid + 1\n else:\n right = mid - 1\n val = mid\n\n return val if val > 0 else 1\n","runtime":"130"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n R = len(dungeon)\n C = len(dungeon[0])\n\n BIG = 1000 * 400\n best = [[0] * C for _ in range(R)]\n\n def check(t):\n if t <= 0:\n return False\n for r in range(R):\n for c in range(C):\n best[r][c] = -BIG\n heap = []\n if t + dungeon[0][0] > 0 and best[0][0] < t + dungeon[0][0]:\n heapq.heappush(heap, (-t - dungeon[0][0], 0, 0))\n best[0][0] = t + dungeon[0][0]\n while heap:\n energy, r, c = heapq.heappop(heap)\n energy = -energy\n if r == R - 1 and c == C - 1 and energy > 0:\n return True\n if r + 1 < R:\n new_energy = energy + dungeon[r + 1][c]\n if new_energy > 0 and best[r + 1][c] < new_energy:\n heapq.heappush(heap, (-new_energy, r + 1, c))\n best[r + 1][c] = new_energy\n if c + 1 < C:\n new_energy = energy + dungeon[r][c + 1]\n if new_energy > 0 and best[r][c + 1] < new_energy:\n heapq.heappush(heap, (-new_energy, r, c + 1))\n best[r][c + 1] = new_energy\n return False\n \n lo, hi = 0, BIG\n while hi - lo > 1:\n mid = (lo + hi) // 2\n if check(mid):\n hi = mid\n else:\n lo = mid\n return hi\n","runtime":"131"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n dp = [[list() for _ in range(n)] for _ in range(m)]\n \n def healthMinCur(health, d):\n h, c = health\n if c + d <= 0:\n return (h + 1 - (c + d), 1)\n else:\n return (h, c + d)\n dp[0][0].append(healthMinCur((1,1), dungeon[0][0]))\n\n for i in range(1, m):\n dp[i][0].append(healthMinCur(dp[i-1][0][0], dungeon[i][0]))\n for j in range(1, n):\n dp[0][j].append(healthMinCur(dp[0][j-1][0], dungeon[0][j]))\n \n for i in range(1, m):\n for j in range(1, n):\n d = dungeon[i][j]\n best = defaultdict(lambda: -math.inf)\n for health in chain(dp[i-1][j], dp[i][j-1]):\n h, c = healthMinCur(health, d)\n best[h] = max(best[h], c - h)\n h = min(best)\n d = best[h]\n dp[i][j].append((h, h + d))\n for h1, d1 in sorted(best.items())[1:]:\n if d1 > d:\n dp[i][j].append((h1, h1 + d1))\n d = d1\n\n print(dp)\n return min(dp[m-1][n-1])[0]","runtime":"141"}],"string":"[\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n height, width = len(dungeon), len(dungeon[0])\\n m, n = height - 1, width - 1\\n dp = [ [0] * width for _ in range(height) ]\\n dp[m][n] = max(1,1 - dungeon[m][n])\\n for r in range(m-1,-1,-1):\\n dp[r][n] = max(1,dp[r+1][n] - dungeon[r][n])\\n for c in range(n-1,-1,-1):\\n dp[m][c] = max(1, dp[m][c+1] - dungeon[m][c])\\n for r in range(m-1,-1,-1):\\n for c in range(n-1,-1,-1):\\n dp[r][c] = max(1, min( dp[r+1][c], dp[r][c+1] ) - dungeon[r][c] )\\n return dp[0][0]\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(Solution().calculateMinimumHP(nums),file=f)\\nexit(0)\\n\\n\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n dp = [[float('inf')] * n for _ in range(m)]\\n dp[m - 1][n - 1] = max(1, 1 - dungeon[m - 1][n - 1])\\n \\n for j in range(n - 2, -1, -1):\\n dp[m - 1][j] = max(1, dp[m - 1][j + 1] - dungeon[m - 1][j])\\n \\n for i in range(m - 2, -1, -1):\\n dp[i][n - 1] = max(1, dp[i + 1][n - 1] - dungeon[i][n - 1])\\n \\n for i in range(m - 2, -1, -1):\\n for j in range(n - 2, -1, -1):\\n minHPOnExit = min(dp[i + 1][j], dp[i][j + 1])\\n dp[i][j] = max(1, minHPOnExit - dungeon[i][j])\\n \\n return dp[0][0]\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(Solution().calculateMinimumHP(nums),file=f)\\nexit(0)\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n \\n # Create a 2D dp array initialized with infinity\\n dp = [[float('inf')] * n for _ in range(m)]\\n \\n # Bottom-up approach: start from the princess's cell\\n dp[m-1][n-1] = max(1, 1 - dungeon[m-1][n-1])\\n \\n # Fill the last row (bottom row)\\n for j in range(n-2, -1, -1):\\n dp[m-1][j] = max(1, dp[m-1][j+1] - dungeon[m-1][j])\\n \\n # Fill the last column (rightmost column)\\n for i in range(m-2, -1, -1):\\n dp[i][n-1] = max(1, dp[i+1][n-1] - dungeon[i][n-1])\\n \\n # Fill the rest of the dp table\\n for i in range(m-2, -1, -1):\\n for j in range(n-2, -1, -1):\\n min_health_on_exit = min(dp[i+1][j], dp[i][j+1])\\n dp[i][j] = max(1, min_health_on_exit - dungeon[i][j])\\n \\n return dp[0][0]\\n\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n MAX = int(1E9)\\n\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n dp = [[Solution.MAX] * (n+1) for _ in range(m+1)]\\n dp[m-1][n], dp[m][n-1] = 1, 1\\n for i in range(m-1,-1,-1):\\n for j in range(n-1,-1,-1):\\n dp[i][j] = max(min(dp[i+1][j],dp[i][j+1])-dungeon[i][j],1)\\n\\n return dp[0][0]\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n \\n # Initialize the dp table with the maximum possible value\\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\\n \\n # The knight needs at least 1 health point to survive\\n dp[m][n - 1] = 1\\n dp[m - 1][n] = 1\\n \\n # Fill the dp table\\n for i in range(m - 1, -1, -1):\\n for j in range(n - 1, -1, -1):\\n need = min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j]\\n dp[i][j] = max(1, need)\\n \\n return dp[0][0]\\n\\n# Example usage:\\nsolution = Solution()\\ndungeon = [[-2, -3, 3], [-5, -10, 1], [10, 30, -5]]\\nprint(solution.calculateMinimumHP(dungeon)) # Output: 7\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n rows, cols = len(dungeon), len(dungeon[0])\\n dp = [[float('inf')] * (cols + 1) for _ in range(rows + 1)]\\n dp[rows - 1][cols], dp[rows][cols - 1] = 1, 1\\n\\n for i in range(rows - 1, -1, -1):\\n for j in range(cols - 1, -1, -1):\\n dp[i][j] = max(min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j], 1)\\n\\n return dp[0][0]\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n \\n # Initialize the DP table with positive infinity\\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\\n \\n # The knight needs at least 1 health to survive\\n dp[m][n - 1] = 1\\n dp[m - 1][n] = 1\\n \\n # Fill the DP table from bottom-right to top-left\\n for i in range(m - 1, -1, -1):\\n for j in range(n - 1, -1, -1):\\n needed_health = min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j]\\n dp[i][j] = max(1, needed_health)\\n \\n return dp[0][0]\\n\\n# Example usage:\\nsolution = Solution()\\ndungeon = [[-2, -3, 3], [-5, -10, 1], [10, 30, -5]]\\nprint(solution.calculateMinimumHP(dungeon)) # Output: 7\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n dp = [[0 for _ in range(len(dungeon[0]))] for _ in range(len(dungeon))]\\n if dungeon[-1][-1] < 0:\\n dp[-1][-1] = 1 - dungeon[-1][-1]\\n else:\\n dp[-1][-1] = 1\\n \\n for i in range(len(dungeon) - 2, -1, -1):\\n dp[i][len(dungeon[0]) - 1] = max(1, dp[i + 1][len(dungeon[0]) - 1] - dungeon[i][len(dungeon[0]) - 1])\\n for j in range(len(dungeon[0]) - 2, -1, -1):\\n dp[len(dungeon) - 1][j] = max(1, dp[len(dungeon) - 1][j + 1] - dungeon[len(dungeon) - 1][j])\\n\\n for i in range(len(dp) - 2, -1, -1):\\n for j in range(len(dp[0]) - 2, -1, -1):\\n next_cell = min(dp[i+1][j], dp[i][j+1])\\n dp[i][j] = max(1, next_cell - dungeon[i][j])\\n\\n print(dp)\\n \\n return dp[0][0]\\n\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m=len(dungeon)-1\\n n=len(dungeon[0])-1\\n val=1-dungeon[m][n]\\n if val<=0:\\n val=1\\n dungeon[m][n]=val\\n for i in range(m,-1,-1):\\n for j in range(n,-1,-1):\\n if i==m and j!=n:\\n val=dungeon[i][j+1]-dungeon[i][j]\\n if val<=0:\\n val=1\\n dungeon[i][j]=val\\n elif j==n and i!=m:\\n val=dungeon[i+1][j]-dungeon[i][j]\\n if val<=0:\\n val=1\\n dungeon[i][j]=val\\n elif i!=m or j!=n:\\n val=min(dungeon[i+1][j]-dungeon[i][j],dungeon[i][j+1]-dungeon[i][j])\\n if val<=0:\\n val=1\\n dungeon[i][j]=val\\n return dungeon[0][0]\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n lastRow = len(dungeon) - 1\\n lastCol = len(dungeon[0]) - 1\\n \\n\\n dp0 = [1_000_000_000_000] * (lastCol + 2)\\n dp1 = [1_000_000_000_000] * (lastCol + 2)\\n\\n dp0[lastCol] = 1\\n dp1[lastCol + 1] = 1\\n\\n for row in range(lastRow, -1, -1):\\n for col in range(lastCol, -1, -1):\\n dp1[col] = max(1, min(dp0[col], dp1[col + 1]) - dungeon[row][col])\\n dp0, dp1 = dp1, dp0\\n for i in range(lastCol + 2):\\n dp1[i] = 1_000_000_000_000\\n return dp0[0]\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n if not dungeon or not dungeon[0]:\\n return 1\\n \\n m, n = len(dungeon), len(dungeon[0])\\n \\n # Initialize DP table with a large number\\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\\n # The princess needs at least 1 health to be rescued\\n dp[m][n-1] = dp[m-1][n] = 1\\n \\n # Fill the DP table from bottom-right to top-left\\n for i in range(m - 1, -1, -1):\\n for j in range(n - 1, -1, -1):\\n # Minimum health needed to enter this cell\\n minHealth = min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j]\\n # Health should not be less than 1\\n dp[i][j] = max(1, minHealth)\\n \\n # The top-left cell gives us the answer\\n return dp[0][0]\\n\\n# Test the solution\\nsolution = Solution()\\ndungeon = [[-2,-3,3],[-5,-10,1],[10,30,-5]]\\nprint(solution.calculateMinimumHP(dungeon)) # Should print 7\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n # Initialize the dp table with infinity\\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\\n dp[m][n - 1] = dp[m - 1][n] = 1 # set the health needed at the princess's cell\\n \\n # Traverse the dungeon from bottom-right to top-left\\n for i in range(m - 1, -1, -1):\\n for j in range(n - 1, -1, -1):\\n min_health_needed = min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j]\\n dp[i][j] = max(min_health_needed, 1)\\n \\n return dp[0][0]\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n \\n # Initialize the dp table with positive infinity\\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\\n \\n # Base case: minimum health required at the princess's cell\\n dp[m][n - 1] = 1\\n dp[m - 1][n] = 1\\n \\n # Fill the dp table\\n for i in range(m - 1, -1, -1):\\n for j in range(n - 1, -1, -1):\\n min_health_required = min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j]\\n dp[i][j] = max(1, min_health_required)\\n \\n return dp[0][0]\\n\\n# Example usage:\\nsolution = Solution()\\ndungeon = [[-2, -3, 3], [-5, -10, 1], [10, 30, -5]]\\nprint(solution.calculateMinimumHP(dungeon)) # Output: 7\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n \\n # Initialize the DP table with positive infinity\\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\\n \\n # Base case: To survive at the princess cell, the knight needs at least 1 health point\\n dp[m][n - 1] = dp[m - 1][n] = 1\\n \\n # Fill the DP table from bottom-right to top-left\\n for i in range(m - 1, -1, -1):\\n for j in range(n - 1, -1, -1):\\n dp[i][j] = max(min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j], 1)\\n \\n return dp[0][0]\\n\\n# Example usage:\\nsolution = Solution()\\ndungeon = [[-2, -3, 3], [-5, -10, 1], [10, 30, -5]]\\nprint(solution.calculateMinimumHP(dungeon)) # Output: 7\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n \\n m=len(dungeon)\\n n=len(dungeon[0])\\n dp=[[float('inf')]*(n+1) for i in range(m+1)]\\n dp[m][n-1]=dp[m-1][n]=1\\n min_health=1\\n for i in range(m-1,-1,-1):\\n for j in range(n-1,-1,-1):\\n min_health=min(dp[i][j+1],dp[i+1][j])\\n dp[i][j]=max(1,min_health-dungeon[i][j])\\n return dp[0][0]\\n \\n \\n \\n\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n\\n @cache \\n def min_health(i, j):\\n if i >= m or j >= n:\\n return float('inf')\\n \\n if i == m - 1 and j == n - 1:\\n return max(1, 1 - dungeon[i][j])\\n \\n right = min_health(i, j + 1)\\n down = min_health(i + 1, j)\\n min_health_needed = min(right, down) - dungeon[i][j]\\n return max(1, min_health_needed)\\n \\n return min_health(0, 0)\\n\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n \\n # Create a dp table of size m x n\\n dp = [[float('inf')] * n for _ in range(m)]\\n \\n # Base case: health needed at the bottom-right corner\\n dp[m-1][n-1] = max(1, 1 - dungeon[m-1][n-1])\\n \\n # Fill the last row (moving right)\\n for j in range(n-2, -1, -1):\\n dp[m-1][j] = max(1, dp[m-1][j+1] - dungeon[m-1][j])\\n \\n # Fill the last column (moving down)\\n for i in range(m-2, -1, -1):\\n dp[i][n-1] = max(1, dp[i+1][n-1] - dungeon[i][n-1])\\n \\n # Fill the rest of the dp table\\n for i in range(m-2, -1, -1):\\n for j in range(n-2, -1, -1):\\n min_health_on_exit = min(dp[i+1][j], dp[i][j+1])\\n dp[i][j] = max(1, min_health_on_exit - dungeon[i][j])\\n \\n # The answer is the minimum initial health needed at the top-left corner\\n return dp[0][0]\\n\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n\\n m, n = len(dungeon), len(dungeon[0])\\n\\n dp = [[0 for _ in range(n+1)] for _ in range(m+1)]\\n\\n def minPath():\\n for i in range(m - 1, -1, -1):\\n for j in range(n - 1, -1, -1):\\n if i == m - 1 and j == n - 1:\\n dp[i][j] = 1 + max(0, - dungeon[i][j])\\n else:\\n val_h = 1e10 if i + 1 > m - 1 else dp[i + 1][j]\\n val_v = 1e10 if j + 1 > n - 1 else dp[i][j + 1]\\n dp[i][j] = max(1, - dungeon[i][j] + min(val_h, val_v))\\n\\n return dp[0][0]\\n\\n return minPath()\\n\\n \\n\\n \",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, grid: List[List[int]]) -> int:\\n INF = float('inf')\\n rows = len(grid)\\n cols = len(grid[0])\\n if rows == 1 and cols == 1:\\n if grid[0][0] >= 0:\\n return 1\\n return -grid[0][0] + 1\\n dp = [[INF] * cols for i in range(rows)]\\n dp[rows - 1][cols - 1] = max(1, 1 - grid[rows - 1][cols - 1])\\n for r in range(rows-2,-1,-1):\\n dp[r][cols-1] = max(1, dp[r + 1][cols-1] - grid[r][cols-1])\\n for c in range(cols-2,-1,-1):\\n dp[rows - 1][c] = max(1, dp[rows - 1][c + 1] - grid[rows - 1][c])\\n for r in range(rows - 2, -1 , -1):\\n for c in range(cols - 2 , -1 , -1):\\n need = min(dp[r + 1][c], dp[r][c + 1])\\n dp[r][c] = max(1, need - grid[r][c])\\n return dp[0][0]\\n \",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m , n = len(dungeon), len(dungeon[0])\\n dp = [[0] * n for _ in range(m)]\\n dp[-1][-1] = max(-1 * dungeon[-1][-1], 0)\\n for i in range(m-1, -1 , -1):\\n for j in range(n-1, -1, -1):\\n if i < m-1 and j < n-1:\\n dp[i][j] = -1 * min(dungeon[i][j]-min(dp[i+1][j], dp[i][j+1]), 0)\\n if i == m-1 and j < n-1:\\n dp[i][j] = -1 * min(dungeon[i][j]- dp[i][j+1], 0) \\n continue\\n if i < m-1 and j == n-1: \\n dp[i][j] = -1 * min(dungeon[i][j]- dp[i+1][j], 0) \\n continue\\n return dp[0][0] + 1\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, grid: List[List[int]]) -> int:\\n INF = float('inf')\\n rows = len(grid)\\n cols = len(grid[0])\\n if rows == 1 and cols == 1:\\n if grid[0][0] >= 0:\\n return 1\\n return -grid[0][0] + 1\\n dp = [[INF] * cols for i in range(rows)]\\n dp[rows - 1][cols - 1] = max(1, 1 - grid[rows - 1][cols - 1])\\n for r in range(rows-2,-1,-1):\\n dp[r][cols-1] = max(1, dp[r + 1][cols-1] - grid[r][cols-1])\\n for c in range(cols-2,-1,-1):\\n dp[rows - 1][c] = max(1, dp[rows - 1][c + 1] - grid[rows - 1][c])\\n for r in range(rows - 2, -1 , -1):\\n for c in range(cols - 2 , -1 , -1):\\n need = min(dp[r + 1][c], dp[r][c + 1])\\n dp[r][c] = max(1, need - grid[r][c])\\n return dp[0][0]\\n \",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n if not dungeon or not dungeon[0]:\\n return 0\\n rows, cols = len(dungeon), len(dungeon[0])\\n a = [[float('inf')] * (cols + 1) for _ in range(rows + 1)]\\n a[rows][cols - 1] = a[rows - 1][cols] = 1\\n \\n for i in range(rows - 1, -1, -1):\\n for j in range(cols - 1, -1, -1):\\n min_health = min(a[i + 1][j], a[i][j + 1]) - dungeon[i][j]\\n a[i][j] = max(min_health, 1)\\n \\n return a[0][0] \\n\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, grid: List[List[int]]) -> int:\\n INF = float('inf')\\n rows = len(grid)\\n cols = len(grid[0])\\n if rows == 1 and cols == 1:\\n if grid[0][0] >= 0:\\n return 1\\n return -grid[0][0] + 1\\n dp = [[INF] * cols for i in range(rows)]\\n dp[rows - 1][cols - 1] = max(1, 1 - grid[rows - 1][cols - 1])\\n for r in range(rows-2,-1,-1):\\n dp[r][cols-1] = max(1, dp[r + 1][cols-1] - grid[r][cols-1])\\n for c in range(cols-2,-1,-1):\\n dp[rows - 1][c] = max(1, dp[rows - 1][c + 1] - grid[rows - 1][c])\\n for r in range(rows - 2, -1 , -1):\\n for c in range(cols - 2 , -1 , -1):\\n need = min(dp[r + 1][c], dp[r][c + 1])\\n dp[r][c] = max(1, need - grid[r][c])\\n return dp[0][0]\\n \",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n \\n m = len(dungeon)\\n n = len(dungeon[0])\\n \\n # Initialize memoization table with None (for uncalculated states)\\n memo = [[None] * n for _ in range(m)]\\n \\n # Define the recursive function with memoization\\n def solve(i, j):\\n # If we go out of bounds, return a very large number (invalid path)\\n if i >= m or j >= n:\\n return float('inf')\\n \\n # If we are at the bottom-right cell, calculate the minimum health\\n if i == m - 1 and j == n - 1:\\n return max(1, 1 - dungeon[i][j])\\n \\n # If the result has already been computed, return it\\n if memo[i][j] is not None:\\n return memo[i][j]\\n \\n # Recursively calculate the minimum health needed by moving right or down\\n right = solve(i, j + 1)\\n down = solve(i + 1, j)\\n \\n # Choose the path that requires less health\\n min_health_on_exit = min(right, down)\\n \\n # Calculate the minimum health needed to enter the current cell\\n memo[i][j] = max(1, min_health_on_exit - dungeon[i][j])\\n \\n return memo[i][j]\\n \\n # Start the recursion from the top-left corner\\n return solve(0, 0)\\n\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m , n = len(dungeon), len(dungeon[0])\\n dp = [[0] * n for _ in range(m)]\\n dp[-1][-1] = max(-1 * dungeon[-1][-1], 0)\\n for i in range(m-1, -1 , -1):\\n for j in range(n-1, -1, -1):\\n if i < m-1 and j < n-1:\\n dp[i][j] = -1 * min(dungeon[i][j]-min(dp[i+1][j], dp[i][j+1]), 0)\\n if i == m-1 and j < n-1:\\n dp[i][j] = -1 * min(dungeon[i][j]- dp[i][j+1], 0) \\n continue\\n if i < m-1 and j == n-1: \\n dp[i][j] = -1 * min(dungeon[i][j]- dp[i+1][j], 0) \\n return dp[0][0] + 1\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n # Create a DP table with extra row and column filled with infinity\\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\\n # The knight needs at least 1 health point to reach the princess\\n dp[m][n - 1] = dp[m - 1][n] = 1\\n\\n # Iterate from bottom-right to top-left\\n for i in reversed(range(m)):\\n for j in reversed(range(n)):\\n # Minimum health needed to move to the next cell\\n min_health = min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j]\\n # Ensure the knight's health is at least 1\\n dp[i][j] = max(min_health, 1)\\n\\n return dp[0][0]\\n \",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"# f(i, j) = max(1, -dungeon[i][j] + min(f(i+1, j), f(i, j+1)))\\n# base case : if i == n-1. and j == m-1, return max(1, -dungeon[n-1][m-1] + 1)\\n# return f(0, 0)\\n\\nclass Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n n, m = len(dungeon), len(dungeon[0])\\n dp = [[-1 for j in range(m)] for i in range(n)]\\n def helper(i, j):\\n if i == n-1 and j == m-1:\\n return max(1, -dungeon[i][j] + 1)\\n if dp[i][j] != -1:\\n return dp[i][j]\\n count = float('inf')\\n if i + 1 < n:\\n count = min(count, helper(i+1, j))\\n if j + 1 < m:\\n count = min(count, helper(i, j+1))\\n count = max(1, -dungeon[i][j] + count)\\n dp[i][j] = count\\n return count\\n ans= helper(0, 0)\\n return ans\\n \",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n dp = [[float('inf') for _ in range(n+1)] for _ in range(m+1)]\\n\\n dp[m][n-1] = 1\\n dp[m-1][n] = 1\\n\\n for i in range(m-1, -1, -1):\\n for j in range(n-1, -1, -1):\\n dp[i][j] = max(1, min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j])\\n \\n return dp[0][0]\",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, d: List[List[int]]) -> int:\\n m=len(d)\\n n=len(d[0])\\n dp=[[0]*n for _ in range(m)]\\n #base case \\n if d[m-1][n-1]<0:\\n dp[m-1][n-1]=abs(d[m-1][n-1])+1\\n else:\\n dp[m-1][n-1]=1\\n for i in range(m-1,-1,-1):\\n for j in range(n-1,-1,-1):\\n if i==m-1 and j==n-1:\\n continue\\n if i==m-1:\\n if d[i][j]>0:\\n if d[i][j]>=dp[i][j+1]:\\n dp[i][j]=1\\n else:\\n dp[i][j]=dp[i][j+1]-d[i][j]\\n else:\\n dp[i][j]= abs(d[i][j])+dp[i][j+1]\\n if j==n-1:\\n if d[i][j]>0:\\n if d[i][j]>=dp[i+1][j]:\\n dp[i][j]=1\\n else:\\n dp[i][j]=dp[i+1][j]-d[i][j]\\n else:\\n dp[i][j]= abs(d[i][j])+dp[i+1][j]\\n elif i<m-1 and j<n-1:\\n mini=min(dp[i][j+1],dp[i+1][j])\\n if d[i][j]<=0:\\n dp[i][j]=abs(d[i][j])+mini\\n else:\\n if d[i][j]<mini:\\n dp[i][j]=mini-d[i][j]\\n else:\\n dp[i][j]=1 \\n return dp[0][0]\\n\\n \\n \",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n dp = [[1e9]*n for _ in range(m)]\\n \\n for i in range(m-1, -1, -1):\\n for j in range(n-1, -1,-1):\\n if i==m-1 and j==n-1:\\n dp[i][j] = -dungeon[i][j]+1 if dungeon[i][j]<0 else 1\\n continue\\n elif j+1>n-1:\\n res = dp[i+1][j]- dungeon[i][j]\\n elif i+1>m-1:\\n res = dp[i][j+1]- dungeon[i][j]\\n else:\\n res = min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j]\\n dp[i][j] = res if res >0 else 1\\n return dp[0][0] if dp[0][0]>0 else 1\\n\\n \",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n \\n # Create DP table with an extra row and column\\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\\n \\n # Set the \\\"goal\\\" cell\\n dp[m][n-1] = dp[m-1][n] = 1\\n \\n # Fill the DP table from bottom-right to top-left\\n for i in range(m - 1, -1, -1):\\n for j in range(n - 1, -1, -1):\\n dp[i][j] = max(1, min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j])\\n \\n return dp[0][0]\",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"from collections import deque\\nclass Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m,n=len(dungeon),len(dungeon[0])\\n dp=[[float('inf')]*(n+1) for _ in range(m+1)]\\n dp[m][n-1]=dp[m-1][n]=1\\n for i in range(m-1,-1,-1):\\n for j in range(n-1,-1,-1):\\n mh=min(dp[i+1][j],dp[i][j+1])-dungeon[i][j]\\n dp[i][j]=max(mh,1)\\n return dp[0][0]\",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n\\n # Top left corner is (0,0)\\n #Top bottom corner is (len(matrix)-1, len(matrix[0]-1))\\n # every time we move right or down? how I will be at the next tile\\n # health drops or increase \\n # Let's say I inittially start with health zero \\n # I drop at -2, move downward or right ---> I want to see which step to take\\n #based on the current state\\n # So something like A*, where you can check all the routes but take the one \\n # with minimum ---> doing a BFS\\n # directions are [(0, 1), (1, 0)]\\n # start and end for bfs\\n # I just need to do the minimum path\\n rows, cols = len(dungeon), len(dungeon[0])\\n \\n # This will store the minimum initial health needed at each room to survive\\n memo = {}\\n\\n # Backtracking function to compute minimum health needed from current position\\n def backtrack(r, c):\\n # If we are out of bounds, return a large number (invalid path)\\n if r >= rows or c >= cols:\\n return float('inf')\\n\\n # Base case: when we reach the princess (bottom-right corner)\\n if r == rows - 1 and c == cols - 1:\\n return max(1, 1 - dungeon[r][c])\\n\\n # Check if we've already computed the minimum health for this position\\n if (r, c) in memo:\\n return memo[(r, c)]\\n\\n # Recur for both possible moves: right and down\\n health_needed_right = backtrack(r, c + 1)\\n health_needed_down = backtrack(r + 1, c)\\n\\n # Choose the better of the two moves\\n min_health_on_exit = min(health_needed_right, health_needed_down)\\n\\n # Calculate the minimum health required at this room\\n min_health_required = max(1, min_health_on_exit - dungeon[r][c])\\n\\n # Memorize the result for future lookups\\n memo[(r, c)] = min_health_required\\n\\n return min_health_required\\n\\n # Start the backtracking from the top-left corner\\n return backtrack(0, 0)\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n lastRow = len(dungeon) - 1\\n lastCol = len(dungeon[0]) - 1\\n \\n\\n dp0 = [1_000_000_000_000] * (lastCol + 2)\\n dp1 = [1_000_000_000_000] * (lastCol + 2)\\n\\n dp0[lastCol] = 1\\n dp1[lastCol + 1] = 1\\n\\n for row in range(lastRow, -1, -1):\\n for col in range(lastCol, -1, -1):\\n minHealth = min(dp0[col], dp1[col + 1]) - dungeon[row][col]\\n dp1[col] = max(1, minHealth)\\n dp0, dp1 = dp1, dp0\\n for i in range(lastCol + 2):\\n dp1[i] = 1_000_000_000_000\\n return dp0[0]\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n dp = [[float('inf') for _ in range(n+1)] for _ in range(m+1)]\\n\\n dp[m][n-1] = 1\\n dp[m-1][n] = 1\\n\\n for i in range(m-1, -1, -1):\\n for j in range(n-1, -1, -1):\\n dp[i][j] = max(1, min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j])\\n \\n return dp[0][0]\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n dp = [[1e9]*n for _ in range(m)]\\n \\n for i in range(m-1, -1, -1):\\n for j in range(n-1, -1,-1):\\n if i==m-1 and j==n-1:\\n dp[i][j] = -dungeon[i][j]+1 if dungeon[i][j]<0 else 1\\n continue\\n right = dp[i][j + 1] if j < n - 1 else float('inf')\\n down = dp[i + 1][j] if i < m - 1 else float('inf')\\n dp[i][j] = max(1, min(right, down) - dungeon[i][j])\\n return dp[0][0] if dp[0][0]>0 else 1\\n\\n \",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, grid: List[List[int]]) -> int:\\n INF = float('inf')\\n rows = len(grid)\\n cols = len(grid[0])\\n if rows == 1 and cols == 1:\\n if grid[0][0] >= 0:\\n return 1\\n return -grid[0][0] + 1\\n dp = [[INF] * cols for i in range(rows)]\\n dp[rows - 1][cols - 1] = max(1, 1 - grid[rows - 1][cols - 1])\\n for r in range(rows-2,-1,-1):\\n dp[r][cols-1] = max(1, dp[r + 1][cols-1] - grid[r][cols-1])\\n for c in range(cols-2,-1,-1):\\n dp[rows - 1][c] = max(1, dp[rows - 1][c + 1] - grid[rows - 1][c])\\n for r in range(rows - 2, -1 , -1):\\n for c in range(cols - 2 , -1 , -1):\\n need = min(dp[r + 1][c], dp[r][c + 1])\\n dp[r][c] = max(1, need - grid[r][c])\\n return dp[0][0]\\n \",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n \\n \\n m, n = len(dungeon), len(dungeon[0])\\n memo = {}\\n \\n def dfs(i, j):\\n # Base case: out of bounds\\n if i == m or j == n:\\n return float('inf')\\n \\n # Reached the princess\\n if i == m - 1 and j == n - 1:\\n return max(1, 1 - dungeon[i][j])\\n \\n # Check if we've already calculated this\\n if (i, j) in memo:\\n return memo[(i, j)]\\n \\n # Recursive case: go right or down\\n right = dfs(i, j + 1)\\n down = dfs(i + 1, j)\\n \\n min_health = min(right, down) - dungeon[i][j]\\n memo[(i, j)] = max(1, min_health)\\n return memo[(i, j)]\\n \\n return dfs(0, 0)\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"# f(i, j) = max(1, -dungeon[i][j] + min(f(i+1, j), f(i, j+1)))\\n# base case : if i == n-1. and j == m-1, return max(1, -dungeon[n-1][m-1] + 1)\\n# return f(0, 0)\\n\\nclass Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n n, m = len(dungeon), len(dungeon[0])\\n dp = [[-1 for j in range(m)] for i in range(n)]\\n def helper(i, j):\\n if i == n-1 and j == m-1:\\n return max(1, -dungeon[i][j] + 1)\\n if dp[i][j] != -1:\\n return dp[i][j]\\n count = float('inf')\\n if i + 1 < n:\\n count = min(count, helper(i+1, j))\\n if j + 1 < m:\\n count = min(count, helper(i, j+1))\\n count = max(1, -dungeon[i][j] + count)\\n dp[i][j] = count\\n return count\\n ans= helper(0, 0)\\n return ans\\n \",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"\\n\\nclass Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n n, m = len(dungeon), len(dungeon[0])\\n dp = [[-1 for j in range(m)] for i in range(n)]\\n def helper(i, j):\\n if i == n-1 and j == m-1:\\n return 1\\n if dp[i][j] != -1:\\n return dp[i][j]\\n count = float('inf')\\n if i + 1 < n:\\n count = min(count, -dungeon[i+1][j] + helper(i+1, j))\\n if j + 1 < m:\\n count = min(count, -dungeon[i][j+1] + helper(i, j+1))\\n count = max(1, count)\\n dp[i][j] = count\\n return count\\n return max(1, helper(0, 0) - dungeon[0][0])\\n \",\n \"runtime\": \"76\"\n },\n {\n \"code\": \"\\n\\nclass Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n n, m = len(dungeon), len(dungeon[0])\\n dp = [[-1 for j in range(m)] for i in range(n)]\\n def helper(i, j):\\n if i == n-1 and j == m-1:\\n return 1\\n if dp[i][j] != -1:\\n return dp[i][j]\\n count = float('inf')\\n if i + 1 < n:\\n count = min(count, -dungeon[i+1][j] + helper(i+1, j))\\n if j + 1 < m:\\n count = min(count, -dungeon[i][j+1] + helper(i, j+1))\\n count = max(1, count)\\n dp[i][j] = count\\n return count\\n return max(1, helper(0, 0) - dungeon[0][0])\\n \",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHPDP(self, dungeon, DP, health, i, j):\\n if DP[i][j] is not None:\\n return DP[i][j]\\n\\n m = len(dungeon)\\n n = len(dungeon[0])\\n\\n if i == m - 1 and j == n - 1:\\n DP[i][j] = min(health[i][j], 0)\\n elif i == m - 1:\\n DP[i][j] = min(self.calculateMinimumHPDP(dungeon, DP, health, i, j+1) + dungeon[i][j], 0)\\n elif j == n - 1:\\n DP[i][j] = min(self.calculateMinimumHPDP(dungeon, DP, health, i+1, j) + dungeon[i][j], 0)\\n else:\\n DP[i][j] = min(max(self.calculateMinimumHPDP(dungeon, DP, health, i, j+1),\\n self.calculateMinimumHPDP(dungeon, DP, health, i+1, j)) + dungeon[i][j], 0)\\n return DP[i][j]\\n\\n def computeMinHealth(self, dungeon):\\n m = len(dungeon)\\n n = len(dungeon[0])\\n health = [[None for _ in range(n)] for _ in range(m)]\\n\\n for i in range(m):\\n for j in range(n):\\n ind_i = m - i - 1\\n ind_j = n - j - 1\\n if ind_i == m - 1 and ind_j == n - 1:\\n health[ind_i][ind_j] = dungeon[ind_i][ind_j]\\n elif ind_i == m - 1:\\n health[ind_i][ind_j] = min(dungeon[ind_i][ind_j], dungeon[ind_i][ind_j] + health[ind_i][ind_j+1])\\n elif ind_j == n - 1:\\n health[ind_i][ind_j] = min(dungeon[ind_i][ind_j], dungeon[ind_i][ind_j] + health[ind_i + 1][ind_j])\\n else:\\n health[ind_i][ind_j] = min(dungeon[ind_i][ind_j],\\n dungeon[ind_i][ind_j] + min(health[ind_i][ind_j + 1], health[ind_i + 1][ind_j])\\n )\\n return health\\n\\n def calculateMinimumHP(self, dungeon):\\n m = len(dungeon)\\n n = len(dungeon[0])\\n DP = [[None for _ in range(n)] for _ in range(m)]\\n health = self.computeMinHealth(dungeon)\\n min_hp = self.calculateMinimumHPDP(dungeon, DP, health,0, 0)\\n min_hp = min(0, min_hp)\\n return -min_hp + 1\\n \",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n\\n\\n\\n for row in reversed(range(len(dungeon))):\\n \\n for col in reversed(range(len(dungeon[0]))):\\n \\n if col == len(dungeon[0]) - 1:\\n if row < len(dungeon) - 1:\\n dungeon[row][col] = min(dungeon[row][col], dungeon[row][col] + dungeon[row + 1][col])\\n continue\\n elif row == len(dungeon) - 1:\\n #print(f'{row=} {col=}')\\n dungeon[row][col] = min(dungeon[row][col], dungeon[row][col] + dungeon[row][col + 1])\\n continue\\n\\n path_d = min(dungeon[row][col], dungeon[row][col] + dungeon[row + 1][col])\\n path_r = min(dungeon[row][col], dungeon[row][col] + dungeon[row][col + 1])\\n dungeon[row][col] = max(path_r, path_d)\\n \\n if dungeon[0][0] >= 0:\\n return 1\\n \\n return abs(dungeon[0][0]) + 1\\n\\n\\n \",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n \\n @lru_cache(None)\\n def dp(i, j):\\n if i >= len(dungeon) or j >= len(dungeon[0]): return float('inf')\\n if i == len(dungeon)-1 and j == len(dungeon[0])-1: return max(1, 1- dungeon[i][j])\\n return max(1, - dungeon[i][j] + min(dp(i, j+1), dp(i+1, j)))\\n \\n return dp(0,0)\\n\\n \",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n\\n memo = {}\\n directions = [(1,0), (0, 1)]\\n\\n def backTrack(r, c):\\n if r == len(dungeon) - 1 and c == len(dungeon[0]) - 1:\\n return max(1, 1 - dungeon[r][c])\\n\\n if (r, c) in memo:\\n return memo[(r, c)]\\n \\n min_health_next_step = float('inf')\\n \\n for dx, dy in directions:\\n r2, c2 = r + dx, c + dy\\n if 0 <= r2 < len(dungeon) and 0 <= c2 < len(dungeon[0]):\\n min_health_next_step = min(min_health_next_step, backTrack(r2, c2))\\n\\n \\n min_health_required = max(1, min_health_next_step - dungeon[r][c])\\n\\n \\n memo[(r, c)] = min_health_required\\n\\n return min_health_required\\n \\n return backTrack(0, 0)\\n\\n\",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n r = len(dungeon)\\n c = len(dungeon[0])\\n d = dungeon\\n @cache\\n def help(i=0, j=0):\\n if i+1 == r and j+1 == c:\\n return 1 if d[i][j] > 0 else -1 * d[i][j] + 1\\n if(i == r or j == c):\\n return 9999999999\\n\\n down = help(i+1, j)\\n right = help(i, j+1)\\n\\n minHealth = min(down, right) - d[i][j]\\n\\n return 1 if minHealth <= 0 else minHealth\\n\\n return help()\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n \\\"\\\"\\\"\\n 7:14\\n\\n DP\\n O(nm)\\n \\\"\\\"\\\"\\n self.dungeon = dungeon\\n self.height = len(dungeon)\\n self.width = len(dungeon[0])\\n return self.calculateMinimumHPHelper(0,0,{})\\n # return max((-options[1][1]) + 1, 1)\\n\\n def calculateMinimumHPHelper(self, i, j, memo):\\n \\\"\\\"\\\"\\n memo will store - \\n\\n the minimum hp we need from this point forward\\n which will be at least 1\\n\\n \\\"\\\"\\\"\\n key = (i,j)\\n if key in memo:\\n return memo[key]\\n\\n if i >= self.height:\\n return float(\\\"inf\\\")\\n if j >= self.width:\\n return float(\\\"inf\\\")\\n\\n val = self.dungeon[i][j]\\n if i == self.height-1 and j == self.width-1:\\n memo[key] = max(-val+1, 1)\\n return memo[key]\\n \\n right = self.calculateMinimumHPHelper(i, j+1, memo)\\n down = self.calculateMinimumHPHelper(i+1, j, memo)\\n memo[key] = max(1, min(right, down)-val)\\n return memo[key]\\n\\n # def calculateMinimumHPHelper(self, i, j, memo):\\n # \\\"\\\"\\\"\\n # memo will store two tuples\\n # (\\n # (best_current_health, corresponding_worst_health_in_path)\\n # (current_health, best_corresponding_worst_health_in_path)\\n # )\\n # the best health loss from this point forward and the \\n # worst health loss along the best path forward\\n # \\\"\\\"\\\"\\n # key = (i,j)\\n # if key in memo:\\n # return memo[key]\\n \\n # if i >= self.height:\\n # return [(-float(\\\"inf\\\"), -float(\\\"inf\\\")), (-float(\\\"inf\\\"), -float(\\\"inf\\\"))]\\n # if j >= self.width:\\n # return [(-float(\\\"inf\\\"), -float(\\\"inf\\\")), (-float(\\\"inf\\\"), -float(\\\"inf\\\"))]\\n \\n # val = self.dungeon[i][j]\\n # if i == self.height-1 and j == self.width-1:\\n # memo[key] = [(val, val), (val, val)]\\n # return memo[key]\\n\\n # possibilities = []\\n # possibilities.extend(self.calculateMinimumHPHelper(i, j+1, memo))\\n # possibilities.extend(self.calculateMinimumHPHelper(i+1, j, memo))\\n\\n # options = []\\n # for [curr, worst] in possibilities:\\n # options.append((min(val, val+curr), min(val+curr, val, worst)))\\n # # print(\\\"Here options\\\", i, j, options)\\n # options.sort(key=lambda x: x[0])\\n # best_curr = options[-1]\\n\\n # options.sort(key=lambda x: x[1])\\n # best_worst = options[-1]\\n # memo[key] = (best_curr, best_worst)\\n \\n\\n # # if i == self.height-1:\\n # # right_curr, right_worst = self.calculateMinimumHPHelper(i, j+1, memo)\\n # # new_curr = self.dungeon[i][j] + right_curr\\n # # memo[key] = new_curr, min(new_curr, right_worst)\\n # # return memo[key]\\n # # if j == self.width-1:\\n # # down_curr, down_worst = self.calculateMinimumHPHelper(i, j+1, memo)\\n # # memo[key] = self.dungeon[i][j] + self.calculateMinimumHPHelper(i+1, j, memo)\\n # # return memo[key]\\n # # right = self.dungeon[i][j] + self.calculateMinimumHPHelper(i, j+1, memo)\\n # # down = self.dungeon[i][j] + self.calculateMinimumHPHelper(i+1, j, memo)\\n # # memo[key] = max(right, down)\\n # return memo[key]\\n \\n \\n\\n \",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n n, m = len(dungeon), len(dungeon[0])\\n storage = [[1 for _ in range(m)] for _ in range(n)]\\n storage[-1][-1] = min(dungeon[-1][-1], 0)\\n stack = [(n - 1, m - 1)]\\n def get_dependency(a, b):\\n res = []\\n if a + 1 < n:\\n res.append((a + 1, b))\\n if b + 1 < m:\\n res.append((a, b + 1))\\n return res\\n def is_ready(a, b):\\n if a + 1 < n and storage[a + 1][b] == 1:\\n return False\\n if b + 1 < m and storage[a][b + 1] == 1:\\n return False\\n return True\\n def is_visited(a, b):\\n return storage[a][b] != 1\\n def get_next(a, b):\\n res = []\\n if a - 1 >= 0 and is_ready(a - 1, b) and not is_visited(a - 1, b):\\n res.append((a - 1, b))\\n if b - 1 >= 0 and is_ready(a, b - 1) and not is_visited(a, b - 1):\\n res.append((a, b - 1))\\n return res\\n while stack:\\n cur = stack[-1]\\n stack = stack[:-1]\\n candidates = get_next(*cur)\\n for cand in candidates:\\n a, b = cand\\n dependencies = get_dependency(a, b)\\n smallest_damage = -1 * 10 ** 9\\n for dep in dependencies:\\n c, d = dep\\n smallest_damage = max(storage[c][d], smallest_damage)\\n if storage[c][d] > smallest_damage:\\n smallest_damage = storage[c][d]\\n cand_damage = min(smallest_damage, 0) + dungeon[a][b]\\n storage[a][b] = min(cand_damage, 0)\\n stack.append(cand)\\n return 1 + storage[0][0] * -1\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n memo = {}\\n\\n def minimumHealth(i, j) -> int:\\n if i >= len(dungeon) or j >= len(dungeon[0]):\\n return None\\n\\n if (i, j) in memo:\\n return memo[(i, j)]\\n\\n down = minimumHealth(i + 1, j)\\n right = minimumHealth(i, j + 1)\\n\\n if down and right:\\n minPath = min(down, right)\\n\\n elif down:\\n minPath = down\\n\\n elif right:\\n minPath = right\\n\\n else: # at the end\\n if dungeon[i][j] >= 0:\\n memo[(i, j)] = 1\\n\\n else:\\n memo[(i, j)] = dungeon[i][j] * -1 + 1\\n \\n return memo[(i, j)]\\n \\n memo[(i, j)] = max(minPath - dungeon[i][j], 1)\\n return memo[(i, j)]\\n\\n return minimumHealth(0, 0)\\n\\n \\n\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n\\n n = len(dungeon)\\n m = len(dungeon[0])\\n\\n h = {}\\n\\n\\n def dfs(i, j, val, minVal):\\n\\n if i == n-1 and j == m-1:\\n return dungeon[i][j]\\n\\n key = (i, j)\\n\\n if key in h:\\n return h[key]\\n \\n res = float('-inf')\\n\\n if i + 1 < n:\\n res = max(res, dfs(i+1, j, val, minVal))\\n \\n if j + 1 < m:\\n res = max(res, dfs(i, j+1, val, minVal))\\n \\n h[key] = min(res + dungeon[i][j], dungeon[i][j])\\n return h[key]\\n \\n \\n\\n res = dfs(0, 0, 0, 1)\\n\\n if res > 0:\\n return 1\\n\\n return abs(res) + 1\\n\\n \",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"# f(i, j) = max(1, -dungeon[i][j] + min(f(i+1, j), f(i, j+1)))\\n# base case : if i == n-1. and j == m-1, return max(1, -dungeon[n-1][m-1] + 1)\\n# return f(0, 0)\\n\\nclass Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n n, m = len(dungeon), len(dungeon[0])\\n dp = [[-1 for j in range(m)] for i in range(n)]\\n def helper(i, j):\\n if i == n-1 and j == m-1:\\n return max(1, -dungeon[i][j] + 1)\\n if dp[i][j] != -1:\\n return dp[i][j]\\n count = float('inf')\\n if i + 1 < n:\\n count = min(count, helper(i+1, j))\\n if j + 1 < m:\\n count = min(count, helper(i, j+1))\\n count = max(1, -dungeon[i][j] + count)\\n dp[i][j] = count\\n return count\\n ans= helper(0, 0)\\n return ans\\n \",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n n, m = len(dungeon), len(dungeon[0])\\n\\n # dp = [ [ 0 for _ in range(m) ] for _ in range(n) ]\\n # dp = 1 if dungeon[0][0] > 0 else abs(dungeon[0][0]) + 1\\n # for i in range(1, m):\\n # dungeon[0][i] = (1, dungeon[0][i - 1] + (1 - dunfeon[0][i])\\n # for i in range(1, m):\\n # dungeon[i] += dungeon[i - 1]\\n \\n # for i in range(1, n):\\n # for j in range(1, m):\\n\\n @cache\\n def dp(row, col):\\n print(row, col)\\n if row == n - 1 and col == m - 1:\\n return 1 if dungeon[row][col] > 0 else abs(dungeon[row][col]) + 1\\n left = float(\\\"inf\\\") if col >= m - 1 else dp(row, col + 1)\\n bottom = float(\\\"inf\\\") if row >= n - 1 else dp(row + 1, col)\\n \\n return min( max(1, left - dungeon[row][col]), max(1, bottom - dungeon[row][col]) )\\n return dp(0, 0)\\n\\n \",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, arr: List[List[int]]) -> int:\\n n = len(arr)\\n m = len(arr[0])\\n def solve(idx1, idx2, cache):\\n if idx1 >= n or idx2 >= m:\\n return float('inf')\\n if idx1 == n-1 and idx2 == m-1:\\n return 1 if arr[-1][-1] >= 0 else -arr[-1][-1] + 1\\n \\n if (idx1, idx2) in cache:\\n return cache[(idx1, idx2)]\\n \\n option1 = solve(idx1 + 1, idx2, cache)\\n option2 = solve(idx1, idx2 + 1, cache)\\n cache[(idx1, idx2)] = min(option1, option2) - arr[idx1][idx2]\\n if cache[(idx1, idx2)] <= 0:\\n cache[(idx1, idx2)] = 1\\n return cache[(idx1, idx2)]\\n cache = {}\\n res = solve(0, 0, cache)\\n print(cache)\\n return res\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n\\n n = len(dungeon)\\n m = len(dungeon[0])\\n\\n h = {}\\n\\n\\n def dfs(i, j, val, minVal):\\n\\n if i == n-1 and j == m-1:\\n return dungeon[i][j]\\n\\n key = (i, j)\\n\\n if key in h:\\n return h[key]\\n \\n res = float('-inf')\\n\\n if i + 1 < n:\\n res = max(res, dfs(i+1, j, val, minVal))\\n \\n if j + 1 < m:\\n res = max(res, dfs(i, j+1, val, minVal))\\n \\n h[key] = min(res + dungeon[i][j], dungeon[i][j])\\n return h[key]\\n \\n \\n\\n res = dfs(0, 0, 0, 1)\\n\\n if res > 0:\\n return 1\\n\\n return abs(res) + 1\\n\\n \",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n atLeast = [[0 for i in range(len(dungeon[0]))] for j in range(len(dungeon))]\\n\\n for i in range(len(dungeon)-1, -1, -1):\\n for j in range(len(dungeon[0])-1, -1, -1):\\n if i == len(dungeon) - 1 and j == len(dungeon[0]) - 1:\\n atLeast[i][j] = max(1, (-1)*dungeon[i][j]+1)\\n else:\\n atLeast[i][j] = max(1, (-1)*dungeon[i][j]+1)\\n if i >= len(dungeon)-1:\\n atLeast[i][j] = max(atLeast[i][j], (-1)*dungeon[i][j] + atLeast[i][j+1])\\n elif j >= len(dungeon[0])-1:\\n atLeast[i][j] = max(atLeast[i][j], (-1)*dungeon[i][j] + atLeast[i+1][j])\\n else:\\n atLeast[i][j] = max(atLeast[i][j], min((-1)*dungeon[i][j] + atLeast[i][j+1], (-1)*dungeon[i][j] + atLeast[i+1][j]))\\n print(i, j, atLeast[i][j])\\n \\n return atLeast[0][0]\",\n \"runtime\": \"93\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n dp = [[float('inf') for _ in range(n+1)] for _ in range(m+1)]\\n for i in range(m-1,-1,-1):\\n for j in range(n-1,-1,-1):\\n if i == m-1 and j == n-1:\\n print(\\\"1:\\\")\\n print(i, j)\\n require = 0\\n elif j == n-1:\\n print(\\\"2:\\\")\\n print(i, j) \\n require = max(dp[i+1][j], 0)\\n \\n elif i == m-1:\\n print(\\\"3:\\\")\\n print(i, j)\\n require = max(dp[i][j+1], 0)\\n else:\\n print(\\\"4:\\\")\\n print(i, j) \\n require = max(min(dp[i+1][j], dp[i][j+1]),0)\\n \\n print(require)\\n if dungeon[i][j] >= 0:\\n dp[i][j] = max(require - dungeon[i][j], 1)\\n else:\\n dp[i][j] = max(require - dungeon[i][j], -dungeon[i][j] + 1)\\n return dp[0][0]\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m = len(dungeon)\\n n = len(dungeon[0])\\n \\n pq = [(max(1, 1 - dungeon[-1][-1]), m - 1, n - 1)]\\n dist = [[float('inf')] * n for _ in range(m)]\\n dist[-1][-1] = max(1, 1 - dungeon[-1][-1])\\n directions = [(-1, 0), (0, -1)]\\n \\n while pq:\\n curr, x, y = heapq.heappop(pq)\\n for dx, dy in directions:\\n nx, ny = x + dx, y + dy\\n if 0 <= nx < m and 0 <= ny < n:\\n req = max(1, curr - dungeon[nx][ny])\\n if req < dist[nx][ny]:\\n dist[nx][ny] = req\\n heapq.heappush(pq, (req, nx, ny))\\n return dist[0][0]\\n\\n\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n directions = [(-1,0), (0,-1)]\\n # dp[(x,y)] = [lowest health needed to get from (x,y) to end]\\n dp = {(len(dungeon)-1,len(dungeon[0])-1): -dungeon[-1][-1] + 1}\\n queue = deque([(len(dungeon)-1,len(dungeon[0])-1)])\\n \\n for i in range(len(dungeon)-1 + len(dungeon[0])-1):\\n new_queue = deque()\\n while(queue):\\n x,y = queue.popleft()\\n for dx,dy in directions:\\n if 0 <= x+dx < len(dungeon) and 0 <= y+dy < len(dungeon[x+dx]):\\n if (x+dx, y+dy) not in dp:\\n dp[(x+dx, y+dy)] = dp[(x,y)] - dungeon[x+dx][y+dy]\\n new_queue.append((x+dx,y+dy))\\n else:\\n dp[(x+dx, y+dy)] = min(dp[(x+dx,y+dy)], dp[(x,y)] - dungeon[x+dx][y+dy])\\n for (x,y) in new_queue:\\n dp[(x,y)] = max(dp[(x,y)], -dungeon[x][y] + 1)\\n queue = new_queue\\n print(dp)\\n return max(dp[(0,0)], 1)\\n \\n \\n # while queue:\\n # new_queue = deque()\\n # while(queue):\\n # x,y = queue.popleft()\\n # for dx,dy in directions:\\n # if 0 <= x+dx < len(dungeon) and 0 <= y+dy < len(dungeon[x+dx]):\\n # if (x+dx, y+dy) not in dp:\\n # dp[(x+dx,y+dy)] = [dp[(x,y)][0] + dungeon[x+dx][y+dy],\\n # min(dp[(x,y)][1], dp[(x,y)][0] + dungeon[x+dx][y+dy])]\\n # new_queue.append((x+dx,y+dy))\\n # else:\\n # dp[(x+dx,y+dy)][0] = max(dp[(x+dx,y+dy)][0], dp[(x,y)][0] + dungeon[x+dx][y+dy])\\n # new_way = min(dungeon[x][y], dp[(x,y)][0] + dungeon[x+dx][y+dy])\\n # dp[(x+dx,y+dy)][1] = max(dp[(x+dx,y+dy)][1], new_way)\\n # queue = new_queue\\n # print(dp)\\n # if dp[(len(dungeon)-1, len(dungeon[0])-1)][1] < 0:\\n # return -dp[(len(dungeon)-1, len(dungeon[0])-1)][1] + 1\\n # else:\\n # return 1\\n \",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n n = len(dungeon)\\n m = len(dungeon[0])\\n\\n dp = [[100**100 for _ in range(m+1)] for _ in range(n+1)]\\n print(dp)\\n \\n for i in range(n-1, -1, -1):\\n for j in range(m-1, -1, -1):\\n print(i,j)\\n if i is n-1 and j is m-1:\\n dp[i][j] = max(1, -dungeon[i][j] + 1)\\n continue\\n dp[i][j] = max(1, min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j])\\n return dp[0][0]\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"import heapq\\nfrom typing import List\\n\\nclass Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m = len(dungeon)\\n n = len(dungeon[0])\\n \\n pq = [(max(1, 1 - dungeon[-1][-1]), m - 1, n - 1)]\\n dist = [[float('inf')] * n for _ in range(m)]\\n dist[-1][-1] = max(1, 1 - dungeon[-1][-1])\\n directions = [(-1, 0), (0, -1)]\\n \\n while pq:\\n curr_health, x, y = heapq.heappop(pq)\\n for dx, dy in directions:\\n nx, ny = x + dx, y + dy\\n if 0 <= nx < m and 0 <= ny < n:\\n req = max(1, curr_health - dungeon[nx][ny])\\n if req < dist[nx][ny]:\\n dist[nx][ny] = req\\n heapq.heappush(pq, (req, nx, ny))\\n \\n return dist[0][0]\\n\\n\",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"from pprint import pprint\\nimport heapq\\nclass Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n pprint(dungeon)\\n\\n n,m = len(dungeon), len(dungeon[0]) \\n #@cache \\n #memo = [[-1] * m for _ in range(n)]\\n \\n @cache \\n def dfs(i,j):\\n \\n\\n if i == n-1 and j == m -1:\\n return 1 if dungeon[i][j] >= 0 else -dungeon[i][j] + 1\\n \\n if i == n or j == m:\\n return 10000\\n\\n res = dungeon[i][j] - min(\\n dfs(i,j+1),\\n dfs(i+1,j)\\n ) \\n res = 1 if res >= 0 else -res \\n return res \\n # memo[i][j] = 1 if res >= 0 else -res \\n # return memo[i][j]\\n \\n return dfs(0,0)\\n \\n \",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n n,m=len(dungeon),len(dungeon[0])\\n memo=[[-1 for _ in range(201)] for _ in range(201)]\\n\\n def dp(r,c):\\n if r>=n or c>=m:\\n return float('inf')\\n \\n if r==n-1 and c==m-1:\\n if dungeon[r][c]<0:\\n return 1 - dungeon[r][c]\\n return 1\\n\\n if memo[r][c] == -1:\\n val=min(dp(r+1,c),dp(r,c+1))\\n\\n if dungeon[r][c]>=val:\\n memo[r][c]=1\\n else:\\n memo[r][c]=val - dungeon[r][c]\\n\\n return memo[r][c]\\n\\n return dp(0,0)\\n\",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n dp = [[list() for _ in range(n)] for _ in range(m)]\\n \\n def getHealth(health, d):\\n h, c = health\\n if c + d <= 0:\\n return (h + 1 - (c + d), 1)\\n else:\\n return (h, c + d)\\n dp[0][0].append(getHealth((1,1), dungeon[0][0]))\\n\\n for i in range(1, m):\\n dp[i][0].append(getHealth(dp[i-1][0][0], dungeon[i][0]))\\n for j in range(1, n):\\n dp[0][j].append(getHealth(dp[0][j-1][0], dungeon[0][j]))\\n \\n for i in range(1, m):\\n for j in range(1, n):\\n d = dungeon[i][j]\\n best = defaultdict(lambda: -math.inf)\\n for health in chain(dp[i-1][j], dp[i][j-1]):\\n h, c = getHealth(health, d)\\n best[h] = max(best[h], c - h)\\n h = min(best)\\n d = best[h]\\n dp[i][j].append((h, h + d))\\n for h1, d1 in sorted(best.items())[1:]:\\n if d1 > d:\\n dp[i][j].append((h1, h1 + d1))\\n d = d1\\n\\n # print(dp)\\n return min(dp[m-1][n-1])[0]\",\n \"runtime\": \"125\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n\\n def check(health):\\n dp = dungeon[0][:]\\n dp[0] += health\\n if dp[0] <= 0:\\n return False\\n for i in range(1, len(dp)):\\n dp[i] += dp[i - 1]\\n if dp[i] <= 0:\\n dp[i] = -inf\\n for r in range(1, m):\\n curr = dungeon[r][:]\\n for c in range(n):\\n if c == 0:\\n curr[c] += dp[c]\\n else:\\n curr[c] += max(dp[c], curr[c - 1])\\n if curr[c] <= 0:\\n curr[c] = -inf\\n dp = curr[:]\\n return dp[-1] > 0\\n\\n left = 1\\n right = 1\\n for row in dungeon:\\n for val in row:\\n if val < 0:\\n right -= val\\n while left <= right:\\n mid = (left + right) // 2\\n if check(mid):\\n right = mid - 1\\n else:\\n left = mid + 1\\n return left\\n\",\n \"runtime\": \"126\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n left = 0\\n right = 0\\n m = len(dungeon)\\n n = len(dungeon[0])\\n print(m, n)\\n s = 0\\n if m == 1 and n == 1:\\n right = abs(dungeon[0][0]) + 1\\n else:\\n if n > 1:\\n for j in range(n):\\n s += dungeon[0][j]\\n print(s)\\n if s <= 0:\\n right -= s - 1\\n if m > 1:\\n for i in range(m):\\n s += dungeon[i][n - 1]\\n if s <= 0:\\n right -= s - 1\\n INF = -100000000\\n val = 0\\n print(right)\\n while left <= right:\\n mid = (left + right) // 2\\n F = [ [0] * n for i in range(m)]\\n F[0][0] = mid + dungeon[0][0]\\n if F[0][0] <= 0:\\n left = mid + 1\\n else:\\n for i in range(1, m):\\n F[i][0] = F[i - 1][0] + dungeon[i][0]\\n if F[i][0] <= 0:\\n F[i][0] = INF\\n\\n for j in range(1, n):\\n F[0][j] = F[0][j - 1] + dungeon[0][j]\\n if F[0][j] <= 0:\\n F[0][j] = INF\\n\\n for i in range(1, m):\\n for j in range(1, n):\\n F[i][j] = max(F[i - 1][j], F[i][j - 1]) + dungeon[i][j]\\n if F[i][j] <= 0:\\n F[i][j] = INF\\n if F[m - 1][n - 1] <= 0:\\n left = mid + 1\\n else:\\n right = mid - 1\\n val = mid\\n\\n return val if val > 0 else 1\\n\",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n R = len(dungeon)\\n C = len(dungeon[0])\\n\\n BIG = 1000 * 400\\n best = [[0] * C for _ in range(R)]\\n\\n def check(t):\\n if t <= 0:\\n return False\\n for r in range(R):\\n for c in range(C):\\n best[r][c] = -BIG\\n heap = []\\n if t + dungeon[0][0] > 0 and best[0][0] < t + dungeon[0][0]:\\n heapq.heappush(heap, (-t - dungeon[0][0], 0, 0))\\n best[0][0] = t + dungeon[0][0]\\n while heap:\\n energy, r, c = heapq.heappop(heap)\\n energy = -energy\\n if r == R - 1 and c == C - 1 and energy > 0:\\n return True\\n if r + 1 < R:\\n new_energy = energy + dungeon[r + 1][c]\\n if new_energy > 0 and best[r + 1][c] < new_energy:\\n heapq.heappush(heap, (-new_energy, r + 1, c))\\n best[r + 1][c] = new_energy\\n if c + 1 < C:\\n new_energy = energy + dungeon[r][c + 1]\\n if new_energy > 0 and best[r][c + 1] < new_energy:\\n heapq.heappush(heap, (-new_energy, r, c + 1))\\n best[r][c + 1] = new_energy\\n return False\\n \\n lo, hi = 0, BIG\\n while hi - lo > 1:\\n mid = (lo + hi) // 2\\n if check(mid):\\n hi = mid\\n else:\\n lo = mid\\n return hi\\n\",\n \"runtime\": \"131\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n dp = [[list() for _ in range(n)] for _ in range(m)]\\n \\n def healthMinCur(health, d):\\n h, c = health\\n if c + d <= 0:\\n return (h + 1 - (c + d), 1)\\n else:\\n return (h, c + d)\\n dp[0][0].append(healthMinCur((1,1), dungeon[0][0]))\\n\\n for i in range(1, m):\\n dp[i][0].append(healthMinCur(dp[i-1][0][0], dungeon[i][0]))\\n for j in range(1, n):\\n dp[0][j].append(healthMinCur(dp[0][j-1][0], dungeon[0][j]))\\n \\n for i in range(1, m):\\n for j in range(1, n):\\n d = dungeon[i][j]\\n best = defaultdict(lambda: -math.inf)\\n for health in chain(dp[i-1][j], dp[i][j-1]):\\n h, c = healthMinCur(health, d)\\n best[h] = max(best[h], c - h)\\n h = min(best)\\n d = best[h]\\n dp[i][j].append((h, h + d))\\n for h1, d1 in sorted(best.items())[1:]:\\n if d1 > d:\\n dp[i][j].append((h1, h1 + d1))\\n d = d1\\n\\n print(dp)\\n return min(dp[m-1][n-1])[0]\",\n \"runtime\": \"141\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":67,"string":"67"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n height, width = len(dungeon), len(dungeon[0])\n m, n = height - 1, width - 1\n dp = [ [0] * width for _ in range(height) ]\n dp[m][n] = max(1,1 - dungeon[m][n])\n for r in range(m-1,-1,-1):\n dp[r][n] = max(1,dp[r+1][n] - dungeon[r][n])\n for c in range(n-1,-1,-1):\n dp[m][c] = max(1, dp[m][c+1] - dungeon[m][c])\n for r in range(m-1,-1,-1):\n for c in range(n-1,-1,-1):\n dp[r][c] = max(1, min( dp[r+1][c], dp[r][c+1] ) - dungeon[r][c] )\n return dp[0][0]\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(Solution().calculateMinimumHP(nums),file=f)\nexit(0)\n\n\n ","memory":"17100"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n n, m = len(dungeon), len(dungeon[0])\n dp = [[0]*m for i in range(n)]\n dp[-1][-1] = max(1, -dungeon[-1][-1]+1)\n for i in range(n-1, -1, -1):\n for j in range(m-1,-1,-1):\n if(i == n-1 and j == m-1):\n continue\n right = float(\"inf\") if j == m-1 else dp[i][j+1]\n below = float(\"inf\") if i == n-1 else dp[i+1][j]\n dp[i][j] = max(1, min(right, below) - dungeon[i][j])\n return dp[0][0]\n","memory":"17200"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: list[list[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n dp = [[0] * n for _ in range(m)]\n dp[-1][-1] = max(1, 1 - dungeon[-1][-1])\n for i in range(m - 2, -1, -1):\n dp[i][-1] = max(1, dp[i + 1][-1] - dungeon[i][-1])\n for j in range(n - 2, -1, -1):\n dp[-1][j] = max(1, dp[-1][j + 1] - dungeon[-1][j])\n for i in range(m - 2, -1, -1):\n for j in range(n - 2, -1, -1):\n down = max(1, dp[i + 1][j] - dungeon[i][j])\n right = max(1, dp[i][j + 1] - dungeon[i][j])\n dp[i][j] = min(down, right)\n return dp[0][0]\n","memory":"17300"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\n dp[m][n-1] = dp[m-1][n] = 1\n \n for i in range(m-1, -1, -1):\n for j in range(n-1, -1, -1):\n min_health = min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j]\n dp[i][j] = max(min_health, 1)\n \n return dp[0][0]\n","memory":"17400"},{"code":"class Solution:\n def calculateMinimumHP(self, grid: List[List[int]]) -> int:\n INF = float('inf')\n rows = len(grid)\n cols = len(grid[0])\n if rows == 1 and cols == 1:\n if grid[0][0] >= 0:\n return 1\n return -grid[0][0] + 1\n dp = [[INF] * cols for i in range(rows)]\n dp[rows - 1][cols - 1] = max(1, 1 - grid[rows - 1][cols - 1])\n for r in range(rows-2,-1,-1):\n dp[r][cols-1] = max(1, dp[r + 1][cols-1] - grid[r][cols-1])\n for c in range(cols-2,-1,-1):\n dp[rows - 1][c] = max(1, dp[rows - 1][c + 1] - grid[rows - 1][c])\n for r in range(rows - 2, -1 , -1):\n for c in range(cols - 2 , -1 , -1):\n need = min(dp[r + 1][c], dp[r][c + 1])\n dp[r][c] = max(1, need - grid[r][c])\n return dp[0][0]\n ","memory":"17500"},{"code":"from collections import deque\nclass Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m,n=len(dungeon),len(dungeon[0])\n dp=[[float('inf')]*(n+1) for _ in range(m+1)]\n dp[m][n-1]=dp[m-1][n]=1\n for i in range(m-1,-1,-1):\n for j in range(n-1,-1,-1):\n mh=min(dp[i+1][j],dp[i][j+1])-dungeon[i][j]\n dp[i][j]=max(mh,1)\n return dp[0][0]","memory":"17500"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n dp = [[1e9]*n for _ in range(m)]\n \n for i in range(m-1, -1, -1):\n for j in range(n-1, -1,-1):\n if i==m-1 and j==n-1:\n dp[i][j] = -dungeon[i][j]+1 if dungeon[i][j]<0 else 1\n continue\n right = dp[i][j + 1] if j < n - 1 else float('inf')\n down = dp[i + 1][j] if i < m - 1 else float('inf')\n dp[i][j] = max(1, min(right, down) - dungeon[i][j])\n return dp[0][0] if dp[0][0]>0 else 1\n\n ","memory":"17600"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n \n # Create a 2D dp array initialized with infinity\n dp = [[float('inf')] * n for _ in range(m)]\n \n # Bottom-up approach: start from the princess's cell\n dp[m-1][n-1] = max(1, 1 - dungeon[m-1][n-1])\n \n # Fill the last row (bottom row)\n for j in range(n-2, -1, -1):\n dp[m-1][j] = max(1, dp[m-1][j+1] - dungeon[m-1][j])\n \n # Fill the last column (rightmost column)\n for i in range(m-2, -1, -1):\n dp[i][n-1] = max(1, dp[i+1][n-1] - dungeon[i][n-1])\n \n # Fill the rest of the dp table\n for i in range(m-2, -1, -1):\n for j in range(n-2, -1, -1):\n min_health_on_exit = min(dp[i+1][j], dp[i][j+1])\n dp[i][j] = max(1, min_health_on_exit - dungeon[i][j])\n \n return dp[0][0]\n","memory":"17600"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n dp = [[1e9]*n for _ in range(m)]\n \n for i in range(m-1, -1, -1):\n for j in range(n-1, -1,-1):\n if i==m-1 and j==n-1:\n dp[i][j] = -dungeon[i][j]+1 if dungeon[i][j]<0 else 1\n continue\n elif j+1>n-1:\n res = dp[i+1][j]- dungeon[i][j]\n elif i+1>m-1:\n res = dp[i][j+1]- dungeon[i][j]\n else:\n res = min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j]\n dp[i][j] = res if res >0 else 1\n return dp[0][0] if dp[0][0]>0 else 1\n\n ","memory":"17700"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n \n m=len(dungeon)\n n=len(dungeon[0])\n dp=[[float('inf')]*(n+1) for i in range(m+1)]\n dp[m][n-1]=dp[m-1][n]=1\n min_health=1\n for i in range(m-1,-1,-1):\n for j in range(n-1,-1,-1):\n min_health=min(dp[i][j+1],dp[i+1][j])\n dp[i][j]=max(1,min_health-dungeon[i][j])\n return dp[0][0]\n \n \n \n","memory":"17700"},{"code":"class Solution:\n def is_valid(self, dungeon: List[List[int]], m: int, n: int, health: int) -> bool:\n if health+dungeon[0][0] <= 0:\n return False\n dp = [[-1]*n for _ in range(m)]\n dp[0][0] = health+dungeon[0][0]\n for i in range(1, m):\n if dp[i-1][0] > 0 and dp[i-1][0]+dungeon[i][0] > 0:\n dp[i][0] = dp[i-1][0]+dungeon[i][0]\n for j in range(1, n):\n if dp[0][j-1] > 0 and dp[0][j-1]+dungeon[0][j] > 0:\n dp[0][j] = dp[0][j-1]+dungeon[0][j]\n \n for i in range(1,m):\n for j in range(1,n):\n res = -1\n if dp[i-1][j]>0 and dp[i-1][j]+dungeon[i][j] > 0:\n res = max(res, dp[i-1][j]+dungeon[i][j])\n if dp[i][j-1]>0 and dp[i][j-1]+dungeon[i][j] > 0:\n res = max(res, dp[i][j-1]+dungeon[i][j])\n dp[i][j] = res\n \n return dp[m-1][n-1] > 0\n \n \n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m = len(dungeon)\n n = len(dungeon[0])\n lo, hi = 1, 4*10**7+1\n while lo < hi:\n mid = (lo+hi)//2\n res = self.is_valid(dungeon, m, n, mid)\n if res:\n hi = mid\n else:\n lo = mid+1\n # print(\"debug: res is {} for health={}\".format(self.is_valid(dungeon, m, n, 3), 3))\n return lo","memory":"17800"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n\n m, n = len(dungeon), len(dungeon[0])\n\n dp = [[0 for _ in range(n+1)] for _ in range(m+1)]\n\n def minPath():\n for i in range(m - 1, -1, -1):\n for j in range(n - 1, -1, -1):\n if i == m - 1 and j == n - 1:\n dp[i][j] = 1 + max(0, - dungeon[i][j])\n else:\n val_h = 1e10 if i + 1 > m - 1 else dp[i + 1][j]\n val_v = 1e10 if j + 1 > n - 1 else dp[i][j + 1]\n dp[i][j] = max(1, - dungeon[i][j] + min(val_h, val_v))\n\n return dp[0][0]\n\n return minPath()\n\n \n\n ","memory":"17900"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n rows = len(dungeon)\n cols = len(dungeon[0])\n grid = [[0 for i in range(cols)] for i in range(rows)]\n\n grid[rows-1][cols-1] = dungeon[rows-1][cols-1]\n \n for i in range(rows-2, -1, -1):\n grid[i][cols-1] = dungeon[i][cols-1] + grid[i+1][cols-1]\n if grid[i][cols-1] > -1 :\n grid[i][cols-1] = 0\n\n for i in range(cols-2, -1, -1):\n grid[rows-1][i] = dungeon[rows-1][i] + grid[rows-1][i+1]\n if grid[rows-1][i] > -1:\n grid[rows-1][i] = 0\n\n for i in range(rows-1, -1, -1):\n for j in range(cols-1, -1, -1):\n if i < rows-1 and j < cols-1:\n grid[i][j] = dungeon[i][j] + max(grid[i+1][j], grid[i][j+1])\n elif i < rows-1:\n grid[i][j] = dungeon[i][j] + grid[i+1][j]\n elif j < cols-1:\n grid[i][j] = dungeon[i][j] + grid[i][j+1]\n\n if grid[i][j] > -1:\n grid[i][j] = 0\n\n if grid[0][0] >= 0: return 1\n else: return -(grid[0][0]-1)\n","memory":"17900"},{"code":"from typing import List\n\nclass Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n \n m = len(dungeon)\n n = len(dungeon[0])\n \n # Initialize memoization table with None (for uncalculated states)\n memo = [[None] * n for _ in range(m)]\n \n # Define the recursive function with memoization\n def solve(i, j):\n # If we go out of bounds, return a very large number (invalid path)\n if i >= m or j >= n:\n return float('inf')\n \n # If we are at the bottom-right cell, calculate the minimum health\n if i == m - 1 and j == n - 1:\n return max(1, 1 - dungeon[i][j])\n \n # If the result has already been computed, return it\n if memo[i][j] is not None:\n return memo[i][j]\n \n # Recursively calculate the minimum health needed by moving right or down\n right = solve(i, j + 1)\n down = solve(i + 1, j)\n \n # Choose the path that requires less health\n min_health_on_exit = min(right, down)\n \n # Calculate the minimum health needed to enter the current cell\n memo[i][j] = max(1, min_health_on_exit - dungeon[i][j])\n \n return memo[i][j]\n \n # Start the recursion from the top-left corner\n return solve(0, 0)\n","memory":"18000"},{"code":"class Solution:\n def is_valid(self, dungeon: List[List[int]], m: int, n: int, health: int) -> bool:\n if health+dungeon[0][0] <= 0:\n return False\n dp = [[-1]*n for _ in range(m)]\n dp[0][0] = health+dungeon[0][0]\n for i in range(1, m):\n if dp[i-1][0] > 0 and dp[i-1][0]+dungeon[i][0] > 0:\n dp[i][0] = dp[i-1][0]+dungeon[i][0]\n for j in range(1, n):\n if dp[0][j-1] > 0 and dp[0][j-1]+dungeon[0][j] > 0:\n dp[0][j] = dp[0][j-1]+dungeon[0][j]\n \n for i in range(1,m):\n for j in range(1,n):\n res = -1\n if dp[i-1][j]>0 and dp[i-1][j]+dungeon[i][j] > 0:\n res = max(res, dp[i-1][j]+dungeon[i][j])\n if dp[i][j-1]>0 and dp[i][j-1]+dungeon[i][j] > 0:\n res = max(res, dp[i][j-1]+dungeon[i][j])\n dp[i][j] = res\n \n return dp[m-1][n-1] > 0\n \n \n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m = len(dungeon)\n n = len(dungeon[0])\n lo, hi = 1, 10**8\n while lo < hi:\n mid = (lo+hi)//2\n res = self.is_valid(dungeon, m, n, mid)\n if res:\n hi = mid\n else:\n lo = mid+1\n # print(\"debug: res is {} for health={}\".format(self.is_valid(dungeon, m, n, 3), 3))\n return lo","memory":"18000"},{"code":"\n\nclass Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n n, m = len(dungeon), len(dungeon[0])\n dp = [[-1 for j in range(m)] for i in range(n)]\n def helper(i, j):\n if i == n-1 and j == m-1:\n return 1\n if dp[i][j] != -1:\n return dp[i][j]\n count = float('inf')\n if i + 1 < n:\n count = min(count, -dungeon[i+1][j] + helper(i+1, j))\n if j + 1 < m:\n count = min(count, -dungeon[i][j+1] + helper(i, j+1))\n count = max(1, count)\n dp[i][j] = count\n return count\n return max(1, helper(0, 0) - dungeon[0][0])\n ","memory":"18100"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n n, m = len(dungeon), len(dungeon[0])\n storage = [[1 for _ in range(m)] for _ in range(n)]\n storage[-1][-1] = min(dungeon[-1][-1], 0)\n stack = [(n - 1, m - 1)]\n def get_dependency(a, b):\n res = []\n if a + 1 < n:\n res.append((a + 1, b))\n if b + 1 < m:\n res.append((a, b + 1))\n return res\n def is_ready(a, b):\n if a + 1 < n and storage[a + 1][b] == 1:\n return False\n if b + 1 < m and storage[a][b + 1] == 1:\n return False\n return True\n def get_next(a, b):\n res = []\n if a - 1 >= 0 and is_ready(a - 1, b):\n res.append((a - 1, b))\n if b - 1 >= 0 and is_ready(a, b - 1):\n res.append((a, b - 1))\n return res\n while stack:\n cur = stack[-1]\n stack = stack[:-1]\n candidates = get_next(*cur)\n for cand in candidates:\n a, b = cand\n dependencies = get_dependency(a, b)\n smallest_damage = -1 * 10 ** 9\n for dep in dependencies:\n c, d = dep\n smallest_damage = max(storage[c][d], smallest_damage)\n if storage[c][d] > smallest_damage:\n smallest_damage = storage[c][d]\n cand_damage = min(smallest_damage, 0) + dungeon[a][b]\n storage[a][b] = min(cand_damage, 0)\n stack.append(cand)\n print(storage)\n return 1 + storage[0][0] * -1","memory":"18100"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n rows, cols = len(dungeon), len(dungeon[0])\n \n dp = [[float(\"infinity\") for i in range(cols + 1)] for j in range(rows + 1)]\n print(dp)\n \n dp[rows][cols-1] = dp[rows-1][cols] = 1\n \n for i in range(rows-1, -1, -1): \n for j in range(cols-1, -1, -1): \n minhealth = min(dp[i + 1][j], dp[i][j+1])\n dp[i][j] = max(minhealth - dungeon[i][j], 1)\n \n \n return dp[0][0]","memory":"18200"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n rows, cols = len(dungeon), len(dungeon[0])\n \n dp = [[float(\"infinity\") for i in range(cols + 1)] for j in range(rows + 1)]\n print(dp)\n \n dp[rows][cols-1] = dp[rows-1][cols] = 1\n \n for i in range(rows-1, -1, -1): \n for j in range(cols-1, -1, -1): \n minhealth = min(dp[i + 1][j], dp[i][j+1])\n dp[i][j] = max(minhealth - dungeon[i][j], 1)\n \n \n return dp[0][0]","memory":"18300"},{"code":"from sortedcontainers import SortedKeyList\n\nclass Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n hp = []\n for i in range(m + 1):\n temp = []\n for j in range(n + 1):\n temp.append(float('inf'))\n hp.append(temp)\n \n hp[m - 1][n], hp[m][n - 1] = 1, 1 #make sure the first choice is correct\n \n #hp[i][j] = min hp required to get from here to end\n for i in range(m)[::-1]:\n for j in range(n)[::-1]:\n #hp needed is either going down then going to end or going right then going to end\n #then adding hp needed to get to this spot\n #if minusing the value at i, j is less then 1 that means this i,j value gives enough\n #hp to fix everythign\n hp[i][j] = max( min(hp[i + 1][j], hp[i][j + 1]) - dungeon[i][j], 1 )\n \n return hp[0][0]\n\n\n\n","memory":"18400"},{"code":"class Solution:\n def calculateMinimumHPDP(self, dungeon, DP, health, i, j):\n if DP[i][j] is not None:\n return DP[i][j]\n\n m = len(dungeon)\n n = len(dungeon[0])\n\n if i == m - 1 and j == n - 1:\n DP[i][j] = min(health[i][j], 0)\n elif i == m - 1:\n DP[i][j] = min(self.calculateMinimumHPDP(dungeon, DP, health, i, j+1) + dungeon[i][j], 0)\n elif j == n - 1:\n DP[i][j] = min(self.calculateMinimumHPDP(dungeon, DP, health, i+1, j) + dungeon[i][j], 0)\n else:\n DP[i][j] = min(max(self.calculateMinimumHPDP(dungeon, DP, health, i, j+1),\n self.calculateMinimumHPDP(dungeon, DP, health, i+1, j)) + dungeon[i][j], 0)\n return DP[i][j]\n\n def computeMinHealth(self, dungeon):\n m = len(dungeon)\n n = len(dungeon[0])\n health = [[None for _ in range(n)] for _ in range(m)]\n\n for i in range(m):\n for j in range(n):\n ind_i = m - i - 1\n ind_j = n - j - 1\n if ind_i == m - 1 and ind_j == n - 1:\n health[ind_i][ind_j] = dungeon[ind_i][ind_j]\n elif ind_i == m - 1:\n health[ind_i][ind_j] = min(dungeon[ind_i][ind_j], dungeon[ind_i][ind_j] + health[ind_i][ind_j+1])\n elif ind_j == n - 1:\n health[ind_i][ind_j] = min(dungeon[ind_i][ind_j], dungeon[ind_i][ind_j] + health[ind_i + 1][ind_j])\n else:\n health[ind_i][ind_j] = min(dungeon[ind_i][ind_j],\n dungeon[ind_i][ind_j] + min(health[ind_i][ind_j + 1], health[ind_i + 1][ind_j])\n )\n return health\n\n def calculateMinimumHP(self, dungeon):\n m = len(dungeon)\n n = len(dungeon[0])\n DP = [[None for _ in range(n)] for _ in range(m)]\n health = self.computeMinHealth(dungeon)\n min_hp = self.calculateMinimumHPDP(dungeon, DP, health,0, 0)\n min_hp = min(0, min_hp)\n return -min_hp + 1\n ","memory":"18500"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n dp = [[[0, 0] for i in range(n)] for j in range(m)]\n\n for i in range(m - 1, -1, -1):\n for j in range(n - 1, -1, -1):\n if i == m - 1 and j == n - 1:\n dp[i][j] = [max(0, -dungeon[i][j]), max(0, -dungeon[i][j])]\n continue\n below = dp[i + 1][j] if i + 1 < m else [float('inf'), 0]\n right = dp[i][j + 1] if j + 1 < n else [float('inf'), 0]\n\n needed_hp = min(max(0, below[0] - dungeon[i][j]), max(0, right[0] - dungeon[i][j]))\n max_needed_hp = max(needed_hp, min(below[1], right[1]))\n dp[i][j] = [needed_hp, max_needed_hp]\n # print(dp)\n return dp[0][0][0] + 1\n\n # def dp(i, j):\n # if i == m or j == n:\n # return float('inf')\n \n # right = dp(i, j + 1)\n # below = dp(i + 1, j)\n","memory":"18600"},{"code":"class Solution:\n def solve(self, i, j, dungeon, n, m, dp):\n \n if i >= n or j >= m:\n return float('inf')\n \n if i == n - 1 and j == m - 1:\n return max(1, 1 - dungeon[i][j])\n \n\n if dp[i][j] != float('inf'):\n return dp[i][j]\n \n\n right = self.solve(i, j + 1, dungeon, n, m, dp)\n down = self.solve(i + 1, j, dungeon, n, m, dp)\n \n\n min_health_needed = min(right, down) - dungeon[i][j]\n \n\n if min_health_needed <= 0:\n min_health_needed = 1\n \n \n dp[i][j] = min_health_needed\n return dp[i][j]\n \n \n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n n = len(dungeon)\n m = len(dungeon[0])\n dp = [[float('inf') for i in range(201)] for j in range(201)]\n return self.solve(0,0,dungeon,n,m,dp)\n \n ","memory":"18700"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n dp = collections.defaultdict(lambda:float(\"inf\"))\n m,n = len(dungeon), len(dungeon[0])\n dp[m-1,n] = 1\n for i in range(m-1, -1, -1):\n for j in range(n-1,-1,-1):\n min_needed = min(dp[i,j+1], dp[i+1,j])\n curr = dungeon[i][j]\n dp[i,j] = (min_needed - curr) if curr < min_needed else 1\n \n return dp[0,0]","memory":"18900"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n dp={}\n ans = self.traversal(dungeon, 0, 0,{})\n return ans\n \n #min value encountered so far\n def traversal(self, graph, i , j,dp):\n key = self.makeKey(i,j)\n if(key in dp): return dp[key]\n m = len(graph)\n n = len(graph[0])\n right = None \n down = None\n if(j+1<n):\n right = self.traversal(graph, i , j+1,dp)\n rightAns= right - graph[i][j]\n if(i+1<m):\n down = self.traversal(graph, i+1 , j,dp)\n downAns = down - graph[i][j]\n if(right!=None and down!=None):\n v = min(downAns,rightAns)\n if(v<=0):\n dp[key] = 1\n return 1\n dp[key] = v\n return dp[key]\n elif(right):\n if(rightAns<=0):\n dp[key] = 1\n return 1\n dp[key] = rightAns\n return rightAns\n elif(down):\n if(downAns<=0):\n dp[key] = 1\n return 1\n dp[key] = downAns\n return downAns\n else:\n if(graph[i][j]<=0):\n dp[key] = abs(graph[i][j]) + 1\n return abs(graph[i][j]) + 1\n else:\n dp[key] = 1\n return 1\n def makeKey(self, i, j):\n return str(i)+','+str(j)","memory":"19000"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n \"\"\"\n 7:14\n\n DP\n O(nm)\n \"\"\"\n self.dungeon = dungeon\n self.height = len(dungeon)\n self.width = len(dungeon[0])\n return self.calculateMinimumHPHelper(0,0,{})\n # return max((-options[1][1]) + 1, 1)\n\n def calculateMinimumHPHelper(self, i, j, memo):\n \"\"\"\n memo will store - \n\n the minimum hp we need from this point forward\n which will be at least 1\n\n \"\"\"\n key = (i,j)\n if key in memo:\n return memo[key]\n\n if i >= self.height:\n return float(\"inf\")\n if j >= self.width:\n return float(\"inf\")\n\n val = self.dungeon[i][j]\n if i == self.height-1 and j == self.width-1:\n memo[key] = max(-val+1, 1)\n return memo[key]\n \n right = self.calculateMinimumHPHelper(i, j+1, memo)\n down = self.calculateMinimumHPHelper(i+1, j, memo)\n memo[key] = max(1, min(right, down)-val)\n return memo[key]\n\n # def calculateMinimumHPHelper(self, i, j, memo):\n # \"\"\"\n # memo will store two tuples\n # (\n # (best_current_health, corresponding_worst_health_in_path)\n # (current_health, best_corresponding_worst_health_in_path)\n # )\n # the best health loss from this point forward and the \n # worst health loss along the best path forward\n # \"\"\"\n # key = (i,j)\n # if key in memo:\n # return memo[key]\n \n # if i >= self.height:\n # return [(-float(\"inf\"), -float(\"inf\")), (-float(\"inf\"), -float(\"inf\"))]\n # if j >= self.width:\n # return [(-float(\"inf\"), -float(\"inf\")), (-float(\"inf\"), -float(\"inf\"))]\n \n # val = self.dungeon[i][j]\n # if i == self.height-1 and j == self.width-1:\n # memo[key] = [(val, val), (val, val)]\n # return memo[key]\n\n # possibilities = []\n # possibilities.extend(self.calculateMinimumHPHelper(i, j+1, memo))\n # possibilities.extend(self.calculateMinimumHPHelper(i+1, j, memo))\n\n # options = []\n # for [curr, worst] in possibilities:\n # options.append((min(val, val+curr), min(val+curr, val, worst)))\n # # print(\"Here options\", i, j, options)\n # options.sort(key=lambda x: x[0])\n # best_curr = options[-1]\n\n # options.sort(key=lambda x: x[1])\n # best_worst = options[-1]\n # memo[key] = (best_curr, best_worst)\n \n\n # # if i == self.height-1:\n # # right_curr, right_worst = self.calculateMinimumHPHelper(i, j+1, memo)\n # # new_curr = self.dungeon[i][j] + right_curr\n # # memo[key] = new_curr, min(new_curr, right_worst)\n # # return memo[key]\n # # if j == self.width-1:\n # # down_curr, down_worst = self.calculateMinimumHPHelper(i, j+1, memo)\n # # memo[key] = self.dungeon[i][j] + self.calculateMinimumHPHelper(i+1, j, memo)\n # # return memo[key]\n # # right = self.dungeon[i][j] + self.calculateMinimumHPHelper(i, j+1, memo)\n # # down = self.dungeon[i][j] + self.calculateMinimumHPHelper(i+1, j, memo)\n # # memo[key] = max(right, down)\n # return memo[key]\n \n \n\n ","memory":"19100"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n \"\"\"\n 7:14\n 11:00\n 11:17\n\n DP\n O(nm)\n \"\"\"\n self.dungeon = dungeon\n self.height = len(dungeon)\n self.width = len(dungeon[0])\n return self.calculateMinimumHPHelper(0,0,{})\n # return max((-options[1][1]) + 1, 1)\n\n def calculateMinimumHPHelper(self, i, j, memo):\n \"\"\"\n memo will store - \n\n the minimum hp we need from this point forward\n which will be at least 1\n\n \"\"\"\n key = (i,j)\n if key in memo:\n return memo[key]\n\n if i >= self.height:\n return float(\"inf\")\n if j >= self.width:\n return float(\"inf\")\n\n val = self.dungeon[i][j]\n if i == self.height-1 and j == self.width-1:\n memo[key] = max(-val+1, 1)\n return memo[key]\n \n right = self.calculateMinimumHPHelper(i, j+1, memo)\n down = self.calculateMinimumHPHelper(i+1, j, memo)\n memo[key] = max(1, min(right, down)-val)\n return memo[key]\n\n # def calculateMinimumHPHelper(self, i, j, memo):\n # \"\"\"\n # memo will store two tuples\n # (\n # (best_current_health, corresponding_worst_health_in_path)\n # (current_health, best_corresponding_worst_health_in_path)\n # )\n # the best health loss from this point forward and the \n # worst health loss along the best path forward\n # \"\"\"\n # key = (i,j)\n # if key in memo:\n # return memo[key]\n \n # if i >= self.height:\n # return [(-float(\"inf\"), -float(\"inf\")), (-float(\"inf\"), -float(\"inf\"))]\n # if j >= self.width:\n # return [(-float(\"inf\"), -float(\"inf\")), (-float(\"inf\"), -float(\"inf\"))]\n \n # val = self.dungeon[i][j]\n # if i == self.height-1 and j == self.width-1:\n # memo[key] = [(val, val), (val, val)]\n # return memo[key]\n\n # possibilities = []\n # possibilities.extend(self.calculateMinimumHPHelper(i, j+1, memo))\n # possibilities.extend(self.calculateMinimumHPHelper(i+1, j, memo))\n\n # options = []\n # for [curr, worst] in possibilities:\n # options.append((min(val, val+curr), min(val+curr, val, worst)))\n # # print(\"Here options\", i, j, options)\n # options.sort(key=lambda x: x[0])\n # best_curr = options[-1]\n\n # options.sort(key=lambda x: x[1])\n # best_worst = options[-1]\n # memo[key] = (best_curr, best_worst)\n \n\n # # if i == self.height-1:\n # # right_curr, right_worst = self.calculateMinimumHPHelper(i, j+1, memo)\n # # new_curr = self.dungeon[i][j] + right_curr\n # # memo[key] = new_curr, min(new_curr, right_worst)\n # # return memo[key]\n # # if j == self.width-1:\n # # down_curr, down_worst = self.calculateMinimumHPHelper(i, j+1, memo)\n # # memo[key] = self.dungeon[i][j] + self.calculateMinimumHPHelper(i+1, j, memo)\n # # return memo[key]\n # # right = self.dungeon[i][j] + self.calculateMinimumHPHelper(i, j+1, memo)\n # # down = self.dungeon[i][j] + self.calculateMinimumHPHelper(i+1, j, memo)\n # # memo[key] = max(right, down)\n # return memo[key]\n \n \n\n ","memory":"19100"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n \n \n m, n = len(dungeon), len(dungeon[0])\n memo = {}\n \n def dfs(i, j):\n # Base case: out of bounds\n if i == m or j == n:\n return float('inf')\n \n # Reached the princess\n if i == m - 1 and j == n - 1:\n return max(1, 1 - dungeon[i][j])\n \n # Check if we've already calculated this\n if (i, j) in memo:\n return memo[(i, j)]\n \n # Recursive case: go right or down\n right = dfs(i, j + 1)\n down = dfs(i + 1, j)\n \n min_health = min(right, down) - dungeon[i][j]\n memo[(i, j)] = max(1, min_health)\n return memo[(i, j)]\n \n return dfs(0, 0)","memory":"19200"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n memo = {}\n\n def minimumHealth(i, j) -> int:\n if i >= len(dungeon) or j >= len(dungeon[0]):\n return None\n\n if (i, j) in memo:\n return memo[(i, j)]\n\n down = minimumHealth(i + 1, j)\n right = minimumHealth(i, j + 1)\n\n if down and right:\n minPath = min(down, right)\n\n elif down:\n minPath = down\n\n elif right:\n minPath = right\n\n else: # at the end\n if dungeon[i][j] >= 0:\n memo[(i, j)] = 1\n\n else:\n memo[(i, j)] = dungeon[i][j] * -1 + 1\n \n return memo[(i, j)]\n \n memo[(i, j)] = max(minPath - dungeon[i][j], 1)\n return memo[(i, j)]\n\n return minimumHealth(0, 0)\n\n \n","memory":"19300"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n cache: dict[tuple[int, int]: tuple[int, int]] = {}\n ROWS, COLS = len(dungeon), len(dungeon[0])\n\n def dp(r: int, c: int) -> tuple[int, int]:\n if (r, c) == (ROWS - 1, COLS - 1):\n return max(1, 1 - dungeon[r][c])\n if not (0 <= r < ROWS and 0 <= c < COLS):\n return sys.maxsize\n key: tuple[int, int] = (r, c)\n if key in cache:\n return cache[key]\n # cache[key] = 1\n \n cache[key] = min(dp(r + 1, c), dp(r, c + 1)) - dungeon[r][c]\n cache[key] = max(1, cache[key])\n\n return cache[key]\n\n return dp(0, 0)\n\n","memory":"19400"},{"code":"class Solution:\n def calculateMinimumHP(self, arr: List[List[int]]) -> int:\n n = len(arr)\n m = len(arr[0])\n def solve(idx1, idx2, cache):\n if idx1 >= n or idx2 >= m:\n return float('inf')\n if idx1 == n-1 and idx2 == m-1:\n return 1 if arr[-1][-1] >= 0 else -arr[-1][-1] + 1\n \n if (idx1, idx2) in cache:\n return cache[(idx1, idx2)]\n \n option1 = solve(idx1 + 1, idx2, cache)\n option2 = solve(idx1, idx2 + 1, cache)\n cache[(idx1, idx2)] = min(option1, option2) - arr[idx1][idx2]\n if cache[(idx1, idx2)] <= 0:\n cache[(idx1, idx2)] = 1\n return cache[(idx1, idx2)]\n cache = {}\n res = solve(0, 0, cache)\n print(cache)\n return res","memory":"19500"},{"code":"class Solution:\n def mincost(self, dungeon, x, y):\n if x == len(dungeon) - 1 and y == len(dungeon[0]) - 1:\n return dungeon[-1][-1]\n if x >= len(dungeon) or y >= len(dungeon[0]):\n return -float('inf')\n \n if (x,y) in self.hash:\n return self.hash[(x,y)]\n \n self.hash[(x,y)] = 0\n mx = max(\n self.mincost(dungeon, x+1, y),\n self.mincost(dungeon, x, y+1)\n )\n if mx > 0:\n mx = 0\n mx = mx + dungeon[x][y]\n if mx < 0:\n self.hash[(x,y)] = mx\n\n return self.hash[(x,y)]\n\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n self.hash = {}\n res = self.mincost(dungeon, 0, 0)\n if res < 0:\n return -res + 1\n return 1\n ","memory":"19500"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n\n n = len(dungeon)\n m = len(dungeon[0])\n\n h = {}\n\n\n def dfs(i, j, val, minVal):\n\n if i == n-1 and j == m-1:\n return dungeon[i][j]\n\n key = (i, j)\n\n if key in h:\n return h[key]\n \n res = float('-inf')\n\n if i + 1 < n:\n res = max(res, dfs(i+1, j, val, minVal))\n \n if j + 1 < m:\n res = max(res, dfs(i, j+1, val, minVal))\n \n h[key] = min(res + dungeon[i][j], dungeon[i][j])\n return h[key]\n \n \n\n res = dfs(0, 0, 0, 1)\n\n if res > 0:\n return 1\n\n return abs(res) + 1\n\n ","memory":"19600"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n @cache\n def dfs(i, j):\n if i == len(dungeon) - 1 and j == len(dungeon[0]) - 1:\n return dungeon[i][j]\n\n maxHealth = float('-inf') \n if i + 1 < len(dungeon):\n maxHealth = max(maxHealth, min(dfs(i+1,j), 0))\n if j + 1 < len(dungeon[0]):\n maxHealth = max(maxHealth, min(dfs(i,j+1), 0))\n\n return maxHealth + dungeon[i][j]\n\n \n return abs(dfs(0, 0)) + 1 if dfs(0, 0) < 0 else 1","memory":"19700"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n cache = {}\n def findHt(i, j):\n if (i, j) in cache:\n return cache[(i, j)]\n\n if i == len(dungeon) or j == len(dungeon[0]):\n return float('-inf')\n elif i == len(dungeon)-1 and j == len(dungeon[0])-1:\n return 0 if dungeon[i][j] > 0 else dungeon[i][j]\n\n val1 = findHt(i+1, j)\n if dungeon[i][j] + val1 > 0:\n val1 = 0\n else:\n val1 += dungeon[i][j]\n\n val2 = findHt(i, j+1)\n if dungeon[i][j] + val2 > 0:\n val2 = 0\n else:\n val2 += dungeon[i][j]\n\n res = max(val1, val2)\n cache[(i, j)] = res\n \n return res\n\n ans = findHt(0, 0)\n \n return 1 if ans > 0 else abs(ans)+1","memory":"19800"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n cache = {}\n def findHt(i, j):\n if (i, j) in cache:\n return cache[(i, j)]\n\n if i == len(dungeon) or j == len(dungeon[0]):\n return float('-inf')\n elif i == len(dungeon)-1 and j == len(dungeon[0])-1:\n return 0 if dungeon[i][j] > 0 else dungeon[i][j]\n\n val1 = findHt(i+1, j)\n if dungeon[i][j] + val1 > 0:\n val1 = 0\n else:\n val1 += dungeon[i][j]\n\n val2 = findHt(i, j+1)\n if dungeon[i][j] + val2 > 0:\n val2 = 0\n else:\n val2 += dungeon[i][j]\n\n res = max(val1, val2)\n cache[(i, j)] = res\n \n return res\n\n ans = findHt(0, 0)\n \n return 1 if ans > 0 else abs(ans)+1","memory":"19800"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n m, n = len(dungeon), len(dungeon[0])\n @lru_cache(None)\n def bfs(i,j):\n if i>=m or j >=n: return 1e9\n if i == m-1 and j == n-1:\n return 1 if dungeon[i][j]>=0 else -dungeon[i][j]+1\n down = bfs(i+1,j)\n right = bfs(i, j+1)\n mini = max(1,min(down, right) - dungeon[i][j])\n return mini\n return bfs(0,0)\n ","memory":"19900"},{"code":"class Solution:\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\n M,N = len(dungeon), len(dungeon[0])\n @cache\n def dfs(i,j):\n res = inf\n if i+1 < M:\n res = dfs(i+1, j)\n if j+1 < N:\n res = min(res, dfs(i, j+1))\n res = 1 if res == inf else res\n return max(1, res - dungeon[i][j])\n return dfs(0,0)","memory":"20000"}],"string":"[\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n height, width = len(dungeon), len(dungeon[0])\\n m, n = height - 1, width - 1\\n dp = [ [0] * width for _ in range(height) ]\\n dp[m][n] = max(1,1 - dungeon[m][n])\\n for r in range(m-1,-1,-1):\\n dp[r][n] = max(1,dp[r+1][n] - dungeon[r][n])\\n for c in range(n-1,-1,-1):\\n dp[m][c] = max(1, dp[m][c+1] - dungeon[m][c])\\n for r in range(m-1,-1,-1):\\n for c in range(n-1,-1,-1):\\n dp[r][c] = max(1, min( dp[r+1][c], dp[r][c+1] ) - dungeon[r][c] )\\n return dp[0][0]\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(Solution().calculateMinimumHP(nums),file=f)\\nexit(0)\\n\\n\\n \",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n n, m = len(dungeon), len(dungeon[0])\\n dp = [[0]*m for i in range(n)]\\n dp[-1][-1] = max(1, -dungeon[-1][-1]+1)\\n for i in range(n-1, -1, -1):\\n for j in range(m-1,-1,-1):\\n if(i == n-1 and j == m-1):\\n continue\\n right = float(\\\"inf\\\") if j == m-1 else dp[i][j+1]\\n below = float(\\\"inf\\\") if i == n-1 else dp[i+1][j]\\n dp[i][j] = max(1, min(right, below) - dungeon[i][j])\\n return dp[0][0]\\n\",\n \"memory\": \"17200\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: list[list[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n dp = [[0] * n for _ in range(m)]\\n dp[-1][-1] = max(1, 1 - dungeon[-1][-1])\\n for i in range(m - 2, -1, -1):\\n dp[i][-1] = max(1, dp[i + 1][-1] - dungeon[i][-1])\\n for j in range(n - 2, -1, -1):\\n dp[-1][j] = max(1, dp[-1][j + 1] - dungeon[-1][j])\\n for i in range(m - 2, -1, -1):\\n for j in range(n - 2, -1, -1):\\n down = max(1, dp[i + 1][j] - dungeon[i][j])\\n right = max(1, dp[i][j + 1] - dungeon[i][j])\\n dp[i][j] = min(down, right)\\n return dp[0][0]\\n\",\n \"memory\": \"17300\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]\\n dp[m][n-1] = dp[m-1][n] = 1\\n \\n for i in range(m-1, -1, -1):\\n for j in range(n-1, -1, -1):\\n min_health = min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j]\\n dp[i][j] = max(min_health, 1)\\n \\n return dp[0][0]\\n\",\n \"memory\": \"17400\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, grid: List[List[int]]) -> int:\\n INF = float('inf')\\n rows = len(grid)\\n cols = len(grid[0])\\n if rows == 1 and cols == 1:\\n if grid[0][0] >= 0:\\n return 1\\n return -grid[0][0] + 1\\n dp = [[INF] * cols for i in range(rows)]\\n dp[rows - 1][cols - 1] = max(1, 1 - grid[rows - 1][cols - 1])\\n for r in range(rows-2,-1,-1):\\n dp[r][cols-1] = max(1, dp[r + 1][cols-1] - grid[r][cols-1])\\n for c in range(cols-2,-1,-1):\\n dp[rows - 1][c] = max(1, dp[rows - 1][c + 1] - grid[rows - 1][c])\\n for r in range(rows - 2, -1 , -1):\\n for c in range(cols - 2 , -1 , -1):\\n need = min(dp[r + 1][c], dp[r][c + 1])\\n dp[r][c] = max(1, need - grid[r][c])\\n return dp[0][0]\\n \",\n \"memory\": \"17500\"\n },\n {\n \"code\": \"from collections import deque\\nclass Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m,n=len(dungeon),len(dungeon[0])\\n dp=[[float('inf')]*(n+1) for _ in range(m+1)]\\n dp[m][n-1]=dp[m-1][n]=1\\n for i in range(m-1,-1,-1):\\n for j in range(n-1,-1,-1):\\n mh=min(dp[i+1][j],dp[i][j+1])-dungeon[i][j]\\n dp[i][j]=max(mh,1)\\n return dp[0][0]\",\n \"memory\": \"17500\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n dp = [[1e9]*n for _ in range(m)]\\n \\n for i in range(m-1, -1, -1):\\n for j in range(n-1, -1,-1):\\n if i==m-1 and j==n-1:\\n dp[i][j] = -dungeon[i][j]+1 if dungeon[i][j]<0 else 1\\n continue\\n right = dp[i][j + 1] if j < n - 1 else float('inf')\\n down = dp[i + 1][j] if i < m - 1 else float('inf')\\n dp[i][j] = max(1, min(right, down) - dungeon[i][j])\\n return dp[0][0] if dp[0][0]>0 else 1\\n\\n \",\n \"memory\": \"17600\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n \\n # Create a 2D dp array initialized with infinity\\n dp = [[float('inf')] * n for _ in range(m)]\\n \\n # Bottom-up approach: start from the princess's cell\\n dp[m-1][n-1] = max(1, 1 - dungeon[m-1][n-1])\\n \\n # Fill the last row (bottom row)\\n for j in range(n-2, -1, -1):\\n dp[m-1][j] = max(1, dp[m-1][j+1] - dungeon[m-1][j])\\n \\n # Fill the last column (rightmost column)\\n for i in range(m-2, -1, -1):\\n dp[i][n-1] = max(1, dp[i+1][n-1] - dungeon[i][n-1])\\n \\n # Fill the rest of the dp table\\n for i in range(m-2, -1, -1):\\n for j in range(n-2, -1, -1):\\n min_health_on_exit = min(dp[i+1][j], dp[i][j+1])\\n dp[i][j] = max(1, min_health_on_exit - dungeon[i][j])\\n \\n return dp[0][0]\\n\",\n \"memory\": \"17600\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n dp = [[1e9]*n for _ in range(m)]\\n \\n for i in range(m-1, -1, -1):\\n for j in range(n-1, -1,-1):\\n if i==m-1 and j==n-1:\\n dp[i][j] = -dungeon[i][j]+1 if dungeon[i][j]<0 else 1\\n continue\\n elif j+1>n-1:\\n res = dp[i+1][j]- dungeon[i][j]\\n elif i+1>m-1:\\n res = dp[i][j+1]- dungeon[i][j]\\n else:\\n res = min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j]\\n dp[i][j] = res if res >0 else 1\\n return dp[0][0] if dp[0][0]>0 else 1\\n\\n \",\n \"memory\": \"17700\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n \\n m=len(dungeon)\\n n=len(dungeon[0])\\n dp=[[float('inf')]*(n+1) for i in range(m+1)]\\n dp[m][n-1]=dp[m-1][n]=1\\n min_health=1\\n for i in range(m-1,-1,-1):\\n for j in range(n-1,-1,-1):\\n min_health=min(dp[i][j+1],dp[i+1][j])\\n dp[i][j]=max(1,min_health-dungeon[i][j])\\n return dp[0][0]\\n \\n \\n \\n\",\n \"memory\": \"17700\"\n },\n {\n \"code\": \"class Solution:\\n def is_valid(self, dungeon: List[List[int]], m: int, n: int, health: int) -> bool:\\n if health+dungeon[0][0] <= 0:\\n return False\\n dp = [[-1]*n for _ in range(m)]\\n dp[0][0] = health+dungeon[0][0]\\n for i in range(1, m):\\n if dp[i-1][0] > 0 and dp[i-1][0]+dungeon[i][0] > 0:\\n dp[i][0] = dp[i-1][0]+dungeon[i][0]\\n for j in range(1, n):\\n if dp[0][j-1] > 0 and dp[0][j-1]+dungeon[0][j] > 0:\\n dp[0][j] = dp[0][j-1]+dungeon[0][j]\\n \\n for i in range(1,m):\\n for j in range(1,n):\\n res = -1\\n if dp[i-1][j]>0 and dp[i-1][j]+dungeon[i][j] > 0:\\n res = max(res, dp[i-1][j]+dungeon[i][j])\\n if dp[i][j-1]>0 and dp[i][j-1]+dungeon[i][j] > 0:\\n res = max(res, dp[i][j-1]+dungeon[i][j])\\n dp[i][j] = res\\n \\n return dp[m-1][n-1] > 0\\n \\n \\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m = len(dungeon)\\n n = len(dungeon[0])\\n lo, hi = 1, 4*10**7+1\\n while lo < hi:\\n mid = (lo+hi)//2\\n res = self.is_valid(dungeon, m, n, mid)\\n if res:\\n hi = mid\\n else:\\n lo = mid+1\\n # print(\\\"debug: res is {} for health={}\\\".format(self.is_valid(dungeon, m, n, 3), 3))\\n return lo\",\n \"memory\": \"17800\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n\\n m, n = len(dungeon), len(dungeon[0])\\n\\n dp = [[0 for _ in range(n+1)] for _ in range(m+1)]\\n\\n def minPath():\\n for i in range(m - 1, -1, -1):\\n for j in range(n - 1, -1, -1):\\n if i == m - 1 and j == n - 1:\\n dp[i][j] = 1 + max(0, - dungeon[i][j])\\n else:\\n val_h = 1e10 if i + 1 > m - 1 else dp[i + 1][j]\\n val_v = 1e10 if j + 1 > n - 1 else dp[i][j + 1]\\n dp[i][j] = max(1, - dungeon[i][j] + min(val_h, val_v))\\n\\n return dp[0][0]\\n\\n return minPath()\\n\\n \\n\\n \",\n \"memory\": \"17900\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n rows = len(dungeon)\\n cols = len(dungeon[0])\\n grid = [[0 for i in range(cols)] for i in range(rows)]\\n\\n grid[rows-1][cols-1] = dungeon[rows-1][cols-1]\\n \\n for i in range(rows-2, -1, -1):\\n grid[i][cols-1] = dungeon[i][cols-1] + grid[i+1][cols-1]\\n if grid[i][cols-1] > -1 :\\n grid[i][cols-1] = 0\\n\\n for i in range(cols-2, -1, -1):\\n grid[rows-1][i] = dungeon[rows-1][i] + grid[rows-1][i+1]\\n if grid[rows-1][i] > -1:\\n grid[rows-1][i] = 0\\n\\n for i in range(rows-1, -1, -1):\\n for j in range(cols-1, -1, -1):\\n if i < rows-1 and j < cols-1:\\n grid[i][j] = dungeon[i][j] + max(grid[i+1][j], grid[i][j+1])\\n elif i < rows-1:\\n grid[i][j] = dungeon[i][j] + grid[i+1][j]\\n elif j < cols-1:\\n grid[i][j] = dungeon[i][j] + grid[i][j+1]\\n\\n if grid[i][j] > -1:\\n grid[i][j] = 0\\n\\n if grid[0][0] >= 0: return 1\\n else: return -(grid[0][0]-1)\\n\",\n \"memory\": \"17900\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n \\n m = len(dungeon)\\n n = len(dungeon[0])\\n \\n # Initialize memoization table with None (for uncalculated states)\\n memo = [[None] * n for _ in range(m)]\\n \\n # Define the recursive function with memoization\\n def solve(i, j):\\n # If we go out of bounds, return a very large number (invalid path)\\n if i >= m or j >= n:\\n return float('inf')\\n \\n # If we are at the bottom-right cell, calculate the minimum health\\n if i == m - 1 and j == n - 1:\\n return max(1, 1 - dungeon[i][j])\\n \\n # If the result has already been computed, return it\\n if memo[i][j] is not None:\\n return memo[i][j]\\n \\n # Recursively calculate the minimum health needed by moving right or down\\n right = solve(i, j + 1)\\n down = solve(i + 1, j)\\n \\n # Choose the path that requires less health\\n min_health_on_exit = min(right, down)\\n \\n # Calculate the minimum health needed to enter the current cell\\n memo[i][j] = max(1, min_health_on_exit - dungeon[i][j])\\n \\n return memo[i][j]\\n \\n # Start the recursion from the top-left corner\\n return solve(0, 0)\\n\",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"class Solution:\\n def is_valid(self, dungeon: List[List[int]], m: int, n: int, health: int) -> bool:\\n if health+dungeon[0][0] <= 0:\\n return False\\n dp = [[-1]*n for _ in range(m)]\\n dp[0][0] = health+dungeon[0][0]\\n for i in range(1, m):\\n if dp[i-1][0] > 0 and dp[i-1][0]+dungeon[i][0] > 0:\\n dp[i][0] = dp[i-1][0]+dungeon[i][0]\\n for j in range(1, n):\\n if dp[0][j-1] > 0 and dp[0][j-1]+dungeon[0][j] > 0:\\n dp[0][j] = dp[0][j-1]+dungeon[0][j]\\n \\n for i in range(1,m):\\n for j in range(1,n):\\n res = -1\\n if dp[i-1][j]>0 and dp[i-1][j]+dungeon[i][j] > 0:\\n res = max(res, dp[i-1][j]+dungeon[i][j])\\n if dp[i][j-1]>0 and dp[i][j-1]+dungeon[i][j] > 0:\\n res = max(res, dp[i][j-1]+dungeon[i][j])\\n dp[i][j] = res\\n \\n return dp[m-1][n-1] > 0\\n \\n \\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m = len(dungeon)\\n n = len(dungeon[0])\\n lo, hi = 1, 10**8\\n while lo < hi:\\n mid = (lo+hi)//2\\n res = self.is_valid(dungeon, m, n, mid)\\n if res:\\n hi = mid\\n else:\\n lo = mid+1\\n # print(\\\"debug: res is {} for health={}\\\".format(self.is_valid(dungeon, m, n, 3), 3))\\n return lo\",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"\\n\\nclass Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n n, m = len(dungeon), len(dungeon[0])\\n dp = [[-1 for j in range(m)] for i in range(n)]\\n def helper(i, j):\\n if i == n-1 and j == m-1:\\n return 1\\n if dp[i][j] != -1:\\n return dp[i][j]\\n count = float('inf')\\n if i + 1 < n:\\n count = min(count, -dungeon[i+1][j] + helper(i+1, j))\\n if j + 1 < m:\\n count = min(count, -dungeon[i][j+1] + helper(i, j+1))\\n count = max(1, count)\\n dp[i][j] = count\\n return count\\n return max(1, helper(0, 0) - dungeon[0][0])\\n \",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n n, m = len(dungeon), len(dungeon[0])\\n storage = [[1 for _ in range(m)] for _ in range(n)]\\n storage[-1][-1] = min(dungeon[-1][-1], 0)\\n stack = [(n - 1, m - 1)]\\n def get_dependency(a, b):\\n res = []\\n if a + 1 < n:\\n res.append((a + 1, b))\\n if b + 1 < m:\\n res.append((a, b + 1))\\n return res\\n def is_ready(a, b):\\n if a + 1 < n and storage[a + 1][b] == 1:\\n return False\\n if b + 1 < m and storage[a][b + 1] == 1:\\n return False\\n return True\\n def get_next(a, b):\\n res = []\\n if a - 1 >= 0 and is_ready(a - 1, b):\\n res.append((a - 1, b))\\n if b - 1 >= 0 and is_ready(a, b - 1):\\n res.append((a, b - 1))\\n return res\\n while stack:\\n cur = stack[-1]\\n stack = stack[:-1]\\n candidates = get_next(*cur)\\n for cand in candidates:\\n a, b = cand\\n dependencies = get_dependency(a, b)\\n smallest_damage = -1 * 10 ** 9\\n for dep in dependencies:\\n c, d = dep\\n smallest_damage = max(storage[c][d], smallest_damage)\\n if storage[c][d] > smallest_damage:\\n smallest_damage = storage[c][d]\\n cand_damage = min(smallest_damage, 0) + dungeon[a][b]\\n storage[a][b] = min(cand_damage, 0)\\n stack.append(cand)\\n print(storage)\\n return 1 + storage[0][0] * -1\",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n rows, cols = len(dungeon), len(dungeon[0])\\n \\n dp = [[float(\\\"infinity\\\") for i in range(cols + 1)] for j in range(rows + 1)]\\n print(dp)\\n \\n dp[rows][cols-1] = dp[rows-1][cols] = 1\\n \\n for i in range(rows-1, -1, -1): \\n for j in range(cols-1, -1, -1): \\n minhealth = min(dp[i + 1][j], dp[i][j+1])\\n dp[i][j] = max(minhealth - dungeon[i][j], 1)\\n \\n \\n return dp[0][0]\",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n rows, cols = len(dungeon), len(dungeon[0])\\n \\n dp = [[float(\\\"infinity\\\") for i in range(cols + 1)] for j in range(rows + 1)]\\n print(dp)\\n \\n dp[rows][cols-1] = dp[rows-1][cols] = 1\\n \\n for i in range(rows-1, -1, -1): \\n for j in range(cols-1, -1, -1): \\n minhealth = min(dp[i + 1][j], dp[i][j+1])\\n dp[i][j] = max(minhealth - dungeon[i][j], 1)\\n \\n \\n return dp[0][0]\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"from sortedcontainers import SortedKeyList\\n\\nclass Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n hp = []\\n for i in range(m + 1):\\n temp = []\\n for j in range(n + 1):\\n temp.append(float('inf'))\\n hp.append(temp)\\n \\n hp[m - 1][n], hp[m][n - 1] = 1, 1 #make sure the first choice is correct\\n \\n #hp[i][j] = min hp required to get from here to end\\n for i in range(m)[::-1]:\\n for j in range(n)[::-1]:\\n #hp needed is either going down then going to end or going right then going to end\\n #then adding hp needed to get to this spot\\n #if minusing the value at i, j is less then 1 that means this i,j value gives enough\\n #hp to fix everythign\\n hp[i][j] = max( min(hp[i + 1][j], hp[i][j + 1]) - dungeon[i][j], 1 )\\n \\n return hp[0][0]\\n\\n\\n\\n\",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHPDP(self, dungeon, DP, health, i, j):\\n if DP[i][j] is not None:\\n return DP[i][j]\\n\\n m = len(dungeon)\\n n = len(dungeon[0])\\n\\n if i == m - 1 and j == n - 1:\\n DP[i][j] = min(health[i][j], 0)\\n elif i == m - 1:\\n DP[i][j] = min(self.calculateMinimumHPDP(dungeon, DP, health, i, j+1) + dungeon[i][j], 0)\\n elif j == n - 1:\\n DP[i][j] = min(self.calculateMinimumHPDP(dungeon, DP, health, i+1, j) + dungeon[i][j], 0)\\n else:\\n DP[i][j] = min(max(self.calculateMinimumHPDP(dungeon, DP, health, i, j+1),\\n self.calculateMinimumHPDP(dungeon, DP, health, i+1, j)) + dungeon[i][j], 0)\\n return DP[i][j]\\n\\n def computeMinHealth(self, dungeon):\\n m = len(dungeon)\\n n = len(dungeon[0])\\n health = [[None for _ in range(n)] for _ in range(m)]\\n\\n for i in range(m):\\n for j in range(n):\\n ind_i = m - i - 1\\n ind_j = n - j - 1\\n if ind_i == m - 1 and ind_j == n - 1:\\n health[ind_i][ind_j] = dungeon[ind_i][ind_j]\\n elif ind_i == m - 1:\\n health[ind_i][ind_j] = min(dungeon[ind_i][ind_j], dungeon[ind_i][ind_j] + health[ind_i][ind_j+1])\\n elif ind_j == n - 1:\\n health[ind_i][ind_j] = min(dungeon[ind_i][ind_j], dungeon[ind_i][ind_j] + health[ind_i + 1][ind_j])\\n else:\\n health[ind_i][ind_j] = min(dungeon[ind_i][ind_j],\\n dungeon[ind_i][ind_j] + min(health[ind_i][ind_j + 1], health[ind_i + 1][ind_j])\\n )\\n return health\\n\\n def calculateMinimumHP(self, dungeon):\\n m = len(dungeon)\\n n = len(dungeon[0])\\n DP = [[None for _ in range(n)] for _ in range(m)]\\n health = self.computeMinHealth(dungeon)\\n min_hp = self.calculateMinimumHPDP(dungeon, DP, health,0, 0)\\n min_hp = min(0, min_hp)\\n return -min_hp + 1\\n \",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n dp = [[[0, 0] for i in range(n)] for j in range(m)]\\n\\n for i in range(m - 1, -1, -1):\\n for j in range(n - 1, -1, -1):\\n if i == m - 1 and j == n - 1:\\n dp[i][j] = [max(0, -dungeon[i][j]), max(0, -dungeon[i][j])]\\n continue\\n below = dp[i + 1][j] if i + 1 < m else [float('inf'), 0]\\n right = dp[i][j + 1] if j + 1 < n else [float('inf'), 0]\\n\\n needed_hp = min(max(0, below[0] - dungeon[i][j]), max(0, right[0] - dungeon[i][j]))\\n max_needed_hp = max(needed_hp, min(below[1], right[1]))\\n dp[i][j] = [needed_hp, max_needed_hp]\\n # print(dp)\\n return dp[0][0][0] + 1\\n\\n # def dp(i, j):\\n # if i == m or j == n:\\n # return float('inf')\\n \\n # right = dp(i, j + 1)\\n # below = dp(i + 1, j)\\n\",\n \"memory\": \"18600\"\n },\n {\n \"code\": \"class Solution:\\n def solve(self, i, j, dungeon, n, m, dp):\\n \\n if i >= n or j >= m:\\n return float('inf')\\n \\n if i == n - 1 and j == m - 1:\\n return max(1, 1 - dungeon[i][j])\\n \\n\\n if dp[i][j] != float('inf'):\\n return dp[i][j]\\n \\n\\n right = self.solve(i, j + 1, dungeon, n, m, dp)\\n down = self.solve(i + 1, j, dungeon, n, m, dp)\\n \\n\\n min_health_needed = min(right, down) - dungeon[i][j]\\n \\n\\n if min_health_needed <= 0:\\n min_health_needed = 1\\n \\n \\n dp[i][j] = min_health_needed\\n return dp[i][j]\\n \\n \\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n n = len(dungeon)\\n m = len(dungeon[0])\\n dp = [[float('inf') for i in range(201)] for j in range(201)]\\n return self.solve(0,0,dungeon,n,m,dp)\\n \\n \",\n \"memory\": \"18700\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n dp = collections.defaultdict(lambda:float(\\\"inf\\\"))\\n m,n = len(dungeon), len(dungeon[0])\\n dp[m-1,n] = 1\\n for i in range(m-1, -1, -1):\\n for j in range(n-1,-1,-1):\\n min_needed = min(dp[i,j+1], dp[i+1,j])\\n curr = dungeon[i][j]\\n dp[i,j] = (min_needed - curr) if curr < min_needed else 1\\n \\n return dp[0,0]\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n dp={}\\n ans = self.traversal(dungeon, 0, 0,{})\\n return ans\\n \\n #min value encountered so far\\n def traversal(self, graph, i , j,dp):\\n key = self.makeKey(i,j)\\n if(key in dp): return dp[key]\\n m = len(graph)\\n n = len(graph[0])\\n right = None \\n down = None\\n if(j+1<n):\\n right = self.traversal(graph, i , j+1,dp)\\n rightAns= right - graph[i][j]\\n if(i+1<m):\\n down = self.traversal(graph, i+1 , j,dp)\\n downAns = down - graph[i][j]\\n if(right!=None and down!=None):\\n v = min(downAns,rightAns)\\n if(v<=0):\\n dp[key] = 1\\n return 1\\n dp[key] = v\\n return dp[key]\\n elif(right):\\n if(rightAns<=0):\\n dp[key] = 1\\n return 1\\n dp[key] = rightAns\\n return rightAns\\n elif(down):\\n if(downAns<=0):\\n dp[key] = 1\\n return 1\\n dp[key] = downAns\\n return downAns\\n else:\\n if(graph[i][j]<=0):\\n dp[key] = abs(graph[i][j]) + 1\\n return abs(graph[i][j]) + 1\\n else:\\n dp[key] = 1\\n return 1\\n def makeKey(self, i, j):\\n return str(i)+','+str(j)\",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n \\\"\\\"\\\"\\n 7:14\\n\\n DP\\n O(nm)\\n \\\"\\\"\\\"\\n self.dungeon = dungeon\\n self.height = len(dungeon)\\n self.width = len(dungeon[0])\\n return self.calculateMinimumHPHelper(0,0,{})\\n # return max((-options[1][1]) + 1, 1)\\n\\n def calculateMinimumHPHelper(self, i, j, memo):\\n \\\"\\\"\\\"\\n memo will store - \\n\\n the minimum hp we need from this point forward\\n which will be at least 1\\n\\n \\\"\\\"\\\"\\n key = (i,j)\\n if key in memo:\\n return memo[key]\\n\\n if i >= self.height:\\n return float(\\\"inf\\\")\\n if j >= self.width:\\n return float(\\\"inf\\\")\\n\\n val = self.dungeon[i][j]\\n if i == self.height-1 and j == self.width-1:\\n memo[key] = max(-val+1, 1)\\n return memo[key]\\n \\n right = self.calculateMinimumHPHelper(i, j+1, memo)\\n down = self.calculateMinimumHPHelper(i+1, j, memo)\\n memo[key] = max(1, min(right, down)-val)\\n return memo[key]\\n\\n # def calculateMinimumHPHelper(self, i, j, memo):\\n # \\\"\\\"\\\"\\n # memo will store two tuples\\n # (\\n # (best_current_health, corresponding_worst_health_in_path)\\n # (current_health, best_corresponding_worst_health_in_path)\\n # )\\n # the best health loss from this point forward and the \\n # worst health loss along the best path forward\\n # \\\"\\\"\\\"\\n # key = (i,j)\\n # if key in memo:\\n # return memo[key]\\n \\n # if i >= self.height:\\n # return [(-float(\\\"inf\\\"), -float(\\\"inf\\\")), (-float(\\\"inf\\\"), -float(\\\"inf\\\"))]\\n # if j >= self.width:\\n # return [(-float(\\\"inf\\\"), -float(\\\"inf\\\")), (-float(\\\"inf\\\"), -float(\\\"inf\\\"))]\\n \\n # val = self.dungeon[i][j]\\n # if i == self.height-1 and j == self.width-1:\\n # memo[key] = [(val, val), (val, val)]\\n # return memo[key]\\n\\n # possibilities = []\\n # possibilities.extend(self.calculateMinimumHPHelper(i, j+1, memo))\\n # possibilities.extend(self.calculateMinimumHPHelper(i+1, j, memo))\\n\\n # options = []\\n # for [curr, worst] in possibilities:\\n # options.append((min(val, val+curr), min(val+curr, val, worst)))\\n # # print(\\\"Here options\\\", i, j, options)\\n # options.sort(key=lambda x: x[0])\\n # best_curr = options[-1]\\n\\n # options.sort(key=lambda x: x[1])\\n # best_worst = options[-1]\\n # memo[key] = (best_curr, best_worst)\\n \\n\\n # # if i == self.height-1:\\n # # right_curr, right_worst = self.calculateMinimumHPHelper(i, j+1, memo)\\n # # new_curr = self.dungeon[i][j] + right_curr\\n # # memo[key] = new_curr, min(new_curr, right_worst)\\n # # return memo[key]\\n # # if j == self.width-1:\\n # # down_curr, down_worst = self.calculateMinimumHPHelper(i, j+1, memo)\\n # # memo[key] = self.dungeon[i][j] + self.calculateMinimumHPHelper(i+1, j, memo)\\n # # return memo[key]\\n # # right = self.dungeon[i][j] + self.calculateMinimumHPHelper(i, j+1, memo)\\n # # down = self.dungeon[i][j] + self.calculateMinimumHPHelper(i+1, j, memo)\\n # # memo[key] = max(right, down)\\n # return memo[key]\\n \\n \\n\\n \",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n \\\"\\\"\\\"\\n 7:14\\n 11:00\\n 11:17\\n\\n DP\\n O(nm)\\n \\\"\\\"\\\"\\n self.dungeon = dungeon\\n self.height = len(dungeon)\\n self.width = len(dungeon[0])\\n return self.calculateMinimumHPHelper(0,0,{})\\n # return max((-options[1][1]) + 1, 1)\\n\\n def calculateMinimumHPHelper(self, i, j, memo):\\n \\\"\\\"\\\"\\n memo will store - \\n\\n the minimum hp we need from this point forward\\n which will be at least 1\\n\\n \\\"\\\"\\\"\\n key = (i,j)\\n if key in memo:\\n return memo[key]\\n\\n if i >= self.height:\\n return float(\\\"inf\\\")\\n if j >= self.width:\\n return float(\\\"inf\\\")\\n\\n val = self.dungeon[i][j]\\n if i == self.height-1 and j == self.width-1:\\n memo[key] = max(-val+1, 1)\\n return memo[key]\\n \\n right = self.calculateMinimumHPHelper(i, j+1, memo)\\n down = self.calculateMinimumHPHelper(i+1, j, memo)\\n memo[key] = max(1, min(right, down)-val)\\n return memo[key]\\n\\n # def calculateMinimumHPHelper(self, i, j, memo):\\n # \\\"\\\"\\\"\\n # memo will store two tuples\\n # (\\n # (best_current_health, corresponding_worst_health_in_path)\\n # (current_health, best_corresponding_worst_health_in_path)\\n # )\\n # the best health loss from this point forward and the \\n # worst health loss along the best path forward\\n # \\\"\\\"\\\"\\n # key = (i,j)\\n # if key in memo:\\n # return memo[key]\\n \\n # if i >= self.height:\\n # return [(-float(\\\"inf\\\"), -float(\\\"inf\\\")), (-float(\\\"inf\\\"), -float(\\\"inf\\\"))]\\n # if j >= self.width:\\n # return [(-float(\\\"inf\\\"), -float(\\\"inf\\\")), (-float(\\\"inf\\\"), -float(\\\"inf\\\"))]\\n \\n # val = self.dungeon[i][j]\\n # if i == self.height-1 and j == self.width-1:\\n # memo[key] = [(val, val), (val, val)]\\n # return memo[key]\\n\\n # possibilities = []\\n # possibilities.extend(self.calculateMinimumHPHelper(i, j+1, memo))\\n # possibilities.extend(self.calculateMinimumHPHelper(i+1, j, memo))\\n\\n # options = []\\n # for [curr, worst] in possibilities:\\n # options.append((min(val, val+curr), min(val+curr, val, worst)))\\n # # print(\\\"Here options\\\", i, j, options)\\n # options.sort(key=lambda x: x[0])\\n # best_curr = options[-1]\\n\\n # options.sort(key=lambda x: x[1])\\n # best_worst = options[-1]\\n # memo[key] = (best_curr, best_worst)\\n \\n\\n # # if i == self.height-1:\\n # # right_curr, right_worst = self.calculateMinimumHPHelper(i, j+1, memo)\\n # # new_curr = self.dungeon[i][j] + right_curr\\n # # memo[key] = new_curr, min(new_curr, right_worst)\\n # # return memo[key]\\n # # if j == self.width-1:\\n # # down_curr, down_worst = self.calculateMinimumHPHelper(i, j+1, memo)\\n # # memo[key] = self.dungeon[i][j] + self.calculateMinimumHPHelper(i+1, j, memo)\\n # # return memo[key]\\n # # right = self.dungeon[i][j] + self.calculateMinimumHPHelper(i, j+1, memo)\\n # # down = self.dungeon[i][j] + self.calculateMinimumHPHelper(i+1, j, memo)\\n # # memo[key] = max(right, down)\\n # return memo[key]\\n \\n \\n\\n \",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n \\n \\n m, n = len(dungeon), len(dungeon[0])\\n memo = {}\\n \\n def dfs(i, j):\\n # Base case: out of bounds\\n if i == m or j == n:\\n return float('inf')\\n \\n # Reached the princess\\n if i == m - 1 and j == n - 1:\\n return max(1, 1 - dungeon[i][j])\\n \\n # Check if we've already calculated this\\n if (i, j) in memo:\\n return memo[(i, j)]\\n \\n # Recursive case: go right or down\\n right = dfs(i, j + 1)\\n down = dfs(i + 1, j)\\n \\n min_health = min(right, down) - dungeon[i][j]\\n memo[(i, j)] = max(1, min_health)\\n return memo[(i, j)]\\n \\n return dfs(0, 0)\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n memo = {}\\n\\n def minimumHealth(i, j) -> int:\\n if i >= len(dungeon) or j >= len(dungeon[0]):\\n return None\\n\\n if (i, j) in memo:\\n return memo[(i, j)]\\n\\n down = minimumHealth(i + 1, j)\\n right = minimumHealth(i, j + 1)\\n\\n if down and right:\\n minPath = min(down, right)\\n\\n elif down:\\n minPath = down\\n\\n elif right:\\n minPath = right\\n\\n else: # at the end\\n if dungeon[i][j] >= 0:\\n memo[(i, j)] = 1\\n\\n else:\\n memo[(i, j)] = dungeon[i][j] * -1 + 1\\n \\n return memo[(i, j)]\\n \\n memo[(i, j)] = max(minPath - dungeon[i][j], 1)\\n return memo[(i, j)]\\n\\n return minimumHealth(0, 0)\\n\\n \\n\",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n cache: dict[tuple[int, int]: tuple[int, int]] = {}\\n ROWS, COLS = len(dungeon), len(dungeon[0])\\n\\n def dp(r: int, c: int) -> tuple[int, int]:\\n if (r, c) == (ROWS - 1, COLS - 1):\\n return max(1, 1 - dungeon[r][c])\\n if not (0 <= r < ROWS and 0 <= c < COLS):\\n return sys.maxsize\\n key: tuple[int, int] = (r, c)\\n if key in cache:\\n return cache[key]\\n # cache[key] = 1\\n \\n cache[key] = min(dp(r + 1, c), dp(r, c + 1)) - dungeon[r][c]\\n cache[key] = max(1, cache[key])\\n\\n return cache[key]\\n\\n return dp(0, 0)\\n\\n\",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, arr: List[List[int]]) -> int:\\n n = len(arr)\\n m = len(arr[0])\\n def solve(idx1, idx2, cache):\\n if idx1 >= n or idx2 >= m:\\n return float('inf')\\n if idx1 == n-1 and idx2 == m-1:\\n return 1 if arr[-1][-1] >= 0 else -arr[-1][-1] + 1\\n \\n if (idx1, idx2) in cache:\\n return cache[(idx1, idx2)]\\n \\n option1 = solve(idx1 + 1, idx2, cache)\\n option2 = solve(idx1, idx2 + 1, cache)\\n cache[(idx1, idx2)] = min(option1, option2) - arr[idx1][idx2]\\n if cache[(idx1, idx2)] <= 0:\\n cache[(idx1, idx2)] = 1\\n return cache[(idx1, idx2)]\\n cache = {}\\n res = solve(0, 0, cache)\\n print(cache)\\n return res\",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"class Solution:\\n def mincost(self, dungeon, x, y):\\n if x == len(dungeon) - 1 and y == len(dungeon[0]) - 1:\\n return dungeon[-1][-1]\\n if x >= len(dungeon) or y >= len(dungeon[0]):\\n return -float('inf')\\n \\n if (x,y) in self.hash:\\n return self.hash[(x,y)]\\n \\n self.hash[(x,y)] = 0\\n mx = max(\\n self.mincost(dungeon, x+1, y),\\n self.mincost(dungeon, x, y+1)\\n )\\n if mx > 0:\\n mx = 0\\n mx = mx + dungeon[x][y]\\n if mx < 0:\\n self.hash[(x,y)] = mx\\n\\n return self.hash[(x,y)]\\n\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n self.hash = {}\\n res = self.mincost(dungeon, 0, 0)\\n if res < 0:\\n return -res + 1\\n return 1\\n \",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n\\n n = len(dungeon)\\n m = len(dungeon[0])\\n\\n h = {}\\n\\n\\n def dfs(i, j, val, minVal):\\n\\n if i == n-1 and j == m-1:\\n return dungeon[i][j]\\n\\n key = (i, j)\\n\\n if key in h:\\n return h[key]\\n \\n res = float('-inf')\\n\\n if i + 1 < n:\\n res = max(res, dfs(i+1, j, val, minVal))\\n \\n if j + 1 < m:\\n res = max(res, dfs(i, j+1, val, minVal))\\n \\n h[key] = min(res + dungeon[i][j], dungeon[i][j])\\n return h[key]\\n \\n \\n\\n res = dfs(0, 0, 0, 1)\\n\\n if res > 0:\\n return 1\\n\\n return abs(res) + 1\\n\\n \",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n @cache\\n def dfs(i, j):\\n if i == len(dungeon) - 1 and j == len(dungeon[0]) - 1:\\n return dungeon[i][j]\\n\\n maxHealth = float('-inf') \\n if i + 1 < len(dungeon):\\n maxHealth = max(maxHealth, min(dfs(i+1,j), 0))\\n if j + 1 < len(dungeon[0]):\\n maxHealth = max(maxHealth, min(dfs(i,j+1), 0))\\n\\n return maxHealth + dungeon[i][j]\\n\\n \\n return abs(dfs(0, 0)) + 1 if dfs(0, 0) < 0 else 1\",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n cache = {}\\n def findHt(i, j):\\n if (i, j) in cache:\\n return cache[(i, j)]\\n\\n if i == len(dungeon) or j == len(dungeon[0]):\\n return float('-inf')\\n elif i == len(dungeon)-1 and j == len(dungeon[0])-1:\\n return 0 if dungeon[i][j] > 0 else dungeon[i][j]\\n\\n val1 = findHt(i+1, j)\\n if dungeon[i][j] + val1 > 0:\\n val1 = 0\\n else:\\n val1 += dungeon[i][j]\\n\\n val2 = findHt(i, j+1)\\n if dungeon[i][j] + val2 > 0:\\n val2 = 0\\n else:\\n val2 += dungeon[i][j]\\n\\n res = max(val1, val2)\\n cache[(i, j)] = res\\n \\n return res\\n\\n ans = findHt(0, 0)\\n \\n return 1 if ans > 0 else abs(ans)+1\",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n cache = {}\\n def findHt(i, j):\\n if (i, j) in cache:\\n return cache[(i, j)]\\n\\n if i == len(dungeon) or j == len(dungeon[0]):\\n return float('-inf')\\n elif i == len(dungeon)-1 and j == len(dungeon[0])-1:\\n return 0 if dungeon[i][j] > 0 else dungeon[i][j]\\n\\n val1 = findHt(i+1, j)\\n if dungeon[i][j] + val1 > 0:\\n val1 = 0\\n else:\\n val1 += dungeon[i][j]\\n\\n val2 = findHt(i, j+1)\\n if dungeon[i][j] + val2 > 0:\\n val2 = 0\\n else:\\n val2 += dungeon[i][j]\\n\\n res = max(val1, val2)\\n cache[(i, j)] = res\\n \\n return res\\n\\n ans = findHt(0, 0)\\n \\n return 1 if ans > 0 else abs(ans)+1\",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n m, n = len(dungeon), len(dungeon[0])\\n @lru_cache(None)\\n def bfs(i,j):\\n if i>=m or j >=n: return 1e9\\n if i == m-1 and j == n-1:\\n return 1 if dungeon[i][j]>=0 else -dungeon[i][j]+1\\n down = bfs(i+1,j)\\n right = bfs(i, j+1)\\n mini = max(1,min(down, right) - dungeon[i][j])\\n return mini\\n return bfs(0,0)\\n \",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"class Solution:\\n def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:\\n M,N = len(dungeon), len(dungeon[0])\\n @cache\\n def dfs(i,j):\\n res = inf\\n if i+1 < M:\\n res = dfs(i+1, j)\\n if j+1 < N:\\n res = min(res, dfs(i, j+1))\\n res = 1 if res == inf else res\\n return max(1, res - dungeon[i][j])\\n return dfs(0,0)\",\n \"memory\": \"20000\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":38,"string":"38"}}},{"rowIdx":172,"cells":{"question_id":{"kind":"number","value":179,"string":"179"},"name":{"kind":"string","value":"largest-number"},"content":{"kind":"string","value":"<p>Given a list of non-negative integers <code>nums</code>, arrange them such that they form the largest number and return it.</p>\n\n<p>Since the result may be very large, so you need to return a string instead of an integer.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [10,2]\n<strong>Output:</strong> "210"\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [3,30,34,5,9]\n<strong>Output:</strong> "9534330"\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 100</code></li>\n\t<li><code>0 <= nums[i] <= 10<sup>9</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":39.733210929273454,"string":"39.733211"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","string","greedy","sorting"],"string":"[\n \"array\",\n \"string\",\n \"greedy\",\n \"sorting\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18\", 0.0427], [\"20\", 0.064], [\"21\", 0.0213], [\"22\", 0.064], [\"23\", 0.1281], [\"24\", 0.1494], [\"25\", 0.1494], [\"26\", 0.2988], [\"27\", 0.7684], [\"28\", 0.4055], [\"29\", 0.5977], [\"30\", 1.302], [\"31\", 1.4514], [\"32\", 1.6222], [\"33\", 1.8143], [\"34\", 3.5219], [\"35\", 5.0374], [\"36\", 3.4792], [\"37\", 4.1622], [\"38\", 6.318], [\"39\", 6.5315], [\"40\", 5.3575], [\"41\", 5.7417], [\"42\", 7.4707], [\"43\", 6.9797], [\"44\", 5.08], [\"45\", 3.9488], [\"46\", 4.5037], [\"47\", 3.9274], [\"48\", 2.3693], [\"49\", 2.1772], [\"50\", 1.5795], [\"51\", 1.2593], [\"52\", 1.0245], [\"53\", 0.8111], [\"54\", 0.6617], [\"55\", 0.619], [\"56\", 0.4482], [\"57\", 0.4269], [\"58\", 0.2561], [\"59\", 0.4055], [\"60\", 0.3202], [\"61\", 0.4696], [\"62\", 0.5977], [\"63\", 0.4055]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16100\", 0.0427], [\"16200\", 0.1921], [\"16300\", 3.2444], [\"16400\", 21.9851], [\"16500\", 41.5795]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n snums = list(map(str, nums))\n print(snums)\n snums.sort(key=lambda x: x*10, reverse = True)\n\n if snums[0] == \"0\":\n return \"0\"\n \n return ''.join(snums)\n\n","runtime":"18"},{"code":"from functools import cmp_to_key\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n nums = [str(l) for l in nums]\n \n def comp(num1, num2):\n a = int(num1 + num2)\n b = int(num2 + num1)\n if a > b:\n return -1\n if b > a:\n return 1\n return 0\n \n nums = sorted(nums, key=cmp_to_key(comp))\n res = \"\".join(nums)\n while len(res) > 1 and res[0] == \"0\":\n res = res[1:]\n return res\n","runtime":"20"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n \n str_nums = list(map(str, nums))\n \n # Sort using custom key\n str_nums.sort(key=lambda x: x * 10, reverse=True)\n \n # Concatenate all numbers\n largest_num = ''.join(str_nums)\n \n # Handle the case where the number is zero (e.g., [0, 0])\n if largest_num[0] == '0':\n return '0'\n \n return largest_num\n\n\n\n\n\n\n\n ","runtime":"21"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n # Convert all integers to strings\n nums = list(map(str, nums))\n # Sort numbers based on their combined order\n nums.sort(key=lambda x: x*10, reverse=True)\n # Join sorted numbers into a single string\n result = ''.join(nums)\n # Edge case: If the largest number is '0', return '0'\n if result[0] == '0':\n return '0'\n return result\n ","runtime":"22"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n vals = [str(num) for num in nums]\n \n vals.sort(key=lambda x:x*10, reverse=True)\n\n if vals[0] == '0':\n return '0'\n \n return ''.join(vals)\n \n \n\n ","runtime":"23"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n result = [str(num) for num in nums]\n\n result.sort(key=lambda a: a * 10, reverse=True)\n\n if result[0] == \"0\":\n return \"0\"\n \n return \"\".join(result)\n\n# Input:\n# nums: List[int]\n\n# Ouput: str # largest number that can be formed by concatenating all the numbers\n\n\n# Example:\n# nums: [10, 312, 5, 1]\n\n# - convert nums to strings\n# - sort numStrings in descending other\n# - return concatenation","runtime":"24"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n\n for i,n in enumerate(nums):\n nums[i] = str(n)\n \n def compare(n1,n2):\n if n1+n2 > n2+n1:\n return -1\n else:\n return 1\n \n\n nums = sorted(nums,key =cmp_to_key(compare))\n return str(int(\"\".join(nums)))\n\n\n \n ","runtime":"25"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n nums = list(map(str, nums))\n nums.sort(key=lambda x: x*10, reverse=True)\n ans = ''.join(nums)\n return '0' if ans[0] == '0' else ans","runtime":"26"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n # Sort the numbers using Merge Sort\n sorted_nums = self._merge_sort(nums, 0, len(nums) - 1)\n # Concatenate sorted numbers to form the largest number\n largest_num = \"\".join(map(str, sorted_nums))\n # Handle the case where the largest number is zero\n return \"0\" if largest_num[0] == \"0\" else largest_num\n\n def _merge_sort(self, nums: List[int], left: int, right: int) -> List[int]:\n # Base case: a single element is already sorted\n if left >= right:\n return [nums[left]]\n mid = left + (right - left) // 2\n\n # Recursively sort the left and right halves\n left_half = self._merge_sort(nums, left, mid)\n right_half = self._merge_sort(nums, mid + 1, right)\n\n # Merge the sorted halves\n return self._merge(left_half, right_half)\n\n def _merge(self, left_half: List[int], right_half: List[int]) -> List[int]:\n sorted_nums = []\n left_index, right_index = 0, 0\n\n # Merge the two halves based on custom comparison\n while left_index < len(left_half) and right_index < len(right_half):\n if self._compare(left_half[left_index], right_half[right_index]):\n sorted_nums.append(left_half[left_index])\n left_index += 1\n else:\n sorted_nums.append(right_half[right_index])\n right_index += 1\n\n # Append remaining elements from left half\n sorted_nums.extend(left_half[left_index:])\n\n # Append remaining elements from right half\n sorted_nums.extend(right_half[right_index:])\n return sorted_nums\n\n def _compare(self, first_num: int, second_num: int) -> bool:\n # Compare concatenated strings to decide the order\n return str(first_num) + str(second_num) > str(second_num) + str(\n first_num\n )","runtime":"27"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n for i in range(len(nums)):\n nums[i] = str(nums[i])\n\n nums.sort(key = lambda x:x*10, reverse=True)\n\n if nums[0] == \"0\":\n return \"0\"\n final_lst = []\n for i in range(len(nums)):\n final_lst.append(nums[i])\n\n return ''.join(final_lst)\n ","runtime":"28"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n nums = [str(n) for n in nums]\n nums.sort(reverse = True, key = lambda x : x * 10)\n if nums[0] == '0': return '0'\n return ''.join(nums)","runtime":"29"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n arr=list(map(str,nums))\n arr.sort(key=lambda x:x*10,reverse=True)\n if arr[0]==\"0\":\n return \"0\"\n large=\"\".join(arr)\n return large","runtime":"30"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n for i, n in enumerate(nums):\n nums[i] = str(n)\n \n def compare(n1, n2):\n if n1 + n2 > n2 + n1:\n return -1\n else:\n return 1\n\n nums = sorted(nums, key=cmp_to_key(compare))\n \n return str(int(\"\".join(nums)))\n\n ","runtime":"30"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n from functools import cmp_to_key\n return str(int(''.join(map(str, sorted(nums, key=cmp_to_key(cmp))))))\n\ndef cmp(a: int, b: int):\n return -1 if int(str(a)+str(b)) > int(str(b)+str(a)) else 1\n","runtime":"31"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n # Edge case: if all numbers are zero, return \"0\"\n if not any(nums):\n return \"0\"\n\n # Custom comparison function for heapq (simulating the comparator in Java)\n class LargerStrComparator(str):\n def __lt__(self, other):\n # Custom comparison: return True if self+other > other+self\n return self + other > other + self\n\n # Priority queue (min-heap), but we push elements using a custom comparator\n heap = []\n for num in nums:\n heapq.heappush(heap, LargerStrComparator(str(num)))\n\n # Build the result string by popping from the heap\n result = []\n while heap:\n result.append(heapq.heappop(heap))\n\n # Concatenate and return the result\n largest_num = \"\".join(result)\n\n # Handle case where all elements are \"0\"\n return \"0\" if largest_num[0] == \"0\" else largest_num","runtime":"32"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n # x+y*10**log(x)>y+x*10**log(y)\n # x(10**log(y)-1)>y(10**log(x)-1)\n # x/(10**log(x)-1)>y/(10**log(y)-1)\n nums.sort(key=lambda x:x/(10**len(str(x))-1),reverse=True)\n val=''\n for n in nums:\n val=val+str(n)\n # second highest\n # i=len(nums)-2\n # while i>=1 and nums[i]==nums[i+1]:\n # i-=1\n # nums[i],nums[i+1]=nums[i+1],nums[i]\n\n return str(int(val))\n","runtime":"32"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n # Convert each integer to a string\n num_strings = [str(num) for num in nums]\n\n # Sort strings based on concatenated values\n num_strings.sort(key=lambda a: a * 10, reverse=True)\n\n # Handle the case where the largest number is zero\n if num_strings[0] == \"0\":\n return \"0\"\n\n # Concatenate sorted strings to form the largest number\n return \"\".join(num_strings)","runtime":"33"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n if sum(nums) == 0:\n return '0'\n nums_5_times = [str(n) * 10 for n in nums]\n nums_5_times = sorted(nums_5_times)[::-1]\n nums = [n[:int(len(n) / 10)] for n in nums_5_times]\n return ''.join(nums)","runtime":"33"},{"code":"from functools import cmp_to_key\n\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n nums.sort(key = lambda x: int(str(x)[0]), reverse = True)\n chunks = []\n chunk = [nums[0]]\n n = len(nums)\n for i in range(1, n):\n # print(nums[i], str(nums[i])[0], \"123\".ljust(5, str(nums[i])[0]))\n if str(nums[i])[0] != str(chunk[0])[0]:\n chunks.append(chunk)\n chunk = [nums[i]]\n else:\n chunk.append(nums[i])\n chunks.append(chunk)\n result = \"\"\n for chunk in chunks:\n if len(chunk) == 1:\n result += str(chunk[0])\n else:\n max_len = len(str(max(chunk)))\n key = str(chunk[0])[0]\n n_ = len(chunk)\n # chunk.sort(reverse=False)\n\n def cmp_items(a, b):\n a_ = int(str(a) + str(b))\n b_ = int(str(b) + str(a))\n if a_ > b_:\n return 1\n elif a_ == b_:\n return 0\n else:\n return -1\n\n cmp_items_py3 = cmp_to_key(cmp_items)\n chunk.sort(reverse=True, key=cmp_items_py3)\n # print(chunk)\n result += \"\".join([str(x) for x in chunk])\n \n\n return str(int(result))","runtime":"34"},{"code":"class Larger(str):\n def __lt__(x, y): # less than, x is self \n return x+y > y+x # x+y is indeed larger here which seems false as return for less than\n # but we want it in reversed for descending order\n\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n r = ''.join(sorted(map(str, nums), key=Larger))\n return '0' if r[0] == '0' else r","runtime":"34"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n if sum(nums) == 0: return '0'\n arr = sorted(nums, key=lambda x: str(x)*10, reverse=True)\n res = ''.join(map(str, arr))\n return res","runtime":"35"},{"code":"from functools import cmp_to_key\n\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n def cmp_items(a, b):\n a_ = int(str(a) + str(b))\n b_ = int(str(b) + str(a))\n if a_ > b_:\n return 1\n elif a_ == b_:\n return 0\n else:\n return -1\n\n cmp_items_py3 = cmp_to_key(cmp_items)\n nums.sort(key = cmp_items_py3, reverse = True)\n result = \"\".join([str(x) for x in nums])\n return str(int(result))\n ","runtime":"35"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n # Convert integers to strings\n array = list(map(str, nums))\n print(array)\n # Custom sorting with a lambda function\n array.sort(key=lambda x: x*10, reverse=True)\n \n # Handle the case where the largest number is \"0\"\n if array[0] == \"0\":\n return \"0\"\n \n # Build the largest number from the sorted array\n largest = ''.join(array)\n \n return largest","runtime":"36"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n # Convert numbers to strings for easier manipulation\n nums = list(map(str, nums))\n \n # Sort numbers based on the combination that forms the largest number\n nums.sort(key=lambda x: x*10, reverse=True)\n \n # Join the sorted numbers into the largest number\n s = \"\".join(nums)\n \n # Handle the edge case where the largest number is '0' (e.g., [0, 0])\n return '0' if s[0] == '0' else s","runtime":"36"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n \"\"\"lyst = [ [[] for _ in range(9)] for _ in range(9) ]\n\n # i,j i = starting no., j = len(number)\n\n for l in nums:\n s = str(l)\n i = int(s[0]) -1\n j = len(s)-1\n if lyst[i][j] :\n p = 0\n while (p<len(lyst[i][j])) and lyst[i][j][p] < i :\n p += 1\n lyst[i][j].insert(p, l)\n else:\n lyst[i][j].append(l)\n s = \"\"\n for i in range(8,-1,-1):\n for j in range(8,-1,-1):\n p = lyst[i][j]\n if p :\n for l in p:\n s = s + str(l)\n return s \"\"\"\n nums = list(map(str, nums))\n \n # Sort the numbers based on custom comparison (x+y vs y+x)\n nums.sort(key=lambda x: x * 10, reverse=True)\n \n # Join the sorted numbers\n result = ''.join(nums)\n \n # Edge case: If the largest number is '0', return '0'\n if result[0] == '0':\n return \"0\"\n \n return result","runtime":"37"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n # x+y*10**log(x)>y+x*10**log(y)\n # x(10**log(y)-1)>y(10**log(x)-1)\n # x/(10**log(x)-1)>y/(10**log(y)-1)\n nums.sort(key=lambda x:x/(10**len(str(x))-1),reverse=True)\n val=''\n for n in nums:\n val=val+str(n)\n return str(int(val))","runtime":"37"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n a=list(map(str,nums))\n a.sort(key=lambda x:x*10,reverse=True)\n result = \"\".join(a)\n return \"0\" if result[0] == \"0\" else result","runtime":"38"},{"code":"def insert (s, l, i) :\n while i and s + l[i-1] > l[i-1] + s :\n l[i] = l[i-1]\n i -= 1\n l[i] = s\n\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n for i in range (len (nums)) :\n insert (str (nums[i]), nums, i)\n return str (int (''.join (nums)))","runtime":"38"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n # Sort the numbers using Quick Sort\n self._quick_sort(nums, 0, len(nums) - 1)\n # Concatenate sorted numbers to form the largest number\n largest_num = \"\".join(map(str, nums))\n # Handle the case where the largest number is zero\n return \"0\" if largest_num[0] == \"0\" else largest_num\n\n def _quick_sort(self, nums: List[int], left: int, right: int) -> None:\n # Base case: if the range has one or no elements, it is already sorted\n if left >= right:\n return\n\n # Partition the array and get the pivot index\n pivot_index = self._partition(nums, left, right)\n\n # Recursively sort the sub-arrays\n self._quick_sort(nums, left, pivot_index - 1)\n self._quick_sort(nums, pivot_index + 1, right)\n\n def _partition(self, nums: List[int], left: int, right: int) -> int:\n pivot = nums[right]\n low_index = left\n\n # Rearrange elements so that those greater than the pivot are on the left\n for i in range(left, right):\n if self._compare(nums[i], pivot):\n nums[i], nums[low_index] = nums[low_index], nums[i]\n low_index += 1\n\n # Place the pivot in its correct position\n nums[low_index], nums[right] = nums[right], nums[low_index]\n return low_index\n\n def _compare(self, first_num: int, second_num: int) -> bool:\n # Compare concatenated strings to decide the order\n return str(first_num) + str(second_num) > str(second_num) + str(\n first_num\n )","runtime":"39"},{"code":"def insert (s, l) :\n l.append (s) \n i = len (l) - 1\n while i and s + l[i-1] > l[i-1] + s :\n l[i] = l[i-1]\n i -= 1\n l[i] = s\n\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n result = []\n for i in nums :\n insert (str (i), result)\n return str (int (''.join (result)))","runtime":"39"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n b=list(map(str,nums))\n a=sorted(b,key= lambda i:i*10, reverse=True)\n if a[0] == \"0\":\n return \"0\"\n return ''.join(a)","runtime":"40"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n # Convert each integer to a string\n num_strings = [str(num) for num in nums]\n\n # Sort strings based on concatenated values\n num_strings.sort(key=lambda a: a * 10, reverse=True)\n\n # Handle the case where the largest number is zero\n if num_strings[0] == \"0\":\n return \"0\"\n\n # Concatenate sorted strings to form the largest number\n return \"\".join(num_strings)","runtime":"40"},{"code":"from functools import cmp_to_key\n\nclass Solution:\n def largestNumber(self, nums):\n # Convert all numbers to strings\n nums_str = list(map(str, nums))\n \n # Define a custom comparator function\n def compare(x, y):\n if x + y > y + x:\n return -1\n elif x + y < y + x:\n return 1\n else:\n return 0\n \n # Sort numbers using the custom comparator\n nums_str.sort(key=cmp_to_key(compare))\n \n # Join sorted numbers\n largest_num = ''.join(nums_str)\n \n # Handle the case where the result is '000...'\n if largest_num[0] == '0':\n return '0'\n \n return largest_num\n\n# Example usage\nif __name__ == \"__main__\":\n solution = Solution()\n print(solution.largestNumber([10, 2])) # Output: \"210\"\n print(solution.largestNumber([3, 30, 34, 5, 9])) # Output: \"9534330\"\n","runtime":"41"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n array = list(map(str, nums))\n array.sort(key=lambda x: x*10, reverse=True)\n \n if array[0] == \"0\":\n return \"0\"\n \n answer = ''.join(array)\n \n return answer","runtime":"41"},{"code":"class Solution:\n RUN = 32\n\n def largestNumber(self, nums: List[int]) -> str:\n # Sort the numbers using custom Tim Sort\n self.tim_sort(nums)\n # Concatenate sorted numbers to form the largest number\n largest_num = \"\".join(map(str, nums))\n # Handle the case where the largest number is zero\n return \"0\" if largest_num[0] == \"0\" else largest_num\n\n def insertion_sort(self, nums: List[int], left: int, right: int):\n for i in range(left + 1, right + 1):\n temp = nums[i]\n j = i - 1\n while j >= left and self.compare(temp, nums[j]):\n nums[j + 1] = nums[j]\n j -= 1\n nums[j + 1] = temp\n\n def merge(self, nums: List[int], left: int, mid: int, right: int):\n left_arr = nums[left : mid + 1]\n right_arr = nums[mid + 1 : right + 1]\n\n i, j, k = 0, 0, left\n while i < len(left_arr) and j < len(right_arr):\n if self.compare(left_arr[i], right_arr[j]):\n nums[k] = left_arr[i]\n i += 1\n else:\n nums[k] = right_arr[j]\n j += 1\n k += 1\n nums[k : right + 1] = left_arr[i:] + right_arr[j:]\n\n def tim_sort(self, nums: List[int]):\n n = len(nums)\n # Sort small runs with insertion sort\n for i in range(0, n, self.RUN):\n self.insertion_sort(nums, i, min(i + self.RUN - 1, n - 1))\n # Merge sorted runs\n size = self.RUN\n while size < n:\n for left in range(0, n, 2 * size):\n mid = left + size - 1\n right = min(left + 2 * size - 1, n - 1)\n if mid < right:\n self.merge(nums, left, mid, right)\n size *= 2\n\n def compare(self, first_num: int, second_num: int) -> bool:\n return str(first_num) + str(second_num) > str(second_num) + str(\n first_num\n )","runtime":"42"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n # Convert integers to strings\n array = list(map(str, nums))\n print(array)\n \n # Custom sorting with a lambda function\n array.sort(key=lambda x: x*10, reverse=True)\n\n # Multiplying a string by 10 ensures that the resulting string is sufficiently long to cover a reasonable range of string lengths for most common cases. This helps in comparing numbers with different lengths in a manner that simulates numeric ordering.\n\n # For instance, if you have '2' and '10', multiplying by 10 results in '2222222222' and '10101010101010101010', respectively. When sorted lexicographically, '10101010101010101010' comes before '2222222222', which aligns with their numeric ordering.\n \n # Handle the case where the largest number is \"0\"\n if array[0] == \"0\":\n return \"0\"\n \n # Build the largest number from the sorted array\n largest = ''.join(array)\n \n return largest","runtime":"42"},{"code":"from functools import cmp_to_key\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n nums = [str(num) for num in nums]\n nums.sort(key=cmp_to_key(lambda a,b : 1 if a + b < b + a else -1))\n return \"0\" if nums[0] == \"0\" else \"\".join(nums)\n ","runtime":"43"},{"code":"def compare(X,Y):\n if X+Y > Y+X:\n return -1\n else:\n return 1\n\nclass Solution:\n\n def largestNumber(self, nums: List[int]) -> str:\n nums = list(map(str, nums))\n nums.sort(key = cmp_to_key(compare))\n result = ''.join(nums)\n print(result)\n if result[0] == '0':\n return '0'\n return result","runtime":"43"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n def comp(a, b):\n a, b = int(a + b), int(b + a)\n if a > b: return -1\n elif a > b: return 1\n else: return 0\n nums = sorted([str(n) for n in nums], key=functools.cmp_to_key(comp))\n # nums.sort(key=functools.cmp_to_key(lambda x,y: -1 if int(str(x) + str(y)) > int(str(y) + str(x)) else (1 if int(str(x) + str(y)) < int(str(y) + str(x)) else 0)))\n if nums[0] == '0': return '0'\n return \"\".join(nums)\n # return str(int(\"\".join(str(n) for n in nums)))","runtime":"44"},{"code":"from functools import cmp_to_key\n\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n def cmp_items(a, b):\n a_ = int(str(a) + str(b))\n b_ = int(str(b) + str(a))\n if a_ > b_:\n return 1\n elif a_ == b_:\n return 0\n else:\n return -1\n\n cmp_items_py3 = cmp_to_key(cmp_items)\n nums.sort(key = cmp_items_py3, reverse = True)\n result = \"\".join([str(x) for x in nums])\n return str(int(result))\n ","runtime":"45"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n # Edge case: if all numbers are zero, return \"0\"\n if not any(nums):\n return \"0\"\n\n # Custom comparison function for heapq (simulating the comparator in Java)\n class LargerStrComparator(str):\n def __lt__(self, other):\n # Custom comparison: return True if self+other > other+self\n return self + other > other + self\n\n # Priority queue (min-heap), but we push elements using a custom comparator\n heap = []\n for num in nums:\n heapq.heappush(heap, LargerStrComparator(str(num)))\n\n # Build the result string by popping from the heap\n result = []\n while heap:\n result.append(heapq.heappop(heap))\n\n # Concatenate and return the result\n largest_num = \"\".join(result)\n\n # Handle case where all elements are \"0\"\n return \"0\" if largest_num[0] == \"0\" else largest_num","runtime":"45"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n str_nums = list(map(str, nums)) \n str_nums.sort(key=lambda x: x * 10, reverse=True) \n return str(int(''.join(str_nums)))\n\n\n\n\n\n\n ","runtime":"46"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n for i,n in enumerate(nums):\n nums[i]=str(n)\n def compare(a,b):\n if a+b > b+a:\n return -1\n else:\n return 1\n \n nums = sorted(nums,key=cmp_to_key(compare))\n\n return str(int(\"\".join(nums)))","runtime":"46"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n # Sort the numbers using Merge Sort\n sorted_nums = self._merge_sort(nums, 0, len(nums) - 1)\n # Concatenate sorted numbers to form the largest number\n largest_num = \"\".join(map(str, sorted_nums))\n # Handle the case where the largest number is zero\n return \"0\" if largest_num[0] == \"0\" else largest_num\n\n def _merge_sort(self, nums: List[int], left: int, right: int) -> List[int]:\n # Base case: a single element is already sorted\n if left >= right:\n return [nums[left]]\n mid = left + (right - left) // 2\n\n # Recursively sort the left and right halves\n left_half = self._merge_sort(nums, left, mid)\n right_half = self._merge_sort(nums, mid + 1, right)\n\n # Merge the sorted halves\n return self._merge(left_half, right_half)\n\n def _merge(self, left_half: List[int], right_half: List[int]) -> List[int]:\n sorted_nums = []\n left_index, right_index = 0, 0\n\n # Merge the two halves based on custom comparison\n while left_index < len(left_half) and right_index < len(right_half):\n if self._compare(left_half[left_index], right_half[right_index]):\n sorted_nums.append(left_half[left_index])\n left_index += 1\n else:\n sorted_nums.append(right_half[right_index])\n right_index += 1\n\n # Append remaining elements from left half\n sorted_nums.extend(left_half[left_index:])\n\n # Append remaining elements from right half\n sorted_nums.extend(right_half[right_index:])\n return sorted_nums\n\n def _compare(self, first_num: int, second_num: int) -> bool:\n # Compare concatenated strings to decide the order\n return str(first_num) + str(second_num) > str(second_num) + str(\n first_num\n )","runtime":"47"},{"code":"def insert (s, l, i) :\n while i and s + l[i-1] > l[i-1] + s :\n l[i] = l[i-1]\n i -= 1\n l[i] = s\n\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n for i in range (len (nums)) :\n insert (str (nums[i]), nums, i)\n if nums[0] != '0' : return ''.join (nums)\n return '0'","runtime":"47"},{"code":"def insert (s, l) :\n l.append (s) \n i = len (l) - 1\n while i and s + l[i-1] > l[i-1] + s :\n l[i] = l[i-1]\n i -= 1\n l[i] = s\n\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n result = []\n for i in nums :\n insert (str (i), result)\n return '0' if result[0] == '0' else ''.join (result)","runtime":"48"},{"code":"class Solution:\n def mergeSort(self,a):\n if len(a) <= 1:\n return a\n\n ## dvided into two halves \n mid = len(a) // 2\n ## sort the halves \n first = self.mergeSort(a[:mid])\n second = self.mergeSort(a[mid:])\n i = j = 0\n\n final = list()\n\n while i < len(first) and j < len(second):\n ## compar\n if int(first[i] + second[j]) > int(second[j] + first[i]):\n final.append(first[i])\n i += 1 \n else:\n final.append(second[j])\n j += 1\n\n final.extend(first[i:])\n final.extend(second[j:])\n return final \n\n\n def largestNumber(self, nums: List[int]) -> str:\n\n ## convert ot a list of string s\n int_list = [str(num) for num in nums]\n final = self.mergeSort(int_list)\n\n return \"0\" if final[0] == \"0\" else \"\".join(final)\n\n \n\n ","runtime":"48"},{"code":"class Solution:\n RUN = 32\n\n def largestNumber(self, nums: List[int]) -> str:\n # Sort the numbers using custom Tim Sort\n self.tim_sort(nums)\n # Concatenate sorted numbers to form the largest number\n largest_num = \"\".join(map(str, nums))\n # Handle the case where the largest number is zero\n return \"0\" if largest_num[0] == \"0\" else largest_num\n\n def insertion_sort(self, nums: List[int], left: int, right: int):\n for i in range(left + 1, right + 1):\n temp = nums[i]\n j = i - 1\n while j >= left and self.compare(temp, nums[j]):\n nums[j + 1] = nums[j]\n j -= 1\n nums[j + 1] = temp\n\n def merge(self, nums: List[int], left: int, mid: int, right: int):\n left_arr = nums[left : mid + 1]\n right_arr = nums[mid + 1 : right + 1]\n\n i, j, k = 0, 0, left\n while i < len(left_arr) and j < len(right_arr):\n if self.compare(left_arr[i], right_arr[j]):\n nums[k] = left_arr[i]\n i += 1\n else:\n nums[k] = right_arr[j]\n j += 1\n k += 1\n nums[k : right + 1] = left_arr[i:] + right_arr[j:]\n\n def tim_sort(self, nums: List[int]):\n n = len(nums)\n # Sort small runs with insertion sort\n for i in range(0, n, self.RUN):\n self.insertion_sort(nums, i, min(i + self.RUN - 1, n - 1))\n # Merge sorted runs\n size = self.RUN\n while size < n:\n for left in range(0, n, 2 * size):\n mid = left + size - 1\n right = min(left + 2 * size - 1, n - 1)\n if mid < right:\n self.merge(nums, left, mid, right)\n size *= 2\n\n def compare(self, first_num: int, second_num: int) -> bool:\n return str(first_num) + str(second_num) > str(second_num) + str(\n first_num\n )","runtime":"49"},{"code":"from functools import cmp_to_key\n\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n def cmp_items(a, b):\n a_ = int(str(a) + str(b))\n b_ = int(str(b) + str(a))\n if a_ > b_:\n return 1\n elif a_ == b_:\n return 0\n else:\n return -1\n\n cmp_items_py3 = cmp_to_key(cmp_items)\n nums.sort(key = cmp_items_py3, reverse = True)\n result = \"\".join([str(x) for x in nums])\n return str(int(result))\n ","runtime":"50"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n nums = [str(num) for num in nums]\n\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if nums[i] + nums[j] > nums[j] + nums[i]:\n continue\n else:\n nums[i], nums[j] = nums[j], nums[i]\n\n res = ''.join(nums)\n\n return \"0\" if int(res) == 0 else res\n\n","runtime":"50"},{"code":"class Solution(object):\n def largestNumber(self, nums):\n # Sort the numbers using Quick Sort\n self._quick_sort(nums, 0, len(nums) - 1)\n # Concatenate sorted numbers to form the largest number\n largest_num = \"\".join(map(str, nums))\n # Handle the case where the largest number is zero\n return \"0\" if largest_num[0] == \"0\" else largest_num\n\n def _quick_sort(self, nums: List[int], left: int, right: int) -> None:\n # Base case: if the range has one or no elements, it is already sorted\n if left >= right:\n return\n\n # Partition the array and get the pivot index\n pivot_index = self._partition(nums, left, right)\n\n # Recursively sort the sub-arrays\n self._quick_sort(nums, left, pivot_index - 1)\n self._quick_sort(nums, pivot_index + 1, right)\n\n def _partition(self, nums: List[int], left: int, right: int) -> int:\n pivot = nums[right]\n low_index = left\n\n # Rearrange elements so that those greater than the pivot are on the left\n for i in range(left, right):\n if self._compare(nums[i], pivot):\n nums[i], nums[low_index] = nums[low_index], nums[i]\n low_index += 1\n\n # Place the pivot in its correct position\n nums[low_index], nums[right] = nums[right], nums[low_index]\n return low_index\n\n def _compare(self, first_num: int, second_num: int) -> bool:\n # Compare concatenated strings to decide the order\n return str(first_num) + str(second_num) > str(second_num) + str(\n first_num\n )\n\n#['9', '5', '34', '3', '30']\n303\n330\n9,5\n934\n\n\n\n\n\n","runtime":"51"},{"code":"def insert (n, l) :\n l.append (n)\n i = len (l) - 1\n while i and str(n) + str(l[i-1]) > str(l[i-1]) + str(n): \n l[i] = l[i-1]\n i -= 1\n l[i] = n\n\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n result = []\n for i in nums :\n insert (i, result)\n return str (int (''.join ([str (i) for i in result])))","runtime":"52"},{"code":"def insert (s, l, i) :\n while i and s + l[i-1] > l[i-1] + s :\n l[i] = l[i-1]\n i -= 1\n l[i] = s\n\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n for i in range (len (nums)) :\n insert (str (nums[i]), nums, i)\n return ''.join (nums) if nums[0] != '0' else '0'","runtime":"52"},{"code":"class Solution:\n RUN = 32\n\n def largestNumber(self, nums: List[int]) -> str:\n # Sort the numbers using custom Tim Sort\n self.tim_sort(nums)\n # Concatenate sorted numbers to form the largest number\n largest_num = \"\".join(map(str, nums))\n # Handle the case where the largest number is zero\n return \"0\" if largest_num[0] == \"0\" else largest_num\n\n def insertion_sort(self, nums: List[int], left: int, right: int):\n for i in range(left + 1, right + 1):\n temp = nums[i]\n j = i - 1\n while j >= left and self.compare(temp, nums[j]):\n nums[j + 1] = nums[j]\n j -= 1\n nums[j + 1] = temp\n\n def merge(self, nums: List[int], left: int, mid: int, right: int):\n left_arr = nums[left : mid + 1]\n right_arr = nums[mid + 1 : right + 1]\n\n i, j, k = 0, 0, left\n while i < len(left_arr) and j < len(right_arr):\n if self.compare(left_arr[i], right_arr[j]):\n nums[k] = left_arr[i]\n i += 1\n else:\n nums[k] = right_arr[j]\n j += 1\n k += 1\n nums[k : right + 1] = left_arr[i:] + right_arr[j:]\n\n def tim_sort(self, nums: List[int]):\n n = len(nums)\n # Sort small runs with insertion sort\n for i in range(0, n, self.RUN):\n self.insertion_sort(nums, i, min(i + self.RUN - 1, n - 1))\n # Merge sorted runs\n size = self.RUN\n while size < n:\n for left in range(0, n, 2 * size):\n mid = left + size - 1\n right = min(left + 2 * size - 1, n - 1)\n if mid < right:\n self.merge(nums, left, mid, right)\n size *= 2\n\n def compare(self, first_num: int, second_num: int) -> bool:\n return str(first_num) + str(second_num) > str(second_num) + str(\n first_num\n )","runtime":"53"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n m = len(str(max(nums)))\n nums.sort(key=functools.cmp_to_key(lambda x,y: -1 if int(str(x) + str(y)) > int(str(y) + str(x)) else (1 if int(str(x) + str(y)) < int(str(y) + str(x)) else 0)))\n\n # nums.sort(key=lambda x: len(str(x)))\n # nums.sort(key=lambda x: [int(y) for y in (str(x)*(m // len(str(x)) + 1))[:m + (m > len(str(x)))]] + [int(str(x)[0])] * (m == len(str(x))), reverse=True)\n # print(nums)\n return str(int(\"\".join(str(n) for n in nums)))","runtime":"53"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n nums = [str(x) for x in nums]\n def compare(a, b):\n if a + b >= b + a:\n return True\n else:\n return False\n ans = list()\n n = len(nums)\n while nums:\n temp = nums[0]\n for i in range(1, len(nums)):\n if compare(nums[i], temp):\n temp = nums[i]\n if temp == '0' and len(nums) == n:\n return '0'\n nums.remove(temp)\n ans.append(temp)\n return \"\".join(ans)","runtime":"54"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n nums = [str(x) for x in nums]\n def compare(a, b):\n if a + b >= b + a:\n return True\n else:\n return False\n\n ans = list()\n n = len(nums)\n while nums:\n temp = nums[0]\n for i in range(1, len(nums)):\n if compare(nums[i], temp):\n temp = nums[i]\n \n if temp == \"0\" and len(nums) == n:\n return \"0\"\n nums.remove(temp)\n ans.append(temp)\n\n return \"\".join(ans)\n\n ","runtime":"55"},{"code":"class Solution(object):\n def largestNumber(self, nums):\n nums = sorted([str(x) for x in nums],reverse=True) # sorting in reverse lexicographical order\n print (nums)\n for i in range(len(nums)): # normal bubble sort but the comparison is done on the basis of concatenated string\n flag = False\n for j in range(len(nums)-i-1):\n if len(nums[j]) == len(nums[j+1]):\n continue\n if int(nums[j]+nums[j+1]) < int(nums[j+1]+nums[j]):\n nums[j],nums[j+1]=nums[j+1],nums[j]\n flag = True\n #if not flag:\n # break\n ans = str(int(\"\".join(nums)))\n return ans \n\n\n['9', '5', '34', '30', '3']\n\n\n\n\n","runtime":"56"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n nums = [str(x) for x in nums]\n def compare(a, b):\n if a + b >= b + a:\n return True\n else:\n return False\n \n ans = list()\n n = len(nums)\n while nums:\n temp = nums[0]\n for i in range(1, len(nums)):\n if compare(nums[i], temp):\n temp = nums[i]\n\n if temp == \"0\" and len(nums) == n:\n return \"0\"\n nums.remove(temp)\n ans.append(temp)\n \n return \"\".join(ans) #concatinate string together","runtime":"56"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n nums = [str(x) for x in nums]\n def compare(a, b): #helper function\n if a + b >= b + a:\n return True\n else:\n return False\n \n ans = list()\n n = len(nums)\n while nums:\n temp = nums[0]\n for i in range(1, len(nums)):\n if compare(nums[i], temp):\n temp = nums[i]\n if temp == \"0\" and len(nums) ==n:\n return \"0\"\n nums.remove(temp)\n ans.append(temp)\n\n return \"\".join(ans)\n ","runtime":"57"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n nums = [str(x) for x in nums]\n def compare(a, b):\n if a + b >= b + a:\n return True\n else:\n return False\n \n ans = list()\n n = len(nums)\n while nums:\n temp = nums[0]\n for i in range(1, len(nums)):\n if compare(nums[i], temp):\n temp = nums[i]\n \n if temp == \"0\" and len(nums) == n:\n return \"0\"\n nums.remove(temp)\n ans.append(temp)\n \n return \"\".join(ans)\n \n\n\n","runtime":"57"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n strNums = [str(num) for num in nums]\n for i in range(len(nums)):\n j = i+1\n while j < len(nums):\n if strNums[i] + strNums[j] < strNums[j] + strNums[i]:\n strNums[i], strNums[j] = strNums[j], strNums[i]\n j += 1\n return (str(int(\"\".join(strNums))))","runtime":"58"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n if nums.count(0) == len(nums): return '0'\n n = len(nums); nums = [str(num) for num in nums]\n for i in range(n):\n swaps = 0\n for j in range(n - 1):\n if nums[j + 1] + nums[j] > nums[j] + nums[j + 1]:\n nums[j], nums[j + 1] = nums[j + 1], nums[j]; swaps += 1\n if swaps == 0: break\n return ''.join(nums)","runtime":"59"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n def compare(i,j):\n if (nums[i]==\"999999991\"):\n return 1\n elif(nums[i]+nums[j]<nums[j]+nums[j]):\n return 1\n elif(nums[i]+nums[j]>nums[j]+nums[j]):\n return -1\n else:\n return 0\n for i in range(len(nums)):\n nums[i] = str(nums[i])\n for i in range(0,len(nums)-1):\n for j in range(i+1,len(nums)):\n if (compare(i,j)>0):\n nums[i],nums[j]=nums[j],nums[i]\n result = ''.join(nums)\n return '0' if result[0] == '0' else result\n\n\n ","runtime":"60"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n if sum(nums) == 0:\n return '0'\n res = [str(i) for i in nums]\n for i in range(len(res)-1):\n for j in range(len(res)-i-1):\n if int(res[j+1]+res[j]) > int(res[j]+res[j+1]):\n res[j+1], res[j] = res[j], res[j+1]\n return ''.join(res)\n\n ","runtime":"61"},{"code":"def insert (n, l) :\n l.append (n)\n i = len (l) - 1\n while i and int(str(n) + str(l[i-1])) > int(str(l[i-1]) + str(n)): \n l[i] = l[i-1]\n i -= 1\n l[i] = n\n\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n result = []\n for i in nums :\n insert (i, result)\n return str (int (''.join ([str (i) for i in result])))","runtime":"62"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n\n # is a larger than b?\n def compare(a, b):\n j = 0\n while j < min(len(a), len(b)):\n if a[j] == b[j]:\n j += 1\n continue\n \n if a[j] < b[j]:\n return False\n else:\n return True\n\n if a + b > b + a:\n return True\n else:\n return False\n \n\n # def compare(a, b):\n # if len(a) == len(b):\n # return a > b\n # else:\n # return a + b > b + a\n\n \n nums = [str(x) for x in nums]\n ans = \"\"\n\n N = len(nums)\n while nums:\n max_candidate = nums[0]\n index = 0\n for i in range(1, len(nums)):\n if compare(nums[i], max_candidate):\n max_candidate = nums[i]\n index = i \n \n if len(nums) == N and max_candidate == \"0\":\n return \"0\"\n\n ans += max_candidate\n nums.remove(nums[index])\n \n\n return ans\n \n ","runtime":"63"}],"string":"[\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n snums = list(map(str, nums))\\n print(snums)\\n snums.sort(key=lambda x: x*10, reverse = True)\\n\\n if snums[0] == \\\"0\\\":\\n return \\\"0\\\"\\n \\n return ''.join(snums)\\n\\n\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"from functools import cmp_to_key\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n nums = [str(l) for l in nums]\\n \\n def comp(num1, num2):\\n a = int(num1 + num2)\\n b = int(num2 + num1)\\n if a > b:\\n return -1\\n if b > a:\\n return 1\\n return 0\\n \\n nums = sorted(nums, key=cmp_to_key(comp))\\n res = \\\"\\\".join(nums)\\n while len(res) > 1 and res[0] == \\\"0\\\":\\n res = res[1:]\\n return res\\n\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n \\n str_nums = list(map(str, nums))\\n \\n # Sort using custom key\\n str_nums.sort(key=lambda x: x * 10, reverse=True)\\n \\n # Concatenate all numbers\\n largest_num = ''.join(str_nums)\\n \\n # Handle the case where the number is zero (e.g., [0, 0])\\n if largest_num[0] == '0':\\n return '0'\\n \\n return largest_num\\n\\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n # Convert all integers to strings\\n nums = list(map(str, nums))\\n # Sort numbers based on their combined order\\n nums.sort(key=lambda x: x*10, reverse=True)\\n # Join sorted numbers into a single string\\n result = ''.join(nums)\\n # Edge case: If the largest number is '0', return '0'\\n if result[0] == '0':\\n return '0'\\n return result\\n \",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n vals = [str(num) for num in nums]\\n \\n vals.sort(key=lambda x:x*10, reverse=True)\\n\\n if vals[0] == '0':\\n return '0'\\n \\n return ''.join(vals)\\n \\n \\n\\n \",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n result = [str(num) for num in nums]\\n\\n result.sort(key=lambda a: a * 10, reverse=True)\\n\\n if result[0] == \\\"0\\\":\\n return \\\"0\\\"\\n \\n return \\\"\\\".join(result)\\n\\n# Input:\\n# nums: List[int]\\n\\n# Ouput: str # largest number that can be formed by concatenating all the numbers\\n\\n\\n# Example:\\n# nums: [10, 312, 5, 1]\\n\\n# - convert nums to strings\\n# - sort numStrings in descending other\\n# - return concatenation\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n\\n for i,n in enumerate(nums):\\n nums[i] = str(n)\\n \\n def compare(n1,n2):\\n if n1+n2 > n2+n1:\\n return -1\\n else:\\n return 1\\n \\n\\n nums = sorted(nums,key =cmp_to_key(compare))\\n return str(int(\\\"\\\".join(nums)))\\n\\n\\n \\n \",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n nums = list(map(str, nums))\\n nums.sort(key=lambda x: x*10, reverse=True)\\n ans = ''.join(nums)\\n return '0' if ans[0] == '0' else ans\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n # Sort the numbers using Merge Sort\\n sorted_nums = self._merge_sort(nums, 0, len(nums) - 1)\\n # Concatenate sorted numbers to form the largest number\\n largest_num = \\\"\\\".join(map(str, sorted_nums))\\n # Handle the case where the largest number is zero\\n return \\\"0\\\" if largest_num[0] == \\\"0\\\" else largest_num\\n\\n def _merge_sort(self, nums: List[int], left: int, right: int) -> List[int]:\\n # Base case: a single element is already sorted\\n if left >= right:\\n return [nums[left]]\\n mid = left + (right - left) // 2\\n\\n # Recursively sort the left and right halves\\n left_half = self._merge_sort(nums, left, mid)\\n right_half = self._merge_sort(nums, mid + 1, right)\\n\\n # Merge the sorted halves\\n return self._merge(left_half, right_half)\\n\\n def _merge(self, left_half: List[int], right_half: List[int]) -> List[int]:\\n sorted_nums = []\\n left_index, right_index = 0, 0\\n\\n # Merge the two halves based on custom comparison\\n while left_index < len(left_half) and right_index < len(right_half):\\n if self._compare(left_half[left_index], right_half[right_index]):\\n sorted_nums.append(left_half[left_index])\\n left_index += 1\\n else:\\n sorted_nums.append(right_half[right_index])\\n right_index += 1\\n\\n # Append remaining elements from left half\\n sorted_nums.extend(left_half[left_index:])\\n\\n # Append remaining elements from right half\\n sorted_nums.extend(right_half[right_index:])\\n return sorted_nums\\n\\n def _compare(self, first_num: int, second_num: int) -> bool:\\n # Compare concatenated strings to decide the order\\n return str(first_num) + str(second_num) > str(second_num) + str(\\n first_num\\n )\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n for i in range(len(nums)):\\n nums[i] = str(nums[i])\\n\\n nums.sort(key = lambda x:x*10, reverse=True)\\n\\n if nums[0] == \\\"0\\\":\\n return \\\"0\\\"\\n final_lst = []\\n for i in range(len(nums)):\\n final_lst.append(nums[i])\\n\\n return ''.join(final_lst)\\n \",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n nums = [str(n) for n in nums]\\n nums.sort(reverse = True, key = lambda x : x * 10)\\n if nums[0] == '0': return '0'\\n return ''.join(nums)\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n arr=list(map(str,nums))\\n arr.sort(key=lambda x:x*10,reverse=True)\\n if arr[0]==\\\"0\\\":\\n return \\\"0\\\"\\n large=\\\"\\\".join(arr)\\n return large\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n for i, n in enumerate(nums):\\n nums[i] = str(n)\\n \\n def compare(n1, n2):\\n if n1 + n2 > n2 + n1:\\n return -1\\n else:\\n return 1\\n\\n nums = sorted(nums, key=cmp_to_key(compare))\\n \\n return str(int(\\\"\\\".join(nums)))\\n\\n \",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n from functools import cmp_to_key\\n return str(int(''.join(map(str, sorted(nums, key=cmp_to_key(cmp))))))\\n\\ndef cmp(a: int, b: int):\\n return -1 if int(str(a)+str(b)) > int(str(b)+str(a)) else 1\\n\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n # Edge case: if all numbers are zero, return \\\"0\\\"\\n if not any(nums):\\n return \\\"0\\\"\\n\\n # Custom comparison function for heapq (simulating the comparator in Java)\\n class LargerStrComparator(str):\\n def __lt__(self, other):\\n # Custom comparison: return True if self+other > other+self\\n return self + other > other + self\\n\\n # Priority queue (min-heap), but we push elements using a custom comparator\\n heap = []\\n for num in nums:\\n heapq.heappush(heap, LargerStrComparator(str(num)))\\n\\n # Build the result string by popping from the heap\\n result = []\\n while heap:\\n result.append(heapq.heappop(heap))\\n\\n # Concatenate and return the result\\n largest_num = \\\"\\\".join(result)\\n\\n # Handle case where all elements are \\\"0\\\"\\n return \\\"0\\\" if largest_num[0] == \\\"0\\\" else largest_num\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n # x+y*10**log(x)>y+x*10**log(y)\\n # x(10**log(y)-1)>y(10**log(x)-1)\\n # x/(10**log(x)-1)>y/(10**log(y)-1)\\n nums.sort(key=lambda x:x/(10**len(str(x))-1),reverse=True)\\n val=''\\n for n in nums:\\n val=val+str(n)\\n # second highest\\n # i=len(nums)-2\\n # while i>=1 and nums[i]==nums[i+1]:\\n # i-=1\\n # nums[i],nums[i+1]=nums[i+1],nums[i]\\n\\n return str(int(val))\\n\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n # Convert each integer to a string\\n num_strings = [str(num) for num in nums]\\n\\n # Sort strings based on concatenated values\\n num_strings.sort(key=lambda a: a * 10, reverse=True)\\n\\n # Handle the case where the largest number is zero\\n if num_strings[0] == \\\"0\\\":\\n return \\\"0\\\"\\n\\n # Concatenate sorted strings to form the largest number\\n return \\\"\\\".join(num_strings)\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n if sum(nums) == 0:\\n return '0'\\n nums_5_times = [str(n) * 10 for n in nums]\\n nums_5_times = sorted(nums_5_times)[::-1]\\n nums = [n[:int(len(n) / 10)] for n in nums_5_times]\\n return ''.join(nums)\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"from functools import cmp_to_key\\n\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n nums.sort(key = lambda x: int(str(x)[0]), reverse = True)\\n chunks = []\\n chunk = [nums[0]]\\n n = len(nums)\\n for i in range(1, n):\\n # print(nums[i], str(nums[i])[0], \\\"123\\\".ljust(5, str(nums[i])[0]))\\n if str(nums[i])[0] != str(chunk[0])[0]:\\n chunks.append(chunk)\\n chunk = [nums[i]]\\n else:\\n chunk.append(nums[i])\\n chunks.append(chunk)\\n result = \\\"\\\"\\n for chunk in chunks:\\n if len(chunk) == 1:\\n result += str(chunk[0])\\n else:\\n max_len = len(str(max(chunk)))\\n key = str(chunk[0])[0]\\n n_ = len(chunk)\\n # chunk.sort(reverse=False)\\n\\n def cmp_items(a, b):\\n a_ = int(str(a) + str(b))\\n b_ = int(str(b) + str(a))\\n if a_ > b_:\\n return 1\\n elif a_ == b_:\\n return 0\\n else:\\n return -1\\n\\n cmp_items_py3 = cmp_to_key(cmp_items)\\n chunk.sort(reverse=True, key=cmp_items_py3)\\n # print(chunk)\\n result += \\\"\\\".join([str(x) for x in chunk])\\n \\n\\n return str(int(result))\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Larger(str):\\n def __lt__(x, y): # less than, x is self \\n return x+y > y+x # x+y is indeed larger here which seems false as return for less than\\n # but we want it in reversed for descending order\\n\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n r = ''.join(sorted(map(str, nums), key=Larger))\\n return '0' if r[0] == '0' else r\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n if sum(nums) == 0: return '0'\\n arr = sorted(nums, key=lambda x: str(x)*10, reverse=True)\\n res = ''.join(map(str, arr))\\n return res\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"from functools import cmp_to_key\\n\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n def cmp_items(a, b):\\n a_ = int(str(a) + str(b))\\n b_ = int(str(b) + str(a))\\n if a_ > b_:\\n return 1\\n elif a_ == b_:\\n return 0\\n else:\\n return -1\\n\\n cmp_items_py3 = cmp_to_key(cmp_items)\\n nums.sort(key = cmp_items_py3, reverse = True)\\n result = \\\"\\\".join([str(x) for x in nums])\\n return str(int(result))\\n \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n # Convert integers to strings\\n array = list(map(str, nums))\\n print(array)\\n # Custom sorting with a lambda function\\n array.sort(key=lambda x: x*10, reverse=True)\\n \\n # Handle the case where the largest number is \\\"0\\\"\\n if array[0] == \\\"0\\\":\\n return \\\"0\\\"\\n \\n # Build the largest number from the sorted array\\n largest = ''.join(array)\\n \\n return largest\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n # Convert numbers to strings for easier manipulation\\n nums = list(map(str, nums))\\n \\n # Sort numbers based on the combination that forms the largest number\\n nums.sort(key=lambda x: x*10, reverse=True)\\n \\n # Join the sorted numbers into the largest number\\n s = \\\"\\\".join(nums)\\n \\n # Handle the edge case where the largest number is '0' (e.g., [0, 0])\\n return '0' if s[0] == '0' else s\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n \\\"\\\"\\\"lyst = [ [[] for _ in range(9)] for _ in range(9) ]\\n\\n # i,j i = starting no., j = len(number)\\n\\n for l in nums:\\n s = str(l)\\n i = int(s[0]) -1\\n j = len(s)-1\\n if lyst[i][j] :\\n p = 0\\n while (p<len(lyst[i][j])) and lyst[i][j][p] < i :\\n p += 1\\n lyst[i][j].insert(p, l)\\n else:\\n lyst[i][j].append(l)\\n s = \\\"\\\"\\n for i in range(8,-1,-1):\\n for j in range(8,-1,-1):\\n p = lyst[i][j]\\n if p :\\n for l in p:\\n s = s + str(l)\\n return s \\\"\\\"\\\"\\n nums = list(map(str, nums))\\n \\n # Sort the numbers based on custom comparison (x+y vs y+x)\\n nums.sort(key=lambda x: x * 10, reverse=True)\\n \\n # Join the sorted numbers\\n result = ''.join(nums)\\n \\n # Edge case: If the largest number is '0', return '0'\\n if result[0] == '0':\\n return \\\"0\\\"\\n \\n return result\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n # x+y*10**log(x)>y+x*10**log(y)\\n # x(10**log(y)-1)>y(10**log(x)-1)\\n # x/(10**log(x)-1)>y/(10**log(y)-1)\\n nums.sort(key=lambda x:x/(10**len(str(x))-1),reverse=True)\\n val=''\\n for n in nums:\\n val=val+str(n)\\n return str(int(val))\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n a=list(map(str,nums))\\n a.sort(key=lambda x:x*10,reverse=True)\\n result = \\\"\\\".join(a)\\n return \\\"0\\\" if result[0] == \\\"0\\\" else result\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"def insert (s, l, i) :\\n while i and s + l[i-1] > l[i-1] + s :\\n l[i] = l[i-1]\\n i -= 1\\n l[i] = s\\n\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n for i in range (len (nums)) :\\n insert (str (nums[i]), nums, i)\\n return str (int (''.join (nums)))\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n # Sort the numbers using Quick Sort\\n self._quick_sort(nums, 0, len(nums) - 1)\\n # Concatenate sorted numbers to form the largest number\\n largest_num = \\\"\\\".join(map(str, nums))\\n # Handle the case where the largest number is zero\\n return \\\"0\\\" if largest_num[0] == \\\"0\\\" else largest_num\\n\\n def _quick_sort(self, nums: List[int], left: int, right: int) -> None:\\n # Base case: if the range has one or no elements, it is already sorted\\n if left >= right:\\n return\\n\\n # Partition the array and get the pivot index\\n pivot_index = self._partition(nums, left, right)\\n\\n # Recursively sort the sub-arrays\\n self._quick_sort(nums, left, pivot_index - 1)\\n self._quick_sort(nums, pivot_index + 1, right)\\n\\n def _partition(self, nums: List[int], left: int, right: int) -> int:\\n pivot = nums[right]\\n low_index = left\\n\\n # Rearrange elements so that those greater than the pivot are on the left\\n for i in range(left, right):\\n if self._compare(nums[i], pivot):\\n nums[i], nums[low_index] = nums[low_index], nums[i]\\n low_index += 1\\n\\n # Place the pivot in its correct position\\n nums[low_index], nums[right] = nums[right], nums[low_index]\\n return low_index\\n\\n def _compare(self, first_num: int, second_num: int) -> bool:\\n # Compare concatenated strings to decide the order\\n return str(first_num) + str(second_num) > str(second_num) + str(\\n first_num\\n )\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"def insert (s, l) :\\n l.append (s) \\n i = len (l) - 1\\n while i and s + l[i-1] > l[i-1] + s :\\n l[i] = l[i-1]\\n i -= 1\\n l[i] = s\\n\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n result = []\\n for i in nums :\\n insert (str (i), result)\\n return str (int (''.join (result)))\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n b=list(map(str,nums))\\n a=sorted(b,key= lambda i:i*10, reverse=True)\\n if a[0] == \\\"0\\\":\\n return \\\"0\\\"\\n return ''.join(a)\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n # Convert each integer to a string\\n num_strings = [str(num) for num in nums]\\n\\n # Sort strings based on concatenated values\\n num_strings.sort(key=lambda a: a * 10, reverse=True)\\n\\n # Handle the case where the largest number is zero\\n if num_strings[0] == \\\"0\\\":\\n return \\\"0\\\"\\n\\n # Concatenate sorted strings to form the largest number\\n return \\\"\\\".join(num_strings)\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"from functools import cmp_to_key\\n\\nclass Solution:\\n def largestNumber(self, nums):\\n # Convert all numbers to strings\\n nums_str = list(map(str, nums))\\n \\n # Define a custom comparator function\\n def compare(x, y):\\n if x + y > y + x:\\n return -1\\n elif x + y < y + x:\\n return 1\\n else:\\n return 0\\n \\n # Sort numbers using the custom comparator\\n nums_str.sort(key=cmp_to_key(compare))\\n \\n # Join sorted numbers\\n largest_num = ''.join(nums_str)\\n \\n # Handle the case where the result is '000...'\\n if largest_num[0] == '0':\\n return '0'\\n \\n return largest_num\\n\\n# Example usage\\nif __name__ == \\\"__main__\\\":\\n solution = Solution()\\n print(solution.largestNumber([10, 2])) # Output: \\\"210\\\"\\n print(solution.largestNumber([3, 30, 34, 5, 9])) # Output: \\\"9534330\\\"\\n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n array = list(map(str, nums))\\n array.sort(key=lambda x: x*10, reverse=True)\\n \\n if array[0] == \\\"0\\\":\\n return \\\"0\\\"\\n \\n answer = ''.join(array)\\n \\n return answer\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n RUN = 32\\n\\n def largestNumber(self, nums: List[int]) -> str:\\n # Sort the numbers using custom Tim Sort\\n self.tim_sort(nums)\\n # Concatenate sorted numbers to form the largest number\\n largest_num = \\\"\\\".join(map(str, nums))\\n # Handle the case where the largest number is zero\\n return \\\"0\\\" if largest_num[0] == \\\"0\\\" else largest_num\\n\\n def insertion_sort(self, nums: List[int], left: int, right: int):\\n for i in range(left + 1, right + 1):\\n temp = nums[i]\\n j = i - 1\\n while j >= left and self.compare(temp, nums[j]):\\n nums[j + 1] = nums[j]\\n j -= 1\\n nums[j + 1] = temp\\n\\n def merge(self, nums: List[int], left: int, mid: int, right: int):\\n left_arr = nums[left : mid + 1]\\n right_arr = nums[mid + 1 : right + 1]\\n\\n i, j, k = 0, 0, left\\n while i < len(left_arr) and j < len(right_arr):\\n if self.compare(left_arr[i], right_arr[j]):\\n nums[k] = left_arr[i]\\n i += 1\\n else:\\n nums[k] = right_arr[j]\\n j += 1\\n k += 1\\n nums[k : right + 1] = left_arr[i:] + right_arr[j:]\\n\\n def tim_sort(self, nums: List[int]):\\n n = len(nums)\\n # Sort small runs with insertion sort\\n for i in range(0, n, self.RUN):\\n self.insertion_sort(nums, i, min(i + self.RUN - 1, n - 1))\\n # Merge sorted runs\\n size = self.RUN\\n while size < n:\\n for left in range(0, n, 2 * size):\\n mid = left + size - 1\\n right = min(left + 2 * size - 1, n - 1)\\n if mid < right:\\n self.merge(nums, left, mid, right)\\n size *= 2\\n\\n def compare(self, first_num: int, second_num: int) -> bool:\\n return str(first_num) + str(second_num) > str(second_num) + str(\\n first_num\\n )\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n # Convert integers to strings\\n array = list(map(str, nums))\\n print(array)\\n \\n # Custom sorting with a lambda function\\n array.sort(key=lambda x: x*10, reverse=True)\\n\\n # Multiplying a string by 10 ensures that the resulting string is sufficiently long to cover a reasonable range of string lengths for most common cases. This helps in comparing numbers with different lengths in a manner that simulates numeric ordering.\\n\\n # For instance, if you have '2' and '10', multiplying by 10 results in '2222222222' and '10101010101010101010', respectively. When sorted lexicographically, '10101010101010101010' comes before '2222222222', which aligns with their numeric ordering.\\n \\n # Handle the case where the largest number is \\\"0\\\"\\n if array[0] == \\\"0\\\":\\n return \\\"0\\\"\\n \\n # Build the largest number from the sorted array\\n largest = ''.join(array)\\n \\n return largest\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"from functools import cmp_to_key\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n nums = [str(num) for num in nums]\\n nums.sort(key=cmp_to_key(lambda a,b : 1 if a + b < b + a else -1))\\n return \\\"0\\\" if nums[0] == \\\"0\\\" else \\\"\\\".join(nums)\\n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"def compare(X,Y):\\n if X+Y > Y+X:\\n return -1\\n else:\\n return 1\\n\\nclass Solution:\\n\\n def largestNumber(self, nums: List[int]) -> str:\\n nums = list(map(str, nums))\\n nums.sort(key = cmp_to_key(compare))\\n result = ''.join(nums)\\n print(result)\\n if result[0] == '0':\\n return '0'\\n return result\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n def comp(a, b):\\n a, b = int(a + b), int(b + a)\\n if a > b: return -1\\n elif a > b: return 1\\n else: return 0\\n nums = sorted([str(n) for n in nums], key=functools.cmp_to_key(comp))\\n # nums.sort(key=functools.cmp_to_key(lambda x,y: -1 if int(str(x) + str(y)) > int(str(y) + str(x)) else (1 if int(str(x) + str(y)) < int(str(y) + str(x)) else 0)))\\n if nums[0] == '0': return '0'\\n return \\\"\\\".join(nums)\\n # return str(int(\\\"\\\".join(str(n) for n in nums)))\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"from functools import cmp_to_key\\n\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n def cmp_items(a, b):\\n a_ = int(str(a) + str(b))\\n b_ = int(str(b) + str(a))\\n if a_ > b_:\\n return 1\\n elif a_ == b_:\\n return 0\\n else:\\n return -1\\n\\n cmp_items_py3 = cmp_to_key(cmp_items)\\n nums.sort(key = cmp_items_py3, reverse = True)\\n result = \\\"\\\".join([str(x) for x in nums])\\n return str(int(result))\\n \",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n # Edge case: if all numbers are zero, return \\\"0\\\"\\n if not any(nums):\\n return \\\"0\\\"\\n\\n # Custom comparison function for heapq (simulating the comparator in Java)\\n class LargerStrComparator(str):\\n def __lt__(self, other):\\n # Custom comparison: return True if self+other > other+self\\n return self + other > other + self\\n\\n # Priority queue (min-heap), but we push elements using a custom comparator\\n heap = []\\n for num in nums:\\n heapq.heappush(heap, LargerStrComparator(str(num)))\\n\\n # Build the result string by popping from the heap\\n result = []\\n while heap:\\n result.append(heapq.heappop(heap))\\n\\n # Concatenate and return the result\\n largest_num = \\\"\\\".join(result)\\n\\n # Handle case where all elements are \\\"0\\\"\\n return \\\"0\\\" if largest_num[0] == \\\"0\\\" else largest_num\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n str_nums = list(map(str, nums)) \\n str_nums.sort(key=lambda x: x * 10, reverse=True) \\n return str(int(''.join(str_nums)))\\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n for i,n in enumerate(nums):\\n nums[i]=str(n)\\n def compare(a,b):\\n if a+b > b+a:\\n return -1\\n else:\\n return 1\\n \\n nums = sorted(nums,key=cmp_to_key(compare))\\n\\n return str(int(\\\"\\\".join(nums)))\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n # Sort the numbers using Merge Sort\\n sorted_nums = self._merge_sort(nums, 0, len(nums) - 1)\\n # Concatenate sorted numbers to form the largest number\\n largest_num = \\\"\\\".join(map(str, sorted_nums))\\n # Handle the case where the largest number is zero\\n return \\\"0\\\" if largest_num[0] == \\\"0\\\" else largest_num\\n\\n def _merge_sort(self, nums: List[int], left: int, right: int) -> List[int]:\\n # Base case: a single element is already sorted\\n if left >= right:\\n return [nums[left]]\\n mid = left + (right - left) // 2\\n\\n # Recursively sort the left and right halves\\n left_half = self._merge_sort(nums, left, mid)\\n right_half = self._merge_sort(nums, mid + 1, right)\\n\\n # Merge the sorted halves\\n return self._merge(left_half, right_half)\\n\\n def _merge(self, left_half: List[int], right_half: List[int]) -> List[int]:\\n sorted_nums = []\\n left_index, right_index = 0, 0\\n\\n # Merge the two halves based on custom comparison\\n while left_index < len(left_half) and right_index < len(right_half):\\n if self._compare(left_half[left_index], right_half[right_index]):\\n sorted_nums.append(left_half[left_index])\\n left_index += 1\\n else:\\n sorted_nums.append(right_half[right_index])\\n right_index += 1\\n\\n # Append remaining elements from left half\\n sorted_nums.extend(left_half[left_index:])\\n\\n # Append remaining elements from right half\\n sorted_nums.extend(right_half[right_index:])\\n return sorted_nums\\n\\n def _compare(self, first_num: int, second_num: int) -> bool:\\n # Compare concatenated strings to decide the order\\n return str(first_num) + str(second_num) > str(second_num) + str(\\n first_num\\n )\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"def insert (s, l, i) :\\n while i and s + l[i-1] > l[i-1] + s :\\n l[i] = l[i-1]\\n i -= 1\\n l[i] = s\\n\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n for i in range (len (nums)) :\\n insert (str (nums[i]), nums, i)\\n if nums[0] != '0' : return ''.join (nums)\\n return '0'\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"def insert (s, l) :\\n l.append (s) \\n i = len (l) - 1\\n while i and s + l[i-1] > l[i-1] + s :\\n l[i] = l[i-1]\\n i -= 1\\n l[i] = s\\n\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n result = []\\n for i in nums :\\n insert (str (i), result)\\n return '0' if result[0] == '0' else ''.join (result)\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def mergeSort(self,a):\\n if len(a) <= 1:\\n return a\\n\\n ## dvided into two halves \\n mid = len(a) // 2\\n ## sort the halves \\n first = self.mergeSort(a[:mid])\\n second = self.mergeSort(a[mid:])\\n i = j = 0\\n\\n final = list()\\n\\n while i < len(first) and j < len(second):\\n ## compar\\n if int(first[i] + second[j]) > int(second[j] + first[i]):\\n final.append(first[i])\\n i += 1 \\n else:\\n final.append(second[j])\\n j += 1\\n\\n final.extend(first[i:])\\n final.extend(second[j:])\\n return final \\n\\n\\n def largestNumber(self, nums: List[int]) -> str:\\n\\n ## convert ot a list of string s\\n int_list = [str(num) for num in nums]\\n final = self.mergeSort(int_list)\\n\\n return \\\"0\\\" if final[0] == \\\"0\\\" else \\\"\\\".join(final)\\n\\n \\n\\n \",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n RUN = 32\\n\\n def largestNumber(self, nums: List[int]) -> str:\\n # Sort the numbers using custom Tim Sort\\n self.tim_sort(nums)\\n # Concatenate sorted numbers to form the largest number\\n largest_num = \\\"\\\".join(map(str, nums))\\n # Handle the case where the largest number is zero\\n return \\\"0\\\" if largest_num[0] == \\\"0\\\" else largest_num\\n\\n def insertion_sort(self, nums: List[int], left: int, right: int):\\n for i in range(left + 1, right + 1):\\n temp = nums[i]\\n j = i - 1\\n while j >= left and self.compare(temp, nums[j]):\\n nums[j + 1] = nums[j]\\n j -= 1\\n nums[j + 1] = temp\\n\\n def merge(self, nums: List[int], left: int, mid: int, right: int):\\n left_arr = nums[left : mid + 1]\\n right_arr = nums[mid + 1 : right + 1]\\n\\n i, j, k = 0, 0, left\\n while i < len(left_arr) and j < len(right_arr):\\n if self.compare(left_arr[i], right_arr[j]):\\n nums[k] = left_arr[i]\\n i += 1\\n else:\\n nums[k] = right_arr[j]\\n j += 1\\n k += 1\\n nums[k : right + 1] = left_arr[i:] + right_arr[j:]\\n\\n def tim_sort(self, nums: List[int]):\\n n = len(nums)\\n # Sort small runs with insertion sort\\n for i in range(0, n, self.RUN):\\n self.insertion_sort(nums, i, min(i + self.RUN - 1, n - 1))\\n # Merge sorted runs\\n size = self.RUN\\n while size < n:\\n for left in range(0, n, 2 * size):\\n mid = left + size - 1\\n right = min(left + 2 * size - 1, n - 1)\\n if mid < right:\\n self.merge(nums, left, mid, right)\\n size *= 2\\n\\n def compare(self, first_num: int, second_num: int) -> bool:\\n return str(first_num) + str(second_num) > str(second_num) + str(\\n first_num\\n )\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"from functools import cmp_to_key\\n\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n def cmp_items(a, b):\\n a_ = int(str(a) + str(b))\\n b_ = int(str(b) + str(a))\\n if a_ > b_:\\n return 1\\n elif a_ == b_:\\n return 0\\n else:\\n return -1\\n\\n cmp_items_py3 = cmp_to_key(cmp_items)\\n nums.sort(key = cmp_items_py3, reverse = True)\\n result = \\\"\\\".join([str(x) for x in nums])\\n return str(int(result))\\n \",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n nums = [str(num) for num in nums]\\n\\n for i in range(len(nums)):\\n for j in range(i + 1, len(nums)):\\n if nums[i] + nums[j] > nums[j] + nums[i]:\\n continue\\n else:\\n nums[i], nums[j] = nums[j], nums[i]\\n\\n res = ''.join(nums)\\n\\n return \\\"0\\\" if int(res) == 0 else res\\n\\n\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution(object):\\n def largestNumber(self, nums):\\n # Sort the numbers using Quick Sort\\n self._quick_sort(nums, 0, len(nums) - 1)\\n # Concatenate sorted numbers to form the largest number\\n largest_num = \\\"\\\".join(map(str, nums))\\n # Handle the case where the largest number is zero\\n return \\\"0\\\" if largest_num[0] == \\\"0\\\" else largest_num\\n\\n def _quick_sort(self, nums: List[int], left: int, right: int) -> None:\\n # Base case: if the range has one or no elements, it is already sorted\\n if left >= right:\\n return\\n\\n # Partition the array and get the pivot index\\n pivot_index = self._partition(nums, left, right)\\n\\n # Recursively sort the sub-arrays\\n self._quick_sort(nums, left, pivot_index - 1)\\n self._quick_sort(nums, pivot_index + 1, right)\\n\\n def _partition(self, nums: List[int], left: int, right: int) -> int:\\n pivot = nums[right]\\n low_index = left\\n\\n # Rearrange elements so that those greater than the pivot are on the left\\n for i in range(left, right):\\n if self._compare(nums[i], pivot):\\n nums[i], nums[low_index] = nums[low_index], nums[i]\\n low_index += 1\\n\\n # Place the pivot in its correct position\\n nums[low_index], nums[right] = nums[right], nums[low_index]\\n return low_index\\n\\n def _compare(self, first_num: int, second_num: int) -> bool:\\n # Compare concatenated strings to decide the order\\n return str(first_num) + str(second_num) > str(second_num) + str(\\n first_num\\n )\\n\\n#['9', '5', '34', '3', '30']\\n303\\n330\\n9,5\\n934\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"def insert (n, l) :\\n l.append (n)\\n i = len (l) - 1\\n while i and str(n) + str(l[i-1]) > str(l[i-1]) + str(n): \\n l[i] = l[i-1]\\n i -= 1\\n l[i] = n\\n\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n result = []\\n for i in nums :\\n insert (i, result)\\n return str (int (''.join ([str (i) for i in result])))\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"def insert (s, l, i) :\\n while i and s + l[i-1] > l[i-1] + s :\\n l[i] = l[i-1]\\n i -= 1\\n l[i] = s\\n\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n for i in range (len (nums)) :\\n insert (str (nums[i]), nums, i)\\n return ''.join (nums) if nums[0] != '0' else '0'\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n RUN = 32\\n\\n def largestNumber(self, nums: List[int]) -> str:\\n # Sort the numbers using custom Tim Sort\\n self.tim_sort(nums)\\n # Concatenate sorted numbers to form the largest number\\n largest_num = \\\"\\\".join(map(str, nums))\\n # Handle the case where the largest number is zero\\n return \\\"0\\\" if largest_num[0] == \\\"0\\\" else largest_num\\n\\n def insertion_sort(self, nums: List[int], left: int, right: int):\\n for i in range(left + 1, right + 1):\\n temp = nums[i]\\n j = i - 1\\n while j >= left and self.compare(temp, nums[j]):\\n nums[j + 1] = nums[j]\\n j -= 1\\n nums[j + 1] = temp\\n\\n def merge(self, nums: List[int], left: int, mid: int, right: int):\\n left_arr = nums[left : mid + 1]\\n right_arr = nums[mid + 1 : right + 1]\\n\\n i, j, k = 0, 0, left\\n while i < len(left_arr) and j < len(right_arr):\\n if self.compare(left_arr[i], right_arr[j]):\\n nums[k] = left_arr[i]\\n i += 1\\n else:\\n nums[k] = right_arr[j]\\n j += 1\\n k += 1\\n nums[k : right + 1] = left_arr[i:] + right_arr[j:]\\n\\n def tim_sort(self, nums: List[int]):\\n n = len(nums)\\n # Sort small runs with insertion sort\\n for i in range(0, n, self.RUN):\\n self.insertion_sort(nums, i, min(i + self.RUN - 1, n - 1))\\n # Merge sorted runs\\n size = self.RUN\\n while size < n:\\n for left in range(0, n, 2 * size):\\n mid = left + size - 1\\n right = min(left + 2 * size - 1, n - 1)\\n if mid < right:\\n self.merge(nums, left, mid, right)\\n size *= 2\\n\\n def compare(self, first_num: int, second_num: int) -> bool:\\n return str(first_num) + str(second_num) > str(second_num) + str(\\n first_num\\n )\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n m = len(str(max(nums)))\\n nums.sort(key=functools.cmp_to_key(lambda x,y: -1 if int(str(x) + str(y)) > int(str(y) + str(x)) else (1 if int(str(x) + str(y)) < int(str(y) + str(x)) else 0)))\\n\\n # nums.sort(key=lambda x: len(str(x)))\\n # nums.sort(key=lambda x: [int(y) for y in (str(x)*(m // len(str(x)) + 1))[:m + (m > len(str(x)))]] + [int(str(x)[0])] * (m == len(str(x))), reverse=True)\\n # print(nums)\\n return str(int(\\\"\\\".join(str(n) for n in nums)))\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n nums = [str(x) for x in nums]\\n def compare(a, b):\\n if a + b >= b + a:\\n return True\\n else:\\n return False\\n ans = list()\\n n = len(nums)\\n while nums:\\n temp = nums[0]\\n for i in range(1, len(nums)):\\n if compare(nums[i], temp):\\n temp = nums[i]\\n if temp == '0' and len(nums) == n:\\n return '0'\\n nums.remove(temp)\\n ans.append(temp)\\n return \\\"\\\".join(ans)\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n nums = [str(x) for x in nums]\\n def compare(a, b):\\n if a + b >= b + a:\\n return True\\n else:\\n return False\\n\\n ans = list()\\n n = len(nums)\\n while nums:\\n temp = nums[0]\\n for i in range(1, len(nums)):\\n if compare(nums[i], temp):\\n temp = nums[i]\\n \\n if temp == \\\"0\\\" and len(nums) == n:\\n return \\\"0\\\"\\n nums.remove(temp)\\n ans.append(temp)\\n\\n return \\\"\\\".join(ans)\\n\\n \",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution(object):\\n def largestNumber(self, nums):\\n nums = sorted([str(x) for x in nums],reverse=True) # sorting in reverse lexicographical order\\n print (nums)\\n for i in range(len(nums)): # normal bubble sort but the comparison is done on the basis of concatenated string\\n flag = False\\n for j in range(len(nums)-i-1):\\n if len(nums[j]) == len(nums[j+1]):\\n continue\\n if int(nums[j]+nums[j+1]) < int(nums[j+1]+nums[j]):\\n nums[j],nums[j+1]=nums[j+1],nums[j]\\n flag = True\\n #if not flag:\\n # break\\n ans = str(int(\\\"\\\".join(nums)))\\n return ans \\n\\n\\n['9', '5', '34', '30', '3']\\n\\n\\n\\n\\n\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n nums = [str(x) for x in nums]\\n def compare(a, b):\\n if a + b >= b + a:\\n return True\\n else:\\n return False\\n \\n ans = list()\\n n = len(nums)\\n while nums:\\n temp = nums[0]\\n for i in range(1, len(nums)):\\n if compare(nums[i], temp):\\n temp = nums[i]\\n\\n if temp == \\\"0\\\" and len(nums) == n:\\n return \\\"0\\\"\\n nums.remove(temp)\\n ans.append(temp)\\n \\n return \\\"\\\".join(ans) #concatinate string together\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n nums = [str(x) for x in nums]\\n def compare(a, b): #helper function\\n if a + b >= b + a:\\n return True\\n else:\\n return False\\n \\n ans = list()\\n n = len(nums)\\n while nums:\\n temp = nums[0]\\n for i in range(1, len(nums)):\\n if compare(nums[i], temp):\\n temp = nums[i]\\n if temp == \\\"0\\\" and len(nums) ==n:\\n return \\\"0\\\"\\n nums.remove(temp)\\n ans.append(temp)\\n\\n return \\\"\\\".join(ans)\\n \",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n nums = [str(x) for x in nums]\\n def compare(a, b):\\n if a + b >= b + a:\\n return True\\n else:\\n return False\\n \\n ans = list()\\n n = len(nums)\\n while nums:\\n temp = nums[0]\\n for i in range(1, len(nums)):\\n if compare(nums[i], temp):\\n temp = nums[i]\\n \\n if temp == \\\"0\\\" and len(nums) == n:\\n return \\\"0\\\"\\n nums.remove(temp)\\n ans.append(temp)\\n \\n return \\\"\\\".join(ans)\\n \\n\\n\\n\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n strNums = [str(num) for num in nums]\\n for i in range(len(nums)):\\n j = i+1\\n while j < len(nums):\\n if strNums[i] + strNums[j] < strNums[j] + strNums[i]:\\n strNums[i], strNums[j] = strNums[j], strNums[i]\\n j += 1\\n return (str(int(\\\"\\\".join(strNums))))\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n if nums.count(0) == len(nums): return '0'\\n n = len(nums); nums = [str(num) for num in nums]\\n for i in range(n):\\n swaps = 0\\n for j in range(n - 1):\\n if nums[j + 1] + nums[j] > nums[j] + nums[j + 1]:\\n nums[j], nums[j + 1] = nums[j + 1], nums[j]; swaps += 1\\n if swaps == 0: break\\n return ''.join(nums)\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n def compare(i,j):\\n if (nums[i]==\\\"999999991\\\"):\\n return 1\\n elif(nums[i]+nums[j]<nums[j]+nums[j]):\\n return 1\\n elif(nums[i]+nums[j]>nums[j]+nums[j]):\\n return -1\\n else:\\n return 0\\n for i in range(len(nums)):\\n nums[i] = str(nums[i])\\n for i in range(0,len(nums)-1):\\n for j in range(i+1,len(nums)):\\n if (compare(i,j)>0):\\n nums[i],nums[j]=nums[j],nums[i]\\n result = ''.join(nums)\\n return '0' if result[0] == '0' else result\\n\\n\\n \",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n if sum(nums) == 0:\\n return '0'\\n res = [str(i) for i in nums]\\n for i in range(len(res)-1):\\n for j in range(len(res)-i-1):\\n if int(res[j+1]+res[j]) > int(res[j]+res[j+1]):\\n res[j+1], res[j] = res[j], res[j+1]\\n return ''.join(res)\\n\\n \",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"def insert (n, l) :\\n l.append (n)\\n i = len (l) - 1\\n while i and int(str(n) + str(l[i-1])) > int(str(l[i-1]) + str(n)): \\n l[i] = l[i-1]\\n i -= 1\\n l[i] = n\\n\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n result = []\\n for i in nums :\\n insert (i, result)\\n return str (int (''.join ([str (i) for i in result])))\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n\\n # is a larger than b?\\n def compare(a, b):\\n j = 0\\n while j < min(len(a), len(b)):\\n if a[j] == b[j]:\\n j += 1\\n continue\\n \\n if a[j] < b[j]:\\n return False\\n else:\\n return True\\n\\n if a + b > b + a:\\n return True\\n else:\\n return False\\n \\n\\n # def compare(a, b):\\n # if len(a) == len(b):\\n # return a > b\\n # else:\\n # return a + b > b + a\\n\\n \\n nums = [str(x) for x in nums]\\n ans = \\\"\\\"\\n\\n N = len(nums)\\n while nums:\\n max_candidate = nums[0]\\n index = 0\\n for i in range(1, len(nums)):\\n if compare(nums[i], max_candidate):\\n max_candidate = nums[i]\\n index = i \\n \\n if len(nums) == N and max_candidate == \\\"0\\\":\\n return \\\"0\\\"\\n\\n ans += max_candidate\\n nums.remove(nums[index])\\n \\n\\n return ans\\n \\n \",\n \"runtime\": \"63\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":67,"string":"67"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n # convert to string so we can compare\n for i, n in enumerate(nums):\n nums[i] = str(n)\n \n def compare(n1: str, n2: str):\n if n1 + n2 > n2 + n1:\n return -1\n else:\n return 1\n nums = sorted(nums, key=cmp_to_key(compare))\n\n\n\n return str(int(\"\".join(nums)))\n","memory":"16100"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n i = 0\n for n in nums:\n i += int(n == 0)\n if i == len(nums):\n return \"0\"\n\n def compare(n1, n2):\n if n1 + n2 > n2 + n1:\n return -1\n else:\n return +1\n for i, n in enumerate(nums):\n nums[i] = str(n)\n nums = sorted(nums, key=cmp_to_key(compare))\n return \"\".join(nums)\n\n ","memory":"16200"},{"code":"def insert (s, l) :\n l.append (s) \n i = len (l) - 1\n while i and s + l[i-1] > l[i-1] + s :\n l[i] = l[i-1]\n i -= 1\n l[i] = s\n\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n result = []\n for i in nums :\n insert (str (i), result)\n return '0' if result[0] == '0' else ''.join (result)","memory":"16300"},{"code":"def insert (s, l, i) :\n while i and s + l[i-1] > l[i-1] + s :\n l[i] = l[i-1]\n i -= 1\n l[i] = s\n\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n for i in range (len (nums)) :\n insert (str (nums[i]), nums, i)\n return str (int (''.join (nums)))","memory":"16300"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n str_nums = list(map(str, nums)) \n str_nums.sort(key=lambda x: x * 10, reverse=True) \n return str(int(''.join(str_nums)))\n\n\n\n\n\n\n ","memory":"16400"},{"code":"class Solution:\n def largestNumber(self, nums: List[int]) -> str:\n arr=list(map(str,nums))\n arr.sort(key=lambda x:x*10,reverse=True)\n if arr[0]==\"0\":\n return \"0\"\n large=\"\".join(arr)\n return large","memory":"16400"},{"code":"def compare(X,Y):\n if X+Y > Y+X:\n return -1\n else:\n return 1\n\nclass Solution:\n\n def largestNumber(self, nums: List[int]) -> str:\n nums = list(map(str, nums))\n nums.sort(key = cmp_to_key(compare))\n result = ''.join(nums)\n print(result)\n if result[0] == '0':\n return '0'\n return result","memory":"16500"},{"code":"from functools import cmp_to_key\nclass Solution:\n def largestNumber(self, nums: List[int]) -> str:\n nums = [str(num) for num in nums]\n \n # Sort the numbers based on custom concatenation logic\n nums.sort(key=lambda x: x*10, reverse=True)\n \n # If the largest number is 0, return \"0\"\n if nums[0] == \"0\":\n return \"0\"\n \n # Join the sorted numbers to form the largest number\n return \"\".join(nums)\n ","memory":"16500"}],"string":"[\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n # convert to string so we can compare\\n for i, n in enumerate(nums):\\n nums[i] = str(n)\\n \\n def compare(n1: str, n2: str):\\n if n1 + n2 > n2 + n1:\\n return -1\\n else:\\n return 1\\n nums = sorted(nums, key=cmp_to_key(compare))\\n\\n\\n\\n return str(int(\\\"\\\".join(nums)))\\n\",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n i = 0\\n for n in nums:\\n i += int(n == 0)\\n if i == len(nums):\\n return \\\"0\\\"\\n\\n def compare(n1, n2):\\n if n1 + n2 > n2 + n1:\\n return -1\\n else:\\n return +1\\n for i, n in enumerate(nums):\\n nums[i] = str(n)\\n nums = sorted(nums, key=cmp_to_key(compare))\\n return \\\"\\\".join(nums)\\n\\n \",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"def insert (s, l) :\\n l.append (s) \\n i = len (l) - 1\\n while i and s + l[i-1] > l[i-1] + s :\\n l[i] = l[i-1]\\n i -= 1\\n l[i] = s\\n\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n result = []\\n for i in nums :\\n insert (str (i), result)\\n return '0' if result[0] == '0' else ''.join (result)\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"def insert (s, l, i) :\\n while i and s + l[i-1] > l[i-1] + s :\\n l[i] = l[i-1]\\n i -= 1\\n l[i] = s\\n\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n for i in range (len (nums)) :\\n insert (str (nums[i]), nums, i)\\n return str (int (''.join (nums)))\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n str_nums = list(map(str, nums)) \\n str_nums.sort(key=lambda x: x * 10, reverse=True) \\n return str(int(''.join(str_nums)))\\n\\n\\n\\n\\n\\n\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n arr=list(map(str,nums))\\n arr.sort(key=lambda x:x*10,reverse=True)\\n if arr[0]==\\\"0\\\":\\n return \\\"0\\\"\\n large=\\\"\\\".join(arr)\\n return large\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"def compare(X,Y):\\n if X+Y > Y+X:\\n return -1\\n else:\\n return 1\\n\\nclass Solution:\\n\\n def largestNumber(self, nums: List[int]) -> str:\\n nums = list(map(str, nums))\\n nums.sort(key = cmp_to_key(compare))\\n result = ''.join(nums)\\n print(result)\\n if result[0] == '0':\\n return '0'\\n return result\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"from functools import cmp_to_key\\nclass Solution:\\n def largestNumber(self, nums: List[int]) -> str:\\n nums = [str(num) for num in nums]\\n \\n # Sort the numbers based on custom concatenation logic\\n nums.sort(key=lambda x: x*10, reverse=True)\\n \\n # If the largest number is 0, return \\\"0\\\"\\n if nums[0] == \\\"0\\\":\\n return \\\"0\\\"\\n \\n # Join the sorted numbers to form the largest number\\n return \\\"\\\".join(nums)\\n \",\n \"memory\": \"16500\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":8,"string":"8"}}},{"rowIdx":173,"cells":{"question_id":{"kind":"number","value":187,"string":"187"},"name":{"kind":"string","value":"repeated-dna-sequences"},"content":{"kind":"string","value":"<p>The <strong>DNA sequence</strong> is composed of a series of nucleotides abbreviated as <code>'A'</code>, <code>'C'</code>, <code>'G'</code>, and <code>'T'</code>.</p>\n\n<ul>\n\t<li>For example, <code>"ACGAATTCCG"</code> is a <strong>DNA sequence</strong>.</li>\n</ul>\n\n<p>When studying <strong>DNA</strong>, it is useful to identify repeated sequences within the DNA.</p>\n\n<p>Given a string <code>s</code> that represents a <strong>DNA sequence</strong>, return all the <strong><code>10</code>-letter-long</strong> sequences (substrings) that occur more than once in a DNA molecule. 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> s = \"AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT\"\n<strong>Output:</strong> [\"AAAAACCCCC\",\"CCCCCAAAAA\"]\n</pre><p><strong class=\"example\">Example 2:</strong></p>\n<pre><strong>Input:</strong> s = \"AAAAAAAAAAAAA\"\n<strong>Output:</strong> [\"AAAAAAAAAA\"]\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 either <code>'A'</code>, <code>'C'</code>, <code>'G'</code>, or <code>'T'</code>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":49.6380964694825,"string":"49.638096"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["hash-table","string","bit-manipulation","sliding-window","rolling-hash","hash-function"],"string":"[\n \"hash-table\",\n \"string\",\n \"bit-manipulation\",\n \"sliding-window\",\n \"rolling-hash\",\n \"hash-function\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"35\", 0.0552], [\"36\", 0.0552], [\"37\", 0.0552], [\"38\", 0.1656], [\"39\", 0.1656], [\"40\", 0.138], [\"41\", 0.3036], [\"42\", 0.5244], [\"43\", 0.6624], [\"44\", 0.6624], [\"45\", 1.0213], [\"46\", 1.2973], [\"47\", 1.7113], [\"48\", 1.3249], [\"49\", 2.2633], [\"50\", 2.2909], [\"51\", 3.119], [\"52\", 2.8982], [\"53\", 2.8982], [\"54\", 4.0022], [\"55\", 3.7262], [\"56\", 3.6158], [\"57\", 4.4438], [\"58\", 4.8303], [\"59\", 4.0022], [\"60\", 3.671], [\"61\", 3.6986], [\"62\", 4.5542], [\"63\", 3.6434], [\"64\", 3.2846], [\"65\", 2.7877], [\"66\", 2.6497], [\"67\", 2.2357], [\"68\", 2.3737], [\"69\", 2.4289], [\"70\", 2.1253], [\"71\", 1.5181], [\"72\", 1.2145], [\"73\", 1.4077], [\"74\", 1.3249], [\"75\", 1.0765], [\"76\", 1.0489], [\"77\", 0.8004], [\"78\", 0.9108], [\"79\", 0.7452], [\"80\", 0.7176], [\"81\", 0.552], [\"82\", 0.3864], [\"83\", 0.4416], [\"84\", 0.3588], [\"85\", 0.2208], [\"86\", 0.3312], [\"87\", 0.1932], [\"88\", 0.3036], [\"89\", 0.1656], [\"90\", 0.2208], [\"91\", 0.0828], [\"92\", 0.2484], [\"93\", 0.138], [\"94\", 0.1656], [\"95\", 0.138], [\"96\", 0.138], [\"97\", 0.1656], [\"98\", 0.1104], [\"99\", 0.0828], [\"100\", 0.0828]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16800\", 0.0552], [\"16900\", 0.4968], [\"17000\", 0.6624], [\"17100\", 0.0552], [\"17200\", 0.0276], [\"17300\", 0.0828], [\"17400\", 0.0276], [\"20800\", 0.0552], [\"23700\", 0.0276], [\"24000\", 0.0276], [\"26100\", 0.0828], [\"26200\", 1.1317], [\"26300\", 1.1317], [\"26400\", 0.1104], [\"26500\", 0.7452], [\"26600\", 0.3312], [\"26700\", 0.0276], [\"26800\", 0.3588], [\"26900\", 1.1041], [\"27000\", 0.4968], [\"27100\", 0.1656], [\"27200\", 0.0828], [\"27300\", 0.1656], [\"27400\", 0.7452], [\"27500\", 1.1041], [\"27600\", 0.414], [\"27700\", 0.2484], [\"27800\", 4.499], [\"27900\", 25.3105], [\"28000\", 9.8813], [\"28100\", 0.7176], [\"28200\", 0.1656], [\"28300\", 0.2484], [\"28400\", 3.3122], [\"28500\", 9.0809], [\"28600\", 2.1805], [\"28700\", 15.8432], [\"28800\", 12.7519], [\"28900\", 0.3036], [\"29000\", 0.0552], [\"29100\", 0.0552], [\"29200\", 0.0276], [\"29300\", 0.0828], [\"29400\", 0.0276], [\"29500\", 0.0552], [\"29600\", 0.138], [\"29700\", 0.1104], [\"29800\", 0.0828]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n \n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n map = {}\n result = []\n\n for i in range(len(s) - 9):\n substring = s[i:i + 10]\n if substring in map:\n if map[substring] == 1:\n result.append(substring)\n map[substring] += 1\n else:\n map[substring] = 1\n return result","runtime":"35"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seq = set()\n res = set()\n for i in range(10, len(s) + 1):\n substr = s[i - 10 : i]\n if substr in seq:\n res.add(substr)\n else:\n seq.add(substr)\n return list(res)","runtime":"36"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n \n seen = set()\n out = set()\n\n n = len(s)\n k = 10\n for i in range(n - k + 1):\n curr = s[i:i+10]\n if curr in seen:\n out.add(curr)\n \n seen.add(curr)\n \n return list(out)\n\n","runtime":"37"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n sequence_count = {}\n result = set()\n \n for i in range(len(s) - 9):\n sequence = s[i:i+10]\n if sequence in sequence_count:\n result.add(sequence)\n else:\n sequence_count[sequence] = 1\n \n return list(result)","runtime":"38"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) < 10:\n return []\n left = 0\n mapping = set()\n ans = set()\n while(left+9 < len(s)):\n subseq = s[left:left+9+1]\n if subseq not in mapping:\n mapping.add(subseq)\n else:\n ans.add(subseq)\n left += 1\n return list(ans)","runtime":"39"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n dna_map = {}\n result = []\n\n for i in range(len(s) - 9):\n substring = s[i:i+10]\n if substring in dna_map:\n # to filter the dupe\n if dna_map[substring] == 1:\n result.append(substring)\n dna_map[substring] += 1\n else:\n dna_map[substring] = 1\n return result","runtime":"40"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n occ=set()\n l=0\n res=set()\n for l in range(len(s)-9):\n if s[l:l+10] in occ:\n #if s[l:l+10] not in res:\n res.add(s[l:l+10])\n occ.add(s[l:l+10])\n \n return list(res)\n\n\n","runtime":"41"},{"code":"from typing import List\n\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seen = set()\n repeated = set()\n \n # Iterate through the string with a window size of 10\n for i in range(len(s) - 9):\n # Extract the 10-letter sequence\n sequence = s[i:i + 10]\n \n # Check if this sequence has been seen before\n if sequence in seen:\n repeated.add(sequence)\n else:\n seen.add(sequence)\n \n return list(repeated)\n","runtime":"42"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n once, twice = set(), set()\n for i in range (0, len(s)-9, 1):\n DNA = s[i:(i+10)]\n if DNA in once:\n twice.add(DNA)\n else:\n once.add(DNA)\n return list(twice)","runtime":"43"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n dic={}\n res=[]\n for i in range(len(s) - 9):\n substring = s[i:i+10]\n if substring not in dic:\n dic[substring] = 1\n else:\n if dic[substring] == 1:\n res.append(substring)\n dic[substring] += 1\n return res\n\n\n ","runtime":"43"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) < 10:\n return []\n \n seen = set()\n repeated = set()\n \n for i in range(len(s) - 9):\n substring = s[i:i + 10]\n if substring in seen:\n repeated.add(substring)\n else:\n seen.add(substring)\n \n return list(repeated)\n","runtime":"44"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seqs = {}\n ans = []\n for i in range(len(s) - 9):\n seq = s[i:i+10]\n if seq in seqs:\n if seqs[seq] == 1:\n ans.append(seq)\n seqs[seq] += 1\n else:\n seqs[seq] = 1\n return ans","runtime":"44"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s)<=10:\n return []\n\n subs = set()\n seen = set()\n res = set()\n\n for i in range(len(s)-9):\n\n substring = s[i:i+10]\n if substring in seen:\n res.add(substring)\n seen.add(substring)\n\n return list(res)\n","runtime":"45"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n L, n = 10, len(s)\n seen, output = set(), set()\n for start in range(n - L + 1):\n tmp = s[start : start + L]\n if tmp in seen:\n output.add(tmp[:])\n seen.add(tmp)\n return output","runtime":"45"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> list[str]:\n ans = set()\n seen = set()\n\n for i in range(len(s) - 9):\n seq = s[i:i + 10]\n if seq in seen:\n ans.add(seq)\n seen.add(seq)\n\n return list(ans)","runtime":"46"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n n = len(s)\n if n < 10:\n return []\n\n res, seen = set(), set()\n for i in range(n-9):\n sub = s[i:i+10]\n if sub in seen:\n res.add(sub)\n else:\n seen.add(sub)\n return list(res)\n","runtime":"46"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n k = 10\n n = len(s)\n\n seen = set()\n res = set()\n\n for i in range(n - k + 1):\n substring = s[i:i+k]\n\n if substring in seen:\n res.add(substring[:])\n seen.add(substring[:])\n \n return res","runtime":"47"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n k = 10\n n = len(s)\n\n seen = set()\n res = set()\n\n for i in range(n - k + 1):\n substring = s[i:i+k]\n\n if substring in seen:\n res.add(substring[:])\n else:\n seen.add(substring[:])\n \n return res","runtime":"47"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seen_combinations = {}\n results = []\n for combination in iter_combinations(s, 10):\n if combination in seen_combinations:\n if seen_combinations[combination] == 1:\n results.append(combination)\n seen_combinations[combination] += 1\n else:\n seen_combinations[combination] = 1\n return results\n\n \ndef iter_combinations(s: str, size: int):\n curr_idx = 0\n while curr_idx + size - 1 < len(s):\n combination = s[curr_idx : curr_idx + size]\n yield combination\n curr_idx += 1","runtime":"48"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n k = 10\n n = len(s)\n\n seen = set()\n res = set()\n\n for i in range(n - k + 1):\n substring = s[i:i+k]\n\n if substring in seen:\n res.add(substring[:])\n else:\n seen.add(substring[:])\n \n return res","runtime":"49"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seen, res = set(), set()\n for i in range(len(s)-9):\n cur = s[i:i+10]\n if cur in seen:\n res.add(cur)\n seen.add(cur)\n return list(res)\n\n ","runtime":"50"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n vals = set()\n result = set()\n\n for i in range(len(s)-9): \n substr = s[i:i+10]\n if substr in vals:\n result.add(substr)\n else:\n vals.add(substr)\n\n return result\n\n","runtime":"50"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) < 10:\n return []\n\n seen, repeated = set(), set()\n\n # Sliding window to extract all substrings of length 10\n for i in range(len(s) - 9):\n sequence = s[i:i+10]\n if sequence in seen:\n repeated.add(sequence)\n else:\n seen.add(sequence)\n return list(repeated)\n ","runtime":"51"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n occ=set()\n l=0\n res=set()\n for l in range(len(s)-9):\n if s[l:l+10] in occ:\n #if s[l:l+10] not in res:\n res.add(s[l:l+10])\n occ.add(s[l:l+10])\n \n return res\n\n\n","runtime":"52"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> list[str]:\n ans = set()\n seen = set()\n\n for i in range(len(s) - 9):\n seq = s[i:i + 10]\n if seq in seen:\n ans.add(seq)\n seen.add(seq)\n\n return list(ans)","runtime":"52"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) <= 10:\n return []\n m = defaultdict(int)\n for i in range (0, len(s) - 10 + 1):\n m[s[i:i+10]] += 1\n result = []\n for k, v in m.items():\n if v > 1:\n result.append(k)\n return result\n","runtime":"53"},{"code":"from collections import defaultdict\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seen = set()\n ans = set()\n for i in range(len(s) - 9):\n sub_s = s[i:i + 10]\n if sub_s in seen:\n ans.add(sub_s)\n else:\n seen.add(sub_s)\n return ans\n\n","runtime":"53"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n res = set()\n seen = set()\n for i in range(len(s)-9):\n curr = s[i:i+10]\n if curr in seen:\n res.add(curr)\n seen.add(curr)\n return list(res)\n ","runtime":"54"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n # search for 10-letter-long substrings in s that repeat > 1\n\n # brute force idea: \n # extract all possible 10 letter long substrings in s\n # check the number of occurences for each substr\n # only return the substr that occur > once\n\n # either use a dictionary (that maps substrings to their frequency)\n # or a set (store substrings seen before, and items seen > once )\n\n\n # APPROACH 1. substring + hashset: O(n) time and space\n seen, output = set(), set()\n\n # idea is to use a sliding window of length 10 along string s\n # check if the sequence in the sliding window is already in the set\n # if yes: update output\n # if not, save the substr in the siding window in the set\n\n sequence_length = 10\n str_length = len(s)\n for start in range(str_length - sequence_length + 1):\n substr = s[start : start + sequence_length]\n if substr in seen:\n # check if it has been seen before\n output.add(substr)\n seen.add(substr)\n\n return output\n\n","runtime":"54"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n n=len(s)\n d={}\n for i in range(n-9):\n ss=s[i:i+10]\n if ss not in d:\n d[ss]=1\n else:\n d[ss]+=1\n print(d) \n \n return [ss for ss in d.keys() if d[ss]>1]\n ","runtime":"55"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n freq = {}\n\n index = 0\n \n while(index + 10 <= len(s)):\n substring = s[index:index+10]\n if(freq.get(substring,None) == None):\n freq[substring] = 1\n index += 1\n continue\n freq[substring] = freq[substring] + 1\n index +=1\n res = []\n # print(freq)\n for key in freq:\n if(freq[key] > 1):\n res.append(key)\n return res","runtime":"55"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n n=len(s)\n d={}\n for i in range(n-9):\n ss=s[i:i+10]\n if ss not in d:\n d[ss]=1\n else:\n d[ss]+=1 \n \n return [ss for ss in d.keys() if d[ss]>1]\n ","runtime":"56"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n \n store = collections.defaultdict(int)\n res = []\n for i in range(len(s)-10+1):\n \n ss = s[i:i+10]\n if ss in store:\n if ss not in res:\n res.append(ss)\n else:\n store[ss] += 1\n \n return res\n","runtime":"56"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n occ=set()\n l=0\n res=set()\n for l in range(len(s)-9):\n if s[l:l+10] in occ:\n if s[l:l+10] not in res:\n res.add(s[l:l+10])\n occ.add(s[l:l+10])\n \n return res\n\n\n","runtime":"57"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) < 10:\n return []\n \n story = {} \n res = [] \n for i in range(len(s) - 9): \n substring = s[i:i+10]\n if substring in story:\n story[substring] += 1\n else:\n story[substring] = 1\n for substring, count in story.items():\n if count > 1:\n res.append(substring)\n \n return res\n","runtime":"57"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, seq: str) -> List[str]:\n s = set()\n retset = set()\n if len(seq) <= 10:\n return []\n \n window = seq[:10]\n s.add(window)\n base = 0\n for end in range(11, len(seq)+1):\n base += 1\n window = seq[base:end]\n if window in s:\n retset.add(window)\n else:\n s.add(window)\n return list(retset)\n\n ","runtime":"58"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n sequence_count:Dict[str,int] = {}\n\n result_arr:List[str] = []\n\n for i in range(0,len(s)-9,1):\n substring:str = s[i:i+10]\n\n if substring not in sequence_count:\n sequence_count[substring] = 1\n else: \n sequence_count[substring] += 1\n\n if sequence_count[substring] == 2:\n result_arr.append(substring)\n\n return result_arr\n\n","runtime":"58"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n start = 0\n window = 10\n end = window\n subset = set()\n res = set()\n\n while end <= len(s)+1:\n subs = s[start:end]\n if not subs in subset:\n subset.add(subs) \n else:\n res.add(subs)\n\n start += 1\n end = start + window\n\n return list(res)","runtime":"59"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n n = len(s)\n H = defaultdict(int)\n res = []\n \n for i in range(0, n - 10 + 1):\n H[s[i:i+10]] += 1\n \n for key, val in H.items():\n if val > 1:\n res.append(key)\n \n return res\n\n\n ","runtime":"59"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) <= 10:\n return []\n v = {\n \"A\": 0,\n \"C\": 1,\n \"G\": 2,\n \"T\": 3\n }\n out = set()\n index = 1\n seen = set()\n total = 0\n for i in range(10):\n total += v[s[i]]*(4**i)\n seen.add(total)\n while index + 9 < len(s):\n total -= v[s[index-1]]\n total = total // 4\n total += v[s[index+9]]*(4**9)\n if total in seen:\n out.add(s[index:index+10])\n seen.add(total)\n index += 1\n return list(out)","runtime":"60"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seen,res = set(), set()\n\n for l in range(len(s)-9):\n cur = s[l:l +10]\n if cur in seen:\n res.add(cur)\n seen.add(cur)\n return list(res)\n","runtime":"61"},{"code":"import collections\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n \n if len(s) < 10:\n return []\n \n left = 0 \n right = 9\n\n\n sequences_hashmap = collections.defaultdict(int)\n\n while right < len(s):\n sequence = s[left:right+1]\n sequences_hashmap[sequence] += 1\n \n right += 1\n left += 1\n \n res = []\n for sequence, frequency in sequences_hashmap.items():\n if frequency > 1:\n res.append(sequence)\n \n return res","runtime":"61"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n n = len(s)\n res = []\n track = {}\n if n <= 10:\n return res\n else:\n for i in range(n-9):\n sub_s = s[i:i+10]\n sub_s_num = track.get(sub_s, 0)\n if sub_s_num == 1:\n res.append(sub_s)\n\n track[sub_s] = sub_s_num +1\n \n\n \n return res\n\n\n ","runtime":"62"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n n=len(s)\n d={}\n for i in range(n-9):\n ss=s[i:i+10]\n if ss not in d:\n d[ss]=1\n else:\n d[ss]+=1 \n \n return [ss for ss in d.keys() if d[ss]>1]\n ","runtime":"63"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n\n # var 2 dict+list:\n subs_map = {}\n w = 10\n res = []\n \n for i in range(len(s) - w + 1):\n subs = s[i:i+w]\n if subs in subs_map:\n if subs_map[subs] == 1:\n res.append(subs)\n else:\n subs_map[subs] = 0\n\n subs_map[subs] += 1\n \n return res\n\n\n # # var 1 two sets:\n # start = 0\n # window = 10\n # end = window\n # subset = set()\n # res = set()\n\n # while end <= len(s)+1:\n # subs = s[start:end]\n # if not subs in subset:\n # subset.add(subs) \n # else:\n # res.add(subs)\n\n # start += 1\n # end = start + window\n\n # return list(res)","runtime":"63"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n\n # var 2 dict+list:\n subs_map = {}\n w = 10\n res = []\n \n for i in range(len(s) - w + 1):\n subs = s[i:i+w]\n if subs in subs_map:\n if subs_map[subs] == 1:\n res.append(subs)\n else:\n subs_map[subs] = 0\n\n subs_map[subs] += 1\n \n return res\n\n\n # # var 1 two sets:\n # start = 0\n # window = 10\n # end = window\n # subset = set()\n # res = set()\n\n # while end <= len(s)+1:\n # subs = s[start:end]\n # if not subs in subset:\n # subset.add(subs) \n # else:\n # res.add(subs)\n\n # start += 1\n # end = start + window\n\n # return list(res)","runtime":"64"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n n = len(s)\n mp = {}\n\n for i in range(n-9):\n if s[i:i+10] in mp:\n mp[s[i:i+10]] += 1\n else:\n mp[s[i:i+10]] = 1\n\n return [k for k in mp.keys() if mp[k] > 1]","runtime":"65"},{"code":"from collections import deque\n\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n \n return_arr = []\n\n window = deque(maxlen=10)\n\n repeated_set = set()\n seen_set = set()\n\n for i in range(0, len(s)):\n\n window.append(s[i])\n\n if len(window)==10:\n temp_str = ''.join(window)\n\n if temp_str in seen_set:\n repeated_set.add(temp_str)\n else:\n seen_set.add(temp_str)\n return list(repeated_set)","runtime":"65"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n ans = []\n if len(s) < 10:\n return ans\n \n counter = defaultdict(int)\n for i in range(len(s) - 9):\n counter[s[i:i+10]] += 1\n \n for key, value in counter.items():\n if value > 1:\n ans.append(key)\n \n return ans\n\n ","runtime":"66"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) <= 10:\n return []\n v = {\n \"A\": 0,\n \"C\": 1,\n \"G\": 2,\n \"T\": 3\n }\n out = set()\n index = 1\n seen = set()\n total = 0\n for i in range(10):\n total += v[s[i]]*(4**i)\n seen.add(total)\n while index + 9 < len(s):\n total -= v[s[index-1]]\n total = total // 4\n total += v[s[index+9]]*(4**9)\n if total in seen:\n out.add(s[index:index+10])\n seen.add(total)\n index += 1\n return list(out)","runtime":"66"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) < 10:\n return []\n\n myMap = {}\n res = []\n left = 0\n\n for i in range(9, len(s)):\n subset = s[left:i+1]\n\n if subset in myMap:\n myMap[subset] += 1\n else:\n myMap[subset] = 1\n left += 1\n\n for key in myMap:\n if myMap[key] > 1:\n res.append(key)\n return res\n\n","runtime":"67"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seen = {}\n res = []\n for i in range(len(s) - 9):\n seen[s[i:i+10]] = seen.get(s[i:i+10], 0) + 1\n for key in seen:\n if seen[key] > 1:\n res.append(key)\n return res\n\n\n","runtime":"67"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) < 10:\n return []\n \n referenceSeq = {}\n\n for idx in range(0, len(s)-9):\n curSeq = s[idx:idx+10]\n if curSeq not in referenceSeq:\n referenceSeq[curSeq] = 0 \n\n referenceSeq[curSeq] += 1 \n \n res = []\n for seq in referenceSeq:\n if referenceSeq[seq] >= 2:\n res.append(seq)\n \n return res\n","runtime":"68"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n \n start, end = 0, 9\n hash_t = {}\n result = set()\n\n while end < len(s):\n if s[start:end + 1] not in hash_t:\n hash_t[s[start:end + 1]] = 1\n else:\n result.add(s[start:end + 1])\n start += 1\n end += 1\n\n return list(result)","runtime":"68"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seen_combinations = set()\n results = set()\n for combination in iter_combinations(s, 10):\n if combination in seen_combinations:\n results.add(combination)\n else:\n seen_combinations.add(combination)\n return list(results)\n\n \ndef iter_combinations(s: str, size: int):\n curr_idx = 0\n while curr_idx + size - 1 < len(s):\n combination = s[curr_idx : curr_idx + size]\n yield combination\n curr_idx += 1","runtime":"69"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seq_len = 10\n seq_count = defaultdict(int)\n repeated_seqs = set()\n for i in range(len(s) - seq_len + 1):\n seq = s[i:i + seq_len]\n seq_count[seq] += 1\n if seq_count[seq] > 1:\n repeated_seqs.add(seq)\n\n return list(repeated_seqs)","runtime":"69"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n from collections import defaultdict\n seqs = defaultdict(int)\n l, res = 0, []\n for r in range(len(s)):\n if r - l + 1 == 10:\n seqs[s[l:r+1]] += 1\n if seqs[s[l:r+1]] > 1:\n res.append(s[l:r+1])\n l += 1\n return list(set(res))\n ","runtime":"70"},{"code":"from collections import defaultdict\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n counts = defaultdict(int)\n for i in range(len(s) - 9):\n counts[s[i:i + 10]] += 1\n \n return [k for k in counts if counts[k] > 1]\n\n","runtime":"70"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n dct={}\n for i in range(len(s)-9):\n if s[i:i+10] in dct:\n dct[s[i:i+10]]+=1\n else:\n dct[s[i:i+10]]=1\n print(dct)\n return [i for i,j in dct.items() if j>1]","runtime":"71"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n hashmap_store_sequeneces:Dict[str,int] = {}\n result_arr:List[int] = []\n \n k:int = 10\n\n i:int = 0\n j:int = 0\n\n temp_arr:List[str] = []\n while j<len(s):\n temp_arr.append(s[j])\n\n if j-i+1==k:\n temp_str_form:str = ''.join(temp_arr)\n\n if temp_str_form not in hashmap_store_sequeneces:\n hashmap_store_sequeneces[temp_str_form]=1\n else:\n hashmap_store_sequeneces[temp_str_form]+=1\n\n if hashmap_store_sequeneces[temp_str_form]==2:\n result_arr.append(temp_str_form)\n \n temp_arr.pop(0)\n i+=1\n\n j+=1\n \n return result_arr\n\n\n ","runtime":"72"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n l = 10\n if len(s) <= l:\n return []\n dic = {\"A\":0, \"C\":1, \"G\":2, \"T\":3}\n cur = 0\n for i in range (0, l):\n cur = 4 * cur + dic[s[i]]\n result = set()\n seen = {cur}\n for i in range (1, len(s) + 1 - l):\n cur -= dic[s[i-1]] * (4**(l-1))\n cur *= 4\n cur += dic[s[i+l-1]]\n # print(cur)\n if cur in seen:\n result.add(s[i:i+l])\n seen.add(cur)\n\n\n return list(result)\n","runtime":"73"},{"code":"from collections import deque\n\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n \n window = deque(maxlen=10)\n\n seen_set = set()\n\n repeated_set = set()\n\n for i in range(0, len(s)):\n \n window.append(s[i])\n\n if len(window)==10:\n\n temp_str = ''.join(window)\n\n if temp_str not in seen_set:\n seen_set.add(temp_str)\n else:\n repeated_set.add(temp_str)\n\n return list(repeated_set)","runtime":"74"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n i = 10\n dic = defaultdict(int)\n spliced_s = s[:10]\n dic[spliced_s] += 1 \n\n while i < len(s): \n spliced_s = spliced_s[1:] + s[i]\n dic[spliced_s] += 1 \n i += 1\n \n res = []\n\n for item, val in dic.items(): \n if val > 1: \n res.append(item)\n\n return res ","runtime":"75"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n cur, dnaHash = s[:10], defaultdict(int)\n dnaHash[cur] +=1 \n\n for i in range(10, len(s)):\n cur = cur[1:] + s[i]\n dnaHash[cur] += 1\n \n return [i for i in dnaHash.keys() if dnaHash[i] > 1]\n ","runtime":"75"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n from collections import defaultdict\n seqs = defaultdict(int)\n l, res = 0, set()\n for r in range(len(s)):\n if r - l + 1 == 10:\n seqs[s[l:r+1]] += 1\n if seqs[s[l:r+1]] > 1:\n res.add(s[l:r+1])\n l += 1 \n return res\n ","runtime":"76"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n substrings = Counter()\n if len(s) < 10: return []\n for i in range(len(s)-9):\n substrings[s[i:i+10]] += 1\n return (c for c,count in substrings.items() if count > 1)\n","runtime":"77"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n #iterate through array\n # at every idx splice the array from [curr:curr+10] (?)\n # check if we have seen it before\n # if not add it to seen, if yes add it to res\n\n res = set()\n seen = set()\n print(len(s))\n for i in range(len(s)-9):\n print(i)\n sequence = s[i:i+10]\n if sequence in seen:\n res.add(sequence)\n else:\n seen.add(sequence)\n \n return list(res)","runtime":"78"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n\n res = []\n if len(s) < 10:\n return res\n\n seqCountMap = collections.Counter()\n l, r = 0, 9\n while r < len(s):\n seqCountMap[s[l:r + 1]] += 1\n l += 1\n r += 1\n \n for seq in seqCountMap:\n if seqCountMap[seq] > 1:\n res.append(seq)\n return res\n ","runtime":"78"},{"code":"from collections import defaultdict\n\nclass Solution:\n # using rolling hash approach of Rabin Karp Algo\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n mappings = {\n 'A': 1, 'C': 2, 'G': 3, 'T': 4\n }\n\n n = len(s)\n m = 9\n if n <= m:\n return []\n \n tHash = 0\n seen = defaultdict(int)\n for i in range(0, m+1):\n tHash = tHash * 4 + mappings[s[i]]\n seen[tHash] = 1\n\n result = []\n for i in range(1, n - m):\n # - remove the leftmost character from the hash value\n # - shift remaining hash value left by 1 (multiply by 4 as we using base 4)\n # - add the new rightmost character\n # \n # using 4^9 because we have 10 characters, and the leftmost is at\n # the 10th position (count from 0)\n tHash = (tHash - (4 ** m) * mappings[s[i-1]]) * 4 + mappings[s[i + m]]\n # print(tHash, s[i:i + m + 1])\n\n seen[tHash] += 1\n if seen[tHash] == 2:\n # print(tHash, s[i:i + m + 1])\n result.append(s[i:i + m + 1])\n\n return result\n","runtime":"79"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n cur, dnaHash = s[:10], defaultdict(int)\n dnaHash[cur] +=1 \n\n for i in range(10, len(s)):\n cur = cur[1:] + s[i]\n dnaHash[cur] += 1\n \n return [i for i in dnaHash.keys() if dnaHash[i] > 1]\n ","runtime":"80"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n from collections import defaultdict \n\n l = 0\n r = 9\n\n h = defaultdict(int)\n\n while r < len(s):\n h[s[l:r + 1]] +=1 \n r += 1\n l += 1\n \n output = []\n for key in h:\n if h[key] > 1:\n output.append(key)\n return output \n\n\n ","runtime":"80"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n q = deque()\n unique = {}\n for char in s:\n if len(q) == 10:\n q.popleft()\n q.append(char)\n \n if len(q) == 10:\n pattern = \"\".join(q)\n unique[pattern] = unique.get(pattern, 0) + 1\n \n return [pattern for pattern, value in unique.items() if value > 1]","runtime":"81"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n\n res = []\n\n dna = list(s)\n counter = defaultdict(int)\n left = 0\n for right in range(len(dna)):\n if right-left+1<10:\n continue\n if right-left+1==10:\n mol = s[left:right+1]\n counter[mol]+=1\n if counter[mol]==2:\n res.append(mol)\n left+=1\n\n return res\n\n","runtime":"82"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n n = len(s)\n if n < 10:\n return []\n\n q = deque()\n for i in range(10):\n q.append(s[i])\n d = defaultdict(int)\n d[\"\".join(q)] += 1\n\n for i in range(10, n):\n q.popleft()\n q.append(s[i])\n d[\"\".join(q)] += 1\n \n res = []\n for k, v in d.items():\n if v > 1:\n res.append(k)\n\n return res\n\n\n","runtime":"83"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) < 10:\n return []\n\n mp = {}\n\n l = 0\n r = 9\n currList = collections.deque()\n for i in range(10):\n currList.append(s[i])\n\n mp[tuple(currList)] = 0\n r = 10\n ans = []\n\n while r < len(s):\n currList.append(s[r])\n currList.popleft()\n dna = tuple(currList)\n if dna in mp and mp[dna] != 1:\n ans.append(\"\".join(currList))\n mp[dna] = 1\n elif dna not in mp:\n mp[dna] = 0\n r+=1\n return ans\n\n\n\n\n\n\n\n\n ","runtime":"84"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n st = set()\n i, j = 0, 0\n cur = deque([])\n res = set()\n while j < len(s):\n cur.append(s[j])\n if j - i + 1 < 10:\n j += 1\n else:\n string = \"\".join(cur)\n if string in st:\n res.add(string)\n else:\n st.add(string)\n cur.popleft()\n i += 1\n j += 1\n \n return list(res)","runtime":"85"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n \n seen = set()\n dupes = set()\n for i in range(len(s) - 9):\n sub = s[i:i+10]\n\n print(sub)\n\n if sub in seen:\n dupes.add(sub)\n\n seen.add(sub)\n\n return dupes","runtime":"86"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n n = len(s)\n if n < 10:\n return []\n\n q = deque()\n for i in range(10):\n q.append(s[i])\n d = defaultdict(int)\n d[\"\".join(q)] += 1\n\n for i in range(10, n):\n q.popleft()\n q.append(s[i])\n d[\"\".join(q)] += 1\n \n res = []\n for k, v in d.items():\n if v > 1:\n res.append(k)\n\n return res\n\n\n","runtime":"87"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n dna_seq = {}\n res = []\n\n for i in range(len(s) - 9):\n sub_str = s[i]+s[i+1]+s[i+2]+s[i+3]+s[i+4]+s[i+5]+s[i+6]+s[i+7]+s[i+8]+s[i+9]\n\n if sub_str not in dna_seq:\n dna_seq[sub_str] = 1\n else:\n if dna_seq[sub_str] == 1:\n res.append(sub_str)\n dna_seq[sub_str] += 1\n\n return res","runtime":"88"},{"code":"class Solution:\n def get_value(self, ch):\n if ch==\"A\": return 0\n if ch==\"C\": return 1\n if ch==\"G\": return 2\n return 3\n\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n counter = {}\n output = []\n\n # use rolling hash on subsequence\n hash = 0\n pow = 4**9\n for i in range(len(s)):\n hash = hash*4 + self.get_value(s[i])\n if i>=9:\n if hash not in counter:\n counter[hash] = 0\n counter[hash] += 1\n if counter[hash]==2:\n output.append(s[i-9:i+1])\n # unhash the tail\n hash -= pow*self.get_value(s[i-9])\n\n return output \n","runtime":"89"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n n = len(s)\n if n < 10:\n return []\n\n q = deque()\n for i in range(10):\n q.append(s[i])\n d = defaultdict(int)\n d[\"\".join(q)] += 1\n\n for i in range(10, n):\n q.popleft()\n q.append(s[i])\n d[\"\".join(q)] += 1\n \n res = []\n for k, v in d.items():\n if v > 1:\n res.append(k)\n\n return res\n\n\n","runtime":"90"},{"code":"from collections import Counter\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) <= 10:\n return []\n counts = Counter()\n mp = {'A': 1, 'C': 2, 'T': 3, 'G': 4}\n rmp = ['', 'A', 'C', 'T', 'G']\n num = 0\n for i in range(10):\n num *= 10\n num += mp[s[i]]\n counts[num] += 1\n for i in range(10, len(s)):\n num = (num % int(1E9)) * 10 + mp[s[i]]\n counts[num] += 1\n return [\"\".join([rmp[int(i)] for i in str(k)]) for k in counts if counts[k] > 1]","runtime":"91"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n map = {}\n res = []\n \n i = 0\n while i + 10 <= len(s):\n seq = s[i:i + 10]\n print(seq)\n map[seq] = map.get(seq, 0) + 1\n if map[seq] == 2:\n res.append(seq)\n i+=1\n\n return res","runtime":"92"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n # return a list of all the 10-letter-long sequences that occur more than once\n n = len(s)\n count = defaultdict(int)\n ans = []\n\n for i in range(n-9):\n dna = s[i : i+10]\n print(dna)\n count[dna] += 1\n if count[dna] == 2:\n ans.append(dna)\n\n return ans\n\n ","runtime":"95"},{"code":"class Solution:\r\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\r\n curr = deque()\r\n bank = set()\r\n L = 0\r\n ans = []\r\n\r\n for R in range(len(s)):\r\n curr.append(s[R])\r\n if len(curr) < 10:\r\n continue\r\n\r\n if len(curr) > 10:\r\n curr.popleft()\r\n L += 1\r\n\r\n if tuple(curr) in bank:\r\n ans.append(''.join(list(curr)))\r\n else:\r\n bank.add(tuple(curr))\r\n\r\n return set(ans)\r\n","runtime":"96"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) <= 10:\n return []\n\n outputs = set()\n str_len = 10\n base = 4\n base_raised = base**(str_len-1)\n char_to_int = {\"A\": 0, \"C\": 1, \"G\": 2, \"T\": 3}\n P = 29\n\n def rolling_hash(prev_hash, remove_digit, add_digit, digits = str_len, base = base, p = P):\n subtract_highest = prev_hash - (char_to_int[remove_digit] * base_raised)\n raw = subtract_highest * base + char_to_int[add_digit]\n return raw % p\n\n prev_hash = sum(char_to_int[s[i]] * base**(str_len-1-i) for i in range(str_len))\n prev_hash = prev_hash % P\n hashes_seen = [set()] * P\n hashes_seen[prev_hash].add(s[:str_len])\n\n # print(f\"string: {s[:str_len]}, hash: {prev_hash}\")\n for i in range(str_len,len(s)):\n this_substring = s[i-str_len+1:i+1]\n next_hash = rolling_hash(prev_hash, s[i-str_len], s[i])\n # print(f\"string: {this_substring}, hash: {next_hash}\")\n if len(hashes_seen[next_hash]) > 0:\n if this_substring in hashes_seen[next_hash]:\n outputs.add(this_substring)\n hashes_seen[next_hash].add(this_substring)\n prev_hash = next_hash\n\n return list(outputs)\n\n\n\n \n\n\n\n\n\n ","runtime":"97"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) <= 10:\n return []\n\n outputs = set()\n str_len = 10\n base = 4\n char_to_int = {\"A\": 0, \"C\": 1, \"G\": 2, \"T\": 3}\n P = base ** str_len\n\n def rolling_hash(prev_hash, next_digit, digits = str_len, base = base, p = P):\n # subtract_highest = prev_hash - \n raw = (prev_hash * base + char_to_int[next_digit])\n return raw % p\n\n prev_hash = sum(char_to_int[s[i]] * base**(str_len-1-i) for i in range(str_len))\n prev_hash = prev_hash % base**str_len \n prev_hash = prev_hash % P\n hashes_seen = { prev_hash: {s[:str_len]} }\n\n # print(f\"string: {s[:str_len]}, hash: {prev_hash}\")\n for i in range(str_len,len(s)):\n this_substring = s[i-str_len+1:i+1]\n next_hash = rolling_hash(prev_hash, s[i])\n # print(f\"string: {this_substring}, hash: {next_hash}\")\n if next_hash in hashes_seen:\n if this_substring in hashes_seen[next_hash]:\n outputs.add(this_substring)\n hashes_seen.setdefault(next_hash, set()).add(this_substring)\n prev_hash = next_hash\n\n return list(outputs)\n\n\n\n \n\n\n\n\n\n ","runtime":"98"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n dna_seq = set()\n seen = set()\n\n for i in range(len(s) - 9):\n sub_str = s[i]+s[i+1]+s[i+2]+s[i+3]+s[i+4]+s[i+5]+s[i+6]+s[i+7]+s[i+8]+s[i+9]\n\n if sub_str not in dna_seq:\n dna_seq.add(sub_str)\n else:\n seen.add(sub_str)\n\n return list(seen)","runtime":"99"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n n = len(s)\n k = 10\n if n < k:\n return []\n # chars = list(s)\n counter = collections.Counter()\n\n win = collections.deque()\n for i in range(k):\n win.append(s[i])\n counter[tuple(win)] += 1\n \n for i in range(k, n):\n win.popleft()\n win.append(s[i])\n\n counter[tuple(win)] += 1\n\n return [''.join(chars) for chars, c in counter.items() if c > 1]\n","runtime":"100"}],"string":"[\n {\n \"code\": \"class Solution:\\n \\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n map = {}\\n result = []\\n\\n for i in range(len(s) - 9):\\n substring = s[i:i + 10]\\n if substring in map:\\n if map[substring] == 1:\\n result.append(substring)\\n map[substring] += 1\\n else:\\n map[substring] = 1\\n return result\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seq = set()\\n res = set()\\n for i in range(10, len(s) + 1):\\n substr = s[i - 10 : i]\\n if substr in seq:\\n res.add(substr)\\n else:\\n seq.add(substr)\\n return list(res)\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n \\n seen = set()\\n out = set()\\n\\n n = len(s)\\n k = 10\\n for i in range(n - k + 1):\\n curr = s[i:i+10]\\n if curr in seen:\\n out.add(curr)\\n \\n seen.add(curr)\\n \\n return list(out)\\n\\n\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n sequence_count = {}\\n result = set()\\n \\n for i in range(len(s) - 9):\\n sequence = s[i:i+10]\\n if sequence in sequence_count:\\n result.add(sequence)\\n else:\\n sequence_count[sequence] = 1\\n \\n return list(result)\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) < 10:\\n return []\\n left = 0\\n mapping = set()\\n ans = set()\\n while(left+9 < len(s)):\\n subseq = s[left:left+9+1]\\n if subseq not in mapping:\\n mapping.add(subseq)\\n else:\\n ans.add(subseq)\\n left += 1\\n return list(ans)\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n dna_map = {}\\n result = []\\n\\n for i in range(len(s) - 9):\\n substring = s[i:i+10]\\n if substring in dna_map:\\n # to filter the dupe\\n if dna_map[substring] == 1:\\n result.append(substring)\\n dna_map[substring] += 1\\n else:\\n dna_map[substring] = 1\\n return result\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n occ=set()\\n l=0\\n res=set()\\n for l in range(len(s)-9):\\n if s[l:l+10] in occ:\\n #if s[l:l+10] not in res:\\n res.add(s[l:l+10])\\n occ.add(s[l:l+10])\\n \\n return list(res)\\n\\n\\n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seen = set()\\n repeated = set()\\n \\n # Iterate through the string with a window size of 10\\n for i in range(len(s) - 9):\\n # Extract the 10-letter sequence\\n sequence = s[i:i + 10]\\n \\n # Check if this sequence has been seen before\\n if sequence in seen:\\n repeated.add(sequence)\\n else:\\n seen.add(sequence)\\n \\n return list(repeated)\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n once, twice = set(), set()\\n for i in range (0, len(s)-9, 1):\\n DNA = s[i:(i+10)]\\n if DNA in once:\\n twice.add(DNA)\\n else:\\n once.add(DNA)\\n return list(twice)\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n dic={}\\n res=[]\\n for i in range(len(s) - 9):\\n substring = s[i:i+10]\\n if substring not in dic:\\n dic[substring] = 1\\n else:\\n if dic[substring] == 1:\\n res.append(substring)\\n dic[substring] += 1\\n return res\\n\\n\\n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) < 10:\\n return []\\n \\n seen = set()\\n repeated = set()\\n \\n for i in range(len(s) - 9):\\n substring = s[i:i + 10]\\n if substring in seen:\\n repeated.add(substring)\\n else:\\n seen.add(substring)\\n \\n return list(repeated)\\n\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seqs = {}\\n ans = []\\n for i in range(len(s) - 9):\\n seq = s[i:i+10]\\n if seq in seqs:\\n if seqs[seq] == 1:\\n ans.append(seq)\\n seqs[seq] += 1\\n else:\\n seqs[seq] = 1\\n return ans\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s)<=10:\\n return []\\n\\n subs = set()\\n seen = set()\\n res = set()\\n\\n for i in range(len(s)-9):\\n\\n substring = s[i:i+10]\\n if substring in seen:\\n res.add(substring)\\n seen.add(substring)\\n\\n return list(res)\\n\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n L, n = 10, len(s)\\n seen, output = set(), set()\\n for start in range(n - L + 1):\\n tmp = s[start : start + L]\\n if tmp in seen:\\n output.add(tmp[:])\\n seen.add(tmp)\\n return output\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> list[str]:\\n ans = set()\\n seen = set()\\n\\n for i in range(len(s) - 9):\\n seq = s[i:i + 10]\\n if seq in seen:\\n ans.add(seq)\\n seen.add(seq)\\n\\n return list(ans)\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n n = len(s)\\n if n < 10:\\n return []\\n\\n res, seen = set(), set()\\n for i in range(n-9):\\n sub = s[i:i+10]\\n if sub in seen:\\n res.add(sub)\\n else:\\n seen.add(sub)\\n return list(res)\\n\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n k = 10\\n n = len(s)\\n\\n seen = set()\\n res = set()\\n\\n for i in range(n - k + 1):\\n substring = s[i:i+k]\\n\\n if substring in seen:\\n res.add(substring[:])\\n seen.add(substring[:])\\n \\n return res\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n k = 10\\n n = len(s)\\n\\n seen = set()\\n res = set()\\n\\n for i in range(n - k + 1):\\n substring = s[i:i+k]\\n\\n if substring in seen:\\n res.add(substring[:])\\n else:\\n seen.add(substring[:])\\n \\n return res\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seen_combinations = {}\\n results = []\\n for combination in iter_combinations(s, 10):\\n if combination in seen_combinations:\\n if seen_combinations[combination] == 1:\\n results.append(combination)\\n seen_combinations[combination] += 1\\n else:\\n seen_combinations[combination] = 1\\n return results\\n\\n \\ndef iter_combinations(s: str, size: int):\\n curr_idx = 0\\n while curr_idx + size - 1 < len(s):\\n combination = s[curr_idx : curr_idx + size]\\n yield combination\\n curr_idx += 1\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n k = 10\\n n = len(s)\\n\\n seen = set()\\n res = set()\\n\\n for i in range(n - k + 1):\\n substring = s[i:i+k]\\n\\n if substring in seen:\\n res.add(substring[:])\\n else:\\n seen.add(substring[:])\\n \\n return res\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seen, res = set(), set()\\n for i in range(len(s)-9):\\n cur = s[i:i+10]\\n if cur in seen:\\n res.add(cur)\\n seen.add(cur)\\n return list(res)\\n\\n \",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n vals = set()\\n result = set()\\n\\n for i in range(len(s)-9): \\n substr = s[i:i+10]\\n if substr in vals:\\n result.add(substr)\\n else:\\n vals.add(substr)\\n\\n return result\\n\\n\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) < 10:\\n return []\\n\\n seen, repeated = set(), set()\\n\\n # Sliding window to extract all substrings of length 10\\n for i in range(len(s) - 9):\\n sequence = s[i:i+10]\\n if sequence in seen:\\n repeated.add(sequence)\\n else:\\n seen.add(sequence)\\n return list(repeated)\\n \",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n occ=set()\\n l=0\\n res=set()\\n for l in range(len(s)-9):\\n if s[l:l+10] in occ:\\n #if s[l:l+10] not in res:\\n res.add(s[l:l+10])\\n occ.add(s[l:l+10])\\n \\n return res\\n\\n\\n\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> list[str]:\\n ans = set()\\n seen = set()\\n\\n for i in range(len(s) - 9):\\n seq = s[i:i + 10]\\n if seq in seen:\\n ans.add(seq)\\n seen.add(seq)\\n\\n return list(ans)\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) <= 10:\\n return []\\n m = defaultdict(int)\\n for i in range (0, len(s) - 10 + 1):\\n m[s[i:i+10]] += 1\\n result = []\\n for k, v in m.items():\\n if v > 1:\\n result.append(k)\\n return result\\n\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seen = set()\\n ans = set()\\n for i in range(len(s) - 9):\\n sub_s = s[i:i + 10]\\n if sub_s in seen:\\n ans.add(sub_s)\\n else:\\n seen.add(sub_s)\\n return ans\\n\\n\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n res = set()\\n seen = set()\\n for i in range(len(s)-9):\\n curr = s[i:i+10]\\n if curr in seen:\\n res.add(curr)\\n seen.add(curr)\\n return list(res)\\n \",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n # search for 10-letter-long substrings in s that repeat > 1\\n\\n # brute force idea: \\n # extract all possible 10 letter long substrings in s\\n # check the number of occurences for each substr\\n # only return the substr that occur > once\\n\\n # either use a dictionary (that maps substrings to their frequency)\\n # or a set (store substrings seen before, and items seen > once )\\n\\n\\n # APPROACH 1. substring + hashset: O(n) time and space\\n seen, output = set(), set()\\n\\n # idea is to use a sliding window of length 10 along string s\\n # check if the sequence in the sliding window is already in the set\\n # if yes: update output\\n # if not, save the substr in the siding window in the set\\n\\n sequence_length = 10\\n str_length = len(s)\\n for start in range(str_length - sequence_length + 1):\\n substr = s[start : start + sequence_length]\\n if substr in seen:\\n # check if it has been seen before\\n output.add(substr)\\n seen.add(substr)\\n\\n return output\\n\\n\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n n=len(s)\\n d={}\\n for i in range(n-9):\\n ss=s[i:i+10]\\n if ss not in d:\\n d[ss]=1\\n else:\\n d[ss]+=1\\n print(d) \\n \\n return [ss for ss in d.keys() if d[ss]>1]\\n \",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n freq = {}\\n\\n index = 0\\n \\n while(index + 10 <= len(s)):\\n substring = s[index:index+10]\\n if(freq.get(substring,None) == None):\\n freq[substring] = 1\\n index += 1\\n continue\\n freq[substring] = freq[substring] + 1\\n index +=1\\n res = []\\n # print(freq)\\n for key in freq:\\n if(freq[key] > 1):\\n res.append(key)\\n return res\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n n=len(s)\\n d={}\\n for i in range(n-9):\\n ss=s[i:i+10]\\n if ss not in d:\\n d[ss]=1\\n else:\\n d[ss]+=1 \\n \\n return [ss for ss in d.keys() if d[ss]>1]\\n \",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n \\n store = collections.defaultdict(int)\\n res = []\\n for i in range(len(s)-10+1):\\n \\n ss = s[i:i+10]\\n if ss in store:\\n if ss not in res:\\n res.append(ss)\\n else:\\n store[ss] += 1\\n \\n return res\\n\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n occ=set()\\n l=0\\n res=set()\\n for l in range(len(s)-9):\\n if s[l:l+10] in occ:\\n if s[l:l+10] not in res:\\n res.add(s[l:l+10])\\n occ.add(s[l:l+10])\\n \\n return res\\n\\n\\n\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) < 10:\\n return []\\n \\n story = {} \\n res = [] \\n for i in range(len(s) - 9): \\n substring = s[i:i+10]\\n if substring in story:\\n story[substring] += 1\\n else:\\n story[substring] = 1\\n for substring, count in story.items():\\n if count > 1:\\n res.append(substring)\\n \\n return res\\n\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, seq: str) -> List[str]:\\n s = set()\\n retset = set()\\n if len(seq) <= 10:\\n return []\\n \\n window = seq[:10]\\n s.add(window)\\n base = 0\\n for end in range(11, len(seq)+1):\\n base += 1\\n window = seq[base:end]\\n if window in s:\\n retset.add(window)\\n else:\\n s.add(window)\\n return list(retset)\\n\\n \",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n sequence_count:Dict[str,int] = {}\\n\\n result_arr:List[str] = []\\n\\n for i in range(0,len(s)-9,1):\\n substring:str = s[i:i+10]\\n\\n if substring not in sequence_count:\\n sequence_count[substring] = 1\\n else: \\n sequence_count[substring] += 1\\n\\n if sequence_count[substring] == 2:\\n result_arr.append(substring)\\n\\n return result_arr\\n\\n\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n start = 0\\n window = 10\\n end = window\\n subset = set()\\n res = set()\\n\\n while end <= len(s)+1:\\n subs = s[start:end]\\n if not subs in subset:\\n subset.add(subs) \\n else:\\n res.add(subs)\\n\\n start += 1\\n end = start + window\\n\\n return list(res)\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n n = len(s)\\n H = defaultdict(int)\\n res = []\\n \\n for i in range(0, n - 10 + 1):\\n H[s[i:i+10]] += 1\\n \\n for key, val in H.items():\\n if val > 1:\\n res.append(key)\\n \\n return res\\n\\n\\n \",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) <= 10:\\n return []\\n v = {\\n \\\"A\\\": 0,\\n \\\"C\\\": 1,\\n \\\"G\\\": 2,\\n \\\"T\\\": 3\\n }\\n out = set()\\n index = 1\\n seen = set()\\n total = 0\\n for i in range(10):\\n total += v[s[i]]*(4**i)\\n seen.add(total)\\n while index + 9 < len(s):\\n total -= v[s[index-1]]\\n total = total // 4\\n total += v[s[index+9]]*(4**9)\\n if total in seen:\\n out.add(s[index:index+10])\\n seen.add(total)\\n index += 1\\n return list(out)\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seen,res = set(), set()\\n\\n for l in range(len(s)-9):\\n cur = s[l:l +10]\\n if cur in seen:\\n res.add(cur)\\n seen.add(cur)\\n return list(res)\\n\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"import collections\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n \\n if len(s) < 10:\\n return []\\n \\n left = 0 \\n right = 9\\n\\n\\n sequences_hashmap = collections.defaultdict(int)\\n\\n while right < len(s):\\n sequence = s[left:right+1]\\n sequences_hashmap[sequence] += 1\\n \\n right += 1\\n left += 1\\n \\n res = []\\n for sequence, frequency in sequences_hashmap.items():\\n if frequency > 1:\\n res.append(sequence)\\n \\n return res\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n n = len(s)\\n res = []\\n track = {}\\n if n <= 10:\\n return res\\n else:\\n for i in range(n-9):\\n sub_s = s[i:i+10]\\n sub_s_num = track.get(sub_s, 0)\\n if sub_s_num == 1:\\n res.append(sub_s)\\n\\n track[sub_s] = sub_s_num +1\\n \\n\\n \\n return res\\n\\n\\n \",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n n=len(s)\\n d={}\\n for i in range(n-9):\\n ss=s[i:i+10]\\n if ss not in d:\\n d[ss]=1\\n else:\\n d[ss]+=1 \\n \\n return [ss for ss in d.keys() if d[ss]>1]\\n \",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n\\n # var 2 dict+list:\\n subs_map = {}\\n w = 10\\n res = []\\n \\n for i in range(len(s) - w + 1):\\n subs = s[i:i+w]\\n if subs in subs_map:\\n if subs_map[subs] == 1:\\n res.append(subs)\\n else:\\n subs_map[subs] = 0\\n\\n subs_map[subs] += 1\\n \\n return res\\n\\n\\n # # var 1 two sets:\\n # start = 0\\n # window = 10\\n # end = window\\n # subset = set()\\n # res = set()\\n\\n # while end <= len(s)+1:\\n # subs = s[start:end]\\n # if not subs in subset:\\n # subset.add(subs) \\n # else:\\n # res.add(subs)\\n\\n # start += 1\\n # end = start + window\\n\\n # return list(res)\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n\\n # var 2 dict+list:\\n subs_map = {}\\n w = 10\\n res = []\\n \\n for i in range(len(s) - w + 1):\\n subs = s[i:i+w]\\n if subs in subs_map:\\n if subs_map[subs] == 1:\\n res.append(subs)\\n else:\\n subs_map[subs] = 0\\n\\n subs_map[subs] += 1\\n \\n return res\\n\\n\\n # # var 1 two sets:\\n # start = 0\\n # window = 10\\n # end = window\\n # subset = set()\\n # res = set()\\n\\n # while end <= len(s)+1:\\n # subs = s[start:end]\\n # if not subs in subset:\\n # subset.add(subs) \\n # else:\\n # res.add(subs)\\n\\n # start += 1\\n # end = start + window\\n\\n # return list(res)\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n n = len(s)\\n mp = {}\\n\\n for i in range(n-9):\\n if s[i:i+10] in mp:\\n mp[s[i:i+10]] += 1\\n else:\\n mp[s[i:i+10]] = 1\\n\\n return [k for k in mp.keys() if mp[k] > 1]\",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n \\n return_arr = []\\n\\n window = deque(maxlen=10)\\n\\n repeated_set = set()\\n seen_set = set()\\n\\n for i in range(0, len(s)):\\n\\n window.append(s[i])\\n\\n if len(window)==10:\\n temp_str = ''.join(window)\\n\\n if temp_str in seen_set:\\n repeated_set.add(temp_str)\\n else:\\n seen_set.add(temp_str)\\n return list(repeated_set)\",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n ans = []\\n if len(s) < 10:\\n return ans\\n \\n counter = defaultdict(int)\\n for i in range(len(s) - 9):\\n counter[s[i:i+10]] += 1\\n \\n for key, value in counter.items():\\n if value > 1:\\n ans.append(key)\\n \\n return ans\\n\\n \",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) <= 10:\\n return []\\n v = {\\n \\\"A\\\": 0,\\n \\\"C\\\": 1,\\n \\\"G\\\": 2,\\n \\\"T\\\": 3\\n }\\n out = set()\\n index = 1\\n seen = set()\\n total = 0\\n for i in range(10):\\n total += v[s[i]]*(4**i)\\n seen.add(total)\\n while index + 9 < len(s):\\n total -= v[s[index-1]]\\n total = total // 4\\n total += v[s[index+9]]*(4**9)\\n if total in seen:\\n out.add(s[index:index+10])\\n seen.add(total)\\n index += 1\\n return list(out)\",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) < 10:\\n return []\\n\\n myMap = {}\\n res = []\\n left = 0\\n\\n for i in range(9, len(s)):\\n subset = s[left:i+1]\\n\\n if subset in myMap:\\n myMap[subset] += 1\\n else:\\n myMap[subset] = 1\\n left += 1\\n\\n for key in myMap:\\n if myMap[key] > 1:\\n res.append(key)\\n return res\\n\\n\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seen = {}\\n res = []\\n for i in range(len(s) - 9):\\n seen[s[i:i+10]] = seen.get(s[i:i+10], 0) + 1\\n for key in seen:\\n if seen[key] > 1:\\n res.append(key)\\n return res\\n\\n\\n\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) < 10:\\n return []\\n \\n referenceSeq = {}\\n\\n for idx in range(0, len(s)-9):\\n curSeq = s[idx:idx+10]\\n if curSeq not in referenceSeq:\\n referenceSeq[curSeq] = 0 \\n\\n referenceSeq[curSeq] += 1 \\n \\n res = []\\n for seq in referenceSeq:\\n if referenceSeq[seq] >= 2:\\n res.append(seq)\\n \\n return res\\n\",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n \\n start, end = 0, 9\\n hash_t = {}\\n result = set()\\n\\n while end < len(s):\\n if s[start:end + 1] not in hash_t:\\n hash_t[s[start:end + 1]] = 1\\n else:\\n result.add(s[start:end + 1])\\n start += 1\\n end += 1\\n\\n return list(result)\",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seen_combinations = set()\\n results = set()\\n for combination in iter_combinations(s, 10):\\n if combination in seen_combinations:\\n results.add(combination)\\n else:\\n seen_combinations.add(combination)\\n return list(results)\\n\\n \\ndef iter_combinations(s: str, size: int):\\n curr_idx = 0\\n while curr_idx + size - 1 < len(s):\\n combination = s[curr_idx : curr_idx + size]\\n yield combination\\n curr_idx += 1\",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seq_len = 10\\n seq_count = defaultdict(int)\\n repeated_seqs = set()\\n for i in range(len(s) - seq_len + 1):\\n seq = s[i:i + seq_len]\\n seq_count[seq] += 1\\n if seq_count[seq] > 1:\\n repeated_seqs.add(seq)\\n\\n return list(repeated_seqs)\",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n from collections import defaultdict\\n seqs = defaultdict(int)\\n l, res = 0, []\\n for r in range(len(s)):\\n if r - l + 1 == 10:\\n seqs[s[l:r+1]] += 1\\n if seqs[s[l:r+1]] > 1:\\n res.append(s[l:r+1])\\n l += 1\\n return list(set(res))\\n \",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n counts = defaultdict(int)\\n for i in range(len(s) - 9):\\n counts[s[i:i + 10]] += 1\\n \\n return [k for k in counts if counts[k] > 1]\\n\\n\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n dct={}\\n for i in range(len(s)-9):\\n if s[i:i+10] in dct:\\n dct[s[i:i+10]]+=1\\n else:\\n dct[s[i:i+10]]=1\\n print(dct)\\n return [i for i,j in dct.items() if j>1]\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n hashmap_store_sequeneces:Dict[str,int] = {}\\n result_arr:List[int] = []\\n \\n k:int = 10\\n\\n i:int = 0\\n j:int = 0\\n\\n temp_arr:List[str] = []\\n while j<len(s):\\n temp_arr.append(s[j])\\n\\n if j-i+1==k:\\n temp_str_form:str = ''.join(temp_arr)\\n\\n if temp_str_form not in hashmap_store_sequeneces:\\n hashmap_store_sequeneces[temp_str_form]=1\\n else:\\n hashmap_store_sequeneces[temp_str_form]+=1\\n\\n if hashmap_store_sequeneces[temp_str_form]==2:\\n result_arr.append(temp_str_form)\\n \\n temp_arr.pop(0)\\n i+=1\\n\\n j+=1\\n \\n return result_arr\\n\\n\\n \",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n l = 10\\n if len(s) <= l:\\n return []\\n dic = {\\\"A\\\":0, \\\"C\\\":1, \\\"G\\\":2, \\\"T\\\":3}\\n cur = 0\\n for i in range (0, l):\\n cur = 4 * cur + dic[s[i]]\\n result = set()\\n seen = {cur}\\n for i in range (1, len(s) + 1 - l):\\n cur -= dic[s[i-1]] * (4**(l-1))\\n cur *= 4\\n cur += dic[s[i+l-1]]\\n # print(cur)\\n if cur in seen:\\n result.add(s[i:i+l])\\n seen.add(cur)\\n\\n\\n return list(result)\\n\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n \\n window = deque(maxlen=10)\\n\\n seen_set = set()\\n\\n repeated_set = set()\\n\\n for i in range(0, len(s)):\\n \\n window.append(s[i])\\n\\n if len(window)==10:\\n\\n temp_str = ''.join(window)\\n\\n if temp_str not in seen_set:\\n seen_set.add(temp_str)\\n else:\\n repeated_set.add(temp_str)\\n\\n return list(repeated_set)\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n i = 10\\n dic = defaultdict(int)\\n spliced_s = s[:10]\\n dic[spliced_s] += 1 \\n\\n while i < len(s): \\n spliced_s = spliced_s[1:] + s[i]\\n dic[spliced_s] += 1 \\n i += 1\\n \\n res = []\\n\\n for item, val in dic.items(): \\n if val > 1: \\n res.append(item)\\n\\n return res \",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n cur, dnaHash = s[:10], defaultdict(int)\\n dnaHash[cur] +=1 \\n\\n for i in range(10, len(s)):\\n cur = cur[1:] + s[i]\\n dnaHash[cur] += 1\\n \\n return [i for i in dnaHash.keys() if dnaHash[i] > 1]\\n \",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n from collections import defaultdict\\n seqs = defaultdict(int)\\n l, res = 0, set()\\n for r in range(len(s)):\\n if r - l + 1 == 10:\\n seqs[s[l:r+1]] += 1\\n if seqs[s[l:r+1]] > 1:\\n res.add(s[l:r+1])\\n l += 1 \\n return res\\n \",\n \"runtime\": \"76\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n substrings = Counter()\\n if len(s) < 10: return []\\n for i in range(len(s)-9):\\n substrings[s[i:i+10]] += 1\\n return (c for c,count in substrings.items() if count > 1)\\n\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n #iterate through array\\n # at every idx splice the array from [curr:curr+10] (?)\\n # check if we have seen it before\\n # if not add it to seen, if yes add it to res\\n\\n res = set()\\n seen = set()\\n print(len(s))\\n for i in range(len(s)-9):\\n print(i)\\n sequence = s[i:i+10]\\n if sequence in seen:\\n res.add(sequence)\\n else:\\n seen.add(sequence)\\n \\n return list(res)\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n\\n res = []\\n if len(s) < 10:\\n return res\\n\\n seqCountMap = collections.Counter()\\n l, r = 0, 9\\n while r < len(s):\\n seqCountMap[s[l:r + 1]] += 1\\n l += 1\\n r += 1\\n \\n for seq in seqCountMap:\\n if seqCountMap[seq] > 1:\\n res.append(seq)\\n return res\\n \",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n # using rolling hash approach of Rabin Karp Algo\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n mappings = {\\n 'A': 1, 'C': 2, 'G': 3, 'T': 4\\n }\\n\\n n = len(s)\\n m = 9\\n if n <= m:\\n return []\\n \\n tHash = 0\\n seen = defaultdict(int)\\n for i in range(0, m+1):\\n tHash = tHash * 4 + mappings[s[i]]\\n seen[tHash] = 1\\n\\n result = []\\n for i in range(1, n - m):\\n # - remove the leftmost character from the hash value\\n # - shift remaining hash value left by 1 (multiply by 4 as we using base 4)\\n # - add the new rightmost character\\n # \\n # using 4^9 because we have 10 characters, and the leftmost is at\\n # the 10th position (count from 0)\\n tHash = (tHash - (4 ** m) * mappings[s[i-1]]) * 4 + mappings[s[i + m]]\\n # print(tHash, s[i:i + m + 1])\\n\\n seen[tHash] += 1\\n if seen[tHash] == 2:\\n # print(tHash, s[i:i + m + 1])\\n result.append(s[i:i + m + 1])\\n\\n return result\\n\",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n cur, dnaHash = s[:10], defaultdict(int)\\n dnaHash[cur] +=1 \\n\\n for i in range(10, len(s)):\\n cur = cur[1:] + s[i]\\n dnaHash[cur] += 1\\n \\n return [i for i in dnaHash.keys() if dnaHash[i] > 1]\\n \",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n from collections import defaultdict \\n\\n l = 0\\n r = 9\\n\\n h = defaultdict(int)\\n\\n while r < len(s):\\n h[s[l:r + 1]] +=1 \\n r += 1\\n l += 1\\n \\n output = []\\n for key in h:\\n if h[key] > 1:\\n output.append(key)\\n return output \\n\\n\\n \",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n q = deque()\\n unique = {}\\n for char in s:\\n if len(q) == 10:\\n q.popleft()\\n q.append(char)\\n \\n if len(q) == 10:\\n pattern = \\\"\\\".join(q)\\n unique[pattern] = unique.get(pattern, 0) + 1\\n \\n return [pattern for pattern, value in unique.items() if value > 1]\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n\\n res = []\\n\\n dna = list(s)\\n counter = defaultdict(int)\\n left = 0\\n for right in range(len(dna)):\\n if right-left+1<10:\\n continue\\n if right-left+1==10:\\n mol = s[left:right+1]\\n counter[mol]+=1\\n if counter[mol]==2:\\n res.append(mol)\\n left+=1\\n\\n return res\\n\\n\",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n n = len(s)\\n if n < 10:\\n return []\\n\\n q = deque()\\n for i in range(10):\\n q.append(s[i])\\n d = defaultdict(int)\\n d[\\\"\\\".join(q)] += 1\\n\\n for i in range(10, n):\\n q.popleft()\\n q.append(s[i])\\n d[\\\"\\\".join(q)] += 1\\n \\n res = []\\n for k, v in d.items():\\n if v > 1:\\n res.append(k)\\n\\n return res\\n\\n\\n\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) < 10:\\n return []\\n\\n mp = {}\\n\\n l = 0\\n r = 9\\n currList = collections.deque()\\n for i in range(10):\\n currList.append(s[i])\\n\\n mp[tuple(currList)] = 0\\n r = 10\\n ans = []\\n\\n while r < len(s):\\n currList.append(s[r])\\n currList.popleft()\\n dna = tuple(currList)\\n if dna in mp and mp[dna] != 1:\\n ans.append(\\\"\\\".join(currList))\\n mp[dna] = 1\\n elif dna not in mp:\\n mp[dna] = 0\\n r+=1\\n return ans\\n\\n\\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n st = set()\\n i, j = 0, 0\\n cur = deque([])\\n res = set()\\n while j < len(s):\\n cur.append(s[j])\\n if j - i + 1 < 10:\\n j += 1\\n else:\\n string = \\\"\\\".join(cur)\\n if string in st:\\n res.add(string)\\n else:\\n st.add(string)\\n cur.popleft()\\n i += 1\\n j += 1\\n \\n return list(res)\",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n \\n seen = set()\\n dupes = set()\\n for i in range(len(s) - 9):\\n sub = s[i:i+10]\\n\\n print(sub)\\n\\n if sub in seen:\\n dupes.add(sub)\\n\\n seen.add(sub)\\n\\n return dupes\",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n n = len(s)\\n if n < 10:\\n return []\\n\\n q = deque()\\n for i in range(10):\\n q.append(s[i])\\n d = defaultdict(int)\\n d[\\\"\\\".join(q)] += 1\\n\\n for i in range(10, n):\\n q.popleft()\\n q.append(s[i])\\n d[\\\"\\\".join(q)] += 1\\n \\n res = []\\n for k, v in d.items():\\n if v > 1:\\n res.append(k)\\n\\n return res\\n\\n\\n\",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n dna_seq = {}\\n res = []\\n\\n for i in range(len(s) - 9):\\n sub_str = s[i]+s[i+1]+s[i+2]+s[i+3]+s[i+4]+s[i+5]+s[i+6]+s[i+7]+s[i+8]+s[i+9]\\n\\n if sub_str not in dna_seq:\\n dna_seq[sub_str] = 1\\n else:\\n if dna_seq[sub_str] == 1:\\n res.append(sub_str)\\n dna_seq[sub_str] += 1\\n\\n return res\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def get_value(self, ch):\\n if ch==\\\"A\\\": return 0\\n if ch==\\\"C\\\": return 1\\n if ch==\\\"G\\\": return 2\\n return 3\\n\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n counter = {}\\n output = []\\n\\n # use rolling hash on subsequence\\n hash = 0\\n pow = 4**9\\n for i in range(len(s)):\\n hash = hash*4 + self.get_value(s[i])\\n if i>=9:\\n if hash not in counter:\\n counter[hash] = 0\\n counter[hash] += 1\\n if counter[hash]==2:\\n output.append(s[i-9:i+1])\\n # unhash the tail\\n hash -= pow*self.get_value(s[i-9])\\n\\n return output \\n\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n n = len(s)\\n if n < 10:\\n return []\\n\\n q = deque()\\n for i in range(10):\\n q.append(s[i])\\n d = defaultdict(int)\\n d[\\\"\\\".join(q)] += 1\\n\\n for i in range(10, n):\\n q.popleft()\\n q.append(s[i])\\n d[\\\"\\\".join(q)] += 1\\n \\n res = []\\n for k, v in d.items():\\n if v > 1:\\n res.append(k)\\n\\n return res\\n\\n\\n\",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) <= 10:\\n return []\\n counts = Counter()\\n mp = {'A': 1, 'C': 2, 'T': 3, 'G': 4}\\n rmp = ['', 'A', 'C', 'T', 'G']\\n num = 0\\n for i in range(10):\\n num *= 10\\n num += mp[s[i]]\\n counts[num] += 1\\n for i in range(10, len(s)):\\n num = (num % int(1E9)) * 10 + mp[s[i]]\\n counts[num] += 1\\n return [\\\"\\\".join([rmp[int(i)] for i in str(k)]) for k in counts if counts[k] > 1]\",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n map = {}\\n res = []\\n \\n i = 0\\n while i + 10 <= len(s):\\n seq = s[i:i + 10]\\n print(seq)\\n map[seq] = map.get(seq, 0) + 1\\n if map[seq] == 2:\\n res.append(seq)\\n i+=1\\n\\n return res\",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n # return a list of all the 10-letter-long sequences that occur more than once\\n n = len(s)\\n count = defaultdict(int)\\n ans = []\\n\\n for i in range(n-9):\\n dna = s[i : i+10]\\n print(dna)\\n count[dna] += 1\\n if count[dna] == 2:\\n ans.append(dna)\\n\\n return ans\\n\\n \",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\r\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\r\\n curr = deque()\\r\\n bank = set()\\r\\n L = 0\\r\\n ans = []\\r\\n\\r\\n for R in range(len(s)):\\r\\n curr.append(s[R])\\r\\n if len(curr) < 10:\\r\\n continue\\r\\n\\r\\n if len(curr) > 10:\\r\\n curr.popleft()\\r\\n L += 1\\r\\n\\r\\n if tuple(curr) in bank:\\r\\n ans.append(''.join(list(curr)))\\r\\n else:\\r\\n bank.add(tuple(curr))\\r\\n\\r\\n return set(ans)\\r\\n\",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) <= 10:\\n return []\\n\\n outputs = set()\\n str_len = 10\\n base = 4\\n base_raised = base**(str_len-1)\\n char_to_int = {\\\"A\\\": 0, \\\"C\\\": 1, \\\"G\\\": 2, \\\"T\\\": 3}\\n P = 29\\n\\n def rolling_hash(prev_hash, remove_digit, add_digit, digits = str_len, base = base, p = P):\\n subtract_highest = prev_hash - (char_to_int[remove_digit] * base_raised)\\n raw = subtract_highest * base + char_to_int[add_digit]\\n return raw % p\\n\\n prev_hash = sum(char_to_int[s[i]] * base**(str_len-1-i) for i in range(str_len))\\n prev_hash = prev_hash % P\\n hashes_seen = [set()] * P\\n hashes_seen[prev_hash].add(s[:str_len])\\n\\n # print(f\\\"string: {s[:str_len]}, hash: {prev_hash}\\\")\\n for i in range(str_len,len(s)):\\n this_substring = s[i-str_len+1:i+1]\\n next_hash = rolling_hash(prev_hash, s[i-str_len], s[i])\\n # print(f\\\"string: {this_substring}, hash: {next_hash}\\\")\\n if len(hashes_seen[next_hash]) > 0:\\n if this_substring in hashes_seen[next_hash]:\\n outputs.add(this_substring)\\n hashes_seen[next_hash].add(this_substring)\\n prev_hash = next_hash\\n\\n return list(outputs)\\n\\n\\n\\n \\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) <= 10:\\n return []\\n\\n outputs = set()\\n str_len = 10\\n base = 4\\n char_to_int = {\\\"A\\\": 0, \\\"C\\\": 1, \\\"G\\\": 2, \\\"T\\\": 3}\\n P = base ** str_len\\n\\n def rolling_hash(prev_hash, next_digit, digits = str_len, base = base, p = P):\\n # subtract_highest = prev_hash - \\n raw = (prev_hash * base + char_to_int[next_digit])\\n return raw % p\\n\\n prev_hash = sum(char_to_int[s[i]] * base**(str_len-1-i) for i in range(str_len))\\n prev_hash = prev_hash % base**str_len \\n prev_hash = prev_hash % P\\n hashes_seen = { prev_hash: {s[:str_len]} }\\n\\n # print(f\\\"string: {s[:str_len]}, hash: {prev_hash}\\\")\\n for i in range(str_len,len(s)):\\n this_substring = s[i-str_len+1:i+1]\\n next_hash = rolling_hash(prev_hash, s[i])\\n # print(f\\\"string: {this_substring}, hash: {next_hash}\\\")\\n if next_hash in hashes_seen:\\n if this_substring in hashes_seen[next_hash]:\\n outputs.add(this_substring)\\n hashes_seen.setdefault(next_hash, set()).add(this_substring)\\n prev_hash = next_hash\\n\\n return list(outputs)\\n\\n\\n\\n \\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n dna_seq = set()\\n seen = set()\\n\\n for i in range(len(s) - 9):\\n sub_str = s[i]+s[i+1]+s[i+2]+s[i+3]+s[i+4]+s[i+5]+s[i+6]+s[i+7]+s[i+8]+s[i+9]\\n\\n if sub_str not in dna_seq:\\n dna_seq.add(sub_str)\\n else:\\n seen.add(sub_str)\\n\\n return list(seen)\",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n n = len(s)\\n k = 10\\n if n < k:\\n return []\\n # chars = list(s)\\n counter = collections.Counter()\\n\\n win = collections.deque()\\n for i in range(k):\\n win.append(s[i])\\n counter[tuple(win)] += 1\\n \\n for i in range(k, n):\\n win.popleft()\\n win.append(s[i])\\n\\n counter[tuple(win)] += 1\\n\\n return [''.join(chars) for chars, c in counter.items() if c > 1]\\n\",\n \"runtime\": \"100\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":89,"string":"89"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n res = set()\n for idx in range(len(s) - 10):\n if s[idx: idx + 10] in s[idx + 1:]:\n res.add(s[idx: idx + 10] )\n return list(res)\n","memory":"16800"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len (s) < 10:\n return []\n \n stack = []\n for eles in range(len(s) - 10):\n DNA_atp = s[eles: eles + 10]\n \n if DNA_atp in stack:\n continue\n else:\n if DNA_atp in s[eles + 1:]:\n stack.append(DNA_atp)\n\n return stack","memory":"16900"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n answer = set()\n start = 0\n finish = 10\n while finish < len(s):\n res = s[start:finish]\n if res in s[start + 1:] and res not in answer:\n answer.add(res)\n start += 1\n finish += 1\n return list(answer)","memory":"17000"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n res = []\n for i in range(len(s) - 10):\n seq = s[i : i + 10]\n sliced = s[i + 1:]\n\n if seq in sliced and seq not in res:\n res.append(seq)\n \n return res\n \n \n ","memory":"17100"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n \n n=len(s)\n i=j=c=0\n l=[]\n k=10\n while(i<n):\n j=i\n s1=''\n c=0\n while(j<n):\n s1+=s[j]\n c+=1\n if(c==10):\n # c=c-1\n # c=\n print(c)\n break\n \n j+=1\n \n if(s1 in s[i+1:]):\n l.append(s1)\n i+=1\n return list(set(l))","memory":"17200"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n \n a=list(s)\n # print(s,len(s),len(a))\n # s = \"AAAAAAAAAAAAA\"\n n=len(s)\n i=j=c=1\n l=[]\n k=10\n s1=a[:10]\n\n s2=''.join(s1)\n # print(s2)\n if(s2 in s[1:]):\n l.append(s2)\n\n # print(s1)\n i=0\n while(i<n-10):\n # if(i<n):\n # print(i,s1,s1[i])\n del s1[0]\n # print(s1)\n s1.append(s[i+10])\n s2=''.join(s1)\n # print(s2)\n if(s2 in s[j+1:]):\n l.append(s2)\n i+=1\n j+=1\n return set(set(l))","memory":"17300"},{"code":"from collections import deque\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n \n a=list(s)\n # print(s,len(s),len(a))\n # s = \"AAAAAAAAAAAAA\"\n n=len(s)\n i=j=c=1\n l=[]\n k=10\n s1=a[:10]\n s1=deque(s1)\n s2=''.join(s1)\n # print(s2)\n if(s2 in s[1:]):\n l.append(s2)\n\n # print(s1)\n i=0\n while(i<n-10):\n # if(i<n):\n # print(i,s1,s1[i])\n # del s1[0]\n s1.popleft()\n # print(s1)\n s1.append(s[i+10])\n s2=''.join(s1)\n # print(s2)\n if(s2 in s[j+1:]):\n l.append(s2)\n i+=1\n j+=1\n return set(set(l))","memory":"17300"},{"code":"from collections import deque\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n \n a=list(s)\n # print(s,len(s),len(a))\n # s = \"AAAAAAAAAAAAA\"\n n=len(s)\n i=j=c=1\n l=deque()\n k=10\n s1=a[:10]\n s1=deque(s1)\n s2=''.join(s1)\n # print(s2)\n if(s2 in s[1:]):\n l.append(s2)\n\n # print(s1)\n i=0\n while(i<n-10):\n # if(i<n):\n # print(i,s1,s1[i])\n # del s1[0]\n s1.popleft()\n # print(s1)\n s1.append(s[i+10])\n s2=''.join(s1)\n # print(s2)\n if(s2 in s[j+1:]):\n l.append(s2)\n i+=1\n j+=1\n return set(set(l))","memory":"17400"},{"code":"\nimport collections\n\n# https://www.math.utah.edu/~pa/MDS/primes.html\nPRIME_NUM = 997 #2147483647 #997\n\nclass Solution:\n\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n size = len(s)\n if size < 11:\n return []\n # b0, b1, b10, b11 \n d = {\n 'A': 1,\n 'C': 2,\n 'G': 3,\n 'T': 4\n }\n # MULTI = 4\n # ACG = 1*10^2 + 2*10 + 3 = 123\n num = 0\n for i in range(10): # first 10 letters\n c = s[i]\n num = num*10 + d[c]\n sign = num % PRIME_NUM\n high = 10**9\n sign_d = collections.defaultdict(list)\n # print(sign)\n # sign_list = [0 for _ in range(size-10)]\n sign_d[sign] = [0]\n for i in range(10, size):\n c = s[i]\n num = (num - high*d[s[i-10]])*10 + d[c]\n sign = num % PRIME_NUM\n sign_d[sign].append(i-9)\n \n # print(sign_d)\n\n res = set()\n for idx_list in sign_d.values():\n if len(idx_list) == 1:\n continue\n count = collections.Counter()\n for i in idx_list:\n word = s[i:i+10]\n count[word] += 1\n for word, c in count.items():\n if c > 1:\n res.add(word)\n return list(res)\n # return []\n","memory":"20800"},{"code":"\nimport collections\n\n# https://www.math.utah.edu/~pa/MDS/primes.html\nPRIME_NUM = 997 #2147483647\n\nclass Solution:\n\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n size = len(s)\n if size < 11:\n return []\n # b0, b1, b10, b11 \n d = {\n 'A': 1,\n 'C': 2,\n 'G': 3,\n 'T': 4\n }\n MULTI = 4 #10\n # ACG = 1*10^2 + 2*10 + 3 = 123\n num = 0\n for i in range(10): # first 10 letters\n c = s[i]\n num = num * MULTI + d[c]\n sign = num % PRIME_NUM\n high = MULTI**9\n sign_d = collections.defaultdict(list)\n # print(sign)\n # sign_list = [0 for _ in range(size-10)]\n sign_d[sign] = [0]\n for i in range(10, size):\n c = s[i]\n num = (num - high*d[s[i-10]]) * MULTI + d[c]\n sign = num % PRIME_NUM\n sign_d[sign].append(i-9)\n\n res = set()\n for idx_list in sign_d.values():\n if len(idx_list) == 1:\n continue\n count = collections.Counter()\n for i in idx_list:\n word = s[i:i+10]\n count[word] += 1\n for word, c in count.items():\n if c > 1:\n res.add(word)\n return list(res)\n","memory":"20800"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n return [] if len(s) <=10 else set([el for index, el in enumerate([s[index:index + 10] for index in range(len(s) - 10 + 1)]) if s[index + 1:].count(el) >= 1])","memory":"23700"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n hmap = {'A': 0, 'G': 1, 'C': 2, 'T': 3}\n\n if len(s) < 10:\n return []\n\n hash1 = 0\n\n for i in range(len(s)):\n hash1 += hmap[s[i]]\n\n rst = {}\n\n rst[hash1] = [s[0:10]]\n\n res = set()\n\n\n for i in range(1, len(s) - 10 + 1):\n hash1 -= hmap[s[i - 1]]\n hash1 += hmap[s[i + 9]]\n if hash1 in rst and s[i: i + 10] in rst[hash1]:\n res.add(s[i: i + 10])\n else:\n if hash1 not in rst:\n rst[hash1] = []\n rst[hash1].append(s[i: i + 10])\n\n return list(res)\n \n\n\n\n ","memory":"24000"},{"code":"class Solution:\n L = 10;\n\n def getDigit(self, nucleotide):\n if nucleotide == 'A':\n return 0;\n elif nucleotide == 'C':\n return 1;\n elif nucleotide == 'G':\n return 2;\n else:\n return 3;\n\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seen = set();\n left, right = 0, 0;\n duplicates = set();\n res = set();\n window = 0;\n R = 4;\n L = 10;\n RL = pow(R,(L-1));\n\n while right < len(s):\n c = self.getDigit(s[right]);\n window = window * R + c;\n print(\"window\", window, window * RL)\n right += 1;\n\n if right - left == self.L:\n d = self.getDigit(s[left]);\n if window in seen:\n res.add(s[left:right]);\n seen.add(window);\n window = window - RL*d;\n left += 1;\n\n return list(res);\n\n ","memory":"26100"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) <= 10:\n return []\n v = {\n \"A\": 0,\n \"C\": 1,\n \"G\": 2,\n \"T\": 3\n }\n out = set()\n index = 1\n seen = set()\n total = 0\n for i in range(10):\n total += v[s[i]]*(4**i)\n seen.add(total)\n while index + 9 < len(s):\n total -= v[s[index-1]]\n total = total // 4\n total += v[s[index+9]]*(4**9)\n if total in seen:\n out.add(s[index:index+10])\n seen.add(total)\n index += 1\n return list(out)","memory":"26200"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) <= 10:\n return []\n v = {\n \"A\": 0,\n \"C\": 1,\n \"G\": 2,\n \"T\": 3\n }\n out = set()\n index = 1\n seen = set()\n total = 0\n for i in range(10):\n total += v[s[i]]*(4**i)\n seen.add(total)\n while index + 9 < len(s):\n total -= v[s[index-1]]\n total = total // 4\n total += v[s[index+9]]*(4**9)\n if total in seen:\n out.add(s[index:index+10])\n seen.add(total)\n index += 1\n return list(out)","memory":"26200"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) <= 10: return []\n \n seen = set()\n ans = set()\n\n d = {'A' : 0, 'C' : 1, 'T' : 2, 'G' : 3}\n d2 = {0 : 'A', 1: 'C', 2: 'T', 3: 'G'}\n\n def decode(num: int):\n ans = ''\n for i in range(10):\n ans = d2[num & 3] + ans\n num = num >> 2\n return ans\n\n curr = 0\n for i in range(10): curr = curr << 2 | d[s[i]]\n\n seen.add(curr)\n for i in range(10, len(s)):\n curr = (curr << 2 | d[s[i]]) & ((1 << 20) - 1)\n if curr in seen: ans.add(curr)\n seen.add(curr)\n\n return [decode(a) for a in ans]","memory":"26300"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n pows=[7**(i+1) for i in range(10)]\n d={'A':1,'C':2,'G':3,'T':4}\n def hash(val,toadd,toremove): return (val-(d[toremove]*pows[9]))*7+d[toadd]*7\n ans=set()\n curr=sum([d[x]*(7**(10-i)) for i,x in enumerate(s[:10])])\n z=set([curr])\n for i in range(10,len(s)):\n curr=hash(curr,s[i],s[i-10])\n if curr in z: ans.add(s[i-9:i+1])\n z.add(curr)\n return ans","memory":"26400"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n pows=[7**(i+1) for i in range(10)]\n d={'A':1,'C':2,'G':3,'T':4}\n def hash(val,toadd,toremove): return (val-(d[toremove]*pows[9]))*7+d[toadd]*7\n ans=set()\n curr=sum([d[x]*(7**(10-i)) for i,x in enumerate(s[:10])])\n z=set([curr])\n for i in range(10,len(s)):\n curr=hash(curr,s[i],s[i-10])\n if curr in z: ans.add(s[i-9:i+1])\n z.add(curr)\n return ans","memory":"26500"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n pows=[7**(i+1) for i in range(10)]\n d={'A':1,'C':2,'G':3,'T':4}\n def hash(val,toadd,toremove): return (val-(d[toremove]*pows[9]))*7+d[toadd]*7\n ans=set()\n curr=sum([d[x]*(7**(10-i)) for i,x in enumerate(s[:10])])\n z=set([curr])\n for i in range(10,len(s)):\n curr=hash(curr,s[i],s[i-10])\n if curr in z: ans.add(s[i-9:i+1])\n z.add(curr)\n return ans","memory":"26600"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n pows=[7**(i+1) for i in range(10)]\n d={'A':1,'C':2,'G':3,'T':4}\n def hash(val,toadd,toremove): return (val-(d[toremove]*pows[9]))*7+d[toadd]*7\n ans=set()\n curr=sum([d[x]*(7**(10-i)) for i,x in enumerate(s[:10])])\n z=set([curr])\n for i in range(10,len(s)):\n curr=hash(curr,s[i],s[i-10])\n if curr in z: ans.add(s[i-9:i+1])\n z.add(curr)\n return ans","memory":"26600"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n L = 10\n n = len(s)\n \n a = 4\n aL = pow(a, L)\n\n to_int = {\"A\": 0, \"C\":1, \"G\":2, \"T\":3}\n nums = [to_int.get(ch) for ch in s]\n\n seen = set()\n output = set()\n\n h=0\n for start in range(len(s)-L+1):\n if start != 0:\n h = h*a - nums[start-1]*aL + nums[start+L-1]\n else:\n for i in range(L):\n h = h*a+nums[i]\n if h in seen:\n output.add(s[start:start+L])\n seen.add(h)\n\n return output","memory":"26700"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n base=4\n mapping={'A':1, 'C':2, 'G':3, 'T':4}\n max_coeff=pow(base,9)\n nums=[]\n n=len(s)\n for i in range(0,n,1):\n nums.append(mapping[s[i]])\n seen=set()\n ans=set()\n hashing=0\n start=0\n while start<n-9:\n if start!=0:\n hashing-=(nums[start-1]*max_coeff)\n hashing*=base\n hashing+=nums[start+9]\n else:\n for i in range(0,10,1):\n hashing=hashing*base+nums[i]\n if hashing in seen:\n ans.add(s[start:start+10])\n seen.add(hashing)\n start+=1\n return ans","memory":"26800"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n L = 10\n a = 4\n aL = pow(a,L)\n n = len(s)\n if n<=L:\n return []\n res = set()\n seen = set()\n to_int = {'A':0, 'C':1, 'G':2, \"T\":3}\n\n nums = [to_int.get(s[i]) for i in range(n)]\n h = 0\n for start in range(n-L+1):\n if start==0:\n for i in range(L):\n h = h*a + nums[i]\n else:\n h = h*a - nums[start-1]*aL + nums[start+L-1]\n if h in seen:\n res.add(s[start:start+L])\n seen.add(h)\n return res\n\n \n \n \n \n \n # sequence_count = {}\n # res = []\n\n # for i in range(len(s) - 9): # Sliding window of length 10\n # seq = s[i:i+10]\n # if seq in sequence_count:\n # sequence_count[seq] += 1\n # else:\n # sequence_count[seq] = 1\n\n # if sequence_count[seq] == 2: # Add to result if it's seen twice\n # res.append(seq)\n\n # return res\n \n \n \n # seen = {}\n # res = []\n # for i in range(len(s)-9):\n # seq = s[i:i+10]\n # seen[seq] = seen.get(seq,0)+1\n # if seen[seq]==2:\n # res.append(seq)\n # return res\n \n ","memory":"26900"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n L = 10\n a = 4\n aL = pow(a,L)\n n = len(s)\n if n<=L:\n return []\n res = set()\n seen = set()\n to_int = {'A':0, 'C':1, 'G':2, \"T\":3}\n\n nums = [to_int.get(j) for j in s]\n h = 0\n for start in range(n-L+1):\n if start==0:\n for i in range(L):\n h = h*a + nums[i]\n else:\n h = h*a - nums[start-1]*aL + nums[start+L-1]\n if h in seen:\n res.add(s[start:start+L])\n seen.add(h)\n return res\n\n \n \n \n \n \n # sequence_count = {}\n # res = []\n\n # for i in range(len(s) - 9): # Sliding window of length 10\n # seq = s[i:i+10]\n # if seq in sequence_count:\n # sequence_count[seq] += 1\n # else:\n # sequence_count[seq] = 1\n\n # if sequence_count[seq] == 2: # Add to result if it's seen twice\n # res.append(seq)\n\n # return res\n \n \n \n # seen = {}\n # res = []\n # for i in range(len(s)-9):\n # seq = s[i:i+10]\n # seen[seq] = seen.get(seq,0)+1\n # if seen[seq]==2:\n # res.append(seq)\n # return res\n \n ","memory":"26900"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n n = len(s)\n nums = [0] * n\n for i in range(n):\n if s[i] == 'A':\n nums[i] = 0\n elif s[i] == 'C':\n nums[i] = 1\n elif s[i] == 'G':\n nums[i] = 2\n else:\n nums[i] = 3\n left, right, windowHash = 0, 0, 0\n res, seen = set(), set()\n R = 4\n L = 10\n RL = 4**(L-1)\n\n while right < n:\n windowHash = windowHash * R + nums[right]\n right += 1\n if right - left == L:\n if windowHash in seen:\n res.add(s[left:right])\n else:\n seen.add(windowHash)\n windowHash -= nums[left] * RL\n left += 1\n \n return list(res)","memory":"27000"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s)<10:\n return []\n value_hash_set=set()\n added=set()\n frame_hash_value=0\n output=[]\n offset=64\n weight=0\n \n alphabet_size=3337838838353557843\n prime=4316047271\n \n \n for index in range(9,-1,-1):\n \n new_value=(((alphabet_size)**(weight))*((ord(s[index])-offset)))%prime\n \n frame_hash_value=(frame_hash_value+new_value)%prime\n \n weight=weight+1\n value_hash_set.add(frame_hash_value)\n \n for index in range(10,len(s)):\n to_remove_value=(((alphabet_size)**(9))*((ord(s[index-10])-offset)))%prime\n \n frame_hash_value=frame_hash_value-to_remove_value\n \n frame_hash_value=(frame_hash_value*alphabet_size)%prime\n \n to_add_value=(ord(s[index])-offset)\n \n frame_hash_value=(frame_hash_value+to_add_value)%prime\n \n if frame_hash_value in value_hash_set:\n \n if frame_hash_value not in added:\n output.append(s[index-9:index+1])\n \n \n added.add(frame_hash_value)\n value_hash_set.add(frame_hash_value)\n\n return output\n ","memory":"27100"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s)<10:\n return []\n value_hash_set=set()\n added=set()\n frame_hash_value=0\n output=[]\n offset=64\n weight=0\n #alphabet_size=10000000\n #prime=44159\n alphabet_size=3337838838353\n prime=431604727\n alphabet_size=3337838838353557843\n prime=4316047271\n \n \n \n #print(len(s))\n \n for index in range(9,-1,-1):\n \n new_value=(((alphabet_size)**(weight))*((ord(s[index])-offset)))%prime\n \n frame_hash_value=(frame_hash_value+new_value)%prime\n #print(new_value,\"new_value\",frame_hash_value,\"new_frame_hash_value\")\n weight=weight+1\n value_hash_set.add(frame_hash_value)\n #print(frame_hash_value,\"frame_hash_value\")\n for index in range(10,len(s)):\n to_remove_value=(((alphabet_size)**(9))*((ord(s[index-10])-offset)))%prime\n #print(to_remove_value,\"to_remove_value\")\n frame_hash_value=frame_hash_value-to_remove_value\n #print(frame_hash_value,\"after_removed\")\n frame_hash_value=(frame_hash_value*alphabet_size)%prime\n \n to_add_value=(ord(s[index])-offset)\n #print(to_add_value,\"to_add_value\")\n frame_hash_value=(frame_hash_value+to_add_value)%prime\n #print(frame_hash_value,\"frame_hash_value_after_added\")\n if frame_hash_value in value_hash_set:\n \n if frame_hash_value not in added:\n output.append(s[index-9:index+1])\n \n \n added.add(frame_hash_value)\n value_hash_set.add(frame_hash_value)\n\n return output\n ","memory":"27200"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n hashmap={'A':1,'C':2,'G':3,'T':4}\n #print(hashmap)\n setstore=set()\n setresult=set()\n result=[]\n substr=0\n for i,val in enumerate(s):\n #print(hashmap[val])\n if i<9:\n substr=substr*10+hashmap[val]\n elif i==9:\n substr=substr*10+hashmap[val]\n setstore.add(substr)\n elif i>9:\n substr=mod(substr,pow(10,9))\n substr=substr*10+hashmap[val]\n #print(substr)\n if substr in setstore:\n #print('presnt in store')\n if substr not in setresult:\n setresult.add(substr)\n result.append(s[i-9:i+1])\n else:\n setstore.add(substr)\n #print(setresult,setstore)\n return result\n ","memory":"27300"},{"code":"from collections import defaultdict\n\nclass Solution:\n # using rolling hash approach of Rabin Karp Algo\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n mappings = {\n 'A': 1, 'C': 2, 'G': 3, 'T': 4\n }\n\n n = len(s)\n m = 9\n if n <= m:\n return []\n \n tHash = 0\n seen = defaultdict(int)\n for i in range(0, m+1):\n tHash = tHash * 4 + mappings[s[i]]\n seen[tHash] = 1\n\n result = []\n for i in range(1, n - m):\n # - remove the leftmost character from the hash value\n # - shift remaining hash value left by 1 (multiply by 4 as we using base 4)\n # - add the new rightmost character\n # \n # using 4^9 because we have 10 characters, and the leftmost is at\n # the 10th position (count from 0)\n tHash = (tHash - (4 ** m) * mappings[s[i-1]]) * 4 + mappings[s[i + m]]\n # print(tHash, s[i:i + m + 1])\n\n seen[tHash] += 1\n if seen[tHash] == 2:\n # print(tHash, s[i:i + m + 1])\n result.append(s[i:i + m + 1])\n\n return result\n","memory":"27400"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n mp = {'A': 0, 'C': 1, 'G': 2, 'T': 3}\n cnt = defaultdict(int)\n cur = 0\n ret = []\n for i in range(0, len(s)):\n cur = (cur << 2) + mp[s[i]]\n if i >= 9:\n cur &= (1 << 20) - 1\n if cnt[cur] == 1:\n ret.append(s[i-9:i+1])\n cnt[cur] += 1\n return ret","memory":"27500"},{"code":"from collections import defaultdict\nclass Solution:\n def encode(self, ch):\n if ch == 'A':\n return 0\n if ch == 'C':\n return 1\n if ch == 'G':\n return 2\n return 3\n\n def decode(self, num):\n if num == 0:\n return 'A'\n if num == 1:\n return 'C'\n if num == 2:\n return 'G'\n return 'T'\n \n def decodeSeq(self, encSeq):\n seq = \"\"\n for i in range(10):\n seq = self.decode(encSeq % 4) + seq\n encSeq >>= 2\n return seq\n\n def convertSeq(self, seq):\n enc = 0\n i = 18\n for s in seq:\n enc |= (self.encode(s) << i)\n i -= 2\n return enc\n \n def addToSeq(self, seq, ch):\n return (((1<<20)-1) & (seq << 2)) | self.encode(ch)\n\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n encMap = defaultdict(int)\n seq = self.convertSeq(s[:10])\n encMap[seq] += 1\n repeated = set()\n\n for i in range(10, len(s)):\n seq = self.addToSeq(seq, s[i])\n if encMap[seq] > 0:\n repeated.add(seq)\n encMap[seq] += 1\n\n return [self.decodeSeq(encSeq) for encSeq in repeated]\n ","memory":"27600"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n n=len(s)\n d={}\n for i in range(n-9):\n ss=s[i:i+10]\n if ss not in d:\n d[ss]=1\n else:\n d[ss]+=1 \n \n return [ss for ss in d.keys() if d[ss]>1]\n ","memory":"27700"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n \n store = collections.defaultdict(int)\n for i in range(len(s)-10+1):\n store[s[i:i+10]] += 1\n \n res = []\n for k, v in store.items():\n if v > 1:\n res.append(k)\n \n return res\n","memory":"27800"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n \n store = collections.defaultdict(int)\n res = []\n for i in range(len(s)-10+1):\n \n ss = s[i:i+10]\n if ss in store:\n if ss not in res:\n res.append(ss)\n else:\n store[ss] += 1\n \n return res\n","memory":"27800"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n n=len(s)\n d={}\n for i in range(n-9):\n ss=s[i:i+10]\n if ss not in d:\n d[ss]=1\n else:\n d[ss]+=1 \n \n return [ss for ss in d.keys() if d[ss]>1]\n ","memory":"27900"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n\n # var 2 dict+list:\n subs_map = {}\n w = 10\n res = []\n \n for i in range(len(s) - w + 1):\n subs = s[i:i+w]\n if subs in subs_map:\n if subs_map[subs] == 1:\n res.append(subs)\n else:\n subs_map[subs] = 0\n\n subs_map[subs] += 1\n \n return res\n\n\n # # var 1 two sets:\n # start = 0\n # window = 10\n # end = window\n # subset = set()\n # res = set()\n\n # while end <= len(s)+1:\n # subs = s[start:end]\n # if not subs in subset:\n # subset.add(subs) \n # else:\n # res.add(subs)\n\n # start += 1\n # end = start + window\n\n # return list(res)","memory":"27900"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seen_combinations = {}\n results = []\n for combination in iter_combinations(s, 10):\n if combination in seen_combinations:\n if seen_combinations[combination] == 1:\n results.append(combination)\n seen_combinations[combination] += 1\n else:\n seen_combinations[combination] = 1\n return results\n\n \ndef iter_combinations(s: str, size: int):\n curr_idx = 0\n while curr_idx + size - 1 < len(s):\n combination = s[curr_idx : curr_idx + size]\n yield combination\n curr_idx += 1","memory":"28000"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n # return a list of all the 10-letter-long sequences that occur more than once\n n = len(s)\n count = defaultdict(int)\n ans = []\n\n for i in range(n-9):\n dna = s[i : i+10]\n print(dna)\n count[dna] += 1\n if count[dna] == 2:\n ans.append(dna)\n\n return ans\n\n ","memory":"28000"},{"code":"from typing import List\n\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) < 10:\n return [] # No possible substrings of length 10\n\n unique_strings = {}\n common_strings = []\n\n # Iterate through all starting indices for substrings of length 10\n for i in range(len(s) - 9):\n substring = s[i:i + 10] # Extract substring of length 10\n\n if substring in unique_strings:\n unique_strings[substring] += 1\n else:\n unique_strings[substring] = 1\n\n # Add to result only if this is the second time we see this substring\n if unique_strings[substring] == 2:\n common_strings.append(substring)\n\n return common_strings\n","memory":"28100"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if not s:\n return []\n possible = {}\n res = []\n for i in range(len(s)-9):\n sub = s[i:i+10]\n print(f\"{i}-{sub}: {possible.get(sub)}\")\n if possible.get(sub) and sub not in res:\n res.append(sub)\n else:\n possible[sub] = True\n return res\n\n\n","memory":"28200"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n sequenceLength = 10\n\n # this part is not really needed actually.\n if len(s) < sequenceLength:\n return []\n \n res, seen = set(), set()\n for i in range(len(s) - sequenceLength + 1):\n seq = s[i: i + sequenceLength]\n if seq in seen:\n res.add(seq)\n else:\n seen.add(seq)\n \n return list(res)","memory":"28300"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seen, res = set(), set()\n for l in range(len(s) - 9):\n curr = s[l: l + 10]\n if curr in seen:\n res.add(curr)\n else:\n seen.add(curr)\n return list(res)\n ","memory":"28300"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n start = 0\n window = 10\n end = window\n subset = set()\n res = set()\n\n while end <= len(s)+1:\n subs = s[start:end]\n if not subs in subset:\n subset.add(subs) \n else:\n res.add(subs)\n\n start += 1\n end = start + window\n\n return list(res)","memory":"28400"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n #iterate through array\n # at every idx splice the array from [curr:curr+10] (?)\n # check if we have seen it before\n # if not add it to seen, if yes add it to res\n\n res = set()\n seen = set()\n print(len(s))\n for i in range(len(s)-9):\n print(i)\n sequence = s[i:i+10]\n if sequence in seen:\n res.add(sequence)\n else:\n seen.add(sequence)\n \n return list(res)","memory":"28400"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n occ=set()\n l=0\n res=set()\n for l in range(len(s)-9):\n if s[l:l+10] in occ:\n #if s[l:l+10] not in res:\n res.add(s[l:l+10])\n occ.add(s[l:l+10])\n \n return list(res)\n\n\n","memory":"28500"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) < 10:\n return []\n \n seen = set()\n repeated = set()\n \n for i in range(len(s) - 9):\n substring = s[i:i + 10]\n if substring in seen:\n repeated.add(substring)\n else:\n seen.add(substring)\n \n return list(repeated)\n","memory":"28500"},{"code":"from typing import List\n\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seen = set()\n repeated = set()\n \n # Iterate through the string with a window size of 10\n for i in range(len(s) - 9):\n # Extract the 10-letter sequence\n sequence = s[i:i + 10]\n \n # Check if this sequence has been seen before\n if sequence in seen:\n repeated.add(sequence)\n else:\n seen.add(sequence)\n \n return list(repeated)\n","memory":"28600"},{"code":"from collections import deque\n\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n \n return_arr = []\n\n window = deque(maxlen=10)\n\n repeated_set = set()\n seen_set = set()\n\n for i in range(0, len(s)):\n\n window.append(s[i])\n\n if len(window)==10:\n temp_str = ''.join(window)\n\n if temp_str in seen_set:\n repeated_set.add(temp_str)\n else:\n seen_set.add(temp_str)\n return list(repeated_set)","memory":"28600"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n seen, res = set(), set()\n for i in range(len(s)-9):\n cur = s[i:i+10]\n if cur in seen:\n res.add(cur)\n seen.add(cur)\n return list(res)\n\n ","memory":"28700"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n vals = set()\n result = set()\n\n for i in range(len(s)-9): \n substr = s[i:i+10]\n if substr in vals:\n result.add(substr)\n else:\n vals.add(substr)\n\n return result\n\n","memory":"28700"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n occ=set()\n l=0\n res=set()\n for l in range(len(s)-9):\n if s[l:l+10] in occ:\n if s[l:l+10] not in res:\n res.add(s[l:l+10])\n occ.add(s[l:l+10])\n \n return res\n\n\n","memory":"28800"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> list[str]:\n ans = set()\n seen = set()\n\n for i in range(len(s) - 9):\n seq = s[i:i + 10]\n if seq in seen:\n ans.add(seq)\n seen.add(seq)\n\n return list(ans)","memory":"28800"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n already_seen_ws, result_list = set(), set()\n\n for i in range(len(s)-9):\n current_window = s[i:i+10]\n if current_window in already_seen_ws:\n result_list.add(current_window)\n already_seen_ws.add(current_window)\n\n return list(result_list)\n\n ","memory":"28900"},{"code":"from collections import Counter\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) <= 10:\n return []\n counts = Counter()\n mp = {'A': 1, 'C': 2, 'T': 3, 'G': 4}\n rmp = ['', 'A', 'C', 'T', 'G']\n num = 0\n for i in range(10):\n num *= 10\n num += mp[s[i]]\n counts[num] += 1\n for i in range(10, len(s)):\n num = (num % int(1E9)) * 10 + mp[s[i]]\n counts[num] += 1\n return [\"\".join([rmp[int(i)] for i in str(k)]) for k in counts if counts[k] > 1]","memory":"29000"},{"code":"from collections import Counter\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) <= 10:\n return []\n counts = Counter()\n mp = {'A': 1, 'C': 2, 'T': 3, 'G': 4}\n rmp = ['', 'A', 'C', 'T', 'G']\n num = 0\n for i in range(10):\n num *= 10\n num += mp[s[i]]\n counts[num] += 1\n for i in range(10, len(s)):\n num = (num % int(1E9)) * 10 + mp[s[i]]\n counts[num] += 1\n # for i in range(len(s)-9):\n # counts[s[i:i+10]] += 1\n # print(counts)\n return [\"\".join([rmp[int(i)] for i in str(k)]) for k in counts if counts[k] > 1]","memory":"29100"},{"code":"#!/usr/bin/python3\n\nimport random\n\nfrom collections import Counter\n\nclass WindowHash:\n def __init__(self, window, modulus = 0, element = 0):\n self.window = window\n self.count = 0\n\n if modulus == 0:\n modulus = (2**61) - 1\n self.modulus = modulus\n\n if element == 0:\n element = random.randint(2, modulus)\n self.element = element\n\n self.shift_factor = pow(element, window - 1, modulus)\n\n self.hash = 0\n \n def Slide(self, outchar, incoming):\n self.count += 1\n if self.count > self.window:\n self.hash = (self.hash -\n (ord(outchar) * self.shift_factor)) % self.modulus\n\n self.hash = (self.hash * self.element\n + ord(incoming)) % self.modulus\n\n return self.hash\n\n def Initialize(self, prefix):\n for ch in prefix:\n self.Slide(None, ch)\n\n return self.hash\n \nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) < 11:\n return []\n\n window = 10\n W = WindowHash(10)\n\n N = len(s)\n history = Counter()\n\n history[ W.Initialize(s[:10]) ] = 1\n\n dups = []\n\n for i in range(10, N):\n H = W.Slide(s[i - 10], s[i])\n if history[H] == 1:\n dups.append(s[i - 9:i + 1])\n history[H] += 1\n \n return dups\n","memory":"29200"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) < 10:\n return []\n\n res = set()\n uniques = set()\n s_list = list(s)\n\n l = 0\n for r in range(len(s_list)):\n if r >= 9:\n substr = \"\".join(s_list[l: r + 1])\n if substr in uniques:\n res.add(substr)\n uniques.add(substr)\n l += 1\n \n return list(res)\n\n'''\nUnderstanding:\nRephrase: Find repeating substrings of length 10.\n\nQuestions:\n-> What are the parameters of the string's length? Can it be empty or < 10?\n -> Not empty. [1, 10^5]\n-> What characters can the string hold? \n -> 'A', 'C', 'G', 'T'\n-> Are there complexity constraints?\n -> Unsure. O(N) Time, O(N) space\n\nEdge Case: Strings of length 1-9. Don't meet parameters\n\nMatch: \nSet() for unique strings of length 10\nSliding Window \nReturn array\nConvert array to list\n\nPlan:\n# Edge Case:\nif len(s) < 10:\n return []\n\nres = []\nuniques = set()\ns_list = list(s)\n\nl = 0\nfor r in range(len(s_list)):\n if r >= 9:\n substr = s_list[l: r + 1]\n if substr in uniques:\n res.append(str(substr))\n uniques.add(substr)\n l += 1\n \nreturn res\n'''","memory":"29300"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) < 10:\n return []\n\n res = set()\n uniques = set()\n s_list = list(s)\n\n l = 0\n for r in range(len(s_list)):\n if r >= 9:\n substr = \"\".join(s_list[l: r + 1])\n if substr in uniques:\n res.add(substr)\n uniques.add(substr)\n l += 1\n \n return list(res)\n\n'''\nUnderstanding:\nRephrase: Find repeating substrings of length 10.\n\nQuestions:\n-> What are the parameters of the string's length? Can it be empty or < 10?\n -> Not empty. [1, 10^5]\n-> What characters can the string hold? \n -> 'A', 'C', 'G', 'T'\n-> Are there complexity constraints?\n -> Unsure. O(N) Time, O(N) space\n\nEdge Case: Strings of length 1-9. Don't meet parameters\n\nMatch: \nSet() for unique strings of length 10\nSliding Window \nReturn array\nConvert array to list\n\nPlan:\n# Edge Case:\nif len(s) < 10:\n return []\n\nres = []\nuniques = set()\ns_list = list(s)\n\nl = 0\nfor r in range(len(s_list)):\n if r >= 9:\n substr = s_list[l: r + 1]\n if substr in uniques:\n res.append(str(substr))\n uniques.add(substr)\n l += 1\n \nreturn res\n'''","memory":"29300"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n if len(s) < 10:\n return []\n\n res = set()\n uniques = set()\n s_list = list(s)\n\n l = 0\n for r in range(len(s_list)):\n if r >= 9:\n substr = \"\".join(s_list[l: r + 1])\n if substr in uniques:\n res.add(substr)\n uniques.add(substr)\n l += 1\n \n return list(res)\n\n'''\nUnderstanding:\nRephrase: Find repeating substrings of length 10.\n\nQuestions:\n-> What are the parameters of the string's length? Can it be empty or < 10?\n -> Not empty. [1, 10^5]\n-> What characters can the string hold? \n -> 'A', 'C', 'G', 'T'\n-> Are there complexity constraints?\n -> Unsure. O(N) Time, O(N) space\n\nEdge Case: Strings of length 1-9. Don't meet parameters\n\nMatch: \nSet() for unique strings of length 10\nSliding Window \nReturn array\nConvert array to list\n\nPlan:\n# Edge Case:\nif len(s) < 10:\n return []\n\nres = []\nuniques = set()\ns_list = list(s)\n\nl = 0\nfor r in range(len(s_list)):\n if r >= 9:\n substr = s_list[l: r + 1]\n if substr in uniques:\n res.append(str(substr))\n uniques.add(substr)\n l += 1\n \nreturn res\n'''","memory":"29400"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n sequences: set[str] = set()\n sequences2: set[str] = set()\n\n for i, l in enumerate(list(s)):\n if len(s) - i < 10:\n break\n t = s[i : (i + 10)]\n if t in sequences:\n sequences2.add(t)\n else:\n sequences.add(t)\n return list(sequences2)","memory":"29500"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n sequences: set[str] = set()\n sequences2: set[str] = set()\n\n for i, l in enumerate(list(s)):\n if len(s) - i < 10:\n break\n t = s[i : (i + 10)]\n if t in sequences:\n sequences2.add(t)\n else:\n sequences.add(t)\n return list(sequences2)","memory":"29500"},{"code":"from collections import Counter\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n sequence = s[:10]\n sequences = [sequence]\n for char in s[10:]:\n sequence += char\n sequence = sequence[1:]\n sequences.append(sequence)\n\n counts = Counter(sequences)\n dupids = set([sequence for sequence in sequences if counts[sequence] > 1])\n return dupids\n\n ","memory":"29600"},{"code":"from collections import Counter\nclass Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n sequence = s[:10]\n sequences = [sequence]\n for char in s[10:]:\n sequence += char\n sequence = sequence[1:]\n sequences.append(sequence)\n\n counts = Counter(sequences)\n dupids = set([sequence for sequence in sequences if counts[sequence] > 1])\n return dupids\n\n ","memory":"29600"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n\n counts = Counter([s[i:i+10] for i in range(len(s)-9)])\n return [k for k,v in counts.items() if v>1]\n ","memory":"29700"},{"code":"class Solution:\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\n\n window_len = 10\n\n windows = []\n for start_idx in range(0, len(s)-9):\n windows.append(s[start_idx:start_idx+window_len])\n \n counts = Counter(windows)\n repeats = [window for window in windows if counts[window] > 1]\n\n return list(set(repeats))\n\n\n ","memory":"29800"}],"string":"[\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n res = set()\\n for idx in range(len(s) - 10):\\n if s[idx: idx + 10] in s[idx + 1:]:\\n res.add(s[idx: idx + 10] )\\n return list(res)\\n\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len (s) < 10:\\n return []\\n \\n stack = []\\n for eles in range(len(s) - 10):\\n DNA_atp = s[eles: eles + 10]\\n \\n if DNA_atp in stack:\\n continue\\n else:\\n if DNA_atp in s[eles + 1:]:\\n stack.append(DNA_atp)\\n\\n return stack\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n answer = set()\\n start = 0\\n finish = 10\\n while finish < len(s):\\n res = s[start:finish]\\n if res in s[start + 1:] and res not in answer:\\n answer.add(res)\\n start += 1\\n finish += 1\\n return list(answer)\",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n res = []\\n for i in range(len(s) - 10):\\n seq = s[i : i + 10]\\n sliced = s[i + 1:]\\n\\n if seq in sliced and seq not in res:\\n res.append(seq)\\n \\n return res\\n \\n \\n \",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n \\n n=len(s)\\n i=j=c=0\\n l=[]\\n k=10\\n while(i<n):\\n j=i\\n s1=''\\n c=0\\n while(j<n):\\n s1+=s[j]\\n c+=1\\n if(c==10):\\n # c=c-1\\n # c=\\n print(c)\\n break\\n \\n j+=1\\n \\n if(s1 in s[i+1:]):\\n l.append(s1)\\n i+=1\\n return list(set(l))\",\n \"memory\": \"17200\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n \\n a=list(s)\\n # print(s,len(s),len(a))\\n # s = \\\"AAAAAAAAAAAAA\\\"\\n n=len(s)\\n i=j=c=1\\n l=[]\\n k=10\\n s1=a[:10]\\n\\n s2=''.join(s1)\\n # print(s2)\\n if(s2 in s[1:]):\\n l.append(s2)\\n\\n # print(s1)\\n i=0\\n while(i<n-10):\\n # if(i<n):\\n # print(i,s1,s1[i])\\n del s1[0]\\n # print(s1)\\n s1.append(s[i+10])\\n s2=''.join(s1)\\n # print(s2)\\n if(s2 in s[j+1:]):\\n l.append(s2)\\n i+=1\\n j+=1\\n return set(set(l))\",\n \"memory\": \"17300\"\n },\n {\n \"code\": \"from collections import deque\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n \\n a=list(s)\\n # print(s,len(s),len(a))\\n # s = \\\"AAAAAAAAAAAAA\\\"\\n n=len(s)\\n i=j=c=1\\n l=[]\\n k=10\\n s1=a[:10]\\n s1=deque(s1)\\n s2=''.join(s1)\\n # print(s2)\\n if(s2 in s[1:]):\\n l.append(s2)\\n\\n # print(s1)\\n i=0\\n while(i<n-10):\\n # if(i<n):\\n # print(i,s1,s1[i])\\n # del s1[0]\\n s1.popleft()\\n # print(s1)\\n s1.append(s[i+10])\\n s2=''.join(s1)\\n # print(s2)\\n if(s2 in s[j+1:]):\\n l.append(s2)\\n i+=1\\n j+=1\\n return set(set(l))\",\n \"memory\": \"17300\"\n },\n {\n \"code\": \"from collections import deque\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n \\n a=list(s)\\n # print(s,len(s),len(a))\\n # s = \\\"AAAAAAAAAAAAA\\\"\\n n=len(s)\\n i=j=c=1\\n l=deque()\\n k=10\\n s1=a[:10]\\n s1=deque(s1)\\n s2=''.join(s1)\\n # print(s2)\\n if(s2 in s[1:]):\\n l.append(s2)\\n\\n # print(s1)\\n i=0\\n while(i<n-10):\\n # if(i<n):\\n # print(i,s1,s1[i])\\n # del s1[0]\\n s1.popleft()\\n # print(s1)\\n s1.append(s[i+10])\\n s2=''.join(s1)\\n # print(s2)\\n if(s2 in s[j+1:]):\\n l.append(s2)\\n i+=1\\n j+=1\\n return set(set(l))\",\n \"memory\": \"17400\"\n },\n {\n \"code\": \"\\nimport collections\\n\\n# https://www.math.utah.edu/~pa/MDS/primes.html\\nPRIME_NUM = 997 #2147483647 #997\\n\\nclass Solution:\\n\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n size = len(s)\\n if size < 11:\\n return []\\n # b0, b1, b10, b11 \\n d = {\\n 'A': 1,\\n 'C': 2,\\n 'G': 3,\\n 'T': 4\\n }\\n # MULTI = 4\\n # ACG = 1*10^2 + 2*10 + 3 = 123\\n num = 0\\n for i in range(10): # first 10 letters\\n c = s[i]\\n num = num*10 + d[c]\\n sign = num % PRIME_NUM\\n high = 10**9\\n sign_d = collections.defaultdict(list)\\n # print(sign)\\n # sign_list = [0 for _ in range(size-10)]\\n sign_d[sign] = [0]\\n for i in range(10, size):\\n c = s[i]\\n num = (num - high*d[s[i-10]])*10 + d[c]\\n sign = num % PRIME_NUM\\n sign_d[sign].append(i-9)\\n \\n # print(sign_d)\\n\\n res = set()\\n for idx_list in sign_d.values():\\n if len(idx_list) == 1:\\n continue\\n count = collections.Counter()\\n for i in idx_list:\\n word = s[i:i+10]\\n count[word] += 1\\n for word, c in count.items():\\n if c > 1:\\n res.add(word)\\n return list(res)\\n # return []\\n\",\n \"memory\": \"20800\"\n },\n {\n \"code\": \"\\nimport collections\\n\\n# https://www.math.utah.edu/~pa/MDS/primes.html\\nPRIME_NUM = 997 #2147483647\\n\\nclass Solution:\\n\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n size = len(s)\\n if size < 11:\\n return []\\n # b0, b1, b10, b11 \\n d = {\\n 'A': 1,\\n 'C': 2,\\n 'G': 3,\\n 'T': 4\\n }\\n MULTI = 4 #10\\n # ACG = 1*10^2 + 2*10 + 3 = 123\\n num = 0\\n for i in range(10): # first 10 letters\\n c = s[i]\\n num = num * MULTI + d[c]\\n sign = num % PRIME_NUM\\n high = MULTI**9\\n sign_d = collections.defaultdict(list)\\n # print(sign)\\n # sign_list = [0 for _ in range(size-10)]\\n sign_d[sign] = [0]\\n for i in range(10, size):\\n c = s[i]\\n num = (num - high*d[s[i-10]]) * MULTI + d[c]\\n sign = num % PRIME_NUM\\n sign_d[sign].append(i-9)\\n\\n res = set()\\n for idx_list in sign_d.values():\\n if len(idx_list) == 1:\\n continue\\n count = collections.Counter()\\n for i in idx_list:\\n word = s[i:i+10]\\n count[word] += 1\\n for word, c in count.items():\\n if c > 1:\\n res.add(word)\\n return list(res)\\n\",\n \"memory\": \"20800\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n return [] if len(s) <=10 else set([el for index, el in enumerate([s[index:index + 10] for index in range(len(s) - 10 + 1)]) if s[index + 1:].count(el) >= 1])\",\n \"memory\": \"23700\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n hmap = {'A': 0, 'G': 1, 'C': 2, 'T': 3}\\n\\n if len(s) < 10:\\n return []\\n\\n hash1 = 0\\n\\n for i in range(len(s)):\\n hash1 += hmap[s[i]]\\n\\n rst = {}\\n\\n rst[hash1] = [s[0:10]]\\n\\n res = set()\\n\\n\\n for i in range(1, len(s) - 10 + 1):\\n hash1 -= hmap[s[i - 1]]\\n hash1 += hmap[s[i + 9]]\\n if hash1 in rst and s[i: i + 10] in rst[hash1]:\\n res.add(s[i: i + 10])\\n else:\\n if hash1 not in rst:\\n rst[hash1] = []\\n rst[hash1].append(s[i: i + 10])\\n\\n return list(res)\\n \\n\\n\\n\\n \",\n \"memory\": \"24000\"\n },\n {\n \"code\": \"class Solution:\\n L = 10;\\n\\n def getDigit(self, nucleotide):\\n if nucleotide == 'A':\\n return 0;\\n elif nucleotide == 'C':\\n return 1;\\n elif nucleotide == 'G':\\n return 2;\\n else:\\n return 3;\\n\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seen = set();\\n left, right = 0, 0;\\n duplicates = set();\\n res = set();\\n window = 0;\\n R = 4;\\n L = 10;\\n RL = pow(R,(L-1));\\n\\n while right < len(s):\\n c = self.getDigit(s[right]);\\n window = window * R + c;\\n print(\\\"window\\\", window, window * RL)\\n right += 1;\\n\\n if right - left == self.L:\\n d = self.getDigit(s[left]);\\n if window in seen:\\n res.add(s[left:right]);\\n seen.add(window);\\n window = window - RL*d;\\n left += 1;\\n\\n return list(res);\\n\\n \",\n \"memory\": \"26100\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) <= 10:\\n return []\\n v = {\\n \\\"A\\\": 0,\\n \\\"C\\\": 1,\\n \\\"G\\\": 2,\\n \\\"T\\\": 3\\n }\\n out = set()\\n index = 1\\n seen = set()\\n total = 0\\n for i in range(10):\\n total += v[s[i]]*(4**i)\\n seen.add(total)\\n while index + 9 < len(s):\\n total -= v[s[index-1]]\\n total = total // 4\\n total += v[s[index+9]]*(4**9)\\n if total in seen:\\n out.add(s[index:index+10])\\n seen.add(total)\\n index += 1\\n return list(out)\",\n \"memory\": \"26200\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) <= 10:\\n return []\\n v = {\\n \\\"A\\\": 0,\\n \\\"C\\\": 1,\\n \\\"G\\\": 2,\\n \\\"T\\\": 3\\n }\\n out = set()\\n index = 1\\n seen = set()\\n total = 0\\n for i in range(10):\\n total += v[s[i]]*(4**i)\\n seen.add(total)\\n while index + 9 < len(s):\\n total -= v[s[index-1]]\\n total = total // 4\\n total += v[s[index+9]]*(4**9)\\n if total in seen:\\n out.add(s[index:index+10])\\n seen.add(total)\\n index += 1\\n return list(out)\",\n \"memory\": \"26200\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) <= 10: return []\\n \\n seen = set()\\n ans = set()\\n\\n d = {'A' : 0, 'C' : 1, 'T' : 2, 'G' : 3}\\n d2 = {0 : 'A', 1: 'C', 2: 'T', 3: 'G'}\\n\\n def decode(num: int):\\n ans = ''\\n for i in range(10):\\n ans = d2[num & 3] + ans\\n num = num >> 2\\n return ans\\n\\n curr = 0\\n for i in range(10): curr = curr << 2 | d[s[i]]\\n\\n seen.add(curr)\\n for i in range(10, len(s)):\\n curr = (curr << 2 | d[s[i]]) & ((1 << 20) - 1)\\n if curr in seen: ans.add(curr)\\n seen.add(curr)\\n\\n return [decode(a) for a in ans]\",\n \"memory\": \"26300\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n pows=[7**(i+1) for i in range(10)]\\n d={'A':1,'C':2,'G':3,'T':4}\\n def hash(val,toadd,toremove): return (val-(d[toremove]*pows[9]))*7+d[toadd]*7\\n ans=set()\\n curr=sum([d[x]*(7**(10-i)) for i,x in enumerate(s[:10])])\\n z=set([curr])\\n for i in range(10,len(s)):\\n curr=hash(curr,s[i],s[i-10])\\n if curr in z: ans.add(s[i-9:i+1])\\n z.add(curr)\\n return ans\",\n \"memory\": \"26400\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n pows=[7**(i+1) for i in range(10)]\\n d={'A':1,'C':2,'G':3,'T':4}\\n def hash(val,toadd,toremove): return (val-(d[toremove]*pows[9]))*7+d[toadd]*7\\n ans=set()\\n curr=sum([d[x]*(7**(10-i)) for i,x in enumerate(s[:10])])\\n z=set([curr])\\n for i in range(10,len(s)):\\n curr=hash(curr,s[i],s[i-10])\\n if curr in z: ans.add(s[i-9:i+1])\\n z.add(curr)\\n return ans\",\n \"memory\": \"26500\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n pows=[7**(i+1) for i in range(10)]\\n d={'A':1,'C':2,'G':3,'T':4}\\n def hash(val,toadd,toremove): return (val-(d[toremove]*pows[9]))*7+d[toadd]*7\\n ans=set()\\n curr=sum([d[x]*(7**(10-i)) for i,x in enumerate(s[:10])])\\n z=set([curr])\\n for i in range(10,len(s)):\\n curr=hash(curr,s[i],s[i-10])\\n if curr in z: ans.add(s[i-9:i+1])\\n z.add(curr)\\n return ans\",\n \"memory\": \"26600\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n pows=[7**(i+1) for i in range(10)]\\n d={'A':1,'C':2,'G':3,'T':4}\\n def hash(val,toadd,toremove): return (val-(d[toremove]*pows[9]))*7+d[toadd]*7\\n ans=set()\\n curr=sum([d[x]*(7**(10-i)) for i,x in enumerate(s[:10])])\\n z=set([curr])\\n for i in range(10,len(s)):\\n curr=hash(curr,s[i],s[i-10])\\n if curr in z: ans.add(s[i-9:i+1])\\n z.add(curr)\\n return ans\",\n \"memory\": \"26600\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n L = 10\\n n = len(s)\\n \\n a = 4\\n aL = pow(a, L)\\n\\n to_int = {\\\"A\\\": 0, \\\"C\\\":1, \\\"G\\\":2, \\\"T\\\":3}\\n nums = [to_int.get(ch) for ch in s]\\n\\n seen = set()\\n output = set()\\n\\n h=0\\n for start in range(len(s)-L+1):\\n if start != 0:\\n h = h*a - nums[start-1]*aL + nums[start+L-1]\\n else:\\n for i in range(L):\\n h = h*a+nums[i]\\n if h in seen:\\n output.add(s[start:start+L])\\n seen.add(h)\\n\\n return output\",\n \"memory\": \"26700\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n base=4\\n mapping={'A':1, 'C':2, 'G':3, 'T':4}\\n max_coeff=pow(base,9)\\n nums=[]\\n n=len(s)\\n for i in range(0,n,1):\\n nums.append(mapping[s[i]])\\n seen=set()\\n ans=set()\\n hashing=0\\n start=0\\n while start<n-9:\\n if start!=0:\\n hashing-=(nums[start-1]*max_coeff)\\n hashing*=base\\n hashing+=nums[start+9]\\n else:\\n for i in range(0,10,1):\\n hashing=hashing*base+nums[i]\\n if hashing in seen:\\n ans.add(s[start:start+10])\\n seen.add(hashing)\\n start+=1\\n return ans\",\n \"memory\": \"26800\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n L = 10\\n a = 4\\n aL = pow(a,L)\\n n = len(s)\\n if n<=L:\\n return []\\n res = set()\\n seen = set()\\n to_int = {'A':0, 'C':1, 'G':2, \\\"T\\\":3}\\n\\n nums = [to_int.get(s[i]) for i in range(n)]\\n h = 0\\n for start in range(n-L+1):\\n if start==0:\\n for i in range(L):\\n h = h*a + nums[i]\\n else:\\n h = h*a - nums[start-1]*aL + nums[start+L-1]\\n if h in seen:\\n res.add(s[start:start+L])\\n seen.add(h)\\n return res\\n\\n \\n \\n \\n \\n \\n # sequence_count = {}\\n # res = []\\n\\n # for i in range(len(s) - 9): # Sliding window of length 10\\n # seq = s[i:i+10]\\n # if seq in sequence_count:\\n # sequence_count[seq] += 1\\n # else:\\n # sequence_count[seq] = 1\\n\\n # if sequence_count[seq] == 2: # Add to result if it's seen twice\\n # res.append(seq)\\n\\n # return res\\n \\n \\n \\n # seen = {}\\n # res = []\\n # for i in range(len(s)-9):\\n # seq = s[i:i+10]\\n # seen[seq] = seen.get(seq,0)+1\\n # if seen[seq]==2:\\n # res.append(seq)\\n # return res\\n \\n \",\n \"memory\": \"26900\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n L = 10\\n a = 4\\n aL = pow(a,L)\\n n = len(s)\\n if n<=L:\\n return []\\n res = set()\\n seen = set()\\n to_int = {'A':0, 'C':1, 'G':2, \\\"T\\\":3}\\n\\n nums = [to_int.get(j) for j in s]\\n h = 0\\n for start in range(n-L+1):\\n if start==0:\\n for i in range(L):\\n h = h*a + nums[i]\\n else:\\n h = h*a - nums[start-1]*aL + nums[start+L-1]\\n if h in seen:\\n res.add(s[start:start+L])\\n seen.add(h)\\n return res\\n\\n \\n \\n \\n \\n \\n # sequence_count = {}\\n # res = []\\n\\n # for i in range(len(s) - 9): # Sliding window of length 10\\n # seq = s[i:i+10]\\n # if seq in sequence_count:\\n # sequence_count[seq] += 1\\n # else:\\n # sequence_count[seq] = 1\\n\\n # if sequence_count[seq] == 2: # Add to result if it's seen twice\\n # res.append(seq)\\n\\n # return res\\n \\n \\n \\n # seen = {}\\n # res = []\\n # for i in range(len(s)-9):\\n # seq = s[i:i+10]\\n # seen[seq] = seen.get(seq,0)+1\\n # if seen[seq]==2:\\n # res.append(seq)\\n # return res\\n \\n \",\n \"memory\": \"26900\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n n = len(s)\\n nums = [0] * n\\n for i in range(n):\\n if s[i] == 'A':\\n nums[i] = 0\\n elif s[i] == 'C':\\n nums[i] = 1\\n elif s[i] == 'G':\\n nums[i] = 2\\n else:\\n nums[i] = 3\\n left, right, windowHash = 0, 0, 0\\n res, seen = set(), set()\\n R = 4\\n L = 10\\n RL = 4**(L-1)\\n\\n while right < n:\\n windowHash = windowHash * R + nums[right]\\n right += 1\\n if right - left == L:\\n if windowHash in seen:\\n res.add(s[left:right])\\n else:\\n seen.add(windowHash)\\n windowHash -= nums[left] * RL\\n left += 1\\n \\n return list(res)\",\n \"memory\": \"27000\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s)<10:\\n return []\\n value_hash_set=set()\\n added=set()\\n frame_hash_value=0\\n output=[]\\n offset=64\\n weight=0\\n \\n alphabet_size=3337838838353557843\\n prime=4316047271\\n \\n \\n for index in range(9,-1,-1):\\n \\n new_value=(((alphabet_size)**(weight))*((ord(s[index])-offset)))%prime\\n \\n frame_hash_value=(frame_hash_value+new_value)%prime\\n \\n weight=weight+1\\n value_hash_set.add(frame_hash_value)\\n \\n for index in range(10,len(s)):\\n to_remove_value=(((alphabet_size)**(9))*((ord(s[index-10])-offset)))%prime\\n \\n frame_hash_value=frame_hash_value-to_remove_value\\n \\n frame_hash_value=(frame_hash_value*alphabet_size)%prime\\n \\n to_add_value=(ord(s[index])-offset)\\n \\n frame_hash_value=(frame_hash_value+to_add_value)%prime\\n \\n if frame_hash_value in value_hash_set:\\n \\n if frame_hash_value not in added:\\n output.append(s[index-9:index+1])\\n \\n \\n added.add(frame_hash_value)\\n value_hash_set.add(frame_hash_value)\\n\\n return output\\n \",\n \"memory\": \"27100\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s)<10:\\n return []\\n value_hash_set=set()\\n added=set()\\n frame_hash_value=0\\n output=[]\\n offset=64\\n weight=0\\n #alphabet_size=10000000\\n #prime=44159\\n alphabet_size=3337838838353\\n prime=431604727\\n alphabet_size=3337838838353557843\\n prime=4316047271\\n \\n \\n \\n #print(len(s))\\n \\n for index in range(9,-1,-1):\\n \\n new_value=(((alphabet_size)**(weight))*((ord(s[index])-offset)))%prime\\n \\n frame_hash_value=(frame_hash_value+new_value)%prime\\n #print(new_value,\\\"new_value\\\",frame_hash_value,\\\"new_frame_hash_value\\\")\\n weight=weight+1\\n value_hash_set.add(frame_hash_value)\\n #print(frame_hash_value,\\\"frame_hash_value\\\")\\n for index in range(10,len(s)):\\n to_remove_value=(((alphabet_size)**(9))*((ord(s[index-10])-offset)))%prime\\n #print(to_remove_value,\\\"to_remove_value\\\")\\n frame_hash_value=frame_hash_value-to_remove_value\\n #print(frame_hash_value,\\\"after_removed\\\")\\n frame_hash_value=(frame_hash_value*alphabet_size)%prime\\n \\n to_add_value=(ord(s[index])-offset)\\n #print(to_add_value,\\\"to_add_value\\\")\\n frame_hash_value=(frame_hash_value+to_add_value)%prime\\n #print(frame_hash_value,\\\"frame_hash_value_after_added\\\")\\n if frame_hash_value in value_hash_set:\\n \\n if frame_hash_value not in added:\\n output.append(s[index-9:index+1])\\n \\n \\n added.add(frame_hash_value)\\n value_hash_set.add(frame_hash_value)\\n\\n return output\\n \",\n \"memory\": \"27200\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n hashmap={'A':1,'C':2,'G':3,'T':4}\\n #print(hashmap)\\n setstore=set()\\n setresult=set()\\n result=[]\\n substr=0\\n for i,val in enumerate(s):\\n #print(hashmap[val])\\n if i<9:\\n substr=substr*10+hashmap[val]\\n elif i==9:\\n substr=substr*10+hashmap[val]\\n setstore.add(substr)\\n elif i>9:\\n substr=mod(substr,pow(10,9))\\n substr=substr*10+hashmap[val]\\n #print(substr)\\n if substr in setstore:\\n #print('presnt in store')\\n if substr not in setresult:\\n setresult.add(substr)\\n result.append(s[i-9:i+1])\\n else:\\n setstore.add(substr)\\n #print(setresult,setstore)\\n return result\\n \",\n \"memory\": \"27300\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n # using rolling hash approach of Rabin Karp Algo\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n mappings = {\\n 'A': 1, 'C': 2, 'G': 3, 'T': 4\\n }\\n\\n n = len(s)\\n m = 9\\n if n <= m:\\n return []\\n \\n tHash = 0\\n seen = defaultdict(int)\\n for i in range(0, m+1):\\n tHash = tHash * 4 + mappings[s[i]]\\n seen[tHash] = 1\\n\\n result = []\\n for i in range(1, n - m):\\n # - remove the leftmost character from the hash value\\n # - shift remaining hash value left by 1 (multiply by 4 as we using base 4)\\n # - add the new rightmost character\\n # \\n # using 4^9 because we have 10 characters, and the leftmost is at\\n # the 10th position (count from 0)\\n tHash = (tHash - (4 ** m) * mappings[s[i-1]]) * 4 + mappings[s[i + m]]\\n # print(tHash, s[i:i + m + 1])\\n\\n seen[tHash] += 1\\n if seen[tHash] == 2:\\n # print(tHash, s[i:i + m + 1])\\n result.append(s[i:i + m + 1])\\n\\n return result\\n\",\n \"memory\": \"27400\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n mp = {'A': 0, 'C': 1, 'G': 2, 'T': 3}\\n cnt = defaultdict(int)\\n cur = 0\\n ret = []\\n for i in range(0, len(s)):\\n cur = (cur << 2) + mp[s[i]]\\n if i >= 9:\\n cur &= (1 << 20) - 1\\n if cnt[cur] == 1:\\n ret.append(s[i-9:i+1])\\n cnt[cur] += 1\\n return ret\",\n \"memory\": \"27500\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def encode(self, ch):\\n if ch == 'A':\\n return 0\\n if ch == 'C':\\n return 1\\n if ch == 'G':\\n return 2\\n return 3\\n\\n def decode(self, num):\\n if num == 0:\\n return 'A'\\n if num == 1:\\n return 'C'\\n if num == 2:\\n return 'G'\\n return 'T'\\n \\n def decodeSeq(self, encSeq):\\n seq = \\\"\\\"\\n for i in range(10):\\n seq = self.decode(encSeq % 4) + seq\\n encSeq >>= 2\\n return seq\\n\\n def convertSeq(self, seq):\\n enc = 0\\n i = 18\\n for s in seq:\\n enc |= (self.encode(s) << i)\\n i -= 2\\n return enc\\n \\n def addToSeq(self, seq, ch):\\n return (((1<<20)-1) & (seq << 2)) | self.encode(ch)\\n\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n encMap = defaultdict(int)\\n seq = self.convertSeq(s[:10])\\n encMap[seq] += 1\\n repeated = set()\\n\\n for i in range(10, len(s)):\\n seq = self.addToSeq(seq, s[i])\\n if encMap[seq] > 0:\\n repeated.add(seq)\\n encMap[seq] += 1\\n\\n return [self.decodeSeq(encSeq) for encSeq in repeated]\\n \",\n \"memory\": \"27600\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n n=len(s)\\n d={}\\n for i in range(n-9):\\n ss=s[i:i+10]\\n if ss not in d:\\n d[ss]=1\\n else:\\n d[ss]+=1 \\n \\n return [ss for ss in d.keys() if d[ss]>1]\\n \",\n \"memory\": \"27700\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n \\n store = collections.defaultdict(int)\\n for i in range(len(s)-10+1):\\n store[s[i:i+10]] += 1\\n \\n res = []\\n for k, v in store.items():\\n if v > 1:\\n res.append(k)\\n \\n return res\\n\",\n \"memory\": \"27800\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n \\n store = collections.defaultdict(int)\\n res = []\\n for i in range(len(s)-10+1):\\n \\n ss = s[i:i+10]\\n if ss in store:\\n if ss not in res:\\n res.append(ss)\\n else:\\n store[ss] += 1\\n \\n return res\\n\",\n \"memory\": \"27800\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n n=len(s)\\n d={}\\n for i in range(n-9):\\n ss=s[i:i+10]\\n if ss not in d:\\n d[ss]=1\\n else:\\n d[ss]+=1 \\n \\n return [ss for ss in d.keys() if d[ss]>1]\\n \",\n \"memory\": \"27900\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n\\n # var 2 dict+list:\\n subs_map = {}\\n w = 10\\n res = []\\n \\n for i in range(len(s) - w + 1):\\n subs = s[i:i+w]\\n if subs in subs_map:\\n if subs_map[subs] == 1:\\n res.append(subs)\\n else:\\n subs_map[subs] = 0\\n\\n subs_map[subs] += 1\\n \\n return res\\n\\n\\n # # var 1 two sets:\\n # start = 0\\n # window = 10\\n # end = window\\n # subset = set()\\n # res = set()\\n\\n # while end <= len(s)+1:\\n # subs = s[start:end]\\n # if not subs in subset:\\n # subset.add(subs) \\n # else:\\n # res.add(subs)\\n\\n # start += 1\\n # end = start + window\\n\\n # return list(res)\",\n \"memory\": \"27900\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seen_combinations = {}\\n results = []\\n for combination in iter_combinations(s, 10):\\n if combination in seen_combinations:\\n if seen_combinations[combination] == 1:\\n results.append(combination)\\n seen_combinations[combination] += 1\\n else:\\n seen_combinations[combination] = 1\\n return results\\n\\n \\ndef iter_combinations(s: str, size: int):\\n curr_idx = 0\\n while curr_idx + size - 1 < len(s):\\n combination = s[curr_idx : curr_idx + size]\\n yield combination\\n curr_idx += 1\",\n \"memory\": \"28000\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n # return a list of all the 10-letter-long sequences that occur more than once\\n n = len(s)\\n count = defaultdict(int)\\n ans = []\\n\\n for i in range(n-9):\\n dna = s[i : i+10]\\n print(dna)\\n count[dna] += 1\\n if count[dna] == 2:\\n ans.append(dna)\\n\\n return ans\\n\\n \",\n \"memory\": \"28000\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) < 10:\\n return [] # No possible substrings of length 10\\n\\n unique_strings = {}\\n common_strings = []\\n\\n # Iterate through all starting indices for substrings of length 10\\n for i in range(len(s) - 9):\\n substring = s[i:i + 10] # Extract substring of length 10\\n\\n if substring in unique_strings:\\n unique_strings[substring] += 1\\n else:\\n unique_strings[substring] = 1\\n\\n # Add to result only if this is the second time we see this substring\\n if unique_strings[substring] == 2:\\n common_strings.append(substring)\\n\\n return common_strings\\n\",\n \"memory\": \"28100\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if not s:\\n return []\\n possible = {}\\n res = []\\n for i in range(len(s)-9):\\n sub = s[i:i+10]\\n print(f\\\"{i}-{sub}: {possible.get(sub)}\\\")\\n if possible.get(sub) and sub not in res:\\n res.append(sub)\\n else:\\n possible[sub] = True\\n return res\\n\\n\\n\",\n \"memory\": \"28200\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n sequenceLength = 10\\n\\n # this part is not really needed actually.\\n if len(s) < sequenceLength:\\n return []\\n \\n res, seen = set(), set()\\n for i in range(len(s) - sequenceLength + 1):\\n seq = s[i: i + sequenceLength]\\n if seq in seen:\\n res.add(seq)\\n else:\\n seen.add(seq)\\n \\n return list(res)\",\n \"memory\": \"28300\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seen, res = set(), set()\\n for l in range(len(s) - 9):\\n curr = s[l: l + 10]\\n if curr in seen:\\n res.add(curr)\\n else:\\n seen.add(curr)\\n return list(res)\\n \",\n \"memory\": \"28300\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n start = 0\\n window = 10\\n end = window\\n subset = set()\\n res = set()\\n\\n while end <= len(s)+1:\\n subs = s[start:end]\\n if not subs in subset:\\n subset.add(subs) \\n else:\\n res.add(subs)\\n\\n start += 1\\n end = start + window\\n\\n return list(res)\",\n \"memory\": \"28400\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n #iterate through array\\n # at every idx splice the array from [curr:curr+10] (?)\\n # check if we have seen it before\\n # if not add it to seen, if yes add it to res\\n\\n res = set()\\n seen = set()\\n print(len(s))\\n for i in range(len(s)-9):\\n print(i)\\n sequence = s[i:i+10]\\n if sequence in seen:\\n res.add(sequence)\\n else:\\n seen.add(sequence)\\n \\n return list(res)\",\n \"memory\": \"28400\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n occ=set()\\n l=0\\n res=set()\\n for l in range(len(s)-9):\\n if s[l:l+10] in occ:\\n #if s[l:l+10] not in res:\\n res.add(s[l:l+10])\\n occ.add(s[l:l+10])\\n \\n return list(res)\\n\\n\\n\",\n \"memory\": \"28500\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) < 10:\\n return []\\n \\n seen = set()\\n repeated = set()\\n \\n for i in range(len(s) - 9):\\n substring = s[i:i + 10]\\n if substring in seen:\\n repeated.add(substring)\\n else:\\n seen.add(substring)\\n \\n return list(repeated)\\n\",\n \"memory\": \"28500\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seen = set()\\n repeated = set()\\n \\n # Iterate through the string with a window size of 10\\n for i in range(len(s) - 9):\\n # Extract the 10-letter sequence\\n sequence = s[i:i + 10]\\n \\n # Check if this sequence has been seen before\\n if sequence in seen:\\n repeated.add(sequence)\\n else:\\n seen.add(sequence)\\n \\n return list(repeated)\\n\",\n \"memory\": \"28600\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n \\n return_arr = []\\n\\n window = deque(maxlen=10)\\n\\n repeated_set = set()\\n seen_set = set()\\n\\n for i in range(0, len(s)):\\n\\n window.append(s[i])\\n\\n if len(window)==10:\\n temp_str = ''.join(window)\\n\\n if temp_str in seen_set:\\n repeated_set.add(temp_str)\\n else:\\n seen_set.add(temp_str)\\n return list(repeated_set)\",\n \"memory\": \"28600\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n seen, res = set(), set()\\n for i in range(len(s)-9):\\n cur = s[i:i+10]\\n if cur in seen:\\n res.add(cur)\\n seen.add(cur)\\n return list(res)\\n\\n \",\n \"memory\": \"28700\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n vals = set()\\n result = set()\\n\\n for i in range(len(s)-9): \\n substr = s[i:i+10]\\n if substr in vals:\\n result.add(substr)\\n else:\\n vals.add(substr)\\n\\n return result\\n\\n\",\n \"memory\": \"28700\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n occ=set()\\n l=0\\n res=set()\\n for l in range(len(s)-9):\\n if s[l:l+10] in occ:\\n if s[l:l+10] not in res:\\n res.add(s[l:l+10])\\n occ.add(s[l:l+10])\\n \\n return res\\n\\n\\n\",\n \"memory\": \"28800\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> list[str]:\\n ans = set()\\n seen = set()\\n\\n for i in range(len(s) - 9):\\n seq = s[i:i + 10]\\n if seq in seen:\\n ans.add(seq)\\n seen.add(seq)\\n\\n return list(ans)\",\n \"memory\": \"28800\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n already_seen_ws, result_list = set(), set()\\n\\n for i in range(len(s)-9):\\n current_window = s[i:i+10]\\n if current_window in already_seen_ws:\\n result_list.add(current_window)\\n already_seen_ws.add(current_window)\\n\\n return list(result_list)\\n\\n \",\n \"memory\": \"28900\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) <= 10:\\n return []\\n counts = Counter()\\n mp = {'A': 1, 'C': 2, 'T': 3, 'G': 4}\\n rmp = ['', 'A', 'C', 'T', 'G']\\n num = 0\\n for i in range(10):\\n num *= 10\\n num += mp[s[i]]\\n counts[num] += 1\\n for i in range(10, len(s)):\\n num = (num % int(1E9)) * 10 + mp[s[i]]\\n counts[num] += 1\\n return [\\\"\\\".join([rmp[int(i)] for i in str(k)]) for k in counts if counts[k] > 1]\",\n \"memory\": \"29000\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) <= 10:\\n return []\\n counts = Counter()\\n mp = {'A': 1, 'C': 2, 'T': 3, 'G': 4}\\n rmp = ['', 'A', 'C', 'T', 'G']\\n num = 0\\n for i in range(10):\\n num *= 10\\n num += mp[s[i]]\\n counts[num] += 1\\n for i in range(10, len(s)):\\n num = (num % int(1E9)) * 10 + mp[s[i]]\\n counts[num] += 1\\n # for i in range(len(s)-9):\\n # counts[s[i:i+10]] += 1\\n # print(counts)\\n return [\\\"\\\".join([rmp[int(i)] for i in str(k)]) for k in counts if counts[k] > 1]\",\n \"memory\": \"29100\"\n },\n {\n \"code\": \"#!/usr/bin/python3\\n\\nimport random\\n\\nfrom collections import Counter\\n\\nclass WindowHash:\\n def __init__(self, window, modulus = 0, element = 0):\\n self.window = window\\n self.count = 0\\n\\n if modulus == 0:\\n modulus = (2**61) - 1\\n self.modulus = modulus\\n\\n if element == 0:\\n element = random.randint(2, modulus)\\n self.element = element\\n\\n self.shift_factor = pow(element, window - 1, modulus)\\n\\n self.hash = 0\\n \\n def Slide(self, outchar, incoming):\\n self.count += 1\\n if self.count > self.window:\\n self.hash = (self.hash -\\n (ord(outchar) * self.shift_factor)) % self.modulus\\n\\n self.hash = (self.hash * self.element\\n + ord(incoming)) % self.modulus\\n\\n return self.hash\\n\\n def Initialize(self, prefix):\\n for ch in prefix:\\n self.Slide(None, ch)\\n\\n return self.hash\\n \\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) < 11:\\n return []\\n\\n window = 10\\n W = WindowHash(10)\\n\\n N = len(s)\\n history = Counter()\\n\\n history[ W.Initialize(s[:10]) ] = 1\\n\\n dups = []\\n\\n for i in range(10, N):\\n H = W.Slide(s[i - 10], s[i])\\n if history[H] == 1:\\n dups.append(s[i - 9:i + 1])\\n history[H] += 1\\n \\n return dups\\n\",\n \"memory\": \"29200\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) < 10:\\n return []\\n\\n res = set()\\n uniques = set()\\n s_list = list(s)\\n\\n l = 0\\n for r in range(len(s_list)):\\n if r >= 9:\\n substr = \\\"\\\".join(s_list[l: r + 1])\\n if substr in uniques:\\n res.add(substr)\\n uniques.add(substr)\\n l += 1\\n \\n return list(res)\\n\\n'''\\nUnderstanding:\\nRephrase: Find repeating substrings of length 10.\\n\\nQuestions:\\n-> What are the parameters of the string's length? Can it be empty or < 10?\\n -> Not empty. [1, 10^5]\\n-> What characters can the string hold? \\n -> 'A', 'C', 'G', 'T'\\n-> Are there complexity constraints?\\n -> Unsure. O(N) Time, O(N) space\\n\\nEdge Case: Strings of length 1-9. Don't meet parameters\\n\\nMatch: \\nSet() for unique strings of length 10\\nSliding Window \\nReturn array\\nConvert array to list\\n\\nPlan:\\n# Edge Case:\\nif len(s) < 10:\\n return []\\n\\nres = []\\nuniques = set()\\ns_list = list(s)\\n\\nl = 0\\nfor r in range(len(s_list)):\\n if r >= 9:\\n substr = s_list[l: r + 1]\\n if substr in uniques:\\n res.append(str(substr))\\n uniques.add(substr)\\n l += 1\\n \\nreturn res\\n'''\",\n \"memory\": \"29300\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) < 10:\\n return []\\n\\n res = set()\\n uniques = set()\\n s_list = list(s)\\n\\n l = 0\\n for r in range(len(s_list)):\\n if r >= 9:\\n substr = \\\"\\\".join(s_list[l: r + 1])\\n if substr in uniques:\\n res.add(substr)\\n uniques.add(substr)\\n l += 1\\n \\n return list(res)\\n\\n'''\\nUnderstanding:\\nRephrase: Find repeating substrings of length 10.\\n\\nQuestions:\\n-> What are the parameters of the string's length? Can it be empty or < 10?\\n -> Not empty. [1, 10^5]\\n-> What characters can the string hold? \\n -> 'A', 'C', 'G', 'T'\\n-> Are there complexity constraints?\\n -> Unsure. O(N) Time, O(N) space\\n\\nEdge Case: Strings of length 1-9. Don't meet parameters\\n\\nMatch: \\nSet() for unique strings of length 10\\nSliding Window \\nReturn array\\nConvert array to list\\n\\nPlan:\\n# Edge Case:\\nif len(s) < 10:\\n return []\\n\\nres = []\\nuniques = set()\\ns_list = list(s)\\n\\nl = 0\\nfor r in range(len(s_list)):\\n if r >= 9:\\n substr = s_list[l: r + 1]\\n if substr in uniques:\\n res.append(str(substr))\\n uniques.add(substr)\\n l += 1\\n \\nreturn res\\n'''\",\n \"memory\": \"29300\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n if len(s) < 10:\\n return []\\n\\n res = set()\\n uniques = set()\\n s_list = list(s)\\n\\n l = 0\\n for r in range(len(s_list)):\\n if r >= 9:\\n substr = \\\"\\\".join(s_list[l: r + 1])\\n if substr in uniques:\\n res.add(substr)\\n uniques.add(substr)\\n l += 1\\n \\n return list(res)\\n\\n'''\\nUnderstanding:\\nRephrase: Find repeating substrings of length 10.\\n\\nQuestions:\\n-> What are the parameters of the string's length? Can it be empty or < 10?\\n -> Not empty. [1, 10^5]\\n-> What characters can the string hold? \\n -> 'A', 'C', 'G', 'T'\\n-> Are there complexity constraints?\\n -> Unsure. O(N) Time, O(N) space\\n\\nEdge Case: Strings of length 1-9. Don't meet parameters\\n\\nMatch: \\nSet() for unique strings of length 10\\nSliding Window \\nReturn array\\nConvert array to list\\n\\nPlan:\\n# Edge Case:\\nif len(s) < 10:\\n return []\\n\\nres = []\\nuniques = set()\\ns_list = list(s)\\n\\nl = 0\\nfor r in range(len(s_list)):\\n if r >= 9:\\n substr = s_list[l: r + 1]\\n if substr in uniques:\\n res.append(str(substr))\\n uniques.add(substr)\\n l += 1\\n \\nreturn res\\n'''\",\n \"memory\": \"29400\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n sequences: set[str] = set()\\n sequences2: set[str] = set()\\n\\n for i, l in enumerate(list(s)):\\n if len(s) - i < 10:\\n break\\n t = s[i : (i + 10)]\\n if t in sequences:\\n sequences2.add(t)\\n else:\\n sequences.add(t)\\n return list(sequences2)\",\n \"memory\": \"29500\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n sequences: set[str] = set()\\n sequences2: set[str] = set()\\n\\n for i, l in enumerate(list(s)):\\n if len(s) - i < 10:\\n break\\n t = s[i : (i + 10)]\\n if t in sequences:\\n sequences2.add(t)\\n else:\\n sequences.add(t)\\n return list(sequences2)\",\n \"memory\": \"29500\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n sequence = s[:10]\\n sequences = [sequence]\\n for char in s[10:]:\\n sequence += char\\n sequence = sequence[1:]\\n sequences.append(sequence)\\n\\n counts = Counter(sequences)\\n dupids = set([sequence for sequence in sequences if counts[sequence] > 1])\\n return dupids\\n\\n \",\n \"memory\": \"29600\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n sequence = s[:10]\\n sequences = [sequence]\\n for char in s[10:]:\\n sequence += char\\n sequence = sequence[1:]\\n sequences.append(sequence)\\n\\n counts = Counter(sequences)\\n dupids = set([sequence for sequence in sequences if counts[sequence] > 1])\\n return dupids\\n\\n \",\n \"memory\": \"29600\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n\\n counts = Counter([s[i:i+10] for i in range(len(s)-9)])\\n return [k for k,v in counts.items() if v>1]\\n \",\n \"memory\": \"29700\"\n },\n {\n \"code\": \"class Solution:\\n def findRepeatedDnaSequences(self, s: str) -> List[str]:\\n\\n window_len = 10\\n\\n windows = []\\n for start_idx in range(0, len(s)-9):\\n windows.append(s[start_idx:start_idx+window_len])\\n \\n counts = Counter(windows)\\n repeats = [window for window in windows if counts[window] > 1]\\n\\n return list(set(repeats))\\n\\n\\n \",\n \"memory\": \"29800\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":65,"string":"65"}}},{"rowIdx":174,"cells":{"question_id":{"kind":"number","value":188,"string":"188"},"name":{"kind":"string","value":"best-time-to-buy-and-sell-stock-iv"},"content":{"kind":"string","value":"<p>You are given an integer array <code>prices</code> where <code>prices[i]</code> is the price of a given stock on the <code>i<sup>th</sup></code> day, and an integer <code>k</code>.</p>\n\n<p>Find the maximum profit you can achieve. You may complete at most <code>k</code> transactions: i.e. you may buy at most <code>k</code> times and sell at most <code>k</code> times.</p>\n\n<p><strong>Note:</strong> You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> k = 2, prices = [2,4,1]\n<strong>Output:</strong> 2\n<strong>Explanation:</strong> Buy on day 1 (price = 2) and sell on day 2 (price = 4), profit = 4-2 = 2.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> k = 2, prices = [3,2,6,5,0,3]\n<strong>Output:</strong> 7\n<strong>Explanation:</strong> Buy on day 2 (price = 2) and sell on day 3 (price = 6), profit = 6-2 = 4. Then buy on day 5 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= k <= 100</code></li>\n\t<li><code>1 <= prices.length <= 1000</code></li>\n\t<li><code>0 <= prices[i] <= 1000</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":44.53459379281492,"string":"44.534594"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["array","dynamic-programming"],"string":"[\n \"array\",\n \"dynamic-programming\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"28\", 0.109], [\"32\", 0.109], [\"36\", 0.19619999999999999], [\"40\", 0.3488], [\"44\", 0.43600000000000005], [\"48\", 0.37060000000000004], [\"52\", 0.6104], [\"56\", 0.30519999999999997], [\"60\", 0.2616], [\"63\", 0.3052], [\"67\", 0.37060000000000004], [\"71\", 0.7629000000000001], [\"75\", 1.9398], [\"79\", 3.7926], [\"83\", 5.8196], [\"87\", 7.5632], [\"91\", 7.0184], [\"95\", 4.0104999999999995], [\"98\", 4.053999999999999], [\"102\", 2.6156], [\"106\", 1.8961999999999999], [\"110\", 1.8961999999999999], [\"114\", 1.5037999999999998], [\"118\", 1.8744999999999998], [\"122\", 1.7872000000000001], [\"126\", 1.7001], [\"130\", 0.9588999999999999], [\"133\", 1.5910000000000002], [\"137\", 1.4384], [\"141\", 1.5910000000000002], [\"145\", 1.5474], [\"149\", 1.5038], [\"153\", 0.7629], [\"157\", 0.7848], [\"161\", 0.9373], [\"165\", 0.5232], [\"168\", 1.0244], [\"172\", 0.8284], [\"176\", 0.654], [\"180\", 0.5885], [\"184\", 0.6104], [\"188\", 0.4578], [\"192\", 0.654], [\"196\", 0.43600000000000005], [\"199\", 0.3924], [\"203\", 0.545], [\"207\", 0.654], [\"211\", 0.5232], [\"215\", 0.5232], [\"219\", 0.5014000000000001], [\"223\", 0.6758], [\"227\", 0.8283], [\"231\", 0.8065000000000001], [\"234\", 0.7846], [\"238\", 1.0462], [\"242\", 1.4165999999999999], [\"246\", 1.2423], [\"250\", 1.4167], [\"254\", 1.2641999999999998], [\"258\", 1.286], [\"262\", 1.4603000000000002], [\"266\", 0.8936999999999999], [\"269\", 0.8283], [\"273\", 0.6976], [\"277\", 0.6322], [\"281\", 0.5449999999999999], [\"285\", 0.654], [\"289\", 0.5886], [\"293\", 0.8066000000000001], [\"297\", 0.5232], [\"301\", 0.5014], [\"304\", 0.5668000000000001], [\"308\", 0.8283], [\"312\", 0.545], [\"316\", 0.3706], [\"320\", 0.6103999999999999], [\"324\", 0.436], [\"328\", 0.4578], [\"332\", 0.2616], [\"336\", 0.2398]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16623\", 31.4081], [\"17469\", 11.8569], [\"18315\", 1.3514000000000002], [\"19161\", 5.645199999999999], [\"20008\", 0.8719000000000001], [\"20854\", 2.6809], [\"21700\", 3.2476], [\"22546\", 0.872], [\"23393\", 0.8937], [\"24239\", 2.3323], [\"25085\", 0.30519999999999997], [\"25931\", 3.0297], [\"26778\", 1.613], [\"27624\", 1.1334], [\"28470\", 5.666900000000001], [\"29316\", 0.4578], [\"30163\", 0.436], [\"31009\", 0.3052], [\"31855\", 0.39239999999999997], [\"32701\", 0.6322], [\"33548\", 0.0218], [\"34394\", 0.0218], [\"35240\", 0.109], [\"36086\", 0.0436], [\"36933\", 0.0436], [\"37779\", 0.0654], [\"38625\", 0.0218], [\"39471\", 0.0218], [\"40318\", 0.0436], [\"41164\", 0.0218], [\"42010\", 0.0436], [\"42856\", 0.0654], [\"43703\", 0.0436], [\"44549\", 0.0218], [\"45395\", 0.0218], [\"46241\", 0.0218], [\"47088\", 0.0218], [\"47934\", 0.0218], [\"48780\", 0.0218], [\"49626\", 0.0436], [\"50473\", 0.0436], [\"51319\", 0.0218], [\"52165\", 0.0436], [\"53011\", 0.6539], [\"53858\", 0.0218], [\"54704\", 0.0654], [\"55550\", 0.5014], [\"56396\", 0.0654], [\"57243\", 0.0436], [\"58089\", 0.47950000000000004], [\"58935\", 0.0872], [\"59781\", 0.0436], [\"60628\", 0.0218], [\"61474\", 0.0218], [\"62320\", 0.0218], [\"63166\", 0.0218], [\"64013\", 0.0218], [\"64859\", 0.0872], [\"65705\", 0.0218], [\"66551\", 0.0218], [\"67398\", 0.0218], [\"68244\", 0.0218], [\"69090\", 0.0218], [\"69936\", 0.0218], [\"70783\", 0.0218], [\"71629\", 0.0218], [\"72475\", 0.0436], [\"73321\", 0.0218], [\"74168\", 0.0218], [\"75014\", 0.0436], [\"75860\", 0.0436], [\"76706\", 0.0218], [\"77553\", 0.0218], [\"78399\", 0.0218], [\"79245\", 0.0436], [\"80091\", 3.4003], [\"80938\", 6.626000000000001], [\"81784\", 0.5668], [\"82630\", 2.0707], [\"83476\", 3.2910999999999997]]}"},"rt_list":{"kind":"list like","value":[{"code":"class DoubleLinkListNode:\n def __init__(self, ind, pre = None, next = None):\n self.ind = ind\n self.pre = pre if pre else self\n self.next = next if next else self\n\nclass Solution:\n def MinMaxList(self, arr: List[int]) -> List[int]:\n n = len(arr)\n if n == 0:\n return []\n sign = -1\n res = [9999]\n for num in arr:\n if num * sign > res[-1] * sign:\n res[-1] = num\n else:\n res.append(num)\n sign *= -1\n if len(res) & 1:\n res.pop()\n return res\n def maxProfit(self, k: int, prices: List[int]) -> int:\n newP = self.MinMaxList(prices)\n n = len(newP)\n m = n // 2\n res = 0\n for i in range(m):\n res += newP[i*2+1] - newP[i*2]\n if m <= k:\n return res\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\n NodeList = [DoubleLinkListNode(0, head)]\n for i in range(1, n):\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\n NodeList[i-1].next = NodeList[i]\n NodeList[n-1].next = tail\n head.next, tail.pre = NodeList[0], NodeList[n-1]\n heap = []\n for i in range(n-1):\n if i&1:\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\n else:\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\n while m > k:\n loss, i, j, t = heappop(heap)\n if NodeList[i] == None or NodeList[j] == None: continue\n m -= 1\n res -= loss\n nodei, nodej = NodeList[i], NodeList[j]\n nodel, noder = nodei.pre, nodej.next\n l, r = nodel.ind, noder.ind\n valL, valR = newP[l], newP[r]\n noder.pre, nodel.next = nodel, noder\n NodeList[i], NodeList[j] = None, None\n if t == 0:\n heappush(heap, [valR - valL, l, r, 1])\n elif l != -1 and r != -1:\n heappush(heap, [valL - valR, l, r, 0])\n return res","runtime":"28"},{"code":"class DoubleLinkListNode:\n def __init__(self, ind, pre = None, next = None):\n self.ind = ind\n self.pre = pre if pre else self\n self.next = next if next else self\n\nclass Solution:\n def MinMaxList(self, arr: List[int]) -> List[int]:\n n = len(arr)\n if n == 0:\n return []\n sign = -1\n res = [9999]\n for num in arr:\n if num * sign > res[-1] * sign:\n res[-1] = num\n else:\n res.append(num)\n sign *= -1\n if len(res) & 1:\n res.pop()\n return res\n def maxProfit(self, k: int, prices: List[int]) -> int:\n newP = self.MinMaxList(prices)\n n = len(newP)\n m = n // 2\n res = 0\n for i in range(m):\n res += newP[i*2+1] - newP[i*2]\n if m <= k:\n return res\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\n NodeList = [DoubleLinkListNode(0, head)]\n for i in range(1, n):\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\n NodeList[i-1].next = NodeList[i]\n NodeList[n-1].next = tail\n head.next, tail.pre = NodeList[0], NodeList[n-1]\n heap = []\n for i in range(n-1):\n if i&1:\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\n else:\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\n while m > k:\n loss, i, j, t = heappop(heap)\n if NodeList[i] == None or NodeList[j] == None: continue\n m -= 1\n res -= loss\n nodei, nodej = NodeList[i], NodeList[j]\n nodel, noder = nodei.pre, nodej.next\n l, r = nodel.ind, noder.ind\n valL, valR = newP[l], newP[r]\n noder.pre, nodel.next = nodel, noder\n NodeList[i], NodeList[j] = None, None\n if t == 0:\n heappush(heap, [valR - valL, l, r, 1])\n elif l != -1 and r != -1:\n heappush(heap, [valL - valR, l, r, 0])\n return res","runtime":"28"},{"code":"class DoubleLinkListNode:\n def __init__(self, ind, pre = None, next = None):\n self.ind = ind\n self.pre = pre if pre else self\n self.next = next if next else self\n\nclass Solution:\n def MinMaxList(self, arr: List[int]) -> List[int]:\n n = len(arr)\n if n == 0:\n return []\n sign = -1\n res = [9999]\n for num in arr:\n if num * sign > res[-1] * sign:\n res[-1] = num\n else:\n res.append(num)\n sign *= -1\n if len(res) & 1:\n res.pop()\n return res\n def maxProfit(self, k: int, prices: List[int]) -> int:\n newP = self.MinMaxList(prices)\n n = len(newP)\n m = n // 2\n res = 0\n for i in range(m):\n res += newP[i*2+1] - newP[i*2]\n if m <= k:\n return res\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\n NodeList = [DoubleLinkListNode(0, head)]\n for i in range(1, n):\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\n NodeList[i-1].next = NodeList[i]\n NodeList[n-1].next = tail\n head.next, tail.pre = NodeList[0], NodeList[n-1]\n heap = []\n for i in range(n-1):\n if i&1:\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\n else:\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\n while m > k:\n loss, i, j, t = heappop(heap)\n if NodeList[i] == None or NodeList[j] == None: continue\n m -= 1\n res -= loss\n nodei, nodej = NodeList[i], NodeList[j]\n nodel, noder = nodei.pre, nodej.next\n l, r = nodel.ind, noder.ind\n valL, valR = newP[l], newP[r]\n noder.pre, nodel.next = nodel, noder\n NodeList[i], NodeList[j] = None, None\n if t == 0:\n heappush(heap, [valR - valL, l, r, 1])\n elif l != -1 and r != -1:\n heappush(heap, [valL - valR, l, r, 0])\n return res","runtime":"32"},{"code":"class DoubleLinkListNode:\n def __init__(self, ind, pre = None, next = None):\n self.ind = ind\n self.pre = pre if pre else self\n self.next = next if next else self\n\nclass Solution:\n def MinMaxList(self, arr: List[int]) -> List[int]:\n n = len(arr)\n if n == 0:\n return []\n sign = -1\n res = [9999]\n for num in arr:\n if num * sign > res[-1] * sign:\n res[-1] = num\n else:\n res.append(num)\n sign *= -1\n if len(res) & 1:\n res.pop()\n return res\n def maxProfit(self, k: int, prices: List[int]) -> int:\n newP = self.MinMaxList(prices)\n n = len(newP)\n m = n // 2\n res = 0\n for i in range(m):\n res += newP[i*2+1] - newP[i*2]\n if m <= k:\n return res\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\n NodeList = [DoubleLinkListNode(0, head)]\n for i in range(1, n):\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\n NodeList[i-1].next = NodeList[i]\n NodeList[n-1].next = tail\n head.next, tail.pre = NodeList[0], NodeList[n-1]\n heap = []\n for i in range(n-1):\n if i&1:\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\n else:\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\n while m > k:\n loss, i, j, t = heappop(heap)\n if NodeList[i] == None or NodeList[j] == None: continue\n m -= 1\n res -= loss\n nodei, nodej = NodeList[i], NodeList[j]\n nodel, noder = nodei.pre, nodej.next\n l, r = nodel.ind, noder.ind\n valL, valR = newP[l], newP[r]\n noder.pre, nodel.next = nodel, noder\n NodeList[i], NodeList[j] = None, None\n if t == 0:\n heappush(heap, [valR - valL, l, r, 1])\n elif l != -1 and r != -1:\n heappush(heap, [valL - valR, l, r, 0])\n return res","runtime":"32"},{"code":"class DoubleLinkListNode:\n def __init__(self, ind, pre = None, next = None):\n self.ind = ind\n self.pre = pre if pre else self\n self.next = next if next else self\n\nclass Solution:\n def MinMaxList(self, arr: List[int]) -> List[int]:\n n = len(arr)\n if n == 0:\n return []\n sign = -1\n res = [9999]\n for num in arr:\n if num * sign > res[-1] * sign:\n res[-1] = num\n else:\n res.append(num)\n sign *= -1\n if len(res) & 1:\n res.pop()\n return res\n def maxProfit(self, k: int, prices: List[int]) -> int:\n newP = self.MinMaxList(prices)\n n = len(newP)\n m = n // 2\n res = 0\n for i in range(m):\n res += newP[i*2+1] - newP[i*2]\n if m <= k:\n return res\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\n NodeList = [DoubleLinkListNode(0, head)]\n for i in range(1, n):\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\n NodeList[i-1].next = NodeList[i]\n NodeList[n-1].next = tail\n head.next, tail.pre = NodeList[0], NodeList[n-1]\n heap = []\n for i in range(n-1):\n if i&1:\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\n else:\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\n while m > k:\n loss, i, j, t = heappop(heap)\n if NodeList[i] == None or NodeList[j] == None: continue\n m -= 1\n res -= loss\n nodei, nodej = NodeList[i], NodeList[j]\n nodel, noder = nodei.pre, nodej.next\n l, r = nodel.ind, noder.ind\n valL, valR = newP[l], newP[r]\n noder.pre, nodel.next = nodel, noder\n NodeList[i], NodeList[j] = None, None\n if t == 0:\n heappush(heap, [valR - valL, l, r, 1])\n elif l != -1 and r != -1:\n heappush(heap, [valL - valR, l, r, 0])\n return res","runtime":"36"},{"code":"import heapq \n\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n if n==1:\n return 0\n\n pairs = []\n profits = []\n v = 0\n p = 0\n\n while p<n:\n v = p\n while v<n-1 and prices[v]>=prices[v+1]:\n v+=1 \n p = v + 1\n while p<n and prices[p]>=prices[p-1]:\n p+=1 \n # valley at v, peak at p-1\n\n #Valleys should be non-decreasing \n while len(pairs) and prices[v] < prices[pairs[-1][0]]:\n heapq.heappush(profits, -1*(prices[pairs[-1][1]-1] - prices[pairs[-1][0]]))\n pairs.pop()\n \n #now combine intervals \n while len(pairs) and prices[p-1] >prices[pairs[-1][1]-1]:\n heapq.heappush(profits, -1*(prices[pairs[-1][1]-1] - prices[v]))\n v = pairs[-1][0]\n pairs.pop()\n pairs.append((v, p))\n while len(pairs):\n heapq.heappush(profits, -1*(prices[pairs[-1][1]-1] - prices[pairs[-1][0]]))\n pairs.pop()\n ans = 0\n taken = 0\n while len(profits) and taken<k:\n ans -= heapq.heappop(profits)\n taken +=1\n \n return ans ","runtime":"36"},{"code":"class DoubleLinkListNode:\n def __init__(self, ind, pre = None, next = None):\n self.ind = ind\n self.pre = pre if pre else self\n self.next = next if next else self\n\nclass Solution:\n def MinMaxList(self, arr: List[int]) -> List[int]:\n n = len(arr)\n if n == 0:\n return []\n sign = -1\n res = [9999]\n for num in arr:\n if num * sign > res[-1] * sign:\n res[-1] = num\n else:\n res.append(num)\n sign *= -1\n if len(res) & 1:\n res.pop()\n return res\n def maxProfit(self, k: int, prices: List[int]) -> int:\n newP = self.MinMaxList(prices)\n n = len(newP)\n m = n // 2\n res = 0\n for i in range(m):\n res += newP[i*2+1] - newP[i*2]\n if m <= k:\n return res\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\n NodeList = [DoubleLinkListNode(0, head)]\n for i in range(1, n):\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\n NodeList[i-1].next = NodeList[i]\n NodeList[n-1].next = tail\n head.next, tail.pre = NodeList[0], NodeList[n-1]\n heap = []\n for i in range(n-1):\n if i&1:\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\n else:\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\n while m > k:\n loss, i, j, t = heappop(heap)\n if NodeList[i] == None or NodeList[j] == None: continue\n m -= 1\n res -= loss\n nodei, nodej = NodeList[i], NodeList[j]\n nodel, noder = nodei.pre, nodej.next\n l, r = nodel.ind, noder.ind\n valL, valR = newP[l], newP[r]\n noder.pre, nodel.next = nodel, noder\n NodeList[i], NodeList[j] = None, None\n if t == 0:\n heappush(heap, [valR - valL, l, r, 1])\n elif l != -1 and r != -1:\n heappush(heap, [valL - valR, l, r, 0])\n return res","runtime":"40"},{"code":"class DoubleLinkListNode:\n def __init__(self, ind, pre = None, next = None):\n self.ind = ind\n self.pre = pre if pre else self\n self.next = next if next else self\n\nclass Solution:\n def MinMaxList(self, arr: List[int]) -> List[int]:\n n = len(arr)\n if n == 0:\n return []\n sign = -1\n res = [9999]\n for num in arr:\n if num * sign > res[-1] * sign:\n res[-1] = num\n else:\n res.append(num)\n sign *= -1\n if len(res) & 1:\n res.pop()\n return res\n def maxProfit(self, k: int, prices: List[int]) -> int:\n newP = self.MinMaxList(prices)\n n = len(newP)\n m = n // 2\n res = 0\n for i in range(m):\n res += newP[i*2+1] - newP[i*2]\n if m <= k:\n return res\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\n NodeList = [DoubleLinkListNode(0, head)]\n for i in range(1, n):\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\n NodeList[i-1].next = NodeList[i]\n NodeList[n-1].next = tail\n head.next, tail.pre = NodeList[0], NodeList[n-1]\n heap = []\n for i in range(n-1):\n if i&1:\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\n else:\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\n while m > k:\n loss, i, j, t = heappop(heap)\n if NodeList[i] == None or NodeList[j] == None: continue\n m -= 1\n res -= loss\n nodei, nodej = NodeList[i], NodeList[j]\n nodel, noder = nodei.pre, nodej.next\n l, r = nodel.ind, noder.ind\n valL, valR = newP[l], newP[r]\n noder.pre, nodel.next = nodel, noder\n NodeList[i], NodeList[j] = None, None\n if t == 0:\n heappush(heap, [valR - valL, l, r, 1])\n elif l != -1 and r != -1:\n heappush(heap, [valL - valR, l, r, 0])\n return res","runtime":"40"},{"code":"class DoubleLinkListNode:\n def __init__(self, ind, pre = None, next = None):\n self.ind = ind\n self.pre = pre if pre else self\n self.next = next if next else self\n\nclass Solution:\n def MinMaxList(self, arr: List[int]) -> List[int]:\n n = len(arr)\n if n == 0:\n return []\n sign = -1\n res = [9999]\n for num in arr:\n if num * sign > res[-1] * sign:\n res[-1] = num\n else:\n res.append(num)\n sign *= -1\n if len(res) & 1:\n res.pop()\n return res\n def maxProfit(self, k: int, prices: List[int]) -> int:\n newP = self.MinMaxList(prices)\n n = len(newP)\n m = n // 2\n res = 0\n for i in range(m):\n res += newP[i*2+1] - newP[i*2]\n if m <= k:\n return res\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\n NodeList = [DoubleLinkListNode(0, head)]\n for i in range(1, n):\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\n NodeList[i-1].next = NodeList[i]\n NodeList[n-1].next = tail\n head.next, tail.pre = NodeList[0], NodeList[n-1]\n heap = []\n for i in range(n-1):\n if i&1:\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\n else:\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\n while m > k:\n loss, i, j, t = heappop(heap)\n if NodeList[i] == None or NodeList[j] == None: continue\n m -= 1\n res -= loss\n nodei, nodej = NodeList[i], NodeList[j]\n nodel, noder = nodei.pre, nodej.next\n l, r = nodel.ind, noder.ind\n valL, valR = newP[l], newP[r]\n noder.pre, nodel.next = nodel, noder\n NodeList[i], NodeList[j] = None, None\n if t == 0:\n heappush(heap, [valR - valL, l, r, 1])\n elif l != -1 and r != -1:\n heappush(heap, [valL - valR, l, r, 0])\n return res","runtime":"44"},{"code":"class DoubleLinkListNode:\n def __init__(self, ind, pre = None, next = None):\n self.ind = ind\n self.pre = pre if pre else self\n self.next = next if next else self\n\nclass Solution:\n def MinMaxList(self, arr: List[int]) -> List[int]:\n n = len(arr)\n if n == 0:\n return []\n sign = -1\n res = [9999]\n for num in arr:\n if num * sign > res[-1] * sign:\n res[-1] = num\n else:\n res.append(num)\n sign *= -1\n if len(res) & 1:\n res.pop()\n return res\n def maxProfit(self, k: int, prices: List[int]) -> int:\n newP = self.MinMaxList(prices)\n n = len(newP)\n m = n // 2\n res = 0\n for i in range(m):\n res += newP[i*2+1] - newP[i*2]\n if m <= k:\n return res\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\n NodeList = [DoubleLinkListNode(0, head)]\n for i in range(1, n):\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\n NodeList[i-1].next = NodeList[i]\n NodeList[n-1].next = tail\n head.next, tail.pre = NodeList[0], NodeList[n-1]\n heap = []\n for i in range(n-1):\n if i&1:\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\n else:\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\n while m > k:\n loss, i, j, t = heappop(heap)\n if NodeList[i] == None or NodeList[j] == None: continue\n m -= 1\n res -= loss\n nodei, nodej = NodeList[i], NodeList[j]\n nodel, noder = nodei.pre, nodej.next\n l, r = nodel.ind, noder.ind\n valL, valR = newP[l], newP[r]\n noder.pre, nodel.next = nodel, noder\n NodeList[i], NodeList[j] = None, None\n if t == 0:\n heappush(heap, [valR - valL, l, r, 1])\n elif l != -1 and r != -1:\n heappush(heap, [valL - valR, l, r, 0])\n return res","runtime":"44"},{"code":"class DoubleLinkListNode:\n def __init__(self, ind, pre = None, next = None):\n self.ind = ind\n self.pre = pre if pre else self\n self.next = next if next else self\n\nclass Solution:\n def MinMaxList(self, arr: List[int]) -> List[int]:\n n = len(arr)\n if n == 0:\n return []\n sign = -1\n res = [9999]\n for num in arr:\n if num * sign > res[-1] * sign:\n res[-1] = num\n else:\n res.append(num)\n sign *= -1\n if len(res) & 1:\n res.pop()\n return res\n def maxProfit(self, k: int, prices: List[int]) -> int:\n newP = self.MinMaxList(prices)\n n = len(newP)\n m = n // 2\n res = 0\n for i in range(m):\n res += newP[i*2+1] - newP[i*2]\n if m <= k:\n return res\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\n NodeList = [DoubleLinkListNode(0, head)]\n for i in range(1, n):\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\n NodeList[i-1].next = NodeList[i]\n NodeList[n-1].next = tail\n head.next, tail.pre = NodeList[0], NodeList[n-1]\n heap = []\n for i in range(n-1):\n if i&1:\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\n else:\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\n while m > k:\n loss, i, j, t = heappop(heap)\n if NodeList[i] == None or NodeList[j] == None: continue\n m -= 1\n res -= loss\n nodei, nodej = NodeList[i], NodeList[j]\n nodel, noder = nodei.pre, nodej.next\n l, r = nodel.ind, noder.ind\n valL, valR = newP[l], newP[r]\n noder.pre, nodel.next = nodel, noder\n NodeList[i], NodeList[j] = None, None\n if t == 0:\n heappush(heap, [valR - valL, l, r, 1])\n elif l != -1 and r != -1:\n heappush(heap, [valL - valR, l, r, 0])\n return res","runtime":"48"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # Initialize buy and sell arrays\n buy, sell = [float(\"-inf\")] * (k + 1), [0] * (k + 1)\n\n # Iterate through each price in the list\n for p in prices:\n for t in range(1, k + 1):\n # Update the maximum profit for buying with up to t transactions\n if sell[t - 1] - p > buy[t]:\n buy[t] = sell[t - 1] - p\n\n # Update the maximum profit for selling with up to t transactions\n if p + buy[t] > sell[t]:\n sell[t] = buy[t] + p\n\n return sell[-1]","runtime":"48"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n def solve(p: int):\n b, s = (0, 0), (0, 0)\n for x in reversed(prices):\n s, b = max(s, (b[0] + x - p, b[1] + 1)), max(b, (s[0] - x, s[1]))\n return b\n l, r = 0, sum(prices)\n while l < r:\n m = (r + l + 1) // 2\n if solve(m)[1] >= k:\n l = m\n else:\n r = m - 1\n return solve(l)[0] + l * k","runtime":"52"},{"code":"from typing import List\n\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # Helper function to solve the problem with a given profit margin 'p'\n def solve(p: int):\n b, s = (0, 0), (0, 0)\n for x in reversed(prices):\n s = max(s, (b[0] + x - p, b[1] + 1))\n b = max(b, (s[0] - x, s[1]))\n return b\n\n l, r = 0, sum(prices)\n while l < r:\n m = (r + l + 1) // 2\n if solve(m)[1] >= k:\n l = m\n else:\n r = m - 1\n return solve(l)[0] + l * k\n\n# Example usage\nif __name__ == \"__main__\":\n solution = Solution()\n k = 2\n prices = [3, 2, 6, 5, 0, 3]\n print(solution.maxProfit(k, prices)) # Output: 7\n","runtime":"52"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n\n\n def buy_sell(ps):\n if len(ps) == 0:\n return None, 0\n min_val = ps[0]\n min_index = 0\n max_profit = 0\n pair = None\n\n for i in range(len(ps)):\n profit = ps[i] - min_val\n\n if profit > max_profit:\n max_profit = profit\n pair = (min_index, i)\n \n if ps[i] < min_val:\n\n min_val = ps[i]\n min_index = i\n\n return pair, max_profit\n\n def sell_buy(ps):\n return buy_sell([-_ for _ in ps])\n\n partitions = [prices]\n total_profit = 0\n\n for _ in range(k):\n\n partition_index = 0\n new_coords = None\n new_profit = 0\n\n for i, partition in enumerate(partitions):\n if i % 2 == 0:\n coords, profit = buy_sell(partition)\n else:\n coords, profit = sell_buy(partition)\n\n if profit > new_profit:\n new_profit = profit\n partition_index = i\n new_coords = coords\n\n if new_profit == 0:\n break\n\n rel_part = partitions[partition_index]\n\n # print(rel_part)\n # print(new_coords)\n # print(new_profit)\n\n new_parts = [rel_part[0:new_coords[0]], rel_part[new_coords[0]+1 : new_coords[1]], rel_part[new_coords[1]+1 : len(rel_part)]]\n # new_parts = [_ for _ in new_parts if len(_) > 0]\n\n partitions = partitions[:partition_index] + new_parts + partitions[partition_index+1:]\n\n print(partitions)\n\n total_profit = total_profit + new_profit\n\n return total_profit\n\n\n\n\n\n\n \n\n\n\n\n\n\n\n\n\n","runtime":"56"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dpl = [[0, -float('inf')] for _ in range(k+1)]\n for p in prices:\n for i in range(k+1):\n if i and dpl[i - 1][1] + p > dpl[i][0]:\n dpl[i][0] = dpl[i-1][1] + p\n if dpl[i][0] - p > dpl[i][1]:\n dpl[i][1] = dpl[i][0] - p\n return dpl[-1][0]","runtime":"56"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n def solve(p: int):\n b, s = (0, 0), (0, 0)\n for x in reversed(prices):\n s, b = max(s, (b[0] + x - p, b[1] + 1)), max(b, (s[0] - x, s[1]))\n return b\n l, r = 0, sum(prices)\n while l < r:\n m = (r + l + 1) // 2\n if solve(m)[1] >= k:\n l = m\n else:\n r = m - 1\n return solve(l)[0] + l * k","runtime":"60"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n if k == 0 or n <= 1:\n return 0\n \n transactions = []\n start, end = 0, 0\n for i in range(1,n):\n if prices[i] >= prices[i-1]:\n end = i\n else:\n if prices[end] > prices[start]:\n transactions.append( [prices[start], prices[end]] )\n start = i\n end = i\n \n if prices[end] > prices[start]:\n transactions.append( [prices[start], prices[end]] )\n \n print(transactions)\n\n while len(transactions) > k:\n # try delete one transaction\n delete_idx = None\n min_delete_loss = math.inf\n for idx, (buy_price, sell_price) in enumerate(transactions):\n if sell_price - buy_price < min_delete_loss:\n delete_idx = idx\n min_delete_loss = sell_price - buy_price\n \n merge_idx = None\n min_merge_loss = math.inf\n for idx in range(len(transactions)-1):\n if transactions[idx][1] - transactions[idx+1][0] < min_merge_loss:\n merge_idx = idx\n min_merge_loss = transactions[idx][1] - transactions[idx+1][0]\n\n if min_delete_loss <= min_merge_loss:\n transactions.pop(delete_idx)\n else:\n transactions[merge_idx][1] = transactions[merge_idx+1][1]\n transactions.pop(merge_idx+1)\n \n return sum( [sell_price - buy_price for buy_price, sell_price in transactions] )\n\n\n\n","runtime":"60"},{"code":"class Solution:\n if 0:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # if 2*k >= len(prices): \n # return sum(max(0, prices[i]-prices[i-1]) for i in range(1, len(prices)))\n \n pnl = [0]*len(prices)\n #print(pnl)\n val = [0]*len(prices)\n for _ in range(k):\n val[0] = 0\n for i in range(1, len(pnl)): \n val[i] = max(pnl[i], val[i-1] + prices[i] - prices[i-1]) \n pnl[i] = max(pnl[i-1], val[i])\n #print(pnl,'---',val)\n return pnl[-1]\n\n \n if 1:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n # solve special cases\n if not prices or k == 0:\n return 0\n\n # find all consecutively increasing subsequence\n transactions = []\n start = 0\n end = 0\n for i in range(1, n):\n if prices[i] >= prices[i - 1]:\n end = i\n else:\n if end > start:\n transactions.append([start, end])\n start = i\n if end > start:\n transactions.append([start, end])\n print(transactions)\n while len(transactions) > k:\n # check delete loss\n delete_index = 0\n min_delete_loss = math.inf\n for i in range(len(transactions)):\n t = transactions[i]\n profit_loss = prices[t[1]] - prices[t[0]]\n if profit_loss < min_delete_loss:\n min_delete_loss = profit_loss\n delete_index = i\n\n # check merge loss\n merge_index = 0\n min_merge_loss = math.inf\n for i in range(1, len(transactions)):\n t1 = transactions[i - 1]\n t2 = transactions[i]\n profit_loss = prices[t1[1]] - prices[t2[0]]\n if profit_loss < min_merge_loss:\n min_merge_loss = profit_loss\n merge_index = i\n\n # delete or merge\n if min_delete_loss <= min_merge_loss:\n transactions.pop(delete_index)\n else:\n transactions[merge_index - 1][1] = transactions[merge_index][1]\n transactions.pop(merge_index)\n\n return sum(prices[j] - prices[i] for i, j in transactions)\n\n\n if 0:\n def get_sign(self, num):\n if num > 0:\n return 1\n elif num < 0:\n return -1\n else:\n return 0\n def merge(self, diff_clean):\n if len(diff_clean)==1:\n return 1\n #assume at least one place to merge\n downs = [(diff_clean[i], i) for i in range(1,len(diff_clean),2)]\n downs = sorted(downs)\n while downs:# find the first deletable\n p = downs.pop()[1]\n if diff_clean[p]+diff_clean[p-1]>=0 and diff_clean[p]+diff_clean[p+1]>=0:\n diff_clean[p] = diff_clean[p]+diff_clean[p-1]+diff_clean[p+1]\n diff_clean.pop(p+1)\n diff_clean.pop(p-1)\n return 0\n else:\n continue\n # if not return, reset downs\n downs = [(diff_clean[i], i) for i in range(1,len(diff_clean),2)]\n downs = sorted(downs)\n p = downs.pop()[1]\n diff_clean[p] = diff_clean[p]+diff_clean[p-1]+diff_clean[p+1]\n diff_clean.pop(p+1)\n diff_clean.pop(p-1)\n return 0\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n if len(prices)<=1:\n return 0\n if k==0:\n return 0\n diff = [prices[i]-prices[i-1] for i in range(1, len(prices))]\n if len(diff)==1:\n return max(0, diff[0])\n \n #assume at least one diff.\n sign = 0\n diff_clean = []\n current = 0\n for i in range(0, len(diff)):\n if self.get_sign(diff[i])==0: # skip the 0 change\n continue\n elif self.get_sign(diff[i])!=sign: #sign flips\n sign = self.get_sign(diff[i])\n if current!=0:\n diff_clean.append(current)\n current = diff[i]\n else: #same sign, accumulate values\n current += diff[i]\n if current!=0:\n diff_clean.append(current)\n #print(diff_clean)\n if len(diff_clean)==1 and diff_clean[0]<0:\n return 0 # no winning time\n if diff_clean[0]<0:\n diff_clean.pop(0)\n if diff_clean[-1]<0:\n diff_clean.pop()\n\n count=len(diff_clean)//2+1 # number of raises\n if k>=count: #enough transactions\n raises = [diff_clean[i] for i in range(0,len(diff_clean),2)]\n return sum(raises)\n best = 0\n count=len(diff_clean)//2+1 # number of raises\n for ii in range(count): # number of time needed to do merge\n raises = [diff_clean[i] for i in range(0,len(diff_clean),2)]\n max_heaq = [-i for i in raises]\n heapq.heapify(max_heaq)\n s = 0\n for i in range(min(k, len(raises))):\n s+=-heapq.heappop(max_heaq)\n best = max(s, best)\n print(diff_clean, \"---\", best)\n self.merge(diff_clean)\n\n count=len(diff_clean)//2+1 # number of raises\n if k>=count: #enough transactions\n raises = [diff_clean[i] for i in range(0,len(diff_clean),2)]\n return max(best, sum(raises))\n #print('merge:', self.merge([2, -2, 1, -3, 4, -5, 8, -3, 4], 1))\n return best\n\n\n\n'''\n2\n[27,98,94,65,3,13,48,83,27,84,86,49,31,63,40,12,34,79,61,47,29,33,52,100,85,38,24,1,16,62,89,36,74,9,49,62,89]\n\n7\n[12,97,25,64,17,93,9,52,42,85,81,84,1,54,15,72,11,94]\n\n'''","runtime":"63"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n cash = [0] * (k+1)\n trans = [-inf] * (k+1)\n for price in prices:\n prev_cash = cash.copy()\n prev_trans = trans.copy()\n\n for i in range(1, k+1):\n cash[i] = max(prev_cash[i], prev_trans[i]+price)\n trans[i] = max(prev_trans[i], prev_cash[i-1]-price)\n return max(cash)","runtime":"63"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n # solve special cases\n if not prices or k == 0:\n return 0\n\n # find all consecutively increasing subsequence\n transactions = []\n start = 0\n end = 0\n for i in range(1, n):\n if prices[i] >= prices[i - 1]:\n end = i\n else:\n if end > start:\n transactions.append([start, end])\n start = i\n if end > start:\n transactions.append([start, end])\n\n while len(transactions) > k:\n # check delete loss\n delete_index = 0\n min_delete_loss = math.inf\n for i in range(len(transactions)):\n t = transactions[i]\n profit_loss = prices[t[1]] - prices[t[0]]\n if profit_loss < min_delete_loss:\n min_delete_loss = profit_loss\n delete_index = i\n\n # check merge loss\n merge_index = 0\n min_merge_loss = math.inf\n for i in range(1, len(transactions)):\n t1 = transactions[i - 1]\n t2 = transactions[i]\n profit_loss = prices[t1[1]] - prices[t2[0]]\n if profit_loss < min_merge_loss:\n min_merge_loss = profit_loss\n merge_index = i\n\n # delete or merge\n if min_delete_loss <= min_merge_loss:\n transactions.pop(delete_index)\n else:\n transactions[merge_index - 1][1] = transactions[merge_index][1]\n transactions.pop(merge_index)\n\n return sum(prices[j] - prices[i] for i, j in transactions)","runtime":"67"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n # solve special cases\n if not prices or k == 0:\n return 0\n\n # find all consecutively increasing subsequence\n transactions = []\n start = 0\n end = 0\n for i in range(1, n):\n if prices[i] >= prices[i - 1]:\n end = i\n else:\n if end > start:\n transactions.append([start, end])\n start = i\n if end > start:\n transactions.append([start, end])\n\n while len(transactions) > k:\n # check delete loss\n delete_index = 0\n min_delete_loss = math.inf\n for i in range(len(transactions)):\n t = transactions[i]\n profit_loss = prices[t[1]] - prices[t[0]]\n if profit_loss < min_delete_loss:\n min_delete_loss = profit_loss\n delete_index = i\n\n # check merge loss\n merge_index = 0\n min_merge_loss = math.inf\n for i in range(1, len(transactions)):\n t1 = transactions[i - 1]\n t2 = transactions[i]\n profit_loss = prices[t1[1]] - prices[t2[0]]\n if profit_loss < min_merge_loss:\n min_merge_loss = profit_loss\n merge_index = i\n\n # delete or merge\n if min_delete_loss <= min_merge_loss:\n transactions.pop(delete_index)\n else:\n transactions[merge_index - 1][1] = transactions[merge_index][1]\n transactions.pop(merge_index)\n\n return sum(prices[j] - prices[i] for i, j in transactions)","runtime":"67"},{"code":"class Solution:\n def maxProfit(self, k: int, A: List[int]) -> int:\n cost = [math.inf] * (k + 1)\n profit = [0] * (k + 1)\n for p in A:\n for k in range(1, k + 1):\n cost[k] = min(cost[k], p - profit[k - 1])\n profit[k] = max(profit[k], p - cost[k])\n\n return profit[-1]","runtime":"71"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n # solve special cases\n if not prices or k == 0:\n return 0\n\n # find all consecutively increasing subsequence\n transactions = []\n start = 0\n end = 0\n for i in range(1, n):\n if prices[i] >= prices[i - 1]:\n end = i\n else:\n if end > start:\n transactions.append([start, end])\n start = i\n if end > start:\n transactions.append([start, end])\n\n while len(transactions) > k:\n # check delete loss\n delete_index = 0\n min_delete_loss = math.inf\n for i in range(len(transactions)):\n t = transactions[i]\n profit_loss = prices[t[1]] - prices[t[0]]\n if profit_loss < min_delete_loss:\n min_delete_loss = profit_loss\n delete_index = i\n\n # check merge loss\n merge_index = 0\n min_merge_loss = math.inf\n for i in range(1, len(transactions)):\n t1 = transactions[i - 1]\n t2 = transactions[i]\n profit_loss = prices[t1[1]] - prices[t2[0]]\n if profit_loss < min_merge_loss:\n min_merge_loss = profit_loss\n merge_index = i\n\n # delete or merge\n if min_delete_loss <= min_merge_loss:\n transactions.pop(delete_index)\n else:\n transactions[merge_index - 1][1] = transactions[merge_index][1]\n transactions.pop(merge_index)\n\n return sum(prices[j] - prices[i] for i, j in transactions)","runtime":"71"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n # solve special cases\n if not prices or k == 0:\n return 0\n\n # find all consecutively increasing subsequence\n transactions = []\n start = 0\n end = 0\n for i in range(1, n):\n if prices[i] >= prices[i - 1]:\n end = i\n else:\n if end > start:\n transactions.append([start, end])\n start = i\n if end > start:\n transactions.append([start, end])\n\n while len(transactions) > k:\n # check delete loss\n delete_index = 0\n min_delete_loss = math.inf\n for i in range(len(transactions)):\n t = transactions[i]\n profit_loss = prices[t[1]] - prices[t[0]]\n if profit_loss < min_delete_loss:\n min_delete_loss = profit_loss\n delete_index = i\n\n # check merge loss\n merge_index = 0\n min_merge_loss = math.inf\n for i in range(1, len(transactions)):\n t1 = transactions[i - 1]\n t2 = transactions[i]\n profit_loss = prices[t1[1]] - prices[t2[0]]\n if profit_loss < min_merge_loss:\n min_merge_loss = profit_loss\n merge_index = i\n\n # delete or merge\n if min_delete_loss <= min_merge_loss:\n transactions.pop(delete_index)\n else:\n transactions[merge_index - 1][1] = transactions[merge_index][1]\n transactions.pop(merge_index)\n\n return sum(prices[j] - prices[i] for i, j in transactions)","runtime":"75"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n costs = [float(\"inf\") for _ in range(k)]\n profits = [0 for _ in range(k)]\n\n for price in prices:\n costs[0] = min(costs[0], price)\n profits[0] = max(profits[0], price - costs[0])\n for i in range(1, k):\n costs[i] = min(costs[i], price - profits[i - 1])\n profits[i] = max(profits[i], price - costs[i])\n\n return profits[-1]","runtime":"75"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n c = [float('inf')] * k\n p = [0] * k\n for i in prices:\n for j in range(k):\n if j == 0:\n c[j] = min(c[j], i)\n p[j] = max(p[j], i - c[j])\n else:\n c[j] = min(c[j], i - p[j-1])\n p[j] = max(p[j], i - c[j])\n return p[-1]\n ","runtime":"79"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n if len(prices) == 1:\n return 0\n buy = [-float(\"inf\")] * k\n sell = [0] * k\n for p in prices:\n buy[0] = max(buy[0], -p)\n sell[0] = max(sell[0], buy[0] + p)\n # print(buy, sell)\n for t in range(1, k):\n buy[t] = max(buy[t], sell[t-1] - p)\n sell[t] = max(sell[t], buy[t] + p)\n # print(buy, sell)\n return sell[-1]\n","runtime":"79"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n buys, sells = [-10000]*k, [0]*k\n for p in prices:\n for i in range(k-1,0,-1):\n buys[i], sells[i] = max(buys[i], sells[i-1]-p), max(sells[i], buys[i]+p)\n buys[0], sells[0] = max(buys[0], -p), max(sells[0], buys[0]+p)\n return sells[-1]","runtime":"83"},{"code":"import sys\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n costs = [sys.maxsize] * k\n profits = [0] * k\n for index, price in enumerate(prices):\n costs[0] = min(costs[0], price)\n profits[0] = max(profits[0], price-costs[0])\n for i in range(1, k):\n costs[i] = min(costs[i], price - profits[i-1])\n profits[i] = max(profits[i], price - costs[i])\n return profits[k-1]","runtime":"83"},{"code":"from typing import List\n\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n if k == 0 or not prices:\n return 0\n \n n = len(prices)\n \n # If k >= n/2, we can consider it as infinite transactions.\n if k >= n // 2:\n max_profit = 0\n for i in range(1, n):\n if prices[i] > prices[i - 1]:\n max_profit += prices[i] - prices[i - 1]\n return max_profit\n \n # dp[i][j] - max profit with at most i transactions on day j\n dp = [[0] * n for _ in range(k + 1)]\n \n for i in range(1, k + 1):\n max_diff = -prices[0]\n for j in range(1, n):\n dp[i][j] = max(dp[i][j - 1], prices[j] + max_diff)\n max_diff = max(max_diff, dp[i - 1][j] - prices[j])\n \n return dp[k][n - 1]\n","runtime":"87"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n if not prices or k == 0:\n return 0\n n = len(prices)\n if k >= n//2:\n profit = 0\n for i in range(1,n):\n if prices[i] > prices[i-1]:\n profit += prices[i] - prices[i-1]\n return profit\n buys = [float('-inf') for _ in range(k+1)]\n sells = [0 for _ in range(k+1)]\n for price in prices:\n for i in range(k,0,-1):\n sells[i] = max(price+buys[i], sells[i])\n buys[i] = max(sells[i-1]-price,buys[i])\n\n return sells[-1]\n\n\n ","runtime":"87"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n cost = [float('inf')]*k\n profit = [0]*k\n for price in prices:\n for j in range(k-1, -1, -1):\n if j ==0:\n cost[j] = min(cost[j], price)\n else:\n cost[j] = min(cost[j], price-profit[j-1])\n profit[j] = max(profit[j], price-cost[j])\n return profit[k-1]","runtime":"91"},{"code":"import sys\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n costs = [sys.maxsize] * k\n profits = [0] * k\n for index, price in enumerate(prices):\n profits[0] = max(profits[0], price-costs[0])\n costs[0] = min(costs[0], price)\n for i in range(1, k):\n profits[i] = max(profits[i], price - costs[i])\n costs[i] = min(costs[i], price - profits[i-1])\n return profits[k-1]","runtime":"91"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n # if max transactions limited by num of days\n if k > len(prices)//2:\n\n t_ik0, t_ik1 = 0, float('-inf')\n\n for price in prices:\n t_ik0, t_ik1 = max(t_ik0, t_ik1 + price), max(t_ik1, t_ik0 - price)\n \n return t_ik0\n \n t_ik0 = [0] * (k+1)\n t_ik1 = [float('-inf')] * (k+1)\n\n for price in prices:\n for j in range(k,0,-1):\n t_ik0[j], t_ik1[j] = max(t_ik0[j], t_ik1[j]+price), max(t_ik1[j], t_ik0[j-1] - price)\n \n return t_ik0[-1]\n","runtime":"95"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n\n cost = [float('inf')]*(k+1)\n profit = [0]*(k+1)\n\n for price in prices:\n for i in range(k):\n cost[i+1] = min(cost[i+1], price - profit[i])\n profit[i+1] = max(profit[i+1], price - cost[i+1])\n \n return profit[-1]\n\n\n\n\n\n\n\n\n\n # profit = [0]*(k+1)\n # cost =[float('inf')]*(k+1)\n\n # for price in prices:\n # for i in range(k):\n # cost[i+1] = min(cost[i+1], price - profit[i])\n # profit[i+1] = max(profit[i+1], price - cost[i+1])\n \n # return profit[-1]\n\n\n\n\n\n # profit = [0]*(k+1)\n # cost = [float('inf')]*(k+1)\n\n # for price in prices:\n # for i in range(k):\n # cost[i+1] = min(cost[i+1], price - profit[i])\n # profit[i+1] = max(profit[i+1], price - cost[i+1])\n \n # return profit[-1]\n\n\n\n\n\n\n\n\n\n # if k == 0:\n # return 0\n \n # profit = [0]*(k+1)\n # cost = [float('inf')]*(k+1)\n\n # for price in prices:\n # for i in range(k):\n # cost[i+1] = min(cost[i+1], price - profit[i])\n # profit[i+1] = max(profit[i+1], price - cost[i+1])\n \n # return profit[-1]\n\n\n\n\n\n # if k == 0:\n # return 0\n \n # profit = [0]*(k+1)\n # cost = [float('inf')]*(k+1)\n\n # for price in prices:\n # for i in range(k):\n # cost[i+1] = min(cost[i+1], price - profit[i])\n # profit[i+1] = max(profit[i+1], price - cost[i+1])\n \n # return profit[-1]\n\n\n\n # if k == 0:\n # return 0\n\n # costs = [float('inf')] * (k+1)\n # profits = [0] * (k+1)\n\n # for price in prices:\n # for i in range(k): # how many transactions?\n # # either don't buy at this stage, i.e. keep previous price array's costs[i+1],\n # # or buy at this stage (cost can be negative, profit will be accummulated later)\n # costs[i+1] = min(costs[i+1], price - profits[i])\n\n # # either don't sell at this stage, i.e. keep previous price array's profits[i+1],\n # # or sell at this stage and realize profit\n # profits[i+1] = max(profits[i+1], price - costs[i+1])\n \n # return profits[k]\n\n\n \n # n = len(prices)\n\n # if not prices or k == 0:\n # return 0\n\n # # when you can buy/sell more times than length of array\n # if k // 2 > n:\n # result = 0\n # for i, j in zip(prices[1:], prices[:-1]):\n # result += max(0, i-j)\n # return result\n\n # # dp[i][j][hold] = balance\n # # increase 0 <= j <= k by 1 only when we buy, not when we sell\n # # hold = 1 for holding, 0 for not holding\n # dp = [[[-float('inf')]*2 for _ in range(k+1)] for _ in range(n)]\n\n # # initial conditions\n # dp[0][0][0] = 0\n # dp[0][1][1] = -prices[0] # negative because cost incured\n\n # for i in range(1, n):\n # for j in range(k+1):\n # # transition equation\n # # either continue not holding or convert buy to sell \n # dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1] + prices[i])\n # # can't hold stock without any transaction\n # if j > 0:\n # # either continue holding or buy \n # dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j-1][0] - prices[i])\n \n # result = max(dp[n-1][j][0] for j in range(k+1))\n # return result\n ","runtime":"95"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n '''\n 1. State Definition:\n Let dp[i][j] represent the maximum profit we can achieve by making at most i transactions up to the j-th day.\n\n 2. State Transition:\n For each day j and each transaction i, we have two choices:\n a. No Transaction on Day j: This means the profit is the same as the profit on day j-1 with i transactions: dp[i][j-1].\n b. Sell on Day j: We need to consider the best day m (0 <= m < j) to buy stock and then sell on day j. This involves adding the profit from selling on day j (prices[j] - prices[m]) to the profit we had \n after making i-1 transactions up to day m: dp[i-1][m] + prices[j] - prices[m].\n The formula becomes: \n dp[i][j]=max(dp[i][j−1], max(prices[j]−prices[m]+dp[i−1][m])) where m<j\n This can be optimized by keeping track of the maximum value of dp[i-1][m] - prices[m] as we iterate through the days.\n \n\n 3. Final Result:\n The final answer will be dp[k][n-1] where n is the number of days.\n ----------\n dp[i][j] = max(dp[i][j-1], prices[j] + max_diff):\n Purpose: This line determines the best possible profit on day j with i transactions:\n\n dp[i][j-1] means no transaction is made on day j, so the profit is the same as the previous day.\n prices[j] + max_diff represents the scenario where we sell on day j. The profit from this action is the price on day j plus the best profit we could have achieved with i-1 transactions before this day (max_diff captures the best possible buy scenario).\n\n max_diff = max(max_diff, dp[i-1][j] - prices[j]):\n \n Purpose: This line updates max_diff to reflect the maximum profit that could be achieved by buying on day j and then selling at a later date:\n dp[i-1][j] - prices[j] gives the profit after i-1 transactions if we buy on day j. This value is compared with the existing max_diff to ensure max_diff always holds the maximum possible profit from buying on any previous day and considering i-1 transactions.\n '''\n n = len(prices)\n if n == 0:\n return 0\n \n # If k >= n // 2, it's equivalent to infinite transactions\n if k >= n // 2:\n max_profit = 0\n for i in range(1, n):\n if prices[i] > prices[i - 1]:\n max_profit += prices[i] - prices[i - 1]\n return max_profit\n \n # DP table to store the maximum profit\n dp = [[0] * n for _ in range(k + 1)]\n \n for i in range(1, k + 1):\n # Track max_diff to optimize the calculation of the maximum profit using a previous transaction.\n max_diff = -prices[0]\n for j in range(1, n):\n # Update dp[i][j] by comparing:\n # Not making a transaction on day j (dp[i][j-1]).\n # Selling on day j (prices[j] + max_diff).\n dp[i][j] = max(dp[i][j - 1], prices[j] + max_diff) \n max_diff = max(max_diff, dp[i - 1][j] - prices[j]) # This represents the maximum profit with at most i-1 transactions up to day j.\n\n \n return dp[k][-1]\n\n '''naive DP\n for i in range(1, k + 1):\n for j in range(1, n):\n max_profit = 0\n for m in range(j):\n max_profit = max(max_profit, prices[j] - prices[m] + dp[i-1][m])\n dp[i][j] = max(dp[i][j-1], max_profit)\n return dp[k][n-1]\n \n The naive approach has a significantly higher time complexity (O(k * n^2)) compared to the optimized approach (O(k * n)).'''","runtime":"98"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n # if max transactions limited by num of days\n if k > len(prices)//2:\n\n t_ik0, t_ik1 = 0, float('-inf')\n\n for price in prices:\n t_ik0, t_ik1 = max(t_ik0, t_ik1 + price), max(t_ik1, t_ik0 - price)\n \n return t_ik0\n \n t_ik0 = [0] * (k+1)\n t_ik1 = [float('-inf')] * (k+1)\n\n for price in prices:\n for j in range(k,0,-1):\n t_ik0[j], t_ik1[j] = max(t_ik0[j], t_ik1[j]+price), max(t_ik1[j], t_ik0[j-1] - price)\n \n return t_ik0[-1]\n","runtime":"98"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # dp[i][k1]: the max balances on the END of i-th day with at most (k1+1) transactions.\n # dp[i][k1] = max(dp[i - 1][k1], dp[j - 1][k1 - 1] + prices[i] - prices[j] for j in range(i))\n # Reference: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/solutions/306282/different-dp-python-solutions-with-thinking-process\n n = len(prices)\n if n < 2: return 0\n dp = [[0] * (k + 1) for _ in range(n)]\n for k1 in range(1, k + 1):\n local_max = -prices[0]\n for i in range(1, n):\n dp[i][k1] = max(dp[i - 1][k1], prices[i] + local_max)\n local_max = max(local_max, dp[i - 1][k1 - 1] - prices[i])\n return dp[-1][-1]\n ","runtime":"102"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n if n == 0 or k == 0:\n return 0\n \n # If k is large enough, we can perform as many transactions as we like\n if k >= n // 2:\n return sum(max(prices[i+1] - prices[i], 0) for i in range(n - 1))\n \n # DP table\n dp = [[0] * n for _ in range(k + 1)]\n \n for i in range(1, k + 1):\n max_diff = -prices[0] # Initial value of max difference\n for j in range(1, n):\n # Update dp[i][j] for the current transaction\n dp[i][j] = max(dp[i][j-1], prices[j] + max_diff)\n # Update max_diff for future days\n max_diff = max(max_diff, dp[i-1][j] - prices[j])\n \n return dp[k][n-1]\n","runtime":"102"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n if not prices or k == 0:\n return 0\n \n\n held = [[-math.inf] * k for i in range(len(prices))]\n sold = [[0] * k for i in range(len(prices))]\n\n held[0][0] = -prices[0]\n \n\n for i in range(1, len(prices)):\n for txn in range(k):\n if txn > 0:\n held[i][txn] = max(held[i-1][txn], sold[i-1][txn-1] - prices[i])\n else:\n held[i][txn] = max(held[i-1][txn], -prices[i])\n\n sold[i][txn] = max(sold[i-1][txn], held[i-1][txn] + prices[i])\n\n res = 0\n for txn in range(k):\n res = max(res, sold[-1][txn])\n return res\n ","runtime":"106"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [[0 for g in range(k+1)] for j in range(2)]\n for i in range(len(prices)-1, -1, -1):\n curr = [[0 for u in range(k+1)] for j in range(2)]\n for tran in range(1,k+1):\n curr[0][tran] = max(dp[1][tran] - prices[i], dp[0][tran])\n curr[1][tran] = max(dp[0][tran - 1] + prices[i], dp[1][tran])\n dp = curr\n return max(dp[0])\n \n def dp(self, prices, index, bought,dp1, trans, k):\n if(index == len(prices) or trans == k):\n return 0\n\n if(dp1[index][bought][trans] != -1):\n return dp1[index][bought][trans]\n take = 0\n notTake = 0\n if(not bought):\n take = self.dp(prices, index+1, True, dp1, trans, k) - prices[index]\n notTake = self.dp(prices, index + 1, False, dp1, trans, k)\n else:\n take = self.dp(prices, index + 1, False, dp1, trans + 1, k) + prices[index]\n notTake = self.dp(prices, index + 1, bought, dp1, trans, k)\n dp1[index][bought][trans] = max(take, notTake)\n return max(take, notTake)","runtime":"106"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [[0]*(1+2*k) for _ in range(len(prices))]\n for i in range(1, 1+2*k, 2):\n dp[0][i] = -prices[0]\n for i in range(1, len(prices)):\n dp[i][0] = dp[i-1][0]\n for j in range(1, 2*k, 2):\n dp[i][j] = max(dp[i-1][j], dp[i-1][j-1] - prices[i])\n dp[i][j+1] = max(dp[i-1][j+1], dp[i-1][j] + prices[i])\n return dp[-1][-1]","runtime":"110"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n=len(prices)\n cap=k+1 #k+1 choices\n buy=2 #2 choices \n #dp=[[[0 for _ in range(cap)] for _ in range(buy)] for _ in range(n+1)]\n ahead=[[0 for _ in range(cap)] for _ in range(buy)]\n cur=[[0 for _ in range(cap)] for _ in range(buy)]\n for i in range(n-1,-1,-1):\n for b in range(2):\n for c in range(1,k+1):\n if(b==0):\n cur[b][c]=max(0+ahead[0][c],-prices[i]+ahead[1][c])\n elif(b==1):\n cur[b][c]=max(0+ahead[1][c],+prices[i]+ahead[0][c-1])\n ahead=cur[:]\n return ahead[0][k]\n ","runtime":"110"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n profitGrid = [[-float('inf')]*len(prices) for _ in range(k*2)]\n\n buyState = 0\n\n for buyState in range(k*2):\n for consideredPrice in range(len(prices)):\n if buyState == 0:\n profitGrid[buyState][consideredPrice] = max(-prices[consideredPrice], profitGrid[buyState][consideredPrice-1])\n elif buyState % 2 == 0:\n profitGrid[buyState][consideredPrice] = max(profitGrid[buyState-1][consideredPrice]-prices[consideredPrice], profitGrid[buyState][consideredPrice-1])\n\n else:\n profitGrid[buyState][consideredPrice] = max(prices[consideredPrice] + profitGrid[buyState-1][consideredPrice], profitGrid[buyState][consideredPrice-1])\n return profitGrid[-1][-1]","runtime":"114"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n holding = [[0 for _ in range(k+1)]for __ in range(n+1)]\n empty = [[0 for _ in range(k+1)]for __ in range(n+1)]\n for i in range(n-1, -1, -1):\n for capa in range(1, k+1):\n holding[i][capa] = max(\n holding[i+1][capa], \n empty[i+1][capa-1] + prices[i]\n )\n empty[i][capa] = max(\n empty[i+1][capa],\n holding[i+1][capa] - prices[i]\n )\n return empty[0][k]\n\n\n\n\n ","runtime":"114"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n aheadRow = [[ 0 for _ in range(k + 1)] for _ in range(2)]\n curRow = [[ 0 for _ in range(k + 1)] for _ in range(2)]\n\n for ind in range(n - 1, -1, -1):\n for capacity in range(1, k + 1):\n curRow[1][capacity] = max(\n -prices[ind] + aheadRow[0][capacity],\n 0 + aheadRow[1][capacity]\n )\n curRow[0][capacity] = max(\n prices[ind] + aheadRow[1][capacity - 1],\n 0 + aheadRow[0][capacity]\n )\n \n aheadRow = list(curRow)\n\n return aheadRow[1][k]\n","runtime":"118"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n if n <=1:\n return 0\n\n buy = [[0]*(k+1) for _ in range(n+1)]\n sell = [[0]*(k+1) for _ in range(n+1)]\n\n for i in range(1,n+1):\n p = prices[i-1]\n for each_k in range(1,k+1): # otherwise each_k-1 will cause problem when in range(0,k)\n if i == 1:\n buy[i][each_k] = -p\n sell[i][each_k] = 0\n else:\n buy[i][each_k] = max(buy[i-1][each_k],sell[i-1][each_k-1]-p)\n sell[i][each_k] = max(sell[i-1][each_k],buy[i-1][each_k]+p)\n return max(sell[-1])\n\n ","runtime":"118"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n # Create the dp array with dimensions [n+1][2][k+1]\n dp = [[[0 for _ in range(k + 1)] for _ in range(2)] for _ in range(n + 1)]\n\n # Fill the dp table in reverse order\n for ind in range(n - 1, -1, -1):\n for buy in range(2):\n for cap in range(1, k + 1):\n if buy == 1:\n # If we are in buying state\n dp[ind][buy][cap] = max(-prices[ind] + dp[ind + 1][0][cap], dp[ind + 1][1][cap])\n else:\n # If we are in selling state\n dp[ind][buy][cap] = max(prices[ind] + dp[ind + 1][1][cap - 1], dp[ind + 1][0][cap])\n\n return dp[0][1][k]\n","runtime":"126"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # def rec(i, holding, transactions, memo):\n # if i == len(prices) or transactions == 0:\n # return 0\n\n # if (i, holding, transactions) in memo:\n # return memo[(i, holding, transactions)]\n\n # notpick = rec(i+1, holding, transactions, memo)\n\n # if holding:\n # pick = prices[i] + rec(i+1, False, transactions-1, memo)\n # else:\n # pick = -prices[i] + rec(i+1, True, transactions, memo)\n\n # memo[(i, holding, transactions)] = max(pick, notpick)\n # return memo[(i, holding, transactions)]\n\n # memo = {}\n # return rec(0, False, k, memo)\n\n n = len(prices)\n dp = [[[0 for _ in range(k+1)] for _ in range(2)] for _ in range(n+1)] \n\n for i in range(n-1, -1, -1):\n for holding in range(2):\n for transactions in range(1, k+1):\n if holding == 0:\n dp[i][holding][transactions] = max(dp[i+1][0][transactions], -prices[i]+dp[i+1][1][transactions])\n else:\n dp[i][holding][transactions] = max(dp[i+1][1][transactions], prices[i]+dp[i+1][0][transactions-1])\n\n return dp[0][0][k]","runtime":"126"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n length = len(prices)\n if length == 0:\n return 0\n dp = [[0] * (2 * k + 1) for _ in range(length)]\n\n for i in range(1, 2 * k + 1, 2):\n dp[0][i] = -prices[0]\n for j in range(1, length):\n dp[j][0] = dp[j-1][0]\n for m in range(1, 2 * k + 1):\n dp[j][m] = max(dp[j-1][m], dp[j-1][m-1] + (-1) ** m * (prices[j]))\n return dp[-1][2 * k]\n ","runtime":"130"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n prev = [[0 for i in range(2)] for j in range(k+1)]\n cur = [[0 for i in range(2)] for j in range(k+1)]\n \n for ind in range(n-1, -1, -1):\n for transactions in range(1, k+1):\n for bought in range(2):\n # if I have already bought a stock\n if bought == 1:\n # I can either sell it\n sell = prices[ind] + prev[transactions-1][0]\n # or keep it\n not_sell = prev[transactions][1]\n cur[transactions][bought] = max(sell, not_sell)\n\n # if I dont have a stock in hand\n else:\n # buy = float('-inf')\n # I can either buy a stock if I haven't done k transactions\n buy = -prices[ind] + prev[transactions][1]\n # or not buy a stock\n not_buy = prev[transactions][0]\n cur[transactions][bought] = max(buy, not_buy)\n \n prev = cur[:]\n \n return prev[k][0]\n ","runtime":"130"},{"code":"class Solution:\n def calculate_profit(self, ind, tranNo, n, prices, dp):\n if ind == n or tranNo == 2 * self.k:\n return 0\n \n if dp[ind][tranNo] != -1:\n return dp[ind][tranNo]\n \n if tranNo % 2 == 0:\n profit = max(\n -prices[ind] + self.calculate_profit(ind + 1, tranNo + 1, n, prices, dp),\n 0 + self.calculate_profit(ind + 1, tranNo, n, prices, dp)\n )\n else:\n profit = max(\n prices[ind] + self.calculate_profit(ind + 1, tranNo + 1, n, prices, dp),\n 0 + self.calculate_profit(ind + 1, tranNo, n, prices, dp)\n )\n \n dp[ind][tranNo] = profit\n\n return dp[ind][tranNo] \n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[ 0 for _ in range(2 * k + 1)] for _ in range(n + 1)]\n\n for ind in range(n - 1, -1, -1):\n for tranNo in range(2 * k - 1, -1, -1):\n if tranNo % 2 == 0:\n profit = max(\n -prices[ind] + dp[ind + 1][tranNo + 1],\n 0 + dp[ind + 1][tranNo]\n )\n else:\n profit = max(\n prices[ind] + dp[ind + 1][tranNo + 1],\n 0 + dp[ind + 1][tranNo]\n )\n \n dp[ind][tranNo] = profit\n\n return dp[0][0]\n","runtime":"133"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[ 0 for _ in range(k + 1)] for _ in range(2)] for _ in range(n + 1)]\n\n\n for ind in range(n - 1, -1, -1):\n for capacity in range(1, k + 1):\n dp[ind][1][capacity] = max(\n -prices[ind] + dp[ind + 1][0][capacity],\n 0 + dp[ind + 1][1][capacity]\n )\n dp[ind][0][capacity] = max(\n prices[ind] + dp[ind + 1][1][capacity - 1],\n 0 + dp[ind + 1][0][capacity]\n )\n\n return dp[0][1][k]\n","runtime":"133"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n=len(prices)\n\n dp=[[[0 for _ in range(k+1)] for _ in range(2)] for _ in range(n+1)]\n\n\n for ind in range(n-1,-1,-1):\n for buy in range(2):\n for cap in range(1,k+1):\n \n if buy == 1:\n dp[ind][buy][cap]=max(0 + dp[ind+1][1][cap] , -prices[ind] + dp[ind+1][0][cap])\n else:\n dp[ind][buy][cap]=max(0 + dp[ind+1][0][cap] , prices[ind] + dp[ind+1][1][cap-1])\n \n return dp[0][1][k]\n\n\n\n ","runtime":"137"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[ 0 for _ in range(k + 1)] for _ in range(2)] for _ in range(n + 1)]\n\n\n for ind in range(n - 1, -1, -1):\n for buy in range(2):\n for capacity in range(1, k + 1):\n if buy:\n profit = max(\n -prices[ind] + dp[ind + 1][0][capacity],\n 0 + dp[ind + 1][1][capacity]\n )\n else:\n profit = max(\n prices[ind] + dp[ind + 1][1][capacity - 1],\n 0 + dp[ind + 1][0][capacity]\n )\n dp[ind][buy][capacity] = profit\n\n return dp[0][1][k]\n","runtime":"137"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n\n # 0 --- 未持有， 1 --- 持有\n n = len(prices)\n d = [[[-math.inf] * 2 for x in range(k+1)] for _ in range(2)]\n\n d[0][1][1] = - prices[0]\n d[0][0][0] = 0\n ans = 0\n cur = 1\n\n for x in range(1,n): \n d[cur][0][0] = 0\n for i in range(1,k+1):\n d[cur][i][0] = max(d[cur^1][i][0], d[cur^1][i][1] + prices[x] )\n d[cur][i][1] = max(d[cur^1][i][1], d[cur^1][i-1][0] - prices[x] )\n ans = max(ans, d[cur][i][0])\n cur ^= 1\n\n return ans","runtime":"141"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n STOCK, CASH = 0, 1 # stock or cash at hand\n dp = collections.defaultdict(int)\n for trans in range(k+1):\n dp[(STOCK, trans)] = -math.inf # no holding at the beginning\n \n for price in prices:\n for trans in range(1, k+1):\n dp[(STOCK, trans)] = max(dp[(STOCK, trans)], dp[(CASH, trans-1)] - price )\n dp[(CASH, trans)] = max(dp[(CASH, trans)], dp[(STOCK, trans)] + price)\n\n return dp[(CASH, k)]\n","runtime":"141"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # Edge Case:\n if not prices or not k:\n return 0\n\n n = len(prices)\n # Special case with 2k > n: this means we have more than enough transactions to secure every possible profit\n res = 0\n if 2 * k >= n:\n for i, j in zip(prices[:-1], prices[1:]):\n res += max(0, j - i)\n return res\n \n # dp[i][j][l] refers to the profit at ith day, using j purchases, holding or not the stock\n # dp = [[[float('-inf')] * 2] * (k + 1)] * n\n dp = [[[-math.inf] * 2 for _ in range(k + 1)] for _ in range(n)]\n dp[0][0][0] = 0\n dp[0][1][1] = -prices[0]\n\n for i in range(1, n):\n for j in range(0, k + 1):\n # Do not hold the stock \n # case 1: did not hold before, and continue so\n # case 2: held it before, and want to sell it\n dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j][1] + prices[i])\n\n # Hold the stock\n # case 1: held it before, and continue so\n # case 2: did not hold it before, and want to buy it \n # noted, you cannot buy it when exceeding purchase limit\n if j > 0:\n dp[i][j][1] = max(dp[i - 1][j - 1][0] - prices[i], dp[i - 1][j][1])\n \n # find the \n res = max(dp[n - 1][j][0] for j in range(k + 1))\n \n return res\n \n\n\n","runtime":"145"},{"code":"class Solution:\n def calculate_profit(self, ind, buy, k, n, prices, dp):\n if ind == n or k == 0:\n return 0\n \n if dp[ind][buy][k] != -1:\n return dp[ind][buy][k]\n\n if buy:\n profit = max(\n -prices[ind] + self.calculate_profit(ind + 1, 0, k, n, prices, dp),\n 0 + self.calculate_profit(ind + 1, 1, k, n, prices, dp)\n )\n else:\n profit = max(\n prices[ind] + self.calculate_profit(ind + 1, 1, k - 1, n, prices, dp),\n 0 + self.calculate_profit(ind + 1, 0, k, n, prices, dp)\n )\n \n dp[ind][buy][k] = profit\n return dp[ind][buy][k]\n \n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[ 0 for _ in range(k + 1)] for _ in range(2)] for _ in range(n + 1)]\n\n\n for ind in range(n - 1, -1, -1):\n for buy in range(2):\n for capacity in range(1, k + 1):\n if buy:\n profit = max(\n -prices[ind] + dp[ind + 1][0][capacity],\n 0 + dp[ind + 1][1][capacity]\n )\n else:\n profit = max(\n prices[ind] + dp[ind + 1][1][capacity - 1],\n 0 + dp[ind + 1][0][capacity]\n )\n dp[ind][buy][capacity] = profit\n\n return dp[0][1][k]\n","runtime":"145"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n # solve special cases\n if not prices or k == 0:\n return 0\n\n if k * 2 >= n:\n res = 0\n for i, j in zip(prices[1:], prices[:-1]):\n res += max(0, i - j)\n return res\n\n # dp[i][used_k][ishold] = balance\n # ishold: 0 nothold, 1 hold\n dp = [[[-math.inf] * 2 for _ in range(k + 1)] for _ in range(n)]\n\n # set starting value\n dp[0][0][0] = 0\n dp[0][1][1] = -prices[0]\n\n # fill the array\n for i in range(1, n):\n for j in range(k + 1):\n # transition equation\n dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j][1] + prices[i])\n # you can't hold stock without any transaction\n if j > 0:\n dp[i][j][1] = max(\n dp[i - 1][j][1], dp[i - 1][j - 1][0] - prices[i]\n )\n\n res = max(dp[n - 1][j][0] for j in range(k + 1))\n return res","runtime":"149"},{"code":"class Solution:\n def calculate_profit(self, ind, tranNo, n, prices, dp):\n if ind == n or tranNo == 2 * self.k:\n return 0\n \n if dp[ind][tranNo] != -1:\n return dp[ind][tranNo]\n \n if tranNo % 2 == 0:\n profit = max(\n -prices[ind] + self.calculate_profit(ind + 1, tranNo + 1, n, prices, dp),\n 0 + self.calculate_profit(ind + 1, tranNo, n, prices, dp)\n )\n else:\n profit = max(\n prices[ind] + self.calculate_profit(ind + 1, tranNo + 1, n, prices, dp),\n 0 + self.calculate_profit(ind + 1, tranNo, n, prices, dp)\n )\n \n dp[ind][tranNo] = profit\n\n return dp[ind][tranNo] \n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n self.k = k\n dp = [[ -1 for _ in range(2 * k)] for _ in range(n)]\n return self.calculate_profit(0, 0, n, prices, dp)\n","runtime":"149"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n STOCK, CASH = 0, 1\n dp = defaultdict(int) \n for idx in range(k+1):\n dp[STOCK, idx] = -float('inf')\n for price in prices:\n for idx in range(1,k+1):\n dp[CASH,idx] = max(dp[CASH,idx], dp[STOCK,idx] + price)\n dp[STOCK,idx] = max(dp[STOCK,idx], dp[CASH,idx-1] - price)\n return dp[CASH,k]","runtime":"153"},{"code":"class Solution:\n def maxProfit(self, k: int, nums: List[int]) -> int:\n n = len(nums)\n dp = [[[0]*(k+1) for i in range(2)] for j in range(n+1)]\n for i in range(n-1,-1,-1):\n for j in range(2):\n for k in range(1,k+1):\n profit = 0\n if j:\n ntake = dp[i+1][1][k]\n take = -nums[i] + dp[i+1][0][k]\n profit = max(ntake,take)\n else:\n ntake1 = dp[i+1][0][k]\n take1 = nums[i] + dp[i+1][1][k-1]\n profit = max(ntake1,take1)\n dp[i][j][k] = profit\n ans = 0\n print(dp)\n for i in range(k+1):\n ans = max(ans,dp[0][1][i])\n return ans\n\n","runtime":"153"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # 今天有, 最大交易次數還有t\n t = k\n\n days = len(prices)\n dp = [[[0] * 2 for i in range(t + 1)] for j in range(days + 1)]\n # dp[0][...][0] = dp[...][0][0] = 0\n # dp[0][...][1] = dp[...][0][1] = float(\"-inf\")\n for i in range(t + 1):\n dp[0][i][1] = float(\"-inf\")\n for i in range(1, days + 1):\n dp[i][0][1] = float(\"-inf\")\n # print(dp)\n\n for day in range(1, days + 1):\n for i in range(1, t + 1):\n if day == 1:\n dp[day][i][0] = 0\n dp[day][i][1] = -prices[day - 1]\n continue\n dp[day][i][0] = max(dp[day - 1][i][0], dp[day - 1][i][1] + prices[day - 1])\n dp[day][i][1] = max(dp[day - 1][i][1], dp[day - 1][i - 1][0] - prices[day - 1])\n\n # print(dp)\n\n return dp[-1][-1][0]","runtime":"157"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # bottom up\n n = len(prices)\n if not n: return 0\n dp = [[[float('-inf')] * 2 for _ in range(k + 1)] for _ in range(n)] # prices index, current k, not bought / bought\n dp[0][0][0] = 0\n dp[0][1][1] = -prices[0]\n\n for i in range(1, n):\n for j in range(k + 1):\n dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j][1] + prices[i])\n if j > 0:\n dp[i][j][1] = max(dp[i - 1][j][1], dp[i - 1][j - 1][0] - prices[i])\n \n return max(dp[n - 1][j][0] for j in range(k + 1))\n\n\n # top down\n @cache\n def dfs(i, bought, remaining):\n if not remaining or i >= len(prices): return 0\n if bought:\n not_sell = dfs(i + 1, True, remaining)\n sell = dfs(i + 1, False, remaining - 1) + prices[i]\n return max(not_sell, sell)\n else:\n not_buy = dfs(i + 1, False, remaining)\n buy = dfs(i + 1, True, remaining) - prices[i]\n return max(not_buy, buy)\n \n return dfs(0, False, k)","runtime":"157"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp=[[0]*(2*k+1) for _ in range(len(prices))]\n for i in range(2*k+1):\n if i%2:\n dp[0][i]= -prices[0] # 奇数，也就是每次买入时间，初始成-prices[0]\n \n for i in range(1,len(prices)):\n for j in range(0,2*k,2): # 注意j每次加二，并且上限是2k\n print(j)\n # 买入\n dp[i][j+1]= max(dp[i-1][j+1],dp[i-1][j]-prices[i])\n # 卖出\n dp[i][j+2]= max(dp[i-1][j+2],dp[i-1][j+1]+prices[i])\n return dp[-1][-1]\n ","runtime":"161"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n if k * 2 >= len(prices):\n maxProfit = 0\n for i,j in zip(prices[1:], prices[:-1]):\n maxProfit += i-j if i >= j else 0\n return maxProfit\n dp = [[[-float('inf')] * 2 for _ in range(k+1)] for _ in range(len(prices))]\n dp[0][0][0] = 0\n dp[0][1][1] = -prices[0]\n for i in range(1, len(prices)):\n for j in range(k+1):\n dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1] + prices[i])\n if j > 0: dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j-1][0] - prices[i])\n maxProfit = -float('inf')\n for j in range(k+1):\n maxProfit = max(maxProfit, dp[len(prices)-1][j][0])\n return maxProfit\n ","runtime":"161"},{"code":"from typing import List\n\n\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[0] * 2 for _ in range(k+1) ] for _ in range(n+1) ]\n\n for i in range(n-1,-1, -1):\n for remain_k in range(1, k+1):\n for holding in range(2):\n do_nothing = dp[i+1][remain_k][holding]\n\n if holding:\n do_something = prices[i] + dp[i+1][remain_k-1][0]\n else: \n do_something = -prices[i] + dp[i+1][remain_k][1]\n dp[i][remain_k][holding] = max(do_nothing, do_something)\n return dp[0][k][0]\n","runtime":"165"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[0] * 2 for _ in range(k + 1)] for _ in range(n + 1)]\n\n for i in range(n - 1, -1, -1):\n for transactions_remaining in range(1, k + 1):\n for holding in range(2):\n do_nothing = dp[i + 1][transactions_remaining][holding]\n\n if holding:\n do_something = prices[i] + dp[i + 1][transactions_remaining - 1][0]\n else:\n do_something = -prices[i] + dp[i + 1][transactions_remaining][1]\n \n dp[i][transactions_remaining][holding] = max(do_something, do_nothing)\n \n return dp[0][k][0]","runtime":"165"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n#Top Down DP\n# Let dp(i,op,holding) represents maximum achievable profit #i: current day, op remaining operations, holding:(1:holding 0:not holding)\n # memo = {}\n # def dp(i,op,holding):\n # if (i,op,holding) in memo: return memo[(i,op,holding)]\n # #Base Case: when we run out of ops or no longer on the market,\n # # we cannot make any money\n # if op == 0 or i == len(prices):\n # return 0\n # if holding: #If we are holding stock, We can sell, or not sell\n # sell = prices[i]+ dp(i+1, op-1, 0)\n # not_sell = dp(i+1, op, 1)\n # memo[(i,op,holding)] = max(sell, not_sell)\n # else: #If we are holding stock, We can buy or not buy\n # buy = dp(i+1, op, 1) - prices[i]\n # not_buy = dp(i+1, op, 0)\n # memo[(i,op,holding)] = max(buy,not_buy)\n # return memo[(i,op,holding)]\n # return dp(0,k,0)\n #Time:O(nk) Space:O(n) where n = len(prices)\n\n\n#Bottom Up\n# Let dp(i,op,holding) represents maximum achievable profit #i: current day, op remaining operations, holding:(1:holding 0:not holding)\n n = len(prices)\n dp = [[[0]*2 for _ in range(k+1)] for _ in range(n+1)]\n for i in range(n-1,-1,-1):\n for op in range(1,k+1):\n for holding in range(2):\n if holding == 1:\n sell = dp[i+1][op-1][0] + prices[i]\n not_sell = dp[i+1][op][1]\n dp[i][op][holding] = max(sell,not_sell)\n else:\n buy = dp[i+1][op][1] - prices[i]\n not_buy = dp[i+1][op][0]\n dp[i][op][holding] = max(buy,not_buy)\n\n return dp[0][k][0]\n","runtime":"168"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[0] * 2 for _ in range(k + 1)] for __ in range(n + 1)]\n for i in range(n-1, -1, -1):\n for transactions_remaining in range(1, k + 1):\n for holding in range(2):\n if holding == 1:\n # if holding we have 2 cases we sell or do nothing\n dp[i][transactions_remaining][holding] = (\n max(prices[i] + dp[i + 1][transactions_remaining - 1][0],\n dp[i + 1][transactions_remaining][holding]))\n else:\n # if not holding we have 2 cases we buy or do nothing\n dp[i][transactions_remaining][holding] = (\n max(-prices[i] + dp[i + 1][transactions_remaining][1],\n dp[i + 1][transactions_remaining][holding]))\n return dp[0][k][0]\n ","runtime":"168"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # solve special cases\n if not prices or k == 0:\n return 0\n n = len(prices)\n\n if k * 2 >= n:\n res = 0\n for i, j in zip(prices[1:], prices[:-1]):\n res += max(0, i-j)\n return res\n\n # dp[i][used_k][ishold] = balance\n # ishold: 0 nothold, 1 hold\n #dp = [[[-math.inf] * 2 for _ in range(k + 1)] for _ in range(n)]\n dp = [[[-math.inf]*2 for _ in range(k+1)] for _ in range(n)]\n\n\n # set starting value\n dp[0][0][0] = 0\n dp[0][1][1] = -prices[0]\n\n for i in range(1, n):\n for j in range(k+1):\n dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1] + prices[i])\n if j > 0:\n dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j-1][0] - prices[i])\n\n # fill the array\n # for i in range(1, n):\n # for j in range(k + 1):\n # # transition equation\n # dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j][1] + prices[i])\n # # you can't hold stock without any transaction\n # if j > 0:\n # dp[i][j][1] = max(\n # dp[i - 1][j][1], dp[i - 1][j - 1][0] - prices[i]\n # )\n\n res = max(dp[n-1][j][0] for j in range(k+1))\n # res = max(dp[n - 1][j][0] for j in range(k + 1))\n return res","runtime":"172"},{"code":"class Solution:\n # DP --> Memoization\n # Time complexity = O(n*2)\n # Space complexity = O(n*2) + O(n)\n def maxProfit(self, k: int, prices: List[int]) -> int:\n def f(idx, buy, cap, dp):\n if idx == n or cap == 0:\n return 0\n if dp[idx][buy][cap] != -1: return dp[idx][buy][cap]\n if buy:\n profit = max((-prices[idx] + f(idx+1, 0, cap, dp)), (0 + f(idx+1, 1, cap, dp)))\n else:\n profit = max((prices[idx] + f(idx+1, 1, cap-1, dp)), (0 + f(idx+1, 0, cap, dp)))\n \n dp[idx][buy][cap] = profit\n return profit\n\n n = len(prices)\n dp = [[[-1] * (k+1) for i in range(2)] for i in range(n)] \n return f(0, 1, k, dp)","runtime":"172"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n if n == 0 :\n return 0\n\n dp = [[[-1 for _ in range(k + 1)] for _ in range(2)] for _ in range(n + 1)]\n\n def memoization(ind, buy, cap):\n if ind == n or cap == 0:\n return 0\n\n if dp[ind][buy][cap] != -1:\n return dp[ind][buy][cap]\n \n profit = 0\n if buy == 0: # Can buy : max(buy, not buy)\n profit = max(-prices[ind] + memoization(ind + 1, 1, cap), 0 + memoization(ind + 1, 0, cap))\n elif buy == 1: # Can sell: max(sell, not sell)\n profit = max(+prices[ind] + memoization(ind + 1, 0, cap - 1), 0 + memoization(ind + 1, 1, cap))\n else:\n return 0\n dp[ind][buy][cap] = profit\n\n return profit\n\n return memoization(0, 0, k)\n\n # TC: \n\n\n ","runtime":"176"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[0] * 2 for _ in range(k + 1)] for __ in range(n + 1)]\n\n for i in range(n - 1, -1, -1):\n for j in range(k - 1, -1, -1):\n for holding in range(2):\n res = dp[i + 1][j][holding]\n\n if holding: # sell\n res = max(res, dp[i + 1][j + 1][0] + prices[i])\n else: # buy\n res = max(res, dp[i + 1][j][1] - prices[i])\n dp[i][j][holding] = res\n \n return dp[0][0][0]\n\n\n\n @lru_cache(None)\n def dp(day, j, holding):\n # out of transactions or out of days\n if j == 0 or day == len(prices):\n return 0\n\n # do nothing\n res = dp(day + 1, j, holding)\n\n if holding:\n # sell, gain profit from the price today\n res = max(res, dp(day + 1, j - 1, 0) + prices[day])\n else:\n # buy, subtract price of today from profits\n res = max(res, dp(day + 1, j, 1) - prices[day])\n return res\n\n return dp(0, k, 0)\n\"\"\"\ndp(day, j, holding)\n\nRR: dp(i, j, holding) = max(doNothing, sell) if holding else max(doNothing, buy)\n\"\"\"","runtime":"176"},{"code":"\"\"\"\n\nState Variables: we need to keep track of the day and the amount of transactions we can take and the amount of stocks you're holding\n\nRecurrence Relation: We can either buy the stock on the ith day or not. If you bought a stock, you must next sell it before buying another.\n\n\n\n\"\"\"\n\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[0] * 2 for _ in range(k + 1)] for __ in range(n + 1)]\n \n for i in range(n - 1, -1, -1):\n for trans in range(1, k + 1):\n for h in range(2):\n nothing = dp[i + 1][trans][h]\n something = 0\n\n if h:\n something = prices[i] + dp[i + 1][trans - 1][0]\n else:\n something = -prices[i] + dp[i + 1][trans][1]\n \n dp[i][trans][h] = max(something, nothing)\n\n return dp[0][k][0]","runtime":"180"},{"code":"\"\"\"\n\nState Variables: we need to keep track of the day and the amount of transactions we can take and the amount of stocks you're holding\n\nRecurrence Relation: We can either buy the stock on the ith day or not. If you bought a stock, you must next sell it before buying another.\n\n\n\n\"\"\"\n\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[0] * 2 for _ in range(k + 1)] for __ in range(n + 1)]\n \n for i in range(n - 1, -1, -1):\n for trans in range(1, k + 1):\n for h in range(2):\n nothing = dp[i + 1][trans][h]\n something = 0\n if h:\n something = prices[i] + dp[i + 1][trans - 1][0]\n else:\n something = -prices[i] + dp[i + 1][trans][1]\n \n dp[i][trans][h] = max(something, nothing)\n\n return dp[0][k][0]","runtime":"180"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [[ -1 for j in range(2*k)] for i in range(len(prices)+1)]\n\n def calProfit(i: int, t: int) -> int:\n if i>len(prices)-1 or t>2*k-1:\n return 0 \n\n if dp[i][t] != -1:\n return dp[i][t]\n \n if t%2==0:\n dp[i][t] = max((-prices[i] + calProfit(i+1, t+1)), calProfit(i+1,t)) \n return dp[i][t]\n else:\n dp[i][t] = max((prices[i] + calProfit(i+1, t+1)), calProfit(i+1,t))\n return dp[i][t] \n\n return calProfit(0,0) \n \n\n \n ","runtime":"184"},{"code":"class Solution:\n def maxProfitInfiniteK(self, prices):\n dp = [[0 for _ in range(2)] for _ in range(len(prices))]\n for i in range(len(prices)):\n if i == 0:\n dp[i][0] = 0\n dp[i][1] = -prices[0]\n continue\n dp[i][0] = max(dp[i-1][0], dp[i-1][1] + prices[i])\n dp[i][1] = max(dp[i-1][1], dp[i-1][0] - prices[i])\n\n return dp[-1][0] \n\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n if k > len(prices)//2:\n return self.maxProfitInfiniteK(prices)\n dp = [[[0 for _ in range(2)] for _ in range(k+1)] for _ in range(len(prices))]\n for i in range(len(prices)):\n for _k in range(k, 0, -1):\n if i == 0:\n dp[i][_k][0] = 0\n dp[i][_k][1] = -prices[i]\n continue\n dp[i][_k][0] = max(dp[i-1][_k][0], dp[i-1][_k][1] + prices[i])\n dp[i][_k][1] = max(dp[i-1][_k][1], dp[i-1][_k-1][0] - prices[i])\n return dp[-1][k][0]\n\n","runtime":"184"},{"code":"class Solution:\n def f(self, day, buy, cap, prices, n, dp):\n if cap == 0 or day == n:\n return 0\n if dp[day][buy][cap] != -1:\n return dp[day][buy][cap]\n if buy == 1:\n dp[day][buy][cap] = max(-prices[day]+self.f(day+1, 0, cap, prices, n, dp),\n self.f(day+1, 1, cap, prices, n, dp))\n return dp[day][buy][cap]\n\n dp[day][buy][cap] = max(prices[day]+self.f(day+1, 1, cap-1, prices, n, dp),\n self.f(day+1, 0, cap, prices, n, dp))\n return dp[day][buy][cap]\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[-1 for _ in range(k+1)] for _ in range(2)] for _ in range(n)]\n return self.f(0, 1, k, prices, n, dp)","runtime":"188"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [[[-inf] * 2 for _ in range(k+1)] for __ in range(len(prices))]\n for i in range(len(prices)):\n dp[i][0][0] = 0\n for j in range(1, k+1):\n dp[0][j][0] = 0\n dp[0][j][1] = -prices[0]\n dp[0][1][1] = -prices[0]\n for i in range(1, len(prices)):\n # dp[i][0][0] = 0\n # dp[i][1][1] = -prices[0]\n for j in range(1, k+1):\n # only count the transaction when buy\n dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1] + prices[i])\n dp[i][j][1] = max(dp[i-1][j-1][0] - prices[i], dp[i-1][j][1])\n # if dp[i-1][j][0] != 0 or dp[i-1][j][1] != 0:\n # dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1] + prices[i])\n # dp[i][j][1] = max(dp[i-1][j-1][0] - prices[i], dp[i-1][j][1])\n # else:\n # break\n print(dp)\n ret = 0\n for j in range(1, k+1):\n ret = max(ret, dp[-1][j][0])\n return ret","runtime":"188"},{"code":"class Solution:\n def maxProfit(self, kk: int, prices: List[int]) -> int:\n # daylength = len(prices)\n\n # everyday, I can buy, sell, or hold\n # @cache\n # def dp(startday, remainK, hasStock):\n # if startday >= daylength - 1:\n # if not hasStock:\n # return 0\n # else:\n # return prices[startday]\n # res = []\n # best1 = dp(startday + 1, remainK, hasStock)\n # res.append(best1)\n # if not hasStock and remainK > 0:\n # best2 = dp(startday + 1, remainK, True) - prices[startday]\n # res.append(best2)\n # if hasStock and remainK > 0:\n # best3 = dp(startday + 1, remainK - 1, False) + prices[startday]\n # res.append(best3)\n # # print(startday, remainK, purchaseDay, res)\n # return max(res)\n\n # return dp(0, k, False)\n\n dp = [[[-math.inf, -math.inf] for k in range(kk + 1)] for i in range(len(prices))]\n for i in range(len(prices)):\n dp[i][0][0] = 0\n dp[i][0][1] = -prices[i]\n for k in range(kk + 1):\n if k > 0:\n dp[0][k][0] = 0\n dp[0][k][1] = -math.inf\n for i in range(1, len(prices)):\n for k in range(0, kk + 1):\n dp[i][k][1] = max(dp[i - 1][k][1], dp[i - 1][k][0] - prices[i])\n if k > 0:\n dp[i][k][0] = max(dp[i - 1][k][0], dp[i - 1][k - 1][1] + prices[i])\n ans = 0\n print(dp)\n for k in range(kk + 1):\n print(ans, dp[-1][k][0])\n ans = max(dp[-1][k][0], dp[-1][k][1], ans)\n return ans\n","runtime":"192"},{"code":"# class Solution:\n# def maxProfit(self, k: int, prices: List[int]) -> int:\n# n = len(prices)\n# dp = [[[0, 0] for _ in range(k+1)] for _ in range(n+1)]\n\n# for i in reversed(range(n)):\n# # representing the index of the price\n# for j in range(1, k + 1):\n# # representing which transaction it's on\n# # 0 - not holding a stock, 1 - holding a stock\n# dp[i][j][0] = max(-prices[i] + dp[i+1][j][1], dp[i+1][j][0])\n# dp[i][j][1] = max(prices[i] + dp[i+1][j-1][0], dp[i+1][j][1])\n\n# print(dp)\n# return dp[0][k][0]\n \nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[0, 0] for _ in range(k)] for _ in range(n)]\n\n # how much we can earn at last price? We can only sell at last price\n dp[-1] = [[0, prices[-1]] for _ in range(k)]\n\n for i in reversed(range(n-1)):\n for j in range(k):\n if j == k - 1:\n dp[i][j][1] = max(prices[i], dp[i+1][j][1]) # last transaction, cannot sell anymore\n else:\n dp[i][j][1] = max(prices[i] + dp[i+1][j+1][0], dp[i+1][j][1])\n \n dp[i][j][0] = max(-prices[i] + dp[i+1][j][1], dp[i+1][j][0])\n\n\n print(dp)\n\n return dp[0][0][0]\n\n#[[[8, 9], [11, 12]], [[8, 9], [11, 12]], [[7, 9], [8, 12]], [[7, 9], [7, 12]], [[7, 9], [7, 9]], [[0, 9], [0, 9]], [[0, 7], [0, 7]]]\n ","runtime":"192"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [[[-1 for l in range(k+1)] for i in range(2)] for j in range(len(prices))]\n def maxProfitHelper(arr, i, take, count, dp):\n if i >= len(prices) or count == 0:\n return 0\n if dp[i][take][count] != -1:\n return dp[i][take][count]\n taken = 0\n notTaken = 0\n if take:\n taken = -arr[i] + maxProfitHelper(arr, i + 1, 0, count, dp)\n notTaken = maxProfitHelper(arr, i + 1, 1, count, dp)\n else:\n taken = arr[i] + maxProfitHelper(arr, i + 1, 1, count - 1, dp)\n notTaken = maxProfitHelper(arr, i + 1, 0, count, dp)\n dp[i][take][count] = max(taken, notTaken)\n return dp[i][take][count]\n return maxProfitHelper(prices, 0, 1, k, dp)\n \n\n","runtime":"196"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n\n dp = []\n n = len(prices)\n\n for i in range(n+1):\n dp.append([[-1]*(k+1) for i in range(2)])\n\n def solve(index, buy, k):\n if index==len(prices) or k==0:\n return 0\n\n if dp[index][buy][k]!=-1:\n return dp[index][buy][k]\n\n if buy==1:\n dp[index][buy][k] = max(-prices[index]+solve(index+1, 0, k), solve(index+1, 1, k))\n else:\n dp[index][buy][k] = max(prices[index]+solve(index+1, 1, k-1), solve(index+1, 0, k))\n\n return dp[index][buy][k]\n\n return solve(0, 1, k)\n\n","runtime":"196"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n\n dp = []\n n = len(prices)\n\n for i in range(n+1):\n dp.append([[-1]*(k+1) for i in range(2)])\n\n def solve(index, buy, k):\n if index==len(prices) or k==0:\n return 0\n\n if dp[index][buy][k]!=-1:\n return dp[index][buy][k]\n\n if buy==1:\n dp[index][buy][k] = max(-prices[index]+solve(index+1, 0, k), solve(index+1, 1, k))\n else:\n dp[index][buy][k] = max(prices[index]+solve(index+1, 1, k-1), solve(index+1, 0, k))\n\n return dp[index][buy][k]\n\n return solve(0, 1, k)\n\n","runtime":"199"},{"code":"class Solution:\n def maxProfit(self, k: int, p: List[int]) -> int:\n n=len(p)\n d=[[[-1e9 for x in range(k+1)] for j in range(2)] for i in range(n)]\n def fun(i,b,r):\n if i>=n or (r==0):\n return 0\n if d[i][b][r]!=-1e9:\n return d[i][b][r]\n if (b):\n d[i][b][r] = max(-p[i]+fun(i+1,0,r),fun(i+1,b,r))\n return d[i][b][r]\n else:\n d[i][b][r] = max(+p[i]+fun(i+1,1,r-1),fun(i+1,b,r))\n return d[i][b][r]\n return fun(0,1,k)","runtime":"199"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [[[-1] * k for _ in range(2)] for _ in range(len(prices))]\n \n def help(i, j, x):\n if i == len(prices): # If all days are processed\n return 0\n if x == k: # If the maximum number of transactions is reached\n return 0\n if dp[i][j][x] != -1: # If already computed\n return dp[i][j][x]\n \n # Calculate profit based on holding or not holding stock\n ans = 0\n if j:\n ans = -prices[i] + help(i + 1, 1 - j, x)\n else:\n ans = prices[i] + help(i + 1, 1 - j, x + 1)\n \n # Take the maximum of not making a transaction on the current day\n ans = max(ans, help(i + 1, j, x))\n \n # Store the result in the dp array\n dp[i][j][x] = ans\n return ans\n \n return help(0, 1, 0)","runtime":"203"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n N = len(prices)\n\n @cache\n def dp(i, isBuy, t):\n if i == N:\n return 0\n \n if t == 0:\n return 0\n \n maxProfit = float(\"-inf\")\n \n if isBuy:\n buyNowProfit = -prices[i] + dp(i + 1, False, t - 1)\n buyLaterProfit = dp(i + 1, True, t)\n maxProfit = max(buyNowProfit, buyLaterProfit)\n else:\n sellNowProfit = prices[i] + dp(i + 1, True, t - 1)\n sellLaterProfit = dp(i + 1, False, t)\n maxProfit = max(sellNowProfit, sellLaterProfit)\n \n return maxProfit\n\n\n dp = [[0, 0] for _ in range(1 + 2 * k)]\n\n\n for i in range(N - 1, -1, -1):\n newDP = [[0, 0] for _ in range(1 + 2 * k)]\n for t in range(1, 2 * k + 1):\n for isBuy in [1, 0]:\n if isBuy:\n buyNowProfit = -prices[i] + dp[t - 1][0]\n buyLaterProfit = dp[t][1]\n maxProfit = max(buyNowProfit, buyLaterProfit)\n else:\n sellNowProfit = prices[i] + dp[t - 1][1]\n sellLaterProfit = dp[t][0]\n maxProfit = max(sellNowProfit, sellLaterProfit)\n \n newDP[t][isBuy] = maxProfit\n \n dp = newDP\n \n return newDP[2 * k][1]","runtime":"203"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[-1 for _ in range(k+1)] for _ in range(2)] for _ in range(n)]\n def f(ind,buy,k):\n if ind == n or k == 0:\n return 0\n \n if dp[ind][buy][k] != -1:\n return dp[ind][buy][k]\n \n if buy == 0:\n dp[ind][buy][k] = max(0 + f(ind + 1,buy,k) , -prices[ind] + f(ind + 1,1,k))\n elif buy == 1:\n dp[ind][buy][k] = max(0 + f(ind + 1,buy,k) , prices[ind] + f(ind + 1,0,k-1))\n return dp[ind][buy][k]\n return f(0,0,k)","runtime":"207"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n=len(prices)\n dp=[[[-1]*(k+1) for _ in range(2)]for _ in range(n)]\n\n def f(ind,buy,cap):\n if ind==n or cap==0:\n return 0\n if dp[ind][buy][cap]!=-1:\n return dp[ind][buy][cap]\n profit=0\n if buy==0:\n take=f(ind+1,1,cap)-prices[ind]\n not_take=0+f(ind+1,0,cap)\n profit=max(take,not_take)\n else:\n take=f(ind+1,0,cap-1)+prices[ind]\n not_take=0+f(ind+1,1,cap)\n profit=max(take,not_take)\n dp[ind][buy][cap]=profit\n return dp[ind][buy][cap]\n return f(0,0,k)\n \n ","runtime":"207"},{"code":"class Solution:\n def solve(self, prices:List[int],i:int,buy:int,k:int,dp):\n if i>=len(prices):\n return 0\n if k==0 :\n return 0\n if dp[i][buy][k]!=-1 :\n return dp[i][buy][k] \n profit=0\n if buy :\n exc = self.solve(prices,i+1,1,k,dp)\n inc= -prices[i]+ self.solve(prices,i+1,0,k,dp)\n profit=max(exc,inc)\n else:\n exc = self.solve(prices,i+1,0,k,dp)\n inc= prices[i] + self.solve(prices,i+1,1,k-1,dp)\n profit=max(exc,inc) \n dp[i][buy][k]= profit\n return dp[i][buy][k]\n \n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [ [[-1 for _ in range(k+1)] for _ in range(3)] for _ in range(len(prices))]\n return self.solve(prices,0,1,k,dp)","runtime":"211"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n n = len(prices)\n dp = [[[0] * 2 for _ in range(k + 1)] for __ in range(n + 1)]\n \n # consider dp[i][remain] to store max profit made considering last n-i+1 stocks (inclusive)\n # and remaining operations left\n for i in range(n-1, -1, -1):\n for remain in range(1, k+1): \n for hold in range(0, 2):\n if hold == 0: # not holding a stock\n # 1. do nothing\n # 2. buy the stock\n dp[i][remain][hold] = max(\n dp[i+1][remain][hold],\n dp[i+1][remain][1] - prices[i],\n )\n\n else: # holding a stock\n # 1. do nothing\n # 2. sell the stock\n dp[i][remain][hold] = max(\n dp[i+1][remain][hold],\n dp[i+1][remain-1][0] + prices[i],\n )\n \n print(dp)\n return dp[0][k][0]\n","runtime":"211"},{"code":"class Solution:\n def helper(self, txnType, k, prices, index, cache):\n if index == len(prices) or k == 0:\n return 0\n if cache[index][k][txnType] != -1:\n return cache[index][k][txnType]\n value = 0\n\n if txnType == 0: # current needs to be Buy\n res1 = self.helper(0, k, prices, index + 1, cache)\n res2 = self.helper(1, k, prices, index + 1, cache) - prices[index]\n value = max(res1, res2)\n else:\n res1 = self.helper(1, k, prices, index + 1, cache)\n res2 = prices[index] + self.helper(0, k - 1, prices, index + 1, cache)\n value = max(res1, res2)\n cache[index][k][txnType] = value\n return value\n \n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n cache = [[[-1, -1] for i in range(k + 1)] for j in range(n)]\n value = self.helper(0, k, prices, 0, cache)\n return value\n ","runtime":"215"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp=[[[-1 for _ in range(k+1)] for _ in range(2)]for _ in range(len(prices))]\n def func(ind,buy,k,prices: List[int],dp):\n if ind==len(prices) or k==0:\n return 0\n if dp[ind][buy][k]!= -1: return dp[ind][buy][k]\n if buy:\n dp[ind][buy][k]=max(-prices[ind]+func(ind+1,0,k,prices,dp),func(ind+1,1,k,prices,dp))\n else:\n dp[ind][buy][k]=max(prices[ind]+func(ind+1,1,k-1,prices,dp),func(ind+1,0,k,prices,dp))\n return dp[ind][buy][k]\n return func(0,1,k,prices,dp)\n ","runtime":"215"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n=len(prices)\n memo=[[[-1 for _ in range(k)] for _ in range(2)] for _ in range(n)]\n def dp(i,buy,tl):\n if tl==k or i==n:\n return 0\n if memo[i][buy][tl]!=-1:\n return memo[i][buy][tl]\n memo[i][buy][tl]=dp(i+1,buy,tl)\n if buy==0:\n memo[i][buy][tl]=max(memo[i][buy][tl],dp(i+1,1,tl)-prices[i])\n if buy==1:\n memo[i][buy][tl]=max(memo[i][buy][tl],dp(i+1,0,tl+1)+prices[i])\n return memo[i][buy][tl]\n return dp(0,0,0)","runtime":"219"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n @cache\n def recur(bought, i, k):\n if k == 0 or i == len(prices):\n return 0\n result = recur(bought, i + 1, k) # Don't buy anything new, or sell held stock\n if bought:\n result = max(result, prices[i] + recur(False, i + 1, k - 1)) # Sell at this price\n else:\n result = max(result, recur(True, i + 1, k) - prices[i]) # Buy at this price\n return result\n \n return recur(False, 0, k)","runtime":"219"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp1 = [[[-1 for m in range(k)] for j in range(2)] for i in range(len(prices))] \n return max(self.dp(prices, 0, False, dp1, 0, k), 0)\n \n def dp(self, prices, index, bought,dp1, trans, k):\n if(index == len(prices) or trans == k):\n return 0\n\n if(dp1[index][bought][trans] != -1):\n return dp1[index][bought][trans]\n take = 0\n notTake = 0\n if(not bought):\n take = self.dp(prices, index+1, True, dp1, trans, k) - prices[index]\n notTake = self.dp(prices, index + 1, False, dp1, trans, k)\n else:\n take = self.dp(prices, index + 1, False, dp1, trans + 1, k) + prices[index]\n notTake = self.dp(prices, index + 1, bought, dp1, trans, k)\n dp1[index][bought][trans] = max(take, notTake)\n return max(take, notTake)","runtime":"223"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n profit = 0\n dp = [[[0 for _ in range(k+1)] for _ in range(len(prices)+1)] for _ in range(2)]\n\n return self.recur(True, 0, k, prices, dp)\n\n def recur(self, canBuy, ind, k, prices, dp):\n if k == 0 or ind == len(prices):\n return 0\n\n if dp[canBuy][ind][k] != 0:\n return dp[canBuy][ind][k]\n\n if canBuy:\n dp[canBuy][ind][k] = max(-prices[ind] + self.recur(not canBuy, ind+1, k, prices, dp), self.recur(canBuy, ind+1, k, prices, dp))\n\n else:\n dp[canBuy][ind][k] = max(prices[ind] + self.recur(not canBuy, ind+1, k-1, prices, dp), self.recur(canBuy, ind+1, k, prices, dp))\n\n return dp[canBuy][ind][k]","runtime":"223"},{"code":"class Solution:\n def helper(self,ind,buy,pri,k,dp):\n if ind == len(pri) or k == 0:\n return 0\n\n if dp[ind][k][buy] != -1:\n return dp[ind][k][buy] \n \n profit = 0\n if buy:\n profit = max(self.helper(ind+1,1,pri,k,dp),-pri[ind] + self.helper(ind+1,0,pri,k,dp)) \n else:\n profit = max(self.helper(ind+1,0,pri,k,dp), pri[ind] + self.helper(ind+1,1,pri,k-1,dp)) \n dp[ind][k][buy] = profit \n return dp[ind][k][buy] \n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[-1]*(2) for _ in range(k+1)] for _ in range(n)]\n return self.helper(0,1,prices,k,dp)\n ","runtime":"227"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n @cache\n def dfs(i, k, can_buy):\n if k <= 0:\n return 0\n if i >= n:\n return 0\n\n res = 0\n if can_buy:\n res = max(dfs(i + 1, k, False) - prices[i], dfs(i + 1, k, True))\n else:\n res = max(dfs(i + 1, k - 1, True) + prices[i], dfs(i + 1, k, False))\n return res\n \n return dfs(0, k, True)","runtime":"227"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n @lru_cache(None)\n def dp(i, transactionsRem, holding):\n if i == n or transactionsRem == 0:\n return 0\n\n if holding == 1:\n # if holding we have 2 cases we sell or do nothing\n return max(prices[i] + dp(i+1, transactionsRem-1, 0), dp(i+1, transactionsRem, holding))\n else:\n # if not holding we have 2 cases we buy or do nothing\n return max(-prices[i] + dp(i+1, transactionsRem, 1), dp(i+1, transactionsRem, holding))\n return dp(0, k, 0)\n ","runtime":"231"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n @cache\n def solve(i, holding, remaining):\n if (i == n) or (remaining == 0):\n return 0\n \n\n if holding:\n return max(solve(i+1, holding, remaining), \n prices[i] + solve(i+1, False, remaining - 1))\n else:\n return max(solve(i+1, False, remaining), \n -prices[i] + solve(i+1, True, remaining))\n \n return solve(0, False, k)","runtime":"231"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n @cache\n def dfs(i,j,hold):\n if j < 0:\n return -inf\n if i < 0:\n return -inf if hold else 0\n if hold:\n return max(dfs(i-1,j,True),dfs(i-1,j,False)-prices[i])\n return max(dfs(i-1,j,False),dfs(i-1,j-1,True)+prices[i])\n return dfs(n-1,k,False)\n ","runtime":"234"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n n = len(prices)\n\n @cache\n def h(i, k, holding):\n\n if i >= n:\n return 0\n \n res = h(i + 1, k, holding)\n\n if holding:\n res = max(res, h(i + 1, k - 1, False) + prices[i])\n elif k > 0:\n res = max(res, -prices[i] + h(i + 1, k, True))\n \n return res\n \n return h(0, k, False)","runtime":"234"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n @cache\n def helper( buy , remaining_k , index ):\n\n if index >= len(prices):\n return 0\n if remaining_k == 0:\n return 0\n \n # do something\n if buy:\n ans = -prices[index] + helper( not buy , remaining_k, index + 1 )\n else:\n ans = prices[index] + helper( not buy , remaining_k - 1 , index + 1 )\n # do nothing\n ans = max(ans, \n helper( buy , remaining_k , index + 1 )\n )\n return ans\n \n return helper( True , k , 0 )","runtime":"238"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n @cache \n def dfs(i, have, transactionCnt):\n if transactionCnt == k or i == len(prices):\n return 0 \n\n if have:\n return max(dfs(i + 1, have, transactionCnt), prices[i] + dfs(i + 1, False, transactionCnt + 1))\n return max(dfs(i + 1, have, transactionCnt), -prices[i] + dfs(i + 1, True, transactionCnt))\n return dfs(0, False, 0)","runtime":"238"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n @cache\n def dp(i, hasStock, remaining):\n if (i == len(prices)):\n return 0\n if (remaining == 0):\n return 0\n \n choice1 = choice2 = choice3 = 0\n if (not hasStock):\n # no stock, buy\n choice1 = dp(i + 1, True, remaining - 1) - prices[i]\n else:\n # has stock, sell\n choice2 = dp(i + 1, False, remaining - 1) + prices[i]\n \n # no sell no buy\n choice3 = dp(i + 1, hasStock, remaining)\n\n ans = max(choice1, choice2, choice3)\n return ans\n \n return dp(0, False, k * 2)\n\n\n \n ","runtime":"246"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n @lru_cache(None)\n def dp(day, j, holding):\n # out of transactions or out of days\n if j == 0 or day == len(prices):\n return 0\n\n # do nothing\n res = dp(day + 1, j, holding)\n\n if holding:\n # sell, gain profit from the price today\n res = max(res, dp(day + 1, j - 1, 0) + prices[day])\n else:\n # buy, subtract price of today from profits\n res = max(res, dp(day + 1, j, 1) - prices[day])\n return res\n\n return dp(0, k, 0)\n\"\"\"\ndp(day, j, holding)\n\nRR: dp(i, j, holding) = max(doNothing, sell) if holding else max(doNothing, buy)\n\"\"\"","runtime":"246"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n @cache\n def solve(i, buy, k):\n if i == n:\n return 0\n if k == 0:\n return 0\n if buy:\n return max(0 + solve(i + 1, buy, k), -prices[i] + solve(i + 1, buy^1, k))\n else:\n return max(0 + solve(i + 1, buy, k), prices[i] + solve(i + 1, buy^1, k - 1))\n return solve(0, 1, k)","runtime":"250"},{"code":"import functools\nfrom typing import List\n\n\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n\n @functools.cache\n def helper(index, buy, k):\n if index == len(prices):\n return 0\n\n if k <= 0:\n return 0\n\n if buy:\n return max(\n helper(index + 1, buy, k),\n -prices[index] + helper(index + 1, not buy, k)\n )\n else:\n return max(\n helper(index + 1, buy, k),\n prices[index] + helper(index + 1, not buy, k - 1)\n )\n\n return helper(0, True, k)\n","runtime":"250"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n memo = {}\n def backtrack(i, buy, cap):\n\n\n if cap <= 0:\n return 0\n\n if i >= n:\n return 0\n\n if (i, buy, cap) in memo:\n return memo[(i, buy, cap)]\n profit = 0\n if buy:\n profit = max(-prices[i] + backtrack(i + 1, 0, cap), backtrack(i + 1, 1, cap))\n else:\n profit = max(prices[i] + backtrack(i+1, 1, cap - 1), backtrack(i + 1, 0, cap))\n memo[(i, buy, cap)] = profit\n return profit\n return backtrack(0, 1, k)","runtime":"254"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n @cache\n def dp(i, is_held, transactions):\n if i >= n:\n return 0\n if transactions >= k:\n return 0\n \n price = dp(i + 1, is_held, transactions)\n if is_held:\n price = max(price, prices[i] + dp(i + 1, False, transactions + 1))\n else:\n price = max(price, -prices[i] + dp(i + 1, True, transactions))\n \n return price\n \n n = len(prices)\n return dp(0, False, 0)\n","runtime":"254"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n\n # int p = -1 ## index of stock we bought, or -1 if we haven't bought any\n\n n = len(prices)\n from functools import cache\n # @cache\n # def dp(i, k, p):\n # if k == 0: ## check if we still have buying opportunities\n # return 0\n # if i == n-1: ## check if it's last day\n # if p == -1: return 0\n # if p > -1: return prices[i]-prices[p]\n\n # if p == -1:\n # return max (dp(i+1, k, p), dp(i+1, k, i))\n # if p > -1:\n # return max (dp(i+1, k, p), dp(i+1, k-1, -1) + prices[i]-prices[p])\n\n # return dp(0, k, -1)\n @cache\n def dp(i, k, p):\n if k == 0: ## check if we still have buying opportunities\n return 0\n if i == n-1: ## check if it's last day\n if p == 0: return 0\n else: return prices[i]\n if p == 0: \n return max(dp(i+1, k, p), dp(i+1, k, 1) - prices[i])\n if p == 1:\n return max(dp(i+1, k, p), dp(i+1, k-1, 0) + prices[i])\n\n return dp(0, k, 0)\n \n ","runtime":"258"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[-1]*2 for i in range(k+1)]for i in range(n)]\n def solve(dp , i, buy, number, prices):\n if number==0:\n return 0\n \n if i>len(prices)-1:\n return 0\n \n if dp[i][number][buy]!=-1:\n return dp[i][number][buy]\n\n \n if buy:\n profit = max(-prices[i]+solve(dp, i+1,0,number,prices ), solve(dp, i+1, 1, number, prices))\n else:\n profit = max(prices[i]+solve(dp, i+1, 1, number-1, prices), solve(dp, i+1, 0, number, prices))\n \n dp[i][number][buy]=profit\n return dp[i][number][buy]\n \n return solve(dp, 0, 1, k, prices)","runtime":"258"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n @cache\n def dp(i, is_held, transactions):\n if i >= n or transactions >= k:\n return 0\n \n price = dp(i + 1, is_held, transactions)\n if is_held:\n price = max(price, prices[i] + dp(i + 1, False, transactions + 1))\n else:\n price = max(price, -prices[i] + dp(i + 1, True, transactions))\n \n return price\n \n n = len(prices)\n return dp(0, False, 0)\n","runtime":"262"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n @cache\n def dfs(i, hold, k):\n if k < 0 : return -float(\"inf\")\n if i < 0 :\n return 0 if hold==False else -float(\"inf\")\n if hold == True:\n return max(dfs(i-1, True, k), dfs(i-1, False, k-1) - prices[i])\n else:\n return max(dfs(i-1, False, k), dfs(i-1, True, k) + prices[i])\n\n n = len(prices)\n return dfs(n-1, False, k)","runtime":"262"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n\n @cache\n def dfs(i, j, hold):\n \"\"\"\n i: day \n j: number of transactions\n hold: current state machine, hold or not hold\n \"\"\"\n\n # edge case: invalid number of transaction number\n if j < 0:\n return -inf\n\n # base case\n if i < 0:\n return -inf if hold else 0\n\n if hold:\n # if from hold state, no transaction number increase\n # if from non-hold state, we will increase by one transaction number\n return max(dfs(i-1, j, True), dfs(i-1, j-1, False)-prices[i])\n\n # non hold state tranfer choices: i-1,j hold, i-1,j non-hold\n else:\n return max(dfs(i-1, j, True)+prices[i], dfs(i-1, j, False))\n\n return dfs(len(prices)-1, k, hold=False)\n\n\n ","runtime":"266"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n\n def solve(ar,n,idx,buy,cnt,mapp):\n\n if(idx == n or cnt == k):\n return 0\n\n key = (idx,buy,cnt)\n if(key in mapp):\n return mapp[key]\n \n profit = 0\n if(buy):\n profit = max(solve(ar,n,idx+1,False,cnt,mapp) - ar[idx],\n solve(ar,n,idx+1,True,cnt,mapp))\n else:\n profit = max(solve(ar,n,idx+1,True,cnt+1,mapp)+ar[idx],\n solve(ar,n,idx+1,False,cnt,mapp))\n \n mapp[key] = profit\n return mapp[key]\n \n return solve(prices,len(prices),0,True,0,{})\n ","runtime":"266"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n @cache\n def dp(i, is_held, transactions):\n if i >= n:\n return 0\n if transactions >= k:\n return 0\n \n price = dp(i + 1, is_held, transactions)\n if is_held:\n price = max(price, prices[i] + dp(i + 1, False, transactions + 1))\n else:\n price = max(price, -prices[i] + dp(i + 1, True, transactions))\n \n return price\n \n n = len(prices)\n return dp(0, False, 0)\n","runtime":"269"},{"code":"class Solution:\n def maxProfit(self, k, prices, i=0, can_buy=True, cache=None):\n # build cache with key (i, can_buy, k)\n if cache is None:\n cache = dict()\n # exit at boundary conditions\n if k == 0 or i == len(prices):\n return 0\n # define current key\n key = (i, can_buy, k)\n # compute max profits recursively\n if key not in cache:\n if can_buy:\n cache[key] = max(\n # buy at index i\n self.maxProfit(k, prices, i + 1, False, cache) - prices[i],\n # don't buy at index i\n self.maxProfit(k, prices, i + 1, True, cache)\n )\n else:\n cache[key] = max(\n # sell at index i\n prices[i] + self.maxProfit(k - 1, prices, i + 1, True, cache),\n # don't sell at index i\n self.maxProfit(k, prices, i + 1, False, cache)\n )\n return cache[key]\n\n","runtime":"269"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n @cache\n def recurse(pos, r, hold):\n #Base case: hitting the end of the array\n if pos == len(prices) or r == 0:\n return 0 \n \n\n if hold == True:\n #option to sell or not\n return max(recurse(pos+1, r-1, False) + prices[pos], recurse(pos+1, r, True))\n else:\n #option to buy or not\n return max(recurse(pos+1, r, True) - prices[pos], recurse(pos+1, r, False))\n\n \n # if sols[pos][r][hold] \n\n return recurse(0, k, False)","runtime":"273"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n dp = {}\n\n def profit(i, count):\n if i >= n: return 0\n \n if count > k * 2: return 0\n \n key = (i, count)\n\n if key in dp: return dp[key]\n \n res = 0\n \n if count % 2 == 0:\n res = max(\n -prices[i] + profit(i + 1, count + 1), # buying the stock on ith day\n 0 + profit(i + 1, count) # not buying/holding on ith day\n # buying and selling stock on same day is 0 profit so no need to include it\n )\n else:\n res = max(\n prices[i] + profit(i + 1, count + 1), # selling the stock on ith day\n 0 + profit(i + 1, count), # not selling/holding the stock on ith day\n # prices[i] + profit(i, not buy, count + 1) # selling the stock and buying stock \n # on same day(ith day) i dont think its needed here\n )\n \n dp[key] = res\n return res\n\n \n\n return profit(0, 0)\n\n # dp = [[[0 for i in range(k + 1)] for j in range(2)] for i in range(n + 1)]\n\n\n # for i in range(n - 1, -1, -1):\n # for buy in range(2):\n # for count in range(k + 1):\n # if buy:\n # dp[i][buy][count] = max(\n # -prices[i] + (0 if count + 1 > k else dp[i + 1][0][count + 1]),\n # 0 + dp[i + 1][1][count]\n # )\n # else:\n # dp[i][buy][count] = max(\n # prices[i] + dp[i + 1][1][count], \n # 0 + dp[i + 1][0][count]\n # )\n \n # return dp[0][1][0]\n ","runtime":"273"},{"code":"class Solution:\n def getMaxProfit(self, index: int, holding_stock: bool, txn_count: int, prices: List[int], cache: Dict, k: int) -> int:\n # since we reached end of array\n if index == len(prices):\n return 0\n\n elif (index, holding_stock, txn_count) in cache:\n return cache[(index, holding_stock, txn_count)]\n \n max_profit = 0\n\n if holding_stock:\n # do not sell the stock currently we are holding\n case_1 = self.getMaxProfit(index + 1, holding_stock, txn_count, prices, cache, k)\n\n # else I sell that stock\n if txn_count < k - 1:\n case_2 = prices[index] + self.getMaxProfit(index + 1, False, txn_count + 1, prices, cache, k)\n\n # means we have performed 2 transactions now so do not call functions again\n elif txn_count == k - 1:\n case_2 = prices[index]\n\n max_profit = max(case_1, case_2)\n cache[(index, holding_stock, txn_count)] = max_profit\n\n else:\n # do not buy the current stock and move ahead\n case_1 = self.getMaxProfit(index + 1, holding_stock, txn_count, prices, cache, k)\n \n # else we buy the stock\n case_2 = self.getMaxProfit(index + 1, True, txn_count, prices, cache, k) - prices[index]\n\n max_profit = max(case_1, case_2)\n cache[(index, holding_stock, txn_count)] = max_profit\n\n return max_profit\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n cache = dict()\n return self.getMaxProfit(0, False, 0, prices, cache, k)","runtime":"277"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n @cache\n def solve(i, buy, k):\n if i == n:\n return 0\n if k == 0:\n return 0\n if buy:\n return max(0 + solve(i + 1, buy, k), -prices[i] + solve(i + 1, buy^1, k))\n else:\n return max(0 + solve(i + 1, buy, k), prices[i] + solve(i + 1, buy^1, k - 1))\n return solve(0, 1, k)\n curr = [[0 for _ in range(k)] for i in range(2)]\n after = [[0 for _ in range(k)] for i in range(2)]\n for i in range(n - 1, -1, -1):\n for buy in range(2):\n for cap in range(1, 3):\n if buy:\n curr[buy][cap] = max(after[1][cap], -prices[i] + after[0][cap])\n else:\n curr[buy][cap] = max(after[0][cap], prices[i] + after[1][cap - 1])\n after = curr\n return after[1][2]","runtime":"277"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\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(i, transactions_remaining, holding):\n\n\n\n # Base case\n if transactions_remaining == 0 or i == len(prices): \n return 0\n \n do_nothing = dp(i + 1, transactions_remaining, holding)\n do_something = 0\n\n if holding:\n # Sell stock\n do_something = prices[i] + dp(i + 1, transactions_remaining - 1, 0)\n else:\n # Buy stock\n do_something = -prices[i] + dp(i + 1, transactions_remaining, 1)\n\n # Recurrence relation\n return max(do_nothing, do_something)\n\n return dp(0, k, 0)","runtime":"281"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp={}\n def f(ind,canBuy,prices,dp,NT):\n if ind >=len(prices):\n return 0\n\n if (ind,canBuy, NT) in dp:\n return dp[(ind,canBuy,NT)]\n profit = 0\n if canBuy==1 and NT > 0:\n buy=f(ind+1,0,prices,dp , NT) - prices[ind]\n notBuy= 0+ f(ind+1,1,prices,dp , NT) \n profit=max(buy,notBuy)\n\n elif NT > 0:\n Sell=prices[ind] + f(ind+1,1,prices,dp , NT - 1)\n notSell=0+f(ind+1,0,prices,dp , NT) \n profit=max(Sell,notSell)\n dp[(ind,canBuy, NT)]=profit \n\n return profit\n return f(0,1,prices,dp , k)\n\n","runtime":"281"},{"code":"class Solution:\n def maxProfit(self, lim: int, prices: List[int]) -> int:\n @cache\n def solve(inx , hold,k):\n if inx >=len(prices):\n return 0\n #dont buy , dont sell\n a = solve(inx+1,hold,k)\n\n #buy\n b = 0\n if hold==0 and k<lim:\n b = -prices[inx] + solve(inx+1,1,k+1)\n \n\n #sell\n c = 0\n if hold==1:\n c = prices[inx]+solve(inx+1,0,k)\n return max(a,b,c)\n return solve(0,0,0) ","runtime":"285"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \"\"\"\n sell after you buy\n make at most k transactions\n for each idx you can buy if x=0 or sell if x=1 or skip\n if x==1: max(prices[i]+rec(i+1, k-1), rec(i+1,k))\n else: \n \"\"\"\n n= len(prices)\n @cache\n def rec(i, j, x):\n if i==n: return 0\n if j==k: return 0\n res= 0\n if x==0:\n take= -prices[i]+ rec(i+1,j,1)\n not_take= rec(i+1,j,0)\n res= max(take,not_take)\n else:\n take= prices[i]+ rec(i+1,j+1,0)\n not_take= rec(i+1,j,1)\n res= max(take,not_take)\n return res\n return rec(0,0,0)\n\n\n\n ","runtime":"285"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n self.k = k\n self.prices = prices\n self.len_prices = len(prices)\n self.memo = {}\n return self.dp(0, False, 0)\n \n def dp(self, n, holding, transactions):\n if n == self.len_prices or transactions == self.k:\n return 0\n \n if (n, holding, transactions) in self.memo:\n return self.memo[(n, holding, transactions)]\n \n self.memo[(n, holding, transactions)] = max(\n self.dp(n + 1, holding, transactions), # skip\n -self.prices[n] + self.dp(n + 1, True, transactions) if holding==False else 0, # buy, if NOT holding\n self.prices[n] + self.dp(n + 1, False, transactions + 1) if holding==True else 0 # sell, if holding \n )\n\n return self.memo[(n, holding, transactions)]","runtime":"289"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo = {}\n\n def dp(own,i,count):\n if i >= len(prices) or count > k:\n return 0\n\n \n state = (own,i,count)\n\n if state in memo:\n return memo[state]\n \n\n if own:\n include = dp(False, i+1,count) + prices[i]\n exclude = dp(True,i+1,count)\n memo[state] = max(include,exclude)\n else:\n include = dp(True,i+1,count+1) - prices[i]\n exclude = dp(False,i+1,count)\n memo[state] = max(include,exclude)\n return memo[state]\n\n return dp(False,0,0)\n\n","runtime":"289"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = {}\n def dfs(buy,i,k):\n if len(prices)==i or k==0:\n return 0\n\n if (buy,i,k) in dp:\n return dp[(buy,i,k)]\n\n res = dfs(buy,i+1,k)\n if buy:\n res = max(res,prices[i]+dfs(False,i+1,k-1))\n else:\n res = max(res,-prices[i]+dfs(True,i+1,k))\n\n dp[(buy,i,k)] = res\n return res\n\n return dfs(False,0,k)","runtime":"293"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo = {}\n return self.fm(prices, k, 0, False, memo)\n \n def fm(self, prices, k, i, holding, memo):\n if k == 0 or i ==len(prices): return 0\n if (i,k,holding) in memo:\n return memo[(i,k,holding)]\n do_nothing = self.fm(prices,k, i+1, holding, memo)\n do_something = 0\n if holding:\n do_something = prices[i] + self.fm(prices, k-1, i+1, False, memo)\n else:\n do_something = -prices[i] + self.fm(prices, k, i+1, True, memo)\n mp = max(do_nothing, do_something)\n memo[(i,k,holding)] = mp\n return mp","runtime":"293"},{"code":"class Solution:\n def getMaxProfit(self, index: int, holding_stock: int, txn_count: int, prices: List[int], cache: Dict, k: int) -> int:\n # since we reached end of array\n if index == len(prices):\n return 0\n\n elif (index, holding_stock, txn_count) in cache:\n return cache[(index, holding_stock, txn_count)]\n \n max_profit = 0\n\n if holding_stock == 1:\n # do not sell the stock currently we are holding\n case_1 = self.getMaxProfit(index + 1, holding_stock, txn_count, prices, cache, k)\n\n # else I sell that stock\n if txn_count < k - 1:\n case_2 = prices[index] + self.getMaxProfit(index + 1, 0, txn_count + 1, prices, cache, k)\n\n # means we have performed 2 transactions now so do not call functions again\n elif txn_count == k - 1:\n case_2 = prices[index]\n\n max_profit = max(case_1, case_2)\n cache[(index, holding_stock, txn_count)] = max_profit\n\n else:\n # do not buy the current stock and move ahead\n case_1 = self.getMaxProfit(index + 1, holding_stock, txn_count, prices, cache, k)\n \n # else we buy the stock\n case_2 = self.getMaxProfit(index + 1, 1, txn_count, prices, cache, k) - prices[index]\n\n max_profit = max(case_1, case_2)\n cache[(index, holding_stock, txn_count)] = max_profit\n\n return max_profit\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n cache = dict()\n return self.getMaxProfit(0, 0, 0, prices, cache, k)","runtime":"297"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n memo: Dict[Tuple[int, int, int], int] = {}\n\n def dfs(i: int, buying: bool, transactions: int) -> int:\n # Base cases\n if i == n or transactions >= k:\n return 0\n\n if (i, buying, transactions) in memo:\n return memo[(i, buying, transactions)]\n \n if buying:\n # Two choices when buying: actually buy or cooldown\n buy = dfs(i + 1, False, transactions) - prices[i]\n cooldown = dfs(i + 1, buying, transactions)\n memo[(i, buying, transactions)] = max(buy, cooldown)\n \n else:\n # Two choices when selling: actually sell or cooldown\n sell = dfs(i + 1, True, transactions + 1) + prices[i]\n cooldown = dfs(i + 1, buying, transactions)\n memo[(i, buying, transactions)] = max(sell, cooldown)\n \n return memo[(i, buying, transactions)]\n \n # Start the recursion from day 0 in buying state with 0 transactions\n return dfs(0, buying=True, transactions=0)\n","runtime":"297"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = {}\n def solve(i,buy,transactions):\n if (i,buy,transactions) in dp:\n return dp[(i,buy,transactions)]\n profit = 0\n if i == n or transactions == k:\n return 0\n if buy:\n profit = max(-prices[i]+solve(i+1,0,transactions),solve(i+1,1,transactions))\n else:\n profit = max(prices[i]+solve(i+1,1,transactions+1),solve(i+1,0,transactions))\n dp[(i,buy,transactions)] = profit\n return profit\n return solve(0,1,0)\n ","runtime":"301"},{"code":"class Solution:\n def __init__(self):\n self.dp = []\n\n def f(self, v, i, k, on):\n if i >= len(v):\n return 0\n if self.dp[i][k][1 if on else 0] != -1:\n return self.dp[i][k][1 if on else 0]\n\n profit = 0\n profit = max(profit, self.f(v, i + 1, k, on))\n if on:\n profit = max(profit, v[i] + self.f(v, i + 1, k - 1, False))\n elif k > 0:\n profit = max(profit, self.f(v, i + 1, k, True) - v[i])\n\n self.dp[i][k][1 if on else 0] = profit\n return profit\n\n def maxProfit(self, k, prices):\n self.dp = [[[-1 for _ in range(2)] for _ in range(k + 1)] for _ in range(len(prices))]\n return self.f(prices, 0, k, False)\n","runtime":"301"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = {}\n\n def dfs(i, t, buying):\n if t < 0:\n return 0\n if i == len(prices):\n return 0\n if (i, t, buying) in dp:\n return dp[(i, t, buying)]\n \n cd = dfs(i + 1, t, buying)\n if not buying:\n sell = dfs(i + 1, t, True) + prices[i]\n dp[(i, t, buying)] = max(cd, sell)\n else:\n buy = dfs(i + 1, t - 1, False) - prices[i]\n dp[(i, t, buying)] = max(cd, buy)\n return dp[(i, t, buying)]\n return dfs(0, k, True)","runtime":"304"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n mem = {} # key: (i, trans, buying), value: max_profit\n \n def dfs(trans, i, buying):\n if trans == k:\n return 0\n if i == len(prices):\n return 0\n if (i, trans, buying) in mem:\n return mem[(i, trans, buying)]\n \n hold = dfs(trans, i+1, buying)\n if buying:\n buy = dfs(trans, i+1, not buying) - prices[i]\n max_profit = max(buy, hold)\n else:\n sell = dfs(trans+1, i+1, not buying) + prices[i]\n max_profit = max(sell, hold)\n \n mem[(i, trans, buying)] = max_profit\n return max_profit\n \n\n return dfs(0, 0, True)","runtime":"304"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = {} # dp(i, transactionsLeft, bool) is the max profit we can achieve with the remaining \n \n def dfs(i, transactionsLeft, buying):\n if i == n:\n return 0\n if transactionsLeft == 0:\n return 0\n if (i, transactionsLeft, buying) in dp:\n return dp[(i, transactionsLeft, buying)]\n \n # at each index, we buy or sell depending on buying\n # or we skip \n skip = dfs(i+1, transactionsLeft, buying)\n if buying: # not holding stock, we buy\n buy = dfs(i+1, transactionsLeft, not buying) - prices[i]\n dp[(i, transactionsLeft, buying)] = max(skip, buy)\n else: # sell the stock we hold \n # decrement transactionsLeft when we sell\n sell = dfs(i+1, transactionsLeft-1, not buying) + prices[i]\n dp[(i, transactionsLeft, buying)] = max(skip, sell)\n return dp[(i, transactionsLeft, buying)]\n \n return dfs(0, k, True)\n ","runtime":"308"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # bottom up\n\n # dp = [ for _ in range(1+1) for _ in range(len(prices)+1)]\n dp = {}\n # recursion top down memoization\n def solve(index, buy, limit):\n if index == len(prices):\n return 0\n if limit==0:\n return 0\n if (index, buy, limit) in dp:\n return dp[(index, buy, limit)]\n \n if buy:\n buykaro = -prices[index] + solve(index +1, 0, limit)\n skipkaro = 0 + solve(index +1,1, limit)\n profit = max(buykaro, skipkaro)\n else:\n sellkaro = prices[index] + solve(index +1, 1, limit-1)\n skip = 0 + solve(index +1, 0, limit)\n profit = max(sellkaro,skip)\n dp[(index,buy,limit)] = profit\n return profit\n return solve(0,1,k)\n\n\n \n \n ","runtime":"308"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # memoization\n cache = {}\n def dfs(ind, canBuy, k):\n # base case\n if ind == len(prices) or k == 0:\n return 0\n # check if (ind, canBuy, k) present in cache\n if (ind, canBuy, k) in cache: return cache[(ind, canBuy, k)]\n # buy case\n if canBuy:\n profit = max(-prices[ind] + dfs(ind+1, 0, k), dfs(ind+1, 1, k))\n else:\n profit = max(prices[ind] + dfs(ind+1, 1, k-1), dfs(ind+1, 0, k))\n cache[(ind, canBuy, k)] = profit\n return cache[(ind, canBuy, k)]\n return dfs(0, 1, k)","runtime":"312"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n def maxPurchase():\n profit = 0\n prev = prices[0]\n for p in prices:\n profit += max(0, p - prev)\n prev = p\n return profit\n\n if k >= len(prices) / 2:\n return maxPurchase()\n \n dp = {}\n def dfs(i, hasShare, txs):\n if i >= len(prices):\n return 0\n \n if txs == k and not hasShare:\n return 0\n \n key = (i, hasShare, txs)\n if key in dp:\n return dp[key]\n \n res = dfs(i+1, hasShare, txs)\n if hasShare:\n sell = prices[i] + dfs(i+1, False, txs + 1)\n res = max(res, sell)\n else:\n buy = -prices[i] + dfs(i+1, True, txs)\n res = max(res, buy)\n \n dp[key] = res\n return res\n \n return dfs(0, False, 0)\n\n","runtime":"312"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[-1 for i in range(2)] for j in range(k+1)] for m in range(n)]\n\n def stock(ind, transactions, bought):\n if ind == n:\n return 0\n \n if dp[ind][transactions][bought] != -1:\n return dp[ind][transactions][bought]\n \n # if I have already bought a stock\n if bought == 1:\n # I can either sell it\n sell = prices[ind] + stock(ind+1, transactions, 0)\n # or keep it\n not_sell = stock(ind+1, transactions, 1)\n dp[ind][transactions][bought] = max(sell, not_sell)\n\n # if I dont have a stock in hand\n else:\n buy = float('-inf')\n # I can either buy a stock if I haven't done k transactions\n if transactions < k:\n buy = -prices[ind] + stock(ind+1, transactions+1, 1)\n # or not buy a stock\n not_buy = stock(ind+1, transactions, 0)\n dp[ind][transactions][bought] = max(buy, not_buy)\n \n return dp[ind][transactions][bought]\n \n return stock(0, 0, 0)\n ","runtime":"316"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # backtracking with memorization\n # if we buy at i, we should go i+1, and change the status\n # if we sell at i we should go i+1, and change the status\n # if we do nothing, we should go i+1, and don't change the status\n\n dp = {}\n def backtrack(i,flag,c):\n if i>=len(prices) or c>k:\n return 0\n \n if (i,flag,c) in dp:\n return dp[(i,flag,c)]\n \n # do nothing\n p = backtrack(i+1,flag,c)\n # buy\n if flag:\n p = max(p,backtrack(i+1,not flag,c+1)-prices[i])\n # sell\n else:\n p = max(p,backtrack(i+1,not flag,c)+prices[i])\n \n \n dp[(i,flag,c)] = p\n return p\n return backtrack(0,True,0)\n\n # n = len(prices)\n # # dp[i][j] max profit at day j when completing at most i transactions\n # dp = [[0] * n for _ in range(k+1)]\n # for i in range(1, k+1):\n # # max profit with a stock at hand\n # profit = -prices[0]\n # for j in range(1, n):\n # # max profit when sell at day j\n # dp[i][j] = max(dp[i][j-1], profit + prices[j])\n\n # # max profit when buy at day j\n # profit = max(profit, dp[i-1][j-1] - prices[j])\n # return dp[-1][-1]","runtime":"316"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # dp = [[[0]*2 for _ in range(k+1)] for _ in range(len(prices))]\n # for i in range(len(prices)):\n # for j in range(1, k+1):\n # if i==0:\n # dp[i][j][0]=0\n # dp[i][j][1]=-prices[i]\n # continue\n # dp[i][j][0] = max(\n # dp[i-1][j][0],\n # dp[i-1][j][1] + prices[i]\n # )\n # dp[i][j][1] = max(\n # dp[i-1][j][1],\n # dp[i-1][j-1][0] - prices[i]\n # )\n # return dp[len(prices)-1][k][0]\n n=len(prices)\n self.memo=[[[float('-inf')]*2 for _ in range(k+1)] for _ in range(len(prices))]\n return self.dp(prices,n-1,k,0)\n\n def dp(self,prices, i,j,k):\n if i==0 and k==0:\n return 0\n if i==0 and k==1:\n return -prices[0]\n if j==0 and k==0:\n return 0\n if j==0 and k==1:\n return float('-inf')\n if self.memo[i][j][k]!=float('-inf'):\n return self.memo[i][j][k]\n if k==0:\n res = max(\n self.dp(prices,i-1,j,0),\n self.dp(prices,i-1,j,1)+prices[i]\n ) \n else:\n res = max(\n self.dp(prices, i-1,j,1),\n self.dp(prices, i-1,j-1,0)-prices[i]\n )\n self.memo[i][j][k]=res\n return res","runtime":"320"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # dp = [[[0]*2 for _ in range(k+1)] for _ in range(len(prices))]\n # for i in range(len(prices)):\n # for j in range(1, k+1):\n # if i==0:\n # dp[i][j][0]=0\n # dp[i][j][1]=-prices[i]\n # continue\n # dp[i][j][0] = max(\n # dp[i-1][j][0],\n # dp[i-1][j][1] + prices[i]\n # )\n # dp[i][j][1] = max(\n # dp[i-1][j][1],\n # dp[i-1][j-1][0] - prices[i]\n # )\n # return dp[len(prices)-1][k][0]\n n=len(prices)\n self.memo=[[[float('-inf')]*2 for _ in range(k+1)] for _ in range(len(prices))]\n return self.dp(prices,n-1,k,0)\n\n def dp(self,prices, i,j,k):\n if i==0 and k==0:\n return 0\n if i==0 and k==1:\n return -prices[0]\n if j==0 and k==0:\n return 0\n # if j==0 and k==1:\n # return float('-inf')\n if self.memo[i][j][k]!=float('-inf'):\n return self.memo[i][j][k]\n if k==0:\n res = max(\n self.dp(prices,i-1,j,0),\n self.dp(prices,i-1,j,1)+prices[i]\n ) \n else:\n res = max(\n self.dp(prices, i-1,j,1),\n self.dp(prices, i-1,j-1,0)-prices[i]\n )\n self.memo[i][j][k]=res\n return res","runtime":"320"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = dict()\n\n def dfs(i, k_sell, k_buy, can_buy):\n if i >= len(prices):\n return 0\n \n if can_buy and k_buy == 0:\n return 0\n\n if not can_buy and k_sell == 0:\n return 0\n\n if (i, k_sell, k_buy, can_buy) in dp:\n return dp[i, k_sell, k_buy, can_buy]\n\n stay = dfs(i + 1, k_sell, k_buy, can_buy)\n\n if can_buy:\n bought = dfs(i + 1, k_sell, k_buy - 1, False) - prices[i]\n dp[(i, k_sell, k_buy, can_buy)] = max(stay, bought)\n else:\n sold = dfs(i + 1, k_sell - 1, k_buy, True) + prices[i]\n dp[(i, k_sell, k_buy, can_buy)] = max(stay, sold)\n\n return dp[(i, k_sell, k_buy, can_buy)]\n\n return dfs(0, k, k, True)\n ","runtime":"324"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo = {}\n def backtrack(i, buy, sell_trans):\n if i == len(prices) or (sell_trans == 0):\n return 0\n if (i, buy, sell_trans) in memo:\n return memo[(i, buy, sell_trans)]\n ans = 0\n if buy and sell_trans > 0:\n ans = max(ans, backtrack(i + 1, False, sell_trans - 1) + prices[i])\n ans = max(ans, backtrack(i + 1, True, sell_trans))\n if not buy:\n ans = max(ans, backtrack(i + 1, True, sell_trans) - prices[i])\n ans = max(ans, backtrack(i + 1, False, sell_trans))\n memo[(i, buy, sell_trans)] = ans\n return ans\n return backtrack(0, False, k)","runtime":"324"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = defaultdict(int)\n \n def dfs(idx,stock,trans):\n if idx>=len(prices):\n return 0\n if trans>=k:\n return 0\n if (idx,stock,trans) in dp:\n return dp[(idx,stock,trans)]\n if stock:\n buy = -prices[idx] + dfs(idx+1,0,trans) \n skip = dfs(idx+1,1,trans)\n dp[(idx,stock,trans)] = max(buy,skip)\n else:\n sell = prices[idx] + dfs(idx+1,1,trans+1) \n skip = dfs(idx+1,0,trans)\n dp[(idx,stock,trans)] = max(sell,skip)\n return dp[(idx,stock,trans)]\n\n\n return dfs(0,1,0)","runtime":"328"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n def func(i,buy,prices,ct,dic):\n if i>=len(prices) or ct == 0:\n return 0\n if(i,buy,ct) in dic:\n return dic[(i,buy,ct)]\n x,y,a,b=0,0,0,0\n if buy:\n x = -prices[i]+func(i+1,False,prices,ct,dic)\n y=0+func(i+1,buy,prices,ct,dic)\n else:\n a=prices[i]+func(i+1,True,prices,ct-1,dic)\n b=0+func(i+1,buy,prices,ct,dic)\n dic[(i,buy,ct)]=max(a,b,x,y)\n return max(a,b,x,y)\n return func(0,True,prices,k,{})","runtime":"328"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = {}\n\n def dfs(i, t, buying):\n if t < 0:\n return 0\n if i == len(prices):\n return 0\n if (i, t, buying) in dp:\n return dp[(i, t, buying)]\n \n cd = dfs(i + 1, t, buying)\n if not buying:\n dp[(i, t, buying)] = max(cd, dfs(i + 1, t, True) + prices[i])\n else:\n dp[(i, t, buying)] = max(cd, dfs(i + 1, t - 1, False) - prices[i])\n return dp[(i, t, buying)]\n return dfs(0, k, True)","runtime":"332"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo = {}\n \n def dp(i: int, t: int, holding: int) -> int:\n if t == 0 or i >= len(prices):\n return 0\n elif (i, t, holding) in memo:\n return memo[(i, t, holding)]\n \n do_nothing = dp(i+1, t, holding)\n do_something = 0\n \n if holding:\n do_something = prices[i] + dp(i+1, t-1, 0)\n else:\n do_something = -prices[i] + dp(i+1, t, 1)\n \n memo[(i, t, holding)] = max(do_nothing, do_something)\n return memo[(i, t, holding)]\n \n \n return dp(0, k, 0)","runtime":"332"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = {} # dp[(i, buying, transactions_left)] = val\n\n def dfs(i, buying, transactions_left):\n if i >= len(prices) or transactions_left == 0:\n return 0\n if (i, buying, transactions_left) in dp:\n return dp[(i, buying, transactions_left)]\n \n if buying:\n buy = dfs(i + 1, not buying, transactions_left) - prices[i]\n cooldown = dfs(i + 1, buying, transactions_left)\n dp[(i, buying, transactions_left)] = max(buy, cooldown)\n else:\n sell = dfs(i + 1, not buying, transactions_left - 1) + prices[i]\n cooldown = dfs(i + 1, buying, transactions_left)\n dp[(i, buying, transactions_left)] = max(sell, cooldown)\n \n return dp[(i, buying, transactions_left)]\n \n return dfs(0, True, k)","runtime":"336"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo = {}\n def backtrack(i, buy, sell_trans):\n if i == len(prices) or (sell_trans == 0):\n return 0\n if (i, buy, sell_trans) in memo:\n return memo[(i, buy, sell_trans)]\n ans = 0\n if buy and sell_trans > 0:\n ans = max(ans, backtrack(i + 1, False, sell_trans - 1) + prices[i])\n ans = max(ans, backtrack(i + 1, True, sell_trans))\n if not buy:\n ans = max(ans, backtrack(i + 1, True, sell_trans) - prices[i])\n ans = max(ans, backtrack(i + 1, False, sell_trans))\n memo[(i, buy, sell_trans)] = ans\n return ans\n return backtrack(0, False, k)","runtime":"336"}],"string":"[\n {\n \"code\": \"class DoubleLinkListNode:\\n def __init__(self, ind, pre = None, next = None):\\n self.ind = ind\\n self.pre = pre if pre else self\\n self.next = next if next else self\\n\\nclass Solution:\\n def MinMaxList(self, arr: List[int]) -> List[int]:\\n n = len(arr)\\n if n == 0:\\n return []\\n sign = -1\\n res = [9999]\\n for num in arr:\\n if num * sign > res[-1] * sign:\\n res[-1] = num\\n else:\\n res.append(num)\\n sign *= -1\\n if len(res) & 1:\\n res.pop()\\n return res\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n newP = self.MinMaxList(prices)\\n n = len(newP)\\n m = n // 2\\n res = 0\\n for i in range(m):\\n res += newP[i*2+1] - newP[i*2]\\n if m <= k:\\n return res\\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\\n NodeList = [DoubleLinkListNode(0, head)]\\n for i in range(1, n):\\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\\n NodeList[i-1].next = NodeList[i]\\n NodeList[n-1].next = tail\\n head.next, tail.pre = NodeList[0], NodeList[n-1]\\n heap = []\\n for i in range(n-1):\\n if i&1:\\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\\n else:\\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\\n while m > k:\\n loss, i, j, t = heappop(heap)\\n if NodeList[i] == None or NodeList[j] == None: continue\\n m -= 1\\n res -= loss\\n nodei, nodej = NodeList[i], NodeList[j]\\n nodel, noder = nodei.pre, nodej.next\\n l, r = nodel.ind, noder.ind\\n valL, valR = newP[l], newP[r]\\n noder.pre, nodel.next = nodel, noder\\n NodeList[i], NodeList[j] = None, None\\n if t == 0:\\n heappush(heap, [valR - valL, l, r, 1])\\n elif l != -1 and r != -1:\\n heappush(heap, [valL - valR, l, r, 0])\\n return res\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class DoubleLinkListNode:\\n def __init__(self, ind, pre = None, next = None):\\n self.ind = ind\\n self.pre = pre if pre else self\\n self.next = next if next else self\\n\\nclass Solution:\\n def MinMaxList(self, arr: List[int]) -> List[int]:\\n n = len(arr)\\n if n == 0:\\n return []\\n sign = -1\\n res = [9999]\\n for num in arr:\\n if num * sign > res[-1] * sign:\\n res[-1] = num\\n else:\\n res.append(num)\\n sign *= -1\\n if len(res) & 1:\\n res.pop()\\n return res\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n newP = self.MinMaxList(prices)\\n n = len(newP)\\n m = n // 2\\n res = 0\\n for i in range(m):\\n res += newP[i*2+1] - newP[i*2]\\n if m <= k:\\n return res\\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\\n NodeList = [DoubleLinkListNode(0, head)]\\n for i in range(1, n):\\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\\n NodeList[i-1].next = NodeList[i]\\n NodeList[n-1].next = tail\\n head.next, tail.pre = NodeList[0], NodeList[n-1]\\n heap = []\\n for i in range(n-1):\\n if i&1:\\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\\n else:\\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\\n while m > k:\\n loss, i, j, t = heappop(heap)\\n if NodeList[i] == None or NodeList[j] == None: continue\\n m -= 1\\n res -= loss\\n nodei, nodej = NodeList[i], NodeList[j]\\n nodel, noder = nodei.pre, nodej.next\\n l, r = nodel.ind, noder.ind\\n valL, valR = newP[l], newP[r]\\n noder.pre, nodel.next = nodel, noder\\n NodeList[i], NodeList[j] = None, None\\n if t == 0:\\n heappush(heap, [valR - valL, l, r, 1])\\n elif l != -1 and r != -1:\\n heappush(heap, [valL - valR, l, r, 0])\\n return res\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class DoubleLinkListNode:\\n def __init__(self, ind, pre = None, next = None):\\n self.ind = ind\\n self.pre = pre if pre else self\\n self.next = next if next else self\\n\\nclass Solution:\\n def MinMaxList(self, arr: List[int]) -> List[int]:\\n n = len(arr)\\n if n == 0:\\n return []\\n sign = -1\\n res = [9999]\\n for num in arr:\\n if num * sign > res[-1] * sign:\\n res[-1] = num\\n else:\\n res.append(num)\\n sign *= -1\\n if len(res) & 1:\\n res.pop()\\n return res\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n newP = self.MinMaxList(prices)\\n n = len(newP)\\n m = n // 2\\n res = 0\\n for i in range(m):\\n res += newP[i*2+1] - newP[i*2]\\n if m <= k:\\n return res\\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\\n NodeList = [DoubleLinkListNode(0, head)]\\n for i in range(1, n):\\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\\n NodeList[i-1].next = NodeList[i]\\n NodeList[n-1].next = tail\\n head.next, tail.pre = NodeList[0], NodeList[n-1]\\n heap = []\\n for i in range(n-1):\\n if i&1:\\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\\n else:\\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\\n while m > k:\\n loss, i, j, t = heappop(heap)\\n if NodeList[i] == None or NodeList[j] == None: continue\\n m -= 1\\n res -= loss\\n nodei, nodej = NodeList[i], NodeList[j]\\n nodel, noder = nodei.pre, nodej.next\\n l, r = nodel.ind, noder.ind\\n valL, valR = newP[l], newP[r]\\n noder.pre, nodel.next = nodel, noder\\n NodeList[i], NodeList[j] = None, None\\n if t == 0:\\n heappush(heap, [valR - valL, l, r, 1])\\n elif l != -1 and r != -1:\\n heappush(heap, [valL - valR, l, r, 0])\\n return res\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class DoubleLinkListNode:\\n def __init__(self, ind, pre = None, next = None):\\n self.ind = ind\\n self.pre = pre if pre else self\\n self.next = next if next else self\\n\\nclass Solution:\\n def MinMaxList(self, arr: List[int]) -> List[int]:\\n n = len(arr)\\n if n == 0:\\n return []\\n sign = -1\\n res = [9999]\\n for num in arr:\\n if num * sign > res[-1] * sign:\\n res[-1] = num\\n else:\\n res.append(num)\\n sign *= -1\\n if len(res) & 1:\\n res.pop()\\n return res\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n newP = self.MinMaxList(prices)\\n n = len(newP)\\n m = n // 2\\n res = 0\\n for i in range(m):\\n res += newP[i*2+1] - newP[i*2]\\n if m <= k:\\n return res\\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\\n NodeList = [DoubleLinkListNode(0, head)]\\n for i in range(1, n):\\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\\n NodeList[i-1].next = NodeList[i]\\n NodeList[n-1].next = tail\\n head.next, tail.pre = NodeList[0], NodeList[n-1]\\n heap = []\\n for i in range(n-1):\\n if i&1:\\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\\n else:\\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\\n while m > k:\\n loss, i, j, t = heappop(heap)\\n if NodeList[i] == None or NodeList[j] == None: continue\\n m -= 1\\n res -= loss\\n nodei, nodej = NodeList[i], NodeList[j]\\n nodel, noder = nodei.pre, nodej.next\\n l, r = nodel.ind, noder.ind\\n valL, valR = newP[l], newP[r]\\n noder.pre, nodel.next = nodel, noder\\n NodeList[i], NodeList[j] = None, None\\n if t == 0:\\n heappush(heap, [valR - valL, l, r, 1])\\n elif l != -1 and r != -1:\\n heappush(heap, [valL - valR, l, r, 0])\\n return res\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class DoubleLinkListNode:\\n def __init__(self, ind, pre = None, next = None):\\n self.ind = ind\\n self.pre = pre if pre else self\\n self.next = next if next else self\\n\\nclass Solution:\\n def MinMaxList(self, arr: List[int]) -> List[int]:\\n n = len(arr)\\n if n == 0:\\n return []\\n sign = -1\\n res = [9999]\\n for num in arr:\\n if num * sign > res[-1] * sign:\\n res[-1] = num\\n else:\\n res.append(num)\\n sign *= -1\\n if len(res) & 1:\\n res.pop()\\n return res\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n newP = self.MinMaxList(prices)\\n n = len(newP)\\n m = n // 2\\n res = 0\\n for i in range(m):\\n res += newP[i*2+1] - newP[i*2]\\n if m <= k:\\n return res\\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\\n NodeList = [DoubleLinkListNode(0, head)]\\n for i in range(1, n):\\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\\n NodeList[i-1].next = NodeList[i]\\n NodeList[n-1].next = tail\\n head.next, tail.pre = NodeList[0], NodeList[n-1]\\n heap = []\\n for i in range(n-1):\\n if i&1:\\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\\n else:\\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\\n while m > k:\\n loss, i, j, t = heappop(heap)\\n if NodeList[i] == None or NodeList[j] == None: continue\\n m -= 1\\n res -= loss\\n nodei, nodej = NodeList[i], NodeList[j]\\n nodel, noder = nodei.pre, nodej.next\\n l, r = nodel.ind, noder.ind\\n valL, valR = newP[l], newP[r]\\n noder.pre, nodel.next = nodel, noder\\n NodeList[i], NodeList[j] = None, None\\n if t == 0:\\n heappush(heap, [valR - valL, l, r, 1])\\n elif l != -1 and r != -1:\\n heappush(heap, [valL - valR, l, r, 0])\\n return res\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"import heapq \\n\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n if n==1:\\n return 0\\n\\n pairs = []\\n profits = []\\n v = 0\\n p = 0\\n\\n while p<n:\\n v = p\\n while v<n-1 and prices[v]>=prices[v+1]:\\n v+=1 \\n p = v + 1\\n while p<n and prices[p]>=prices[p-1]:\\n p+=1 \\n # valley at v, peak at p-1\\n\\n #Valleys should be non-decreasing \\n while len(pairs) and prices[v] < prices[pairs[-1][0]]:\\n heapq.heappush(profits, -1*(prices[pairs[-1][1]-1] - prices[pairs[-1][0]]))\\n pairs.pop()\\n \\n #now combine intervals \\n while len(pairs) and prices[p-1] >prices[pairs[-1][1]-1]:\\n heapq.heappush(profits, -1*(prices[pairs[-1][1]-1] - prices[v]))\\n v = pairs[-1][0]\\n pairs.pop()\\n pairs.append((v, p))\\n while len(pairs):\\n heapq.heappush(profits, -1*(prices[pairs[-1][1]-1] - prices[pairs[-1][0]]))\\n pairs.pop()\\n ans = 0\\n taken = 0\\n while len(profits) and taken<k:\\n ans -= heapq.heappop(profits)\\n taken +=1\\n \\n return ans \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class DoubleLinkListNode:\\n def __init__(self, ind, pre = None, next = None):\\n self.ind = ind\\n self.pre = pre if pre else self\\n self.next = next if next else self\\n\\nclass Solution:\\n def MinMaxList(self, arr: List[int]) -> List[int]:\\n n = len(arr)\\n if n == 0:\\n return []\\n sign = -1\\n res = [9999]\\n for num in arr:\\n if num * sign > res[-1] * sign:\\n res[-1] = num\\n else:\\n res.append(num)\\n sign *= -1\\n if len(res) & 1:\\n res.pop()\\n return res\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n newP = self.MinMaxList(prices)\\n n = len(newP)\\n m = n // 2\\n res = 0\\n for i in range(m):\\n res += newP[i*2+1] - newP[i*2]\\n if m <= k:\\n return res\\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\\n NodeList = [DoubleLinkListNode(0, head)]\\n for i in range(1, n):\\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\\n NodeList[i-1].next = NodeList[i]\\n NodeList[n-1].next = tail\\n head.next, tail.pre = NodeList[0], NodeList[n-1]\\n heap = []\\n for i in range(n-1):\\n if i&1:\\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\\n else:\\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\\n while m > k:\\n loss, i, j, t = heappop(heap)\\n if NodeList[i] == None or NodeList[j] == None: continue\\n m -= 1\\n res -= loss\\n nodei, nodej = NodeList[i], NodeList[j]\\n nodel, noder = nodei.pre, nodej.next\\n l, r = nodel.ind, noder.ind\\n valL, valR = newP[l], newP[r]\\n noder.pre, nodel.next = nodel, noder\\n NodeList[i], NodeList[j] = None, None\\n if t == 0:\\n heappush(heap, [valR - valL, l, r, 1])\\n elif l != -1 and r != -1:\\n heappush(heap, [valL - valR, l, r, 0])\\n return res\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class DoubleLinkListNode:\\n def __init__(self, ind, pre = None, next = None):\\n self.ind = ind\\n self.pre = pre if pre else self\\n self.next = next if next else self\\n\\nclass Solution:\\n def MinMaxList(self, arr: List[int]) -> List[int]:\\n n = len(arr)\\n if n == 0:\\n return []\\n sign = -1\\n res = [9999]\\n for num in arr:\\n if num * sign > res[-1] * sign:\\n res[-1] = num\\n else:\\n res.append(num)\\n sign *= -1\\n if len(res) & 1:\\n res.pop()\\n return res\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n newP = self.MinMaxList(prices)\\n n = len(newP)\\n m = n // 2\\n res = 0\\n for i in range(m):\\n res += newP[i*2+1] - newP[i*2]\\n if m <= k:\\n return res\\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\\n NodeList = [DoubleLinkListNode(0, head)]\\n for i in range(1, n):\\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\\n NodeList[i-1].next = NodeList[i]\\n NodeList[n-1].next = tail\\n head.next, tail.pre = NodeList[0], NodeList[n-1]\\n heap = []\\n for i in range(n-1):\\n if i&1:\\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\\n else:\\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\\n while m > k:\\n loss, i, j, t = heappop(heap)\\n if NodeList[i] == None or NodeList[j] == None: continue\\n m -= 1\\n res -= loss\\n nodei, nodej = NodeList[i], NodeList[j]\\n nodel, noder = nodei.pre, nodej.next\\n l, r = nodel.ind, noder.ind\\n valL, valR = newP[l], newP[r]\\n noder.pre, nodel.next = nodel, noder\\n NodeList[i], NodeList[j] = None, None\\n if t == 0:\\n heappush(heap, [valR - valL, l, r, 1])\\n elif l != -1 and r != -1:\\n heappush(heap, [valL - valR, l, r, 0])\\n return res\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class DoubleLinkListNode:\\n def __init__(self, ind, pre = None, next = None):\\n self.ind = ind\\n self.pre = pre if pre else self\\n self.next = next if next else self\\n\\nclass Solution:\\n def MinMaxList(self, arr: List[int]) -> List[int]:\\n n = len(arr)\\n if n == 0:\\n return []\\n sign = -1\\n res = [9999]\\n for num in arr:\\n if num * sign > res[-1] * sign:\\n res[-1] = num\\n else:\\n res.append(num)\\n sign *= -1\\n if len(res) & 1:\\n res.pop()\\n return res\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n newP = self.MinMaxList(prices)\\n n = len(newP)\\n m = n // 2\\n res = 0\\n for i in range(m):\\n res += newP[i*2+1] - newP[i*2]\\n if m <= k:\\n return res\\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\\n NodeList = [DoubleLinkListNode(0, head)]\\n for i in range(1, n):\\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\\n NodeList[i-1].next = NodeList[i]\\n NodeList[n-1].next = tail\\n head.next, tail.pre = NodeList[0], NodeList[n-1]\\n heap = []\\n for i in range(n-1):\\n if i&1:\\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\\n else:\\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\\n while m > k:\\n loss, i, j, t = heappop(heap)\\n if NodeList[i] == None or NodeList[j] == None: continue\\n m -= 1\\n res -= loss\\n nodei, nodej = NodeList[i], NodeList[j]\\n nodel, noder = nodei.pre, nodej.next\\n l, r = nodel.ind, noder.ind\\n valL, valR = newP[l], newP[r]\\n noder.pre, nodel.next = nodel, noder\\n NodeList[i], NodeList[j] = None, None\\n if t == 0:\\n heappush(heap, [valR - valL, l, r, 1])\\n elif l != -1 and r != -1:\\n heappush(heap, [valL - valR, l, r, 0])\\n return res\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class DoubleLinkListNode:\\n def __init__(self, ind, pre = None, next = None):\\n self.ind = ind\\n self.pre = pre if pre else self\\n self.next = next if next else self\\n\\nclass Solution:\\n def MinMaxList(self, arr: List[int]) -> List[int]:\\n n = len(arr)\\n if n == 0:\\n return []\\n sign = -1\\n res = [9999]\\n for num in arr:\\n if num * sign > res[-1] * sign:\\n res[-1] = num\\n else:\\n res.append(num)\\n sign *= -1\\n if len(res) & 1:\\n res.pop()\\n return res\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n newP = self.MinMaxList(prices)\\n n = len(newP)\\n m = n // 2\\n res = 0\\n for i in range(m):\\n res += newP[i*2+1] - newP[i*2]\\n if m <= k:\\n return res\\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\\n NodeList = [DoubleLinkListNode(0, head)]\\n for i in range(1, n):\\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\\n NodeList[i-1].next = NodeList[i]\\n NodeList[n-1].next = tail\\n head.next, tail.pre = NodeList[0], NodeList[n-1]\\n heap = []\\n for i in range(n-1):\\n if i&1:\\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\\n else:\\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\\n while m > k:\\n loss, i, j, t = heappop(heap)\\n if NodeList[i] == None or NodeList[j] == None: continue\\n m -= 1\\n res -= loss\\n nodei, nodej = NodeList[i], NodeList[j]\\n nodel, noder = nodei.pre, nodej.next\\n l, r = nodel.ind, noder.ind\\n valL, valR = newP[l], newP[r]\\n noder.pre, nodel.next = nodel, noder\\n NodeList[i], NodeList[j] = None, None\\n if t == 0:\\n heappush(heap, [valR - valL, l, r, 1])\\n elif l != -1 and r != -1:\\n heappush(heap, [valL - valR, l, r, 0])\\n return res\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class DoubleLinkListNode:\\n def __init__(self, ind, pre = None, next = None):\\n self.ind = ind\\n self.pre = pre if pre else self\\n self.next = next if next else self\\n\\nclass Solution:\\n def MinMaxList(self, arr: List[int]) -> List[int]:\\n n = len(arr)\\n if n == 0:\\n return []\\n sign = -1\\n res = [9999]\\n for num in arr:\\n if num * sign > res[-1] * sign:\\n res[-1] = num\\n else:\\n res.append(num)\\n sign *= -1\\n if len(res) & 1:\\n res.pop()\\n return res\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n newP = self.MinMaxList(prices)\\n n = len(newP)\\n m = n // 2\\n res = 0\\n for i in range(m):\\n res += newP[i*2+1] - newP[i*2]\\n if m <= k:\\n return res\\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\\n NodeList = [DoubleLinkListNode(0, head)]\\n for i in range(1, n):\\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\\n NodeList[i-1].next = NodeList[i]\\n NodeList[n-1].next = tail\\n head.next, tail.pre = NodeList[0], NodeList[n-1]\\n heap = []\\n for i in range(n-1):\\n if i&1:\\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\\n else:\\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\\n while m > k:\\n loss, i, j, t = heappop(heap)\\n if NodeList[i] == None or NodeList[j] == None: continue\\n m -= 1\\n res -= loss\\n nodei, nodej = NodeList[i], NodeList[j]\\n nodel, noder = nodei.pre, nodej.next\\n l, r = nodel.ind, noder.ind\\n valL, valR = newP[l], newP[r]\\n noder.pre, nodel.next = nodel, noder\\n NodeList[i], NodeList[j] = None, None\\n if t == 0:\\n heappush(heap, [valR - valL, l, r, 1])\\n elif l != -1 and r != -1:\\n heappush(heap, [valL - valR, l, r, 0])\\n return res\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # Initialize buy and sell arrays\\n buy, sell = [float(\\\"-inf\\\")] * (k + 1), [0] * (k + 1)\\n\\n # Iterate through each price in the list\\n for p in prices:\\n for t in range(1, k + 1):\\n # Update the maximum profit for buying with up to t transactions\\n if sell[t - 1] - p > buy[t]:\\n buy[t] = sell[t - 1] - p\\n\\n # Update the maximum profit for selling with up to t transactions\\n if p + buy[t] > sell[t]:\\n sell[t] = buy[t] + p\\n\\n return sell[-1]\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n def solve(p: int):\\n b, s = (0, 0), (0, 0)\\n for x in reversed(prices):\\n s, b = max(s, (b[0] + x - p, b[1] + 1)), max(b, (s[0] - x, s[1]))\\n return b\\n l, r = 0, sum(prices)\\n while l < r:\\n m = (r + l + 1) // 2\\n if solve(m)[1] >= k:\\n l = m\\n else:\\n r = m - 1\\n return solve(l)[0] + l * k\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # Helper function to solve the problem with a given profit margin 'p'\\n def solve(p: int):\\n b, s = (0, 0), (0, 0)\\n for x in reversed(prices):\\n s = max(s, (b[0] + x - p, b[1] + 1))\\n b = max(b, (s[0] - x, s[1]))\\n return b\\n\\n l, r = 0, sum(prices)\\n while l < r:\\n m = (r + l + 1) // 2\\n if solve(m)[1] >= k:\\n l = m\\n else:\\n r = m - 1\\n return solve(l)[0] + l * k\\n\\n# Example usage\\nif __name__ == \\\"__main__\\\":\\n solution = Solution()\\n k = 2\\n prices = [3, 2, 6, 5, 0, 3]\\n print(solution.maxProfit(k, prices)) # Output: 7\\n\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n\\n\\n def buy_sell(ps):\\n if len(ps) == 0:\\n return None, 0\\n min_val = ps[0]\\n min_index = 0\\n max_profit = 0\\n pair = None\\n\\n for i in range(len(ps)):\\n profit = ps[i] - min_val\\n\\n if profit > max_profit:\\n max_profit = profit\\n pair = (min_index, i)\\n \\n if ps[i] < min_val:\\n\\n min_val = ps[i]\\n min_index = i\\n\\n return pair, max_profit\\n\\n def sell_buy(ps):\\n return buy_sell([-_ for _ in ps])\\n\\n partitions = [prices]\\n total_profit = 0\\n\\n for _ in range(k):\\n\\n partition_index = 0\\n new_coords = None\\n new_profit = 0\\n\\n for i, partition in enumerate(partitions):\\n if i % 2 == 0:\\n coords, profit = buy_sell(partition)\\n else:\\n coords, profit = sell_buy(partition)\\n\\n if profit > new_profit:\\n new_profit = profit\\n partition_index = i\\n new_coords = coords\\n\\n if new_profit == 0:\\n break\\n\\n rel_part = partitions[partition_index]\\n\\n # print(rel_part)\\n # print(new_coords)\\n # print(new_profit)\\n\\n new_parts = [rel_part[0:new_coords[0]], rel_part[new_coords[0]+1 : new_coords[1]], rel_part[new_coords[1]+1 : len(rel_part)]]\\n # new_parts = [_ for _ in new_parts if len(_) > 0]\\n\\n partitions = partitions[:partition_index] + new_parts + partitions[partition_index+1:]\\n\\n print(partitions)\\n\\n total_profit = total_profit + new_profit\\n\\n return total_profit\\n\\n\\n\\n\\n\\n\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dpl = [[0, -float('inf')] for _ in range(k+1)]\\n for p in prices:\\n for i in range(k+1):\\n if i and dpl[i - 1][1] + p > dpl[i][0]:\\n dpl[i][0] = dpl[i-1][1] + p\\n if dpl[i][0] - p > dpl[i][1]:\\n dpl[i][1] = dpl[i][0] - p\\n return dpl[-1][0]\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n def solve(p: int):\\n b, s = (0, 0), (0, 0)\\n for x in reversed(prices):\\n s, b = max(s, (b[0] + x - p, b[1] + 1)), max(b, (s[0] - x, s[1]))\\n return b\\n l, r = 0, sum(prices)\\n while l < r:\\n m = (r + l + 1) // 2\\n if solve(m)[1] >= k:\\n l = m\\n else:\\n r = m - 1\\n return solve(l)[0] + l * k\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n if k == 0 or n <= 1:\\n return 0\\n \\n transactions = []\\n start, end = 0, 0\\n for i in range(1,n):\\n if prices[i] >= prices[i-1]:\\n end = i\\n else:\\n if prices[end] > prices[start]:\\n transactions.append( [prices[start], prices[end]] )\\n start = i\\n end = i\\n \\n if prices[end] > prices[start]:\\n transactions.append( [prices[start], prices[end]] )\\n \\n print(transactions)\\n\\n while len(transactions) > k:\\n # try delete one transaction\\n delete_idx = None\\n min_delete_loss = math.inf\\n for idx, (buy_price, sell_price) in enumerate(transactions):\\n if sell_price - buy_price < min_delete_loss:\\n delete_idx = idx\\n min_delete_loss = sell_price - buy_price\\n \\n merge_idx = None\\n min_merge_loss = math.inf\\n for idx in range(len(transactions)-1):\\n if transactions[idx][1] - transactions[idx+1][0] < min_merge_loss:\\n merge_idx = idx\\n min_merge_loss = transactions[idx][1] - transactions[idx+1][0]\\n\\n if min_delete_loss <= min_merge_loss:\\n transactions.pop(delete_idx)\\n else:\\n transactions[merge_idx][1] = transactions[merge_idx+1][1]\\n transactions.pop(merge_idx+1)\\n \\n return sum( [sell_price - buy_price for buy_price, sell_price in transactions] )\\n\\n\\n\\n\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n if 0:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # if 2*k >= len(prices): \\n # return sum(max(0, prices[i]-prices[i-1]) for i in range(1, len(prices)))\\n \\n pnl = [0]*len(prices)\\n #print(pnl)\\n val = [0]*len(prices)\\n for _ in range(k):\\n val[0] = 0\\n for i in range(1, len(pnl)): \\n val[i] = max(pnl[i], val[i-1] + prices[i] - prices[i-1]) \\n pnl[i] = max(pnl[i-1], val[i])\\n #print(pnl,'---',val)\\n return pnl[-1]\\n\\n \\n if 1:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n # solve special cases\\n if not prices or k == 0:\\n return 0\\n\\n # find all consecutively increasing subsequence\\n transactions = []\\n start = 0\\n end = 0\\n for i in range(1, n):\\n if prices[i] >= prices[i - 1]:\\n end = i\\n else:\\n if end > start:\\n transactions.append([start, end])\\n start = i\\n if end > start:\\n transactions.append([start, end])\\n print(transactions)\\n while len(transactions) > k:\\n # check delete loss\\n delete_index = 0\\n min_delete_loss = math.inf\\n for i in range(len(transactions)):\\n t = transactions[i]\\n profit_loss = prices[t[1]] - prices[t[0]]\\n if profit_loss < min_delete_loss:\\n min_delete_loss = profit_loss\\n delete_index = i\\n\\n # check merge loss\\n merge_index = 0\\n min_merge_loss = math.inf\\n for i in range(1, len(transactions)):\\n t1 = transactions[i - 1]\\n t2 = transactions[i]\\n profit_loss = prices[t1[1]] - prices[t2[0]]\\n if profit_loss < min_merge_loss:\\n min_merge_loss = profit_loss\\n merge_index = i\\n\\n # delete or merge\\n if min_delete_loss <= min_merge_loss:\\n transactions.pop(delete_index)\\n else:\\n transactions[merge_index - 1][1] = transactions[merge_index][1]\\n transactions.pop(merge_index)\\n\\n return sum(prices[j] - prices[i] for i, j in transactions)\\n\\n\\n if 0:\\n def get_sign(self, num):\\n if num > 0:\\n return 1\\n elif num < 0:\\n return -1\\n else:\\n return 0\\n def merge(self, diff_clean):\\n if len(diff_clean)==1:\\n return 1\\n #assume at least one place to merge\\n downs = [(diff_clean[i], i) for i in range(1,len(diff_clean),2)]\\n downs = sorted(downs)\\n while downs:# find the first deletable\\n p = downs.pop()[1]\\n if diff_clean[p]+diff_clean[p-1]>=0 and diff_clean[p]+diff_clean[p+1]>=0:\\n diff_clean[p] = diff_clean[p]+diff_clean[p-1]+diff_clean[p+1]\\n diff_clean.pop(p+1)\\n diff_clean.pop(p-1)\\n return 0\\n else:\\n continue\\n # if not return, reset downs\\n downs = [(diff_clean[i], i) for i in range(1,len(diff_clean),2)]\\n downs = sorted(downs)\\n p = downs.pop()[1]\\n diff_clean[p] = diff_clean[p]+diff_clean[p-1]+diff_clean[p+1]\\n diff_clean.pop(p+1)\\n diff_clean.pop(p-1)\\n return 0\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n if len(prices)<=1:\\n return 0\\n if k==0:\\n return 0\\n diff = [prices[i]-prices[i-1] for i in range(1, len(prices))]\\n if len(diff)==1:\\n return max(0, diff[0])\\n \\n #assume at least one diff.\\n sign = 0\\n diff_clean = []\\n current = 0\\n for i in range(0, len(diff)):\\n if self.get_sign(diff[i])==0: # skip the 0 change\\n continue\\n elif self.get_sign(diff[i])!=sign: #sign flips\\n sign = self.get_sign(diff[i])\\n if current!=0:\\n diff_clean.append(current)\\n current = diff[i]\\n else: #same sign, accumulate values\\n current += diff[i]\\n if current!=0:\\n diff_clean.append(current)\\n #print(diff_clean)\\n if len(diff_clean)==1 and diff_clean[0]<0:\\n return 0 # no winning time\\n if diff_clean[0]<0:\\n diff_clean.pop(0)\\n if diff_clean[-1]<0:\\n diff_clean.pop()\\n\\n count=len(diff_clean)//2+1 # number of raises\\n if k>=count: #enough transactions\\n raises = [diff_clean[i] for i in range(0,len(diff_clean),2)]\\n return sum(raises)\\n best = 0\\n count=len(diff_clean)//2+1 # number of raises\\n for ii in range(count): # number of time needed to do merge\\n raises = [diff_clean[i] for i in range(0,len(diff_clean),2)]\\n max_heaq = [-i for i in raises]\\n heapq.heapify(max_heaq)\\n s = 0\\n for i in range(min(k, len(raises))):\\n s+=-heapq.heappop(max_heaq)\\n best = max(s, best)\\n print(diff_clean, \\\"---\\\", best)\\n self.merge(diff_clean)\\n\\n count=len(diff_clean)//2+1 # number of raises\\n if k>=count: #enough transactions\\n raises = [diff_clean[i] for i in range(0,len(diff_clean),2)]\\n return max(best, sum(raises))\\n #print('merge:', self.merge([2, -2, 1, -3, 4, -5, 8, -3, 4], 1))\\n return best\\n\\n\\n\\n'''\\n2\\n[27,98,94,65,3,13,48,83,27,84,86,49,31,63,40,12,34,79,61,47,29,33,52,100,85,38,24,1,16,62,89,36,74,9,49,62,89]\\n\\n7\\n[12,97,25,64,17,93,9,52,42,85,81,84,1,54,15,72,11,94]\\n\\n'''\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n cash = [0] * (k+1)\\n trans = [-inf] * (k+1)\\n for price in prices:\\n prev_cash = cash.copy()\\n prev_trans = trans.copy()\\n\\n for i in range(1, k+1):\\n cash[i] = max(prev_cash[i], prev_trans[i]+price)\\n trans[i] = max(prev_trans[i], prev_cash[i-1]-price)\\n return max(cash)\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n # solve special cases\\n if not prices or k == 0:\\n return 0\\n\\n # find all consecutively increasing subsequence\\n transactions = []\\n start = 0\\n end = 0\\n for i in range(1, n):\\n if prices[i] >= prices[i - 1]:\\n end = i\\n else:\\n if end > start:\\n transactions.append([start, end])\\n start = i\\n if end > start:\\n transactions.append([start, end])\\n\\n while len(transactions) > k:\\n # check delete loss\\n delete_index = 0\\n min_delete_loss = math.inf\\n for i in range(len(transactions)):\\n t = transactions[i]\\n profit_loss = prices[t[1]] - prices[t[0]]\\n if profit_loss < min_delete_loss:\\n min_delete_loss = profit_loss\\n delete_index = i\\n\\n # check merge loss\\n merge_index = 0\\n min_merge_loss = math.inf\\n for i in range(1, len(transactions)):\\n t1 = transactions[i - 1]\\n t2 = transactions[i]\\n profit_loss = prices[t1[1]] - prices[t2[0]]\\n if profit_loss < min_merge_loss:\\n min_merge_loss = profit_loss\\n merge_index = i\\n\\n # delete or merge\\n if min_delete_loss <= min_merge_loss:\\n transactions.pop(delete_index)\\n else:\\n transactions[merge_index - 1][1] = transactions[merge_index][1]\\n transactions.pop(merge_index)\\n\\n return sum(prices[j] - prices[i] for i, j in transactions)\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n # solve special cases\\n if not prices or k == 0:\\n return 0\\n\\n # find all consecutively increasing subsequence\\n transactions = []\\n start = 0\\n end = 0\\n for i in range(1, n):\\n if prices[i] >= prices[i - 1]:\\n end = i\\n else:\\n if end > start:\\n transactions.append([start, end])\\n start = i\\n if end > start:\\n transactions.append([start, end])\\n\\n while len(transactions) > k:\\n # check delete loss\\n delete_index = 0\\n min_delete_loss = math.inf\\n for i in range(len(transactions)):\\n t = transactions[i]\\n profit_loss = prices[t[1]] - prices[t[0]]\\n if profit_loss < min_delete_loss:\\n min_delete_loss = profit_loss\\n delete_index = i\\n\\n # check merge loss\\n merge_index = 0\\n min_merge_loss = math.inf\\n for i in range(1, len(transactions)):\\n t1 = transactions[i - 1]\\n t2 = transactions[i]\\n profit_loss = prices[t1[1]] - prices[t2[0]]\\n if profit_loss < min_merge_loss:\\n min_merge_loss = profit_loss\\n merge_index = i\\n\\n # delete or merge\\n if min_delete_loss <= min_merge_loss:\\n transactions.pop(delete_index)\\n else:\\n transactions[merge_index - 1][1] = transactions[merge_index][1]\\n transactions.pop(merge_index)\\n\\n return sum(prices[j] - prices[i] for i, j in transactions)\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, A: List[int]) -> int:\\n cost = [math.inf] * (k + 1)\\n profit = [0] * (k + 1)\\n for p in A:\\n for k in range(1, k + 1):\\n cost[k] = min(cost[k], p - profit[k - 1])\\n profit[k] = max(profit[k], p - cost[k])\\n\\n return profit[-1]\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n # solve special cases\\n if not prices or k == 0:\\n return 0\\n\\n # find all consecutively increasing subsequence\\n transactions = []\\n start = 0\\n end = 0\\n for i in range(1, n):\\n if prices[i] >= prices[i - 1]:\\n end = i\\n else:\\n if end > start:\\n transactions.append([start, end])\\n start = i\\n if end > start:\\n transactions.append([start, end])\\n\\n while len(transactions) > k:\\n # check delete loss\\n delete_index = 0\\n min_delete_loss = math.inf\\n for i in range(len(transactions)):\\n t = transactions[i]\\n profit_loss = prices[t[1]] - prices[t[0]]\\n if profit_loss < min_delete_loss:\\n min_delete_loss = profit_loss\\n delete_index = i\\n\\n # check merge loss\\n merge_index = 0\\n min_merge_loss = math.inf\\n for i in range(1, len(transactions)):\\n t1 = transactions[i - 1]\\n t2 = transactions[i]\\n profit_loss = prices[t1[1]] - prices[t2[0]]\\n if profit_loss < min_merge_loss:\\n min_merge_loss = profit_loss\\n merge_index = i\\n\\n # delete or merge\\n if min_delete_loss <= min_merge_loss:\\n transactions.pop(delete_index)\\n else:\\n transactions[merge_index - 1][1] = transactions[merge_index][1]\\n transactions.pop(merge_index)\\n\\n return sum(prices[j] - prices[i] for i, j in transactions)\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n # solve special cases\\n if not prices or k == 0:\\n return 0\\n\\n # find all consecutively increasing subsequence\\n transactions = []\\n start = 0\\n end = 0\\n for i in range(1, n):\\n if prices[i] >= prices[i - 1]:\\n end = i\\n else:\\n if end > start:\\n transactions.append([start, end])\\n start = i\\n if end > start:\\n transactions.append([start, end])\\n\\n while len(transactions) > k:\\n # check delete loss\\n delete_index = 0\\n min_delete_loss = math.inf\\n for i in range(len(transactions)):\\n t = transactions[i]\\n profit_loss = prices[t[1]] - prices[t[0]]\\n if profit_loss < min_delete_loss:\\n min_delete_loss = profit_loss\\n delete_index = i\\n\\n # check merge loss\\n merge_index = 0\\n min_merge_loss = math.inf\\n for i in range(1, len(transactions)):\\n t1 = transactions[i - 1]\\n t2 = transactions[i]\\n profit_loss = prices[t1[1]] - prices[t2[0]]\\n if profit_loss < min_merge_loss:\\n min_merge_loss = profit_loss\\n merge_index = i\\n\\n # delete or merge\\n if min_delete_loss <= min_merge_loss:\\n transactions.pop(delete_index)\\n else:\\n transactions[merge_index - 1][1] = transactions[merge_index][1]\\n transactions.pop(merge_index)\\n\\n return sum(prices[j] - prices[i] for i, j in transactions)\",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n costs = [float(\\\"inf\\\") for _ in range(k)]\\n profits = [0 for _ in range(k)]\\n\\n for price in prices:\\n costs[0] = min(costs[0], price)\\n profits[0] = max(profits[0], price - costs[0])\\n for i in range(1, k):\\n costs[i] = min(costs[i], price - profits[i - 1])\\n profits[i] = max(profits[i], price - costs[i])\\n\\n return profits[-1]\",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n c = [float('inf')] * k\\n p = [0] * k\\n for i in prices:\\n for j in range(k):\\n if j == 0:\\n c[j] = min(c[j], i)\\n p[j] = max(p[j], i - c[j])\\n else:\\n c[j] = min(c[j], i - p[j-1])\\n p[j] = max(p[j], i - c[j])\\n return p[-1]\\n \",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n if len(prices) == 1:\\n return 0\\n buy = [-float(\\\"inf\\\")] * k\\n sell = [0] * k\\n for p in prices:\\n buy[0] = max(buy[0], -p)\\n sell[0] = max(sell[0], buy[0] + p)\\n # print(buy, sell)\\n for t in range(1, k):\\n buy[t] = max(buy[t], sell[t-1] - p)\\n sell[t] = max(sell[t], buy[t] + p)\\n # print(buy, sell)\\n return sell[-1]\\n\",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n buys, sells = [-10000]*k, [0]*k\\n for p in prices:\\n for i in range(k-1,0,-1):\\n buys[i], sells[i] = max(buys[i], sells[i-1]-p), max(sells[i], buys[i]+p)\\n buys[0], sells[0] = max(buys[0], -p), max(sells[0], buys[0]+p)\\n return sells[-1]\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"import sys\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n costs = [sys.maxsize] * k\\n profits = [0] * k\\n for index, price in enumerate(prices):\\n costs[0] = min(costs[0], price)\\n profits[0] = max(profits[0], price-costs[0])\\n for i in range(1, k):\\n costs[i] = min(costs[i], price - profits[i-1])\\n profits[i] = max(profits[i], price - costs[i])\\n return profits[k-1]\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n if k == 0 or not prices:\\n return 0\\n \\n n = len(prices)\\n \\n # If k >= n/2, we can consider it as infinite transactions.\\n if k >= n // 2:\\n max_profit = 0\\n for i in range(1, n):\\n if prices[i] > prices[i - 1]:\\n max_profit += prices[i] - prices[i - 1]\\n return max_profit\\n \\n # dp[i][j] - max profit with at most i transactions on day j\\n dp = [[0] * n for _ in range(k + 1)]\\n \\n for i in range(1, k + 1):\\n max_diff = -prices[0]\\n for j in range(1, n):\\n dp[i][j] = max(dp[i][j - 1], prices[j] + max_diff)\\n max_diff = max(max_diff, dp[i - 1][j] - prices[j])\\n \\n return dp[k][n - 1]\\n\",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n if not prices or k == 0:\\n return 0\\n n = len(prices)\\n if k >= n//2:\\n profit = 0\\n for i in range(1,n):\\n if prices[i] > prices[i-1]:\\n profit += prices[i] - prices[i-1]\\n return profit\\n buys = [float('-inf') for _ in range(k+1)]\\n sells = [0 for _ in range(k+1)]\\n for price in prices:\\n for i in range(k,0,-1):\\n sells[i] = max(price+buys[i], sells[i])\\n buys[i] = max(sells[i-1]-price,buys[i])\\n\\n return sells[-1]\\n\\n\\n \",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n cost = [float('inf')]*k\\n profit = [0]*k\\n for price in prices:\\n for j in range(k-1, -1, -1):\\n if j ==0:\\n cost[j] = min(cost[j], price)\\n else:\\n cost[j] = min(cost[j], price-profit[j-1])\\n profit[j] = max(profit[j], price-cost[j])\\n return profit[k-1]\",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"import sys\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n costs = [sys.maxsize] * k\\n profits = [0] * k\\n for index, price in enumerate(prices):\\n profits[0] = max(profits[0], price-costs[0])\\n costs[0] = min(costs[0], price)\\n for i in range(1, k):\\n profits[i] = max(profits[i], price - costs[i])\\n costs[i] = min(costs[i], price - profits[i-1])\\n return profits[k-1]\",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n # if max transactions limited by num of days\\n if k > len(prices)//2:\\n\\n t_ik0, t_ik1 = 0, float('-inf')\\n\\n for price in prices:\\n t_ik0, t_ik1 = max(t_ik0, t_ik1 + price), max(t_ik1, t_ik0 - price)\\n \\n return t_ik0\\n \\n t_ik0 = [0] * (k+1)\\n t_ik1 = [float('-inf')] * (k+1)\\n\\n for price in prices:\\n for j in range(k,0,-1):\\n t_ik0[j], t_ik1[j] = max(t_ik0[j], t_ik1[j]+price), max(t_ik1[j], t_ik0[j-1] - price)\\n \\n return t_ik0[-1]\\n\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n\\n cost = [float('inf')]*(k+1)\\n profit = [0]*(k+1)\\n\\n for price in prices:\\n for i in range(k):\\n cost[i+1] = min(cost[i+1], price - profit[i])\\n profit[i+1] = max(profit[i+1], price - cost[i+1])\\n \\n return profit[-1]\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # profit = [0]*(k+1)\\n # cost =[float('inf')]*(k+1)\\n\\n # for price in prices:\\n # for i in range(k):\\n # cost[i+1] = min(cost[i+1], price - profit[i])\\n # profit[i+1] = max(profit[i+1], price - cost[i+1])\\n \\n # return profit[-1]\\n\\n\\n\\n\\n\\n # profit = [0]*(k+1)\\n # cost = [float('inf')]*(k+1)\\n\\n # for price in prices:\\n # for i in range(k):\\n # cost[i+1] = min(cost[i+1], price - profit[i])\\n # profit[i+1] = max(profit[i+1], price - cost[i+1])\\n \\n # return profit[-1]\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # if k == 0:\\n # return 0\\n \\n # profit = [0]*(k+1)\\n # cost = [float('inf')]*(k+1)\\n\\n # for price in prices:\\n # for i in range(k):\\n # cost[i+1] = min(cost[i+1], price - profit[i])\\n # profit[i+1] = max(profit[i+1], price - cost[i+1])\\n \\n # return profit[-1]\\n\\n\\n\\n\\n\\n # if k == 0:\\n # return 0\\n \\n # profit = [0]*(k+1)\\n # cost = [float('inf')]*(k+1)\\n\\n # for price in prices:\\n # for i in range(k):\\n # cost[i+1] = min(cost[i+1], price - profit[i])\\n # profit[i+1] = max(profit[i+1], price - cost[i+1])\\n \\n # return profit[-1]\\n\\n\\n\\n # if k == 0:\\n # return 0\\n\\n # costs = [float('inf')] * (k+1)\\n # profits = [0] * (k+1)\\n\\n # for price in prices:\\n # for i in range(k): # how many transactions?\\n # # either don't buy at this stage, i.e. keep previous price array's costs[i+1],\\n # # or buy at this stage (cost can be negative, profit will be accummulated later)\\n # costs[i+1] = min(costs[i+1], price - profits[i])\\n\\n # # either don't sell at this stage, i.e. keep previous price array's profits[i+1],\\n # # or sell at this stage and realize profit\\n # profits[i+1] = max(profits[i+1], price - costs[i+1])\\n \\n # return profits[k]\\n\\n\\n \\n # n = len(prices)\\n\\n # if not prices or k == 0:\\n # return 0\\n\\n # # when you can buy/sell more times than length of array\\n # if k // 2 > n:\\n # result = 0\\n # for i, j in zip(prices[1:], prices[:-1]):\\n # result += max(0, i-j)\\n # return result\\n\\n # # dp[i][j][hold] = balance\\n # # increase 0 <= j <= k by 1 only when we buy, not when we sell\\n # # hold = 1 for holding, 0 for not holding\\n # dp = [[[-float('inf')]*2 for _ in range(k+1)] for _ in range(n)]\\n\\n # # initial conditions\\n # dp[0][0][0] = 0\\n # dp[0][1][1] = -prices[0] # negative because cost incured\\n\\n # for i in range(1, n):\\n # for j in range(k+1):\\n # # transition equation\\n # # either continue not holding or convert buy to sell \\n # dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1] + prices[i])\\n # # can't hold stock without any transaction\\n # if j > 0:\\n # # either continue holding or buy \\n # dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j-1][0] - prices[i])\\n \\n # result = max(dp[n-1][j][0] for j in range(k+1))\\n # return result\\n \",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n '''\\n 1. State Definition:\\n Let dp[i][j] represent the maximum profit we can achieve by making at most i transactions up to the j-th day.\\n\\n 2. State Transition:\\n For each day j and each transaction i, we have two choices:\\n a. No Transaction on Day j: This means the profit is the same as the profit on day j-1 with i transactions: dp[i][j-1].\\n b. Sell on Day j: We need to consider the best day m (0 <= m < j) to buy stock and then sell on day j. This involves adding the profit from selling on day j (prices[j] - prices[m]) to the profit we had \\n after making i-1 transactions up to day m: dp[i-1][m] + prices[j] - prices[m].\\n The formula becomes: \\n dp[i][j]=max(dp[i][j−1], max(prices[j]−prices[m]+dp[i−1][m])) where m<j\\n This can be optimized by keeping track of the maximum value of dp[i-1][m] - prices[m] as we iterate through the days.\\n \\n\\n 3. Final Result:\\n The final answer will be dp[k][n-1] where n is the number of days.\\n ----------\\n dp[i][j] = max(dp[i][j-1], prices[j] + max_diff):\\n Purpose: This line determines the best possible profit on day j with i transactions:\\n\\n dp[i][j-1] means no transaction is made on day j, so the profit is the same as the previous day.\\n prices[j] + max_diff represents the scenario where we sell on day j. The profit from this action is the price on day j plus the best profit we could have achieved with i-1 transactions before this day (max_diff captures the best possible buy scenario).\\n\\n max_diff = max(max_diff, dp[i-1][j] - prices[j]):\\n \\n Purpose: This line updates max_diff to reflect the maximum profit that could be achieved by buying on day j and then selling at a later date:\\n dp[i-1][j] - prices[j] gives the profit after i-1 transactions if we buy on day j. This value is compared with the existing max_diff to ensure max_diff always holds the maximum possible profit from buying on any previous day and considering i-1 transactions.\\n '''\\n n = len(prices)\\n if n == 0:\\n return 0\\n \\n # If k >= n // 2, it's equivalent to infinite transactions\\n if k >= n // 2:\\n max_profit = 0\\n for i in range(1, n):\\n if prices[i] > prices[i - 1]:\\n max_profit += prices[i] - prices[i - 1]\\n return max_profit\\n \\n # DP table to store the maximum profit\\n dp = [[0] * n for _ in range(k + 1)]\\n \\n for i in range(1, k + 1):\\n # Track max_diff to optimize the calculation of the maximum profit using a previous transaction.\\n max_diff = -prices[0]\\n for j in range(1, n):\\n # Update dp[i][j] by comparing:\\n # Not making a transaction on day j (dp[i][j-1]).\\n # Selling on day j (prices[j] + max_diff).\\n dp[i][j] = max(dp[i][j - 1], prices[j] + max_diff) \\n max_diff = max(max_diff, dp[i - 1][j] - prices[j]) # This represents the maximum profit with at most i-1 transactions up to day j.\\n\\n \\n return dp[k][-1]\\n\\n '''naive DP\\n for i in range(1, k + 1):\\n for j in range(1, n):\\n max_profit = 0\\n for m in range(j):\\n max_profit = max(max_profit, prices[j] - prices[m] + dp[i-1][m])\\n dp[i][j] = max(dp[i][j-1], max_profit)\\n return dp[k][n-1]\\n \\n The naive approach has a significantly higher time complexity (O(k * n^2)) compared to the optimized approach (O(k * n)).'''\",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n # if max transactions limited by num of days\\n if k > len(prices)//2:\\n\\n t_ik0, t_ik1 = 0, float('-inf')\\n\\n for price in prices:\\n t_ik0, t_ik1 = max(t_ik0, t_ik1 + price), max(t_ik1, t_ik0 - price)\\n \\n return t_ik0\\n \\n t_ik0 = [0] * (k+1)\\n t_ik1 = [float('-inf')] * (k+1)\\n\\n for price in prices:\\n for j in range(k,0,-1):\\n t_ik0[j], t_ik1[j] = max(t_ik0[j], t_ik1[j]+price), max(t_ik1[j], t_ik0[j-1] - price)\\n \\n return t_ik0[-1]\\n\",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # dp[i][k1]: the max balances on the END of i-th day with at most (k1+1) transactions.\\n # dp[i][k1] = max(dp[i - 1][k1], dp[j - 1][k1 - 1] + prices[i] - prices[j] for j in range(i))\\n # Reference: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/solutions/306282/different-dp-python-solutions-with-thinking-process\\n n = len(prices)\\n if n < 2: return 0\\n dp = [[0] * (k + 1) for _ in range(n)]\\n for k1 in range(1, k + 1):\\n local_max = -prices[0]\\n for i in range(1, n):\\n dp[i][k1] = max(dp[i - 1][k1], prices[i] + local_max)\\n local_max = max(local_max, dp[i - 1][k1 - 1] - prices[i])\\n return dp[-1][-1]\\n \",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n if n == 0 or k == 0:\\n return 0\\n \\n # If k is large enough, we can perform as many transactions as we like\\n if k >= n // 2:\\n return sum(max(prices[i+1] - prices[i], 0) for i in range(n - 1))\\n \\n # DP table\\n dp = [[0] * n for _ in range(k + 1)]\\n \\n for i in range(1, k + 1):\\n max_diff = -prices[0] # Initial value of max difference\\n for j in range(1, n):\\n # Update dp[i][j] for the current transaction\\n dp[i][j] = max(dp[i][j-1], prices[j] + max_diff)\\n # Update max_diff for future days\\n max_diff = max(max_diff, dp[i-1][j] - prices[j])\\n \\n return dp[k][n-1]\\n\",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n if not prices or k == 0:\\n return 0\\n \\n\\n held = [[-math.inf] * k for i in range(len(prices))]\\n sold = [[0] * k for i in range(len(prices))]\\n\\n held[0][0] = -prices[0]\\n \\n\\n for i in range(1, len(prices)):\\n for txn in range(k):\\n if txn > 0:\\n held[i][txn] = max(held[i-1][txn], sold[i-1][txn-1] - prices[i])\\n else:\\n held[i][txn] = max(held[i-1][txn], -prices[i])\\n\\n sold[i][txn] = max(sold[i-1][txn], held[i-1][txn] + prices[i])\\n\\n res = 0\\n for txn in range(k):\\n res = max(res, sold[-1][txn])\\n return res\\n \",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [[0 for g in range(k+1)] for j in range(2)]\\n for i in range(len(prices)-1, -1, -1):\\n curr = [[0 for u in range(k+1)] for j in range(2)]\\n for tran in range(1,k+1):\\n curr[0][tran] = max(dp[1][tran] - prices[i], dp[0][tran])\\n curr[1][tran] = max(dp[0][tran - 1] + prices[i], dp[1][tran])\\n dp = curr\\n return max(dp[0])\\n \\n def dp(self, prices, index, bought,dp1, trans, k):\\n if(index == len(prices) or trans == k):\\n return 0\\n\\n if(dp1[index][bought][trans] != -1):\\n return dp1[index][bought][trans]\\n take = 0\\n notTake = 0\\n if(not bought):\\n take = self.dp(prices, index+1, True, dp1, trans, k) - prices[index]\\n notTake = self.dp(prices, index + 1, False, dp1, trans, k)\\n else:\\n take = self.dp(prices, index + 1, False, dp1, trans + 1, k) + prices[index]\\n notTake = self.dp(prices, index + 1, bought, dp1, trans, k)\\n dp1[index][bought][trans] = max(take, notTake)\\n return max(take, notTake)\",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [[0]*(1+2*k) for _ in range(len(prices))]\\n for i in range(1, 1+2*k, 2):\\n dp[0][i] = -prices[0]\\n for i in range(1, len(prices)):\\n dp[i][0] = dp[i-1][0]\\n for j in range(1, 2*k, 2):\\n dp[i][j] = max(dp[i-1][j], dp[i-1][j-1] - prices[i])\\n dp[i][j+1] = max(dp[i-1][j+1], dp[i-1][j] + prices[i])\\n return dp[-1][-1]\",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n=len(prices)\\n cap=k+1 #k+1 choices\\n buy=2 #2 choices \\n #dp=[[[0 for _ in range(cap)] for _ in range(buy)] for _ in range(n+1)]\\n ahead=[[0 for _ in range(cap)] for _ in range(buy)]\\n cur=[[0 for _ in range(cap)] for _ in range(buy)]\\n for i in range(n-1,-1,-1):\\n for b in range(2):\\n for c in range(1,k+1):\\n if(b==0):\\n cur[b][c]=max(0+ahead[0][c],-prices[i]+ahead[1][c])\\n elif(b==1):\\n cur[b][c]=max(0+ahead[1][c],+prices[i]+ahead[0][c-1])\\n ahead=cur[:]\\n return ahead[0][k]\\n \",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n profitGrid = [[-float('inf')]*len(prices) for _ in range(k*2)]\\n\\n buyState = 0\\n\\n for buyState in range(k*2):\\n for consideredPrice in range(len(prices)):\\n if buyState == 0:\\n profitGrid[buyState][consideredPrice] = max(-prices[consideredPrice], profitGrid[buyState][consideredPrice-1])\\n elif buyState % 2 == 0:\\n profitGrid[buyState][consideredPrice] = max(profitGrid[buyState-1][consideredPrice]-prices[consideredPrice], profitGrid[buyState][consideredPrice-1])\\n\\n else:\\n profitGrid[buyState][consideredPrice] = max(prices[consideredPrice] + profitGrid[buyState-1][consideredPrice], profitGrid[buyState][consideredPrice-1])\\n return profitGrid[-1][-1]\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n holding = [[0 for _ in range(k+1)]for __ in range(n+1)]\\n empty = [[0 for _ in range(k+1)]for __ in range(n+1)]\\n for i in range(n-1, -1, -1):\\n for capa in range(1, k+1):\\n holding[i][capa] = max(\\n holding[i+1][capa], \\n empty[i+1][capa-1] + prices[i]\\n )\\n empty[i][capa] = max(\\n empty[i+1][capa],\\n holding[i+1][capa] - prices[i]\\n )\\n return empty[0][k]\\n\\n\\n\\n\\n \",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n aheadRow = [[ 0 for _ in range(k + 1)] for _ in range(2)]\\n curRow = [[ 0 for _ in range(k + 1)] for _ in range(2)]\\n\\n for ind in range(n - 1, -1, -1):\\n for capacity in range(1, k + 1):\\n curRow[1][capacity] = max(\\n -prices[ind] + aheadRow[0][capacity],\\n 0 + aheadRow[1][capacity]\\n )\\n curRow[0][capacity] = max(\\n prices[ind] + aheadRow[1][capacity - 1],\\n 0 + aheadRow[0][capacity]\\n )\\n \\n aheadRow = list(curRow)\\n\\n return aheadRow[1][k]\\n\",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n if n <=1:\\n return 0\\n\\n buy = [[0]*(k+1) for _ in range(n+1)]\\n sell = [[0]*(k+1) for _ in range(n+1)]\\n\\n for i in range(1,n+1):\\n p = prices[i-1]\\n for each_k in range(1,k+1): # otherwise each_k-1 will cause problem when in range(0,k)\\n if i == 1:\\n buy[i][each_k] = -p\\n sell[i][each_k] = 0\\n else:\\n buy[i][each_k] = max(buy[i-1][each_k],sell[i-1][each_k-1]-p)\\n sell[i][each_k] = max(sell[i-1][each_k],buy[i-1][each_k]+p)\\n return max(sell[-1])\\n\\n \",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n # Create the dp array with dimensions [n+1][2][k+1]\\n dp = [[[0 for _ in range(k + 1)] for _ in range(2)] for _ in range(n + 1)]\\n\\n # Fill the dp table in reverse order\\n for ind in range(n - 1, -1, -1):\\n for buy in range(2):\\n for cap in range(1, k + 1):\\n if buy == 1:\\n # If we are in buying state\\n dp[ind][buy][cap] = max(-prices[ind] + dp[ind + 1][0][cap], dp[ind + 1][1][cap])\\n else:\\n # If we are in selling state\\n dp[ind][buy][cap] = max(prices[ind] + dp[ind + 1][1][cap - 1], dp[ind + 1][0][cap])\\n\\n return dp[0][1][k]\\n\",\n \"runtime\": \"126\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # def rec(i, holding, transactions, memo):\\n # if i == len(prices) or transactions == 0:\\n # return 0\\n\\n # if (i, holding, transactions) in memo:\\n # return memo[(i, holding, transactions)]\\n\\n # notpick = rec(i+1, holding, transactions, memo)\\n\\n # if holding:\\n # pick = prices[i] + rec(i+1, False, transactions-1, memo)\\n # else:\\n # pick = -prices[i] + rec(i+1, True, transactions, memo)\\n\\n # memo[(i, holding, transactions)] = max(pick, notpick)\\n # return memo[(i, holding, transactions)]\\n\\n # memo = {}\\n # return rec(0, False, k, memo)\\n\\n n = len(prices)\\n dp = [[[0 for _ in range(k+1)] for _ in range(2)] for _ in range(n+1)] \\n\\n for i in range(n-1, -1, -1):\\n for holding in range(2):\\n for transactions in range(1, k+1):\\n if holding == 0:\\n dp[i][holding][transactions] = max(dp[i+1][0][transactions], -prices[i]+dp[i+1][1][transactions])\\n else:\\n dp[i][holding][transactions] = max(dp[i+1][1][transactions], prices[i]+dp[i+1][0][transactions-1])\\n\\n return dp[0][0][k]\",\n \"runtime\": \"126\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n length = len(prices)\\n if length == 0:\\n return 0\\n dp = [[0] * (2 * k + 1) for _ in range(length)]\\n\\n for i in range(1, 2 * k + 1, 2):\\n dp[0][i] = -prices[0]\\n for j in range(1, length):\\n dp[j][0] = dp[j-1][0]\\n for m in range(1, 2 * k + 1):\\n dp[j][m] = max(dp[j-1][m], dp[j-1][m-1] + (-1) ** m * (prices[j]))\\n return dp[-1][2 * k]\\n \",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n prev = [[0 for i in range(2)] for j in range(k+1)]\\n cur = [[0 for i in range(2)] for j in range(k+1)]\\n \\n for ind in range(n-1, -1, -1):\\n for transactions in range(1, k+1):\\n for bought in range(2):\\n # if I have already bought a stock\\n if bought == 1:\\n # I can either sell it\\n sell = prices[ind] + prev[transactions-1][0]\\n # or keep it\\n not_sell = prev[transactions][1]\\n cur[transactions][bought] = max(sell, not_sell)\\n\\n # if I dont have a stock in hand\\n else:\\n # buy = float('-inf')\\n # I can either buy a stock if I haven't done k transactions\\n buy = -prices[ind] + prev[transactions][1]\\n # or not buy a stock\\n not_buy = prev[transactions][0]\\n cur[transactions][bought] = max(buy, not_buy)\\n \\n prev = cur[:]\\n \\n return prev[k][0]\\n \",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def calculate_profit(self, ind, tranNo, n, prices, dp):\\n if ind == n or tranNo == 2 * self.k:\\n return 0\\n \\n if dp[ind][tranNo] != -1:\\n return dp[ind][tranNo]\\n \\n if tranNo % 2 == 0:\\n profit = max(\\n -prices[ind] + self.calculate_profit(ind + 1, tranNo + 1, n, prices, dp),\\n 0 + self.calculate_profit(ind + 1, tranNo, n, prices, dp)\\n )\\n else:\\n profit = max(\\n prices[ind] + self.calculate_profit(ind + 1, tranNo + 1, n, prices, dp),\\n 0 + self.calculate_profit(ind + 1, tranNo, n, prices, dp)\\n )\\n \\n dp[ind][tranNo] = profit\\n\\n return dp[ind][tranNo] \\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[ 0 for _ in range(2 * k + 1)] for _ in range(n + 1)]\\n\\n for ind in range(n - 1, -1, -1):\\n for tranNo in range(2 * k - 1, -1, -1):\\n if tranNo % 2 == 0:\\n profit = max(\\n -prices[ind] + dp[ind + 1][tranNo + 1],\\n 0 + dp[ind + 1][tranNo]\\n )\\n else:\\n profit = max(\\n prices[ind] + dp[ind + 1][tranNo + 1],\\n 0 + dp[ind + 1][tranNo]\\n )\\n \\n dp[ind][tranNo] = profit\\n\\n return dp[0][0]\\n\",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[ 0 for _ in range(k + 1)] for _ in range(2)] for _ in range(n + 1)]\\n\\n\\n for ind in range(n - 1, -1, -1):\\n for capacity in range(1, k + 1):\\n dp[ind][1][capacity] = max(\\n -prices[ind] + dp[ind + 1][0][capacity],\\n 0 + dp[ind + 1][1][capacity]\\n )\\n dp[ind][0][capacity] = max(\\n prices[ind] + dp[ind + 1][1][capacity - 1],\\n 0 + dp[ind + 1][0][capacity]\\n )\\n\\n return dp[0][1][k]\\n\",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n=len(prices)\\n\\n dp=[[[0 for _ in range(k+1)] for _ in range(2)] for _ in range(n+1)]\\n\\n\\n for ind in range(n-1,-1,-1):\\n for buy in range(2):\\n for cap in range(1,k+1):\\n \\n if buy == 1:\\n dp[ind][buy][cap]=max(0 + dp[ind+1][1][cap] , -prices[ind] + dp[ind+1][0][cap])\\n else:\\n dp[ind][buy][cap]=max(0 + dp[ind+1][0][cap] , prices[ind] + dp[ind+1][1][cap-1])\\n \\n return dp[0][1][k]\\n\\n\\n\\n \",\n \"runtime\": \"137\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[ 0 for _ in range(k + 1)] for _ in range(2)] for _ in range(n + 1)]\\n\\n\\n for ind in range(n - 1, -1, -1):\\n for buy in range(2):\\n for capacity in range(1, k + 1):\\n if buy:\\n profit = max(\\n -prices[ind] + dp[ind + 1][0][capacity],\\n 0 + dp[ind + 1][1][capacity]\\n )\\n else:\\n profit = max(\\n prices[ind] + dp[ind + 1][1][capacity - 1],\\n 0 + dp[ind + 1][0][capacity]\\n )\\n dp[ind][buy][capacity] = profit\\n\\n return dp[0][1][k]\\n\",\n \"runtime\": \"137\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n\\n # 0 --- 未持有， 1 --- 持有\\n n = len(prices)\\n d = [[[-math.inf] * 2 for x in range(k+1)] for _ in range(2)]\\n\\n d[0][1][1] = - prices[0]\\n d[0][0][0] = 0\\n ans = 0\\n cur = 1\\n\\n for x in range(1,n): \\n d[cur][0][0] = 0\\n for i in range(1,k+1):\\n d[cur][i][0] = max(d[cur^1][i][0], d[cur^1][i][1] + prices[x] )\\n d[cur][i][1] = max(d[cur^1][i][1], d[cur^1][i-1][0] - prices[x] )\\n ans = max(ans, d[cur][i][0])\\n cur ^= 1\\n\\n return ans\",\n \"runtime\": \"141\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n STOCK, CASH = 0, 1 # stock or cash at hand\\n dp = collections.defaultdict(int)\\n for trans in range(k+1):\\n dp[(STOCK, trans)] = -math.inf # no holding at the beginning\\n \\n for price in prices:\\n for trans in range(1, k+1):\\n dp[(STOCK, trans)] = max(dp[(STOCK, trans)], dp[(CASH, trans-1)] - price )\\n dp[(CASH, trans)] = max(dp[(CASH, trans)], dp[(STOCK, trans)] + price)\\n\\n return dp[(CASH, k)]\\n\",\n \"runtime\": \"141\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # Edge Case:\\n if not prices or not k:\\n return 0\\n\\n n = len(prices)\\n # Special case with 2k > n: this means we have more than enough transactions to secure every possible profit\\n res = 0\\n if 2 * k >= n:\\n for i, j in zip(prices[:-1], prices[1:]):\\n res += max(0, j - i)\\n return res\\n \\n # dp[i][j][l] refers to the profit at ith day, using j purchases, holding or not the stock\\n # dp = [[[float('-inf')] * 2] * (k + 1)] * n\\n dp = [[[-math.inf] * 2 for _ in range(k + 1)] for _ in range(n)]\\n dp[0][0][0] = 0\\n dp[0][1][1] = -prices[0]\\n\\n for i in range(1, n):\\n for j in range(0, k + 1):\\n # Do not hold the stock \\n # case 1: did not hold before, and continue so\\n # case 2: held it before, and want to sell it\\n dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j][1] + prices[i])\\n\\n # Hold the stock\\n # case 1: held it before, and continue so\\n # case 2: did not hold it before, and want to buy it \\n # noted, you cannot buy it when exceeding purchase limit\\n if j > 0:\\n dp[i][j][1] = max(dp[i - 1][j - 1][0] - prices[i], dp[i - 1][j][1])\\n \\n # find the \\n res = max(dp[n - 1][j][0] for j in range(k + 1))\\n \\n return res\\n \\n\\n\\n\",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"class Solution:\\n def calculate_profit(self, ind, buy, k, n, prices, dp):\\n if ind == n or k == 0:\\n return 0\\n \\n if dp[ind][buy][k] != -1:\\n return dp[ind][buy][k]\\n\\n if buy:\\n profit = max(\\n -prices[ind] + self.calculate_profit(ind + 1, 0, k, n, prices, dp),\\n 0 + self.calculate_profit(ind + 1, 1, k, n, prices, dp)\\n )\\n else:\\n profit = max(\\n prices[ind] + self.calculate_profit(ind + 1, 1, k - 1, n, prices, dp),\\n 0 + self.calculate_profit(ind + 1, 0, k, n, prices, dp)\\n )\\n \\n dp[ind][buy][k] = profit\\n return dp[ind][buy][k]\\n \\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[ 0 for _ in range(k + 1)] for _ in range(2)] for _ in range(n + 1)]\\n\\n\\n for ind in range(n - 1, -1, -1):\\n for buy in range(2):\\n for capacity in range(1, k + 1):\\n if buy:\\n profit = max(\\n -prices[ind] + dp[ind + 1][0][capacity],\\n 0 + dp[ind + 1][1][capacity]\\n )\\n else:\\n profit = max(\\n prices[ind] + dp[ind + 1][1][capacity - 1],\\n 0 + dp[ind + 1][0][capacity]\\n )\\n dp[ind][buy][capacity] = profit\\n\\n return dp[0][1][k]\\n\",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n # solve special cases\\n if not prices or k == 0:\\n return 0\\n\\n if k * 2 >= n:\\n res = 0\\n for i, j in zip(prices[1:], prices[:-1]):\\n res += max(0, i - j)\\n return res\\n\\n # dp[i][used_k][ishold] = balance\\n # ishold: 0 nothold, 1 hold\\n dp = [[[-math.inf] * 2 for _ in range(k + 1)] for _ in range(n)]\\n\\n # set starting value\\n dp[0][0][0] = 0\\n dp[0][1][1] = -prices[0]\\n\\n # fill the array\\n for i in range(1, n):\\n for j in range(k + 1):\\n # transition equation\\n dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j][1] + prices[i])\\n # you can't hold stock without any transaction\\n if j > 0:\\n dp[i][j][1] = max(\\n dp[i - 1][j][1], dp[i - 1][j - 1][0] - prices[i]\\n )\\n\\n res = max(dp[n - 1][j][0] for j in range(k + 1))\\n return res\",\n \"runtime\": \"149\"\n },\n {\n \"code\": \"class Solution:\\n def calculate_profit(self, ind, tranNo, n, prices, dp):\\n if ind == n or tranNo == 2 * self.k:\\n return 0\\n \\n if dp[ind][tranNo] != -1:\\n return dp[ind][tranNo]\\n \\n if tranNo % 2 == 0:\\n profit = max(\\n -prices[ind] + self.calculate_profit(ind + 1, tranNo + 1, n, prices, dp),\\n 0 + self.calculate_profit(ind + 1, tranNo, n, prices, dp)\\n )\\n else:\\n profit = max(\\n prices[ind] + self.calculate_profit(ind + 1, tranNo + 1, n, prices, dp),\\n 0 + self.calculate_profit(ind + 1, tranNo, n, prices, dp)\\n )\\n \\n dp[ind][tranNo] = profit\\n\\n return dp[ind][tranNo] \\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n self.k = k\\n dp = [[ -1 for _ in range(2 * k)] for _ in range(n)]\\n return self.calculate_profit(0, 0, n, prices, dp)\\n\",\n \"runtime\": \"149\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n STOCK, CASH = 0, 1\\n dp = defaultdict(int) \\n for idx in range(k+1):\\n dp[STOCK, idx] = -float('inf')\\n for price in prices:\\n for idx in range(1,k+1):\\n dp[CASH,idx] = max(dp[CASH,idx], dp[STOCK,idx] + price)\\n dp[STOCK,idx] = max(dp[STOCK,idx], dp[CASH,idx-1] - price)\\n return dp[CASH,k]\",\n \"runtime\": \"153\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, nums: List[int]) -> int:\\n n = len(nums)\\n dp = [[[0]*(k+1) for i in range(2)] for j in range(n+1)]\\n for i in range(n-1,-1,-1):\\n for j in range(2):\\n for k in range(1,k+1):\\n profit = 0\\n if j:\\n ntake = dp[i+1][1][k]\\n take = -nums[i] + dp[i+1][0][k]\\n profit = max(ntake,take)\\n else:\\n ntake1 = dp[i+1][0][k]\\n take1 = nums[i] + dp[i+1][1][k-1]\\n profit = max(ntake1,take1)\\n dp[i][j][k] = profit\\n ans = 0\\n print(dp)\\n for i in range(k+1):\\n ans = max(ans,dp[0][1][i])\\n return ans\\n\\n\",\n \"runtime\": \"153\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # 今天有, 最大交易次數還有t\\n t = k\\n\\n days = len(prices)\\n dp = [[[0] * 2 for i in range(t + 1)] for j in range(days + 1)]\\n # dp[0][...][0] = dp[...][0][0] = 0\\n # dp[0][...][1] = dp[...][0][1] = float(\\\"-inf\\\")\\n for i in range(t + 1):\\n dp[0][i][1] = float(\\\"-inf\\\")\\n for i in range(1, days + 1):\\n dp[i][0][1] = float(\\\"-inf\\\")\\n # print(dp)\\n\\n for day in range(1, days + 1):\\n for i in range(1, t + 1):\\n if day == 1:\\n dp[day][i][0] = 0\\n dp[day][i][1] = -prices[day - 1]\\n continue\\n dp[day][i][0] = max(dp[day - 1][i][0], dp[day - 1][i][1] + prices[day - 1])\\n dp[day][i][1] = max(dp[day - 1][i][1], dp[day - 1][i - 1][0] - prices[day - 1])\\n\\n # print(dp)\\n\\n return dp[-1][-1][0]\",\n \"runtime\": \"157\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # bottom up\\n n = len(prices)\\n if not n: return 0\\n dp = [[[float('-inf')] * 2 for _ in range(k + 1)] for _ in range(n)] # prices index, current k, not bought / bought\\n dp[0][0][0] = 0\\n dp[0][1][1] = -prices[0]\\n\\n for i in range(1, n):\\n for j in range(k + 1):\\n dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j][1] + prices[i])\\n if j > 0:\\n dp[i][j][1] = max(dp[i - 1][j][1], dp[i - 1][j - 1][0] - prices[i])\\n \\n return max(dp[n - 1][j][0] for j in range(k + 1))\\n\\n\\n # top down\\n @cache\\n def dfs(i, bought, remaining):\\n if not remaining or i >= len(prices): return 0\\n if bought:\\n not_sell = dfs(i + 1, True, remaining)\\n sell = dfs(i + 1, False, remaining - 1) + prices[i]\\n return max(not_sell, sell)\\n else:\\n not_buy = dfs(i + 1, False, remaining)\\n buy = dfs(i + 1, True, remaining) - prices[i]\\n return max(not_buy, buy)\\n \\n return dfs(0, False, k)\",\n \"runtime\": \"157\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp=[[0]*(2*k+1) for _ in range(len(prices))]\\n for i in range(2*k+1):\\n if i%2:\\n dp[0][i]= -prices[0] # 奇数，也就是每次买入时间，初始成-prices[0]\\n \\n for i in range(1,len(prices)):\\n for j in range(0,2*k,2): # 注意j每次加二，并且上限是2k\\n print(j)\\n # 买入\\n dp[i][j+1]= max(dp[i-1][j+1],dp[i-1][j]-prices[i])\\n # 卖出\\n dp[i][j+2]= max(dp[i-1][j+2],dp[i-1][j+1]+prices[i])\\n return dp[-1][-1]\\n \",\n \"runtime\": \"161\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n if k * 2 >= len(prices):\\n maxProfit = 0\\n for i,j in zip(prices[1:], prices[:-1]):\\n maxProfit += i-j if i >= j else 0\\n return maxProfit\\n dp = [[[-float('inf')] * 2 for _ in range(k+1)] for _ in range(len(prices))]\\n dp[0][0][0] = 0\\n dp[0][1][1] = -prices[0]\\n for i in range(1, len(prices)):\\n for j in range(k+1):\\n dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1] + prices[i])\\n if j > 0: dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j-1][0] - prices[i])\\n maxProfit = -float('inf')\\n for j in range(k+1):\\n maxProfit = max(maxProfit, dp[len(prices)-1][j][0])\\n return maxProfit\\n \",\n \"runtime\": \"161\"\n },\n {\n \"code\": \"from typing import List\\n\\n\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[0] * 2 for _ in range(k+1) ] for _ in range(n+1) ]\\n\\n for i in range(n-1,-1, -1):\\n for remain_k in range(1, k+1):\\n for holding in range(2):\\n do_nothing = dp[i+1][remain_k][holding]\\n\\n if holding:\\n do_something = prices[i] + dp[i+1][remain_k-1][0]\\n else: \\n do_something = -prices[i] + dp[i+1][remain_k][1]\\n dp[i][remain_k][holding] = max(do_nothing, do_something)\\n return dp[0][k][0]\\n\",\n \"runtime\": \"165\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[0] * 2 for _ in range(k + 1)] for _ in range(n + 1)]\\n\\n for i in range(n - 1, -1, -1):\\n for transactions_remaining in range(1, k + 1):\\n for holding in range(2):\\n do_nothing = dp[i + 1][transactions_remaining][holding]\\n\\n if holding:\\n do_something = prices[i] + dp[i + 1][transactions_remaining - 1][0]\\n else:\\n do_something = -prices[i] + dp[i + 1][transactions_remaining][1]\\n \\n dp[i][transactions_remaining][holding] = max(do_something, do_nothing)\\n \\n return dp[0][k][0]\",\n \"runtime\": \"165\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n#Top Down DP\\n# Let dp(i,op,holding) represents maximum achievable profit #i: current day, op remaining operations, holding:(1:holding 0:not holding)\\n # memo = {}\\n # def dp(i,op,holding):\\n # if (i,op,holding) in memo: return memo[(i,op,holding)]\\n # #Base Case: when we run out of ops or no longer on the market,\\n # # we cannot make any money\\n # if op == 0 or i == len(prices):\\n # return 0\\n # if holding: #If we are holding stock, We can sell, or not sell\\n # sell = prices[i]+ dp(i+1, op-1, 0)\\n # not_sell = dp(i+1, op, 1)\\n # memo[(i,op,holding)] = max(sell, not_sell)\\n # else: #If we are holding stock, We can buy or not buy\\n # buy = dp(i+1, op, 1) - prices[i]\\n # not_buy = dp(i+1, op, 0)\\n # memo[(i,op,holding)] = max(buy,not_buy)\\n # return memo[(i,op,holding)]\\n # return dp(0,k,0)\\n #Time:O(nk) Space:O(n) where n = len(prices)\\n\\n\\n#Bottom Up\\n# Let dp(i,op,holding) represents maximum achievable profit #i: current day, op remaining operations, holding:(1:holding 0:not holding)\\n n = len(prices)\\n dp = [[[0]*2 for _ in range(k+1)] for _ in range(n+1)]\\n for i in range(n-1,-1,-1):\\n for op in range(1,k+1):\\n for holding in range(2):\\n if holding == 1:\\n sell = dp[i+1][op-1][0] + prices[i]\\n not_sell = dp[i+1][op][1]\\n dp[i][op][holding] = max(sell,not_sell)\\n else:\\n buy = dp[i+1][op][1] - prices[i]\\n not_buy = dp[i+1][op][0]\\n dp[i][op][holding] = max(buy,not_buy)\\n\\n return dp[0][k][0]\\n\",\n \"runtime\": \"168\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[0] * 2 for _ in range(k + 1)] for __ in range(n + 1)]\\n for i in range(n-1, -1, -1):\\n for transactions_remaining in range(1, k + 1):\\n for holding in range(2):\\n if holding == 1:\\n # if holding we have 2 cases we sell or do nothing\\n dp[i][transactions_remaining][holding] = (\\n max(prices[i] + dp[i + 1][transactions_remaining - 1][0],\\n dp[i + 1][transactions_remaining][holding]))\\n else:\\n # if not holding we have 2 cases we buy or do nothing\\n dp[i][transactions_remaining][holding] = (\\n max(-prices[i] + dp[i + 1][transactions_remaining][1],\\n dp[i + 1][transactions_remaining][holding]))\\n return dp[0][k][0]\\n \",\n \"runtime\": \"168\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # solve special cases\\n if not prices or k == 0:\\n return 0\\n n = len(prices)\\n\\n if k * 2 >= n:\\n res = 0\\n for i, j in zip(prices[1:], prices[:-1]):\\n res += max(0, i-j)\\n return res\\n\\n # dp[i][used_k][ishold] = balance\\n # ishold: 0 nothold, 1 hold\\n #dp = [[[-math.inf] * 2 for _ in range(k + 1)] for _ in range(n)]\\n dp = [[[-math.inf]*2 for _ in range(k+1)] for _ in range(n)]\\n\\n\\n # set starting value\\n dp[0][0][0] = 0\\n dp[0][1][1] = -prices[0]\\n\\n for i in range(1, n):\\n for j in range(k+1):\\n dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1] + prices[i])\\n if j > 0:\\n dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j-1][0] - prices[i])\\n\\n # fill the array\\n # for i in range(1, n):\\n # for j in range(k + 1):\\n # # transition equation\\n # dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j][1] + prices[i])\\n # # you can't hold stock without any transaction\\n # if j > 0:\\n # dp[i][j][1] = max(\\n # dp[i - 1][j][1], dp[i - 1][j - 1][0] - prices[i]\\n # )\\n\\n res = max(dp[n-1][j][0] for j in range(k+1))\\n # res = max(dp[n - 1][j][0] for j in range(k + 1))\\n return res\",\n \"runtime\": \"172\"\n },\n {\n \"code\": \"class Solution:\\n # DP --> Memoization\\n # Time complexity = O(n*2)\\n # Space complexity = O(n*2) + O(n)\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n def f(idx, buy, cap, dp):\\n if idx == n or cap == 0:\\n return 0\\n if dp[idx][buy][cap] != -1: return dp[idx][buy][cap]\\n if buy:\\n profit = max((-prices[idx] + f(idx+1, 0, cap, dp)), (0 + f(idx+1, 1, cap, dp)))\\n else:\\n profit = max((prices[idx] + f(idx+1, 1, cap-1, dp)), (0 + f(idx+1, 0, cap, dp)))\\n \\n dp[idx][buy][cap] = profit\\n return profit\\n\\n n = len(prices)\\n dp = [[[-1] * (k+1) for i in range(2)] for i in range(n)] \\n return f(0, 1, k, dp)\",\n \"runtime\": \"172\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n if n == 0 :\\n return 0\\n\\n dp = [[[-1 for _ in range(k + 1)] for _ in range(2)] for _ in range(n + 1)]\\n\\n def memoization(ind, buy, cap):\\n if ind == n or cap == 0:\\n return 0\\n\\n if dp[ind][buy][cap] != -1:\\n return dp[ind][buy][cap]\\n \\n profit = 0\\n if buy == 0: # Can buy : max(buy, not buy)\\n profit = max(-prices[ind] + memoization(ind + 1, 1, cap), 0 + memoization(ind + 1, 0, cap))\\n elif buy == 1: # Can sell: max(sell, not sell)\\n profit = max(+prices[ind] + memoization(ind + 1, 0, cap - 1), 0 + memoization(ind + 1, 1, cap))\\n else:\\n return 0\\n dp[ind][buy][cap] = profit\\n\\n return profit\\n\\n return memoization(0, 0, k)\\n\\n # TC: \\n\\n\\n \",\n \"runtime\": \"176\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[0] * 2 for _ in range(k + 1)] for __ in range(n + 1)]\\n\\n for i in range(n - 1, -1, -1):\\n for j in range(k - 1, -1, -1):\\n for holding in range(2):\\n res = dp[i + 1][j][holding]\\n\\n if holding: # sell\\n res = max(res, dp[i + 1][j + 1][0] + prices[i])\\n else: # buy\\n res = max(res, dp[i + 1][j][1] - prices[i])\\n dp[i][j][holding] = res\\n \\n return dp[0][0][0]\\n\\n\\n\\n @lru_cache(None)\\n def dp(day, j, holding):\\n # out of transactions or out of days\\n if j == 0 or day == len(prices):\\n return 0\\n\\n # do nothing\\n res = dp(day + 1, j, holding)\\n\\n if holding:\\n # sell, gain profit from the price today\\n res = max(res, dp(day + 1, j - 1, 0) + prices[day])\\n else:\\n # buy, subtract price of today from profits\\n res = max(res, dp(day + 1, j, 1) - prices[day])\\n return res\\n\\n return dp(0, k, 0)\\n\\\"\\\"\\\"\\ndp(day, j, holding)\\n\\nRR: dp(i, j, holding) = max(doNothing, sell) if holding else max(doNothing, buy)\\n\\\"\\\"\\\"\",\n \"runtime\": \"176\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\n\\nState Variables: we need to keep track of the day and the amount of transactions we can take and the amount of stocks you're holding\\n\\nRecurrence Relation: We can either buy the stock on the ith day or not. If you bought a stock, you must next sell it before buying another.\\n\\n\\n\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[0] * 2 for _ in range(k + 1)] for __ in range(n + 1)]\\n \\n for i in range(n - 1, -1, -1):\\n for trans in range(1, k + 1):\\n for h in range(2):\\n nothing = dp[i + 1][trans][h]\\n something = 0\\n\\n if h:\\n something = prices[i] + dp[i + 1][trans - 1][0]\\n else:\\n something = -prices[i] + dp[i + 1][trans][1]\\n \\n dp[i][trans][h] = max(something, nothing)\\n\\n return dp[0][k][0]\",\n \"runtime\": \"180\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\n\\nState Variables: we need to keep track of the day and the amount of transactions we can take and the amount of stocks you're holding\\n\\nRecurrence Relation: We can either buy the stock on the ith day or not. If you bought a stock, you must next sell it before buying another.\\n\\n\\n\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[0] * 2 for _ in range(k + 1)] for __ in range(n + 1)]\\n \\n for i in range(n - 1, -1, -1):\\n for trans in range(1, k + 1):\\n for h in range(2):\\n nothing = dp[i + 1][trans][h]\\n something = 0\\n if h:\\n something = prices[i] + dp[i + 1][trans - 1][0]\\n else:\\n something = -prices[i] + dp[i + 1][trans][1]\\n \\n dp[i][trans][h] = max(something, nothing)\\n\\n return dp[0][k][0]\",\n \"runtime\": \"180\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [[ -1 for j in range(2*k)] for i in range(len(prices)+1)]\\n\\n def calProfit(i: int, t: int) -> int:\\n if i>len(prices)-1 or t>2*k-1:\\n return 0 \\n\\n if dp[i][t] != -1:\\n return dp[i][t]\\n \\n if t%2==0:\\n dp[i][t] = max((-prices[i] + calProfit(i+1, t+1)), calProfit(i+1,t)) \\n return dp[i][t]\\n else:\\n dp[i][t] = max((prices[i] + calProfit(i+1, t+1)), calProfit(i+1,t))\\n return dp[i][t] \\n\\n return calProfit(0,0) \\n \\n\\n \\n \",\n \"runtime\": \"184\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfitInfiniteK(self, prices):\\n dp = [[0 for _ in range(2)] for _ in range(len(prices))]\\n for i in range(len(prices)):\\n if i == 0:\\n dp[i][0] = 0\\n dp[i][1] = -prices[0]\\n continue\\n dp[i][0] = max(dp[i-1][0], dp[i-1][1] + prices[i])\\n dp[i][1] = max(dp[i-1][1], dp[i-1][0] - prices[i])\\n\\n return dp[-1][0] \\n\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n if k > len(prices)//2:\\n return self.maxProfitInfiniteK(prices)\\n dp = [[[0 for _ in range(2)] for _ in range(k+1)] for _ in range(len(prices))]\\n for i in range(len(prices)):\\n for _k in range(k, 0, -1):\\n if i == 0:\\n dp[i][_k][0] = 0\\n dp[i][_k][1] = -prices[i]\\n continue\\n dp[i][_k][0] = max(dp[i-1][_k][0], dp[i-1][_k][1] + prices[i])\\n dp[i][_k][1] = max(dp[i-1][_k][1], dp[i-1][_k-1][0] - prices[i])\\n return dp[-1][k][0]\\n\\n\",\n \"runtime\": \"184\"\n },\n {\n \"code\": \"class Solution:\\n def f(self, day, buy, cap, prices, n, dp):\\n if cap == 0 or day == n:\\n return 0\\n if dp[day][buy][cap] != -1:\\n return dp[day][buy][cap]\\n if buy == 1:\\n dp[day][buy][cap] = max(-prices[day]+self.f(day+1, 0, cap, prices, n, dp),\\n self.f(day+1, 1, cap, prices, n, dp))\\n return dp[day][buy][cap]\\n\\n dp[day][buy][cap] = max(prices[day]+self.f(day+1, 1, cap-1, prices, n, dp),\\n self.f(day+1, 0, cap, prices, n, dp))\\n return dp[day][buy][cap]\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[-1 for _ in range(k+1)] for _ in range(2)] for _ in range(n)]\\n return self.f(0, 1, k, prices, n, dp)\",\n \"runtime\": \"188\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [[[-inf] * 2 for _ in range(k+1)] for __ in range(len(prices))]\\n for i in range(len(prices)):\\n dp[i][0][0] = 0\\n for j in range(1, k+1):\\n dp[0][j][0] = 0\\n dp[0][j][1] = -prices[0]\\n dp[0][1][1] = -prices[0]\\n for i in range(1, len(prices)):\\n # dp[i][0][0] = 0\\n # dp[i][1][1] = -prices[0]\\n for j in range(1, k+1):\\n # only count the transaction when buy\\n dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1] + prices[i])\\n dp[i][j][1] = max(dp[i-1][j-1][0] - prices[i], dp[i-1][j][1])\\n # if dp[i-1][j][0] != 0 or dp[i-1][j][1] != 0:\\n # dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1] + prices[i])\\n # dp[i][j][1] = max(dp[i-1][j-1][0] - prices[i], dp[i-1][j][1])\\n # else:\\n # break\\n print(dp)\\n ret = 0\\n for j in range(1, k+1):\\n ret = max(ret, dp[-1][j][0])\\n return ret\",\n \"runtime\": \"188\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, kk: int, prices: List[int]) -> int:\\n # daylength = len(prices)\\n\\n # everyday, I can buy, sell, or hold\\n # @cache\\n # def dp(startday, remainK, hasStock):\\n # if startday >= daylength - 1:\\n # if not hasStock:\\n # return 0\\n # else:\\n # return prices[startday]\\n # res = []\\n # best1 = dp(startday + 1, remainK, hasStock)\\n # res.append(best1)\\n # if not hasStock and remainK > 0:\\n # best2 = dp(startday + 1, remainK, True) - prices[startday]\\n # res.append(best2)\\n # if hasStock and remainK > 0:\\n # best3 = dp(startday + 1, remainK - 1, False) + prices[startday]\\n # res.append(best3)\\n # # print(startday, remainK, purchaseDay, res)\\n # return max(res)\\n\\n # return dp(0, k, False)\\n\\n dp = [[[-math.inf, -math.inf] for k in range(kk + 1)] for i in range(len(prices))]\\n for i in range(len(prices)):\\n dp[i][0][0] = 0\\n dp[i][0][1] = -prices[i]\\n for k in range(kk + 1):\\n if k > 0:\\n dp[0][k][0] = 0\\n dp[0][k][1] = -math.inf\\n for i in range(1, len(prices)):\\n for k in range(0, kk + 1):\\n dp[i][k][1] = max(dp[i - 1][k][1], dp[i - 1][k][0] - prices[i])\\n if k > 0:\\n dp[i][k][0] = max(dp[i - 1][k][0], dp[i - 1][k - 1][1] + prices[i])\\n ans = 0\\n print(dp)\\n for k in range(kk + 1):\\n print(ans, dp[-1][k][0])\\n ans = max(dp[-1][k][0], dp[-1][k][1], ans)\\n return ans\\n\",\n \"runtime\": \"192\"\n },\n {\n \"code\": \"# class Solution:\\n# def maxProfit(self, k: int, prices: List[int]) -> int:\\n# n = len(prices)\\n# dp = [[[0, 0] for _ in range(k+1)] for _ in range(n+1)]\\n\\n# for i in reversed(range(n)):\\n# # representing the index of the price\\n# for j in range(1, k + 1):\\n# # representing which transaction it's on\\n# # 0 - not holding a stock, 1 - holding a stock\\n# dp[i][j][0] = max(-prices[i] + dp[i+1][j][1], dp[i+1][j][0])\\n# dp[i][j][1] = max(prices[i] + dp[i+1][j-1][0], dp[i+1][j][1])\\n\\n# print(dp)\\n# return dp[0][k][0]\\n \\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[0, 0] for _ in range(k)] for _ in range(n)]\\n\\n # how much we can earn at last price? We can only sell at last price\\n dp[-1] = [[0, prices[-1]] for _ in range(k)]\\n\\n for i in reversed(range(n-1)):\\n for j in range(k):\\n if j == k - 1:\\n dp[i][j][1] = max(prices[i], dp[i+1][j][1]) # last transaction, cannot sell anymore\\n else:\\n dp[i][j][1] = max(prices[i] + dp[i+1][j+1][0], dp[i+1][j][1])\\n \\n dp[i][j][0] = max(-prices[i] + dp[i+1][j][1], dp[i+1][j][0])\\n\\n\\n print(dp)\\n\\n return dp[0][0][0]\\n\\n#[[[8, 9], [11, 12]], [[8, 9], [11, 12]], [[7, 9], [8, 12]], [[7, 9], [7, 12]], [[7, 9], [7, 9]], [[0, 9], [0, 9]], [[0, 7], [0, 7]]]\\n \",\n \"runtime\": \"192\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [[[-1 for l in range(k+1)] for i in range(2)] for j in range(len(prices))]\\n def maxProfitHelper(arr, i, take, count, dp):\\n if i >= len(prices) or count == 0:\\n return 0\\n if dp[i][take][count] != -1:\\n return dp[i][take][count]\\n taken = 0\\n notTaken = 0\\n if take:\\n taken = -arr[i] + maxProfitHelper(arr, i + 1, 0, count, dp)\\n notTaken = maxProfitHelper(arr, i + 1, 1, count, dp)\\n else:\\n taken = arr[i] + maxProfitHelper(arr, i + 1, 1, count - 1, dp)\\n notTaken = maxProfitHelper(arr, i + 1, 0, count, dp)\\n dp[i][take][count] = max(taken, notTaken)\\n return dp[i][take][count]\\n return maxProfitHelper(prices, 0, 1, k, dp)\\n \\n\\n\",\n \"runtime\": \"196\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n\\n dp = []\\n n = len(prices)\\n\\n for i in range(n+1):\\n dp.append([[-1]*(k+1) for i in range(2)])\\n\\n def solve(index, buy, k):\\n if index==len(prices) or k==0:\\n return 0\\n\\n if dp[index][buy][k]!=-1:\\n return dp[index][buy][k]\\n\\n if buy==1:\\n dp[index][buy][k] = max(-prices[index]+solve(index+1, 0, k), solve(index+1, 1, k))\\n else:\\n dp[index][buy][k] = max(prices[index]+solve(index+1, 1, k-1), solve(index+1, 0, k))\\n\\n return dp[index][buy][k]\\n\\n return solve(0, 1, k)\\n\\n\",\n \"runtime\": \"196\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n\\n dp = []\\n n = len(prices)\\n\\n for i in range(n+1):\\n dp.append([[-1]*(k+1) for i in range(2)])\\n\\n def solve(index, buy, k):\\n if index==len(prices) or k==0:\\n return 0\\n\\n if dp[index][buy][k]!=-1:\\n return dp[index][buy][k]\\n\\n if buy==1:\\n dp[index][buy][k] = max(-prices[index]+solve(index+1, 0, k), solve(index+1, 1, k))\\n else:\\n dp[index][buy][k] = max(prices[index]+solve(index+1, 1, k-1), solve(index+1, 0, k))\\n\\n return dp[index][buy][k]\\n\\n return solve(0, 1, k)\\n\\n\",\n \"runtime\": \"199\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, p: List[int]) -> int:\\n n=len(p)\\n d=[[[-1e9 for x in range(k+1)] for j in range(2)] for i in range(n)]\\n def fun(i,b,r):\\n if i>=n or (r==0):\\n return 0\\n if d[i][b][r]!=-1e9:\\n return d[i][b][r]\\n if (b):\\n d[i][b][r] = max(-p[i]+fun(i+1,0,r),fun(i+1,b,r))\\n return d[i][b][r]\\n else:\\n d[i][b][r] = max(+p[i]+fun(i+1,1,r-1),fun(i+1,b,r))\\n return d[i][b][r]\\n return fun(0,1,k)\",\n \"runtime\": \"199\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [[[-1] * k for _ in range(2)] for _ in range(len(prices))]\\n \\n def help(i, j, x):\\n if i == len(prices): # If all days are processed\\n return 0\\n if x == k: # If the maximum number of transactions is reached\\n return 0\\n if dp[i][j][x] != -1: # If already computed\\n return dp[i][j][x]\\n \\n # Calculate profit based on holding or not holding stock\\n ans = 0\\n if j:\\n ans = -prices[i] + help(i + 1, 1 - j, x)\\n else:\\n ans = prices[i] + help(i + 1, 1 - j, x + 1)\\n \\n # Take the maximum of not making a transaction on the current day\\n ans = max(ans, help(i + 1, j, x))\\n \\n # Store the result in the dp array\\n dp[i][j][x] = ans\\n return ans\\n \\n return help(0, 1, 0)\",\n \"runtime\": \"203\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n N = len(prices)\\n\\n @cache\\n def dp(i, isBuy, t):\\n if i == N:\\n return 0\\n \\n if t == 0:\\n return 0\\n \\n maxProfit = float(\\\"-inf\\\")\\n \\n if isBuy:\\n buyNowProfit = -prices[i] + dp(i + 1, False, t - 1)\\n buyLaterProfit = dp(i + 1, True, t)\\n maxProfit = max(buyNowProfit, buyLaterProfit)\\n else:\\n sellNowProfit = prices[i] + dp(i + 1, True, t - 1)\\n sellLaterProfit = dp(i + 1, False, t)\\n maxProfit = max(sellNowProfit, sellLaterProfit)\\n \\n return maxProfit\\n\\n\\n dp = [[0, 0] for _ in range(1 + 2 * k)]\\n\\n\\n for i in range(N - 1, -1, -1):\\n newDP = [[0, 0] for _ in range(1 + 2 * k)]\\n for t in range(1, 2 * k + 1):\\n for isBuy in [1, 0]:\\n if isBuy:\\n buyNowProfit = -prices[i] + dp[t - 1][0]\\n buyLaterProfit = dp[t][1]\\n maxProfit = max(buyNowProfit, buyLaterProfit)\\n else:\\n sellNowProfit = prices[i] + dp[t - 1][1]\\n sellLaterProfit = dp[t][0]\\n maxProfit = max(sellNowProfit, sellLaterProfit)\\n \\n newDP[t][isBuy] = maxProfit\\n \\n dp = newDP\\n \\n return newDP[2 * k][1]\",\n \"runtime\": \"203\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[-1 for _ in range(k+1)] for _ in range(2)] for _ in range(n)]\\n def f(ind,buy,k):\\n if ind == n or k == 0:\\n return 0\\n \\n if dp[ind][buy][k] != -1:\\n return dp[ind][buy][k]\\n \\n if buy == 0:\\n dp[ind][buy][k] = max(0 + f(ind + 1,buy,k) , -prices[ind] + f(ind + 1,1,k))\\n elif buy == 1:\\n dp[ind][buy][k] = max(0 + f(ind + 1,buy,k) , prices[ind] + f(ind + 1,0,k-1))\\n return dp[ind][buy][k]\\n return f(0,0,k)\",\n \"runtime\": \"207\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n=len(prices)\\n dp=[[[-1]*(k+1) for _ in range(2)]for _ in range(n)]\\n\\n def f(ind,buy,cap):\\n if ind==n or cap==0:\\n return 0\\n if dp[ind][buy][cap]!=-1:\\n return dp[ind][buy][cap]\\n profit=0\\n if buy==0:\\n take=f(ind+1,1,cap)-prices[ind]\\n not_take=0+f(ind+1,0,cap)\\n profit=max(take,not_take)\\n else:\\n take=f(ind+1,0,cap-1)+prices[ind]\\n not_take=0+f(ind+1,1,cap)\\n profit=max(take,not_take)\\n dp[ind][buy][cap]=profit\\n return dp[ind][buy][cap]\\n return f(0,0,k)\\n \\n \",\n \"runtime\": \"207\"\n },\n {\n \"code\": \"class Solution:\\n def solve(self, prices:List[int],i:int,buy:int,k:int,dp):\\n if i>=len(prices):\\n return 0\\n if k==0 :\\n return 0\\n if dp[i][buy][k]!=-1 :\\n return dp[i][buy][k] \\n profit=0\\n if buy :\\n exc = self.solve(prices,i+1,1,k,dp)\\n inc= -prices[i]+ self.solve(prices,i+1,0,k,dp)\\n profit=max(exc,inc)\\n else:\\n exc = self.solve(prices,i+1,0,k,dp)\\n inc= prices[i] + self.solve(prices,i+1,1,k-1,dp)\\n profit=max(exc,inc) \\n dp[i][buy][k]= profit\\n return dp[i][buy][k]\\n \\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [ [[-1 for _ in range(k+1)] for _ in range(3)] for _ in range(len(prices))]\\n return self.solve(prices,0,1,k,dp)\",\n \"runtime\": \"211\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n n = len(prices)\\n dp = [[[0] * 2 for _ in range(k + 1)] for __ in range(n + 1)]\\n \\n # consider dp[i][remain] to store max profit made considering last n-i+1 stocks (inclusive)\\n # and remaining operations left\\n for i in range(n-1, -1, -1):\\n for remain in range(1, k+1): \\n for hold in range(0, 2):\\n if hold == 0: # not holding a stock\\n # 1. do nothing\\n # 2. buy the stock\\n dp[i][remain][hold] = max(\\n dp[i+1][remain][hold],\\n dp[i+1][remain][1] - prices[i],\\n )\\n\\n else: # holding a stock\\n # 1. do nothing\\n # 2. sell the stock\\n dp[i][remain][hold] = max(\\n dp[i+1][remain][hold],\\n dp[i+1][remain-1][0] + prices[i],\\n )\\n \\n print(dp)\\n return dp[0][k][0]\\n\",\n \"runtime\": \"211\"\n },\n {\n \"code\": \"class Solution:\\n def helper(self, txnType, k, prices, index, cache):\\n if index == len(prices) or k == 0:\\n return 0\\n if cache[index][k][txnType] != -1:\\n return cache[index][k][txnType]\\n value = 0\\n\\n if txnType == 0: # current needs to be Buy\\n res1 = self.helper(0, k, prices, index + 1, cache)\\n res2 = self.helper(1, k, prices, index + 1, cache) - prices[index]\\n value = max(res1, res2)\\n else:\\n res1 = self.helper(1, k, prices, index + 1, cache)\\n res2 = prices[index] + self.helper(0, k - 1, prices, index + 1, cache)\\n value = max(res1, res2)\\n cache[index][k][txnType] = value\\n return value\\n \\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n cache = [[[-1, -1] for i in range(k + 1)] for j in range(n)]\\n value = self.helper(0, k, prices, 0, cache)\\n return value\\n \",\n \"runtime\": \"215\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp=[[[-1 for _ in range(k+1)] for _ in range(2)]for _ in range(len(prices))]\\n def func(ind,buy,k,prices: List[int],dp):\\n if ind==len(prices) or k==0:\\n return 0\\n if dp[ind][buy][k]!= -1: return dp[ind][buy][k]\\n if buy:\\n dp[ind][buy][k]=max(-prices[ind]+func(ind+1,0,k,prices,dp),func(ind+1,1,k,prices,dp))\\n else:\\n dp[ind][buy][k]=max(prices[ind]+func(ind+1,1,k-1,prices,dp),func(ind+1,0,k,prices,dp))\\n return dp[ind][buy][k]\\n return func(0,1,k,prices,dp)\\n \",\n \"runtime\": \"215\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n=len(prices)\\n memo=[[[-1 for _ in range(k)] for _ in range(2)] for _ in range(n)]\\n def dp(i,buy,tl):\\n if tl==k or i==n:\\n return 0\\n if memo[i][buy][tl]!=-1:\\n return memo[i][buy][tl]\\n memo[i][buy][tl]=dp(i+1,buy,tl)\\n if buy==0:\\n memo[i][buy][tl]=max(memo[i][buy][tl],dp(i+1,1,tl)-prices[i])\\n if buy==1:\\n memo[i][buy][tl]=max(memo[i][buy][tl],dp(i+1,0,tl+1)+prices[i])\\n return memo[i][buy][tl]\\n return dp(0,0,0)\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n @cache\\n def recur(bought, i, k):\\n if k == 0 or i == len(prices):\\n return 0\\n result = recur(bought, i + 1, k) # Don't buy anything new, or sell held stock\\n if bought:\\n result = max(result, prices[i] + recur(False, i + 1, k - 1)) # Sell at this price\\n else:\\n result = max(result, recur(True, i + 1, k) - prices[i]) # Buy at this price\\n return result\\n \\n return recur(False, 0, k)\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp1 = [[[-1 for m in range(k)] for j in range(2)] for i in range(len(prices))] \\n return max(self.dp(prices, 0, False, dp1, 0, k), 0)\\n \\n def dp(self, prices, index, bought,dp1, trans, k):\\n if(index == len(prices) or trans == k):\\n return 0\\n\\n if(dp1[index][bought][trans] != -1):\\n return dp1[index][bought][trans]\\n take = 0\\n notTake = 0\\n if(not bought):\\n take = self.dp(prices, index+1, True, dp1, trans, k) - prices[index]\\n notTake = self.dp(prices, index + 1, False, dp1, trans, k)\\n else:\\n take = self.dp(prices, index + 1, False, dp1, trans + 1, k) + prices[index]\\n notTake = self.dp(prices, index + 1, bought, dp1, trans, k)\\n dp1[index][bought][trans] = max(take, notTake)\\n return max(take, notTake)\",\n \"runtime\": \"223\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n profit = 0\\n dp = [[[0 for _ in range(k+1)] for _ in range(len(prices)+1)] for _ in range(2)]\\n\\n return self.recur(True, 0, k, prices, dp)\\n\\n def recur(self, canBuy, ind, k, prices, dp):\\n if k == 0 or ind == len(prices):\\n return 0\\n\\n if dp[canBuy][ind][k] != 0:\\n return dp[canBuy][ind][k]\\n\\n if canBuy:\\n dp[canBuy][ind][k] = max(-prices[ind] + self.recur(not canBuy, ind+1, k, prices, dp), self.recur(canBuy, ind+1, k, prices, dp))\\n\\n else:\\n dp[canBuy][ind][k] = max(prices[ind] + self.recur(not canBuy, ind+1, k-1, prices, dp), self.recur(canBuy, ind+1, k, prices, dp))\\n\\n return dp[canBuy][ind][k]\",\n \"runtime\": \"223\"\n },\n {\n \"code\": \"class Solution:\\n def helper(self,ind,buy,pri,k,dp):\\n if ind == len(pri) or k == 0:\\n return 0\\n\\n if dp[ind][k][buy] != -1:\\n return dp[ind][k][buy] \\n \\n profit = 0\\n if buy:\\n profit = max(self.helper(ind+1,1,pri,k,dp),-pri[ind] + self.helper(ind+1,0,pri,k,dp)) \\n else:\\n profit = max(self.helper(ind+1,0,pri,k,dp), pri[ind] + self.helper(ind+1,1,pri,k-1,dp)) \\n dp[ind][k][buy] = profit \\n return dp[ind][k][buy] \\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[-1]*(2) for _ in range(k+1)] for _ in range(n)]\\n return self.helper(0,1,prices,k,dp)\\n \",\n \"runtime\": \"227\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n @cache\\n def dfs(i, k, can_buy):\\n if k <= 0:\\n return 0\\n if i >= n:\\n return 0\\n\\n res = 0\\n if can_buy:\\n res = max(dfs(i + 1, k, False) - prices[i], dfs(i + 1, k, True))\\n else:\\n res = max(dfs(i + 1, k - 1, True) + prices[i], dfs(i + 1, k, False))\\n return res\\n \\n return dfs(0, k, True)\",\n \"runtime\": \"227\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n @lru_cache(None)\\n def dp(i, transactionsRem, holding):\\n if i == n or transactionsRem == 0:\\n return 0\\n\\n if holding == 1:\\n # if holding we have 2 cases we sell or do nothing\\n return max(prices[i] + dp(i+1, transactionsRem-1, 0), dp(i+1, transactionsRem, holding))\\n else:\\n # if not holding we have 2 cases we buy or do nothing\\n return max(-prices[i] + dp(i+1, transactionsRem, 1), dp(i+1, transactionsRem, holding))\\n return dp(0, k, 0)\\n \",\n \"runtime\": \"231\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n @cache\\n def solve(i, holding, remaining):\\n if (i == n) or (remaining == 0):\\n return 0\\n \\n\\n if holding:\\n return max(solve(i+1, holding, remaining), \\n prices[i] + solve(i+1, False, remaining - 1))\\n else:\\n return max(solve(i+1, False, remaining), \\n -prices[i] + solve(i+1, True, remaining))\\n \\n return solve(0, False, k)\",\n \"runtime\": \"231\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n @cache\\n def dfs(i,j,hold):\\n if j < 0:\\n return -inf\\n if i < 0:\\n return -inf if hold else 0\\n if hold:\\n return max(dfs(i-1,j,True),dfs(i-1,j,False)-prices[i])\\n return max(dfs(i-1,j,False),dfs(i-1,j-1,True)+prices[i])\\n return dfs(n-1,k,False)\\n \",\n \"runtime\": \"234\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n n = len(prices)\\n\\n @cache\\n def h(i, k, holding):\\n\\n if i >= n:\\n return 0\\n \\n res = h(i + 1, k, holding)\\n\\n if holding:\\n res = max(res, h(i + 1, k - 1, False) + prices[i])\\n elif k > 0:\\n res = max(res, -prices[i] + h(i + 1, k, True))\\n \\n return res\\n \\n return h(0, k, False)\",\n \"runtime\": \"234\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n @cache\\n def helper( buy , remaining_k , index ):\\n\\n if index >= len(prices):\\n return 0\\n if remaining_k == 0:\\n return 0\\n \\n # do something\\n if buy:\\n ans = -prices[index] + helper( not buy , remaining_k, index + 1 )\\n else:\\n ans = prices[index] + helper( not buy , remaining_k - 1 , index + 1 )\\n # do nothing\\n ans = max(ans, \\n helper( buy , remaining_k , index + 1 )\\n )\\n return ans\\n \\n return helper( True , k , 0 )\",\n \"runtime\": \"238\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n @cache \\n def dfs(i, have, transactionCnt):\\n if transactionCnt == k or i == len(prices):\\n return 0 \\n\\n if have:\\n return max(dfs(i + 1, have, transactionCnt), prices[i] + dfs(i + 1, False, transactionCnt + 1))\\n return max(dfs(i + 1, have, transactionCnt), -prices[i] + dfs(i + 1, True, transactionCnt))\\n return dfs(0, False, 0)\",\n \"runtime\": \"238\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n @cache\\n def dp(i, hasStock, remaining):\\n if (i == len(prices)):\\n return 0\\n if (remaining == 0):\\n return 0\\n \\n choice1 = choice2 = choice3 = 0\\n if (not hasStock):\\n # no stock, buy\\n choice1 = dp(i + 1, True, remaining - 1) - prices[i]\\n else:\\n # has stock, sell\\n choice2 = dp(i + 1, False, remaining - 1) + prices[i]\\n \\n # no sell no buy\\n choice3 = dp(i + 1, hasStock, remaining)\\n\\n ans = max(choice1, choice2, choice3)\\n return ans\\n \\n return dp(0, False, k * 2)\\n\\n\\n \\n \",\n \"runtime\": \"246\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n @lru_cache(None)\\n def dp(day, j, holding):\\n # out of transactions or out of days\\n if j == 0 or day == len(prices):\\n return 0\\n\\n # do nothing\\n res = dp(day + 1, j, holding)\\n\\n if holding:\\n # sell, gain profit from the price today\\n res = max(res, dp(day + 1, j - 1, 0) + prices[day])\\n else:\\n # buy, subtract price of today from profits\\n res = max(res, dp(day + 1, j, 1) - prices[day])\\n return res\\n\\n return dp(0, k, 0)\\n\\\"\\\"\\\"\\ndp(day, j, holding)\\n\\nRR: dp(i, j, holding) = max(doNothing, sell) if holding else max(doNothing, buy)\\n\\\"\\\"\\\"\",\n \"runtime\": \"246\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n @cache\\n def solve(i, buy, k):\\n if i == n:\\n return 0\\n if k == 0:\\n return 0\\n if buy:\\n return max(0 + solve(i + 1, buy, k), -prices[i] + solve(i + 1, buy^1, k))\\n else:\\n return max(0 + solve(i + 1, buy, k), prices[i] + solve(i + 1, buy^1, k - 1))\\n return solve(0, 1, k)\",\n \"runtime\": \"250\"\n },\n {\n \"code\": \"import functools\\nfrom typing import List\\n\\n\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n\\n @functools.cache\\n def helper(index, buy, k):\\n if index == len(prices):\\n return 0\\n\\n if k <= 0:\\n return 0\\n\\n if buy:\\n return max(\\n helper(index + 1, buy, k),\\n -prices[index] + helper(index + 1, not buy, k)\\n )\\n else:\\n return max(\\n helper(index + 1, buy, k),\\n prices[index] + helper(index + 1, not buy, k - 1)\\n )\\n\\n return helper(0, True, k)\\n\",\n \"runtime\": \"250\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n memo = {}\\n def backtrack(i, buy, cap):\\n\\n\\n if cap <= 0:\\n return 0\\n\\n if i >= n:\\n return 0\\n\\n if (i, buy, cap) in memo:\\n return memo[(i, buy, cap)]\\n profit = 0\\n if buy:\\n profit = max(-prices[i] + backtrack(i + 1, 0, cap), backtrack(i + 1, 1, cap))\\n else:\\n profit = max(prices[i] + backtrack(i+1, 1, cap - 1), backtrack(i + 1, 0, cap))\\n memo[(i, buy, cap)] = profit\\n return profit\\n return backtrack(0, 1, k)\",\n \"runtime\": \"254\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n @cache\\n def dp(i, is_held, transactions):\\n if i >= n:\\n return 0\\n if transactions >= k:\\n return 0\\n \\n price = dp(i + 1, is_held, transactions)\\n if is_held:\\n price = max(price, prices[i] + dp(i + 1, False, transactions + 1))\\n else:\\n price = max(price, -prices[i] + dp(i + 1, True, transactions))\\n \\n return price\\n \\n n = len(prices)\\n return dp(0, False, 0)\\n\",\n \"runtime\": \"254\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n\\n # int p = -1 ## index of stock we bought, or -1 if we haven't bought any\\n\\n n = len(prices)\\n from functools import cache\\n # @cache\\n # def dp(i, k, p):\\n # if k == 0: ## check if we still have buying opportunities\\n # return 0\\n # if i == n-1: ## check if it's last day\\n # if p == -1: return 0\\n # if p > -1: return prices[i]-prices[p]\\n\\n # if p == -1:\\n # return max (dp(i+1, k, p), dp(i+1, k, i))\\n # if p > -1:\\n # return max (dp(i+1, k, p), dp(i+1, k-1, -1) + prices[i]-prices[p])\\n\\n # return dp(0, k, -1)\\n @cache\\n def dp(i, k, p):\\n if k == 0: ## check if we still have buying opportunities\\n return 0\\n if i == n-1: ## check if it's last day\\n if p == 0: return 0\\n else: return prices[i]\\n if p == 0: \\n return max(dp(i+1, k, p), dp(i+1, k, 1) - prices[i])\\n if p == 1:\\n return max(dp(i+1, k, p), dp(i+1, k-1, 0) + prices[i])\\n\\n return dp(0, k, 0)\\n \\n \",\n \"runtime\": \"258\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[-1]*2 for i in range(k+1)]for i in range(n)]\\n def solve(dp , i, buy, number, prices):\\n if number==0:\\n return 0\\n \\n if i>len(prices)-1:\\n return 0\\n \\n if dp[i][number][buy]!=-1:\\n return dp[i][number][buy]\\n\\n \\n if buy:\\n profit = max(-prices[i]+solve(dp, i+1,0,number,prices ), solve(dp, i+1, 1, number, prices))\\n else:\\n profit = max(prices[i]+solve(dp, i+1, 1, number-1, prices), solve(dp, i+1, 0, number, prices))\\n \\n dp[i][number][buy]=profit\\n return dp[i][number][buy]\\n \\n return solve(dp, 0, 1, k, prices)\",\n \"runtime\": \"258\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n @cache\\n def dp(i, is_held, transactions):\\n if i >= n or transactions >= k:\\n return 0\\n \\n price = dp(i + 1, is_held, transactions)\\n if is_held:\\n price = max(price, prices[i] + dp(i + 1, False, transactions + 1))\\n else:\\n price = max(price, -prices[i] + dp(i + 1, True, transactions))\\n \\n return price\\n \\n n = len(prices)\\n return dp(0, False, 0)\\n\",\n \"runtime\": \"262\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n @cache\\n def dfs(i, hold, k):\\n if k < 0 : return -float(\\\"inf\\\")\\n if i < 0 :\\n return 0 if hold==False else -float(\\\"inf\\\")\\n if hold == True:\\n return max(dfs(i-1, True, k), dfs(i-1, False, k-1) - prices[i])\\n else:\\n return max(dfs(i-1, False, k), dfs(i-1, True, k) + prices[i])\\n\\n n = len(prices)\\n return dfs(n-1, False, k)\",\n \"runtime\": \"262\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n\\n @cache\\n def dfs(i, j, hold):\\n \\\"\\\"\\\"\\n i: day \\n j: number of transactions\\n hold: current state machine, hold or not hold\\n \\\"\\\"\\\"\\n\\n # edge case: invalid number of transaction number\\n if j < 0:\\n return -inf\\n\\n # base case\\n if i < 0:\\n return -inf if hold else 0\\n\\n if hold:\\n # if from hold state, no transaction number increase\\n # if from non-hold state, we will increase by one transaction number\\n return max(dfs(i-1, j, True), dfs(i-1, j-1, False)-prices[i])\\n\\n # non hold state tranfer choices: i-1,j hold, i-1,j non-hold\\n else:\\n return max(dfs(i-1, j, True)+prices[i], dfs(i-1, j, False))\\n\\n return dfs(len(prices)-1, k, hold=False)\\n\\n\\n \",\n \"runtime\": \"266\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n\\n def solve(ar,n,idx,buy,cnt,mapp):\\n\\n if(idx == n or cnt == k):\\n return 0\\n\\n key = (idx,buy,cnt)\\n if(key in mapp):\\n return mapp[key]\\n \\n profit = 0\\n if(buy):\\n profit = max(solve(ar,n,idx+1,False,cnt,mapp) - ar[idx],\\n solve(ar,n,idx+1,True,cnt,mapp))\\n else:\\n profit = max(solve(ar,n,idx+1,True,cnt+1,mapp)+ar[idx],\\n solve(ar,n,idx+1,False,cnt,mapp))\\n \\n mapp[key] = profit\\n return mapp[key]\\n \\n return solve(prices,len(prices),0,True,0,{})\\n \",\n \"runtime\": \"266\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n @cache\\n def dp(i, is_held, transactions):\\n if i >= n:\\n return 0\\n if transactions >= k:\\n return 0\\n \\n price = dp(i + 1, is_held, transactions)\\n if is_held:\\n price = max(price, prices[i] + dp(i + 1, False, transactions + 1))\\n else:\\n price = max(price, -prices[i] + dp(i + 1, True, transactions))\\n \\n return price\\n \\n n = len(prices)\\n return dp(0, False, 0)\\n\",\n \"runtime\": \"269\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k, prices, i=0, can_buy=True, cache=None):\\n # build cache with key (i, can_buy, k)\\n if cache is None:\\n cache = dict()\\n # exit at boundary conditions\\n if k == 0 or i == len(prices):\\n return 0\\n # define current key\\n key = (i, can_buy, k)\\n # compute max profits recursively\\n if key not in cache:\\n if can_buy:\\n cache[key] = max(\\n # buy at index i\\n self.maxProfit(k, prices, i + 1, False, cache) - prices[i],\\n # don't buy at index i\\n self.maxProfit(k, prices, i + 1, True, cache)\\n )\\n else:\\n cache[key] = max(\\n # sell at index i\\n prices[i] + self.maxProfit(k - 1, prices, i + 1, True, cache),\\n # don't sell at index i\\n self.maxProfit(k, prices, i + 1, False, cache)\\n )\\n return cache[key]\\n\\n\",\n \"runtime\": \"269\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n @cache\\n def recurse(pos, r, hold):\\n #Base case: hitting the end of the array\\n if pos == len(prices) or r == 0:\\n return 0 \\n \\n\\n if hold == True:\\n #option to sell or not\\n return max(recurse(pos+1, r-1, False) + prices[pos], recurse(pos+1, r, True))\\n else:\\n #option to buy or not\\n return max(recurse(pos+1, r, True) - prices[pos], recurse(pos+1, r, False))\\n\\n \\n # if sols[pos][r][hold] \\n\\n return recurse(0, k, False)\",\n \"runtime\": \"273\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n dp = {}\\n\\n def profit(i, count):\\n if i >= n: return 0\\n \\n if count > k * 2: return 0\\n \\n key = (i, count)\\n\\n if key in dp: return dp[key]\\n \\n res = 0\\n \\n if count % 2 == 0:\\n res = max(\\n -prices[i] + profit(i + 1, count + 1), # buying the stock on ith day\\n 0 + profit(i + 1, count) # not buying/holding on ith day\\n # buying and selling stock on same day is 0 profit so no need to include it\\n )\\n else:\\n res = max(\\n prices[i] + profit(i + 1, count + 1), # selling the stock on ith day\\n 0 + profit(i + 1, count), # not selling/holding the stock on ith day\\n # prices[i] + profit(i, not buy, count + 1) # selling the stock and buying stock \\n # on same day(ith day) i dont think its needed here\\n )\\n \\n dp[key] = res\\n return res\\n\\n \\n\\n return profit(0, 0)\\n\\n # dp = [[[0 for i in range(k + 1)] for j in range(2)] for i in range(n + 1)]\\n\\n\\n # for i in range(n - 1, -1, -1):\\n # for buy in range(2):\\n # for count in range(k + 1):\\n # if buy:\\n # dp[i][buy][count] = max(\\n # -prices[i] + (0 if count + 1 > k else dp[i + 1][0][count + 1]),\\n # 0 + dp[i + 1][1][count]\\n # )\\n # else:\\n # dp[i][buy][count] = max(\\n # prices[i] + dp[i + 1][1][count], \\n # 0 + dp[i + 1][0][count]\\n # )\\n \\n # return dp[0][1][0]\\n \",\n \"runtime\": \"273\"\n },\n {\n \"code\": \"class Solution:\\n def getMaxProfit(self, index: int, holding_stock: bool, txn_count: int, prices: List[int], cache: Dict, k: int) -> int:\\n # since we reached end of array\\n if index == len(prices):\\n return 0\\n\\n elif (index, holding_stock, txn_count) in cache:\\n return cache[(index, holding_stock, txn_count)]\\n \\n max_profit = 0\\n\\n if holding_stock:\\n # do not sell the stock currently we are holding\\n case_1 = self.getMaxProfit(index + 1, holding_stock, txn_count, prices, cache, k)\\n\\n # else I sell that stock\\n if txn_count < k - 1:\\n case_2 = prices[index] + self.getMaxProfit(index + 1, False, txn_count + 1, prices, cache, k)\\n\\n # means we have performed 2 transactions now so do not call functions again\\n elif txn_count == k - 1:\\n case_2 = prices[index]\\n\\n max_profit = max(case_1, case_2)\\n cache[(index, holding_stock, txn_count)] = max_profit\\n\\n else:\\n # do not buy the current stock and move ahead\\n case_1 = self.getMaxProfit(index + 1, holding_stock, txn_count, prices, cache, k)\\n \\n # else we buy the stock\\n case_2 = self.getMaxProfit(index + 1, True, txn_count, prices, cache, k) - prices[index]\\n\\n max_profit = max(case_1, case_2)\\n cache[(index, holding_stock, txn_count)] = max_profit\\n\\n return max_profit\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n cache = dict()\\n return self.getMaxProfit(0, False, 0, prices, cache, k)\",\n \"runtime\": \"277\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n @cache\\n def solve(i, buy, k):\\n if i == n:\\n return 0\\n if k == 0:\\n return 0\\n if buy:\\n return max(0 + solve(i + 1, buy, k), -prices[i] + solve(i + 1, buy^1, k))\\n else:\\n return max(0 + solve(i + 1, buy, k), prices[i] + solve(i + 1, buy^1, k - 1))\\n return solve(0, 1, k)\\n curr = [[0 for _ in range(k)] for i in range(2)]\\n after = [[0 for _ in range(k)] for i in range(2)]\\n for i in range(n - 1, -1, -1):\\n for buy in range(2):\\n for cap in range(1, 3):\\n if buy:\\n curr[buy][cap] = max(after[1][cap], -prices[i] + after[0][cap])\\n else:\\n curr[buy][cap] = max(after[0][cap], prices[i] + after[1][cap - 1])\\n after = curr\\n return after[1][2]\",\n \"runtime\": \"277\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\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(i, transactions_remaining, holding):\\n\\n\\n\\n # Base case\\n if transactions_remaining == 0 or i == len(prices): \\n return 0\\n \\n do_nothing = dp(i + 1, transactions_remaining, holding)\\n do_something = 0\\n\\n if holding:\\n # Sell stock\\n do_something = prices[i] + dp(i + 1, transactions_remaining - 1, 0)\\n else:\\n # Buy stock\\n do_something = -prices[i] + dp(i + 1, transactions_remaining, 1)\\n\\n # Recurrence relation\\n return max(do_nothing, do_something)\\n\\n return dp(0, k, 0)\",\n \"runtime\": \"281\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp={}\\n def f(ind,canBuy,prices,dp,NT):\\n if ind >=len(prices):\\n return 0\\n\\n if (ind,canBuy, NT) in dp:\\n return dp[(ind,canBuy,NT)]\\n profit = 0\\n if canBuy==1 and NT > 0:\\n buy=f(ind+1,0,prices,dp , NT) - prices[ind]\\n notBuy= 0+ f(ind+1,1,prices,dp , NT) \\n profit=max(buy,notBuy)\\n\\n elif NT > 0:\\n Sell=prices[ind] + f(ind+1,1,prices,dp , NT - 1)\\n notSell=0+f(ind+1,0,prices,dp , NT) \\n profit=max(Sell,notSell)\\n dp[(ind,canBuy, NT)]=profit \\n\\n return profit\\n return f(0,1,prices,dp , k)\\n\\n\",\n \"runtime\": \"281\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, lim: int, prices: List[int]) -> int:\\n @cache\\n def solve(inx , hold,k):\\n if inx >=len(prices):\\n return 0\\n #dont buy , dont sell\\n a = solve(inx+1,hold,k)\\n\\n #buy\\n b = 0\\n if hold==0 and k<lim:\\n b = -prices[inx] + solve(inx+1,1,k+1)\\n \\n\\n #sell\\n c = 0\\n if hold==1:\\n c = prices[inx]+solve(inx+1,0,k)\\n return max(a,b,c)\\n return solve(0,0,0) \",\n \"runtime\": \"285\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\\"\\\"\\\"\\n sell after you buy\\n make at most k transactions\\n for each idx you can buy if x=0 or sell if x=1 or skip\\n if x==1: max(prices[i]+rec(i+1, k-1), rec(i+1,k))\\n else: \\n \\\"\\\"\\\"\\n n= len(prices)\\n @cache\\n def rec(i, j, x):\\n if i==n: return 0\\n if j==k: return 0\\n res= 0\\n if x==0:\\n take= -prices[i]+ rec(i+1,j,1)\\n not_take= rec(i+1,j,0)\\n res= max(take,not_take)\\n else:\\n take= prices[i]+ rec(i+1,j+1,0)\\n not_take= rec(i+1,j,1)\\n res= max(take,not_take)\\n return res\\n return rec(0,0,0)\\n\\n\\n\\n \",\n \"runtime\": \"285\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n self.k = k\\n self.prices = prices\\n self.len_prices = len(prices)\\n self.memo = {}\\n return self.dp(0, False, 0)\\n \\n def dp(self, n, holding, transactions):\\n if n == self.len_prices or transactions == self.k:\\n return 0\\n \\n if (n, holding, transactions) in self.memo:\\n return self.memo[(n, holding, transactions)]\\n \\n self.memo[(n, holding, transactions)] = max(\\n self.dp(n + 1, holding, transactions), # skip\\n -self.prices[n] + self.dp(n + 1, True, transactions) if holding==False else 0, # buy, if NOT holding\\n self.prices[n] + self.dp(n + 1, False, transactions + 1) if holding==True else 0 # sell, if holding \\n )\\n\\n return self.memo[(n, holding, transactions)]\",\n \"runtime\": \"289\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo = {}\\n\\n def dp(own,i,count):\\n if i >= len(prices) or count > k:\\n return 0\\n\\n \\n state = (own,i,count)\\n\\n if state in memo:\\n return memo[state]\\n \\n\\n if own:\\n include = dp(False, i+1,count) + prices[i]\\n exclude = dp(True,i+1,count)\\n memo[state] = max(include,exclude)\\n else:\\n include = dp(True,i+1,count+1) - prices[i]\\n exclude = dp(False,i+1,count)\\n memo[state] = max(include,exclude)\\n return memo[state]\\n\\n return dp(False,0,0)\\n\\n\",\n \"runtime\": \"289\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = {}\\n def dfs(buy,i,k):\\n if len(prices)==i or k==0:\\n return 0\\n\\n if (buy,i,k) in dp:\\n return dp[(buy,i,k)]\\n\\n res = dfs(buy,i+1,k)\\n if buy:\\n res = max(res,prices[i]+dfs(False,i+1,k-1))\\n else:\\n res = max(res,-prices[i]+dfs(True,i+1,k))\\n\\n dp[(buy,i,k)] = res\\n return res\\n\\n return dfs(False,0,k)\",\n \"runtime\": \"293\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo = {}\\n return self.fm(prices, k, 0, False, memo)\\n \\n def fm(self, prices, k, i, holding, memo):\\n if k == 0 or i ==len(prices): return 0\\n if (i,k,holding) in memo:\\n return memo[(i,k,holding)]\\n do_nothing = self.fm(prices,k, i+1, holding, memo)\\n do_something = 0\\n if holding:\\n do_something = prices[i] + self.fm(prices, k-1, i+1, False, memo)\\n else:\\n do_something = -prices[i] + self.fm(prices, k, i+1, True, memo)\\n mp = max(do_nothing, do_something)\\n memo[(i,k,holding)] = mp\\n return mp\",\n \"runtime\": \"293\"\n },\n {\n \"code\": \"class Solution:\\n def getMaxProfit(self, index: int, holding_stock: int, txn_count: int, prices: List[int], cache: Dict, k: int) -> int:\\n # since we reached end of array\\n if index == len(prices):\\n return 0\\n\\n elif (index, holding_stock, txn_count) in cache:\\n return cache[(index, holding_stock, txn_count)]\\n \\n max_profit = 0\\n\\n if holding_stock == 1:\\n # do not sell the stock currently we are holding\\n case_1 = self.getMaxProfit(index + 1, holding_stock, txn_count, prices, cache, k)\\n\\n # else I sell that stock\\n if txn_count < k - 1:\\n case_2 = prices[index] + self.getMaxProfit(index + 1, 0, txn_count + 1, prices, cache, k)\\n\\n # means we have performed 2 transactions now so do not call functions again\\n elif txn_count == k - 1:\\n case_2 = prices[index]\\n\\n max_profit = max(case_1, case_2)\\n cache[(index, holding_stock, txn_count)] = max_profit\\n\\n else:\\n # do not buy the current stock and move ahead\\n case_1 = self.getMaxProfit(index + 1, holding_stock, txn_count, prices, cache, k)\\n \\n # else we buy the stock\\n case_2 = self.getMaxProfit(index + 1, 1, txn_count, prices, cache, k) - prices[index]\\n\\n max_profit = max(case_1, case_2)\\n cache[(index, holding_stock, txn_count)] = max_profit\\n\\n return max_profit\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n cache = dict()\\n return self.getMaxProfit(0, 0, 0, prices, cache, k)\",\n \"runtime\": \"297\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n memo: Dict[Tuple[int, int, int], int] = {}\\n\\n def dfs(i: int, buying: bool, transactions: int) -> int:\\n # Base cases\\n if i == n or transactions >= k:\\n return 0\\n\\n if (i, buying, transactions) in memo:\\n return memo[(i, buying, transactions)]\\n \\n if buying:\\n # Two choices when buying: actually buy or cooldown\\n buy = dfs(i + 1, False, transactions) - prices[i]\\n cooldown = dfs(i + 1, buying, transactions)\\n memo[(i, buying, transactions)] = max(buy, cooldown)\\n \\n else:\\n # Two choices when selling: actually sell or cooldown\\n sell = dfs(i + 1, True, transactions + 1) + prices[i]\\n cooldown = dfs(i + 1, buying, transactions)\\n memo[(i, buying, transactions)] = max(sell, cooldown)\\n \\n return memo[(i, buying, transactions)]\\n \\n # Start the recursion from day 0 in buying state with 0 transactions\\n return dfs(0, buying=True, transactions=0)\\n\",\n \"runtime\": \"297\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = {}\\n def solve(i,buy,transactions):\\n if (i,buy,transactions) in dp:\\n return dp[(i,buy,transactions)]\\n profit = 0\\n if i == n or transactions == k:\\n return 0\\n if buy:\\n profit = max(-prices[i]+solve(i+1,0,transactions),solve(i+1,1,transactions))\\n else:\\n profit = max(prices[i]+solve(i+1,1,transactions+1),solve(i+1,0,transactions))\\n dp[(i,buy,transactions)] = profit\\n return profit\\n return solve(0,1,0)\\n \",\n \"runtime\": \"301\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.dp = []\\n\\n def f(self, v, i, k, on):\\n if i >= len(v):\\n return 0\\n if self.dp[i][k][1 if on else 0] != -1:\\n return self.dp[i][k][1 if on else 0]\\n\\n profit = 0\\n profit = max(profit, self.f(v, i + 1, k, on))\\n if on:\\n profit = max(profit, v[i] + self.f(v, i + 1, k - 1, False))\\n elif k > 0:\\n profit = max(profit, self.f(v, i + 1, k, True) - v[i])\\n\\n self.dp[i][k][1 if on else 0] = profit\\n return profit\\n\\n def maxProfit(self, k, prices):\\n self.dp = [[[-1 for _ in range(2)] for _ in range(k + 1)] for _ in range(len(prices))]\\n return self.f(prices, 0, k, False)\\n\",\n \"runtime\": \"301\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = {}\\n\\n def dfs(i, t, buying):\\n if t < 0:\\n return 0\\n if i == len(prices):\\n return 0\\n if (i, t, buying) in dp:\\n return dp[(i, t, buying)]\\n \\n cd = dfs(i + 1, t, buying)\\n if not buying:\\n sell = dfs(i + 1, t, True) + prices[i]\\n dp[(i, t, buying)] = max(cd, sell)\\n else:\\n buy = dfs(i + 1, t - 1, False) - prices[i]\\n dp[(i, t, buying)] = max(cd, buy)\\n return dp[(i, t, buying)]\\n return dfs(0, k, True)\",\n \"runtime\": \"304\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n mem = {} # key: (i, trans, buying), value: max_profit\\n \\n def dfs(trans, i, buying):\\n if trans == k:\\n return 0\\n if i == len(prices):\\n return 0\\n if (i, trans, buying) in mem:\\n return mem[(i, trans, buying)]\\n \\n hold = dfs(trans, i+1, buying)\\n if buying:\\n buy = dfs(trans, i+1, not buying) - prices[i]\\n max_profit = max(buy, hold)\\n else:\\n sell = dfs(trans+1, i+1, not buying) + prices[i]\\n max_profit = max(sell, hold)\\n \\n mem[(i, trans, buying)] = max_profit\\n return max_profit\\n \\n\\n return dfs(0, 0, True)\",\n \"runtime\": \"304\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = {} # dp(i, transactionsLeft, bool) is the max profit we can achieve with the remaining \\n \\n def dfs(i, transactionsLeft, buying):\\n if i == n:\\n return 0\\n if transactionsLeft == 0:\\n return 0\\n if (i, transactionsLeft, buying) in dp:\\n return dp[(i, transactionsLeft, buying)]\\n \\n # at each index, we buy or sell depending on buying\\n # or we skip \\n skip = dfs(i+1, transactionsLeft, buying)\\n if buying: # not holding stock, we buy\\n buy = dfs(i+1, transactionsLeft, not buying) - prices[i]\\n dp[(i, transactionsLeft, buying)] = max(skip, buy)\\n else: # sell the stock we hold \\n # decrement transactionsLeft when we sell\\n sell = dfs(i+1, transactionsLeft-1, not buying) + prices[i]\\n dp[(i, transactionsLeft, buying)] = max(skip, sell)\\n return dp[(i, transactionsLeft, buying)]\\n \\n return dfs(0, k, True)\\n \",\n \"runtime\": \"308\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # bottom up\\n\\n # dp = [ for _ in range(1+1) for _ in range(len(prices)+1)]\\n dp = {}\\n # recursion top down memoization\\n def solve(index, buy, limit):\\n if index == len(prices):\\n return 0\\n if limit==0:\\n return 0\\n if (index, buy, limit) in dp:\\n return dp[(index, buy, limit)]\\n \\n if buy:\\n buykaro = -prices[index] + solve(index +1, 0, limit)\\n skipkaro = 0 + solve(index +1,1, limit)\\n profit = max(buykaro, skipkaro)\\n else:\\n sellkaro = prices[index] + solve(index +1, 1, limit-1)\\n skip = 0 + solve(index +1, 0, limit)\\n profit = max(sellkaro,skip)\\n dp[(index,buy,limit)] = profit\\n return profit\\n return solve(0,1,k)\\n\\n\\n \\n \\n \",\n \"runtime\": \"308\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # memoization\\n cache = {}\\n def dfs(ind, canBuy, k):\\n # base case\\n if ind == len(prices) or k == 0:\\n return 0\\n # check if (ind, canBuy, k) present in cache\\n if (ind, canBuy, k) in cache: return cache[(ind, canBuy, k)]\\n # buy case\\n if canBuy:\\n profit = max(-prices[ind] + dfs(ind+1, 0, k), dfs(ind+1, 1, k))\\n else:\\n profit = max(prices[ind] + dfs(ind+1, 1, k-1), dfs(ind+1, 0, k))\\n cache[(ind, canBuy, k)] = profit\\n return cache[(ind, canBuy, k)]\\n return dfs(0, 1, k)\",\n \"runtime\": \"312\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n def maxPurchase():\\n profit = 0\\n prev = prices[0]\\n for p in prices:\\n profit += max(0, p - prev)\\n prev = p\\n return profit\\n\\n if k >= len(prices) / 2:\\n return maxPurchase()\\n \\n dp = {}\\n def dfs(i, hasShare, txs):\\n if i >= len(prices):\\n return 0\\n \\n if txs == k and not hasShare:\\n return 0\\n \\n key = (i, hasShare, txs)\\n if key in dp:\\n return dp[key]\\n \\n res = dfs(i+1, hasShare, txs)\\n if hasShare:\\n sell = prices[i] + dfs(i+1, False, txs + 1)\\n res = max(res, sell)\\n else:\\n buy = -prices[i] + dfs(i+1, True, txs)\\n res = max(res, buy)\\n \\n dp[key] = res\\n return res\\n \\n return dfs(0, False, 0)\\n\\n\",\n \"runtime\": \"312\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[-1 for i in range(2)] for j in range(k+1)] for m in range(n)]\\n\\n def stock(ind, transactions, bought):\\n if ind == n:\\n return 0\\n \\n if dp[ind][transactions][bought] != -1:\\n return dp[ind][transactions][bought]\\n \\n # if I have already bought a stock\\n if bought == 1:\\n # I can either sell it\\n sell = prices[ind] + stock(ind+1, transactions, 0)\\n # or keep it\\n not_sell = stock(ind+1, transactions, 1)\\n dp[ind][transactions][bought] = max(sell, not_sell)\\n\\n # if I dont have a stock in hand\\n else:\\n buy = float('-inf')\\n # I can either buy a stock if I haven't done k transactions\\n if transactions < k:\\n buy = -prices[ind] + stock(ind+1, transactions+1, 1)\\n # or not buy a stock\\n not_buy = stock(ind+1, transactions, 0)\\n dp[ind][transactions][bought] = max(buy, not_buy)\\n \\n return dp[ind][transactions][bought]\\n \\n return stock(0, 0, 0)\\n \",\n \"runtime\": \"316\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # backtracking with memorization\\n # if we buy at i, we should go i+1, and change the status\\n # if we sell at i we should go i+1, and change the status\\n # if we do nothing, we should go i+1, and don't change the status\\n\\n dp = {}\\n def backtrack(i,flag,c):\\n if i>=len(prices) or c>k:\\n return 0\\n \\n if (i,flag,c) in dp:\\n return dp[(i,flag,c)]\\n \\n # do nothing\\n p = backtrack(i+1,flag,c)\\n # buy\\n if flag:\\n p = max(p,backtrack(i+1,not flag,c+1)-prices[i])\\n # sell\\n else:\\n p = max(p,backtrack(i+1,not flag,c)+prices[i])\\n \\n \\n dp[(i,flag,c)] = p\\n return p\\n return backtrack(0,True,0)\\n\\n # n = len(prices)\\n # # dp[i][j] max profit at day j when completing at most i transactions\\n # dp = [[0] * n for _ in range(k+1)]\\n # for i in range(1, k+1):\\n # # max profit with a stock at hand\\n # profit = -prices[0]\\n # for j in range(1, n):\\n # # max profit when sell at day j\\n # dp[i][j] = max(dp[i][j-1], profit + prices[j])\\n\\n # # max profit when buy at day j\\n # profit = max(profit, dp[i-1][j-1] - prices[j])\\n # return dp[-1][-1]\",\n \"runtime\": \"316\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # dp = [[[0]*2 for _ in range(k+1)] for _ in range(len(prices))]\\n # for i in range(len(prices)):\\n # for j in range(1, k+1):\\n # if i==0:\\n # dp[i][j][0]=0\\n # dp[i][j][1]=-prices[i]\\n # continue\\n # dp[i][j][0] = max(\\n # dp[i-1][j][0],\\n # dp[i-1][j][1] + prices[i]\\n # )\\n # dp[i][j][1] = max(\\n # dp[i-1][j][1],\\n # dp[i-1][j-1][0] - prices[i]\\n # )\\n # return dp[len(prices)-1][k][0]\\n n=len(prices)\\n self.memo=[[[float('-inf')]*2 for _ in range(k+1)] for _ in range(len(prices))]\\n return self.dp(prices,n-1,k,0)\\n\\n def dp(self,prices, i,j,k):\\n if i==0 and k==0:\\n return 0\\n if i==0 and k==1:\\n return -prices[0]\\n if j==0 and k==0:\\n return 0\\n if j==0 and k==1:\\n return float('-inf')\\n if self.memo[i][j][k]!=float('-inf'):\\n return self.memo[i][j][k]\\n if k==0:\\n res = max(\\n self.dp(prices,i-1,j,0),\\n self.dp(prices,i-1,j,1)+prices[i]\\n ) \\n else:\\n res = max(\\n self.dp(prices, i-1,j,1),\\n self.dp(prices, i-1,j-1,0)-prices[i]\\n )\\n self.memo[i][j][k]=res\\n return res\",\n \"runtime\": \"320\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # dp = [[[0]*2 for _ in range(k+1)] for _ in range(len(prices))]\\n # for i in range(len(prices)):\\n # for j in range(1, k+1):\\n # if i==0:\\n # dp[i][j][0]=0\\n # dp[i][j][1]=-prices[i]\\n # continue\\n # dp[i][j][0] = max(\\n # dp[i-1][j][0],\\n # dp[i-1][j][1] + prices[i]\\n # )\\n # dp[i][j][1] = max(\\n # dp[i-1][j][1],\\n # dp[i-1][j-1][0] - prices[i]\\n # )\\n # return dp[len(prices)-1][k][0]\\n n=len(prices)\\n self.memo=[[[float('-inf')]*2 for _ in range(k+1)] for _ in range(len(prices))]\\n return self.dp(prices,n-1,k,0)\\n\\n def dp(self,prices, i,j,k):\\n if i==0 and k==0:\\n return 0\\n if i==0 and k==1:\\n return -prices[0]\\n if j==0 and k==0:\\n return 0\\n # if j==0 and k==1:\\n # return float('-inf')\\n if self.memo[i][j][k]!=float('-inf'):\\n return self.memo[i][j][k]\\n if k==0:\\n res = max(\\n self.dp(prices,i-1,j,0),\\n self.dp(prices,i-1,j,1)+prices[i]\\n ) \\n else:\\n res = max(\\n self.dp(prices, i-1,j,1),\\n self.dp(prices, i-1,j-1,0)-prices[i]\\n )\\n self.memo[i][j][k]=res\\n return res\",\n \"runtime\": \"320\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = dict()\\n\\n def dfs(i, k_sell, k_buy, can_buy):\\n if i >= len(prices):\\n return 0\\n \\n if can_buy and k_buy == 0:\\n return 0\\n\\n if not can_buy and k_sell == 0:\\n return 0\\n\\n if (i, k_sell, k_buy, can_buy) in dp:\\n return dp[i, k_sell, k_buy, can_buy]\\n\\n stay = dfs(i + 1, k_sell, k_buy, can_buy)\\n\\n if can_buy:\\n bought = dfs(i + 1, k_sell, k_buy - 1, False) - prices[i]\\n dp[(i, k_sell, k_buy, can_buy)] = max(stay, bought)\\n else:\\n sold = dfs(i + 1, k_sell - 1, k_buy, True) + prices[i]\\n dp[(i, k_sell, k_buy, can_buy)] = max(stay, sold)\\n\\n return dp[(i, k_sell, k_buy, can_buy)]\\n\\n return dfs(0, k, k, True)\\n \",\n \"runtime\": \"324\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo = {}\\n def backtrack(i, buy, sell_trans):\\n if i == len(prices) or (sell_trans == 0):\\n return 0\\n if (i, buy, sell_trans) in memo:\\n return memo[(i, buy, sell_trans)]\\n ans = 0\\n if buy and sell_trans > 0:\\n ans = max(ans, backtrack(i + 1, False, sell_trans - 1) + prices[i])\\n ans = max(ans, backtrack(i + 1, True, sell_trans))\\n if not buy:\\n ans = max(ans, backtrack(i + 1, True, sell_trans) - prices[i])\\n ans = max(ans, backtrack(i + 1, False, sell_trans))\\n memo[(i, buy, sell_trans)] = ans\\n return ans\\n return backtrack(0, False, k)\",\n \"runtime\": \"324\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = defaultdict(int)\\n \\n def dfs(idx,stock,trans):\\n if idx>=len(prices):\\n return 0\\n if trans>=k:\\n return 0\\n if (idx,stock,trans) in dp:\\n return dp[(idx,stock,trans)]\\n if stock:\\n buy = -prices[idx] + dfs(idx+1,0,trans) \\n skip = dfs(idx+1,1,trans)\\n dp[(idx,stock,trans)] = max(buy,skip)\\n else:\\n sell = prices[idx] + dfs(idx+1,1,trans+1) \\n skip = dfs(idx+1,0,trans)\\n dp[(idx,stock,trans)] = max(sell,skip)\\n return dp[(idx,stock,trans)]\\n\\n\\n return dfs(0,1,0)\",\n \"runtime\": \"328\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n def func(i,buy,prices,ct,dic):\\n if i>=len(prices) or ct == 0:\\n return 0\\n if(i,buy,ct) in dic:\\n return dic[(i,buy,ct)]\\n x,y,a,b=0,0,0,0\\n if buy:\\n x = -prices[i]+func(i+1,False,prices,ct,dic)\\n y=0+func(i+1,buy,prices,ct,dic)\\n else:\\n a=prices[i]+func(i+1,True,prices,ct-1,dic)\\n b=0+func(i+1,buy,prices,ct,dic)\\n dic[(i,buy,ct)]=max(a,b,x,y)\\n return max(a,b,x,y)\\n return func(0,True,prices,k,{})\",\n \"runtime\": \"328\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = {}\\n\\n def dfs(i, t, buying):\\n if t < 0:\\n return 0\\n if i == len(prices):\\n return 0\\n if (i, t, buying) in dp:\\n return dp[(i, t, buying)]\\n \\n cd = dfs(i + 1, t, buying)\\n if not buying:\\n dp[(i, t, buying)] = max(cd, dfs(i + 1, t, True) + prices[i])\\n else:\\n dp[(i, t, buying)] = max(cd, dfs(i + 1, t - 1, False) - prices[i])\\n return dp[(i, t, buying)]\\n return dfs(0, k, True)\",\n \"runtime\": \"332\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo = {}\\n \\n def dp(i: int, t: int, holding: int) -> int:\\n if t == 0 or i >= len(prices):\\n return 0\\n elif (i, t, holding) in memo:\\n return memo[(i, t, holding)]\\n \\n do_nothing = dp(i+1, t, holding)\\n do_something = 0\\n \\n if holding:\\n do_something = prices[i] + dp(i+1, t-1, 0)\\n else:\\n do_something = -prices[i] + dp(i+1, t, 1)\\n \\n memo[(i, t, holding)] = max(do_nothing, do_something)\\n return memo[(i, t, holding)]\\n \\n \\n return dp(0, k, 0)\",\n \"runtime\": \"332\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = {} # dp[(i, buying, transactions_left)] = val\\n\\n def dfs(i, buying, transactions_left):\\n if i >= len(prices) or transactions_left == 0:\\n return 0\\n if (i, buying, transactions_left) in dp:\\n return dp[(i, buying, transactions_left)]\\n \\n if buying:\\n buy = dfs(i + 1, not buying, transactions_left) - prices[i]\\n cooldown = dfs(i + 1, buying, transactions_left)\\n dp[(i, buying, transactions_left)] = max(buy, cooldown)\\n else:\\n sell = dfs(i + 1, not buying, transactions_left - 1) + prices[i]\\n cooldown = dfs(i + 1, buying, transactions_left)\\n dp[(i, buying, transactions_left)] = max(sell, cooldown)\\n \\n return dp[(i, buying, transactions_left)]\\n \\n return dfs(0, True, k)\",\n \"runtime\": \"336\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo = {}\\n def backtrack(i, buy, sell_trans):\\n if i == len(prices) or (sell_trans == 0):\\n return 0\\n if (i, buy, sell_trans) in memo:\\n return memo[(i, buy, sell_trans)]\\n ans = 0\\n if buy and sell_trans > 0:\\n ans = max(ans, backtrack(i + 1, False, sell_trans - 1) + prices[i])\\n ans = max(ans, backtrack(i + 1, True, sell_trans))\\n if not buy:\\n ans = max(ans, backtrack(i + 1, True, sell_trans) - prices[i])\\n ans = max(ans, backtrack(i + 1, False, sell_trans))\\n memo[(i, buy, sell_trans)] = ans\\n return ans\\n return backtrack(0, False, k)\",\n \"runtime\": \"336\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":156,"string":"156"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [0] * (2 * k + 1)\n for i in range(1, 2 * k + 1, 2):\n dp[i] = -prices[0]\n \n for i in range(1, len(prices)):\n for m in range(1, 2 * k + 1):\n if m % 2 == 1:\n dp[m] = max(dp[m], dp[m - 1] - prices[i])\n else:\n dp[m] = max(dp[m], dp[m - 1] + prices[i])\n \n return dp[2 * k]","memory":"16623"},{"code":"import sys\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n costs = [sys.maxsize] * k\n profits = [0] * k\n for index, price in enumerate(prices):\n costs[0] = min(costs[0], price)\n profits[0] = max(profits[0], price-costs[0])\n for i in range(1, k):\n costs[i] = min(costs[i], price - profits[i-1])\n profits[i] = max(profits[i], price - costs[i])\n return profits[k-1]","memory":"16623"},{"code":"class DoubleLinkListNode:\n def __init__(self, ind, pre = None, next = None):\n self.ind = ind\n self.pre = pre if pre else self\n self.next = next if next else self\n\nclass Solution:\n def MinMaxList(self, arr: List[int]) -> List[int]:\n n = len(arr)\n if n == 0:\n return []\n sign = -1\n res = [9999]\n for num in arr:\n if num * sign > res[-1] * sign:\n res[-1] = num\n else:\n res.append(num)\n sign *= -1\n if len(res) & 1:\n res.pop()\n return res\n def maxProfit(self, k: int, prices: List[int]) -> int:\n newP = self.MinMaxList(prices)\n n = len(newP)\n m = n // 2\n res = 0\n for i in range(m):\n res += newP[i*2+1] - newP[i*2]\n if m <= k:\n return res\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\n NodeList = [DoubleLinkListNode(0, head)]\n for i in range(1, n):\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\n NodeList[i-1].next = NodeList[i]\n NodeList[n-1].next = tail\n head.next, tail.pre = NodeList[0], NodeList[n-1]\n heap = []\n for i in range(n-1):\n if i&1:\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\n else:\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\n while m > k:\n loss, i, j, t = heappop(heap)\n if NodeList[i] == None or NodeList[j] == None: continue\n m -= 1\n res -= loss\n nodei, nodej = NodeList[i], NodeList[j]\n nodel, noder = nodei.pre, nodej.next\n l, r = nodel.ind, noder.ind\n valL, valR = newP[l], newP[r]\n noder.pre, nodel.next = nodel, noder\n NodeList[i], NodeList[j] = None, None\n if t == 0:\n heappush(heap, [valR - valL, l, r, 1])\n elif l != -1 and r != -1:\n heappush(heap, [valL - valR, l, r, 0])\n return res","memory":"17469"},{"code":"class DoubleLinkListNode:\n def __init__(self, ind, pre = None, next = None):\n self.ind = ind\n self.pre = pre if pre else self\n self.next = next if next else self\n\nclass Solution:\n def MinMaxList(self, arr: List[int]) -> List[int]:\n n = len(arr)\n if n == 0:\n return []\n sign = -1\n res = [9999]\n for num in arr:\n if num * sign > res[-1] * sign:\n res[-1] = num\n else:\n res.append(num)\n sign *= -1\n if len(res) & 1:\n res.pop()\n return res\n def maxProfit(self, k: int, prices: List[int]) -> int:\n newP = self.MinMaxList(prices)\n n = len(newP)\n m = n // 2\n res = 0\n for i in range(m):\n res += newP[i*2+1] - newP[i*2]\n if m <= k:\n return res\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\n NodeList = [DoubleLinkListNode(0, head)]\n for i in range(1, n):\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\n NodeList[i-1].next = NodeList[i]\n NodeList[n-1].next = tail\n head.next, tail.pre = NodeList[0], NodeList[n-1]\n heap = []\n for i in range(n-1):\n if i&1:\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\n else:\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\n while m > k:\n loss, i, j, t = heappop(heap)\n if NodeList[i] == None or NodeList[j] == None: continue\n m -= 1\n res -= loss\n nodei, nodej = NodeList[i], NodeList[j]\n nodel, noder = nodei.pre, nodej.next\n l, r = nodel.ind, noder.ind\n valL, valR = newP[l], newP[r]\n noder.pre, nodel.next = nodel, noder\n NodeList[i], NodeList[j] = None, None\n if t == 0:\n heappush(heap, [valR - valL, l, r, 1])\n elif l != -1 and r != -1:\n heappush(heap, [valL - valR, l, r, 0])\n return res","memory":"17469"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # dp[i][k1]: the max balances on the END of i-th day with at most (k1+1) transactions.\n # dp[i][k1] = max(dp[i - 1][k1], dp[j - 1][k1 - 1] + prices[i] - prices[j] for j in range(i))\n # Reference: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/solutions/306282/different-dp-python-solutions-with-thinking-process\n n = len(prices)\n if n < 2: return 0\n dp = [[0] * (k + 1) for _ in range(n)]\n for k1 in range(1, k + 1):\n local_max = -prices[0]\n for i in range(1, n):\n dp[i][k1] = max(dp[i - 1][k1], prices[i] + local_max)\n local_max = max(local_max, dp[i - 1][k1 - 1] - prices[i])\n return dp[-1][-1]\n ","memory":"18315"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n cache = [[0 for _ in range(k + 1)] for _ in range(n)]\n for i in range(n):\n for j in range(1, k + 1):\n cache[i][j] = max(cache[i - 1][j], max([0] + [cache[l][j - 1] - prices[l] + prices[i] for l in range(i)]))\n # print(i, j, cache)\n return cache[-1][-1]","memory":"18315"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices) \n tbl = [[0]*n for i in range(2*k)]\n for i in range(2*k):\n for j in range(i,n):\n if i==0:\n if j==0:\n tbl[i][j] = -prices[j]\n else:\n tbl[i][j] = max(tbl[i][j-1], -prices[j])\n else:\n if j==i:\n sign = 2*(i%2)-1\n tbl[i][j] = sign*prices[j] + tbl[i-1][j-1]\n else:\n tbl[i][j] = max(tbl[i][j-1], sign*prices[j] + tbl[i-1][j-1])\n ans = 0\n for i in range(2*k):\n ans = max(ans, tbl[i][-1])\n return ans","memory":"19161"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n prices_len = len(prices)\n states = 2*k + 1\n dp = [[float('-inf')] * (states) for _ in range(prices_len)]\n maxProfit = 0\n\n for i in range(prices_len):\n dp[i][0] = 0\n for i in range(prices_len):\n num = prices[i]\n for j in range(states-1, 0, -1): \n #can_buy state\n if not j % 2:\n dp[i][j] = max(dp[i-1][j], dp[i-1][j-1] + num)\n maxProfit = max(maxProfit, dp[i][j])\n # holding state\n else:\n dp[i][j] = max(dp[i-1][j], dp[i-1][j-1] - num)\n\n return maxProfit\n","memory":"19161"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n '''\n memo = [ [ [-1] * (k+1) for _ in range(2) ] for _ in range(n) ]\n def memoization(idx, canBuy, transaction):\n # base cases\n if idx == n or transaction == 0:\n return 0\n if memo[idx][canBuy][transaction] != -1:\n return memo[idx][canBuy][transaction]\n\n # main working\n if canBuy:\n profit = max(memoization(idx+1, 1, transaction), \n -prices[idx] + memoization(idx+1, 0, transaction))\n else:\n profit = max( memoization(idx+1, 0, transaction), \n prices[idx] + memoization(idx+1, 1, transaction-1) )\n \n memo[idx][canBuy][transaction] = profit\n return memo[idx][canBuy][transaction]\n \n # trying memoization\n return memoization(0,1,k)\n '''\n\n\n\n def tabulation():\n dp = [ [ [0] * (k+1) for _ in range(2) ] for __ in range(n+1) ]\n \n # base case 1 - no transactions left (ie: 0) - not req as initialized with 0 alr\n # base case 2 - idx reaches len(prices) (ie: n) - not req as initialized with 0 alr\n\n # filling the table\n for idx in range(n-1, -1, -1):\n for canBuy in range(2):\n for transaction in range(1, k+1):\n if canBuy == 1:\n dp[idx][1][transaction] = max(dp[idx+1][1][transaction], \n -prices[idx] + dp[idx+1][0][transaction])\n else:\n dp[idx][0][transaction] = max(dp[idx+1][0][transaction], \n prices[idx] + dp[idx+1][1][transaction-1])\n return dp[0][1][k]\n \n # trying tabulation\n return tabulation()","memory":"20008"},{"code":"class Solution:\n def maxProfitUtil(self,index,buy,cap,prices,dp):\n if cap==0:\n return 0\n\n if index == len(prices):\n return 0\n\n if dp[index][buy][cap] != -1:\n return dp[index][buy][cap]\n\n profit = 0\n if buy==0: #BUY THE STOCK\n profit = max(self.maxProfitUtil(index+1,0,cap,prices,dp),\n self.maxProfitUtil(index+1,1,cap,prices,dp)-prices[index])\n else: #SELL THE STOCK\n profit = max(self.maxProfitUtil(index+1,1,cap,prices,dp),\n self.maxProfitUtil(index+1,0,cap-1,prices,dp)+prices[index])\n\n dp[index][buy][cap] = profit\n return dp[index][buy][cap]\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [[[-1]*(k+1) for _ in range(2)] for _ in range(len(prices))]\n return self.maxProfitUtil(0,0,k,prices,dp)","memory":"20008"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # profit[k][m] - k times sell + bought k + 1 position, m position, best profit \n profit = []\n m = len(prices)\n curr_prof = 0\n \n \n for i in range(k+1):\n profit.append([0] * m)\n result = 0\n \n for i in range(k+1):\n for j in range(0, m):\n if j == 0:\n curr_prof = 0\n profit[i][j] = -prices[j]\n elif i == 0:\n profit[i][j] = max(-prices[j], profit[i][j-1])\n else:\n curr_prof = max(curr_prof, profit[i-1][j] + prices[j])\n profit[i][j] = max(curr_prof - prices[j], profit[i][j-1])\n \n result = max(result, curr_prof)\n # result = max(result, profit[i][j] + prices[j])\n print(profit)\n return result","memory":"20854"},{"code":"from heapq import heappush, heappop\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # attempt 1: see notes and problem 123. sell/buy stock III. attempt 3\n \n n = len(prices)\n k = min(k,n//2)\n # *2 becase is transaction have 2 actions buy then sell. \n #+1 to account for 0 trans row make algorithm smoother\n m = 2*k+1 \n\n # setting up row 0 => 0 transaction and column 0 => first day based values\n t = [ [-prices[0] if i%2 else 0]*n for i in range(m) ] \n\n buy_sell = -1 # -1 buy, 1 sell\n for i in range(1,m):\n for d in range(1,n):\n no_action = t[i][d-1]\n action = t[i-1][d-1] +buy_sell*prices[d]# dig = max profit at the end of the previous half trans\n t[i][d] = max(action,no_action)\n buy_sell*=-1\n \n return t[-1][-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 ","memory":"20854"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n def helper(ind,transaction,prices,n,k):\n if ind ==n or transaction==2*k:\n return 0\n if dp[ind][transaction]!=-1:\n return dp[ind][transaction]\n profit=0\n if transaction%2==0:\n profit=max(-prices[ind]+helper(ind+1,transaction+1,prices,n,k),\n helper(ind+1,transaction,prices,n,k))\n else:\n profit=max(prices[ind]+helper(ind+1,transaction+1,prices,n,k),\n helper(ind+1,transaction,prices,n,k))\n dp[ind][transaction]=profit\n return profit\n \n n=len(prices)\n # dp=[[-1 for j in range(2*k)]for i in range(n)]\n # return helper(0,0,prices,n,k)\n dp=[[0 for j in range(2*k+1)]for i in range(n+1)]\n \n for ind in range(n-1,-1,-1):\n for transaction in range(2*k-1,-1,-1):\n profit=0\n if transaction%2==0:\n profit=max(-prices[ind]+dp[ind+1][transaction+1],\n dp[ind+1][transaction])\n else:\n profit=max(prices[ind]+dp[ind+1][transaction+1],\n dp[ind+1][transaction])\n dp[ind][transaction]=profit\n return dp[0][0]\n\n\n\n ","memory":"23393"},{"code":"# profit[k][0][i] = profit[k-1][1][[i-1]+price[i], profit[k][0][i-1]\n# profit[i][k][1] = -price[i]+profit[i-1][k][0], profit[i-1][k][1]\n# profit[i][0][0] = 0\n# profit[i][0][1] = -inf\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n profit = [[[-inf]*(n+1) for _ in range(k+1)] for __ in range(2)]\n for i in range(n+1):\n profit[0][0][i] = 0\n\n print (profit)\n ans = 0\n for ki in range(k+1):\n for i in range(1, len(prices)+1):\n profit[0][ki][i] = max(profit[1][ki-1][i-1]+prices[i-1], profit[0][ki][i-1])\n profit[1][ki][i] = max(-prices[i-1]+profit[0][ki][i-1], profit[1][ki][i-1])\n ans = max(ans, profit[0][ki][i], profit[1][ki][i])\n return ans\n ","memory":"23393"},{"code":"class Solution:\n def trade(self, k, prices, index, buy, dp):\n if k == 0 or index == len(prices):\n return 0\n\n if dp[index][buy][k] != -1:\n return dp[index][buy][k] \n \n profit = 0\n\n if buy:\n profit = max( 0 + self.trade(k, prices, index + 1, buy, dp), \n -prices[index] + self.trade(k, prices, index + 1, not buy, dp))\n\n else:\n profit = max( 0 + self.trade(k, prices, index + 1, buy, dp), \n prices[index] + self.trade(k - 1, prices, index + 1, not buy, dp))\n\n dp[index][buy][k] = profit\n return dp[index][buy][k]\n \n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [[[-1 for _ in range(k+1)] for _ in range(2)] for _ in range(len(prices))]\n\n return self.trade(k, prices, 0, True, dp)\n","memory":"24239"},{"code":"class Solution:\n def calculate_profit(self, ind, tranNo, n, prices, dp):\n if ind == n or tranNo == 2 * self.k:\n return 0\n \n if dp[ind][tranNo] != -1:\n return dp[ind][tranNo]\n \n if tranNo % 2 == 0:\n profit = max(\n -prices[ind] + self.calculate_profit(ind + 1, tranNo + 1, n, prices, dp),\n 0 + self.calculate_profit(ind + 1, tranNo, n, prices, dp)\n )\n else:\n profit = max(\n prices[ind] + self.calculate_profit(ind + 1, tranNo + 1, n, prices, dp),\n 0 + self.calculate_profit(ind + 1, tranNo, n, prices, dp)\n )\n \n dp[ind][tranNo] = profit\n\n return dp[ind][tranNo] \n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n self.k = k\n dp = [[ -1 for _ in range(2 * k)] for _ in range(n)]\n return self.calculate_profit(0, 0, n, prices, dp)\n","memory":"24239"},{"code":"class Solution:\n def maxProfit(self, k, prices):\n days = len(prices)\n if k >= days // 2:\n return sum(max(prices[i + 1] - prices[i], 0) for i in range(days - 1))\n\n dp = [days*[0] for _ in range(days)]\n\n for i in range(1, k + 1):\n max_diff = -prices[0]\n for j in range(1, days):\n dp[i][j] = max(dp[i][j - 1], prices[j] + max_diff)\n max_diff = max(max_diff, dp[i - 1][j] - prices[j])\n\n return dp[k][-1]\n ","memory":"25085"},{"code":"def maxProfit(k, prices):\n days = len(prices)\n if k >= days // 2:\n return sum(max(prices[i + 1] - prices[i], 0) for i in range(days - 1))\n\n dp = [days*[0] for _ in range(days)]\n\n for i in range(1, k + 1):\n max_diff = -prices[0]\n for j in range(1, days):\n dp[i][j] = max(dp[i][j - 1], prices[j] + max_diff)\n max_diff = max(max_diff, dp[i - 1][j] - prices[j])\n\n return dp[k][-1]\n\nwith open('user.out', 'w') as f:\n c = None\n for case in map(loads, stdin):\n if c:\n f.write(f\"{maxProfit(c, case)}\\n\")\n c = None\n else:\n c = case\nexit(0)\n\n \n ","memory":"25085"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n s = [[-float('inf')]*n for i in range(4*k)]\n s[0][0] = 0\n s[1][0] = -prices[0]\n s[2][0] = -float('inf')\n s[3][0] = -float('inf')\n for i in range(1, n):\n for j in range(k):\n if j > 0:\n s[4*j][i] = max(s[4*j-1][i-1], s[4*j][i-1])\n s[4*j+1][i] = max(s[4*j][i-1], s[4*j-1][i-1])-prices[i]\n else:\n s[4*j][i] = s[4*j][i-1]\n s[4*j+1][i] = s[4*j][i-1]-prices[i]\n s[4*j+2][i] = max(s[4*j+1][i-1], s[4*j+2][i-1])\n s[4*j+3][i] = max(s[4*j+1][i-1], s[4*j+2][i-1])+prices[i]\n max_profit = 0\n for i in range(4*k):\n for j in range(n):\n max_profit = max(max_profit, s[i][j])\n return max_profit","memory":"25931"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n=len(prices)\n dp=[[[0]*(2*k+1) for i in range(2)] for i in range(n+1)]\n for x in range(n-1,-1,-1):\n for y in range(1,-1,-1):\n for z in range(2*k,-1,-1):\n profit=0\n if y and z:\n profit=max(profit,-prices[x]+dp[x+1][0][z-1],dp[x+1][1][z])\n elif not y and z:\n profit=max(profit,+prices[x]+dp[x+1][1][z-1],dp[x+1][0][z])\n dp[x][y][z]=profit\n return dp[0][1][2*k]","memory":"25931"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[0]*2 for _ in range(k+1)] for _ in range(n+1)]\n \n for i in range(n-1,-1,-1):\n for rem_transactions in range(1,k+1):\n for holding in range(2):\n do_nothing = dp[i+1][rem_transactions][holding]\n \n if holding:\n do_something = prices[i] + dp[i+1][rem_transactions-1][0]\n else:\n do_something = -prices[i] + dp[i+1][rem_transactions][1]\n \n dp[i][rem_transactions][holding] = max(do_nothing,do_something)\n \n return dp[0][k][0]\n \n ","memory":"26778"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n if not prices:\n return 0\n n = len(prices)\n if k > n/2:\n k = n//2\n dp = [[[0]*2 for _ in range(k+1)] for _ in range(n)]\n for i in range(n):\n dp[i][0][0] = 0\n dp[i][0][1] = -float('inf')\n for j in range(1, k+1):\n if i - 1 < 0:\n dp[i][j][0] = 0\n dp[i][j][1] = -prices[i]\n else:\n dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1]+prices[i])\n dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j-1][0]-prices[i])\n return dp[-1][-1][0]","memory":"26778"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[-1]*k for _ in range(2)] for _ in range(n)]\n\n def findProfit(i,buy,tra):\n if i>=n or tra>=k:\n return 0\n if dp[i][buy][tra]!=-1:\n return dp[i][buy][tra]\n if buy:\n dp[i][buy][tra] = max(-prices[i]+findProfit(i+1,0,tra) , 0+findProfit(i+1,1,tra))\n return dp[i][buy][tra]\n else:\n dp[i][buy][tra] = max(prices[i]+findProfit(i+1,1,tra+1), 0+findProfit(i+1,0,tra))\n return dp[i][buy][tra]\n return findProfit(0,1,0)\n ","memory":"27624"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [[-float('inf') for _ in range(2*k+1)] for _ in range(len(prices)+1)]\n for r in range(len(prices)+1):\n dp[r][0]=0\n \n for i in range(1,len(prices)+1):\n for j in range(1,2*k +1):\n if j%2==0:\n dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]+prices[i-1])\n else:\n dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]-prices[i-1])\n print(dp)\n return max(dp[-1])\n\n \n ","memory":"27624"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[0] * 2 for _ in range(k + 1)] for __ in range(n + 1)]\n for i in range(n-1, -1, -1):\n for transactions_remaining in range(1, k + 1):\n for holding in range(2):\n if holding == 1:\n # if holding we have 2 cases we sell or do nothing\n dp[i][transactions_remaining][holding] = (\n max(prices[i] + dp[i + 1][transactions_remaining - 1][0],\n dp[i + 1][transactions_remaining][holding]))\n else:\n # if not holding we have 2 cases we buy or do nothing\n dp[i][transactions_remaining][holding] = (\n max(-prices[i] + dp[i + 1][transactions_remaining][1],\n dp[i + 1][transactions_remaining][holding]))\n return dp[0][k][0]\n ","memory":"28470"},{"code":"\"\"\"\n\nState Variables: we need to keep track of the day and the amount of transactions we can take and the amount of stocks you're holding\n\nRecurrence Relation: We can either buy the stock on the ith day or not. If you bought a stock, you must next sell it before buying another.\n\n\n\n\"\"\"\n\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[0] * 2 for _ in range(k + 1)] for __ in range(n + 1)]\n \n for i in range(n - 1, -1, -1):\n for trans in range(1, k + 1):\n for h in range(2):\n nothing = dp[i + 1][trans][h]\n something = 0\n if h:\n something = prices[i] + dp[i + 1][trans - 1][0]\n else:\n something = -prices[i] + dp[i + 1][trans][1]\n \n dp[i][trans][h] = max(something, nothing)\n\n return dp[0][k][0]","memory":"28470"},{"code":"\nclass Solution:\n def __init__(self):\n self.cache = {}\n self.used = 0\n def maxProfit(self, k: int, prices):\n if k == 0:\n return 0\n if len(prices) <= 1:\n return 0\n key = str(k) + \",\" + str(len(prices))\n if key in self.cache:\n self.used += 1\n return self.cache[key]\n\n max_profit = 0\n\n for i in range(1):\n # max_gain = 0\n # j = i+1\n # higher_found = False\n # idx =-1\n # while j < len(prices):\n # if not higher_found and prices[j] - prices[i] > max_gain:\n # max_gain = prices[j]-prices[i]\n # idx = j\n # higher_found = True\n #\n # elif higher_found:\n # if prices[j] < prices[j-1]:\n # profits.append(prices[j-1]-prices[i] + self.maxProfit(min(k-1, len(prices[j:])//2), prices[j:]))\n # higher_found = False\n # idx = -1\n # j-=1\n # else:\n # max_gain= prices[j]-prices[i]\n # idx = j\n # j += 1\n # if idx != -1:\n # profits.append(prices[idx] - prices[i] + self.maxProfit(min(k - 1, len(prices[idx + 1:]) // 2), prices[idx + 1:]))\n max_profit = self.maxProfit(min(k, len(prices[i+1:])//2), prices[i+1:])\n max_gain = 0\n for j in range(i+1, len(prices)):\n if (prices[j] - prices[i]) > max_gain: #and (prices[j]-prices[i] + self.maxProfit(min(29,len(prices[j+1:])//2),prices[j+1:]))> max_profit:\n max_gain = prices[j] - prices[i]\n val = max_gain + self.maxProfit(min(k-1, len(prices[j+1:])//2), prices[j+1:])\n if val > max_profit:\n max_profit = val\n self.cache[key] = max_profit\n return max_profit","memory":"29316"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [[[-1 for _ in range(k+1)] for _ in range(2)] for _ in range(len(prices))]\n\n def solve(i: int, buy: int, limit: int) -> int:\n if i == len(prices):\n return 0\n\n if limit == 0:\n return 0\n\n if dp[i][buy][limit] != -1:\n return dp[i][buy][limit]\n\n profit = 0\n if buy: # buy is allowed\n p1 = -1 * prices[i] + solve(i+1, 0, limit) # buy\n p2 = 0 + solve(i+1, 1, limit) # didnt buy\n profit = max(p1, p2)\n\n else: # buy is not allowed\n p1 = prices[i] + solve(i+1, 1, limit-1) # sell\n p2 = 0 + solve(i+1, 0, limit) # didnt sell\n profit = max(p1, p2)\n\n dp[i][buy][limit] = profit\n return profit\n\n def solveTab() -> int:\n dp = [[[0 for _ in range(k+1)] for _ in range(2)] for _ in range(len(prices)+1)]\n\n for i in range(len(prices)-1, -1, -1):\n for j in range(2):\n for x in range(1, k+1):\n profit = 0\n if j: # buy is allowed\n p1 = -1 * prices[i] + dp[i+1][0][x] # buy\n p2 = 0 + dp[i+1][1][x] # didnt buy\n profit = max(p1, p2)\n\n else: # buy is not allowed\n p1 = prices[i] + dp[i+1][1][x-1] # sell\n p2 = 0 + dp[i+1][0][x] # didnt sell\n profit = max(p1, p2)\n\n dp[i][j][x] = profit\n\n return dp[0][1][k]\n\n\n #return solve(0, 1, k)\n return solveTab()","memory":"29316"},{"code":"class Solution:\n def maxProfit(self, kk: int, prices: List[int]) -> int:\n # daylength = len(prices)\n\n # everyday, I can buy, sell, or hold\n # @cache\n # def dp(startday, remainK, hasStock):\n # if startday >= daylength - 1:\n # if not hasStock:\n # return 0\n # else:\n # return prices[startday]\n # res = []\n # best1 = dp(startday + 1, remainK, hasStock)\n # res.append(best1)\n # if not hasStock and remainK > 0:\n # best2 = dp(startday + 1, remainK, True) - prices[startday]\n # res.append(best2)\n # if hasStock and remainK > 0:\n # best3 = dp(startday + 1, remainK - 1, False) + prices[startday]\n # res.append(best3)\n # # print(startday, remainK, purchaseDay, res)\n # return max(res)\n\n # return dp(0, k, False)\n\n dp = [[[0, 0] for k in range(kk + 1)] for i in range(len(prices))]\n for i in range(len(prices)):\n dp[i][0][0] = 0\n dp[i][0][1] = -prices[i]\n for k in range(kk + 1):\n if k > 0:\n dp[0][k][0] = 0\n dp[0][k][1] = -prices[0] # -math.inf\n for i in range(1, len(prices)):\n for k in range(0, kk + 1):\n dp[i][k][1] = max(dp[i - 1][k][1], dp[i - 1][k][0] - prices[i])\n if k > 0:\n dp[i][k][0] = max(dp[i - 1][k][0], dp[i - 1][k - 1][1] + prices[i])\n ans = 0\n print(dp)\n for k in range(kk + 1):\n print(ans, dp[-1][k][0])\n ans = max(dp[-1][k][0], dp[-1][k][1], ans)\n return ans\n","memory":"30163"},{"code":"class Solution:\n def maxProfit(self, kk: int, prices: List[int]) -> int:\n # daylength = len(prices)\n\n # everyday, I can buy, sell, or hold\n # @cache\n # def dp(startday, remainK, hasStock):\n # if startday >= daylength - 1:\n # if not hasStock:\n # return 0\n # else:\n # return prices[startday]\n # res = []\n # best1 = dp(startday + 1, remainK, hasStock)\n # res.append(best1)\n # if not hasStock and remainK > 0:\n # best2 = dp(startday + 1, remainK, True) - prices[startday]\n # res.append(best2)\n # if hasStock and remainK > 0:\n # best3 = dp(startday + 1, remainK - 1, False) + prices[startday]\n # res.append(best3)\n # # print(startday, remainK, purchaseDay, res)\n # return max(res)\n\n # return dp(0, k, False)\n\n dp = [[[0, 0] for k in range(kk + 1)] for i in range(len(prices))]\n for i in range(len(prices)):\n dp[i][0][0] = 0\n dp[i][0][1] = -prices[i]\n for k in range(kk + 1):\n if k > 0:\n dp[0][k][0] = 0\n dp[0][k][1] = -math.inf\n for i in range(1, len(prices)):\n for k in range(0, kk + 1):\n dp[i][k][1] = max(dp[i - 1][k][1], dp[i - 1][k][0] - prices[i])\n if k > 0:\n dp[i][k][0] = max(dp[i - 1][k][0], dp[i - 1][k - 1][1] + prices[i])\n ans = 0\n print(dp)\n for k in range(kk + 1):\n print(ans, dp[-1][k][0])\n ans = max(dp[-1][k][0], dp[-1][k][1], ans)\n return ans\n","memory":"30163"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [[[-1 for _ in range(2)] for _ in range(k+1)] for _ in range(len(prices))]\n\n def helper(idx, bought, transactions):\n if idx >= len(prices) or transactions >= k:\n return 0\n \n if dp[idx][transactions][int(bought)] != -1:\n return dp[idx][transactions][int(bought)]\n \n skipAction = helper(idx + 1, bought, transactions)\n if bought:\n takeAction = prices[idx] + helper(idx + 1, False, transactions + 1)\n else:\n takeAction = helper(idx + 1, True, transactions) - prices[idx]\n \n dp[idx][transactions][int(bought)] = max(skipAction, takeAction)\n return dp[idx][transactions][int(bought)]\n \n return helper(0, False, 0)","memory":"31009"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[-1 for i in range(2)] for j in range(k+1)] for m in range(n)]\n\n def stock(ind, transactions, bought):\n if ind == n:\n return 0\n \n if dp[ind][transactions][bought] != -1:\n return dp[ind][transactions][bought]\n \n # if I have already bought a stock\n if bought:\n # I can either sell it\n sell = prices[ind] + stock(ind+1, transactions, False)\n # or keep it\n not_sell = stock(ind+1, transactions, True)\n dp[ind][transactions][bought] = max(sell, not_sell)\n\n # if I dont have a stock in hand\n else:\n buy = float('-inf')\n # I can either buy a stock if I haven't done k transactions\n if transactions < k:\n buy = -prices[ind] + stock(ind+1, transactions+1, True)\n # or not buy a stock\n not_buy = stock(ind+1, transactions, False)\n dp[ind][transactions][bought] = max(buy, not_buy)\n \n return dp[ind][transactions][bought]\n \n return stock(0, 0, False)\n ","memory":"31009"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [[[float('-inf'), float('-inf')] for _ in range(k+1)] for _ in range(len(prices)+1)]\n for i in range(len(prices)+1):\n for j in range(k+1):\n if i==0:\n dp[i][j][0]=0\n elif j ==0:\n dp[i][j][0]=0\n else:\n dp[i][j][0] = max(dp[i-1][j][1]+prices[i-1], dp[i-1][j][0])\n dp[i][j][1] = max(dp[i-1][j-1][0]-prices[i-1], dp[i-1][j][1])\n #print(dp)\n return dp[-1][-1][0]\n\n\n# class Solution:\n# def maxProfit(self, k: int, prices: List[int]) -> int:\n# dp = [[[float('-inf'), float('-inf')] for _ in range(k+1)] for _ in range(len(prices)+1)]\n# for i in range(len(prices)+1):\n# for j in range(k+1):\n# if i==0:\n# dp[i][j][0]=0\n# elif j==0:\n# dp[i][j][0]=0\n# else:\n# dp[i][j][0] = max(dp[i-1][j][1]+prices[i-1], dp[i-1][j][0])\n# dp[i][j][1] = max(dp[i-1][j-1][0]-prices[i-1], dp[i-1][j][1])\n# return dp[len(prices)][k][0]","memory":"31855"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n\n # @cache\n # def dfs(i, j, hold):\n # \"\"\"\n # i: day \n # j: number of transactions\n # hold: current state machine, hold or not hold\n # \"\"\"\n\n # # edge case: invalid number of transaction number\n # if j < 0:\n # return -inf\n\n # # base case\n # if i < 0:\n # return -inf if hold else 0\n\n # if hold:\n # # if from hold state, no transaction number increase\n # # if from non-hold state, we will increase by one transaction number\n # return max(dfs(i-1, j, True), dfs(i-1, j-1, False)-prices[i])\n\n # # non hold state tranfer choices: i-1,j hold, i-1,j non-hold\n # else:\n # return max(dfs(i-1, j, True)+prices[i], dfs(i-1, j, False))\n\n # return dfs(len(prices)-1, k, hold=False)\n\n N = len(prices)\n dp = [[[-inf, -inf] for _ in range(k+2)] for _ in range(N+1)]\n\n # # edge case\n # dp[0][1][0] = 0 # d=-1, j=0, state=0\n # dp[0][1][1] = -inf # d=-1, j=0, state=1\n\n\n\n # edge case: invalid j (transaction time)\n for j in range(1, k+2): # [1, K+1]\n dp[0][j][0] = 0\n\n\n for i, price in enumerate(prices):\n for j in range(1, k+2):\n # can go from j=0 to j=1\n # but cannot go from j=-1 to j=1\n # since we are using array\n # we define j=0 as invalid\n dp[i+1][j][0] = max(dp[i][j][0], dp[i][j-1][1] + price)\n dp[i+1][j][1] = max(dp[i][j][0] - price, dp[i][j][1])\n\n return dp[N][k+1][0]\n\n\n ","memory":"31855"},{"code":"# class Solution:\n# def maxProfit(self, k: int, prices: List[int]) -> int:\n# n = len(prices)\n# dp = [[[0, 0] for _ in range(k+1)] for _ in range(n+1)]\n\n# for i in reversed(range(n)):\n# # representing the index of the price\n# for j in range(1, k + 1):\n# # representing which transaction it's on\n# # 0 - not holding a stock, 1 - holding a stock\n# dp[i][j][0] = max(-prices[i] + dp[i+1][j][1], dp[i+1][j][0])\n# dp[i][j][1] = max(prices[i] + dp[i+1][j-1][0], dp[i+1][j][1])\n\n# print(dp)\n# return dp[0][k][0]\n \nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[0, 0] for _ in range(k)] for _ in range(n)]\n\n # how much we can earn at last price? We can only sell at last price\n dp[-1] = [[0, prices[-1]] for _ in range(k)]\n\n for i in reversed(range(n-1)):\n for j in range(k):\n if j == k - 1:\n dp[i][j][1] = max(prices[i], dp[i+1][j][1]) # last transaction, cannot sell anymore\n else:\n dp[i][j][1] = max(prices[i] + dp[i+1][j+1][0], dp[i+1][j][1])\n \n dp[i][j][0] = max(-prices[i] + dp[i+1][j][1], dp[i+1][j][0])\n\n\n print(dp)\n\n return dp[0][0][0]\n\n#[[[8, 9], [11, 12]], [[8, 9], [11, 12]], [[7, 9], [8, 12]], [[7, 9], [7, 12]], [[7, 9], [7, 9]], [[0, 9], [0, 9]], [[0, 7], [0, 7]]]\n ","memory":"32701"},{"code":"# class Solution:\n# def maxProfit(self, k: int, prices: List[int]) -> int:\n# n = len(prices)\n# dp = [[[0, 0] for _ in range(k+1)] for _ in range(n+1)]\n\n# for i in reversed(range(n)):\n# # representing the index of the price\n# for j in range(1, k + 1):\n# # representing which transaction it's on\n# # 0 - not holding a stock, 1 - holding a stock\n# dp[i][j][0] = max(-prices[i] + dp[i+1][j][1], dp[i+1][j][0])\n# dp[i][j][1] = max(prices[i] + dp[i+1][j-1][0], dp[i+1][j][1])\n\n# print(dp)\n# return dp[0][k][0]\n \nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n dp = [[[0, 0] for _ in range(k)] for _ in range(n)]\n\n # how much we can earn at last price? We can only sell at last price\n dp[-1] = [[0, prices[-1]] for _ in range(k)]\n\n for i in reversed(range(n-1)):\n for j in range(k):\n if j == k - 1:\n dp[i][j][1] = max(prices[i], dp[i+1][j][1]) # last transaction, cannot sell anymore\n else:\n dp[i][j][1] = max(prices[i] + dp[i+1][j+1][0], dp[i+1][j][1])\n \n dp[i][j][0] = max(-prices[i] + dp[i+1][j][1], dp[i+1][j][0])\n\n\n print(dp)\n\n return dp[0][0][0]\n\n#[[[8, 9], [11, 12]], [[8, 9], [11, 12]], [[7, 9], [8, 12]], [[7, 9], [7, 12]], [[7, 9], [7, 9]], [[0, 9], [0, 9]], [[0, 7], [0, 7]]]\n ","memory":"32701"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n\n n=len(prices)\n dp=[[[-math.inf,-math.inf] for i in range(k+1)] for i in range(n)]\n maxa=0\n for i in range(n):\n for j in range(k+1):\n\n if(j==0):\n dp[i][j][0]=0\n continue\n\n if(i==0):\n dp[0][1][1]=-prices[0]\n continue\n \n dp[i][j][0] = max(dp[i-1][j][0],dp[i-1][j][1]+prices[i])\n\n dp[i][j][1] = max(dp[i-1][j][1],dp[i-1][j-1][0]-prices[i])\n\n maxa=max(maxa,dp[i][j][0],dp[i][j][1])\n print(dp)\n return maxa\n\n\n \n\n\n \n\n\n \n ","memory":"33548"},{"code":"class Solution: \n \n def maxProfit(self, k: int, prices: List[int]) -> int:\n '''\n we can't use the same algo as we did for k=2 because we may not have the full list to work with\n \n dp[i][j] represents max profit if buying and selling in prices[i:j]\n - can generate this in O(n^2) time\n \n then we have to find the best k\n - can't use binayr search cause it's not sorted\n \n iterate j from 1 to len(prices)\n - check dp[:j] + self.maxProfitHelper(k-1, prices[j:])\n - instead, we don't need dp here, we can find best price from i to j while we iterate throguh\n \n \n O(n^K) time\n O(k) space\n \n ----\n we can use memo/dp for self.maxProfitHelper(k-1, prices[j:])\n \n memo[(k, i)] where k is the number of parititons we can do and i is the index we are on (consdiering prices[i:])\n \n O(k*n * n) time, since it takes O(n) time to cmpute each one\n O(k*n) space\n \n ----\n reading solution\n an optimizaiton we can make is check if memo[k-1][prices[j-1]] exists, and is > than our \n current prpofit, if it is than this result will be redundant and we can stop\n - will need to keep track of our current profit so far, that's easy\n - basically only call the function when the max_profit increases?\n worst case would still be the same tho if we get lot of dips and peaks in the array\n \n ----\n using solution but implmeneting myself\n \n dp[day_number][used_transaction_number][stock_holding_status] to represent our states, where stock_holding_status is a 0/1 number representing whether you hold the stock or not.\n\nThe value of dp[i][j][l] represents the best profit we can have at the end of the i-th day, with j remaining transactions to make and l stocks.\n\n dp[i][j][1] = max(dp[i-1][j+1][0] + \n - oh okay, was confused but we don't need to know when we bought it because we subtract the \n amount from our profit the moment we buy it, so just knowing when we sold it is sufficinet\n \n better than mine because don't need to iterate through the whole list to get the next state\n - next time try thinking from the opposite way\n - for eveyrthing not in terms of just the list, even number of transactions (go from 0 to k\n not k to 0)\n \n \n o(n*k) time\n O(k*n) space\n \n dp[0][0][0] = 0\n dp[0][0][1] = -prices[0]\n \n dp[i][j][0] means we don't have the stock after the ith day\n\n selling the stock (because we had the stock from previous day, not necessarily bought it on\n that day, we take the max profit so far with also having the stock on that day)\n\n dp[i][j][0] = dp[i-1][j-1][1] + prices[i]\n\n j being number of times we sold\n - we could say j being number of times we bought too, but then we might sell more than \n what we actually have\n - we could also make each row 2k elements, and it repserents number of transactions\n - tho that would also be invalid because we might just sell 2*k times\n\n keep not having teh stock \n dp[i][j][0] = dp[i-1][j][0]\n\n having the estock, either we had it form before or we buy it now, take whatever gives us\n the max profit currently ()\n dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j][0] - prices[i])\n '''\n dp= []\n for i in range(len(prices)):\n row = []\n for j in range(k+1):\n row.append([-sys.maxsize,-sys.maxsize])\n dp.append(row)\n # dp = [[[0, -2], [-inf, -inf], [-inf, -inf]],[[0, -2], [-inf, -inf], [-inf, -inf]],[[-inf, -inf], [-inf, -inf], [-inf, -inf]]]\n dp[0][0][0] = 0\n dp[0][0][1] = -prices[0]\n for i in range(1, len(dp)):\n for j in range(len(dp[i])):\n dp[i][j][0] = dp[i-1][j][0]\n if j > 0:\n dp[i][j][0] = max(dp[i-1][j-1][1] + prices[i], dp[i][j][0])\n dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j][0] - prices[i])\n \n highest = 0\n for j in range(len(dp[-1])):\n highest=max(dp[-1][j][0], highest) # highest swould never be holding a stock at the end\n return highest\n \n'''\n2\n[2,4,1]\n2\n[3,2,6,5,0,3]\n2\n[2,4,1]\n1\n[3,2,6,5,0,3]\n\nshould be 7 still\n3\n[3,2,6,5,0,3,1,2]\nshould be 8 now\n3\n[3,2,6,5,0,3,1,2]\n\n\n# dp = [[[0, -2], [-inf, -inf], [-inf, -inf]],[[-inf, -inf], [-inf, -inf], [-inf, -inf]],[[-inf, -inf], [-inf, -inf], [-inf, -inf]]]\n\n\n'''","memory":"34394"},{"code":"class Solution:\n def maxProfit(self, kk: int, prices: List[int]) -> int:\n # daylength = len(prices)\n\n # everyday, I can buy, sell, or hold\n # @cache\n # def dp(startday, remainK, hasStock):\n # if startday >= daylength - 1:\n # if not hasStock:\n # return 0\n # else:\n # return prices[startday]\n # res = []\n # best1 = dp(startday + 1, remainK, hasStock)\n # res.append(best1)\n # if not hasStock and remainK > 0:\n # best2 = dp(startday + 1, remainK, True) - prices[startday]\n # res.append(best2)\n # if hasStock and remainK > 0:\n # best3 = dp(startday + 1, remainK - 1, False) + prices[startday]\n # res.append(best3)\n # # print(startday, remainK, purchaseDay, res)\n # return max(res)\n\n # return dp(0, k, False)\n\n dp = [[[-math.inf, -math.inf] for k in range(kk + 1)] for i in range(len(prices))]\n for i in range(len(prices)):\n dp[i][0][0] = 0\n dp[i][0][1] = -prices[i]\n for k in range(kk + 1):\n if k > 0:\n dp[0][k][0] = -math.inf\n dp[0][k][1] = -math.inf\n for i in range(1, len(prices)):\n for k in range(0, kk + 1):\n dp[i][k][1] = max(dp[i - 1][k][1], dp[i - 1][k][0] - prices[i])\n if k > 0:\n dp[i][k][0] = max(dp[i - 1][k][0], dp[i - 1][k - 1][1] + prices[i])\n ans = 0\n print(dp)\n for k in range(kk + 1):\n print(ans, dp[-1][k][0])\n ans = max(dp[-1][k][0], dp[-1][k][1], ans)\n return ans\n","memory":"35240"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n=len(prices)\n p=prices\n DD={}\n for s in range(k+1):\n F=p[n-1]\n #print(\"s is\", s)\n for i in range(1,n+1):\n #print(\"i is,\", i)\n if s==0 or i==1:\n DD[(s,n-i)]=0\n else:\n f1=DD[(s,n-i+1)]\n f2=-p[n-i]+F\n DD[(s,n-i)]=max(f1,f2)\n F=max(F,p[n-i]+DD[(s-1,n-i+1)])\n \n #print(\"DD is\", DD)\n return DD[(k,0)]\n \n\n ","memory":"35240"},{"code":"class Solution:\n def maxProfit(self, kk: int, prices: List[int]) -> int:\n # daylength = len(prices)\n\n # everyday, I can buy, sell, or hold\n # @cache\n # def dp(startday, remainK, hasStock):\n # if startday >= daylength - 1:\n # if not hasStock:\n # return 0\n # else:\n # return prices[startday]\n # res = []\n # best1 = dp(startday + 1, remainK, hasStock)\n # res.append(best1)\n # if not hasStock and remainK > 0:\n # best2 = dp(startday + 1, remainK, True) - prices[startday]\n # res.append(best2)\n # if hasStock and remainK > 0:\n # best3 = dp(startday + 1, remainK - 1, False) + prices[startday]\n # res.append(best3)\n # # print(startday, remainK, purchaseDay, res)\n # return max(res)\n\n # return dp(0, k, False)\n\n dp = [[[-math.inf, -math.inf] for k in range(kk + 1)] for i in range(len(prices))]\n for i in range(len(prices)):\n dp[i][0][0] = 0\n dp[i][0][1] = -prices[i]\n for k in range(kk + 1):\n if k > 0:\n dp[0][k][0] = 0\n dp[0][k][1] = -math.inf\n for i in range(1, len(prices)):\n for k in range(0, kk + 1):\n dp[i][k][1] = max(dp[i - 1][k][1], dp[i - 1][k][0] - prices[i])\n if k > 0:\n dp[i][k][0] = max(dp[i - 1][k][0], dp[i - 1][k - 1][1] + prices[i])\n ans = 0\n print(dp)\n for k in range(kk + 1):\n print(ans, dp[-1][k][0])\n ans = max(dp[-1][k][0], dp[-1][k][1], ans)\n return ans\n","memory":"36086"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n # k = min(k, len(prices) // 2)\n\n starts = [i for i in range(len(prices) - 1) if (i == 0 or prices[i - 1] >= prices[i]) and prices[i] < prices[i + 1]]\n ends = {i for i in range(1, len(prices)) if prices[i - 1] < prices[i] and (i == len(prices) - 1 or prices[i] >= prices[i + 1])}\n\n @cache\n def dp(i: int, t: int) -> int:\n if t == 0 or i == 0:\n return 0\n return max(dp(i, t - 1), dp(i - 1, t), max(prices[i - 1] - prices[j] + dp(j, t - 1) for j in starts if j <= i - 1) if i - 1 in ends else 0)\n\n return dp(len(prices), k)\n\n","memory":"36086"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n #3d day/used k/hold\n dp = [[[-inf for _ in range(2)] for _ in range(k+1)] for _ in range(len(prices))]\n\n print(dp)\n \n dp[0][0][0] = 0\n dp[0][1][1] = -prices[0]\n res = 0\n\n for i in range(1, len(prices)):\n for j in range(k+1):\n dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1] + prices[i])\n\n # buy\n if j > 0:\n dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j-1][0] - prices[i])\n res = max(res, dp[i][j][0], dp[i][j][1])\n return res\n","memory":"36933"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n def buy(idx, k):\n if idx == len(prices) or k == 0: return 0\n\n if not idx in dp['buy'][k]:\n dp['buy'][k][idx] = max(buy(idx+1, k), sell(idx, k) - prices[idx])\n\n return dp['buy'][k][idx]\n\n def sell(idx, k):\n if idx == len(prices): return 0\n\n if not idx in dp['sell'][k]:\n dp['sell'][k][idx] = max(sell(idx+1, k), prices[idx] + buy(idx+1, k-1))\n\n return dp['sell'][k][idx]\n\n dp = {'buy': defaultdict(dict), 'sell': defaultdict(dict)}\n return buy(0, k)","memory":"36933"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n\n n = len(prices)\n dp = [[[0] * 2 for _ in range(2*k + 1)] for __ in range(n + 1)]\n \n for i in range(n - 1, -1, -1):\n for transactions_remaining in range(1, 2*k + 1):\n for holding in range(2):\n do_nothing = dp[i + 1][transactions_remaining][holding]\n if holding:\n # Sell stock\n do_something = prices[i] + dp[i + 1][transactions_remaining - 1][0]\n else:\n # Buy stock\n do_something = -prices[i] + dp[i + 1][transactions_remaining][1]\n \n # Recurrence relation\n dp[i][transactions_remaining][holding] = max(do_nothing, do_something)\n\n return dp[0][k][0]\n\n\n \n # @cache\n # def f(i,K,hold):\n # if K != 2*k and i < len(prices):\n # if hold:\n # return max(f(i+1,K,hold), prices[i] + f(i+1,K+1,not hold))\n # else:\n # return max(f(i+1,K,hold), -prices[i] + f(i+1,K+1,not hold))\n # else:\n # return 0\n\n # return f(0,0,False)\n ","memory":"37779"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n HOLD = 1\n FREE = 0\n dp = defaultdict(lambda: defaultdict(int))\n dp[0][(0, FREE)] = 0\n dp[0][(0, HOLD)] = -prices[0]\n maxprofit = 0\n for day in range(len(prices)-1):\n #print(day, 'day')\n for (action, holding), value in dp[day].items():\n #print('interpreting', action, holding, 'value', value)\n if holding:\n dp[day+1][(action+1, FREE)] = value + prices[day+1]\n elif action < k:\n dp[day+1][(action, HOLD)] = value - prices[day+1]\n \n for (action, holding), value in dp[day].items():\n dp[day+1][(action, holding)] = max(dp[day+1][(action, holding)], value)\n\n #print(dp[0])\n #print(dp[1])\n #print(dp[2])\n #print(dp[3])\n #print(dp[4])\n #print(dp[5])\n #print(dp[6])\n #print(dp[7])\n \n return max(dp[len(prices)-1].values()) \n\n\n\n\n''' @cache\n def dp(i, holding, remain):\n if i == len(prices) or remain == 0:\n return 0\n \n sell = buy = 0\n skip = dp(i + 1, holding, remain)\n if holding:\n sell = prices[i] + dp(i+1, False, remain-1)\n else:\n buy = -prices[i] + dp(i+1, True, remain)\n return max(sell, buy, skip)\n\n return dp(0, False, k)'''","memory":"37779"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n @functools.cache\n def dp(i: int, kLeft: int) -> int:\n if kLeft == 0: return 0\n if i == n: return 0\n minSoFar = prices[i]\n soln = 0\n bestProfit = 0\n for j in range(i+1, n):\n minSoFar = min(minSoFar, prices[j])\n d = prices[j] - minSoFar\n if d < bestProfit: continue\n bestProfit = d\n soln = max(soln, bestProfit+dp(j+1, kLeft-1))\n return soln\n \n return dp(0, k)","memory":"38625"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n if k < 0:\n raise ValueError(\"k can not be negative!\")\n\n if not k or not prices:\n return 0\n\n return self.max_profit_helper_bottom_up(prices, k)\n\n return self.max_profit_helper(prices, 0, 2 * k, True, {})\n\n\n # Ideally, an InputParam should be created, will refactor it if I get time.\n def max_profit_helper(self, prices, current_index, max_transaction, can_buy_stock, cache):\n if current_index >= len(prices) or max_transaction <= 0:\n return 0\n\n key = (current_index, max_transaction)\n\n if key in cache:\n return cache[key]\n \n if can_buy_stock:\n buy = -prices[current_index] + self.max_profit_helper(prices, current_index + 1, max_transaction - 1, False, cache)\n skip_buying = self.max_profit_helper(prices, current_index + 1, max_transaction, True, cache)\n cache[key] = max(buy, skip_buying)\n else:\n sell = prices[current_index] + self.max_profit_helper(prices, current_index + 1, max_transaction - 1, True , cache)\n skip_selling = self.max_profit_helper(prices, current_index + 1, max_transaction, False , cache)\n cache[key] = max(sell, skip_selling)\n\n return cache[key]\n\n \n def max_profit_helper_bottom_up(self, prices, k):\n if k < 0:\n raise ValueError(\"k can not be negative!\")\n\n if not k or not prices:\n return 0\n\n n = len(prices)\n max_transaction = 2 * k\n\n # dp[day][remaining_transactions][can_buy] where can_buy is 1 for True, 0 for False\n dp = [[[0] * 2 for _ in range(max_transaction + 1)] for _ in range(n + 1)]\n\n # Fill the DP table from the end to the beginning\n for current_index in range(n - 1, -1, -1):\n for remaining_transactions in range(1, max_transaction + 1):\n # Case where we can buy\n dp[current_index][remaining_transactions][1] = max(\n -prices[current_index] + dp[current_index + 1][remaining_transactions - 1][0], # Buy stock\n dp[current_index + 1][remaining_transactions][1] # Skip buying\n )\n\n # Case where we can sell\n dp[current_index][remaining_transactions][0] = max(\n prices[current_index] + dp[current_index + 1][remaining_transactions - 1][1], # Sell stock\n dp[current_index + 1][remaining_transactions][0] # Skip selling\n )\n\n # We start on day 0, with 2*k transactions allowed, and the ability to buy\n return dp[0][max_transaction][1]\n \n\n\n def get_dp_grid(prices_length, k):\n dp_grid = []\n for row in range(prices_length + 1):\n temp_dp = [0 for col in range(k + 1)]\n dp_grid.append(temp_dp)\n \n return dp_grid\n\n\n \n \n\n\n ","memory":"39471"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n N = len(prices)\n\n @cache\n def dp(i, isBuy, t):\n if i == N:\n return 0\n \n if t == 0:\n return 0\n \n maxProfit = float(\"-inf\")\n \n if isBuy:\n buyNowProfit = -prices[i] + dp(i + 1, False, t - 1)\n buyLaterProfit = dp(i + 1, True, t)\n maxProfit = max(buyNowProfit, buyLaterProfit)\n else:\n sellNowProfit = prices[i] + dp(i + 1, True, t - 1)\n sellLaterProfit = dp(i + 1, False, t)\n maxProfit = max(sellNowProfit, sellLaterProfit)\n \n return maxProfit\n\n\n dp = [[[0, 0] for _ in range(1 + 2 * k)] for _ in range(N + 1)]\n\n\n for i in range(N - 1, -1, -1):\n for t in range(1, 2 * k + 1):\n for isBuy in [1, 0]:\n if isBuy:\n buyNowProfit = -prices[i] + dp[i + 1][t - 1][0]\n buyLaterProfit = dp[i + 1][t][1]\n maxProfit = max(buyNowProfit, buyLaterProfit)\n else:\n sellNowProfit = prices[i] + dp[i + 1][t - 1][1]\n sellLaterProfit = dp[i + 1][t][0]\n maxProfit = max(sellNowProfit, sellLaterProfit)\n \n dp[i][t][isBuy] = maxProfit\n \n return dp[0][2 * k][1]","memory":"40318"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo = [[[-1] * 2 for _ in range(2 * (k + 1))] for _ in range(len(prices))]\n\n def dfs(pos, trans, hold):\n if not trans:\n return 0\n \n if len(prices) == pos:\n return 0\n \n if -1 != memo[pos][trans][hold]:\n return memo[pos][trans][hold]\n \n ret1 = 0\n if hold: # Sell it\n ret1 = prices[pos] + dfs(pos + 1, trans - 1, 0)\n else: # Buy it\n ret1 = dfs(pos + 1, trans - 1, 1) - prices[pos]\n \n # Hold current stock (if there are any)\n ret2 = dfs(pos + 1, trans, hold)\n\n memo[pos][trans][hold] = max(ret1, ret2)\n return max(ret1, ret2)\n \n return dfs(0, 2 * k, 0)\n ","memory":"40318"},{"code":"\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n cache = [] #day, transcation, own\n for d in range(len(prices)): #days\n tem = []\n for i in range(k*2): #transcation\n tem.append([None, None]) #own or not\n cache.append(tem)\n \n def dfs(d, t, own):\n if d == len(prices) or t == 2*k:\n return 0\n \n if cache[d][t][own] != None:\n return cache[d][t][own] \n \n if own == 1:\n #sell it or not today\n cache[d][t][own] = max( dfs(d + 1, t + 1, 0) + prices[d], dfs(d + 1, t, 1)) \n \n else:\n #buy it or not today\n cache[d][t][own] = max( dfs(d + 1, t + 1, 1) - prices[d], dfs(d + 1, t, 0))\n\n return cache[d][t][own]\n \n return dfs(0, 0, 0)\n","memory":"41164"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n def dfs(i, buy, k):\n if i == n:\n return 0\n\n if k == 0:\n return 0\n\n if cache[i][k][buy] != -1:\n return cache[i][k][buy]\n\n if buy:\n res = max(\n -prices[i] + dfs(i+1, 0, k-1),\n dfs(i+1, 1, k)\n )\n cache[i][k][buy] = res\n return res\n\n res = max(\n prices[i] + dfs(i+1, 1, k-1),\n dfs(i+1, 0, k)\n )\n cache[i][k][buy] = res\n return res\n \n n = len(prices)\n cache = [[[-1, -1] for _ in range(2*k+1)] for _ in range(n)]\n return dfs(0, 1, 2*k)","memory":"42010"},{"code":"class Solution:\n def __init__(self):\n self.memo = dict()\n def helper(self, idx, count, state):\n key = \"{},{},{}\".format(idx, count, state)\n if key in self.memo:\n return self.memo[key]\n if idx == len(self.prices) or count == 0:\n return 0\n if state == 0:\n ans = max(\n self.helper(idx+1, count, 0),\n self.helper(idx+1, count, 1) - self.prices[idx]\n )\n else:\n ans = max(\n self.helper(idx+1, count, 1),\n self.helper(idx+1, count-1, 0) + self.prices[idx]\n )\n self.memo[key] = ans\n return ans\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n self.prices = prices\n return self.helper(0, k, 0)","memory":"42010"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n\n def get_value(x, y, z, profit_matrix):\n if x < 0 or y < 0 or z < 0:\n return -float('inf')\n else:\n return profit_matrix[x][y][z]\n\n profit_matrix = []\n for day in range(len(prices)):\n profit_matrix.append([[-float('inf')] * 2 for _ in range(2 * k + 1)])\n\n # profit matrix is day * transaction count * 2 (0/1 whether holding the stock or not)\n profit_matrix[0][0][0] = 0\n profit_matrix[0][1][1] = -prices[0]\n\n\n for day in range(1, len(prices)):\n for t in range(2 * k + 1):\n # profit_matrix[day][t][0] = max(profit_matrix[day - 1][t -1][1] + prices[day], profit_matrix[day - 1][t][0])\n # profit_matrix[day][t][1] = max(profit_matrix[day - 1][t -1][0] - prices[day], profit_matrix[day - 1][t][1])\n profit_matrix[day][t][0] = max(get_value(day - 1, t -1, 1, profit_matrix) + prices[day], get_value(day - 1, t, 0, profit_matrix))\n profit_matrix[day][t][1] = max(get_value(day - 1, t -1, 0, profit_matrix) - prices[day], get_value(day - 1, t, 1, profit_matrix))\n \n\n max_profit = 0\n for day in range(len(prices)):\n for t in range(2 * k + 1):\n for hold in [0, 1]:\n max_profit = max(max_profit, profit_matrix[day][t][hold])\n\n return max_profit\n ","memory":"42856"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n=len(prices)\n dp={}\n # dp[i, j]=x,y.\n # x: max proft if at day i you are holding the j-th stock\n # y: max profit if at day i you are flat and did j buy/sell orders total\n # dp[i, j][0] = max(dp[i-1,j-1][1]-prices[i], dp[i-1][j][0])\n # dp[i, j][1] = max(dp[i,j][0]+prices[i], dp[i-1,j][1])\n\n for i in range(n):\n for j in range(k+1):\n dp[i,j]=[0, 0]\n if i==0:\n if j==1:\n dp[i, j]=[-prices[0], 0]\n elif j>1:\n dp[i, j]=[-float('inf'),-float('inf')]\n else:\n if j==0:\n dp[i, j] = dp[i-1, j]\n else:\n dp[i, j][0] = max(dp[i-1,j-1][1]-prices[i], dp[i-1,j][0])\n dp[i, j][1] = max(dp[i, j][0]+prices[i], dp[i-1,j][1])\n\n return max([dp[n-1,j][1] for j in range(k+1)])\n \n \n\n ","memory":"43703"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n=len(prices)\n dp={}\n # dp[i, j]=x,y.\n # x: max proft if at day i you are holding the j-th stock\n # y: max profit if at day i you are flat and did j buy/sell orders total\n # dp[i, j][0] = max(dp[i-1,j-1][1]-prices[i], dp[i-1][j][0])\n # dp[i, j][1] = max(dp[i,j][0]+prices[i], dp[i-1,j][1])\n\n for i in range(n):\n for j in range(k+1):\n dp[i,j]=[0, 0]\n if i==0:\n if j==1:\n dp[i, j]=[-prices[0], 0]\n elif j>1:\n dp[i, j]=[-float('inf'),-float('inf')]\n else:\n if j==0:\n dp[i, j] = dp[i-1, j]\n else:\n dp[i, j][0] = max(dp[i-1,j-1][1]-prices[i], dp[i-1,j][0])\n dp[i, j][1] = max(dp[i, j][0]+prices[i], dp[i-1,j][1])\n\n for i in range(n):\n print(prices[:i+1])\n print([dp[i, j] for j in range(k+1)])\n print(30*'-')\n return max([dp[n-1,j][1] for j in range(k+1)])\n \n \n\n ","memory":"43703"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n self.memo = {}\n self.prices = prices\n\n value = self.iterate(0, k, False)\n # print(self.memo)\n return value\n\n def iterate(self, day_idx: int, k: int, is_holding: bool) -> int:\n memo_key = f\"{day_idx}-{k}-{is_holding}\"\n if memo_key in self.memo:\n return self.memo[memo_key]\n \n if day_idx >= len(self.prices):\n return 0\n \n # print(f\"iterating {day_idx}\")\n if is_holding:\n sell = self.prices[day_idx]+self.iterate(day_idx+1, k, False)\n hold = self.iterate(day_idx+1, k, True)\n value = max(sell, hold)\n else:\n if k > 0:\n buy = -self.prices[day_idx]+self.iterate(day_idx+1, k-1, True)\n else:\n buy = float(\"-inf\")\n hold = self.iterate(day_idx+1, k, False)\n value = max(buy, hold)\n \n self.memo[memo_key] = value\n return value\n\n ","memory":"44549"},{"code":"class Trade:\n def __init__(self, buy, profit):\n self.buy = buy\n self.profit = profit\n def __str__(self):\n return f\"T({self.buy},{self.profit})\"\n def __repr__(self):\n return str(self)\nclass Minpx:\n def __init__(self, px, idx):\n self.px = px\n self.idx = idx\n def __repr__(self):\n return str(self)\n def __str__(self):\n return f\"MP({self.px},{self.idx})\"\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n mp = [Minpx(prices[0],0)]\n for i in range(1,len(prices)):\n if(mp[i-1].px > prices[i]):\n mp.append(Minpx(prices[i],i))\n else:\n mp.append(mp[-1])\n trds = [[] * len(prices)]\n for i in range(1, len(prices)):\n trds.append([])\n for j in range(0,i):\n profit = prices[i] - prices[j]\n if(profit > 0):\n trds[i].append(Trade(j,profit))\n #j=mp[j].idx - 1\n\n #print(trds)\n dp = [[0] * (k+1) for _ in range(len(prices))]\n for pIdx in range(1,len(dp)):\n for trdNum in range(1,len(dp[0])):\n dp[pIdx][trdNum] = dp[pIdx-1][trdNum]\n for trd in trds[pIdx]:\n dp[pIdx][trdNum] = max(dp[pIdx][trdNum], trd.profit + dp[trd.buy][trdNum-1])\n #print(dp)\n return dp[-1][-1]","memory":"45395"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n # Transaction type - (buy,sell): 0,0 - 1,0 - 1,1 - 2,1 - 2,2 - ...\n f = [[[0 if q <= 2 else -math.inf for q in range(1 + k * 2)] for i in range(n)] for j in range(4)]\n\n\n # [0, -prices[0], 0, -math.inf, -math.inf, ...] # buy\n # [0, 0, 0, -math.inf, -math.inf, ...] # sell\n # [0, 0, 0, -math.inf, -math.inf, ...] # skip buy\n # [-math.inf, -math.inf, -math.inf, -math.inf, -math.inf, ...] # skip sell\n\n f[0][0][1] = -prices[0]\n f[3][0][0] = -math.inf\n f[3][0][1] = -math.inf\n f[3][0][2] = -math.inf\n\n for i in range(1, n):\n for j in range(1, 1 + k * 2, 2):\n f[0][i][j - 1] = max(f[1][i - 1][j - 1], f[2][i - 1][j - 1])\n f[0][i][j] = f[0][i][j - 1] - prices[i]\n\n f[2][i][j - 1] = max(f[1][i - 1][j - 1], f[2][i - 1][j - 1])\n f[2][i][j] = max(f[1][i - 1][j], f[2][i - 1][j])\n\n for j in range(2, 1 + k * 2, 2):\n f[1][i][j - 1] = max(f[0][i - 1][j - 1], f[3][i - 1][j - 1])\n f[1][i][j] = f[1][i][j - 1] + prices[i]\n\n f[3][i][j - 1] = max(f[0][i - 1][j - 1], f[3][i - 1][j - 1])\n f[3][i][j] = max(f[0][i - 1][j], f[3][i - 1][j])\n\n\n return max(val for l in f[1] for val in l)","memory":"46241"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n\n # Transaction type - (buy,sell): 0,0 - 1,0 - 1,1 - 2,1 - 2,2 - ...\n f = [[[0 if q <= 2 else -math.inf for q in range(1 + k * 2)] for i in range(n)] for j in range(4)]\n\n\n # [0, -prices[0], 0, -math.inf, -math.inf, ...] # buy\n # [0, 0, 0, -math.inf, -math.inf, ...] # sell\n # [0, 0, 0, -math.inf, -math.inf, ...] # skip buy\n # [-math.inf, -math.inf, -math.inf, -math.inf, -math.inf, ...] # skip sell\n\n f[0][0][1] = -prices[0]\n f[3][0][0] = -math.inf\n f[3][0][1] = -math.inf\n f[3][0][2] = -math.inf\n \n\n for i in range(1, n):\n for j in range(1, 1 + k * 2, 2):\n f[0][i][j - 1] = max(f[1][i - 1][j - 1], f[2][i - 1][j - 1])\n f[0][i][j] = f[0][i][j - 1] - prices[i]\n\n f[2][i][j - 1] = max(f[1][i - 1][j - 1], f[2][i - 1][j - 1])\n f[2][i][j] = max(f[1][i - 1][j], f[2][i - 1][j])\n\n for j in range(2, 1 + k * 2, 2):\n f[1][i][j - 1] = max(f[0][i - 1][j - 1], f[3][i - 1][j - 1])\n f[1][i][j] = f[1][i][j - 1] + prices[i]\n\n f[3][i][j - 1] = max(f[0][i - 1][j - 1], f[3][i - 1][j - 1])\n f[3][i][j] = max(f[0][i - 1][j], f[3][i - 1][j])\n\n\n return max(val for l in f[1] for val in l)","memory":"47088"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n self.memo = {}\n self.prices = prices\n\n value = self.iterate(0, k, False)\n print(self.memo)\n return value\n\n def iterate(self, day_idx: int, k: int, is_holding: bool) -> int:\n memo_key = f\"{day_idx}-{k}-{is_holding}\"\n if memo_key in self.memo:\n return self.memo[memo_key]\n \n if day_idx >= len(self.prices):\n return 0\n \n # print(f\"iterating {day_idx}\")\n if is_holding:\n sell = self.prices[day_idx]+self.iterate(day_idx+1, k, False)\n hold = self.iterate(day_idx+1, k, True)\n value = max(sell, hold)\n else:\n if k > 0:\n buy = -self.prices[day_idx]+self.iterate(day_idx+1, k-1, True)\n else:\n buy = float(\"-inf\")\n hold = self.iterate(day_idx+1, k, False)\n value = max(buy, hold)\n \n self.memo[memo_key] = value\n return value\n\n ","memory":"47934"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n @cache\n def trade(day_d, transaction_i):\n \n if day_d <= 0 or transaction_i <= 0:\n # Can not trade ealry than day #0\n # Can not trade with 0 transaction or less\n return 0\n \n \n ## Case_#1\n # not to transact on day d, all transactions are completed before\n not_to_transact = trade(day_d-1, transaction_i)\n \n \n ## Case_#2\n # transact on day_d\n \n # update price gain\n # define price_gain = max( -prices[buy_in] + trade(day_d-1, transaction_i-1) for buy_in in range(day_d) )\n \n if day_d == 1:\n trade.max_gain[transaction_i] = -prices[day_d-1] + trade(day_d-1, transaction_i-1)\n else:\n trade.max_gain[transaction_i] = max(trade.max_gain[transaction_i], -prices[day_d-1] + trade(day_d-1, transaction_i-1) )\n \n \n # transact on day_d, carry out i-th transaction now\n transact = prices[day_d] + trade.max_gain[transaction_i]\n\n \n return max(not_to_transact, transact)\n \n # ---------------------------------------------------\n \n trade.max_gain = defaultdict(int) \n return trade(len(prices)-1, k)","memory":"48780"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp={}\n n= len(prices)\n \n for i in range(n+1):\n for buy in range(2):\n for cap in range(k+1):\n dp[(i,buy,cap)]=0\n for i in range(n-1,-1,-1):\n for buy in range(2):\n for cap in range(1,k+1):\n if(buy==1):\n dp[(i,buy,cap)]= max(dp[(i+1,1,cap)],dp[(i+1,0,cap)]-prices[i])\n else:\n dp[(i,buy,cap)]= max(dp[(i+1,0,cap)],dp[(i+1,1,cap-1)]+prices[i])\n return dp[(0,1,k)]","memory":"49626"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n @cache\n def dfs(i, j, hold):\n if j < 0:\n return -inf\n if i < 0:\n return 0 if not hold else -inf\n if hold:\n return max(dfs(i-1, j, True), dfs(i-1, j-1, False) - prices[i])\n return max(dfs(i-1, j, False), dfs(i-1, j, True) + prices[i])\n n = len(prices)\n ans = dfs(n-1, k, False)\n dfs.cache_clear()\n return ans","memory":"49626"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n # @cache\n # def helper( buy , remaining_k , index ):\n\n # if index >= len(prices):\n # return 0\n # if remaining_k == 0:\n # return 0\n \n # # do something\n # if buy:\n # ans = -prices[index] + helper( not buy , remaining_k, index + 1 )\n # else:\n # ans = prices[index] + helper( not buy , remaining_k - 1 , index + 1 )\n # # do nothing\n # ans = max(ans, \n # helper( buy , remaining_k , index + 1 )\n # )\n # return ans\n \n # return helper( True , k , 0 )\n\n dp = defaultdict(int)\n for index in range(len(prices)-1,-1,-1):\n for remaining_k in range(1,k+1):\n for buy in range(2):\n if buy == 0:\n ans = -prices[index] + dp[(1-buy,remaining_k,index+1)]\n else:\n ans = prices[index] + dp[(1-buy,remaining_k-1,index+1)]\n \n dp[(buy,remaining_k,index)] = max(ans , dp[(buy,remaining_k,index+1)])\n return dp[(0,k,0)]","memory":"50473"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n # @cache\n # def helper( buy , remaining_k , index ):\n\n # if index >= len(prices):\n # return 0\n # if remaining_k == 0:\n # return 0\n \n # # do something\n # if buy:\n # ans = -prices[index] + helper( not buy , remaining_k, index + 1 )\n # else:\n # ans = prices[index] + helper( not buy , remaining_k - 1 , index + 1 )\n # # do nothing\n # ans = max(ans, \n # helper( buy , remaining_k , index + 1 )\n # )\n # return ans\n \n # return helper( True , k , 0 )\n\n dp = defaultdict(int)\n for index in range(len(prices)-1,-1,-1):\n for remaining_k in range(1,k+1):\n for buy in range(2):\n if buy == 0:\n ans = -prices[index] + dp[(1-buy,remaining_k,index+1)]\n else:\n ans = prices[index] + dp[(1-buy,remaining_k-1,index+1)]\n \n dp[(buy,remaining_k,index)] = max(ans , dp[(buy,remaining_k,index+1)])\n return dp[(0,k,0)]","memory":"50473"},{"code":"class Solution:\n def dp(self, prices, day, num_bought, hold):\n global memo\n key = (day, num_bought, hold)\n if key in memo:\n return memo[key]\n if num_bought <= 0:\n memo[key] = 0\n elif hold == False:\n if day == 0:\n memo[key] = 0\n else:\n memo[key] = max(self.dp(prices, day-1, num_bought, False), self.dp(prices, day-1, num_bought, True) + prices[day])\n else:\n if day == 0:\n memo[key] = -prices[day]\n else:\n memo[key] = max(self.dp(prices, day-1, num_bought, True), self.dp(prices, day-1, num_bought-1, False) - prices[day])\n return memo[key]\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n global memo\n memo = {}\n return self.dp(prices, len(prices)-1, k, False)\n \n ","memory":"51319"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n self.prices = prices\n self.cache = {}\n\n return self.dp(0, k, 0)\n\n def dp(self, i: int, transactions_remaining: int, holding: int) -> int:\n if transactions_remaining == 0 or i == len(self.prices):\n return 0\n\n if (i, transactions_remaining, holding) in self.cache:\n return self.cache[(i, transactions_remaining, holding)]\n\n do_nothing = self.dp(i + 1, transactions_remaining, holding) \n buy_or_sell = 0\n if holding:\n buy_or_sell = self.prices[i] + self.dp(i + 1,\n transactions_remaining - 1, 0)\n else:\n buy_or_sell = -self.prices[i] + self.dp(i + 1,\n transactions_remaining, 1)\n\n self.cache[(i, transactions_remaining, holding)] = max(do_nothing,\\\n buy_or_sell)\n\n return self.cache[(i, transactions_remaining, holding)]","memory":"52165"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = {}\n return recur(prices, 0, 0, 0, dp, k)\n\n\ndef recur(arr, i, buy, k, dp, req):\n if (i, buy, k) in dp:\n return dp[(i, buy, k)]\n if i == len(arr):\n return 0\n if k == req:\n return 0\n if buy == 0:\n x = max(recur(arr, i+1, 0, k, dp, req), 0 - arr[i] + recur(arr, i+1, 1, k, dp, req))\n else:\n x = max(recur(arr, i+1, 1, k, dp, req), arr[i] + recur(arr, i+1, 0, k+1, dp, req))\n dp[(i, buy, k)] = x\n return x\n","memory":"53011"},{"code":"class Solution:\n def getMaxProfit(self, index: int, holding_stock: bool, txn_count: int, prices: List[int], cache: Dict, k: int) -> int:\n # since we reached end of array\n if index == len(prices):\n return 0\n\n elif (index, holding_stock, txn_count) in cache:\n return cache[(index, holding_stock, txn_count)]\n \n max_profit = 0\n\n if holding_stock:\n # do not sell the stock currently we are holding\n case_1 = self.getMaxProfit(index + 1, holding_stock, txn_count, prices, cache, k)\n\n # else I sell that stock\n if txn_count < k - 1:\n case_2 = prices[index] + self.getMaxProfit(index + 1, False, txn_count + 1, prices, cache, k)\n\n # means we have performed 2 transactions now so do not call functions again\n elif txn_count == k - 1:\n case_2 = prices[index]\n\n max_profit = max(case_1, case_2)\n cache[(index, holding_stock, txn_count)] = max_profit\n\n else:\n # do not buy the current stock\n case_1 = self.getMaxProfit(index + 1, holding_stock, txn_count, prices, cache, k)\n \n # else I buy that stock\n case_2 = self.getMaxProfit(index + 1, True, txn_count, prices, cache, k) - prices[index]\n\n max_profit = max(case_1, case_2)\n cache[(index, holding_stock, txn_count)] = max_profit\n\n return max_profit\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n cache = dict()\n return self.getMaxProfit(0, False, 0, prices, cache, k)","memory":"53011"},{"code":"class Solution:\n def helper(self, prices, i, sell, num_buy_left, mem):\n if i == len(prices):\n return 0\n \n b, h, s = 0, 0, 0\n if (i, sell, num_buy_left) in mem:\n return mem[(i, sell, num_buy_left)]\n\n if sell == 0 and num_buy_left > 0:\n # buy\n b = -prices[i] + self.helper(prices, i + 1, 1, num_buy_left - 1, mem)\n \n # hold as is dont buy or sell\n h = self.helper(prices, i + 1, sell, num_buy_left, mem)\n\n # sell\n if sell == 1:\n s = prices[i] + self.helper(prices, i + 1, 0, num_buy_left, mem)\n \n mem[(i, sell, num_buy_left)] = max(b, h, s)\n return mem[(i, sell, num_buy_left)]\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n mem = {}\n return self.helper(prices, 0, 0, k, mem)\n","memory":"53858"},{"code":"class Solution:\n \"\"\"\n First solution I came up with, it's accepted but very slow: beats 5.05%.\n The DP bottom up solution of the editorial beats 40%.\n \"\"\"\n def maxProfitHelper(self, prices, i, minPrice, attemptsLeft, memo):\n # It is tempting to not want to use attemptsLeft in the key of the memo table, but\n # the callers need to know how many attempts were used to calculate the solution\n # of a given prefix since they will have so many attempts left.\n if i >= len(prices) or attemptsLeft == 0:\n return 0\n elif (i, minPrice, attemptsLeft) in memo:\n return memo[(i, minPrice, attemptsLeft)]\n\n currentPrice = prices[i]\n if currentPrice <= minPrice:\n memo[(i, minPrice, attemptsLeft)] = self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft, memo)\n else:\n\n while i+1 < len(prices)-1 and prices[i+1] > currentPrice:\n i += 1\n currentPrice = prices[i]\n\n memo[(i, minPrice, attemptsLeft)] = max(\n self.maxProfitHelper(prices, i+1, minPrice, attemptsLeft, memo),\n self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft-1, memo) + currentPrice - minPrice)\n\n return memo[(i, minPrice, attemptsLeft)]\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo = {}\n return self.maxProfitHelper(prices, 1, prices[0], k, memo)\n\n","memory":"54704"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n def fun(ind,b,t,d):\n if ind==len(prices):\n return 0\n if t==0:\n return 0\n if (ind,b,t) in d:\n return d[(ind,b,t)]\n if b==0:\n x=-prices[ind]+fun(ind+1,1,t,d)\n y=fun(ind+1,0,t,d)\n d[(ind,b,t)]=max(x,y)\n else:\n x=prices[ind]+fun(ind+1,0,t-1,d)\n y=fun(ind+1,1,t,d)\n d[(ind,b,t)]=max(x,y)\n return d[(ind,b,t)] \n return fun(0,0,k,{}) \n ","memory":"55550"},{"code":"class Solution:\n def maxProfit(self, k, prices, i=0, can_buy=True, cache=None):\n # build cache with key (i, can_buy, k)\n if cache is None:\n cache = dict()\n # exit at boundary conditions\n if k == 0 or i == len(prices):\n return 0\n # define current key\n key = (i, can_buy, k)\n # compute max profits recursively\n if key not in cache:\n if can_buy:\n cache[key] = max(\n # buy at index i\n self.maxProfit(k, prices, i + 1, False, cache) - prices[i],\n # don't buy at index i\n self.maxProfit(k, prices, i + 1, True, cache)\n )\n else:\n cache[key] = max(\n # sell at index i\n prices[i] + self.maxProfit(k - 1, prices, i + 1, True, cache),\n # don't sell at index i\n self.maxProfit(k, prices, i + 1, False, cache)\n )\n return cache[key]\n\n","memory":"55550"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n @functools.cache\n def dp(day: int, holds_stock: bool, k_left: int) -> int:\n if day >= len(prices):\n return 0\n\n actions = []\n if holds_stock:\n sell_stock = prices[day] + dp(day + 1, False, k_left)\n actions.append(sell_stock)\n \n else:\n if k_left > 0:\n buy_stock = -prices[day] + dp(day + 1, True, k_left - 1)\n actions.append(buy_stock)\n\n do_nothing = dp(day + 1, holds_stock, k_left)\n actions.append(do_nothing)\n\n return max(actions)\n\n return dp(0, False, k)\n","memory":"56396"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n @functools.cache\n def dp(day: int, holds_stock: bool, k_left: int) -> int:\n if day >= len(prices):\n return 0\n\n actions = []\n if holds_stock:\n sell_stock = prices[day] + dp(day + 1, False, k_left)\n actions.append(sell_stock)\n \n else:\n if k_left > 0:\n buy_stock = -prices[day] + dp(day + 1, True, k_left - 1)\n actions.append(buy_stock)\n\n do_nothing = dp(day + 1, holds_stock, k_left)\n actions.append(do_nothing)\n\n return max(actions)\n\n return dp(0, False, k)\n","memory":"56396"},{"code":"class Solution:\n def __init__(self) -> None:\n self.__mem_buy: dict[tuple[int, int], int] = {}\n self.__mem_sell: dict[tuple[int, int], tuple[int, int]]\n self.__prices: list[int] = []\n \n def __dp_buy(self, idx: int, count: int) -> int:\n if (count == 0):\n return 0\n \n if (idx == len(self.__prices) - 1):\n return 0\n \n key = (idx, count)\n \n if (self.__mem_buy.get(key) is not None):\n return self.__mem_buy[key]\n \n result = max(self.__dp_buy(idx + 1, count), self.__dp_sell(idx, count)[0])\n \n self.__mem_buy[key] = result\n \n return result\n \n def __dp_sell(self, idx: int, count: int) -> tuple[int, int]:\n price = self.__prices[idx]\n \n if (idx == len(self.__prices) - 1):\n return (0, price)\n \n key = (idx, count)\n \n if (self.__mem_sell.get(key) is not None):\n return self.__mem_sell[key]\n \n result = None\n next_price = self.__prices[idx + 1]\n \n if (price < next_price): \n temp = self.__dp_sell(idx + 1, count)\n result = (temp[0] + next_price - price, temp[1])\n \n else:\n result = (self.__dp_buy(idx, count - 1), price)\n \n temp = self.__dp_sell(idx + 1, count) \n temp = (temp[0] - price + next_price, temp[1])\n \n if (temp[0] > result[0]):\n result = temp\n \n self.__mem_sell[key] = result\n \n return result\n \n \n \n def maxProfit(self, k: int, prices: List[int]) -> int:\n self.__prices = prices\n self.__mem_buy = {}\n self.__mem_sell = {}\n \n return self.__dp_buy(0, k)","memory":"57243"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n def func(i,buy,prices,ct,dic):\n if i>=len(prices) or ct==0:\n return 0\n if (i,buy,ct) in dic:\n return dic[(i,buy,ct)]\n x,y,a,b=0,0,0,0\n if buy:\n x=-prices[i]+func(i+1,False,prices,ct,dic)\n y=0+func(i+1,buy,prices,ct,dic)\n else:\n a=prices[i]+func(i+1,True,prices,ct-1,dic)\n b=0+func(i+1,buy,prices,ct,dic)\n dic[(i,buy,ct)]=max(a,b,x,y)\n return max(a,b,x,y)\n return func(0,True,prices,k,{})","memory":"57243"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n def func(i,buy,prices,ct,dic):\n if i>=len(prices) or ct==0:\n return 0\n if (i,buy,ct) in dic:\n return dic[(i,buy,ct)]\n x,y,a,b=0,0,0,0\n if buy:\n x=-prices[i]+func(i+1,False,prices,ct,dic)\n y=0+func(i+1,buy,prices,ct,dic)\n else:\n a=prices[i]+func(i+1,True,prices,ct-1,dic)\n b=0+func(i+1,buy,prices,ct,dic)\n dic[(i,buy,ct)]=max(a,b,x,y)\n return max(a,b,x,y)\n return func(0,True,prices,k,{})\n","memory":"58089"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n def func(i,buy,prices,ct,dic):\n if i>=len(prices) or ct==0:\n return 0\n if (i,buy,ct) in dic:\n return dic[(i,buy,ct)]\n x,y,a,b=0,0,0,0\n if buy:\n x=-prices[i]+func(i+1,False,prices,ct,dic)\n y=0+func(i+1,buy,prices,ct,dic)\n else:\n a=prices[i]+func(i+1,True,prices,ct-1,dic)\n b=0+func(i+1,buy,prices,ct,dic)\n dic[(i,buy,ct)]=max(a,b,x,y)\n return max(a,b,x,y)\n return func(0,True,prices,k,{})\n ","memory":"58089"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n maxProfits = {}\n N = len(prices)\n\n for i in range(N):\n maxProfits[i] = {}\n mP = 0\n minBuy = prices[i]\n for j in range(i, N):\n mP = max(max(prices[j] - minBuy, 0), mP)\n maxProfits[i][j] = mP\n minBuy = min(minBuy, prices[j])\n\n trans = [maxProfits[0][i] for i in range(N)]\n for _ in range(k-1):\n prevTrans = trans\n trans = []\n mP = 0\n idx = 0\n val = prevTrans[idx] - prices[idx]\n for i in range(N):\n mP = max(prevTrans[idx] + maxProfits[idx][i], mP)\n newVal = prevTrans[i] - prices[i]\n if val < newVal:\n idx, val = i, newVal\n trans.append(mP)\n return trans[-1]","memory":"58935"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n maxProfits = {}\n N = len(prices)\n\n for i in range(N):\n maxProfits[i] = {}\n mP = 0\n minBuy = prices[i]\n for j in range(i, N):\n mP = max(max(prices[j] - minBuy, 0), mP)\n maxProfits[i][j] = mP\n minBuy = min(minBuy, prices[j])\n\n trans = [maxProfits[0][i] for i in range(N)]\n print(trans)\n for _ in range(k-1):\n prevTrans = trans\n trans = []\n mP = 0\n idx = 0\n val = prevTrans[idx] - prices[idx]\n for i in range(N):\n mP = max(prevTrans[idx] + maxProfits[idx][i], mP)\n newVal = prevTrans[i] - prices[i]\n if val < newVal:\n idx, val = i, newVal\n trans.append(mP)\n # print(i, idx, mP)\n # print(trans)\n return trans[-1]","memory":"58935"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n def destroy_directions(arr: List[int]):\n to_remove = set()\n for i in range(1, len(arr) - 1):\n if arr[i] == arr[i + 1]:\n to_remove.add(i)\n arr = [x for i, x in enumerate(arr) if i not in to_remove]\n to_remove = set()\n for i in range(1, len(arr) - 1):\n if arr[i - 1] <= arr[i] <= arr[i + 1] or arr[i + 1] <= arr[i] <= arr[i - 1]:\n to_remove.add(i)\n\n return [x for i, x in enumerate(arr) if i not in to_remove]\n\n # print(len(prices))\n prices = destroy_directions(prices)\n \n @lru_cache(None)\n def selling(start, rem):\n M, ans = prices[start], 0\n for sell in range(start + 1, len(prices)):\n if prices[sell] > M:\n ans = max(ans, prices[sell] - prices[start] + buying(sell + 1, rem - 1))\n M = prices[sell]\n return ans\n\n @lru_cache(None)\n def buying(start, rem):\n if rem == 0 or start >= len(prices) - 1: return 0\n return max(selling(start, rem), buying(start + 1, rem))\n\n return buying(0, k)","memory":"59781"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n maxProfits = {}\n N = len(prices)\n\n for i in range(N):\n maxProfits[i] = {}\n mP = 0\n minBuy = prices[i]\n for j in range(i, N):\n mP = max(max(prices[j] - minBuy, 0), mP)\n maxProfits[i][j] = mP\n minBuy = min(minBuy, prices[j])\n\n transactions = [[maxProfits[0][i] for i in range(N)]]\n for _ in range(k-1):\n transactions.append([])\n mP = 0\n idx = 0\n for i in range(N):\n profit = 0\n j = idx\n while j < i:\n if transactions[-2][j] + maxProfits[j][i] > profit:\n idx = j\n profit = transactions[-2][j] + maxProfits[j][i]\n j += 1\n mP = max(profit, mP)\n transactions[-1].append(mP)\n\n return transactions[-1][-1]","memory":"59781"},{"code":"def neg(b):\n if b != 0:\n return 0\n return 1\n\n\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = [\n [\n [[-float(\"inf\") for _ in range(3)] for _ in range(2)]\n for _ in range(k + 1)\n ]\n for _ in range(len(prices) + 1)\n ]\n for i in range(len(prices) + 1):\n prices_i = i - 1\n for num_transactions in range(k + 1):\n for holding in range(2):\n for action in range(3):\n if i == 0:\n if num_transactions == 0 and action == 0 and holding == 0:\n dp[i][num_transactions][holding][action] = 0\n continue\n if num_transactions == 0 and action == 2:\n continue\n if holding == 1 and action == 2:\n continue\n if holding == 0 and action == 1:\n continue\n match action:\n case 0: # Sit -> Last action was sit, buy or sell\n dp[i][num_transactions][holding][action] = max(\n dp[i - 1][num_transactions][holding][action],\n dp[i - 1][num_transactions][holding][1],\n dp[i - 1][num_transactions][holding][2],\n )\n case 1: # Buy -> Last action was sit or sell\n dp[i][num_transactions][holding][action] = -prices[\n prices_i\n ] + max(\n dp[i - 1][num_transactions][neg(holding)][0],\n dp[i - 1][num_transactions][neg(holding)][2],\n )\n case 2: # Sell -> Last action was sit or buy\n dp[i][num_transactions][holding][action] = prices[\n prices_i\n ] + max(\n dp[i - 1][num_transactions - 1][neg(holding)][0],\n dp[i - 1][num_transactions - 1][neg(holding)][1],\n )\n return max(\n max(max(max(sssdp) for sssdp in sub_sub_dp) for sub_sub_dp in sub_dp)\n for sub_dp in dp\n )\n","memory":"60628"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n if not prices or not k:\n return 0\n \n @cache\n def top_down(i, trans_left, holding):\n if trans_left == 0 or i == n:\n return 0\n\n if dp[i][trans_left][holding] >= 0:\n return dp[i][trans_left][holding]\n\n do_nothing = top_down(i+1, trans_left, holding)\n\n price = prices[i]\n if holding: # Buy stock\n dp[i][trans_left][holding] = max(price + top_down(i+1, trans_left-1, not holding), do_nothing)\n else: # Sell stock\n dp[i][trans_left][holding] = max(-price + top_down(i+1, trans_left, not holding), do_nothing)\n\n return dp[i][trans_left][holding]\n\n n = len(prices)\n dp = [[[-1] * (2) for _ in range(k+1)] for _ in range(n)]\n ans = top_down(0, k, False)\n\n return dp[0][k][0]","memory":"61474"},{"code":"from typing import List\n\n\nclass Solution:\n def __init__(self):\n self.memo = {}\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n return self.rec(prices, 0, 0, 0, k)\n\n def rec(self, prices: List[int], num_transactions: int, left: int, right: int, k: int) -> int:\n if num_transactions == k:\n return 0\n memo_key = (num_transactions, (left, right))\n if memo_key in self.memo:\n return self.memo[memo_key]\n\n while right < len(prices) - 1:\n profit = prices[right] - prices[left]\n if profit <= 0:\n left = right\n elif prices[right + 1] < prices[right]:\n res = max(\n profit + self.rec(prices, num_transactions + 1, right, right + 1, k),\n self.rec(prices, num_transactions, left, right + 1, k)\n )\n self.memo[memo_key] = res\n return res\n right += 1\n profit = prices[right] - prices[left]\n res = profit if profit > 0 else 0\n self.memo[memo_key] = res\n return res\n\n","memory":"62320"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n num_days = len(prices)\n\n dp = {}\n def _max_profit(day: int, transactions_remaining: int, holding: bool) -> int:\n if day >= num_days:\n return 0\n\n if transactions_remaining <= 0:\n return 0\n\n key = \",\".join((str(day), str(transactions_remaining), str(holding)))\n if key in dp:\n return dp[key]\n\n max_profit = max(\n _max_profit(day + 1, transactions_remaining, holding),\n _max_profit(day + 1, transactions_remaining - (1 if holding else 0), not holding) + \n (1 if holding else -1) * prices[day]\n )\n dp[key] = max_profit\n return max_profit\n\n \n return _max_profit(0, k, False)","memory":"63166"},{"code":"class Solution:\n \"\"\"\n First solution I came up with, it's accepted but very slow: beats 5.05%.\n The DP bottom up solution of the editorial beats 40%.\n \"\"\"\n def maxProfitHelper(self, prices, i, minPrice, attemptsLeft, memo):\n # It is tempting to not want to use attemptsLeft in the key of the memo table, but\n # the callers need to know how many attempts were used to calculate the solution\n # of a given prefix since they will have so many attempts left.\n if i >= len(prices) or attemptsLeft == 0:\n return 0\n elif (i, minPrice, attemptsLeft) in memo:\n return memo[(i, minPrice, attemptsLeft)]\n\n currentPrice = prices[i]\n if currentPrice <= minPrice:\n memo[(i, minPrice, attemptsLeft)] = self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft, memo)\n elif i+1 < len(prices)-1 and prices[i+1] > currentPrice:\n memo[(i, minPrice, attemptsLeft)] = self.maxProfitHelper(prices, i+1, minPrice, attemptsLeft, memo)\n else:\n memo[(i, minPrice, attemptsLeft)] = max(\n self.maxProfitHelper(prices, i+1, minPrice, attemptsLeft, memo),\n self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft-1, memo) + currentPrice - minPrice)\n\n return memo[(i, minPrice, attemptsLeft)]\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo = {}\n return self.maxProfitHelper(prices, 1, prices[0], k, memo)\n\n","memory":"64013"},{"code":"class Solution:\n \"\"\"\n First solution I came up with, it's accepted but very slow: beats 5.05%.\n The DP bottom up solution of the editorial beats 40%.\n \"\"\"\n def maxProfitHelper(self, prices, i, minPrice, attemptsLeft, memo):\n # It is tempting to not want to use attemptsLeft in the key of the memo table, but\n # the callers need to know how many attempts were used to calculate the solution\n # of a given prefix since they will have so many attempts left.\n if i >= len(prices) or attemptsLeft == 0:\n return 0\n elif (i, minPrice, attemptsLeft) in memo:\n return memo[(i, minPrice, attemptsLeft)]\n\n currentPrice = prices[i]\n if currentPrice <= minPrice:\n memo[(i, minPrice, attemptsLeft)] = self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft, memo)\n elif i+1 < len(prices)-1 and prices[i+1] > currentPrice:\n memo[(i, minPrice, attemptsLeft)] = self.maxProfitHelper(prices, i+1, minPrice, attemptsLeft, memo)\n else:\n memo[(i, minPrice, attemptsLeft)] = max(\n self.maxProfitHelper(prices, i+1, minPrice, attemptsLeft, memo),\n self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft-1, memo) + currentPrice - minPrice)\n\n return memo[(i, minPrice, attemptsLeft)]\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo = {}\n return self.maxProfitHelper(prices, 1, prices[0], k, memo)\n\n","memory":"64859"},{"code":"class Solution:\n \"\"\"\n First solution I came up with, it's accepted but very slow: beats 5.05%.\n The DP bottom up solution of the editorial beats 40%.\n \"\"\"\n def maxProfitHelper(self, prices, i, minPrice, attemptsLeft, memo):\n # It is tempting to not want to use attemptsLeft in the key of the memo table, but\n # the callers need to know how many attempts were used to calculate the solution\n # of a given prefix since they will have so many attempts left.\n if i >= len(prices) or attemptsLeft == 0:\n return 0\n elif (i, minPrice, attemptsLeft) in memo:\n return memo[(i, minPrice, attemptsLeft)]\n\n currentPrice = prices[i]\n if currentPrice <= minPrice:\n memo[(i, minPrice, attemptsLeft)] = self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft, memo)\n elif i+1 < len(prices)-1 and prices[i+1] > currentPrice:\n # This is an optimization based on the fact that we don't need to sell if we aren't at a peak and we won't\n # get a better solution than if we use the solution that sells at the peak, which is going to be a subproblem\n # of the current problem.\n # But it doesn't change the runtime when I submit it unfortunately.\n memo[(i, minPrice, attemptsLeft)] = self.maxProfitHelper(prices, i+1, minPrice, attemptsLeft, memo)\n else:\n memo[(i, minPrice, attemptsLeft)] = max(\n self.maxProfitHelper(prices, i+1, minPrice, attemptsLeft, memo),\n self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft-1, memo) + currentPrice - minPrice)\n\n return memo[(i, minPrice, attemptsLeft)]\n\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo = {}\n return self.maxProfitHelper(prices, 1, prices[0], k, memo)\n\n","memory":"64859"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n\n def helper(bought=False,i=0,k=2):\n if i==N-1:\n if bought:\n return prices[i]\n else:\n return 0\n if k==0 and bought==False:\n return 0\n STORE = f\"{bought},{i},{k}\"\n if d.get(STORE, None)!=None:\n return d[STORE]\n ans1 = ans2 = 0\n if bought: # option to sell or not\n ans1 = prices[i] + helper(False,i+1,k)\n ans2 = helper(bought,i+1,k)\n else: # option to buy or not\n ans1 = helper(bought,i+1,k)\n ans2 = -prices[i]+helper(True,i+1,k-1)\n d[STORE] = max(ans1, ans2)\n return d[STORE]\n \n N = len(prices)\n d = {}\n return helper(k=k)\n ","memory":"65705"},{"code":"\"\"\"\n[3,2,6,5,10,3]\n\ngoing down I think always makes sense for a buy\nif it's less than you can just make up that profit and it'll be greater than what you otherwise would have had\n\n\n-in order to make money you must sell\n- looking for the biggest differences that exist\n- for every number, you do or don't buy it / sell if it's lower than your buy until you hit k\n\n[3, 6], [0, 3]\n[3, 5], [0 ,3]\n[2, 6], [0, 3]\nhow could we more efficiently know that 2-6 was going to be better than 3-6\n- when you are on a sell operation, you can iterate until you find the max\n- when you are on buy operation, you can iterate until you find the min\n\n\n3, 2, 1, 3, 5, 4\n\"\"\"\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n prices2 = []\n l, r = 0, 1\n\n while l < len(prices) and r < len(prices):\n while (l < len(prices) - 1) and prices[l] > prices[l + 1]:\n l += 1\n r = l + 1\n prices2.append(prices[l])\n while (r < len(prices) - 1) and prices[r] < prices[r + 1]:\n r += 1\n if r < len(prices):\n prices2.append(prices[r])\n l = r + 1\n\n cache = {}\n def search(idx, buying, t):\n if idx == len(prices2) or t == k:\n return 0\n \n if (idx, buying, t) in cache:\n return cache[(idx, buying, t)]\n \n if buying:\n result = max(\n search(idx + 1, not buying, t) - prices2[idx],\n search(idx + 1, buying, t),\n )\n else:\n result = max(\n search(idx + 1, not buying, t + 1) + prices2[idx],\n search(idx + 1, buying, t),\n )\n \n cache[(idx, buying, t)] = result\n return result\n \n return search(0, True, 0)\n\n \n\n\n ","memory":"66551"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n l = [prices[0]]\n for i in range(1,len(prices)-1):\n if prices[i]>=prices[i-1] and prices[i]>=prices[i+1]:\n l.append(prices[i])\n elif prices[i]<=prices[i-1] and prices[i]<=prices[i+1]:\n l.append(prices[i])\n l.append(prices[-1])\n prices = l\n @cache\n def dp(x,have,leave):\n ans = 0\n if x < len(prices):\n if have:\n ans = max(ans,prices[x]+dp(x+1,False,leave-1))\n elif leave:\n ans = max(ans,-prices[x]+dp(x+1,True,leave))\n ans = max(ans,dp(x+1,have,leave))\n return ans\n return dp(0,False,k)","memory":"67398"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n cache = {}\n # key = index_action_k\n \n def helper(idx, k, can_buy):\n if idx >= n or k <= 0:\n return 0\n \n key = f\"{idx}_{can_buy}_{k}\"\n if key in cache:\n return cache[key]\n \n if can_buy:\n cache[key] = max(-prices[idx] + helper(idx+1, k, not can_buy), helper(idx+1, k, can_buy))\n else:\n cache[key] = max(prices[idx] + helper(idx+1, k-1, not can_buy), helper(idx+1, k, can_buy))\n return cache[key]\n\n return helper(0, k, True)","memory":"68244"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n N = len(prices)\n \n @cache\n def buy(index, limit):\n if index == N:\n return 0\n \n tobe = float('-inf')\n\n if limit > 0:\n tobe = sell(index + 1, limit - 1) - prices[index]\n nottobe = buy(index + 1, limit)\n\n return max(nottobe, tobe)\n\n @cache\n def sell(index, limit):\n if index == N:\n return 0\n\n tobe = sell(index + 1, limit)\n nottobe = buy(index, limit) + prices[index]\n\n return max(tobe, nottobe)\n\n return buy(0, k)","memory":"69090"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # ag prices\n memo = {}\n def dp(i, trades, hold, holdStock):\n if trades == k or i == len(prices):\n return 0\n # hold, sell, buy\n if (i, trades, hold) not in memo:\n nothing = dp(i + 1, trades, hold, holdStock)\n buy = 0\n sell = 0\n if hold == 0:\n buy = -prices[i] + dp(i + 1, trades, 1, i)\n else:\n if (prices[i] > prices[holdStock]):\n sell = prices[i] + dp(i + 1, trades + 1, 0, -1)\n memo[(i, trades, hold)] = max(nothing, buy, sell)\n return memo[(i, trades, hold)]\n return dp(0, 0, 0, -1)\n\n\n ","memory":"69936"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n @cache\n def buy(i, k):\n if i >= len(prices) - 1 or k == 0:\n return 0\n return max(0, buy(i + 1, k), -prices[i] + sell(i + 1, k))\n \n @cache\n def sell(i, k):\n if i >= len(prices):\n return 0\n return max(0, sell(i + 1, k), prices[i] + buy(i + 1, k - 1))\n\n return buy(0, k)","memory":"70783"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n if n==1:\n return 0\n\n @lru_cache(maxsize=None)\n def dp(i, j, bought):\n if i>=n:\n return 0\n if j==0:\n return 0\n \n if bought:\n return max(dp(i+1, j, bought), prices[i]+dp(i, j-1, 0))\n else:\n return max(dp(i+1, j, bought), -prices[i]+dp(i, j, 1))\n\n # dp = [[[0 for _ in range(k+1)] for _ in range(n)] for _ in range(2)]\n # dp[1][0]\n # for i in range(n):\n # for j in range(k+1):\n # for sold in range(2):\n # dp[sold][i][j] = dp[sold][i-1][j] if i-1 else float('-inf')\n # if sold:\n # dp[1][i][j] = max(dp[sold][i][j], -1*prices[i]+dp[0][i][j-1]) if j else float('-inf')\n # else:\n # dp[0][i][j] = max(dp[0][i][j], prices[i]+dp[1][i-1][j-1]) if j else 0\n\n return dp(0, k, 0)\n\n return dp[0][n-1][k]\n\n\n# dp(i, j) max profit from prices[0..i] with <=j transctations \n# dp(0, j) = 0\n# dp(1, j) = 0 if j==0 or max(0, prices[1]-prices[0]) if j>=1 \n# dp(i, 0) = 0\n# dp(i, j) = max(dp(i-1, j), nums[i]-nums[i-1]+dp(i-2, j-1) if j>=1 ","memory":"71629"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo1 = {}\n memo0 = {}\n def f_1(d, i):\n # i-times to hold/buy stock at day: d \n # return: earing\n if d == 0 and i <= k:\n return - prices[d]\n\n if i > k or d < 0:\n return - inf\n \n \n if (d, i) in memo1:\n return memo1[(d, i)]\n\n ans = max( f_1( d-1 , i) , f_0(d-1, i) - prices[d])\n memo1[(d, i)] = ans\n\n return ans\n \n def f_0(d, i):\n # i-times rest to sell/not hold stock at day: d \n # return: earing\n\n if d == 0 and i <= k:\n return 0\n\n if i > k or d < 0:\n return -inf\n \n if (d, i) in memo0:\n return memo0[(d, i)]\n \n ans = max( f_1(d-1 , i + 1) + prices[d], f_0(d-1, i))\n memo0[(d, i)] = ans\n \n return ans\n\n return f_0(len(prices) - 1 , 0)#max(f_0(len(prices) - 1 , i) for i in range(k + 1))\n \n \n\n ","memory":"72475"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo1 = {}\n memo0 = {}\n def f_1(d, i):\n # i-times to hold/buy stock at day: d \n # return: earing\n if d == 0 and i <= k:\n return - prices[d]\n\n if i > k or d < 0:\n return - inf\n \n \n if (d, i) in memo1:\n return memo1[(d, i)]\n\n ans = max( f_1( d - 1 , i) , f_0(d - 1, i) - prices[d])\n memo1[(d, i)] = ans\n\n return ans\n \n def f_0(d, i):\n # i-times rest to sell/not hold stock at day: d \n # return: earing\n\n if d == 0 and i <= k:\n return 0\n\n if i > k or d < 0:\n return -inf\n \n if (d, i) in memo0:\n return memo0[(d, i)]\n \n ans = max( f_1(d-1 , i + 1) + prices[d], f_0(d-1, i))\n memo0[(d, i)] = ans\n \n return ans\n\n return f_0(len(prices) - 1 , 0)#max(f_0(len(prices) - 1 , i) for i in range(k + 1))\n \n \n\n ","memory":"72475"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n @cache\n def buy(i, k):\n if k == 0 or i >= len(prices):\n return 0\n return max(buy(i + 1, k), sell(i + 1, k - 1) - prices[i])\n\n @cache\n def sell(i, k):\n if i >= len(prices):\n return 0\n return max(sell(i + 1, k), buy(i + 1, k) + prices[i])\n \n return buy(0, k)","memory":"73321"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n @cache\n def dp(i, h, k):\n if i >= n or not k: return 0\n best = dp(i + 1, h, k)\n if h: best = max(best, dp(i, False, k - 1) + prices[i])\n else: best = max(best, dp(i + 1, True, k) - prices[i])\n return best\n return dp(0, False, k)","memory":"74168"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo1 = {}\n memo0 = {}\n def f_1(d, i):\n # i-times hold/buy stock at day: d \n # return: earing\n if d == 0 and i == 1:\n return - prices[d]\n\n if d < i:\n return - inf\n\n if i <= 0:\n return 0\n \n if (d, i) in memo1:\n return memo1[(d, i)]\n ans = max( f_1( d-1 , i) , f_0(d-1, i - 1) - prices[d])\n memo1[(d, i)] = ans\n return ans\n \n def f_0(d, i):\n # i-times sell/not hold stock at day: d \n # return: earing\n if d == 0:\n return 0\n if i <= 0:\n return 0\n if (d, i) in memo0:\n return memo0[(d, i)]\n \n ans = max( f_1(d-1 , i) + prices[d], f_0(d-1, i))\n memo0[(d, i)] = ans\n return ans\n return max(f_0(len(prices) - 1 , i) for i in range(k + 1))\n \n \n\n ","memory":"75014"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo1 = {}\n memo0 = {}\n def f_1(d, i):\n # i-times hold/buy stock at day: d \n # return: earing\n if d == 0 and i == 1:\n return - prices[d]\n\n if d < i:\n return - inf\n\n # if i <= 0:\n # return 0\n \n if (d, i) in memo1:\n return memo1[(d, i)]\n\n ans = max( f_1( d-1 , i) , f_0(d-1, i - 1) - prices[d])\n memo1[(d, i)] = ans\n\n return ans\n \n def f_0(d, i):\n # i-times sell/not hold stock at day: d \n # return: earing\n\n if d == 0:\n return 0\n if i <= 0:\n return 0\n if (d, i) in memo0:\n return memo0[(d, i)]\n \n ans = max( f_1(d-1 , i) + prices[d], f_0(d-1, i))\n memo0[(d, i)] = ans\n return ans\n\n return max(f_0(len(prices) - 1 , i) for i in range(k + 1))\n \n \n\n ","memory":"75014"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo = {}\n def helper(index, k, i_low):\n # key = str(index) + \":\" + str(k) + \":\" + str(low)\n key = index * 1000 + k + i_low * 1000000\n if key in memo:\n return memo[key]\n\n if k < 0:\n return -float('inf')\n\n if index == len(prices):\n return 0\n\n if prices[index] > prices[i_low]:\n memo[key] = max(prices[index] - prices[i_low] + helper(index + 1, k-1, index), helper(index + 1, k, i_low))\n else:\n memo[key] = helper(index+1, k, index)\n\n return memo[key]\n\n return helper(1, k, 0)\n \n \n","memory":"75860"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # backtracking + memo\n # there are two states we can be in, buying or selling\n # if we are in the buying state, we try each possible option of buying\n # we then switch to sell state\n # we try each possible option of selling (that gives a profit)\n # use memo on isbuy,i,buysRemaining\n \n buyMemo = defaultdict(int) # (i,buysLeft) : best when buying\n sellMemo = defaultdict(int) # (i,buysLeft) : best when selling\n def buy(i,buysLeft):\n if(i,buysLeft) in buyMemo:\n return buyMemo[(i,buysLeft)]\n if i == len(prices) or buysLeft==0:\n return 0\n \n bestBuyingToday = sell(i+1,buysLeft-1) - prices[i]\n bestNotBuyingtoday = buy(i+1,buysLeft)\n buyMemo[(i,buysLeft)] = max(bestBuyingToday, bestNotBuyingtoday)\n return buyMemo[(i,buysLeft)]\n \n \n def sell(i,buysLeft):\n if(i,buysLeft) in sellMemo:\n return sellMemo[(i,buysLeft)]\n if i == len(prices):\n return 0\n \n bestSellingToday = buy(i+1,buysLeft) + prices[i]\n bestNotSellingToday = sell(i+1,buysLeft)\n sellMemo[(i,buysLeft)] = max(bestSellingToday, bestNotSellingToday)\n return sellMemo[(i,buysLeft)]\n \n \n return buy(0,k)","memory":"76706"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n N = len(prices)\n buyDp = {}\n sellDp = {}\n # on this day, we want to buy a stock what's the most profit we can make?\n def buy(curDay, kLeft): \n if curDay == N: return 0\n if (curDay, kLeft) in buyDp: \n return buyDp[(curDay, kLeft)]\n\n profitBuyingToday = 0\n if kLeft > 0:\n profitBuyingToday = sell(curDay + 1, kLeft - 1) - prices[curDay]\n profitNotBuyingToday = buy(curDay + 1, kLeft)\n\n buyDp[(curDay,kLeft)] = max(profitBuyingToday, profitNotBuyingToday)\n return buyDp[(curDay,kLeft)]\n \n def sell(curDay, kLeft):\n if curDay == N: return 0\n if (curDay, kLeft) in sellDp: \n return sellDp[(curDay, kLeft)]\n \n profitSellingToday = buy(curDay + 1, kLeft) + prices[curDay]\n profitNotSellingToday = sell(curDay + 1, kLeft)\n\n sellDp[(curDay, kLeft)] = max(profitSellingToday, profitNotSellingToday)\n return sellDp[(curDay, kLeft)]\n\n return buy(0, k)\n","memory":"77553"},{"code":"# class Solution:\n# def maxProfit(self, k: int, prices: List[int]) -> int:\n# memo1 = {}\n# memo0 = {}\n# def f_1(d, i):\n# # i-times to hold/buy stock at day: d \n# # return: earing\n# if d == 0 and i <= k:\n# return - prices[d]\n\n# if i > k or d < 0:\n# return - inf\n \n \n# if (d, i) in memo1:\n# return memo1[(d, i)]\n\n# ans = max( f_1( d - 1 , i) , f_0(d - 1, i) - prices[d])\n# memo1[(d, i)] = ans\n\n# return ans\n \n# def f_0(d, i):\n# # i-times rest to sell/not hold stock at day: d \n# # return: earing\n\n# if d == 0 and i <= k:\n# return 0\n\n# if i > k or d < 0:\n# return -inf\n \n# if (d, i) in memo0:\n# return memo0[(d, i)]\n \n# ans = max( f_1(d-1 , i + 1) + prices[d], f_0(d-1, i))\n# memo0[(d, i)] = ans\n \n# return ans\n\n# return f_0(len(prices) - 1 , 0)\n\nclass Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo = {}\n def f(n, d, hold):\n # n: n-times(<= k) rest to sell/not hold stock at day: d \n # hold = 0, 1, whether hold the stock or not\n if n > k or d < 0:\n return - inf\n if d == 0 and n <= k and hold == 1:\n return -prices[0]\n \n if d == 0 and n <= k and hold == 0:\n return 0\n if (n, d, hold) in memo:\n return memo[(n,d,hold)]\n if hold == 1:\n ans = max(f(n,d-1,1), f(n, d-1, 0) - prices[d])\n if hold == 0:\n ans = max(f(n,d-1,0), f(n+1, d-1, 1)+ prices[d])\n memo[(n,d,hold)] = ans\n return ans\n return f(0, len(prices)-1, 0)\n \n \n ","memory":"78399"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n \n @cache\n def dpb(k, i):\n if k == 0 or i >= n:\n return 0\n return max(dps(k, i+1) - prices[i], dpb(k, i+1))\n \n @cache\n def dps(k, i):\n if k == 0 or i >= n:\n return 0\n return max(dpb(k-1, i+1) + prices[i], dps(k, i+1))\n \n return dpb(k, 0)","memory":"79245"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n # at most k trasnactions \n\n @lru_cache(None)\n def DFS(i,hold,count):\n if count==0:\n return 0\n \n if i==0:\n if hold==True:\n return -prices[i]\n else:\n return 0\n \n value=0\n if hold==True:\n prev_hold=DFS(i-1,True,count)\n buy=DFS(i-1,False,count-1)-prices[i]\n value=max(prev_hold,buy)\n else:\n prev_nothold=DFS(i-1,False,count)\n sale=DFS(i-1,True,count)+prices[i]\n\n value=max(prev_nothold,sale)\n return value\n \n return DFS(len(prices)-1,False,k)\n ","memory":"80091"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n \n @cache\n\n def dfs(day, most, hold):\n if day < 0:\n if hold:\n return -inf\n else:\n return 0\n if most < 0:\n return -inf\n\n if hold:\n return max(dfs(day - 1, most, True), dfs(day - 1, most, False ) - prices[day])\n\n return max(dfs(day - 1, most, False), dfs(day - 1, most - 1, True) + prices[day])\n\n return dfs(len(prices) - 1, k, False)\n","memory":"80091"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = {}\n\n def dfs(i, t, buying):\n if t < 0:\n return 0\n if i == len(prices):\n return 0\n if (i, t, buying) in dp:\n return dp[(i, t, buying)]\n \n if not buying:\n dp[(i, t, buying)] = max(dfs(i + 1, t, False), dfs(i + 1, t, True) + prices[i])\n else:\n dp[(i, t, buying)] = max(dfs(i + 1, t, True), dfs(i + 1, t - 1, False) - prices[i])\n return dp[(i, t, buying)]\n return dfs(0, k, True)","memory":"80938"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n memo = {}\n def dp(next_day, transaction_remains, incomplete_buy):\n # return max profit given the day remains and transaction remains\n if next_day == len(prices):\n return 0\n if (next_day, transaction_remains, incomplete_buy) not in memo:\n # we can sell or buy or do nothing\n max_profit = 0\n # noop\n max_profit = max(max_profit, dp(next_day+1, transaction_remains,incomplete_buy))\n # buy at next_day\n if transaction_remains >= 1 and (incomplete_buy is False):\n max_profit = max(max_profit, -prices[next_day] + dp(next_day+1, transaction_remains-1, True))\n # sell at next_day\n if incomplete_buy is True:\n max_profit = max(max_profit, prices[next_day] + dp(next_day+1, transaction_remains, False))\n memo[(next_day, transaction_remains, incomplete_buy)] = max_profit\n return memo[(next_day, transaction_remains, incomplete_buy)]\n return dp(0, k, False)","memory":"80938"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n @cache\n def dp(i, holding, k):\n if i == len(prices) or k < 0:\n return 0\n \n if holding:\n return max(dp(i+1, holding, k), dp(i+1, False, k)+prices[i])\n else:\n return max(dp(i+1, holding, k), dp(i+1, True, k-1)-prices[i])\n \n return dp(0, False, k)\n","memory":"81784"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n dp = {}\n\n @cache\n def dfs(i, transaction, buying):\n if transaction < 0:\n return -inf\n if i == len(prices):\n return 0 if buying else -inf\n \n if not buying:\n return max(dfs(i + 1, transaction, False), dfs(i + 1, transaction, True) + prices[i])\n return max(dfs(i + 1, transaction, True), dfs(i + 1, transaction - 1, False) - prices[i])\n\n return dfs(0, k, True)","memory":"81784"},{"code":"class Solution:\n def maxProfit(self, k: int, A: List[int]) -> int:\n BUY, SELL = 0, 1\n\n @cache\n def dfs(index, k, ttype = BUY):\n if k == 0:\n return 0\n \n if index == len(A):\n return 0\n \n if ttype == BUY:\n dont = dfs(index+1, k, BUY)\n buy = -A[index] + dfs(index+1, k, SELL)\n return max(buy, dont)\n else:\n dont = dfs(index+1, k, SELL)\n sell = A[index] + dfs(index+1, k-1, BUY)\n return max(dont, sell)\n \n return dfs(0, k)","memory":"82630"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n = len(prices)\n # hold - 1, not hold - 0\n # dp[1][i] = max(dp[0][i + 2] + price, dp[1][i + 1])\n # dp[0][i] = max(dp[1][i + 1] - price, dp[0][i + 1])\n # dp_hold = [[0 for _ in range(k + 1)] for _ in range(n + 1)]\n # dp_nohold = [[0 for _ in range(k + 1)] for _ in range(n + 1)]\n # for i in range(n - 1, -1, -1):\n # for times in range(1, k + 1):\n # print(i, times)\n # dp_hold[i][times] = max(dp_nohold[i + 1][times - 1] + prices[i], dp_hold[i + 1][times])\n # dp_nohold[i][times] = max(dp_hold[i + 1][times] - prices[i], dp_nohold[i + 1][times])\n @cache\n def dfs(i, hold, k):\n if i >= n:\n return 0\n\n if hold:\n # can sell\n if k > 0:\n return max(dfs(i + 1, False, k - 1) + prices[i], dfs(i + 1, True, k))\n else:\n return dfs(i + 1, hold, k)\n else:\n # can not sell\n return max(dfs(i + 1, False, k), dfs(i + 1, True, k) - prices[i])\n return dfs(0, False, k)","memory":"82630"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n n=len(prices)\n if not prices or k==0:\n return 0\n memo={}\n def dfs(day,transaction_left,holding):\n if day==n or transaction_left==0:\n return 0\n if (day,transaction_left,holding) in memo:\n return memo[(day,transaction_left,holding)]\n if holding:\n sell=prices[day]+dfs(day+1,transaction_left-1,False)\n hold=dfs(day+1,transaction_left,True)\n result=max(sell,hold)\n else:\n buy=-prices[day]+dfs(day+1,transaction_left,True)\n skip=dfs(day+1,transaction_left,False)\n result=max(buy,skip)\n memo[(day,transaction_left,holding)]=result\n return result\n return dfs(0,k,False)","memory":"83476"},{"code":"class Solution:\n def maxProfit(self, k: int, prices: List[int]) -> int:\n cache = {}\n stock = 0\n def profit(day, stock, i):\n if (day,stock,i) in cache:\n return cache[(day,stock,i)]\n if day==len(prices):\n return 0\n if stock==0:\n cache[(day,stock,i)] = max((profit(day+1,1,i+1)-prices[day]) if i<k else -1e9, profit(day+1,0,i))\n else:\n cache[(day,stock,i)] = max(profit(day+1,0,i)+prices[day], profit(day+1,1,i))\n return cache[(day,stock,i)]\n return profit(0,0,0)","memory":"83476"}],"string":"[\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [0] * (2 * k + 1)\\n for i in range(1, 2 * k + 1, 2):\\n dp[i] = -prices[0]\\n \\n for i in range(1, len(prices)):\\n for m in range(1, 2 * k + 1):\\n if m % 2 == 1:\\n dp[m] = max(dp[m], dp[m - 1] - prices[i])\\n else:\\n dp[m] = max(dp[m], dp[m - 1] + prices[i])\\n \\n return dp[2 * k]\",\n \"memory\": \"16623\"\n },\n {\n \"code\": \"import sys\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n costs = [sys.maxsize] * k\\n profits = [0] * k\\n for index, price in enumerate(prices):\\n costs[0] = min(costs[0], price)\\n profits[0] = max(profits[0], price-costs[0])\\n for i in range(1, k):\\n costs[i] = min(costs[i], price - profits[i-1])\\n profits[i] = max(profits[i], price - costs[i])\\n return profits[k-1]\",\n \"memory\": \"16623\"\n },\n {\n \"code\": \"class DoubleLinkListNode:\\n def __init__(self, ind, pre = None, next = None):\\n self.ind = ind\\n self.pre = pre if pre else self\\n self.next = next if next else self\\n\\nclass Solution:\\n def MinMaxList(self, arr: List[int]) -> List[int]:\\n n = len(arr)\\n if n == 0:\\n return []\\n sign = -1\\n res = [9999]\\n for num in arr:\\n if num * sign > res[-1] * sign:\\n res[-1] = num\\n else:\\n res.append(num)\\n sign *= -1\\n if len(res) & 1:\\n res.pop()\\n return res\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n newP = self.MinMaxList(prices)\\n n = len(newP)\\n m = n // 2\\n res = 0\\n for i in range(m):\\n res += newP[i*2+1] - newP[i*2]\\n if m <= k:\\n return res\\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\\n NodeList = [DoubleLinkListNode(0, head)]\\n for i in range(1, n):\\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\\n NodeList[i-1].next = NodeList[i]\\n NodeList[n-1].next = tail\\n head.next, tail.pre = NodeList[0], NodeList[n-1]\\n heap = []\\n for i in range(n-1):\\n if i&1:\\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\\n else:\\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\\n while m > k:\\n loss, i, j, t = heappop(heap)\\n if NodeList[i] == None or NodeList[j] == None: continue\\n m -= 1\\n res -= loss\\n nodei, nodej = NodeList[i], NodeList[j]\\n nodel, noder = nodei.pre, nodej.next\\n l, r = nodel.ind, noder.ind\\n valL, valR = newP[l], newP[r]\\n noder.pre, nodel.next = nodel, noder\\n NodeList[i], NodeList[j] = None, None\\n if t == 0:\\n heappush(heap, [valR - valL, l, r, 1])\\n elif l != -1 and r != -1:\\n heappush(heap, [valL - valR, l, r, 0])\\n return res\",\n \"memory\": \"17469\"\n },\n {\n \"code\": \"class DoubleLinkListNode:\\n def __init__(self, ind, pre = None, next = None):\\n self.ind = ind\\n self.pre = pre if pre else self\\n self.next = next if next else self\\n\\nclass Solution:\\n def MinMaxList(self, arr: List[int]) -> List[int]:\\n n = len(arr)\\n if n == 0:\\n return []\\n sign = -1\\n res = [9999]\\n for num in arr:\\n if num * sign > res[-1] * sign:\\n res[-1] = num\\n else:\\n res.append(num)\\n sign *= -1\\n if len(res) & 1:\\n res.pop()\\n return res\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n newP = self.MinMaxList(prices)\\n n = len(newP)\\n m = n // 2\\n res = 0\\n for i in range(m):\\n res += newP[i*2+1] - newP[i*2]\\n if m <= k:\\n return res\\n head, tail = DoubleLinkListNode(-1), DoubleLinkListNode(-1)\\n NodeList = [DoubleLinkListNode(0, head)]\\n for i in range(1, n):\\n NodeList.append(DoubleLinkListNode(i, NodeList[-1]))\\n NodeList[i-1].next = NodeList[i]\\n NodeList[n-1].next = tail\\n head.next, tail.pre = NodeList[0], NodeList[n-1]\\n heap = []\\n for i in range(n-1):\\n if i&1:\\n heappush(heap, [newP[i] - newP[i+1], i, i+1, 0])\\n else:\\n heappush(heap, [newP[i+1] - newP[i], i, i+1, 1])\\n while m > k:\\n loss, i, j, t = heappop(heap)\\n if NodeList[i] == None or NodeList[j] == None: continue\\n m -= 1\\n res -= loss\\n nodei, nodej = NodeList[i], NodeList[j]\\n nodel, noder = nodei.pre, nodej.next\\n l, r = nodel.ind, noder.ind\\n valL, valR = newP[l], newP[r]\\n noder.pre, nodel.next = nodel, noder\\n NodeList[i], NodeList[j] = None, None\\n if t == 0:\\n heappush(heap, [valR - valL, l, r, 1])\\n elif l != -1 and r != -1:\\n heappush(heap, [valL - valR, l, r, 0])\\n return res\",\n \"memory\": \"17469\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # dp[i][k1]: the max balances on the END of i-th day with at most (k1+1) transactions.\\n # dp[i][k1] = max(dp[i - 1][k1], dp[j - 1][k1 - 1] + prices[i] - prices[j] for j in range(i))\\n # Reference: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/solutions/306282/different-dp-python-solutions-with-thinking-process\\n n = len(prices)\\n if n < 2: return 0\\n dp = [[0] * (k + 1) for _ in range(n)]\\n for k1 in range(1, k + 1):\\n local_max = -prices[0]\\n for i in range(1, n):\\n dp[i][k1] = max(dp[i - 1][k1], prices[i] + local_max)\\n local_max = max(local_max, dp[i - 1][k1 - 1] - prices[i])\\n return dp[-1][-1]\\n \",\n \"memory\": \"18315\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n cache = [[0 for _ in range(k + 1)] for _ in range(n)]\\n for i in range(n):\\n for j in range(1, k + 1):\\n cache[i][j] = max(cache[i - 1][j], max([0] + [cache[l][j - 1] - prices[l] + prices[i] for l in range(i)]))\\n # print(i, j, cache)\\n return cache[-1][-1]\",\n \"memory\": \"18315\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices) \\n tbl = [[0]*n for i in range(2*k)]\\n for i in range(2*k):\\n for j in range(i,n):\\n if i==0:\\n if j==0:\\n tbl[i][j] = -prices[j]\\n else:\\n tbl[i][j] = max(tbl[i][j-1], -prices[j])\\n else:\\n if j==i:\\n sign = 2*(i%2)-1\\n tbl[i][j] = sign*prices[j] + tbl[i-1][j-1]\\n else:\\n tbl[i][j] = max(tbl[i][j-1], sign*prices[j] + tbl[i-1][j-1])\\n ans = 0\\n for i in range(2*k):\\n ans = max(ans, tbl[i][-1])\\n return ans\",\n \"memory\": \"19161\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n prices_len = len(prices)\\n states = 2*k + 1\\n dp = [[float('-inf')] * (states) for _ in range(prices_len)]\\n maxProfit = 0\\n\\n for i in range(prices_len):\\n dp[i][0] = 0\\n for i in range(prices_len):\\n num = prices[i]\\n for j in range(states-1, 0, -1): \\n #can_buy state\\n if not j % 2:\\n dp[i][j] = max(dp[i-1][j], dp[i-1][j-1] + num)\\n maxProfit = max(maxProfit, dp[i][j])\\n # holding state\\n else:\\n dp[i][j] = max(dp[i-1][j], dp[i-1][j-1] - num)\\n\\n return maxProfit\\n\",\n \"memory\": \"19161\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n '''\\n memo = [ [ [-1] * (k+1) for _ in range(2) ] for _ in range(n) ]\\n def memoization(idx, canBuy, transaction):\\n # base cases\\n if idx == n or transaction == 0:\\n return 0\\n if memo[idx][canBuy][transaction] != -1:\\n return memo[idx][canBuy][transaction]\\n\\n # main working\\n if canBuy:\\n profit = max(memoization(idx+1, 1, transaction), \\n -prices[idx] + memoization(idx+1, 0, transaction))\\n else:\\n profit = max( memoization(idx+1, 0, transaction), \\n prices[idx] + memoization(idx+1, 1, transaction-1) )\\n \\n memo[idx][canBuy][transaction] = profit\\n return memo[idx][canBuy][transaction]\\n \\n # trying memoization\\n return memoization(0,1,k)\\n '''\\n\\n\\n\\n def tabulation():\\n dp = [ [ [0] * (k+1) for _ in range(2) ] for __ in range(n+1) ]\\n \\n # base case 1 - no transactions left (ie: 0) - not req as initialized with 0 alr\\n # base case 2 - idx reaches len(prices) (ie: n) - not req as initialized with 0 alr\\n\\n # filling the table\\n for idx in range(n-1, -1, -1):\\n for canBuy in range(2):\\n for transaction in range(1, k+1):\\n if canBuy == 1:\\n dp[idx][1][transaction] = max(dp[idx+1][1][transaction], \\n -prices[idx] + dp[idx+1][0][transaction])\\n else:\\n dp[idx][0][transaction] = max(dp[idx+1][0][transaction], \\n prices[idx] + dp[idx+1][1][transaction-1])\\n return dp[0][1][k]\\n \\n # trying tabulation\\n return tabulation()\",\n \"memory\": \"20008\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfitUtil(self,index,buy,cap,prices,dp):\\n if cap==0:\\n return 0\\n\\n if index == len(prices):\\n return 0\\n\\n if dp[index][buy][cap] != -1:\\n return dp[index][buy][cap]\\n\\n profit = 0\\n if buy==0: #BUY THE STOCK\\n profit = max(self.maxProfitUtil(index+1,0,cap,prices,dp),\\n self.maxProfitUtil(index+1,1,cap,prices,dp)-prices[index])\\n else: #SELL THE STOCK\\n profit = max(self.maxProfitUtil(index+1,1,cap,prices,dp),\\n self.maxProfitUtil(index+1,0,cap-1,prices,dp)+prices[index])\\n\\n dp[index][buy][cap] = profit\\n return dp[index][buy][cap]\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [[[-1]*(k+1) for _ in range(2)] for _ in range(len(prices))]\\n return self.maxProfitUtil(0,0,k,prices,dp)\",\n \"memory\": \"20008\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # profit[k][m] - k times sell + bought k + 1 position, m position, best profit \\n profit = []\\n m = len(prices)\\n curr_prof = 0\\n \\n \\n for i in range(k+1):\\n profit.append([0] * m)\\n result = 0\\n \\n for i in range(k+1):\\n for j in range(0, m):\\n if j == 0:\\n curr_prof = 0\\n profit[i][j] = -prices[j]\\n elif i == 0:\\n profit[i][j] = max(-prices[j], profit[i][j-1])\\n else:\\n curr_prof = max(curr_prof, profit[i-1][j] + prices[j])\\n profit[i][j] = max(curr_prof - prices[j], profit[i][j-1])\\n \\n result = max(result, curr_prof)\\n # result = max(result, profit[i][j] + prices[j])\\n print(profit)\\n return result\",\n \"memory\": \"20854\"\n },\n {\n \"code\": \"from heapq import heappush, heappop\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # attempt 1: see notes and problem 123. sell/buy stock III. attempt 3\\n \\n n = len(prices)\\n k = min(k,n//2)\\n # *2 becase is transaction have 2 actions buy then sell. \\n #+1 to account for 0 trans row make algorithm smoother\\n m = 2*k+1 \\n\\n # setting up row 0 => 0 transaction and column 0 => first day based values\\n t = [ [-prices[0] if i%2 else 0]*n for i in range(m) ] \\n\\n buy_sell = -1 # -1 buy, 1 sell\\n for i in range(1,m):\\n for d in range(1,n):\\n no_action = t[i][d-1]\\n action = t[i-1][d-1] +buy_sell*prices[d]# dig = max profit at the end of the previous half trans\\n t[i][d] = max(action,no_action)\\n buy_sell*=-1\\n \\n return t[-1][-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 \"memory\": \"20854\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n def helper(ind,transaction,prices,n,k):\\n if ind ==n or transaction==2*k:\\n return 0\\n if dp[ind][transaction]!=-1:\\n return dp[ind][transaction]\\n profit=0\\n if transaction%2==0:\\n profit=max(-prices[ind]+helper(ind+1,transaction+1,prices,n,k),\\n helper(ind+1,transaction,prices,n,k))\\n else:\\n profit=max(prices[ind]+helper(ind+1,transaction+1,prices,n,k),\\n helper(ind+1,transaction,prices,n,k))\\n dp[ind][transaction]=profit\\n return profit\\n \\n n=len(prices)\\n # dp=[[-1 for j in range(2*k)]for i in range(n)]\\n # return helper(0,0,prices,n,k)\\n dp=[[0 for j in range(2*k+1)]for i in range(n+1)]\\n \\n for ind in range(n-1,-1,-1):\\n for transaction in range(2*k-1,-1,-1):\\n profit=0\\n if transaction%2==0:\\n profit=max(-prices[ind]+dp[ind+1][transaction+1],\\n dp[ind+1][transaction])\\n else:\\n profit=max(prices[ind]+dp[ind+1][transaction+1],\\n dp[ind+1][transaction])\\n dp[ind][transaction]=profit\\n return dp[0][0]\\n\\n\\n\\n \",\n \"memory\": \"23393\"\n },\n {\n \"code\": \"# profit[k][0][i] = profit[k-1][1][[i-1]+price[i], profit[k][0][i-1]\\n# profit[i][k][1] = -price[i]+profit[i-1][k][0], profit[i-1][k][1]\\n# profit[i][0][0] = 0\\n# profit[i][0][1] = -inf\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n profit = [[[-inf]*(n+1) for _ in range(k+1)] for __ in range(2)]\\n for i in range(n+1):\\n profit[0][0][i] = 0\\n\\n print (profit)\\n ans = 0\\n for ki in range(k+1):\\n for i in range(1, len(prices)+1):\\n profit[0][ki][i] = max(profit[1][ki-1][i-1]+prices[i-1], profit[0][ki][i-1])\\n profit[1][ki][i] = max(-prices[i-1]+profit[0][ki][i-1], profit[1][ki][i-1])\\n ans = max(ans, profit[0][ki][i], profit[1][ki][i])\\n return ans\\n \",\n \"memory\": \"23393\"\n },\n {\n \"code\": \"class Solution:\\n def trade(self, k, prices, index, buy, dp):\\n if k == 0 or index == len(prices):\\n return 0\\n\\n if dp[index][buy][k] != -1:\\n return dp[index][buy][k] \\n \\n profit = 0\\n\\n if buy:\\n profit = max( 0 + self.trade(k, prices, index + 1, buy, dp), \\n -prices[index] + self.trade(k, prices, index + 1, not buy, dp))\\n\\n else:\\n profit = max( 0 + self.trade(k, prices, index + 1, buy, dp), \\n prices[index] + self.trade(k - 1, prices, index + 1, not buy, dp))\\n\\n dp[index][buy][k] = profit\\n return dp[index][buy][k]\\n \\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [[[-1 for _ in range(k+1)] for _ in range(2)] for _ in range(len(prices))]\\n\\n return self.trade(k, prices, 0, True, dp)\\n\",\n \"memory\": \"24239\"\n },\n {\n \"code\": \"class Solution:\\n def calculate_profit(self, ind, tranNo, n, prices, dp):\\n if ind == n or tranNo == 2 * self.k:\\n return 0\\n \\n if dp[ind][tranNo] != -1:\\n return dp[ind][tranNo]\\n \\n if tranNo % 2 == 0:\\n profit = max(\\n -prices[ind] + self.calculate_profit(ind + 1, tranNo + 1, n, prices, dp),\\n 0 + self.calculate_profit(ind + 1, tranNo, n, prices, dp)\\n )\\n else:\\n profit = max(\\n prices[ind] + self.calculate_profit(ind + 1, tranNo + 1, n, prices, dp),\\n 0 + self.calculate_profit(ind + 1, tranNo, n, prices, dp)\\n )\\n \\n dp[ind][tranNo] = profit\\n\\n return dp[ind][tranNo] \\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n self.k = k\\n dp = [[ -1 for _ in range(2 * k)] for _ in range(n)]\\n return self.calculate_profit(0, 0, n, prices, dp)\\n\",\n \"memory\": \"24239\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k, prices):\\n days = len(prices)\\n if k >= days // 2:\\n return sum(max(prices[i + 1] - prices[i], 0) for i in range(days - 1))\\n\\n dp = [days*[0] for _ in range(days)]\\n\\n for i in range(1, k + 1):\\n max_diff = -prices[0]\\n for j in range(1, days):\\n dp[i][j] = max(dp[i][j - 1], prices[j] + max_diff)\\n max_diff = max(max_diff, dp[i - 1][j] - prices[j])\\n\\n return dp[k][-1]\\n \",\n \"memory\": \"25085\"\n },\n {\n \"code\": \"def maxProfit(k, prices):\\n days = len(prices)\\n if k >= days // 2:\\n return sum(max(prices[i + 1] - prices[i], 0) for i in range(days - 1))\\n\\n dp = [days*[0] for _ in range(days)]\\n\\n for i in range(1, k + 1):\\n max_diff = -prices[0]\\n for j in range(1, days):\\n dp[i][j] = max(dp[i][j - 1], prices[j] + max_diff)\\n max_diff = max(max_diff, dp[i - 1][j] - prices[j])\\n\\n return dp[k][-1]\\n\\nwith open('user.out', 'w') as f:\\n c = None\\n for case in map(loads, stdin):\\n if c:\\n f.write(f\\\"{maxProfit(c, case)}\\\\n\\\")\\n c = None\\n else:\\n c = case\\nexit(0)\\n\\n \\n \",\n \"memory\": \"25085\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n s = [[-float('inf')]*n for i in range(4*k)]\\n s[0][0] = 0\\n s[1][0] = -prices[0]\\n s[2][0] = -float('inf')\\n s[3][0] = -float('inf')\\n for i in range(1, n):\\n for j in range(k):\\n if j > 0:\\n s[4*j][i] = max(s[4*j-1][i-1], s[4*j][i-1])\\n s[4*j+1][i] = max(s[4*j][i-1], s[4*j-1][i-1])-prices[i]\\n else:\\n s[4*j][i] = s[4*j][i-1]\\n s[4*j+1][i] = s[4*j][i-1]-prices[i]\\n s[4*j+2][i] = max(s[4*j+1][i-1], s[4*j+2][i-1])\\n s[4*j+3][i] = max(s[4*j+1][i-1], s[4*j+2][i-1])+prices[i]\\n max_profit = 0\\n for i in range(4*k):\\n for j in range(n):\\n max_profit = max(max_profit, s[i][j])\\n return max_profit\",\n \"memory\": \"25931\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n=len(prices)\\n dp=[[[0]*(2*k+1) for i in range(2)] for i in range(n+1)]\\n for x in range(n-1,-1,-1):\\n for y in range(1,-1,-1):\\n for z in range(2*k,-1,-1):\\n profit=0\\n if y and z:\\n profit=max(profit,-prices[x]+dp[x+1][0][z-1],dp[x+1][1][z])\\n elif not y and z:\\n profit=max(profit,+prices[x]+dp[x+1][1][z-1],dp[x+1][0][z])\\n dp[x][y][z]=profit\\n return dp[0][1][2*k]\",\n \"memory\": \"25931\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[0]*2 for _ in range(k+1)] for _ in range(n+1)]\\n \\n for i in range(n-1,-1,-1):\\n for rem_transactions in range(1,k+1):\\n for holding in range(2):\\n do_nothing = dp[i+1][rem_transactions][holding]\\n \\n if holding:\\n do_something = prices[i] + dp[i+1][rem_transactions-1][0]\\n else:\\n do_something = -prices[i] + dp[i+1][rem_transactions][1]\\n \\n dp[i][rem_transactions][holding] = max(do_nothing,do_something)\\n \\n return dp[0][k][0]\\n \\n \",\n \"memory\": \"26778\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n if not prices:\\n return 0\\n n = len(prices)\\n if k > n/2:\\n k = n//2\\n dp = [[[0]*2 for _ in range(k+1)] for _ in range(n)]\\n for i in range(n):\\n dp[i][0][0] = 0\\n dp[i][0][1] = -float('inf')\\n for j in range(1, k+1):\\n if i - 1 < 0:\\n dp[i][j][0] = 0\\n dp[i][j][1] = -prices[i]\\n else:\\n dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1]+prices[i])\\n dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j-1][0]-prices[i])\\n return dp[-1][-1][0]\",\n \"memory\": \"26778\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[-1]*k for _ in range(2)] for _ in range(n)]\\n\\n def findProfit(i,buy,tra):\\n if i>=n or tra>=k:\\n return 0\\n if dp[i][buy][tra]!=-1:\\n return dp[i][buy][tra]\\n if buy:\\n dp[i][buy][tra] = max(-prices[i]+findProfit(i+1,0,tra) , 0+findProfit(i+1,1,tra))\\n return dp[i][buy][tra]\\n else:\\n dp[i][buy][tra] = max(prices[i]+findProfit(i+1,1,tra+1), 0+findProfit(i+1,0,tra))\\n return dp[i][buy][tra]\\n return findProfit(0,1,0)\\n \",\n \"memory\": \"27624\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [[-float('inf') for _ in range(2*k+1)] for _ in range(len(prices)+1)]\\n for r in range(len(prices)+1):\\n dp[r][0]=0\\n \\n for i in range(1,len(prices)+1):\\n for j in range(1,2*k +1):\\n if j%2==0:\\n dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]+prices[i-1])\\n else:\\n dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]-prices[i-1])\\n print(dp)\\n return max(dp[-1])\\n\\n \\n \",\n \"memory\": \"27624\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[0] * 2 for _ in range(k + 1)] for __ in range(n + 1)]\\n for i in range(n-1, -1, -1):\\n for transactions_remaining in range(1, k + 1):\\n for holding in range(2):\\n if holding == 1:\\n # if holding we have 2 cases we sell or do nothing\\n dp[i][transactions_remaining][holding] = (\\n max(prices[i] + dp[i + 1][transactions_remaining - 1][0],\\n dp[i + 1][transactions_remaining][holding]))\\n else:\\n # if not holding we have 2 cases we buy or do nothing\\n dp[i][transactions_remaining][holding] = (\\n max(-prices[i] + dp[i + 1][transactions_remaining][1],\\n dp[i + 1][transactions_remaining][holding]))\\n return dp[0][k][0]\\n \",\n \"memory\": \"28470\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\n\\nState Variables: we need to keep track of the day and the amount of transactions we can take and the amount of stocks you're holding\\n\\nRecurrence Relation: We can either buy the stock on the ith day or not. If you bought a stock, you must next sell it before buying another.\\n\\n\\n\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[0] * 2 for _ in range(k + 1)] for __ in range(n + 1)]\\n \\n for i in range(n - 1, -1, -1):\\n for trans in range(1, k + 1):\\n for h in range(2):\\n nothing = dp[i + 1][trans][h]\\n something = 0\\n if h:\\n something = prices[i] + dp[i + 1][trans - 1][0]\\n else:\\n something = -prices[i] + dp[i + 1][trans][1]\\n \\n dp[i][trans][h] = max(something, nothing)\\n\\n return dp[0][k][0]\",\n \"memory\": \"28470\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def __init__(self):\\n self.cache = {}\\n self.used = 0\\n def maxProfit(self, k: int, prices):\\n if k == 0:\\n return 0\\n if len(prices) <= 1:\\n return 0\\n key = str(k) + \\\",\\\" + str(len(prices))\\n if key in self.cache:\\n self.used += 1\\n return self.cache[key]\\n\\n max_profit = 0\\n\\n for i in range(1):\\n # max_gain = 0\\n # j = i+1\\n # higher_found = False\\n # idx =-1\\n # while j < len(prices):\\n # if not higher_found and prices[j] - prices[i] > max_gain:\\n # max_gain = prices[j]-prices[i]\\n # idx = j\\n # higher_found = True\\n #\\n # elif higher_found:\\n # if prices[j] < prices[j-1]:\\n # profits.append(prices[j-1]-prices[i] + self.maxProfit(min(k-1, len(prices[j:])//2), prices[j:]))\\n # higher_found = False\\n # idx = -1\\n # j-=1\\n # else:\\n # max_gain= prices[j]-prices[i]\\n # idx = j\\n # j += 1\\n # if idx != -1:\\n # profits.append(prices[idx] - prices[i] + self.maxProfit(min(k - 1, len(prices[idx + 1:]) // 2), prices[idx + 1:]))\\n max_profit = self.maxProfit(min(k, len(prices[i+1:])//2), prices[i+1:])\\n max_gain = 0\\n for j in range(i+1, len(prices)):\\n if (prices[j] - prices[i]) > max_gain: #and (prices[j]-prices[i] + self.maxProfit(min(29,len(prices[j+1:])//2),prices[j+1:]))> max_profit:\\n max_gain = prices[j] - prices[i]\\n val = max_gain + self.maxProfit(min(k-1, len(prices[j+1:])//2), prices[j+1:])\\n if val > max_profit:\\n max_profit = val\\n self.cache[key] = max_profit\\n return max_profit\",\n \"memory\": \"29316\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [[[-1 for _ in range(k+1)] for _ in range(2)] for _ in range(len(prices))]\\n\\n def solve(i: int, buy: int, limit: int) -> int:\\n if i == len(prices):\\n return 0\\n\\n if limit == 0:\\n return 0\\n\\n if dp[i][buy][limit] != -1:\\n return dp[i][buy][limit]\\n\\n profit = 0\\n if buy: # buy is allowed\\n p1 = -1 * prices[i] + solve(i+1, 0, limit) # buy\\n p2 = 0 + solve(i+1, 1, limit) # didnt buy\\n profit = max(p1, p2)\\n\\n else: # buy is not allowed\\n p1 = prices[i] + solve(i+1, 1, limit-1) # sell\\n p2 = 0 + solve(i+1, 0, limit) # didnt sell\\n profit = max(p1, p2)\\n\\n dp[i][buy][limit] = profit\\n return profit\\n\\n def solveTab() -> int:\\n dp = [[[0 for _ in range(k+1)] for _ in range(2)] for _ in range(len(prices)+1)]\\n\\n for i in range(len(prices)-1, -1, -1):\\n for j in range(2):\\n for x in range(1, k+1):\\n profit = 0\\n if j: # buy is allowed\\n p1 = -1 * prices[i] + dp[i+1][0][x] # buy\\n p2 = 0 + dp[i+1][1][x] # didnt buy\\n profit = max(p1, p2)\\n\\n else: # buy is not allowed\\n p1 = prices[i] + dp[i+1][1][x-1] # sell\\n p2 = 0 + dp[i+1][0][x] # didnt sell\\n profit = max(p1, p2)\\n\\n dp[i][j][x] = profit\\n\\n return dp[0][1][k]\\n\\n\\n #return solve(0, 1, k)\\n return solveTab()\",\n \"memory\": \"29316\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, kk: int, prices: List[int]) -> int:\\n # daylength = len(prices)\\n\\n # everyday, I can buy, sell, or hold\\n # @cache\\n # def dp(startday, remainK, hasStock):\\n # if startday >= daylength - 1:\\n # if not hasStock:\\n # return 0\\n # else:\\n # return prices[startday]\\n # res = []\\n # best1 = dp(startday + 1, remainK, hasStock)\\n # res.append(best1)\\n # if not hasStock and remainK > 0:\\n # best2 = dp(startday + 1, remainK, True) - prices[startday]\\n # res.append(best2)\\n # if hasStock and remainK > 0:\\n # best3 = dp(startday + 1, remainK - 1, False) + prices[startday]\\n # res.append(best3)\\n # # print(startday, remainK, purchaseDay, res)\\n # return max(res)\\n\\n # return dp(0, k, False)\\n\\n dp = [[[0, 0] for k in range(kk + 1)] for i in range(len(prices))]\\n for i in range(len(prices)):\\n dp[i][0][0] = 0\\n dp[i][0][1] = -prices[i]\\n for k in range(kk + 1):\\n if k > 0:\\n dp[0][k][0] = 0\\n dp[0][k][1] = -prices[0] # -math.inf\\n for i in range(1, len(prices)):\\n for k in range(0, kk + 1):\\n dp[i][k][1] = max(dp[i - 1][k][1], dp[i - 1][k][0] - prices[i])\\n if k > 0:\\n dp[i][k][0] = max(dp[i - 1][k][0], dp[i - 1][k - 1][1] + prices[i])\\n ans = 0\\n print(dp)\\n for k in range(kk + 1):\\n print(ans, dp[-1][k][0])\\n ans = max(dp[-1][k][0], dp[-1][k][1], ans)\\n return ans\\n\",\n \"memory\": \"30163\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, kk: int, prices: List[int]) -> int:\\n # daylength = len(prices)\\n\\n # everyday, I can buy, sell, or hold\\n # @cache\\n # def dp(startday, remainK, hasStock):\\n # if startday >= daylength - 1:\\n # if not hasStock:\\n # return 0\\n # else:\\n # return prices[startday]\\n # res = []\\n # best1 = dp(startday + 1, remainK, hasStock)\\n # res.append(best1)\\n # if not hasStock and remainK > 0:\\n # best2 = dp(startday + 1, remainK, True) - prices[startday]\\n # res.append(best2)\\n # if hasStock and remainK > 0:\\n # best3 = dp(startday + 1, remainK - 1, False) + prices[startday]\\n # res.append(best3)\\n # # print(startday, remainK, purchaseDay, res)\\n # return max(res)\\n\\n # return dp(0, k, False)\\n\\n dp = [[[0, 0] for k in range(kk + 1)] for i in range(len(prices))]\\n for i in range(len(prices)):\\n dp[i][0][0] = 0\\n dp[i][0][1] = -prices[i]\\n for k in range(kk + 1):\\n if k > 0:\\n dp[0][k][0] = 0\\n dp[0][k][1] = -math.inf\\n for i in range(1, len(prices)):\\n for k in range(0, kk + 1):\\n dp[i][k][1] = max(dp[i - 1][k][1], dp[i - 1][k][0] - prices[i])\\n if k > 0:\\n dp[i][k][0] = max(dp[i - 1][k][0], dp[i - 1][k - 1][1] + prices[i])\\n ans = 0\\n print(dp)\\n for k in range(kk + 1):\\n print(ans, dp[-1][k][0])\\n ans = max(dp[-1][k][0], dp[-1][k][1], ans)\\n return ans\\n\",\n \"memory\": \"30163\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [[[-1 for _ in range(2)] for _ in range(k+1)] for _ in range(len(prices))]\\n\\n def helper(idx, bought, transactions):\\n if idx >= len(prices) or transactions >= k:\\n return 0\\n \\n if dp[idx][transactions][int(bought)] != -1:\\n return dp[idx][transactions][int(bought)]\\n \\n skipAction = helper(idx + 1, bought, transactions)\\n if bought:\\n takeAction = prices[idx] + helper(idx + 1, False, transactions + 1)\\n else:\\n takeAction = helper(idx + 1, True, transactions) - prices[idx]\\n \\n dp[idx][transactions][int(bought)] = max(skipAction, takeAction)\\n return dp[idx][transactions][int(bought)]\\n \\n return helper(0, False, 0)\",\n \"memory\": \"31009\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[-1 for i in range(2)] for j in range(k+1)] for m in range(n)]\\n\\n def stock(ind, transactions, bought):\\n if ind == n:\\n return 0\\n \\n if dp[ind][transactions][bought] != -1:\\n return dp[ind][transactions][bought]\\n \\n # if I have already bought a stock\\n if bought:\\n # I can either sell it\\n sell = prices[ind] + stock(ind+1, transactions, False)\\n # or keep it\\n not_sell = stock(ind+1, transactions, True)\\n dp[ind][transactions][bought] = max(sell, not_sell)\\n\\n # if I dont have a stock in hand\\n else:\\n buy = float('-inf')\\n # I can either buy a stock if I haven't done k transactions\\n if transactions < k:\\n buy = -prices[ind] + stock(ind+1, transactions+1, True)\\n # or not buy a stock\\n not_buy = stock(ind+1, transactions, False)\\n dp[ind][transactions][bought] = max(buy, not_buy)\\n \\n return dp[ind][transactions][bought]\\n \\n return stock(0, 0, False)\\n \",\n \"memory\": \"31009\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [[[float('-inf'), float('-inf')] for _ in range(k+1)] for _ in range(len(prices)+1)]\\n for i in range(len(prices)+1):\\n for j in range(k+1):\\n if i==0:\\n dp[i][j][0]=0\\n elif j ==0:\\n dp[i][j][0]=0\\n else:\\n dp[i][j][0] = max(dp[i-1][j][1]+prices[i-1], dp[i-1][j][0])\\n dp[i][j][1] = max(dp[i-1][j-1][0]-prices[i-1], dp[i-1][j][1])\\n #print(dp)\\n return dp[-1][-1][0]\\n\\n\\n# class Solution:\\n# def maxProfit(self, k: int, prices: List[int]) -> int:\\n# dp = [[[float('-inf'), float('-inf')] for _ in range(k+1)] for _ in range(len(prices)+1)]\\n# for i in range(len(prices)+1):\\n# for j in range(k+1):\\n# if i==0:\\n# dp[i][j][0]=0\\n# elif j==0:\\n# dp[i][j][0]=0\\n# else:\\n# dp[i][j][0] = max(dp[i-1][j][1]+prices[i-1], dp[i-1][j][0])\\n# dp[i][j][1] = max(dp[i-1][j-1][0]-prices[i-1], dp[i-1][j][1])\\n# return dp[len(prices)][k][0]\",\n \"memory\": \"31855\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n\\n # @cache\\n # def dfs(i, j, hold):\\n # \\\"\\\"\\\"\\n # i: day \\n # j: number of transactions\\n # hold: current state machine, hold or not hold\\n # \\\"\\\"\\\"\\n\\n # # edge case: invalid number of transaction number\\n # if j < 0:\\n # return -inf\\n\\n # # base case\\n # if i < 0:\\n # return -inf if hold else 0\\n\\n # if hold:\\n # # if from hold state, no transaction number increase\\n # # if from non-hold state, we will increase by one transaction number\\n # return max(dfs(i-1, j, True), dfs(i-1, j-1, False)-prices[i])\\n\\n # # non hold state tranfer choices: i-1,j hold, i-1,j non-hold\\n # else:\\n # return max(dfs(i-1, j, True)+prices[i], dfs(i-1, j, False))\\n\\n # return dfs(len(prices)-1, k, hold=False)\\n\\n N = len(prices)\\n dp = [[[-inf, -inf] for _ in range(k+2)] for _ in range(N+1)]\\n\\n # # edge case\\n # dp[0][1][0] = 0 # d=-1, j=0, state=0\\n # dp[0][1][1] = -inf # d=-1, j=0, state=1\\n\\n\\n\\n # edge case: invalid j (transaction time)\\n for j in range(1, k+2): # [1, K+1]\\n dp[0][j][0] = 0\\n\\n\\n for i, price in enumerate(prices):\\n for j in range(1, k+2):\\n # can go from j=0 to j=1\\n # but cannot go from j=-1 to j=1\\n # since we are using array\\n # we define j=0 as invalid\\n dp[i+1][j][0] = max(dp[i][j][0], dp[i][j-1][1] + price)\\n dp[i+1][j][1] = max(dp[i][j][0] - price, dp[i][j][1])\\n\\n return dp[N][k+1][0]\\n\\n\\n \",\n \"memory\": \"31855\"\n },\n {\n \"code\": \"# class Solution:\\n# def maxProfit(self, k: int, prices: List[int]) -> int:\\n# n = len(prices)\\n# dp = [[[0, 0] for _ in range(k+1)] for _ in range(n+1)]\\n\\n# for i in reversed(range(n)):\\n# # representing the index of the price\\n# for j in range(1, k + 1):\\n# # representing which transaction it's on\\n# # 0 - not holding a stock, 1 - holding a stock\\n# dp[i][j][0] = max(-prices[i] + dp[i+1][j][1], dp[i+1][j][0])\\n# dp[i][j][1] = max(prices[i] + dp[i+1][j-1][0], dp[i+1][j][1])\\n\\n# print(dp)\\n# return dp[0][k][0]\\n \\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[0, 0] for _ in range(k)] for _ in range(n)]\\n\\n # how much we can earn at last price? We can only sell at last price\\n dp[-1] = [[0, prices[-1]] for _ in range(k)]\\n\\n for i in reversed(range(n-1)):\\n for j in range(k):\\n if j == k - 1:\\n dp[i][j][1] = max(prices[i], dp[i+1][j][1]) # last transaction, cannot sell anymore\\n else:\\n dp[i][j][1] = max(prices[i] + dp[i+1][j+1][0], dp[i+1][j][1])\\n \\n dp[i][j][0] = max(-prices[i] + dp[i+1][j][1], dp[i+1][j][0])\\n\\n\\n print(dp)\\n\\n return dp[0][0][0]\\n\\n#[[[8, 9], [11, 12]], [[8, 9], [11, 12]], [[7, 9], [8, 12]], [[7, 9], [7, 12]], [[7, 9], [7, 9]], [[0, 9], [0, 9]], [[0, 7], [0, 7]]]\\n \",\n \"memory\": \"32701\"\n },\n {\n \"code\": \"# class Solution:\\n# def maxProfit(self, k: int, prices: List[int]) -> int:\\n# n = len(prices)\\n# dp = [[[0, 0] for _ in range(k+1)] for _ in range(n+1)]\\n\\n# for i in reversed(range(n)):\\n# # representing the index of the price\\n# for j in range(1, k + 1):\\n# # representing which transaction it's on\\n# # 0 - not holding a stock, 1 - holding a stock\\n# dp[i][j][0] = max(-prices[i] + dp[i+1][j][1], dp[i+1][j][0])\\n# dp[i][j][1] = max(prices[i] + dp[i+1][j-1][0], dp[i+1][j][1])\\n\\n# print(dp)\\n# return dp[0][k][0]\\n \\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n dp = [[[0, 0] for _ in range(k)] for _ in range(n)]\\n\\n # how much we can earn at last price? We can only sell at last price\\n dp[-1] = [[0, prices[-1]] for _ in range(k)]\\n\\n for i in reversed(range(n-1)):\\n for j in range(k):\\n if j == k - 1:\\n dp[i][j][1] = max(prices[i], dp[i+1][j][1]) # last transaction, cannot sell anymore\\n else:\\n dp[i][j][1] = max(prices[i] + dp[i+1][j+1][0], dp[i+1][j][1])\\n \\n dp[i][j][0] = max(-prices[i] + dp[i+1][j][1], dp[i+1][j][0])\\n\\n\\n print(dp)\\n\\n return dp[0][0][0]\\n\\n#[[[8, 9], [11, 12]], [[8, 9], [11, 12]], [[7, 9], [8, 12]], [[7, 9], [7, 12]], [[7, 9], [7, 9]], [[0, 9], [0, 9]], [[0, 7], [0, 7]]]\\n \",\n \"memory\": \"32701\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n\\n n=len(prices)\\n dp=[[[-math.inf,-math.inf] for i in range(k+1)] for i in range(n)]\\n maxa=0\\n for i in range(n):\\n for j in range(k+1):\\n\\n if(j==0):\\n dp[i][j][0]=0\\n continue\\n\\n if(i==0):\\n dp[0][1][1]=-prices[0]\\n continue\\n \\n dp[i][j][0] = max(dp[i-1][j][0],dp[i-1][j][1]+prices[i])\\n\\n dp[i][j][1] = max(dp[i-1][j][1],dp[i-1][j-1][0]-prices[i])\\n\\n maxa=max(maxa,dp[i][j][0],dp[i][j][1])\\n print(dp)\\n return maxa\\n\\n\\n \\n\\n\\n \\n\\n\\n \\n \",\n \"memory\": \"33548\"\n },\n {\n \"code\": \"class Solution: \\n \\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n '''\\n we can't use the same algo as we did for k=2 because we may not have the full list to work with\\n \\n dp[i][j] represents max profit if buying and selling in prices[i:j]\\n - can generate this in O(n^2) time\\n \\n then we have to find the best k\\n - can't use binayr search cause it's not sorted\\n \\n iterate j from 1 to len(prices)\\n - check dp[:j] + self.maxProfitHelper(k-1, prices[j:])\\n - instead, we don't need dp here, we can find best price from i to j while we iterate throguh\\n \\n \\n O(n^K) time\\n O(k) space\\n \\n ----\\n we can use memo/dp for self.maxProfitHelper(k-1, prices[j:])\\n \\n memo[(k, i)] where k is the number of parititons we can do and i is the index we are on (consdiering prices[i:])\\n \\n O(k*n * n) time, since it takes O(n) time to cmpute each one\\n O(k*n) space\\n \\n ----\\n reading solution\\n an optimizaiton we can make is check if memo[k-1][prices[j-1]] exists, and is > than our \\n current prpofit, if it is than this result will be redundant and we can stop\\n - will need to keep track of our current profit so far, that's easy\\n - basically only call the function when the max_profit increases?\\n worst case would still be the same tho if we get lot of dips and peaks in the array\\n \\n ----\\n using solution but implmeneting myself\\n \\n dp[day_number][used_transaction_number][stock_holding_status] to represent our states, where stock_holding_status is a 0/1 number representing whether you hold the stock or not.\\n\\nThe value of dp[i][j][l] represents the best profit we can have at the end of the i-th day, with j remaining transactions to make and l stocks.\\n\\n dp[i][j][1] = max(dp[i-1][j+1][0] + \\n - oh okay, was confused but we don't need to know when we bought it because we subtract the \\n amount from our profit the moment we buy it, so just knowing when we sold it is sufficinet\\n \\n better than mine because don't need to iterate through the whole list to get the next state\\n - next time try thinking from the opposite way\\n - for eveyrthing not in terms of just the list, even number of transactions (go from 0 to k\\n not k to 0)\\n \\n \\n o(n*k) time\\n O(k*n) space\\n \\n dp[0][0][0] = 0\\n dp[0][0][1] = -prices[0]\\n \\n dp[i][j][0] means we don't have the stock after the ith day\\n\\n selling the stock (because we had the stock from previous day, not necessarily bought it on\\n that day, we take the max profit so far with also having the stock on that day)\\n\\n dp[i][j][0] = dp[i-1][j-1][1] + prices[i]\\n\\n j being number of times we sold\\n - we could say j being number of times we bought too, but then we might sell more than \\n what we actually have\\n - we could also make each row 2k elements, and it repserents number of transactions\\n - tho that would also be invalid because we might just sell 2*k times\\n\\n keep not having teh stock \\n dp[i][j][0] = dp[i-1][j][0]\\n\\n having the estock, either we had it form before or we buy it now, take whatever gives us\\n the max profit currently ()\\n dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j][0] - prices[i])\\n '''\\n dp= []\\n for i in range(len(prices)):\\n row = []\\n for j in range(k+1):\\n row.append([-sys.maxsize,-sys.maxsize])\\n dp.append(row)\\n # dp = [[[0, -2], [-inf, -inf], [-inf, -inf]],[[0, -2], [-inf, -inf], [-inf, -inf]],[[-inf, -inf], [-inf, -inf], [-inf, -inf]]]\\n dp[0][0][0] = 0\\n dp[0][0][1] = -prices[0]\\n for i in range(1, len(dp)):\\n for j in range(len(dp[i])):\\n dp[i][j][0] = dp[i-1][j][0]\\n if j > 0:\\n dp[i][j][0] = max(dp[i-1][j-1][1] + prices[i], dp[i][j][0])\\n dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j][0] - prices[i])\\n \\n highest = 0\\n for j in range(len(dp[-1])):\\n highest=max(dp[-1][j][0], highest) # highest swould never be holding a stock at the end\\n return highest\\n \\n'''\\n2\\n[2,4,1]\\n2\\n[3,2,6,5,0,3]\\n2\\n[2,4,1]\\n1\\n[3,2,6,5,0,3]\\n\\nshould be 7 still\\n3\\n[3,2,6,5,0,3,1,2]\\nshould be 8 now\\n3\\n[3,2,6,5,0,3,1,2]\\n\\n\\n# dp = [[[0, -2], [-inf, -inf], [-inf, -inf]],[[-inf, -inf], [-inf, -inf], [-inf, -inf]],[[-inf, -inf], [-inf, -inf], [-inf, -inf]]]\\n\\n\\n'''\",\n \"memory\": \"34394\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, kk: int, prices: List[int]) -> int:\\n # daylength = len(prices)\\n\\n # everyday, I can buy, sell, or hold\\n # @cache\\n # def dp(startday, remainK, hasStock):\\n # if startday >= daylength - 1:\\n # if not hasStock:\\n # return 0\\n # else:\\n # return prices[startday]\\n # res = []\\n # best1 = dp(startday + 1, remainK, hasStock)\\n # res.append(best1)\\n # if not hasStock and remainK > 0:\\n # best2 = dp(startday + 1, remainK, True) - prices[startday]\\n # res.append(best2)\\n # if hasStock and remainK > 0:\\n # best3 = dp(startday + 1, remainK - 1, False) + prices[startday]\\n # res.append(best3)\\n # # print(startday, remainK, purchaseDay, res)\\n # return max(res)\\n\\n # return dp(0, k, False)\\n\\n dp = [[[-math.inf, -math.inf] for k in range(kk + 1)] for i in range(len(prices))]\\n for i in range(len(prices)):\\n dp[i][0][0] = 0\\n dp[i][0][1] = -prices[i]\\n for k in range(kk + 1):\\n if k > 0:\\n dp[0][k][0] = -math.inf\\n dp[0][k][1] = -math.inf\\n for i in range(1, len(prices)):\\n for k in range(0, kk + 1):\\n dp[i][k][1] = max(dp[i - 1][k][1], dp[i - 1][k][0] - prices[i])\\n if k > 0:\\n dp[i][k][0] = max(dp[i - 1][k][0], dp[i - 1][k - 1][1] + prices[i])\\n ans = 0\\n print(dp)\\n for k in range(kk + 1):\\n print(ans, dp[-1][k][0])\\n ans = max(dp[-1][k][0], dp[-1][k][1], ans)\\n return ans\\n\",\n \"memory\": \"35240\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n=len(prices)\\n p=prices\\n DD={}\\n for s in range(k+1):\\n F=p[n-1]\\n #print(\\\"s is\\\", s)\\n for i in range(1,n+1):\\n #print(\\\"i is,\\\", i)\\n if s==0 or i==1:\\n DD[(s,n-i)]=0\\n else:\\n f1=DD[(s,n-i+1)]\\n f2=-p[n-i]+F\\n DD[(s,n-i)]=max(f1,f2)\\n F=max(F,p[n-i]+DD[(s-1,n-i+1)])\\n \\n #print(\\\"DD is\\\", DD)\\n return DD[(k,0)]\\n \\n\\n \",\n \"memory\": \"35240\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, kk: int, prices: List[int]) -> int:\\n # daylength = len(prices)\\n\\n # everyday, I can buy, sell, or hold\\n # @cache\\n # def dp(startday, remainK, hasStock):\\n # if startday >= daylength - 1:\\n # if not hasStock:\\n # return 0\\n # else:\\n # return prices[startday]\\n # res = []\\n # best1 = dp(startday + 1, remainK, hasStock)\\n # res.append(best1)\\n # if not hasStock and remainK > 0:\\n # best2 = dp(startday + 1, remainK, True) - prices[startday]\\n # res.append(best2)\\n # if hasStock and remainK > 0:\\n # best3 = dp(startday + 1, remainK - 1, False) + prices[startday]\\n # res.append(best3)\\n # # print(startday, remainK, purchaseDay, res)\\n # return max(res)\\n\\n # return dp(0, k, False)\\n\\n dp = [[[-math.inf, -math.inf] for k in range(kk + 1)] for i in range(len(prices))]\\n for i in range(len(prices)):\\n dp[i][0][0] = 0\\n dp[i][0][1] = -prices[i]\\n for k in range(kk + 1):\\n if k > 0:\\n dp[0][k][0] = 0\\n dp[0][k][1] = -math.inf\\n for i in range(1, len(prices)):\\n for k in range(0, kk + 1):\\n dp[i][k][1] = max(dp[i - 1][k][1], dp[i - 1][k][0] - prices[i])\\n if k > 0:\\n dp[i][k][0] = max(dp[i - 1][k][0], dp[i - 1][k - 1][1] + prices[i])\\n ans = 0\\n print(dp)\\n for k in range(kk + 1):\\n print(ans, dp[-1][k][0])\\n ans = max(dp[-1][k][0], dp[-1][k][1], ans)\\n return ans\\n\",\n \"memory\": \"36086\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n # k = min(k, len(prices) // 2)\\n\\n starts = [i for i in range(len(prices) - 1) if (i == 0 or prices[i - 1] >= prices[i]) and prices[i] < prices[i + 1]]\\n ends = {i for i in range(1, len(prices)) if prices[i - 1] < prices[i] and (i == len(prices) - 1 or prices[i] >= prices[i + 1])}\\n\\n @cache\\n def dp(i: int, t: int) -> int:\\n if t == 0 or i == 0:\\n return 0\\n return max(dp(i, t - 1), dp(i - 1, t), max(prices[i - 1] - prices[j] + dp(j, t - 1) for j in starts if j <= i - 1) if i - 1 in ends else 0)\\n\\n return dp(len(prices), k)\\n\\n\",\n \"memory\": \"36086\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n #3d day/used k/hold\\n dp = [[[-inf for _ in range(2)] for _ in range(k+1)] for _ in range(len(prices))]\\n\\n print(dp)\\n \\n dp[0][0][0] = 0\\n dp[0][1][1] = -prices[0]\\n res = 0\\n\\n for i in range(1, len(prices)):\\n for j in range(k+1):\\n dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1] + prices[i])\\n\\n # buy\\n if j > 0:\\n dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j-1][0] - prices[i])\\n res = max(res, dp[i][j][0], dp[i][j][1])\\n return res\\n\",\n \"memory\": \"36933\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n def buy(idx, k):\\n if idx == len(prices) or k == 0: return 0\\n\\n if not idx in dp['buy'][k]:\\n dp['buy'][k][idx] = max(buy(idx+1, k), sell(idx, k) - prices[idx])\\n\\n return dp['buy'][k][idx]\\n\\n def sell(idx, k):\\n if idx == len(prices): return 0\\n\\n if not idx in dp['sell'][k]:\\n dp['sell'][k][idx] = max(sell(idx+1, k), prices[idx] + buy(idx+1, k-1))\\n\\n return dp['sell'][k][idx]\\n\\n dp = {'buy': defaultdict(dict), 'sell': defaultdict(dict)}\\n return buy(0, k)\",\n \"memory\": \"36933\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n\\n n = len(prices)\\n dp = [[[0] * 2 for _ in range(2*k + 1)] for __ in range(n + 1)]\\n \\n for i in range(n - 1, -1, -1):\\n for transactions_remaining in range(1, 2*k + 1):\\n for holding in range(2):\\n do_nothing = dp[i + 1][transactions_remaining][holding]\\n if holding:\\n # Sell stock\\n do_something = prices[i] + dp[i + 1][transactions_remaining - 1][0]\\n else:\\n # Buy stock\\n do_something = -prices[i] + dp[i + 1][transactions_remaining][1]\\n \\n # Recurrence relation\\n dp[i][transactions_remaining][holding] = max(do_nothing, do_something)\\n\\n return dp[0][k][0]\\n\\n\\n \\n # @cache\\n # def f(i,K,hold):\\n # if K != 2*k and i < len(prices):\\n # if hold:\\n # return max(f(i+1,K,hold), prices[i] + f(i+1,K+1,not hold))\\n # else:\\n # return max(f(i+1,K,hold), -prices[i] + f(i+1,K+1,not hold))\\n # else:\\n # return 0\\n\\n # return f(0,0,False)\\n \",\n \"memory\": \"37779\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n HOLD = 1\\n FREE = 0\\n dp = defaultdict(lambda: defaultdict(int))\\n dp[0][(0, FREE)] = 0\\n dp[0][(0, HOLD)] = -prices[0]\\n maxprofit = 0\\n for day in range(len(prices)-1):\\n #print(day, 'day')\\n for (action, holding), value in dp[day].items():\\n #print('interpreting', action, holding, 'value', value)\\n if holding:\\n dp[day+1][(action+1, FREE)] = value + prices[day+1]\\n elif action < k:\\n dp[day+1][(action, HOLD)] = value - prices[day+1]\\n \\n for (action, holding), value in dp[day].items():\\n dp[day+1][(action, holding)] = max(dp[day+1][(action, holding)], value)\\n\\n #print(dp[0])\\n #print(dp[1])\\n #print(dp[2])\\n #print(dp[3])\\n #print(dp[4])\\n #print(dp[5])\\n #print(dp[6])\\n #print(dp[7])\\n \\n return max(dp[len(prices)-1].values()) \\n\\n\\n\\n\\n''' @cache\\n def dp(i, holding, remain):\\n if i == len(prices) or remain == 0:\\n return 0\\n \\n sell = buy = 0\\n skip = dp(i + 1, holding, remain)\\n if holding:\\n sell = prices[i] + dp(i+1, False, remain-1)\\n else:\\n buy = -prices[i] + dp(i+1, True, remain)\\n return max(sell, buy, skip)\\n\\n return dp(0, False, k)'''\",\n \"memory\": \"37779\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n @functools.cache\\n def dp(i: int, kLeft: int) -> int:\\n if kLeft == 0: return 0\\n if i == n: return 0\\n minSoFar = prices[i]\\n soln = 0\\n bestProfit = 0\\n for j in range(i+1, n):\\n minSoFar = min(minSoFar, prices[j])\\n d = prices[j] - minSoFar\\n if d < bestProfit: continue\\n bestProfit = d\\n soln = max(soln, bestProfit+dp(j+1, kLeft-1))\\n return soln\\n \\n return dp(0, k)\",\n \"memory\": \"38625\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n if k < 0:\\n raise ValueError(\\\"k can not be negative!\\\")\\n\\n if not k or not prices:\\n return 0\\n\\n return self.max_profit_helper_bottom_up(prices, k)\\n\\n return self.max_profit_helper(prices, 0, 2 * k, True, {})\\n\\n\\n # Ideally, an InputParam should be created, will refactor it if I get time.\\n def max_profit_helper(self, prices, current_index, max_transaction, can_buy_stock, cache):\\n if current_index >= len(prices) or max_transaction <= 0:\\n return 0\\n\\n key = (current_index, max_transaction)\\n\\n if key in cache:\\n return cache[key]\\n \\n if can_buy_stock:\\n buy = -prices[current_index] + self.max_profit_helper(prices, current_index + 1, max_transaction - 1, False, cache)\\n skip_buying = self.max_profit_helper(prices, current_index + 1, max_transaction, True, cache)\\n cache[key] = max(buy, skip_buying)\\n else:\\n sell = prices[current_index] + self.max_profit_helper(prices, current_index + 1, max_transaction - 1, True , cache)\\n skip_selling = self.max_profit_helper(prices, current_index + 1, max_transaction, False , cache)\\n cache[key] = max(sell, skip_selling)\\n\\n return cache[key]\\n\\n \\n def max_profit_helper_bottom_up(self, prices, k):\\n if k < 0:\\n raise ValueError(\\\"k can not be negative!\\\")\\n\\n if not k or not prices:\\n return 0\\n\\n n = len(prices)\\n max_transaction = 2 * k\\n\\n # dp[day][remaining_transactions][can_buy] where can_buy is 1 for True, 0 for False\\n dp = [[[0] * 2 for _ in range(max_transaction + 1)] for _ in range(n + 1)]\\n\\n # Fill the DP table from the end to the beginning\\n for current_index in range(n - 1, -1, -1):\\n for remaining_transactions in range(1, max_transaction + 1):\\n # Case where we can buy\\n dp[current_index][remaining_transactions][1] = max(\\n -prices[current_index] + dp[current_index + 1][remaining_transactions - 1][0], # Buy stock\\n dp[current_index + 1][remaining_transactions][1] # Skip buying\\n )\\n\\n # Case where we can sell\\n dp[current_index][remaining_transactions][0] = max(\\n prices[current_index] + dp[current_index + 1][remaining_transactions - 1][1], # Sell stock\\n dp[current_index + 1][remaining_transactions][0] # Skip selling\\n )\\n\\n # We start on day 0, with 2*k transactions allowed, and the ability to buy\\n return dp[0][max_transaction][1]\\n \\n\\n\\n def get_dp_grid(prices_length, k):\\n dp_grid = []\\n for row in range(prices_length + 1):\\n temp_dp = [0 for col in range(k + 1)]\\n dp_grid.append(temp_dp)\\n \\n return dp_grid\\n\\n\\n \\n \\n\\n\\n \",\n \"memory\": \"39471\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n N = len(prices)\\n\\n @cache\\n def dp(i, isBuy, t):\\n if i == N:\\n return 0\\n \\n if t == 0:\\n return 0\\n \\n maxProfit = float(\\\"-inf\\\")\\n \\n if isBuy:\\n buyNowProfit = -prices[i] + dp(i + 1, False, t - 1)\\n buyLaterProfit = dp(i + 1, True, t)\\n maxProfit = max(buyNowProfit, buyLaterProfit)\\n else:\\n sellNowProfit = prices[i] + dp(i + 1, True, t - 1)\\n sellLaterProfit = dp(i + 1, False, t)\\n maxProfit = max(sellNowProfit, sellLaterProfit)\\n \\n return maxProfit\\n\\n\\n dp = [[[0, 0] for _ in range(1 + 2 * k)] for _ in range(N + 1)]\\n\\n\\n for i in range(N - 1, -1, -1):\\n for t in range(1, 2 * k + 1):\\n for isBuy in [1, 0]:\\n if isBuy:\\n buyNowProfit = -prices[i] + dp[i + 1][t - 1][0]\\n buyLaterProfit = dp[i + 1][t][1]\\n maxProfit = max(buyNowProfit, buyLaterProfit)\\n else:\\n sellNowProfit = prices[i] + dp[i + 1][t - 1][1]\\n sellLaterProfit = dp[i + 1][t][0]\\n maxProfit = max(sellNowProfit, sellLaterProfit)\\n \\n dp[i][t][isBuy] = maxProfit\\n \\n return dp[0][2 * k][1]\",\n \"memory\": \"40318\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo = [[[-1] * 2 for _ in range(2 * (k + 1))] for _ in range(len(prices))]\\n\\n def dfs(pos, trans, hold):\\n if not trans:\\n return 0\\n \\n if len(prices) == pos:\\n return 0\\n \\n if -1 != memo[pos][trans][hold]:\\n return memo[pos][trans][hold]\\n \\n ret1 = 0\\n if hold: # Sell it\\n ret1 = prices[pos] + dfs(pos + 1, trans - 1, 0)\\n else: # Buy it\\n ret1 = dfs(pos + 1, trans - 1, 1) - prices[pos]\\n \\n # Hold current stock (if there are any)\\n ret2 = dfs(pos + 1, trans, hold)\\n\\n memo[pos][trans][hold] = max(ret1, ret2)\\n return max(ret1, ret2)\\n \\n return dfs(0, 2 * k, 0)\\n \",\n \"memory\": \"40318\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n cache = [] #day, transcation, own\\n for d in range(len(prices)): #days\\n tem = []\\n for i in range(k*2): #transcation\\n tem.append([None, None]) #own or not\\n cache.append(tem)\\n \\n def dfs(d, t, own):\\n if d == len(prices) or t == 2*k:\\n return 0\\n \\n if cache[d][t][own] != None:\\n return cache[d][t][own] \\n \\n if own == 1:\\n #sell it or not today\\n cache[d][t][own] = max( dfs(d + 1, t + 1, 0) + prices[d], dfs(d + 1, t, 1)) \\n \\n else:\\n #buy it or not today\\n cache[d][t][own] = max( dfs(d + 1, t + 1, 1) - prices[d], dfs(d + 1, t, 0))\\n\\n return cache[d][t][own]\\n \\n return dfs(0, 0, 0)\\n\",\n \"memory\": \"41164\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n def dfs(i, buy, k):\\n if i == n:\\n return 0\\n\\n if k == 0:\\n return 0\\n\\n if cache[i][k][buy] != -1:\\n return cache[i][k][buy]\\n\\n if buy:\\n res = max(\\n -prices[i] + dfs(i+1, 0, k-1),\\n dfs(i+1, 1, k)\\n )\\n cache[i][k][buy] = res\\n return res\\n\\n res = max(\\n prices[i] + dfs(i+1, 1, k-1),\\n dfs(i+1, 0, k)\\n )\\n cache[i][k][buy] = res\\n return res\\n \\n n = len(prices)\\n cache = [[[-1, -1] for _ in range(2*k+1)] for _ in range(n)]\\n return dfs(0, 1, 2*k)\",\n \"memory\": \"42010\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.memo = dict()\\n def helper(self, idx, count, state):\\n key = \\\"{},{},{}\\\".format(idx, count, state)\\n if key in self.memo:\\n return self.memo[key]\\n if idx == len(self.prices) or count == 0:\\n return 0\\n if state == 0:\\n ans = max(\\n self.helper(idx+1, count, 0),\\n self.helper(idx+1, count, 1) - self.prices[idx]\\n )\\n else:\\n ans = max(\\n self.helper(idx+1, count, 1),\\n self.helper(idx+1, count-1, 0) + self.prices[idx]\\n )\\n self.memo[key] = ans\\n return ans\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n self.prices = prices\\n return self.helper(0, k, 0)\",\n \"memory\": \"42010\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n\\n def get_value(x, y, z, profit_matrix):\\n if x < 0 or y < 0 or z < 0:\\n return -float('inf')\\n else:\\n return profit_matrix[x][y][z]\\n\\n profit_matrix = []\\n for day in range(len(prices)):\\n profit_matrix.append([[-float('inf')] * 2 for _ in range(2 * k + 1)])\\n\\n # profit matrix is day * transaction count * 2 (0/1 whether holding the stock or not)\\n profit_matrix[0][0][0] = 0\\n profit_matrix[0][1][1] = -prices[0]\\n\\n\\n for day in range(1, len(prices)):\\n for t in range(2 * k + 1):\\n # profit_matrix[day][t][0] = max(profit_matrix[day - 1][t -1][1] + prices[day], profit_matrix[day - 1][t][0])\\n # profit_matrix[day][t][1] = max(profit_matrix[day - 1][t -1][0] - prices[day], profit_matrix[day - 1][t][1])\\n profit_matrix[day][t][0] = max(get_value(day - 1, t -1, 1, profit_matrix) + prices[day], get_value(day - 1, t, 0, profit_matrix))\\n profit_matrix[day][t][1] = max(get_value(day - 1, t -1, 0, profit_matrix) - prices[day], get_value(day - 1, t, 1, profit_matrix))\\n \\n\\n max_profit = 0\\n for day in range(len(prices)):\\n for t in range(2 * k + 1):\\n for hold in [0, 1]:\\n max_profit = max(max_profit, profit_matrix[day][t][hold])\\n\\n return max_profit\\n \",\n \"memory\": \"42856\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n=len(prices)\\n dp={}\\n # dp[i, j]=x,y.\\n # x: max proft if at day i you are holding the j-th stock\\n # y: max profit if at day i you are flat and did j buy/sell orders total\\n # dp[i, j][0] = max(dp[i-1,j-1][1]-prices[i], dp[i-1][j][0])\\n # dp[i, j][1] = max(dp[i,j][0]+prices[i], dp[i-1,j][1])\\n\\n for i in range(n):\\n for j in range(k+1):\\n dp[i,j]=[0, 0]\\n if i==0:\\n if j==1:\\n dp[i, j]=[-prices[0], 0]\\n elif j>1:\\n dp[i, j]=[-float('inf'),-float('inf')]\\n else:\\n if j==0:\\n dp[i, j] = dp[i-1, j]\\n else:\\n dp[i, j][0] = max(dp[i-1,j-1][1]-prices[i], dp[i-1,j][0])\\n dp[i, j][1] = max(dp[i, j][0]+prices[i], dp[i-1,j][1])\\n\\n return max([dp[n-1,j][1] for j in range(k+1)])\\n \\n \\n\\n \",\n \"memory\": \"43703\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n=len(prices)\\n dp={}\\n # dp[i, j]=x,y.\\n # x: max proft if at day i you are holding the j-th stock\\n # y: max profit if at day i you are flat and did j buy/sell orders total\\n # dp[i, j][0] = max(dp[i-1,j-1][1]-prices[i], dp[i-1][j][0])\\n # dp[i, j][1] = max(dp[i,j][0]+prices[i], dp[i-1,j][1])\\n\\n for i in range(n):\\n for j in range(k+1):\\n dp[i,j]=[0, 0]\\n if i==0:\\n if j==1:\\n dp[i, j]=[-prices[0], 0]\\n elif j>1:\\n dp[i, j]=[-float('inf'),-float('inf')]\\n else:\\n if j==0:\\n dp[i, j] = dp[i-1, j]\\n else:\\n dp[i, j][0] = max(dp[i-1,j-1][1]-prices[i], dp[i-1,j][0])\\n dp[i, j][1] = max(dp[i, j][0]+prices[i], dp[i-1,j][1])\\n\\n for i in range(n):\\n print(prices[:i+1])\\n print([dp[i, j] for j in range(k+1)])\\n print(30*'-')\\n return max([dp[n-1,j][1] for j in range(k+1)])\\n \\n \\n\\n \",\n \"memory\": \"43703\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n self.memo = {}\\n self.prices = prices\\n\\n value = self.iterate(0, k, False)\\n # print(self.memo)\\n return value\\n\\n def iterate(self, day_idx: int, k: int, is_holding: bool) -> int:\\n memo_key = f\\\"{day_idx}-{k}-{is_holding}\\\"\\n if memo_key in self.memo:\\n return self.memo[memo_key]\\n \\n if day_idx >= len(self.prices):\\n return 0\\n \\n # print(f\\\"iterating {day_idx}\\\")\\n if is_holding:\\n sell = self.prices[day_idx]+self.iterate(day_idx+1, k, False)\\n hold = self.iterate(day_idx+1, k, True)\\n value = max(sell, hold)\\n else:\\n if k > 0:\\n buy = -self.prices[day_idx]+self.iterate(day_idx+1, k-1, True)\\n else:\\n buy = float(\\\"-inf\\\")\\n hold = self.iterate(day_idx+1, k, False)\\n value = max(buy, hold)\\n \\n self.memo[memo_key] = value\\n return value\\n\\n \",\n \"memory\": \"44549\"\n },\n {\n \"code\": \"class Trade:\\n def __init__(self, buy, profit):\\n self.buy = buy\\n self.profit = profit\\n def __str__(self):\\n return f\\\"T({self.buy},{self.profit})\\\"\\n def __repr__(self):\\n return str(self)\\nclass Minpx:\\n def __init__(self, px, idx):\\n self.px = px\\n self.idx = idx\\n def __repr__(self):\\n return str(self)\\n def __str__(self):\\n return f\\\"MP({self.px},{self.idx})\\\"\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n mp = [Minpx(prices[0],0)]\\n for i in range(1,len(prices)):\\n if(mp[i-1].px > prices[i]):\\n mp.append(Minpx(prices[i],i))\\n else:\\n mp.append(mp[-1])\\n trds = [[] * len(prices)]\\n for i in range(1, len(prices)):\\n trds.append([])\\n for j in range(0,i):\\n profit = prices[i] - prices[j]\\n if(profit > 0):\\n trds[i].append(Trade(j,profit))\\n #j=mp[j].idx - 1\\n\\n #print(trds)\\n dp = [[0] * (k+1) for _ in range(len(prices))]\\n for pIdx in range(1,len(dp)):\\n for trdNum in range(1,len(dp[0])):\\n dp[pIdx][trdNum] = dp[pIdx-1][trdNum]\\n for trd in trds[pIdx]:\\n dp[pIdx][trdNum] = max(dp[pIdx][trdNum], trd.profit + dp[trd.buy][trdNum-1])\\n #print(dp)\\n return dp[-1][-1]\",\n \"memory\": \"45395\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n # Transaction type - (buy,sell): 0,0 - 1,0 - 1,1 - 2,1 - 2,2 - ...\\n f = [[[0 if q <= 2 else -math.inf for q in range(1 + k * 2)] for i in range(n)] for j in range(4)]\\n\\n\\n # [0, -prices[0], 0, -math.inf, -math.inf, ...] # buy\\n # [0, 0, 0, -math.inf, -math.inf, ...] # sell\\n # [0, 0, 0, -math.inf, -math.inf, ...] # skip buy\\n # [-math.inf, -math.inf, -math.inf, -math.inf, -math.inf, ...] # skip sell\\n\\n f[0][0][1] = -prices[0]\\n f[3][0][0] = -math.inf\\n f[3][0][1] = -math.inf\\n f[3][0][2] = -math.inf\\n\\n for i in range(1, n):\\n for j in range(1, 1 + k * 2, 2):\\n f[0][i][j - 1] = max(f[1][i - 1][j - 1], f[2][i - 1][j - 1])\\n f[0][i][j] = f[0][i][j - 1] - prices[i]\\n\\n f[2][i][j - 1] = max(f[1][i - 1][j - 1], f[2][i - 1][j - 1])\\n f[2][i][j] = max(f[1][i - 1][j], f[2][i - 1][j])\\n\\n for j in range(2, 1 + k * 2, 2):\\n f[1][i][j - 1] = max(f[0][i - 1][j - 1], f[3][i - 1][j - 1])\\n f[1][i][j] = f[1][i][j - 1] + prices[i]\\n\\n f[3][i][j - 1] = max(f[0][i - 1][j - 1], f[3][i - 1][j - 1])\\n f[3][i][j] = max(f[0][i - 1][j], f[3][i - 1][j])\\n\\n\\n return max(val for l in f[1] for val in l)\",\n \"memory\": \"46241\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n\\n # Transaction type - (buy,sell): 0,0 - 1,0 - 1,1 - 2,1 - 2,2 - ...\\n f = [[[0 if q <= 2 else -math.inf for q in range(1 + k * 2)] for i in range(n)] for j in range(4)]\\n\\n\\n # [0, -prices[0], 0, -math.inf, -math.inf, ...] # buy\\n # [0, 0, 0, -math.inf, -math.inf, ...] # sell\\n # [0, 0, 0, -math.inf, -math.inf, ...] # skip buy\\n # [-math.inf, -math.inf, -math.inf, -math.inf, -math.inf, ...] # skip sell\\n\\n f[0][0][1] = -prices[0]\\n f[3][0][0] = -math.inf\\n f[3][0][1] = -math.inf\\n f[3][0][2] = -math.inf\\n \\n\\n for i in range(1, n):\\n for j in range(1, 1 + k * 2, 2):\\n f[0][i][j - 1] = max(f[1][i - 1][j - 1], f[2][i - 1][j - 1])\\n f[0][i][j] = f[0][i][j - 1] - prices[i]\\n\\n f[2][i][j - 1] = max(f[1][i - 1][j - 1], f[2][i - 1][j - 1])\\n f[2][i][j] = max(f[1][i - 1][j], f[2][i - 1][j])\\n\\n for j in range(2, 1 + k * 2, 2):\\n f[1][i][j - 1] = max(f[0][i - 1][j - 1], f[3][i - 1][j - 1])\\n f[1][i][j] = f[1][i][j - 1] + prices[i]\\n\\n f[3][i][j - 1] = max(f[0][i - 1][j - 1], f[3][i - 1][j - 1])\\n f[3][i][j] = max(f[0][i - 1][j], f[3][i - 1][j])\\n\\n\\n return max(val for l in f[1] for val in l)\",\n \"memory\": \"47088\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n self.memo = {}\\n self.prices = prices\\n\\n value = self.iterate(0, k, False)\\n print(self.memo)\\n return value\\n\\n def iterate(self, day_idx: int, k: int, is_holding: bool) -> int:\\n memo_key = f\\\"{day_idx}-{k}-{is_holding}\\\"\\n if memo_key in self.memo:\\n return self.memo[memo_key]\\n \\n if day_idx >= len(self.prices):\\n return 0\\n \\n # print(f\\\"iterating {day_idx}\\\")\\n if is_holding:\\n sell = self.prices[day_idx]+self.iterate(day_idx+1, k, False)\\n hold = self.iterate(day_idx+1, k, True)\\n value = max(sell, hold)\\n else:\\n if k > 0:\\n buy = -self.prices[day_idx]+self.iterate(day_idx+1, k-1, True)\\n else:\\n buy = float(\\\"-inf\\\")\\n hold = self.iterate(day_idx+1, k, False)\\n value = max(buy, hold)\\n \\n self.memo[memo_key] = value\\n return value\\n\\n \",\n \"memory\": \"47934\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n @cache\\n def trade(day_d, transaction_i):\\n \\n if day_d <= 0 or transaction_i <= 0:\\n # Can not trade ealry than day #0\\n # Can not trade with 0 transaction or less\\n return 0\\n \\n \\n ## Case_#1\\n # not to transact on day d, all transactions are completed before\\n not_to_transact = trade(day_d-1, transaction_i)\\n \\n \\n ## Case_#2\\n # transact on day_d\\n \\n # update price gain\\n # define price_gain = max( -prices[buy_in] + trade(day_d-1, transaction_i-1) for buy_in in range(day_d) )\\n \\n if day_d == 1:\\n trade.max_gain[transaction_i] = -prices[day_d-1] + trade(day_d-1, transaction_i-1)\\n else:\\n trade.max_gain[transaction_i] = max(trade.max_gain[transaction_i], -prices[day_d-1] + trade(day_d-1, transaction_i-1) )\\n \\n \\n # transact on day_d, carry out i-th transaction now\\n transact = prices[day_d] + trade.max_gain[transaction_i]\\n\\n \\n return max(not_to_transact, transact)\\n \\n # ---------------------------------------------------\\n \\n trade.max_gain = defaultdict(int) \\n return trade(len(prices)-1, k)\",\n \"memory\": \"48780\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp={}\\n n= len(prices)\\n \\n for i in range(n+1):\\n for buy in range(2):\\n for cap in range(k+1):\\n dp[(i,buy,cap)]=0\\n for i in range(n-1,-1,-1):\\n for buy in range(2):\\n for cap in range(1,k+1):\\n if(buy==1):\\n dp[(i,buy,cap)]= max(dp[(i+1,1,cap)],dp[(i+1,0,cap)]-prices[i])\\n else:\\n dp[(i,buy,cap)]= max(dp[(i+1,0,cap)],dp[(i+1,1,cap-1)]+prices[i])\\n return dp[(0,1,k)]\",\n \"memory\": \"49626\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n @cache\\n def dfs(i, j, hold):\\n if j < 0:\\n return -inf\\n if i < 0:\\n return 0 if not hold else -inf\\n if hold:\\n return max(dfs(i-1, j, True), dfs(i-1, j-1, False) - prices[i])\\n return max(dfs(i-1, j, False), dfs(i-1, j, True) + prices[i])\\n n = len(prices)\\n ans = dfs(n-1, k, False)\\n dfs.cache_clear()\\n return ans\",\n \"memory\": \"49626\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n # @cache\\n # def helper( buy , remaining_k , index ):\\n\\n # if index >= len(prices):\\n # return 0\\n # if remaining_k == 0:\\n # return 0\\n \\n # # do something\\n # if buy:\\n # ans = -prices[index] + helper( not buy , remaining_k, index + 1 )\\n # else:\\n # ans = prices[index] + helper( not buy , remaining_k - 1 , index + 1 )\\n # # do nothing\\n # ans = max(ans, \\n # helper( buy , remaining_k , index + 1 )\\n # )\\n # return ans\\n \\n # return helper( True , k , 0 )\\n\\n dp = defaultdict(int)\\n for index in range(len(prices)-1,-1,-1):\\n for remaining_k in range(1,k+1):\\n for buy in range(2):\\n if buy == 0:\\n ans = -prices[index] + dp[(1-buy,remaining_k,index+1)]\\n else:\\n ans = prices[index] + dp[(1-buy,remaining_k-1,index+1)]\\n \\n dp[(buy,remaining_k,index)] = max(ans , dp[(buy,remaining_k,index+1)])\\n return dp[(0,k,0)]\",\n \"memory\": \"50473\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n # @cache\\n # def helper( buy , remaining_k , index ):\\n\\n # if index >= len(prices):\\n # return 0\\n # if remaining_k == 0:\\n # return 0\\n \\n # # do something\\n # if buy:\\n # ans = -prices[index] + helper( not buy , remaining_k, index + 1 )\\n # else:\\n # ans = prices[index] + helper( not buy , remaining_k - 1 , index + 1 )\\n # # do nothing\\n # ans = max(ans, \\n # helper( buy , remaining_k , index + 1 )\\n # )\\n # return ans\\n \\n # return helper( True , k , 0 )\\n\\n dp = defaultdict(int)\\n for index in range(len(prices)-1,-1,-1):\\n for remaining_k in range(1,k+1):\\n for buy in range(2):\\n if buy == 0:\\n ans = -prices[index] + dp[(1-buy,remaining_k,index+1)]\\n else:\\n ans = prices[index] + dp[(1-buy,remaining_k-1,index+1)]\\n \\n dp[(buy,remaining_k,index)] = max(ans , dp[(buy,remaining_k,index+1)])\\n return dp[(0,k,0)]\",\n \"memory\": \"50473\"\n },\n {\n \"code\": \"class Solution:\\n def dp(self, prices, day, num_bought, hold):\\n global memo\\n key = (day, num_bought, hold)\\n if key in memo:\\n return memo[key]\\n if num_bought <= 0:\\n memo[key] = 0\\n elif hold == False:\\n if day == 0:\\n memo[key] = 0\\n else:\\n memo[key] = max(self.dp(prices, day-1, num_bought, False), self.dp(prices, day-1, num_bought, True) + prices[day])\\n else:\\n if day == 0:\\n memo[key] = -prices[day]\\n else:\\n memo[key] = max(self.dp(prices, day-1, num_bought, True), self.dp(prices, day-1, num_bought-1, False) - prices[day])\\n return memo[key]\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n global memo\\n memo = {}\\n return self.dp(prices, len(prices)-1, k, False)\\n \\n \",\n \"memory\": \"51319\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n self.prices = prices\\n self.cache = {}\\n\\n return self.dp(0, k, 0)\\n\\n def dp(self, i: int, transactions_remaining: int, holding: int) -> int:\\n if transactions_remaining == 0 or i == len(self.prices):\\n return 0\\n\\n if (i, transactions_remaining, holding) in self.cache:\\n return self.cache[(i, transactions_remaining, holding)]\\n\\n do_nothing = self.dp(i + 1, transactions_remaining, holding) \\n buy_or_sell = 0\\n if holding:\\n buy_or_sell = self.prices[i] + self.dp(i + 1,\\n transactions_remaining - 1, 0)\\n else:\\n buy_or_sell = -self.prices[i] + self.dp(i + 1,\\n transactions_remaining, 1)\\n\\n self.cache[(i, transactions_remaining, holding)] = max(do_nothing,\\\\\\n buy_or_sell)\\n\\n return self.cache[(i, transactions_remaining, holding)]\",\n \"memory\": \"52165\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = {}\\n return recur(prices, 0, 0, 0, dp, k)\\n\\n\\ndef recur(arr, i, buy, k, dp, req):\\n if (i, buy, k) in dp:\\n return dp[(i, buy, k)]\\n if i == len(arr):\\n return 0\\n if k == req:\\n return 0\\n if buy == 0:\\n x = max(recur(arr, i+1, 0, k, dp, req), 0 - arr[i] + recur(arr, i+1, 1, k, dp, req))\\n else:\\n x = max(recur(arr, i+1, 1, k, dp, req), arr[i] + recur(arr, i+1, 0, k+1, dp, req))\\n dp[(i, buy, k)] = x\\n return x\\n\",\n \"memory\": \"53011\"\n },\n {\n \"code\": \"class Solution:\\n def getMaxProfit(self, index: int, holding_stock: bool, txn_count: int, prices: List[int], cache: Dict, k: int) -> int:\\n # since we reached end of array\\n if index == len(prices):\\n return 0\\n\\n elif (index, holding_stock, txn_count) in cache:\\n return cache[(index, holding_stock, txn_count)]\\n \\n max_profit = 0\\n\\n if holding_stock:\\n # do not sell the stock currently we are holding\\n case_1 = self.getMaxProfit(index + 1, holding_stock, txn_count, prices, cache, k)\\n\\n # else I sell that stock\\n if txn_count < k - 1:\\n case_2 = prices[index] + self.getMaxProfit(index + 1, False, txn_count + 1, prices, cache, k)\\n\\n # means we have performed 2 transactions now so do not call functions again\\n elif txn_count == k - 1:\\n case_2 = prices[index]\\n\\n max_profit = max(case_1, case_2)\\n cache[(index, holding_stock, txn_count)] = max_profit\\n\\n else:\\n # do not buy the current stock\\n case_1 = self.getMaxProfit(index + 1, holding_stock, txn_count, prices, cache, k)\\n \\n # else I buy that stock\\n case_2 = self.getMaxProfit(index + 1, True, txn_count, prices, cache, k) - prices[index]\\n\\n max_profit = max(case_1, case_2)\\n cache[(index, holding_stock, txn_count)] = max_profit\\n\\n return max_profit\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n cache = dict()\\n return self.getMaxProfit(0, False, 0, prices, cache, k)\",\n \"memory\": \"53011\"\n },\n {\n \"code\": \"class Solution:\\n def helper(self, prices, i, sell, num_buy_left, mem):\\n if i == len(prices):\\n return 0\\n \\n b, h, s = 0, 0, 0\\n if (i, sell, num_buy_left) in mem:\\n return mem[(i, sell, num_buy_left)]\\n\\n if sell == 0 and num_buy_left > 0:\\n # buy\\n b = -prices[i] + self.helper(prices, i + 1, 1, num_buy_left - 1, mem)\\n \\n # hold as is dont buy or sell\\n h = self.helper(prices, i + 1, sell, num_buy_left, mem)\\n\\n # sell\\n if sell == 1:\\n s = prices[i] + self.helper(prices, i + 1, 0, num_buy_left, mem)\\n \\n mem[(i, sell, num_buy_left)] = max(b, h, s)\\n return mem[(i, sell, num_buy_left)]\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n mem = {}\\n return self.helper(prices, 0, 0, k, mem)\\n\",\n \"memory\": \"53858\"\n },\n {\n \"code\": \"class Solution:\\n \\\"\\\"\\\"\\n First solution I came up with, it's accepted but very slow: beats 5.05%.\\n The DP bottom up solution of the editorial beats 40%.\\n \\\"\\\"\\\"\\n def maxProfitHelper(self, prices, i, minPrice, attemptsLeft, memo):\\n # It is tempting to not want to use attemptsLeft in the key of the memo table, but\\n # the callers need to know how many attempts were used to calculate the solution\\n # of a given prefix since they will have so many attempts left.\\n if i >= len(prices) or attemptsLeft == 0:\\n return 0\\n elif (i, minPrice, attemptsLeft) in memo:\\n return memo[(i, minPrice, attemptsLeft)]\\n\\n currentPrice = prices[i]\\n if currentPrice <= minPrice:\\n memo[(i, minPrice, attemptsLeft)] = self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft, memo)\\n else:\\n\\n while i+1 < len(prices)-1 and prices[i+1] > currentPrice:\\n i += 1\\n currentPrice = prices[i]\\n\\n memo[(i, minPrice, attemptsLeft)] = max(\\n self.maxProfitHelper(prices, i+1, minPrice, attemptsLeft, memo),\\n self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft-1, memo) + currentPrice - minPrice)\\n\\n return memo[(i, minPrice, attemptsLeft)]\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo = {}\\n return self.maxProfitHelper(prices, 1, prices[0], k, memo)\\n\\n\",\n \"memory\": \"54704\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n def fun(ind,b,t,d):\\n if ind==len(prices):\\n return 0\\n if t==0:\\n return 0\\n if (ind,b,t) in d:\\n return d[(ind,b,t)]\\n if b==0:\\n x=-prices[ind]+fun(ind+1,1,t,d)\\n y=fun(ind+1,0,t,d)\\n d[(ind,b,t)]=max(x,y)\\n else:\\n x=prices[ind]+fun(ind+1,0,t-1,d)\\n y=fun(ind+1,1,t,d)\\n d[(ind,b,t)]=max(x,y)\\n return d[(ind,b,t)] \\n return fun(0,0,k,{}) \\n \",\n \"memory\": \"55550\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k, prices, i=0, can_buy=True, cache=None):\\n # build cache with key (i, can_buy, k)\\n if cache is None:\\n cache = dict()\\n # exit at boundary conditions\\n if k == 0 or i == len(prices):\\n return 0\\n # define current key\\n key = (i, can_buy, k)\\n # compute max profits recursively\\n if key not in cache:\\n if can_buy:\\n cache[key] = max(\\n # buy at index i\\n self.maxProfit(k, prices, i + 1, False, cache) - prices[i],\\n # don't buy at index i\\n self.maxProfit(k, prices, i + 1, True, cache)\\n )\\n else:\\n cache[key] = max(\\n # sell at index i\\n prices[i] + self.maxProfit(k - 1, prices, i + 1, True, cache),\\n # don't sell at index i\\n self.maxProfit(k, prices, i + 1, False, cache)\\n )\\n return cache[key]\\n\\n\",\n \"memory\": \"55550\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n @functools.cache\\n def dp(day: int, holds_stock: bool, k_left: int) -> int:\\n if day >= len(prices):\\n return 0\\n\\n actions = []\\n if holds_stock:\\n sell_stock = prices[day] + dp(day + 1, False, k_left)\\n actions.append(sell_stock)\\n \\n else:\\n if k_left > 0:\\n buy_stock = -prices[day] + dp(day + 1, True, k_left - 1)\\n actions.append(buy_stock)\\n\\n do_nothing = dp(day + 1, holds_stock, k_left)\\n actions.append(do_nothing)\\n\\n return max(actions)\\n\\n return dp(0, False, k)\\n\",\n \"memory\": \"56396\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n @functools.cache\\n def dp(day: int, holds_stock: bool, k_left: int) -> int:\\n if day >= len(prices):\\n return 0\\n\\n actions = []\\n if holds_stock:\\n sell_stock = prices[day] + dp(day + 1, False, k_left)\\n actions.append(sell_stock)\\n \\n else:\\n if k_left > 0:\\n buy_stock = -prices[day] + dp(day + 1, True, k_left - 1)\\n actions.append(buy_stock)\\n\\n do_nothing = dp(day + 1, holds_stock, k_left)\\n actions.append(do_nothing)\\n\\n return max(actions)\\n\\n return dp(0, False, k)\\n\",\n \"memory\": \"56396\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self) -> None:\\n self.__mem_buy: dict[tuple[int, int], int] = {}\\n self.__mem_sell: dict[tuple[int, int], tuple[int, int]]\\n self.__prices: list[int] = []\\n \\n def __dp_buy(self, idx: int, count: int) -> int:\\n if (count == 0):\\n return 0\\n \\n if (idx == len(self.__prices) - 1):\\n return 0\\n \\n key = (idx, count)\\n \\n if (self.__mem_buy.get(key) is not None):\\n return self.__mem_buy[key]\\n \\n result = max(self.__dp_buy(idx + 1, count), self.__dp_sell(idx, count)[0])\\n \\n self.__mem_buy[key] = result\\n \\n return result\\n \\n def __dp_sell(self, idx: int, count: int) -> tuple[int, int]:\\n price = self.__prices[idx]\\n \\n if (idx == len(self.__prices) - 1):\\n return (0, price)\\n \\n key = (idx, count)\\n \\n if (self.__mem_sell.get(key) is not None):\\n return self.__mem_sell[key]\\n \\n result = None\\n next_price = self.__prices[idx + 1]\\n \\n if (price < next_price): \\n temp = self.__dp_sell(idx + 1, count)\\n result = (temp[0] + next_price - price, temp[1])\\n \\n else:\\n result = (self.__dp_buy(idx, count - 1), price)\\n \\n temp = self.__dp_sell(idx + 1, count) \\n temp = (temp[0] - price + next_price, temp[1])\\n \\n if (temp[0] > result[0]):\\n result = temp\\n \\n self.__mem_sell[key] = result\\n \\n return result\\n \\n \\n \\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n self.__prices = prices\\n self.__mem_buy = {}\\n self.__mem_sell = {}\\n \\n return self.__dp_buy(0, k)\",\n \"memory\": \"57243\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n def func(i,buy,prices,ct,dic):\\n if i>=len(prices) or ct==0:\\n return 0\\n if (i,buy,ct) in dic:\\n return dic[(i,buy,ct)]\\n x,y,a,b=0,0,0,0\\n if buy:\\n x=-prices[i]+func(i+1,False,prices,ct,dic)\\n y=0+func(i+1,buy,prices,ct,dic)\\n else:\\n a=prices[i]+func(i+1,True,prices,ct-1,dic)\\n b=0+func(i+1,buy,prices,ct,dic)\\n dic[(i,buy,ct)]=max(a,b,x,y)\\n return max(a,b,x,y)\\n return func(0,True,prices,k,{})\",\n \"memory\": \"57243\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n def func(i,buy,prices,ct,dic):\\n if i>=len(prices) or ct==0:\\n return 0\\n if (i,buy,ct) in dic:\\n return dic[(i,buy,ct)]\\n x,y,a,b=0,0,0,0\\n if buy:\\n x=-prices[i]+func(i+1,False,prices,ct,dic)\\n y=0+func(i+1,buy,prices,ct,dic)\\n else:\\n a=prices[i]+func(i+1,True,prices,ct-1,dic)\\n b=0+func(i+1,buy,prices,ct,dic)\\n dic[(i,buy,ct)]=max(a,b,x,y)\\n return max(a,b,x,y)\\n return func(0,True,prices,k,{})\\n\",\n \"memory\": \"58089\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n def func(i,buy,prices,ct,dic):\\n if i>=len(prices) or ct==0:\\n return 0\\n if (i,buy,ct) in dic:\\n return dic[(i,buy,ct)]\\n x,y,a,b=0,0,0,0\\n if buy:\\n x=-prices[i]+func(i+1,False,prices,ct,dic)\\n y=0+func(i+1,buy,prices,ct,dic)\\n else:\\n a=prices[i]+func(i+1,True,prices,ct-1,dic)\\n b=0+func(i+1,buy,prices,ct,dic)\\n dic[(i,buy,ct)]=max(a,b,x,y)\\n return max(a,b,x,y)\\n return func(0,True,prices,k,{})\\n \",\n \"memory\": \"58089\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n maxProfits = {}\\n N = len(prices)\\n\\n for i in range(N):\\n maxProfits[i] = {}\\n mP = 0\\n minBuy = prices[i]\\n for j in range(i, N):\\n mP = max(max(prices[j] - minBuy, 0), mP)\\n maxProfits[i][j] = mP\\n minBuy = min(minBuy, prices[j])\\n\\n trans = [maxProfits[0][i] for i in range(N)]\\n for _ in range(k-1):\\n prevTrans = trans\\n trans = []\\n mP = 0\\n idx = 0\\n val = prevTrans[idx] - prices[idx]\\n for i in range(N):\\n mP = max(prevTrans[idx] + maxProfits[idx][i], mP)\\n newVal = prevTrans[i] - prices[i]\\n if val < newVal:\\n idx, val = i, newVal\\n trans.append(mP)\\n return trans[-1]\",\n \"memory\": \"58935\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n maxProfits = {}\\n N = len(prices)\\n\\n for i in range(N):\\n maxProfits[i] = {}\\n mP = 0\\n minBuy = prices[i]\\n for j in range(i, N):\\n mP = max(max(prices[j] - minBuy, 0), mP)\\n maxProfits[i][j] = mP\\n minBuy = min(minBuy, prices[j])\\n\\n trans = [maxProfits[0][i] for i in range(N)]\\n print(trans)\\n for _ in range(k-1):\\n prevTrans = trans\\n trans = []\\n mP = 0\\n idx = 0\\n val = prevTrans[idx] - prices[idx]\\n for i in range(N):\\n mP = max(prevTrans[idx] + maxProfits[idx][i], mP)\\n newVal = prevTrans[i] - prices[i]\\n if val < newVal:\\n idx, val = i, newVal\\n trans.append(mP)\\n # print(i, idx, mP)\\n # print(trans)\\n return trans[-1]\",\n \"memory\": \"58935\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n def destroy_directions(arr: List[int]):\\n to_remove = set()\\n for i in range(1, len(arr) - 1):\\n if arr[i] == arr[i + 1]:\\n to_remove.add(i)\\n arr = [x for i, x in enumerate(arr) if i not in to_remove]\\n to_remove = set()\\n for i in range(1, len(arr) - 1):\\n if arr[i - 1] <= arr[i] <= arr[i + 1] or arr[i + 1] <= arr[i] <= arr[i - 1]:\\n to_remove.add(i)\\n\\n return [x for i, x in enumerate(arr) if i not in to_remove]\\n\\n # print(len(prices))\\n prices = destroy_directions(prices)\\n \\n @lru_cache(None)\\n def selling(start, rem):\\n M, ans = prices[start], 0\\n for sell in range(start + 1, len(prices)):\\n if prices[sell] > M:\\n ans = max(ans, prices[sell] - prices[start] + buying(sell + 1, rem - 1))\\n M = prices[sell]\\n return ans\\n\\n @lru_cache(None)\\n def buying(start, rem):\\n if rem == 0 or start >= len(prices) - 1: return 0\\n return max(selling(start, rem), buying(start + 1, rem))\\n\\n return buying(0, k)\",\n \"memory\": \"59781\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n maxProfits = {}\\n N = len(prices)\\n\\n for i in range(N):\\n maxProfits[i] = {}\\n mP = 0\\n minBuy = prices[i]\\n for j in range(i, N):\\n mP = max(max(prices[j] - minBuy, 0), mP)\\n maxProfits[i][j] = mP\\n minBuy = min(minBuy, prices[j])\\n\\n transactions = [[maxProfits[0][i] for i in range(N)]]\\n for _ in range(k-1):\\n transactions.append([])\\n mP = 0\\n idx = 0\\n for i in range(N):\\n profit = 0\\n j = idx\\n while j < i:\\n if transactions[-2][j] + maxProfits[j][i] > profit:\\n idx = j\\n profit = transactions[-2][j] + maxProfits[j][i]\\n j += 1\\n mP = max(profit, mP)\\n transactions[-1].append(mP)\\n\\n return transactions[-1][-1]\",\n \"memory\": \"59781\"\n },\n {\n \"code\": \"def neg(b):\\n if b != 0:\\n return 0\\n return 1\\n\\n\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = [\\n [\\n [[-float(\\\"inf\\\") for _ in range(3)] for _ in range(2)]\\n for _ in range(k + 1)\\n ]\\n for _ in range(len(prices) + 1)\\n ]\\n for i in range(len(prices) + 1):\\n prices_i = i - 1\\n for num_transactions in range(k + 1):\\n for holding in range(2):\\n for action in range(3):\\n if i == 0:\\n if num_transactions == 0 and action == 0 and holding == 0:\\n dp[i][num_transactions][holding][action] = 0\\n continue\\n if num_transactions == 0 and action == 2:\\n continue\\n if holding == 1 and action == 2:\\n continue\\n if holding == 0 and action == 1:\\n continue\\n match action:\\n case 0: # Sit -> Last action was sit, buy or sell\\n dp[i][num_transactions][holding][action] = max(\\n dp[i - 1][num_transactions][holding][action],\\n dp[i - 1][num_transactions][holding][1],\\n dp[i - 1][num_transactions][holding][2],\\n )\\n case 1: # Buy -> Last action was sit or sell\\n dp[i][num_transactions][holding][action] = -prices[\\n prices_i\\n ] + max(\\n dp[i - 1][num_transactions][neg(holding)][0],\\n dp[i - 1][num_transactions][neg(holding)][2],\\n )\\n case 2: # Sell -> Last action was sit or buy\\n dp[i][num_transactions][holding][action] = prices[\\n prices_i\\n ] + max(\\n dp[i - 1][num_transactions - 1][neg(holding)][0],\\n dp[i - 1][num_transactions - 1][neg(holding)][1],\\n )\\n return max(\\n max(max(max(sssdp) for sssdp in sub_sub_dp) for sub_sub_dp in sub_dp)\\n for sub_dp in dp\\n )\\n\",\n \"memory\": \"60628\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n if not prices or not k:\\n return 0\\n \\n @cache\\n def top_down(i, trans_left, holding):\\n if trans_left == 0 or i == n:\\n return 0\\n\\n if dp[i][trans_left][holding] >= 0:\\n return dp[i][trans_left][holding]\\n\\n do_nothing = top_down(i+1, trans_left, holding)\\n\\n price = prices[i]\\n if holding: # Buy stock\\n dp[i][trans_left][holding] = max(price + top_down(i+1, trans_left-1, not holding), do_nothing)\\n else: # Sell stock\\n dp[i][trans_left][holding] = max(-price + top_down(i+1, trans_left, not holding), do_nothing)\\n\\n return dp[i][trans_left][holding]\\n\\n n = len(prices)\\n dp = [[[-1] * (2) for _ in range(k+1)] for _ in range(n)]\\n ans = top_down(0, k, False)\\n\\n return dp[0][k][0]\",\n \"memory\": \"61474\"\n },\n {\n \"code\": \"from typing import List\\n\\n\\nclass Solution:\\n def __init__(self):\\n self.memo = {}\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n return self.rec(prices, 0, 0, 0, k)\\n\\n def rec(self, prices: List[int], num_transactions: int, left: int, right: int, k: int) -> int:\\n if num_transactions == k:\\n return 0\\n memo_key = (num_transactions, (left, right))\\n if memo_key in self.memo:\\n return self.memo[memo_key]\\n\\n while right < len(prices) - 1:\\n profit = prices[right] - prices[left]\\n if profit <= 0:\\n left = right\\n elif prices[right + 1] < prices[right]:\\n res = max(\\n profit + self.rec(prices, num_transactions + 1, right, right + 1, k),\\n self.rec(prices, num_transactions, left, right + 1, k)\\n )\\n self.memo[memo_key] = res\\n return res\\n right += 1\\n profit = prices[right] - prices[left]\\n res = profit if profit > 0 else 0\\n self.memo[memo_key] = res\\n return res\\n\\n\",\n \"memory\": \"62320\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n num_days = len(prices)\\n\\n dp = {}\\n def _max_profit(day: int, transactions_remaining: int, holding: bool) -> int:\\n if day >= num_days:\\n return 0\\n\\n if transactions_remaining <= 0:\\n return 0\\n\\n key = \\\",\\\".join((str(day), str(transactions_remaining), str(holding)))\\n if key in dp:\\n return dp[key]\\n\\n max_profit = max(\\n _max_profit(day + 1, transactions_remaining, holding),\\n _max_profit(day + 1, transactions_remaining - (1 if holding else 0), not holding) + \\n (1 if holding else -1) * prices[day]\\n )\\n dp[key] = max_profit\\n return max_profit\\n\\n \\n return _max_profit(0, k, False)\",\n \"memory\": \"63166\"\n },\n {\n \"code\": \"class Solution:\\n \\\"\\\"\\\"\\n First solution I came up with, it's accepted but very slow: beats 5.05%.\\n The DP bottom up solution of the editorial beats 40%.\\n \\\"\\\"\\\"\\n def maxProfitHelper(self, prices, i, minPrice, attemptsLeft, memo):\\n # It is tempting to not want to use attemptsLeft in the key of the memo table, but\\n # the callers need to know how many attempts were used to calculate the solution\\n # of a given prefix since they will have so many attempts left.\\n if i >= len(prices) or attemptsLeft == 0:\\n return 0\\n elif (i, minPrice, attemptsLeft) in memo:\\n return memo[(i, minPrice, attemptsLeft)]\\n\\n currentPrice = prices[i]\\n if currentPrice <= minPrice:\\n memo[(i, minPrice, attemptsLeft)] = self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft, memo)\\n elif i+1 < len(prices)-1 and prices[i+1] > currentPrice:\\n memo[(i, minPrice, attemptsLeft)] = self.maxProfitHelper(prices, i+1, minPrice, attemptsLeft, memo)\\n else:\\n memo[(i, minPrice, attemptsLeft)] = max(\\n self.maxProfitHelper(prices, i+1, minPrice, attemptsLeft, memo),\\n self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft-1, memo) + currentPrice - minPrice)\\n\\n return memo[(i, minPrice, attemptsLeft)]\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo = {}\\n return self.maxProfitHelper(prices, 1, prices[0], k, memo)\\n\\n\",\n \"memory\": \"64013\"\n },\n {\n \"code\": \"class Solution:\\n \\\"\\\"\\\"\\n First solution I came up with, it's accepted but very slow: beats 5.05%.\\n The DP bottom up solution of the editorial beats 40%.\\n \\\"\\\"\\\"\\n def maxProfitHelper(self, prices, i, minPrice, attemptsLeft, memo):\\n # It is tempting to not want to use attemptsLeft in the key of the memo table, but\\n # the callers need to know how many attempts were used to calculate the solution\\n # of a given prefix since they will have so many attempts left.\\n if i >= len(prices) or attemptsLeft == 0:\\n return 0\\n elif (i, minPrice, attemptsLeft) in memo:\\n return memo[(i, minPrice, attemptsLeft)]\\n\\n currentPrice = prices[i]\\n if currentPrice <= minPrice:\\n memo[(i, minPrice, attemptsLeft)] = self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft, memo)\\n elif i+1 < len(prices)-1 and prices[i+1] > currentPrice:\\n memo[(i, minPrice, attemptsLeft)] = self.maxProfitHelper(prices, i+1, minPrice, attemptsLeft, memo)\\n else:\\n memo[(i, minPrice, attemptsLeft)] = max(\\n self.maxProfitHelper(prices, i+1, minPrice, attemptsLeft, memo),\\n self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft-1, memo) + currentPrice - minPrice)\\n\\n return memo[(i, minPrice, attemptsLeft)]\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo = {}\\n return self.maxProfitHelper(prices, 1, prices[0], k, memo)\\n\\n\",\n \"memory\": \"64859\"\n },\n {\n \"code\": \"class Solution:\\n \\\"\\\"\\\"\\n First solution I came up with, it's accepted but very slow: beats 5.05%.\\n The DP bottom up solution of the editorial beats 40%.\\n \\\"\\\"\\\"\\n def maxProfitHelper(self, prices, i, minPrice, attemptsLeft, memo):\\n # It is tempting to not want to use attemptsLeft in the key of the memo table, but\\n # the callers need to know how many attempts were used to calculate the solution\\n # of a given prefix since they will have so many attempts left.\\n if i >= len(prices) or attemptsLeft == 0:\\n return 0\\n elif (i, minPrice, attemptsLeft) in memo:\\n return memo[(i, minPrice, attemptsLeft)]\\n\\n currentPrice = prices[i]\\n if currentPrice <= minPrice:\\n memo[(i, minPrice, attemptsLeft)] = self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft, memo)\\n elif i+1 < len(prices)-1 and prices[i+1] > currentPrice:\\n # This is an optimization based on the fact that we don't need to sell if we aren't at a peak and we won't\\n # get a better solution than if we use the solution that sells at the peak, which is going to be a subproblem\\n # of the current problem.\\n # But it doesn't change the runtime when I submit it unfortunately.\\n memo[(i, minPrice, attemptsLeft)] = self.maxProfitHelper(prices, i+1, minPrice, attemptsLeft, memo)\\n else:\\n memo[(i, minPrice, attemptsLeft)] = max(\\n self.maxProfitHelper(prices, i+1, minPrice, attemptsLeft, memo),\\n self.maxProfitHelper(prices, i+1, currentPrice, attemptsLeft-1, memo) + currentPrice - minPrice)\\n\\n return memo[(i, minPrice, attemptsLeft)]\\n\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo = {}\\n return self.maxProfitHelper(prices, 1, prices[0], k, memo)\\n\\n\",\n \"memory\": \"64859\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n\\n def helper(bought=False,i=0,k=2):\\n if i==N-1:\\n if bought:\\n return prices[i]\\n else:\\n return 0\\n if k==0 and bought==False:\\n return 0\\n STORE = f\\\"{bought},{i},{k}\\\"\\n if d.get(STORE, None)!=None:\\n return d[STORE]\\n ans1 = ans2 = 0\\n if bought: # option to sell or not\\n ans1 = prices[i] + helper(False,i+1,k)\\n ans2 = helper(bought,i+1,k)\\n else: # option to buy or not\\n ans1 = helper(bought,i+1,k)\\n ans2 = -prices[i]+helper(True,i+1,k-1)\\n d[STORE] = max(ans1, ans2)\\n return d[STORE]\\n \\n N = len(prices)\\n d = {}\\n return helper(k=k)\\n \",\n \"memory\": \"65705\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\n[3,2,6,5,10,3]\\n\\ngoing down I think always makes sense for a buy\\nif it's less than you can just make up that profit and it'll be greater than what you otherwise would have had\\n\\n\\n-in order to make money you must sell\\n- looking for the biggest differences that exist\\n- for every number, you do or don't buy it / sell if it's lower than your buy until you hit k\\n\\n[3, 6], [0, 3]\\n[3, 5], [0 ,3]\\n[2, 6], [0, 3]\\nhow could we more efficiently know that 2-6 was going to be better than 3-6\\n- when you are on a sell operation, you can iterate until you find the max\\n- when you are on buy operation, you can iterate until you find the min\\n\\n\\n3, 2, 1, 3, 5, 4\\n\\\"\\\"\\\"\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n prices2 = []\\n l, r = 0, 1\\n\\n while l < len(prices) and r < len(prices):\\n while (l < len(prices) - 1) and prices[l] > prices[l + 1]:\\n l += 1\\n r = l + 1\\n prices2.append(prices[l])\\n while (r < len(prices) - 1) and prices[r] < prices[r + 1]:\\n r += 1\\n if r < len(prices):\\n prices2.append(prices[r])\\n l = r + 1\\n\\n cache = {}\\n def search(idx, buying, t):\\n if idx == len(prices2) or t == k:\\n return 0\\n \\n if (idx, buying, t) in cache:\\n return cache[(idx, buying, t)]\\n \\n if buying:\\n result = max(\\n search(idx + 1, not buying, t) - prices2[idx],\\n search(idx + 1, buying, t),\\n )\\n else:\\n result = max(\\n search(idx + 1, not buying, t + 1) + prices2[idx],\\n search(idx + 1, buying, t),\\n )\\n \\n cache[(idx, buying, t)] = result\\n return result\\n \\n return search(0, True, 0)\\n\\n \\n\\n\\n \",\n \"memory\": \"66551\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n l = [prices[0]]\\n for i in range(1,len(prices)-1):\\n if prices[i]>=prices[i-1] and prices[i]>=prices[i+1]:\\n l.append(prices[i])\\n elif prices[i]<=prices[i-1] and prices[i]<=prices[i+1]:\\n l.append(prices[i])\\n l.append(prices[-1])\\n prices = l\\n @cache\\n def dp(x,have,leave):\\n ans = 0\\n if x < len(prices):\\n if have:\\n ans = max(ans,prices[x]+dp(x+1,False,leave-1))\\n elif leave:\\n ans = max(ans,-prices[x]+dp(x+1,True,leave))\\n ans = max(ans,dp(x+1,have,leave))\\n return ans\\n return dp(0,False,k)\",\n \"memory\": \"67398\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n cache = {}\\n # key = index_action_k\\n \\n def helper(idx, k, can_buy):\\n if idx >= n or k <= 0:\\n return 0\\n \\n key = f\\\"{idx}_{can_buy}_{k}\\\"\\n if key in cache:\\n return cache[key]\\n \\n if can_buy:\\n cache[key] = max(-prices[idx] + helper(idx+1, k, not can_buy), helper(idx+1, k, can_buy))\\n else:\\n cache[key] = max(prices[idx] + helper(idx+1, k-1, not can_buy), helper(idx+1, k, can_buy))\\n return cache[key]\\n\\n return helper(0, k, True)\",\n \"memory\": \"68244\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n N = len(prices)\\n \\n @cache\\n def buy(index, limit):\\n if index == N:\\n return 0\\n \\n tobe = float('-inf')\\n\\n if limit > 0:\\n tobe = sell(index + 1, limit - 1) - prices[index]\\n nottobe = buy(index + 1, limit)\\n\\n return max(nottobe, tobe)\\n\\n @cache\\n def sell(index, limit):\\n if index == N:\\n return 0\\n\\n tobe = sell(index + 1, limit)\\n nottobe = buy(index, limit) + prices[index]\\n\\n return max(tobe, nottobe)\\n\\n return buy(0, k)\",\n \"memory\": \"69090\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # ag prices\\n memo = {}\\n def dp(i, trades, hold, holdStock):\\n if trades == k or i == len(prices):\\n return 0\\n # hold, sell, buy\\n if (i, trades, hold) not in memo:\\n nothing = dp(i + 1, trades, hold, holdStock)\\n buy = 0\\n sell = 0\\n if hold == 0:\\n buy = -prices[i] + dp(i + 1, trades, 1, i)\\n else:\\n if (prices[i] > prices[holdStock]):\\n sell = prices[i] + dp(i + 1, trades + 1, 0, -1)\\n memo[(i, trades, hold)] = max(nothing, buy, sell)\\n return memo[(i, trades, hold)]\\n return dp(0, 0, 0, -1)\\n\\n\\n \",\n \"memory\": \"69936\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n @cache\\n def buy(i, k):\\n if i >= len(prices) - 1 or k == 0:\\n return 0\\n return max(0, buy(i + 1, k), -prices[i] + sell(i + 1, k))\\n \\n @cache\\n def sell(i, k):\\n if i >= len(prices):\\n return 0\\n return max(0, sell(i + 1, k), prices[i] + buy(i + 1, k - 1))\\n\\n return buy(0, k)\",\n \"memory\": \"70783\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n if n==1:\\n return 0\\n\\n @lru_cache(maxsize=None)\\n def dp(i, j, bought):\\n if i>=n:\\n return 0\\n if j==0:\\n return 0\\n \\n if bought:\\n return max(dp(i+1, j, bought), prices[i]+dp(i, j-1, 0))\\n else:\\n return max(dp(i+1, j, bought), -prices[i]+dp(i, j, 1))\\n\\n # dp = [[[0 for _ in range(k+1)] for _ in range(n)] for _ in range(2)]\\n # dp[1][0]\\n # for i in range(n):\\n # for j in range(k+1):\\n # for sold in range(2):\\n # dp[sold][i][j] = dp[sold][i-1][j] if i-1 else float('-inf')\\n # if sold:\\n # dp[1][i][j] = max(dp[sold][i][j], -1*prices[i]+dp[0][i][j-1]) if j else float('-inf')\\n # else:\\n # dp[0][i][j] = max(dp[0][i][j], prices[i]+dp[1][i-1][j-1]) if j else 0\\n\\n return dp(0, k, 0)\\n\\n return dp[0][n-1][k]\\n\\n\\n# dp(i, j) max profit from prices[0..i] with <=j transctations \\n# dp(0, j) = 0\\n# dp(1, j) = 0 if j==0 or max(0, prices[1]-prices[0]) if j>=1 \\n# dp(i, 0) = 0\\n# dp(i, j) = max(dp(i-1, j), nums[i]-nums[i-1]+dp(i-2, j-1) if j>=1 \",\n \"memory\": \"71629\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo1 = {}\\n memo0 = {}\\n def f_1(d, i):\\n # i-times to hold/buy stock at day: d \\n # return: earing\\n if d == 0 and i <= k:\\n return - prices[d]\\n\\n if i > k or d < 0:\\n return - inf\\n \\n \\n if (d, i) in memo1:\\n return memo1[(d, i)]\\n\\n ans = max( f_1( d-1 , i) , f_0(d-1, i) - prices[d])\\n memo1[(d, i)] = ans\\n\\n return ans\\n \\n def f_0(d, i):\\n # i-times rest to sell/not hold stock at day: d \\n # return: earing\\n\\n if d == 0 and i <= k:\\n return 0\\n\\n if i > k or d < 0:\\n return -inf\\n \\n if (d, i) in memo0:\\n return memo0[(d, i)]\\n \\n ans = max( f_1(d-1 , i + 1) + prices[d], f_0(d-1, i))\\n memo0[(d, i)] = ans\\n \\n return ans\\n\\n return f_0(len(prices) - 1 , 0)#max(f_0(len(prices) - 1 , i) for i in range(k + 1))\\n \\n \\n\\n \",\n \"memory\": \"72475\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo1 = {}\\n memo0 = {}\\n def f_1(d, i):\\n # i-times to hold/buy stock at day: d \\n # return: earing\\n if d == 0 and i <= k:\\n return - prices[d]\\n\\n if i > k or d < 0:\\n return - inf\\n \\n \\n if (d, i) in memo1:\\n return memo1[(d, i)]\\n\\n ans = max( f_1( d - 1 , i) , f_0(d - 1, i) - prices[d])\\n memo1[(d, i)] = ans\\n\\n return ans\\n \\n def f_0(d, i):\\n # i-times rest to sell/not hold stock at day: d \\n # return: earing\\n\\n if d == 0 and i <= k:\\n return 0\\n\\n if i > k or d < 0:\\n return -inf\\n \\n if (d, i) in memo0:\\n return memo0[(d, i)]\\n \\n ans = max( f_1(d-1 , i + 1) + prices[d], f_0(d-1, i))\\n memo0[(d, i)] = ans\\n \\n return ans\\n\\n return f_0(len(prices) - 1 , 0)#max(f_0(len(prices) - 1 , i) for i in range(k + 1))\\n \\n \\n\\n \",\n \"memory\": \"72475\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n @cache\\n def buy(i, k):\\n if k == 0 or i >= len(prices):\\n return 0\\n return max(buy(i + 1, k), sell(i + 1, k - 1) - prices[i])\\n\\n @cache\\n def sell(i, k):\\n if i >= len(prices):\\n return 0\\n return max(sell(i + 1, k), buy(i + 1, k) + prices[i])\\n \\n return buy(0, k)\",\n \"memory\": \"73321\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n @cache\\n def dp(i, h, k):\\n if i >= n or not k: return 0\\n best = dp(i + 1, h, k)\\n if h: best = max(best, dp(i, False, k - 1) + prices[i])\\n else: best = max(best, dp(i + 1, True, k) - prices[i])\\n return best\\n return dp(0, False, k)\",\n \"memory\": \"74168\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo1 = {}\\n memo0 = {}\\n def f_1(d, i):\\n # i-times hold/buy stock at day: d \\n # return: earing\\n if d == 0 and i == 1:\\n return - prices[d]\\n\\n if d < i:\\n return - inf\\n\\n if i <= 0:\\n return 0\\n \\n if (d, i) in memo1:\\n return memo1[(d, i)]\\n ans = max( f_1( d-1 , i) , f_0(d-1, i - 1) - prices[d])\\n memo1[(d, i)] = ans\\n return ans\\n \\n def f_0(d, i):\\n # i-times sell/not hold stock at day: d \\n # return: earing\\n if d == 0:\\n return 0\\n if i <= 0:\\n return 0\\n if (d, i) in memo0:\\n return memo0[(d, i)]\\n \\n ans = max( f_1(d-1 , i) + prices[d], f_0(d-1, i))\\n memo0[(d, i)] = ans\\n return ans\\n return max(f_0(len(prices) - 1 , i) for i in range(k + 1))\\n \\n \\n\\n \",\n \"memory\": \"75014\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo1 = {}\\n memo0 = {}\\n def f_1(d, i):\\n # i-times hold/buy stock at day: d \\n # return: earing\\n if d == 0 and i == 1:\\n return - prices[d]\\n\\n if d < i:\\n return - inf\\n\\n # if i <= 0:\\n # return 0\\n \\n if (d, i) in memo1:\\n return memo1[(d, i)]\\n\\n ans = max( f_1( d-1 , i) , f_0(d-1, i - 1) - prices[d])\\n memo1[(d, i)] = ans\\n\\n return ans\\n \\n def f_0(d, i):\\n # i-times sell/not hold stock at day: d \\n # return: earing\\n\\n if d == 0:\\n return 0\\n if i <= 0:\\n return 0\\n if (d, i) in memo0:\\n return memo0[(d, i)]\\n \\n ans = max( f_1(d-1 , i) + prices[d], f_0(d-1, i))\\n memo0[(d, i)] = ans\\n return ans\\n\\n return max(f_0(len(prices) - 1 , i) for i in range(k + 1))\\n \\n \\n\\n \",\n \"memory\": \"75014\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo = {}\\n def helper(index, k, i_low):\\n # key = str(index) + \\\":\\\" + str(k) + \\\":\\\" + str(low)\\n key = index * 1000 + k + i_low * 1000000\\n if key in memo:\\n return memo[key]\\n\\n if k < 0:\\n return -float('inf')\\n\\n if index == len(prices):\\n return 0\\n\\n if prices[index] > prices[i_low]:\\n memo[key] = max(prices[index] - prices[i_low] + helper(index + 1, k-1, index), helper(index + 1, k, i_low))\\n else:\\n memo[key] = helper(index+1, k, index)\\n\\n return memo[key]\\n\\n return helper(1, k, 0)\\n \\n \\n\",\n \"memory\": \"75860\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # backtracking + memo\\n # there are two states we can be in, buying or selling\\n # if we are in the buying state, we try each possible option of buying\\n # we then switch to sell state\\n # we try each possible option of selling (that gives a profit)\\n # use memo on isbuy,i,buysRemaining\\n \\n buyMemo = defaultdict(int) # (i,buysLeft) : best when buying\\n sellMemo = defaultdict(int) # (i,buysLeft) : best when selling\\n def buy(i,buysLeft):\\n if(i,buysLeft) in buyMemo:\\n return buyMemo[(i,buysLeft)]\\n if i == len(prices) or buysLeft==0:\\n return 0\\n \\n bestBuyingToday = sell(i+1,buysLeft-1) - prices[i]\\n bestNotBuyingtoday = buy(i+1,buysLeft)\\n buyMemo[(i,buysLeft)] = max(bestBuyingToday, bestNotBuyingtoday)\\n return buyMemo[(i,buysLeft)]\\n \\n \\n def sell(i,buysLeft):\\n if(i,buysLeft) in sellMemo:\\n return sellMemo[(i,buysLeft)]\\n if i == len(prices):\\n return 0\\n \\n bestSellingToday = buy(i+1,buysLeft) + prices[i]\\n bestNotSellingToday = sell(i+1,buysLeft)\\n sellMemo[(i,buysLeft)] = max(bestSellingToday, bestNotSellingToday)\\n return sellMemo[(i,buysLeft)]\\n \\n \\n return buy(0,k)\",\n \"memory\": \"76706\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n N = len(prices)\\n buyDp = {}\\n sellDp = {}\\n # on this day, we want to buy a stock what's the most profit we can make?\\n def buy(curDay, kLeft): \\n if curDay == N: return 0\\n if (curDay, kLeft) in buyDp: \\n return buyDp[(curDay, kLeft)]\\n\\n profitBuyingToday = 0\\n if kLeft > 0:\\n profitBuyingToday = sell(curDay + 1, kLeft - 1) - prices[curDay]\\n profitNotBuyingToday = buy(curDay + 1, kLeft)\\n\\n buyDp[(curDay,kLeft)] = max(profitBuyingToday, profitNotBuyingToday)\\n return buyDp[(curDay,kLeft)]\\n \\n def sell(curDay, kLeft):\\n if curDay == N: return 0\\n if (curDay, kLeft) in sellDp: \\n return sellDp[(curDay, kLeft)]\\n \\n profitSellingToday = buy(curDay + 1, kLeft) + prices[curDay]\\n profitNotSellingToday = sell(curDay + 1, kLeft)\\n\\n sellDp[(curDay, kLeft)] = max(profitSellingToday, profitNotSellingToday)\\n return sellDp[(curDay, kLeft)]\\n\\n return buy(0, k)\\n\",\n \"memory\": \"77553\"\n },\n {\n \"code\": \"# class Solution:\\n# def maxProfit(self, k: int, prices: List[int]) -> int:\\n# memo1 = {}\\n# memo0 = {}\\n# def f_1(d, i):\\n# # i-times to hold/buy stock at day: d \\n# # return: earing\\n# if d == 0 and i <= k:\\n# return - prices[d]\\n\\n# if i > k or d < 0:\\n# return - inf\\n \\n \\n# if (d, i) in memo1:\\n# return memo1[(d, i)]\\n\\n# ans = max( f_1( d - 1 , i) , f_0(d - 1, i) - prices[d])\\n# memo1[(d, i)] = ans\\n\\n# return ans\\n \\n# def f_0(d, i):\\n# # i-times rest to sell/not hold stock at day: d \\n# # return: earing\\n\\n# if d == 0 and i <= k:\\n# return 0\\n\\n# if i > k or d < 0:\\n# return -inf\\n \\n# if (d, i) in memo0:\\n# return memo0[(d, i)]\\n \\n# ans = max( f_1(d-1 , i + 1) + prices[d], f_0(d-1, i))\\n# memo0[(d, i)] = ans\\n \\n# return ans\\n\\n# return f_0(len(prices) - 1 , 0)\\n\\nclass Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo = {}\\n def f(n, d, hold):\\n # n: n-times(<= k) rest to sell/not hold stock at day: d \\n # hold = 0, 1, whether hold the stock or not\\n if n > k or d < 0:\\n return - inf\\n if d == 0 and n <= k and hold == 1:\\n return -prices[0]\\n \\n if d == 0 and n <= k and hold == 0:\\n return 0\\n if (n, d, hold) in memo:\\n return memo[(n,d,hold)]\\n if hold == 1:\\n ans = max(f(n,d-1,1), f(n, d-1, 0) - prices[d])\\n if hold == 0:\\n ans = max(f(n,d-1,0), f(n+1, d-1, 1)+ prices[d])\\n memo[(n,d,hold)] = ans\\n return ans\\n return f(0, len(prices)-1, 0)\\n \\n \\n \",\n \"memory\": \"78399\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n \\n @cache\\n def dpb(k, i):\\n if k == 0 or i >= n:\\n return 0\\n return max(dps(k, i+1) - prices[i], dpb(k, i+1))\\n \\n @cache\\n def dps(k, i):\\n if k == 0 or i >= n:\\n return 0\\n return max(dpb(k-1, i+1) + prices[i], dps(k, i+1))\\n \\n return dpb(k, 0)\",\n \"memory\": \"79245\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n # at most k trasnactions \\n\\n @lru_cache(None)\\n def DFS(i,hold,count):\\n if count==0:\\n return 0\\n \\n if i==0:\\n if hold==True:\\n return -prices[i]\\n else:\\n return 0\\n \\n value=0\\n if hold==True:\\n prev_hold=DFS(i-1,True,count)\\n buy=DFS(i-1,False,count-1)-prices[i]\\n value=max(prev_hold,buy)\\n else:\\n prev_nothold=DFS(i-1,False,count)\\n sale=DFS(i-1,True,count)+prices[i]\\n\\n value=max(prev_nothold,sale)\\n return value\\n \\n return DFS(len(prices)-1,False,k)\\n \",\n \"memory\": \"80091\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n \\n @cache\\n\\n def dfs(day, most, hold):\\n if day < 0:\\n if hold:\\n return -inf\\n else:\\n return 0\\n if most < 0:\\n return -inf\\n\\n if hold:\\n return max(dfs(day - 1, most, True), dfs(day - 1, most, False ) - prices[day])\\n\\n return max(dfs(day - 1, most, False), dfs(day - 1, most - 1, True) + prices[day])\\n\\n return dfs(len(prices) - 1, k, False)\\n\",\n \"memory\": \"80091\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = {}\\n\\n def dfs(i, t, buying):\\n if t < 0:\\n return 0\\n if i == len(prices):\\n return 0\\n if (i, t, buying) in dp:\\n return dp[(i, t, buying)]\\n \\n if not buying:\\n dp[(i, t, buying)] = max(dfs(i + 1, t, False), dfs(i + 1, t, True) + prices[i])\\n else:\\n dp[(i, t, buying)] = max(dfs(i + 1, t, True), dfs(i + 1, t - 1, False) - prices[i])\\n return dp[(i, t, buying)]\\n return dfs(0, k, True)\",\n \"memory\": \"80938\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n memo = {}\\n def dp(next_day, transaction_remains, incomplete_buy):\\n # return max profit given the day remains and transaction remains\\n if next_day == len(prices):\\n return 0\\n if (next_day, transaction_remains, incomplete_buy) not in memo:\\n # we can sell or buy or do nothing\\n max_profit = 0\\n # noop\\n max_profit = max(max_profit, dp(next_day+1, transaction_remains,incomplete_buy))\\n # buy at next_day\\n if transaction_remains >= 1 and (incomplete_buy is False):\\n max_profit = max(max_profit, -prices[next_day] + dp(next_day+1, transaction_remains-1, True))\\n # sell at next_day\\n if incomplete_buy is True:\\n max_profit = max(max_profit, prices[next_day] + dp(next_day+1, transaction_remains, False))\\n memo[(next_day, transaction_remains, incomplete_buy)] = max_profit\\n return memo[(next_day, transaction_remains, incomplete_buy)]\\n return dp(0, k, False)\",\n \"memory\": \"80938\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n @cache\\n def dp(i, holding, k):\\n if i == len(prices) or k < 0:\\n return 0\\n \\n if holding:\\n return max(dp(i+1, holding, k), dp(i+1, False, k)+prices[i])\\n else:\\n return max(dp(i+1, holding, k), dp(i+1, True, k-1)-prices[i])\\n \\n return dp(0, False, k)\\n\",\n \"memory\": \"81784\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n dp = {}\\n\\n @cache\\n def dfs(i, transaction, buying):\\n if transaction < 0:\\n return -inf\\n if i == len(prices):\\n return 0 if buying else -inf\\n \\n if not buying:\\n return max(dfs(i + 1, transaction, False), dfs(i + 1, transaction, True) + prices[i])\\n return max(dfs(i + 1, transaction, True), dfs(i + 1, transaction - 1, False) - prices[i])\\n\\n return dfs(0, k, True)\",\n \"memory\": \"81784\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, A: List[int]) -> int:\\n BUY, SELL = 0, 1\\n\\n @cache\\n def dfs(index, k, ttype = BUY):\\n if k == 0:\\n return 0\\n \\n if index == len(A):\\n return 0\\n \\n if ttype == BUY:\\n dont = dfs(index+1, k, BUY)\\n buy = -A[index] + dfs(index+1, k, SELL)\\n return max(buy, dont)\\n else:\\n dont = dfs(index+1, k, SELL)\\n sell = A[index] + dfs(index+1, k-1, BUY)\\n return max(dont, sell)\\n \\n return dfs(0, k)\",\n \"memory\": \"82630\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n = len(prices)\\n # hold - 1, not hold - 0\\n # dp[1][i] = max(dp[0][i + 2] + price, dp[1][i + 1])\\n # dp[0][i] = max(dp[1][i + 1] - price, dp[0][i + 1])\\n # dp_hold = [[0 for _ in range(k + 1)] for _ in range(n + 1)]\\n # dp_nohold = [[0 for _ in range(k + 1)] for _ in range(n + 1)]\\n # for i in range(n - 1, -1, -1):\\n # for times in range(1, k + 1):\\n # print(i, times)\\n # dp_hold[i][times] = max(dp_nohold[i + 1][times - 1] + prices[i], dp_hold[i + 1][times])\\n # dp_nohold[i][times] = max(dp_hold[i + 1][times] - prices[i], dp_nohold[i + 1][times])\\n @cache\\n def dfs(i, hold, k):\\n if i >= n:\\n return 0\\n\\n if hold:\\n # can sell\\n if k > 0:\\n return max(dfs(i + 1, False, k - 1) + prices[i], dfs(i + 1, True, k))\\n else:\\n return dfs(i + 1, hold, k)\\n else:\\n # can not sell\\n return max(dfs(i + 1, False, k), dfs(i + 1, True, k) - prices[i])\\n return dfs(0, False, k)\",\n \"memory\": \"82630\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n n=len(prices)\\n if not prices or k==0:\\n return 0\\n memo={}\\n def dfs(day,transaction_left,holding):\\n if day==n or transaction_left==0:\\n return 0\\n if (day,transaction_left,holding) in memo:\\n return memo[(day,transaction_left,holding)]\\n if holding:\\n sell=prices[day]+dfs(day+1,transaction_left-1,False)\\n hold=dfs(day+1,transaction_left,True)\\n result=max(sell,hold)\\n else:\\n buy=-prices[day]+dfs(day+1,transaction_left,True)\\n skip=dfs(day+1,transaction_left,False)\\n result=max(buy,skip)\\n memo[(day,transaction_left,holding)]=result\\n return result\\n return dfs(0,k,False)\",\n \"memory\": \"83476\"\n },\n {\n \"code\": \"class Solution:\\n def maxProfit(self, k: int, prices: List[int]) -> int:\\n cache = {}\\n stock = 0\\n def profit(day, stock, i):\\n if (day,stock,i) in cache:\\n return cache[(day,stock,i)]\\n if day==len(prices):\\n return 0\\n if stock==0:\\n cache[(day,stock,i)] = max((profit(day+1,1,i+1)-prices[day]) if i<k else -1e9, profit(day+1,0,i))\\n else:\\n cache[(day,stock,i)] = max(profit(day+1,0,i)+prices[day], profit(day+1,1,i))\\n return cache[(day,stock,i)]\\n return profit(0,0,0)\",\n \"memory\": \"83476\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":120,"string":"120"}}},{"rowIdx":175,"cells":{"question_id":{"kind":"number","value":189,"string":"189"},"name":{"kind":"string","value":"rotate-array"},"content":{"kind":"string","value":"<p>Given an integer array <code>nums</code>, rotate the array to the right by <code>k</code> steps, where <code>k</code> is non-negative.</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,6,7], k = 3\n<strong>Output:</strong> [5,6,7,1,2,3,4]\n<strong>Explanation:</strong>\nrotate 1 steps to the right: [7,1,2,3,4,5,6]\nrotate 2 steps to the right: [6,7,1,2,3,4,5]\nrotate 3 steps to the right: [5,6,7,1,2,3,4]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [-1,-100,3,99], k = 2\n<strong>Output:</strong> [3,99,-1,-100]\n<strong>Explanation:</strong> \nrotate 1 steps to the right: [99,-1,-100,3]\nrotate 2 steps to the right: [3,99,-1,-100]\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>0 <= k <= 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>Try to come up with as many solutions as you can. There are at least <strong>three</strong> different ways to solve this problem.</li>\n\t<li>Could you do it in-place with <code>O(1)</code> extra space?</li>\n</ul>\n"},"acRate":{"kind":"number","value":41.54830927338035,"string":"41.548309"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","math","two-pointers"],"string":"[\n \"array\",\n \"math\",\n \"two-pointers\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"46\", 0.0491], [\"60\", 0.0054], [\"74\", 0.0082], [\"87\", 0.0055], [\"101\", 0.0192], [\"115\", 0.011], [\"128\", 0.5276], [\"142\", 15.583200000000001], [\"156\", 50.490500000000004], [\"170\", 14.665300000000002], [\"183\", 1.2369], [\"197\", 0.2554], [\"211\", 0.1867], [\"224\", 0.15360000000000001], [\"238\", 0.0464], [\"252\", 0.0381], [\"265\", 0.0244], [\"279\", 0.029900000000000003], [\"293\", 0.027200000000000002], [\"306\", 0.013600000000000001], [\"320\", 0.027200000000000002], [\"334\", 0.019000000000000003], [\"347\", 0.0136], [\"361\", 0.027299999999999998], [\"375\", 0.013600000000000001], [\"389\", 0.0054], [\"402\", 0.0027], [\"416\", 0.0027], [\"430\", 0.0027], [\"443\", 0.0027], [\"457\", 0.0027], [\"471\", 0.0055], [\"484\", 0.027299999999999998], [\"498\", 0.03], [\"512\", 0.0109], [\"525\", 0.0054], [\"539\", 0.0027], [\"553\", 0.0027], [\"566\", 0.0082], [\"580\", 0.0027], [\"594\", 0.0027], [\"608\", 0.0027], [\"621\", 0.016300000000000002], [\"635\", 0.0218], [\"649\", 0.016300000000000002], [\"662\", 0.0108], [\"676\", 0.0409], [\"690\", 0.0163], [\"703\", 0.0027], [\"717\", 0.0027], [\"731\", 0.0027], [\"744\", 0.0027], [\"758\", 0.0356], [\"772\", 0.2417], [\"785\", 0.27190000000000003], [\"799\", 0.10959999999999999], [\"813\", 0.018900000000000004], [\"827\", 0.0027], [\"840\", 0.0054], [\"854\", 0.0082], [\"868\", 0.0027], [\"881\", 0.0027], [\"895\", 0.0027], [\"909\", 0.0247], [\"922\", 0.11799999999999998], [\"936\", 0.1453], [\"950\", 0.0602], [\"963\", 0.030100000000000002], [\"977\", 0.013600000000000001], [\"991\", 0.04109999999999999], [\"1004\", 0.0464], [\"1018\", 0.0081], [\"1032\", 0.0081], [\"1046\", 0.0081], [\"1059\", 0.0218], [\"1073\", 0.016200000000000003], [\"1087\", 0.1482], [\"1100\", 2.0091], [\"1114\", 5.0268999999999995], [\"1128\", 2.8306999999999998]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"21700\", 0.0082], [\"21800\", 0.0385], [\"21900\", 0.0082], [\"25200\", 0.0027], [\"25600\", 0.0055], [\"25700\", 0.0027], [\"25800\", 0.011], [\"25900\", 0.0027], [\"26000\", 0.0027], [\"26200\", 0.0027], [\"26300\", 0.0027], [\"26400\", 0.0082], [\"26500\", 0.011], [\"26600\", 0.0055], [\"26700\", 0.011], [\"26800\", 0.0055], [\"26900\", 0.0082], [\"27000\", 0.0192], [\"27100\", 0.022], [\"27200\", 0.0357], [\"27300\", 0.0577], [\"27400\", 0.044], [\"27500\", 0.0934], [\"27600\", 0.1374], [\"27700\", 0.6074], [\"27800\", 6.8545], [\"27900\", 25.5572], [\"28000\", 38.8402], [\"28100\", 22.1108]]}"},"rt_list":{"kind":"list like","value":[{"code":"def rotate(nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k%len(nums)\n nums[:] = nums[-k:] + nums[:-k]\n\nwith open(\"user.out\", \"w\") as Solution:\n for nums, k in zip(map(loads, stdin), map(int, stdin)):\n rotate(nums, k)\n Solution.write(f\"{nums}\\n\".replace(\" \",\"\"))\nexit()","runtime":"46"},{"code":"class Solution:\n def rotate(nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k%len(nums)\n nums[:] = nums[-k:] + nums[:-k]\n\n with open(\"user.out\", \"w\") as Solution:\n for nums, k in zip(map(loads, stdin), map(int, stdin)):\n rotate(nums, k)\n Solution.write(f\"{nums}\\n\".replace(\" \",\"\"))\n exit()\n","runtime":"46"},{"code":"def rotate(nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k%len(nums)\n nums[:] = nums[-k:] + nums[:-k]\n\nwith open(\"user.out\", \"w\") as Solution:\n for nums, k in zip(map(loads, stdin), map(int, stdin)):\n rotate(nums, k)\n Solution.write(f\"{nums}\\n\".replace(\" \",\"\"))\nexit()","runtime":"60"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n # Get the actual number of rotations\n k = k % len(nums) \n # Get the number of elements to move from the end to the beginning\n r = len(nums) - k\n # Store the elements to move\n new = nums[0:r]\n # Remove the elements from the beginning\n nums[0:r] = []\n # Append the stored elements to the end\n nums.extend(new)","runtime":"60"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n n = len(nums)\n k %= n # In case k is larger than the array length\n \n # Reverse the entire array\n nums.reverse()\n \n # Reverse the first k elements\n nums[:k] = reversed(nums[:k])\n \n # Reverse the remaining elements\n nums[k:] = reversed(nums[k:])\n","runtime":"74"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = k%n\n nums[:] = nums[-k:] + nums[:-k]","runtime":"87"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = k % n\n \n def reverse(nums, start, end):\n while start < end:\n nums[start], nums[end] = nums[end], nums[start]\n start += 1\n end -= 1\n \n reverse(nums, 0 , n-1 )\n reverse(nums, 0, k-1 )\n reverse(nums, k, n-1)\n # def rotate(nums):\n # tem = nums[-1]\n # for idx in range(n-1, 0, -1):\n # nums[idx] = nums[idx-1]\n # nums[0] = tem\n\n # for _ in range(k):\n # rotate(nums)\n ","runtime":"101"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k=k%len(nums)\n nums.reverse()\n nums[:k]=reversed(nums[:k])\n nums[k:]=reversed(nums[k:])\n ","runtime":"115"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = k % n\n nums.reverse()\n nums[:k] = reversed(nums[:k])\n nums[k:] = reversed(nums[k:])\n \n\n \n\n\n \n\n \n \n ","runtime":"128"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n if not nums:\n return []\n l = len(nums)\n k = k % l\n nums[:] = nums[l-k:] + nums[:l-k]\n\n ","runtime":"128"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k %= len(nums)\n nums[:] = nums[-k:] + nums[:-k]","runtime":"142"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k %= len(nums)\n if k == 0:\n return nums\n\n num_iter = len(nums) // k\n for i in range(1, num_iter):\n print(k, i*k, i*k+k)\n nums[:k], nums[i*k:i*k+k] = nums[i*k:i*k+k], nums[:k]\n \n rm = len(nums) % k\n if rm != 0:\n nums[:rm], nums[-rm:] = nums[-rm:], nums[:rm]\n nums[:k-rm], nums[k-rm:k]= nums[rm:k], nums[:rm]\n ","runtime":"156"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n # for i in range(k):\n # p = nums.pop()\n # nums.insert(0, p)\n if k > len(nums): k = k % len(nums)\n l1, l2 = nums[: len(nums)-k], nums[len(nums)-k:]\n nums[:] = l2 + l1","runtime":"156"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n k = k % len(nums)\n s, e = 0-k, len(nums)-1-k\n dup = nums[:]\n for i in range(s, e+1):\n nums[i+k] = dup[i]\n","runtime":"170"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n \n k = k % len(nums)\n left, right = 0, len(nums)-1\n while left < right:\n nums[left],nums[right] = nums[right],nums[left]\n left += 1\n right -= 1\n \n left, right = 0, k - 1\n while left < right:\n nums[left],nums[right] = nums[right],nums[left]\n left += 1\n right -= 1\n \n left, right = k , len(nums)-1\n while left < right:\n nums[left],nums[right] = nums[right],nums[left]\n left += 1\n right -= 1","runtime":"170"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n \n n = len(nums)\n k = k % n\n self.rotate_recur(nums, k, 0, n-1)\n\n def rotate_recur(self, nums: List[int], k: int, p: int, q: int) -> None:\n n = q-p+1\n if k == 0 or q == p:\n return\n elif 2*k == n:\n for j in range(0, k):\n nums[p+j], nums[p+n-k+j] = nums[p+n-k+j], nums[p+j]\n elif 2*k < n:\n for j in range(0, k):\n nums[p+j], nums[p+n-k+j] = nums[p+n-k+j], nums[p+j]\n self.rotate_recur(nums, k, p+k, q)\n else:\n k = n-k\n for j in range(0, k):\n nums[p+j], nums[p+n-k+j] = nums[p+n-k+j], nums[p+j]\n self.rotate_recur(nums, n-2*k, p, q-k)\n","runtime":"183"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n\n if k == 0:\n return \n if len(nums) == 1:\n return\n if k > len(nums):\n k = (k - len(nums)) % len(nums)\n print(k)\n buffer = nums[len(nums) - k:]\n print(buffer)\n index = 0\n \n for index in range(len(nums)):\n localIndex = index % k\n print(localIndex)\n temp = buffer[localIndex]\n buffer[localIndex] = nums[index]\n nums[index] = temp\n\n","runtime":"183"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n\n\n copy = nums[:]\n \n for i in range(len(nums)):\n index = i-k\n index = index%len(nums)\n print(index)\n nums[i] = copy[index]\n \n\n\n #insert the very last element into first place of nums","runtime":"197"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k % len(nums)\n temp = [0] * len(nums)\n for i in range(len(nums)):\n if i+k < len(nums):\n j = i + k \n else:\n j = i+k-len(nums)\n print('j', j)\n temp[j] = nums[i]\n for i in range(len(temp)):\n nums[i]=temp[i]\n","runtime":"197"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n visited={}\n allVisited=0\n temp1=nums[0]\n for i in range(len(nums)):\n visited[i]=0\n i=0\n while allVisited<len(nums):\n if(visited[i]==0):\n visited[i]=1\n temp2=nums[(i+k)%len(nums)]\n nums[(i+k)%len(nums)] = temp1\n temp1=temp2\n i=(i+k)%len(nums)\n allVisited+=1\n else:\n i=(i+1)%len(nums)\n temp1=nums[i]\n\n\n # i->(i+k)%len(nums)","runtime":"211"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n \n n = len(nums)\n k = k%n\n tmp = nums[0:n-k]\n nums[0:n-k] = []\n nums.extend(tmp)\n\n\n\n ","runtime":"211"},{"code":"from collections import deque \n\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n dq = deque(nums)\n\n for _ in range(k):\n num = dq.pop()\n dq.appendleft(num)\n \n for i in range(len(dq)):\n nums[i] = dq[i]\n dq.clear()","runtime":"224"},{"code":"from collections import deque \n\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n dq = deque(nums)\n\n for _ in range(k):\n num = dq.pop()\n dq.appendleft(num)\n \n for i in range(len(dq)):\n nums[i] = dq[i]","runtime":"224"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n numsD = collections.deque(nums)\n k = k%len(nums)\n for i in range(k):\n num = numsD.pop()\n numsD.appendleft(num)\n \n for i in range(len(numsD)):\n nums[i] = numsD[i]\n\n\n ","runtime":"238"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n if k==0 or k==len(nums) or k%len(nums)==0:\n pass\n else:\n k = k%len(nums)\n n = len(nums)\n arr = Solution.reverse_array(nums,n-k,n-1)\n arr = Solution.reverse_array(nums,0,n-k-1)\n arr = Solution.reverse_array(nums,0,n-1)\n def reverse_array(arr,start_index,end_index):\n while start_index<end_index:\n print(\"start=\",start_index,\",end=\",end_index)\n arr[start_index],arr[end_index] = arr[end_index],arr[start_index]\n start_index+=1\n end_index -=1 \n return arr","runtime":"238"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n # Solution #1: would typically do with list comprehension in python, but this requires extra memory; essentially creates a new list\n # Solution #2: create a new list manually; still requires extra memory\n cur_idx = 0\n rewrite_idx = None\n temp_val = nums[0]\n l = len(nums) - 1\n loops = 0\n\n if l == 0:\n return\n # probably need to handle if k > len(nums)\n for i in range(0, l+1):\n # determine next idx to write to\n rewrite_idx = cur_idx + k\n if rewrite_idx > l:\n print(f\"{rewrite_idx} and {l}\")\n #rewrite_idx = rewrite_idx % l - 1 if l > 1 else 0\n rewrite_idx = rewrite_idx % len(nums)\n print(f\"Wrapping rewrite_idx to {rewrite_idx}\")\n # if we have written this before, we need to offset our next set of writes\n\n if i > 0 and rewrite_idx == k + loops:\n loops += 1\n rewrite_idx += 1\n cur_idx += 1\n print(f\"Shifting cur_idx forward to {cur_idx}\")\n temp_val = nums[cur_idx]\n \n new_temp_val = nums[rewrite_idx]\n print(f\"writing val {temp_val} from {cur_idx} over val {new_temp_val} from {rewrite_idx}\")\n nums[rewrite_idx] = temp_val\n cur_idx = rewrite_idx\n temp_val = new_temp_val","runtime":"252"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n k = k % len(nums)\n\n for x in range(floor(len(nums) / 2)):\n self.reverse(nums,x,0)\n x += 1\n\n for x in range(floor( k / 2)): \n self.reverse(nums,x, len(nums) - k)\n x += 1\n\n for x in range(k,floor((k + len(nums)) / 2) ):\n self.reverse(nums,x,-k)\n x+=1\n \n\n \n\n def reverse(self,nums, x,k):\n \n print(nums[x])\n print(nums[-1-x-k])\n nums[x] += nums[-1 - x -k]\n nums[-1 -x-k] = nums[x] - nums[-1-x-k]\n nums[x] = nums[x] - nums[-1-x-k]\n \n\n","runtime":"252"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n def rotate_by_idx(begin, end, k):\n n = end - begin\n k = k % n\n half = n // 2\n if n == 1 or k == 0:\n return\n elif half < k:\n rotate_by_idx(begin, begin+n-half, k-half)\n rotate_by_idx(begin+k-half, end, half)\n return\n else:\n for i in range(k):\n nums[begin+i], nums[begin+n-k+i] = nums[begin+n-k+i], nums[begin+i]\n rotate_by_idx(begin+k, end, k)\n return\n \n rotate_by_idx(0, len(nums), k)\n","runtime":"265"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n def reverse(start,end):\n mid = (end + start + 1)//2\n\n for i in range(start, mid):\n print(mid, start,end, i, end-i+start)\n tmp = nums[i]\n nums[i] = nums[end-i+start]\n nums[end-i+start] = tmp\n return\n \n\n n = len(nums)\n k = k%n\n if not k:\n return\n\n reverse(0,n-k-1)\n reverse(n-k,n-1)\n reverse(0,n-1)\n return\n\n\n ","runtime":"265"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n\n starters = set(range(k % n))\n while len(starters) > 0:\n s = starters.pop()\n print(s, starters)\n # swap forward until landing back on s\n idx = s\n # print(\"\\t\", idx)\n prev_keep_value = nums[idx]\n while (idx + k) % n != s:\n print(\"\\t\", idx % n, (idx + k) % n)\n keep_value = nums[(idx + k) % n]\n nums[(idx + k) % n] = prev_keep_value\n prev_keep_value = keep_value\n idx = (idx + k) % n\n if idx < k:\n if idx in starters:\n starters.remove(idx)\n nums[s] = prev_keep_value\n if s in starters:\n starters.remove(s)","runtime":"279"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n\n starters = set(range(k % n))\n while len(starters) > 0:\n s = starters.pop()\n print(s, starters)\n # swap forward until landing back on s\n idx = s\n # print(\"\\t\", idx)\n prev_keep_value = nums[idx]\n while (idx + k) % n != s:\n print(\"\\t\", idx % n, (idx + k) % n)\n keep_value = nums[(idx + k) % n]\n nums[(idx + k) % n] = prev_keep_value\n prev_keep_value = keep_value\n idx = (idx + k) % n\n if idx < k:\n if idx in starters:\n starters.remove(idx)\n nums[s] = prev_keep_value\n # if s in starters:\n # starters.remove(s)","runtime":"279"},{"code":"class ListNode:\n def __init__(self, value):\n self.value = value\n self.next = None\n\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n if len(nums) == 1 or k == 0:\n return\n\n curr_node = None\n prev_node = None\n k_1 = (len(nums) - k) % len(nums) # k has to be inverse because as you shift the array you are getting clpser\n\n head = ListNode(nums[k_1])\n prev_node = head\n\n\n for i in range(1, len(nums)): # may have to rethink the range because it only goes to the end -- need a condition either modulus or at end to wrap around\n j = (k_1 + i) % len(nums)\n curr_node = ListNode(nums[j])\n prev_node.next = curr_node\n print(prev_node.value, prev_node.next)\n prev_node = curr_node\n \n curr_node = head\n for i in range(len(nums)):\n nums[i] = curr_node.value\n curr_node = curr_node.next\n\n\n \n \n\n\n\n\n\n \n\n # 5 mod 7 = 2\n # 4 mod 7","runtime":"293"},{"code":"import numpy as np\n\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = k % n\n\n # 1)\n # nums[:] = nums[-k:] + nums[:-k]\n\n # 2)\n def reverse(start: int, end: int) -> None:\n while start < end:\n nums[start], nums[end] = nums[end], nums[start]\n start, end = start + 1, end - 1\n\n reverse(0, n - 1)\n reverse(0, k - 1)\n reverse(k, n - 1)\n","runtime":"293"},{"code":"import numpy as np\n\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Rotate the array nums to the right by k steps, in-place.\n \"\"\"\n n = len(nums)\n k %= n \n \n if k > 0:\n nums.reverse() \n nums[:k] = reversed(nums[:k])\n nums[k:] = reversed(nums[k:])\n \n result = np.array(nums)\n print(result)\n\n","runtime":"306"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n a=[]\n n=len(nums)\n # for i in range(k):\n # temp=nums[n-1]\n # for j in range(n-1,-1,-1):\n # nums[j]=nums[j-1]\n # nums[0]=temp\n # for i in range(n-k,n):\n # a.append(nums[i])\n # for i in range(n-k):\n # a.append(nums[i])\n # for i in range(n):\n # nums[i]=a[i]\n import numpy as np\n arr=np.roll(np.array(nums),k,axis=0).tolist()\n for i in range(n):\n nums[i]=arr[i]","runtime":"306"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n k=k%len(nums)\n n= len(nums)\n obj={}\n print(k)\n for i in range(0,n):\n new_k=i-k\n print(\"===\")\n print(new_k)\n if new_k<0:\n print(\"===n\")\n print(n)\n new_k= n+new_k\n print(\"===new_k\")\n print(new_k)\n obj[i]= nums[i] \n if new_k in obj:\n nums[i] = obj[new_k]\n else:\n print(i)\n print(new_k)\n nums[i] = nums[new_k]\n \n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n ","runtime":"320"},{"code":"import math\n\nclass Solution:\n def reverse_array(self, array, start, end):\n index_half = int(math.ceil((end - start) / 2))\n print('start', start, 'end', end, 'index_half', index_half)\n swap = None\n for i in range(0, index_half):\n print('start', start, 'end', end, 'index_half', index_half, 'i', i)\n swap = array[end - i]\n array[end - i] = array[start + i]\n array[start + i] = swap\n return array\n\n def rotate(self, nums: List[int], k: int) -> None:\n if(len(nums) == 1):\n return nums\n\n index_middle = k % len(nums)\n print('index_middle', index_middle)\n start = 0\n end = len(nums) - 1\n print('1. start', start, 'end', end)\n reversed_array = self.reverse_array(nums, start, end)\n print('reversed_array', reversed_array)\n start = 0\n end = index_middle - 1\n print('2. start', start, 'end', end)\n reversed_array = self.reverse_array(reversed_array, start, end)\n print('reversed_array', reversed_array)\n start = index_middle\n end = len(reversed_array) - 1\n print('3. start', start, 'end', end)\n reversed_array = self.reverse_array(reversed_array, start, end)\n print('reversed_array', reversed_array)\n return reversed_array","runtime":"320"},{"code":"import numpy as np\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k % len(nums)\n nums[:] = nums[-k:] + nums[:-k]\n \n \n\n \n \n\n\n\n ","runtime":"334"},{"code":"import numpy as np\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n size_arr = len(nums)\n rotate_arr = np.zeros(size_arr,dtype=int)\n for i in range(size_arr):\n place_to_rotate = (i+k)%size_arr\n rotate_arr[place_to_rotate] = nums[i]\n nums[:] = list(rotate_arr)","runtime":"334"},{"code":"\nimport numpy as np\n\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n\n nums[0:len(nums)] = np.roll(nums,k)\n\n #return(nums)\n\n ","runtime":"347"},{"code":"from queue import Queue\n\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n q = Queue()\n n = len(nums)\n for i in range(k%n):\n q.put(nums[i])\n for i in range(n):\n if(q.empty()):\n return\n el = q.get()\n x = nums[(k+i)%n]\n nums[(k+i)%n] = el\n q.put(x)\n ","runtime":"347"},{"code":"import numpy as np\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n res = np.roll(nums, k)\n for i in range(len(nums)):\n nums[i] = res[i]","runtime":"361"},{"code":"import numpy as np\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n '''arr=[]\n n=len(nums)\n for i in range(k+1, n):\n arr.append(nums[i])\n for i in range(0, k+1):\n arr.append(nums[i])\n print(arr)'''\n\n n = len(nums)\n k = k % n # In case k is greater than the length of the array\n nums[:] = nums[-k:] + nums[:-k]\n\n \n ","runtime":"361"},{"code":"import numpy as np\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k % len(nums)\n rotated = nums[-k:] + nums[:-k]\n\n nums.clear()\n nums.extend(rotated)\n","runtime":"375"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n length = len(nums)\n \n if length==1 or k==0:\n return\n\n if length==k:\n return\n\n k = k % length\n\n # Always taking the popped then place it at new location will not work if k divides into length perfectly\n # have to loop over all elements\n index = k\n source_num = nums[0]\n destination_num = nums[index]\n\n times = length/k\n divisible = not (times*10) % 10\n print(divisible, times)\n count=1\n\n touched_index=set()\n\n for i in range(length):\n print(f'iteration {i}')\n\n # if divisible and (i>1) and (i%times == 0) and k!=1:\n if index in touched_index:\n print('### perfectly divisible, switch to next index')\n index = (k+count) % length\n print(f'new index {count}')\n source_num = nums[count]\n print(f'new source_num {source_num}')\n destination_num = nums[count+k]\n print(f'new destination_num {destination_num}')\n count += 1\n \n # place source_num to index\n touched_index.add(index)\n nums[index] = source_num\n print(f'placing {source_num} at index {index}')\n source_num = destination_num \n print(f'source_num is now {destination_num}')\n index = (index + k) % length\n print(f'new index is {index}')\n destination_num = nums[index]\n print(f'destination_num is now {nums[index]} from index {index}')\n\n\n","runtime":"375"},{"code":"import numpy\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n count = len(nums)\n k = k % count\n\n newNums = numpy.array(nums)\n\n for i in range(count):\n nums[(i + k) % count] = newNums[i]\n\n \n ","runtime":"389"},{"code":"import queue\n\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n q = queue.Queue()\n\n temp = None\n for i in range(0, len(nums) + k):\n if q.qsize() < k + 1:\n q.put(nums[i % len(nums)])\n \n if q.qsize() == k + 1:\n nums[i % len(nums)] = q.get()\n","runtime":"389"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k=k%len(nums)\n temp=[]\n for i in range(-1,-k-1,-1):\n temp.insert(0,nums[i])\n for i in range(len(nums)-1,0,-1):\n nums[i]=nums[i-k]\n for i in range(0,len(temp)):\n nums[i]=temp[i]\n","runtime":"402"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n array_length = len(nums)\n\n result_array = []\n\n for i in range(k):\n idx_to_insert = (array_length - 1 - i) % array_length\n result_array.insert(0, nums[idx_to_insert])\n\n result_array.extend(nums[0:array_length - k])\n\n for i in range(array_length):\n nums[i] = result_array[i]\n\n return None","runtime":"416"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n len1 = len(nums)\n k = k%len1\n x = nums.copy()\n a = nums[0:len1-k]\n b = nums[len1-k:]\n i = 0\n while b:\n nums[i] = b.pop(0)\n i += 1\n while a:\n nums[i] = a.pop(0)\n i += 1\n","runtime":"430"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n\n size = len(nums)\n\n k = k % size\n \n \n temp1 = nums[0:-k]\n temp2 = nums[-k:size]\n\n for i in range(size):\n if temp2:\n nums[i] = temp2[0]\n temp2.pop(0)\n else:\n nums[i] = temp1[0]\n temp1.pop(0)\n\n\n\n\n #O(N2) SOLUTION OUT OF TIME\n \"\"\"\n for i in range(k):\n temp = nums[0]\n for j in range(1, size):\n temp, nums[j] = nums[j], temp\n if j == size - 1:\n nums[0] = temp\n break\n \"\"\" \n\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n ","runtime":"443"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n array_length = len(nums)\n\n result_array = []\n\n for i in range(k):\n idx_to_insert = (array_length - 1 - i) % array_length\n result_array.insert(0, nums[idx_to_insert])\n\n result_array.extend(nums[0:array_length - k])\n\n for i in range(array_length):\n nums[i] = result_array[i]\n\n return None","runtime":"457"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n array_length = len(nums)\n\n result_array = []\n\n for i in range(k):\n idx_to_insert = (array_length - 1 - i) % array_length\n result_array.insert(0, nums[idx_to_insert])\n\n result_array.extend(nums[0:array_length - k])\n\n nums[:] = result_array[:array_length]\n\n return None","runtime":"471"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k %= n # In case k is larger than the length of nums\n \n if k == 0 or len(nums) <= 1:\n return \n\n temp = []\n j = len(nums) - 1\n i = k\n while i > 0:\n temp.insert(0, nums[j])\n i -= 1\n j -= 1\n\n while j >= 0:\n nums[j + k] = nums[j]\n j -= 1\n\n while k > 0:\n nums [k - 1] = temp[k - 1]\n k -= 1","runtime":"484"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n # Version 2 - Using Queue\n queue = []\n nums_len = len(nums)\n\n # bound the number of k\n if k > nums_len:\n k = k % nums_len\n \n for i in range(nums_len):\n # start the indices with the items to be moved back\n idx = (i + k) % nums_len\n queue.append(nums[idx])\n # for a set of elements before k, concat to the back\n if i < k:\n nums[idx] = nums[i]\n else:\n nums[idx] = queue.pop(0)\n ","runtime":"484"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n trueK = k % len(nums)\n queue = []\n i = 0\n\n while i < trueK:\n queue.append(nums[i])\n nums[i] = nums[-1 * (trueK - i)]\n i += 1\n \n while i < len(nums):\n queue.append(nums[i])\n nums[i] = queue.pop(0)\n i += 1\n","runtime":"498"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n trueK = k % len(nums)\n queue = []\n i = 0\n\n while i < trueK:\n queue.append(nums[i])\n nums[i] = nums[-1 * (trueK - i)]\n i += 1\n \n while i < len(nums):\n queue.append(nums[i])\n nums[i] = queue.pop(0)\n i += 1\n","runtime":"498"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n buf = []\n l = len(nums)\n for i in range(l):\n if (i < (k % l)):\n buf.append(nums[(i + k) % l])\n nums[(i + k) % l] = nums[i]\n else:\n buf.append(nums[(i + k) % l])\n nums[(i + k) % l] = buf[0]\n buf.pop(0)\n\n ","runtime":"512"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n if k > len(nums):\n k = k % len(nums)\n\n tmp_list = nums[0:k:1]\n for i in range(k, len(nums)):\n tmp_list.append(nums[i])\n nums[i] = tmp_list[0]\n del tmp_list[0]\n\n for i in range(len(tmp_list)):\n nums[i] = tmp_list[i]\n\n","runtime":"512"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n num_len = len(nums)\n container = []\n cur_ind = rep_num_count = 0\n cur_val = nums[0]\n\n while num_len < k:\n k -= num_len\n\n if k == 0:\n return None\n \n new_ind = cur_ind + k\n\n while rep_num_count < num_len:\n if new_ind < num_len:\n container.append(nums[new_ind])\n nums[new_ind] = cur_val\n new_ind += 1\n else:\n new_ind = 0\n container.append(nums[new_ind])\n nums[new_ind] = cur_val\n new_ind += 1\n\n if cur_ind + 1 == k:\n cur_val = container.pop(0)\n else:\n cur_ind += 1\n cur_val = nums[cur_ind]\n\n rep_num_count += 1","runtime":"525"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = 2000\n l = len(nums)\n if l - (k % l) < k % l:\n if l - (k % l) > n:\n for i in range((l - (k % l)) // n):\n orig = nums[:n]\n nums[:l - n] = nums[n:]\n nums[-n: ] = orig\n for j in range((l - (k % l)) % n):\n orig = nums[0]\n nums[:l - 1] = nums[1:]\n nums[-1] = orig\n else: \n for i in range(l - (k % l)):\n orig = nums[0]\n nums[:l - 1] = nums[1:]\n nums[-1] = orig\n else:\n if k % l > 5:\n for i in range((k % l) // n):\n orig = nums[-n:]\n nums[n:] = nums[:l - n]\n nums[:n] = orig\n for j in range((k % l) % n):\n orig = nums[-1]\n nums[1:] = nums[:l - 1]\n nums[0] = orig\n \n else:\n for i in range(k % l):\n orig = nums[-1]\n nums[1:] = nums[:l - 1]\n nums[0] = orig\n\n\n\n ","runtime":"525"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n\n # for i in range(k):\n # y = nums.pop(len(nums) - 1)\n # nums.insert(0, y)\n\n # nums[:] = nums[len(nums)-k:len(nums)] + nums[0:len(nums)-k]\n\n queue = deque(nums)\n for i in range(100):\n for i in range(100):\n for i in range(100):\n x = 1\n queue.rotate(k)\n nums[:] = list(queue)\n\n\n \n\n \n # k = k % len(nums) \n # # Get the number of elements to move from the end to the beginning\n # r = len(nums) - k\n # # Store the elements to move\n # new = nums[0:r]\n # # Remove the elements from the beginning\n # nums[0:r] = []\n # # Append the stored elements to the end\n # nums.extend(new)","runtime":"539"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n N = len(nums)\n replaced_element = []\n while k > N:\n k = k - N\n\n for i in range(N):\n replaced_element.append(nums[i])\n if i < k:\n nums[i] = nums[(i-k)%N]\n else:\n nums[i] = replaced_element.pop(0)\n\n # print(replaced_element)\n ","runtime":"553"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k %= len(nums)\n start = nums[:len(nums) - k]\n for i in range(len(nums) - k):\n nums.pop(0)\n nums.extend(start)\n\n","runtime":"566"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n if not nums or len(nums) == 0:\n return\n \n k = k % len(nums)\n \n pos = len(nums) - k\n tmp_array = nums[:pos]\n for i in range(pos):\n nums.pop(0)\n \n nums.extend(tmp_array)\n\n","runtime":"566"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n newNums = []\n for i in range(len(nums)-k%len(nums)):\n newNums.append(nums[0])\n nums.pop(0)\n nums.extend(newNums)\n\n\n \n \n ","runtime":"580"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n gap = k % n\n if gap == 0:\n return nums\n new = nums[0:-gap]\n for i in range(n - gap):\n nums.pop(0)\n nums.extend(new)\n return ","runtime":"594"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n lnums = len(nums)\n while k > lnums:\n k = k - lnums\n nums_beg = nums[0:lnums - k]\n for _ in range(lnums - k):\n nums.remove(nums[0])\n nums.extend(nums_beg)\n return nums\n ","runtime":"608"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n if nums == [1,2] and k==5:\n nums.pop()\n nums.pop()\n nums.append(2)\n nums.append(1)\n liste = nums[:len(nums)-k]\n for i in range(len(liste)):\n nums.pop(0)\n for n in liste:\n nums.append(n)","runtime":"621"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n k=k%len(nums)\n x=len(nums)-k\n b=nums[:x] \n for i in b:\n nums.remove(i)\n nums.extend(b)\n ","runtime":"621"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n k = k%len(nums)\n n = len(nums)-k\n arr2 = nums[:n]\n for ele in arr2:\n nums.remove(ele)\n for ele in arr2:\n nums.append(ele)\n\n \n ","runtime":"635"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n s=[]\n q=len(nums)\n for i in range(len(nums)):\n c=(i+k)\n v=c%(q)\n s.insert(v,nums[i])\n for j in range(len(s)):\n nums[j]=s[j]\n ","runtime":"662"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n n=len(nums)\n r=[]\n for i in range(0,n):\n r.insert((i+k)%n,nums[i])\n nums.clear()\n for i in r:\n nums.append(i)\n \n \n\n ","runtime":"662"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = k % n\n q = []\n i, j = 0, n - k\n while i < n:\n q.append(nums[i])\n if j < n:\n nums[i] = nums[j]\n else:\n num = q.pop(0)\n nums[i] = num\n j += 1\n i += 1\n\n ","runtime":"676"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n\n k = k % len(nums)\n \n\n store = nums[-k:]\n \n for i in range(k):\n nums.pop()\n for i in range(k):\n nums.insert(i, store[i])\n return nums\n \n \n\n ","runtime":"676"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n if(k > len(nums)):\n k = k % len(nums)\n arr = []\n for i in range(len(nums)):\n if(len(arr) < k):\n arr.append(nums[i])\n else:\n arr.append(nums[i])\n nums[i] = arr.pop(0)\n for i in range(len(arr)):\n nums[i] = arr.pop(0)\n \n\n\n ","runtime":"690"},{"code":"class Solution:\n\n def rotateByOne(self , nums: List[int]) -> None :\n newList = [] * len(nums)\n\n k=1\n \n n = len(nums)\n j = 0\n if k>=n :\n k = int(k%n)\n \n for i in range(0,len(nums)) :\n if (i+k) < n :\n j = (i+k)\n newList.insert(j,nums[i])\n elif (i+k) >= n :\n j = (i+k) - n\n newList.insert(j,nums[i])\n \n for i in range(0,n) :\n nums[i] = newList[i]\n\n\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n newList = [] * len(nums)\n \n n = len(nums)\n j = 0\n if k>=n :\n k = int(k%n)\n \n for i in range(0,len(nums)) :\n if (i+k) < n :\n j = (i+k)\n newList.insert(j,nums[i])\n elif (i+k) >= n :\n j = (i+k) - n\n newList.insert(j,nums[i])\n \n for i in range(0,n) :\n nums[i] = newList[i]\n\n \n ","runtime":"690"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n # [1,2,3,4,5,6,7]\n # [4,5,6,0,1,2,3]\n # [n-k,n-k-1,n-k-2,0,1,2,3]\n # [4,5,6,n-k-4, n-k-3, n-k-2, n-k-1]\n\n\n queue = []\n n = len(nums)\n if n == k:\n return\n if k > n:\n k = k % n\n\n for i in range(n-1, -1, -1):\n queue.append(nums[i])\n if n - k - (n - i) >= 0:\n nums[i] = nums[n - k - (n - i)]\n else:\n nums[i] = queue.pop(0)\n \n\n ","runtime":"703"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n move_delta = k % len(nums)\n\n result_arr = []\n\n for i in range(len(nums)):\n idx = i + move_delta\n if (move_delta + i) > len(nums)-1:\n idx = (move_delta + i) - len(nums)\n print(idx, nums[i])\n result_arr.insert(idx, nums[i])\n\n for i in range(len(nums)):\n nums[i] = result_arr[i]","runtime":"717"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k % len(nums)\n l = len(nums)\n k=l-k\n \n for i in range(k):\n tmp = nums.pop(0)\n nums.append(tmp)","runtime":"731"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n i = 0\n lenght = len(nums)\n k -= (k // lenght) * lenght\n while k:\n buff = nums[k-1]\n nums[k-1] = nums[-1]\n nums.insert(k + i, buff)\n nums.pop(-1)\n k -= 1\n i += 1 ","runtime":"744"},{"code":"\"\"\"\nMethod 1: Use two rounds of reverses (the order of round 1 and round 2 can be swapped):\n Round 1: reverse the overall nums, yielding nums_r;\n Round 2: reverse nums_r[0, n - k] and nums_r[n - k, n] respectively.\nTime: O(n), where n = len(nums)\nSpace: O(1)\n\n\nMethod 2: Employ Python functions: \n element = lst.pop(-1), and, lst.insert(0, element)\nTime: O(k), where n = len(nums)\nSpace: O(1)\n\n\nMethod 3: Employ Python functions: \n element = lst.pop(0), and, lst.append(element)\nTime: O(n - k), where n = len(nums)\nSpace: O(1)\n\n\nMethod 4 ( *invalid* ): list slicing\nTime: O(1)\nSpace: O(1)\n\nNote: \n1. lst.insert(pos, element), where pos specifies the position index (starting from 0) at which to insert element\n2. int(9.9) = 9\n\"\"\"\n\nclass Solution:\n def rotate1(self, nums: List[int], k: int) -> None:\n \"\"\"\n Method 1. Do not return anything, modify nums in-place instead.\n Round 1 reverse and round 2 reverse can be swapped.\n \"\"\"\n n = len(nums)\n k = k % n\n\n # round 1\n self.reverse(nums, 0, n) # reverse nums[0: n]\n\n # round 2\n self.reverse(nums, 0, k) # reverse nums[0: k]\n self.reverse(nums, k, n) # reverse nums[k: n]\n \n def reverse(self, lst: List[int], s: int, e: int) -> None:\n \"\"\"\n Given lst[s: e] where the last element is excluded, this method in-place reverses the involving elements.\n \"\"\"\n for i in range(int((e - s) / 2)):\n tmp = lst[s + i]\n lst[s + i] = lst[e - 1 - i]\n lst[e - 1 - i] = tmp\n \n def rotate2(self, nums: List[int], k: int) -> None:\n \"\"\"\n Method 2. Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = k % n\n\n for i in range(k):\n element = nums.pop(-1)\n nums.insert(0, element)\n\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Method 3. Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = k % n # k = 0, 1, ..., n - 1 ==> (n - k) = n, n - 1, ..., 1\n m = (n - k) % n\n\n for i in range(m):\n element = nums.pop(0)\n nums.append(element)\n \n def rotate4(self, nums: List[int], k: int) -> None:\n \"\"\"\n Method 4 ( *invalid* ). Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = k % n\n nums = nums[n - k: n] + nums[0: n - k]\n ","runtime":"758"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = mod(k, len(nums))\n delta = len(nums) - k # effectively, left rotate these many times\n\n for i in range(delta):\n # pop first element\n # append to nums\n c = nums[0]\n nums.pop(0)\n nums.append(c)","runtime":"758"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n '''n=len(nums)\n k=k%n\n print(nums[-k:])\n print(nums[:-k])\n nums[:]=nums[-k:]+nums[:-k]'''\n k = k%len(nums)\n a = len(nums) - k\n for i in range(a):\n nums.append(nums[0])\n nums.pop(0)\n\n \n ","runtime":"772"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n l = len(nums)\n dif = 0\n \n if k > l:\n k = k-l*(k//l)\n \n for i in range(l-k):\n nums.append(nums[i-dif])\n nums.pop(i-dif)\n dif += 1","runtime":"772"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n length=len(nums)\n\n rem=k%length\n for _ in range(length-rem):\n popped=nums.pop(0)\n nums.append(popped)","runtime":"785"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k % len(nums)\n for _ in range(len(nums)-k):\n val = nums.pop(0)\n nums.append(val)","runtime":"785"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n lenNums = len(nums)\n if k > lenNums:\n k = k % lenNums\n for i in range(0, lenNums-k):\n nums.append(nums.pop(0))\n ","runtime":"799"},{"code":"class Solution:\n def rotate(self, nums, k):\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = len(nums)-k\n x = k%len(nums)\n for i in range(x):\n c = nums.pop(0)\n nums.append(c)\n return nums\n\na = Solution()\nprint(a.rotate([1,2,3,4,5,6,7],3))\n ","runtime":"799"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n k = k%len(nums)\n for i in range(len(nums)-k):\n t = nums.pop(0)\n print(t)\n nums.append(t)\n \n\n","runtime":"813"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n len_list = len(nums)\n k = k % len_list\n space = (len_list - k) % len_list\n for _ in range(space):\n idx = 0\n num_to_insert = nums.pop(idx)\n print(num_to_insert)\n nums.append(num_to_insert)\n \n \n\n\n ","runtime":"813"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k % len(nums)\n rotateArr = nums[len(nums) - k:]\n for i in range(0, len(rotateArr)):\n nums.pop(len(nums)-1)\n nums.insert(i, rotateArr[i])\n ","runtime":"827"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n numsLen = len(nums)\n k = k % numsLen\n nums.extend(nums)\n print(nums)\n for i in range(2*numsLen-1, -1, -1):\n if i < numsLen-k or i > 2*numsLen-k-1:\n print(i)\n nums.pop(i)\n \n","runtime":"840"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n=len(nums)\n curr=0\n if k>=n:\n k=k%n\n arr=[]\n for i in range(n-k-1):\n curr+=1\n for i in range(k):\n temp=nums.pop(curr+1)\n arr.append(temp)\n i=0\n while i!=len(arr):\n nums.insert(i,arr[i])\n i+=1\n \n \n\n\n","runtime":"840"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n is_even = n % 2\n i = 0\n x = nums[0:k]\n\n while (i < n):\n p = (i + k) % n\n x.append(nums[p])\n nums[p] = x.pop(0)\n i += 1\n ","runtime":"854"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n l = len(nums)\n if k > l:\n k = k%l\n \n if k == l :\n return nums\n \n\n a = nums[-k:]\n for i in range(l): \n a.append(nums[i])\n nums[i]=a.pop(0)\n\n\n ","runtime":"868"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n if k == 0: return\n queue = nums[:k]\n n = len(nums)\n for i in range(len(nums)):\n new_val = queue.pop(0)\n queue.append(nums[(k + i) % n])\n nums[(k+i) % n ] = new_val\n return\n ","runtime":"881"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n if k == 0:\n return\n n = len(nums)\n for i in range(k):\n queue = []\n for i in range(n-k%n, n):\n queue.append(nums[i])\n for i in range(n):\n queue.append(nums[i])\n nums[i] = queue.pop(0)\n \n return","runtime":"895"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n queue = list(nums[:k])\n for i in range(k,len(nums)+k):\n i = i % len(nums)\n queue.append(nums[i])\n nums[i] = queue.pop(0)\n\n ","runtime":"909"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n len_ = len(nums)\n k %= len_\n nums.extend(nums[:-k])\n\n while len(nums) > len_:\n nums.pop(0)\n","runtime":"909"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n nums.reverse()\n for i in range(k):\n nums.append(nums.pop(0))\n nums.reverse()\n ","runtime":"922"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n m=(len(nums)-k) % len(nums)\n if m == 0:\n return\n nums.extend(nums[:m])\n for i in range(m):\n nums.pop(0)","runtime":"922"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = k if k<len(nums) else k%len(nums)\n nums.reverse()\n for i in nums[:n]:\n nums.append(i)\n nums.pop(0)\n nums.reverse()","runtime":"936"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = k % n \n nums.extend(nums[:n-k])\n for i in range(n-k):\n nums.pop(0)","runtime":"936"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k %= len(nums)\n nums.reverse()\n for i in range(k):\n elem = nums.pop(0)\n nums.append(elem)\n nums.reverse()","runtime":"950"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n nums.reverse()\n for i in range(k):\n elem = nums.pop(0)\n nums.append(elem)\n nums.reverse()","runtime":"950"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n for i in range(k):\n nums1 = nums[-1:]\n del nums[-1:] \n nums[:0] = nums1\n \n\n ","runtime":"963"},{"code":"class Solution:\n def rotate(self, nums: list[int], k: int) -> None:\n loop = 0\n\n if k == 0: return\n\n while True:\n nums[:0] = [nums[len(nums)-1]]\n nums.pop(-1)\n loop += 1\n\n if loop == k: return","runtime":"963"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n k = k % len(nums) \n s = []\n for i in range(k):\n s.append(nums.pop())\n for i in range(len(s)):\n nums.insert(0, s[i])\n ","runtime":"977"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = k%n\n a = nums[-k:]\n del nums[-k:]\n a.reverse()\n for i in a:\n nums.insert(0, i)\n \n\n \n ","runtime":"977"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n swap_amount = (k % len(nums))\n to_move = nums[len(nums)-1:len(nums) - 1 - swap_amount:-1]\n del(nums[len(nums)-1:len(nums) - 1 - swap_amount:-1])\n for x in to_move:\n nums.insert(0,x)\n \n\n\n\n\n '''\n def step(nums:List[int]):\n last = nums[-1]\n to_swap = nums[0]\n to_bank = nums[0]\n for i in range(0,len(nums)-1):\n to_swap = to_bank\n to_bank = nums[i+1]\n nums[i+1] = to_swap\n nums[0] = last\n\n for i in range(k % len(nums)):\n print(i)\n step(nums)\n '''\n \n \n ","runtime":"991"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n # [1,2,3,4,5] k = 2 res = [4,5,1,2,3]\n finalK = k % len(nums)\n backElems = nums[-finalK:]\n #frontElems = nums[:(len(nums)-k)]\n del nums[-finalK:]\n for i in backElems[::-1]:\n nums.insert(0, i)","runtime":"991"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k % len(nums)\n poped = []\n for _ in range(k):\n poped.append(nums.pop())\n for n in poped:\n nums.insert(0, n)","runtime":"1004"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n length = len(nums)\n if k > length:\n k = k % length\n temp = []\n for i in range(k):\n temp.append(nums.pop())\n for i in range(k):\n nums.insert(0, temp[i])","runtime":"1004"},{"code":"\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n if k == 0:\n return\n if k < len(nums):\n rotation_list = nums[-k:]\n del nums[-k:]\n for i in range(k):\n nums.insert(0, rotation_list[-i - 1])\n else:\n buff = 0\n i = 0\n while i < k:\n buff = nums.pop(-1)\n nums.insert(0, buff)\n i += 1","runtime":"1018"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n while k > len(nums):\n k = k - len(nums)\n\n\n else:\n move = nums[-k:]\n print(move)\n del nums[-k:]\n for i in range(len(move)-1, -1, -1):\n print(move[i])\n nums.insert(0, move[i])","runtime":"1018"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n lenth = len(nums)\n j = 0\n if k == lenth:\n return\n if k > lenth:\n k = k % lenth\n for i in range(lenth-k, lenth):\n temp = nums.pop(i)\n nums.insert(j, temp)\n j += 1\n","runtime":"1032"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n\n while k > len(nums):\n k = k - len(nums)\n \n rotateBy = len(nums)-k\n pointer =0\n if len(nums)==1:\n return nums\n if k<=len(nums):\n while rotateBy < len(nums):\n x= nums[rotateBy]\n nums.pop(rotateBy)\n nums.insert(pointer,x)\n \n rotateBy+=1\n pointer+=1\n\n return nums\n else:\n x = nums.pop(len(nums)-1)\n nums.insert(0,x)\n return nums\n\n ","runtime":"1032"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n l = len(nums)\n k = k % l \n i = 0\n for i in range(k):\n nums.insert(i,nums.pop(l-k+i))\n","runtime":"1046"},{"code":"from typing import List\r\n\r\n\r\nclass Solution:\r\n def rotate(self, nums: List[int], k: int) -> None:\r\n \"\"\"\r\n Do not return anything, modify nums in-place instead.\r\n \"\"\"\r\n step = 0\r\n \r\n for i in range(len(nums) - k%len(nums), len(nums)):\r\n nums.insert(step, nums.pop(i))\r\n step += 1","runtime":"1046"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n l = len(nums)\n k = k % l \n i = 0\n for i in range(k):\n nums.insert(i,nums.pop(l-k+i))\n","runtime":"1059"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n if k > len(nums):\n k = k % len(nums)\n\n\n k = k * -1\n i = 0\n\n while k < 0:\n nums.insert(i, nums.pop(k))\n k += 1\n i += 1\n ","runtime":"1059"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n # if k>len(nums):\n # k=k%len(nums)\n # for i in range(k):\n # tmp=nums.pop()\n # nums.insert(0, tmp)\n \n \n\n\n\n\n\n\n\n\n\n\n\n\n left=0\n if k>len(nums):\n k=k%len(nums)\n for i in range(len(nums)-k,len(nums)):\n temp=nums.pop(i)\n nums.insert(left,temp)\n left=left+1\n print(nums)\n\n\n","runtime":"1073"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n lenth = len(nums)\n j = 0\n if k == lenth:\n return\n if k > lenth:\n k = k % lenth\n for i in range(lenth-k, lenth):\n temp = nums.pop(i)\n nums.insert(j, temp)\n j += 1\n","runtime":"1073"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n for num in range(k):\n pop = nums.pop()\n nums.insert(0, pop)\n ","runtime":"1087"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n i=0\n while(i<k):\n a=nums.pop()\n nums.insert(0,a)\n i+=1","runtime":"1087"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n for i in range(k%len(nums)):\n last = nums.pop() \n nums.insert(0, last)\n ","runtime":"1100"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n act_k = k % len(nums)\n for i in range(act_k):\n last = nums.pop()\n nums.insert(0,last)","runtime":"1100"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n for _ in range(k):\n x = nums.pop()\n nums.insert(0,x)\n \n ","runtime":"1114"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n for i in range(k):\n num = nums.pop()\n nums.insert(0,num)","runtime":"1114"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n \n\n for i in range(k):\n a = nums.pop(-1)\n nums.insert(0, a)","runtime":"1128"}],"string":"[\n {\n \"code\": \"def rotate(nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k%len(nums)\\n nums[:] = nums[-k:] + nums[:-k]\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as Solution:\\n for nums, k in zip(map(loads, stdin), map(int, stdin)):\\n rotate(nums, k)\\n Solution.write(f\\\"{nums}\\\\n\\\".replace(\\\" \\\",\\\"\\\"))\\nexit()\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k%len(nums)\\n nums[:] = nums[-k:] + nums[:-k]\\n\\n with open(\\\"user.out\\\", \\\"w\\\") as Solution:\\n for nums, k in zip(map(loads, stdin), map(int, stdin)):\\n rotate(nums, k)\\n Solution.write(f\\\"{nums}\\\\n\\\".replace(\\\" \\\",\\\"\\\"))\\n exit()\\n\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"def rotate(nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k%len(nums)\\n nums[:] = nums[-k:] + nums[:-k]\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as Solution:\\n for nums, k in zip(map(loads, stdin), map(int, stdin)):\\n rotate(nums, k)\\n Solution.write(f\\\"{nums}\\\\n\\\".replace(\\\" \\\",\\\"\\\"))\\nexit()\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n # Get the actual number of rotations\\n k = k % len(nums) \\n # Get the number of elements to move from the end to the beginning\\n r = len(nums) - k\\n # Store the elements to move\\n new = nums[0:r]\\n # Remove the elements from the beginning\\n nums[0:r] = []\\n # Append the stored elements to the end\\n nums.extend(new)\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n n = len(nums)\\n k %= n # In case k is larger than the array length\\n \\n # Reverse the entire array\\n nums.reverse()\\n \\n # Reverse the first k elements\\n nums[:k] = reversed(nums[:k])\\n \\n # Reverse the remaining elements\\n nums[k:] = reversed(nums[k:])\\n\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k%n\\n nums[:] = nums[-k:] + nums[:-k]\",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k % n\\n \\n def reverse(nums, start, end):\\n while start < end:\\n nums[start], nums[end] = nums[end], nums[start]\\n start += 1\\n end -= 1\\n \\n reverse(nums, 0 , n-1 )\\n reverse(nums, 0, k-1 )\\n reverse(nums, k, n-1)\\n # def rotate(nums):\\n # tem = nums[-1]\\n # for idx in range(n-1, 0, -1):\\n # nums[idx] = nums[idx-1]\\n # nums[0] = tem\\n\\n # for _ in range(k):\\n # rotate(nums)\\n \",\n \"runtime\": \"101\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k=k%len(nums)\\n nums.reverse()\\n nums[:k]=reversed(nums[:k])\\n nums[k:]=reversed(nums[k:])\\n \",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k % n\\n nums.reverse()\\n nums[:k] = reversed(nums[:k])\\n nums[k:] = reversed(nums[k:])\\n \\n\\n \\n\\n\\n \\n\\n \\n \\n \",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n if not nums:\\n return []\\n l = len(nums)\\n k = k % l\\n nums[:] = nums[l-k:] + nums[:l-k]\\n\\n \",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k %= len(nums)\\n nums[:] = nums[-k:] + nums[:-k]\",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k %= len(nums)\\n if k == 0:\\n return nums\\n\\n num_iter = len(nums) // k\\n for i in range(1, num_iter):\\n print(k, i*k, i*k+k)\\n nums[:k], nums[i*k:i*k+k] = nums[i*k:i*k+k], nums[:k]\\n \\n rm = len(nums) % k\\n if rm != 0:\\n nums[:rm], nums[-rm:] = nums[-rm:], nums[:rm]\\n nums[:k-rm], nums[k-rm:k]= nums[rm:k], nums[:rm]\\n \",\n \"runtime\": \"156\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n # for i in range(k):\\n # p = nums.pop()\\n # nums.insert(0, p)\\n if k > len(nums): k = k % len(nums)\\n l1, l2 = nums[: len(nums)-k], nums[len(nums)-k:]\\n nums[:] = l2 + l1\",\n \"runtime\": \"156\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n k = k % len(nums)\\n s, e = 0-k, len(nums)-1-k\\n dup = nums[:]\\n for i in range(s, e+1):\\n nums[i+k] = dup[i]\\n\",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n \\n k = k % len(nums)\\n left, right = 0, len(nums)-1\\n while left < right:\\n nums[left],nums[right] = nums[right],nums[left]\\n left += 1\\n right -= 1\\n \\n left, right = 0, k - 1\\n while left < right:\\n nums[left],nums[right] = nums[right],nums[left]\\n left += 1\\n right -= 1\\n \\n left, right = k , len(nums)-1\\n while left < right:\\n nums[left],nums[right] = nums[right],nums[left]\\n left += 1\\n right -= 1\",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n \\n n = len(nums)\\n k = k % n\\n self.rotate_recur(nums, k, 0, n-1)\\n\\n def rotate_recur(self, nums: List[int], k: int, p: int, q: int) -> None:\\n n = q-p+1\\n if k == 0 or q == p:\\n return\\n elif 2*k == n:\\n for j in range(0, k):\\n nums[p+j], nums[p+n-k+j] = nums[p+n-k+j], nums[p+j]\\n elif 2*k < n:\\n for j in range(0, k):\\n nums[p+j], nums[p+n-k+j] = nums[p+n-k+j], nums[p+j]\\n self.rotate_recur(nums, k, p+k, q)\\n else:\\n k = n-k\\n for j in range(0, k):\\n nums[p+j], nums[p+n-k+j] = nums[p+n-k+j], nums[p+j]\\n self.rotate_recur(nums, n-2*k, p, q-k)\\n\",\n \"runtime\": \"183\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n\\n if k == 0:\\n return \\n if len(nums) == 1:\\n return\\n if k > len(nums):\\n k = (k - len(nums)) % len(nums)\\n print(k)\\n buffer = nums[len(nums) - k:]\\n print(buffer)\\n index = 0\\n \\n for index in range(len(nums)):\\n localIndex = index % k\\n print(localIndex)\\n temp = buffer[localIndex]\\n buffer[localIndex] = nums[index]\\n nums[index] = temp\\n\\n\",\n \"runtime\": \"183\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n\\n\\n copy = nums[:]\\n \\n for i in range(len(nums)):\\n index = i-k\\n index = index%len(nums)\\n print(index)\\n nums[i] = copy[index]\\n \\n\\n\\n #insert the very last element into first place of nums\",\n \"runtime\": \"197\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k % len(nums)\\n temp = [0] * len(nums)\\n for i in range(len(nums)):\\n if i+k < len(nums):\\n j = i + k \\n else:\\n j = i+k-len(nums)\\n print('j', j)\\n temp[j] = nums[i]\\n for i in range(len(temp)):\\n nums[i]=temp[i]\\n\",\n \"runtime\": \"197\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n visited={}\\n allVisited=0\\n temp1=nums[0]\\n for i in range(len(nums)):\\n visited[i]=0\\n i=0\\n while allVisited<len(nums):\\n if(visited[i]==0):\\n visited[i]=1\\n temp2=nums[(i+k)%len(nums)]\\n nums[(i+k)%len(nums)] = temp1\\n temp1=temp2\\n i=(i+k)%len(nums)\\n allVisited+=1\\n else:\\n i=(i+1)%len(nums)\\n temp1=nums[i]\\n\\n\\n # i->(i+k)%len(nums)\",\n \"runtime\": \"211\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n \\n n = len(nums)\\n k = k%n\\n tmp = nums[0:n-k]\\n nums[0:n-k] = []\\n nums.extend(tmp)\\n\\n\\n\\n \",\n \"runtime\": \"211\"\n },\n {\n \"code\": \"from collections import deque \\n\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n dq = deque(nums)\\n\\n for _ in range(k):\\n num = dq.pop()\\n dq.appendleft(num)\\n \\n for i in range(len(dq)):\\n nums[i] = dq[i]\\n dq.clear()\",\n \"runtime\": \"224\"\n },\n {\n \"code\": \"from collections import deque \\n\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n dq = deque(nums)\\n\\n for _ in range(k):\\n num = dq.pop()\\n dq.appendleft(num)\\n \\n for i in range(len(dq)):\\n nums[i] = dq[i]\",\n \"runtime\": \"224\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n numsD = collections.deque(nums)\\n k = k%len(nums)\\n for i in range(k):\\n num = numsD.pop()\\n numsD.appendleft(num)\\n \\n for i in range(len(numsD)):\\n nums[i] = numsD[i]\\n\\n\\n \",\n \"runtime\": \"238\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n if k==0 or k==len(nums) or k%len(nums)==0:\\n pass\\n else:\\n k = k%len(nums)\\n n = len(nums)\\n arr = Solution.reverse_array(nums,n-k,n-1)\\n arr = Solution.reverse_array(nums,0,n-k-1)\\n arr = Solution.reverse_array(nums,0,n-1)\\n def reverse_array(arr,start_index,end_index):\\n while start_index<end_index:\\n print(\\\"start=\\\",start_index,\\\",end=\\\",end_index)\\n arr[start_index],arr[end_index] = arr[end_index],arr[start_index]\\n start_index+=1\\n end_index -=1 \\n return arr\",\n \"runtime\": \"238\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n # Solution #1: would typically do with list comprehension in python, but this requires extra memory; essentially creates a new list\\n # Solution #2: create a new list manually; still requires extra memory\\n cur_idx = 0\\n rewrite_idx = None\\n temp_val = nums[0]\\n l = len(nums) - 1\\n loops = 0\\n\\n if l == 0:\\n return\\n # probably need to handle if k > len(nums)\\n for i in range(0, l+1):\\n # determine next idx to write to\\n rewrite_idx = cur_idx + k\\n if rewrite_idx > l:\\n print(f\\\"{rewrite_idx} and {l}\\\")\\n #rewrite_idx = rewrite_idx % l - 1 if l > 1 else 0\\n rewrite_idx = rewrite_idx % len(nums)\\n print(f\\\"Wrapping rewrite_idx to {rewrite_idx}\\\")\\n # if we have written this before, we need to offset our next set of writes\\n\\n if i > 0 and rewrite_idx == k + loops:\\n loops += 1\\n rewrite_idx += 1\\n cur_idx += 1\\n print(f\\\"Shifting cur_idx forward to {cur_idx}\\\")\\n temp_val = nums[cur_idx]\\n \\n new_temp_val = nums[rewrite_idx]\\n print(f\\\"writing val {temp_val} from {cur_idx} over val {new_temp_val} from {rewrite_idx}\\\")\\n nums[rewrite_idx] = temp_val\\n cur_idx = rewrite_idx\\n temp_val = new_temp_val\",\n \"runtime\": \"252\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n k = k % len(nums)\\n\\n for x in range(floor(len(nums) / 2)):\\n self.reverse(nums,x,0)\\n x += 1\\n\\n for x in range(floor( k / 2)): \\n self.reverse(nums,x, len(nums) - k)\\n x += 1\\n\\n for x in range(k,floor((k + len(nums)) / 2) ):\\n self.reverse(nums,x,-k)\\n x+=1\\n \\n\\n \\n\\n def reverse(self,nums, x,k):\\n \\n print(nums[x])\\n print(nums[-1-x-k])\\n nums[x] += nums[-1 - x -k]\\n nums[-1 -x-k] = nums[x] - nums[-1-x-k]\\n nums[x] = nums[x] - nums[-1-x-k]\\n \\n\\n\",\n \"runtime\": \"252\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n def rotate_by_idx(begin, end, k):\\n n = end - begin\\n k = k % n\\n half = n // 2\\n if n == 1 or k == 0:\\n return\\n elif half < k:\\n rotate_by_idx(begin, begin+n-half, k-half)\\n rotate_by_idx(begin+k-half, end, half)\\n return\\n else:\\n for i in range(k):\\n nums[begin+i], nums[begin+n-k+i] = nums[begin+n-k+i], nums[begin+i]\\n rotate_by_idx(begin+k, end, k)\\n return\\n \\n rotate_by_idx(0, len(nums), k)\\n\",\n \"runtime\": \"265\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n def reverse(start,end):\\n mid = (end + start + 1)//2\\n\\n for i in range(start, mid):\\n print(mid, start,end, i, end-i+start)\\n tmp = nums[i]\\n nums[i] = nums[end-i+start]\\n nums[end-i+start] = tmp\\n return\\n \\n\\n n = len(nums)\\n k = k%n\\n if not k:\\n return\\n\\n reverse(0,n-k-1)\\n reverse(n-k,n-1)\\n reverse(0,n-1)\\n return\\n\\n\\n \",\n \"runtime\": \"265\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n\\n starters = set(range(k % n))\\n while len(starters) > 0:\\n s = starters.pop()\\n print(s, starters)\\n # swap forward until landing back on s\\n idx = s\\n # print(\\\"\\\\t\\\", idx)\\n prev_keep_value = nums[idx]\\n while (idx + k) % n != s:\\n print(\\\"\\\\t\\\", idx % n, (idx + k) % n)\\n keep_value = nums[(idx + k) % n]\\n nums[(idx + k) % n] = prev_keep_value\\n prev_keep_value = keep_value\\n idx = (idx + k) % n\\n if idx < k:\\n if idx in starters:\\n starters.remove(idx)\\n nums[s] = prev_keep_value\\n if s in starters:\\n starters.remove(s)\",\n \"runtime\": \"279\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n\\n starters = set(range(k % n))\\n while len(starters) > 0:\\n s = starters.pop()\\n print(s, starters)\\n # swap forward until landing back on s\\n idx = s\\n # print(\\\"\\\\t\\\", idx)\\n prev_keep_value = nums[idx]\\n while (idx + k) % n != s:\\n print(\\\"\\\\t\\\", idx % n, (idx + k) % n)\\n keep_value = nums[(idx + k) % n]\\n nums[(idx + k) % n] = prev_keep_value\\n prev_keep_value = keep_value\\n idx = (idx + k) % n\\n if idx < k:\\n if idx in starters:\\n starters.remove(idx)\\n nums[s] = prev_keep_value\\n # if s in starters:\\n # starters.remove(s)\",\n \"runtime\": \"279\"\n },\n {\n \"code\": \"class ListNode:\\n def __init__(self, value):\\n self.value = value\\n self.next = None\\n\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n if len(nums) == 1 or k == 0:\\n return\\n\\n curr_node = None\\n prev_node = None\\n k_1 = (len(nums) - k) % len(nums) # k has to be inverse because as you shift the array you are getting clpser\\n\\n head = ListNode(nums[k_1])\\n prev_node = head\\n\\n\\n for i in range(1, len(nums)): # may have to rethink the range because it only goes to the end -- need a condition either modulus or at end to wrap around\\n j = (k_1 + i) % len(nums)\\n curr_node = ListNode(nums[j])\\n prev_node.next = curr_node\\n print(prev_node.value, prev_node.next)\\n prev_node = curr_node\\n \\n curr_node = head\\n for i in range(len(nums)):\\n nums[i] = curr_node.value\\n curr_node = curr_node.next\\n\\n\\n \\n \\n\\n\\n\\n\\n\\n \\n\\n # 5 mod 7 = 2\\n # 4 mod 7\",\n \"runtime\": \"293\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k % n\\n\\n # 1)\\n # nums[:] = nums[-k:] + nums[:-k]\\n\\n # 2)\\n def reverse(start: int, end: int) -> None:\\n while start < end:\\n nums[start], nums[end] = nums[end], nums[start]\\n start, end = start + 1, end - 1\\n\\n reverse(0, n - 1)\\n reverse(0, k - 1)\\n reverse(k, n - 1)\\n\",\n \"runtime\": \"293\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Rotate the array nums to the right by k steps, in-place.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k %= n \\n \\n if k > 0:\\n nums.reverse() \\n nums[:k] = reversed(nums[:k])\\n nums[k:] = reversed(nums[k:])\\n \\n result = np.array(nums)\\n print(result)\\n\\n\",\n \"runtime\": \"306\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n a=[]\\n n=len(nums)\\n # for i in range(k):\\n # temp=nums[n-1]\\n # for j in range(n-1,-1,-1):\\n # nums[j]=nums[j-1]\\n # nums[0]=temp\\n # for i in range(n-k,n):\\n # a.append(nums[i])\\n # for i in range(n-k):\\n # a.append(nums[i])\\n # for i in range(n):\\n # nums[i]=a[i]\\n import numpy as np\\n arr=np.roll(np.array(nums),k,axis=0).tolist()\\n for i in range(n):\\n nums[i]=arr[i]\",\n \"runtime\": \"306\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n k=k%len(nums)\\n n= len(nums)\\n obj={}\\n print(k)\\n for i in range(0,n):\\n new_k=i-k\\n print(\\\"===\\\")\\n print(new_k)\\n if new_k<0:\\n print(\\\"===n\\\")\\n print(n)\\n new_k= n+new_k\\n print(\\\"===new_k\\\")\\n print(new_k)\\n obj[i]= nums[i] \\n if new_k in obj:\\n nums[i] = obj[new_k]\\n else:\\n print(i)\\n print(new_k)\\n nums[i] = nums[new_k]\\n \\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n \",\n \"runtime\": \"320\"\n },\n {\n \"code\": \"import math\\n\\nclass Solution:\\n def reverse_array(self, array, start, end):\\n index_half = int(math.ceil((end - start) / 2))\\n print('start', start, 'end', end, 'index_half', index_half)\\n swap = None\\n for i in range(0, index_half):\\n print('start', start, 'end', end, 'index_half', index_half, 'i', i)\\n swap = array[end - i]\\n array[end - i] = array[start + i]\\n array[start + i] = swap\\n return array\\n\\n def rotate(self, nums: List[int], k: int) -> None:\\n if(len(nums) == 1):\\n return nums\\n\\n index_middle = k % len(nums)\\n print('index_middle', index_middle)\\n start = 0\\n end = len(nums) - 1\\n print('1. start', start, 'end', end)\\n reversed_array = self.reverse_array(nums, start, end)\\n print('reversed_array', reversed_array)\\n start = 0\\n end = index_middle - 1\\n print('2. start', start, 'end', end)\\n reversed_array = self.reverse_array(reversed_array, start, end)\\n print('reversed_array', reversed_array)\\n start = index_middle\\n end = len(reversed_array) - 1\\n print('3. start', start, 'end', end)\\n reversed_array = self.reverse_array(reversed_array, start, end)\\n print('reversed_array', reversed_array)\\n return reversed_array\",\n \"runtime\": \"320\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k % len(nums)\\n nums[:] = nums[-k:] + nums[:-k]\\n \\n \\n\\n \\n \\n\\n\\n\\n \",\n \"runtime\": \"334\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n size_arr = len(nums)\\n rotate_arr = np.zeros(size_arr,dtype=int)\\n for i in range(size_arr):\\n place_to_rotate = (i+k)%size_arr\\n rotate_arr[place_to_rotate] = nums[i]\\n nums[:] = list(rotate_arr)\",\n \"runtime\": \"334\"\n },\n {\n \"code\": \"\\nimport numpy as np\\n\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n\\n nums[0:len(nums)] = np.roll(nums,k)\\n\\n #return(nums)\\n\\n \",\n \"runtime\": \"347\"\n },\n {\n \"code\": \"from queue import Queue\\n\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n q = Queue()\\n n = len(nums)\\n for i in range(k%n):\\n q.put(nums[i])\\n for i in range(n):\\n if(q.empty()):\\n return\\n el = q.get()\\n x = nums[(k+i)%n]\\n nums[(k+i)%n] = el\\n q.put(x)\\n \",\n \"runtime\": \"347\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n res = np.roll(nums, k)\\n for i in range(len(nums)):\\n nums[i] = res[i]\",\n \"runtime\": \"361\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n '''arr=[]\\n n=len(nums)\\n for i in range(k+1, n):\\n arr.append(nums[i])\\n for i in range(0, k+1):\\n arr.append(nums[i])\\n print(arr)'''\\n\\n n = len(nums)\\n k = k % n # In case k is greater than the length of the array\\n nums[:] = nums[-k:] + nums[:-k]\\n\\n \\n \",\n \"runtime\": \"361\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k % len(nums)\\n rotated = nums[-k:] + nums[:-k]\\n\\n nums.clear()\\n nums.extend(rotated)\\n\",\n \"runtime\": \"375\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n length = len(nums)\\n \\n if length==1 or k==0:\\n return\\n\\n if length==k:\\n return\\n\\n k = k % length\\n\\n # Always taking the popped then place it at new location will not work if k divides into length perfectly\\n # have to loop over all elements\\n index = k\\n source_num = nums[0]\\n destination_num = nums[index]\\n\\n times = length/k\\n divisible = not (times*10) % 10\\n print(divisible, times)\\n count=1\\n\\n touched_index=set()\\n\\n for i in range(length):\\n print(f'iteration {i}')\\n\\n # if divisible and (i>1) and (i%times == 0) and k!=1:\\n if index in touched_index:\\n print('### perfectly divisible, switch to next index')\\n index = (k+count) % length\\n print(f'new index {count}')\\n source_num = nums[count]\\n print(f'new source_num {source_num}')\\n destination_num = nums[count+k]\\n print(f'new destination_num {destination_num}')\\n count += 1\\n \\n # place source_num to index\\n touched_index.add(index)\\n nums[index] = source_num\\n print(f'placing {source_num} at index {index}')\\n source_num = destination_num \\n print(f'source_num is now {destination_num}')\\n index = (index + k) % length\\n print(f'new index is {index}')\\n destination_num = nums[index]\\n print(f'destination_num is now {nums[index]} from index {index}')\\n\\n\\n\",\n \"runtime\": \"375\"\n },\n {\n \"code\": \"import numpy\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n count = len(nums)\\n k = k % count\\n\\n newNums = numpy.array(nums)\\n\\n for i in range(count):\\n nums[(i + k) % count] = newNums[i]\\n\\n \\n \",\n \"runtime\": \"389\"\n },\n {\n \"code\": \"import queue\\n\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n q = queue.Queue()\\n\\n temp = None\\n for i in range(0, len(nums) + k):\\n if q.qsize() < k + 1:\\n q.put(nums[i % len(nums)])\\n \\n if q.qsize() == k + 1:\\n nums[i % len(nums)] = q.get()\\n\",\n \"runtime\": \"389\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k=k%len(nums)\\n temp=[]\\n for i in range(-1,-k-1,-1):\\n temp.insert(0,nums[i])\\n for i in range(len(nums)-1,0,-1):\\n nums[i]=nums[i-k]\\n for i in range(0,len(temp)):\\n nums[i]=temp[i]\\n\",\n \"runtime\": \"402\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n array_length = len(nums)\\n\\n result_array = []\\n\\n for i in range(k):\\n idx_to_insert = (array_length - 1 - i) % array_length\\n result_array.insert(0, nums[idx_to_insert])\\n\\n result_array.extend(nums[0:array_length - k])\\n\\n for i in range(array_length):\\n nums[i] = result_array[i]\\n\\n return None\",\n \"runtime\": \"416\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n len1 = len(nums)\\n k = k%len1\\n x = nums.copy()\\n a = nums[0:len1-k]\\n b = nums[len1-k:]\\n i = 0\\n while b:\\n nums[i] = b.pop(0)\\n i += 1\\n while a:\\n nums[i] = a.pop(0)\\n i += 1\\n\",\n \"runtime\": \"430\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n\\n size = len(nums)\\n\\n k = k % size\\n \\n \\n temp1 = nums[0:-k]\\n temp2 = nums[-k:size]\\n\\n for i in range(size):\\n if temp2:\\n nums[i] = temp2[0]\\n temp2.pop(0)\\n else:\\n nums[i] = temp1[0]\\n temp1.pop(0)\\n\\n\\n\\n\\n #O(N2) SOLUTION OUT OF TIME\\n \\\"\\\"\\\"\\n for i in range(k):\\n temp = nums[0]\\n for j in range(1, size):\\n temp, nums[j] = nums[j], temp\\n if j == size - 1:\\n nums[0] = temp\\n break\\n \\\"\\\"\\\" \\n\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n \",\n \"runtime\": \"443\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n array_length = len(nums)\\n\\n result_array = []\\n\\n for i in range(k):\\n idx_to_insert = (array_length - 1 - i) % array_length\\n result_array.insert(0, nums[idx_to_insert])\\n\\n result_array.extend(nums[0:array_length - k])\\n\\n for i in range(array_length):\\n nums[i] = result_array[i]\\n\\n return None\",\n \"runtime\": \"457\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n array_length = len(nums)\\n\\n result_array = []\\n\\n for i in range(k):\\n idx_to_insert = (array_length - 1 - i) % array_length\\n result_array.insert(0, nums[idx_to_insert])\\n\\n result_array.extend(nums[0:array_length - k])\\n\\n nums[:] = result_array[:array_length]\\n\\n return None\",\n \"runtime\": \"471\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k %= n # In case k is larger than the length of nums\\n \\n if k == 0 or len(nums) <= 1:\\n return \\n\\n temp = []\\n j = len(nums) - 1\\n i = k\\n while i > 0:\\n temp.insert(0, nums[j])\\n i -= 1\\n j -= 1\\n\\n while j >= 0:\\n nums[j + k] = nums[j]\\n j -= 1\\n\\n while k > 0:\\n nums [k - 1] = temp[k - 1]\\n k -= 1\",\n \"runtime\": \"484\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n # Version 2 - Using Queue\\n queue = []\\n nums_len = len(nums)\\n\\n # bound the number of k\\n if k > nums_len:\\n k = k % nums_len\\n \\n for i in range(nums_len):\\n # start the indices with the items to be moved back\\n idx = (i + k) % nums_len\\n queue.append(nums[idx])\\n # for a set of elements before k, concat to the back\\n if i < k:\\n nums[idx] = nums[i]\\n else:\\n nums[idx] = queue.pop(0)\\n \",\n \"runtime\": \"484\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n trueK = k % len(nums)\\n queue = []\\n i = 0\\n\\n while i < trueK:\\n queue.append(nums[i])\\n nums[i] = nums[-1 * (trueK - i)]\\n i += 1\\n \\n while i < len(nums):\\n queue.append(nums[i])\\n nums[i] = queue.pop(0)\\n i += 1\\n\",\n \"runtime\": \"498\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n trueK = k % len(nums)\\n queue = []\\n i = 0\\n\\n while i < trueK:\\n queue.append(nums[i])\\n nums[i] = nums[-1 * (trueK - i)]\\n i += 1\\n \\n while i < len(nums):\\n queue.append(nums[i])\\n nums[i] = queue.pop(0)\\n i += 1\\n\",\n \"runtime\": \"498\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n buf = []\\n l = len(nums)\\n for i in range(l):\\n if (i < (k % l)):\\n buf.append(nums[(i + k) % l])\\n nums[(i + k) % l] = nums[i]\\n else:\\n buf.append(nums[(i + k) % l])\\n nums[(i + k) % l] = buf[0]\\n buf.pop(0)\\n\\n \",\n \"runtime\": \"512\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n if k > len(nums):\\n k = k % len(nums)\\n\\n tmp_list = nums[0:k:1]\\n for i in range(k, len(nums)):\\n tmp_list.append(nums[i])\\n nums[i] = tmp_list[0]\\n del tmp_list[0]\\n\\n for i in range(len(tmp_list)):\\n nums[i] = tmp_list[i]\\n\\n\",\n \"runtime\": \"512\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n num_len = len(nums)\\n container = []\\n cur_ind = rep_num_count = 0\\n cur_val = nums[0]\\n\\n while num_len < k:\\n k -= num_len\\n\\n if k == 0:\\n return None\\n \\n new_ind = cur_ind + k\\n\\n while rep_num_count < num_len:\\n if new_ind < num_len:\\n container.append(nums[new_ind])\\n nums[new_ind] = cur_val\\n new_ind += 1\\n else:\\n new_ind = 0\\n container.append(nums[new_ind])\\n nums[new_ind] = cur_val\\n new_ind += 1\\n\\n if cur_ind + 1 == k:\\n cur_val = container.pop(0)\\n else:\\n cur_ind += 1\\n cur_val = nums[cur_ind]\\n\\n rep_num_count += 1\",\n \"runtime\": \"525\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = 2000\\n l = len(nums)\\n if l - (k % l) < k % l:\\n if l - (k % l) > n:\\n for i in range((l - (k % l)) // n):\\n orig = nums[:n]\\n nums[:l - n] = nums[n:]\\n nums[-n: ] = orig\\n for j in range((l - (k % l)) % n):\\n orig = nums[0]\\n nums[:l - 1] = nums[1:]\\n nums[-1] = orig\\n else: \\n for i in range(l - (k % l)):\\n orig = nums[0]\\n nums[:l - 1] = nums[1:]\\n nums[-1] = orig\\n else:\\n if k % l > 5:\\n for i in range((k % l) // n):\\n orig = nums[-n:]\\n nums[n:] = nums[:l - n]\\n nums[:n] = orig\\n for j in range((k % l) % n):\\n orig = nums[-1]\\n nums[1:] = nums[:l - 1]\\n nums[0] = orig\\n \\n else:\\n for i in range(k % l):\\n orig = nums[-1]\\n nums[1:] = nums[:l - 1]\\n nums[0] = orig\\n\\n\\n\\n \",\n \"runtime\": \"525\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n\\n # for i in range(k):\\n # y = nums.pop(len(nums) - 1)\\n # nums.insert(0, y)\\n\\n # nums[:] = nums[len(nums)-k:len(nums)] + nums[0:len(nums)-k]\\n\\n queue = deque(nums)\\n for i in range(100):\\n for i in range(100):\\n for i in range(100):\\n x = 1\\n queue.rotate(k)\\n nums[:] = list(queue)\\n\\n\\n \\n\\n \\n # k = k % len(nums) \\n # # Get the number of elements to move from the end to the beginning\\n # r = len(nums) - k\\n # # Store the elements to move\\n # new = nums[0:r]\\n # # Remove the elements from the beginning\\n # nums[0:r] = []\\n # # Append the stored elements to the end\\n # nums.extend(new)\",\n \"runtime\": \"539\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n N = len(nums)\\n replaced_element = []\\n while k > N:\\n k = k - N\\n\\n for i in range(N):\\n replaced_element.append(nums[i])\\n if i < k:\\n nums[i] = nums[(i-k)%N]\\n else:\\n nums[i] = replaced_element.pop(0)\\n\\n # print(replaced_element)\\n \",\n \"runtime\": \"553\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k %= len(nums)\\n start = nums[:len(nums) - k]\\n for i in range(len(nums) - k):\\n nums.pop(0)\\n nums.extend(start)\\n\\n\",\n \"runtime\": \"566\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n if not nums or len(nums) == 0:\\n return\\n \\n k = k % len(nums)\\n \\n pos = len(nums) - k\\n tmp_array = nums[:pos]\\n for i in range(pos):\\n nums.pop(0)\\n \\n nums.extend(tmp_array)\\n\\n\",\n \"runtime\": \"566\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n newNums = []\\n for i in range(len(nums)-k%len(nums)):\\n newNums.append(nums[0])\\n nums.pop(0)\\n nums.extend(newNums)\\n\\n\\n \\n \\n \",\n \"runtime\": \"580\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n gap = k % n\\n if gap == 0:\\n return nums\\n new = nums[0:-gap]\\n for i in range(n - gap):\\n nums.pop(0)\\n nums.extend(new)\\n return \",\n \"runtime\": \"594\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n lnums = len(nums)\\n while k > lnums:\\n k = k - lnums\\n nums_beg = nums[0:lnums - k]\\n for _ in range(lnums - k):\\n nums.remove(nums[0])\\n nums.extend(nums_beg)\\n return nums\\n \",\n \"runtime\": \"608\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n if nums == [1,2] and k==5:\\n nums.pop()\\n nums.pop()\\n nums.append(2)\\n nums.append(1)\\n liste = nums[:len(nums)-k]\\n for i in range(len(liste)):\\n nums.pop(0)\\n for n in liste:\\n nums.append(n)\",\n \"runtime\": \"621\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n k=k%len(nums)\\n x=len(nums)-k\\n b=nums[:x] \\n for i in b:\\n nums.remove(i)\\n nums.extend(b)\\n \",\n \"runtime\": \"621\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n k = k%len(nums)\\n n = len(nums)-k\\n arr2 = nums[:n]\\n for ele in arr2:\\n nums.remove(ele)\\n for ele in arr2:\\n nums.append(ele)\\n\\n \\n \",\n \"runtime\": \"635\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n s=[]\\n q=len(nums)\\n for i in range(len(nums)):\\n c=(i+k)\\n v=c%(q)\\n s.insert(v,nums[i])\\n for j in range(len(s)):\\n nums[j]=s[j]\\n \",\n \"runtime\": \"662\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n n=len(nums)\\n r=[]\\n for i in range(0,n):\\n r.insert((i+k)%n,nums[i])\\n nums.clear()\\n for i in r:\\n nums.append(i)\\n \\n \\n\\n \",\n \"runtime\": \"662\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k % n\\n q = []\\n i, j = 0, n - k\\n while i < n:\\n q.append(nums[i])\\n if j < n:\\n nums[i] = nums[j]\\n else:\\n num = q.pop(0)\\n nums[i] = num\\n j += 1\\n i += 1\\n\\n \",\n \"runtime\": \"676\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n\\n k = k % len(nums)\\n \\n\\n store = nums[-k:]\\n \\n for i in range(k):\\n nums.pop()\\n for i in range(k):\\n nums.insert(i, store[i])\\n return nums\\n \\n \\n\\n \",\n \"runtime\": \"676\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n if(k > len(nums)):\\n k = k % len(nums)\\n arr = []\\n for i in range(len(nums)):\\n if(len(arr) < k):\\n arr.append(nums[i])\\n else:\\n arr.append(nums[i])\\n nums[i] = arr.pop(0)\\n for i in range(len(arr)):\\n nums[i] = arr.pop(0)\\n \\n\\n\\n \",\n \"runtime\": \"690\"\n },\n {\n \"code\": \"class Solution:\\n\\n def rotateByOne(self , nums: List[int]) -> None :\\n newList = [] * len(nums)\\n\\n k=1\\n \\n n = len(nums)\\n j = 0\\n if k>=n :\\n k = int(k%n)\\n \\n for i in range(0,len(nums)) :\\n if (i+k) < n :\\n j = (i+k)\\n newList.insert(j,nums[i])\\n elif (i+k) >= n :\\n j = (i+k) - n\\n newList.insert(j,nums[i])\\n \\n for i in range(0,n) :\\n nums[i] = newList[i]\\n\\n\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n newList = [] * len(nums)\\n \\n n = len(nums)\\n j = 0\\n if k>=n :\\n k = int(k%n)\\n \\n for i in range(0,len(nums)) :\\n if (i+k) < n :\\n j = (i+k)\\n newList.insert(j,nums[i])\\n elif (i+k) >= n :\\n j = (i+k) - n\\n newList.insert(j,nums[i])\\n \\n for i in range(0,n) :\\n nums[i] = newList[i]\\n\\n \\n \",\n \"runtime\": \"690\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n # [1,2,3,4,5,6,7]\\n # [4,5,6,0,1,2,3]\\n # [n-k,n-k-1,n-k-2,0,1,2,3]\\n # [4,5,6,n-k-4, n-k-3, n-k-2, n-k-1]\\n\\n\\n queue = []\\n n = len(nums)\\n if n == k:\\n return\\n if k > n:\\n k = k % n\\n\\n for i in range(n-1, -1, -1):\\n queue.append(nums[i])\\n if n - k - (n - i) >= 0:\\n nums[i] = nums[n - k - (n - i)]\\n else:\\n nums[i] = queue.pop(0)\\n \\n\\n \",\n \"runtime\": \"703\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n move_delta = k % len(nums)\\n\\n result_arr = []\\n\\n for i in range(len(nums)):\\n idx = i + move_delta\\n if (move_delta + i) > len(nums)-1:\\n idx = (move_delta + i) - len(nums)\\n print(idx, nums[i])\\n result_arr.insert(idx, nums[i])\\n\\n for i in range(len(nums)):\\n nums[i] = result_arr[i]\",\n \"runtime\": \"717\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k % len(nums)\\n l = len(nums)\\n k=l-k\\n \\n for i in range(k):\\n tmp = nums.pop(0)\\n nums.append(tmp)\",\n \"runtime\": \"731\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n i = 0\\n lenght = len(nums)\\n k -= (k // lenght) * lenght\\n while k:\\n buff = nums[k-1]\\n nums[k-1] = nums[-1]\\n nums.insert(k + i, buff)\\n nums.pop(-1)\\n k -= 1\\n i += 1 \",\n \"runtime\": \"744\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nMethod 1: Use two rounds of reverses (the order of round 1 and round 2 can be swapped):\\n Round 1: reverse the overall nums, yielding nums_r;\\n Round 2: reverse nums_r[0, n - k] and nums_r[n - k, n] respectively.\\nTime: O(n), where n = len(nums)\\nSpace: O(1)\\n\\n\\nMethod 2: Employ Python functions: \\n element = lst.pop(-1), and, lst.insert(0, element)\\nTime: O(k), where n = len(nums)\\nSpace: O(1)\\n\\n\\nMethod 3: Employ Python functions: \\n element = lst.pop(0), and, lst.append(element)\\nTime: O(n - k), where n = len(nums)\\nSpace: O(1)\\n\\n\\nMethod 4 ( *invalid* ): list slicing\\nTime: O(1)\\nSpace: O(1)\\n\\nNote: \\n1. lst.insert(pos, element), where pos specifies the position index (starting from 0) at which to insert element\\n2. int(9.9) = 9\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n def rotate1(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Method 1. Do not return anything, modify nums in-place instead.\\n Round 1 reverse and round 2 reverse can be swapped.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k % n\\n\\n # round 1\\n self.reverse(nums, 0, n) # reverse nums[0: n]\\n\\n # round 2\\n self.reverse(nums, 0, k) # reverse nums[0: k]\\n self.reverse(nums, k, n) # reverse nums[k: n]\\n \\n def reverse(self, lst: List[int], s: int, e: int) -> None:\\n \\\"\\\"\\\"\\n Given lst[s: e] where the last element is excluded, this method in-place reverses the involving elements.\\n \\\"\\\"\\\"\\n for i in range(int((e - s) / 2)):\\n tmp = lst[s + i]\\n lst[s + i] = lst[e - 1 - i]\\n lst[e - 1 - i] = tmp\\n \\n def rotate2(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Method 2. Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k % n\\n\\n for i in range(k):\\n element = nums.pop(-1)\\n nums.insert(0, element)\\n\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Method 3. Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k % n # k = 0, 1, ..., n - 1 ==> (n - k) = n, n - 1, ..., 1\\n m = (n - k) % n\\n\\n for i in range(m):\\n element = nums.pop(0)\\n nums.append(element)\\n \\n def rotate4(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Method 4 ( *invalid* ). Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k % n\\n nums = nums[n - k: n] + nums[0: n - k]\\n \",\n \"runtime\": \"758\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = mod(k, len(nums))\\n delta = len(nums) - k # effectively, left rotate these many times\\n\\n for i in range(delta):\\n # pop first element\\n # append to nums\\n c = nums[0]\\n nums.pop(0)\\n nums.append(c)\",\n \"runtime\": \"758\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n '''n=len(nums)\\n k=k%n\\n print(nums[-k:])\\n print(nums[:-k])\\n nums[:]=nums[-k:]+nums[:-k]'''\\n k = k%len(nums)\\n a = len(nums) - k\\n for i in range(a):\\n nums.append(nums[0])\\n nums.pop(0)\\n\\n \\n \",\n \"runtime\": \"772\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n l = len(nums)\\n dif = 0\\n \\n if k > l:\\n k = k-l*(k//l)\\n \\n for i in range(l-k):\\n nums.append(nums[i-dif])\\n nums.pop(i-dif)\\n dif += 1\",\n \"runtime\": \"772\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n length=len(nums)\\n\\n rem=k%length\\n for _ in range(length-rem):\\n popped=nums.pop(0)\\n nums.append(popped)\",\n \"runtime\": \"785\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k % len(nums)\\n for _ in range(len(nums)-k):\\n val = nums.pop(0)\\n nums.append(val)\",\n \"runtime\": \"785\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n lenNums = len(nums)\\n if k > lenNums:\\n k = k % lenNums\\n for i in range(0, lenNums-k):\\n nums.append(nums.pop(0))\\n \",\n \"runtime\": \"799\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums, k):\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = len(nums)-k\\n x = k%len(nums)\\n for i in range(x):\\n c = nums.pop(0)\\n nums.append(c)\\n return nums\\n\\na = Solution()\\nprint(a.rotate([1,2,3,4,5,6,7],3))\\n \",\n \"runtime\": \"799\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n k = k%len(nums)\\n for i in range(len(nums)-k):\\n t = nums.pop(0)\\n print(t)\\n nums.append(t)\\n \\n\\n\",\n \"runtime\": \"813\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n len_list = len(nums)\\n k = k % len_list\\n space = (len_list - k) % len_list\\n for _ in range(space):\\n idx = 0\\n num_to_insert = nums.pop(idx)\\n print(num_to_insert)\\n nums.append(num_to_insert)\\n \\n \\n\\n\\n \",\n \"runtime\": \"813\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k % len(nums)\\n rotateArr = nums[len(nums) - k:]\\n for i in range(0, len(rotateArr)):\\n nums.pop(len(nums)-1)\\n nums.insert(i, rotateArr[i])\\n \",\n \"runtime\": \"827\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n numsLen = len(nums)\\n k = k % numsLen\\n nums.extend(nums)\\n print(nums)\\n for i in range(2*numsLen-1, -1, -1):\\n if i < numsLen-k or i > 2*numsLen-k-1:\\n print(i)\\n nums.pop(i)\\n \\n\",\n \"runtime\": \"840\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n=len(nums)\\n curr=0\\n if k>=n:\\n k=k%n\\n arr=[]\\n for i in range(n-k-1):\\n curr+=1\\n for i in range(k):\\n temp=nums.pop(curr+1)\\n arr.append(temp)\\n i=0\\n while i!=len(arr):\\n nums.insert(i,arr[i])\\n i+=1\\n \\n \\n\\n\\n\",\n \"runtime\": \"840\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n is_even = n % 2\\n i = 0\\n x = nums[0:k]\\n\\n while (i < n):\\n p = (i + k) % n\\n x.append(nums[p])\\n nums[p] = x.pop(0)\\n i += 1\\n \",\n \"runtime\": \"854\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n l = len(nums)\\n if k > l:\\n k = k%l\\n \\n if k == l :\\n return nums\\n \\n\\n a = nums[-k:]\\n for i in range(l): \\n a.append(nums[i])\\n nums[i]=a.pop(0)\\n\\n\\n \",\n \"runtime\": \"868\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n if k == 0: return\\n queue = nums[:k]\\n n = len(nums)\\n for i in range(len(nums)):\\n new_val = queue.pop(0)\\n queue.append(nums[(k + i) % n])\\n nums[(k+i) % n ] = new_val\\n return\\n \",\n \"runtime\": \"881\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n if k == 0:\\n return\\n n = len(nums)\\n for i in range(k):\\n queue = []\\n for i in range(n-k%n, n):\\n queue.append(nums[i])\\n for i in range(n):\\n queue.append(nums[i])\\n nums[i] = queue.pop(0)\\n \\n return\",\n \"runtime\": \"895\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n queue = list(nums[:k])\\n for i in range(k,len(nums)+k):\\n i = i % len(nums)\\n queue.append(nums[i])\\n nums[i] = queue.pop(0)\\n\\n \",\n \"runtime\": \"909\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n len_ = len(nums)\\n k %= len_\\n nums.extend(nums[:-k])\\n\\n while len(nums) > len_:\\n nums.pop(0)\\n\",\n \"runtime\": \"909\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n nums.reverse()\\n for i in range(k):\\n nums.append(nums.pop(0))\\n nums.reverse()\\n \",\n \"runtime\": \"922\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n m=(len(nums)-k) % len(nums)\\n if m == 0:\\n return\\n nums.extend(nums[:m])\\n for i in range(m):\\n nums.pop(0)\",\n \"runtime\": \"922\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = k if k<len(nums) else k%len(nums)\\n nums.reverse()\\n for i in nums[:n]:\\n nums.append(i)\\n nums.pop(0)\\n nums.reverse()\",\n \"runtime\": \"936\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k % n \\n nums.extend(nums[:n-k])\\n for i in range(n-k):\\n nums.pop(0)\",\n \"runtime\": \"936\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k %= len(nums)\\n nums.reverse()\\n for i in range(k):\\n elem = nums.pop(0)\\n nums.append(elem)\\n nums.reverse()\",\n \"runtime\": \"950\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n nums.reverse()\\n for i in range(k):\\n elem = nums.pop(0)\\n nums.append(elem)\\n nums.reverse()\",\n \"runtime\": \"950\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n for i in range(k):\\n nums1 = nums[-1:]\\n del nums[-1:] \\n nums[:0] = nums1\\n \\n\\n \",\n \"runtime\": \"963\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: list[int], k: int) -> None:\\n loop = 0\\n\\n if k == 0: return\\n\\n while True:\\n nums[:0] = [nums[len(nums)-1]]\\n nums.pop(-1)\\n loop += 1\\n\\n if loop == k: return\",\n \"runtime\": \"963\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n k = k % len(nums) \\n s = []\\n for i in range(k):\\n s.append(nums.pop())\\n for i in range(len(s)):\\n nums.insert(0, s[i])\\n \",\n \"runtime\": \"977\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k%n\\n a = nums[-k:]\\n del nums[-k:]\\n a.reverse()\\n for i in a:\\n nums.insert(0, i)\\n \\n\\n \\n \",\n \"runtime\": \"977\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n swap_amount = (k % len(nums))\\n to_move = nums[len(nums)-1:len(nums) - 1 - swap_amount:-1]\\n del(nums[len(nums)-1:len(nums) - 1 - swap_amount:-1])\\n for x in to_move:\\n nums.insert(0,x)\\n \\n\\n\\n\\n\\n '''\\n def step(nums:List[int]):\\n last = nums[-1]\\n to_swap = nums[0]\\n to_bank = nums[0]\\n for i in range(0,len(nums)-1):\\n to_swap = to_bank\\n to_bank = nums[i+1]\\n nums[i+1] = to_swap\\n nums[0] = last\\n\\n for i in range(k % len(nums)):\\n print(i)\\n step(nums)\\n '''\\n \\n \\n \",\n \"runtime\": \"991\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n # [1,2,3,4,5] k = 2 res = [4,5,1,2,3]\\n finalK = k % len(nums)\\n backElems = nums[-finalK:]\\n #frontElems = nums[:(len(nums)-k)]\\n del nums[-finalK:]\\n for i in backElems[::-1]:\\n nums.insert(0, i)\",\n \"runtime\": \"991\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k % len(nums)\\n poped = []\\n for _ in range(k):\\n poped.append(nums.pop())\\n for n in poped:\\n nums.insert(0, n)\",\n \"runtime\": \"1004\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n length = len(nums)\\n if k > length:\\n k = k % length\\n temp = []\\n for i in range(k):\\n temp.append(nums.pop())\\n for i in range(k):\\n nums.insert(0, temp[i])\",\n \"runtime\": \"1004\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n if k == 0:\\n return\\n if k < len(nums):\\n rotation_list = nums[-k:]\\n del nums[-k:]\\n for i in range(k):\\n nums.insert(0, rotation_list[-i - 1])\\n else:\\n buff = 0\\n i = 0\\n while i < k:\\n buff = nums.pop(-1)\\n nums.insert(0, buff)\\n i += 1\",\n \"runtime\": \"1018\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n while k > len(nums):\\n k = k - len(nums)\\n\\n\\n else:\\n move = nums[-k:]\\n print(move)\\n del nums[-k:]\\n for i in range(len(move)-1, -1, -1):\\n print(move[i])\\n nums.insert(0, move[i])\",\n \"runtime\": \"1018\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n lenth = len(nums)\\n j = 0\\n if k == lenth:\\n return\\n if k > lenth:\\n k = k % lenth\\n for i in range(lenth-k, lenth):\\n temp = nums.pop(i)\\n nums.insert(j, temp)\\n j += 1\\n\",\n \"runtime\": \"1032\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n\\n while k > len(nums):\\n k = k - len(nums)\\n \\n rotateBy = len(nums)-k\\n pointer =0\\n if len(nums)==1:\\n return nums\\n if k<=len(nums):\\n while rotateBy < len(nums):\\n x= nums[rotateBy]\\n nums.pop(rotateBy)\\n nums.insert(pointer,x)\\n \\n rotateBy+=1\\n pointer+=1\\n\\n return nums\\n else:\\n x = nums.pop(len(nums)-1)\\n nums.insert(0,x)\\n return nums\\n\\n \",\n \"runtime\": \"1032\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n l = len(nums)\\n k = k % l \\n i = 0\\n for i in range(k):\\n nums.insert(i,nums.pop(l-k+i))\\n\",\n \"runtime\": \"1046\"\n },\n {\n \"code\": \"from typing import List\\r\\n\\r\\n\\r\\nclass Solution:\\r\\n def rotate(self, nums: List[int], k: int) -> None:\\r\\n \\\"\\\"\\\"\\r\\n Do not return anything, modify nums in-place instead.\\r\\n \\\"\\\"\\\"\\r\\n step = 0\\r\\n \\r\\n for i in range(len(nums) - k%len(nums), len(nums)):\\r\\n nums.insert(step, nums.pop(i))\\r\\n step += 1\",\n \"runtime\": \"1046\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n l = len(nums)\\n k = k % l \\n i = 0\\n for i in range(k):\\n nums.insert(i,nums.pop(l-k+i))\\n\",\n \"runtime\": \"1059\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n if k > len(nums):\\n k = k % len(nums)\\n\\n\\n k = k * -1\\n i = 0\\n\\n while k < 0:\\n nums.insert(i, nums.pop(k))\\n k += 1\\n i += 1\\n \",\n \"runtime\": \"1059\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n # if k>len(nums):\\n # k=k%len(nums)\\n # for i in range(k):\\n # tmp=nums.pop()\\n # nums.insert(0, tmp)\\n \\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n left=0\\n if k>len(nums):\\n k=k%len(nums)\\n for i in range(len(nums)-k,len(nums)):\\n temp=nums.pop(i)\\n nums.insert(left,temp)\\n left=left+1\\n print(nums)\\n\\n\\n\",\n \"runtime\": \"1073\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n lenth = len(nums)\\n j = 0\\n if k == lenth:\\n return\\n if k > lenth:\\n k = k % lenth\\n for i in range(lenth-k, lenth):\\n temp = nums.pop(i)\\n nums.insert(j, temp)\\n j += 1\\n\",\n \"runtime\": \"1073\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n for num in range(k):\\n pop = nums.pop()\\n nums.insert(0, pop)\\n \",\n \"runtime\": \"1087\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n i=0\\n while(i<k):\\n a=nums.pop()\\n nums.insert(0,a)\\n i+=1\",\n \"runtime\": \"1087\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n for i in range(k%len(nums)):\\n last = nums.pop() \\n nums.insert(0, last)\\n \",\n \"runtime\": \"1100\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n act_k = k % len(nums)\\n for i in range(act_k):\\n last = nums.pop()\\n nums.insert(0,last)\",\n \"runtime\": \"1100\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n for _ in range(k):\\n x = nums.pop()\\n nums.insert(0,x)\\n \\n \",\n \"runtime\": \"1114\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n for i in range(k):\\n num = nums.pop()\\n nums.insert(0,num)\",\n \"runtime\": \"1114\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n \\n\\n for i in range(k):\\n a = nums.pop(-1)\\n nums.insert(0, a)\",\n \"runtime\": \"1128\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":131,"string":"131"},"mm_list":{"kind":"list like","value":[{"code":"def rotate(nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k%len(nums)\n nums[:] = nums[-k:] + nums[:-k]\n\nwith open(\"user.out\", \"w\") as Solution:\n for nums, k in zip(map(loads, stdin), map(int, stdin)):\n rotate(nums, k)\n Solution.write(f\"{nums}\\n\".replace(\" \",\"\"))\nexit()\n# from typing import List\n\n# class Solution:\n# def rotate(nums: List[int], k: int) -> None:\n# k = k%len(nums)\n# nums[:] = nums[-k:] + nums[:-k]\n\n# # def reverse_array(self, arr: List[int], l: int, r: int) -> None:\n# # while l < r:\n# # arr[l], arr[r] = arr[r], arr[l]\n# # l += 1\n# # r -= 1\n \n# # def rotate(self, nums: List[int], k: int) -> None:\n# # \"\"\"\n# # Do not return anything, modify nums in-place instead.\n# # \"\"\"\n# # length = len(nums)\n# # k %= length\n# # # Reverse the first part\n# # self.reverse_array(nums, 0, length - k - 1)\n# # # Reverse the second part\n# # self.reverse_array(nums, length - k, length - 1)\n# # # Reverse the entire array\n# # self.reverse_array(nums, 0, length - 1)\n ","memory":"21700"},{"code":"# class Solution:\ndef rotate( nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k%=len(nums)\n nums[:] = nums[-k:] + nums[:-k]\n\nwith open(\"user.out\", \"w\") as Solution:\n for nums, k in zip(map(loads, stdin), map(int, stdin)):\n rotate(nums, k)\n Solution.write(f\"{nums}\\n\".replace(\" \",\"\"))\nexit()","memory":"21800"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k %= len(nums)\n nums[:] = nums[-k:] + nums[:-k]\n def solve(self):\n f = open('user.out', 'w')\n for nums, k in zip(map(loads, stdin), map(int, stdin)):\n self.rotate(nums, k)\n print(f\"{nums}\".replace(\" \", \"\"), file=f)\nsolution = Solution()\nsolution.solve()\n\nexit()","memory":"21900"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n for i in range(k):\n nums.insert(0, nums.pop(-1))","memory":"25200"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n for _ in range(0,k):\n nums.insert(0,nums[len(nums)-1])\n nums.pop()\n","memory":"25600"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n for i in range(k):\n nums.insert(0,nums.pop())\n\n \n ","memory":"25700"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k % len(nums)\n nums[:] = reversed(nums)\n nums[k:len(nums)] = reversed(nums[k:len(nums)])\n nums[:k] = reversed(nums[:k])\n ","memory":"25800"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n for i in range(k):\n temp = nums.pop()\n nums.insert(0, temp)\n ","memory":"25900"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n while k!=0:\n a=nums.pop()\n nums.insert(0,a)\n k=k-1\n ","memory":"26000"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n effk =k%len(nums)\n for i in range(effk):\n lastelement=nums.pop()\n nums.insert(0,lastelement)\n \n\n ","memory":"26200"},{"code":"\"\"\"\nMethod 1: Use two rounds of reverses (the order of round 1 and round 2 can be swapped):\n Round 1: reverse the overall nums, yielding nums_r;\n Round 2: reverse nums_r[0, n - k] and nums_r[n - k, n] respectively.\nTime: O(n), where n = len(nums)\nSpace: O(1)\n\n\nMethod 2: Employ Python functions: \n element = lst.pop(-1), and, lst.insert(0, element)\nTime: O(k), where n = len(nums)\nSpace: O(1)\n\n\nMethod 3: Employ Python functions: \n element = lst.pop(0), and, lst.append(element)\nTime: O(n - k), where n = len(nums)\nSpace: O(1)\n\n\nMethod 4 ( *invalid* ): list slicing\nTime: O(1)\nSpace: O(1)\n\nNote: \n1. lst.insert(pos, element), where pos specifies the position index (starting from 0) at which to insert element\n2. int(9.9) = 9\n\"\"\"\n\nclass Solution:\n def rotate1(self, nums: List[int], k: int) -> None:\n \"\"\"\n Method 1. Do not return anything, modify nums in-place instead.\n Round 1 reverse and round 2 reverse can be swapped.\n \"\"\"\n n = len(nums)\n k = k % n\n\n # round 1\n self.reverse(nums, 0, n) # reverse nums[0: n]\n\n # round 2\n self.reverse(nums, 0, k) # reverse nums[0: k]\n self.reverse(nums, k, n) # reverse nums[k: n]\n \n def reverse(self, lst: List[int], s: int, e: int) -> None:\n \"\"\"\n Given lst[s: e] where the last element is excluded, this method in-place reverses the involving elements.\n \"\"\"\n for i in range(int((e - s) / 2)):\n tmp = lst[s + i]\n lst[s + i] = lst[e - 1 - i]\n lst[e - 1 - i] = tmp\n \n def rotate2(self, nums: List[int], k: int) -> None:\n \"\"\"\n Method 2. Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = k % n\n\n for i in range(k):\n element = nums.pop(-1)\n nums.insert(0, element)\n\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Method 3. Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = k % n # k = 0, 1, ..., n - 1 ==> (n - k) = n, n - 1, ..., 1\n m = (n - k) % n\n\n for i in range(m):\n element = nums.pop(0)\n nums.append(element)\n \n def rotate4(self, nums: List[int], k: int) -> None:\n \"\"\"\n Method 4 ( *invalid* ). Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = k % n\n nums = nums[n - k: n] + nums[0: n - k]\n ","memory":"26300"},{"code":"# [1,2,3,4,5,6,7], k = 3\n# 1 -> 4\n# 4 -> 7\n# 7 -> 3\n# 3 -> 6\n# 6 -> 2\n# 2 -> 5\n# 5 -> 1\n# 1.\n\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n k = k % len(nums)\n if k == 0:\n return nums\n\n curr_i = start_i = 0\n curr_val = nums[curr_i]\n for i in range(len(nums)):\n next_i = (curr_i + k) % len(nums)\n nums[next_i], curr_val = curr_val, nums[next_i]\n curr_i = next_i\n\n if curr_i == start_i:\n curr_i += 1\n curr_val = nums[curr_i]\n start_i = curr_i\n ","memory":"26400"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n for i in range(k):\n last_element = nums[-1]\n revised_list = nums.pop(-1)\n nums.insert(0,last_element)\n\n \n ","memory":"26500"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \n \"\"\"\n l = len(nums)\n for i in range(k):\n nums.insert(0, nums[-1])\n nums.pop(-1)\n ","memory":"26600"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n Input: nums = [1,2,3,4,5,6,7], k = 3\n Output: [5,6,7,1,2,3,4]\n \"\"\"\n for i in range(k):\n nums.insert(0, nums[-1])\n del nums[-1]","memory":"26700"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k % len(nums) # In case k is greater than the length of nums\n nums[:] = nums[-k:] + nums[:-k]\n return nums","memory":"26800"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k % len(nums)\n while k > 0:\n nums.insert(0,nums[-1])\n del nums[-1]\n k -= 1\n return nums","memory":"26900"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n rk = k % len(nums)\n \n sta = []\n for i in range(len(nums) - 1, len(nums) - rk - 1, -1):\n sta.append(nums[i])\n\n for i in range(len(nums) - rk - 1, -1, -1):\n nums[i + rk] = nums[i]\n print(nums)\n\n for i in range(rk):\n nums[i] = sta.pop()","memory":"27000"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n length = len(nums)\n src = nums[:]\n for i in range(length):\n nums[i] = src[(i - k + length) % length]","memory":"27100"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n k = k % len(nums)\n left = nums[:len(nums)-k]\n right = nums[len(nums)-k:]\n nums[:] = right + left ","memory":"27200"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n temp = []\n n = len(nums)\n k = k % n\n for i in range(len(nums)-1,-1,-1):\n temp.append(nums[i])\n r_temp = []\n for i in range(k-1,-1,-1):\n r_temp.append(temp[i])\n for i in range(len(nums)-1,k-1,-1):\n r_temp.append(temp[i])\n \n nums.clear()\n for i in r_temp:\n nums.append(i)\n return nums\n ","memory":"27300"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n \n n = len(nums)\n \n start = count = 0\n \n while count < n: # while we not moved all elements\n current, prev = start, nums[start]\n while True: # if n%k != 0 - only one time\n next_index = (current + k) % n\n current = next_index\n nums[next_index], prev = prev, nums[next_index]\n count += 1\n \n if start == current:\n break\n \n start += 1 # if n%k == 0 - start from next index","memory":"27400"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n times = k%len(nums)\n nums[:] = nums[-times:] + nums[0:-times]\n\n\n # for i in range(k):\n # print(f\"end: {[nums[len(nums) - 1]]} rest:{nums[:-1]}\")\n # nums = [nums[len(nums) - 1]] + nums[:-1]\n # nums.insert(0, nums.pop())\n ","memory":"27500"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k % len(nums) # To handle cases where k is larger than the length of nums\n nums_temp = [0] * len(nums) # Create a temporary list to hold the rotated values\n\n # Fill nums_temp with rotated elements\n for i in range(len(nums)):\n nums_temp[(i + k) % len(nums)] = nums[i]\n\n # Copy the elements back into nums to modify it in-place\n for i in range(len(nums)):\n nums[i] = nums_temp[i]\n\n ","memory":"27500"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n \n # for i in range(k):\n # prev = nums[-1]\n # for j in range(len(nums)):\n # nums[j], prev = prev, nums[j]\n \n # create a copy of an array, where everything is moved\n\n # position the we will move forward\n\n k = k % len(nums)\n pos_forward = len(nums) - k\n new_nums = [0] * len(nums)\n\n for i in range(0, pos_forward):\n new_nums[i + k] = nums[i]\n \n for i in range(pos_forward, len(nums)):\n new_nums[i - pos_forward] = nums[i]\n\n nums[:] = new_nums\n ","memory":"27600"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n for i in range(len(nums)):\n while k > 0:\n last_item = nums.pop()\n nums.insert(i, last_item)\n k -= 1\n ","memory":"27700"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n=len(nums)\n k=k%n\n nums[:]=nums[-k:]+nums[:-k]\n ","memory":"27700"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n\n # prepending_list = nums[-k:]\n # for n in prepending_list[::-1]:\n # nums.insert(0, n)\n # nums.pop()\n for turn in range(k):\n nums.insert(0, nums.pop())","memory":"27800"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n # solution 1\n rot = k % len(nums)\n n=len(nums)\n cp = nums*2\n nums[:] = cp[n-rot: n-rot+n]\n print(nums)","memory":"27800"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k %= n # In case k > n\n \n def reverse(start, end):\n while start < end:\n nums[start], nums[end] = nums[end], nums[start]\n start += 1\n end -= 1\n \n # Reverse the whole array\n reverse(0, n - 1)\n print(nums)\n \n # Reverse the first k elements\n reverse(0, k - 1)\n print(nums)\n \n # Reverse the remaining n-k elements\n reverse(k, n - 1)\n print(nums)\n ","memory":"27900"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n k = k % len(nums)\n \n split_idx = len(nums) - k\n\n nums[0:k], nums[k:] = nums[split_idx:], nums[0:split_idx]","memory":"27900"},{"code":"class Solution:\n \n def reverse(arr,start,end):\n while start<end:\n arr[start],arr[end] = arr[end],arr[start]\n start += 1\n end-=1\n \n \n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = k % n\n Solution.reverse(nums,0,n-1)\n Solution.reverse(nums,0,k-1)\n Solution.reverse(nums,k,n-1)\n\n\n ","memory":"28000"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n nums2=nums+nums\n for i in range(len(nums)):\n nums[i]=nums2[i+len(nums)-k]\n return ","memory":"28000"},{"code":"import math\n\nclass Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n # Reverse the entire array in place\n # Then reverse the numbers up to k then from k onwards\n k = k % len(nums)\n if k == 0:\n return nums\n\n self.reverse(nums, 0, len(nums) - 1)\n self.reverse(nums, 0, k - 1)\n self.reverse(nums, k, len(nums) - 1)\n\n return nums\n\n def reverse(self, nums: List[int], start, end):\n while start < end:\n nums[start], nums[end] = nums[end], nums[start]\n start += 1\n end -= 1","memory":"28100"},{"code":"class Solution:\n def rotate(self, nums: List[int], k: int) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n k = n - k\n if gcd(k,n) == 1:\n temp = nums[0]\n pos = 0\n strt = pos\n while (pos+k) % n != strt:\n nums[pos] = nums[(pos+k) % n]\n pos = (pos+k) % n\n nums[pos] = temp\n else:\n for i in range(min(gcd(n,k),n)):\n temp = nums[i]\n pos = i\n strt = pos\n while (pos+k) % n != strt:\n nums[pos] = nums[(pos+k) % n]\n pos = (pos+k) % n\n nums[pos] = temp","memory":"28100"}],"string":"[\n {\n \"code\": \"def rotate(nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k%len(nums)\\n nums[:] = nums[-k:] + nums[:-k]\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as Solution:\\n for nums, k in zip(map(loads, stdin), map(int, stdin)):\\n rotate(nums, k)\\n Solution.write(f\\\"{nums}\\\\n\\\".replace(\\\" \\\",\\\"\\\"))\\nexit()\\n# from typing import List\\n\\n# class Solution:\\n# def rotate(nums: List[int], k: int) -> None:\\n# k = k%len(nums)\\n# nums[:] = nums[-k:] + nums[:-k]\\n\\n# # def reverse_array(self, arr: List[int], l: int, r: int) -> None:\\n# # while l < r:\\n# # arr[l], arr[r] = arr[r], arr[l]\\n# # l += 1\\n# # r -= 1\\n \\n# # def rotate(self, nums: List[int], k: int) -> None:\\n# # \\\"\\\"\\\"\\n# # Do not return anything, modify nums in-place instead.\\n# # \\\"\\\"\\\"\\n# # length = len(nums)\\n# # k %= length\\n# # # Reverse the first part\\n# # self.reverse_array(nums, 0, length - k - 1)\\n# # # Reverse the second part\\n# # self.reverse_array(nums, length - k, length - 1)\\n# # # Reverse the entire array\\n# # self.reverse_array(nums, 0, length - 1)\\n \",\n \"memory\": \"21700\"\n },\n {\n \"code\": \"# class Solution:\\ndef rotate( nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k%=len(nums)\\n nums[:] = nums[-k:] + nums[:-k]\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as Solution:\\n for nums, k in zip(map(loads, stdin), map(int, stdin)):\\n rotate(nums, k)\\n Solution.write(f\\\"{nums}\\\\n\\\".replace(\\\" \\\",\\\"\\\"))\\nexit()\",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k %= len(nums)\\n nums[:] = nums[-k:] + nums[:-k]\\n def solve(self):\\n f = open('user.out', 'w')\\n for nums, k in zip(map(loads, stdin), map(int, stdin)):\\n self.rotate(nums, k)\\n print(f\\\"{nums}\\\".replace(\\\" \\\", \\\"\\\"), file=f)\\nsolution = Solution()\\nsolution.solve()\\n\\nexit()\",\n \"memory\": \"21900\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n for i in range(k):\\n nums.insert(0, nums.pop(-1))\",\n \"memory\": \"25200\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n for _ in range(0,k):\\n nums.insert(0,nums[len(nums)-1])\\n nums.pop()\\n\",\n \"memory\": \"25600\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n for i in range(k):\\n nums.insert(0,nums.pop())\\n\\n \\n \",\n \"memory\": \"25700\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k % len(nums)\\n nums[:] = reversed(nums)\\n nums[k:len(nums)] = reversed(nums[k:len(nums)])\\n nums[:k] = reversed(nums[:k])\\n \",\n \"memory\": \"25800\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n for i in range(k):\\n temp = nums.pop()\\n nums.insert(0, temp)\\n \",\n \"memory\": \"25900\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n while k!=0:\\n a=nums.pop()\\n nums.insert(0,a)\\n k=k-1\\n \",\n \"memory\": \"26000\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n effk =k%len(nums)\\n for i in range(effk):\\n lastelement=nums.pop()\\n nums.insert(0,lastelement)\\n \\n\\n \",\n \"memory\": \"26200\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nMethod 1: Use two rounds of reverses (the order of round 1 and round 2 can be swapped):\\n Round 1: reverse the overall nums, yielding nums_r;\\n Round 2: reverse nums_r[0, n - k] and nums_r[n - k, n] respectively.\\nTime: O(n), where n = len(nums)\\nSpace: O(1)\\n\\n\\nMethod 2: Employ Python functions: \\n element = lst.pop(-1), and, lst.insert(0, element)\\nTime: O(k), where n = len(nums)\\nSpace: O(1)\\n\\n\\nMethod 3: Employ Python functions: \\n element = lst.pop(0), and, lst.append(element)\\nTime: O(n - k), where n = len(nums)\\nSpace: O(1)\\n\\n\\nMethod 4 ( *invalid* ): list slicing\\nTime: O(1)\\nSpace: O(1)\\n\\nNote: \\n1. lst.insert(pos, element), where pos specifies the position index (starting from 0) at which to insert element\\n2. int(9.9) = 9\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n def rotate1(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Method 1. Do not return anything, modify nums in-place instead.\\n Round 1 reverse and round 2 reverse can be swapped.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k % n\\n\\n # round 1\\n self.reverse(nums, 0, n) # reverse nums[0: n]\\n\\n # round 2\\n self.reverse(nums, 0, k) # reverse nums[0: k]\\n self.reverse(nums, k, n) # reverse nums[k: n]\\n \\n def reverse(self, lst: List[int], s: int, e: int) -> None:\\n \\\"\\\"\\\"\\n Given lst[s: e] where the last element is excluded, this method in-place reverses the involving elements.\\n \\\"\\\"\\\"\\n for i in range(int((e - s) / 2)):\\n tmp = lst[s + i]\\n lst[s + i] = lst[e - 1 - i]\\n lst[e - 1 - i] = tmp\\n \\n def rotate2(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Method 2. Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k % n\\n\\n for i in range(k):\\n element = nums.pop(-1)\\n nums.insert(0, element)\\n\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Method 3. Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k % n # k = 0, 1, ..., n - 1 ==> (n - k) = n, n - 1, ..., 1\\n m = (n - k) % n\\n\\n for i in range(m):\\n element = nums.pop(0)\\n nums.append(element)\\n \\n def rotate4(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Method 4 ( *invalid* ). Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k % n\\n nums = nums[n - k: n] + nums[0: n - k]\\n \",\n \"memory\": \"26300\"\n },\n {\n \"code\": \"# [1,2,3,4,5,6,7], k = 3\\n# 1 -> 4\\n# 4 -> 7\\n# 7 -> 3\\n# 3 -> 6\\n# 6 -> 2\\n# 2 -> 5\\n# 5 -> 1\\n# 1.\\n\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n k = k % len(nums)\\n if k == 0:\\n return nums\\n\\n curr_i = start_i = 0\\n curr_val = nums[curr_i]\\n for i in range(len(nums)):\\n next_i = (curr_i + k) % len(nums)\\n nums[next_i], curr_val = curr_val, nums[next_i]\\n curr_i = next_i\\n\\n if curr_i == start_i:\\n curr_i += 1\\n curr_val = nums[curr_i]\\n start_i = curr_i\\n \",\n \"memory\": \"26400\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n for i in range(k):\\n last_element = nums[-1]\\n revised_list = nums.pop(-1)\\n nums.insert(0,last_element)\\n\\n \\n \",\n \"memory\": \"26500\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\n \\\"\\\"\\\"\\n l = len(nums)\\n for i in range(k):\\n nums.insert(0, nums[-1])\\n nums.pop(-1)\\n \",\n \"memory\": \"26600\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n Input: nums = [1,2,3,4,5,6,7], k = 3\\n Output: [5,6,7,1,2,3,4]\\n \\\"\\\"\\\"\\n for i in range(k):\\n nums.insert(0, nums[-1])\\n del nums[-1]\",\n \"memory\": \"26700\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k % len(nums) # In case k is greater than the length of nums\\n nums[:] = nums[-k:] + nums[:-k]\\n return nums\",\n \"memory\": \"26800\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k % len(nums)\\n while k > 0:\\n nums.insert(0,nums[-1])\\n del nums[-1]\\n k -= 1\\n return nums\",\n \"memory\": \"26900\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n rk = k % len(nums)\\n \\n sta = []\\n for i in range(len(nums) - 1, len(nums) - rk - 1, -1):\\n sta.append(nums[i])\\n\\n for i in range(len(nums) - rk - 1, -1, -1):\\n nums[i + rk] = nums[i]\\n print(nums)\\n\\n for i in range(rk):\\n nums[i] = sta.pop()\",\n \"memory\": \"27000\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n length = len(nums)\\n src = nums[:]\\n for i in range(length):\\n nums[i] = src[(i - k + length) % length]\",\n \"memory\": \"27100\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n k = k % len(nums)\\n left = nums[:len(nums)-k]\\n right = nums[len(nums)-k:]\\n nums[:] = right + left \",\n \"memory\": \"27200\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n temp = []\\n n = len(nums)\\n k = k % n\\n for i in range(len(nums)-1,-1,-1):\\n temp.append(nums[i])\\n r_temp = []\\n for i in range(k-1,-1,-1):\\n r_temp.append(temp[i])\\n for i in range(len(nums)-1,k-1,-1):\\n r_temp.append(temp[i])\\n \\n nums.clear()\\n for i in r_temp:\\n nums.append(i)\\n return nums\\n \",\n \"memory\": \"27300\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n \\n n = len(nums)\\n \\n start = count = 0\\n \\n while count < n: # while we not moved all elements\\n current, prev = start, nums[start]\\n while True: # if n%k != 0 - only one time\\n next_index = (current + k) % n\\n current = next_index\\n nums[next_index], prev = prev, nums[next_index]\\n count += 1\\n \\n if start == current:\\n break\\n \\n start += 1 # if n%k == 0 - start from next index\",\n \"memory\": \"27400\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n times = k%len(nums)\\n nums[:] = nums[-times:] + nums[0:-times]\\n\\n\\n # for i in range(k):\\n # print(f\\\"end: {[nums[len(nums) - 1]]} rest:{nums[:-1]}\\\")\\n # nums = [nums[len(nums) - 1]] + nums[:-1]\\n # nums.insert(0, nums.pop())\\n \",\n \"memory\": \"27500\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k % len(nums) # To handle cases where k is larger than the length of nums\\n nums_temp = [0] * len(nums) # Create a temporary list to hold the rotated values\\n\\n # Fill nums_temp with rotated elements\\n for i in range(len(nums)):\\n nums_temp[(i + k) % len(nums)] = nums[i]\\n\\n # Copy the elements back into nums to modify it in-place\\n for i in range(len(nums)):\\n nums[i] = nums_temp[i]\\n\\n \",\n \"memory\": \"27500\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n \\n # for i in range(k):\\n # prev = nums[-1]\\n # for j in range(len(nums)):\\n # nums[j], prev = prev, nums[j]\\n \\n # create a copy of an array, where everything is moved\\n\\n # position the we will move forward\\n\\n k = k % len(nums)\\n pos_forward = len(nums) - k\\n new_nums = [0] * len(nums)\\n\\n for i in range(0, pos_forward):\\n new_nums[i + k] = nums[i]\\n \\n for i in range(pos_forward, len(nums)):\\n new_nums[i - pos_forward] = nums[i]\\n\\n nums[:] = new_nums\\n \",\n \"memory\": \"27600\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n for i in range(len(nums)):\\n while k > 0:\\n last_item = nums.pop()\\n nums.insert(i, last_item)\\n k -= 1\\n \",\n \"memory\": \"27700\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n=len(nums)\\n k=k%n\\n nums[:]=nums[-k:]+nums[:-k]\\n \",\n \"memory\": \"27700\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n\\n # prepending_list = nums[-k:]\\n # for n in prepending_list[::-1]:\\n # nums.insert(0, n)\\n # nums.pop()\\n for turn in range(k):\\n nums.insert(0, nums.pop())\",\n \"memory\": \"27800\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n # solution 1\\n rot = k % len(nums)\\n n=len(nums)\\n cp = nums*2\\n nums[:] = cp[n-rot: n-rot+n]\\n print(nums)\",\n \"memory\": \"27800\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k %= n # In case k > n\\n \\n def reverse(start, end):\\n while start < end:\\n nums[start], nums[end] = nums[end], nums[start]\\n start += 1\\n end -= 1\\n \\n # Reverse the whole array\\n reverse(0, n - 1)\\n print(nums)\\n \\n # Reverse the first k elements\\n reverse(0, k - 1)\\n print(nums)\\n \\n # Reverse the remaining n-k elements\\n reverse(k, n - 1)\\n print(nums)\\n \",\n \"memory\": \"27900\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n k = k % len(nums)\\n \\n split_idx = len(nums) - k\\n\\n nums[0:k], nums[k:] = nums[split_idx:], nums[0:split_idx]\",\n \"memory\": \"27900\"\n },\n {\n \"code\": \"class Solution:\\n \\n def reverse(arr,start,end):\\n while start<end:\\n arr[start],arr[end] = arr[end],arr[start]\\n start += 1\\n end-=1\\n \\n \\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = k % n\\n Solution.reverse(nums,0,n-1)\\n Solution.reverse(nums,0,k-1)\\n Solution.reverse(nums,k,n-1)\\n\\n\\n \",\n \"memory\": \"28000\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n nums2=nums+nums\\n for i in range(len(nums)):\\n nums[i]=nums2[i+len(nums)-k]\\n return \",\n \"memory\": \"28000\"\n },\n {\n \"code\": \"import math\\n\\nclass Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n # Reverse the entire array in place\\n # Then reverse the numbers up to k then from k onwards\\n k = k % len(nums)\\n if k == 0:\\n return nums\\n\\n self.reverse(nums, 0, len(nums) - 1)\\n self.reverse(nums, 0, k - 1)\\n self.reverse(nums, k, len(nums) - 1)\\n\\n return nums\\n\\n def reverse(self, nums: List[int], start, end):\\n while start < end:\\n nums[start], nums[end] = nums[end], nums[start]\\n start += 1\\n end -= 1\",\n \"memory\": \"28100\"\n },\n {\n \"code\": \"class Solution:\\n def rotate(self, nums: List[int], k: int) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n k = n - k\\n if gcd(k,n) == 1:\\n temp = nums[0]\\n pos = 0\\n strt = pos\\n while (pos+k) % n != strt:\\n nums[pos] = nums[(pos+k) % n]\\n pos = (pos+k) % n\\n nums[pos] = temp\\n else:\\n for i in range(min(gcd(n,k),n)):\\n temp = nums[i]\\n pos = i\\n strt = pos\\n while (pos+k) % n != strt:\\n nums[pos] = nums[(pos+k) % n]\\n pos = (pos+k) % n\\n nums[pos] = temp\",\n \"memory\": \"28100\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":35,"string":"35"}}},{"rowIdx":176,"cells":{"question_id":{"kind":"number","value":190,"string":"190"},"name":{"kind":"string","value":"reverse-bits"},"content":{"kind":"string","value":"<p>Reverse bits of a given 32 bits unsigned integer.</p>\n\n<p><strong>Note:</strong></p>\n\n<ul>\n\t<li>Note that in some languages, such as Java, there is no unsigned integer type. In this case, both input and output will be given as a signed integer type. They should not affect your implementation, as the integer's internal binary representation is the same, whether it is signed or unsigned.</li>\n\t<li>In Java, the compiler represents the signed integers using <a href=\"https://en.wikipedia.org/wiki/Two%27s_complement\" target=\"_blank\">2's complement notation</a>. Therefore, in <strong class=\"example\">Example 2</strong> above, the input represents the signed integer <code>-3</code> and the output represents the signed integer <code>-1073741825</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 = 00000010100101000001111010011100\n<strong>Output:</strong> 964176192 (00111001011110000010100101000000)\n<strong>Explanation: </strong>The input binary string <strong>00000010100101000001111010011100</strong> represents the unsigned integer 43261596, so return 964176192 which its binary representation is <strong>00111001011110000010100101000000</strong>.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 11111111111111111111111111111101\n<strong>Output:</strong> 3221225471 (10111111111111111111111111111111)\n<strong>Explanation: </strong>The input binary string <strong>11111111111111111111111111111101</strong> represents the unsigned integer 4294967293, so return 3221225471 which its binary representation is <strong>10111111111111111111111111111111</strong>.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li>The input must be a <strong>binary string</strong> of length <code>32</code></li>\n</ul>\n\n<p> </p>\n<p><strong>Follow up:</strong> If this function is called many times, how would you optimize it?</p>\n"},"acRate":{"kind":"number","value":60.21090149860271,"string":"60.210901"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["divide-and-conquer","bit-manipulation"],"string":"[\n \"divide-and-conquer\",\n \"bit-manipulation\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"11\", 0.0094], [\"15\", 0.0094], [\"16\", 0.0189], [\"17\", 0.0094], [\"18\", 0.0189], [\"19\", 0.1511], [\"20\", 0.1228], [\"21\", 0.1417], [\"22\", 0.3306], [\"23\", 0.6045], [\"24\", 0.614], [\"25\", 0.6517], [\"26\", 1.1051], [\"27\", 2.6353], [\"28\", 2.1158], [\"29\", 1.7947], [\"30\", 2.9565], [\"31\", 5.8751], [\"32\", 4.6661], [\"33\", 4.43], [\"34\", 5.2328], [\"35\", 9.0394], [\"36\", 7.2542], [\"37\", 5.9885], [\"38\", 6.3191], [\"39\", 8.2554], [\"40\", 6.9425], [\"41\", 5.3556], [\"42\", 4.1938], [\"43\", 3.9199], [\"44\", 3.1643]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16100\", 0.0283], [\"16200\", 0.1606], [\"16300\", 1.8041], [\"16400\", 16.2274], [\"16500\", 37.0454], [\"16600\", 38.5189]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n if n == 0:\n return 0\n output = 0\n cnt = 31\n while n != 0:\n num = n % 2\n output = output + num * pow(2, cnt)\n n = int (n / 2)\n cnt = cnt - 1\n\n return output\n","runtime":"11"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n b = bin(n)[2:][::-1]\n b = b + (32-len(b)) * \"0\"\n return int(b, 2)","runtime":"15"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n rlt = 0\n for i in range(32):\n rlt = (rlt << 1) | (n & 1)\n n >>= 1\n return rlt","runtime":"16"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n \"\"\"Reverses the bits in the input int.\n\n Approach:\n - right shift n and left shift our result at the same time\n - if a 1 falls of the right side of n push a 1 to result\n - this is supposedly a 32bit integer, so we'll need to pad the right with zeros\n \"\"\"\n result = 0 # 10 -- later we knock out the leading 1\n for _ in range(32):\n result <<= 1\n result |= n & 1\n n >>= 1\n \n return result","runtime":"17"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n res = 0\n for i in range(32):\n res <<= 1\n res += n & 1\n n >>= 1\n return res","runtime":"18"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n return int(bin(n)[2:].zfill(32)[::-1], 2)","runtime":"19"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n bin_n = []\n while n > 0:\n bin_n = [n % 2] + bin_n\n n //= 2\n bin_n = [0] * (32 - len(bin_n)) + bin_n\n\n res = 0\n for i in range(len(bin_n)):\n res += (2**i) * bin_n[i]\n \n return res","runtime":"20"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n return int(bin(n)[2:].zfill(32)[::-1], 2)","runtime":"21"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n res = 0\n for i in range(32):\n bit = (n >> i) & 1\n res = res | (bit<<(31-i))\n return res","runtime":"22"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n result = 0\n for i in range(32):\n bit = n & 1\n result = (result << 1) | bit\n n >>= 1\n return result\n\n ","runtime":"22"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n bns = bin(n)[2:]\n \n if len(bns)<32:\n dif = 32-len(bns)\n aux =\"\"\n for i in range(dif):\n aux+=\"0\"\n bns = aux+bns\n #print(bns)\n return int(bns[::-1],2)","runtime":"23"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n nb=f\"{n:b}\"\n nb=\"0\"*(32-len(nb))+nb\n nb=nb[::-1]\n return int(nb,base=2)","runtime":"24"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n L = ['0']*32\n\n while n > 0:\n x = math.floor(math.log(n,2))\n L[x] = '1'\n n -= 2**x\n\n return int(''.join(L), 2)","runtime":"25"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n result = 0\n for _ in range(32): \n result <<= 1 \n result |= (n & 1) \n n >>= 1 \n return result\n","runtime":"25"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n power = 31\n res = 0\n while n>0:\n res += (n & 1) << power\n n = n>>1\n power -= 1\n return res","runtime":"26"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n b = '{0:032b}'.format(n)\n return int(b[::-1], 2)","runtime":"27"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n # bits = bin(n)[2:]\n # return int(bits[::-1], 2)\n reversebits = 0\n for i in range(32):\n reversebits = (reversebits << 1) | (n & 1)\n n >>= 1\n return reversebits","runtime":"27"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n ans = 0\n for i in range(32):\n ans <<= 1 \n ans += n & 1\n n >>= 1\n return ans\n\n ","runtime":"28"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n ans = 0\n for i in range(32):\n ans<<=1\n\n ans = ans | (n&1)\n n>>=1\n return ans\n","runtime":"28"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n if n==0:\n return 0\n res=0\n for _ in range(32):\n res=res*2+n%2\n n=n//2\n return res","runtime":"29"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n res = 0\n for i in range(32):\n bit= (n>>i) & 1\n res += (bit << (31-i))\n \n return res\n","runtime":"29"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n return int(f'{n:032b}'[::-1], 2)","runtime":"30"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n ns = str(\"{0:b}\".format(n))\n print(\"N:\", n)\n print(\"S: \", ns)\n print(\"R: \", ns[::-1])\n out = int(ns[::-1], 2)\n return out << (32 - len(ns))","runtime":"30"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n # Initialize the reversed number to 0\n reversed_num = 0\n \n # Iterate over all 32 bits of the given number\n for i in range(32):\n # Left shift the reversed number by 1 and add the last bit of the given number to it\n reversed_num = (reversed_num << 1) | (n & 1)\n # To add the last bit of the given number to the reversed number, perform an AND operation with the given number and 1\n n >>= 1\n \n # Return the reversed number\n return reversed_num","runtime":"31"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n ans=0\n for i in range(32):\n ans=ans << 1\n ans=ans | (n&1)\n n=n >> 1\n return ans\n\n ","runtime":"32"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n if n==0:\n return 0\n res=0\n for _ in range(32):\n res=res*2+n%2\n n=n//2\n return res","runtime":"32"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n start=0\n bit_form = bin(n)[2:].zfill(32) \n bit_form = list(bit_form)\n # print(bit_form)\n end = len(bit_form)-1\n while end > start:\n bit_form[start],bit_form[end] = bit_form[end],bit_form[start]\n start+=1\n end-=1\n print(bit_form)\n bit_form = ''.join(bit_form)\n return int(bit_form, 2)\n","runtime":"33"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n res = 0\n for x in range(31, -1, -1):\n lsb = n % 2\n res += lsb << x\n n >>= 1\n\n return res\n ","runtime":"33"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n result = 0\n for i in range(32):\n # 取出n的最後一位，並將其左移到相反的位置\n result = (result << 1) | (n & 1)\n n >>= 1 # 將 n 右移一位\n return result\n","runtime":"34"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n return int(\"{0:032b}\".format(n)[::-1], 2)","runtime":"34"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n result = 0\n for i in range(32):\n # 取出 n 的最低位，並加到 result 中的對應位置\n result = (result << 1) | (n & 1)\n n >>= 1 # 將 n 右移一位，處理下一位\n return result","runtime":"35"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n m = 0\n for i in range(32):\n m |= ((n & (1 << i)) >> i) << (31 - i)\n return m\n","runtime":"35"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n nums=[]\n for i in range(32):\n nums.append(n%2)\n n=n//2\n sum=0\n for i in range(len(nums)-1,-1,-1):\n sum+=int(nums[i])*(2**(31-i))\n return sum","runtime":"36"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n output=0\n for _ in range(0,32):\n output<<=1\n if n & 1:\n output+=1\n n>>=1\n return output\n ","runtime":"36"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n r=0\n for i in range(32):\n r=(r<<1)|(n&1)\n n>>=1\n return r\n\n \n ","runtime":"37"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n ans = 0\n for _ in range(32):\n ans = (ans << 1) | (n & 1)\n n >>= 1\n return ans","runtime":"37"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n res = 0\n for i in range(31, -1, -1):\n if n & 1: res += 1 << i\n n >>= 1\n return res\n ","runtime":"38"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n ret, power = 0, 31\n while n:\n ret += (n & 1) << power\n n = n >> 1\n power -= 1\n return ret","runtime":"38"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n sum=0\n for i in range(32):\n sum+=(n%2)*(2**(31-i))\n n=n//2\n return sum","runtime":"39"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n ans=0\n for i in range(32):\n ans<<=1\n ans+=n&1\n n>>=1\n return ans\n ","runtime":"39"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n s = bin(n)[2:]\n s = '0' * (32 - len(s)) + s\n res = 0\n for i, val in enumerate(s):\n if val == '1': res += 2**i\n return res\n ","runtime":"40"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n a=format(n,'032b')\n b=a[::-1]\n return int(b,2)\n ","runtime":"40"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n result = 0\n for i in range(32): # Iterate through all 32 bits\n result = (result << 1) | (n & 1) # Shift result to the left, add the last bit of n\n n >>= 1 # Shift n to the right\n return result","runtime":"41"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n # using string\n # force 32\n forced = False\n if not n & (1<<31):\n forced = True\n n += (1<<31)\n res = int(bin(n)[2:][::-1], 2)\n if forced:\n res = res ^ 1\n return res","runtime":"41"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n rev = 0\n for i in range(32):\n rev = (rev << 1) | (n & 1)\n n >>= 1\n return rev\n","runtime":"42"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n res = 0\n\n for i in range(32):\n bit = (n>>i) & 1\n res = res | (bit<<(31-i))\n return(res)","runtime":"42"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n binaryString = bin(n)[2:]\n binaryString = binaryString.zfill(32)\n reverse = binaryString[::-1]\n ans = int(reverse,2)\n return ans\n\n\n","runtime":"43"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n output=0\n for _ in range(0,32):\n output<<=1\n if n % 2 == 1:\n output+=1\n n>>=1\n return output\n ","runtime":"43"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n bin_n = bin(n)[2:]\n\n for i in range(32 - len(bin_n)):\n bin_n = '0' + bin_n\n\n return int('0b' + bin_n[::-1],2) \n ","runtime":"44"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n b = bin(n)[2:].zfill(32)\n print(b)\n b = b[::-1]\n print(b)\n return int(f'0b{b}', 2)\n ","runtime":"44"}],"string":"[\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n if n == 0:\\n return 0\\n output = 0\\n cnt = 31\\n while n != 0:\\n num = n % 2\\n output = output + num * pow(2, cnt)\\n n = int (n / 2)\\n cnt = cnt - 1\\n\\n return output\\n\",\n \"runtime\": \"11\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n b = bin(n)[2:][::-1]\\n b = b + (32-len(b)) * \\\"0\\\"\\n return int(b, 2)\",\n \"runtime\": \"15\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n rlt = 0\\n for i in range(32):\\n rlt = (rlt << 1) | (n & 1)\\n n >>= 1\\n return rlt\",\n \"runtime\": \"16\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n \\\"\\\"\\\"Reverses the bits in the input int.\\n\\n Approach:\\n - right shift n and left shift our result at the same time\\n - if a 1 falls of the right side of n push a 1 to result\\n - this is supposedly a 32bit integer, so we'll need to pad the right with zeros\\n \\\"\\\"\\\"\\n result = 0 # 10 -- later we knock out the leading 1\\n for _ in range(32):\\n result <<= 1\\n result |= n & 1\\n n >>= 1\\n \\n return result\",\n \"runtime\": \"17\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n res = 0\\n for i in range(32):\\n res <<= 1\\n res += n & 1\\n n >>= 1\\n return res\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n return int(bin(n)[2:].zfill(32)[::-1], 2)\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n bin_n = []\\n while n > 0:\\n bin_n = [n % 2] + bin_n\\n n //= 2\\n bin_n = [0] * (32 - len(bin_n)) + bin_n\\n\\n res = 0\\n for i in range(len(bin_n)):\\n res += (2**i) * bin_n[i]\\n \\n return res\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n return int(bin(n)[2:].zfill(32)[::-1], 2)\",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n res = 0\\n for i in range(32):\\n bit = (n >> i) & 1\\n res = res | (bit<<(31-i))\\n return res\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n result = 0\\n for i in range(32):\\n bit = n & 1\\n result = (result << 1) | bit\\n n >>= 1\\n return result\\n\\n \",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n bns = bin(n)[2:]\\n \\n if len(bns)<32:\\n dif = 32-len(bns)\\n aux =\\\"\\\"\\n for i in range(dif):\\n aux+=\\\"0\\\"\\n bns = aux+bns\\n #print(bns)\\n return int(bns[::-1],2)\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n nb=f\\\"{n:b}\\\"\\n nb=\\\"0\\\"*(32-len(nb))+nb\\n nb=nb[::-1]\\n return int(nb,base=2)\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n L = ['0']*32\\n\\n while n > 0:\\n x = math.floor(math.log(n,2))\\n L[x] = '1'\\n n -= 2**x\\n\\n return int(''.join(L), 2)\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n result = 0\\n for _ in range(32): \\n result <<= 1 \\n result |= (n & 1) \\n n >>= 1 \\n return result\\n\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n power = 31\\n res = 0\\n while n>0:\\n res += (n & 1) << power\\n n = n>>1\\n power -= 1\\n return res\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n b = '{0:032b}'.format(n)\\n return int(b[::-1], 2)\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n # bits = bin(n)[2:]\\n # return int(bits[::-1], 2)\\n reversebits = 0\\n for i in range(32):\\n reversebits = (reversebits << 1) | (n & 1)\\n n >>= 1\\n return reversebits\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n ans = 0\\n for i in range(32):\\n ans <<= 1 \\n ans += n & 1\\n n >>= 1\\n return ans\\n\\n \",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n ans = 0\\n for i in range(32):\\n ans<<=1\\n\\n ans = ans | (n&1)\\n n>>=1\\n return ans\\n\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n if n==0:\\n return 0\\n res=0\\n for _ in range(32):\\n res=res*2+n%2\\n n=n//2\\n return res\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n res = 0\\n for i in range(32):\\n bit= (n>>i) & 1\\n res += (bit << (31-i))\\n \\n return res\\n\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n return int(f'{n:032b}'[::-1], 2)\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n ns = str(\\\"{0:b}\\\".format(n))\\n print(\\\"N:\\\", n)\\n print(\\\"S: \\\", ns)\\n print(\\\"R: \\\", ns[::-1])\\n out = int(ns[::-1], 2)\\n return out << (32 - len(ns))\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n # Initialize the reversed number to 0\\n reversed_num = 0\\n \\n # Iterate over all 32 bits of the given number\\n for i in range(32):\\n # Left shift the reversed number by 1 and add the last bit of the given number to it\\n reversed_num = (reversed_num << 1) | (n & 1)\\n # To add the last bit of the given number to the reversed number, perform an AND operation with the given number and 1\\n n >>= 1\\n \\n # Return the reversed number\\n return reversed_num\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n ans=0\\n for i in range(32):\\n ans=ans << 1\\n ans=ans | (n&1)\\n n=n >> 1\\n return ans\\n\\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n if n==0:\\n return 0\\n res=0\\n for _ in range(32):\\n res=res*2+n%2\\n n=n//2\\n return res\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n start=0\\n bit_form = bin(n)[2:].zfill(32) \\n bit_form = list(bit_form)\\n # print(bit_form)\\n end = len(bit_form)-1\\n while end > start:\\n bit_form[start],bit_form[end] = bit_form[end],bit_form[start]\\n start+=1\\n end-=1\\n print(bit_form)\\n bit_form = ''.join(bit_form)\\n return int(bit_form, 2)\\n\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n res = 0\\n for x in range(31, -1, -1):\\n lsb = n % 2\\n res += lsb << x\\n n >>= 1\\n\\n return res\\n \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n result = 0\\n for i in range(32):\\n # 取出n的最後一位，並將其左移到相反的位置\\n result = (result << 1) | (n & 1)\\n n >>= 1 # 將 n 右移一位\\n return result\\n\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n return int(\\\"{0:032b}\\\".format(n)[::-1], 2)\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n result = 0\\n for i in range(32):\\n # 取出 n 的最低位，並加到 result 中的對應位置\\n result = (result << 1) | (n & 1)\\n n >>= 1 # 將 n 右移一位，處理下一位\\n return result\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n m = 0\\n for i in range(32):\\n m |= ((n & (1 << i)) >> i) << (31 - i)\\n return m\\n\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n nums=[]\\n for i in range(32):\\n nums.append(n%2)\\n n=n//2\\n sum=0\\n for i in range(len(nums)-1,-1,-1):\\n sum+=int(nums[i])*(2**(31-i))\\n return sum\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n output=0\\n for _ in range(0,32):\\n output<<=1\\n if n & 1:\\n output+=1\\n n>>=1\\n return output\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n r=0\\n for i in range(32):\\n r=(r<<1)|(n&1)\\n n>>=1\\n return r\\n\\n \\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n ans = 0\\n for _ in range(32):\\n ans = (ans << 1) | (n & 1)\\n n >>= 1\\n return ans\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n res = 0\\n for i in range(31, -1, -1):\\n if n & 1: res += 1 << i\\n n >>= 1\\n return res\\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n ret, power = 0, 31\\n while n:\\n ret += (n & 1) << power\\n n = n >> 1\\n power -= 1\\n return ret\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n sum=0\\n for i in range(32):\\n sum+=(n%2)*(2**(31-i))\\n n=n//2\\n return sum\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n ans=0\\n for i in range(32):\\n ans<<=1\\n ans+=n&1\\n n>>=1\\n return ans\\n \",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n s = bin(n)[2:]\\n s = '0' * (32 - len(s)) + s\\n res = 0\\n for i, val in enumerate(s):\\n if val == '1': res += 2**i\\n return res\\n \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n a=format(n,'032b')\\n b=a[::-1]\\n return int(b,2)\\n \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n result = 0\\n for i in range(32): # Iterate through all 32 bits\\n result = (result << 1) | (n & 1) # Shift result to the left, add the last bit of n\\n n >>= 1 # Shift n to the right\\n return result\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n # using string\\n # force 32\\n forced = False\\n if not n & (1<<31):\\n forced = True\\n n += (1<<31)\\n res = int(bin(n)[2:][::-1], 2)\\n if forced:\\n res = res ^ 1\\n return res\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n rev = 0\\n for i in range(32):\\n rev = (rev << 1) | (n & 1)\\n n >>= 1\\n return rev\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n res = 0\\n\\n for i in range(32):\\n bit = (n>>i) & 1\\n res = res | (bit<<(31-i))\\n return(res)\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n binaryString = bin(n)[2:]\\n binaryString = binaryString.zfill(32)\\n reverse = binaryString[::-1]\\n ans = int(reverse,2)\\n return ans\\n\\n\\n\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n output=0\\n for _ in range(0,32):\\n output<<=1\\n if n % 2 == 1:\\n output+=1\\n n>>=1\\n return output\\n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n bin_n = bin(n)[2:]\\n\\n for i in range(32 - len(bin_n)):\\n bin_n = '0' + bin_n\\n\\n return int('0b' + bin_n[::-1],2) \\n \",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n b = bin(n)[2:].zfill(32)\\n print(b)\\n b = b[::-1]\\n print(b)\\n return int(f'0b{b}', 2)\\n \",\n \"runtime\": \"44\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":50,"string":"50"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n \n res, power = 0, 31\n while n :\n res += (n&1)<<power\n n = n >> 1\n power -=1\n \n return res","memory":"16100"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n ret, power = 0, 31\n while n:\n ret += (n & 1) << power\n n = n >> 1\n power -= 1\n return ret\n ","memory":"16200"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n res = 0\n for i in range(32):\n bit= (n>>i) & 1\n res += (bit << (31-i))\n \n return res\n","memory":"16300"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n result = 0\n for i in range(31, -1, -1):\n result += (n % 2) * 2**i\n n = n // 2\n return result\n","memory":"16300"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n nums=[]\n for i in range(32):\n nums.append(n%2)\n n=n//2\n sum=0\n for i in range(len(nums)-1,-1,-1):\n sum+=int(nums[i])*(2**(31-i))\n return sum","memory":"16400"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n binaryString = bin(n)[2:]\n binaryString = binaryString.zfill(32)\n reverse = binaryString[::-1]\n ans = int(reverse,2)\n return ans\n\n\n","memory":"16400"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n res=0\n for _ in range(32):\n res<<=1\n n,m=divmod(n,2)\n res+=m\n return res\n\n ","memory":"16500"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n bin_n = bin(n)[2:]\n reversed_n_str = bin_n[::-1]\n for _ in range(32 - len(reversed_n_str)):\n reversed_n_str = reversed_n_str + '0'\n reversed_n_number = int(reversed_n_str, 2)\n return reversed_n_number","memory":"16500"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n res = 0\n i = 31\n while n:\n if n % 2:\n res = res + 2**i\n n = n // 2\n i-=1\n return res","memory":"16600"},{"code":"class Solution:\n def reverseBits(self, n: int) -> int:\n result = 0\n for i in range(32):\n # Extract the least significant bit of n and add it to the result\n result = (result << 1) | (n & 1)\n # Right shift n to process the next bit\n n >>= 1\n return result\n","memory":"16600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n \\n res, power = 0, 31\\n while n :\\n res += (n&1)<<power\\n n = n >> 1\\n power -=1\\n \\n return res\",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n ret, power = 0, 31\\n while n:\\n ret += (n & 1) << power\\n n = n >> 1\\n power -= 1\\n return ret\\n \",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n res = 0\\n for i in range(32):\\n bit= (n>>i) & 1\\n res += (bit << (31-i))\\n \\n return res\\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n result = 0\\n for i in range(31, -1, -1):\\n result += (n % 2) * 2**i\\n n = n // 2\\n return result\\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n nums=[]\\n for i in range(32):\\n nums.append(n%2)\\n n=n//2\\n sum=0\\n for i in range(len(nums)-1,-1,-1):\\n sum+=int(nums[i])*(2**(31-i))\\n return sum\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n binaryString = bin(n)[2:]\\n binaryString = binaryString.zfill(32)\\n reverse = binaryString[::-1]\\n ans = int(reverse,2)\\n return ans\\n\\n\\n\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n res=0\\n for _ in range(32):\\n res<<=1\\n n,m=divmod(n,2)\\n res+=m\\n return res\\n\\n \",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n bin_n = bin(n)[2:]\\n reversed_n_str = bin_n[::-1]\\n for _ in range(32 - len(reversed_n_str)):\\n reversed_n_str = reversed_n_str + '0'\\n reversed_n_number = int(reversed_n_str, 2)\\n return reversed_n_number\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n res = 0\\n i = 31\\n while n:\\n if n % 2:\\n res = res + 2**i\\n n = n // 2\\n i-=1\\n return res\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def reverseBits(self, n: int) -> int:\\n result = 0\\n for i in range(32):\\n # Extract the least significant bit of n and add it to the result\\n result = (result << 1) | (n & 1)\\n # Right shift n to process the next bit\\n n >>= 1\\n return result\\n\",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":10,"string":"10"}}},{"rowIdx":177,"cells":{"question_id":{"kind":"number","value":11,"string":"11"},"name":{"kind":"string","value":"container-with-most-water"},"content":{"kind":"string","value":"<p>You are given an integer array <code>height</code> of length <code>n</code>. There are <code>n</code> vertical lines drawn such that the two endpoints of the <code>i<sup>th</sup></code> line are <code>(i, 0)</code> and <code>(i, height[i])</code>.</p>\n\n<p>Find two lines that together with the x-axis form a container, such that the container contains the most water.</p>\n\n<p>Return <em>the maximum amount of water a container can store</em>.</p>\n\n<p><strong>Notice</strong> that you may not slant the container.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/17/question_11.jpg\" style=\"width: 600px; height: 287px;\" />\n<pre>\n<strong>Input:</strong> height = [1,8,6,2,5,4,8,3,7]\n<strong>Output:</strong> 49\n<strong>Explanation:</strong> The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> height = [1,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>n == height.length</code></li>\n\t<li><code>2 <= n <= 10<sup>5</sup></code></li>\n\t<li><code>0 <= height[i] <= 10<sup>4</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":56.15612651065823,"string":"56.156127"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","two-pointers","greedy"],"string":"[\n \"array\",\n \"two-pointers\",\n \"greedy\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"43\", 0.0038], [\"49\", 0.0038], [\"56\", 0.028], [\"62\", 0.0374], [\"69\", 0.041], [\"75\", 0.0131], [\"82\", 0.0056], [\"89\", 0.0019], [\"95\", 0.0075], [\"102\", 0.0019], [\"108\", 0.0019], [\"115\", 0.0037], [\"121\", 0.0094], [\"128\", 0.0076], [\"134\", 0.014900000000000002], [\"141\", 0.0094], [\"147\", 0.024300000000000002], [\"154\", 0.0299], [\"160\", 0.042800000000000005], [\"167\", 0.022400000000000003], [\"174\", 0.0094], [\"180\", 0.0019], [\"187\", 0.0019], [\"193\", 0.0019], [\"200\", 0.0019], [\"206\", 0.0019], [\"213\", 0.0019], [\"219\", 0.0019], [\"226\", 0.0019], [\"232\", 0.0037], [\"239\", 0.0019], [\"245\", 0.0019], [\"252\", 0.0037], [\"259\", 0.0075], [\"265\", 0.0056], [\"272\", 0.0093], [\"278\", 0.0093], [\"285\", 0.0037], [\"291\", 0.0075], [\"298\", 0.0149], [\"304\", 0.0168], [\"311\", 0.0317], [\"317\", 0.0261], [\"324\", 0.0335], [\"330\", 0.0298], [\"337\", 0.0429], [\"343\", 0.0168], [\"350\", 0.0373], [\"357\", 0.028], [\"363\", 0.0354], [\"370\", 0.0485], [\"376\", 0.0559], [\"383\", 0.054], [\"389\", 0.0447], [\"396\", 0.054], [\"402\", 0.0652], [\"409\", 0.0485], [\"415\", 0.0708], [\"422\", 0.0559], [\"428\", 0.069], [\"435\", 0.0596], [\"442\", 0.1268], [\"448\", 0.46409999999999996], [\"455\", 0.6392], [\"461\", 0.6784], [\"468\", 0.7417], [\"474\", 1.0697], [\"481\", 1.5227], [\"487\", 3.1496999999999997], [\"494\", 3.6717000000000004], [\"500\", 4.593999999999999], [\"507\", 4.8512], [\"513\", 10.2879], [\"520\", 14.0245], [\"527\", 19.5505], [\"533\", 12.8746], [\"540\", 8.8192], [\"546\", 3.7201], [\"553\", 1.9774999999999998], [\"559\", 0.8835]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"20900\", 0.0056], [\"21100\", 0.0037], [\"24400\", 0.0112], [\"24500\", 0.0149], [\"24600\", 0.0019], [\"24700\", 0.0466], [\"24800\", 0.1659], [\"24900\", 0.0224], [\"25000\", 0.0037], [\"25300\", 0.0019], [\"25500\", 0.0093], [\"25600\", 0.0354], [\"25700\", 0.0037], [\"25800\", 0.0037], [\"25900\", 0.0056], [\"26000\", 0.0019], [\"26100\", 0.0019], [\"26200\", 0.0037], [\"26300\", 0.0019], [\"26500\", 0.0019], [\"26600\", 0.0037], [\"26700\", 0.0037], [\"26900\", 0.0037], [\"27000\", 0.0056], [\"27100\", 0.0075], [\"27200\", 0.0019], [\"27300\", 0.0019], [\"27400\", 0.0056], [\"27500\", 0.0037], [\"27700\", 0.0019], [\"27800\", 0.013], [\"27900\", 0.0019], [\"28000\", 0.0168], [\"28100\", 0.013], [\"28200\", 0.0112], [\"28300\", 0.0317], [\"28400\", 0.0317], [\"28500\", 0.0578], [\"28600\", 0.0522], [\"28700\", 0.0913], [\"28800\", 0.1174], [\"28900\", 0.6728], [\"29000\", 6.9163], [\"29100\", 8.411], [\"29200\", 1.914], [\"29300\", 3.7014], [\"29400\", 12.459], [\"29500\", 21.6285], [\"29600\", 4.5605], [\"29700\", 2.5868], [\"29800\", 11.9185]]}"},"rt_list":{"kind":"list like","value":[{"code":"def maxArea(height: List[int]) -> int:\n maxH, maxA, left, right = max(height), 0, 0, len(height) - 1\n while left < right:\n #currArea = \n #maxA = max(min(height[left], height[right]) * (right - left), maxA)\n if height[left] < height[right]:\n if height[left] * (right - left) > maxA:\n maxA = height[left] * (right - left)\n else:\n if height[right] * (right - left) > maxA:\n maxA = height[right] * (right - left)\n \n if maxH * (right - left) <= maxA:\n break\n\n if height[left] < height[right]:\n left = left + 1\n else: #if height[left] > height[right]:\n right = right - 1\n # else:\n # left = left + 1\n # right = right -1\n return maxA\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"43"},{"code":"def maxArea(height: List[int]) -> int:\n maxH, maxA, left, right = max(height), 0, 0, len(height) - 1\n while left < right:\n #currArea = \n #maxA = max(min(height[left], height[right]) * (right - left), maxA)\n if height[left] < height[right]:\n if height[left] * (right - left) > maxA:\n maxA = height[left] * (right - left)\n else:\n if height[right] * (right - left) > maxA:\n maxA = height[right] * (right - left)\n \n if maxH * (right - left) <= maxA:\n break\n\n if height[left] < height[right]:\n left = left + 1\n else: #if height[left] > height[right]:\n right = right - 1\n # else:\n # left = left + 1\n # right = right -1\n return maxA\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"43"},{"code":"\ndef maxArea(height: List[int]) -> int:\n max_h, max_a, p1, p2 = max(height), 0, 0, len(height) - 1\n\n for width in range(p2, -1, -1):\n if height[p1] > height[p2]:\n a = width * height[p2]\n if a > max_a:\n max_a = a\n p2 -= 1\n else:\n a = width * height[p1]\n if a > max_a:\n max_a = a\n p1 += 1\n\n if max_h * width <= max_a:\n break\n\n return max_a\n\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)\n","runtime":"49"},{"code":"\ndef maxArea(height: List[int]) -> int:\n max_h, max_a, p1, p2 = max(height), 0, 0, len(height) - 1\n\n for width in range(p2, -1, -1):\n if height[p1] > height[p2]:\n a = width * height[p2]\n if a > max_a:\n max_a = a\n p2 -= 1\n else:\n a = width * height[p1]\n if a > max_a:\n max_a = a\n p1 += 1\n\n if max_h * width <= max_a:\n break\n\n return max_a\n\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)\n","runtime":"49"},{"code":"class Solution: \n def maxArea(height: List[int]) -> int:\n global_max = 0\n left = 0\n right = len(height)-1\n max_h = max(height)\n\n while left < right:\n area = min(height[left], height[right]) * (right-left)\n global_max = max(global_max, area)\n\n if max_h * (right - left) <= global_max:\n break\n\n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n\n return global_max\n\n f = open('user.out', 'w')\n for case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\n f.flush()\n exit(0)\n ","runtime":"56"},{"code":"\ndef maxArea(height: List[int]) -> int:\n max_h, max_a, p1, p2 = max(height), 0, 0, len(height) - 1\n\n for width in range(p2, -1, -1):\n if height[p1] > height[p2]:\n a = width * height[p2]\n if a > max_a:\n max_a = a\n p2 -= 1\n else:\n a = width * height[p1]\n if a > max_a:\n max_a = a\n p1 += 1\n\n if max_h * width <= max_a:\n break\n\n return max_a\n\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"56"},{"code":"\ndef maxArea(height: List[int]) -> int:\n # starting max\n m = 0\n # two pointers\n i = 0\n j = len(height)-1\n # max height\n mh = max(height)\n while i < j:\n # set the area to the min height * the distance between the two col\n area = min(height[i], height[j]) * (j-i)\n\n # update max if necessary\n m = max(m, area)\n\n\n if mh * (j - i) <= m:\n break\n\n if height[i] < height[j]:\n i += 1\n else:\n j -= 1\n\n return m\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"62"},{"code":"def maxArea(height: List[int]) -> int:\n maxH, maxA, left, right = max(height), 0, 0, len(height) - 1\n while left < right:\n #currArea = \n #maxA = max(min(height[left], height[right]) * (right - left), maxA)\n if height[left] < height[right]:\n if height[left] * (right - left) > maxA:\n maxA = height[left] * (right - left)\n else:\n if height[right] * (right - left) > maxA:\n maxA = height[right] * (right - left)\n \n if maxH * (right - left) <= maxA:\n break\n\n if height[left] < height[right]:\n left = left + 1\n else: #if height[left] > height[right]:\n right = right - 1\n # else:\n # left = left + 1\n # right = right -1\n return maxA\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"62"},{"code":"def maxArea(height: List[int]) -> int:\n maxH, maxA, left, right = max(height), 0, 0, len(height) - 1\n while left < right:\n #currArea = \n #maxA = max(min(height[left], height[right]) * (right - left), maxA)\n if height[left] < height[right]:\n if height[left] * (right - left) > maxA:\n maxA = height[left] * (right - left)\n else:\n if height[right] * (right - left) > maxA:\n maxA = height[right] * (right - left)\n \n if maxH * (right - left) <= maxA:\n break\n\n if height[left] < height[right]:\n left = left + 1\n else: #if height[left] > height[right]:\n right = right - 1\n # else:\n # left = left + 1\n # right = right -1\n return maxA\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"69"},{"code":"class Solution: \n def maxArea(height: List[int]) -> int:\n global_max = 0\n left = 0\n right = len(height)-1\n max_h = max(height)\n\n while left < right:\n area = min(height[left], height[right]) * (right-left)\n global_max = max(global_max, area)\n\n if max_h * (right - left) <= global_max:\n break\n\n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n\n return global_max\n\n f = open('user.out', 'w')\n for case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\n f.flush()\n exit(0)","runtime":"69"},{"code":"#class Solution:\n#def maxArea(self, height: List[int]) -> int:\n\"\"\"l = 0\nr = len(height) - 1\nm = 0\nwhile l < r:\nc = min(height[l], height[r]) * (r - l)\nm = max(m, c)\nif height[l] < height[r]:\nl += 1\nelse:\nr -= 1\nreturn m\"\"\"\ndef maxArea(height: List[int]) -> int:\n # starting max\n m = 0\n # two pointers\n i = 0\n j = len(height)-1\n # max height\n mh = max(height)\n while i < j:\n # set the area to the min height * the distance between the two col\n area = min(height[i], height[j]) * (j-i)\n\n # update max if necessary\n m = max(m, area)\n\n\n if mh * (j - i) <= m:\n break\n\n if height[i] < height[j]:\n i += 1\n else:\n j -= 1\n return m\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n print(maxArea(case))\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"75"},{"code":"def maxArea(height: List[int]) -> int:\n lh = len(height)\n i, j, max_a, mh = 0, lh - 1, [], max(height)\n\n while i < j:\n if height[i] > height[j]:\n max_a.append((j - i) * height[j])\n if mh * (j - i) <= max_a[-1]:\n break\n\n j -= 1\n else:\n max_a.append((j - i) * height[i])\n if mh * (j - i) <= max_a[-1]:\n break\n i += 1\n\n return max(max_a)\n\n\nf = open(\"user.out\", \"w\")\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)\n","runtime":"75"},{"code":"def maxArea(height: List[int]) -> int:\n lh = len(height)\n i, j, max_a, mh = 0, lh - 1, [], max(height)\n\n while i < j:\n if height[i] > height[j]:\n max_a.append((j - i) * height[j])\n if mh * (j - i) <= max_a[-1]:\n break\n\n j -= 1\n else:\n max_a.append((j - i) * height[i])\n if mh * (j - i) <= max_a[-1]:\n break\n i += 1\n\n return max(max_a)\n\n\nf = open(\"user.out\", \"w\")\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)\n","runtime":"82"},{"code":"def maxArea(height: List[int]) -> int:\n ans = 0\n\n l = 0\n r = len(height) - 1\n\n while l < r:\n m = height[l] if height[l] < height[r] else height[r]\n area = (r - l) * m\n ans = area if area > ans else ans\n \n # adjust based on the smaller\n if height[l] < height[r]:\n l += 1\n else:\n r -= 1\n \n return ans\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)\n\n# class Solution:\n# def maxArea(self, height: List[int]) -> int:\n# left = 0\n# right = len(height) - 1\n# maxArea = 0\n\n# while left < right:\n# currentArea = min(height[left], height[right]) * (right - left)\n# maxArea = max(maxArea, currentArea)\n\n# if height[left] < height[right]:\n# left += 1\n# else:\n# right -= 1\n# return maxArea\n","runtime":"82"},{"code":"def maxArea(height: List[int]) -> int:\n # starting max\n m = 0\n # two pointers\n i = 0\n j = len(height)-1\n # max height\n #mh = max(height)\n while i < j:\n # set the area to the min height * the distance between the two col\n smallest = height[i] if height[i] < height[j] else height[j]\n area = smallest * (j-i)\n\n # update max if necessary\n m = area if area > m else m\n\n\n #if mh * (j - i) <= m:\n # break\n\n if height[i] < height[j]:\n i += 1\n else:\n j -= 1\n\n return m\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"89"},{"code":"\ndef maxArea(height: List[int]) -> int:\n max_h, max_a, p1, p2 = max(height), 0, 0, len(height) - 1\n\n for width in range(p2, -1, -1):\n if height[p1] > height[p2]:\n a = width * height[p2]\n if a > max_a:\n max_a = a\n p2 -= 1\n else:\n a = width * height[p1]\n if a > max_a:\n max_a = a\n p1 += 1\n\n return max_a\n\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)\n","runtime":"95"},{"code":"\ndef maxArea( height: List[int]) -> int:\n lh = len(height)\n i, j, max_a = 0, lh - 1, []\n\n while i < j:\n if height[i] > height[j]:\n max_a.append((j - i) * height[j])\n j -= 1\n else:\n max_a.append((j - i) * height[i])\n i += 1\n\n return max(max_a)\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"95"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n answer = 0\n n = len(height)\n left, right = 0, len(height)-1\n while left < right:\n if height[left] > height[right]:\n answer = max(answer, (right-left) * height[right])\n right -= 1\n else:\n answer = max(answer, (right-left) * height[left])\n left += 1\n return answer\n\nf = open('user.out', 'w')\ns = Solution()\nfor case in map(loads, stdin):\n f.write(f\"{s.maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"102"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n right_i = 0\n left_i = len(height) - 1\n capacity = max(0, (min(height[right_i], height[left_i])) * (left_i-right_i))\n while right_i < left_i:\n if height[right_i] > height[left_i]:\n left_i -= 1\n else:\n right_i += 1\n area = min(height[right_i], height[left_i]) * (left_i-right_i)\n if area > capacity:\n capacity = area\n\n return capacity\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for num in inputs:\n print(str(Solution().maxArea(num)).replace(\" \", \"\"), file=f)\nexit(0)","runtime":"108"},{"code":"def maxArea(height: List[int]) -> int:\n max_area = 0\n start = 0\n end = len(height) - 1\n while start != end:\n h = min(height[start], height[end])\n area = h * (end - start)\n # print(area)\n if area > max_area:\n max_area = area\n if height[start] > height[end]:\n end -= 1\n else:\n start += 1\n return max_area\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"115"},{"code":"\ndef maxArea( height: List[int]) -> int:\n lh = len(height)\n i, j, max_a = 0, lh - 1, 0\n\n while i < j:\n if height[i] > height[j]:\n max_a=max(((j - i) * height[j]),max_a)\n j -= 1\n else:\n max_a=max(((j - i) * height[i]),max_a)\n i += 1\n\n return max_a\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"121"},{"code":"def maxArea(height: List[int]) -> int:\n n = len(height) - 1\n start, end, ans = 0, n, 0\n for i in range(n, 0, -1):\n if height[start] < height[end]:\n ans = max(ans, height[start]*i)\n start += 1\n else:\n ans = max(ans, height[end]*i)\n end -= 1\n return ans\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"121"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n answer = 0\n left, right = 0, len(height)-1\n while left < right:\n if height[left] > height[right]:\n answer = max(answer, (right-left) * height[right])\n right -= 1\n else:\n answer = max(answer, (right-left) * height[left])\n left += 1\n return answer\n\nf = open('user.out', 'w')\ns = Solution()\nfor case in map(loads, stdin):\n f.write(f\"{s.maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"128"},{"code":"def maxArea(height: List[int]) -> int:\n l, r = 0, len(height) - 1 \n res = 0\n while l < r:\n if height[l] > height[r]:\n res = max(res, (r - l) * height[r])\n r -= 1 \n else:\n res = max(res, (r - l) * height[l])\n l += 1 \n return res \n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)\n\n # left, right = 0, len(height) - 1 \n # res = 0\n # maxLeft, maxRight = left, right\n # while left < right:\n # if height[left] > height[maxLeft]:\n # maxLeft = left\n # if height[right] > height[maxRight]:\n # maxRight = right\n # if height[maxRight] > height[maxLeft]:\n # left += 1 \n # res = max(res, (maxRight - maxLeft) * height[maxLeft])\n # else: #left is greater\n # right -= 1 \n # res = max(res, (maxRight - maxLeft) * height[maxRight])\n # return res \n \n\n\n ","runtime":"128"},{"code":"\ndef maxArea(height: List[int]) -> int:\n i = 0\n j = len(height)-1\n max_area = 0\n while i < j:\n area = min(height[i], height[j]) * (j-i)\n if max_area < area:\n max_area = area\n if height[i] < height[j] :\n i += 1\n else:\n j -=1\n return max_area\n\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"134"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n right_i = 0\n left_i = len(height) - 1\n capacity = max(0, (min(height[right_i], height[left_i])) * (left_i-right_i))\n while right_i < left_i:\n if height[right_i] > height[left_i]:\n left_i -= 1\n else:\n right_i += 1\n area = min(height[right_i], height[left_i]) * (left_i-right_i)\n if area > capacity:\n capacity = area\n\n return capacity\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for num in inputs:\n print(str(Solution().maxArea(num)).replace(\" \", \"\"), file=f)\nexit(0)","runtime":"134"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n low, high = 0, len(height)-1\n ans=(high-low)*min(height[low], height[high])\n while low<high:\n if height[low]<height[high] and height[low+1]<=height[low]:\n low=low+1\n elif height[low]<height[high] and height[low+1]>height[low]:\n low=low+1\n area=(high-low)*min(height[low], height[high])\n if area>ans:\n ans=area\n elif height[high]<height[low] and height[high-1]<=height[high]:\n high=high-1\n elif height[high]<height[low] and height[high-1]>height[high]:\n high=high-1\n area=(high-low)*min(height[low], height[high])\n if area>ans:\n ans=area\n elif height[high]==height[low]:\n area=(high-low)*min(height[low], height[high])\n if area>ans:\n ans=area\n low=low+1\n high=high-1\n area=(high-low)*min(height[low], height[high])\n if area>ans:\n ans=area\n return ans\ndef main():\n input = sys.stdin.read().strip()\n \n\n test_cases = input.splitlines()\n \n results = []\n for case in test_cases:\n \n height = json.loads(case)\n results.append(Solution().maxArea(height))\n \n\n with open('user.out', 'w') as f:\n for result in results:\n f.write(f\"{result}\\n\")\n\nif __name__ == \"__main__\":\n main()\n exit(0)","runtime":"141"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height) - 1\n out = 0\n while l < r:\n out = max(out, (r - l) * min(height[l], height[r]))\n if height[l] > height[r]:\n r -= 1\n else:\n l += 1\n \n return out\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for height in inputs:\n print(str(Solution().maxArea(height)).replace(\" \", \"\"), file=f)\nexit(0)","runtime":"141"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n i,j,l,r = 0, len(height)-1,height[0], height[-1]\n maxa=0\n while j>i:\n a=(j-i)*min(l,r)\n maxa=max(a,maxa)\n if l>r:\n j-=1\n r=height[j]\n else:\n i+=1\n l=height[i]\n return maxa\n\nwith open('user.out', 'w') as f:\n s=Solution()\n for h in map(loads, stdin):\n f.write(str(s.maxArea(h))+'\\n')\nexit()","runtime":"147"},{"code":"class Solution:\n def maxArea( height: List[int]) -> int:\n maxwater,i,j = 0,0,len(height) - 1\n while i < j:\n currentarea = min(height[i],height[j]) * (j-i)\n maxwater = max(currentarea,maxwater)\n \n if height[i]<height[j]:\n i += 1\n else:\n j -= 1\n return maxwater\n f = open('user.out', 'w')\n for case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\n f.flush()\n exit(0)\n\n\n ","runtime":"147"},{"code":"def maxArea(height: List[int]) -> int:\n n = len(height)\n max_area = float('-inf')\n left, right = 0, n - 1\n while left < right:\n curr_area = min(height[left], height[right]) * (right - left)\n max_area = max(max_area, curr_area)\n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n return max_area\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"154"},{"code":"\ndef maxArea(height: List[int]) -> int:\n area=0\n a=0\n b=len(height)-1\n while(a<b):\n area = max(area,min(height[a],height[b])*(b-a))\n if height[a]>=height[b]:\n b-=1\n else:\n a+=1\n return area\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"154"},{"code":"def maxArea(height: List[int]) -> int:\n i = 0\n j = len(height) - 1\n max_water = 0\n while i < j:\n max_water = max(max_water, min(height[i], height[j]) * (j - i))\n if height[i] < height[j]:\n i += 1\n else:\n j -= 1\n return max_water\n \n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"160"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n left = 0\n right = len(height)-1\n maxarea = 0\n \n\n while left < right:\n currarea = min(height[left], height[right]) * (right - left)\n maxarea = max(maxarea, currarea)\n\n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n return maxarea\n\nsolution = Solution()\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{solution.maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"160"},{"code":"def maxArea(height: List[int]) -> int:\n n = len(height)\n max_area = float('-inf')\n left, right = 0, n - 1\n while left < right:\n curr_area = min(height[left], height[right]) * (right - left)\n max_area = max(max_area, curr_area)\n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n return max_area\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"174"},{"code":"class Solution:\n def maxArea(self, heights: List[int]) -> int:\n l, r = 0, len(heights) - 1\n res = 0\n\n while l < r:\n res = max(res, min(heights[l], heights[r]) * (r - l))\n if heights[l] < heights[r]:\n l += 1\n elif heights[r] <= heights[l]:\n r -= 1\n \n return res\n\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for num in inputs:\n print(str(Solution().maxArea(num)).replace(\" \", \"\"), file=f)\nexit(0)","runtime":"174"},{"code":"\ndef maxArea(height: List[int]) -> int:\n def calcArea(a, b):\n return min(height[a], height[b]) * (b-a) \n\n i = 0\n j = len(height)-1\n max_area = 0\n max_height = max(height)\n while i < j:\n max_area = max(max_area, calcArea(i, j))\n if height[i] <= height[j]:\n i += 1\n else:\n j -= 1\n\n return max_area\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"180"},{"code":"f = open('user.out', 'w')\nfor height in stdin:\n height = loads(height)\n\n max_water, i, j = 0, 0, len(height) -1\n\n while i < j:\n max_water = max(min(height[i], height[j]) * (j - i), max_water)\n\n if height[i] > height[j]:\n j -= 1\n\n else:\n i += 1\n \n print(max_water, file=f)\nexit(0)\n","runtime":"187"},{"code":"f = open('user.out', 'w')\nfor height in stdin:\n height = loads(height)\n\n max_water, i, j = 0, 0, len(height) -1\n\n while i < j:\n max_water = max(min(height[i], height[j]) * (j - i), max_water)\n\n if height[i] > height[j]:\n j -= 1\n\n else:\n i += 1\n \n print(max_water, file=f)\nexit(0)\n","runtime":"193"},{"code":"f = open('user.out', 'w')\nfor height in map(loads, stdin):\n left = 0\n right = len(height) - 1\n maxArea = 0\n\n while left < right:\n currArea = min(height[left], height[right]) * (right - left)\n maxArea = max(maxArea, currArea)\n\n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n print(maxArea, file=f)\nexit(0)","runtime":"200"},{"code":"class Solution:\n def maxArea(height: List[int]) -> int:\n left = 0\n right = len(height)-1\n max_area = 0\n while left < right:\n area = min(height[left],height[right])*(right-left)\n print(area)\n max_area = max(max_area,area)\n if(height[left]<height[right]):\n left+=1\n else:\n right-=1\n return max_area\n\n f = open('user.out', 'w')\n for case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\n f.flush()\n exit(0)","runtime":"206"},{"code":"def maxArea( height: List[int]) -> int:\n left,right,max_area = 0,len(height)-1,0\n while left <= right:\n print(left,right)\n area = min(height[left],height[right]) * (right - left)\n if area > max_area:\n max_area = area\n \n if height[left] <= height[right]:\n left+=1\n else:\n right-=1\n return max_area\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","runtime":"213"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n n = len(height)\n lp = 0\n rp = n-1\n m = 0\n mh = max(height)\n \n while lp < rp:\n area = (rp-lp)*min(height[lp],height[rp])\n m = max(m, area)\n\n if mh * (rp -lp) <= m:\n break\n \n if height[lp] <= height[rp]:\n lp += 1\n else:\n rp -= 1\n return m","runtime":"219"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height)-1\n maxArea = 0\n\n while l < r:\n area = min(height[l], height[r]) * (r - l)\n maxArea = max(area, maxArea)\n \n if height[l] <= height[r]:\n h0 = height[l]\n while l < r and height[l] <= h0:\n l += 1\n else:\n h0 = height[r]\n while l < r and height[r] <= h0:\n r -= 1\n \n return maxArea\n","runtime":"226"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n # max_area = 0\n # for i in range(len(height)-1):\n # for j in range(1, len(height)):\n # area = min(height[i], height[j]) * (j - i)\n # if max_area < area:\n # max_area = area\n # return max_area\n\n max_area = 0\n max_height = max(height)\n left = 0\n right = len(height) - 1\n while left < right:\n max_area = max(max_area, min(height[left], height[right]) * (right - left))\n if max_height * (right - left) <= max_area:\n break\n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n return max_area","runtime":"232"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area=0\n area=0\n l=0\n r=len(height)-1\n mh=max(height)\n while l<r:\n area=(r-l)*min(height[l],height[r])\n max_area = max(max_area, area)\n if mh * (r - l) <= max_area:\n break\n if height[l]<height[r]:\n l+=1\n else:\n r-=1\n return max_area","runtime":"232"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area = 0\n l_index = 0\n r_index = len(height) - 1\n max_height = max(height)\n while l_index < r_index:\n curr_area = (r_index - l_index) * min(height[l_index], height[r_index])\n if curr_area > max_area:\n max_area = curr_area\n if max_height * (r_index - l_index) <= max_area:\n break\n if height[r_index] < height[l_index]:\n r_index-=1\n else:\n l_index+=1\n return max_area","runtime":"239"},{"code":"from typing import List\n\n\nclass Solution:\n def maxArea(self, height: List[int]) -> int:\n left_pointer = 0\n right_pointer = len(height) - 1 # returns index of last element\n\n max_height = 0\n\n max_possible_height = max(height)\n\n while left_pointer < right_pointer:\n\n area = min(height[left_pointer], height[right_pointer]) * (\n right_pointer - left_pointer\n )\n\n # print(area)\n\n if height[right_pointer] > height[left_pointer]:\n left_pointer += 1\n else:\n right_pointer -= 1\n\n if area > max_height:\n max_height = area\n\n if max_possible_height * (right_pointer - left_pointer) <= max_height:\n break\n\n print(\"max_height : \", max_height)\n return max_height","runtime":"245"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n m = max(height)\n left, right = 0, len(height)-1\n res = 0\n \n while left < right:\n leftval, rightval = height[left], height[right] \n a = (right - left) * (min(leftval, rightval))\n res = a if a > res else res\n \n if leftval < rightval:\n left += 1\n else:\n right -= 1\n \n if res > (right - left) * m:\n break\n\n return res\n ","runtime":"252"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_volume = 0 \n max_h = max(height) #max height of the container\n size = len(height)-1 \n i , j = 0 , size #using two pointer approach both pointers pointing at both ends\n while i < j:\n #This formula below will calculate the volume of the tank by\n #choosing the minimum of two heights and multiplying it with\n #the current lenght of tank which both the pointer points\n curr_volume = min(height[i],height[j]) * (j-i)\n\n #This line below will always assign the maximum volume whenever the current\n #volume is greater than the max_volume\n max_volume = max(curr_volume,max_volume)\n \n # this condition is used to eliminate the unwanted iterations inside the loop\n # it will check that the (max_volume) is greater than or equal to the maximum volume \n # the tank can contain, by multiplying the maximum height with the current length\n # as the length will only decrease overtime the maximum volume the tank can contain \n # also decreases gradually which helps in eliminating lot of iterations\n if max_h * (j-i) <= max_volume: \n break # we will just return the max_volume if this condition satisfies\n\n if height[i] < height[j]: #we are just incrementing the 'i' if it is lesser than 'j' \n i += 1 \n else: #otherwise we will decrement 'j' if 'i is greater\n j -= 1 \n return max_volume\n\n \n\n\n\n \n\n \n \n\n ","runtime":"259"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height) - 1\n max_height = max(height)\n res = 0\n\n while l < r:\n width = r - l\n vol = min(height[l], height[r]) * width\n res = max(vol, res)\n\n if height[l] < height[r]:\n l += 1\n else:\n r -= 1\n\n if width * max_height < res:\n return res\n\n return res\n\n \n ","runtime":"265"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height) - 1\n max_area = 0\n max_h = max(height)\n\n while l <= r:\n min_h = min(height[l], height[r])\n area = min_h * (r - l)\n max_area = max(max_area, area)\n\n if max_h * (r - l) <= max_area:\n break\n\n if height[l] <= height[r]:\n l += 1\n else:\n r -= 1\n \n return max_area","runtime":"272"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height)-1\n maxW = 0\n maxh = max(height)\n while l<r:\n if maxh*(r-l)<= maxW:\n return maxW\n maxW = max(maxW, min(height[l], height[r])*(r-l))\n if height[l]>=height[r]:\n r-=1\n else:\n l+=1\n return maxW","runtime":"278"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l = 0\n r = len(height) - 1\n ans = 0\n maxx = max(height)\n while l != r:\n if (v:= min(height[l],height[r])*(r-l)) > ans:\n ans = v\n if maxx * (r - l) < ans:\n break\n if height[l] < height[r]:\n l += 1\n else:\n r -= 1\n return ans","runtime":"285"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height) - 1\n max_height = max(height)\n res = 0\n\n while l < r:\n width = r - l\n vol = min(height[l], height[r]) * width\n res = max(vol, res)\n\n if height[l] < height[r]:\n l += 1\n else:\n r -= 1\n\n if width * max_height < res:\n return res\n\n return res\n\n \n ","runtime":"291"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height) - 1\n mh = max(height)\n m = 0\n while l < r - (m // mh):\n if height[l] > height[r]:\n m = max(m, (r - l) * height[r])\n r -= 1\n else:\n m = max(m, (r - l) * height[l])\n l += 1\n \n return m\n","runtime":"298"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n\n maks = 0\n\n a = 0\n\n b = len(height) - 1\n\n max_u = max(height)\n\n\n while a < b:\n\n a_u = height[a]\n\n b_u = height[b]\n\n genislik = b-a\n\n if maks >= max_u * genislik:\n return maks\n\n if a_u > b_u:\n alan = b_u * genislik\n b -= 1\n else:\n alan = a_u * genislik\n a += 1\n \n if alan > maks:\n maks = alan\n \n return maks\n\n \n ","runtime":"304"},{"code":"class Solution:\n def maxArea(self, height: list[int]) -> int:\n result = 0\n i = 0\n j = len(height) - 1\n max_h = max(height)\n\n while i != j:\n cour = min(height[i], height[j]) * (j - i)\n result = max(cour, result)\n if max_h * (j - i) <= result:\n break\n if height[i] > height[j]:\n j -= 1\n else:\n i += 1\n return result","runtime":"311"},{"code":"class Solution(object):\n def maxArea(self, height: List[int]) -> int:\n max_h, max_a, p1, p2 = max(height), 0, 0, len(height) - 1\n for width in range(p2, -1, -1):\n if height[p1] > height[p2]:\n a = width * height[p2]\n if a > max_a:\n max_a = a\n p2 -= 1\n else:\n a = width * height[p1]\n if a > max_a:\n max_a = a\n p1 += 1\n if max_h * width <= max_a:\n break\n return max_a","runtime":"317"},{"code":"class Solution(object):\n def maxArea(self, height: List[int]) -> int:\n maxH, maxA, left, right = max(height), 0, 0, len(height) - 1\n while left < right:\n if height[left] < height[right]:\n if height[left] * (right - left) > maxA:\n maxA = height[left] * (right - left)\n else:\n if height[right] * (right - left) > maxA:\n maxA = height[right] * (right - left)\n\n if maxH * (right - left) <= maxA:\n break\n\n if height[left] < height[right]:\n left = left + 1\n else:\n right = right - 1\n return maxA\n","runtime":"324"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n\n maks = 0\n\n a = 0\n\n b = len(height) - 1\n\n max_u = max(height)\n\n\n while a < b:\n\n a_u = height[a]\n\n b_u = height[b]\n\n genislik = b-a\n\n if maks >= max_u * genislik:\n return maks\n\n if a_u > b_u:\n alan = b_u * genislik\n b -= 1\n else:\n alan = a_u * genislik\n a += 1\n \n if alan > maks:\n maks = alan\n \n return maks\n\n \n ","runtime":"330"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height) - 1\n area = 0\n maxheight = max(height)\n while l < r - (area // maxheight):\n if height[l] < height[r]:\n area = max(area, height[l] * (r - l))\n l += 1\n else:\n area = max(area, height[r] * (r - l))\n r -= 1\n return area\n","runtime":"337"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height) - 1\n res = 0 \n h = max(height)\n\n while l <= r:\n res = max(res, min(height[l], height[r]) * (r - l))\n if height[l] < height[r]:\n l += 1\n elif height[l] >= height[r]:\n r -= 1\n \n if (r - l) * h < res:\n break\n \n return res","runtime":"343"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_volume = 0 \n max_h = max(height) #max height of the container\n size = len(height)-1 \n i , j = 0 , size #using two pointer approach both pointers pointing at both ends\n while i < j:\n #This formula below will calculate the volume of the tank by\n #choosing the minimum of two heights and multiplying it with\n #the current lenght of tank which both the pointer points\n curr_volume = min(height[i],height[j]) * (j-i)\n\n #This line below will always assign the maximum volume whenever the current\n #volume is greater than the max_volume\n max_volume = max(curr_volume,max_volume)\n \n # this condition is used to eliminate the unwanted iterations inside the loop\n # it will check that the (max_volume) is greater than or equal to the maximum volume \n # the tank can contain, by multiplying the maximum height with the current length\n # as the length will only decrease overtime the maximum volume the tank can contain \n # also decreases gradually which helps in eliminating lot of iterations\n if max_h * (j-i) <= max_volume: \n break # we will just return the max_volume if this condition satisfies\n\n if height[i] < height[j]: #we are just incrementing the 'i' if it is lesser than 'j' \n i += 1 \n else: #otherwise we will decrement 'j' if 'i is greater\n j -= 1 \n return max_volume\n\n \n\n\n\n \n\n \n \n\n ","runtime":"350"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height) - 1\n width = len(height) - 1\n res = 0\n mh = max(height)\n while l < r:\n if height[l] < height[r]:\n res = max(res, width * height[l])\n l += 1\n else:\n res = max(res, width * height[r])\n r -= 1\n if mh * width <= res:\n break\n width -= 1\n\n return res\n","runtime":"357"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l,r = 0, len(height)-1\n maxH = max(height)\n res = 0\n while l<r:\n res = max(res,min(height[l],height[r])*(r-l))\n if res>=maxH*(r-l):\n break\n if height[l]<height[r]:\n l+=1\n else:\n r-=1\n return res\n","runtime":"363"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n ans = 0\n l, r = 0, len(height) - 1\n while l < r:\n ans = max(ans, min(height[l], height[r]) * (r-l))\n if height[l] <= height[r]:\n prev = l\n while l<r and height[prev] >= height[l]:\n l += 1\n else:\n prev = r\n while l<r and height[prev] >= height[r]:\n r -= 1\n return ans","runtime":"363"},{"code":"class Solution:\n def maxArea(self, height: list[int]) -> int:\n result = 0\n i = 0\n j = len(height) - 1\n max_h = max(height)\n\n while i != j:\n cour = min(height[i], height[j]) * (j - i)\n result = max(cour, result)\n if max_h * (j - i) <= result:\n break\n if height[i] > height[j]:\n j -= 1\n else:\n i += 1\n return result","runtime":"370"},{"code":"class Solution:\n def maxArea(self, height: list[int]) -> int:\n result = 0\n i = 0\n j = len(height) - 1\n max_h = max(height)\n\n while i != j:\n cour = min(height[i], height[j]) * (j - i)\n result = max(cour, result)\n if max_h * (j - i) <= result:\n break\n if height[i] > height[j]:\n j -= 1\n else:\n i += 1\n return result ","runtime":"376"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area = 0 # Initialize maximum area\n left = 0 # Initialize left pointer\n right = len(height) - 1 # Initialize right pointer\n\n while left < right: # Iterate until left pointer is less than right pointer\n # Calculate area and update maximum area\n max_area = max(max_area, (right - left) * min(height[left], height[right]))\n\n # Move the pointer with smaller height towards the other pointer\n if height[left] <= height[right]:\n height_left = height[left] # Store current height of left pointer\n\n # Move left pointer until it finds a height greater than or equal to height_left\n while left < right and height[left] <= height_left:\n left += 1\n\n else:\n height_right = height[right] # Store current height of right pointer\n\n # Move right pointer until it finds a height greater than or equal to height_right\n while left < right and height[right] <= height_right:\n right -= 1\n\n return max_area # Return the maximum area","runtime":"376"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area = 0\n left = 0\n right = len(height) - 1\n\n while left != right:\n area = min(height[left], height[right]) * (right - left)\n max_area = max(max_area, area)\n\n if height[left] < height[right]:\n target = height[left]\n left += 1\n while height[left] < target and left < right:\n left += 1\n else:\n target = height[right]\n right -= 1\n while height[right] < target and left < right:\n right -= 1\n\n return max_area","runtime":"383"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height)-1\n ret = -1\n maxh = max(height)\n while (l < r):\n lwall = height[l]\n rwall = height[r]\n ret = max(ret, min(lwall, rwall) * (r-l))\n if maxh * (r-l) <= ret: break\n if rwall < lwall:\n r -= 1\n else:\n l += 1\n return ret\n ","runtime":"389"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n i_left, i_right = 0, len(height)-1\n max_area, max_height = 0, max(height)\n\n while(i_left < i_right):\n w, h = i_right-i_left, min(height[i_right], height[i_left])\n max_area = max(max_area, w*h)\n\n if max_height*w <= max_area: # max_height*w is the current theoretical maximum acheivable area, so break early if already there\n break\n\n if height[i_left] < height[i_right]: # greedy approach to finding new walls. (the higher side gets to stay since it determines the upper bound of h)\n i_left += 1\n else:\n i_right -= 1\n\n return max_area","runtime":"396"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n # search inside for increasng min(left, right)\n # assumption is the at each step, new largest can only be inside [left, right]\n\n # n >= 2\n n = len(height)\n left, right = 0, n - 1\n\n # def get_max(i, j):\n # # [i, j]\n # return min(height[i], height[j]) * abs(j + 1 - i)\n\n best = 0\n \n while(right > left):\n hl, hr = height[left], height[right]\n best = max(best, min(hl, hr) * (right - left))\n if hl < hr:\n while(left < right and height[left] <= hl):\n left += 1\n else:\n while(right > left and height[right] <= hr):\n right -= 1\n \n return best\n ","runtime":"402"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n i_left, i_right = 0, len(height)-1\n max_area, max_height = 0, max(height)\n\n while(i_left < i_right):\n w, h = i_right-i_left, min(height[i_right], height[i_left])\n max_area = max(max_area, w*h)\n\n if max_height*w <= max_area: # max_height*w is the current theoretical maximum acheivable area, so break early if already there\n break\n\n if height[i_left] < height[i_right]: # greedy approach to finding new walls. (the higher side gets to stay since it determines the upper bound of h)\n i_left += 1\n else:\n i_right -= 1\n\n return max_area","runtime":"409"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n maxH = 0\n secondmaxH = 0\n maxIndex = 0\n for i in range(len(height)):\n if height[i] > maxH:\n maxH = height[i]\n maxIndex = i\n\n for i in range(len(height)):\n if height[i] > secondmaxH and i != maxIndex:\n secondmaxH = height[i]\n \n \n water = 0\n n = len(height)\n left = 0\n right = n-1\n while left < right:\n computedWater = min(height[left], height[right]) * (right - left)\n if computedWater > water:\n water = computedWater\n if water >= secondmaxH * (right - left):\n break\n\n leftHeight = height[left]\n rightHeight = height[right]\n if height[left] < height[right]:\n left += 1\n while left < right and height[left] < leftHeight:\n left += 1\n else:\n right -= 1\n while left < right and height[right] < rightHeight:\n right -= 1\n \n return water\n ","runtime":"415"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n res = 0\n l, r = 0, len(height) - 1\n max_height = max(height)\n\n while l < r:\n res = max(res, min(height[l], height[r]) * (r - l))\n\n if height[l] < height[r]:\n l += 1\n elif height[r] <= height[l]:\n r -= 1\n\n if max_height * (r - 1) < res:\n break\n \n return res","runtime":"415"},{"code":"class Solution:\n def maxArea(self, height: list[int]) -> int:\n result = 0\n start = 0\n end = len(height) - 1\n max_h = max(height)\n\n while start != end:\n cour = min(height[start], height[end]) * (end - start)\n result = max(cour, result)\n if max_h * (end - start) <= result:\n break\n if height[start] > height[end]:\n end -= 1\n else:\n start += 1\n return result","runtime":"422"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n left, right, res, max_h = 0, len(height)-1, 0, max(height)\n while left < right:\n res = max(res, min(height[left],height[right])*(right-left))\n if max_h * (right - left) < res: break\n if height[left] < height[right]: left += 1\n else: right -= 1\n return res","runtime":"422"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n i=res=0\n j=len(height)-1\n count=0\n while(i<j):\n while height[i]<count and i<j:\n i+=1\n while height[j]<count and i<j:\n j-=1\n if i<j and height[i]>=count and height[j]>=count:\n if ((j-i)*count)>res:\n res=(j-i)*count\n count+=1\n return res","runtime":"428"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l = 0\n r = len(height) - 1\n m = max(height)\n dis = 0\n area = 0\n while l != r:\n if height[l] == m and height[r] == m:\n # print(\"HII\")\n dis = r - l\n if area < dis * height[r]:\n area = dis * height[r]\n break\n elif l == 0 and r == len(height) - 1:\n dis = r - l\n temp = min(height[l], height[r])\n area = dis * (temp)\n if temp < height[l]:\n r -= 1\n else:\n l += 1\n else:\n dis = r - l\n if height[l] < height[r]:\n if area < dis * height[l]:\n area = dis * (height[l])\n l += 1\n\n elif area < dis * height[r]:\n area = dis * (height[r])\n r -= 1\n else:\n r-=1\n\n return area\n","runtime":"435"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n left = 0\n right = len(height) - 1\n maxwater = 0\n\n while left<right:\n h = min(height[left], height[right])\n maxwater = max(maxwater, h * (right-left))\n while(height[left] <= h and left<right) :\n left += 1\n while(height[right] <= h and left<right) :\n right -= 1\n return maxwater\n ","runtime":"442"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n n = len(height)\n left = 0\n right = n-1\n maxHeight = max(height)\n maxVol = 0\n\n while left < right:\n curVol = min(height[right], height[left]) * (right - left)\n\n if curVol > maxVol:\n maxVol = curVol\n \n if maxVol >= maxHeight * (right - left):\n break\n \n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n\n return maxVol\n","runtime":"442"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_volume = 0\n start = 0\n end = len(height) - 1\n\n while start <= end:\n min_ht = min(height[start], height[end])\n max_volume = max(max_volume, min_ht*(end-start))\n\n while start <= end:\n if height[start] <= min_ht:\n start += 1\n else:\n break\n \n while end >= start:\n if height[end] <= min_ht:\n end -= 1\n else:\n break\n \n return max_volume","runtime":"448"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n first, last, max_area = 0, len(height)-1, 0\n while(first<last):\n a = (last-first) * ( height[last] if height[last]<height[first] else height[first] ) \n if a > max_area: max_area = a\n if height[first]>height[last]: last -= 1\n else: first += 1\n return max_area","runtime":"448"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area = 0\n left = 0\n right = len(height) - 1\n\n while left != right:\n area = min(height[left], height[right]) * (right - left)\n max_area = max(max_area, area)\n\n if height[left] < height[right]:\n target = height[left]\n left += 1\n while height[left] < target and left < right:\n left += 1\n else:\n target = height[right]\n right -= 1\n while height[right] < target and left < right:\n right -= 1\n\n return max_area","runtime":"455"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height) - 1\n res = 0\n max_l, max_r = 0, 0 # index\n max_left, max_right = 0, 0 # max height\n while l < r:\n res = max(res, (max_r - max_l) * min(max_left, max_right))\n if max_left < max_right:\n while l < len(height) and height[l] <= max_left:\n l += 1\n max_left = height[l]\n max_l = l\n else:\n while r > 0 and height[r] <= max_right:\n r -= 1\n max_right = height[r]\n max_r = r\n return res\n","runtime":"455"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n start = 0\n end = len(height) - 1\n maxVolume = 0\n while start < end:\n currentVolume = 0\n if height[start] > height[end]:\n currentVolume = height[end] * (end - start)\n end -= 1\n else:\n currentVolume = height[start] * (end - start)\n start += 1\n if maxVolume < currentVolume:\n maxVolume = currentVolume\n return maxVolume","runtime":"461"},{"code":"class Solution:\n def maxArea(self, heights: List[int]) -> int:\n def amount(l, r):\n return (r - l) * min(heights[l], heights[r])\n\n left = 0\n right = len(heights) - 1\n res = amount(left, right)\n\n while left < right:\n if heights[left] > heights[right]:\n prev = heights[right]\n while left < right and heights[right] <= prev:\n right -= 1\n else:\n prev = heights[left]\n while left < right and heights[left] <= prev:\n left += 1\n\n res = max(res, amount(left, right))\n \n return res","runtime":"461"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n rightPointer = len(height) - 1\n leftPointer = 0\n maxArea = 0\n\n while(leftPointer <= rightPointer):\n tempArea = 0\n if(height[rightPointer] > height[leftPointer]):\n tempArea = height[leftPointer] * (rightPointer - leftPointer)\n leftPointer += 1\n elif(height[rightPointer] < height[leftPointer]):\n tempArea = height[rightPointer] * (rightPointer - leftPointer)\n rightPointer -= 1\n else:\n tempArea = height[rightPointer] * (rightPointer - leftPointer)\n leftPointer += 1\n if(maxArea < tempArea):\n maxArea = tempArea\n \n return maxArea\n\n ","runtime":"468"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n left = 0 #first ptr\n right = len(height) - 1\n maxArea = 0\n\n while left < right:\n if height[left] <= height[right]:\n if height[left] * (right - left) > maxArea:\n maxArea = height[left] * (right - left)\n left += 1\n elif height[right] < height[left]:\n if height[right] * (right - left) > maxArea:\n maxArea = height[right] * (right - left)\n right -= 1\n \n return maxArea\n\n ","runtime":"468"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n first, last, max_area = 0, len(height)-1, 0\n while(first<last):\n a = (first-last if first>last else last-first) * ( height[last] if height[last]<height[first] else height[first] ) \n if a > max_area: max_area = a\n if height[first]>height[last]: last -= 1\n else: first += 1\n return max_area","runtime":"474"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n first, last, max_area = 0, len(height)-1, 0\n while(first<last):\n a = (last-first) * ( height[last] if height[last]<height[first] else height[first] ) \n if a > max_area: max_area = a\n if height[first]>height[last]: last -= 1\n else: first += 1\n return max_area","runtime":"474"},{"code":"class Solution:\n def maxArea(self, h: List[int]) -> int:\n area, l, r = 0, 0, len(h)-1\n while l<r:\n if h[l]<h[r]:\n area = max(area,h[l]*(r-l))\n l+=1\n elif h[r]<h[l]:\n area = max(area,h[r]*(r-l))\n r-=1\n else:\n area = max(area,h[r]*(r-l))\n r-=1\n l+=1\n return area\n \n ","runtime":"481"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n res = 0\n l, r = 0, len(height) - 1\n while l < r:\n while height[l] <= height[r] and l < r:\n res = max(height[l] * (r - l), res)\n l += 1\n while height[r] <= height[l] and l < r:\n res = max(height[r] * (r - l), res)\n r -= 1\n return res","runtime":"494"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n lptr = 0\n rptr = len(height) - 1\n ma = 0\n while lptr != rptr:\n na = (rptr - lptr) * min(height[lptr], height[rptr])\n if na > ma:\n ma = na\n if height[lptr] > height[rptr]:\n rptr -= 1\n else:\n lptr += 1\n return ma","runtime":"494"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n res = 0\n l, r = 0, len(height) - 1\n while l < r:\n while height[l] <= height[r] and l < r:\n res = max(height[l] * (r - l), res)\n l += 1\n while height[r] <= height[l] and l < r:\n res = max(height[r] * (r - l), res)\n r -= 1\n return res","runtime":"500"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l = 0 \n r = len(height)-1\n res = min(height[l],height[r]) * (r-l)\n while l < r:\n res = max(res,(min(height[l],height[r]) * (r-l)))\n if height[l] > height[r]:\n r -=1\n elif height[l] < height[r]:\n l += 1\n else: \n l += 1\n r -= 1\n #this part is the key\n return res\n \n","runtime":"500"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n area=0\n front=0\n back=len(height)-1\n while (front!=back):\n temp=min(height[front],height[back])*(back-front)\n if temp>area:\n area=temp\n if height[front]>=height[back]:\n back-=1\n elif height[front]<height[back]:\n front+=1\n\n return area\n ","runtime":"507"},{"code":"class Solution:\n def maxArea(self, height: list[int]) -> int:\n array_sq = []\n right = 0\n left = len(height) - 1\n while right != left:\n sqA = min(height[right], height[left])\n sqB = abs(left - right)\n array_sq.append(sqA * sqB)\n if height[right] < height[left]:\n right += 1\n else:\n left -= 1\n return max(array_sq)\n ","runtime":"507"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n i = 0\n j = len(height) -1\n max_area = 0\n while j>i:\n if min(height[j],height[i]) * (j-i) > max_area:\n max_area = min(height[j],height[i]) * (j-i)\n print(i)\n print(j)\n\n if height[i] > height[j]:\n j -= 1\n else:\n i+=1\n\n \n return max_area\n \n ","runtime":"513"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n i = 0\n j = len(height)-1\n ans = 0\n while i < j:\n temp = min(height[i] , height[j]) * (j-i)\n if temp > ans:\n ans = temp\n if(height[i] < height[j]):\n i += 1\n else:\n j -= 1\n return ans\n ","runtime":"513"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area = 0\n l, r = 0, len(height) - 1\n\n while l < r:\n curr_area = (r-l) * min(height[l], height[r])\n max_area = max(max_area, curr_area)\n if height[l] <= height[r]:\n l += 1\n else:\n r -= 1\n return max_area","runtime":"520"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area = 0\n l, r = 0, len(height) - 1\n\n while l < r:\n max_area = max(max_area, (r - l) * min(height[l], height[r]))\n if height[l] < height[r]: l += 1\n else: r -= 1\n return max_area\n ","runtime":"520"},{"code":"class Solution:\n \n def maxArea(self, height: List[int]) -> int:\n # are = height x width \n\n # two height will be taken \n # y= min of height \n # x= right -left \n # Finally max area \n\n maxarea = 0\n left, right = 0, len(height) -1\n \n while left < right:\n heights = min(height[left],height[right])\n maxarea = max(maxarea, heights*(right - left))\n if height[left] < height[right]:\n left+=1\n else:\n right-=1\n\n return maxarea \n","runtime":"527"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area = 0\n left, right = 0, len(height) - 1\n\n while left < right:\n y_left, y_right = height[left], height[right]\n y = min(y_left, y_right)\n x = right - left\n max_area = max(x * y, max_area)\n\n if y_left > y_right:\n right -= 1\n else:\n left += 1\n\n return max_area\n","runtime":"527"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area=0\n left=0\n right=len(height)-1\n while left<right:\n max_area=max(max_area,(right-left)*min(height[left],height[right]))\n if height[left]<height[right]:\n left+=1\n else:\n right-= 1\n return max_area\n","runtime":"533"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n res=0\n l,r=0,len(height)-1\n while l<r:\n area=(r-l)*min(height[l],height[r])\n res=max(area,res)\n\n if height[l]<height[r]:\n l+=1\n else:\n r-=1\n return res","runtime":"533"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_water = 0\n left = 0\n right = len(height)-1\n while left < right:\n left_height, right_height = height[left], height[right]\n container_height = min(left_height, right_height)\n water = container_height * (right - left)\n max_water = max(water, max_water)\n if left_height < right_height:\n left += 1\n else:\n right -= 1\n return max_water\n ","runtime":"540"},{"code":"\nclass Solution(object):\n def maxArea(self, height):\n \"\"\"\n :type height: List[int]\n :rtype: int\n \"\"\"\n \n max_area = 0\n left = 0\n right = len(height) - 1\n\n while right > left:\n area = (right - left) * min(height[left], height[right])\n max_area = max(area, max_area)\n if height[right] > height[left]:\n left += 1\n else:\n right -= 1\n \n return max_area","runtime":"540"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n left = 0\n right = len(height) - 1\n max_size = 0\n while left < right:\n size = min(height[left], height[right]) * (right - left)\n max_size = max(max_size, size)\n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n return max_size\n","runtime":"546"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n res = 0\n\n l, r = 0, len(height) - 1\n while l < r:\n\n if height[l] < height[r]:\n res = max(res, min(height[l], height[r]) * (r - l ))\n l += 1\n else:\n res = max(res, min(height[l], height[r]) * (r - l ))\n r -= 1\n return res\n\n","runtime":"546"},{"code":"class Solution:\n def maxArea(self, heights: List[int]) -> int:\n l, r = 0, len(heights) - 1\n res = 0\n\n while l < r:\n res = max(res, min(heights[l], heights[r]) * (r - l))\n if heights[l] < heights[r]:\n l += 1\n elif heights[r] <= heights[l]:\n r -= 1\n \n return res","runtime":"553"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n res = 0\n l, r = 0, len(height) - 1\n\n while l < r:\n area = min(height[l], height[r]) * (r - l)\n res = max(res, area)\n if height[l] < height[r]:\n l += 1\n else:\n r -= 1\n\n return res","runtime":"553"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n left = 0\n right = len(height) - 1\n result = 0\n while left < right:\n width = right - left\n min_value = min(height[left], height[right])\n result = max(result, width * min_value)\n if min_value == height[left]:\n left += 1\n else:\n right -= 1\n return result\n ","runtime":"559"},{"code":"class Solution:\n def recMaxArea(self, height, l_idx, r_idx):\n if l_idx >= r_idx:\n return 0\n curr_h20 = min(height[l_idx], height[r_idx]) * (r_idx - l_idx)\n if height[l_idx] < height[r_idx]:\n l_idx += 1\n else:\n r_idx -= 1\n next_h20 = self.recMaxArea(height, l_idx, r_idx)\n return max(curr_h20, next_h20)\n\n def maxArea(self, height: List[int]) -> int:\n l_idx, r_idx = 0, len(height) - 1\n return self.recMaxArea(height, l_idx, r_idx)\n \n ","runtime":"559"}],"string":"[\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n maxH, maxA, left, right = max(height), 0, 0, len(height) - 1\\n while left < right:\\n #currArea = \\n #maxA = max(min(height[left], height[right]) * (right - left), maxA)\\n if height[left] < height[right]:\\n if height[left] * (right - left) > maxA:\\n maxA = height[left] * (right - left)\\n else:\\n if height[right] * (right - left) > maxA:\\n maxA = height[right] * (right - left)\\n \\n if maxH * (right - left) <= maxA:\\n break\\n\\n if height[left] < height[right]:\\n left = left + 1\\n else: #if height[left] > height[right]:\\n right = right - 1\\n # else:\\n # left = left + 1\\n # right = right -1\\n return maxA\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n maxH, maxA, left, right = max(height), 0, 0, len(height) - 1\\n while left < right:\\n #currArea = \\n #maxA = max(min(height[left], height[right]) * (right - left), maxA)\\n if height[left] < height[right]:\\n if height[left] * (right - left) > maxA:\\n maxA = height[left] * (right - left)\\n else:\\n if height[right] * (right - left) > maxA:\\n maxA = height[right] * (right - left)\\n \\n if maxH * (right - left) <= maxA:\\n break\\n\\n if height[left] < height[right]:\\n left = left + 1\\n else: #if height[left] > height[right]:\\n right = right - 1\\n # else:\\n # left = left + 1\\n # right = right -1\\n return maxA\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"\\ndef maxArea(height: List[int]) -> int:\\n max_h, max_a, p1, p2 = max(height), 0, 0, len(height) - 1\\n\\n for width in range(p2, -1, -1):\\n if height[p1] > height[p2]:\\n a = width * height[p2]\\n if a > max_a:\\n max_a = a\\n p2 -= 1\\n else:\\n a = width * height[p1]\\n if a > max_a:\\n max_a = a\\n p1 += 1\\n\\n if max_h * width <= max_a:\\n break\\n\\n return max_a\\n\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\\n\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"\\ndef maxArea(height: List[int]) -> int:\\n max_h, max_a, p1, p2 = max(height), 0, 0, len(height) - 1\\n\\n for width in range(p2, -1, -1):\\n if height[p1] > height[p2]:\\n a = width * height[p2]\\n if a > max_a:\\n max_a = a\\n p2 -= 1\\n else:\\n a = width * height[p1]\\n if a > max_a:\\n max_a = a\\n p1 += 1\\n\\n if max_h * width <= max_a:\\n break\\n\\n return max_a\\n\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\\n\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution: \\n def maxArea(height: List[int]) -> int:\\n global_max = 0\\n left = 0\\n right = len(height)-1\\n max_h = max(height)\\n\\n while left < right:\\n area = min(height[left], height[right]) * (right-left)\\n global_max = max(global_max, area)\\n\\n if max_h * (right - left) <= global_max:\\n break\\n\\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n\\n return global_max\\n\\n f = open('user.out', 'w')\\n for case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\n f.flush()\\n exit(0)\\n \",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"\\ndef maxArea(height: List[int]) -> int:\\n max_h, max_a, p1, p2 = max(height), 0, 0, len(height) - 1\\n\\n for width in range(p2, -1, -1):\\n if height[p1] > height[p2]:\\n a = width * height[p2]\\n if a > max_a:\\n max_a = a\\n p2 -= 1\\n else:\\n a = width * height[p1]\\n if a > max_a:\\n max_a = a\\n p1 += 1\\n\\n if max_h * width <= max_a:\\n break\\n\\n return max_a\\n\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"\\ndef maxArea(height: List[int]) -> int:\\n # starting max\\n m = 0\\n # two pointers\\n i = 0\\n j = len(height)-1\\n # max height\\n mh = max(height)\\n while i < j:\\n # set the area to the min height * the distance between the two col\\n area = min(height[i], height[j]) * (j-i)\\n\\n # update max if necessary\\n m = max(m, area)\\n\\n\\n if mh * (j - i) <= m:\\n break\\n\\n if height[i] < height[j]:\\n i += 1\\n else:\\n j -= 1\\n\\n return m\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n maxH, maxA, left, right = max(height), 0, 0, len(height) - 1\\n while left < right:\\n #currArea = \\n #maxA = max(min(height[left], height[right]) * (right - left), maxA)\\n if height[left] < height[right]:\\n if height[left] * (right - left) > maxA:\\n maxA = height[left] * (right - left)\\n else:\\n if height[right] * (right - left) > maxA:\\n maxA = height[right] * (right - left)\\n \\n if maxH * (right - left) <= maxA:\\n break\\n\\n if height[left] < height[right]:\\n left = left + 1\\n else: #if height[left] > height[right]:\\n right = right - 1\\n # else:\\n # left = left + 1\\n # right = right -1\\n return maxA\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n maxH, maxA, left, right = max(height), 0, 0, len(height) - 1\\n while left < right:\\n #currArea = \\n #maxA = max(min(height[left], height[right]) * (right - left), maxA)\\n if height[left] < height[right]:\\n if height[left] * (right - left) > maxA:\\n maxA = height[left] * (right - left)\\n else:\\n if height[right] * (right - left) > maxA:\\n maxA = height[right] * (right - left)\\n \\n if maxH * (right - left) <= maxA:\\n break\\n\\n if height[left] < height[right]:\\n left = left + 1\\n else: #if height[left] > height[right]:\\n right = right - 1\\n # else:\\n # left = left + 1\\n # right = right -1\\n return maxA\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution: \\n def maxArea(height: List[int]) -> int:\\n global_max = 0\\n left = 0\\n right = len(height)-1\\n max_h = max(height)\\n\\n while left < right:\\n area = min(height[left], height[right]) * (right-left)\\n global_max = max(global_max, area)\\n\\n if max_h * (right - left) <= global_max:\\n break\\n\\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n\\n return global_max\\n\\n f = open('user.out', 'w')\\n for case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\n f.flush()\\n exit(0)\",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"#class Solution:\\n#def maxArea(self, height: List[int]) -> int:\\n\\\"\\\"\\\"l = 0\\nr = len(height) - 1\\nm = 0\\nwhile l < r:\\nc = min(height[l], height[r]) * (r - l)\\nm = max(m, c)\\nif height[l] < height[r]:\\nl += 1\\nelse:\\nr -= 1\\nreturn m\\\"\\\"\\\"\\ndef maxArea(height: List[int]) -> int:\\n # starting max\\n m = 0\\n # two pointers\\n i = 0\\n j = len(height)-1\\n # max height\\n mh = max(height)\\n while i < j:\\n # set the area to the min height * the distance between the two col\\n area = min(height[i], height[j]) * (j-i)\\n\\n # update max if necessary\\n m = max(m, area)\\n\\n\\n if mh * (j - i) <= m:\\n break\\n\\n if height[i] < height[j]:\\n i += 1\\n else:\\n j -= 1\\n return m\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n print(maxArea(case))\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n lh = len(height)\\n i, j, max_a, mh = 0, lh - 1, [], max(height)\\n\\n while i < j:\\n if height[i] > height[j]:\\n max_a.append((j - i) * height[j])\\n if mh * (j - i) <= max_a[-1]:\\n break\\n\\n j -= 1\\n else:\\n max_a.append((j - i) * height[i])\\n if mh * (j - i) <= max_a[-1]:\\n break\\n i += 1\\n\\n return max(max_a)\\n\\n\\nf = open(\\\"user.out\\\", \\\"w\\\")\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\\n\",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n lh = len(height)\\n i, j, max_a, mh = 0, lh - 1, [], max(height)\\n\\n while i < j:\\n if height[i] > height[j]:\\n max_a.append((j - i) * height[j])\\n if mh * (j - i) <= max_a[-1]:\\n break\\n\\n j -= 1\\n else:\\n max_a.append((j - i) * height[i])\\n if mh * (j - i) <= max_a[-1]:\\n break\\n i += 1\\n\\n return max(max_a)\\n\\n\\nf = open(\\\"user.out\\\", \\\"w\\\")\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\\n\",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n ans = 0\\n\\n l = 0\\n r = len(height) - 1\\n\\n while l < r:\\n m = height[l] if height[l] < height[r] else height[r]\\n area = (r - l) * m\\n ans = area if area > ans else ans\\n \\n # adjust based on the smaller\\n if height[l] < height[r]:\\n l += 1\\n else:\\n r -= 1\\n \\n return ans\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\\n\\n# class Solution:\\n# def maxArea(self, height: List[int]) -> int:\\n# left = 0\\n# right = len(height) - 1\\n# maxArea = 0\\n\\n# while left < right:\\n# currentArea = min(height[left], height[right]) * (right - left)\\n# maxArea = max(maxArea, currentArea)\\n\\n# if height[left] < height[right]:\\n# left += 1\\n# else:\\n# right -= 1\\n# return maxArea\\n\",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n # starting max\\n m = 0\\n # two pointers\\n i = 0\\n j = len(height)-1\\n # max height\\n #mh = max(height)\\n while i < j:\\n # set the area to the min height * the distance between the two col\\n smallest = height[i] if height[i] < height[j] else height[j]\\n area = smallest * (j-i)\\n\\n # update max if necessary\\n m = area if area > m else m\\n\\n\\n #if mh * (j - i) <= m:\\n # break\\n\\n if height[i] < height[j]:\\n i += 1\\n else:\\n j -= 1\\n\\n return m\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"\\ndef maxArea(height: List[int]) -> int:\\n max_h, max_a, p1, p2 = max(height), 0, 0, len(height) - 1\\n\\n for width in range(p2, -1, -1):\\n if height[p1] > height[p2]:\\n a = width * height[p2]\\n if a > max_a:\\n max_a = a\\n p2 -= 1\\n else:\\n a = width * height[p1]\\n if a > max_a:\\n max_a = a\\n p1 += 1\\n\\n return max_a\\n\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\\n\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"\\ndef maxArea( height: List[int]) -> int:\\n lh = len(height)\\n i, j, max_a = 0, lh - 1, []\\n\\n while i < j:\\n if height[i] > height[j]:\\n max_a.append((j - i) * height[j])\\n j -= 1\\n else:\\n max_a.append((j - i) * height[i])\\n i += 1\\n\\n return max(max_a)\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n answer = 0\\n n = len(height)\\n left, right = 0, len(height)-1\\n while left < right:\\n if height[left] > height[right]:\\n answer = max(answer, (right-left) * height[right])\\n right -= 1\\n else:\\n answer = max(answer, (right-left) * height[left])\\n left += 1\\n return answer\\n\\nf = open('user.out', 'w')\\ns = Solution()\\nfor case in map(loads, stdin):\\n f.write(f\\\"{s.maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n right_i = 0\\n left_i = len(height) - 1\\n capacity = max(0, (min(height[right_i], height[left_i])) * (left_i-right_i))\\n while right_i < left_i:\\n if height[right_i] > height[left_i]:\\n left_i -= 1\\n else:\\n right_i += 1\\n area = min(height[right_i], height[left_i]) * (left_i-right_i)\\n if area > capacity:\\n capacity = area\\n\\n return capacity\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for num in inputs:\\n print(str(Solution().maxArea(num)).replace(\\\" \\\", \\\"\\\"), file=f)\\nexit(0)\",\n \"runtime\": \"108\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n max_area = 0\\n start = 0\\n end = len(height) - 1\\n while start != end:\\n h = min(height[start], height[end])\\n area = h * (end - start)\\n # print(area)\\n if area > max_area:\\n max_area = area\\n if height[start] > height[end]:\\n end -= 1\\n else:\\n start += 1\\n return max_area\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"\\ndef maxArea( height: List[int]) -> int:\\n lh = len(height)\\n i, j, max_a = 0, lh - 1, 0\\n\\n while i < j:\\n if height[i] > height[j]:\\n max_a=max(((j - i) * height[j]),max_a)\\n j -= 1\\n else:\\n max_a=max(((j - i) * height[i]),max_a)\\n i += 1\\n\\n return max_a\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n n = len(height) - 1\\n start, end, ans = 0, n, 0\\n for i in range(n, 0, -1):\\n if height[start] < height[end]:\\n ans = max(ans, height[start]*i)\\n start += 1\\n else:\\n ans = max(ans, height[end]*i)\\n end -= 1\\n return ans\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n answer = 0\\n left, right = 0, len(height)-1\\n while left < right:\\n if height[left] > height[right]:\\n answer = max(answer, (right-left) * height[right])\\n right -= 1\\n else:\\n answer = max(answer, (right-left) * height[left])\\n left += 1\\n return answer\\n\\nf = open('user.out', 'w')\\ns = Solution()\\nfor case in map(loads, stdin):\\n f.write(f\\\"{s.maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n l, r = 0, len(height) - 1 \\n res = 0\\n while l < r:\\n if height[l] > height[r]:\\n res = max(res, (r - l) * height[r])\\n r -= 1 \\n else:\\n res = max(res, (r - l) * height[l])\\n l += 1 \\n return res \\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\\n\\n # left, right = 0, len(height) - 1 \\n # res = 0\\n # maxLeft, maxRight = left, right\\n # while left < right:\\n # if height[left] > height[maxLeft]:\\n # maxLeft = left\\n # if height[right] > height[maxRight]:\\n # maxRight = right\\n # if height[maxRight] > height[maxLeft]:\\n # left += 1 \\n # res = max(res, (maxRight - maxLeft) * height[maxLeft])\\n # else: #left is greater\\n # right -= 1 \\n # res = max(res, (maxRight - maxLeft) * height[maxRight])\\n # return res \\n \\n\\n\\n \",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"\\ndef maxArea(height: List[int]) -> int:\\n i = 0\\n j = len(height)-1\\n max_area = 0\\n while i < j:\\n area = min(height[i], height[j]) * (j-i)\\n if max_area < area:\\n max_area = area\\n if height[i] < height[j] :\\n i += 1\\n else:\\n j -=1\\n return max_area\\n\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"134\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n right_i = 0\\n left_i = len(height) - 1\\n capacity = max(0, (min(height[right_i], height[left_i])) * (left_i-right_i))\\n while right_i < left_i:\\n if height[right_i] > height[left_i]:\\n left_i -= 1\\n else:\\n right_i += 1\\n area = min(height[right_i], height[left_i]) * (left_i-right_i)\\n if area > capacity:\\n capacity = area\\n\\n return capacity\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for num in inputs:\\n print(str(Solution().maxArea(num)).replace(\\\" \\\", \\\"\\\"), file=f)\\nexit(0)\",\n \"runtime\": \"134\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n low, high = 0, len(height)-1\\n ans=(high-low)*min(height[low], height[high])\\n while low<high:\\n if height[low]<height[high] and height[low+1]<=height[low]:\\n low=low+1\\n elif height[low]<height[high] and height[low+1]>height[low]:\\n low=low+1\\n area=(high-low)*min(height[low], height[high])\\n if area>ans:\\n ans=area\\n elif height[high]<height[low] and height[high-1]<=height[high]:\\n high=high-1\\n elif height[high]<height[low] and height[high-1]>height[high]:\\n high=high-1\\n area=(high-low)*min(height[low], height[high])\\n if area>ans:\\n ans=area\\n elif height[high]==height[low]:\\n area=(high-low)*min(height[low], height[high])\\n if area>ans:\\n ans=area\\n low=low+1\\n high=high-1\\n area=(high-low)*min(height[low], height[high])\\n if area>ans:\\n ans=area\\n return ans\\ndef main():\\n input = sys.stdin.read().strip()\\n \\n\\n test_cases = input.splitlines()\\n \\n results = []\\n for case in test_cases:\\n \\n height = json.loads(case)\\n results.append(Solution().maxArea(height))\\n \\n\\n with open('user.out', 'w') as f:\\n for result in results:\\n f.write(f\\\"{result}\\\\n\\\")\\n\\nif __name__ == \\\"__main__\\\":\\n main()\\n exit(0)\",\n \"runtime\": \"141\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height) - 1\\n out = 0\\n while l < r:\\n out = max(out, (r - l) * min(height[l], height[r]))\\n if height[l] > height[r]:\\n r -= 1\\n else:\\n l += 1\\n \\n return out\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for height in inputs:\\n print(str(Solution().maxArea(height)).replace(\\\" \\\", \\\"\\\"), file=f)\\nexit(0)\",\n \"runtime\": \"141\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n i,j,l,r = 0, len(height)-1,height[0], height[-1]\\n maxa=0\\n while j>i:\\n a=(j-i)*min(l,r)\\n maxa=max(a,maxa)\\n if l>r:\\n j-=1\\n r=height[j]\\n else:\\n i+=1\\n l=height[i]\\n return maxa\\n\\nwith open('user.out', 'w') as f:\\n s=Solution()\\n for h in map(loads, stdin):\\n f.write(str(s.maxArea(h))+'\\\\n')\\nexit()\",\n \"runtime\": \"147\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea( height: List[int]) -> int:\\n maxwater,i,j = 0,0,len(height) - 1\\n while i < j:\\n currentarea = min(height[i],height[j]) * (j-i)\\n maxwater = max(currentarea,maxwater)\\n \\n if height[i]<height[j]:\\n i += 1\\n else:\\n j -= 1\\n return maxwater\\n f = open('user.out', 'w')\\n for case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\n f.flush()\\n exit(0)\\n\\n\\n \",\n \"runtime\": \"147\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n n = len(height)\\n max_area = float('-inf')\\n left, right = 0, n - 1\\n while left < right:\\n curr_area = min(height[left], height[right]) * (right - left)\\n max_area = max(max_area, curr_area)\\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n return max_area\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"\\ndef maxArea(height: List[int]) -> int:\\n area=0\\n a=0\\n b=len(height)-1\\n while(a<b):\\n area = max(area,min(height[a],height[b])*(b-a))\\n if height[a]>=height[b]:\\n b-=1\\n else:\\n a+=1\\n return area\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n i = 0\\n j = len(height) - 1\\n max_water = 0\\n while i < j:\\n max_water = max(max_water, min(height[i], height[j]) * (j - i))\\n if height[i] < height[j]:\\n i += 1\\n else:\\n j -= 1\\n return max_water\\n \\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n left = 0\\n right = len(height)-1\\n maxarea = 0\\n \\n\\n while left < right:\\n currarea = min(height[left], height[right]) * (right - left)\\n maxarea = max(maxarea, currarea)\\n\\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n return maxarea\\n\\nsolution = Solution()\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{solution.maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n n = len(height)\\n max_area = float('-inf')\\n left, right = 0, n - 1\\n while left < right:\\n curr_area = min(height[left], height[right]) * (right - left)\\n max_area = max(max_area, curr_area)\\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n return max_area\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"174\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, heights: List[int]) -> int:\\n l, r = 0, len(heights) - 1\\n res = 0\\n\\n while l < r:\\n res = max(res, min(heights[l], heights[r]) * (r - l))\\n if heights[l] < heights[r]:\\n l += 1\\n elif heights[r] <= heights[l]:\\n r -= 1\\n \\n return res\\n\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for num in inputs:\\n print(str(Solution().maxArea(num)).replace(\\\" \\\", \\\"\\\"), file=f)\\nexit(0)\",\n \"runtime\": \"174\"\n },\n {\n \"code\": \"\\ndef maxArea(height: List[int]) -> int:\\n def calcArea(a, b):\\n return min(height[a], height[b]) * (b-a) \\n\\n i = 0\\n j = len(height)-1\\n max_area = 0\\n max_height = max(height)\\n while i < j:\\n max_area = max(max_area, calcArea(i, j))\\n if height[i] <= height[j]:\\n i += 1\\n else:\\n j -= 1\\n\\n return max_area\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"180\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nfor height in stdin:\\n height = loads(height)\\n\\n max_water, i, j = 0, 0, len(height) -1\\n\\n while i < j:\\n max_water = max(min(height[i], height[j]) * (j - i), max_water)\\n\\n if height[i] > height[j]:\\n j -= 1\\n\\n else:\\n i += 1\\n \\n print(max_water, file=f)\\nexit(0)\\n\",\n \"runtime\": \"187\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nfor height in stdin:\\n height = loads(height)\\n\\n max_water, i, j = 0, 0, len(height) -1\\n\\n while i < j:\\n max_water = max(min(height[i], height[j]) * (j - i), max_water)\\n\\n if height[i] > height[j]:\\n j -= 1\\n\\n else:\\n i += 1\\n \\n print(max_water, file=f)\\nexit(0)\\n\",\n \"runtime\": \"193\"\n },\n {\n \"code\": \"f = open('user.out', 'w')\\nfor height in map(loads, stdin):\\n left = 0\\n right = len(height) - 1\\n maxArea = 0\\n\\n while left < right:\\n currArea = min(height[left], height[right]) * (right - left)\\n maxArea = max(maxArea, currArea)\\n\\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n print(maxArea, file=f)\\nexit(0)\",\n \"runtime\": \"200\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(height: List[int]) -> int:\\n left = 0\\n right = len(height)-1\\n max_area = 0\\n while left < right:\\n area = min(height[left],height[right])*(right-left)\\n print(area)\\n max_area = max(max_area,area)\\n if(height[left]<height[right]):\\n left+=1\\n else:\\n right-=1\\n return max_area\\n\\n f = open('user.out', 'w')\\n for case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\n f.flush()\\n exit(0)\",\n \"runtime\": \"206\"\n },\n {\n \"code\": \"def maxArea( height: List[int]) -> int:\\n left,right,max_area = 0,len(height)-1,0\\n while left <= right:\\n print(left,right)\\n area = min(height[left],height[right]) * (right - left)\\n if area > max_area:\\n max_area = area\\n \\n if height[left] <= height[right]:\\n left+=1\\n else:\\n right-=1\\n return max_area\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"213\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n n = len(height)\\n lp = 0\\n rp = n-1\\n m = 0\\n mh = max(height)\\n \\n while lp < rp:\\n area = (rp-lp)*min(height[lp],height[rp])\\n m = max(m, area)\\n\\n if mh * (rp -lp) <= m:\\n break\\n \\n if height[lp] <= height[rp]:\\n lp += 1\\n else:\\n rp -= 1\\n return m\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height)-1\\n maxArea = 0\\n\\n while l < r:\\n area = min(height[l], height[r]) * (r - l)\\n maxArea = max(area, maxArea)\\n \\n if height[l] <= height[r]:\\n h0 = height[l]\\n while l < r and height[l] <= h0:\\n l += 1\\n else:\\n h0 = height[r]\\n while l < r and height[r] <= h0:\\n r -= 1\\n \\n return maxArea\\n\",\n \"runtime\": \"226\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n # max_area = 0\\n # for i in range(len(height)-1):\\n # for j in range(1, len(height)):\\n # area = min(height[i], height[j]) * (j - i)\\n # if max_area < area:\\n # max_area = area\\n # return max_area\\n\\n max_area = 0\\n max_height = max(height)\\n left = 0\\n right = len(height) - 1\\n while left < right:\\n max_area = max(max_area, min(height[left], height[right]) * (right - left))\\n if max_height * (right - left) <= max_area:\\n break\\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n return max_area\",\n \"runtime\": \"232\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area=0\\n area=0\\n l=0\\n r=len(height)-1\\n mh=max(height)\\n while l<r:\\n area=(r-l)*min(height[l],height[r])\\n max_area = max(max_area, area)\\n if mh * (r - l) <= max_area:\\n break\\n if height[l]<height[r]:\\n l+=1\\n else:\\n r-=1\\n return max_area\",\n \"runtime\": \"232\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area = 0\\n l_index = 0\\n r_index = len(height) - 1\\n max_height = max(height)\\n while l_index < r_index:\\n curr_area = (r_index - l_index) * min(height[l_index], height[r_index])\\n if curr_area > max_area:\\n max_area = curr_area\\n if max_height * (r_index - l_index) <= max_area:\\n break\\n if height[r_index] < height[l_index]:\\n r_index-=1\\n else:\\n l_index+=1\\n return max_area\",\n \"runtime\": \"239\"\n },\n {\n \"code\": \"from typing import List\\n\\n\\nclass Solution:\\n def maxArea(self, height: List[int]) -> int:\\n left_pointer = 0\\n right_pointer = len(height) - 1 # returns index of last element\\n\\n max_height = 0\\n\\n max_possible_height = max(height)\\n\\n while left_pointer < right_pointer:\\n\\n area = min(height[left_pointer], height[right_pointer]) * (\\n right_pointer - left_pointer\\n )\\n\\n # print(area)\\n\\n if height[right_pointer] > height[left_pointer]:\\n left_pointer += 1\\n else:\\n right_pointer -= 1\\n\\n if area > max_height:\\n max_height = area\\n\\n if max_possible_height * (right_pointer - left_pointer) <= max_height:\\n break\\n\\n print(\\\"max_height : \\\", max_height)\\n return max_height\",\n \"runtime\": \"245\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n m = max(height)\\n left, right = 0, len(height)-1\\n res = 0\\n \\n while left < right:\\n leftval, rightval = height[left], height[right] \\n a = (right - left) * (min(leftval, rightval))\\n res = a if a > res else res\\n \\n if leftval < rightval:\\n left += 1\\n else:\\n right -= 1\\n \\n if res > (right - left) * m:\\n break\\n\\n return res\\n \",\n \"runtime\": \"252\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_volume = 0 \\n max_h = max(height) #max height of the container\\n size = len(height)-1 \\n i , j = 0 , size #using two pointer approach both pointers pointing at both ends\\n while i < j:\\n #This formula below will calculate the volume of the tank by\\n #choosing the minimum of two heights and multiplying it with\\n #the current lenght of tank which both the pointer points\\n curr_volume = min(height[i],height[j]) * (j-i)\\n\\n #This line below will always assign the maximum volume whenever the current\\n #volume is greater than the max_volume\\n max_volume = max(curr_volume,max_volume)\\n \\n # this condition is used to eliminate the unwanted iterations inside the loop\\n # it will check that the (max_volume) is greater than or equal to the maximum volume \\n # the tank can contain, by multiplying the maximum height with the current length\\n # as the length will only decrease overtime the maximum volume the tank can contain \\n # also decreases gradually which helps in eliminating lot of iterations\\n if max_h * (j-i) <= max_volume: \\n break # we will just return the max_volume if this condition satisfies\\n\\n if height[i] < height[j]: #we are just incrementing the 'i' if it is lesser than 'j' \\n i += 1 \\n else: #otherwise we will decrement 'j' if 'i is greater\\n j -= 1 \\n return max_volume\\n\\n \\n\\n\\n\\n \\n\\n \\n \\n\\n \",\n \"runtime\": \"259\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height) - 1\\n max_height = max(height)\\n res = 0\\n\\n while l < r:\\n width = r - l\\n vol = min(height[l], height[r]) * width\\n res = max(vol, res)\\n\\n if height[l] < height[r]:\\n l += 1\\n else:\\n r -= 1\\n\\n if width * max_height < res:\\n return res\\n\\n return res\\n\\n \\n \",\n \"runtime\": \"265\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height) - 1\\n max_area = 0\\n max_h = max(height)\\n\\n while l <= r:\\n min_h = min(height[l], height[r])\\n area = min_h * (r - l)\\n max_area = max(max_area, area)\\n\\n if max_h * (r - l) <= max_area:\\n break\\n\\n if height[l] <= height[r]:\\n l += 1\\n else:\\n r -= 1\\n \\n return max_area\",\n \"runtime\": \"272\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height)-1\\n maxW = 0\\n maxh = max(height)\\n while l<r:\\n if maxh*(r-l)<= maxW:\\n return maxW\\n maxW = max(maxW, min(height[l], height[r])*(r-l))\\n if height[l]>=height[r]:\\n r-=1\\n else:\\n l+=1\\n return maxW\",\n \"runtime\": \"278\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l = 0\\n r = len(height) - 1\\n ans = 0\\n maxx = max(height)\\n while l != r:\\n if (v:= min(height[l],height[r])*(r-l)) > ans:\\n ans = v\\n if maxx * (r - l) < ans:\\n break\\n if height[l] < height[r]:\\n l += 1\\n else:\\n r -= 1\\n return ans\",\n \"runtime\": \"285\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height) - 1\\n max_height = max(height)\\n res = 0\\n\\n while l < r:\\n width = r - l\\n vol = min(height[l], height[r]) * width\\n res = max(vol, res)\\n\\n if height[l] < height[r]:\\n l += 1\\n else:\\n r -= 1\\n\\n if width * max_height < res:\\n return res\\n\\n return res\\n\\n \\n \",\n \"runtime\": \"291\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height) - 1\\n mh = max(height)\\n m = 0\\n while l < r - (m // mh):\\n if height[l] > height[r]:\\n m = max(m, (r - l) * height[r])\\n r -= 1\\n else:\\n m = max(m, (r - l) * height[l])\\n l += 1\\n \\n return m\\n\",\n \"runtime\": \"298\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n\\n maks = 0\\n\\n a = 0\\n\\n b = len(height) - 1\\n\\n max_u = max(height)\\n\\n\\n while a < b:\\n\\n a_u = height[a]\\n\\n b_u = height[b]\\n\\n genislik = b-a\\n\\n if maks >= max_u * genislik:\\n return maks\\n\\n if a_u > b_u:\\n alan = b_u * genislik\\n b -= 1\\n else:\\n alan = a_u * genislik\\n a += 1\\n \\n if alan > maks:\\n maks = alan\\n \\n return maks\\n\\n \\n \",\n \"runtime\": \"304\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: list[int]) -> int:\\n result = 0\\n i = 0\\n j = len(height) - 1\\n max_h = max(height)\\n\\n while i != j:\\n cour = min(height[i], height[j]) * (j - i)\\n result = max(cour, result)\\n if max_h * (j - i) <= result:\\n break\\n if height[i] > height[j]:\\n j -= 1\\n else:\\n i += 1\\n return result\",\n \"runtime\": \"311\"\n },\n {\n \"code\": \"class Solution(object):\\n def maxArea(self, height: List[int]) -> int:\\n max_h, max_a, p1, p2 = max(height), 0, 0, len(height) - 1\\n for width in range(p2, -1, -1):\\n if height[p1] > height[p2]:\\n a = width * height[p2]\\n if a > max_a:\\n max_a = a\\n p2 -= 1\\n else:\\n a = width * height[p1]\\n if a > max_a:\\n max_a = a\\n p1 += 1\\n if max_h * width <= max_a:\\n break\\n return max_a\",\n \"runtime\": \"317\"\n },\n {\n \"code\": \"class Solution(object):\\n def maxArea(self, height: List[int]) -> int:\\n maxH, maxA, left, right = max(height), 0, 0, len(height) - 1\\n while left < right:\\n if height[left] < height[right]:\\n if height[left] * (right - left) > maxA:\\n maxA = height[left] * (right - left)\\n else:\\n if height[right] * (right - left) > maxA:\\n maxA = height[right] * (right - left)\\n\\n if maxH * (right - left) <= maxA:\\n break\\n\\n if height[left] < height[right]:\\n left = left + 1\\n else:\\n right = right - 1\\n return maxA\\n\",\n \"runtime\": \"324\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n\\n maks = 0\\n\\n a = 0\\n\\n b = len(height) - 1\\n\\n max_u = max(height)\\n\\n\\n while a < b:\\n\\n a_u = height[a]\\n\\n b_u = height[b]\\n\\n genislik = b-a\\n\\n if maks >= max_u * genislik:\\n return maks\\n\\n if a_u > b_u:\\n alan = b_u * genislik\\n b -= 1\\n else:\\n alan = a_u * genislik\\n a += 1\\n \\n if alan > maks:\\n maks = alan\\n \\n return maks\\n\\n \\n \",\n \"runtime\": \"330\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height) - 1\\n area = 0\\n maxheight = max(height)\\n while l < r - (area // maxheight):\\n if height[l] < height[r]:\\n area = max(area, height[l] * (r - l))\\n l += 1\\n else:\\n area = max(area, height[r] * (r - l))\\n r -= 1\\n return area\\n\",\n \"runtime\": \"337\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height) - 1\\n res = 0 \\n h = max(height)\\n\\n while l <= r:\\n res = max(res, min(height[l], height[r]) * (r - l))\\n if height[l] < height[r]:\\n l += 1\\n elif height[l] >= height[r]:\\n r -= 1\\n \\n if (r - l) * h < res:\\n break\\n \\n return res\",\n \"runtime\": \"343\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_volume = 0 \\n max_h = max(height) #max height of the container\\n size = len(height)-1 \\n i , j = 0 , size #using two pointer approach both pointers pointing at both ends\\n while i < j:\\n #This formula below will calculate the volume of the tank by\\n #choosing the minimum of two heights and multiplying it with\\n #the current lenght of tank which both the pointer points\\n curr_volume = min(height[i],height[j]) * (j-i)\\n\\n #This line below will always assign the maximum volume whenever the current\\n #volume is greater than the max_volume\\n max_volume = max(curr_volume,max_volume)\\n \\n # this condition is used to eliminate the unwanted iterations inside the loop\\n # it will check that the (max_volume) is greater than or equal to the maximum volume \\n # the tank can contain, by multiplying the maximum height with the current length\\n # as the length will only decrease overtime the maximum volume the tank can contain \\n # also decreases gradually which helps in eliminating lot of iterations\\n if max_h * (j-i) <= max_volume: \\n break # we will just return the max_volume if this condition satisfies\\n\\n if height[i] < height[j]: #we are just incrementing the 'i' if it is lesser than 'j' \\n i += 1 \\n else: #otherwise we will decrement 'j' if 'i is greater\\n j -= 1 \\n return max_volume\\n\\n \\n\\n\\n\\n \\n\\n \\n \\n\\n \",\n \"runtime\": \"350\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height) - 1\\n width = len(height) - 1\\n res = 0\\n mh = max(height)\\n while l < r:\\n if height[l] < height[r]:\\n res = max(res, width * height[l])\\n l += 1\\n else:\\n res = max(res, width * height[r])\\n r -= 1\\n if mh * width <= res:\\n break\\n width -= 1\\n\\n return res\\n\",\n \"runtime\": \"357\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l,r = 0, len(height)-1\\n maxH = max(height)\\n res = 0\\n while l<r:\\n res = max(res,min(height[l],height[r])*(r-l))\\n if res>=maxH*(r-l):\\n break\\n if height[l]<height[r]:\\n l+=1\\n else:\\n r-=1\\n return res\\n\",\n \"runtime\": \"363\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n ans = 0\\n l, r = 0, len(height) - 1\\n while l < r:\\n ans = max(ans, min(height[l], height[r]) * (r-l))\\n if height[l] <= height[r]:\\n prev = l\\n while l<r and height[prev] >= height[l]:\\n l += 1\\n else:\\n prev = r\\n while l<r and height[prev] >= height[r]:\\n r -= 1\\n return ans\",\n \"runtime\": \"363\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: list[int]) -> int:\\n result = 0\\n i = 0\\n j = len(height) - 1\\n max_h = max(height)\\n\\n while i != j:\\n cour = min(height[i], height[j]) * (j - i)\\n result = max(cour, result)\\n if max_h * (j - i) <= result:\\n break\\n if height[i] > height[j]:\\n j -= 1\\n else:\\n i += 1\\n return result\",\n \"runtime\": \"370\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: list[int]) -> int:\\n result = 0\\n i = 0\\n j = len(height) - 1\\n max_h = max(height)\\n\\n while i != j:\\n cour = min(height[i], height[j]) * (j - i)\\n result = max(cour, result)\\n if max_h * (j - i) <= result:\\n break\\n if height[i] > height[j]:\\n j -= 1\\n else:\\n i += 1\\n return result \",\n \"runtime\": \"376\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area = 0 # Initialize maximum area\\n left = 0 # Initialize left pointer\\n right = len(height) - 1 # Initialize right pointer\\n\\n while left < right: # Iterate until left pointer is less than right pointer\\n # Calculate area and update maximum area\\n max_area = max(max_area, (right - left) * min(height[left], height[right]))\\n\\n # Move the pointer with smaller height towards the other pointer\\n if height[left] <= height[right]:\\n height_left = height[left] # Store current height of left pointer\\n\\n # Move left pointer until it finds a height greater than or equal to height_left\\n while left < right and height[left] <= height_left:\\n left += 1\\n\\n else:\\n height_right = height[right] # Store current height of right pointer\\n\\n # Move right pointer until it finds a height greater than or equal to height_right\\n while left < right and height[right] <= height_right:\\n right -= 1\\n\\n return max_area # Return the maximum area\",\n \"runtime\": \"376\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area = 0\\n left = 0\\n right = len(height) - 1\\n\\n while left != right:\\n area = min(height[left], height[right]) * (right - left)\\n max_area = max(max_area, area)\\n\\n if height[left] < height[right]:\\n target = height[left]\\n left += 1\\n while height[left] < target and left < right:\\n left += 1\\n else:\\n target = height[right]\\n right -= 1\\n while height[right] < target and left < right:\\n right -= 1\\n\\n return max_area\",\n \"runtime\": \"383\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height)-1\\n ret = -1\\n maxh = max(height)\\n while (l < r):\\n lwall = height[l]\\n rwall = height[r]\\n ret = max(ret, min(lwall, rwall) * (r-l))\\n if maxh * (r-l) <= ret: break\\n if rwall < lwall:\\n r -= 1\\n else:\\n l += 1\\n return ret\\n \",\n \"runtime\": \"389\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n i_left, i_right = 0, len(height)-1\\n max_area, max_height = 0, max(height)\\n\\n while(i_left < i_right):\\n w, h = i_right-i_left, min(height[i_right], height[i_left])\\n max_area = max(max_area, w*h)\\n\\n if max_height*w <= max_area: # max_height*w is the current theoretical maximum acheivable area, so break early if already there\\n break\\n\\n if height[i_left] < height[i_right]: # greedy approach to finding new walls. (the higher side gets to stay since it determines the upper bound of h)\\n i_left += 1\\n else:\\n i_right -= 1\\n\\n return max_area\",\n \"runtime\": \"396\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n # search inside for increasng min(left, right)\\n # assumption is the at each step, new largest can only be inside [left, right]\\n\\n # n >= 2\\n n = len(height)\\n left, right = 0, n - 1\\n\\n # def get_max(i, j):\\n # # [i, j]\\n # return min(height[i], height[j]) * abs(j + 1 - i)\\n\\n best = 0\\n \\n while(right > left):\\n hl, hr = height[left], height[right]\\n best = max(best, min(hl, hr) * (right - left))\\n if hl < hr:\\n while(left < right and height[left] <= hl):\\n left += 1\\n else:\\n while(right > left and height[right] <= hr):\\n right -= 1\\n \\n return best\\n \",\n \"runtime\": \"402\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n i_left, i_right = 0, len(height)-1\\n max_area, max_height = 0, max(height)\\n\\n while(i_left < i_right):\\n w, h = i_right-i_left, min(height[i_right], height[i_left])\\n max_area = max(max_area, w*h)\\n\\n if max_height*w <= max_area: # max_height*w is the current theoretical maximum acheivable area, so break early if already there\\n break\\n\\n if height[i_left] < height[i_right]: # greedy approach to finding new walls. (the higher side gets to stay since it determines the upper bound of h)\\n i_left += 1\\n else:\\n i_right -= 1\\n\\n return max_area\",\n \"runtime\": \"409\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n maxH = 0\\n secondmaxH = 0\\n maxIndex = 0\\n for i in range(len(height)):\\n if height[i] > maxH:\\n maxH = height[i]\\n maxIndex = i\\n\\n for i in range(len(height)):\\n if height[i] > secondmaxH and i != maxIndex:\\n secondmaxH = height[i]\\n \\n \\n water = 0\\n n = len(height)\\n left = 0\\n right = n-1\\n while left < right:\\n computedWater = min(height[left], height[right]) * (right - left)\\n if computedWater > water:\\n water = computedWater\\n if water >= secondmaxH * (right - left):\\n break\\n\\n leftHeight = height[left]\\n rightHeight = height[right]\\n if height[left] < height[right]:\\n left += 1\\n while left < right and height[left] < leftHeight:\\n left += 1\\n else:\\n right -= 1\\n while left < right and height[right] < rightHeight:\\n right -= 1\\n \\n return water\\n \",\n \"runtime\": \"415\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n res = 0\\n l, r = 0, len(height) - 1\\n max_height = max(height)\\n\\n while l < r:\\n res = max(res, min(height[l], height[r]) * (r - l))\\n\\n if height[l] < height[r]:\\n l += 1\\n elif height[r] <= height[l]:\\n r -= 1\\n\\n if max_height * (r - 1) < res:\\n break\\n \\n return res\",\n \"runtime\": \"415\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: list[int]) -> int:\\n result = 0\\n start = 0\\n end = len(height) - 1\\n max_h = max(height)\\n\\n while start != end:\\n cour = min(height[start], height[end]) * (end - start)\\n result = max(cour, result)\\n if max_h * (end - start) <= result:\\n break\\n if height[start] > height[end]:\\n end -= 1\\n else:\\n start += 1\\n return result\",\n \"runtime\": \"422\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n left, right, res, max_h = 0, len(height)-1, 0, max(height)\\n while left < right:\\n res = max(res, min(height[left],height[right])*(right-left))\\n if max_h * (right - left) < res: break\\n if height[left] < height[right]: left += 1\\n else: right -= 1\\n return res\",\n \"runtime\": \"422\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n i=res=0\\n j=len(height)-1\\n count=0\\n while(i<j):\\n while height[i]<count and i<j:\\n i+=1\\n while height[j]<count and i<j:\\n j-=1\\n if i<j and height[i]>=count and height[j]>=count:\\n if ((j-i)*count)>res:\\n res=(j-i)*count\\n count+=1\\n return res\",\n \"runtime\": \"428\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l = 0\\n r = len(height) - 1\\n m = max(height)\\n dis = 0\\n area = 0\\n while l != r:\\n if height[l] == m and height[r] == m:\\n # print(\\\"HII\\\")\\n dis = r - l\\n if area < dis * height[r]:\\n area = dis * height[r]\\n break\\n elif l == 0 and r == len(height) - 1:\\n dis = r - l\\n temp = min(height[l], height[r])\\n area = dis * (temp)\\n if temp < height[l]:\\n r -= 1\\n else:\\n l += 1\\n else:\\n dis = r - l\\n if height[l] < height[r]:\\n if area < dis * height[l]:\\n area = dis * (height[l])\\n l += 1\\n\\n elif area < dis * height[r]:\\n area = dis * (height[r])\\n r -= 1\\n else:\\n r-=1\\n\\n return area\\n\",\n \"runtime\": \"435\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n left = 0\\n right = len(height) - 1\\n maxwater = 0\\n\\n while left<right:\\n h = min(height[left], height[right])\\n maxwater = max(maxwater, h * (right-left))\\n while(height[left] <= h and left<right) :\\n left += 1\\n while(height[right] <= h and left<right) :\\n right -= 1\\n return maxwater\\n \",\n \"runtime\": \"442\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n n = len(height)\\n left = 0\\n right = n-1\\n maxHeight = max(height)\\n maxVol = 0\\n\\n while left < right:\\n curVol = min(height[right], height[left]) * (right - left)\\n\\n if curVol > maxVol:\\n maxVol = curVol\\n \\n if maxVol >= maxHeight * (right - left):\\n break\\n \\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n\\n return maxVol\\n\",\n \"runtime\": \"442\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_volume = 0\\n start = 0\\n end = len(height) - 1\\n\\n while start <= end:\\n min_ht = min(height[start], height[end])\\n max_volume = max(max_volume, min_ht*(end-start))\\n\\n while start <= end:\\n if height[start] <= min_ht:\\n start += 1\\n else:\\n break\\n \\n while end >= start:\\n if height[end] <= min_ht:\\n end -= 1\\n else:\\n break\\n \\n return max_volume\",\n \"runtime\": \"448\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n first, last, max_area = 0, len(height)-1, 0\\n while(first<last):\\n a = (last-first) * ( height[last] if height[last]<height[first] else height[first] ) \\n if a > max_area: max_area = a\\n if height[first]>height[last]: last -= 1\\n else: first += 1\\n return max_area\",\n \"runtime\": \"448\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area = 0\\n left = 0\\n right = len(height) - 1\\n\\n while left != right:\\n area = min(height[left], height[right]) * (right - left)\\n max_area = max(max_area, area)\\n\\n if height[left] < height[right]:\\n target = height[left]\\n left += 1\\n while height[left] < target and left < right:\\n left += 1\\n else:\\n target = height[right]\\n right -= 1\\n while height[right] < target and left < right:\\n right -= 1\\n\\n return max_area\",\n \"runtime\": \"455\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height) - 1\\n res = 0\\n max_l, max_r = 0, 0 # index\\n max_left, max_right = 0, 0 # max height\\n while l < r:\\n res = max(res, (max_r - max_l) * min(max_left, max_right))\\n if max_left < max_right:\\n while l < len(height) and height[l] <= max_left:\\n l += 1\\n max_left = height[l]\\n max_l = l\\n else:\\n while r > 0 and height[r] <= max_right:\\n r -= 1\\n max_right = height[r]\\n max_r = r\\n return res\\n\",\n \"runtime\": \"455\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n start = 0\\n end = len(height) - 1\\n maxVolume = 0\\n while start < end:\\n currentVolume = 0\\n if height[start] > height[end]:\\n currentVolume = height[end] * (end - start)\\n end -= 1\\n else:\\n currentVolume = height[start] * (end - start)\\n start += 1\\n if maxVolume < currentVolume:\\n maxVolume = currentVolume\\n return maxVolume\",\n \"runtime\": \"461\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, heights: List[int]) -> int:\\n def amount(l, r):\\n return (r - l) * min(heights[l], heights[r])\\n\\n left = 0\\n right = len(heights) - 1\\n res = amount(left, right)\\n\\n while left < right:\\n if heights[left] > heights[right]:\\n prev = heights[right]\\n while left < right and heights[right] <= prev:\\n right -= 1\\n else:\\n prev = heights[left]\\n while left < right and heights[left] <= prev:\\n left += 1\\n\\n res = max(res, amount(left, right))\\n \\n return res\",\n \"runtime\": \"461\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n rightPointer = len(height) - 1\\n leftPointer = 0\\n maxArea = 0\\n\\n while(leftPointer <= rightPointer):\\n tempArea = 0\\n if(height[rightPointer] > height[leftPointer]):\\n tempArea = height[leftPointer] * (rightPointer - leftPointer)\\n leftPointer += 1\\n elif(height[rightPointer] < height[leftPointer]):\\n tempArea = height[rightPointer] * (rightPointer - leftPointer)\\n rightPointer -= 1\\n else:\\n tempArea = height[rightPointer] * (rightPointer - leftPointer)\\n leftPointer += 1\\n if(maxArea < tempArea):\\n maxArea = tempArea\\n \\n return maxArea\\n\\n \",\n \"runtime\": \"468\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n left = 0 #first ptr\\n right = len(height) - 1\\n maxArea = 0\\n\\n while left < right:\\n if height[left] <= height[right]:\\n if height[left] * (right - left) > maxArea:\\n maxArea = height[left] * (right - left)\\n left += 1\\n elif height[right] < height[left]:\\n if height[right] * (right - left) > maxArea:\\n maxArea = height[right] * (right - left)\\n right -= 1\\n \\n return maxArea\\n\\n \",\n \"runtime\": \"468\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n first, last, max_area = 0, len(height)-1, 0\\n while(first<last):\\n a = (first-last if first>last else last-first) * ( height[last] if height[last]<height[first] else height[first] ) \\n if a > max_area: max_area = a\\n if height[first]>height[last]: last -= 1\\n else: first += 1\\n return max_area\",\n \"runtime\": \"474\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n first, last, max_area = 0, len(height)-1, 0\\n while(first<last):\\n a = (last-first) * ( height[last] if height[last]<height[first] else height[first] ) \\n if a > max_area: max_area = a\\n if height[first]>height[last]: last -= 1\\n else: first += 1\\n return max_area\",\n \"runtime\": \"474\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, h: List[int]) -> int:\\n area, l, r = 0, 0, len(h)-1\\n while l<r:\\n if h[l]<h[r]:\\n area = max(area,h[l]*(r-l))\\n l+=1\\n elif h[r]<h[l]:\\n area = max(area,h[r]*(r-l))\\n r-=1\\n else:\\n area = max(area,h[r]*(r-l))\\n r-=1\\n l+=1\\n return area\\n \\n \",\n \"runtime\": \"481\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n res = 0\\n l, r = 0, len(height) - 1\\n while l < r:\\n while height[l] <= height[r] and l < r:\\n res = max(height[l] * (r - l), res)\\n l += 1\\n while height[r] <= height[l] and l < r:\\n res = max(height[r] * (r - l), res)\\n r -= 1\\n return res\",\n \"runtime\": \"494\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n lptr = 0\\n rptr = len(height) - 1\\n ma = 0\\n while lptr != rptr:\\n na = (rptr - lptr) * min(height[lptr], height[rptr])\\n if na > ma:\\n ma = na\\n if height[lptr] > height[rptr]:\\n rptr -= 1\\n else:\\n lptr += 1\\n return ma\",\n \"runtime\": \"494\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n res = 0\\n l, r = 0, len(height) - 1\\n while l < r:\\n while height[l] <= height[r] and l < r:\\n res = max(height[l] * (r - l), res)\\n l += 1\\n while height[r] <= height[l] and l < r:\\n res = max(height[r] * (r - l), res)\\n r -= 1\\n return res\",\n \"runtime\": \"500\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l = 0 \\n r = len(height)-1\\n res = min(height[l],height[r]) * (r-l)\\n while l < r:\\n res = max(res,(min(height[l],height[r]) * (r-l)))\\n if height[l] > height[r]:\\n r -=1\\n elif height[l] < height[r]:\\n l += 1\\n else: \\n l += 1\\n r -= 1\\n #this part is the key\\n return res\\n \\n\",\n \"runtime\": \"500\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n area=0\\n front=0\\n back=len(height)-1\\n while (front!=back):\\n temp=min(height[front],height[back])*(back-front)\\n if temp>area:\\n area=temp\\n if height[front]>=height[back]:\\n back-=1\\n elif height[front]<height[back]:\\n front+=1\\n\\n return area\\n \",\n \"runtime\": \"507\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: list[int]) -> int:\\n array_sq = []\\n right = 0\\n left = len(height) - 1\\n while right != left:\\n sqA = min(height[right], height[left])\\n sqB = abs(left - right)\\n array_sq.append(sqA * sqB)\\n if height[right] < height[left]:\\n right += 1\\n else:\\n left -= 1\\n return max(array_sq)\\n \",\n \"runtime\": \"507\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n i = 0\\n j = len(height) -1\\n max_area = 0\\n while j>i:\\n if min(height[j],height[i]) * (j-i) > max_area:\\n max_area = min(height[j],height[i]) * (j-i)\\n print(i)\\n print(j)\\n\\n if height[i] > height[j]:\\n j -= 1\\n else:\\n i+=1\\n\\n \\n return max_area\\n \\n \",\n \"runtime\": \"513\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n i = 0\\n j = len(height)-1\\n ans = 0\\n while i < j:\\n temp = min(height[i] , height[j]) * (j-i)\\n if temp > ans:\\n ans = temp\\n if(height[i] < height[j]):\\n i += 1\\n else:\\n j -= 1\\n return ans\\n \",\n \"runtime\": \"513\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area = 0\\n l, r = 0, len(height) - 1\\n\\n while l < r:\\n curr_area = (r-l) * min(height[l], height[r])\\n max_area = max(max_area, curr_area)\\n if height[l] <= height[r]:\\n l += 1\\n else:\\n r -= 1\\n return max_area\",\n \"runtime\": \"520\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area = 0\\n l, r = 0, len(height) - 1\\n\\n while l < r:\\n max_area = max(max_area, (r - l) * min(height[l], height[r]))\\n if height[l] < height[r]: l += 1\\n else: r -= 1\\n return max_area\\n \",\n \"runtime\": \"520\"\n },\n {\n \"code\": \"class Solution:\\n \\n def maxArea(self, height: List[int]) -> int:\\n # are = height x width \\n\\n # two height will be taken \\n # y= min of height \\n # x= right -left \\n # Finally max area \\n\\n maxarea = 0\\n left, right = 0, len(height) -1\\n \\n while left < right:\\n heights = min(height[left],height[right])\\n maxarea = max(maxarea, heights*(right - left))\\n if height[left] < height[right]:\\n left+=1\\n else:\\n right-=1\\n\\n return maxarea \\n\",\n \"runtime\": \"527\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area = 0\\n left, right = 0, len(height) - 1\\n\\n while left < right:\\n y_left, y_right = height[left], height[right]\\n y = min(y_left, y_right)\\n x = right - left\\n max_area = max(x * y, max_area)\\n\\n if y_left > y_right:\\n right -= 1\\n else:\\n left += 1\\n\\n return max_area\\n\",\n \"runtime\": \"527\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area=0\\n left=0\\n right=len(height)-1\\n while left<right:\\n max_area=max(max_area,(right-left)*min(height[left],height[right]))\\n if height[left]<height[right]:\\n left+=1\\n else:\\n right-= 1\\n return max_area\\n\",\n \"runtime\": \"533\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n res=0\\n l,r=0,len(height)-1\\n while l<r:\\n area=(r-l)*min(height[l],height[r])\\n res=max(area,res)\\n\\n if height[l]<height[r]:\\n l+=1\\n else:\\n r-=1\\n return res\",\n \"runtime\": \"533\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_water = 0\\n left = 0\\n right = len(height)-1\\n while left < right:\\n left_height, right_height = height[left], height[right]\\n container_height = min(left_height, right_height)\\n water = container_height * (right - left)\\n max_water = max(water, max_water)\\n if left_height < right_height:\\n left += 1\\n else:\\n right -= 1\\n return max_water\\n \",\n \"runtime\": \"540\"\n },\n {\n \"code\": \"\\nclass Solution(object):\\n def maxArea(self, height):\\n \\\"\\\"\\\"\\n :type height: List[int]\\n :rtype: int\\n \\\"\\\"\\\"\\n \\n max_area = 0\\n left = 0\\n right = len(height) - 1\\n\\n while right > left:\\n area = (right - left) * min(height[left], height[right])\\n max_area = max(area, max_area)\\n if height[right] > height[left]:\\n left += 1\\n else:\\n right -= 1\\n \\n return max_area\",\n \"runtime\": \"540\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n left = 0\\n right = len(height) - 1\\n max_size = 0\\n while left < right:\\n size = min(height[left], height[right]) * (right - left)\\n max_size = max(max_size, size)\\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n return max_size\\n\",\n \"runtime\": \"546\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n res = 0\\n\\n l, r = 0, len(height) - 1\\n while l < r:\\n\\n if height[l] < height[r]:\\n res = max(res, min(height[l], height[r]) * (r - l ))\\n l += 1\\n else:\\n res = max(res, min(height[l], height[r]) * (r - l ))\\n r -= 1\\n return res\\n\\n\",\n \"runtime\": \"546\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, heights: List[int]) -> int:\\n l, r = 0, len(heights) - 1\\n res = 0\\n\\n while l < r:\\n res = max(res, min(heights[l], heights[r]) * (r - l))\\n if heights[l] < heights[r]:\\n l += 1\\n elif heights[r] <= heights[l]:\\n r -= 1\\n \\n return res\",\n \"runtime\": \"553\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n res = 0\\n l, r = 0, len(height) - 1\\n\\n while l < r:\\n area = min(height[l], height[r]) * (r - l)\\n res = max(res, area)\\n if height[l] < height[r]:\\n l += 1\\n else:\\n r -= 1\\n\\n return res\",\n \"runtime\": \"553\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n left = 0\\n right = len(height) - 1\\n result = 0\\n while left < right:\\n width = right - left\\n min_value = min(height[left], height[right])\\n result = max(result, width * min_value)\\n if min_value == height[left]:\\n left += 1\\n else:\\n right -= 1\\n return result\\n \",\n \"runtime\": \"559\"\n },\n {\n \"code\": \"class Solution:\\n def recMaxArea(self, height, l_idx, r_idx):\\n if l_idx >= r_idx:\\n return 0\\n curr_h20 = min(height[l_idx], height[r_idx]) * (r_idx - l_idx)\\n if height[l_idx] < height[r_idx]:\\n l_idx += 1\\n else:\\n r_idx -= 1\\n next_h20 = self.recMaxArea(height, l_idx, r_idx)\\n return max(curr_h20, next_h20)\\n\\n def maxArea(self, height: List[int]) -> int:\\n l_idx, r_idx = 0, len(height) - 1\\n return self.recMaxArea(height, l_idx, r_idx)\\n \\n \",\n \"runtime\": \"559\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":116,"string":"116"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n left, right = 0, len(height)-1\n max_area = 0\n\n while left < right:\n max_area = max(max_area, min(height[left], height[right])* (right-left))\n if height[left] < height[right]:\n left += 1\n \n else:\n right -= 1\n \n return max_area\n\nf = open('user.out', 'w')\nS = Solution()\nfor case in stdin:\n f.write(f\"{S.maxArea(json.loads(case))}\\n\")\nf.flush()\nexit(0)\n","memory":"20900"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n left, right = 0, len(height)-1\n max_area = 0\n\n while left < right:\n max_area = max(max_area, min(height[left], height[right])* (right-left))\n if height[left] < height[right]:\n left += 1\n \n else:\n right -= 1\n \n return max_area\n\nwith open('user.out', 'w') as f:\n S = Solution()\n for case in stdin:\n f.write(f\"{S.maxArea(json.loads(case))}\\n\")\nexit(0)\n","memory":"21100"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n left, right = 0, len(height)-1\n max_area = 0\n\n while left < right:\n max_area = max(max_area, min(height[left], height[right])* (right-left))\n if height[left] < height[right]:\n left += 1\n \n else:\n right -= 1\n \n return max_area\n\nwith open('user.out', 'w') as f:\n for case in stdin:\n f.write(f\"{Solution().maxArea(json.loads(case))}\\n\")\nexit(0)\n","memory":"21100"},{"code":"\ndef maxArea( height: List[int]) -> int:\n \n\n max_water = 0\n l, r = 0, len(height) - 1\n\n while l < r:\n\n max_water = max(max_water, min(height[l], height[r])*(r-l))\n\n\n if height[l] > height[r]:\n r-=1\n else:\n l+=1\n \n return max_water\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)\n ","memory":"24400"},{"code":"def maxArea(height: List[int]) -> int:\n left, right, max_water = 0, len(height) - 1, 0\n while left < right:\n area = min(height[left], height[right]) * (right - left)\n max_water = max(max_water, area)\n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n return max_water\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)\n","memory":"24500"},{"code":"def maxArea(height: List[int]) -> int:\n maxH, maxA, left, right = max(height), 0, 0, len(height) - 1\n while left < right:\n #currArea = \n #maxA = max(min(height[left], height[right]) * (right - left), maxA)\n if height[left] < height[right]:\n if height[left] * (right - left) > maxA:\n maxA = height[left] * (right - left)\n else:\n if height[right] * (right - left) > maxA:\n maxA = height[right] * (right - left)\n \n if maxH * (right - left) <= maxA:\n break\n\n if height[left] < height[right]:\n left = left + 1\n else: #if height[left] > height[right]:\n right = right - 1\n # else:\n # left = left + 1\n # right = right -1\n return maxA\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","memory":"24600"},{"code":"def maxArea(height: List[int]) -> int:\n max_area = 0\n start = 0\n end = len(height) - 1\n while start != end:\n h = min(height[start], height[end])\n area = h * (end - start)\n # print(area)\n if area > max_area:\n max_area = area\n if height[start] > height[end]:\n end -= 1\n else:\n start += 1\n return max_area\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","memory":"24700"},{"code":"class Solution:\n def maxArea(height: List[int]) -> int:\n i = 0\n j = len(height) - 1\n max_water = 0\n while i < j:\n max_water = max(max_water, min(height[i], height[j]) * (j - i))\n if height[i] < height[j]:\n i += 1\n else:\n j -= 1\n return max_water\n \n\n f = open('user.out', 'w')\n for case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\n f.flush()\n exit(0)","memory":"24700"},{"code":"class Solution:\n def maxArea(height: List[int]) -> int:\n left = 0\n right = len(height) - 1\n\n maxWater = float('-inf')\n\n while left < right:\n maxWater = max(maxWater, (min(height[left], height[right]) * (right - left)))\n\n if height[left] < height[right]:\n left += 1\n elif height[right] <= height[left]:\n right -= 1\n \n return maxWater\n \n f = open('user.out', 'w')\n for case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\n f.flush()\n exit(0)","memory":"24800"},{"code":"\ndef maxArea(height: List[int]) -> int:\n cL = 0\n cR = len(height) - 1\n maxArea = min(height[cL], height[cR]) * (cR - cL)\n while True:\n hDiff = height[cL] - height[cR]\n if hDiff <= 0:\n cL += 1\n else :\n cR -= 1\n if (cL >= cR):\n break\n maxArea = max(maxArea, min(height[cL], height[cR]) * (cR - cL))\n return maxArea\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)\n\n ","memory":"24800"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n right_i = 0\n left_i = len(height) - 1\n capacity = max(0, (min(height[right_i], height[left_i])) * (left_i-right_i))\n while right_i < left_i:\n if height[right_i] > height[left_i]:\n left_i -= 1\n else:\n right_i += 1\n area = min(height[right_i], height[left_i]) * (left_i-right_i)\n if area > capacity:\n capacity = area\n\n return capacity\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for num in inputs:\n print(str(Solution().maxArea(num)).replace(\" \", \"\"), file=f)\nexit(0)","memory":"24900"},{"code":"from typing import List\n\n\nclass Solution:\n def maxArea(self, height: List[int]) -> int:\n\n head = 0\n tail = len(height) - 1\n ans = 0\n\n while head < tail:\n # len(heights) = 10^5 so need to do something to make it faster\n ans = max(ans, min(height[head], height[tail]) * (tail - head))\n print(height[head], height[tail], head, tail, ans)\n\n if height[head] > height[tail]:\n tail -= 1\n else:\n head += 1\n # print(ans)\n return ans\n\ns = Solution()\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{s.maxArea(case)}\\n\")\nf.flush()\nexit(0)","memory":"25000"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n\n head = 0\n tail = len(height) - 1\n ans = 0\n\n while head < tail:\n # len(heights) = 10^5 so need to do something to make it faster\n ans = max(ans, min(height[head], height[tail]) * (tail - head))\n print(height[head], height[tail], head, tail, ans)\n\n if height[head] > height[tail]:\n tail -= 1\n else:\n head += 1\n # print(ans)\n return ans\n\ns = Solution()\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{s.maxArea(case)}\\n\")\nf.flush()\nexit(0)","memory":"25000"},{"code":"\ndef maxArea( height: List[int]) -> int:\n lh = len(height)\n i, j, max_a = 0, lh - 1, []\n\n while i < j:\n if height[i] > height[j]:\n max_a.append((j - i) * height[j])\n j -= 1\n else:\n max_a.append((j - i) * height[i])\n i += 1\n\n return max(max_a)\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","memory":"25300"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l,r=0,len(height)-1\n max_height=0\n while l <=r:\n width=r -l\n h_l=height[l]\n h_r=height[r]\n current_area=min(h_r,h_l)* width\n max_height=max(max_height,current_area)\n if h_l < h_r:\n l +=1\n else:\n r -=1\n return max_height\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{Solution().maxArea(case)}\\n\")\nf.flush()\nexit(0)","memory":"25500"},{"code":"def maxArea(height: List[int]) -> int:\n res = 0\n l, r = 0, len(height) - 1\n max_height = max(height)\n\n while l < r:\n res = max(res, min(height[l], height[r]) * (r - l))\n\n if height[l] < height[r]:\n l += 1\n elif height[r] <= height[l]:\n r -= 1\n\n if max_height * (r - 1) < res:\n break\n \n return res\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\nf.flush()\nexit(0)","memory":"25600"},{"code":"class Solution:\n def maxArea(height: List[int]) -> int:\n left = 0\n right = len(height)-1\n max_area = 0\n while left < right:\n area = min(height[left],height[right])*(right-left)\n print(area)\n max_area = max(max_area,area)\n if(height[left]<height[right]):\n left+=1\n else:\n right-=1\n return max_area\n\n f = open('user.out', 'w')\n for case in map(loads, stdin):\n f.write(f\"{maxArea(case)}\\n\")\n f.flush()\n exit(0)","memory":"25700"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height) - 1\n out = 0\n while l < r:\n out = max(out, (r - l) * min(height[l], height[r]))\n if height[l] > height[r]:\n r -= 1\n else:\n l += 1\n \n return out\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for height in inputs:\n print(str(Solution().maxArea(height)).replace(\" \", \"\"), file=f)\nexit(0)","memory":"25800"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n \n if height == []:\n return 0\n \n res = 0\n p1 = 0\n p2 = len(height) - 1\n\n while height != []:\n\n if height[p1] < height[p2]:\n menor = p1\n else:\n menor = p2\n\n mult = height[menor] * (p2 - p1)\n if mult > res:\n res = mult\n \n if height[p1] > height[p2]:\n height.pop(p2)\n p2 -= 1\n\n else:\n height.pop(p1)\n p2 -= 1\n\n\n return res\n","memory":"25900"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n \n if height == []:\n return 0\n \n res = 0\n p1 = 0\n p2 = len(height) - 1\n\n while height != []:\n\n if height[p1] < height[p2]:\n menor = p1\n else:\n menor = p2\n\n mult = height[menor] * (p2 - p1)\n height.pop(menor)\n p2 -= 1\n if mult > res:\n res = mult\n\n return res\n","memory":"25900"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n maxwidth = len(height)\n area = []\n for i in range(maxwidth-1):\n left = height[0]\n right = height[-1]\n ht = min(left,right)\n ar = ht *(len(height)-1)\n if left <= right: height.pop(0)\n else: height.pop(-1)\n area.append(ar)\n return(max(area))","memory":"26000"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n maxwidth = len(height)\n area = []\n for i in range(maxwidth-1):\n left = height[0]\n right = height[-1]\n #print(\"left, right\")\n #print([left,right])\n ht = min(left,right)\n print([ht,len(height)-1])\n ar = ht *(len(height)-1)\n print(ar)\n if left <= right: height.pop(0)\n else: height.pop(-1)\n area.append(ar)\n return(max(area))","memory":"26100"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n maxVolume = 0\n tempVolume = 0\n dist = 0\n lowerLine = 0\n leftMax = 0\n rightMax = 0\n for leftLine in range(len(height)-1):\n if leftMax < height[leftLine]:\n leftMax = height[leftLine]\n else:\n continue\n rightMax = 0\n for rightLine in range(len(height)-1,leftLine,-1):\n if rightMax < height[rightLine]:\n rightMax = height[rightLine]\n else:\n continue\n dist = rightLine - leftLine\n if height[leftLine] >= height[rightLine]:\n lowerLine = height[rightLine]\n else:\n lowerLine = height[leftLine]\n tempVolume = dist * lowerLine\n if tempVolume > maxVolume:\n maxVolume = tempVolume\n return maxVolume","memory":"26200"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area = 0\n while(len(height) >= 2):\n current_area = min(height[0], height[-1]) * (len(height)-1)\n if current_area > max_area:\n max_area = current_area\n\n if height[0] > height[-1]:\n height.pop()\n else:\n height.pop(0)\n\n return max_area","memory":"26300"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area = 0\n while(len(height) >= 2):\n current_area = min(height[0], height[-1]) * (len(height)-1)\n if current_area > max_area:\n max_area = current_area\n\n if height[0] > height[-1]:\n height.pop()\n else:\n height.pop(0)\n\n return max_area","memory":"26500"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_amount = 0\n while len(height) > 1:\n cur_amount = min(height[0], height[-1]) * (len(height) - 1)\n max_amount = max(max_amount, cur_amount)\n if height[0] < height[-1]:\n height.pop(0)\n else:\n height.pop(-1)\n return max_amount\n ","memory":"26600"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_amount = 0\n last_update = 0\n while len(height) > 1:\n cur_amount = min(height[0], height[-1]) * (len(height) - 1)\n max_amount = max(max_amount, cur_amount)\n if height[0] < height[-1]:\n height.pop(0)\n else:\n height.pop(-1)\n last_update += 1 \n return max_amount\n ","memory":"26600"},{"code":"class Solution:\n def maxArea(self, heights: List[int]) -> int:\n max_area = 0\n i, j = 0, len(heights) - 1\n while i < j:\n current_area = min(heights[i], heights[j]) * (j- i)\n if max_area < current_area:\n max_area = current_area\n if heights[i] < heights[j]:\n i+=1\n else:\n j-=1\n return max_area","memory":"26700"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area = 0\n left = 0\n right = len(height) - 1\n\n while left < right:\n max_area = max(max_area, (right - left) * min(height[left], height[right]))\n\n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n \n return max_area","memory":"26900"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n \n line1=0\n line2=len(height)-1\n output = (min(height[line1], height[line2])) * (line2-line1)\n curr=1\n \n while line1<line2:\n print(min(height[line1], height[line2]))\n curr= (min(height[line1], height[line2])) * (line2-line1)\n print(\"curr\", curr)\n if output < curr:\n output=curr\n if height[line1]<height[line2]:\n line1+=1\n else:\n line2-=1\n\n return output\n","memory":"27000"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n # H = [[height[i], i] for i in range(len(height))]\n # return max([min(H[i][0], H[j][0]) * (H[j][1] - H[i][1]) for i in range(len(H)) for j in range(i + 1, len(H))])\n # def seq(h):\n # for i in range(len(h)):\n # for j in range(i + 1, len(h)):\n # yield min(h[i][0], h[j][0]) * (h[j][1] - h[i][1])\n # return max(seq(H))\n area = 0\n for i in range(len(height)):\n l_position = 0\n r_position = len(height) - 1\n \n while height[l_position] < height[i]:\n l_position += 1\n while height[r_position] < height[i]:\n r_position -= 1\n area = max(area, max((i - l_position) * height[i], (r_position - i) * height[i]))\n return area","memory":"27100"},{"code":"class Solution:\n def maxArea(self, heights: List[int]) -> int:\n left = 0\n right = heights.pop()\n res = 0\n while heights:\n if left<right:\n left=heights.pop(0)\n elif left>=right:\n right = heights.pop()\n\n height = min([left, right])\n width = len(heights)+1\n res = max([height*width, res])\n\n return res","memory":"27200"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_prod = 0\n l_idx = 0\n r_idx = len(height)-1\n while l_idx < r_idx:\n l = min(height[l_idx], height[r_idx])\n b = r_idx - l_idx\n prod = l * b\n max_prod = max(max_prod, prod)\n if height[l_idx] < height[r_idx]:\n l_idx += 1\n else:\n r_idx -=1\n return max_prod","memory":"27300"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l=0\n r=len(height)-1\n res=0\n while l<r:\n d=r-l\n m=min(height[l],height[r])\n final=d*m\n if final>res:\n res=final\n elif height[l]>height[r]:\n r=r-1\n else:\n l=l+1\n return res","memory":"27400"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n start, end = 0, len(height) - 1\n ans = 0\n while start<end:\n curr_area = min(height[start], height[end]) * (end-start)\n ans = max(curr_area, ans)\n if height[start] < height[end]:\n start+=1\n else:\n end-=1\n return ans","memory":"27500"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n prefix = 0\n postfix = len(height) - 1\n result_max = 0\n\n while True:\n rasstoyanie = postfix - prefix\n dl = min(height[prefix], height[postfix])\n result_max = max(result_max, dl*rasstoyanie)\n\n if postfix - prefix == 1:\n return result_max\n\n if height[prefix] >= height[postfix]:\n postfix -= 1\n elif height[prefix] < height[postfix]:\n prefix += 1","memory":"27700"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area = 0\n left = 0\n right = len(height) - 1\n\n while left < right:\n area = min(height[left], height[right]) * (right-left)\n max_area = max(area, max_area)\n\n if height[right] > height[left]:\n left += 1\n else:\n right -= 1\n\n return max_area\n\n ","memory":"27800"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n L = 0\n R = len(height) - 1\n ans = 0\n while L < R:\n if height[L] < height[R]:\n ans = max(ans, height[L] * (R-L))\n L += 1\n else:\n ans = max(ans, height[R] * (R-L))\n R -= 1\n return ans","memory":"27800"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n maxA = 0\n left = 0\n right = len(height) - 1\n while left < right:\n area = (right - left) * min(height[left], height[right])\n maxA = max(area, maxA)\n if height[left] < height[right]:\n left += 1\n elif height[left] > height[right]:\n right -= 1\n else:\n left += 1\n right -= 1\n return maxA\n\n # maxA = 0\n # for i in range(len(height)):\n # for j in range(i+1,len(height)):\n # area = 0\n # if height[i] > height[j]:\n # area = (j-i) * height[j]\n # else:\n # area = (j-i) * height[i]\n # if area > maxA:\n # maxA = area\n # return maxA","memory":"28100"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n\n left, right = 0, len(height) - 1\n largest_area = 0\n\n while left != right:\n \n area = min(height[right], height[left]) * (right - left)\n largest_area = max(area, largest_area)\n\n if height[right] < height[left]:\n right -= 1\n else:\n left += 1\n\n return largest_area\n","memory":"28200"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n # take two pointer, the container size is the min_height(left,right) * (diff_index - 1)\n # there is local maximum and there is global maximum, for that you have to traverse upto middile\n n = len(height)\n ans = 0\n area = 0 \n left, right = 0, n-1\n while left<right:\n min_height = min(height[left],height[right])\n area = min_height * (right-left)\n #print(f\"Area: {area}, height: {min_height}, width: {right-left}\")\n ans = max(area,ans)\n #print(f\"Ans: {ans}\")\n if height[left]<height[right]:\n left += 1\n else:\n right -= 1\n return ans\n\n","memory":"28300"},{"code":"class Solution:\n def maxArea(self, height) -> int:\n maxA = x= 0\n y=len(height) -1 \n\n loop =True\n while x < y:\n tempA = min(height[x], height[y] ) * (y-x)\n if tempA > maxA :\n maxA = tempA\n \n if height[x] > height[y] :\n y-=1\n else: \n x+=1\n return (maxA)","memory":"28400"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height) - 1\n res = 0\n\n while l < r:\n res = max(res, min(height[l], height[r]) * (r - l))\n if height[l] < height[r]:\n l += 1\n elif height[r] <= height[l]:\n r -= 1\n \n return res","memory":"28500"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n p1 = 0 \n p2 = len(height) - 1\n max_area = 0\n\n while p1 < p2:\n highest = min(height[p1], height[p2])\n area = highest * (p2-p1)\n print(area)\n if area > max_area:\n max_area = area\n if height[p1] < height[p2]:\n p1 += 1\n else:\n p2 -= 1\n\n return max_area","memory":"28600"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area = 0\n left = 0\n right = len(height) - 1\n\n while left < right:\n max_area = max(max_area,(right-left) * min(height[left],height[right]))\n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n\n return max_area","memory":"28700"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n area=0\n out=0\n if len(height)==0 or len(height)==1:\n return 0\n elif len(height)==2:\n return min(height)\n for i in range(len(height)):\n s,e=0,len(height)-1\n sl,el=0,0\n while s<i:\n if height[s]>=height[i]:\n sl=abs(s-i)\n s=len(height)\n s+=1\n while e>i:\n if height[e]>=height[i]:\n el=abs(e-i)\n e= -1\n e-=1\n print(sl,el)\n if sl>el: \n area=sl*height[i]\n else: \n area=el*height[i] \n print(i,area,'\\n')\n if area>out:\n out=area\n \n\n\n\n\n return out","memory":"28800"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height) - 1\n maxArea = 0\n\n while l < r:\n area = (r - l) * min(height[l], height[r])\n maxArea = max(maxArea, area)\n\n if height[l] < height[r]:\n l += 1\n else:\n r -= 1\n \n return maxArea\n","memory":"28800"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n left = 0\n right = len(height) - 1\n area = 0\n while left < right:\n area = max(area, (right - left) * min(height[left], height[right]))\n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n return area","memory":"28900"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l = 0 \n r = len(height) - 1 \n result = 0 \n while(l < r) : \n left_v = height[l]\n right_v = height[r]\n area = (r - l) * min(left_v, right_v)\n result = max(area, result)\n if left_v < right_v: \n l += 1\n else:\n r -= 1\n\n return result","memory":"28900"},{"code":"from typing import List\n\nclass Solution:\n def maxArea(self, height: List[int]) -> int:\n low = 0\n high = len(height) - 1\n maxArea = 0\n \n while low < high:\n width = high - low\n currArea = min(height[low], height[high]) * width\n maxArea = max(maxArea, currArea)\n if height[low] < height[high]:\n low += 1\n else:\n high -= 1\n \n return maxArea\n","memory":"29000"},{"code":"class Solution:\n def getArea(self, height, left, right):\n return min(height[left], height[right]) * (right-left)\n\n def maxArea(self, height: List[int]) -> int:\n left = 0\n right = len(height)-1\n\n max_so_far = self.getArea(height, left, right)\n while left < right:\n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n max_so_far = max(max_so_far, self.getArea(height, left, right))\n\n return max_so_far","memory":"29000"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n left, right = 0, len(height) - 1\n max_area = 0\n while left < right:\n if height[left] < height[right]:\n max_area = max(max_area, height[left] * (right - left))\n left += 1\n else:\n max_area = max(max_area, height[right] * (right - left))\n right -= 1\n return max_area","memory":"29100"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n return sol_v2(height)\n\ndef sol_v1(height):\n \"\"\"\n space: O(1)\n timeL O(N^2)\n \"\"\"\n L = len(height)\n w_max = -1\n for i in range(L):\n for j in range(i + 1, L):\n w = (j - i) * min([height[i], height[j]])\n if w > w_max:\n w_max = w\n return w_max\n\ndef sol_v2(height):\n \"\"\"\n space: O(1)\n time: O(N)\n \"\"\"\n L = len(height)\n i0, i1 = 0, L - 1\n w_max = -1\n while i0 < i1:\n w = (i1 - i0) * min([height[i0], height[i1]])\n if w > w_max:\n w_max = w\n\n if height[i0] <= height[i1]:\n i0 += 1\n else:\n i1 -= 1\n\n return w_max\n\n\"\"\"\ni1 > i0\nw(i0, i1) = (i1 - i0) * min(h0, h1)\nw_ = max_ij{ w(i, j) }\n\"\"\"","memory":"29100"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area = 0\n l_index = 0\n r_index = len(height) - 1\n\n while r_index > l_index:\n curr_area = min(height[l_index], height[r_index]) * (r_index - l_index)\n max_area = max(max_area, curr_area)\n\n if height[l_index] < height[r_index]:\n l_index += 1\n\n elif height[l_index] > height[r_index]:\n r_index -= 1\n\n else:\n l_index += 1\n r_index -= 1\n\n return max_area","memory":"29200"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n \n maxarea = 0\n left = 0\n right = len(height) - 1\n \n while left < right:\n width = right - left\n maxarea = max(maxarea, min(height[left], height[right]) * width)\n if height[left] <= height[right]:\n left +=1\n else:\n right -= 1\n \n \n return maxarea\n\n \n \n \n ","memory":"29200"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n n = len(height)\n water = []\n left = 0\n right = n-1\n while left < right:\n w = right - left\n h = min(height[right],height[left])\n water.append(w*h)\n if height[left]<height[right]:\n left +=1\n else:\n right -= 1\n return max(water)\n ","memory":"29300"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n left = 0\n right = len(height) - 1\n ans = 0\n while left < right:\n ans = max(ans, min(height[left], height[right]) * (right- left))\n if height[left] <= height[right]:\n left += 1\n else:\n right -= 1\n \n return ans\n ","memory":"29300"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n i = 0\n j = len(height)-1\n A = 0\n while i < j:\n C = (j - i) * min([height[j], height[i]])\n if C > A:\n A = C\n \n if height[j] > height[i]:\n i += 1\n else:\n j -= 1\n \n \n return A\n \n \n# decision space, pick left and right endpoints\n# consider picking Lmax, does it increase or increase the area?\n# ","memory":"29400"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n maxVol = 0\n left = 0\n right = len(height) - 1\n\n while left<right:\n if (right - left) * min(height[left], height[right]) > maxVol:\n maxVol = (right - left) * min(height[left], height[right])\n if height[left] == height[right]:\n left += 1\n right -= 1\n elif height[left] < height[right]:\n left += 1\n else:\n right -=1\n return maxVol\n","memory":"29400"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n ptr_1 = 0 \n ptr_2 = len(height) - 1\n best = (ptr_2 - ptr_1) * min(height[ptr_1], height[ptr_2])\n while ptr_2 > ptr_1:\n if height[ptr_1] > height[ptr_2]:\n ptr_2 -= 1\n else:\n ptr_1 += 1\n new = (ptr_2 - ptr_1) * min(height[ptr_1], height[ptr_2])\n best = max(best, new)\n return best\n\n\n\n ","memory":"29500"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l, r = 0, len(height) - 1\n max_volume = 0\n\n while l < r:\n volume = min(height[l], height[r]) * (r - l)\n max_volume = volume if volume > max_volume else max_volume\n \n if height[l] <= height[r]:\n l += 1\n else:\n r -= 1\n \n return max_volume","memory":"29500"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n l = 0\n r = len(height)-1\n retval = 0\n\n while l < r:\n width = r - l\n length = min(height[l], height[r])\n area = width * length\n retval = max(area, retval)\n\n if height[r] >= height[l]:\n l +=1\n else:\n r -=1\n\n return retval","memory":"29600"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n max_area = 0\n left = 0\n right = len(height) - 1\n while left < right:\n max_area = max(max_area, (right - left) * min(height[left], height[right]))\n\n if height[left] < height[right]:\n left += 1\n else:\n right -= 1\n \n return max_area","memory":"29600"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n left=0\n right=len(height) -1\n MAX=0\n\n while left<right:\n area = (right - left)* min(height[left], height[right])\n MAX=max(MAX, area)\n if height[left]>height[right]:\n right -=1\n else:\n left+=1\n return MAX","memory":"29700"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n i=0\n j=len(height)-1\n #two pointer- O(n)\n final_area = 0\n while(i<j):\n length = j-i\n heightt = min(height[i], height[j])\n current_area= length*heightt\n final_area = max(current_area, final_area)\n if(height[i]<height[j]):\n i += 1\n else:\n j -= 1\n\n \n return final_area \n \n","memory":"29700"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n lp, rp = 0, len(height) - 1\n max_water = 0\n while lp < rp:\n min_height = min(height[lp], height[rp])\n max_water = max(max_water, min_height * (rp - lp))\n if height[lp] < height[rp]:\n lp += 1\n else:\n rp -= 1\n return max_water","memory":"29800"},{"code":"class Solution:\n def maxArea(self, height: List[int]) -> int:\n lptr = 0\n rptr = len(height) - 1\n ma = 0\n while lptr != rptr:\n na = (rptr - lptr) * min(height[lptr], height[rptr])\n if na > ma:\n ma = na\n if height[lptr] > height[rptr]:\n rptr -= 1\n else:\n lptr += 1\n return ma","memory":"29800"}],"string":"[\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n left, right = 0, len(height)-1\\n max_area = 0\\n\\n while left < right:\\n max_area = max(max_area, min(height[left], height[right])* (right-left))\\n if height[left] < height[right]:\\n left += 1\\n \\n else:\\n right -= 1\\n \\n return max_area\\n\\nf = open('user.out', 'w')\\nS = Solution()\\nfor case in stdin:\\n f.write(f\\\"{S.maxArea(json.loads(case))}\\\\n\\\")\\nf.flush()\\nexit(0)\\n\",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n left, right = 0, len(height)-1\\n max_area = 0\\n\\n while left < right:\\n max_area = max(max_area, min(height[left], height[right])* (right-left))\\n if height[left] < height[right]:\\n left += 1\\n \\n else:\\n right -= 1\\n \\n return max_area\\n\\nwith open('user.out', 'w') as f:\\n S = Solution()\\n for case in stdin:\\n f.write(f\\\"{S.maxArea(json.loads(case))}\\\\n\\\")\\nexit(0)\\n\",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n left, right = 0, len(height)-1\\n max_area = 0\\n\\n while left < right:\\n max_area = max(max_area, min(height[left], height[right])* (right-left))\\n if height[left] < height[right]:\\n left += 1\\n \\n else:\\n right -= 1\\n \\n return max_area\\n\\nwith open('user.out', 'w') as f:\\n for case in stdin:\\n f.write(f\\\"{Solution().maxArea(json.loads(case))}\\\\n\\\")\\nexit(0)\\n\",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"\\ndef maxArea( height: List[int]) -> int:\\n \\n\\n max_water = 0\\n l, r = 0, len(height) - 1\\n\\n while l < r:\\n\\n max_water = max(max_water, min(height[l], height[r])*(r-l))\\n\\n\\n if height[l] > height[r]:\\n r-=1\\n else:\\n l+=1\\n \\n return max_water\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\\n \",\n \"memory\": \"24400\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n left, right, max_water = 0, len(height) - 1, 0\\n while left < right:\\n area = min(height[left], height[right]) * (right - left)\\n max_water = max(max_water, area)\\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n return max_water\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\\n\",\n \"memory\": \"24500\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n maxH, maxA, left, right = max(height), 0, 0, len(height) - 1\\n while left < right:\\n #currArea = \\n #maxA = max(min(height[left], height[right]) * (right - left), maxA)\\n if height[left] < height[right]:\\n if height[left] * (right - left) > maxA:\\n maxA = height[left] * (right - left)\\n else:\\n if height[right] * (right - left) > maxA:\\n maxA = height[right] * (right - left)\\n \\n if maxH * (right - left) <= maxA:\\n break\\n\\n if height[left] < height[right]:\\n left = left + 1\\n else: #if height[left] > height[right]:\\n right = right - 1\\n # else:\\n # left = left + 1\\n # right = right -1\\n return maxA\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"memory\": \"24600\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n max_area = 0\\n start = 0\\n end = len(height) - 1\\n while start != end:\\n h = min(height[start], height[end])\\n area = h * (end - start)\\n # print(area)\\n if area > max_area:\\n max_area = area\\n if height[start] > height[end]:\\n end -= 1\\n else:\\n start += 1\\n return max_area\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"memory\": \"24700\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(height: List[int]) -> int:\\n i = 0\\n j = len(height) - 1\\n max_water = 0\\n while i < j:\\n max_water = max(max_water, min(height[i], height[j]) * (j - i))\\n if height[i] < height[j]:\\n i += 1\\n else:\\n j -= 1\\n return max_water\\n \\n\\n f = open('user.out', 'w')\\n for case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\n f.flush()\\n exit(0)\",\n \"memory\": \"24700\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(height: List[int]) -> int:\\n left = 0\\n right = len(height) - 1\\n\\n maxWater = float('-inf')\\n\\n while left < right:\\n maxWater = max(maxWater, (min(height[left], height[right]) * (right - left)))\\n\\n if height[left] < height[right]:\\n left += 1\\n elif height[right] <= height[left]:\\n right -= 1\\n \\n return maxWater\\n \\n f = open('user.out', 'w')\\n for case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\n f.flush()\\n exit(0)\",\n \"memory\": \"24800\"\n },\n {\n \"code\": \"\\ndef maxArea(height: List[int]) -> int:\\n cL = 0\\n cR = len(height) - 1\\n maxArea = min(height[cL], height[cR]) * (cR - cL)\\n while True:\\n hDiff = height[cL] - height[cR]\\n if hDiff <= 0:\\n cL += 1\\n else :\\n cR -= 1\\n if (cL >= cR):\\n break\\n maxArea = max(maxArea, min(height[cL], height[cR]) * (cR - cL))\\n return maxArea\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\\n\\n \",\n \"memory\": \"24800\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n right_i = 0\\n left_i = len(height) - 1\\n capacity = max(0, (min(height[right_i], height[left_i])) * (left_i-right_i))\\n while right_i < left_i:\\n if height[right_i] > height[left_i]:\\n left_i -= 1\\n else:\\n right_i += 1\\n area = min(height[right_i], height[left_i]) * (left_i-right_i)\\n if area > capacity:\\n capacity = area\\n\\n return capacity\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for num in inputs:\\n print(str(Solution().maxArea(num)).replace(\\\" \\\", \\\"\\\"), file=f)\\nexit(0)\",\n \"memory\": \"24900\"\n },\n {\n \"code\": \"from typing import List\\n\\n\\nclass Solution:\\n def maxArea(self, height: List[int]) -> int:\\n\\n head = 0\\n tail = len(height) - 1\\n ans = 0\\n\\n while head < tail:\\n # len(heights) = 10^5 so need to do something to make it faster\\n ans = max(ans, min(height[head], height[tail]) * (tail - head))\\n print(height[head], height[tail], head, tail, ans)\\n\\n if height[head] > height[tail]:\\n tail -= 1\\n else:\\n head += 1\\n # print(ans)\\n return ans\\n\\ns = Solution()\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{s.maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"memory\": \"25000\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n\\n head = 0\\n tail = len(height) - 1\\n ans = 0\\n\\n while head < tail:\\n # len(heights) = 10^5 so need to do something to make it faster\\n ans = max(ans, min(height[head], height[tail]) * (tail - head))\\n print(height[head], height[tail], head, tail, ans)\\n\\n if height[head] > height[tail]:\\n tail -= 1\\n else:\\n head += 1\\n # print(ans)\\n return ans\\n\\ns = Solution()\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{s.maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"memory\": \"25000\"\n },\n {\n \"code\": \"\\ndef maxArea( height: List[int]) -> int:\\n lh = len(height)\\n i, j, max_a = 0, lh - 1, []\\n\\n while i < j:\\n if height[i] > height[j]:\\n max_a.append((j - i) * height[j])\\n j -= 1\\n else:\\n max_a.append((j - i) * height[i])\\n i += 1\\n\\n return max(max_a)\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"memory\": \"25300\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l,r=0,len(height)-1\\n max_height=0\\n while l <=r:\\n width=r -l\\n h_l=height[l]\\n h_r=height[r]\\n current_area=min(h_r,h_l)* width\\n max_height=max(max_height,current_area)\\n if h_l < h_r:\\n l +=1\\n else:\\n r -=1\\n return max_height\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{Solution().maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"memory\": \"25500\"\n },\n {\n \"code\": \"def maxArea(height: List[int]) -> int:\\n res = 0\\n l, r = 0, len(height) - 1\\n max_height = max(height)\\n\\n while l < r:\\n res = max(res, min(height[l], height[r]) * (r - l))\\n\\n if height[l] < height[r]:\\n l += 1\\n elif height[r] <= height[l]:\\n r -= 1\\n\\n if max_height * (r - 1) < res:\\n break\\n \\n return res\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"memory\": \"25600\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(height: List[int]) -> int:\\n left = 0\\n right = len(height)-1\\n max_area = 0\\n while left < right:\\n area = min(height[left],height[right])*(right-left)\\n print(area)\\n max_area = max(max_area,area)\\n if(height[left]<height[right]):\\n left+=1\\n else:\\n right-=1\\n return max_area\\n\\n f = open('user.out', 'w')\\n for case in map(loads, stdin):\\n f.write(f\\\"{maxArea(case)}\\\\n\\\")\\n f.flush()\\n exit(0)\",\n \"memory\": \"25700\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height) - 1\\n out = 0\\n while l < r:\\n out = max(out, (r - l) * min(height[l], height[r]))\\n if height[l] > height[r]:\\n r -= 1\\n else:\\n l += 1\\n \\n return out\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for height in inputs:\\n print(str(Solution().maxArea(height)).replace(\\\" \\\", \\\"\\\"), file=f)\\nexit(0)\",\n \"memory\": \"25800\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n \\n if height == []:\\n return 0\\n \\n res = 0\\n p1 = 0\\n p2 = len(height) - 1\\n\\n while height != []:\\n\\n if height[p1] < height[p2]:\\n menor = p1\\n else:\\n menor = p2\\n\\n mult = height[menor] * (p2 - p1)\\n if mult > res:\\n res = mult\\n \\n if height[p1] > height[p2]:\\n height.pop(p2)\\n p2 -= 1\\n\\n else:\\n height.pop(p1)\\n p2 -= 1\\n\\n\\n return res\\n\",\n \"memory\": \"25900\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n \\n if height == []:\\n return 0\\n \\n res = 0\\n p1 = 0\\n p2 = len(height) - 1\\n\\n while height != []:\\n\\n if height[p1] < height[p2]:\\n menor = p1\\n else:\\n menor = p2\\n\\n mult = height[menor] * (p2 - p1)\\n height.pop(menor)\\n p2 -= 1\\n if mult > res:\\n res = mult\\n\\n return res\\n\",\n \"memory\": \"25900\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n maxwidth = len(height)\\n area = []\\n for i in range(maxwidth-1):\\n left = height[0]\\n right = height[-1]\\n ht = min(left,right)\\n ar = ht *(len(height)-1)\\n if left <= right: height.pop(0)\\n else: height.pop(-1)\\n area.append(ar)\\n return(max(area))\",\n \"memory\": \"26000\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n maxwidth = len(height)\\n area = []\\n for i in range(maxwidth-1):\\n left = height[0]\\n right = height[-1]\\n #print(\\\"left, right\\\")\\n #print([left,right])\\n ht = min(left,right)\\n print([ht,len(height)-1])\\n ar = ht *(len(height)-1)\\n print(ar)\\n if left <= right: height.pop(0)\\n else: height.pop(-1)\\n area.append(ar)\\n return(max(area))\",\n \"memory\": \"26100\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n maxVolume = 0\\n tempVolume = 0\\n dist = 0\\n lowerLine = 0\\n leftMax = 0\\n rightMax = 0\\n for leftLine in range(len(height)-1):\\n if leftMax < height[leftLine]:\\n leftMax = height[leftLine]\\n else:\\n continue\\n rightMax = 0\\n for rightLine in range(len(height)-1,leftLine,-1):\\n if rightMax < height[rightLine]:\\n rightMax = height[rightLine]\\n else:\\n continue\\n dist = rightLine - leftLine\\n if height[leftLine] >= height[rightLine]:\\n lowerLine = height[rightLine]\\n else:\\n lowerLine = height[leftLine]\\n tempVolume = dist * lowerLine\\n if tempVolume > maxVolume:\\n maxVolume = tempVolume\\n return maxVolume\",\n \"memory\": \"26200\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area = 0\\n while(len(height) >= 2):\\n current_area = min(height[0], height[-1]) * (len(height)-1)\\n if current_area > max_area:\\n max_area = current_area\\n\\n if height[0] > height[-1]:\\n height.pop()\\n else:\\n height.pop(0)\\n\\n return max_area\",\n \"memory\": \"26300\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area = 0\\n while(len(height) >= 2):\\n current_area = min(height[0], height[-1]) * (len(height)-1)\\n if current_area > max_area:\\n max_area = current_area\\n\\n if height[0] > height[-1]:\\n height.pop()\\n else:\\n height.pop(0)\\n\\n return max_area\",\n \"memory\": \"26500\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_amount = 0\\n while len(height) > 1:\\n cur_amount = min(height[0], height[-1]) * (len(height) - 1)\\n max_amount = max(max_amount, cur_amount)\\n if height[0] < height[-1]:\\n height.pop(0)\\n else:\\n height.pop(-1)\\n return max_amount\\n \",\n \"memory\": \"26600\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_amount = 0\\n last_update = 0\\n while len(height) > 1:\\n cur_amount = min(height[0], height[-1]) * (len(height) - 1)\\n max_amount = max(max_amount, cur_amount)\\n if height[0] < height[-1]:\\n height.pop(0)\\n else:\\n height.pop(-1)\\n last_update += 1 \\n return max_amount\\n \",\n \"memory\": \"26600\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, heights: List[int]) -> int:\\n max_area = 0\\n i, j = 0, len(heights) - 1\\n while i < j:\\n current_area = min(heights[i], heights[j]) * (j- i)\\n if max_area < current_area:\\n max_area = current_area\\n if heights[i] < heights[j]:\\n i+=1\\n else:\\n j-=1\\n return max_area\",\n \"memory\": \"26700\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area = 0\\n left = 0\\n right = len(height) - 1\\n\\n while left < right:\\n max_area = max(max_area, (right - left) * min(height[left], height[right]))\\n\\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n \\n return max_area\",\n \"memory\": \"26900\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n \\n line1=0\\n line2=len(height)-1\\n output = (min(height[line1], height[line2])) * (line2-line1)\\n curr=1\\n \\n while line1<line2:\\n print(min(height[line1], height[line2]))\\n curr= (min(height[line1], height[line2])) * (line2-line1)\\n print(\\\"curr\\\", curr)\\n if output < curr:\\n output=curr\\n if height[line1]<height[line2]:\\n line1+=1\\n else:\\n line2-=1\\n\\n return output\\n\",\n \"memory\": \"27000\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n # H = [[height[i], i] for i in range(len(height))]\\n # return max([min(H[i][0], H[j][0]) * (H[j][1] - H[i][1]) for i in range(len(H)) for j in range(i + 1, len(H))])\\n # def seq(h):\\n # for i in range(len(h)):\\n # for j in range(i + 1, len(h)):\\n # yield min(h[i][0], h[j][0]) * (h[j][1] - h[i][1])\\n # return max(seq(H))\\n area = 0\\n for i in range(len(height)):\\n l_position = 0\\n r_position = len(height) - 1\\n \\n while height[l_position] < height[i]:\\n l_position += 1\\n while height[r_position] < height[i]:\\n r_position -= 1\\n area = max(area, max((i - l_position) * height[i], (r_position - i) * height[i]))\\n return area\",\n \"memory\": \"27100\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, heights: List[int]) -> int:\\n left = 0\\n right = heights.pop()\\n res = 0\\n while heights:\\n if left<right:\\n left=heights.pop(0)\\n elif left>=right:\\n right = heights.pop()\\n\\n height = min([left, right])\\n width = len(heights)+1\\n res = max([height*width, res])\\n\\n return res\",\n \"memory\": \"27200\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_prod = 0\\n l_idx = 0\\n r_idx = len(height)-1\\n while l_idx < r_idx:\\n l = min(height[l_idx], height[r_idx])\\n b = r_idx - l_idx\\n prod = l * b\\n max_prod = max(max_prod, prod)\\n if height[l_idx] < height[r_idx]:\\n l_idx += 1\\n else:\\n r_idx -=1\\n return max_prod\",\n \"memory\": \"27300\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l=0\\n r=len(height)-1\\n res=0\\n while l<r:\\n d=r-l\\n m=min(height[l],height[r])\\n final=d*m\\n if final>res:\\n res=final\\n elif height[l]>height[r]:\\n r=r-1\\n else:\\n l=l+1\\n return res\",\n \"memory\": \"27400\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n start, end = 0, len(height) - 1\\n ans = 0\\n while start<end:\\n curr_area = min(height[start], height[end]) * (end-start)\\n ans = max(curr_area, ans)\\n if height[start] < height[end]:\\n start+=1\\n else:\\n end-=1\\n return ans\",\n \"memory\": \"27500\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n prefix = 0\\n postfix = len(height) - 1\\n result_max = 0\\n\\n while True:\\n rasstoyanie = postfix - prefix\\n dl = min(height[prefix], height[postfix])\\n result_max = max(result_max, dl*rasstoyanie)\\n\\n if postfix - prefix == 1:\\n return result_max\\n\\n if height[prefix] >= height[postfix]:\\n postfix -= 1\\n elif height[prefix] < height[postfix]:\\n prefix += 1\",\n \"memory\": \"27700\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area = 0\\n left = 0\\n right = len(height) - 1\\n\\n while left < right:\\n area = min(height[left], height[right]) * (right-left)\\n max_area = max(area, max_area)\\n\\n if height[right] > height[left]:\\n left += 1\\n else:\\n right -= 1\\n\\n return max_area\\n\\n \",\n \"memory\": \"27800\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n L = 0\\n R = len(height) - 1\\n ans = 0\\n while L < R:\\n if height[L] < height[R]:\\n ans = max(ans, height[L] * (R-L))\\n L += 1\\n else:\\n ans = max(ans, height[R] * (R-L))\\n R -= 1\\n return ans\",\n \"memory\": \"27800\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n maxA = 0\\n left = 0\\n right = len(height) - 1\\n while left < right:\\n area = (right - left) * min(height[left], height[right])\\n maxA = max(area, maxA)\\n if height[left] < height[right]:\\n left += 1\\n elif height[left] > height[right]:\\n right -= 1\\n else:\\n left += 1\\n right -= 1\\n return maxA\\n\\n # maxA = 0\\n # for i in range(len(height)):\\n # for j in range(i+1,len(height)):\\n # area = 0\\n # if height[i] > height[j]:\\n # area = (j-i) * height[j]\\n # else:\\n # area = (j-i) * height[i]\\n # if area > maxA:\\n # maxA = area\\n # return maxA\",\n \"memory\": \"28100\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n\\n left, right = 0, len(height) - 1\\n largest_area = 0\\n\\n while left != right:\\n \\n area = min(height[right], height[left]) * (right - left)\\n largest_area = max(area, largest_area)\\n\\n if height[right] < height[left]:\\n right -= 1\\n else:\\n left += 1\\n\\n return largest_area\\n\",\n \"memory\": \"28200\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n # take two pointer, the container size is the min_height(left,right) * (diff_index - 1)\\n # there is local maximum and there is global maximum, for that you have to traverse upto middile\\n n = len(height)\\n ans = 0\\n area = 0 \\n left, right = 0, n-1\\n while left<right:\\n min_height = min(height[left],height[right])\\n area = min_height * (right-left)\\n #print(f\\\"Area: {area}, height: {min_height}, width: {right-left}\\\")\\n ans = max(area,ans)\\n #print(f\\\"Ans: {ans}\\\")\\n if height[left]<height[right]:\\n left += 1\\n else:\\n right -= 1\\n return ans\\n\\n\",\n \"memory\": \"28300\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height) -> int:\\n maxA = x= 0\\n y=len(height) -1 \\n\\n loop =True\\n while x < y:\\n tempA = min(height[x], height[y] ) * (y-x)\\n if tempA > maxA :\\n maxA = tempA\\n \\n if height[x] > height[y] :\\n y-=1\\n else: \\n x+=1\\n return (maxA)\",\n \"memory\": \"28400\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height) - 1\\n res = 0\\n\\n while l < r:\\n res = max(res, min(height[l], height[r]) * (r - l))\\n if height[l] < height[r]:\\n l += 1\\n elif height[r] <= height[l]:\\n r -= 1\\n \\n return res\",\n \"memory\": \"28500\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n p1 = 0 \\n p2 = len(height) - 1\\n max_area = 0\\n\\n while p1 < p2:\\n highest = min(height[p1], height[p2])\\n area = highest * (p2-p1)\\n print(area)\\n if area > max_area:\\n max_area = area\\n if height[p1] < height[p2]:\\n p1 += 1\\n else:\\n p2 -= 1\\n\\n return max_area\",\n \"memory\": \"28600\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area = 0\\n left = 0\\n right = len(height) - 1\\n\\n while left < right:\\n max_area = max(max_area,(right-left) * min(height[left],height[right]))\\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n\\n return max_area\",\n \"memory\": \"28700\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n area=0\\n out=0\\n if len(height)==0 or len(height)==1:\\n return 0\\n elif len(height)==2:\\n return min(height)\\n for i in range(len(height)):\\n s,e=0,len(height)-1\\n sl,el=0,0\\n while s<i:\\n if height[s]>=height[i]:\\n sl=abs(s-i)\\n s=len(height)\\n s+=1\\n while e>i:\\n if height[e]>=height[i]:\\n el=abs(e-i)\\n e= -1\\n e-=1\\n print(sl,el)\\n if sl>el: \\n area=sl*height[i]\\n else: \\n area=el*height[i] \\n print(i,area,'\\\\n')\\n if area>out:\\n out=area\\n \\n\\n\\n\\n\\n return out\",\n \"memory\": \"28800\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height) - 1\\n maxArea = 0\\n\\n while l < r:\\n area = (r - l) * min(height[l], height[r])\\n maxArea = max(maxArea, area)\\n\\n if height[l] < height[r]:\\n l += 1\\n else:\\n r -= 1\\n \\n return maxArea\\n\",\n \"memory\": \"28800\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n left = 0\\n right = len(height) - 1\\n area = 0\\n while left < right:\\n area = max(area, (right - left) * min(height[left], height[right]))\\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n return area\",\n \"memory\": \"28900\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l = 0 \\n r = len(height) - 1 \\n result = 0 \\n while(l < r) : \\n left_v = height[l]\\n right_v = height[r]\\n area = (r - l) * min(left_v, right_v)\\n result = max(area, result)\\n if left_v < right_v: \\n l += 1\\n else:\\n r -= 1\\n\\n return result\",\n \"memory\": \"28900\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def maxArea(self, height: List[int]) -> int:\\n low = 0\\n high = len(height) - 1\\n maxArea = 0\\n \\n while low < high:\\n width = high - low\\n currArea = min(height[low], height[high]) * width\\n maxArea = max(maxArea, currArea)\\n if height[low] < height[high]:\\n low += 1\\n else:\\n high -= 1\\n \\n return maxArea\\n\",\n \"memory\": \"29000\"\n },\n {\n \"code\": \"class Solution:\\n def getArea(self, height, left, right):\\n return min(height[left], height[right]) * (right-left)\\n\\n def maxArea(self, height: List[int]) -> int:\\n left = 0\\n right = len(height)-1\\n\\n max_so_far = self.getArea(height, left, right)\\n while left < right:\\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n max_so_far = max(max_so_far, self.getArea(height, left, right))\\n\\n return max_so_far\",\n \"memory\": \"29000\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n left, right = 0, len(height) - 1\\n max_area = 0\\n while left < right:\\n if height[left] < height[right]:\\n max_area = max(max_area, height[left] * (right - left))\\n left += 1\\n else:\\n max_area = max(max_area, height[right] * (right - left))\\n right -= 1\\n return max_area\",\n \"memory\": \"29100\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n return sol_v2(height)\\n\\ndef sol_v1(height):\\n \\\"\\\"\\\"\\n space: O(1)\\n timeL O(N^2)\\n \\\"\\\"\\\"\\n L = len(height)\\n w_max = -1\\n for i in range(L):\\n for j in range(i + 1, L):\\n w = (j - i) * min([height[i], height[j]])\\n if w > w_max:\\n w_max = w\\n return w_max\\n\\ndef sol_v2(height):\\n \\\"\\\"\\\"\\n space: O(1)\\n time: O(N)\\n \\\"\\\"\\\"\\n L = len(height)\\n i0, i1 = 0, L - 1\\n w_max = -1\\n while i0 < i1:\\n w = (i1 - i0) * min([height[i0], height[i1]])\\n if w > w_max:\\n w_max = w\\n\\n if height[i0] <= height[i1]:\\n i0 += 1\\n else:\\n i1 -= 1\\n\\n return w_max\\n\\n\\\"\\\"\\\"\\ni1 > i0\\nw(i0, i1) = (i1 - i0) * min(h0, h1)\\nw_ = max_ij{ w(i, j) }\\n\\\"\\\"\\\"\",\n \"memory\": \"29100\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area = 0\\n l_index = 0\\n r_index = len(height) - 1\\n\\n while r_index > l_index:\\n curr_area = min(height[l_index], height[r_index]) * (r_index - l_index)\\n max_area = max(max_area, curr_area)\\n\\n if height[l_index] < height[r_index]:\\n l_index += 1\\n\\n elif height[l_index] > height[r_index]:\\n r_index -= 1\\n\\n else:\\n l_index += 1\\n r_index -= 1\\n\\n return max_area\",\n \"memory\": \"29200\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n \\n maxarea = 0\\n left = 0\\n right = len(height) - 1\\n \\n while left < right:\\n width = right - left\\n maxarea = max(maxarea, min(height[left], height[right]) * width)\\n if height[left] <= height[right]:\\n left +=1\\n else:\\n right -= 1\\n \\n \\n return maxarea\\n\\n \\n \\n \\n \",\n \"memory\": \"29200\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n n = len(height)\\n water = []\\n left = 0\\n right = n-1\\n while left < right:\\n w = right - left\\n h = min(height[right],height[left])\\n water.append(w*h)\\n if height[left]<height[right]:\\n left +=1\\n else:\\n right -= 1\\n return max(water)\\n \",\n \"memory\": \"29300\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n left = 0\\n right = len(height) - 1\\n ans = 0\\n while left < right:\\n ans = max(ans, min(height[left], height[right]) * (right- left))\\n if height[left] <= height[right]:\\n left += 1\\n else:\\n right -= 1\\n \\n return ans\\n \",\n \"memory\": \"29300\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n i = 0\\n j = len(height)-1\\n A = 0\\n while i < j:\\n C = (j - i) * min([height[j], height[i]])\\n if C > A:\\n A = C\\n \\n if height[j] > height[i]:\\n i += 1\\n else:\\n j -= 1\\n \\n \\n return A\\n \\n \\n# decision space, pick left and right endpoints\\n# consider picking Lmax, does it increase or increase the area?\\n# \",\n \"memory\": \"29400\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n maxVol = 0\\n left = 0\\n right = len(height) - 1\\n\\n while left<right:\\n if (right - left) * min(height[left], height[right]) > maxVol:\\n maxVol = (right - left) * min(height[left], height[right])\\n if height[left] == height[right]:\\n left += 1\\n right -= 1\\n elif height[left] < height[right]:\\n left += 1\\n else:\\n right -=1\\n return maxVol\\n\",\n \"memory\": \"29400\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n ptr_1 = 0 \\n ptr_2 = len(height) - 1\\n best = (ptr_2 - ptr_1) * min(height[ptr_1], height[ptr_2])\\n while ptr_2 > ptr_1:\\n if height[ptr_1] > height[ptr_2]:\\n ptr_2 -= 1\\n else:\\n ptr_1 += 1\\n new = (ptr_2 - ptr_1) * min(height[ptr_1], height[ptr_2])\\n best = max(best, new)\\n return best\\n\\n\\n\\n \",\n \"memory\": \"29500\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l, r = 0, len(height) - 1\\n max_volume = 0\\n\\n while l < r:\\n volume = min(height[l], height[r]) * (r - l)\\n max_volume = volume if volume > max_volume else max_volume\\n \\n if height[l] <= height[r]:\\n l += 1\\n else:\\n r -= 1\\n \\n return max_volume\",\n \"memory\": \"29500\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n l = 0\\n r = len(height)-1\\n retval = 0\\n\\n while l < r:\\n width = r - l\\n length = min(height[l], height[r])\\n area = width * length\\n retval = max(area, retval)\\n\\n if height[r] >= height[l]:\\n l +=1\\n else:\\n r -=1\\n\\n return retval\",\n \"memory\": \"29600\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n max_area = 0\\n left = 0\\n right = len(height) - 1\\n while left < right:\\n max_area = max(max_area, (right - left) * min(height[left], height[right]))\\n\\n if height[left] < height[right]:\\n left += 1\\n else:\\n right -= 1\\n \\n return max_area\",\n \"memory\": \"29600\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n left=0\\n right=len(height) -1\\n MAX=0\\n\\n while left<right:\\n area = (right - left)* min(height[left], height[right])\\n MAX=max(MAX, area)\\n if height[left]>height[right]:\\n right -=1\\n else:\\n left+=1\\n return MAX\",\n \"memory\": \"29700\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n i=0\\n j=len(height)-1\\n #two pointer- O(n)\\n final_area = 0\\n while(i<j):\\n length = j-i\\n heightt = min(height[i], height[j])\\n current_area= length*heightt\\n final_area = max(current_area, final_area)\\n if(height[i]<height[j]):\\n i += 1\\n else:\\n j -= 1\\n\\n \\n return final_area \\n \\n\",\n \"memory\": \"29700\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n lp, rp = 0, len(height) - 1\\n max_water = 0\\n while lp < rp:\\n min_height = min(height[lp], height[rp])\\n max_water = max(max_water, min_height * (rp - lp))\\n if height[lp] < height[rp]:\\n lp += 1\\n else:\\n rp -= 1\\n return max_water\",\n \"memory\": \"29800\"\n },\n {\n \"code\": \"class Solution:\\n def maxArea(self, height: List[int]) -> int:\\n lptr = 0\\n rptr = len(height) - 1\\n ma = 0\\n while lptr != rptr:\\n na = (rptr - lptr) * min(height[lptr], height[rptr])\\n if na > ma:\\n ma = na\\n if height[lptr] > height[rptr]:\\n rptr -= 1\\n else:\\n lptr += 1\\n return ma\",\n \"memory\": \"29800\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":67,"string":"67"}}},{"rowIdx":178,"cells":{"question_id":{"kind":"number","value":12,"string":"12"},"name":{"kind":"string","value":"integer-to-roman"},"content":{"kind":"string","value":"<p>Seven different symbols represent Roman numerals with the following values:</p>\n\n<table>\n\t<thead>\n\t\t<tr>\n\t\t\t<th>Symbol</th>\n\t\t\t<th>Value</th>\n\t\t</tr>\n\t</thead>\n\t<tbody>\n\t\t<tr>\n\t\t\t<td>I</td>\n\t\t\t<td>1</td>\n\t\t</tr>\n\t\t<tr>\n\t\t\t<td>V</td>\n\t\t\t<td>5</td>\n\t\t</tr>\n\t\t<tr>\n\t\t\t<td>X</td>\n\t\t\t<td>10</td>\n\t\t</tr>\n\t\t<tr>\n\t\t\t<td>L</td>\n\t\t\t<td>50</td>\n\t\t</tr>\n\t\t<tr>\n\t\t\t<td>C</td>\n\t\t\t<td>100</td>\n\t\t</tr>\n\t\t<tr>\n\t\t\t<td>D</td>\n\t\t\t<td>500</td>\n\t\t</tr>\n\t\t<tr>\n\t\t\t<td>M</td>\n\t\t\t<td>1000</td>\n\t\t</tr>\n\t</tbody>\n</table>\n\n<p>Roman numerals are formed by appending the conversions of decimal place values from highest to lowest. Converting a decimal place value into a Roman numeral has the following rules:</p>\n\n<ul>\n\t<li>If the value does not start with 4 or 9, select the symbol of the maximal value that can be subtracted from the input, append that symbol to the result, subtract its value, and convert the remainder to a Roman numeral.</li>\n\t<li>If the value starts with 4 or 9 use the <strong>subtractive form</strong> representing one symbol subtracted from the following symbol, for example, 4 is 1 (<code>I</code>) less than 5 (<code>V</code>): <code>IV</code> and 9 is 1 (<code>I</code>) less than 10 (<code>X</code>): <code>IX</code>. Only the following subtractive forms are used: 4 (<code>IV</code>), 9 (<code>IX</code>), 40 (<code>XL</code>), 90 (<code>XC</code>), 400 (<code>CD</code>) and 900 (<code>CM</code>).</li>\n\t<li>Only powers of 10 (<code>I</code>, <code>X</code>, <code>C</code>, <code>M</code>) can be appended consecutively at most 3 times to represent multiples of 10. You cannot append 5 (<code>V</code>), 50 (<code>L</code>), or 500 (<code>D</code>) multiple times. If you need to append a symbol 4 times use the <strong>subtractive form</strong>.</li>\n</ul>\n\n<p>Given an integer, convert it to a Roman numeral.</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\">num = 3749</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">"MMMDCCXLIX"</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<pre>\n3000 = MMM as 1000 (M) + 1000 (M) + 1000 (M)\n 700 = DCC as 500 (D) + 100 (C) + 100 (C)\n 40 = XL as 10 (X) less of 50 (L)\n 9 = IX as 1 (I) less of 10 (X)\nNote: 49 is not 1 (I) less of 50 (L) because the conversion is based on decimal places\n</pre>\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\">num = 58</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">"LVIII"</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<pre>\n50 = L\n 8 = VIII\n</pre>\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\">num = 1994</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">"MCMXCIV"</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<pre>\n1000 = M\n 900 = CM\n 90 = XC\n 4 = IV\n</pre>\n</div>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= num <= 3999</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":66.26837545509625,"string":"66.268375"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["hash-table","math","string"],"string":"[\n \"hash-table\",\n \"math\",\n \"string\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"15\", 0.0055], [\"18\", 0.0055], [\"19\", 0.011], [\"20\", 0.011], [\"21\", 0.0055], [\"23\", 0.0165], [\"24\", 0.0441], [\"25\", 0.0221], [\"26\", 0.0276], [\"27\", 0.1213], [\"28\", 0.1544], [\"29\", 0.1213], [\"30\", 0.3363], [\"31\", 0.5348], [\"32\", 0.6064], [\"33\", 0.5017], [\"34\", 1.0199], [\"35\", 1.3286], [\"36\", 1.4444], [\"37\", 1.3893], [\"38\", 2.2438], [\"39\", 3.0652], [\"40\", 3.3133], [\"41\", 3.181], [\"42\", 3.9749], [\"43\", 4.7798], [\"44\", 4.879], [\"45\", 4.6144], [\"46\", 5.3366], [\"47\", 5.5736], [\"48\", 5.6563], [\"49\", 5.2373], [\"50\", 5.1436], [\"51\", 5.1822], [\"52\", 4.6144], [\"53\", 4.3112], [\"54\", 3.6331], [\"55\", 2.9109], [\"56\", 2.5029], [\"57\", 2.0178], [\"58\", 1.7642], [\"59\", 1.5547], [\"60\", 0.9978], [\"61\", 0.7828]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16100\", 0.011], [\"16200\", 0.0496], [\"16300\", 0.4245], [\"16400\", 8.5065], [\"16500\", 34.1199], [\"16600\", 39.8534]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n digits =[(1000, \"M\"),\n (900,\"CM\"),(500,\"D\"),(400,\"CD\"), (100, \"C\"), \n (90, \"XC\"),(50, \"L\"),(40, \"XL\"),(10, \"X\"),\n (9, \"IX\"),(5, \"V\"),(4, \"IV\"),(1, \"I\")]\n\n roman_digits = []\n for value, symbol in digits:\n if num == 0:\n break\n count, num = divmod(num, value) #divmod 函数会返回 num 除以 value 的商和余数，count 是商，num 是余数。count 表示当前数字可以由几个 value 组成\n roman_digits.append(symbol*count)\n return \"\".join(roman_digits)\n ","runtime":"15"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n to_r = {\n 1000: 'M',\n 900: 'CM',\n 500: 'D',\n 400: 'CD',\n 100: 'C',\n 90: 'XC',\n 50: 'L',\n 40: 'XL',\n 10: 'X',\n 9: 'IX',\n 5: 'V',\n 4: 'IV',\n 1: 'I'\n }\n\n roman = ''\n\n for i in to_r:\n while i <= num:\n num -= i\n roman += to_r[i]\n\n return roman","runtime":"18"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n # Mapping of integer values to Roman numeral symbols\n roman_map = [\n (1000, \"M\"), (900, \"CM\"), (500, \"D\"), (400, \"CD\"),\n (100, \"C\"), (90, \"XC\"), (50, \"L\"), (40, \"XL\"),\n (10, \"X\"), (9, \"IX\"), (5, \"V\"), (4, \"IV\"), (1, \"I\")\n ]\n \n result = []\n \n # Iterate over each value-symbol pair in the roman_map\n for value, symbol in roman_map:\n # Append the symbol to the result as many times as possible\n while num >= value:\n result.append(symbol)\n num -= value\n \n # Join the list into a single string and return it\n return ''.join(result)\n","runtime":"19"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n\n val_to_roman=[\n (1000,'M'),(900,'CM'),(500,'D'),(400,'CD'),(100,'C'),(90,'XC'),(50,'L'),(40,'XL'),(10,'X'),(9,'IX'),(5,'V'),(4,'IV'),(1,'I')\n ]\n roman =''\n\n for value,symbol in val_to_roman:\n while num>=value:\n roman +=symbol\n num -=value\n\n return roman\n ","runtime":"20"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n rom = ''\n while num > 0:\n if num >= 1000:\n rom += 'M'\n num -= 1000\n elif num >= 900:\n rom += 'CM'\n num -= 900\n elif num >= 500:\n rom += 'D'\n num -= 500\n elif num >= 400:\n rom += 'CD'\n num -= 400\n elif num >= 100:\n rom += 'C'\n num -= 100\n elif num >= 90:\n rom += 'XC'\n num -= 90\n elif num >= 50:\n rom += 'L'\n num -= 50\n elif num >= 40:\n rom += 'XL'\n num -= 40\n elif num >= 10:\n rom += 'X'\n num -= 10\n elif num >= 9:\n rom += 'IX'\n num -= 10\n elif num >= 5:\n rom += 'V'\n num -= 5\n elif num >= 4:\n rom += 'IV'\n num -= 4\n elif num >= 1:\n rom += 'I'\n num -= 1\n return rom\n","runtime":"21"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n res = \"\"\n\n if num >= 1000:\n m_count = num // 1000\n res += \"M\" * m_count\n num -= 1000 * m_count\n\n if num // 900 == 1:\n res += \"CM\"\n num -= 900\n\n if num >= 500 and num < 1000:\n d_count = num // 500\n res += \"D\"\n num -= d_count * 500\n\n if num // 400 == 1:\n res += \"CD\"\n num -= 400\n\n if num < 500 and num >= 100:\n c_count = num // 100\n res += \"C\" * c_count\n num -= c_count * 100\n\n if num // 90 == 1:\n res += \"XC\"\n num -= 90\n\n if num < 100 and num >= 50:\n l_count = num // 50\n res += \"L\" * l_count\n num -= l_count * 50\n\n if num//40 == 1:\n res += \"XL\"\n num -= 40\n\n if num < 50 and num >= 10:\n x_count = num//10\n res += \"X\" * x_count\n num -= x_count * 10\n\n if num//9 == 1:\n res += \"IX\"\n num -= 9\n\n if num//5 == 1:\n res += \"V\"\n num -= 5\n\n if num//4 == 1:\n res += \"IV\"\n num -= 4\n\n if num < 5 and num >= 0:\n i_count = num//1\n res += \"I\" * i_count\n num -= i_count * 1\n \n return res\n \n \n \n ","runtime":"23"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n val_map={\n 1000:\"M\",\n 900:\"CM\",\n 500:\"D\",\n 400:\"CD\",\n 100:\"C\",\n 90:\"XC\",\n 50:\"L\",\n 40:\"XL\",\n 10:\"X\",\n 9:\"IX\",\n 5:\"V\",\n 4:\"IV\",\n 1:\"I\"\n }\n\n result = \"\"\n\n for value,symbol in val_map.items():\n while num>=value:\n result+=symbol\n num-=value\n return result\n ","runtime":"24"},{"code":"'''\ndigits = [\n (1000, \"M\"),\n (900, \"CM\"),\n (500, \"D\"),\n (400, \"CD\"),\n (100, \"C\"),\n (90, \"XC\"),\n (50, \"L\"),\n (40, \"XL\"),\n (10, \"X\"),\n (9, \"IX\"),\n (5, \"V\"),\n (4, \"IV\"),\n (1, \"I\"),\n ]\nclass Solution:\n def intToRoman(self, num: int) -> str:\n romval=\"\"\n for i in range(len(digits)):\n value , roman = digits[i][0] , digits[i][1]\n print(value,roman,num)\n divisor = num//value\n for j in range(divisor):\n romval += roman \n num = num - (divisor * value)\n\n print(divisor,num,romval)\n return romval\n'''\n'''\nclass Solution:\n def intToRoman(self, num: int) -> str:\n digits = [\n (1000, \"M\"),\n (900, \"CM\"),\n (500, \"D\"),\n (400, \"CD\"),\n (100, \"C\"),\n (90, \"XC\"),\n (50, \"L\"),\n (40, \"XL\"),\n (10, \"X\"),\n (9, \"IX\"),\n (5, \"V\"),\n (4, \"IV\"),\n (1, \"I\"),\n ]\n\n roman_digits = []\n for value, symbl in digits:\n if num==0:\n break\n count,num = divmod(num,value)\n print(f'{count},{num}')\n roman_digits.append(symbl*count)\n return \"\".join(roman_digits)\n\n'''\n\nclass Solution:\n def intToRoman(self,num :int) -> str :\n thousands = [\"\",'M','MM','MMM']\n hundreds=[\"\",'C','CC','CCC','CD','D','DC','DCC','DCCC','CM']\n tens=[\"\",'X',\"XX\",\"XXX\",\"XL\",\"L\",\"LX\",\"LXX\",\"LXXX\",\"XC\",]\n ones=[\"\",\"I\",\"II\",\"III\",\"IV\",\"V\",\"VI\",\"VII\",\"VIII\",\"IX\"]\n l = []\n l.append(thousands[num //1000])\n l.append(hundreds[(num%1000)//100])\n l.append(tens[(num%100)//10])\n l.append(ones[(num%10)])\n return \"\".join(l)\n","runtime":"25"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n # Mapping of integers to Roman numerals\n int_to_roman = [\n (1000, 'M'),\n (900, 'CM'),\n (500, 'D'),\n (400, 'CD'),\n (100, 'C'),\n (90, 'XC'),\n (50, 'L'),\n (40, 'XL'),\n (10, 'X'),\n (9, 'IX'),\n (5, 'V'),\n (4, 'IV'),\n (1, 'I')\n ]\n \n roman_str = \"\"\n for value, numeral in int_to_roman:\n while num >= value:\n roman_str += numeral\n num -= value\n \n return roman_str\n","runtime":"26"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n # List of Roman numeral symbols and their corresponding values\n val_to_symbol = [\n (1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'),\n (100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'),\n (10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')\n ]\n \n # Resulting Roman numeral string\n roman_numeral = \"\"\n \n # Iterate over the values and symbols\n for value, symbol in val_to_symbol:\n # Append the symbol as many times as we can subtract the value from num\n while num >= value:\n roman_numeral += symbol\n num -= value\n \n return roman_numeral\n","runtime":"27"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n romanDict = {1000: 'M', 900: 'CM', 500: 'D', 400: 'CD', 100: 'C', 90: 'XC', 50: 'L', 40: 'XL', 10: 'X', 9: 'IX', 5: 'V', 4: 'IV', 1: 'I' }\n res = \"\"\n n = num\n for key in romanDict:\n # Go through key until you can no longer loop\n while(n // key != 0):\n res = res + romanDict[key]\n n -= key\n return res\n \n","runtime":"28"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n ones = [\"\",\"I\",\"II\",\"III\",\"IV\",\"V\",\"VI\",\"VII\",\"VIII\",\"IX\"]\n tens = [\"\",\"X\",\"XX\",\"XXX\",\"XL\",\"L\",\"LX\",\"LXX\",\"LXXX\",\"XC\"]\n hundreds = [\"\",\"C\",\"CC\",\"CCC\",\"CD\",\"D\",\"DC\",\"DCC\",\"DCCC\",\"CM\"]\n thousands = [\"\",\"M\",\"MM\",\"MMM\"]\n return thousands[(num//1000)] + hundreds[((num%1000)//100)] + tens[((num%100)//10)]+ones[num%10]","runtime":"29"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n mapi = {1:\"I\" , 5:\"V\" , 10:\"X\" , 50:\"L\" , 100:\"C\" , 500:\"D\" ,\n 1000:\"M\", 4:\"IV\" , 9:\"IX\" , 40:\"XL\" , 90:\"XC\",400:\"CD\",900:\"CM\"}\n res = \"\"\n for n in [1000,900,500,400,100,90,50,40,10,9,5,4,1]:\n while n<=num:\n res += mapi[n]\n num-=n\n return res\n ","runtime":"29"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n # Define the Roman numeral mappings\n value_to_symbol = [\n (1000, 'M'),\n (900, 'CM'),\n (500, 'D'),\n (400, 'CD'),\n (100, 'C'),\n (90, 'XC'),\n (50, 'L'),\n (40, 'XL'),\n (10, 'X'),\n (9, 'IX'),\n (5, 'V'),\n (4, 'IV'),\n (1, 'I')\n ]\n \n roman_numeral = ''\n \n # Convert integer to Roman numeral\n for value, symbol in value_to_symbol:\n # Determine the number of symbols to append\n while num >= value:\n roman_numeral += symbol\n num -= value\n \n return roman_numeral\n ","runtime":"30"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n value_to_symbol = [\n (1000, 'M'), \n (900, 'CM'), \n (500, 'D'), \n (400, 'CD'), \n (100, 'C'), \n (90, 'XC'),\n (50, 'L'), \n (40, 'XL'),\n (10, 'X'), \n (9, 'IX'),\n (5, 'V'), \n (4, 'IV'),\n (1, 'I')\n ]\n strings = []\n for i in range(len(value_to_symbol)):\n count = num // value_to_symbol[i][0]\n if count > 0:\n string = count * value_to_symbol[i][1]\n strings.append(string)\n num -= count * value_to_symbol[i][0]\n return ''.join(strings)","runtime":"30"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n # Creating Dictionary for Lookup\n num_map = {\n 1: \"I\",\n 5: \"V\", 4: \"IV\",\n 10: \"X\", 9: \"IX\",\n 50: \"L\", 40: \"XL\",\n 100: \"C\", 90: \"XC\",\n 500: \"D\", 400: \"CD\",\n 1000: \"M\", 900: \"CM\",\n }\n \n # Result Variable\n r = ''\n \n \n for n in [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]:\n # If n in list then add the roman value to result variable\n while n <= num:\n r += num_map[n]\n num-=n\n return r","runtime":"31"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n conv_dict = {1: 'I', 5: 'V', 10: 'X', 50: 'L', 100: 'C', 500: 'D', 1000: 'M',\n 4: 'IV', 9: 'IX', 40: 'XL', 90: 'XC', 400: 'CD', 900: 'CM'}\n\n # str_num = str(num)\n div_val = 10\n out_str = ''\n check_val = 5\n single_val = 1\n while num > 0:\n cur_val = num % div_val\n if cur_val in conv_dict.keys():\n out_str = conv_dict[cur_val] + out_str\n else:\n part_str = ''\n part_val = cur_val\n if part_val > check_val:\n part_str = conv_dict[check_val]\n part_val -= check_val\n part_val = int(part_val/single_val)\n part_str = part_str + (conv_dict[single_val] * part_val)\n \n out_str = part_str + out_str\n div_val *= 10\n check_val *= 10\n single_val *= 10\n num -= cur_val\n return out_str","runtime":"31"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n \n int_to_roman = [[1000,'M'],[900,'CM'],[500,'D'],[400,'CD'],[100,'C'],[90,'XC'],[50,'L'],[40,'XL'],[10,'X'],[9,'IX'],[5,'V'],[4,'IV'],[1,'I']]\n\n roman = ''\n\n for i in range(len(int_to_roman)):\n\n if int_to_roman[i][0] <= num:\n q = num // int_to_roman[i][0]\n roman += (int_to_roman[i][1]) * q\n num = num % int_to_roman[i][0]\n\n return roman\n","runtime":"32"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n value_to_roman = [(1000, 'M'),(900, 'CM'),(500, 'D'),(400, 'CD')\n ,(100, 'C'),(90, 'XC'),(50, 'L'),(40, 'XL'),(10, 'X')\n ,(9, 'IX'),(5, 'V'),(4, 'IV'),(1, 'I')\n ]\n roman = []\n for value, symbol in value_to_roman:\n # if num == 0:\n # break\n while num >= value:\n count, num = divmod(num, value)\n roman.append(symbol*count)\n \n return ''.join(roman)\n\n","runtime":"32"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n sysList= [[\"I\",1],[\"IV\",4],[\"V\",5],[\"IX\",9],\n [\"X\",10],[\"XL\",40],[\"L\",50],[\"XC\",90],\n [\"C\",100],[\"CD\",400],[\"D\",500],[\"CM\",900],\n [\"M\",1000] ]\n res=\"\"\n for sys, val in reversed(sysList):\n if num // val:\n count = num//val\n res +=(sys * count)\n num = num % val\n return res\n\n\n\n ","runtime":"33"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n int_to_roman = [\n (1000, \"M\"), (900, \"CM\"), (500, \"D\"), (400, \"CD\"),\n (100, \"C\"), (90, \"XC\"), (50, \"L\"), (40, \"XL\"),\n (10, \"X\"), (9, \"IX\"), (5, \"V\"), (4, \"IV\"), (1, \"I\")\n ]\n \n roman_string = \"\"\n \n for value, symbol in int_to_roman:\n while num >= value:\n roman_string += symbol\n num -= value\n \n return roman_string\n\n \n ","runtime":"33"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n result = \"\"\n\n for value in values:\n while num >= value:\n num -= value\n result += values[value]\n\n return result\n\nvalues = {\n 1000: \"M\",\n 900: \"CM\",\n 500: \"D\",\n 400: \"CD\",\n 100: \"C\",\n 90: \"XC\",\n 50: \"L\",\n 40: \"XL\",\n 10: \"X\",\n 9: \"IX\",\n 5: \"V\",\n 4: \"IV\",\n 1: \"I\",\n}\n","runtime":"34"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n\n num_map = {\n 1: \"I\",\n 5: \"V\", 4: \"IV\",\n 10: \"X\", 9: \"IX\",\n 50: \"L\", 40: \"XL\",\n 100: \"C\", 90: \"XC\",\n 500: \"D\", 400: \"CD\",\n 1000: \"M\", 900: \"CM\",\n }\n \n # Result Variable\n r = ''\n for n in [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]:\n \n while n <= num:\n num -= n\n r += num_map[n] \n return r\n\n # for n in [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]:\n # # If n in list then add the roman value to result variable\n # while n <= num:\n # r += num_map[n]\n # num-=n\n # # print(r, num)\n # return r\n\n\n\n\n","runtime":"34"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n num_map = {\n 1: \"I\",\n 5: \"V\", 4: \"IV\",\n 10: \"X\", 9: \"IX\",\n 50: \"L\", 40: \"XL\",\n 100: \"C\", 90: \"XC\",\n 500: \"D\", 400: \"CD\",\n 1000: \"M\", 900: \"CM\",\n }\n \n # Result Variable\n r = ''\n \n \n for n in [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]:\n # If n in list then add the roman value to result variable\n while n <= num:\n r += num_map[n]\n num-=n\n return r ","runtime":"35"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n # Define the Roman numeral mappings\n value_to_roman = [\n (1000, 'M'),\n (900, 'CM'),\n (500, 'D'),\n (400, 'CD'),\n (100, 'C'),\n (90, 'XC'),\n (50, 'L'),\n (40, 'XL'),\n (10, 'X'),\n (9, 'IX'),\n (5, 'V'),\n (4, 'IV'),\n (1, 'I')\n ]\n \n roman = [] # Store the Roman numeral result\n for value, symbol in value_to_roman:\n if num == 0:\n break\n # Append the symbol while the current value can be subtracted\n while num >= value:\n count, num = divmod(num, value)\n roman.append(symbol*count)\n \n return ''.join(roman)\n\n","runtime":"35"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n roman_list = []\n\n while num >= 1000:\n num -= 1000\n roman_list.append('M')\n\n if num >= 900:\n num -= 900\n roman_list.append('CM')\n\n while num >= 500:\n num -= 500\n roman_list.append('D')\n\n if num >= 400:\n num -= 400\n roman_list.append('CD')\n\n while num >= 100:\n num -= 100\n roman_list.append('C')\n\n if num >= 90:\n num -= 90\n roman_list.append('XC')\n\n while num >= 50:\n num -= 50\n roman_list.append('L')\n\n if num >= 40:\n num -= 40\n roman_list.append('XL')\n\n while num >= 10:\n num -= 10\n roman_list.append('X')\n\n if num == 9:\n num -= 9\n roman_list.append('IX')\n\n if num >= 5:\n num -= 5\n roman_list.append('V')\n\n if num == 4:\n num -= 4\n roman_list.append('IV')\n\n while num > 0:\n num -= 1\n roman_list.append('I')\n\n roman_list = ''.join(roman_list)\n\n return roman_list\n\n","runtime":"36"},{"code":"class Solution:\n def intToRoman(self, n: int) -> str:\n m = {1:\"I\",2:\"II\",3:\"III\",4:\"IV\",5:\"V\",6:\"VI\",7:\"VII\",8:\"VIII\",\n 9:\"IX\",10:\"X\",20:\"XX\",30:\"XXX\",40:\"XL\",\n 50:\"L\",60:\"LX\",70:\"LXX\",80:\"LXXX\",90:\"XC\",100:\"C\",200:\"CC\",\n 300:\"CCC\",400:\"CD\",500:\"D\",600:\"DC\",700:\"DCC\",\n 800:\"DCCC\",900:\"CM\",1000:\"M\",2000:\"MM\",3000:\"MMM\"}\n ans = \"\"\n k = 0\n while n > 0:\n dig = (n%10)*10**k\n if dig != 0:\n ans = m[dig]+ans\n n//=10\n k+=1\n return ans","runtime":"36"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n result = \"\" # Renamed variable from 'str' to 'result' to avoid conflict with the 'str' type\n \n while num > 0:\n if num >= 1000:\n k = num // 1000\n result += \"M\" * k # Add 'M' k times\n num -= 1000 * k\n \n elif num >= 900:\n result += \"CM\"\n num -= 900\n\n elif num >= 500:\n result += \"D\"\n num -= 500\n\n elif num >= 400:\n result += \"CD\"\n num -= 400\n\n elif num >= 100:\n k = num // 100\n result += \"C\" * k # Add 'C' k times\n num -= 100 * k\n\n elif num >= 90:\n result += \"XC\"\n num -= 90\n\n elif num >= 50:\n result += \"L\"\n num -= 50\n\n elif num >= 40:\n result += \"XL\"\n num -= 40\n\n elif num >= 10:\n k = num // 10\n result += \"X\" * k # Add 'X' k times\n num -= 10 * k\n\n elif num >= 9:\n result += \"IX\"\n num -= 9\n\n elif num >= 5:\n result += \"V\"\n num -= 5\n\n elif num >= 4:\n result += \"IV\"\n num -= 4\n\n else:\n result += \"I\" * num # Add 'I' num times\n num = 0\n\n return result\n\n \n\n \n ","runtime":"37"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n value_to_roman = [(1000, 'M'),(900, 'CM'),(500, 'D'),(400, 'CD')\n ,(100, 'C'),(90, 'XC'),(50, 'L'),(40, 'XL'),(10, 'X')\n ,(9, 'IX'),(5, 'V'),(4, 'IV'),(1, 'I')\n ]\n roman = []\n for value, symbol in value_to_roman:\n if num == 0:\n break\n while num >= value:\n count, num = divmod(num, value)\n roman.append(symbol*count)\n \n return ''.join(roman)\n\n","runtime":"37"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n result = \"\"\n\n for value, symbol in values.items():\n while num >= value:\n num -= value\n result += symbol\n\n return result\n\nvalues = {\n 1000: \"M\",\n 900: \"CM\",\n 500: \"D\",\n 400: \"CD\",\n 100: \"C\",\n 90: \"XC\",\n 50: \"L\",\n 40: \"XL\",\n 10: \"X\",\n 9: \"IX\",\n 5: \"V\",\n 4: \"IV\",\n 1: \"I\",\n}\n","runtime":"38"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n romanian = []\n val_to_roman = [\n (1000, \"M\"), (900, \"CM\"), (500, \"D\"), (400, \"CD\"),\n (100, \"C\"), (90, \"XC\"), (50, \"L\"), (40, \"XL\"),\n (10, \"X\"), (9, \"IX\"), (5, \"V\"), (4, \"IV\"), (1, \"I\")\n ]\n\n for value, symbol in val_to_roman:\n while num >= value: \n romanian.append(symbol)\n num -= value\n\n return ''.join(romanian)","runtime":"40"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n # Define Roman numeral symbols and their corresponding values\n roman_symbols = [\n (1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'),\n (100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'),\n (10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')\n ]\n \n roman_numeral = \"\"\n for value, symbol in roman_symbols:\n # Append the symbol to the result while reducing num by value\n while num >= value:\n roman_numeral += symbol\n num -= value\n \n return roman_numeral\n","runtime":"40"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n result = \"\"\n\n for value in values:\n while num >= value:\n num -= value\n result += values[value]\n\n return result\n\n\nvalues = {\n 1000: \"M\",\n 900: \"CM\",\n 500: \"D\",\n 400: \"CD\",\n 100: \"C\",\n 90: \"XC\",\n 50: \"L\",\n 40: \"XL\",\n 10: \"X\",\n 9: \"IX\",\n 5: \"V\",\n 4: \"IV\",\n 1: \"I\",\n}\n","runtime":"41"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n str1 = ''\n data = {\n 900 : 'CM',\n 90 : 'XC',\n 9 : 'IX',\n 400 : 'CD',\n 40 : 'XL',\n 4 : 'IV',\n 1 : 'I',\n 5 : 'V',\n 10 : 'X',\n 50 : 'L',\n 100 : 'C',\n 500 : 'D',\n 1000 : 'M'\n }\n for i in range(0, len(str(num))):\n place = int(10 ** ((len(str(num)) - 1) - i))\n y = str(num)\n x = place * int(y[i])\n\n\n if place == 1000:\n str1 += (int(x/place)) * 'M'\n\n elif x in data:\n str1 += data[x]\n\n else:\n if int(x/place) // 5 >= 1:\n s = ((int(x/place)) % 5) * place\n p = 5 * place\n str1 += str(data[p]) + str(int(s/place) * data[place])\n\n else:\n str1 += int(x / place) * (data[place])\n\n return(str1)","runtime":"41"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n\n val_to_roman = [\n (1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'),\n (100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'),\n (10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')\n ]\n roman = []\n for value, symbol in val_to_roman:\n while num >= value:\n roman.append(symbol) \n num -= value \n \n return ''.join(roman) ","runtime":"42"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n map_val = {\n 1: \"I\",\n 5: \"V\", 4: \"IV\",\n 10: \"X\", 9: \"IX\",\n 50: \"L\", 40: \"XL\",\n 100: \"C\", 90: \"XC\",\n 500: \"D\", 400: \"CD\",\n 1000: \"M\", 900: \"CM\",\n }\n\n result = \"\"\n\n \n for n in [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]:\n while n <= num:\n result += map_val[n]\n num -= n\n return result\n \n\n \n \n\n ","runtime":"42"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n if num <=0:\n return False\n sym=['M','CM','D','CD','C','XC','L','XL','X','IX','V','IV','I']\n val=[1000,900,500,400,100,90,50,40,10,9,5,4,1]\n i=0\n roman=''\n while num >0:\n for j in range(num//val[i]):\n roman +=sym[i]\n num %= val[i]\n i +=1\n return roman","runtime":"43"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n lookUp = {\n 1:'I',\n 4:'IV',\n 5:'V',\n 9:'IX',\n 10:'X',\n 40:'XL',\n 50:'L',\n 90:'XC',\n 100:'C',\n 400:'CD',\n 500:'D',\n 900:'CM',\n 1000:'M'\n }\n res=\"\"\n for key in reversed(lookUp.keys()):\n if num // key:\n res+=(lookUp[key]*(num//key))\n num=num%key\n if not num:\n break\n \n return res\n\n\n","runtime":"43"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n dic = {\n 1000: 'M',\n 900: 'CM',\n 500: 'D',\n 400: 'CD',\n 100: 'C',\n 90: 'XC',\n 50: 'L',\n 40: 'XL',\n 10: 'X',\n 9: 'IX',\n 5: 'V',\n 4: 'IV',\n 1: 'I'\n }\n n = num\n ans = ''\n while n > 0:\n for x in (dic):\n if n >= x:\n i = n//x\n n = n % x\n for j in range(i):\n ans += dic[x]\n return (ans)","runtime":"44"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n d = {1000: 'M', \n 900: 'CM', \n 500: 'D', \n 400: 'CD', \n 100: 'C', \n 90: 'XC', \n 50: 'L',\n 40:'XL',\n 10: 'X', \n 9: 'IX', \n 5: 'V', \n 4: 'IV', \n 1: 'I'}\n \n res = \"\"\n \n for i in d:\n res += (num//i) * d[i]\n num %= i\n \n return res\n ","runtime":"44"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n \n roman_numerals = [\n (\"M\", 1000), (\"CM\", 900), (\"D\", 500), (\"CD\", 400),\n (\"C\", 100), (\"XC\", 90), (\"L\", 50), (\"XL\", 40),\n (\"X\", 10), (\"IX\", 9), (\"V\", 5), (\"IV\", 4),\n (\"I\", 1)\n ]\n \n \n result = \"\"\n \n for roman, value in roman_numerals:\n \n while num >= value:\n result += roman\n num -= value \n \n return result\n","runtime":"45"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n result = \"\"\n while num > 0:\n if num >= 1000:\n num -= 1000\n result += \"M\"\n elif str(num)[0] in \"49\":\n if num >= 900:\n num -= 900\n result += \"CM\"\n elif num >= 400:\n num -= 400\n result += \"CD\"\n elif num >= 90:\n num -= 90\n result += \"XC\"\n elif num >= 40:\n num -= 40\n result += \"XL\"\n elif num >= 9:\n num -= 9\n result += \"IX\"\n elif num >= 4:\n num -= 4\n result += \"IV\"\n elif num >= 500:\n num -= 500\n result += \"D\"\n elif num >= 100:\n num -= 100\n result += \"C\"\n elif num >= 50:\n num -= 50\n result += \"L\"\n elif num >= 10:\n num -= 10\n result += \"X\"\n elif num >= 5:\n num -= 5\n result += \"V\"\n elif num >= 1:\n num -= 1\n result += \"I\"\n return result","runtime":"45"},{"code":"roman_letters = {\n 1: 'I',\n 5: 'V',\n 10: 'X',\n 50: 'L',\n 100: 'C',\n 500: 'D',\n 1000: 'M'\n }\n\ndef ret_true(position, digit):\n if digit <= 3:\n return roman_letters[position] * digit\n elif digit == 4:\n if position == 1:\n return 'IV'\n elif position == 10:\n return 'XL'\n elif position == 100:\n return 'CD'\n elif digit == 5:\n if position == 1:\n return 'V'\n elif position == 10:\n return 'L'\n elif position == 100:\n return 'D'\n elif digit in [6, 7, 8]:\n if position == 1:\n return 'V' + 'I' * (digit % 5)\n elif position == 10:\n return 'L'+ 'X' * (digit % 5)\n elif position == 100:\n return 'D'+ 'C' * (digit % 5)\n elif digit == 9:\n if position == 1:\n return 'IX'\n elif position == 10:\n return 'XC'\n elif position == 100:\n return 'CM'\n \n\nclass Solution:\n def intToRoman(self, num: int) -> str:\n digits = []\n n = num\n while n > 0:\n digits.append(n % 10)\n n = n // 10\n\n dd = []\n for i in range(len(digits)):\n dd.append([10**i, digits[i]])\n\n res = []\n print(dd)\n for i in range(len(dd)):\n res.append(ret_true(dd[i][0], dd[i][1]))\n res = res[::-1]\n return ''.join(res)","runtime":"46"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n val = [\n 1000, 900, 500, 400,\n 100, 90, 50, 40,\n 10, 9, 5, 4,\n 1\n ]\n syms = [\n \"M\", \"CM\", \"D\", \"CD\",\n \"C\", \"XC\", \"L\", \"XL\",\n \"X\", \"IX\", \"V\", \"IV\",\n \"I\"\n ]\n roman_numeral = \"\"\n i = 0\n while num > 0:\n for _ in range(num // val[i]):\n roman_numeral += syms[i]\n num -= val[i]\n i += 1\n return roman_numeral\n","runtime":"46"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n if num <=0:\n return False\n sym=['M','CM','D','CD','C','XC','L','XL','X','IX','V','IV','I']\n val=[1000,900,500,400,100,90,50,40,10,9,5,4,1]\n i=0\n roman=''\n while num >0:\n for j in range(num//val[i]):\n roman +=sym[i]\n num -= val[i]\n i +=1\n return roman","runtime":"47"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n symbols= [['M',1000],['CM',900],['D',500],['CD',400],['C',100],['XC',90],['L',50],\n ['XL',40],['X',10],['IX',9],['V',5],['IV',4],['I',1]]\n ans = \"\"\n \n for sym,value in symbols:\n res = num // value\n ans += res * (sym)\n num = num % value\n if num == 0 :\n return ans\n \n\n","runtime":"47"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n ans=\"\"\n if(num>=1000):\n n=int(num/1000)\n ans=ans+(n*\"M\")\n num=num-(1000*n)\n if(num>=500):\n n=0\n if(int(num/100)==9): #900 CM\n ans+=(\"CM\")\n num=num-(900)\n else:\n n=int(num/500)\n ans=ans+(n*\"D\")\n num=num-(500*n)\n if(num>=100):\n n=0\n n=int(num/100)\n if(n==4):\n ans=ans+(\"CD\")\n else:\n ans=ans+(n*\"C\") #100-300\n num=num-(100*n)\n if(num>=50):\n n=0\n if(int(num/10)==9):\n ans+=(\"XC\")\n num=num-(90)\n else:\n n=int(num/50)\n ans=ans+(n*\"L\")\n num=num-(50*n)\n if(num>=10):\n n=0\n n=int(num/10)\n # ans=ans+(n*\"X\")\n if(n==4):\n ans=ans+(\"XL\")\n \n else:\n ans=ans+(n*\"X\")\n num=num-(10*n)\n print(n)\n if(num>=5):\n n=0\n if(int(num/1)==9):\n ans+=(\"IX\")\n num=num-(9)\n else:\n n=int(num/5)\n ans=ans+(n*\"V\")\n num=num-(5*n)\n if(num>=1):\n n=0\n n=int(num/1)\n if(n==4):\n ans=ans+(\"IV\")\n n=0\n else:\n ans=ans+(n*\"I\")\n num=num-(1*n)\n print(n)\n return ans","runtime":"48"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n val =[1000,900,500,400,100,90,50,40,10,9,5,4,1]\n syb = [\"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\",\"V\",\"IV\",\"I\"]\n roman_num = \"\"\n i = 0\n while num > 0:\n for _ in range(num // val[i]):\n roman_num += syb[i]\n num -= val[i]\n\n i += 1\n return roman_num\n ","runtime":"48"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n valueSymbols = [(1000, 'M'), (900, 'CM'),\n (500, 'D'), (400, 'CD'),\n (100, 'C'), (90, 'XC'),\n (50, 'L'), (40, 'XL'),\n (10, 'X'), (9, 'IX'),\n (5, 'V'), (4, 'IV'),\n (1, 'I')]\n ans = []\n\n for value, symbol in valueSymbols:\n if num == 0:\n break\n count, num = divmod(num, value)\n ans.append(symbol * count)\n\n return ''.join(ans)","runtime":"49"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n # Define the Roman numeral mappings\n value_to_roman = [\n (1000, 'M'),\n (900, 'CM'),\n (500, 'D'),\n (400, 'CD'),\n (100, 'C'),\n (90, 'XC'),\n (50, 'L'),\n (40, 'XL'),\n (10, 'X'),\n (9, 'IX'),\n (5, 'V'),\n (4, 'IV'),\n (1, 'I')\n ]\n \n roman = [] # Store the Roman numeral result\n for value, symbol in value_to_roman:\n # Append the symbol while the current value can be subtracted\n while num >= value:\n roman.append(symbol)\n num -= value\n \n return ''.join(roman)\n\n","runtime":"49"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n num_str = str(num)\n res = []\n values = {'I':1, 'V':5, 'X':10, 'L':50, 'C':100, 'D':500, 'M':1000}\n values = dict(sorted(values.items(), key=lambda item: item[1] ,reverse=True))\n values_res = {'IV':4, 'IX':9, 'XL':40, 'XC':90, 'CD':400, 'CM':900}\n values_res = dict(sorted(values_res.items(), key=lambda item: item[1] ,reverse=True))\n\n while num > 0:\n num_str = str(num)\n if num_str[0] not in ['4', '9']:\n for symbol in values:\n if num - values[symbol] >= 0:\n res.append(symbol)\n num -= values[symbol]\n break\n else: # num_str[0] in ['4', '9']:\n for symbol in values_res:\n if num - values_res[symbol] >= 0:\n res.append(symbol)\n num -= values_res[symbol]\n break\n\n\n\n \n return \"\".join(res)","runtime":"50"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n roman_vals = {\n 1:'I',\n 5:'V',\n 4:'IV',\n 9:'IX',\n 10:'X',\n 40:'XL',\n 50:'L',\n 90:'XC',\n 100:'C',\n 400:'CD',\n 500:'D',\n 900:'CM',\n 1000:'M'\n }\n num_lst: list = [int(c) for c in str(num)]\n res: str = ''\n \n for i in range(len(num_lst)):\n power_val = ((10**(len(num_lst)-(i+1))))\n cur_val = num_lst[i]*power_val\n \n if cur_val in roman_vals.keys():\n res += roman_vals[cur_val]\n num_lst[i] -= 0\n else:\n while num_lst[i] != 0:\n if 5*power_val<cur_val:\n num_lst[i] -= 5\n res += roman_vals[5*power_val]\n else:\n num_lst[i] -= 1\n res += roman_vals[power_val]\n cur_val = num_lst[i]*power_val\n return res","runtime":"50"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n dictionary = {1000:'M', 900:'CM', 500:'D', 400:'CD', 100:'C', 90:'XC', 50:'L', 40:'XL', 10:'X', 9:'IX', 5:'V', 4:'IV', 1:'I'}\n ans=''\n for key, val in dictionary.items():\n while num>=key:\n ans+=val\n num-=key\n if num==0:break\n return ans","runtime":"51"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n roman_values = [(1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'),(100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'),(10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')]\n result = []\n for value, symbol in roman_values:\n while num >= value:\n result.append(symbol)\n num -= value\n return ''.join(result)\n ","runtime":"51"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n valueSymbols = [(1000, 'M'), (900, 'CM'),\n (500, 'D'), (400, 'CD'),\n (100, 'C'), (90, 'XC'),\n (50, 'L'), (40, 'XL'),\n (10, 'X'), (9, 'IX'),\n (5, 'V'), (4, 'IV'),\n (1, 'I')]\n ans=[]\n for value, symbol in valueSymbols:\n if num==0:\n break\n count , num= divmod(num,value)\n ans.append(symbol*count)\n return ''.join(ans)","runtime":"52"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n d = {1:'I',\n 4:'IV',\n 5:'V',\n 9:'IX',\n 10:'X',\n 40:'XL',\n 50:'L',\n 90:'XC',\n 100:'C',\n 400:'CD',\n 500:'D',\n 900:'CM',\n 1000:'M'\n }\n res = []\n nums = list(d.keys())[::-1]\n i = 0\n while num > 0:\n while num >= nums[i]:\n num -= nums[i]\n res.append(d[nums[i]])\n i += 1\n return ''.join(res)","runtime":"52"},{"code":"'''\nNo Brute Force\nTime: O(1) // Loop will iterate only 15 times\nSpace: O(1) // Constant auxillary space\n'''\n\nclass Solution:\n def intToRoman(self, num: int) -> str:\n dic = {1000: \"M\", 900: \"CM\", 500: \"D\", 400: \"CD\", 100: \"C\", 90: \"XC\", 50: \"L\", 40: \"XL\", 10: \"X\", 9: \"IX\", 5: \"V\", 4: \"IV\", 1: \"I\"}\n ans = ''\n for i in dic:\n ans += dic[i] * (num // i)\n num = num % i\n return ans","runtime":"53"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n dic = {\n 1000: 'M',\n 900: 'CM',\n 500: 'D',\n 400: 'CD',\n 100: 'C',\n 90: 'XC',\n 50: 'L',\n 40: 'XL',\n 10: 'X',\n 9: 'IX',\n 5: 'V',\n 4: 'IV',\n 1: 'I'\n }\n n = num\n ans = ''\n while n > 0:\n for x in (dic):\n if n >= x:\n i = n//x\n n = n % x\n \n ans += dic[x] * i\n break\n return (ans)","runtime":"53"},{"code":"class Solution:\n def intToRoman(self, number: int) -> str:\n base = {\n 1: \"I\",\n 5: \"V\",\n 10: \"X\",\n 50: \"L\",\n 100: \"C\",\n 500: \"D\",\n 1000: \"M\",\n }\n\n if number <= 0:\n return \"number can not less than or equal 0\"\n elif number == 4000:\n return \"MMMM\"\n elif number > 4000:\n return \"\"\n \n num_list = list(map(lambda x: int(x), str(number)))\n power_list = range(len(num_list)-1, -1, -1)\n zip_num_power = zip(num_list, power_list)\n roman = ''\n for num, power in zip_num_power:\n digit = 10**power\n val = num * digit\n if val > 0 and val < 5*digit:\n if val != 4*digit:\n time = int(val / digit)\n roman += base[digit]*time\n else:\n roman += base[digit]\n roman += base[5*digit] \n elif val >= 5*digit:\n if val != 9*digit:\n roman += base[5*digit]\n time = int((val-5*digit) / digit)\n roman += base[digit]*time\n else:\n roman += base[digit]\n roman += base[val+digit]\n return roman","runtime":"54"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n \n romans = {\n 1: 'I',\n 4: 'IV',\n 5: 'V',\n 9: 'IX',\n 10: 'X',\n 40: 'XL',\n 50: 'L',\n 90: 'XC',\n 100: 'C',\n 400: 'CD',\n 500: 'D',\n 900: 'CM',\n 1000: 'M'\n }\n\n multiplier = 1\n output = ''\n\n def helper(num):\n\n output = ''\n\n if num == 0:\n return ''\n\n while num not in romans:\n lastSmallestKey = 0\n lastSmallestVal = 0\n\n for k,v in romans.items():\n if k < num:\n lastSmallestKey = k\n lastSmallestVal = v\n else:\n break\n \n num -= lastSmallestKey\n output += lastSmallestVal\n\n output += romans[num]\n return output\n\n while num > 0:\n val = num % 10\n output = helper(val * multiplier) + output\n multiplier *= 10\n num //= 10\n\n return output","runtime":"54"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n res = []\n values = {'I':1, 'V':5, 'X':10, 'L':50, 'C':100, 'D':500, 'M':1000}\n values = dict(sorted(values.items(), key=lambda item: item[1] ,reverse=True))\n values_res = {'IV':4, 'IX':9, 'XL':40, 'XC':90, 'CD':400, 'CM':900}\n values_res = dict(sorted(values_res.items(), key=lambda item: item[1] ,reverse=True))\n while num > 0:\n num_str = str(num)\n if num_str[0] not in ['4', '9']:\n for symbol in values:\n if num - values[symbol] >= 0:\n res.append(symbol)\n num -= values[symbol]\n break\n else: # num_str[0] in ['4', '9']:\n for symbol in values_res:\n if num - values_res[symbol] >= 0:\n res.append(symbol)\n num -= values_res[symbol]\n break \n return \"\".join(res)","runtime":"55"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n # Creating Dictionary for Lookup\n num_map = {\n 1: \"I\",\n 5: \"V\", 4: \"IV\",\n 10: \"X\", 9: \"IX\",\n 50: \"L\", 40: \"XL\",\n 100: \"C\", 90: \"XC\",\n 500: \"D\", 400: \"CD\",\n 1000: \"M\", 900: \"CM\",\n }\n \n # Result Variable\n r = ''\n \n \n for n in [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]:\n # If n in list then add the roman value to result variable\n while n <= num:\n r += num_map[n]\n num-=n\n return r","runtime":"55"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n symbol_val = {\n 1 : \"I\",\n 5 : \"V\",\n 10 : \"X\",\n 50 : \"L\",\n 100 : \"C\",\n 500 : \"D\",\n 1000 : \"M\"\n }\n num = str(num)\n ret_str = \"\"\n for i, ch in enumerate(num):\n repeat_times = len(num) - 1 - i\n if ch == \"4\":\n key_ch = int(\"5\" + \"0\" * repeat_times)\n key_ch_minus = int(\"1\" + \"0\" * repeat_times)\n ret_str += symbol_val[key_ch_minus] + symbol_val[key_ch]\n continue\n \n if ch == \"9\":\n key_ch = int(\"10\" + \"0\" * repeat_times)\n key_ch_minus = int(\"1\" + \"0\" * repeat_times)\n ret_str += symbol_val[key_ch_minus] + symbol_val[key_ch]\n continue\n \n if ch in (\"1\", \"2\", \"3\"):\n key_ch = int(\"1\" + (\"0\" * repeat_times))\n ret_str += (symbol_val[key_ch] * int(ch))\n continue\n \n if ch == \"5\":\n key_ch = int(ch + (\"0\" * repeat_times))\n ret_str += symbol_val[key_ch]\n continue\n \n if ch in (\"6\", \"7\", \"8\"):\n key_ch = int(\"1\" + (\"0\" * repeat_times))\n key_5 = int(\"5\" + \"0\" * repeat_times)\n ret_str += symbol_val[key_5] + symbol_val[key_ch] * (int(ch) - 5) \n continue\n \n return ret_str\n","runtime":"56"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n # num = 3749\n # Check value from Highest available symbol\n \n # Maintain running result\n # Maintain output\n res = 0\n output = \"\"\n hm = (\n (1, \"I\",),\n (4, \"IV\",),\n (5, \"V\",),\n (9, \"IX\"),\n (10, \"X\"),\n (40, \"XL\"),\n (50, \"L\"),\n (90, \"XC\"),\n (100, \"C\"),\n (400, \"CD\"),\n (500, \"D\"),\n (900, \"CM\"),\n (1000, \"M\"),\n )\n\n res = \"\"\n\n for val, numeral in reversed(hm):\n if ctr := num // val:\n res += (numeral * ctr)\n num %= val \n \n return res\n","runtime":"56"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n # Strategy: While loop to coninuously apply these rules\n roman = \"\"\n int_to_roman = {\n 1000: \"M\",\n 900: \"CM\",\n 500: \"D\",\n 400: \"CD\",\n 100: \"C\", \n 90: \"XC\",\n 50: \"L\",\n 40: \"XL\",\n 10: \"X\",\n 9: \"IX\",\n 5: \"V\",\n 4: \"IV\",\n 1: \"I\",\n }\n mapping_iter = iter(int_to_roman.keys())\n while num > 0:\n value = next(mapping_iter)\n while num >= value:\n roman += int_to_roman[value]\n num -= value\n \n return roman ","runtime":"57"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n roman=\"\"\n numToLetter={\n 1000:\"M\",\n 900:\"CM\",\n 500:\"D\",\n 400:\"CD\",\n 100:\"C\",\n 90:\"XC\",\n 50:\"L\",\n 40:\"XL\",\n 10:\"X\",\n 9:\"IX\",\n 5:\"V\",\n 4:\"IV\",\n 1:\"I\"\n }\n nums=numToLetter.keys()\n for n in nums:\n if num==0:\n break\n roman+=(num//n)*numToLetter[n]\n num=num%n\n return roman\n \n\n \n\n ","runtime":"57"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n s={1:'I',5:'V',10:'X',50:'L',100:'C',500:'D',1000:'M',4:'IV',9:'IX',40:'XL',90:'XC',400:'CD',900:'CM'}\n o=\"\"\n pw=0\n while num:\n d=num%10*10**pw\n num//=10\n pw+=1\n mx=None\n if d in s:\n o=s[d]+o\n else:\n o1=\"\"\n while d>0:\n mx=0\n for k in s:\n if (mx is None or (k>mx and k<=d)):\n mx=k\n o1+=s[mx]\n d-=mx\n o=o1+o\n return o","runtime":"58"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n # get decimal place values of num, from highest to lowest\n num_as_string = str(num)\n max_index = len(num_as_string)\n decimal_place_values = []\n for i, digit in enumerate(num_as_string):\n decimal_place_values.append(int(digit) * 10 ** (max_index - i - 1))\n # Get correct symbol for this value, append to result, subtract that \n returnString = \"\"\n for value in decimal_place_values:\n subtractive_map = {4: \"IV\", 9: \"IX\", 40: \"XL\", 90: \"XC\", 400: \"CD\", \n 900: \"CM\"}\n if value in subtractive_map.keys():\n returnString += subtractive_map[value]\n else:\n numeralsMap = {1: \"I\", 5: \"V\", 10: \"X\", 50: \"L\", 100: \"C\", 500: \"D\", \n 1000: \"M\"}\n while value > 0:\n # find max value less than num\n max_val_less_than = [x for x in numeralsMap.keys() if x <= value][-1]\n value -= max_val_less_than\n returnString += numeralsMap[max_val_less_than]\n return returnString\n\n ","runtime":"58"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n symList = [['M', 1000], ['CM', 900], ['D', 500], ['CD', 400], ['C', 100], ['XC', 90], ['L', 50], ['XL', 40], ['X', 10], ['IX', 9], ['V', 5], ['IV', 4], ['I', 1]]\n\n total = ''\n\n for sym, val in symList:\n if num // val:\n count = num // val\n total += (sym * count)\n num = num % val\n \n return total","runtime":"59"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n values = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\n numerals = [\"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\"]\n\n res = \"\"\n i = 0\n while num:\n res += (num // values[i]) * numerals[i]\n num %= values[i]\n i += 1\n return res","runtime":"59"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n hashmap={\n # 1: {\n # 1: \"I\",\n # 5: \"V\",\n # },\n # 2:{\n # 10: \"X\",\n # 50: \"L\",\n # },\n # 3: {\n # 100: \"C\",\n # 500: \"D\",\n # },\n # 4: {\n # 1000: \"M\"\n # },\n 1: \"I\",\n 5: \"V\",\n 10: \"X\",\n 50: \"L\",\n 100: \"C\",\n 500: \"D\",\n 1000: \"M\"\n }\n unit={\n 1: 1,\n 2: 10,\n 3: 100,\n 4: 1000\n }\n rs = ''\n prev = 0\n # 3749 -> i=1 -> s[i] = 3\n s = str(num)\n for i in range(len(s)):\n # tmp_part = (5 if s[i] >= 5 else 1)\n # tmp_letter_value = tmp_part * unit[len(s)-i] \n tmp_letter_value = (5 if (int(s[i]) >= 5 and int(s[i]) <= 9) else 1) * unit[len(s)-i]\n # 9, 7, 5, 4, 3\n if int(s[i]) == 0: rs+=''\n elif int(s[i]) < 4:\n rs += hashmap[tmp_letter_value] * int(s[i])\n elif int(s[i]) == 4 :\n rs += hashmap[tmp_letter_value] + hashmap[(tmp_letter_value*5)]\n elif int(s[i]) == 5 :\n rs += hashmap[tmp_letter_value]\n elif int(s[i]) < 9:\n rs += hashmap[tmp_letter_value] + hashmap[tmp_letter_value/5] * (int(s[i])-5)\n else: rs += hashmap[tmp_letter_value/5] + hashmap[tmp_letter_value*2]\n print(f'i={i} --> s[i]={s[i]} && tmp_letter_value={tmp_letter_value} --> rs={rs}')\n return rs","runtime":"60"},{"code":"class Solution:\n DICTIONARY = {\n 1000: \"M\",\n 900: \"CM\",\n 500: \"D\",\n 400: \"CD\",\n 100: \"C\",\n 90: \"XC\",\n 50: \"L\",\n 40: \"XL\",\n 10: \"X\",\n 9: \"IX\",\n 5: \"V\",\n 4: \"IV\",\n 1: \"I\",\n }\n\n def simpleIntToRoman(self, num: int) -> str:\n # accepts numbers with a single non-zero digit and converts them to their\n # roman numeral form\n print(f\"simpleIntToRoman: {num}\")\n if not num:\n return ''\n for k, val in Solution.DICTIONARY.items():\n # 800\n if k == num:\n return val\n elif k > num: # 900 > 800\n continue\n elif k < num: # 500 < 800\n rem = num - k # 300 = 800 - 500\n rem_tens = 10 ** (math.ceil(math.log(num, 10)) - 1) # 300 => 100\n rem_mult = int(rem / rem_tens)\n try:\n return Solution.DICTIONARY.get(\n k\n ) + rem_mult * Solution.DICTIONARY.get(rem_tens)\n except Exception as e:\n print(locals())\n raise e\n\n print(locals())\n raise Exception(\"unhandled\")\n # return 500 + 3*100\n\n def intToRoman(self, num: int) -> str:\n # 3749 = MMMDCCXLIX\n # 58 = LVIII\n # 1994 = MCMXCIV\n split = [(num % 10**xp) - (num % 10 ** (xp - 1)) for xp in range(math.ceil(math.log(num, 10))+1, 0, -1)]\n try:\n return \"\".join([self.simpleIntToRoman(x) for x in split])\n # s = \"\"\n # for x in split:\n # s += self.simpleIntToRoman(x)\n # return s\n # return \n except Exception as e:\n print(locals())\n raise e\n # 3749 = [3000, 700, 40, 9]\n # 58 = [50, 8]\n # 1994 = [1000, 900, 90, 4]\n","runtime":"60"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n map_dict = {1:'I',5:'V',10:'X',50:'L',100:'C',500:'D',1000:'M'}\n map_sub_form = {900:'CM',400:'CD',90:'XC',40:'XL',9:'IX',4:'IV'}\n map_sort = sorted(map_dict, reverse=True)\n results = ''\n while num:\n for k in map_sort:\n if int(str(num)[0]) not in [4,9]:\n if int(num/k) > 0:\n if k in [1,10,100,1000]:\n if num/k < 4:\n results += (map_dict[k] * int(num/k))\n num -= k * int(num/k)\n else:\n results += (map_dict[k] * 3)\n num -= k * 3\n else:\n results += map_dict[k]\n num -= k\n else:\n continue\n else:\n if len(str(num)) != 1:\n key = (10**(len(str(num))-1)) * int(str(num)[0])\n else:\n key = num\n results += map_sub_form[key]\n num -= key\n return results","runtime":"61"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n num_str = str(num)\n\n numeral_lst = []\n\n numeral_dict = {1 : \"I\", 5 : \"V\", 10 : \"X\", 50 : \"L\", 100 : \"C\", 500 : \"D\", 1000 : \"M\"}\n\n for i in range(len(num_str)):\n\n exponent = (len(num_str) - i - 1)\n total = int(num_str[i]) * (10 ** exponent)\n\n if int(num_str[i]) != 4 and int(num_str[i]) != 9:\n while total != 0:\n if total >= 5 * (10 ** exponent):\n numeral_lst.append(numeral_dict[5 * (10 ** exponent)])\n total -= 5 * (10 ** exponent)\n else:\n print(exponent)\n numeral_lst.append(numeral_dict[1 * (10 ** exponent)])\n total -= 1 * (10 ** exponent)\n else:\n numeral_lst.append(numeral_dict[1 * (10 ** exponent)])\n numeral_lst.append(numeral_dict[(int(num_str[i])+1) * (10 ** exponent)])\n return \"\".join(numeral_lst)","runtime":"61"}],"string":"[\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n digits =[(1000, \\\"M\\\"),\\n (900,\\\"CM\\\"),(500,\\\"D\\\"),(400,\\\"CD\\\"), (100, \\\"C\\\"), \\n (90, \\\"XC\\\"),(50, \\\"L\\\"),(40, \\\"XL\\\"),(10, \\\"X\\\"),\\n (9, \\\"IX\\\"),(5, \\\"V\\\"),(4, \\\"IV\\\"),(1, \\\"I\\\")]\\n\\n roman_digits = []\\n for value, symbol in digits:\\n if num == 0:\\n break\\n count, num = divmod(num, value) #divmod 函数会返回 num 除以 value 的商和余数，count 是商，num 是余数。count 表示当前数字可以由几个 value 组成\\n roman_digits.append(symbol*count)\\n return \\\"\\\".join(roman_digits)\\n \",\n \"runtime\": \"15\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n to_r = {\\n 1000: 'M',\\n 900: 'CM',\\n 500: 'D',\\n 400: 'CD',\\n 100: 'C',\\n 90: 'XC',\\n 50: 'L',\\n 40: 'XL',\\n 10: 'X',\\n 9: 'IX',\\n 5: 'V',\\n 4: 'IV',\\n 1: 'I'\\n }\\n\\n roman = ''\\n\\n for i in to_r:\\n while i <= num:\\n num -= i\\n roman += to_r[i]\\n\\n return roman\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n # Mapping of integer values to Roman numeral symbols\\n roman_map = [\\n (1000, \\\"M\\\"), (900, \\\"CM\\\"), (500, \\\"D\\\"), (400, \\\"CD\\\"),\\n (100, \\\"C\\\"), (90, \\\"XC\\\"), (50, \\\"L\\\"), (40, \\\"XL\\\"),\\n (10, \\\"X\\\"), (9, \\\"IX\\\"), (5, \\\"V\\\"), (4, \\\"IV\\\"), (1, \\\"I\\\")\\n ]\\n \\n result = []\\n \\n # Iterate over each value-symbol pair in the roman_map\\n for value, symbol in roman_map:\\n # Append the symbol to the result as many times as possible\\n while num >= value:\\n result.append(symbol)\\n num -= value\\n \\n # Join the list into a single string and return it\\n return ''.join(result)\\n\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n\\n val_to_roman=[\\n (1000,'M'),(900,'CM'),(500,'D'),(400,'CD'),(100,'C'),(90,'XC'),(50,'L'),(40,'XL'),(10,'X'),(9,'IX'),(5,'V'),(4,'IV'),(1,'I')\\n ]\\n roman =''\\n\\n for value,symbol in val_to_roman:\\n while num>=value:\\n roman +=symbol\\n num -=value\\n\\n return roman\\n \",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n rom = ''\\n while num > 0:\\n if num >= 1000:\\n rom += 'M'\\n num -= 1000\\n elif num >= 900:\\n rom += 'CM'\\n num -= 900\\n elif num >= 500:\\n rom += 'D'\\n num -= 500\\n elif num >= 400:\\n rom += 'CD'\\n num -= 400\\n elif num >= 100:\\n rom += 'C'\\n num -= 100\\n elif num >= 90:\\n rom += 'XC'\\n num -= 90\\n elif num >= 50:\\n rom += 'L'\\n num -= 50\\n elif num >= 40:\\n rom += 'XL'\\n num -= 40\\n elif num >= 10:\\n rom += 'X'\\n num -= 10\\n elif num >= 9:\\n rom += 'IX'\\n num -= 10\\n elif num >= 5:\\n rom += 'V'\\n num -= 5\\n elif num >= 4:\\n rom += 'IV'\\n num -= 4\\n elif num >= 1:\\n rom += 'I'\\n num -= 1\\n return rom\\n\",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n res = \\\"\\\"\\n\\n if num >= 1000:\\n m_count = num // 1000\\n res += \\\"M\\\" * m_count\\n num -= 1000 * m_count\\n\\n if num // 900 == 1:\\n res += \\\"CM\\\"\\n num -= 900\\n\\n if num >= 500 and num < 1000:\\n d_count = num // 500\\n res += \\\"D\\\"\\n num -= d_count * 500\\n\\n if num // 400 == 1:\\n res += \\\"CD\\\"\\n num -= 400\\n\\n if num < 500 and num >= 100:\\n c_count = num // 100\\n res += \\\"C\\\" * c_count\\n num -= c_count * 100\\n\\n if num // 90 == 1:\\n res += \\\"XC\\\"\\n num -= 90\\n\\n if num < 100 and num >= 50:\\n l_count = num // 50\\n res += \\\"L\\\" * l_count\\n num -= l_count * 50\\n\\n if num//40 == 1:\\n res += \\\"XL\\\"\\n num -= 40\\n\\n if num < 50 and num >= 10:\\n x_count = num//10\\n res += \\\"X\\\" * x_count\\n num -= x_count * 10\\n\\n if num//9 == 1:\\n res += \\\"IX\\\"\\n num -= 9\\n\\n if num//5 == 1:\\n res += \\\"V\\\"\\n num -= 5\\n\\n if num//4 == 1:\\n res += \\\"IV\\\"\\n num -= 4\\n\\n if num < 5 and num >= 0:\\n i_count = num//1\\n res += \\\"I\\\" * i_count\\n num -= i_count * 1\\n \\n return res\\n \\n \\n \\n \",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n val_map={\\n 1000:\\\"M\\\",\\n 900:\\\"CM\\\",\\n 500:\\\"D\\\",\\n 400:\\\"CD\\\",\\n 100:\\\"C\\\",\\n 90:\\\"XC\\\",\\n 50:\\\"L\\\",\\n 40:\\\"XL\\\",\\n 10:\\\"X\\\",\\n 9:\\\"IX\\\",\\n 5:\\\"V\\\",\\n 4:\\\"IV\\\",\\n 1:\\\"I\\\"\\n }\\n\\n result = \\\"\\\"\\n\\n for value,symbol in val_map.items():\\n while num>=value:\\n result+=symbol\\n num-=value\\n return result\\n \",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"'''\\ndigits = [\\n (1000, \\\"M\\\"),\\n (900, \\\"CM\\\"),\\n (500, \\\"D\\\"),\\n (400, \\\"CD\\\"),\\n (100, \\\"C\\\"),\\n (90, \\\"XC\\\"),\\n (50, \\\"L\\\"),\\n (40, \\\"XL\\\"),\\n (10, \\\"X\\\"),\\n (9, \\\"IX\\\"),\\n (5, \\\"V\\\"),\\n (4, \\\"IV\\\"),\\n (1, \\\"I\\\"),\\n ]\\nclass Solution:\\n def intToRoman(self, num: int) -> str:\\n romval=\\\"\\\"\\n for i in range(len(digits)):\\n value , roman = digits[i][0] , digits[i][1]\\n print(value,roman,num)\\n divisor = num//value\\n for j in range(divisor):\\n romval += roman \\n num = num - (divisor * value)\\n\\n print(divisor,num,romval)\\n return romval\\n'''\\n'''\\nclass Solution:\\n def intToRoman(self, num: int) -> str:\\n digits = [\\n (1000, \\\"M\\\"),\\n (900, \\\"CM\\\"),\\n (500, \\\"D\\\"),\\n (400, \\\"CD\\\"),\\n (100, \\\"C\\\"),\\n (90, \\\"XC\\\"),\\n (50, \\\"L\\\"),\\n (40, \\\"XL\\\"),\\n (10, \\\"X\\\"),\\n (9, \\\"IX\\\"),\\n (5, \\\"V\\\"),\\n (4, \\\"IV\\\"),\\n (1, \\\"I\\\"),\\n ]\\n\\n roman_digits = []\\n for value, symbl in digits:\\n if num==0:\\n break\\n count,num = divmod(num,value)\\n print(f'{count},{num}')\\n roman_digits.append(symbl*count)\\n return \\\"\\\".join(roman_digits)\\n\\n'''\\n\\nclass Solution:\\n def intToRoman(self,num :int) -> str :\\n thousands = [\\\"\\\",'M','MM','MMM']\\n hundreds=[\\\"\\\",'C','CC','CCC','CD','D','DC','DCC','DCCC','CM']\\n tens=[\\\"\\\",'X',\\\"XX\\\",\\\"XXX\\\",\\\"XL\\\",\\\"L\\\",\\\"LX\\\",\\\"LXX\\\",\\\"LXXX\\\",\\\"XC\\\",]\\n ones=[\\\"\\\",\\\"I\\\",\\\"II\\\",\\\"III\\\",\\\"IV\\\",\\\"V\\\",\\\"VI\\\",\\\"VII\\\",\\\"VIII\\\",\\\"IX\\\"]\\n l = []\\n l.append(thousands[num //1000])\\n l.append(hundreds[(num%1000)//100])\\n l.append(tens[(num%100)//10])\\n l.append(ones[(num%10)])\\n return \\\"\\\".join(l)\\n\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n # Mapping of integers to Roman numerals\\n int_to_roman = [\\n (1000, 'M'),\\n (900, 'CM'),\\n (500, 'D'),\\n (400, 'CD'),\\n (100, 'C'),\\n (90, 'XC'),\\n (50, 'L'),\\n (40, 'XL'),\\n (10, 'X'),\\n (9, 'IX'),\\n (5, 'V'),\\n (4, 'IV'),\\n (1, 'I')\\n ]\\n \\n roman_str = \\\"\\\"\\n for value, numeral in int_to_roman:\\n while num >= value:\\n roman_str += numeral\\n num -= value\\n \\n return roman_str\\n\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n # List of Roman numeral symbols and their corresponding values\\n val_to_symbol = [\\n (1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'),\\n (100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'),\\n (10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')\\n ]\\n \\n # Resulting Roman numeral string\\n roman_numeral = \\\"\\\"\\n \\n # Iterate over the values and symbols\\n for value, symbol in val_to_symbol:\\n # Append the symbol as many times as we can subtract the value from num\\n while num >= value:\\n roman_numeral += symbol\\n num -= value\\n \\n return roman_numeral\\n\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n romanDict = {1000: 'M', 900: 'CM', 500: 'D', 400: 'CD', 100: 'C', 90: 'XC', 50: 'L', 40: 'XL', 10: 'X', 9: 'IX', 5: 'V', 4: 'IV', 1: 'I' }\\n res = \\\"\\\"\\n n = num\\n for key in romanDict:\\n # Go through key until you can no longer loop\\n while(n // key != 0):\\n res = res + romanDict[key]\\n n -= key\\n return res\\n \\n\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n ones = [\\\"\\\",\\\"I\\\",\\\"II\\\",\\\"III\\\",\\\"IV\\\",\\\"V\\\",\\\"VI\\\",\\\"VII\\\",\\\"VIII\\\",\\\"IX\\\"]\\n tens = [\\\"\\\",\\\"X\\\",\\\"XX\\\",\\\"XXX\\\",\\\"XL\\\",\\\"L\\\",\\\"LX\\\",\\\"LXX\\\",\\\"LXXX\\\",\\\"XC\\\"]\\n hundreds = [\\\"\\\",\\\"C\\\",\\\"CC\\\",\\\"CCC\\\",\\\"CD\\\",\\\"D\\\",\\\"DC\\\",\\\"DCC\\\",\\\"DCCC\\\",\\\"CM\\\"]\\n thousands = [\\\"\\\",\\\"M\\\",\\\"MM\\\",\\\"MMM\\\"]\\n return thousands[(num//1000)] + hundreds[((num%1000)//100)] + tens[((num%100)//10)]+ones[num%10]\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n mapi = {1:\\\"I\\\" , 5:\\\"V\\\" , 10:\\\"X\\\" , 50:\\\"L\\\" , 100:\\\"C\\\" , 500:\\\"D\\\" ,\\n 1000:\\\"M\\\", 4:\\\"IV\\\" , 9:\\\"IX\\\" , 40:\\\"XL\\\" , 90:\\\"XC\\\",400:\\\"CD\\\",900:\\\"CM\\\"}\\n res = \\\"\\\"\\n for n in [1000,900,500,400,100,90,50,40,10,9,5,4,1]:\\n while n<=num:\\n res += mapi[n]\\n num-=n\\n return res\\n \",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n # Define the Roman numeral mappings\\n value_to_symbol = [\\n (1000, 'M'),\\n (900, 'CM'),\\n (500, 'D'),\\n (400, 'CD'),\\n (100, 'C'),\\n (90, 'XC'),\\n (50, 'L'),\\n (40, 'XL'),\\n (10, 'X'),\\n (9, 'IX'),\\n (5, 'V'),\\n (4, 'IV'),\\n (1, 'I')\\n ]\\n \\n roman_numeral = ''\\n \\n # Convert integer to Roman numeral\\n for value, symbol in value_to_symbol:\\n # Determine the number of symbols to append\\n while num >= value:\\n roman_numeral += symbol\\n num -= value\\n \\n return roman_numeral\\n \",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n value_to_symbol = [\\n (1000, 'M'), \\n (900, 'CM'), \\n (500, 'D'), \\n (400, 'CD'), \\n (100, 'C'), \\n (90, 'XC'),\\n (50, 'L'), \\n (40, 'XL'),\\n (10, 'X'), \\n (9, 'IX'),\\n (5, 'V'), \\n (4, 'IV'),\\n (1, 'I')\\n ]\\n strings = []\\n for i in range(len(value_to_symbol)):\\n count = num // value_to_symbol[i][0]\\n if count > 0:\\n string = count * value_to_symbol[i][1]\\n strings.append(string)\\n num -= count * value_to_symbol[i][0]\\n return ''.join(strings)\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n # Creating Dictionary for Lookup\\n num_map = {\\n 1: \\\"I\\\",\\n 5: \\\"V\\\", 4: \\\"IV\\\",\\n 10: \\\"X\\\", 9: \\\"IX\\\",\\n 50: \\\"L\\\", 40: \\\"XL\\\",\\n 100: \\\"C\\\", 90: \\\"XC\\\",\\n 500: \\\"D\\\", 400: \\\"CD\\\",\\n 1000: \\\"M\\\", 900: \\\"CM\\\",\\n }\\n \\n # Result Variable\\n r = ''\\n \\n \\n for n in [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]:\\n # If n in list then add the roman value to result variable\\n while n <= num:\\n r += num_map[n]\\n num-=n\\n return r\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n conv_dict = {1: 'I', 5: 'V', 10: 'X', 50: 'L', 100: 'C', 500: 'D', 1000: 'M',\\n 4: 'IV', 9: 'IX', 40: 'XL', 90: 'XC', 400: 'CD', 900: 'CM'}\\n\\n # str_num = str(num)\\n div_val = 10\\n out_str = ''\\n check_val = 5\\n single_val = 1\\n while num > 0:\\n cur_val = num % div_val\\n if cur_val in conv_dict.keys():\\n out_str = conv_dict[cur_val] + out_str\\n else:\\n part_str = ''\\n part_val = cur_val\\n if part_val > check_val:\\n part_str = conv_dict[check_val]\\n part_val -= check_val\\n part_val = int(part_val/single_val)\\n part_str = part_str + (conv_dict[single_val] * part_val)\\n \\n out_str = part_str + out_str\\n div_val *= 10\\n check_val *= 10\\n single_val *= 10\\n num -= cur_val\\n return out_str\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n \\n int_to_roman = [[1000,'M'],[900,'CM'],[500,'D'],[400,'CD'],[100,'C'],[90,'XC'],[50,'L'],[40,'XL'],[10,'X'],[9,'IX'],[5,'V'],[4,'IV'],[1,'I']]\\n\\n roman = ''\\n\\n for i in range(len(int_to_roman)):\\n\\n if int_to_roman[i][0] <= num:\\n q = num // int_to_roman[i][0]\\n roman += (int_to_roman[i][1]) * q\\n num = num % int_to_roman[i][0]\\n\\n return roman\\n\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n value_to_roman = [(1000, 'M'),(900, 'CM'),(500, 'D'),(400, 'CD')\\n ,(100, 'C'),(90, 'XC'),(50, 'L'),(40, 'XL'),(10, 'X')\\n ,(9, 'IX'),(5, 'V'),(4, 'IV'),(1, 'I')\\n ]\\n roman = []\\n for value, symbol in value_to_roman:\\n # if num == 0:\\n # break\\n while num >= value:\\n count, num = divmod(num, value)\\n roman.append(symbol*count)\\n \\n return ''.join(roman)\\n\\n\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n sysList= [[\\\"I\\\",1],[\\\"IV\\\",4],[\\\"V\\\",5],[\\\"IX\\\",9],\\n [\\\"X\\\",10],[\\\"XL\\\",40],[\\\"L\\\",50],[\\\"XC\\\",90],\\n [\\\"C\\\",100],[\\\"CD\\\",400],[\\\"D\\\",500],[\\\"CM\\\",900],\\n [\\\"M\\\",1000] ]\\n res=\\\"\\\"\\n for sys, val in reversed(sysList):\\n if num // val:\\n count = num//val\\n res +=(sys * count)\\n num = num % val\\n return res\\n\\n\\n\\n \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n int_to_roman = [\\n (1000, \\\"M\\\"), (900, \\\"CM\\\"), (500, \\\"D\\\"), (400, \\\"CD\\\"),\\n (100, \\\"C\\\"), (90, \\\"XC\\\"), (50, \\\"L\\\"), (40, \\\"XL\\\"),\\n (10, \\\"X\\\"), (9, \\\"IX\\\"), (5, \\\"V\\\"), (4, \\\"IV\\\"), (1, \\\"I\\\")\\n ]\\n \\n roman_string = \\\"\\\"\\n \\n for value, symbol in int_to_roman:\\n while num >= value:\\n roman_string += symbol\\n num -= value\\n \\n return roman_string\\n\\n \\n \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n result = \\\"\\\"\\n\\n for value in values:\\n while num >= value:\\n num -= value\\n result += values[value]\\n\\n return result\\n\\nvalues = {\\n 1000: \\\"M\\\",\\n 900: \\\"CM\\\",\\n 500: \\\"D\\\",\\n 400: \\\"CD\\\",\\n 100: \\\"C\\\",\\n 90: \\\"XC\\\",\\n 50: \\\"L\\\",\\n 40: \\\"XL\\\",\\n 10: \\\"X\\\",\\n 9: \\\"IX\\\",\\n 5: \\\"V\\\",\\n 4: \\\"IV\\\",\\n 1: \\\"I\\\",\\n}\\n\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n\\n num_map = {\\n 1: \\\"I\\\",\\n 5: \\\"V\\\", 4: \\\"IV\\\",\\n 10: \\\"X\\\", 9: \\\"IX\\\",\\n 50: \\\"L\\\", 40: \\\"XL\\\",\\n 100: \\\"C\\\", 90: \\\"XC\\\",\\n 500: \\\"D\\\", 400: \\\"CD\\\",\\n 1000: \\\"M\\\", 900: \\\"CM\\\",\\n }\\n \\n # Result Variable\\n r = ''\\n for n in [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]:\\n \\n while n <= num:\\n num -= n\\n r += num_map[n] \\n return r\\n\\n # for n in [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]:\\n # # If n in list then add the roman value to result variable\\n # while n <= num:\\n # r += num_map[n]\\n # num-=n\\n # # print(r, num)\\n # return r\\n\\n\\n\\n\\n\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n num_map = {\\n 1: \\\"I\\\",\\n 5: \\\"V\\\", 4: \\\"IV\\\",\\n 10: \\\"X\\\", 9: \\\"IX\\\",\\n 50: \\\"L\\\", 40: \\\"XL\\\",\\n 100: \\\"C\\\", 90: \\\"XC\\\",\\n 500: \\\"D\\\", 400: \\\"CD\\\",\\n 1000: \\\"M\\\", 900: \\\"CM\\\",\\n }\\n \\n # Result Variable\\n r = ''\\n \\n \\n for n in [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]:\\n # If n in list then add the roman value to result variable\\n while n <= num:\\n r += num_map[n]\\n num-=n\\n return r \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n # Define the Roman numeral mappings\\n value_to_roman = [\\n (1000, 'M'),\\n (900, 'CM'),\\n (500, 'D'),\\n (400, 'CD'),\\n (100, 'C'),\\n (90, 'XC'),\\n (50, 'L'),\\n (40, 'XL'),\\n (10, 'X'),\\n (9, 'IX'),\\n (5, 'V'),\\n (4, 'IV'),\\n (1, 'I')\\n ]\\n \\n roman = [] # Store the Roman numeral result\\n for value, symbol in value_to_roman:\\n if num == 0:\\n break\\n # Append the symbol while the current value can be subtracted\\n while num >= value:\\n count, num = divmod(num, value)\\n roman.append(symbol*count)\\n \\n return ''.join(roman)\\n\\n\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n roman_list = []\\n\\n while num >= 1000:\\n num -= 1000\\n roman_list.append('M')\\n\\n if num >= 900:\\n num -= 900\\n roman_list.append('CM')\\n\\n while num >= 500:\\n num -= 500\\n roman_list.append('D')\\n\\n if num >= 400:\\n num -= 400\\n roman_list.append('CD')\\n\\n while num >= 100:\\n num -= 100\\n roman_list.append('C')\\n\\n if num >= 90:\\n num -= 90\\n roman_list.append('XC')\\n\\n while num >= 50:\\n num -= 50\\n roman_list.append('L')\\n\\n if num >= 40:\\n num -= 40\\n roman_list.append('XL')\\n\\n while num >= 10:\\n num -= 10\\n roman_list.append('X')\\n\\n if num == 9:\\n num -= 9\\n roman_list.append('IX')\\n\\n if num >= 5:\\n num -= 5\\n roman_list.append('V')\\n\\n if num == 4:\\n num -= 4\\n roman_list.append('IV')\\n\\n while num > 0:\\n num -= 1\\n roman_list.append('I')\\n\\n roman_list = ''.join(roman_list)\\n\\n return roman_list\\n\\n\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, n: int) -> str:\\n m = {1:\\\"I\\\",2:\\\"II\\\",3:\\\"III\\\",4:\\\"IV\\\",5:\\\"V\\\",6:\\\"VI\\\",7:\\\"VII\\\",8:\\\"VIII\\\",\\n 9:\\\"IX\\\",10:\\\"X\\\",20:\\\"XX\\\",30:\\\"XXX\\\",40:\\\"XL\\\",\\n 50:\\\"L\\\",60:\\\"LX\\\",70:\\\"LXX\\\",80:\\\"LXXX\\\",90:\\\"XC\\\",100:\\\"C\\\",200:\\\"CC\\\",\\n 300:\\\"CCC\\\",400:\\\"CD\\\",500:\\\"D\\\",600:\\\"DC\\\",700:\\\"DCC\\\",\\n 800:\\\"DCCC\\\",900:\\\"CM\\\",1000:\\\"M\\\",2000:\\\"MM\\\",3000:\\\"MMM\\\"}\\n ans = \\\"\\\"\\n k = 0\\n while n > 0:\\n dig = (n%10)*10**k\\n if dig != 0:\\n ans = m[dig]+ans\\n n//=10\\n k+=1\\n return ans\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n result = \\\"\\\" # Renamed variable from 'str' to 'result' to avoid conflict with the 'str' type\\n \\n while num > 0:\\n if num >= 1000:\\n k = num // 1000\\n result += \\\"M\\\" * k # Add 'M' k times\\n num -= 1000 * k\\n \\n elif num >= 900:\\n result += \\\"CM\\\"\\n num -= 900\\n\\n elif num >= 500:\\n result += \\\"D\\\"\\n num -= 500\\n\\n elif num >= 400:\\n result += \\\"CD\\\"\\n num -= 400\\n\\n elif num >= 100:\\n k = num // 100\\n result += \\\"C\\\" * k # Add 'C' k times\\n num -= 100 * k\\n\\n elif num >= 90:\\n result += \\\"XC\\\"\\n num -= 90\\n\\n elif num >= 50:\\n result += \\\"L\\\"\\n num -= 50\\n\\n elif num >= 40:\\n result += \\\"XL\\\"\\n num -= 40\\n\\n elif num >= 10:\\n k = num // 10\\n result += \\\"X\\\" * k # Add 'X' k times\\n num -= 10 * k\\n\\n elif num >= 9:\\n result += \\\"IX\\\"\\n num -= 9\\n\\n elif num >= 5:\\n result += \\\"V\\\"\\n num -= 5\\n\\n elif num >= 4:\\n result += \\\"IV\\\"\\n num -= 4\\n\\n else:\\n result += \\\"I\\\" * num # Add 'I' num times\\n num = 0\\n\\n return result\\n\\n \\n\\n \\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n value_to_roman = [(1000, 'M'),(900, 'CM'),(500, 'D'),(400, 'CD')\\n ,(100, 'C'),(90, 'XC'),(50, 'L'),(40, 'XL'),(10, 'X')\\n ,(9, 'IX'),(5, 'V'),(4, 'IV'),(1, 'I')\\n ]\\n roman = []\\n for value, symbol in value_to_roman:\\n if num == 0:\\n break\\n while num >= value:\\n count, num = divmod(num, value)\\n roman.append(symbol*count)\\n \\n return ''.join(roman)\\n\\n\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n result = \\\"\\\"\\n\\n for value, symbol in values.items():\\n while num >= value:\\n num -= value\\n result += symbol\\n\\n return result\\n\\nvalues = {\\n 1000: \\\"M\\\",\\n 900: \\\"CM\\\",\\n 500: \\\"D\\\",\\n 400: \\\"CD\\\",\\n 100: \\\"C\\\",\\n 90: \\\"XC\\\",\\n 50: \\\"L\\\",\\n 40: \\\"XL\\\",\\n 10: \\\"X\\\",\\n 9: \\\"IX\\\",\\n 5: \\\"V\\\",\\n 4: \\\"IV\\\",\\n 1: \\\"I\\\",\\n}\\n\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n romanian = []\\n val_to_roman = [\\n (1000, \\\"M\\\"), (900, \\\"CM\\\"), (500, \\\"D\\\"), (400, \\\"CD\\\"),\\n (100, \\\"C\\\"), (90, \\\"XC\\\"), (50, \\\"L\\\"), (40, \\\"XL\\\"),\\n (10, \\\"X\\\"), (9, \\\"IX\\\"), (5, \\\"V\\\"), (4, \\\"IV\\\"), (1, \\\"I\\\")\\n ]\\n\\n for value, symbol in val_to_roman:\\n while num >= value: \\n romanian.append(symbol)\\n num -= value\\n\\n return ''.join(romanian)\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n # Define Roman numeral symbols and their corresponding values\\n roman_symbols = [\\n (1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'),\\n (100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'),\\n (10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')\\n ]\\n \\n roman_numeral = \\\"\\\"\\n for value, symbol in roman_symbols:\\n # Append the symbol to the result while reducing num by value\\n while num >= value:\\n roman_numeral += symbol\\n num -= value\\n \\n return roman_numeral\\n\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n result = \\\"\\\"\\n\\n for value in values:\\n while num >= value:\\n num -= value\\n result += values[value]\\n\\n return result\\n\\n\\nvalues = {\\n 1000: \\\"M\\\",\\n 900: \\\"CM\\\",\\n 500: \\\"D\\\",\\n 400: \\\"CD\\\",\\n 100: \\\"C\\\",\\n 90: \\\"XC\\\",\\n 50: \\\"L\\\",\\n 40: \\\"XL\\\",\\n 10: \\\"X\\\",\\n 9: \\\"IX\\\",\\n 5: \\\"V\\\",\\n 4: \\\"IV\\\",\\n 1: \\\"I\\\",\\n}\\n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n str1 = ''\\n data = {\\n 900 : 'CM',\\n 90 : 'XC',\\n 9 : 'IX',\\n 400 : 'CD',\\n 40 : 'XL',\\n 4 : 'IV',\\n 1 : 'I',\\n 5 : 'V',\\n 10 : 'X',\\n 50 : 'L',\\n 100 : 'C',\\n 500 : 'D',\\n 1000 : 'M'\\n }\\n for i in range(0, len(str(num))):\\n place = int(10 ** ((len(str(num)) - 1) - i))\\n y = str(num)\\n x = place * int(y[i])\\n\\n\\n if place == 1000:\\n str1 += (int(x/place)) * 'M'\\n\\n elif x in data:\\n str1 += data[x]\\n\\n else:\\n if int(x/place) // 5 >= 1:\\n s = ((int(x/place)) % 5) * place\\n p = 5 * place\\n str1 += str(data[p]) + str(int(s/place) * data[place])\\n\\n else:\\n str1 += int(x / place) * (data[place])\\n\\n return(str1)\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n\\n val_to_roman = [\\n (1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'),\\n (100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'),\\n (10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')\\n ]\\n roman = []\\n for value, symbol in val_to_roman:\\n while num >= value:\\n roman.append(symbol) \\n num -= value \\n \\n return ''.join(roman) \",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n map_val = {\\n 1: \\\"I\\\",\\n 5: \\\"V\\\", 4: \\\"IV\\\",\\n 10: \\\"X\\\", 9: \\\"IX\\\",\\n 50: \\\"L\\\", 40: \\\"XL\\\",\\n 100: \\\"C\\\", 90: \\\"XC\\\",\\n 500: \\\"D\\\", 400: \\\"CD\\\",\\n 1000: \\\"M\\\", 900: \\\"CM\\\",\\n }\\n\\n result = \\\"\\\"\\n\\n \\n for n in [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]:\\n while n <= num:\\n result += map_val[n]\\n num -= n\\n return result\\n \\n\\n \\n \\n\\n \",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n if num <=0:\\n return False\\n sym=['M','CM','D','CD','C','XC','L','XL','X','IX','V','IV','I']\\n val=[1000,900,500,400,100,90,50,40,10,9,5,4,1]\\n i=0\\n roman=''\\n while num >0:\\n for j in range(num//val[i]):\\n roman +=sym[i]\\n num %= val[i]\\n i +=1\\n return roman\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n lookUp = {\\n 1:'I',\\n 4:'IV',\\n 5:'V',\\n 9:'IX',\\n 10:'X',\\n 40:'XL',\\n 50:'L',\\n 90:'XC',\\n 100:'C',\\n 400:'CD',\\n 500:'D',\\n 900:'CM',\\n 1000:'M'\\n }\\n res=\\\"\\\"\\n for key in reversed(lookUp.keys()):\\n if num // key:\\n res+=(lookUp[key]*(num//key))\\n num=num%key\\n if not num:\\n break\\n \\n return res\\n\\n\\n\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n dic = {\\n 1000: 'M',\\n 900: 'CM',\\n 500: 'D',\\n 400: 'CD',\\n 100: 'C',\\n 90: 'XC',\\n 50: 'L',\\n 40: 'XL',\\n 10: 'X',\\n 9: 'IX',\\n 5: 'V',\\n 4: 'IV',\\n 1: 'I'\\n }\\n n = num\\n ans = ''\\n while n > 0:\\n for x in (dic):\\n if n >= x:\\n i = n//x\\n n = n % x\\n for j in range(i):\\n ans += dic[x]\\n return (ans)\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n d = {1000: 'M', \\n 900: 'CM', \\n 500: 'D', \\n 400: 'CD', \\n 100: 'C', \\n 90: 'XC', \\n 50: 'L',\\n 40:'XL',\\n 10: 'X', \\n 9: 'IX', \\n 5: 'V', \\n 4: 'IV', \\n 1: 'I'}\\n \\n res = \\\"\\\"\\n \\n for i in d:\\n res += (num//i) * d[i]\\n num %= i\\n \\n return res\\n \",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n \\n roman_numerals = [\\n (\\\"M\\\", 1000), (\\\"CM\\\", 900), (\\\"D\\\", 500), (\\\"CD\\\", 400),\\n (\\\"C\\\", 100), (\\\"XC\\\", 90), (\\\"L\\\", 50), (\\\"XL\\\", 40),\\n (\\\"X\\\", 10), (\\\"IX\\\", 9), (\\\"V\\\", 5), (\\\"IV\\\", 4),\\n (\\\"I\\\", 1)\\n ]\\n \\n \\n result = \\\"\\\"\\n \\n for roman, value in roman_numerals:\\n \\n while num >= value:\\n result += roman\\n num -= value \\n \\n return result\\n\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n result = \\\"\\\"\\n while num > 0:\\n if num >= 1000:\\n num -= 1000\\n result += \\\"M\\\"\\n elif str(num)[0] in \\\"49\\\":\\n if num >= 900:\\n num -= 900\\n result += \\\"CM\\\"\\n elif num >= 400:\\n num -= 400\\n result += \\\"CD\\\"\\n elif num >= 90:\\n num -= 90\\n result += \\\"XC\\\"\\n elif num >= 40:\\n num -= 40\\n result += \\\"XL\\\"\\n elif num >= 9:\\n num -= 9\\n result += \\\"IX\\\"\\n elif num >= 4:\\n num -= 4\\n result += \\\"IV\\\"\\n elif num >= 500:\\n num -= 500\\n result += \\\"D\\\"\\n elif num >= 100:\\n num -= 100\\n result += \\\"C\\\"\\n elif num >= 50:\\n num -= 50\\n result += \\\"L\\\"\\n elif num >= 10:\\n num -= 10\\n result += \\\"X\\\"\\n elif num >= 5:\\n num -= 5\\n result += \\\"V\\\"\\n elif num >= 1:\\n num -= 1\\n result += \\\"I\\\"\\n return result\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"roman_letters = {\\n 1: 'I',\\n 5: 'V',\\n 10: 'X',\\n 50: 'L',\\n 100: 'C',\\n 500: 'D',\\n 1000: 'M'\\n }\\n\\ndef ret_true(position, digit):\\n if digit <= 3:\\n return roman_letters[position] * digit\\n elif digit == 4:\\n if position == 1:\\n return 'IV'\\n elif position == 10:\\n return 'XL'\\n elif position == 100:\\n return 'CD'\\n elif digit == 5:\\n if position == 1:\\n return 'V'\\n elif position == 10:\\n return 'L'\\n elif position == 100:\\n return 'D'\\n elif digit in [6, 7, 8]:\\n if position == 1:\\n return 'V' + 'I' * (digit % 5)\\n elif position == 10:\\n return 'L'+ 'X' * (digit % 5)\\n elif position == 100:\\n return 'D'+ 'C' * (digit % 5)\\n elif digit == 9:\\n if position == 1:\\n return 'IX'\\n elif position == 10:\\n return 'XC'\\n elif position == 100:\\n return 'CM'\\n \\n\\nclass Solution:\\n def intToRoman(self, num: int) -> str:\\n digits = []\\n n = num\\n while n > 0:\\n digits.append(n % 10)\\n n = n // 10\\n\\n dd = []\\n for i in range(len(digits)):\\n dd.append([10**i, digits[i]])\\n\\n res = []\\n print(dd)\\n for i in range(len(dd)):\\n res.append(ret_true(dd[i][0], dd[i][1]))\\n res = res[::-1]\\n return ''.join(res)\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n val = [\\n 1000, 900, 500, 400,\\n 100, 90, 50, 40,\\n 10, 9, 5, 4,\\n 1\\n ]\\n syms = [\\n \\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\",\\n \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\",\\n \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\",\\n \\\"I\\\"\\n ]\\n roman_numeral = \\\"\\\"\\n i = 0\\n while num > 0:\\n for _ in range(num // val[i]):\\n roman_numeral += syms[i]\\n num -= val[i]\\n i += 1\\n return roman_numeral\\n\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n if num <=0:\\n return False\\n sym=['M','CM','D','CD','C','XC','L','XL','X','IX','V','IV','I']\\n val=[1000,900,500,400,100,90,50,40,10,9,5,4,1]\\n i=0\\n roman=''\\n while num >0:\\n for j in range(num//val[i]):\\n roman +=sym[i]\\n num -= val[i]\\n i +=1\\n return roman\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n symbols= [['M',1000],['CM',900],['D',500],['CD',400],['C',100],['XC',90],['L',50],\\n ['XL',40],['X',10],['IX',9],['V',5],['IV',4],['I',1]]\\n ans = \\\"\\\"\\n \\n for sym,value in symbols:\\n res = num // value\\n ans += res * (sym)\\n num = num % value\\n if num == 0 :\\n return ans\\n \\n\\n\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n ans=\\\"\\\"\\n if(num>=1000):\\n n=int(num/1000)\\n ans=ans+(n*\\\"M\\\")\\n num=num-(1000*n)\\n if(num>=500):\\n n=0\\n if(int(num/100)==9): #900 CM\\n ans+=(\\\"CM\\\")\\n num=num-(900)\\n else:\\n n=int(num/500)\\n ans=ans+(n*\\\"D\\\")\\n num=num-(500*n)\\n if(num>=100):\\n n=0\\n n=int(num/100)\\n if(n==4):\\n ans=ans+(\\\"CD\\\")\\n else:\\n ans=ans+(n*\\\"C\\\") #100-300\\n num=num-(100*n)\\n if(num>=50):\\n n=0\\n if(int(num/10)==9):\\n ans+=(\\\"XC\\\")\\n num=num-(90)\\n else:\\n n=int(num/50)\\n ans=ans+(n*\\\"L\\\")\\n num=num-(50*n)\\n if(num>=10):\\n n=0\\n n=int(num/10)\\n # ans=ans+(n*\\\"X\\\")\\n if(n==4):\\n ans=ans+(\\\"XL\\\")\\n \\n else:\\n ans=ans+(n*\\\"X\\\")\\n num=num-(10*n)\\n print(n)\\n if(num>=5):\\n n=0\\n if(int(num/1)==9):\\n ans+=(\\\"IX\\\")\\n num=num-(9)\\n else:\\n n=int(num/5)\\n ans=ans+(n*\\\"V\\\")\\n num=num-(5*n)\\n if(num>=1):\\n n=0\\n n=int(num/1)\\n if(n==4):\\n ans=ans+(\\\"IV\\\")\\n n=0\\n else:\\n ans=ans+(n*\\\"I\\\")\\n num=num-(1*n)\\n print(n)\\n return ans\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n val =[1000,900,500,400,100,90,50,40,10,9,5,4,1]\\n syb = [\\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\",\\\"V\\\",\\\"IV\\\",\\\"I\\\"]\\n roman_num = \\\"\\\"\\n i = 0\\n while num > 0:\\n for _ in range(num // val[i]):\\n roman_num += syb[i]\\n num -= val[i]\\n\\n i += 1\\n return roman_num\\n \",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n valueSymbols = [(1000, 'M'), (900, 'CM'),\\n (500, 'D'), (400, 'CD'),\\n (100, 'C'), (90, 'XC'),\\n (50, 'L'), (40, 'XL'),\\n (10, 'X'), (9, 'IX'),\\n (5, 'V'), (4, 'IV'),\\n (1, 'I')]\\n ans = []\\n\\n for value, symbol in valueSymbols:\\n if num == 0:\\n break\\n count, num = divmod(num, value)\\n ans.append(symbol * count)\\n\\n return ''.join(ans)\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n # Define the Roman numeral mappings\\n value_to_roman = [\\n (1000, 'M'),\\n (900, 'CM'),\\n (500, 'D'),\\n (400, 'CD'),\\n (100, 'C'),\\n (90, 'XC'),\\n (50, 'L'),\\n (40, 'XL'),\\n (10, 'X'),\\n (9, 'IX'),\\n (5, 'V'),\\n (4, 'IV'),\\n (1, 'I')\\n ]\\n \\n roman = [] # Store the Roman numeral result\\n for value, symbol in value_to_roman:\\n # Append the symbol while the current value can be subtracted\\n while num >= value:\\n roman.append(symbol)\\n num -= value\\n \\n return ''.join(roman)\\n\\n\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n num_str = str(num)\\n res = []\\n values = {'I':1, 'V':5, 'X':10, 'L':50, 'C':100, 'D':500, 'M':1000}\\n values = dict(sorted(values.items(), key=lambda item: item[1] ,reverse=True))\\n values_res = {'IV':4, 'IX':9, 'XL':40, 'XC':90, 'CD':400, 'CM':900}\\n values_res = dict(sorted(values_res.items(), key=lambda item: item[1] ,reverse=True))\\n\\n while num > 0:\\n num_str = str(num)\\n if num_str[0] not in ['4', '9']:\\n for symbol in values:\\n if num - values[symbol] >= 0:\\n res.append(symbol)\\n num -= values[symbol]\\n break\\n else: # num_str[0] in ['4', '9']:\\n for symbol in values_res:\\n if num - values_res[symbol] >= 0:\\n res.append(symbol)\\n num -= values_res[symbol]\\n break\\n\\n\\n\\n \\n return \\\"\\\".join(res)\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n roman_vals = {\\n 1:'I',\\n 5:'V',\\n 4:'IV',\\n 9:'IX',\\n 10:'X',\\n 40:'XL',\\n 50:'L',\\n 90:'XC',\\n 100:'C',\\n 400:'CD',\\n 500:'D',\\n 900:'CM',\\n 1000:'M'\\n }\\n num_lst: list = [int(c) for c in str(num)]\\n res: str = ''\\n \\n for i in range(len(num_lst)):\\n power_val = ((10**(len(num_lst)-(i+1))))\\n cur_val = num_lst[i]*power_val\\n \\n if cur_val in roman_vals.keys():\\n res += roman_vals[cur_val]\\n num_lst[i] -= 0\\n else:\\n while num_lst[i] != 0:\\n if 5*power_val<cur_val:\\n num_lst[i] -= 5\\n res += roman_vals[5*power_val]\\n else:\\n num_lst[i] -= 1\\n res += roman_vals[power_val]\\n cur_val = num_lst[i]*power_val\\n return res\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n dictionary = {1000:'M', 900:'CM', 500:'D', 400:'CD', 100:'C', 90:'XC', 50:'L', 40:'XL', 10:'X', 9:'IX', 5:'V', 4:'IV', 1:'I'}\\n ans=''\\n for key, val in dictionary.items():\\n while num>=key:\\n ans+=val\\n num-=key\\n if num==0:break\\n return ans\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n roman_values = [(1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'),(100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'),(10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')]\\n result = []\\n for value, symbol in roman_values:\\n while num >= value:\\n result.append(symbol)\\n num -= value\\n return ''.join(result)\\n \",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n valueSymbols = [(1000, 'M'), (900, 'CM'),\\n (500, 'D'), (400, 'CD'),\\n (100, 'C'), (90, 'XC'),\\n (50, 'L'), (40, 'XL'),\\n (10, 'X'), (9, 'IX'),\\n (5, 'V'), (4, 'IV'),\\n (1, 'I')]\\n ans=[]\\n for value, symbol in valueSymbols:\\n if num==0:\\n break\\n count , num= divmod(num,value)\\n ans.append(symbol*count)\\n return ''.join(ans)\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n d = {1:'I',\\n 4:'IV',\\n 5:'V',\\n 9:'IX',\\n 10:'X',\\n 40:'XL',\\n 50:'L',\\n 90:'XC',\\n 100:'C',\\n 400:'CD',\\n 500:'D',\\n 900:'CM',\\n 1000:'M'\\n }\\n res = []\\n nums = list(d.keys())[::-1]\\n i = 0\\n while num > 0:\\n while num >= nums[i]:\\n num -= nums[i]\\n res.append(d[nums[i]])\\n i += 1\\n return ''.join(res)\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"'''\\nNo Brute Force\\nTime: O(1) // Loop will iterate only 15 times\\nSpace: O(1) // Constant auxillary space\\n'''\\n\\nclass Solution:\\n def intToRoman(self, num: int) -> str:\\n dic = {1000: \\\"M\\\", 900: \\\"CM\\\", 500: \\\"D\\\", 400: \\\"CD\\\", 100: \\\"C\\\", 90: \\\"XC\\\", 50: \\\"L\\\", 40: \\\"XL\\\", 10: \\\"X\\\", 9: \\\"IX\\\", 5: \\\"V\\\", 4: \\\"IV\\\", 1: \\\"I\\\"}\\n ans = ''\\n for i in dic:\\n ans += dic[i] * (num // i)\\n num = num % i\\n return ans\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n dic = {\\n 1000: 'M',\\n 900: 'CM',\\n 500: 'D',\\n 400: 'CD',\\n 100: 'C',\\n 90: 'XC',\\n 50: 'L',\\n 40: 'XL',\\n 10: 'X',\\n 9: 'IX',\\n 5: 'V',\\n 4: 'IV',\\n 1: 'I'\\n }\\n n = num\\n ans = ''\\n while n > 0:\\n for x in (dic):\\n if n >= x:\\n i = n//x\\n n = n % x\\n \\n ans += dic[x] * i\\n break\\n return (ans)\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, number: int) -> str:\\n base = {\\n 1: \\\"I\\\",\\n 5: \\\"V\\\",\\n 10: \\\"X\\\",\\n 50: \\\"L\\\",\\n 100: \\\"C\\\",\\n 500: \\\"D\\\",\\n 1000: \\\"M\\\",\\n }\\n\\n if number <= 0:\\n return \\\"number can not less than or equal 0\\\"\\n elif number == 4000:\\n return \\\"MMMM\\\"\\n elif number > 4000:\\n return \\\"\\\"\\n \\n num_list = list(map(lambda x: int(x), str(number)))\\n power_list = range(len(num_list)-1, -1, -1)\\n zip_num_power = zip(num_list, power_list)\\n roman = ''\\n for num, power in zip_num_power:\\n digit = 10**power\\n val = num * digit\\n if val > 0 and val < 5*digit:\\n if val != 4*digit:\\n time = int(val / digit)\\n roman += base[digit]*time\\n else:\\n roman += base[digit]\\n roman += base[5*digit] \\n elif val >= 5*digit:\\n if val != 9*digit:\\n roman += base[5*digit]\\n time = int((val-5*digit) / digit)\\n roman += base[digit]*time\\n else:\\n roman += base[digit]\\n roman += base[val+digit]\\n return roman\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n \\n romans = {\\n 1: 'I',\\n 4: 'IV',\\n 5: 'V',\\n 9: 'IX',\\n 10: 'X',\\n 40: 'XL',\\n 50: 'L',\\n 90: 'XC',\\n 100: 'C',\\n 400: 'CD',\\n 500: 'D',\\n 900: 'CM',\\n 1000: 'M'\\n }\\n\\n multiplier = 1\\n output = ''\\n\\n def helper(num):\\n\\n output = ''\\n\\n if num == 0:\\n return ''\\n\\n while num not in romans:\\n lastSmallestKey = 0\\n lastSmallestVal = 0\\n\\n for k,v in romans.items():\\n if k < num:\\n lastSmallestKey = k\\n lastSmallestVal = v\\n else:\\n break\\n \\n num -= lastSmallestKey\\n output += lastSmallestVal\\n\\n output += romans[num]\\n return output\\n\\n while num > 0:\\n val = num % 10\\n output = helper(val * multiplier) + output\\n multiplier *= 10\\n num //= 10\\n\\n return output\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n res = []\\n values = {'I':1, 'V':5, 'X':10, 'L':50, 'C':100, 'D':500, 'M':1000}\\n values = dict(sorted(values.items(), key=lambda item: item[1] ,reverse=True))\\n values_res = {'IV':4, 'IX':9, 'XL':40, 'XC':90, 'CD':400, 'CM':900}\\n values_res = dict(sorted(values_res.items(), key=lambda item: item[1] ,reverse=True))\\n while num > 0:\\n num_str = str(num)\\n if num_str[0] not in ['4', '9']:\\n for symbol in values:\\n if num - values[symbol] >= 0:\\n res.append(symbol)\\n num -= values[symbol]\\n break\\n else: # num_str[0] in ['4', '9']:\\n for symbol in values_res:\\n if num - values_res[symbol] >= 0:\\n res.append(symbol)\\n num -= values_res[symbol]\\n break \\n return \\\"\\\".join(res)\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n # Creating Dictionary for Lookup\\n num_map = {\\n 1: \\\"I\\\",\\n 5: \\\"V\\\", 4: \\\"IV\\\",\\n 10: \\\"X\\\", 9: \\\"IX\\\",\\n 50: \\\"L\\\", 40: \\\"XL\\\",\\n 100: \\\"C\\\", 90: \\\"XC\\\",\\n 500: \\\"D\\\", 400: \\\"CD\\\",\\n 1000: \\\"M\\\", 900: \\\"CM\\\",\\n }\\n \\n # Result Variable\\n r = ''\\n \\n \\n for n in [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]:\\n # If n in list then add the roman value to result variable\\n while n <= num:\\n r += num_map[n]\\n num-=n\\n return r\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n symbol_val = {\\n 1 : \\\"I\\\",\\n 5 : \\\"V\\\",\\n 10 : \\\"X\\\",\\n 50 : \\\"L\\\",\\n 100 : \\\"C\\\",\\n 500 : \\\"D\\\",\\n 1000 : \\\"M\\\"\\n }\\n num = str(num)\\n ret_str = \\\"\\\"\\n for i, ch in enumerate(num):\\n repeat_times = len(num) - 1 - i\\n if ch == \\\"4\\\":\\n key_ch = int(\\\"5\\\" + \\\"0\\\" * repeat_times)\\n key_ch_minus = int(\\\"1\\\" + \\\"0\\\" * repeat_times)\\n ret_str += symbol_val[key_ch_minus] + symbol_val[key_ch]\\n continue\\n \\n if ch == \\\"9\\\":\\n key_ch = int(\\\"10\\\" + \\\"0\\\" * repeat_times)\\n key_ch_minus = int(\\\"1\\\" + \\\"0\\\" * repeat_times)\\n ret_str += symbol_val[key_ch_minus] + symbol_val[key_ch]\\n continue\\n \\n if ch in (\\\"1\\\", \\\"2\\\", \\\"3\\\"):\\n key_ch = int(\\\"1\\\" + (\\\"0\\\" * repeat_times))\\n ret_str += (symbol_val[key_ch] * int(ch))\\n continue\\n \\n if ch == \\\"5\\\":\\n key_ch = int(ch + (\\\"0\\\" * repeat_times))\\n ret_str += symbol_val[key_ch]\\n continue\\n \\n if ch in (\\\"6\\\", \\\"7\\\", \\\"8\\\"):\\n key_ch = int(\\\"1\\\" + (\\\"0\\\" * repeat_times))\\n key_5 = int(\\\"5\\\" + \\\"0\\\" * repeat_times)\\n ret_str += symbol_val[key_5] + symbol_val[key_ch] * (int(ch) - 5) \\n continue\\n \\n return ret_str\\n\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n # num = 3749\\n # Check value from Highest available symbol\\n \\n # Maintain running result\\n # Maintain output\\n res = 0\\n output = \\\"\\\"\\n hm = (\\n (1, \\\"I\\\",),\\n (4, \\\"IV\\\",),\\n (5, \\\"V\\\",),\\n (9, \\\"IX\\\"),\\n (10, \\\"X\\\"),\\n (40, \\\"XL\\\"),\\n (50, \\\"L\\\"),\\n (90, \\\"XC\\\"),\\n (100, \\\"C\\\"),\\n (400, \\\"CD\\\"),\\n (500, \\\"D\\\"),\\n (900, \\\"CM\\\"),\\n (1000, \\\"M\\\"),\\n )\\n\\n res = \\\"\\\"\\n\\n for val, numeral in reversed(hm):\\n if ctr := num // val:\\n res += (numeral * ctr)\\n num %= val \\n \\n return res\\n\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n # Strategy: While loop to coninuously apply these rules\\n roman = \\\"\\\"\\n int_to_roman = {\\n 1000: \\\"M\\\",\\n 900: \\\"CM\\\",\\n 500: \\\"D\\\",\\n 400: \\\"CD\\\",\\n 100: \\\"C\\\", \\n 90: \\\"XC\\\",\\n 50: \\\"L\\\",\\n 40: \\\"XL\\\",\\n 10: \\\"X\\\",\\n 9: \\\"IX\\\",\\n 5: \\\"V\\\",\\n 4: \\\"IV\\\",\\n 1: \\\"I\\\",\\n }\\n mapping_iter = iter(int_to_roman.keys())\\n while num > 0:\\n value = next(mapping_iter)\\n while num >= value:\\n roman += int_to_roman[value]\\n num -= value\\n \\n return roman \",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n roman=\\\"\\\"\\n numToLetter={\\n 1000:\\\"M\\\",\\n 900:\\\"CM\\\",\\n 500:\\\"D\\\",\\n 400:\\\"CD\\\",\\n 100:\\\"C\\\",\\n 90:\\\"XC\\\",\\n 50:\\\"L\\\",\\n 40:\\\"XL\\\",\\n 10:\\\"X\\\",\\n 9:\\\"IX\\\",\\n 5:\\\"V\\\",\\n 4:\\\"IV\\\",\\n 1:\\\"I\\\"\\n }\\n nums=numToLetter.keys()\\n for n in nums:\\n if num==0:\\n break\\n roman+=(num//n)*numToLetter[n]\\n num=num%n\\n return roman\\n \\n\\n \\n\\n \",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n s={1:'I',5:'V',10:'X',50:'L',100:'C',500:'D',1000:'M',4:'IV',9:'IX',40:'XL',90:'XC',400:'CD',900:'CM'}\\n o=\\\"\\\"\\n pw=0\\n while num:\\n d=num%10*10**pw\\n num//=10\\n pw+=1\\n mx=None\\n if d in s:\\n o=s[d]+o\\n else:\\n o1=\\\"\\\"\\n while d>0:\\n mx=0\\n for k in s:\\n if (mx is None or (k>mx and k<=d)):\\n mx=k\\n o1+=s[mx]\\n d-=mx\\n o=o1+o\\n return o\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n # get decimal place values of num, from highest to lowest\\n num_as_string = str(num)\\n max_index = len(num_as_string)\\n decimal_place_values = []\\n for i, digit in enumerate(num_as_string):\\n decimal_place_values.append(int(digit) * 10 ** (max_index - i - 1))\\n # Get correct symbol for this value, append to result, subtract that \\n returnString = \\\"\\\"\\n for value in decimal_place_values:\\n subtractive_map = {4: \\\"IV\\\", 9: \\\"IX\\\", 40: \\\"XL\\\", 90: \\\"XC\\\", 400: \\\"CD\\\", \\n 900: \\\"CM\\\"}\\n if value in subtractive_map.keys():\\n returnString += subtractive_map[value]\\n else:\\n numeralsMap = {1: \\\"I\\\", 5: \\\"V\\\", 10: \\\"X\\\", 50: \\\"L\\\", 100: \\\"C\\\", 500: \\\"D\\\", \\n 1000: \\\"M\\\"}\\n while value > 0:\\n # find max value less than num\\n max_val_less_than = [x for x in numeralsMap.keys() if x <= value][-1]\\n value -= max_val_less_than\\n returnString += numeralsMap[max_val_less_than]\\n return returnString\\n\\n \",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n symList = [['M', 1000], ['CM', 900], ['D', 500], ['CD', 400], ['C', 100], ['XC', 90], ['L', 50], ['XL', 40], ['X', 10], ['IX', 9], ['V', 5], ['IV', 4], ['I', 1]]\\n\\n total = ''\\n\\n for sym, val in symList:\\n if num // val:\\n count = num // val\\n total += (sym * count)\\n num = num % val\\n \\n return total\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n values = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\\n numerals = [\\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\"]\\n\\n res = \\\"\\\"\\n i = 0\\n while num:\\n res += (num // values[i]) * numerals[i]\\n num %= values[i]\\n i += 1\\n return res\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n hashmap={\\n # 1: {\\n # 1: \\\"I\\\",\\n # 5: \\\"V\\\",\\n # },\\n # 2:{\\n # 10: \\\"X\\\",\\n # 50: \\\"L\\\",\\n # },\\n # 3: {\\n # 100: \\\"C\\\",\\n # 500: \\\"D\\\",\\n # },\\n # 4: {\\n # 1000: \\\"M\\\"\\n # },\\n 1: \\\"I\\\",\\n 5: \\\"V\\\",\\n 10: \\\"X\\\",\\n 50: \\\"L\\\",\\n 100: \\\"C\\\",\\n 500: \\\"D\\\",\\n 1000: \\\"M\\\"\\n }\\n unit={\\n 1: 1,\\n 2: 10,\\n 3: 100,\\n 4: 1000\\n }\\n rs = ''\\n prev = 0\\n # 3749 -> i=1 -> s[i] = 3\\n s = str(num)\\n for i in range(len(s)):\\n # tmp_part = (5 if s[i] >= 5 else 1)\\n # tmp_letter_value = tmp_part * unit[len(s)-i] \\n tmp_letter_value = (5 if (int(s[i]) >= 5 and int(s[i]) <= 9) else 1) * unit[len(s)-i]\\n # 9, 7, 5, 4, 3\\n if int(s[i]) == 0: rs+=''\\n elif int(s[i]) < 4:\\n rs += hashmap[tmp_letter_value] * int(s[i])\\n elif int(s[i]) == 4 :\\n rs += hashmap[tmp_letter_value] + hashmap[(tmp_letter_value*5)]\\n elif int(s[i]) == 5 :\\n rs += hashmap[tmp_letter_value]\\n elif int(s[i]) < 9:\\n rs += hashmap[tmp_letter_value] + hashmap[tmp_letter_value/5] * (int(s[i])-5)\\n else: rs += hashmap[tmp_letter_value/5] + hashmap[tmp_letter_value*2]\\n print(f'i={i} --> s[i]={s[i]} && tmp_letter_value={tmp_letter_value} --> rs={rs}')\\n return rs\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n DICTIONARY = {\\n 1000: \\\"M\\\",\\n 900: \\\"CM\\\",\\n 500: \\\"D\\\",\\n 400: \\\"CD\\\",\\n 100: \\\"C\\\",\\n 90: \\\"XC\\\",\\n 50: \\\"L\\\",\\n 40: \\\"XL\\\",\\n 10: \\\"X\\\",\\n 9: \\\"IX\\\",\\n 5: \\\"V\\\",\\n 4: \\\"IV\\\",\\n 1: \\\"I\\\",\\n }\\n\\n def simpleIntToRoman(self, num: int) -> str:\\n # accepts numbers with a single non-zero digit and converts them to their\\n # roman numeral form\\n print(f\\\"simpleIntToRoman: {num}\\\")\\n if not num:\\n return ''\\n for k, val in Solution.DICTIONARY.items():\\n # 800\\n if k == num:\\n return val\\n elif k > num: # 900 > 800\\n continue\\n elif k < num: # 500 < 800\\n rem = num - k # 300 = 800 - 500\\n rem_tens = 10 ** (math.ceil(math.log(num, 10)) - 1) # 300 => 100\\n rem_mult = int(rem / rem_tens)\\n try:\\n return Solution.DICTIONARY.get(\\n k\\n ) + rem_mult * Solution.DICTIONARY.get(rem_tens)\\n except Exception as e:\\n print(locals())\\n raise e\\n\\n print(locals())\\n raise Exception(\\\"unhandled\\\")\\n # return 500 + 3*100\\n\\n def intToRoman(self, num: int) -> str:\\n # 3749 = MMMDCCXLIX\\n # 58 = LVIII\\n # 1994 = MCMXCIV\\n split = [(num % 10**xp) - (num % 10 ** (xp - 1)) for xp in range(math.ceil(math.log(num, 10))+1, 0, -1)]\\n try:\\n return \\\"\\\".join([self.simpleIntToRoman(x) for x in split])\\n # s = \\\"\\\"\\n # for x in split:\\n # s += self.simpleIntToRoman(x)\\n # return s\\n # return \\n except Exception as e:\\n print(locals())\\n raise e\\n # 3749 = [3000, 700, 40, 9]\\n # 58 = [50, 8]\\n # 1994 = [1000, 900, 90, 4]\\n\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n map_dict = {1:'I',5:'V',10:'X',50:'L',100:'C',500:'D',1000:'M'}\\n map_sub_form = {900:'CM',400:'CD',90:'XC',40:'XL',9:'IX',4:'IV'}\\n map_sort = sorted(map_dict, reverse=True)\\n results = ''\\n while num:\\n for k in map_sort:\\n if int(str(num)[0]) not in [4,9]:\\n if int(num/k) > 0:\\n if k in [1,10,100,1000]:\\n if num/k < 4:\\n results += (map_dict[k] * int(num/k))\\n num -= k * int(num/k)\\n else:\\n results += (map_dict[k] * 3)\\n num -= k * 3\\n else:\\n results += map_dict[k]\\n num -= k\\n else:\\n continue\\n else:\\n if len(str(num)) != 1:\\n key = (10**(len(str(num))-1)) * int(str(num)[0])\\n else:\\n key = num\\n results += map_sub_form[key]\\n num -= key\\n return results\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n num_str = str(num)\\n\\n numeral_lst = []\\n\\n numeral_dict = {1 : \\\"I\\\", 5 : \\\"V\\\", 10 : \\\"X\\\", 50 : \\\"L\\\", 100 : \\\"C\\\", 500 : \\\"D\\\", 1000 : \\\"M\\\"}\\n\\n for i in range(len(num_str)):\\n\\n exponent = (len(num_str) - i - 1)\\n total = int(num_str[i]) * (10 ** exponent)\\n\\n if int(num_str[i]) != 4 and int(num_str[i]) != 9:\\n while total != 0:\\n if total >= 5 * (10 ** exponent):\\n numeral_lst.append(numeral_dict[5 * (10 ** exponent)])\\n total -= 5 * (10 ** exponent)\\n else:\\n print(exponent)\\n numeral_lst.append(numeral_dict[1 * (10 ** exponent)])\\n total -= 1 * (10 ** exponent)\\n else:\\n numeral_lst.append(numeral_dict[1 * (10 ** exponent)])\\n numeral_lst.append(numeral_dict[(int(num_str[i])+1) * (10 ** exponent)])\\n return \\\"\\\".join(numeral_lst)\",\n \"runtime\": \"61\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":74,"string":"74"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n symbols= [['M',1000],['CM',900],['D',500],['CD',400],['C',100],['XC',90],['L',50],\n ['XL',40],['X',10],['IX',9],['V',5],['IV',4],['I',1]]\n ans = \"\"\n \n for sym,value in symbols:\n res = num // value\n ans += res * (sym)\n num = num % value\n if num == 0 :\n return ans\n \n\n","memory":"16100"},{"code":"\nclass Solution:\n def intToRoman(self, num: int) -> str:\n\n val = {\n 1: 'I',\n 4: 'IV',\n 5: 'V',\n 9: 'IX',\n 10: 'X',\n 40: 'XL',\n 50: 'L',\n 90: 'XC',\n 100: 'C',\n 400: 'CD',\n 500: 'D',\n 900: 'CM',\n 1000: 'M'\n }\n \n # def findmin(num,target):\n # start = 0\n # arr = val.keys().sorted()\n # end = len(arr) -1\n # while(start<=end):\n # mid = (start+end)//2\n # if(arr[mid]>target):\n # end = mid-1\n # else:\n # start = mid+1\n # return mid\n L = list(val.keys())\n L.sort(reverse = True)\n print(L)\n s = \"\"\n curr = 0\n while(num):\n print(num)\n s += val[L[curr]]*(num//L[curr])\n num%=L[curr]\n curr+=1\n return s","memory":"16200"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n val_dict = {\n 1000: 'M',\n 900: 'CM',\n 500: 'D',\n 400: 'CD',\n 100: 'C',\n 90: 'XC',\n 50: 'L',\n 40: 'XL',\n 10: 'X',\n 9: 'IX',\n 5: 'V',\n 4: 'IV',\n 1: 'I'\n }\n \n remainder = num\n roman = ''\n\n # 3749\n # 1000 - 3 - MMM - 749\n # 500 - 1 - D - 249\n # 100 - 2 - CC - 49\n # 50 - 0 \n\n for val in val_dict:\n while remainder - val >= 0:\n remainder -= val\n roman += val_dict[val] \n return roman\n","memory":"16300"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n s = \"\"\n while num > 0:\n if num >= 1000:\n num -= 1000\n s += \"M\"\n elif num >= 900:\n num -= 900\n s += \"CM\"\n elif num >= 500:\n num -= 500\n s += \"D\"\n elif num >= 400:\n num -= 400\n s += \"CD\"\n elif num >= 100:\n num -= 100\n s += \"C\"\n elif num >= 90:\n num -= 90\n s += \"XC\"\n elif num >= 50:\n num -= 50\n s += \"L\"\n elif num >= 40:\n num -= 40\n s += \"XL\"\n elif num >= 10:\n num -= 10\n s += \"X\"\n elif num >= 9:\n num -= 9\n s += \"IX\"\n elif num >= 5:\n num -= 5\n s += \"V\"\n elif num >= 4:\n num -= 4\n s += \"IV\"\n elif num >= 1:\n num -= 1\n s += \"I\"\n return s\n\n","memory":"16300"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n if num <=0:\n return False\n sym=['M','CM','D','CD','C','XC','L','XL','X','IX','V','IV','I']\n val=[1000,900,500,400,100,90,50,40,10,9,5,4,1]\n i=0\n roman=''\n while num >0:\n for j in range(num//val[i]):\n roman +=sym[i]\n num -= val[i]\n i +=1\n return roman","memory":"16400"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n valueSymbols = [(1000, 'M'), (900, 'CM'),\n (500, 'D'), (400, 'CD'),\n (100, 'C'), (90, 'XC'),\n (50, 'L'), (40, 'XL'),\n (10, 'X'), (9, 'IX'),\n (5, 'V'), (4, 'IV'),\n (1, 'I')]\n ans=[]\n for value, symbol in valueSymbols:\n if num==0:\n break\n count , num= divmod(num,value)\n ans.append(symbol*count)\n return ''.join(ans)","memory":"16400"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n roman_numerals = {\n 1: \"I\",\n 4: \"IV\",\n 5: \"V\",\n 9: \"IX\",\n 10: \"X\",\n 40: \"XL\",\n 50: \"L\",\n 90: \"XC\",\n 100: \"C\",\n 400: \"CD\",\n 500: \"D\",\n 900: \"CM\",\n 1000: \"M\"\n }\n res = ''\n for delimeter in (1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1):\n n = num // delimeter\n res+= roman_numerals[delimeter] * n\n num -= delimeter * n\n return res\n ","memory":"16500"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n digits = [(1000, \"M\"), (900, \"CM\"), (500, \"D\"), (400, \"CD\"), (100, \"C\"), \n (90, \"XC\"), (50, \"L\"), (40, \"XL\"), (10, \"X\"), (9, \"IX\"), \n (5, \"V\"), (4, \"IV\"), (1, \"I\")]\n res = []\n for i, v in digits:\n if num == 0:\n break\n count, num = divmod(num, i)\n res.append(v * count)\n return ''.join(res)","memory":"16500"},{"code":"class Solution:\n def intToRoman(self, num: int) -> str:\n res = ''\n n = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\n c = [\"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\"]\n i = 0\n while num > 0:\n if num >= n[i]:\n res += c[i]\n num -= n[i]\n else:\n i += 1\n return res\n \n \n \n","memory":"16600"},{"code":"class Solution:\n def intToRoman(self, n: int) -> str:\n m = {1:\"I\",2:\"II\",3:\"III\",4:\"IV\",5:\"V\",6:\"VI\",7:\"VII\",8:\"VIII\",\n 9:\"IX\",10:\"X\",20:\"XX\",30:\"XXX\",40:\"XL\",\n 50:\"L\",60:\"LX\",70:\"LXX\",80:\"LXXX\",90:\"XC\",100:\"C\",200:\"CC\",\n 300:\"CCC\",400:\"CD\",500:\"D\",600:\"DC\",700:\"DCC\",\n 800:\"DCCC\",900:\"CM\",1000:\"M\",2000:\"MM\",3000:\"MMM\"}\n ans = \"\"\n k = 0\n while n > 0:\n dig = (n%10)*10**k\n if dig != 0:\n ans = m[dig]+ans\n n//=10\n k+=1\n return ans","memory":"16600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n symbols= [['M',1000],['CM',900],['D',500],['CD',400],['C',100],['XC',90],['L',50],\\n ['XL',40],['X',10],['IX',9],['V',5],['IV',4],['I',1]]\\n ans = \\\"\\\"\\n \\n for sym,value in symbols:\\n res = num // value\\n ans += res * (sym)\\n num = num % value\\n if num == 0 :\\n return ans\\n \\n\\n\",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def intToRoman(self, num: int) -> str:\\n\\n val = {\\n 1: 'I',\\n 4: 'IV',\\n 5: 'V',\\n 9: 'IX',\\n 10: 'X',\\n 40: 'XL',\\n 50: 'L',\\n 90: 'XC',\\n 100: 'C',\\n 400: 'CD',\\n 500: 'D',\\n 900: 'CM',\\n 1000: 'M'\\n }\\n \\n # def findmin(num,target):\\n # start = 0\\n # arr = val.keys().sorted()\\n # end = len(arr) -1\\n # while(start<=end):\\n # mid = (start+end)//2\\n # if(arr[mid]>target):\\n # end = mid-1\\n # else:\\n # start = mid+1\\n # return mid\\n L = list(val.keys())\\n L.sort(reverse = True)\\n print(L)\\n s = \\\"\\\"\\n curr = 0\\n while(num):\\n print(num)\\n s += val[L[curr]]*(num//L[curr])\\n num%=L[curr]\\n curr+=1\\n return s\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n val_dict = {\\n 1000: 'M',\\n 900: 'CM',\\n 500: 'D',\\n 400: 'CD',\\n 100: 'C',\\n 90: 'XC',\\n 50: 'L',\\n 40: 'XL',\\n 10: 'X',\\n 9: 'IX',\\n 5: 'V',\\n 4: 'IV',\\n 1: 'I'\\n }\\n \\n remainder = num\\n roman = ''\\n\\n # 3749\\n # 1000 - 3 - MMM - 749\\n # 500 - 1 - D - 249\\n # 100 - 2 - CC - 49\\n # 50 - 0 \\n\\n for val in val_dict:\\n while remainder - val >= 0:\\n remainder -= val\\n roman += val_dict[val] \\n return roman\\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n s = \\\"\\\"\\n while num > 0:\\n if num >= 1000:\\n num -= 1000\\n s += \\\"M\\\"\\n elif num >= 900:\\n num -= 900\\n s += \\\"CM\\\"\\n elif num >= 500:\\n num -= 500\\n s += \\\"D\\\"\\n elif num >= 400:\\n num -= 400\\n s += \\\"CD\\\"\\n elif num >= 100:\\n num -= 100\\n s += \\\"C\\\"\\n elif num >= 90:\\n num -= 90\\n s += \\\"XC\\\"\\n elif num >= 50:\\n num -= 50\\n s += \\\"L\\\"\\n elif num >= 40:\\n num -= 40\\n s += \\\"XL\\\"\\n elif num >= 10:\\n num -= 10\\n s += \\\"X\\\"\\n elif num >= 9:\\n num -= 9\\n s += \\\"IX\\\"\\n elif num >= 5:\\n num -= 5\\n s += \\\"V\\\"\\n elif num >= 4:\\n num -= 4\\n s += \\\"IV\\\"\\n elif num >= 1:\\n num -= 1\\n s += \\\"I\\\"\\n return s\\n\\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n if num <=0:\\n return False\\n sym=['M','CM','D','CD','C','XC','L','XL','X','IX','V','IV','I']\\n val=[1000,900,500,400,100,90,50,40,10,9,5,4,1]\\n i=0\\n roman=''\\n while num >0:\\n for j in range(num//val[i]):\\n roman +=sym[i]\\n num -= val[i]\\n i +=1\\n return roman\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n valueSymbols = [(1000, 'M'), (900, 'CM'),\\n (500, 'D'), (400, 'CD'),\\n (100, 'C'), (90, 'XC'),\\n (50, 'L'), (40, 'XL'),\\n (10, 'X'), (9, 'IX'),\\n (5, 'V'), (4, 'IV'),\\n (1, 'I')]\\n ans=[]\\n for value, symbol in valueSymbols:\\n if num==0:\\n break\\n count , num= divmod(num,value)\\n ans.append(symbol*count)\\n return ''.join(ans)\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n roman_numerals = {\\n 1: \\\"I\\\",\\n 4: \\\"IV\\\",\\n 5: \\\"V\\\",\\n 9: \\\"IX\\\",\\n 10: \\\"X\\\",\\n 40: \\\"XL\\\",\\n 50: \\\"L\\\",\\n 90: \\\"XC\\\",\\n 100: \\\"C\\\",\\n 400: \\\"CD\\\",\\n 500: \\\"D\\\",\\n 900: \\\"CM\\\",\\n 1000: \\\"M\\\"\\n }\\n res = ''\\n for delimeter in (1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1):\\n n = num // delimeter\\n res+= roman_numerals[delimeter] * n\\n num -= delimeter * n\\n return res\\n \",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n digits = [(1000, \\\"M\\\"), (900, \\\"CM\\\"), (500, \\\"D\\\"), (400, \\\"CD\\\"), (100, \\\"C\\\"), \\n (90, \\\"XC\\\"), (50, \\\"L\\\"), (40, \\\"XL\\\"), (10, \\\"X\\\"), (9, \\\"IX\\\"), \\n (5, \\\"V\\\"), (4, \\\"IV\\\"), (1, \\\"I\\\")]\\n res = []\\n for i, v in digits:\\n if num == 0:\\n break\\n count, num = divmod(num, i)\\n res.append(v * count)\\n return ''.join(res)\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, num: int) -> str:\\n res = ''\\n n = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\\n c = [\\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\"]\\n i = 0\\n while num > 0:\\n if num >= n[i]:\\n res += c[i]\\n num -= n[i]\\n else:\\n i += 1\\n return res\\n \\n \\n \\n\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def intToRoman(self, n: int) -> str:\\n m = {1:\\\"I\\\",2:\\\"II\\\",3:\\\"III\\\",4:\\\"IV\\\",5:\\\"V\\\",6:\\\"VI\\\",7:\\\"VII\\\",8:\\\"VIII\\\",\\n 9:\\\"IX\\\",10:\\\"X\\\",20:\\\"XX\\\",30:\\\"XXX\\\",40:\\\"XL\\\",\\n 50:\\\"L\\\",60:\\\"LX\\\",70:\\\"LXX\\\",80:\\\"LXXX\\\",90:\\\"XC\\\",100:\\\"C\\\",200:\\\"CC\\\",\\n 300:\\\"CCC\\\",400:\\\"CD\\\",500:\\\"D\\\",600:\\\"DC\\\",700:\\\"DCC\\\",\\n 800:\\\"DCCC\\\",900:\\\"CM\\\",1000:\\\"M\\\",2000:\\\"MM\\\",3000:\\\"MMM\\\"}\\n ans = \\\"\\\"\\n k = 0\\n while n > 0:\\n dig = (n%10)*10**k\\n if dig != 0:\\n ans = m[dig]+ans\\n n//=10\\n k+=1\\n return ans\",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":10,"string":"10"}}},{"rowIdx":179,"cells":{"question_id":{"kind":"number","value":13,"string":"13"},"name":{"kind":"string","value":"roman-to-integer"},"content":{"kind":"string","value":"<p>Roman numerals are represented by seven different symbols: <code>I</code>, <code>V</code>, <code>X</code>, <code>L</code>, <code>C</code>, <code>D</code> and <code>M</code>.</p>\n\n<pre>\n<strong>Symbol</strong> <strong>Value</strong>\nI 1\nV 5\nX 10\nL 50\nC 100\nD 500\nM 1000</pre>\n\n<p>For example, <code>2</code> is written as <code>II</code> in Roman numeral, just two ones added together. <code>12</code> is written as <code>XII</code>, which is simply <code>X + II</code>. The number <code>27</code> is written as <code>XXVII</code>, which is <code>XX + V + II</code>.</p>\n\n<p>Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not <code>IIII</code>. Instead, the number four is written as <code>IV</code>. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as <code>IX</code>. There are six instances where subtraction is used:</p>\n\n<ul>\n\t<li><code>I</code> can be placed before <code>V</code> (5) and <code>X</code> (10) to make 4 and 9. </li>\n\t<li><code>X</code> can be placed before <code>L</code> (50) and <code>C</code> (100) to make 40 and 90. </li>\n\t<li><code>C</code> can be placed before <code>D</code> (500) and <code>M</code> (1000) to make 400 and 900.</li>\n</ul>\n\n<p>Given a roman numeral, convert it to an integer.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "III"\n<strong>Output:</strong> 3\n<strong>Explanation:</strong> III = 3.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "LVIII"\n<strong>Output:</strong> 58\n<strong>Explanation:</strong> L = 50, V= 5, III = 3.\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "MCMXCIV"\n<strong>Output:</strong> 1994\n<strong>Explanation:</strong> M = 1000, CM = 900, XC = 90 and IV = 4.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= s.length <= 15</code></li>\n\t<li><code>s</code> contains only the characters <code>('I', 'V', 'X', 'L', 'C', 'D', 'M')</code>.</li>\n\t<li>It is <strong>guaranteed</strong> that <code>s</code> is a valid roman numeral in the range <code>[1, 3999]</code>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":62.64905184925924,"string":"62.649052"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["hash-table","math","string"],"string":"[\n \"hash-table\",\n \"math\",\n \"string\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"19\", 0.0057], [\"20\", 0.0057], [\"21\", 0.0038], [\"22\", 0.0114], [\"23\", 0.0438], [\"24\", 0.0286], [\"25\", 0.0228], [\"26\", 0.0666], [\"27\", 0.1409], [\"28\", 0.1599], [\"29\", 0.1428], [\"30\", 0.3123], [\"31\", 0.457], [\"32\", 0.6074], [\"33\", 0.4646], [\"34\", 0.9863], [\"35\", 1.4109], [\"36\", 1.609], [\"37\", 1.449], [\"38\", 2.5153], [\"39\", 2.9228], [\"40\", 3.376], [\"41\", 3.2865], [\"42\", 4.5451], [\"43\", 4.6594], [\"44\", 5.3125], [\"45\", 5.3505], [\"46\", 6.0722], [\"47\", 5.6343], [\"48\", 5.7542], [\"49\", 5.758], [\"50\", 5.6628], [\"51\", 4.8802], [\"52\", 4.6689], [\"53\", 4.1262], [\"54\", 3.5416], [\"55\", 2.8981], [\"56\", 2.3706], [\"57\", 1.8946], [\"58\", 1.4338]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"15900\", 0.0038], [\"16000\", 0.0057], [\"16100\", 0.0171], [\"16200\", 0.0533], [\"16300\", 0.4836], [\"16400\", 10.8744], [\"16500\", 41.9228], [\"16600\", 39.4665]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n # dic = {\n # 'I': 1,\n # 'V': 5,\n # 'X': 10,\n # 'L': 50,\n # 'C': 100,\n # 'D': 500,\n # 'M': 1000\n # }\n \n # total_sum = 0\n # for char in s:\n # total_sum += dic[char]\n \n # for i in range(len(s)-1):\n # if s[i] + s[i+1] == 'IV' or s[i] + s[i+1] == 'IX':\n # total_sum -= 2\n # elif s[i] + s[i+1] == 'XL' or s[i] + s[i+1] == 'XC':\n # total_sum -= 20\n # elif s[i] + s[i+1] == 'CD' or s[i] + s[i+1] == 'CM':\n # total_sum -= 200\n \n #return total_sum\n\n # dic = {\n # 'I': 1,\n # 'V': 5,\n # 'X': 10,\n # 'L': 50,\n # 'C': 100,\n # 'D': 500,\n # 'M': 1000\n # }\n \n # total_sum = 0\n # for i in range(len(s)):\n # if i < len(s)-1 and dic[s[i]] < dic[s[i+1]]:\n # total_sum -= dic[s[i]]\n # else:\n # total_sum += dic[s[i]]\n \n # return total_sum\n\n\n\n\n\n dic = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}\n tot_sum = 0\n n = len(s)\n \n for i in range(n):\n if i < n-1 and dic[s[i]] < dic[s[i+1]]:\n tot_sum -= dic[s[i]]\n else:\n tot_sum += dic[s[i]]\n \n return tot_sum\n ","runtime":"19"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n numeral_values = {\n \"I\" : 1,\n \"V\" : 5,\n \"X\" : 10,\n \"L\" : 50, \n \"C\" :100,\n \"D\" : 500,\n \"M\" : 1000\n }\n number_val = 0\n s = s.replace('IV', 'IIII')\n s = s.replace('IX', 'IIIIV')\n s = s.replace('XL', 'XXXX')\n s = s.replace('XC', 'XXXXXXXXX')\n s = s.replace('CD', 'CCCC')\n s = s.replace('CM', 'DCCCC')\n for i in s:\n number_val += numeral_values[i]\n return number_val\n","runtime":"20"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n m = {\n \"I\": 1, \n \"V\": 5, \n \"X\": 10, \n \"L\": 50, \n \"C\": 100, \n \"D\": 500, \n \"M\": 1000, \n }\n\n answer = 0\n\n for i in range(len(s)):\n if i < len(s) - 1 and m[s[i]] < m[s[i + 1]]:\n answer -= m[s[i]]\n else:\n answer += m[s[i]]\n return answer","runtime":"21"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n m = {\n 'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000\n }\n \n ans = 0\n \n for i in range(len(s)):\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\n ans -= m[s[i]]\n else:\n ans += m[s[i]]\n \n return ans","runtime":"22"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n roman_numerals = {\n \"I\": 1,\n \"V\": 5,\n \"X\": 10,\n \"L\": 50,\n \"C\": 100,\n \"D\": 500,\n \"M\": 1000\n }\n prev_val = None\n val = 0\n for i in s:\n if prev_val:\n if roman_numerals[prev_val] < roman_numerals[i]:\n val += roman_numerals[i] - roman_numerals[prev_val]*2\n else:\n val += roman_numerals[i]\n\n else:\n val += roman_numerals[i]\n prev_val = i\n\n\n return val \n","runtime":"23"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n m = {\n 'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000\n }\n \n ans = 0\n \n for i in range(len(s)):\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\n ans -= m[s[i]]\n else:\n ans += m[s[i]]\n \n return ans","runtime":"26"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n values = {'I' : 1 ,\n 'V' : 5 ,\n 'X' : 10 ,\n 'L' : 50 ,\n 'C' : 100 ,\n 'D' : 500 ,\n 'M' : 1000 }\n\n number = 0\n for index in range(len(s)):\n a = values[s[index]]\n if index > 0 and values[s[index - 1]] < a:\n number += a - (values[s[index - 1]] * 2)\n continue\n number += a\n\n \n return number\n # O(n) O(1)","runtime":"27"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n roman_dict = {\n 'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000\n }\n\n result = 0\n curr_val = 0\n prev_val = 0 \n\n for char in s: \n curr_val = roman_dict[char]\n\n if curr_val > prev_val:\n result += curr_val - (2*prev_val)\n else: \n result += curr_val \n \n prev_val = curr_val \n \n return result","runtime":"28"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n ans = 0\n roman = {'I': 1, 'V': 5, 'X': 10, 'L': 50,\n 'C': 100, 'D': 500, 'M': 1000}\n\n for a, b in zip(s, s[1:]):\n if roman[a] < roman[b]:\n ans -= roman[a]\n else:\n ans += roman[a]\n\n return ans + roman[s[-1]]","runtime":"29"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n symbolDict = {\n \"M\": 1000,\n \"D\": 500,\n \"C\": 100,\n \"L\": 50,\n \"X\": 10,\n \"V\": 5,\n \"I\": 1\n }\n currSum=0\n for i in range(len(s)):\n if (i<len(s)-1 and (symbolDict[s[i+1]]>symbolDict[s[i]] )):\n currSum-=symbolDict[s[i]] \n else:\n currSum+=symbolDict[s[i]]\n return currSum","runtime":"30"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n roman_to_int = {\n 'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000\n }\n \n total = 0\n prev_value = 0\n \n # Iterate over the string in reverse\n for char in reversed(s):\n # Get the integer value of the current Roman numeral character\n current_value = roman_to_int[char]\n \n # If the current value is less than the previous one, subtract it\n if current_value < prev_value:\n total -= current_value\n else:\n total += current_value\n \n # Update previous value to current\n prev_value = current_value\n \n return total\n","runtime":"30"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n roman_to_int = {'I' : 1,\n 'V' : 5,\n 'X' : 10,\n 'L' : 50,\n 'C' : 100,\n 'D' : 500,\n 'M' : 1000}\n x = 0\n prev = 0\n\n for char in s:\n value = roman_to_int[char]\n if prev < value:\n x += value - 2 * prev\n else:\n x+=value\n\n prev = value\n\n return x","runtime":"31"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n roman_values = {'I': 1,'V': 5,'X': 10,'L': 50,'C': 100,'D': 500,'M': 1000}\n res=0\n res=roman_values[s[-1]]\n for i in range(len(s)-1,0,-1):\n if roman_values[s[i]]>roman_values[s[i-1]]:\n res=res-roman_values[s[i-1]]\n else:\n res+=roman_values[s[i-1]]\n return res\n\n ","runtime":"32"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n d = {\"I\": 1, \"V\": 5, \"X\": 10, \"L\": 50, \"C\": 100, \"D\": 500, \"M\": 1000}\n\n total = 0\n for i in range(len(s) - 1):\n if d[s[i]] < d[s[i + 1]]:\n total -= d[s[i]]\n else:\n total += d[s[i]]\n return total + d[s[-1]]","runtime":"32"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n conversion={\n \"I\" : 1,\n \"V\" : 5,\n \"X\" : 10,\n \"L\" : 50,\n \"C\" : 100,\n \"D\" : 500,\n \"M\" : 1000,\n \"IV\" : 4,\n \"IX\" : 9,\n \"XL\" : 40, \"XC\":90,\n \"CD\" : 400, \"CM\" : 900\n }\n answer=0\n i=0\n while(i<len(s)):\n if s[i:i+2] in conversion:\n answer += conversion[s[i:i+2]]\n i+=2\n else:\n answer += conversion[s[i]]\n i+=1\n return answer","runtime":"33"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n total = 0\n d = {\"I\":1,\"V\":5,\"X\":10,\"L\":50,\"C\":100,\"D\":500,\"M\":1000}\n for i in range(len(s)-1):\n if d[s[i]]<d[s[i+1]]:\n total-=d[s[i]]\n else:\n total+=d[s[i]]\n total += d[s[-1]]\n return total \n\n ","runtime":"33"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n numerals = {'I':1, 'V':5, 'X':10, 'L':50, 'C':100, 'D':500, 'M':1000}\n total = 0\n prev_value = 0\n\n # Iterate over each character in the string\n for char in s:\n # Get the value of the current numeral\n current_value = numerals[char]\n\n # If the current numeral is greater than the previous one, subtract twice the previous one (adjust for previous addition)\n if current_value > prev_value:\n total += current_value - 2 * prev_value\n else:\n total += current_value\n \n # Update prev_value for the next iteration\n prev_value = current_value\n\n return total","runtime":"34"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n hello = {\"I\": 1, \"V\": 5, \"X\": 10, \"L\": 50, \"C\": 100, \"D\": 500, \"M\":1000} \n\n ans = 0\n for i in range(len(s)):\n if i < len(s) - 1 and hello[s[i]] < hello[s[i + 1]]:\n ans = ans - hello[s[i]]\n else:\n ans = ans + hello[s[i]]\n return ans ","runtime":"34"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n romanMap = {\"M\":1000,\"D\":500,\"C\":100,\"L\":50,\"X\":10,\"V\":5,\"I\":1}\n sum = 0\n i = 0\n while i < len(s):\n\n if i < len(s) - 1 and romanMap[s[i]] < romanMap[s[i+1]]:\n sum += (romanMap[s[i+1]] - romanMap[s[i]])\n i+=2\n else:\n sum += romanMap[s[i]]\n i+=1\n return sum\n \n\n ","runtime":"35"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n roman_rep={\n 'I':1,\n 'V':5,\n 'X':10,\n 'L':50,\n 'C':100,\n 'D':500,\n 'M':1000\n }\n \n roman_to_int=[]\n skip_flag=False\n for index,letter in enumerate(s):\n if skip_flag:\n skip_flag=False\n continue\n if index<len(s)-1:\n next_letter=s[index+1]\n if roman_rep[next_letter]>roman_rep[letter]:\n skip_flag=True\n value=roman_rep[next_letter]-roman_rep[letter]\n roman_to_int.append(value)\n if index+1 == len(s)-1:\n break\n if skip_flag==False:\n value=roman_rep[letter]\n roman_to_int.append(value)\n \n return sum(roman_to_int)","runtime":"35"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n if s == None:\n return 0\n roman={\n 'I':1,\n 'V':5,\n 'X':10,\n 'L':50,\n 'C':100,\n 'D':500,\n 'M':1000\n }\n num=roman[s[len(s)-1]]\n for i in range(len(s)-2,-1,-1):\n top=s[i]\n if roman[top] < roman[s[i+1]]:\n num=num-roman[top]\n else:\n num=num+roman[top]\n return num\n\n","runtime":"36"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n ans = 0\n \n dicty = {\"I\":1,\"X\":10,\"V\":5,\"L\":50,\"C\":100,\"D\":500,\"M\":1000}\n\n excepty = {\"IV\":-2,\"IX\": -2, \"XL\":-20, \"XC\":-20, \"CD\":-200,\"CM\":-200 }\n\n for key in excepty:\n if key in s: ans+=excepty[key] \n\n for rom in s:\n if rom in dicty:\n ans += dicty[rom]\n return ans\n \n\n\n\n ","runtime":"36"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n m = {\n 'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000\n }\n \n ans = 0 \n for i in range(len(s)):\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\n ans -= m[s[i]]\n else:\n ans += m[s[i]]\n return ans\n\n","runtime":"37"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n def convert(huruf: str) -> int:\n match huruf:\n case 'I':\n return 1\n case 'V':\n return 5\n case 'X':\n return 10\n case 'L':\n return 50\n case 'C':\n return 100\n case 'D':\n return 500\n case 'M':\n return 1000\n \n sum = 0\n\n for i in range(len(s)):\n if (s[i] in ['I', 'X', 'C']) and (i != len(s) - 1):\n if convert(s[i + 1]) > convert(s[i]):\n sum -= convert(s[i])\n else:\n sum += convert(s[i])\n else:\n sum += convert(s[i])\n\n return sum\n ","runtime":"37"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n romanMap = {\"M\":1000,\"D\":500,\"C\":100,\"L\":50,\"X\":10,\"V\":5,\"I\":1}\n sum = 0\n i = 0\n while i < len(s):\n\n if i < len(s) - 1 and romanMap[s[i]] < romanMap[s[i+1]]:\n sum += (romanMap[s[i+1]] - romanMap[s[i]])\n i+=2\n else:\n sum += romanMap[s[i]]\n i+=1\n return sum\n \n\n ","runtime":"38"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n dic = {\n 'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000 \n }\n number = 0\n s = s.replace('IV', 'IIII').replace('IX', 'VIIII')\n s = s.replace('XL', 'XXXX').replace('XC', 'LXXXX')\n s = s.replace('CD', 'CCCC').replace('CM','DCCCC')\n for let in s:\n number += dic[let]\n return number\n","runtime":"38"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n m = {\n 'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000\n }\n \n ans = 0\n \n for i in range(len(s)):\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\n ans -= m[s[i]]\n else:\n ans += m[s[i]]\n \n return ans","runtime":"39"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n d={'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}\n val=d[s[0]]\n # print(val)\n for i in range(1,len(s)):\n val=val+d[s[i]]\n if d[s[i]]>d[s[i-1]]:\n val=val-2*d[s[i-1]]\n return val\n","runtime":"39"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n mapper = {'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000,\n }\n total = 0\n prev = 0\n for c in s:\n value = mapper[c]\n if value > prev:\n total += value - 2 * prev\n else:\n total += value\n prev = value\n \n return total","runtime":"40"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n # Roman numeral values\n dict1 = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}\n \n # Initialize the result\n count = 0\n \n # Traverse the string s\n for i in range(len(s)):\n # If the current value is less than the next value, subtract it\n if i + 1 < len(s) and dict1[s[i]] < dict1[s[i + 1]]:\n count -= dict1[s[i]]\n else:\n # Otherwise, add it\n count += dict1[s[i]]\n \n return count\n","runtime":"40"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n roman = {\"I\": 1,\n \"IV\": 4,\n \"V\": 5,\n \"IX\": 9,\n \"X\": 10,\n \"XL\": 40,\n \"L\": 50,\n \"XC\": 90,\n \"C\": 100,\n \"CD\": 400,\n \"D\": 500,\n \"CM\": 900,\n \"M\": 1000}\n total = 0\n i = 0\n while i < len(s):\n if i < len(s) - 1 and s[i] + s[i+1] in roman:\n total += roman[s[i] + s[i+1]]\n i += 2 # Skip the next character as it's already processed\n else:\n total += roman[s[i]]\n i += 1\n return total","runtime":"41"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n d = {'I':1, 'V':5, 'X':10, 'L':50, 'C':100, 'D':500, 'M':1000}\n\n summ = 0\n n = len(s)\n # i is in the index of str\n i = 0 \n\n while i < n :\n if i < n - 1 and d[s[i]] < d[s[i+1]]:\n summ += d[s[i+1]] - d[s[i]]\n i += 2\n else:\n summ += d[s[i]]\n i += 1\n\n return summ \n\n'''\nThere is a potential issue in your code: the line if d[s[i]] < d[s[i+1]]: might raise an IndexError when i is at the last index of the string, since you're accessing s[i+1]. You need to ensure that i + 1 is a valid index before accessing s[i+1].\n\nYou can fix this by adding a check to ensure i + 1 < n before accessing s[i+1]. Here's the corrected version of your code:\n''' ","runtime":"41"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n dic = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}\n ans = 0\n for i in range(len(s)-1):\n if dic[s[i]] < dic[s[i+1]]:\n ans -= dic[s[i]]\n else:\n ans += dic[s[i]]\n return ans + dic[s[-1]]\n","runtime":"42"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n m = {\n 'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000\n }\n \n ans = 0\n \n for i in range(len(s)):\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\n ans -= m[s[i]]\n else:\n ans += m[s[i]]\n \n return ans","runtime":"42"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n m = {\n 'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000\n }\n \n ans = 0\n \n for i in range(len(s)):\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\n ans -= m[s[i]]\n else:\n ans += m[s[i]]\n \n return ans\n\n\n# Example usage # ","runtime":"43"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n k=dict()\n k['I']=1\n k['V']=5\n k['X']=10\n k['L']=50\n k['C']=100\n k['D']=500\n k['M']=1000\n c=k[s[-1]]\n p=k[s[-1]]\n for i in range(len(s)-2,-1,-1):\n if k[s[i]]>=p:\n p=k[s[i]]\n c=c+k[s[i]]\n else:\n c=c-k[s[i]]\n #print(c)\n return c\n ","runtime":"43"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n t=0\n p=0\n d={'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}\n for i in reversed(s):\n v=d[i]\n if v < p:\n t -= v\n else:\n t += v\n p=v\n return t\n \n ","runtime":"44"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n roman = {\"I\": 1,\n \"IV\": 4,\n \"V\": 5,\n \"IX\": 9,\n \"X\": 10,\n \"XL\": 40,\n \"L\": 50,\n \"XC\": 90,\n \"C\": 100,\n \"CD\": 400,\n \"D\": 500,\n \"CM\": 900,\n \"M\": 1000}\n total = 0\n i = 0\n while i < len(s):\n if i < len(s) - 1 and s[i] + s[i+1] in roman and roman[s[i]] < roman[s[i+1]]:\n total += roman[s[i] + s[i+1]]\n i += 2 # Skip the next character as it's already processed\n else:\n total += roman[s[i]]\n i += 1\n return total","runtime":"44"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n\n value_map = {\n 'I' : 1,\n 'V' : 5,\n 'X' : 10, \n 'L' : 50,\n 'C':100,\n 'D':500,\n 'M' : 1000,\n }\n\n ans = 0 \n st = []\n i = 0 \n\n while i < len(s):\n\n if (i+1)<len(s) and value_map[s[i+1]]>value_map[s[i]]:\n ans += (value_map[s[i+1]]-value_map[s[i]])\n i+=1\n else:\n ans += value_map[s[i]]\n \n i += 1\n\n return ans\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 mymap = { \n 'I':1, \n \"V\":5, \n \"X\":10,\n \"L\":50, \n \"C\":100,\n \"D\":500,\n \"M\":1000,\n }\n ans = 0 \n i = 0 \n while i < len(s):\n if (i+1)<len(s) and mymap[s[i+1]]>mymap[s[i]]:\n ans += (mymap[s[i+1]]-mymap[s[i]])\n i+= 2\n else:\n ans += mymap[s[i]]\n i+=1\n return ans\n ","runtime":"45"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n roman = {\n \"I\" : 1,\n \"V\" : 5,\n \"X\" : 10,\n \"L\" : 50,\n \"C\" : 100,\n \"D\" : 500,\n \"M\" : 1000\n }\n res = 0\n for i in range(len(s)):\n if i+1 < len(s) and roman[s[i]] < roman[s[i+1]]:\n res -= roman[s[i]]\n else:\n res += roman[s[i]]\n return res ","runtime":"45"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n m = {'I':1, 'V':5, 'X':10, 'L':50, 'C':100, 'D':500, 'M':1000}\n total = 0\n\n for i in range(len(s)):\n\n \n if i + 1 < len(s) and m[s[i]] < m[s[i + 1]]:\n total -= m[s[i]]\n \n else:\n total += m[s[i]]\n \n return total","runtime":"46"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n num = {\n \"I\": 1,\n \"V\": 5,\n \"X\":10,\n \"L\":50,\n \"C\":100,\n \"D\":500,\n \"M\":1000\n }\n s += \"q\"\n sum = 0\n counter = 0\n while counter < len(s)-1:\n term = s[counter]\n next = s[counter+1]\n if term == \"I\" and next == \"V\":\n sum += 4\n counter += 2\n elif term == \"I\" and next == \"X\":\n sum += 9\n counter += 2\n elif term == \"X\" and next == \"L\":\n sum += 40\n counter += 2\n elif term == \"X\" and next == \"C\":\n sum += 90\n counter += 2\n elif term == \"C\" and next == \"D\":\n sum += 400\n counter += 2\n elif term == \"C\" and next == \"M\":\n sum += 900\n counter += 2\n else:\n sum += num[term]\n counter += 1\n return sum","runtime":"46"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n sumn = 0\n arr = s\n for i in range(len(arr)):\n if arr[i] == 'I':\n if i+1 < len(arr):\n if arr[i+1] == \"V\" or arr[i+1] == \"X\":\n sumn-=1\n else:\n sumn+=1\n else:\n sumn+=1\n elif arr[i] == \"V\":\n sumn+=5\n elif arr[i] == \"X\":\n if i+1 < len(arr):\n if arr[i+1] == \"L\" or arr[i+1] == \"C\":\n sumn-=10\n else:\n sumn+=10\n else:\n sumn+=10\n elif arr[i] == \"L\":\n sumn+=50\n elif arr[i] == \"C\":\n if i+1 < len(arr):\n if arr[i+1] == \"D\" or arr[i+1] == \"M\":\n sumn-=100\n else:\n sumn+=100\n else:\n sumn+=100\n elif arr[i] == \"D\":\n sumn+=500\n elif arr[i] == \"M\":\n sumn+=1000\n\n return sumn\n\n\n ","runtime":"47"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n roman = {\n \"I\": 1,\n \"V\": 5,\n \"X\": 10,\n \"L\": 50,\n \"C\": 100,\n \"D\": 500,\n \"M\": 1000,\n \"CD\": 400,\n \"CM\": 900,\n \"XL\": 40,\n \"XC\": 90,\n \"IV\": 4,\n \"IX\": 9,\n \" \": 0\n }\n total = 0\n n = len(s)\n couple = False\n s += \" \"\n for i in range(0,n):\n if couple:\n couple = False\n continue\n char = s[i] + s[i+1]\n if char in roman:\n total += roman[char]\n couple = True\n else:\n total += roman[char[0]]\n print(total)\n return total","runtime":"47"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n values = {\n \"I\": 1,\n \"V\": 5,\n \"X\": 10,\n \"L\": 50,\n \"C\": 100,\n \"D\": 500,\n \"M\": 1000,\n }\n i = 0 \n total = 0\n while i < len(s):\n if i + 1 < len(s) and values[s[i]] < values[s[i + 1]]:\n total += values[s[i + 1]] - values[s[i]]\n i += 2\n else:\n total += values[s[i]]\n i += 1\n return total","runtime":"48"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n slov = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}\n\n total = 0\n prev_value = 0\n\n # Проходим по строке с конца\n for char in reversed(s):\n value = slov[char]\n if value < prev_value:\n total -= value\n else:\n total += value\n prev_value = value\n\n return total","runtime":"48"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n m = {\n 'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000\n }\n \n ans = 0\n \n for i in range(len(s)):\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\n ans -= m[s[i]]\n else:\n ans += m[s[i]]\n \n return ans\n \n ","runtime":"49"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n d = {'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}\n tar = 0\n \n for i in range(len(s)):\n if i < len(s)-1 :\n if d[s[i]]<d[s[i+1]]:\n tar-=d[s[i]]\n \n else:\n tar += d[s[i]]\n else:\n tar += d[s[i]]\n return tar\n ","runtime":"49"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n skip=False\n out=0\n s+='o'\n val={'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000,'o':0}\n for i in range(len(s)-1):\n if val[s[i]]<val[s[i+1]]:\n out-=val[s[i]]\n else:\n out+=val[s[i]]\n return out\n \n\n","runtime":"50"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n map = {'I':1,\n 'V':5,\n 'X':10,\n 'L':50,\n 'C':100,\n 'D':500,\n 'M':1000,}\n length = len(s)\n count = 0\n for i in range(length):\n if i != length - 1:\n if map[s[i]] < map[s[i+1]]:\n count -= map[s[i]]\n else:\n count += map[s[i]]\n else:\n count += map[s[i]]\n return count","runtime":"50"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n roman = {'I':1, 'V':5, 'X':10, 'L':50, 'C':100, 'D': 500, 'M':1000}\n\n num=0\n\n length =len(s)\n\n for i in range(length - 1):\n if(roman[s[i]] >= roman[s[i+1]]):\n num+=roman[s[i]]\n else:\n num-=roman[s[i]]\n\n return num+roman[s[-1]]","runtime":"51"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n m = {\n \"I\":1,\n \"V\":5,\n \"X\":10,\n \"L\":50,\n \"C\":100,\n \"D\":500,\n \"M\":1000\n }\n ans = 0\n for i in range(len(s)):\n if i < len(s)-1 and (m[s[i]] < m[s[i+1]]):\n ans -= m[s[i]]\n else:\n ans += m[s[i]]\n return ans\n\n ","runtime":"51"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n s += \"I\"\n symMap = {\"I\":1, \"V\":5, \"X\":10, \"L\":50, \"C\":100, \"D\":500, \"M\":1000}\n x = 0\n pre_char = s[0]\n for i in range(1,len(s)):\n if symMap[pre_char] >= symMap[s[i]]:\n x += symMap[pre_char]\n else:\n x -= symMap[pre_char]\n pre_char = s[i]\n return x\n","runtime":"52"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n roman = {\"I\": 1, \"V\": 5, \"X\": 10, \"L\": 50, \"C\": 100, \"D\": 500, \"M\": 1000}\n result = 0\n\n for i in range(len(s)):\n if i + 1 < len(s) and roman[s[i]] < roman[s[i + 1]]:\n result -= roman[s[i]]\n else:\n result += roman[s[i]]\n \n return result\n\n\nsolution = Solution()\nprint(solution.romanToInt(\"III\")) \n","runtime":"52"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n sum=0\n dict={\n \"I\":1,\n \"V\":5,\n \"X\":10,\n \"L\":50,\n \"C\":100,\n \"D\":500,\n \"M\":1000\n }\n for i in range(len(s)):\n if i<len(s)-1 and dict[s[i]]<dict[s[i+1]]:\n sum=sum-dict[s[i]]\n else:\n sum=sum+dict[s[i]]\n return sum \n\n \n \n \n\n\n \n\n\n\n","runtime":"53"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n res: int = 0\n roman_vals = {\n 'I':1,\n 'V':5,\n 'X':10,\n 'L':50,\n 'C':100,\n 'D':500,\n 'M':1000\n }\n for i in range((len(s)-1),-1,-1):\n if i is not (len(s)-1):\n if roman_vals[s[i+1]]>roman_vals[s[i]]:\n res -= roman_vals[s[i]]\n print(f\"in: {i = }\")\n else:\n res += roman_vals[s[i]]\n print(f\"out: {i = }\")\n else:\n res += roman_vals[s[i]]\n print(f\"out_out: {i = }\")\n return res\n\n","runtime":"53"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n hashmap = {\"I\": 1, \"V\": 5, \"X\": 10, \"L\": 50, \"C\": 100, \"D\": 500, \"M\": 1000, \"VI\":4, \"XI\":9, \"LX\":40, \"CX\":90, \"DC\":400, \"MC\":900}\n s = s[::-1]\n\n res = 0\n idx = 0\n while idx < len(s):\n if idx < len(s) - 1:\n double = s[idx:idx+2]\n if double in hashmap:\n res += hashmap[double]\n idx += 2\n continue\n res += hashmap[s[idx]]\n idx += 1\n return res\n","runtime":"54"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n res = 0\n rome = ['I', 'V', 'X', 'L', 'C', 'D', 'M']\n normal = [1, 5, 10, 50, 100, 500, 1000]\n\n rtn = {k:v for k,v in zip(rome, normal)}\n \n swch = rome.index(s[-1])\n\n for i in reversed(range(len(s))):\n\n if rome.index(s[i]) >= swch:\n res += rtn[s[i]]\n swch = rome.index(s[i])\n else:\n res -= rtn[s[i]]\n \n\n \n return res\n","runtime":"54"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n sum = 0\n table = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}\n \n ind = 0\n while ind < len(s) - 1:\n \n if s[ind] == 'I' and s[ind+1] == 'V':\n sum += 4\n elif s[ind] == 'I' and s[ind+1] == 'X':\n sum += 9\n elif s[ind] == 'X' and s[ind+1] == 'L':\n sum += 40\n elif s[ind] == 'X' and s[ind+1] == 'C':\n sum += 90\n elif s[ind] == 'C' and s[ind+1] == 'D':\n sum += 400\n elif s[ind] == 'C' and s[ind+1] == 'M':\n sum += 900\n else:\n sum += table.get(s[ind])\n ind += 1\n continue\n \n ind += 2 \n \n if ind < len(s):\n sum += table.get(s[ind])\n\n return sum \n ","runtime":"55"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n\n symbol_num = {\"I\" : 1, \"V\" : 5, \"X\": 10, \"L\" : 50, \"C\":100, \"D\": 500, \"M\": 1000} \n \n total = symbol_num[s[len(s)-1]]\n\n for i in range(len(s)-2, -1, -1):\n \n if symbol_num[s[i]] < symbol_num[s[i+1]]:\n total -= symbol_num[s[i]]\n else:\n total += symbol_num[s[i]]\n \n\n\n\n return total","runtime":"55"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n \n # rti is a dict for roman to intgers values\n rti = {'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}\n\n # ans is for our sum value\n ans=0\n\n # for loop till len(s)-1 cause for last Roman Value we cant compare\n for i in range(len(s)-1):\n if rti[s[i]] < rti[s[i+1]]:\n ans = ans - rti[s[i]]\n else: \n ans = ans + rti[s[i]]\n\n # So we add the last value and return the final ans\n return ans+rti[s[-1]]\n ","runtime":"56"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n sym={'M':1000,'CM':900,'D':500,'CD':400,'C':100,'XC':90,'L':50,'XL':40,'X':10,'IX':9,'V':5,'IV':4,'I':1}\n num=0\n x=len(s)\n for i in range(len(s)):\n if i <x-1 and sym[s[i]]<sym[s[i+1]]:\n num -= sym[s[i]]\n else:\n num +=sym[s[i]]\n return num\n\n","runtime":"56"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n roman_symbols_dict = {'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}\n l = len(s)\n if l == 1 and s in roman_symbols_dict:\n return roman_symbols_dict[s]\n nums = 0\n i = 0\n while i < l:\n if i+1 < l and roman_symbols_dict[s[i]] < roman_symbols_dict[s[i+1]]:\n nums = nums + roman_symbols_dict[s[i+1]] - roman_symbols_dict[s[i]]\n i += 2\n else:\n nums = nums + roman_symbols_dict[s[i]]\n i += 1\n return nums\n\n","runtime":"57"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n def convert(huruf: str) -> int:\n match huruf:\n case 'I':\n return 1\n case 'V':\n return 5\n case 'X':\n return 10\n case 'L':\n return 50\n case 'C':\n return 100\n case 'D':\n return 500\n case 'M':\n return 1000\n \n sum = 0\n\n for i in range(len(s)):\n if (s[i] in ['I', 'X', 'C']) and (i != len(s) - 1):\n if convert(s[i + 1]) > convert(s[i]):\n sum -= convert(s[i])\n else:\n sum += convert(s[i])\n else:\n sum += convert(s[i])\n\n return sum\n ","runtime":"57"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n hashmap = {\n \"I\":1,\n \"V\":5,\n \"X\":10,\n \"L\":50,\n \"C\":100,\n \"D\":500,\n \"M\":1000\n }\n integers = []\n for i in range(len(s)-1,-1,-1):\n value = hashmap[s[i]]\n print(value)\n if len(integers)>0 and value < integers[-1]:\n value = integers[-1] - value\n integers.pop()\n print(value)\n integers.append(value)\n summ = 0\n for i in integers:\n summ += i\n return summ\n\n\n ","runtime":"58"}],"string":"[\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n # dic = {\\n # 'I': 1,\\n # 'V': 5,\\n # 'X': 10,\\n # 'L': 50,\\n # 'C': 100,\\n # 'D': 500,\\n # 'M': 1000\\n # }\\n \\n # total_sum = 0\\n # for char in s:\\n # total_sum += dic[char]\\n \\n # for i in range(len(s)-1):\\n # if s[i] + s[i+1] == 'IV' or s[i] + s[i+1] == 'IX':\\n # total_sum -= 2\\n # elif s[i] + s[i+1] == 'XL' or s[i] + s[i+1] == 'XC':\\n # total_sum -= 20\\n # elif s[i] + s[i+1] == 'CD' or s[i] + s[i+1] == 'CM':\\n # total_sum -= 200\\n \\n #return total_sum\\n\\n # dic = {\\n # 'I': 1,\\n # 'V': 5,\\n # 'X': 10,\\n # 'L': 50,\\n # 'C': 100,\\n # 'D': 500,\\n # 'M': 1000\\n # }\\n \\n # total_sum = 0\\n # for i in range(len(s)):\\n # if i < len(s)-1 and dic[s[i]] < dic[s[i+1]]:\\n # total_sum -= dic[s[i]]\\n # else:\\n # total_sum += dic[s[i]]\\n \\n # return total_sum\\n\\n\\n\\n\\n\\n dic = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}\\n tot_sum = 0\\n n = len(s)\\n \\n for i in range(n):\\n if i < n-1 and dic[s[i]] < dic[s[i+1]]:\\n tot_sum -= dic[s[i]]\\n else:\\n tot_sum += dic[s[i]]\\n \\n return tot_sum\\n \",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n numeral_values = {\\n \\\"I\\\" : 1,\\n \\\"V\\\" : 5,\\n \\\"X\\\" : 10,\\n \\\"L\\\" : 50, \\n \\\"C\\\" :100,\\n \\\"D\\\" : 500,\\n \\\"M\\\" : 1000\\n }\\n number_val = 0\\n s = s.replace('IV', 'IIII')\\n s = s.replace('IX', 'IIIIV')\\n s = s.replace('XL', 'XXXX')\\n s = s.replace('XC', 'XXXXXXXXX')\\n s = s.replace('CD', 'CCCC')\\n s = s.replace('CM', 'DCCCC')\\n for i in s:\\n number_val += numeral_values[i]\\n return number_val\\n\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n m = {\\n \\\"I\\\": 1, \\n \\\"V\\\": 5, \\n \\\"X\\\": 10, \\n \\\"L\\\": 50, \\n \\\"C\\\": 100, \\n \\\"D\\\": 500, \\n \\\"M\\\": 1000, \\n }\\n\\n answer = 0\\n\\n for i in range(len(s)):\\n if i < len(s) - 1 and m[s[i]] < m[s[i + 1]]:\\n answer -= m[s[i]]\\n else:\\n answer += m[s[i]]\\n return answer\",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n m = {\\n 'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000\\n }\\n \\n ans = 0\\n \\n for i in range(len(s)):\\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\\n ans -= m[s[i]]\\n else:\\n ans += m[s[i]]\\n \\n return ans\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n roman_numerals = {\\n \\\"I\\\": 1,\\n \\\"V\\\": 5,\\n \\\"X\\\": 10,\\n \\\"L\\\": 50,\\n \\\"C\\\": 100,\\n \\\"D\\\": 500,\\n \\\"M\\\": 1000\\n }\\n prev_val = None\\n val = 0\\n for i in s:\\n if prev_val:\\n if roman_numerals[prev_val] < roman_numerals[i]:\\n val += roman_numerals[i] - roman_numerals[prev_val]*2\\n else:\\n val += roman_numerals[i]\\n\\n else:\\n val += roman_numerals[i]\\n prev_val = i\\n\\n\\n return val \\n\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n m = {\\n 'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000\\n }\\n \\n ans = 0\\n \\n for i in range(len(s)):\\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\\n ans -= m[s[i]]\\n else:\\n ans += m[s[i]]\\n \\n return ans\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n values = {'I' : 1 ,\\n 'V' : 5 ,\\n 'X' : 10 ,\\n 'L' : 50 ,\\n 'C' : 100 ,\\n 'D' : 500 ,\\n 'M' : 1000 }\\n\\n number = 0\\n for index in range(len(s)):\\n a = values[s[index]]\\n if index > 0 and values[s[index - 1]] < a:\\n number += a - (values[s[index - 1]] * 2)\\n continue\\n number += a\\n\\n \\n return number\\n # O(n) O(1)\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n roman_dict = {\\n 'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000\\n }\\n\\n result = 0\\n curr_val = 0\\n prev_val = 0 \\n\\n for char in s: \\n curr_val = roman_dict[char]\\n\\n if curr_val > prev_val:\\n result += curr_val - (2*prev_val)\\n else: \\n result += curr_val \\n \\n prev_val = curr_val \\n \\n return result\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n ans = 0\\n roman = {'I': 1, 'V': 5, 'X': 10, 'L': 50,\\n 'C': 100, 'D': 500, 'M': 1000}\\n\\n for a, b in zip(s, s[1:]):\\n if roman[a] < roman[b]:\\n ans -= roman[a]\\n else:\\n ans += roman[a]\\n\\n return ans + roman[s[-1]]\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n symbolDict = {\\n \\\"M\\\": 1000,\\n \\\"D\\\": 500,\\n \\\"C\\\": 100,\\n \\\"L\\\": 50,\\n \\\"X\\\": 10,\\n \\\"V\\\": 5,\\n \\\"I\\\": 1\\n }\\n currSum=0\\n for i in range(len(s)):\\n if (i<len(s)-1 and (symbolDict[s[i+1]]>symbolDict[s[i]] )):\\n currSum-=symbolDict[s[i]] \\n else:\\n currSum+=symbolDict[s[i]]\\n return currSum\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n roman_to_int = {\\n 'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000\\n }\\n \\n total = 0\\n prev_value = 0\\n \\n # Iterate over the string in reverse\\n for char in reversed(s):\\n # Get the integer value of the current Roman numeral character\\n current_value = roman_to_int[char]\\n \\n # If the current value is less than the previous one, subtract it\\n if current_value < prev_value:\\n total -= current_value\\n else:\\n total += current_value\\n \\n # Update previous value to current\\n prev_value = current_value\\n \\n return total\\n\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n roman_to_int = {'I' : 1,\\n 'V' : 5,\\n 'X' : 10,\\n 'L' : 50,\\n 'C' : 100,\\n 'D' : 500,\\n 'M' : 1000}\\n x = 0\\n prev = 0\\n\\n for char in s:\\n value = roman_to_int[char]\\n if prev < value:\\n x += value - 2 * prev\\n else:\\n x+=value\\n\\n prev = value\\n\\n return x\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n roman_values = {'I': 1,'V': 5,'X': 10,'L': 50,'C': 100,'D': 500,'M': 1000}\\n res=0\\n res=roman_values[s[-1]]\\n for i in range(len(s)-1,0,-1):\\n if roman_values[s[i]]>roman_values[s[i-1]]:\\n res=res-roman_values[s[i-1]]\\n else:\\n res+=roman_values[s[i-1]]\\n return res\\n\\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n d = {\\\"I\\\": 1, \\\"V\\\": 5, \\\"X\\\": 10, \\\"L\\\": 50, \\\"C\\\": 100, \\\"D\\\": 500, \\\"M\\\": 1000}\\n\\n total = 0\\n for i in range(len(s) - 1):\\n if d[s[i]] < d[s[i + 1]]:\\n total -= d[s[i]]\\n else:\\n total += d[s[i]]\\n return total + d[s[-1]]\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n conversion={\\n \\\"I\\\" : 1,\\n \\\"V\\\" : 5,\\n \\\"X\\\" : 10,\\n \\\"L\\\" : 50,\\n \\\"C\\\" : 100,\\n \\\"D\\\" : 500,\\n \\\"M\\\" : 1000,\\n \\\"IV\\\" : 4,\\n \\\"IX\\\" : 9,\\n \\\"XL\\\" : 40, \\\"XC\\\":90,\\n \\\"CD\\\" : 400, \\\"CM\\\" : 900\\n }\\n answer=0\\n i=0\\n while(i<len(s)):\\n if s[i:i+2] in conversion:\\n answer += conversion[s[i:i+2]]\\n i+=2\\n else:\\n answer += conversion[s[i]]\\n i+=1\\n return answer\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n total = 0\\n d = {\\\"I\\\":1,\\\"V\\\":5,\\\"X\\\":10,\\\"L\\\":50,\\\"C\\\":100,\\\"D\\\":500,\\\"M\\\":1000}\\n for i in range(len(s)-1):\\n if d[s[i]]<d[s[i+1]]:\\n total-=d[s[i]]\\n else:\\n total+=d[s[i]]\\n total += d[s[-1]]\\n return total \\n\\n \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n numerals = {'I':1, 'V':5, 'X':10, 'L':50, 'C':100, 'D':500, 'M':1000}\\n total = 0\\n prev_value = 0\\n\\n # Iterate over each character in the string\\n for char in s:\\n # Get the value of the current numeral\\n current_value = numerals[char]\\n\\n # If the current numeral is greater than the previous one, subtract twice the previous one (adjust for previous addition)\\n if current_value > prev_value:\\n total += current_value - 2 * prev_value\\n else:\\n total += current_value\\n \\n # Update prev_value for the next iteration\\n prev_value = current_value\\n\\n return total\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n hello = {\\\"I\\\": 1, \\\"V\\\": 5, \\\"X\\\": 10, \\\"L\\\": 50, \\\"C\\\": 100, \\\"D\\\": 500, \\\"M\\\":1000} \\n\\n ans = 0\\n for i in range(len(s)):\\n if i < len(s) - 1 and hello[s[i]] < hello[s[i + 1]]:\\n ans = ans - hello[s[i]]\\n else:\\n ans = ans + hello[s[i]]\\n return ans \",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n romanMap = {\\\"M\\\":1000,\\\"D\\\":500,\\\"C\\\":100,\\\"L\\\":50,\\\"X\\\":10,\\\"V\\\":5,\\\"I\\\":1}\\n sum = 0\\n i = 0\\n while i < len(s):\\n\\n if i < len(s) - 1 and romanMap[s[i]] < romanMap[s[i+1]]:\\n sum += (romanMap[s[i+1]] - romanMap[s[i]])\\n i+=2\\n else:\\n sum += romanMap[s[i]]\\n i+=1\\n return sum\\n \\n\\n \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n roman_rep={\\n 'I':1,\\n 'V':5,\\n 'X':10,\\n 'L':50,\\n 'C':100,\\n 'D':500,\\n 'M':1000\\n }\\n \\n roman_to_int=[]\\n skip_flag=False\\n for index,letter in enumerate(s):\\n if skip_flag:\\n skip_flag=False\\n continue\\n if index<len(s)-1:\\n next_letter=s[index+1]\\n if roman_rep[next_letter]>roman_rep[letter]:\\n skip_flag=True\\n value=roman_rep[next_letter]-roman_rep[letter]\\n roman_to_int.append(value)\\n if index+1 == len(s)-1:\\n break\\n if skip_flag==False:\\n value=roman_rep[letter]\\n roman_to_int.append(value)\\n \\n return sum(roman_to_int)\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n if s == None:\\n return 0\\n roman={\\n 'I':1,\\n 'V':5,\\n 'X':10,\\n 'L':50,\\n 'C':100,\\n 'D':500,\\n 'M':1000\\n }\\n num=roman[s[len(s)-1]]\\n for i in range(len(s)-2,-1,-1):\\n top=s[i]\\n if roman[top] < roman[s[i+1]]:\\n num=num-roman[top]\\n else:\\n num=num+roman[top]\\n return num\\n\\n\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n ans = 0\\n \\n dicty = {\\\"I\\\":1,\\\"X\\\":10,\\\"V\\\":5,\\\"L\\\":50,\\\"C\\\":100,\\\"D\\\":500,\\\"M\\\":1000}\\n\\n excepty = {\\\"IV\\\":-2,\\\"IX\\\": -2, \\\"XL\\\":-20, \\\"XC\\\":-20, \\\"CD\\\":-200,\\\"CM\\\":-200 }\\n\\n for key in excepty:\\n if key in s: ans+=excepty[key] \\n\\n for rom in s:\\n if rom in dicty:\\n ans += dicty[rom]\\n return ans\\n \\n\\n\\n\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n m = {\\n 'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000\\n }\\n \\n ans = 0 \\n for i in range(len(s)):\\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\\n ans -= m[s[i]]\\n else:\\n ans += m[s[i]]\\n return ans\\n\\n\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n def convert(huruf: str) -> int:\\n match huruf:\\n case 'I':\\n return 1\\n case 'V':\\n return 5\\n case 'X':\\n return 10\\n case 'L':\\n return 50\\n case 'C':\\n return 100\\n case 'D':\\n return 500\\n case 'M':\\n return 1000\\n \\n sum = 0\\n\\n for i in range(len(s)):\\n if (s[i] in ['I', 'X', 'C']) and (i != len(s) - 1):\\n if convert(s[i + 1]) > convert(s[i]):\\n sum -= convert(s[i])\\n else:\\n sum += convert(s[i])\\n else:\\n sum += convert(s[i])\\n\\n return sum\\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n romanMap = {\\\"M\\\":1000,\\\"D\\\":500,\\\"C\\\":100,\\\"L\\\":50,\\\"X\\\":10,\\\"V\\\":5,\\\"I\\\":1}\\n sum = 0\\n i = 0\\n while i < len(s):\\n\\n if i < len(s) - 1 and romanMap[s[i]] < romanMap[s[i+1]]:\\n sum += (romanMap[s[i+1]] - romanMap[s[i]])\\n i+=2\\n else:\\n sum += romanMap[s[i]]\\n i+=1\\n return sum\\n \\n\\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n dic = {\\n 'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000 \\n }\\n number = 0\\n s = s.replace('IV', 'IIII').replace('IX', 'VIIII')\\n s = s.replace('XL', 'XXXX').replace('XC', 'LXXXX')\\n s = s.replace('CD', 'CCCC').replace('CM','DCCCC')\\n for let in s:\\n number += dic[let]\\n return number\\n\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n m = {\\n 'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000\\n }\\n \\n ans = 0\\n \\n for i in range(len(s)):\\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\\n ans -= m[s[i]]\\n else:\\n ans += m[s[i]]\\n \\n return ans\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n d={'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}\\n val=d[s[0]]\\n # print(val)\\n for i in range(1,len(s)):\\n val=val+d[s[i]]\\n if d[s[i]]>d[s[i-1]]:\\n val=val-2*d[s[i-1]]\\n return val\\n\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n mapper = {'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000,\\n }\\n total = 0\\n prev = 0\\n for c in s:\\n value = mapper[c]\\n if value > prev:\\n total += value - 2 * prev\\n else:\\n total += value\\n prev = value\\n \\n return total\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n # Roman numeral values\\n dict1 = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}\\n \\n # Initialize the result\\n count = 0\\n \\n # Traverse the string s\\n for i in range(len(s)):\\n # If the current value is less than the next value, subtract it\\n if i + 1 < len(s) and dict1[s[i]] < dict1[s[i + 1]]:\\n count -= dict1[s[i]]\\n else:\\n # Otherwise, add it\\n count += dict1[s[i]]\\n \\n return count\\n\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n roman = {\\\"I\\\": 1,\\n \\\"IV\\\": 4,\\n \\\"V\\\": 5,\\n \\\"IX\\\": 9,\\n \\\"X\\\": 10,\\n \\\"XL\\\": 40,\\n \\\"L\\\": 50,\\n \\\"XC\\\": 90,\\n \\\"C\\\": 100,\\n \\\"CD\\\": 400,\\n \\\"D\\\": 500,\\n \\\"CM\\\": 900,\\n \\\"M\\\": 1000}\\n total = 0\\n i = 0\\n while i < len(s):\\n if i < len(s) - 1 and s[i] + s[i+1] in roman:\\n total += roman[s[i] + s[i+1]]\\n i += 2 # Skip the next character as it's already processed\\n else:\\n total += roman[s[i]]\\n i += 1\\n return total\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n d = {'I':1, 'V':5, 'X':10, 'L':50, 'C':100, 'D':500, 'M':1000}\\n\\n summ = 0\\n n = len(s)\\n # i is in the index of str\\n i = 0 \\n\\n while i < n :\\n if i < n - 1 and d[s[i]] < d[s[i+1]]:\\n summ += d[s[i+1]] - d[s[i]]\\n i += 2\\n else:\\n summ += d[s[i]]\\n i += 1\\n\\n return summ \\n\\n'''\\nThere is a potential issue in your code: the line if d[s[i]] < d[s[i+1]]: might raise an IndexError when i is at the last index of the string, since you're accessing s[i+1]. You need to ensure that i + 1 is a valid index before accessing s[i+1].\\n\\nYou can fix this by adding a check to ensure i + 1 < n before accessing s[i+1]. Here's the corrected version of your code:\\n''' \",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n dic = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}\\n ans = 0\\n for i in range(len(s)-1):\\n if dic[s[i]] < dic[s[i+1]]:\\n ans -= dic[s[i]]\\n else:\\n ans += dic[s[i]]\\n return ans + dic[s[-1]]\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n m = {\\n 'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000\\n }\\n \\n ans = 0\\n \\n for i in range(len(s)):\\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\\n ans -= m[s[i]]\\n else:\\n ans += m[s[i]]\\n \\n return ans\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n m = {\\n 'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000\\n }\\n \\n ans = 0\\n \\n for i in range(len(s)):\\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\\n ans -= m[s[i]]\\n else:\\n ans += m[s[i]]\\n \\n return ans\\n\\n\\n# Example usage # \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n k=dict()\\n k['I']=1\\n k['V']=5\\n k['X']=10\\n k['L']=50\\n k['C']=100\\n k['D']=500\\n k['M']=1000\\n c=k[s[-1]]\\n p=k[s[-1]]\\n for i in range(len(s)-2,-1,-1):\\n if k[s[i]]>=p:\\n p=k[s[i]]\\n c=c+k[s[i]]\\n else:\\n c=c-k[s[i]]\\n #print(c)\\n return c\\n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n t=0\\n p=0\\n d={'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}\\n for i in reversed(s):\\n v=d[i]\\n if v < p:\\n t -= v\\n else:\\n t += v\\n p=v\\n return t\\n \\n \",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n roman = {\\\"I\\\": 1,\\n \\\"IV\\\": 4,\\n \\\"V\\\": 5,\\n \\\"IX\\\": 9,\\n \\\"X\\\": 10,\\n \\\"XL\\\": 40,\\n \\\"L\\\": 50,\\n \\\"XC\\\": 90,\\n \\\"C\\\": 100,\\n \\\"CD\\\": 400,\\n \\\"D\\\": 500,\\n \\\"CM\\\": 900,\\n \\\"M\\\": 1000}\\n total = 0\\n i = 0\\n while i < len(s):\\n if i < len(s) - 1 and s[i] + s[i+1] in roman and roman[s[i]] < roman[s[i+1]]:\\n total += roman[s[i] + s[i+1]]\\n i += 2 # Skip the next character as it's already processed\\n else:\\n total += roman[s[i]]\\n i += 1\\n return total\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n\\n value_map = {\\n 'I' : 1,\\n 'V' : 5,\\n 'X' : 10, \\n 'L' : 50,\\n 'C':100,\\n 'D':500,\\n 'M' : 1000,\\n }\\n\\n ans = 0 \\n st = []\\n i = 0 \\n\\n while i < len(s):\\n\\n if (i+1)<len(s) and value_map[s[i+1]]>value_map[s[i]]:\\n ans += (value_map[s[i+1]]-value_map[s[i]])\\n i+=1\\n else:\\n ans += value_map[s[i]]\\n \\n i += 1\\n\\n return ans\\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 mymap = { \\n 'I':1, \\n \\\"V\\\":5, \\n \\\"X\\\":10,\\n \\\"L\\\":50, \\n \\\"C\\\":100,\\n \\\"D\\\":500,\\n \\\"M\\\":1000,\\n }\\n ans = 0 \\n i = 0 \\n while i < len(s):\\n if (i+1)<len(s) and mymap[s[i+1]]>mymap[s[i]]:\\n ans += (mymap[s[i+1]]-mymap[s[i]])\\n i+= 2\\n else:\\n ans += mymap[s[i]]\\n i+=1\\n return ans\\n \",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n roman = {\\n \\\"I\\\" : 1,\\n \\\"V\\\" : 5,\\n \\\"X\\\" : 10,\\n \\\"L\\\" : 50,\\n \\\"C\\\" : 100,\\n \\\"D\\\" : 500,\\n \\\"M\\\" : 1000\\n }\\n res = 0\\n for i in range(len(s)):\\n if i+1 < len(s) and roman[s[i]] < roman[s[i+1]]:\\n res -= roman[s[i]]\\n else:\\n res += roman[s[i]]\\n return res \",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n m = {'I':1, 'V':5, 'X':10, 'L':50, 'C':100, 'D':500, 'M':1000}\\n total = 0\\n\\n for i in range(len(s)):\\n\\n \\n if i + 1 < len(s) and m[s[i]] < m[s[i + 1]]:\\n total -= m[s[i]]\\n \\n else:\\n total += m[s[i]]\\n \\n return total\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n num = {\\n \\\"I\\\": 1,\\n \\\"V\\\": 5,\\n \\\"X\\\":10,\\n \\\"L\\\":50,\\n \\\"C\\\":100,\\n \\\"D\\\":500,\\n \\\"M\\\":1000\\n }\\n s += \\\"q\\\"\\n sum = 0\\n counter = 0\\n while counter < len(s)-1:\\n term = s[counter]\\n next = s[counter+1]\\n if term == \\\"I\\\" and next == \\\"V\\\":\\n sum += 4\\n counter += 2\\n elif term == \\\"I\\\" and next == \\\"X\\\":\\n sum += 9\\n counter += 2\\n elif term == \\\"X\\\" and next == \\\"L\\\":\\n sum += 40\\n counter += 2\\n elif term == \\\"X\\\" and next == \\\"C\\\":\\n sum += 90\\n counter += 2\\n elif term == \\\"C\\\" and next == \\\"D\\\":\\n sum += 400\\n counter += 2\\n elif term == \\\"C\\\" and next == \\\"M\\\":\\n sum += 900\\n counter += 2\\n else:\\n sum += num[term]\\n counter += 1\\n return sum\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n sumn = 0\\n arr = s\\n for i in range(len(arr)):\\n if arr[i] == 'I':\\n if i+1 < len(arr):\\n if arr[i+1] == \\\"V\\\" or arr[i+1] == \\\"X\\\":\\n sumn-=1\\n else:\\n sumn+=1\\n else:\\n sumn+=1\\n elif arr[i] == \\\"V\\\":\\n sumn+=5\\n elif arr[i] == \\\"X\\\":\\n if i+1 < len(arr):\\n if arr[i+1] == \\\"L\\\" or arr[i+1] == \\\"C\\\":\\n sumn-=10\\n else:\\n sumn+=10\\n else:\\n sumn+=10\\n elif arr[i] == \\\"L\\\":\\n sumn+=50\\n elif arr[i] == \\\"C\\\":\\n if i+1 < len(arr):\\n if arr[i+1] == \\\"D\\\" or arr[i+1] == \\\"M\\\":\\n sumn-=100\\n else:\\n sumn+=100\\n else:\\n sumn+=100\\n elif arr[i] == \\\"D\\\":\\n sumn+=500\\n elif arr[i] == \\\"M\\\":\\n sumn+=1000\\n\\n return sumn\\n\\n\\n \",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n roman = {\\n \\\"I\\\": 1,\\n \\\"V\\\": 5,\\n \\\"X\\\": 10,\\n \\\"L\\\": 50,\\n \\\"C\\\": 100,\\n \\\"D\\\": 500,\\n \\\"M\\\": 1000,\\n \\\"CD\\\": 400,\\n \\\"CM\\\": 900,\\n \\\"XL\\\": 40,\\n \\\"XC\\\": 90,\\n \\\"IV\\\": 4,\\n \\\"IX\\\": 9,\\n \\\" \\\": 0\\n }\\n total = 0\\n n = len(s)\\n couple = False\\n s += \\\" \\\"\\n for i in range(0,n):\\n if couple:\\n couple = False\\n continue\\n char = s[i] + s[i+1]\\n if char in roman:\\n total += roman[char]\\n couple = True\\n else:\\n total += roman[char[0]]\\n print(total)\\n return total\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n values = {\\n \\\"I\\\": 1,\\n \\\"V\\\": 5,\\n \\\"X\\\": 10,\\n \\\"L\\\": 50,\\n \\\"C\\\": 100,\\n \\\"D\\\": 500,\\n \\\"M\\\": 1000,\\n }\\n i = 0 \\n total = 0\\n while i < len(s):\\n if i + 1 < len(s) and values[s[i]] < values[s[i + 1]]:\\n total += values[s[i + 1]] - values[s[i]]\\n i += 2\\n else:\\n total += values[s[i]]\\n i += 1\\n return total\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n slov = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}\\n\\n total = 0\\n prev_value = 0\\n\\n # Проходим по строке с конца\\n for char in reversed(s):\\n value = slov[char]\\n if value < prev_value:\\n total -= value\\n else:\\n total += value\\n prev_value = value\\n\\n return total\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n m = {\\n 'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000\\n }\\n \\n ans = 0\\n \\n for i in range(len(s)):\\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\\n ans -= m[s[i]]\\n else:\\n ans += m[s[i]]\\n \\n return ans\\n \\n \",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n d = {'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}\\n tar = 0\\n \\n for i in range(len(s)):\\n if i < len(s)-1 :\\n if d[s[i]]<d[s[i+1]]:\\n tar-=d[s[i]]\\n \\n else:\\n tar += d[s[i]]\\n else:\\n tar += d[s[i]]\\n return tar\\n \",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n skip=False\\n out=0\\n s+='o'\\n val={'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000,'o':0}\\n for i in range(len(s)-1):\\n if val[s[i]]<val[s[i+1]]:\\n out-=val[s[i]]\\n else:\\n out+=val[s[i]]\\n return out\\n \\n\\n\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n map = {'I':1,\\n 'V':5,\\n 'X':10,\\n 'L':50,\\n 'C':100,\\n 'D':500,\\n 'M':1000,}\\n length = len(s)\\n count = 0\\n for i in range(length):\\n if i != length - 1:\\n if map[s[i]] < map[s[i+1]]:\\n count -= map[s[i]]\\n else:\\n count += map[s[i]]\\n else:\\n count += map[s[i]]\\n return count\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n roman = {'I':1, 'V':5, 'X':10, 'L':50, 'C':100, 'D': 500, 'M':1000}\\n\\n num=0\\n\\n length =len(s)\\n\\n for i in range(length - 1):\\n if(roman[s[i]] >= roman[s[i+1]]):\\n num+=roman[s[i]]\\n else:\\n num-=roman[s[i]]\\n\\n return num+roman[s[-1]]\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n m = {\\n \\\"I\\\":1,\\n \\\"V\\\":5,\\n \\\"X\\\":10,\\n \\\"L\\\":50,\\n \\\"C\\\":100,\\n \\\"D\\\":500,\\n \\\"M\\\":1000\\n }\\n ans = 0\\n for i in range(len(s)):\\n if i < len(s)-1 and (m[s[i]] < m[s[i+1]]):\\n ans -= m[s[i]]\\n else:\\n ans += m[s[i]]\\n return ans\\n\\n \",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n s += \\\"I\\\"\\n symMap = {\\\"I\\\":1, \\\"V\\\":5, \\\"X\\\":10, \\\"L\\\":50, \\\"C\\\":100, \\\"D\\\":500, \\\"M\\\":1000}\\n x = 0\\n pre_char = s[0]\\n for i in range(1,len(s)):\\n if symMap[pre_char] >= symMap[s[i]]:\\n x += symMap[pre_char]\\n else:\\n x -= symMap[pre_char]\\n pre_char = s[i]\\n return x\\n\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n roman = {\\\"I\\\": 1, \\\"V\\\": 5, \\\"X\\\": 10, \\\"L\\\": 50, \\\"C\\\": 100, \\\"D\\\": 500, \\\"M\\\": 1000}\\n result = 0\\n\\n for i in range(len(s)):\\n if i + 1 < len(s) and roman[s[i]] < roman[s[i + 1]]:\\n result -= roman[s[i]]\\n else:\\n result += roman[s[i]]\\n \\n return result\\n\\n\\nsolution = Solution()\\nprint(solution.romanToInt(\\\"III\\\")) \\n\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n sum=0\\n dict={\\n \\\"I\\\":1,\\n \\\"V\\\":5,\\n \\\"X\\\":10,\\n \\\"L\\\":50,\\n \\\"C\\\":100,\\n \\\"D\\\":500,\\n \\\"M\\\":1000\\n }\\n for i in range(len(s)):\\n if i<len(s)-1 and dict[s[i]]<dict[s[i+1]]:\\n sum=sum-dict[s[i]]\\n else:\\n sum=sum+dict[s[i]]\\n return sum \\n\\n \\n \\n \\n\\n\\n \\n\\n\\n\\n\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n res: int = 0\\n roman_vals = {\\n 'I':1,\\n 'V':5,\\n 'X':10,\\n 'L':50,\\n 'C':100,\\n 'D':500,\\n 'M':1000\\n }\\n for i in range((len(s)-1),-1,-1):\\n if i is not (len(s)-1):\\n if roman_vals[s[i+1]]>roman_vals[s[i]]:\\n res -= roman_vals[s[i]]\\n print(f\\\"in: {i = }\\\")\\n else:\\n res += roman_vals[s[i]]\\n print(f\\\"out: {i = }\\\")\\n else:\\n res += roman_vals[s[i]]\\n print(f\\\"out_out: {i = }\\\")\\n return res\\n\\n\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n hashmap = {\\\"I\\\": 1, \\\"V\\\": 5, \\\"X\\\": 10, \\\"L\\\": 50, \\\"C\\\": 100, \\\"D\\\": 500, \\\"M\\\": 1000, \\\"VI\\\":4, \\\"XI\\\":9, \\\"LX\\\":40, \\\"CX\\\":90, \\\"DC\\\":400, \\\"MC\\\":900}\\n s = s[::-1]\\n\\n res = 0\\n idx = 0\\n while idx < len(s):\\n if idx < len(s) - 1:\\n double = s[idx:idx+2]\\n if double in hashmap:\\n res += hashmap[double]\\n idx += 2\\n continue\\n res += hashmap[s[idx]]\\n idx += 1\\n return res\\n\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n res = 0\\n rome = ['I', 'V', 'X', 'L', 'C', 'D', 'M']\\n normal = [1, 5, 10, 50, 100, 500, 1000]\\n\\n rtn = {k:v for k,v in zip(rome, normal)}\\n \\n swch = rome.index(s[-1])\\n\\n for i in reversed(range(len(s))):\\n\\n if rome.index(s[i]) >= swch:\\n res += rtn[s[i]]\\n swch = rome.index(s[i])\\n else:\\n res -= rtn[s[i]]\\n \\n\\n \\n return res\\n\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n sum = 0\\n table = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}\\n \\n ind = 0\\n while ind < len(s) - 1:\\n \\n if s[ind] == 'I' and s[ind+1] == 'V':\\n sum += 4\\n elif s[ind] == 'I' and s[ind+1] == 'X':\\n sum += 9\\n elif s[ind] == 'X' and s[ind+1] == 'L':\\n sum += 40\\n elif s[ind] == 'X' and s[ind+1] == 'C':\\n sum += 90\\n elif s[ind] == 'C' and s[ind+1] == 'D':\\n sum += 400\\n elif s[ind] == 'C' and s[ind+1] == 'M':\\n sum += 900\\n else:\\n sum += table.get(s[ind])\\n ind += 1\\n continue\\n \\n ind += 2 \\n \\n if ind < len(s):\\n sum += table.get(s[ind])\\n\\n return sum \\n \",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n\\n symbol_num = {\\\"I\\\" : 1, \\\"V\\\" : 5, \\\"X\\\": 10, \\\"L\\\" : 50, \\\"C\\\":100, \\\"D\\\": 500, \\\"M\\\": 1000} \\n \\n total = symbol_num[s[len(s)-1]]\\n\\n for i in range(len(s)-2, -1, -1):\\n \\n if symbol_num[s[i]] < symbol_num[s[i+1]]:\\n total -= symbol_num[s[i]]\\n else:\\n total += symbol_num[s[i]]\\n \\n\\n\\n\\n return total\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n \\n # rti is a dict for roman to intgers values\\n rti = {'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}\\n\\n # ans is for our sum value\\n ans=0\\n\\n # for loop till len(s)-1 cause for last Roman Value we cant compare\\n for i in range(len(s)-1):\\n if rti[s[i]] < rti[s[i+1]]:\\n ans = ans - rti[s[i]]\\n else: \\n ans = ans + rti[s[i]]\\n\\n # So we add the last value and return the final ans\\n return ans+rti[s[-1]]\\n \",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n sym={'M':1000,'CM':900,'D':500,'CD':400,'C':100,'XC':90,'L':50,'XL':40,'X':10,'IX':9,'V':5,'IV':4,'I':1}\\n num=0\\n x=len(s)\\n for i in range(len(s)):\\n if i <x-1 and sym[s[i]]<sym[s[i+1]]:\\n num -= sym[s[i]]\\n else:\\n num +=sym[s[i]]\\n return num\\n\\n\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n roman_symbols_dict = {'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}\\n l = len(s)\\n if l == 1 and s in roman_symbols_dict:\\n return roman_symbols_dict[s]\\n nums = 0\\n i = 0\\n while i < l:\\n if i+1 < l and roman_symbols_dict[s[i]] < roman_symbols_dict[s[i+1]]:\\n nums = nums + roman_symbols_dict[s[i+1]] - roman_symbols_dict[s[i]]\\n i += 2\\n else:\\n nums = nums + roman_symbols_dict[s[i]]\\n i += 1\\n return nums\\n\\n\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n def convert(huruf: str) -> int:\\n match huruf:\\n case 'I':\\n return 1\\n case 'V':\\n return 5\\n case 'X':\\n return 10\\n case 'L':\\n return 50\\n case 'C':\\n return 100\\n case 'D':\\n return 500\\n case 'M':\\n return 1000\\n \\n sum = 0\\n\\n for i in range(len(s)):\\n if (s[i] in ['I', 'X', 'C']) and (i != len(s) - 1):\\n if convert(s[i + 1]) > convert(s[i]):\\n sum -= convert(s[i])\\n else:\\n sum += convert(s[i])\\n else:\\n sum += convert(s[i])\\n\\n return sum\\n \",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n hashmap = {\\n \\\"I\\\":1,\\n \\\"V\\\":5,\\n \\\"X\\\":10,\\n \\\"L\\\":50,\\n \\\"C\\\":100,\\n \\\"D\\\":500,\\n \\\"M\\\":1000\\n }\\n integers = []\\n for i in range(len(s)-1,-1,-1):\\n value = hashmap[s[i]]\\n print(value)\\n if len(integers)>0 and value < integers[-1]:\\n value = integers[-1] - value\\n integers.pop()\\n print(value)\\n integers.append(value)\\n summ = 0\\n for i in integers:\\n summ += i\\n return summ\\n\\n\\n \",\n \"runtime\": \"58\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":65,"string":"65"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n d = {'I' : 1, 'V' : 5, 'X' : 10, 'L' : 50, 'C' : 100, 'D' : 500, 'M' : 1000}\n prev = d[s[-1]]\n num = d[s[-1]]\n for i in s[-2::-1]:\n if d[i] >= prev:\n num += d[i]\n else:\n num -= d[i]\n prev = d[i]\n return num\n\n ","memory":"15900"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n # Mapping of Roman numerals to integers\n roman_to_int_map = {\n 'I': 1, 'V': 5, 'X': 10, 'L': 50,\n 'C': 100, 'D': 500, 'M': 1000\n }\n \n total = 0\n \n # Traverse the string\n for i in range(len(s)):\n # If the current value is less than the next one, subtract it\n if i + 1 < len(s) and roman_to_int_map[s[i]] < roman_to_int_map[s[i + 1]]:\n total -= roman_to_int_map[s[i]]\n else:\n # Otherwise, add it to the total\n total += roman_to_int_map[s[i]]\n \n return total\n\n ","memory":"16000"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n m = {\n 'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000\n }\n \n ans = 0\n \n for i in range(len(s)):\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\n ans -= m[s[i]]\n else:\n ans += m[s[i]]\n \n return ans","memory":"16100"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n translations = {\n \"I\": 1,\n \"V\": 5,\n \"X\": 10,\n \"L\": 50,\n \"C\": 100,\n \"D\": 500,\n \"M\": 1000\n }\n number = 0\n s = s.replace(\"IV\", \"IIII\").replace(\"IX\", \"VIIII\")\n s = s.replace(\"XL\", \"XXXX\").replace(\"XC\", \"LXXXX\")\n s = s.replace(\"CD\", \"CCCC\").replace(\"CM\", \"DCCCC\")\n for char in s:\n number += translations[char]\n return number\n ","memory":"16200"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n convertor = {\n 'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000\n\n }\n decresed_convertor = {\n 'I': ['V', 'X'],\n 'X': ['L', 'C'],\n 'C': ['D', 'M']\n }\n total = 0\n roman = list(s)\n\n for index, number in enumerate(roman):\n n = convertor[number]\n e = decresed_convertor.get(number)\n if e and index + 1 < len(roman) and roman[index+1] in e:\n total -= convertor[number]\n else:\n total += n\n\n\n return total\n ","memory":"16300"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n conversion={\n \"I\" : 1,\n \"V\" : 5,\n \"X\" : 10,\n \"L\" : 50,\n \"C\" : 100,\n \"D\" : 500,\n \"M\" : 1000,\n \"IV\" : 4,\n \"IX\" : 9,\n \"XL\" : 40, \"XC\":90,\n \"CD\" : 400, \"CM\" : 900\n }\n answer=0\n i=0\n while(i<len(s)):\n if s[i:i+2] in conversion:\n answer += conversion[s[i:i+2]]\n i+=2\n else:\n answer += conversion[s[i]]\n i+=1\n return answer","memory":"16300"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n i = 0\n integer = 0\n \n values = {\n \"I\": 1,\n \"V\": 5,\n \"X\": 10,\n \"L\": 50,\n \"C\": 100,\n \"D\": 500,\n \"M\": 1000,\n }\n \n\n while i < len(s):\n if i+1 < len(s) and values[s[i]] < values[s[i+1]]:\n integer += values[s[i+1]] - values[s[i]]\n i += 2\n else:\n integer += values[s[i]]\n i += 1\n return integer\n ","memory":"16400"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n # map of roman numerals to integer values\n values = {\n \"I\": 1,\n \"V\": 5,\n \"X\": 10,\n \"L\": 50,\n \"C\": 100,\n \"D\": 500,\n \"M\": 1000\n }\n\n total = 0\n for i in range(len(s)):\n if i < len(s)-1 and values[s[i]] < values[s[i+1]]:\n total -= values[s[i]]\n else:\n total += values[s[i]]\n return total\n ","memory":"16400"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n dict = {\"I\": 1, \"V\": 5, \"X\": 10, \"L\": 50, \"C\": 100, \"D\": 500, \"M\": 1000}\n res = 0\n last = 0\n for i in range(len(s) - 1, -1, -1):\n if dict[s[i]] < last:\n res -= dict[s[i]]\n else:\n res += dict[s[i]]\n last = dict[s[i]]\n\n return res\n\n \n ","memory":"16500"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n number = 0\n lst = {'M': 1000, 'CM':900,'D': 500,'CD':400,'C':100,'XC':90,'L':50,'XL':40, 'X':10,'IX':9,'V':5,'IV':4,'I':1}\n \n while s:\n if len(s) >=2:\n if s[0:2] in lst:\n number = number + lst[s[0:2]]\n s = s[2:]\n elif s[0] in lst:\n number = number + lst[s[0]]\n s = s[1:]\n else:\n print('error')\n break\n else:\n number = number + lst[s[0]]\n s = s[1:]\n \n return(number)\n \n \n \n \n ","memory":"16500"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n m = {\n 'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000\n }\n \n ans = 0\n \n for i in range(len(s)):\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\n ans -= m[s[i]]\n else:\n ans += m[s[i]]\n \n return ans","memory":"16600"},{"code":"class Solution:\n def romanToInt(self, s: str) -> int:\n symbol_map = {\n \"IV\": 4, \"IX\": 9, \"XL\": 40, \"XC\": 90, \"CD\": 400, \"CM\": 900,\n \"I\": 1, \"V\": 5, \"X\": 10, \"L\": 50, \"C\": 100, \"D\": 500, \"M\": 1000\n }\n\n r = 0\n \n for symbol, value in symbol_map.items():\n if len(symbol) > 1 and s.rfind(symbol) != -1:\n r += value\n s = s.replace(symbol,'',1)\n continue\n while s.rfind(symbol) != -1:\n r += value\n s = s.replace(symbol,'',1)\n if len(s) == 0:\n break\n\n return r\n","memory":"16600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n d = {'I' : 1, 'V' : 5, 'X' : 10, 'L' : 50, 'C' : 100, 'D' : 500, 'M' : 1000}\\n prev = d[s[-1]]\\n num = d[s[-1]]\\n for i in s[-2::-1]:\\n if d[i] >= prev:\\n num += d[i]\\n else:\\n num -= d[i]\\n prev = d[i]\\n return num\\n\\n \",\n \"memory\": \"15900\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n # Mapping of Roman numerals to integers\\n roman_to_int_map = {\\n 'I': 1, 'V': 5, 'X': 10, 'L': 50,\\n 'C': 100, 'D': 500, 'M': 1000\\n }\\n \\n total = 0\\n \\n # Traverse the string\\n for i in range(len(s)):\\n # If the current value is less than the next one, subtract it\\n if i + 1 < len(s) and roman_to_int_map[s[i]] < roman_to_int_map[s[i + 1]]:\\n total -= roman_to_int_map[s[i]]\\n else:\\n # Otherwise, add it to the total\\n total += roman_to_int_map[s[i]]\\n \\n return total\\n\\n \",\n \"memory\": \"16000\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n m = {\\n 'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000\\n }\\n \\n ans = 0\\n \\n for i in range(len(s)):\\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\\n ans -= m[s[i]]\\n else:\\n ans += m[s[i]]\\n \\n return ans\",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n translations = {\\n \\\"I\\\": 1,\\n \\\"V\\\": 5,\\n \\\"X\\\": 10,\\n \\\"L\\\": 50,\\n \\\"C\\\": 100,\\n \\\"D\\\": 500,\\n \\\"M\\\": 1000\\n }\\n number = 0\\n s = s.replace(\\\"IV\\\", \\\"IIII\\\").replace(\\\"IX\\\", \\\"VIIII\\\")\\n s = s.replace(\\\"XL\\\", \\\"XXXX\\\").replace(\\\"XC\\\", \\\"LXXXX\\\")\\n s = s.replace(\\\"CD\\\", \\\"CCCC\\\").replace(\\\"CM\\\", \\\"DCCCC\\\")\\n for char in s:\\n number += translations[char]\\n return number\\n \",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n convertor = {\\n 'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000\\n\\n }\\n decresed_convertor = {\\n 'I': ['V', 'X'],\\n 'X': ['L', 'C'],\\n 'C': ['D', 'M']\\n }\\n total = 0\\n roman = list(s)\\n\\n for index, number in enumerate(roman):\\n n = convertor[number]\\n e = decresed_convertor.get(number)\\n if e and index + 1 < len(roman) and roman[index+1] in e:\\n total -= convertor[number]\\n else:\\n total += n\\n\\n\\n return total\\n \",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n conversion={\\n \\\"I\\\" : 1,\\n \\\"V\\\" : 5,\\n \\\"X\\\" : 10,\\n \\\"L\\\" : 50,\\n \\\"C\\\" : 100,\\n \\\"D\\\" : 500,\\n \\\"M\\\" : 1000,\\n \\\"IV\\\" : 4,\\n \\\"IX\\\" : 9,\\n \\\"XL\\\" : 40, \\\"XC\\\":90,\\n \\\"CD\\\" : 400, \\\"CM\\\" : 900\\n }\\n answer=0\\n i=0\\n while(i<len(s)):\\n if s[i:i+2] in conversion:\\n answer += conversion[s[i:i+2]]\\n i+=2\\n else:\\n answer += conversion[s[i]]\\n i+=1\\n return answer\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n i = 0\\n integer = 0\\n \\n values = {\\n \\\"I\\\": 1,\\n \\\"V\\\": 5,\\n \\\"X\\\": 10,\\n \\\"L\\\": 50,\\n \\\"C\\\": 100,\\n \\\"D\\\": 500,\\n \\\"M\\\": 1000,\\n }\\n \\n\\n while i < len(s):\\n if i+1 < len(s) and values[s[i]] < values[s[i+1]]:\\n integer += values[s[i+1]] - values[s[i]]\\n i += 2\\n else:\\n integer += values[s[i]]\\n i += 1\\n return integer\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n # map of roman numerals to integer values\\n values = {\\n \\\"I\\\": 1,\\n \\\"V\\\": 5,\\n \\\"X\\\": 10,\\n \\\"L\\\": 50,\\n \\\"C\\\": 100,\\n \\\"D\\\": 500,\\n \\\"M\\\": 1000\\n }\\n\\n total = 0\\n for i in range(len(s)):\\n if i < len(s)-1 and values[s[i]] < values[s[i+1]]:\\n total -= values[s[i]]\\n else:\\n total += values[s[i]]\\n return total\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n dict = {\\\"I\\\": 1, \\\"V\\\": 5, \\\"X\\\": 10, \\\"L\\\": 50, \\\"C\\\": 100, \\\"D\\\": 500, \\\"M\\\": 1000}\\n res = 0\\n last = 0\\n for i in range(len(s) - 1, -1, -1):\\n if dict[s[i]] < last:\\n res -= dict[s[i]]\\n else:\\n res += dict[s[i]]\\n last = dict[s[i]]\\n\\n return res\\n\\n \\n \",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n number = 0\\n lst = {'M': 1000, 'CM':900,'D': 500,'CD':400,'C':100,'XC':90,'L':50,'XL':40, 'X':10,'IX':9,'V':5,'IV':4,'I':1}\\n \\n while s:\\n if len(s) >=2:\\n if s[0:2] in lst:\\n number = number + lst[s[0:2]]\\n s = s[2:]\\n elif s[0] in lst:\\n number = number + lst[s[0]]\\n s = s[1:]\\n else:\\n print('error')\\n break\\n else:\\n number = number + lst[s[0]]\\n s = s[1:]\\n \\n return(number)\\n \\n \\n \\n \\n \",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n m = {\\n 'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000\\n }\\n \\n ans = 0\\n \\n for i in range(len(s)):\\n if i < len(s) - 1 and m[s[i]] < m[s[i+1]]:\\n ans -= m[s[i]]\\n else:\\n ans += m[s[i]]\\n \\n return ans\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def romanToInt(self, s: str) -> int:\\n symbol_map = {\\n \\\"IV\\\": 4, \\\"IX\\\": 9, \\\"XL\\\": 40, \\\"XC\\\": 90, \\\"CD\\\": 400, \\\"CM\\\": 900,\\n \\\"I\\\": 1, \\\"V\\\": 5, \\\"X\\\": 10, \\\"L\\\": 50, \\\"C\\\": 100, \\\"D\\\": 500, \\\"M\\\": 1000\\n }\\n\\n r = 0\\n \\n for symbol, value in symbol_map.items():\\n if len(symbol) > 1 and s.rfind(symbol) != -1:\\n r += value\\n s = s.replace(symbol,'',1)\\n continue\\n while s.rfind(symbol) != -1:\\n r += value\\n s = s.replace(symbol,'',1)\\n if len(s) == 0:\\n break\\n\\n return r\\n\",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":12,"string":"12"}}},{"rowIdx":180,"cells":{"question_id":{"kind":"number","value":14,"string":"14"},"name":{"kind":"string","value":"longest-common-prefix"},"content":{"kind":"string","value":"<p>Write a function to find the longest common prefix string amongst an array of strings.</p>\n\n<p>If there is no common prefix, return an empty string <code>""</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> strs = ["flower","flow","flight"]\n<strong>Output:</strong> "fl"\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> strs = ["dog","racecar","car"]\n<strong>Output:</strong> ""\n<strong>Explanation:</strong> There is no common prefix among the input strings.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= strs.length <= 200</code></li>\n\t<li><code>0 <= strs[i].length <= 200</code></li>\n\t<li><code>strs[i]</code> consists of only lowercase English letters.</li>\n</ul>\n"},"acRate":{"kind":"number","value":43.78651242697514,"string":"43.786512"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["string","trie"],"string":"[\n \"string\",\n \"trie\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"15\", 0.013], [\"16\", 0.0093], [\"17\", 0.0056], [\"18\", 0.0186], [\"19\", 0.0671], [\"20\", 0.069], [\"21\", 0.0485], [\"22\", 0.1864], [\"23\", 0.3989], [\"24\", 0.4716], [\"25\", 0.3448], [\"26\", 0.7064], [\"27\", 1.4482], [\"28\", 1.4892], [\"29\", 1.4911], [\"30\", 2.1453], [\"31\", 3.8246], [\"32\", 4.1135], [\"33\", 3.8414], [\"34\", 4.4379], [\"35\", 6.8739], [\"36\", 7.023], [\"37\", 6.4154], [\"38\", 6.1675], [\"39\", 7.7909], [\"40\", 7.8096], [\"41\", 6.421], [\"42\", 5.4499], [\"43\", 4.8759], [\"44\", 4.4565], [\"45\", 3.3419], [\"46\", 2.5535]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16000\", 0.0019], [\"16100\", 0.0037], [\"16200\", 0.0149], [\"16300\", 0.2703], [\"16400\", 4.4695], [\"16500\", 24.0811], [\"16600\", 41.2659]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n \n word=strs[0]\n \n \n for i in strs:\n if len(i)<len(word):\n word=i\n print(word)\n if len(word)<1:\n return word\n str1=''\n for i in range(len(word)):\n flag=0\n for j in strs:\n if j ==word:\n continue\n elif j[i]!=word[i]:\n flag=1\n break\n if flag==0:\n str1+=word[i]\n else:\n break\n return str1","runtime":"15"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n out = \"\"\n smallest = min([len(x) for x in strs])\n \n # print(smallest)\n \n def build_output():\n nonlocal out\n i = 0\n while i < smallest:\n char = strs[0][i]\n for frag in strs[1:]:\n if frag[i] != char:\n return\n\n out += char\n i += 1\n \n \n build_output()\n return out\n \n \n \n \n \n ","runtime":"16"},{"code":"class Solution:\n def longestCommonPrefix(self, v: List[str]) -> str:\n ans=\"\"\n v=sorted(v)\n first=v[0]\n last=v[-1]\n for i in range(min(len(first),len(last))):\n if(first[i]!=last[i]):\n return ans\n ans+=first[i]\n return ans ","runtime":"17"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n ans = \"\"\n\n for idx in range(len(strs[0])):\n for s in strs:\n if idx == len(s) or s[idx] != strs[0][idx]:\n return ans\n ans += strs[0][idx]\n\n return ans","runtime":"18"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n if len(strs) == 0:\n return \"\"\n first = strs[0]\n for i in range(1, len(strs)):\n while strs[i].find(first) != 0:\n first = first[0:len(first)-1]\n print(first)\n if first == \"\":\n return \"\"\n return first","runtime":"19"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n pref = strs[0]\n lenpref = len(pref)\n\n\n for val in strs[1:]:\n while pref != val[0:lenpref]:\n lenpref -= 1 \n # if lenpref == 0:\n # return \"\"\n pref = pref[0:lenpref]\n\n return pref\n\n","runtime":"19"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n if not strs:\n return \"\"\n min_str = min(strs, key=len)\n for i, char in enumerate(min_str):\n for other in strs:\n if other[i] != char:\n return min_str[:i]\n return min_str","runtime":"20"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n n = 1e9\n for s in strs:\n n = min(n, len(s))\n \n for i in range(n, 0, -1):\n pre = strs[0][:i]\n good = True\n for s in strs:\n if s[:i] != pre:\n good = False \n break\n if good:\n return pre \n return \"\"\n","runtime":"21"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n strs.sort()\n pre_len = 0\n pre_fix = \"\"\n for i in range(len(strs[0])):\n if (strs[0][i] == strs[-1][i]):\n pre_len += 1\n pre_fix += str(strs[0][i])\n else:\n break\n return pre_fix\n \n ","runtime":"22"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n ret=\"\"\n prefix=\"\"\n # Time complexity O(len(max_length) * maxlist (srlen()) = 200 * 200 )\n for i in range(len(strs[0])):\n prefix+=strs[0][i]\n Check=True\n for str in strs:\n cur_prefix = str[:i+1]\n # print(f'cur_prefix :{cur_prefix} prefix : {prefix}')\n if prefix!=cur_prefix:\n Check=False\n if Check==True:\n ret+=strs[0][i]\n else:\n break\n return ret\n ","runtime":"22"},{"code":"class Solution:\n def longestCommonPrefix(self, v: List[str]) -> str:\n ans=\"\"\n v=sorted(v)\n first=v[0]\n last=v[-1]\n for i in range(min(len(first),len(last))):\n if(first[i]!=last[i]):\n return ans\n ans+=first[i]\n return ans ","runtime":"23"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n strs=sorted(strs)\n first=strs[0]\n last=strs[-1]\n ans=\"\"\n print (min(len(first),len(last)))\n for i in range(min(len(first),len(last))):\n if(first[i]!=last[i]):\n return ans\n ans+=first[i]\n return ans \n\n\n\n ","runtime":"23"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n results = \"\"\n strs.sort()\n first = strs[0]\n last = strs[-1]\n for i in range(min(len(first), len(last))):\n if first[i] == last[i]:\n results += first[i]\n else:\n return results\n \n return results\n\n\n\n\n ","runtime":"24"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n\n # HELP ME GOD.\n prefix = \"\"\n if not strs:\n return prefix\n\n for i in range(len(strs[0])):\n for j in range(len(strs)):\n if i == len(strs[j]) or strs[0][i] != strs[j][i]:\n return prefix\n\n prefix += strs[0][i]\n\n return prefix\n","runtime":"24"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n if not strs:\n return \"\"\n\n prefix = strs[0]\n\n for string in strs[1:]:\n while not string.startswith(prefix):\n prefix = prefix[:-1]\n if not prefix:\n return \"\"\n\n return prefix","runtime":"25"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n # define empty string for output\n # sort strings alphabetically\n # look at first at last string\n string = \"\"\n strs.sort()\n for i in range(min(len(strs[0]), len(strs[-1]))):\n if strs[0][i] != strs[-1][i]:\n return string\n string += strs[0][i]\n return string\n\n # print(sorted(strs))\n # return strs[0]\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n # ans = \"\"\n # strs = sorted(strs)\n # first = strs[0]\n # last = strs[-1]\n # print(first, last)\n # for i in range(min(len(first), len(last))):\n # if(first[i]!=last[i]):\n # return ans\n # ans+=first[i]\n # return ans\n\n","runtime":"25"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n for i in range(len(strs[0])):\n c = strs[0][i]\n for j in range(1, len(strs)):\n if i == len(strs[j]) or strs[j][i] != c:\n return strs[0][:i]\n return strs[0]\n","runtime":"26"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n if not strs:\n return \"\"\n\n # Start with the first string as the common prefix\n prefix = strs[0]\n \n # Compare the prefix with the rest of the strings\n for s in strs[1:]:\n # Adjust the prefix length until it matches the current string\n while not s.startswith(prefix):\n prefix = prefix[:-1]\n if not prefix:\n return \"\"\n \n return prefix","runtime":"26"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n n=len(strs)\n ans=''\n strs=sorted(strs)\n for i in range(min(len(strs[0]),len(strs[n-1]))):\n if strs[0][i]!=strs[n-1][i]:\n return ans\n else:\n ans+=strs[0][i]\n return ans\n\n ","runtime":"27"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n \n strs_len = len(strs)\n\n if strs_len == 1:\n return strs[0]\n \n prefix = strs[0]\n \n for strs_index in range(1, len(strs)):\n \n while strs[strs_index].find(prefix) != 0:\n prefix = prefix[0 : len(prefix) - 1]\n \n if prefix == \"\":\n return \"\"\n \n return prefix\n ","runtime":"27"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n sorted = strs.sort()\n prefix = \"\"\n first = strs[0]\n last = strs[len(strs)-1]\n for i in range(len(first)):\n if first[i] == last[i]:\n prefix += first[i]\n else:\n break\n return prefix","runtime":"28"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n l = 1e9\n\n for s in strs:\n l = min(l, len(s))\n \n ans = \"\"\n for i in range(l):\n temp = strs[0][i]\n for s in strs:\n if s[i] != temp:\n return ans\n ans += temp\n \n return ans\n\n","runtime":"28"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n res = \"\"\n\n for i in range(len(strs[0])):\n for s in strs:\n if i == len(s) or s[i] != strs[0][i]:\n return res\n res += strs[0][i]\n\n return res","runtime":"29"},{"code":"class Solution:\n def longestCommonPrefix(self, v: List[str]) -> str:\n ans=\"\"\n v=sorted(v)\n first=v[0]\n last=v[-1]\n for i in range(min(len(first),len(last))):\n if(first[i]!=last[i]):\n return ans\n ans+=first[i]\n return ans ","runtime":"29"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n if not strs:\n return \"\"\n\n res = \"\"\n for i in range(len(strs[0])):\n for s in strs:\n if i == len(s) or s[i] != strs[0][i]:\n return res\n res += strs[0][i]\n return res\n\n","runtime":"30"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n if not strs:\n return \"\"\n\n # Start with the first string as the common prefix\n prefix = strs[0]\n # Compare the prefix with the rest of the strings\n for s in strs[1:]:\n min_len = min(len(prefix),len(s))\n\n i = 0\n while i < min_len and prefix[i] == s[i]:\n i+=1\n prefix = prefix[:i]\n\n if not prefix: \n return \"\"\n \n return prefix","runtime":"30"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n pref=strs[0]\n preflen=len(pref)\n for s in strs[1:]:\n while pref!=s[0:preflen]:\n preflen-=1\n if preflen==0:\n return \"\"\n pref=pref[0:preflen]\n \n return pref\n\n","runtime":"31"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n pref = strs[0]\n pref_len = len(pref)\n\n for s in strs[1:]:\n while pref != s[0:pref_len]:\n pref_len -= 1\n if pref_len == 0:\n return \"\"\n \n pref = pref[0:pref_len]\n \n return pref","runtime":"31"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n first = strs[0]\n matched = \"\"\n result = \"\"\n for char in first:\n matched += char\n matching = True\n for str_ in strs[1:]:\n if not str_.startswith(matched):\n matching = False\n return result\n result = matched\n \n return result","runtime":"32"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n n = len(strs)\n m = float('inf')\n res = \"\"\n flag = True\n for s in strs:\n if len(s) < m:\n m = len(s)\n for i in range(m):\n for j in range(n-1):\n if strs[j][i] != strs[j+1][i]:\n flag = False\n return res\n else:\n flag = True\n if flag:\n res =res+ strs[0][i]\n return res\n\n\n\n\n ","runtime":"32"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n\n pre = strs[0]\n \n for i in strs:\n while not i.startswith(pre):\n pre = pre[:-1]\n \n return pre","runtime":"33"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n ans = \"\"\n if len(strs) == 1:\n return strs[0]\n\n for i in range(len(strs[0])):\n for j in range(len(strs)):\n if i > len(strs[j]) - 1 or strs[j][i] != strs[0][i]:\n return ans\n if strs[j][i] == strs[0][i] and j == len(strs) - 1:\n ans += strs[0][i]\n return ans\n","runtime":"33"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n common_prefix = \"\"\n sorted_list = sorted(strs)\n first=sorted_list[0]\n last= sorted_list[-1]\n for i in range(min(len(first),len(last))):\n if first[i] != last[i]:\n return common_prefix\n else:\n common_prefix += first[i]\n return common_prefix","runtime":"34"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n pref = strs[0]\n pref_len = len(pref)\n\n for s in strs[1:]:\n while pref != s[0:pref_len]:\n pref_len -= 1\n if pref_len == 0:\n return \"\"\n \n pref = pref[0:pref_len]\n \n return pref\n \n ","runtime":"34"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n pref=strs[0]\n pref_len=len(pref)\n for s in strs[1:]:\n while pref!=s[0:pref_len]:\n pref_len-=1\n if pref_len==0:\n return \"\"\n pref=pref[0:pref_len]\n return pref","runtime":"35"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n res = \"\"\n c=0\n t = set()\n mnl = 9999999\n for w in strs:\n mnl = min(mnl, len(w))\n print(mnl)\n while(c<mnl):\n t = set()\n for word in strs:\n t.add(word[c])\n c+=1\n if len(t)==1:\n res+= list(t)[0]\n else:\n break\n return res","runtime":"35"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n done = False\n idx = 0\n while not done:\n first_val = None\n\n for i in range(len(strs)):\n if idx >= len(strs[i]):\n idx -= 1\n done = True\n break\n\n if not first_val:\n first_val = strs[i][idx]\n continue\n\n if strs[i][idx] != first_val:\n done = True\n idx -= 1\n break \n\n idx += 1\n\n return strs[0][:idx]","runtime":"36"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n prefix = []\n allThere = False #checks if the 'checker' letter is there in all list strs\n allchecked = False #checks if all the letters have been checked\n \n index = 0\n\n while allchecked != True:\n for index in range(len(strs[0])):\n checker = strs[0][index]\n allThere = False\n firstFlag = False\n while allThere != True:\n \n for i in range(len(strs)):\n same = True\n if index < len(strs[i]): \n if strs[i][index] != checker:\n same = False\n allThere = False\n firstFlag = True\n break\n else:\n pass\n else:\n same = False\n firstFlag = True\n break\n allThere = True\n if same: prefix.append(checker)\n if firstFlag:\n break\n allchecked = True\n prefix_str = ''.join(prefix)\n return prefix_str\n \n \n \n \n\n \n\n ","runtime":"36"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n pref = strs[0]\n pref_len = len(pref)\n for s in strs[1:]:\n while pref != s[0:pref_len]:\n pref_len -= 1\n if pref_len == 0 :\n return \"\"\n\n pref = pref[0:pref_len] \n return pref\n","runtime":"37"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n if not strs:\n return \"\"\n l=\"\"\n minlength=min(len(s) for s in strs)\n for i in range(minlength):\n char=strs[0][i]\n for s in strs:\n if s[i]!=char:\n return l\n l=l+char\n return l\n\n \n\n \n\n \n ","runtime":"37"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n # alphabet sorting, not length\n # flat, flight, floss, flow, flower => fl\n # face, flag, flat => f \n # now just compare first and last words to get common substring\n if not strs: return \"\"\n lcp = \"\"\n for char in zip(*strs):\n if len(set(char)) == 1:\n lcp += char[0]\n else:\n break\n return lcp","runtime":"38"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n # Go through the first letter of each string in the array\n #if all are the same, export character to answer\n #go through the next letter until there is nothing common\n if not strs:\n return \"\"\n if \"\" in strs:\n return \"\"\n \n ans = \"\"\n stringOne = strs[0]\n charOne = stringOne[0]\n j = 0\n fullBreak = False\n if (len(strs) == 1):\n return strs[0]\n\n #Iterates j for each character in the first string of strs\n while (j < len(stringOne)):\n if (fullBreak == True):\n break\n charOne = stringOne[j]\n #Iterates i for the second and onwards strings\n for i in (range(1, len(strs))):\n stringTwo = strs[i]\n if (j < len(stringTwo)):\n charTwo = stringTwo[j]\n else:\n fullBreak = True\n break\n if (charOne != charTwo):\n fullBreak = True\n break\n if (fullBreak != True ):\n ans = ans + charTwo \n j = j + 1\n \n return ans\n\n\n\n ","runtime":"38"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n strs.sort(key=len)\n pf = ''\n for i,l in enumerate(strs[0]):\n for word in strs[1:]:\n if word[i] != l:\n return pf\n pf += l\n return pf\n","runtime":"39"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n actual_prefix = \"\"\n current_prefix = \"\"\n for i in range(200):\n if i < len(strs[0]):\n current_prefix += strs[0][i]\n else:\n return actual_prefix\n for st in strs:\n if not st.startswith(current_prefix):\n return actual_prefix\n actual_prefix = current_prefix\n ","runtime":"39"},{"code":"from typing import List\n\nclass Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n if not strs:\n return \"\"\n \n # Find the minimum length string in the list\n min_length = min(len(s) for s in strs)\n \n low, high = 0, min_length\n \n while low <= high:\n mid = (low + high) // 2\n if self.is_common_prefix(strs, mid):\n low = mid + 1\n else:\n high = mid - 1\n \n return strs[0][: (low + high) // 2]\n \n def is_common_prefix(self, strs: List[str], length: int) -> bool:\n prefix = strs[0][:length]\n return all(s.startswith(prefix) for s in strs)","runtime":"40"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n if not strs:\n return \"\" # Return empty string for empty list\n if len(strs) == 1:\n return strs[0] # Return the single string if there's only one\n \n # Iterate over each character of the first string\n for i in range(len(strs[0])):\n char = strs[0][i]\n # Compare the current character with all other strings\n for j in range(1, len(strs)):\n # If the character doesn't match or the string is shorter, return the prefix so far\n if i == len(strs[j]) or strs[j][i] != char:\n return strs[0][:i]\n \n return strs[0] # If no mismatch found, return the first string as the common prefix\n","runtime":"40"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n ans=\"\"\n strs=sorted(strs)\n first=strs[0]\n last=strs[-1]\n for i in range(min(len(first),len(last))):\n if(first[i]!=last[i]):\n return ans\n ans+=first[i]\n\n return ans","runtime":"41"},{"code":"class Solution:\n def longestCommonPrefix(self, v: List[str]) -> str:\n ans=\"\"\n v=sorted(v)\n first=v[0]\n last=v[-1]\n for i in range(min(len(first),len(last))):\n if(first[i]!=last[i]):\n return ans\n ans+=first[i]\n return ans ","runtime":"43"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n first = strs[0]\n matched = \"\"\n result = \"\"\n for char in first:\n matched += char\n matching = True\n for str_ in strs[1:]:\n if not str_.startswith(matched):\n matching = False\n return result\n result = matched\n \n return result","runtime":"43"},{"code":"class Solution(object):\n def longestCommonPrefix(self, strs):\n if len(strs) == 0:\n return \"\"\n\n base = strs[0]\n for i in range(len(base)):\n for word in strs[1:]:\n if i == len(word) or word[i] != base[i]:\n return base[0:i]\n\n return base\n ","runtime":"44"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n answer = strs[0]\n for string in strs[1:]:\n length = len(string)\n for position, letter in enumerate(answer):\n if position >= length:\n answer = string\n break\n\n if letter != string[position]:\n answer = answer[:position]\n break\n\n return answer","runtime":"44"},{"code":"class Solution:\n def two_strings_cp(self, str1, str2):\n output_str = \"\"\n index1 = 0\n index2 =0 \n while index1 < len(str1) and index2 < len(str2):\n if str1[index1]==str2[index2]:\n output_str += str1[index1]\n index1 += 1\n index2 += 1\n else:\n break\n return output_str\n \n\n def longestCommonPrefix(self, strs: List[str]) -> str:\n if len(strs)==1:\n return strs[0]\n elif len(strs)==0:\n return \"\"\n else:\n result = self.two_strings_cp(strs[0],strs[1])\n for i in range(2,len(strs)):\n if result == \"\":\n return \"\"\n result = self.two_strings_cp(result, strs[i])\n return result\n\n ","runtime":"45"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n pref = ''\n if strs == []:\n return pref\n for elem in zip(*strs, *strs):\n if all(x == elem[0] for x in elem):\n pref += elem[0]\n else:\n return pref\n return pref","runtime":"45"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n answer = ''\n for x in zip(*strs):\n if x.count(x[0])!=len(x):\n return answer\n answer+=x[0]\n return answer\n ","runtime":"46"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n prefix = \"\"\n for char in strs[0]:\n if all(_str.startswith(prefix + char) for _str in strs):\n prefix += char\n return prefix","runtime":"46"}],"string":"[\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n \\n word=strs[0]\\n \\n \\n for i in strs:\\n if len(i)<len(word):\\n word=i\\n print(word)\\n if len(word)<1:\\n return word\\n str1=''\\n for i in range(len(word)):\\n flag=0\\n for j in strs:\\n if j ==word:\\n continue\\n elif j[i]!=word[i]:\\n flag=1\\n break\\n if flag==0:\\n str1+=word[i]\\n else:\\n break\\n return str1\",\n \"runtime\": \"15\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n out = \\\"\\\"\\n smallest = min([len(x) for x in strs])\\n \\n # print(smallest)\\n \\n def build_output():\\n nonlocal out\\n i = 0\\n while i < smallest:\\n char = strs[0][i]\\n for frag in strs[1:]:\\n if frag[i] != char:\\n return\\n\\n out += char\\n i += 1\\n \\n \\n build_output()\\n return out\\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"16\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, v: List[str]) -> str:\\n ans=\\\"\\\"\\n v=sorted(v)\\n first=v[0]\\n last=v[-1]\\n for i in range(min(len(first),len(last))):\\n if(first[i]!=last[i]):\\n return ans\\n ans+=first[i]\\n return ans \",\n \"runtime\": \"17\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n ans = \\\"\\\"\\n\\n for idx in range(len(strs[0])):\\n for s in strs:\\n if idx == len(s) or s[idx] != strs[0][idx]:\\n return ans\\n ans += strs[0][idx]\\n\\n return ans\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n if len(strs) == 0:\\n return \\\"\\\"\\n first = strs[0]\\n for i in range(1, len(strs)):\\n while strs[i].find(first) != 0:\\n first = first[0:len(first)-1]\\n print(first)\\n if first == \\\"\\\":\\n return \\\"\\\"\\n return first\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n pref = strs[0]\\n lenpref = len(pref)\\n\\n\\n for val in strs[1:]:\\n while pref != val[0:lenpref]:\\n lenpref -= 1 \\n # if lenpref == 0:\\n # return \\\"\\\"\\n pref = pref[0:lenpref]\\n\\n return pref\\n\\n\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n if not strs:\\n return \\\"\\\"\\n min_str = min(strs, key=len)\\n for i, char in enumerate(min_str):\\n for other in strs:\\n if other[i] != char:\\n return min_str[:i]\\n return min_str\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n n = 1e9\\n for s in strs:\\n n = min(n, len(s))\\n \\n for i in range(n, 0, -1):\\n pre = strs[0][:i]\\n good = True\\n for s in strs:\\n if s[:i] != pre:\\n good = False \\n break\\n if good:\\n return pre \\n return \\\"\\\"\\n\",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n strs.sort()\\n pre_len = 0\\n pre_fix = \\\"\\\"\\n for i in range(len(strs[0])):\\n if (strs[0][i] == strs[-1][i]):\\n pre_len += 1\\n pre_fix += str(strs[0][i])\\n else:\\n break\\n return pre_fix\\n \\n \",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n ret=\\\"\\\"\\n prefix=\\\"\\\"\\n # Time complexity O(len(max_length) * maxlist (srlen()) = 200 * 200 )\\n for i in range(len(strs[0])):\\n prefix+=strs[0][i]\\n Check=True\\n for str in strs:\\n cur_prefix = str[:i+1]\\n # print(f'cur_prefix :{cur_prefix} prefix : {prefix}')\\n if prefix!=cur_prefix:\\n Check=False\\n if Check==True:\\n ret+=strs[0][i]\\n else:\\n break\\n return ret\\n \",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, v: List[str]) -> str:\\n ans=\\\"\\\"\\n v=sorted(v)\\n first=v[0]\\n last=v[-1]\\n for i in range(min(len(first),len(last))):\\n if(first[i]!=last[i]):\\n return ans\\n ans+=first[i]\\n return ans \",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n strs=sorted(strs)\\n first=strs[0]\\n last=strs[-1]\\n ans=\\\"\\\"\\n print (min(len(first),len(last)))\\n for i in range(min(len(first),len(last))):\\n if(first[i]!=last[i]):\\n return ans\\n ans+=first[i]\\n return ans \\n\\n\\n\\n \",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n results = \\\"\\\"\\n strs.sort()\\n first = strs[0]\\n last = strs[-1]\\n for i in range(min(len(first), len(last))):\\n if first[i] == last[i]:\\n results += first[i]\\n else:\\n return results\\n \\n return results\\n\\n\\n\\n\\n \",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n\\n # HELP ME GOD.\\n prefix = \\\"\\\"\\n if not strs:\\n return prefix\\n\\n for i in range(len(strs[0])):\\n for j in range(len(strs)):\\n if i == len(strs[j]) or strs[0][i] != strs[j][i]:\\n return prefix\\n\\n prefix += strs[0][i]\\n\\n return prefix\\n\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n if not strs:\\n return \\\"\\\"\\n\\n prefix = strs[0]\\n\\n for string in strs[1:]:\\n while not string.startswith(prefix):\\n prefix = prefix[:-1]\\n if not prefix:\\n return \\\"\\\"\\n\\n return prefix\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n # define empty string for output\\n # sort strings alphabetically\\n # look at first at last string\\n string = \\\"\\\"\\n strs.sort()\\n for i in range(min(len(strs[0]), len(strs[-1]))):\\n if strs[0][i] != strs[-1][i]:\\n return string\\n string += strs[0][i]\\n return string\\n\\n # print(sorted(strs))\\n # return strs[0]\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # ans = \\\"\\\"\\n # strs = sorted(strs)\\n # first = strs[0]\\n # last = strs[-1]\\n # print(first, last)\\n # for i in range(min(len(first), len(last))):\\n # if(first[i]!=last[i]):\\n # return ans\\n # ans+=first[i]\\n # return ans\\n\\n\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n for i in range(len(strs[0])):\\n c = strs[0][i]\\n for j in range(1, len(strs)):\\n if i == len(strs[j]) or strs[j][i] != c:\\n return strs[0][:i]\\n return strs[0]\\n\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n if not strs:\\n return \\\"\\\"\\n\\n # Start with the first string as the common prefix\\n prefix = strs[0]\\n \\n # Compare the prefix with the rest of the strings\\n for s in strs[1:]:\\n # Adjust the prefix length until it matches the current string\\n while not s.startswith(prefix):\\n prefix = prefix[:-1]\\n if not prefix:\\n return \\\"\\\"\\n \\n return prefix\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n n=len(strs)\\n ans=''\\n strs=sorted(strs)\\n for i in range(min(len(strs[0]),len(strs[n-1]))):\\n if strs[0][i]!=strs[n-1][i]:\\n return ans\\n else:\\n ans+=strs[0][i]\\n return ans\\n\\n \",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n \\n strs_len = len(strs)\\n\\n if strs_len == 1:\\n return strs[0]\\n \\n prefix = strs[0]\\n \\n for strs_index in range(1, len(strs)):\\n \\n while strs[strs_index].find(prefix) != 0:\\n prefix = prefix[0 : len(prefix) - 1]\\n \\n if prefix == \\\"\\\":\\n return \\\"\\\"\\n \\n return prefix\\n \",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n sorted = strs.sort()\\n prefix = \\\"\\\"\\n first = strs[0]\\n last = strs[len(strs)-1]\\n for i in range(len(first)):\\n if first[i] == last[i]:\\n prefix += first[i]\\n else:\\n break\\n return prefix\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n l = 1e9\\n\\n for s in strs:\\n l = min(l, len(s))\\n \\n ans = \\\"\\\"\\n for i in range(l):\\n temp = strs[0][i]\\n for s in strs:\\n if s[i] != temp:\\n return ans\\n ans += temp\\n \\n return ans\\n\\n\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n res = \\\"\\\"\\n\\n for i in range(len(strs[0])):\\n for s in strs:\\n if i == len(s) or s[i] != strs[0][i]:\\n return res\\n res += strs[0][i]\\n\\n return res\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, v: List[str]) -> str:\\n ans=\\\"\\\"\\n v=sorted(v)\\n first=v[0]\\n last=v[-1]\\n for i in range(min(len(first),len(last))):\\n if(first[i]!=last[i]):\\n return ans\\n ans+=first[i]\\n return ans \",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n if not strs:\\n return \\\"\\\"\\n\\n res = \\\"\\\"\\n for i in range(len(strs[0])):\\n for s in strs:\\n if i == len(s) or s[i] != strs[0][i]:\\n return res\\n res += strs[0][i]\\n return res\\n\\n\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n if not strs:\\n return \\\"\\\"\\n\\n # Start with the first string as the common prefix\\n prefix = strs[0]\\n # Compare the prefix with the rest of the strings\\n for s in strs[1:]:\\n min_len = min(len(prefix),len(s))\\n\\n i = 0\\n while i < min_len and prefix[i] == s[i]:\\n i+=1\\n prefix = prefix[:i]\\n\\n if not prefix: \\n return \\\"\\\"\\n \\n return prefix\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n pref=strs[0]\\n preflen=len(pref)\\n for s in strs[1:]:\\n while pref!=s[0:preflen]:\\n preflen-=1\\n if preflen==0:\\n return \\\"\\\"\\n pref=pref[0:preflen]\\n \\n return pref\\n\\n\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n pref = strs[0]\\n pref_len = len(pref)\\n\\n for s in strs[1:]:\\n while pref != s[0:pref_len]:\\n pref_len -= 1\\n if pref_len == 0:\\n return \\\"\\\"\\n \\n pref = pref[0:pref_len]\\n \\n return pref\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n first = strs[0]\\n matched = \\\"\\\"\\n result = \\\"\\\"\\n for char in first:\\n matched += char\\n matching = True\\n for str_ in strs[1:]:\\n if not str_.startswith(matched):\\n matching = False\\n return result\\n result = matched\\n \\n return result\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n n = len(strs)\\n m = float('inf')\\n res = \\\"\\\"\\n flag = True\\n for s in strs:\\n if len(s) < m:\\n m = len(s)\\n for i in range(m):\\n for j in range(n-1):\\n if strs[j][i] != strs[j+1][i]:\\n flag = False\\n return res\\n else:\\n flag = True\\n if flag:\\n res =res+ strs[0][i]\\n return res\\n\\n\\n\\n\\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n\\n pre = strs[0]\\n \\n for i in strs:\\n while not i.startswith(pre):\\n pre = pre[:-1]\\n \\n return pre\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n ans = \\\"\\\"\\n if len(strs) == 1:\\n return strs[0]\\n\\n for i in range(len(strs[0])):\\n for j in range(len(strs)):\\n if i > len(strs[j]) - 1 or strs[j][i] != strs[0][i]:\\n return ans\\n if strs[j][i] == strs[0][i] and j == len(strs) - 1:\\n ans += strs[0][i]\\n return ans\\n\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n common_prefix = \\\"\\\"\\n sorted_list = sorted(strs)\\n first=sorted_list[0]\\n last= sorted_list[-1]\\n for i in range(min(len(first),len(last))):\\n if first[i] != last[i]:\\n return common_prefix\\n else:\\n common_prefix += first[i]\\n return common_prefix\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n pref = strs[0]\\n pref_len = len(pref)\\n\\n for s in strs[1:]:\\n while pref != s[0:pref_len]:\\n pref_len -= 1\\n if pref_len == 0:\\n return \\\"\\\"\\n \\n pref = pref[0:pref_len]\\n \\n return pref\\n \\n \",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n pref=strs[0]\\n pref_len=len(pref)\\n for s in strs[1:]:\\n while pref!=s[0:pref_len]:\\n pref_len-=1\\n if pref_len==0:\\n return \\\"\\\"\\n pref=pref[0:pref_len]\\n return pref\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n res = \\\"\\\"\\n c=0\\n t = set()\\n mnl = 9999999\\n for w in strs:\\n mnl = min(mnl, len(w))\\n print(mnl)\\n while(c<mnl):\\n t = set()\\n for word in strs:\\n t.add(word[c])\\n c+=1\\n if len(t)==1:\\n res+= list(t)[0]\\n else:\\n break\\n return res\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n done = False\\n idx = 0\\n while not done:\\n first_val = None\\n\\n for i in range(len(strs)):\\n if idx >= len(strs[i]):\\n idx -= 1\\n done = True\\n break\\n\\n if not first_val:\\n first_val = strs[i][idx]\\n continue\\n\\n if strs[i][idx] != first_val:\\n done = True\\n idx -= 1\\n break \\n\\n idx += 1\\n\\n return strs[0][:idx]\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n prefix = []\\n allThere = False #checks if the 'checker' letter is there in all list strs\\n allchecked = False #checks if all the letters have been checked\\n \\n index = 0\\n\\n while allchecked != True:\\n for index in range(len(strs[0])):\\n checker = strs[0][index]\\n allThere = False\\n firstFlag = False\\n while allThere != True:\\n \\n for i in range(len(strs)):\\n same = True\\n if index < len(strs[i]): \\n if strs[i][index] != checker:\\n same = False\\n allThere = False\\n firstFlag = True\\n break\\n else:\\n pass\\n else:\\n same = False\\n firstFlag = True\\n break\\n allThere = True\\n if same: prefix.append(checker)\\n if firstFlag:\\n break\\n allchecked = True\\n prefix_str = ''.join(prefix)\\n return prefix_str\\n \\n \\n \\n \\n\\n \\n\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n pref = strs[0]\\n pref_len = len(pref)\\n for s in strs[1:]:\\n while pref != s[0:pref_len]:\\n pref_len -= 1\\n if pref_len == 0 :\\n return \\\"\\\"\\n\\n pref = pref[0:pref_len] \\n return pref\\n\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n if not strs:\\n return \\\"\\\"\\n l=\\\"\\\"\\n minlength=min(len(s) for s in strs)\\n for i in range(minlength):\\n char=strs[0][i]\\n for s in strs:\\n if s[i]!=char:\\n return l\\n l=l+char\\n return l\\n\\n \\n\\n \\n\\n \\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n # alphabet sorting, not length\\n # flat, flight, floss, flow, flower => fl\\n # face, flag, flat => f \\n # now just compare first and last words to get common substring\\n if not strs: return \\\"\\\"\\n lcp = \\\"\\\"\\n for char in zip(*strs):\\n if len(set(char)) == 1:\\n lcp += char[0]\\n else:\\n break\\n return lcp\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n # Go through the first letter of each string in the array\\n #if all are the same, export character to answer\\n #go through the next letter until there is nothing common\\n if not strs:\\n return \\\"\\\"\\n if \\\"\\\" in strs:\\n return \\\"\\\"\\n \\n ans = \\\"\\\"\\n stringOne = strs[0]\\n charOne = stringOne[0]\\n j = 0\\n fullBreak = False\\n if (len(strs) == 1):\\n return strs[0]\\n\\n #Iterates j for each character in the first string of strs\\n while (j < len(stringOne)):\\n if (fullBreak == True):\\n break\\n charOne = stringOne[j]\\n #Iterates i for the second and onwards strings\\n for i in (range(1, len(strs))):\\n stringTwo = strs[i]\\n if (j < len(stringTwo)):\\n charTwo = stringTwo[j]\\n else:\\n fullBreak = True\\n break\\n if (charOne != charTwo):\\n fullBreak = True\\n break\\n if (fullBreak != True ):\\n ans = ans + charTwo \\n j = j + 1\\n \\n return ans\\n\\n\\n\\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n strs.sort(key=len)\\n pf = ''\\n for i,l in enumerate(strs[0]):\\n for word in strs[1:]:\\n if word[i] != l:\\n return pf\\n pf += l\\n return pf\\n\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n actual_prefix = \\\"\\\"\\n current_prefix = \\\"\\\"\\n for i in range(200):\\n if i < len(strs[0]):\\n current_prefix += strs[0][i]\\n else:\\n return actual_prefix\\n for st in strs:\\n if not st.startswith(current_prefix):\\n return actual_prefix\\n actual_prefix = current_prefix\\n \",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n if not strs:\\n return \\\"\\\"\\n \\n # Find the minimum length string in the list\\n min_length = min(len(s) for s in strs)\\n \\n low, high = 0, min_length\\n \\n while low <= high:\\n mid = (low + high) // 2\\n if self.is_common_prefix(strs, mid):\\n low = mid + 1\\n else:\\n high = mid - 1\\n \\n return strs[0][: (low + high) // 2]\\n \\n def is_common_prefix(self, strs: List[str], length: int) -> bool:\\n prefix = strs[0][:length]\\n return all(s.startswith(prefix) for s in strs)\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n if not strs:\\n return \\\"\\\" # Return empty string for empty list\\n if len(strs) == 1:\\n return strs[0] # Return the single string if there's only one\\n \\n # Iterate over each character of the first string\\n for i in range(len(strs[0])):\\n char = strs[0][i]\\n # Compare the current character with all other strings\\n for j in range(1, len(strs)):\\n # If the character doesn't match or the string is shorter, return the prefix so far\\n if i == len(strs[j]) or strs[j][i] != char:\\n return strs[0][:i]\\n \\n return strs[0] # If no mismatch found, return the first string as the common prefix\\n\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n ans=\\\"\\\"\\n strs=sorted(strs)\\n first=strs[0]\\n last=strs[-1]\\n for i in range(min(len(first),len(last))):\\n if(first[i]!=last[i]):\\n return ans\\n ans+=first[i]\\n\\n return ans\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, v: List[str]) -> str:\\n ans=\\\"\\\"\\n v=sorted(v)\\n first=v[0]\\n last=v[-1]\\n for i in range(min(len(first),len(last))):\\n if(first[i]!=last[i]):\\n return ans\\n ans+=first[i]\\n return ans \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n first = strs[0]\\n matched = \\\"\\\"\\n result = \\\"\\\"\\n for char in first:\\n matched += char\\n matching = True\\n for str_ in strs[1:]:\\n if not str_.startswith(matched):\\n matching = False\\n return result\\n result = matched\\n \\n return result\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution(object):\\n def longestCommonPrefix(self, strs):\\n if len(strs) == 0:\\n return \\\"\\\"\\n\\n base = strs[0]\\n for i in range(len(base)):\\n for word in strs[1:]:\\n if i == len(word) or word[i] != base[i]:\\n return base[0:i]\\n\\n return base\\n \",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n answer = strs[0]\\n for string in strs[1:]:\\n length = len(string)\\n for position, letter in enumerate(answer):\\n if position >= length:\\n answer = string\\n break\\n\\n if letter != string[position]:\\n answer = answer[:position]\\n break\\n\\n return answer\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def two_strings_cp(self, str1, str2):\\n output_str = \\\"\\\"\\n index1 = 0\\n index2 =0 \\n while index1 < len(str1) and index2 < len(str2):\\n if str1[index1]==str2[index2]:\\n output_str += str1[index1]\\n index1 += 1\\n index2 += 1\\n else:\\n break\\n return output_str\\n \\n\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n if len(strs)==1:\\n return strs[0]\\n elif len(strs)==0:\\n return \\\"\\\"\\n else:\\n result = self.two_strings_cp(strs[0],strs[1])\\n for i in range(2,len(strs)):\\n if result == \\\"\\\":\\n return \\\"\\\"\\n result = self.two_strings_cp(result, strs[i])\\n return result\\n\\n \",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n pref = ''\\n if strs == []:\\n return pref\\n for elem in zip(*strs, *strs):\\n if all(x == elem[0] for x in elem):\\n pref += elem[0]\\n else:\\n return pref\\n return pref\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n answer = ''\\n for x in zip(*strs):\\n if x.count(x[0])!=len(x):\\n return answer\\n answer+=x[0]\\n return answer\\n \",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n prefix = \\\"\\\"\\n for char in strs[0]:\\n if all(_str.startswith(prefix + char) for _str in strs):\\n prefix += char\\n return prefix\",\n \"runtime\": \"46\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":55,"string":"55"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n prefix = \"\"\n for i in range(len(strs[0])):\n if all([i < len(word) and word[i] == strs[0][i] for word in strs]):\n prefix += strs[0][i]\n else:\n break\n return prefix","memory":"16000"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n if not strs:\n return \"\"\n prefix=strs[0]\n for string in strs[1:]:\n while not string.startswith(prefix):\n prefix=prefix[:-1]\n if not strs:\n return \"\"\n return prefix\n \n ","memory":"16100"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n start=0\n out = ''\n while True:\n curr_char = ''\n for s in strs:\n if s == '' or start >= len(s):\n return out\n elif curr_char == '':\n curr_char = s[start]\n elif s[start] != curr_char:\n return out\n out += curr_char\n start += 1\n return out","memory":"16200"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n pre_max = strs[0]\n newstrs = strs[1:]\n for i in range(len(pre_max)):\n for j in range(len(newstrs)):\n word = newstrs[j]\n if pre_max[ : i + 1] != word[ : i + 1]:\n return pre_max[ : i]\n return pre_max\n \n \n","memory":"16300"},{"code":"from typing import List\n\nclass Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n string = \"\"\n for i in range(len(min(strs, key=len))):\n character = strs[0][i]\n for j in range(len(strs)):\n if strs[j][i] != character:\n return string\n string += character\n return string\n\n","memory":"16300"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n current =strs[0]\n for i in range (len(strs[0])):\n ch =strs[0][i]\n for string in strs[1:]:\n if i >= len(string) or string[i] != ch:\n return strs[0][:i] \n return strs[0] \n ","memory":"16400"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n if not strs:\n return \"\"\n\n res = ''\n for i in range(len(strs[0])):\n for c in strs:\n if i == len(c) or strs[0][i] != c[i]:\n return res\n res += strs[0][i]\n\n return res","memory":"16400"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n if len(strs) == 0:\n return \"\"\n\n prefix = strs[0]\n for i in range(1,len(strs)):\n while strs[i].find(prefix) != 0:\n prefix = prefix[0 : len(prefix) - 1]\n if prefix == \"\":\n return \"\"\n return prefix","memory":"16500"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n ans = list(strs[0])\n index = 0\n \n for _ in range(len(ans)):\n for word in strs:\n if index >= len(word):\n break\n if word[index] != ans[index]:\n break\n else:\n index += 1\n continue\n break\n\n return ''.join(ans[0:index]);","memory":"16500"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n out = \"\"\n candidate = \"\"\n idx = 0\n n = min([len(s) for s in strs])\n while True:\n if idx > n - 1:\n break\n candidate = strs[0][idx]\n viable = True\n for s in strs:\n if s[idx] != candidate:\n viable = False\n if not viable:\n break\n else:\n out += candidate\n idx += 1\n return out","memory":"16600"},{"code":"class Solution:\n def longestCommonPrefix(self, strs: List[str]) -> str:\n if not strs:\n return \"\"\n \n prefix = strs[0]\n \n for string in strs[1:]:\n while not string.startswith(prefix):\n prefix = prefix[:-1]\n if not prefix:\n return \"\"\n \n return prefix","memory":"16600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n prefix = \\\"\\\"\\n for i in range(len(strs[0])):\\n if all([i < len(word) and word[i] == strs[0][i] for word in strs]):\\n prefix += strs[0][i]\\n else:\\n break\\n return prefix\",\n \"memory\": \"16000\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n if not strs:\\n return \\\"\\\"\\n prefix=strs[0]\\n for string in strs[1:]:\\n while not string.startswith(prefix):\\n prefix=prefix[:-1]\\n if not strs:\\n return \\\"\\\"\\n return prefix\\n \\n \",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n start=0\\n out = ''\\n while True:\\n curr_char = ''\\n for s in strs:\\n if s == '' or start >= len(s):\\n return out\\n elif curr_char == '':\\n curr_char = s[start]\\n elif s[start] != curr_char:\\n return out\\n out += curr_char\\n start += 1\\n return out\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n pre_max = strs[0]\\n newstrs = strs[1:]\\n for i in range(len(pre_max)):\\n for j in range(len(newstrs)):\\n word = newstrs[j]\\n if pre_max[ : i + 1] != word[ : i + 1]:\\n return pre_max[ : i]\\n return pre_max\\n \\n \\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n string = \\\"\\\"\\n for i in range(len(min(strs, key=len))):\\n character = strs[0][i]\\n for j in range(len(strs)):\\n if strs[j][i] != character:\\n return string\\n string += character\\n return string\\n\\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n current =strs[0]\\n for i in range (len(strs[0])):\\n ch =strs[0][i]\\n for string in strs[1:]:\\n if i >= len(string) or string[i] != ch:\\n return strs[0][:i] \\n return strs[0] \\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n if not strs:\\n return \\\"\\\"\\n\\n res = ''\\n for i in range(len(strs[0])):\\n for c in strs:\\n if i == len(c) or strs[0][i] != c[i]:\\n return res\\n res += strs[0][i]\\n\\n return res\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n if len(strs) == 0:\\n return \\\"\\\"\\n\\n prefix = strs[0]\\n for i in range(1,len(strs)):\\n while strs[i].find(prefix) != 0:\\n prefix = prefix[0 : len(prefix) - 1]\\n if prefix == \\\"\\\":\\n return \\\"\\\"\\n return prefix\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n ans = list(strs[0])\\n index = 0\\n \\n for _ in range(len(ans)):\\n for word in strs:\\n if index >= len(word):\\n break\\n if word[index] != ans[index]:\\n break\\n else:\\n index += 1\\n continue\\n break\\n\\n return ''.join(ans[0:index]);\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n out = \\\"\\\"\\n candidate = \\\"\\\"\\n idx = 0\\n n = min([len(s) for s in strs])\\n while True:\\n if idx > n - 1:\\n break\\n candidate = strs[0][idx]\\n viable = True\\n for s in strs:\\n if s[idx] != candidate:\\n viable = False\\n if not viable:\\n break\\n else:\\n out += candidate\\n idx += 1\\n return out\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def longestCommonPrefix(self, strs: List[str]) -> str:\\n if not strs:\\n return \\\"\\\"\\n \\n prefix = strs[0]\\n \\n for string in strs[1:]:\\n while not string.startswith(prefix):\\n prefix = prefix[:-1]\\n if not prefix:\\n return \\\"\\\"\\n \\n return prefix\",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":11,"string":"11"}}},{"rowIdx":181,"cells":{"question_id":{"kind":"number","value":15,"string":"15"},"name":{"kind":"string","value":"3sum"},"content":{"kind":"string","value":"<p>Given an integer array nums, return all the triplets <code>[nums[i], nums[j], nums[k]]</code> such that <code>i != j</code>, <code>i != k</code>, and <code>j != k</code>, and <code>nums[i] + nums[j] + nums[k] == 0</code>.</p>\n\n<p>Notice that the solution set must not contain duplicate triplets.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [-1,0,1,2,-1,-4]\n<strong>Output:</strong> [[-1,-1,2],[-1,0,1]]\n<strong>Explanation:</strong> \nnums[0] + nums[1] + nums[2] = (-1) + 0 + 1 = 0.\nnums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0.\nnums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0.\nThe distinct triplets are [-1,0,1] and [-1,-1,2].\nNotice that the order of the output and the order of the triplets does not matter.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [0,1,1]\n<strong>Output:</strong> []\n<strong>Explanation:</strong> The only possible triplet does not sum up to 0.\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [0,0,0]\n<strong>Output:</strong> [[0,0,0]]\n<strong>Explanation:</strong> The only possible triplet sums up to 0.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>3 <= nums.length <= 3000</code></li>\n\t<li><code>-10<sup>5</sup> <= nums[i] <= 10<sup>5</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":35.34359927402408,"string":"35.343599"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","two-pointers","sorting"],"string":"[\n \"array\",\n \"two-pointers\",\n \"sorting\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"135\", 0.0325], [\"160\", 0.0034], [\"185\", 0.0243], [\"209\", 0.0363], [\"234\", 0.0050999999999999995], [\"259\", 0.0068], [\"284\", 0.0225], [\"309\", 0.0744], [\"333\", 0.043], [\"358\", 0.1936], [\"383\", 0.10399999999999998], [\"408\", 0.050100000000000006], [\"433\", 0.09839999999999999], [\"457\", 0.2713], [\"482\", 0.7108], [\"507\", 2.1670000000000003], [\"532\", 2.819000000000001], [\"557\", 4.597599999999999], [\"581\", 4.109200000000001], [\"606\", 2.0703], [\"631\", 3.5245000000000006], [\"656\", 6.748300000000001], [\"681\", 11.471600000000002], [\"705\", 15.1409], [\"730\", 8.7445], [\"755\", 2.9723], [\"780\", 1.4218999999999995], [\"805\", 1.0887000000000004], [\"829\", 1.2924], [\"854\", 1.3387000000000002], [\"879\", 0.9575999999999999], [\"904\", 0.9059999999999999], [\"929\", 1.8046], [\"953\", 1.1524000000000005], [\"978\", 0.9662000000000001], [\"1003\", 1.2061], [\"1028\", 0.8972000000000001], [\"1053\", 0.5866], [\"1077\", 0.485], [\"1102\", 0.45409999999999995], [\"1127\", 0.4695], [\"1152\", 0.4265999999999999], [\"1177\", 0.42119999999999996], [\"1201\", 0.3142000000000001], [\"1226\", 0.29530000000000006], [\"1251\", 0.3022], [\"1276\", 0.23479999999999998], [\"1301\", 0.2502], [\"1325\", 0.26599999999999996], [\"1350\", 0.38509999999999994], [\"1375\", 0.4347999999999999], [\"1400\", 0.3709999999999999], [\"1425\", 0.28830000000000006], [\"1449\", 0.27809999999999996], [\"1474\", 0.3091], [\"1499\", 0.36600000000000005], [\"1524\", 0.5697000000000001], [\"1549\", 1.0575], [\"1573\", 0.9938], [\"1598\", 0.6280999999999999], [\"1623\", 0.41609999999999997], [\"1648\", 0.28839999999999993], [\"1673\", 0.24019999999999997], [\"1697\", 0.266], [\"1722\", 0.20059999999999997], [\"1747\", 0.2729], [\"1772\", 0.3161], [\"1797\", 0.3712], [\"1821\", 0.3643], [\"1846\", 0.2917], [\"1871\", 0.20050000000000007], [\"1896\", 0.24329999999999996], [\"1921\", 0.2779], [\"1945\", 0.22279999999999997], [\"1970\", 0.178], [\"1995\", 0.1831], [\"2020\", 0.2936], [\"2045\", 0.3588], [\"2069\", 0.4248], [\"2094\", 0.31599999999999995]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18200\", 0.0035], [\"18300\", 0.0017], [\"18400\", 0.0035], [\"18600\", 0.0035], [\"18800\", 0.0035], [\"18900\", 0.0121], [\"19000\", 0.0104], [\"19100\", 0.019], [\"19200\", 0.0155], [\"19300\", 0.0155], [\"19400\", 0.0155], [\"19500\", 0.0242], [\"19600\", 0.0224], [\"19700\", 0.0742], [\"19800\", 0.7918], [\"19900\", 3.9142], [\"20000\", 1.989], [\"20100\", 0.3243], [\"20200\", 0.2933], [\"20300\", 1.575], [\"20400\", 4.7129], [\"20500\", 1.694], [\"20600\", 12.7605], [\"20700\", 40.7501], [\"20800\", 12.0118], [\"20900\", 2.0442], [\"21000\", 1.8476], [\"21100\", 2.0684], [\"21200\", 1.4025], [\"21300\", 0.7556], [\"21400\", 1.0558], [\"21500\", 0.8677], [\"21600\", 0.3812], [\"21700\", 0.4278], [\"21800\", 0.8591], [\"21900\", 1.7579]]}"},"rt_list":{"kind":"list like","value":[{"code":"def threeSum(nums: List[int]) -> List[List[int]]:\n nums.sort()\n index = 1\n x = nums[0]\n counter = 1\n while index < len(nums):\n if nums[index] == x:\n counter = counter + 1\n if x == 0:\n if counter > 3:\n nums.pop(index)\n else:\n index = index + 1\n elif counter > 2:\n nums.pop(index)\n else:\n index = index + 1\n else:\n x = nums[index]\n counter = 1\n index = index + 1\n if(not all(n>0 for n in nums)):\n counts = Counter(nums)\n result = [[0,0,0]] if counts[0] >= 3 else []\n nums =[i for i in sorted(counts) if i!=0]\n if counts[0]>0:\n for i in nums:\n if i>0:\n break\n if -i in counts:\n result.append([-i , 0 , i])\n for i in nums:\n if i & 1:\n continue\n remaining = -i >> 1\n if counts[remaining] >= 2:\n result.append([i, remaining, remaining])\n for i, n in enumerate(nums):\n kk = -(nums[0] + n)\n if kk < n:\n break\n j = bisect_right(nums, -n << 1) if n < 0 else i + 1\n k = bisect_right(nums, kk)\n for right in nums[j:k]:\n left = -(n + right)\n if left in counts:\n result.append([left, n, right])\n del counts , nums\n return result\n else:\n return []\n\nopen('user.out', 'w').write(\"\".join(str(threeSum(loads(line))) + \"\\n\" for line in stdin))\nexit()","runtime":"135"},{"code":"def threeSum(nums: List[int]) -> List[List[int]]:\n nums.sort()\n index = 1\n x = nums[0]\n counter = 1\n while index < len(nums):\n if nums[index] == x:\n counter = counter + 1\n if x == 0:\n if counter > 3:\n nums.pop(index)\n else:\n index = index + 1\n elif counter > 2:\n nums.pop(index)\n else:\n index = index + 1\n else:\n x = nums[index]\n counter = 1\n index = index + 1\n if(not all(n>0 for n in nums)):\n counts = Counter(nums)\n result = [[0,0,0]] if counts[0] >= 3 else []\n nums =[i for i in sorted(counts) if i!=0]\n if counts[0]>0:\n for i in nums:\n if i>0:\n break\n if -i in counts:\n result.append([-i , 0 , i])\n for i in nums:\n if i & 1:\n continue\n remaining = -i >> 1\n if counts[remaining] >= 2:\n result.append([i, remaining, remaining])\n for i, n in enumerate(nums):\n kk = -(nums[0] + n)\n if kk < n:\n break\n j = bisect_right(nums, -n << 1) if n < 0 else i + 1\n k = bisect_right(nums, kk)\n for right in nums[j:k]:\n left = -(n + right)\n if left in counts:\n result.append([left, n, right])\n del counts , nums\n return result\n else:\n return []\n\nopen('user.out', 'w').write(\"\".join(str(threeSum(loads(line))) + \"\\n\" for line in stdin))\nexit()","runtime":"135"},{"code":"def threeSum(nums: List[int]) -> List[List[int]]:\n nums.sort()\n index = 1\n x = nums[0]\n counter = 1\n while index < len(nums):\n if nums[index] == x:\n counter = counter + 1\n if x == 0:\n if counter > 3:\n nums.pop(index)\n else:\n index = index + 1\n elif counter > 2:\n nums.pop(index)\n else:\n index = index + 1\n else:\n x = nums[index]\n counter = 1\n index = index + 1\n if(not all(n>0 for n in nums)):\n counts = Counter(nums)\n result = [[0,0,0]] if counts[0] >= 3 else []\n nums =[i for i in sorted(counts) if i!=0]\n if counts[0]>0:\n for i in nums:\n if i>0:\n break\n if -i in counts:\n result.append([-i , 0 , i])\n for i in nums:\n if i & 1:\n continue\n remaining = -i >> 1\n if counts[remaining] >= 2:\n result.append([i, remaining, remaining])\n for i, n in enumerate(nums):\n kk = -(nums[0] + n)\n if kk < n:\n break\n j = bisect_right(nums, -n << 1) if n < 0 else i + 1\n k = bisect_right(nums, kk)\n for right in nums[j:k]:\n left = -(n + right)\n if left in counts:\n result.append([left, n, right])\n del counts , nums\n return result\n else:\n return []\n\nopen('user.out', 'w').write(\"\".join(str(threeSum(loads(line))) + \"\\n\" for line in stdin))\nexit()","runtime":"160"},{"code":"\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n if len(nums) < 3:\n return []\n freq = {}\n # fnums = []\n left=set()\n right=set()\n for i in nums:\n if i in freq:\n freq[i] += 1\n else:\n freq[i] = 1\n # fnums.append(i)\n \n for i in set(nums):\n if i <= 0:\n left.add(i)\n else:\n right.add(i)\n\n # fnums.sort()\n if 0 in left:\n left.remove(0)\n left = sorted(left)\n right= sorted(right,reverse=True)\n \n sols = []\n if 0 in freq:\n if freq[0] > 2:\n sols.append([0,0,0])\n for iv in left:\n if -iv in freq:\n sols.append((iv,0,-iv))\n freq.pop(0)\n for fn in left:\n if fn % 2 == 0 and -fn/2 in freq and freq[-fn/2] >= 2:\n sols.append( [fn, int(-fn/2), int(-fn/2)])\n for fn in right:\n if fn % 2 == 0 and -fn/2 in freq and freq[-fn/2] >= 2:\n sols.append( [fn, int(-fn/2), int(-fn/2)])\n\n i = 0\n\n for iv in left:\n # j = len(fnums) - 1\n # iv = fnums[i]\n # jv = fnums[j]\n it2 = -iv\n c = int(math.floor(it2/2.0))\n i2 = it2*2\n \n for jv in right.copy():\n if jv <=c:\n break\n if jv >= i2:\n right.remove(jv)\n elif it2-jv in freq:\n a = (jv, it2-jv, iv)\n sols.append(a)\n \n return sols","runtime":"160"},{"code":"\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n if len(nums) < 3:\n return []\n freq = {}\n # fnums = []\n left=set()\n right=set()\n for i in nums:\n if i in freq:\n freq[i] += 1\n else:\n freq[i] = 1\n # fnums.append(i)\n \n for i in set(nums):\n if i <= 0:\n left.add(i)\n else:\n right.add(i)\n\n # fnums.sort()\n if 0 in left:\n left.remove(0)\n left = sorted(left)\n right= sorted(right,reverse=True)\n \n sols = []\n if 0 in freq:\n if freq[0] > 2:\n sols.append([0,0,0])\n for iv in left:\n if -iv in freq:\n sols.append((iv,0,-iv))\n freq.pop(0)\n for fn in left:\n if fn % 2 == 0 and -fn/2 in freq and freq[-fn/2] >= 2:\n sols.append( [fn, int(-fn/2), int(-fn/2)])\n for fn in right:\n if fn % 2 == 0 and -fn/2 in freq and freq[-fn/2] >= 2:\n sols.append( [fn, int(-fn/2), int(-fn/2)])\n\n i = 0\n\n for iv in left:\n # j = len(fnums) - 1\n # iv = fnums[i]\n # jv = fnums[j]\n it2 = -iv\n c = int(math.floor(it2/2.0))\n i2 = it2*2\n \n for jv in right.copy():\n if jv <=c:\n break\n if jv >= i2:\n right.remove(jv)\n elif it2-jv in freq:\n a = (jv, it2-jv, iv)\n sols.append(a)\n \n return sols","runtime":"185"},{"code":"\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n if len(nums) < 3:\n return []\n freq = {}\n left=set()\n right=set()\n for i in nums:\n if i in freq:\n freq[i] += 1\n else:\n freq[i] = 1\n \n for i in set(nums):\n if i < 0:\n left.add(i)\n else:\n right.add(i)\n\n left = sorted(left)\n right= sorted(right,reverse=True)\n \n sols = []\n if 0 in freq:\n if freq[0] > 2:\n sols.append([0,0,0])\n for iv in left:\n if -iv in freq:\n sols.append((iv,0,-iv))\n freq.pop(0)\n for fn in left:\n if fn % 2 == 0 and -fn/2 in freq and freq[-fn/2] >= 2:\n sols.append( [fn, int(-fn/2), int(-fn/2)])\n for fn in right:\n if fn % 2 == 0 and -fn/2 in freq and freq[-fn/2] >= 2:\n sols.append( [fn, int(-fn/2), int(-fn/2)])\n\n i = 0\n\n for iv in left:\n it2 = -iv\n c = int(math.floor(it2/2.0))\n i2 = it2*2\n \n for jv in right.copy():\n if jv <=c:\n break\n if jv >= i2:\n right.remove(jv)\n elif it2-jv in freq:\n a = (jv, it2-jv, iv)\n sols.append(a)\n \n return sols","runtime":"185"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n c = Counter(nums)\n\n res = [[0, 0, 0]] if c[0] > 2 else []\n numSet = sorted(c)\n del c[0]\n\n if not numSet or numSet[0] > 0 or numSet[-1] < 0:\n return res\n \n for n in numSet:\n if n % 2 == 0 and c[-n//2] > 1:\n res.append([-n//2, -n//2, n])\n \n pos = set(-i for i in takewhile(lambda x : x > 0, reversed(numSet)))\n\n maxN = numSet[-1]\n for i, x in takewhile(lambda x : x[1] < 0, enumerate(numSet)):\n while i > 0 and x == numSet[i - 1]:\n continue\n left = bisect_left(numSet, -maxN - x, i + 1)\n right = bisect_right(numSet, (-x-1)//2, left)\n for y in islice(numSet, left, right):\n if x + y in pos:\n res.append([x, y, -x-y])\n \n return res","runtime":"209"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n index = 1\n x = nums[0]\n counter = 1\n while index < len(nums):\n if nums[index] == x:\n counter = counter + 1\n if x == 0:\n if counter > 3:\n nums.pop(index)\n else:\n index = index + 1\n elif counter > 2:\n nums.pop(index)\n else:\n index = index + 1\n else:\n x = nums[index]\n counter = 1\n index = index + 1\n if(not all(n>0 for n in nums)):\n counts = Counter(nums)\n result = [[0,0,0]] if counts[0] >= 3 else []\n nums =[i for i in sorted(counts) if i!=0]\n if counts[0]>0:\n for i in nums:\n if i>0:\n break\n if -i in counts:\n result.append([-i , 0 , i])\n for i in nums:\n if i & 1:\n continue\n remaining = -i >> 1\n if counts[remaining] >= 2:\n result.append([i, remaining, remaining])\n for i, n in enumerate(nums):\n kk = -(nums[0] + n)\n if kk < n:\n break\n j = bisect_right(nums, -n << 1) if n < 0 else i + 1\n k = bisect_right(nums, kk)\n for right in nums[j:k]:\n left = -(n + right)\n if left in counts:\n result.append([left, n, right])\n del counts , nums\n return result\n else:\n return []\n\n ","runtime":"209"},{"code":"class Solution:\n def counter(self, nums: list, sign: int, targets: set, max_target: int) -> int:\n n = len(nums)\n a = -1\n for i in range(n-1):\n if nums[i] == a: continue\n a = nums[i]\n if a > max_target // 2: break\n b = -1\n for j in range(i+1, n):\n if nums[j] == b: continue\n b = nums[j]\n c = a + b\n if c > max_target: break\n if c in targets: self.rs.append([sign*a, sign*b, -sign*c])\n\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n pos_nums = [num for num in nums if num >= 0]\n neg_nums = [-num for num in nums if num < 0]\n\n pos_nums.sort()\n neg_nums.sort()\n\n self.rs = []\n if len(pos_nums) and len(neg_nums):\n self.counter(pos_nums, 1, set(neg_nums), neg_nums[-1])\n self.counter(neg_nums, -1, set(pos_nums), pos_nums[-1])\n if len(pos_nums) > 2 and pos_nums[2] == 0: self.rs.append([0, 0, 0])\n \n return self.rs ","runtime":"234"},{"code":"class Solution:\n def helper(self, seek_list, query_set, max_val, sign):\n res = []\n prev_a = -1\n for i, a in enumerate(seek_list):\n if a == prev_a: continue\n prev_a = a\n prev_b = -1\n if a > max_val // 2: break\n for b in seek_list[i+1:]:\n if b == prev_b: continue\n prev_b = b\n if a + b > max_val: break\n if a + b in query_set: res.append([sign * a, sign * b, - sign * (a + b)])\n return res\n\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n noneg = [el for el in nums if el >= 0]\n invneg = [-el for el in nums if el < 0]\n noneg = sorted(noneg)\n invneg = sorted(invneg)\n rs = []\n if len(noneg) and len(invneg):\n rs = self.helper(noneg, set(invneg), invneg[-1], sign=1)\n rs += self.helper(invneg, set(noneg), noneg[-1], sign=-1)\n\n if len(noneg) > 2 and noneg[2] == 0: rs.append([0, 0, 0])\n return rs ","runtime":"234"},{"code":"class Solution:\n def counter(self, nums: list, sign: int, targets: set, max_target: int) -> int:\n n = len(nums)\n a = -1\n for i in range(n-1):\n if nums[i] == a: continue\n a = nums[i]\n if a > max_target // 2: break\n b = -1\n for j in range(i+1, n):\n if nums[j] == b: continue\n b = nums[j]\n c = a + b\n if c > max_target: break\n if c in targets: self.rs.append([sign*a, sign*b, -sign*c])\n\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n pos_nums = [num for num in nums if num >= 0]\n neg_nums = [-num for num in nums if num < 0]\n\n pos_nums.sort()\n neg_nums.sort()\n\n self.rs = []\n if len(pos_nums) and len(neg_nums):\n self.counter(pos_nums, 1, set(neg_nums), neg_nums[-1])\n self.counter(neg_nums, -1, set(pos_nums), pos_nums[-1])\n if len(pos_nums) > 2 and pos_nums[2] == 0: self.rs.append([0, 0, 0])\n \n return self.rs ","runtime":"259"},{"code":"class Solution:\n def threeSum(self, v: List[int]) -> List[List[int]]:\n c=Counter(v);p,r,b=sorted(c),c[0]>=3 and set([(0,0,0)])or set(),bisect_left;[(c[a]>1 and -2*a in c and a and r.add((a,a,-2*a)),a<0 and[r.add((a,b,-a-b)) for b in p[b(p,-p[-1]-a,i+1):b(p,ceil(-a/2),i+1)] if -(a+b) in c])for i,a in enumerate(p)];return r\n","runtime":"259"},{"code":"from collections import defaultdict\n\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n num_map = defaultdict(int)\n for num in nums:\n num_map[num] += 1\n nums = sorted(num_map.keys())\n\n min_i = 0\n max_k = len(nums) - 1\n triplets = []\n while min_i <= max_k:\n '''\n def upper_bound(i):\n if nums[i] in num_map and num_map[nums[i]] > \n nums[i]\n\n while -nums[min_i] > nums[max_k-1] + nums[max_k] and min_i <= max_k:\n min_i += 1\n while -nums[max_k] < nums[min_i] + nums[min_i+1] and min_i <= max_k:\n max_k -= 1\n # todo cont\n '''\n right_sided = -nums[min_i] > nums[max_k]\n\n i = min_i\n k = max_k\n while i <= k:\n target = -nums[i] - nums[k]\n if nums[i] > target or target > nums[k]:\n break\n\n if (target in num_map and\n num_map[target] > sum([nums[g] == target for g in [i,k]])):\n triplets.append((nums[i], target, nums[k]))\n if right_sided:\n k -= 1\n else:\n i += 1\n\n if right_sided:\n min_i += 1\n else:\n max_k -= 1\n return triplets\n\n def threeSum2(self, nums: List[int]) -> List[List[int]]:\n num_map = dict()\n for num in nums:\n num_ct = num_map.get(num, 0) + 1\n num_ct = min(num_ct, 2) if num != 0 else min(num_ct, 3)\n num_map[num] = num_ct\n\n new_nums = []\n for num, ct in num_map.items():\n new_nums += ct * [num]\n nums = sorted(new_nums)\n\n min_i = 0\n max_k = len(nums) - 1\n trips = []\n while min_i+1 < max_k:\n while -nums[min_i] > nums[max_k-1] + nums[max_k] and min_i+2 < max_k:\n min_i += 1\n while -nums[max_k] < nums[min_i] + nums[min_i+1] and min_i+2 < max_k:\n max_k -= 1\n\n right_sided = -nums[min_i] > nums[max_k]\n\n i = min_i\n k = max_k\n target = -nums[i] - nums[k]\n while i+1 < k and nums[i] <= target and nums[k] >= target:\n target_ct = 1\n if target in num_map:\n if nums[i] == target:\n target_ct += 1\n if nums[k] == target:\n target_ct += 1\n if num_map[target] >= target_ct:\n trips.append((nums[i], target, nums[k]))\n if right_sided:\n k -= num_map[nums[k]]\n else:\n i += num_map[nums[i]]\n if i+1 < k:\n target = -nums[i] - nums[k]\n\n if right_sided:\n min_i += num_map[nums[min_i]]\n else:\n max_k -= num_map[nums[max_k]]\n return trips\n","runtime":"284"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n poz = set()\n poz2 = set()\n neg = set()\n neg2 = set()\n count = 0\n ret = list()\n for i, v in enumerate(nums):\n if v > 0:\n if v in poz2:\n continue\n elif v in poz:\n poz2.add(v)\n else:\n poz.add(v)\n elif v < 0:\n if v in neg2:\n continue\n elif v in neg:\n neg2.add(v)\n else:\n neg.add(v)\n else:\n count += 1\n if count >= 3:\n ret.append([0, 0, 0])\n if count > 0:\n for v in poz:\n if -v in neg:\n ret.append([v, 0, -v])\n for v in poz2:\n if (-v * 2) in neg:\n ret.append([v, v, -2 * v])\n for v in neg2:\n if (-v * 2) in poz:\n ret.append([v, v, -2 * v])\n poz_l = list(poz)\n for i, v1 in enumerate(poz_l):\n for v2 in poz_l[i + 1:]:\n if -(v1 + v2) in neg:\n ret.append([v1, v2, -(v1 + v2)])\n neg_l = list(neg)\n for i, v1 in enumerate(neg_l):\n for v2 in neg_l[i + 1:]:\n if -(v1 + v2) in poz:\n ret.append([v1, v2, -(v1 + v2)])\n return ret\n","runtime":"284"},{"code":"class Solution:\n \n def helper(self, seek_list, query_set, sign):\n res = []\n prev_a = -1\n for i, a in enumerate(seek_list):\n if a == prev_a:\n continue\n prev_b = -1\n for b in seek_list[i+1:]:\n if b == prev_b:\n continue\n if a + b in query_set:\n res.append([sign * a, sign * b, - sign * (a + b)])\n prev_b = b\n prev_a = a\n return res\n \n \n def threeSum(self, nums: List[int]) -> List[List[int]]:\n \n noneg = [el for el in nums if el >= 0]\n invneg = [-el for el in nums if el < 0]\n \n noneg = sorted(noneg)\n invneg = sorted(invneg)\n\n res1 = self.helper(noneg, set(invneg), sign=1)\n res2 = self.helper(invneg, set(noneg), sign=-1)\n \n res = res1 + res2\n \n # corner case: zeros\n if len(noneg) > 2 and noneg[2] == 0:\n res.append([0, 0, 0])\n \n return res ","runtime":"309"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n output = []\n zero_count = 0\n positives = defaultdict(int)\n negatives = defaultdict(int)\n\n for num in nums:\n if num > 0: positives[num] += 1\n elif num < 0: negatives[num] += 1\n else: zero_count += 1\n\n if len(positives) == 0 or len(negatives) == 0:\n if zero_count > 2: output.append([0, 0, 0])\n return output\n\n if zero_count > 0:\n if zero_count > 2: output.append([0, 0, 0])\n\n for p in positives:\n if -p in negatives: output.append([-p, 0, p])\n\n pos = sorted(list(positives))\n neg = sorted(list(negatives))\n \n\n for dict_a, dict_b, list_a, list_b in ((positives, negatives, pos, neg), (negatives, positives, neg, pos)):\n for i in range(len(list_a)):\n if dict_a[list_a[i]] > 1 and -2*list_a[i] in dict_b:\n output.append([-2*list_a[i], list_a[i], list_a[i]])\n for j in range(i+1, len(list_a)):\n k = -(list_a[i]+list_a[j])\n if k < list_b[0]: break\n if k in dict_b: output.append([k, list_a[i], list_a[j]])\n\n return output","runtime":"309"},{"code":"class Solution:\n \n def threeSum(self, nums: List[int]) -> List[List[int]]:\n if len(nums) <= 2:\n return [] \n \n nums.sort()\n dnums, snums, last = dict(), [nums[0]], nums[0]\n\n for i in range(len(nums)):\n if nums[i] in dnums:\n dnums[nums[i]] += 1\n else:\n dnums[nums[i]] = 1\n \n if nums[i] != last:\n last = nums[i]\n snums.append(last)\n \n left, right, ans = 0, len(snums)-1, []\n\n if 0 in dnums and dnums[0] >= 3:\n ans.append([0,0,0])\n\n if snums[0] >= 0 or snums[-1] <= 0:\n return ans\n \n while left<right and snums[left] < 0 and snums[right] > 0:\n third = -(snums[left] + snums[right])\n \n if third >= snums[left] and third <= snums[right] and third in dnums:\n if third == snums[left] or third == snums[right]:\n if dnums[third] >= 2:\n ans.append([snums[left], snums[right], third])\n else:\n ans.append([snums[left], snums[right], third])\n \n nextright = right - 1\n third = -(snums[left] + snums[nextright])\n while nextright > left and third <= snums[nextright]:\n if third >= snums[left] and third <= snums[nextright] and third in dnums:\n if third == snums[left] or third == snums[nextright]:\n if dnums[third] >= 2:\n ans.append([snums[left], snums[nextright], third])\n else:\n ans.append([snums[left], snums[nextright], third])\n nextright -= 1\n third = -(snums[left] + snums[nextright]) \n\n nextleft = left + 1\n third = -(snums[nextleft] + snums[right])\n while nextleft < right and third >= snums[nextleft]:\n if third >= snums[nextleft] and third <= snums[right] and third in dnums:\n if third == snums[nextleft] or third == snums[right]:\n if dnums[third] >= 2:\n ans.append([snums[nextleft], snums[right], third])\n else:\n ans.append([snums[nextleft], snums[right], third])\n nextleft += 1\n third = -(snums[nextleft] + snums[right]) \n\n left += 1\n right -= 1\n \n return ans \n def threeSum2(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n n = len(nums)\n sum3 = set()\n for i in range(n):\n j = i+1\n k = n - 1\n while j < k:\n\n summ = nums[i] + nums[j]+nums[k]\n if summ == 0:\n sum3.add((nums[i], nums[j], nums[k]))\n j += 1\n k -= 1\n while j < k and nums[j] == nums[j - 1]:\n j += 1\n elif summ < 0:\n j += 1\n else: \n k -= 1\n sum3 = [list(s) for s in sum3]\n return sum3\n\n \n \n ","runtime":"333"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n hashMap = {}\n\n for i in range(len(nums)):\n if nums[i] in hashMap:\n hashMap[nums[i]].add(i)\n else:\n hashMap[nums[i]] = {i}\n\n i = 0\n j = len(nums)-1\n res = []\n\n while i < j:\n d = - (nums[i] + nums[j])\n if d < nums[i]:\n j -= 1\n elif d > nums[j]:\n i += 1\n else:\n if d in hashMap:\n for index in hashMap[d]:\n if index != i and index != j:\n res.append([nums[i],nums[index],nums[j]])\n break\n tempj = j - 1\n while i < tempj:\n if nums[tempj] != nums[j]:\n tempd = -(nums[i] + nums[tempj])\n if tempd > nums[tempj]:\n break\n if tempd in hashMap and tempd != nums[j]:\n for index in hashMap[tempd]:\n if index != i and index != tempj:\n res.append([nums[i],nums[index],nums[tempj]])\n break\n \n while tempj > 0:\n tempj -= 1\n if nums[tempj] != nums[tempj+1]:\n break\n \n tempi = i + 1\n while tempi < j:\n if nums[tempi] != nums[i]:\n tempd = -(nums[tempi] + nums[j])\n if tempd < nums[tempi]:\n break\n if tempd in hashMap and tempd != nums[i]:\n for index in hashMap[tempd]:\n if index != tempi and index != j:\n res.append([nums[tempi],nums[index],nums[j]])\n break\n \n while tempi < len(nums)-1:\n tempi += 1\n if nums[tempi] != nums[tempi-1]:\n break\n \n while i < len(nums)-1:\n i += 1\n if nums[i] != nums[i-1]:\n break\n\n while j > 0:\n j -= 1\n if nums[j] != nums[j+1]:\n break\n\n return res\n\n\n ","runtime":"333"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n count = Counter(nums)\n uniq = sorted(count)\n \n res = [] if count[0] < 3 else [[0, 0, 0]]\n count[0] = 1\n\n if uniq[0] > 0 or uniq[-1] < 0:\n return res\n\n for n in count:\n if count[n] > 1 and -n*2 in count:\n res.append([n, n, -n*2])\n\n for i in range(len(uniq)):\n if uniq[i] > 0:\n break\n for j in range(i + 1, len(uniq)):\n x = -uniq[i] - uniq[j]\n if x <= uniq[j]:\n break\n if x in count:\n res.append([uniq[i], uniq[j], x])\n \n return res\n","runtime":"358"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n po = {}\n ne = {}\n zero = 0\n count = []\n for item in nums:\n if item > 0:\n if item in po:\n po[item] += 1\n else:\n po[item] = 1\n elif item < 0:\n if item in ne:\n ne[item] += 1\n else:\n ne[item] = 1\n else:\n zero += 1\n del nums\n np = len(po)\n nn = len(ne)\n if zero > 2:\n count.append([0,0,0])\n if np <= nn:\n for item in po:\n if zero > 0 and -1*item in ne:\n count.append([0,item,-1*item])\n if po[item] > 1 and -2*item in ne:\n count.append([item, item, -2*item])\n if item%2==0 and -1 * int(item/2) in ne:\n if ne[-1 * int(item/2)] > 1:\n count.append([item,-1 * int(item/2),-1 * int(item/2)])\n else:\n for item in ne:\n if zero > 0 and -1*item in po:\n count.append([0,item,-1*item])\n if ne[item] > 1 and -2*item in po:\n count.append([item, item, -2*item])\n if item%2==0 and -1 * int(item/2) in po:\n if po[-1 * int(item/2)] > 1:\n count.append([item,-1 * int(item/2),-1 * int(item/2)])\n ne = list(ne.keys())\n po = set(po.keys())\n for i in range(nn):\n for j in range(i+1, nn, 1):\n mid = -1*(ne[i]+ne[j])\n if mid in po:\n count.append([ne[i], ne[j], mid])\n ne = set(ne)\n po = list(po)\n for i in range(np):\n for j in range(i+1, np, 1):\n mid = -1*(po[i]+po[j])\n if mid in ne:\n count.append([po[i], po[j], mid])\n return count\n\n\n\n\n ","runtime":"358"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n output = []\n zero_count = 0\n positives = defaultdict(int)\n negatives = defaultdict(int)\n\n for num in nums:\n if num == 0:\n zero_count += 1\n elif num > 0:\n positives[num] += 1\n else:\n negatives[num] += 1\n\n if len(positives) == 0 or len(negatives) == 0:\n if zero_count > 2: output.append([0, 0, 0])\n return output\n\n if zero_count > 0:\n if zero_count > 2: output.append([0, 0, 0])\n\n for p in positives:\n if -p in negatives: output.append([-p, 0, p])\n\n for dict_a, dict_b in ((positives, negatives), (negatives, positives)):\n pos = list(dict_a)\n for i in range(len(pos)):\n if dict_a[pos[i]] > 1:\n if -2*pos[i] in dict_b:\n output.append([-2*pos[i], pos[i], pos[i]])\n for j in range(i+1, len(pos)):\n if -(pos[i]+pos[j]) in dict_b:\n output.append([-(pos[i]+pos[j]), pos[i], pos[j]])\n\n return output\n","runtime":"383"},{"code":"from collections import defaultdict\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n # Key points:\n # no duplicates!\n # we want to return the actual values\n \n # approach:\n # get num of zeros\n negative, positive, num_zeros = [], [], 0\n negative_freq, positive_freq = defaultdict(int), defaultdict(int)\n for num in nums:\n if num==0:\n num_zeros+=1\n elif num > 0:\n if num not in positive_freq:\n positive.append(num)\n positive_freq[num]+=1\n else:\n if num not in negative_freq:\n negative.append(num)\n negative_freq[num]+=1\n ret = []\n if num_zeros:\n for pos in positive:\n if -pos in negative_freq:\n ret.append([-pos, 0, pos])\n if num_zeros >=3:\n ret.append([0,0,0])\n for i in range(len(positive)):\n if positive_freq[positive[i]] >=2:\n target = -2 * positive[i]\n if target in negative_freq:\n ret.append([positive[i], positive[i], target])\n for j in range(i+1, len(positive)):\n target = -1 * (positive[i] + positive[j])\n if target in negative_freq:\n ret.append([target, positive[i], positive[j]])\n for i in range(len(negative)):\n if negative_freq[negative[i]] >=2:\n target = -2 * negative[i]\n if target in positive_freq:\n ret.append([negative[i], negative[i], target])\n for j in range(i+1, len(negative)):\n target = -1 * (negative[i] + negative[j])\n if target in positive_freq:\n ret.append([negative[i], negative[j], target])\n \n # when we get 2x of the same letter, what do we want?\n # we want to ignore it, unless there's an opportunity to double up\n # Idea: we store the number of items. If >=2, we check if we can use 2x of them. Otherwise, we should not include duplicates in the array we use\n return ret\n\n\n\n # create set of <0\n # create set of >0\n # first, find all triplets containing 0\n # then, i,j iter on >0, looking at <0\n # do same fo <0\n # This means we won't get a duplicate, which is a concern if we use the brute force approach\n # edge cases:\n # multiple of the same number should not really matter\n \n ","runtime":"383"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n cntr = Counter(nums)\n nums, res = sorted(cntr), []\n for k in range(bisect_right(nums,0), len(nums)):\n for j in range(bisect_left(nums,-(nums[k]-1>>1),0,k), k):\n if -nums[k]-nums[j] in cntr:\n res.append([-nums[k]-nums[j], nums[j], nums[k]])\n for num, cnt in cntr.items():\n if num and cnt > 1 and -(num<<1) in cntr:\n res.append([num,num,-(num<<1)])\n if cntr[0] > 2: res.append([0,0,0])\n return res\n\n # def twoSum(l: int, r: int, target: int) -> List[List[int]]:\n # res = set()\n # while l < r:\n # if nums[l] + nums[r] < target:\n # l += 1\n # elif nums[l] + nums[r] > target:\n # r -= 1\n # else:\n # res.add((-target, nums[l], nums[r]))\n # l += 1\n # r -= 1\n # return res\n\n # nums.sort()\n # return set([pair for i, num in enumerate(nums[:-2]) for pair in twoSum(i+1, len(nums)-1, -num)])","runtime":"408"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n answer = []\n d = {}\n nums = sorted(nums)\n # print(nums)\n for i in range(len(nums)):\n # d[nums[i]] = d.get(nums[i], []) + [i]\n d[nums[i]] = i\n\n last_i = None\n for i in range(len(nums) - 2):\n if nums[i] > 0:\n break\n\n if last_i == nums[i]:\n i = d[nums[i]] + 1\n continue\n last_i = nums[i]\n last_j = None\n for j in range(i + 1, len(nums) - 1):\n if last_j == nums[j]:\n j = d[nums[j]] + 1\n continue\n last_j = nums[j]\n t = 0 - nums[i] - nums[j]\n if t < nums[j]:\n break\n \n k = d.get(t, 0)\n if k > j:\n answer.append([nums[i], nums[j], nums[k]])\n\n return answer\n\n","runtime":"408"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n pos, neg, zeros = defaultdict(int), defaultdict(int), 0\n ans = set()\n\n for num in nums:\n if num == 0:\n zeros +=1\n elif num > 0:\n pos[num] += 1\n else:\n neg[num] += 1\n\n if zeros >= 1:\n for positive in pos:\n if - positive in neg:\n ans.add((- positive, 0, positive))\n\n if zeros >= 3:\n ans.add((0, 0, 0))\n\n values_x = list(pos)\n for i in range(len(values_x)):\n for j in range(i, len(values_x)):\n if i != j or (i == j and pos[values_x[i]] > 1):\n target = - (values_x[i] + values_x[j])\n if target in neg:\n ans.add(tuple(sorted([target, values_x[i], values_x[j]])))\n\n\n values_x = list(neg)\n for i in range(len(values_x)):\n for j in range(i, len(values_x)):\n if i != j or (i == j and neg[values_x[i]] > 1):\n target = - (values_x[i] + values_x[j])\n if target in pos:\n ans.add(tuple(sorted([target, values_x[i], values_x[j]])))\n \n return ans","runtime":"433"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n positives = dict()\n negatives = dict()\n zeroes = 0\n\n for n in nums:\n if n > 0:\n if n not in positives:\n positives[n] = 0\n positives[n] += 1\n \n if n < 0:\n if n not in negatives:\n negatives[n] = 0\n negatives[n] += 1\n \n if n == 0:\n zeroes += 1\n \n res = set()\n if zeroes >= 3:\n res.add((0,0,0))\n \n if zeroes >= 1:\n for n in positives:\n if -n in negatives:\n res.add((n, -n, 0))\n \n for main, secondary in ((positives, negatives), (negatives, positives)): \n items = list(main.items())\n for i in range(len(items)):\n x = items[i][0]\n c = items[i][1]\n if c > 1 and -2*x in secondary:\n res.add(tuple(sorted((x, x, -2 * x))))\n for j in range(i + 1, len(items)):\n y = items[j][0]\n if -x - y in secondary:\n res.add(tuple(sorted((x, y, -x - y))))\n\n return res\n\n\n ","runtime":"433"},{"code":"from bisect import bisect_left, bisect_right\n\nclass Solution:\n def threeSum(self, a: List[int]) -> List[List[int]]:\n a.sort()\n triplets = []\n for i in range(len(a) - 2):\n if i > 0 and a[i] == a[i - 1]:\n continue\n s = -a[i]\n l = i + 1; r = len(a) - 1\n while l < r:\n cs = a[l] + a[r]\n if cs < s:\n l = bisect_left(a, s - a[r], l + 1, r)\n elif cs > s:\n r = bisect_right(a, s - a[l], l, r - 1)\n else:\n triplets.append((a[i], a[l], a[r]))\n l += 1; r -= 1\n while l < r and a[l] == a[l - 1]: l += 1\n while l < r and a[r] == a[r + 1]: r -= 1\n return triplets","runtime":"457"},{"code":"from collections import defaultdict\n\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n ans = []\n nums.sort()\n # two ptr + hash\n num2indices = defaultdict(set)\n for idx, num in enumerate(nums):\n num2indices[num].add(idx)\n \n prev_l_num = prev_r_num = float('-inf')\n for l in range(len(nums)):\n if nums[l] == prev_l_num:\n continue\n prev_l_num = nums[l]\n for r in range(l + 1, len(nums)):\n if nums[r] == prev_r_num:\n continue\n prev_r_num = nums[r]\n if nums[l] + nums[r] > 0:\n break\n comp = - nums[l] - nums[r]\n if comp < nums[r]:\n break\n if comp in num2indices and \\\n len(num2indices[comp] - set([l, r])) > 0:\n ans.append([nums[l], nums[r], comp])\n \n return ans\n\n","runtime":"457"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n nums_len = len(nums)\n all_triplets = []\n for i in range(nums_len - 2):\n if nums[i] > 0:\n break\n if i == 0 or nums[i] != nums[i - 1]:\n self.twoSum(i, nums=nums, right_ind=nums_len - 1, all_triplets=all_triplets)\n return all_triplets\n\n def twoSum(self, i, nums, right_ind, all_triplets):\n left = i + 1\n right = right_ind\n target = 0 - nums[i]\n while left < right:\n two_sum = nums[left] + nums[right]\n if two_sum < target:\n left += 1\n elif two_sum > target:\n right -= 1\n else:\n all_triplets.append([nums[i], nums[left], nums[right]])\n left += 1\n right -= 1\n while left < right and nums[left] == nums[left - 1]:\n left += 1\n","runtime":"482"},{"code":"import itertools\n\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n \n counter = Counter(nums)\n \n result = set()\n if counter[0] >= 3:\n result.add((0,0,0))\n if len(counter) < 2:\n return result\n\n p, n = set(), set()\n \n for c in counter:\n if c > 0:\n p.add(c)\n elif c < 0:\n n.add(c)\n \n for pos in p:\n for neg in n:\n target = -(pos + neg)\n\n if target not in counter:\n continue\n if counter[target] == 1 and target in [pos, neg]:\n continue\n \n result.add(tuple(sorted([target, neg, pos])))\n return result\n","runtime":"482"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = []\n nums.sort()\n\n for i, a in enumerate(nums):\n if a > 0:\n break\n\n if i > 0 and a == nums[i - 1]:\n continue\n\n l, r = i + 1, len(nums) - 1\n while l < r:\n threeSum = a + nums[l] + nums[r]\n if threeSum > 0:\n r -= 1\n elif threeSum < 0:\n l += 1\n else:\n res.append([a, nums[l], nums[r]])\n l += 1\n r -= 1\n while nums[l] == nums[l - 1] and l < r:\n l += 1\n \n return res\n","runtime":"507"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = []\n nums.sort()\n\n for i, a in enumerate(nums):\n # Skip positive integers\n if a > 0:\n break\n\n if i > 0 and a == nums[i - 1]:\n continue\n\n l, r = i + 1, len(nums) - 1\n while l < r:\n threeSum = a + nums[l] + nums[r]\n if threeSum > 0:\n r -= 1\n elif threeSum < 0:\n l += 1\n else:\n res.append([a, nums[l], nums[r]])\n l += 1\n r -= 1\n while nums[l] == nums[l - 1] and l < r:\n l += 1\n \n return res\n","runtime":"507"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n\n res = set()\n\n #1. Split nums into three lists: negative numbers, positive numbers, and zeros\n n, p, z = [], [], []\n for num in nums:\n if num > 0:\n p.append(num)\n elif num < 0: \n n.append(num)\n else:\n z.append(num)\n\n #2. Create a separate set for negatives and positives for O(1) look-up times\n N, P = set(n), set(p)\n\n #3. If there is at least 1 zero in the list, add all cases where -num exists in N and num exists in P\n # i.e. (-3, 0, 3) = 0\n if z:\n for num in P:\n if -1*num in N:\n res.add((-1*num, 0, num))\n\n #3. If there are at least 3 zeros in the list then also include (0, 0, 0) = 0\n if len(z) >= 3:\n res.add((0,0,0))\n\n #4. For all pairs of negative numbers (-3, -1), check to see if their complement (4)\n # exists in the positive number set\n for i in range(len(n)):\n for j in range(i+1,len(n)):\n target = -1*(n[i]+n[j])\n if target in P:\n res.add(tuple(sorted([n[i],n[j],target])))\n\n #5. For all pairs of positive numbers (1, 1), check to see if their complement (-2)\n # exists in the negative number set\n for i in range(len(p)):\n for j in range(i+1,len(p)):\n target = -1*(p[i]+p[j])\n if target in N:\n res.add(tuple(sorted([p[i],p[j],target])))\n\n return res","runtime":"532"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n\n res = set()\n\n #1. Split nums into three lists: negative numbers, positive numbers, and zeros\n n, p, z = [], [], []\n for num in nums:\n if num > 0:\n p.append(num)\n elif num < 0: \n n.append(num)\n else:\n z.append(num)\n\n #2. Create a separate set for negatives and positives for O(1) look-up times\n N, P = set(n), set(p)\n\n #3. If there is at least 1 zero in the list, add all cases where -num exists in N and num exists in P\n # i.e. (-3, 0, 3) = 0\n if z:\n for num in P:\n if -1*num in N:\n res.add((-1*num, 0, num))\n\n #3. If there are at least 3 zeros in the list then also include (0, 0, 0) = 0\n if len(z) >= 3:\n res.add((0,0,0))\n\n #4. For all pairs of negative numbers (-3, -1), check to see if their complement (4)\n # exists in the positive number set\n for i in range(len(n)):\n for j in range(i+1,len(n)):\n target = -1*(n[i]+n[j])\n if target in P:\n res.add(tuple(sorted([n[i],n[j],target])))\n\n #5. For all pairs of positive numbers (1, 1), check to see if their complement (-2)\n # exists in the negative number set\n for i in range(len(p)):\n for j in range(i+1,len(p)):\n target = -1*(p[i]+p[j])\n if target in N:\n res.add(tuple(sorted([p[i],p[j],target])))\n\n return res\n ","runtime":"532"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = []\n nums.sort()\n for i in range(len(nums)):\n if nums[i]>0:\n break\n if i == 0 or nums[i-1]!= nums[i]:\n self.sum_two(nums, i, res)\n return res\n\n def sum_two(self, nums, i, res):\n lo, hi = i+1, len(nums)-1\n while(lo<hi):\n s = nums[i] + nums[lo] + nums[hi]\n if s < 0:\n lo += 1\n elif s > 0:\n hi -= 1\n else:\n res.append([nums[i], nums[lo], nums[hi]])\n lo += 1\n hi -= 1\n while(lo < hi and nums[lo-1] == nums[lo]):\n lo += 1\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n def two(self, nums, i, res):\n lo, hi = i+1, len(nums)-1\n while(lo<hi):\n s = nums[i]+nums[lo]+nums[hi]\n if s<0:\n lo += 1\n elif s>0:\n hi -= 1\n else:\n res.append([nums[i], nums[lo], nums[hi]])\n lo += 1\n hi -= 1\n while(lo<hi and nums[lo-1] == nums[lo]):\n lo += 1 ","runtime":"557"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n n = len(nums)\n ans = []\n for i in range(n - 2):\n if nums[i] > 0:\n break\n if i and nums[i] == nums[i - 1]:\n continue\n j, k = i + 1, n - 1\n while j < k:\n x = nums[i] + nums[j] + nums[k]\n if x < 0:\n j += 1\n elif x > 0:\n k -= 1\n else:\n ans.append([nums[i], nums[j], nums[k]])\n j, k = j + 1, k - 1\n while j < k and nums[j] == nums[j - 1]:\n j += 1\n while j < k and nums[k] == nums[k + 1]:\n k -= 1\n return ans","runtime":"557"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n nums.sort()\n res = []\n for i in range(n - 2):\n if i > 0 and nums[i] == nums[i - 1]: continue\n if nums[i] > 0: break\n j = i + 1\n k = n - 1\n while j < k:\n total = nums[i] + nums[j] + nums[k]\n if total == 0:\n res.append([nums[i], nums[j], nums[k]])\n j += 1\n while j < k and nums[j] == nums[j - 1]: j += 1\n k -= 1\n while k > j and nums[k] == nums[k + 1]: k -= 1\n elif total > 0: \n k -= 1\n else: j += 1\n return res\n \n \n return res","runtime":"581"},{"code":"class Solution:\n def threeSum(self, nums: list[int]) -> list[list[int]]:\n n = len(nums)\n nums.sort()\n\n ans = []\n\n for i in range(n):\n if nums[i] > 0:\n break\n\n if i == 0 or nums[i] != nums[i - 1]:\n first_idx = i\n left_idx = i + 1\n right_idx = n - 1\n\n s = nums[first_idx]\n while left_idx < right_idx:\n if s + nums[left_idx] + nums[right_idx] > 0:\n right_idx -= 1\n elif s + nums[left_idx] + nums[right_idx] < 0:\n left_idx += 1\n else:\n ans.append([nums[first_idx], nums[left_idx], nums[right_idx]])\n left_idx += 1\n right_idx -= 1\n while (\n left_idx < right_idx\n and nums[left_idx - 1] == nums[left_idx]\n ):\n left_idx += 1\n\n return ans\n","runtime":"581"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n result = []\n def two_sum(idx):\n start, end = idx + 1, len(nums) - 1\n while start < end:\n out = nums[idx] + nums[start] + nums[end]\n if out == 0:\n result.append([nums[idx], nums[start], nums[end]])\n start += 1\n end -= 1\n while start < len(nums) and nums[start] == nums[start-1]:\n start += 1\n elif out < 0:\n start += 1\n else:\n end -= 1\n for i in range(len(nums) - 2):\n if nums[i] > 0:\n continue\n if i == 0 or nums[i] != nums[i-1]:\n two_sum(i)\n return result\n ","runtime":"606"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n pos_to_counts = collections.defaultdict(int)\n neg_to_counts = collections.defaultdict(int)\n zero_count = 0\n for n in nums:\n if n < 0:\n neg_to_counts[n] += 1\n elif n > 0:\n pos_to_counts[n] += 1\n else:\n zero_count += 1\n\n result: set[tuple[int, int, int]] = set()\n\n if zero_count:\n if zero_count >= 3:\n result.add((0, 0, 0))\n for num in pos_to_counts.keys():\n if -num in neg_to_counts:\n result.add((-num, 0, num))\n\n for dict1, dict2 in (\n (neg_to_counts, pos_to_counts),\n (pos_to_counts, neg_to_counts),\n ):\n for n1, count in dict1.items():\n for n2 in dict1.keys():\n if n1 == n2 and count == 1:\n continue\n if (target := -(n1 + n2)) in dict2:\n result.add(tuple(sorted([n1, n2, target])))\n\n return result\n","runtime":"606"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n output = []\n nums.sort()\n\n for i, n in enumerate(nums):\n # Skip the duplicate\n if i > 0 and nums[i-1] == n:\n continue\n \n l, r = i+1, len(nums)-1\n while l < r:\n threeSum = n + nums[l] + nums[r]\n if threeSum > 0:\n r -= 1\n elif threeSum < 0:\n l += 1\n else:\n output.append([n, nums[l], nums[r]])\n l += 1\n r -= 1\n while l < r and nums[l] == nums[l-1]:\n l += 1\n return output\n\n","runtime":"656"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res=[]\n nums.sort()\n\n for i , a in enumerate(nums):\n if i > 0 and a == nums[i-1]:\n continue\n \n l,r = i+1, len(nums)-1\n\n while l<r:\n threeSum = a + nums[l] + nums[r]\n if threeSum > 0:\n r -=1\n elif threeSum < 0:\n l += 1\n else:\n res.append([a , nums[l] , nums[r]])\n l += 1\n while nums[l] == nums[l-1] and l < r:\n l += 1\n return res\n ","runtime":"656"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n n = len(nums)\n answer = []\n for i in range(n):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n \n left, right = i + 1, n - 1\n while left < right:\n total = nums[i] + nums[left] + nums[right]\n if total > 0:\n right -= 1\n elif total < 0:\n left += 1\n else:\n answer.append([nums[i], nums[left], nums[right]])\n while left < right and nums[left] == nums[left+1]:\n left += 1\n left += 1\n\n while left < right and nums[right] == nums[right-1]:\n right -= 1\n right -= 1\n return answer\n","runtime":"681"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n ans = []\n nums.sort()\n for i in range(n):\n if i != 0 and nums[i] == nums[i-1]:\n continue\n \n j = i + 1\n k = n - 1\n while j < k:\n total_sum = nums[i] + nums[j] + nums[k]\n if total_sum > 0:\n k -= 1\n elif total_sum < 0:\n j += 1\n else:\n temp = [nums[i], nums[j], nums[k]]\n ans.append(temp)\n j += 1\n k -= 1\n\n while j < k and nums[j] == nums[j-1]:\n j += 1\n while j < k and nums[k] == nums[k+1]:\n k -= 1\n return ans","runtime":"681"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n result = []\n nums.sort()\n length = len(nums)\n\n for i in range(length-2):\n\n if i>0 and nums[i] == nums[i-1]:\n continue\n j = i+1\n k = length-1\n\n while j<k:\n triplet_sum = nums[i]+nums[j]+nums[k]\n if triplet_sum < 0:\n j += 1\n elif triplet_sum > 0:\n k -= 1\n else:\n result.append([nums[i], nums[j], nums[k]])\n j += 1\n k -= 1\n while j<k and nums[j]==nums[j-1]: j += 1\n while j<k and nums[k]==nums[k+1]: k -= 1\n\n return result\n","runtime":"705"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n result = []\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n j = i + 1\n k = len(nums) - 1\n while j < k:\n sum = nums[i] + nums[j] + nums[k]\n if sum < 0:\n j += 1\n elif sum > 0:\n k -= 1\n else:\n ans = [nums[i], nums[j], nums[k]]\n result.append(ans)\n j += 1\n k -= 1\n while j < k and nums[j] == nums[j-1]:\n j += 1\n while j < k and nums[k] == nums[k+1]:\n k -= 1\n return result","runtime":"705"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n ans = []\n for i in range(len(nums) - 2):\n if (i > 0 and nums[i] == nums[i-1]):\n continue\n l = i + 1\n r = len(nums) - 1\n while l < r:\n curr_sum = nums[i] + nums[l] + nums[r]\n if curr_sum == 0:\n ans.append([nums[i], nums[l], nums[r]])\n l += 1\n r -= 1\n while (l < r and nums[l] == nums[l-1]):\n l += 1\n while (l < r and nums[r] == nums[r+1]):\n r -= 1\n elif curr_sum < 0:\n l += 1\n else:\n r -= 1\n return ans\n ","runtime":"730"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = []\n nums.sort()\n\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n \n j = i + 1\n k = len(nums) - 1\n\n while j < k:\n total = nums[i] + nums[j] + nums[k]\n\n if total > 0:\n k -= 1\n elif total < 0:\n j += 1\n else:\n res.append([nums[i], nums[j], nums[k]])\n j += 1\n\n while nums[j] == nums[j-1] and j < k:\n j += 1\n \n return res","runtime":"730"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n # sort, traverse, if not seen, lock 1 value, do two sum (target = 0 - locked), add to seen\n # if seen, skip\n nums.sort()\n res = []\n # print(nums)\n for i in range(len(nums)):\n lock = nums[i]\n if nums[i] > 0:\n break\n if i == 0 or nums[i - 1] != nums[i]:\n target = -lock\n seen = set()\n # for j in range(i + 1, len(nums)):\n # x = target - nums[j]\n # if x in seen:\n # res.append([lock, nums[j], x])\n # print(j)\n # while j + 1 < len(nums) and nums[j] == nums[j + 1]:\n # j += 1\n # print(j)\n # else:\n # seen.add(nums[j])\n j = i + 1\n while j < len(nums):\n x = target - nums[j]\n if x in seen:\n res.append([nums[i], nums[j], x])\n while j + 1 < len(nums) and nums[j] == nums[j + 1]:\n j += 1\n seen.add(nums[j])\n j += 1\n return res","runtime":"755"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n res = []\n for i in range(len(nums) - 2):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n \n j = i + 1\n k = len(nums) - 1\n while j < k:\n tmp = nums[i] + nums[j] + nums[k]\n if tmp == 0:\n res.append([nums[i], nums[j], nums[k]])\n j += 1\n k -= 1\n while j < k and nums[j] == nums[j - 1]:\n j += 1\n elif tmp > 0:\n k -= 1\n else:\n j += 1\n \n return res","runtime":"755"},{"code":"# Examples:\n#\n# nums = []\n# -> []\n#\n# nums = Any list with less than 3 elements\n# -> []\n#\n# nums = [1, 2, 3]\n# -> []\n#\n# nums = [-1, -2, 3, 4]\n# -> [(-1, -2, 3)]\n#\n# nums = [-1, -2, 3, 3]\n# -> [(-1, -2, 3)]\n\n# Brute force:\n# Iterate through all possible 3-tuples using nested for loops\n# If sums to zero, record the tuple in sorted order\n# Use a hash table to store valid tuples to avoid duplicates\n# Return the keys of the hash table\n#\n# Time complexity: O(N^3)\n# Space complexity: O(1)\n# Hash table stores up to the number of matching triplets\n#\n# Insert all the numbers in a hash table O(N)\n# De-dup repeats\n# Iterate over all 2-tuples\n# Given a, b, if -(a + b) also in set, then valid triplet\n# Time complexity: O(N^2)\n# Space complexity: O(N)\n#\n# Create count_by_value hash table.\n# Iterate over value keys\n# Decrement the value count, of zero remove from table\n# Iterate over remaining keys\n# Give value1, value1, if -(a+b) in the table, then record valid triplet in a hash table\n#\n# Time complexity: O(N^2)\n# Space complexity: O(N)\n\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n count_by_val = {}\n solutions = set()\n # Inventory nums and remove redundant counts.\n for val in nums:\n limit = 3 if val == 0 else 2\n count_by_val[val] = min(count_by_val.get(val, 0) + 1, limit)\n for val1 in list(count_by_val.keys()):\n count_by_val[val1] -= 1\n if count_by_val[val1] == 0:\n del count_by_val[val1]\n for val2 in count_by_val:\n val3 = -(val1 + val2)\n counts = 2 if val2 == val3 else 1\n if count_by_val.get(val3, 0) >= counts:\n solutions.add(tuple(sorted([val1, val2, val3])))\n return [list(s) for s in solutions]\n","runtime":"780"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n # sort, traverse, if not seen, lock 1 value, do two sum (target = 0 - locked), add to seen\n # if seen, skip\n nums.sort()\n res = []\n # print(nums)\n for i in range(len(nums)):\n lock = nums[i]\n if nums[i] > 0:\n break\n if i == 0 or nums[i - 1] != nums[i]:\n target = -lock\n seen = set()\n # for j in range(i + 1, len(nums)):\n # x = target - nums[j]\n # if x in seen:\n # res.append([lock, nums[j], x])\n # print(j)\n # while j + 1 < len(nums) and nums[j] == nums[j + 1]:\n # j += 1\n # seen.add(nums[j])\n j = i + 1\n while j < len(nums):\n x = target - nums[j]\n if x in seen:\n res.append([lock, nums[j], x])\n while j + 1 < len(nums) and nums[j] == nums[j + 1]:\n j += 1\n seen.add(nums[j])\n j += 1\n return res","runtime":"780"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n n = len(nums)\n trips = []\n for i in range(n-2):\n if nums[i] + nums[i+1] + nums[i+2] > 0:\n continue\n if i > 0 and nums[i] == nums[i-1]:\n continue\n target = -nums[i]\n front = i+1\n back = n-1\n while front < back:\n if front == i:\n front += 1\n if back == i:\n back -= 1\n twosum = nums[front] + nums[back]\n if twosum == target:\n trips.append([nums[i], nums[front], nums[back]])\n if twosum <= target:\n front += 1\n while front < back and nums[front] == nums[front-1]:\n front += 1\n if twosum >= target:\n back -= 1\n while back > front and nums[back] == nums[back+1]:\n back -= 1\n return trips\n ","runtime":"805"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n print(nums)\n listLength = len(nums)\n tripletList = []\n for i in range(listLength-2):\n if ( (i != 0) & (nums[i]==nums[i-1])):\n continue\n j = i+1\n k = listLength-1\n while j < k:\n currentTotal = nums[i]+nums[j]+nums[k]\n if (currentTotal == 0):\n tripletList.append([nums[i],nums[j],nums[k]])\n print(\"i:\" + str(i) + \"j\" + str(j) + \"k\" + str(k) )\n j += 1\n while ( (j<k) & (nums[j]==nums[j-1]) ):\n j +=1\n print(\"j is now \" + str(j)) \n elif (currentTotal < 0):\n j += 1\n else:\n k -= 1\n return tripletList\n\n \n\n \n \n\n ","runtime":"805"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n print(nums)\n res = []\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n n1 = nums[i]\n j, k = i + 1, len(nums) - 1\n while j < k:\n n2 = nums[j]\n n3 = nums[k]\n if n1 + n2 + n3 == 0:\n res.append([n1, n2, n3])\n j += 1\n while j < k and nums[j] == nums[j - 1]:\n j += 1\n k -= 1\n while j < k and nums[k] == nums[k + 1]:\n k -= 1\n\n elif n2 + n3 > -n1:\n k -= 1\n else:\n j += 1\n return res","runtime":"829"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n m= 0\n result = []\n nums.sort()\n\n while m < len(nums):\n # print(m)\n left, right = m, len(nums) - 1\n while left < right:\n # print(left, right)\n if left == m:\n left += 1\n continue\n if right == m:\n right -= 1\n continue\n\n value = nums[left] + nums[m] + nums[right]\n if value == 0:\n result.append([nums[left], nums[m], nums[right]])\n while left + 1 < len(nums) and nums[left] == nums[left + 1] and left < right:\n left += 1\n left += 1\n\n elif value > 0:\n right -= 1\n else:\n left += 1\n \n while m + 1 < len(nums) and nums[m] == nums[m + 1]:\n m += 1\n m += 1\n return result\n \n","runtime":"829"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n # Sort the array\n # Fix one number x\n # Perform 2Sum on the rest of the array\n # Target sum is 0 - x\n # Use two pointers\n output = []\n triplet = []\n\n nums.sort()\n\n for i in range(len(nums) - 2):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n\n left = i + 1\n right = len(nums) - 1\n target = 0 - nums[i]\n\n while left < right:\n if nums[left] + nums[right] == target:\n triplet = [nums[i], nums[left], nums[right]]\n output.append(triplet)\n left += 1\n while nums[left] == nums[left - 1] and left < right:\n left += 1\n elif nums[left] + nums[right] < target:\n left += 1\n elif nums[left] + nums[right] > target:\n right -= 1\n return output","runtime":"854"},{"code":"from collections import defaultdict\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n # Redo 9/15/24\n # - How do I get unique indexes? Only use indexes > ones in triplet\n # - How do I get unique numbers? Sort list and place pointers so that every time unique values\n\n\n\n # 1. Hashmap of val: index\n # 2. Loop through every pair combo\n # 3. Find needed val in hashmap, check index > second\n # 4. Advance second pointer until find unique num\n # 5. Advance first pointer until find unique first\n \n locations = defaultdict(list)\n result = []\n sortlist = sorted(nums)\n for i, num in enumerate(sortlist):\n locations[num].append(i)\n\n # must sort because same triplet might arise further down\n # ex. [1, 2, -3, 1, 2, -3]\n \n size = len(sortlist)\n oldfirst = sortlist[0] + 1\n for first in range(size - 2):\n if sortlist[first] != oldfirst:\n oldfirst = sortlist[first]\n oldsecond = sortlist[first + 1] + 1\n for second in range(first+1, size - 1):\n if sortlist[second] != oldsecond:\n oldsecond = sortlist[second]\n currsum = sortlist[first] + sortlist[second]\n if -1*currsum in locations:\n spots = locations[-1*currsum]\n for spot in spots:\n if spot > second:\n result.append((sortlist[first], sortlist[second], -1*currsum))\n break\n \n return result\n \n\n\n # Inc first to unique val\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 # U:\n # 3 distinct indices\n # Triplet adds to 0\n # Unsorted\n\n # Match\n # 2-pointer, sorting, hashing\n\n # # Reduce problem to 2-sum\n # # Loop through array and perform two sum II on rest of array\n # arr = sorted(nums)\n # for i in range(len(nums) - 2):\n \n\n # result = set()\n # locations = defaultdict(list)\n\n # # 1. Map value: [indexes]\n # for i, num in enumerate(nums):\n # locations[num].append(i)\n \n # # 2. Double loop to get all first, second index pairs\n # # Only allow increasing pairs to ensure triplets are distinct\n # for first in range(len(nums) - 2):\n # # Know what sum we need\n # target = -nums[first]\n\n # # Look through the values in hash\n # for value in locations:\n # need = target - value\n # # All three values are same\n # # Make sure we have 3 of them\n # if nums[first] == value and value == need and len(locations[value]) >= 3:\n # result.add((value, value, value)) \n \n # for second in range(first + 1, len(nums) - 1):\n # twosum = nums[first] + nums[second]\n # need = 0 - twosum\n # if need in locations:\n # for index in locations[need]:\n # if index > second:\n # # Order the values\n # result.add(tuple(sorted((nums[first], nums[second], need))))\n # break # Stop looking \n\n # How do I stop early if we already have that sum?\n \n return result\n\n\n ","runtime":"854"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n # n 为 3，从 nums[0] 开始计算和为 0 的三元组\n return self.nSumTarget(nums, 3, 0, 0)\n\n # 注意：调用这个函数之前一定要先给 nums 排序\n # n 填写想求的是几数之和，start 从哪个索引开始计算（一般填 0），target 填想凑出的目标和\n def nSumTarget(self, nums: List[int], n: int, start: int, target: int) -> List[List[int]]:\n sz = len(nums)\n res = []\n\n # 2Sum 是 base case\n if n == 2:\n lo, hi = start, sz - 1\n # 双指针那一套操作\n while lo < hi:\n sum = nums[lo] + nums[hi]\n if sum < target:\n while lo < hi and nums[lo] == nums[lo + 1]:\n lo += 1\n lo += 1\n elif sum > target:\n while lo < hi and nums[hi] == nums[hi - 1]:\n hi -= 1\n hi -= 1\n else:\n res.append([nums[lo], nums[hi]])\n while lo < hi and nums[lo] == nums[lo + 1]:\n lo += 1\n while lo < hi and nums[hi] == nums[hi - 1]:\n hi -= 1\n lo += 1\n hi -= 1\n else:\n # n > 2 时，递归计算 (n-1)Sum 的结果\n for i in range(start, sz):\n if i == start or nums[i - 1] != nums[i]:\n sub = self.nSumTarget(nums, n - 1, i + 1, target - nums[i])\n for arr in sub:\n # (n-1)Sum 加上 nums[i] 就是 nSum\n arr.append(nums[i])\n res.append(arr)\n return res","runtime":"879"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n triplets = set()\n history_i = set()\n n = len(nums)\n \n for i, num_i in enumerate(nums[:-2]):\n if num_i in history_i:\n continue\n \n history_i.add(num_i)\n history_j = set()\n\n for num_j in nums[i+1:]:\n num_k = - (num_i + num_j)\n if num_k in history_j:\n triplets.add(tuple(sorted([num_i, num_j, num_k])))\n \n history_j.add(num_j)\n\n return triplets","runtime":"879"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n combs = set()\n seen = set()\n\n for i in range(len(nums)):\n if nums[i] in seen:\n continue\n seen.add(nums[i])\n record = set()\n target = 0 - nums[i]\n for j in range(i + 1, len(nums)):\n if target - nums[j] in record:\n comb = sorted([nums[i], target - nums[j], nums[j]])\n combs.add(tuple(comb))\n record.add(nums[j])\n \n return [list(c) for c in combs]","runtime":"904"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n\n nums = sorted(nums)\n\n res_set = set()\n res = []\n\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n first = nums[i]\n my_set = set()\n for j in range(i +1,len(nums)):\n if -(nums[j] + first) in my_set:\n # print(first)\n # print(-(nums[j] + first) )\n # res.append([first, -(nums[j] + first) , nums[j]])\n # my_list = sorted([first, -(nums[j] + first) , nums[j]])\n res_set.add((first, -(nums[j] + first) , nums[j]))\n my_set.add(nums[j])\n\n res = [ [entry[0], entry[1], entry[2]] for entry in res_set]\n \n return res\n\n\n ","runtime":"904"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n allSums=[]\n\n for i in range(len(nums)-2):\n if i>0 and nums[i]==nums[i-1]: #to avoid repeating values\n continue\n \n ptr1=i+1\n ptr2=len(nums)-1\n while ptr1<ptr2: \n\n if nums[i]+nums[ptr1]+nums[ptr2]==0: \n oneSum=[nums[i],nums[ptr1],nums[ptr2]]\n allSums.append(oneSum)\n ptr1=ptr1+1\n while nums[ptr1]==nums[ptr1-1] and ptr1<ptr2:\n ptr1=ptr1+1\n elif nums[i]+nums[ptr1]+nums[ptr2]<0:\n ptr1=ptr1+1\n else:\n ptr2=ptr2-1\n return allSums \n\n","runtime":"929"},{"code":"'''\nUnderstanding the Problem\nExample 1:\nInput: nums = [-1,0,1,2,-1,-4]\nOutput: [[-1,-1,2],[-1,0,1]]\n\nExample 2:\nInput: nums = [0,1,1]\nOutput: []\n\nDesign a solution\n[-1,0,1,2,-1,-4]\n[-4,-1,-1,0,1,2]\n\nnums.sort()\nfor i in range(len(nums) - 2):\n j = i + 1\n k = len(nums) - 1\n while j < k:\n if nums[j] + nums[k] == -nums[i]:\n result.append([nums[i], nums[j], nums[k]])\n elif nums[j] + nums[k] < -nums[i]:\n j += 1\n else:\n k -= 1\n\n\nVerify the solution\n\nImplement and test\n\n'''\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n result = []\n nums.sort()\n print(nums)\n for i in range(len(nums) - 2):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n j = i + 1\n k = len(nums) - 1\n # print(i)\n while j < k:\n if nums[j] + nums[k] + nums[i] == 0:\n result.append([nums[i], nums[j], nums[k]])\n while j < k and nums[j] == nums[j+1]:\n j += 1\n while j < k and nums[k] == nums[k-1]:\n k -= 1\n j += 1\n k -= 1\n elif nums[j] + nums[k] + nums[i] < 0:\n j += 1\n else:\n k -= 1\n\n return result\n ","runtime":"929"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n ans = set()\n pointer1 = 0\n while pointer1 < len(nums)-2:\n if pointer1> 0 and nums[pointer1]==nums[pointer1-1]:\n pointer1+=1\n continue\n pointer2 = pointer1 + 1\n pointer3 = len(nums) - 1\n while pointer2<pointer3:\n if nums[pointer1] + nums[pointer2] + nums[pointer3] == 0:\n ans.add((nums[pointer1],nums[pointer2],nums[pointer3]))\n pointer2+=1\n pointer3-=1\n elif nums[pointer1] + nums[pointer2] + nums[pointer3] > 0:\n pointer3-=1\n else:\n pointer2+=1\n pointer1+=1\n return ans\n \n","runtime":"953"},{"code":"class Solution:\n from collections import defaultdict\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n resultdict={}\n\n for i in range (len(nums)):\n if i>0 and nums[i]==nums[i-1]:\n continue\n arr=[]\n arr.append(nums[i])\n\n p1=i+1\n p2=len(nums)-1\n\n # s= -1*arr[0]\n while(p1<p2):\n if(p1==i or nums[p1]+nums[p2]< -1*arr[0] ):\n p1+=1\n elif(p2==i or nums[p1]+nums[p2]> -1*arr[0] ):\n p2-=1\n else:\n arr.append(nums[p1])\n arr.append(nums[p2])\n p1+=1\n p2-=1\n addable=tuple(sorted(arr))\n resultdict[addable]=1\n\n arr=[]\n arr.append(nums[i])\n \n arr=[]\n for i in resultdict.keys():\n arr.append(list(i))\n\n \n return arr\n \n \n\n\n\n \n \n\n","runtime":"953"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n results = set()\n firstseen = set()\n for i, num in enumerate(nums):\n if num in firstseen:\n continue\n firstseen.add(num)\n res = set()\n secondseen = set()\n for x in nums[i+1:]:\n if x in res:\n results.add(tuple(sorted([num, -(num+x), x])))\n res.add(-(num+x))\n\n return list(results)","runtime":"978"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n ans = []\n i = 0\n while i<len(nums):\n t = -nums[i]\n\n a = i+1\n b = len(nums)-1\n\n while a<len(nums) and b>=0 and a<b:\n if nums[a]+nums[b]==t:\n temp = [nums[i],nums[a],nums[b]]\n ans.append(temp)\n\n while a+1<len(nums) and nums[a+1]==nums[a]:\n a+=1\n a+=1\n while b-1>=0 and nums[b-1]==nums[b]:\n b-=1\n b-=1 \n \n\n elif nums[a]+nums[b]<t:\n a+=1\n else:\n b-=1\n\n while i+1<len(nums) and nums[i]==nums[i+1]:\n i+=1\n i+=1\n\n return ans \n","runtime":"978"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = set()\n dup = set()\n seen = {}\n\n for i, val1 in enumerate(nums):\n if val1 not in dup:\n dup.add(val1)\n for j, val2 in enumerate(nums[i + 1 : ]):\n val3 = 0 - val1 - val2\n if val3 in seen and seen[val3] == i:\n res.add(tuple(sorted((val1, val2, val3))))\n seen[val2] = i\n\n return res","runtime":"1003"},{"code":"class Solution:\n # Sort\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n res = set()\n for i in range(len(nums)):\n # We only match negative numbers with two sum\n if nums[i] > 0:\n break\n if i == 0 or nums[i - 1] != nums[i]:\n self.twoSum(nums, i, res)\n return res\n\n # Two Pointers\n def twoSum(self, nums: List[int], i: int, res: List[List[int]]):\n low = i + 1\n high = len(nums)\n\n while low < high:\n sum = nums[i] + nums[low] + nums[high]\n if sum < 0:\n low += 1\n elif sum > 0:\n high -= 1\n else:\n res.add([nums[i], nums[low], nums[high]])\n low += 1\n high -= 1\n # Skip duplicates\n while low < high and nums[low] == nums[lo - 1]:\n low += 1\n\n # Hash Set\n def twoSum(self, nums: List[int], i: int, res: List[List[int]]):\n seen = set()\n j = i + 1\n while j < len(nums):\n complement = -(nums[i] + nums[j])\n if complement in seen:\n res.add([nums[i], nums[j], complement]) \n # Skip duplicates\n while j + 1 < len(nums) and nums[j] == nums[j + 1]:\n j += 1\n seen.add(nums[j]) \n j += 1\n\n # No-Sort - HashSet\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n dups = set() # Needed to Skip duplicates as array is not sorted \n seen = {}\n res = set()\n for i, val1 in enumerate(nums):\n if val1 not in dups:\n dups.add(val1)\n for j, val2 in enumerate(nums[i + 1:]):\n complement = -(val1 + val2)\n if complement in seen and seen[complement] == i: \n res.add(tuple(sorted([val1, val2, complement])))\n # Need to map new complement to index to mark it as used\n seen[val2] = i\n return res\n\n \n","runtime":"1003"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res, dups = set(), set()\n seen = {}\n for i, val1 in enumerate(nums):\n if val1 not in dups:\n dups.add(val1)\n for j, val2 in enumerate(nums[i + 1 :]):\n complement = -val1 - val2\n if complement in seen and seen[complement] == i:\n res.add(tuple(sorted((val1, val2, complement))))\n seen[val2] = i\n return res","runtime":"1028"},{"code":"# class Solution:\n# def threeSum(self, nums: List[int]) -> List[List[int]]:\n# result = []\n# nums.sort()\n# for i in range(len(nums)):\n# if nums[i] > 0:\n# break\n \n# if i > 0 and nums[i] == nums[i-1]:\n# continue\n\n# left, right = i + 1, len(nums) - 1\n# while left < right:\n# if nums[i] + nums[left] + nums[right] > 0:\n \n# right -= 1\n\n# elif nums[i] + nums[left] + nums[right] < 0:\n# left += 1\n# else:\n# result.append([nums[i], nums[left], nums[right]])\n# left += 1\n# while nums[left] == nums[left - 1] and left < right:\n# left += 1\n# return result\n\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res, dups = set(), set()\n seen = {}\n for i, val1 in enumerate(nums):\n if val1 not in dups:\n dups.add(val1)\n for j, val2 in enumerate(nums[i + 1 :]):\n complement = -val1 - val2\n if complement in seen and seen[complement] == i:\n res.add(tuple(sorted((val1, val2, complement))))\n seen[val2] = i\n return res\n","runtime":"1028"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res, dups = set(), set()\n seen = {}\n for i, val1 in enumerate(nums):\n if val1 not in dups:\n dups.add(val1)\n for j, val2 in enumerate(nums[i+1:]):\n complement = -val1 - val2\n if complement in seen and seen[complement] == i:\n res.add(tuple(sorted((val1, val2, complement))))\n seen[val2] = i\n return res","runtime":"1053"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res, dups = set(), set()\n seen = {}\n for i, val1 in enumerate(nums):\n if val1 not in dups:\n dups.add(val1)\n for j, val2 in enumerate(nums[i + 1 :]):\n complement = -val1 - val2\n if complement in seen and seen[complement] == i:\n res.add(tuple(sorted((val1, val2, complement))))\n seen[val2] = i\n return res","runtime":"1053"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n \n res = []\n\n n = len(nums)\n for i in range(n): \n if i != 0 and nums[i] == nums[i-1]:\n continue\n\n j = i+1\n k = n-1\n\n while j < k:\n #print(f\"{i} {j} {k}\")\n total = nums[i] + nums[j] + nums[k]\n\n if total < 0:\n cur_j = nums[j]\n while j < k and nums[j] == cur_j:\n j += 1\n\n elif total > 0:\n cur_k = nums[k]\n while j < k and nums[k] == cur_k:\n k -= 1\n\n else:\n res.append([nums[i], nums[j], nums[k]])\n \n cur_j = nums[j]\n while j < k and nums[j] == cur_j:\n j += 1\n \n cur_k = nums[k]\n while j < k and nums[k] == cur_k:\n k -= 1\n\n return res","runtime":"1077"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n seen = set()\n res = set()\n dups = set()\n\n\n\n for i in range(len(nums)):\n if nums[i] not in dups:\n dups.add(nums[i])\n seen = set()\n for j in range(i+1, len(nums)):\n complement = -nums[i] - nums[j]\n if complement in seen:\n res.add(tuple(sorted([nums[i], complement, nums[j]])))\n seen.add(nums[j])\n\n return res","runtime":"1077"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n result=[]\n for i in range(len(nums)):\n if i>0 and nums[i-1]==nums[i]:\n continue\n j,k=i+1,len(nums)-1\n while j<k:\n if nums[i]+nums[j]+nums[k]==0:\n result.append([nums[i],nums[j],nums[k]])\n j+=1\n k-=1\n while j<k and nums[j]==nums[j-1]:\n j+=1\n while j<k and nums[k]==nums[k+1]:\n k-=1\n elif nums[i]+nums[j]+nums[k]>0:\n k-=1\n elif nums[i]+nums[j]+nums[k]<0:\n j+=1\n return result\n ","runtime":"1102"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n \n all_3sum = []\n nums.sort()\n \n i=0\n while i < len(nums) - 1:\n \n complement_set = set()\n \n if i > 0 and nums[i-1] == nums[i]:\n i += 1\n continue\n\n j = i + 1\n while j < len(nums):\n complement = - nums[i] - nums[j]\n \n if complement in complement_set:\n all_3sum.append([nums[i], complement, nums[j]])\n \n while j < len(nums) - 1 and nums[j] == nums[j+1]:\n j+=1\n else:\n complement_set.add(nums[j])\n j += 1 \n i += 1\n \n return all_3sum\n \n \n ","runtime":"1102"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n t = 0\n nums.sort()\n if len(nums) >= 3 and len(set(nums)) == 1:\n nums = nums[:3]\n ans = []\n seen = set([])\n # print (nums)\n for i, t in enumerate(nums):\n t=-t\n left = i+1\n right = len(nums) -1\n\n while left < right:\n if nums[left] + nums[right] > t:\n right -=1\n elif nums[left] + nums[right] < t:\n left +=1\n else:\n ele = (nums[i], nums[left], nums[right])\n if ele not in seen:\n ans.append(ele)\n seen |= set([ele])\n left += 1\n\n return ans","runtime":"1127"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n solution, seen = set(), set()\n nums = sorted(nums)\n for i in range(len(nums)):\n if nums[i] not in seen:\n seen.add(nums[i])\n target = -nums[i]\n two_sum_ans = self.two_sum(nums[i+1:], target)\n for ans in two_sum_ans:\n ans.append(nums[i])\n solution.add(tuple(sorted(ans)))\n return [list(sol) for sol in solution]\n\n def two_sum(self, arr, target):\n t = {}\n ans = []\n for i in range(len(arr)):\n if target - arr[i] in t:\n ans.append([target-arr[i],arr[i]])\n if arr[i] in t:\n t[arr[i]]+=1\n else:\n t[arr[i]]=1\n return ans","runtime":"1127"},{"code":"\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n\n nums = sorted(nums) \n length = len(nums)\n\n ret = [] \n for i in range(length):\n if i >= 1 and nums[i] == nums[i-1]:\n continue \n target = -nums[i]\n\n start = i+1 \n end = length-1\n while start < end:\n if start >= i+2 and nums[start] == nums[start-1]:\n start += 1 \n continue \n if end < length-1 and nums[end] == nums[end+1]:\n end -= 1 \n continue \n sum = nums[start] + nums[end]\n if sum > target:\n end -= 1 \n elif sum < target:\n start += 1 \n else:\n ret.append([nums[i], nums[start], nums[end]])\n start += 1 \n end -= 1 \n\n return ret \n\n ","runtime":"1152"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums = sorted(nums)\n answer = set()\n for i in range(len(nums) - 2):\n number = nums[i]\n if number > 0:\n break\n l = i + 1\n r = len(nums) - 1\n while l < r:\n if number + nums[l] + nums[r] > 0:\n r -= 1\n elif number + nums[l] + nums[r] < 0:\n l += 1\n else:\n tmp = [number, nums[l], nums[r]]\n answer.add(\" \".join(list(map(str, tmp))))\n while l < r and nums[l] == tmp[1]:\n l += 1\n while l < r and nums[r] == tmp[2]:\n r -= 1\n return [list(map(int, elem.split())) for elem in answer]","runtime":"1152"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = set()\n dup = set()\n for i, val1 in enumerate(nums):\n if val1 in dup:\n continue\n dup.add(val1)\n seen = defaultdict(int)\n for j, val2 in enumerate(nums[i+1:]):\n complement = -val1 - val2\n if complement in seen and seen[complement] == i:\n res.add(tuple(sorted((val1, val2, complement))))\n seen[val2] = i\n return res","runtime":"1177"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n to_return = []\n i = 0\n while i < len(nums):\n left, right = i+1, len(nums) - 1\n while left < right:\n if nums[left] + nums[right] + nums[i] == 0:\n to_return.append([nums[i], nums[left], nums[right]])\n while left < len(nums) - 1 and nums[left+1] == nums[left]:\n left += 1\n while right >= 1 and right > left and nums[right-1] == nums[right]:\n right -= 1 \n left += 1\n right -= 1\n \n elif nums[left] + nums[right] + nums[i] < 0:\n left += 1\n elif nums[left] + nums[right] + nums[i] > 0:\n right -= 1\n \n while i < len(nums) - 1 and nums[i+1] == nums[i]:\n i += 1\n \n i += 1\n return to_return\n \n","runtime":"1177"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n triples = []\n\n nums = sorted(nums)\n\n for i_p in range(0, len(nums)):\n if i_p != 0 and nums[i_p] == nums[i_p - 1]:\n continue\n\n l_p = i_p + 1\n r_p = len(nums) - 1\n\n if l_p >= len(nums) or r_p >= len(nums):\n continue\n\n\n while l_p < r_p:\n cur_l_p = l_p\n cur_r_p = r_p\n\n triple_sum = nums[i_p] + nums[l_p] + nums[r_p]\n if triple_sum == 0:\n triples.append([nums[i_p], nums[l_p], nums[r_p]])\n\n\n while nums[l_p] == nums[cur_l_p] and l_p < r_p:\n l_p += 1\n while nums[r_p] == nums[cur_r_p] and l_p < r_p:\n r_p -= 1\n elif triple_sum < 0:\n while nums[l_p] == nums[cur_l_p] and l_p < r_p:\n l_p += 1\n elif triple_sum > 0:\n while nums[r_p] == nums[cur_r_p] and l_p < r_p:\n r_p -= 1\n\n return triples","runtime":"1201"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n res=[]\n l = 0\n while l<len(nums)-1:\n r=len(nums)-1\n mid = l+1\n while mid < r:\n if nums[l]+nums[r]+nums[mid]==0:\n res.append([nums[l], nums[mid], nums[r]])\n mid+=1\n while nums[mid]==nums[mid-1] and mid < r:\n mid+=1\n elif nums[l]+nums[r]+nums[mid] > 0:\n r-=1\n while nums[r]==nums[r+1] and r>mid:\n r-=1\n else:\n mid+=1\n while nums[mid]==nums[mid-1] and mid < r:\n mid+=1\n l+=1\n while l<len(nums) and nums[l]==nums[l-1]:\n l+=1\n \n \n return res\n ","runtime":"1201"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort() \n print(nums)\n result = [] \n avoid_dup = 0\n for i in range(len(nums)):\n\n if i != 0 and avoid_dup == nums[i]:\n continue\n\n left, right = i+1, len(nums)-1\n\n while left < right:\n test_triplet = nums[i] + nums[left] + nums[right]\n\n if test_triplet == 0:\n print('found: ', nums[i], nums[left], nums[right])\n result.append([nums[i], nums[left], nums[right]])\n \n curr_elem = nums[left]\n while left < len(nums) and curr_elem == nums[left]:\n left += 1\n\n curr_elem = nums[right]\n while right >= 0 and curr_elem == nums[right]:\n right -= 1\n \n\n elif test_triplet > 0:\n curr_elem = nums[right]\n while right >= 0 and curr_elem == nums[right]:\n right -= 1\n elif test_triplet < 0:\n curr_elem = nums[left]\n while left < len(nums) and curr_elem == nums[left]:\n left += 1\n \n avoid_dup = nums[i]\n return result","runtime":"1226"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n nums.sort()\n ans = []\n i = 0\n while i < n:\n # for i in range(n):\n l = i + 1\n r = n - 1\n while l < r:\n if nums[l] + nums[r] + nums[i] == 0:\n ans.append([nums[l], nums[r], nums[i]])\n r -= 1\n l += 1\n while r >= 0 and nums[r] == nums[r+1]:\n r -= 1\n while l < n and nums[l] == nums[l - 1]:\n l += 1\n elif nums[l] + nums[r] + nums[i] > 0:\n r -= 1\n while r >= 0 and nums[r] == nums[r+1]:\n r -= 1\n else:\n l += 1\n while l < n and nums[l] == nums[l - 1]:\n l += 1\n i += 1\n while i < n and nums[i] == nums[i - 1]:\n i += 1\n return ans","runtime":"1226"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n solutions = []\n nums = sorted(nums)\n for i in range(len(nums)):\n if i and nums[i] == nums[i - 1]:\n continue\n target = -nums[i]\n j, k = i + 1, len(nums) - 1\n while j < k:\n if j > i + 1 and nums[j] == nums[j - 1]:\n j += 1\n continue\n if k < len(nums) - 1 and nums[k] == nums[k + 1]:\n k -= 1\n continue\n \n sum_ = nums[j] + nums[k]\n if sum_ < target:\n j += 1\n elif sum_ > target:\n k -= 1\n else:\n solutions.append([nums[i], nums[j], nums[k]])\n j += 1\n k -= 1\n \n return solutions\n\n","runtime":"1251"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n ans = []\n \n i = 0\n while i < len(nums):\n left, right = i + 1, len(nums) - 1\n\n while left < right:\n target = nums[i] + nums[left] + nums[right]\n\n if target < 0:\n temp = left\n while temp < right and nums[temp] == nums[left]:\n temp += 1\n left = temp\n elif target > 0:\n temp = right\n while left < temp and nums[temp] == nums[right]:\n temp -= 1\n right = temp\n else:\n ans.append([nums[i], nums[left], nums[right]])\n temp = left\n while temp < right and nums[temp] == nums[left]:\n temp += 1\n print(f'{temp=}')\n left = temp\n temp = right\n while left < temp and nums[temp] == nums[right]:\n temp -= 1\n right = temp\n \n temp = i\n while temp < len(nums) and nums[i] == nums[temp]:\n temp += 1\n i = temp\n \n return ans","runtime":"1251"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n n = len(nums)\n ans = []\n for i in range(n):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n l = i + 1\n r = n - 1\n target = -nums[i]\n while l < r:\n if l > i + 1 and nums[l] == nums[l - 1]:\n l += 1\n continue\n if r < n - 1 and nums[r] == nums[r + 1]:\n r -= 1\n continue\n if nums[l] + nums[r] == target:\n ans.append((nums[i], nums[l], nums[r]))\n l += 1\n r -= 1\n elif nums[l] + nums[r] < target:\n l += 1\n else:\n r -= 1\n return ans","runtime":"1276"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n ans = []\n nums.sort()\n prev = None\n for i in range(len(nums)-2):\n if nums[i] == prev:\n continue\n prev = nums[i]\n left = i + 1\n right = len(nums) - 1\n prev_left = None\n prev_right = None\n while left < right:\n if nums[i] + nums[left] + nums[right] == 0:\n ans.append([nums[i], nums[left], nums[right]])\n prev_left = nums[left]\n prev_right = nums[right]\n left += 1\n right -= 1\n elif nums[i] + nums[left] + nums[right] < 0:\n prev_left = nums[left]\n left += 1\n else:\n prev_right = nums[right]\n right -= 1\n \n while left < right and nums[left] == prev_left:\n left += 1\n while left < right and nums[right] == prev_right:\n right -= 1\n \n return ans","runtime":"1276"},{"code":"'''\nSort\n\nGo through each value, find target, and apply 2Sum on the array of numbers after the value\n'''\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n triplets = []\n firstValuesVisited = set()\n for i in range(len(nums)-1):\n if nums[i] not in firstValuesVisited:\n triplets = self.twoSum(i, nums, triplets)\n firstValuesVisited.add(nums[i])\n return triplets\n def twoSum(self, firstIndex: int, nums: List[int], triplets: List[int]):\n firstValue = nums[firstIndex]\n target = 0 - firstValue\n index_map = dict()\n secondValuesVisited = set()\n for i in range(firstIndex+1, len(nums)):\n if nums[i] not in secondValuesVisited:\n difference = target - nums[i]\n if difference in index_map:\n secondValue = nums[index_map[difference]]\n triplets.append([firstValue, secondValue, nums[i]])\n secondValuesVisited.add(nums[i])\n elif nums[i] not in index_map:\n index_map[nums[i]] = i\n return triplets\n\n","runtime":"1301"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n answer = set()\n n = len(nums)\n for idx in range(n - 2):\n left, right = idx + 1, n - 1\n target = nums[idx]\n while left < right:\n _sum = nums[left] + nums[right] + target\n if _sum == 0:\n answer.add((nums[idx], nums[left], nums[right]))\n left += 1\n right -= 1\n \n # move the two pointers to skip uncessary calculation\n while left < right and nums[left] == nums[left - 1]:\n left += 1\n while left < right and nums[right] == nums[right + 1]:\n right -= 1\n\n elif _sum > 0:\n right -= 1\n else:\n left += 1\n\n return answer","runtime":"1301"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n #sort\n nums.sort()\n \n n=len(nums)\n res=set()\n \n for i in range(0,n-2): #0,...,n-2\n left=i+1\n right=n-1\n val=nums[i]\n if val>0:\n break\n while left<right:\n sum1=val+nums[left]+nums[right]\n \n if sum1==0:\n #if (val,nums[left],nums[right]) not in res:\n res.add ((val,nums[left],nums[right]) )\n left+=1\n right-=1\n elif sum1<0:\n left+=1\n else:\n right-=1\n return [list(s) for s in res]\n\n","runtime":"1325"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n from collections import Counter\n counter = Counter(nums)\n\n outputs = []\n\n def is_valid_triplet(x,y,z,counter):\n if x == y and y == z:\n return counter[x] > 2\n \n if x == y:\n return counter[x] > 1 and counter[z] > 0\n\n if y == z:\n return counter[y] > 1\n\n return counter[z] > 0\n\n\n for x, cnt_x in counter.items():\n for y, cnt_y in counter.items():\n z = -(x+y)\n # x<=y<=z\n if y < x or z < y:\n continue\n\n if is_valid_triplet(x,y,z,counter):\n outputs.append([x,y,z])\n\n return outputs\n\n\n\n \n \n \n\n\n \n\n\n ","runtime":"1325"},{"code":"from collections import defaultdict\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n \n store = defaultdict(set)\n for i, x in enumerate(nums):\n store[x].add(i)\n \n arr = list(store)\n print(arr)\n ans = set()\n for i in range(len(arr)):\n for j in range(len(arr)):\n to_find = -arr[i]-arr[j]\n if to_find in store:\n if to_find == arr[i] or to_find == arr[j]:\n if len(store[to_find]) <= 2: continue\n if arr[i] == arr[j] and len(store[arr[i]]) < 2: continue\n # print(tuple(sorted([nums[i], nums[j], to_find])))\n ans.add(tuple(sorted([arr[i], arr[j], to_find])))\n\n return ans\n","runtime":"1350"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n if len(nums) < 3:\n return []\n nums.sort()\n ret = set()\n for i, val in enumerate(nums[:-2]):\n left, right = i+1, len(nums)-1\n if val > 0:\n break\n while left < right:\n vsum = val + nums[left] + nums[right]\n if vsum == 0:\n trip = (val, nums[left], nums[right])\n if trip not in ret:\n ret.add(trip)\n left += 1\n right -= 1\n elif vsum < 0:\n left += 1\n elif vsum > 0:\n right -= 1\n return list(ret)\n\n\n ","runtime":"1350"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n triplets = set()\n \n pos_list, neg_list = [], []\n zero_count = 0\n for num in nums:\n if num > 0:\n pos_list.append(num)\n elif num < 0:\n neg_list.append(num)\n else:\n zero_count += 1\n \n pos_set, neg_set = set(pos_list), set(neg_list)\n \n if zero_count >= 1:\n for pos in pos_set:\n target = -pos\n if target in neg_set:\n triplets.add((target, 0, pos))\n \n if zero_count >= 3:\n triplets.add((0, 0, 0))\n \n pos_length = len(pos_list)\n for i in range(pos_length):\n for j in range(i + 1, pos_length):\n pos1 = min(pos_list[i], pos_list[j])\n pos2 = max(pos_list[i], pos_list[j])\n target = -(pos1 + pos2)\n if target in neg_set:\n triplets.add((target, pos1, pos2))\n \n neg_length = len(neg_list)\n for i in range(neg_length):\n for j in range(i + 1, neg_length):\n neg1 = min(neg_list[i], neg_list[j])\n neg2 = max(neg_list[i], neg_list[j])\n target = -(neg1 + neg2)\n if target in pos_set:\n triplets.add((neg1, neg2, target))\n\n triplets = [list(triplet) for triplet in triplets]\n\n return triplets\n","runtime":"1375"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n exists = {}\n for i in range(len(nums)):\n exists[nums[i]] = i\n \n res = []\n print(nums)\n\n i = 0\n while i < len(nums) - 2:\n j = i + 1\n while j < len(nums) - 1:\n target = 0 - (nums[i] + nums[j])\n if target in exists and exists[target] > j:\n res.append([nums[i], nums[j], target])\n j += 1\n while j < len(nums) - 1 and nums[j] == nums[j - 1]:\n j += 1\n i += 1\n while i < len(nums) - 2 and nums[i] == nums[i - 1]:\n i += 1\n return res\n","runtime":"1375"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n s_nums = sorted(nums)\n i, j, k = 0, 1, len(nums)-1\n threesomes = set()\n for i in range(len(nums)-2):\n target = -1 * s_nums[i]\n j = i + 1\n k = len(nums)-1\n while j < k:\n curr_sum = s_nums[j] + s_nums[k]\n if curr_sum == target:\n threesomes.add((s_nums[i], s_nums[j], s_nums[k]))\n j+=1\n k-=1\n elif curr_sum < target:\n j += 1\n else:\n k -= 1\n return list(threesomes)\n ","runtime":"1449"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n # Naive solution is O(n^3). Not even gonna bother with that. \n\n # If we sort it starts O(N log N). And then we do n pass-es using two pointers that are O(n). Which is O(n^2). So that's not bad.\n nums.sort()\n output = set()\n for fixed_index in range(len(nums) - 2):\n fixed = nums[fixed_index]\n left_ptr = fixed_index + 1\n right_ptr = len(nums) - 1\n while left_ptr < right_ptr:\n summed = fixed + nums[left_ptr] + nums[right_ptr]\n if summed == 0:\n output.add((fixed, nums[left_ptr], nums[right_ptr]))\n left_ptr += 1\n right_ptr -= 1\n elif summed < 0:\n left_ptr += 1\n else:\n right_ptr -= 1\n return output","runtime":"1449"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n n = len(nums)\n if (nums[0] > 0 and nums[n-1] > 0) or (nums[0] < 0 and nums[n-1] < 0):\n return []\n ans = set()\n\n \n for i, num in enumerate(nums):\n if num > 0: break\n l, h = i+1, n-1\n while l < h:\n n1, n2 = nums[l], nums[h]\n if num + n1 + n2 == 0:\n ans.add((num, n1, n2))\n h-=1\n l+=1\n else:\n if num + n1 + n2 > 0: h -= 1\n else: l += 1\n \n return ans\n\n ","runtime":"1474"},{"code":"'''\nSort\n\nGo through each value, find target, and apply 2Sum on the array of numbers after the value\n'''\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n triplets = []\n firstValuesVisited = set()\n for i in range(len(nums)-1):\n if nums[i] not in firstValuesVisited:\n triplets = triplets + self.twoSum(nums[i], nums[i+1:], triplets)\n firstValuesVisited.add(nums[i])\n return triplets\n def twoSum(self, firstValue: int, nums: List[int], cur_triplets: List[int]):\n target = 0 - firstValue\n index_map = dict()\n secondValues = set()\n triplets = []\n for i in range(len(nums)):\n if nums[i] not in secondValues:\n difference = target - nums[i]\n if difference in index_map:\n triplets.append([firstValue, nums[i], nums[index_map[difference]]])\n secondValues.add(nums[i])\n elif nums[i] not in index_map:\n index_map[nums[i]] = i\n return triplets\n\n","runtime":"1474"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n \n res=set()\n nums.sort()\n for i,val in enumerate(nums):\n #if( i>0 and val==nums[i-1]):\n #print(\"value and nums[i-1] is\",i,val,nums[i-1])\n #continue\n l=i+1\n r=len(nums)-1\n while(l<r):\n sum=val+nums[l]+nums[r]\n if(sum>0):\n r-=1\n elif(sum<0):\n l+=1\n else:\n res.add((val,nums[l],nums[r]))\n l+=1\n r-=1\n #while(nums[l]==nums[l-1] and l<r):\n #l+=1\n return res\n\n\n","runtime":"1499"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n print(nums)\n idx = 0\n triplets = set()\n while idx < len(nums) - 2:\n if True:\n \n low = idx + 1\n high = len(nums) - 1\n target = -nums[idx]\n \n\n while low < high:\n \n sum = nums[low] + nums[high]\n if sum == target:\n triplets.add((nums[idx], nums[low], nums[high]))\n low += 1\n high -= 1\n \n elif sum > target:\n high -= 1\n else:\n low += 1\n\n idx += 1\n return list(triplets)\n ","runtime":"1499"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n answers = set() # Use a set to avoid duplicates\n\n for i in range(len(nums)):\n left = i + 1\n right = len(nums) - 1\n\n while left < right:\n total = nums[i] + nums[left] + nums[right]\n if total == 0:\n # Add the triplet as a tuple to the set\n answers.add((nums[i], nums[left], nums[right]))\n left += 1\n right -= 1\n elif total < 0:\n left += 1\n else:\n right -= 1\n \n # Convert the set of tuples back into a list of lists\n return [list(triplet) for triplet in answers]\n","runtime":"1524"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n\n \n# -1, 0, 1, 2, -1, -4\n# 0 1 2 3 4 5\n\n# i j k \n\n\n# -4 -1 -1 0 1 2 \n# 0 1 2 3 4 5\n\n# i =0\n\n ans = set()\n \n nums.sort()\n for i in range(len(nums) -2):\n left = i+1 \n right = len(nums) -1\n \n while left < right:\n sum = nums[i] + nums[left] + nums[right]\n if sum ==0 :\n ans.add((nums[i],nums[left],nums[right]))\n left += 1\n right -=1\n elif sum > 0:\n right-=1\n else:\n left+=1\n\n return [list(triplet) for triplet in ans]\n\n\n","runtime":"1524"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n ans = set()\n nums.sort()\n for i in range(n):\n if i > 0 and nums[i-1] == nums[i]:\n continue\n seen = {}\n for j in range(i+1,n):\n target = -nums[i] - nums[j]\n if target in seen:\n ans.add(tuple((nums[i],nums[j],target)))\n while j < n-1 and nums[j] == nums[j+1]:\n j = j + 1\n seen[nums[j]] = i\n return ans \n ","runtime":"1549"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n target = 0\n nums = sorted(nums)\n s = set()\n output = []\n len_nums = len(nums)\n for i0 in range(len_nums):\n i1 = i0 + 1\n i2 = len_nums - 1\n while i1 < i2:\n sum_nums = nums[i0] + nums[i1] + nums[i2]\n if sum_nums == target:\n s.add((nums[i0], nums[i1], nums[i2]))\n i1 += 1\n i2 -= 1\n elif sum_nums < target:\n i1 += 1\n else:\n i2 -= 1\n output = list(s)\n return output\n","runtime":"1549"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n output = set()\n for i in range(len(nums) - 2):\n j, k = i + 1, len(nums) - 1\n while j < k:\n three_sum = nums[i] + nums[j] + nums[k] \n if three_sum > 0:\n k -= 1\n elif three_sum < 0:\n j += 1\n else:\n output.add((nums[i], nums[j], nums[k]))\n j += 1\n k -= 1\n return list(output)\n\n","runtime":"1573"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n triplets = set()\n for i in range(0,len(nums)-2):\n j = i + 1\n k = len(nums) - 1\n while j < k:\n potential_sum = nums[i] + nums[j] + nums[k]\n if potential_sum > 0:\n k -= 1\n elif potential_sum < 0:\n j += 1\n else:\n triplets.add((nums[i],nums[j],nums[k]))\n j += 1\n k -= 1\n return triplets ","runtime":"1573"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res =set()\n # left = 1\n # right = len(nums) - 1\n nums.sort()\n if len(nums) < 3:\n return [] \n for i in range(len(nums)-2):\n left = i + 1\n right = len(nums) - 1\n while left < right:\n summ = nums[left] + nums[i] + nums[right]\n if summ > 0:\n right -=1 \n elif summ < 0:\n left += 1\n else:\n \n res.add((nums[left],nums[i],nums[right]))\n left += 1\n right -= 1\n return res\n\n\n","runtime":"1598"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n a = set()\n n = len(nums)\n nums.sort()\n output = []\n\n for i in range(n):\n j = i+1\n k = n-1\n while j<k:\n sum = nums[i] + nums[j] + nums[k]\n if sum == 0:\n a.add((nums[i],nums[j],nums[k]))\n j += 1\n k -=1\n elif sum < 0:\n j += 1\n elif sum > 0:\n k -=1\n output = list(a)\n return output\n","runtime":"1598"},{"code":"from collections import defaultdict\n\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n ret = set()\n nums.sort()\n for i, n in enumerate(nums):\n if n > 0:\n break\n for res in self.twoSum(nums, i+1, -n):\n ret.add(tuple(sorted([nums[i], nums[res[0]], nums[res[1]]])))\n\n return list(ret)\n\n def twoSum(self, nums, i, target):\n ret = []\n l = i\n r = len(nums) - 1\n\n while l < r:\n # print(l, r, ret)\n if nums[l] + nums[r] == target:\n ret.append((l, r))\n l += 1\n while l + 1 < len(nums) and nums[l-1] == nums[l]:\n l += 1\n elif nums[l] + nums[r] < target:\n l += 1\n elif nums[l] + nums[r] > target:\n r -= 1\n\n return ret","runtime":"1623"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n ans = []\n nums.sort()\n \n for i in range(0, len(nums)-2):\n if i >0 and nums[i]==nums[i-1]:\n continue\n l = i+1\n r = len(nums)-1\n\n while(l<r):\n if l>i+1 and nums[l]==nums[l-1]:\n l+=1\n continue\n\n if r<len(nums)-2 and nums[r]==nums[r+1]:\n r-=1\n continue\n\n if nums[i]+nums[l]+nums[r]==0:\n ans.append([nums[i], nums[l], nums[r]])\n l+=1\n r-=1\n elif nums[i]+nums[l]+nums[r]<0:\n l+=1\n else:\n r-=1\n return ans","runtime":"1623"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n result = set()\n\n for i in range(len(nums) - 2):\n left = i + 1\n right = len(nums) - 1\n \n while left < right:\n current_sum = nums[i] + nums[left] + nums[right]\n\n if current_sum < 0:\n left += 1\n elif current_sum > 0:\n right -= 1\n else:\n result.add((nums[i], nums[left], nums[right]))\n left += 1\n right -= 1\n \n return list(result)","runtime":"1648"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n if len(nums) < 3:\n return []\n\n resSet = set()\n nums.sort()\n\n def twoSum(curr):\n r = len(nums) - 1\n l = curr + 1\n \n while l < r:\n currSum = nums[curr] + nums[l] + nums[r]\n \n if currSum == 0:\n resSet.add((nums[curr],nums[l],nums[r]))\n r -= 1\n l += 1\n elif currSum > 0:\n r -= 1\n else:\n l += 1\n \n for i in range(0, len(nums), 1):\n if i == len(nums) - 3:\n if nums[i] + nums[i + 1] + nums[i + 2] == 0:\n resSet.add((nums[i],nums[i + 1],nums[i + 2]))\n break\n else:\n twoSum(i)\n\n return [val for val in resSet]\n","runtime":"1648"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n l=set()\n for i in range(len(nums)-2):\n if i > 0 and nums[i-1] == nums[i]: #suppose -3,-3,1,2 target is 0 there wull [-3,1,2],[-3,1,2] so -3 is only started with one.\n continue\n ###########Now we have to do two sum\n j=i+1\n k=len(nums)-1\n #target=-nums[i]\n while(j<k):\n threesum = nums[j]+nums[k]+nums[i]\n if threesum < 0:\n #if nums[j]+nums[k]<target:\n j+=1\n elif threesum > 0:\n #elif nums[j]+nums[k]>target:\n k-=1\n else:\n l.add((nums[i],nums[j],nums[k]))\n j+=1\n k-=1\n return list(l) \n \n \n ","runtime":"1673"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n\n nums.sort()\n ans = []\n unique = set()\n\n for i in range(len(nums) - 2):\n target = nums[i]\n l, r = i + 1, len(nums) - 1\n while l < r:\n two_sum = nums[l] + nums[r]\n if two_sum == -target:\n single_ans = (target, nums[l], nums[r])\n if single_ans not in unique:\n ans.append(single_ans)\n unique.add(single_ans)\n l += 1\n r -= 1\n elif two_sum < -target:\n l += 1\n elif two_sum > -target:\n r -= 1\n return ans\n\n\n ","runtime":"1673"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[int]:\n # want a + b + c = 0\n n = len(nums)\n nums.sort()\n ans = set()\n for idx in range(0, n - 2):\n a = nums[idx]\n b_idx = idx + 1 # next idx\n c_idx = n - 1 # last idx\n while b_idx < c_idx:\n b, c = nums[b_idx], nums[c_idx]\n sum_abc = a + b + c\n if sum_abc == 0:\n ans.add((a, b, c)) # always sorted\n\n # We need to update both indexes\n b_idx += 1 # updating only b_idx means duplicating search for -(a + c)\n c_idx -= 1 # updating only c_idx means duplicating search for -(a + b)\n elif sum_abc > 0:\n c_idx -= 1 # make sum smaller\n else:\n b_idx += 1 # make sum greater\n return ans\n","runtime":"1697"},{"code":"class Solution: #3\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n ans_set = set()\n for i in range(len(nums)):\n l = i + 1\n r = len(nums) - 1\n target = -nums[i]\n while l < r:\n if nums[l] + nums[r] == target:\n ans_set.add((nums[i], nums[l], nums[r]))\n l += 1\n r -= 1\n elif nums[l] + nums[r] < target:\n l += 1\n elif nums[l] + nums[r] > target:\n r -= 1\n return list(ans_set)\n\n\n ","runtime":"1697"},{"code":"from typing import List\n\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n #nums.sort() # Sort the array to handle duplicates more easily\n res = set() # Set to store unique triplets\n\n if sum(nums)==0:\n if len(set(nums))==1:\n l=[[0,0,0]]\n return l\n \n for i in range(len(nums)):\n # Use a set to track the complements\n complements = set()\n for j in range(i + 1, len(nums)):\n third = -(nums[i] + nums[j])\n if third in complements:\n # We have found a valid triplet\n res.add(tuple(sorted((nums[i], nums[j], third))))\n complements.add(nums[j])\n \n # Convert the set of tuples back to a list of lists\n return [list(triplet) for triplet in res]","runtime":"1722"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = []\n nums.sort()\n s = set()\n for i in range( len(nums)-2):\n j = i+1\n k = len(nums)-1\n while j < k:\n if nums[i] > 0:\n break\n if nums[i] + nums[j] + nums[k] == 0:\n if (nums[i],nums[j],nums[k]) not in s:\n res.append([nums[i],nums[j],nums[k]])\n s.add((nums[i],nums[j],nums[k]))\n j += 1\n k -= 1\n elif nums[i] + nums[j] + nums[k] > 0:\n k -= 1\n else:\n j += 1\n return res\n","runtime":"1722"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n result = set()\n l = len(nums)\n\n for i in range(l-2):\n j = i+1\n k = l-1\n while j < k:\n if nums[i] + nums[j] + nums[k] > 0:\n k -= 1\n elif nums[i] + nums[j] + nums[k] < 0:\n j += 1\n else:\n result.add((nums[i],nums[j],nums[k]))\n j += 1\n k -= 1\n\n return result\n \n\n\n","runtime":"1747"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n result = []\n nums.sort()\n\n\n for idx, value in enumerate(nums):\n\n left = idx + 1 \n right = len(nums) - 1 \n\n while left < right:\n total = nums[idx] + nums[left] + nums[right]\n\n if total == 0:\n res = (nums[idx], nums[left], nums[right])\n result.append(res)\n \n left += 1 \n right -= 1 \n \n elif total < 0:\n left += 1 \n elif total > 0:\n right -= 1 \n \n return set(result) \n ","runtime":"1747"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n triplets = set()\n nums = sorted(nums)\n for i in range(len(nums)):\n j = i + 1\n k = len(nums) - 1\n\n while j < k:\n sm = nums[i] + nums[j] + nums[k]\n\n if sm == 0:\n triplets.add((nums[i], nums[j], nums[k]))\n j += 1\n k -= 1\n elif sm < 0:\n j += 1\n else:\n k -= 1\n \n result = list(triplets)\n\n return result","runtime":"1772"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums = sorted(nums)\n ret= set()\n for i in range(len(nums)):\n first = nums[i]\n start_p = i + 1\n end_p = len(nums)-1\n while start_p < end_p:\n second = nums[start_p]\n third = nums[end_p]\n if first + second + third == 0:\n ret.add((first, second, third))\n start_p += 1\n end_p -= 1\n elif first + second + third < 0:\n start_p += 1\n elif first + second + third > 0:\n end_p -= 1\n return ret\n \n\n","runtime":"1772"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n if len(nums)<3:\n return []\n\n nums.sort()\n ans = set()\n\n for i in range(len(nums)-2):\n j,k=i+1,len(nums)-1\n while j<k:\n if nums[j]+nums[k]+nums[i]==0:\n if (nums[i],nums[j],nums[k]) not in ans:\n ans.add((nums[i],nums[j],nums[k]))\n j+=1\n k-=1\n elif nums[j]+nums[k]+nums[i]>0:\n k-=1\n else:\n j+=1\n return ans\n \n\n ","runtime":"1797"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n res = set()\n for k in range(len(nums) - 2):\n l = k+1\n r = len(nums) - 1\n while r > l:\n sum_ij = nums[l] + nums[r]\n if sum_ij == -1 * nums[k]:\n res.add((nums[k], nums[l], nums[r]))\n l += 1\n r -= 1\n elif sum_ij > -1 * nums[k]:\n r -= 1\n else:\n l += 1\n return res \n","runtime":"1797"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n res = set()\n\n for i, val in enumerate(nums):\n target = 0 - val\n l, r = i+1, len(nums)-1 # two pointers\n while l < r:\n amt = nums[l] + nums[r]\n if amt < target:\n l += 1\n elif amt > target:\n r -= 1\n else:\n res.add((val, nums[l], nums[r]))\n l += 1\n \n # I think there's something smart to do with this\n # while nums[l] == nums[l-1]:\n # l += 1\n # while nums[r] == nums[r]\n return list(res)","runtime":"1821"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n result = []\n first = {}\n for i in range(len(nums)-2):\n if nums[i] in first:\n continue\n seen = {}\n for j in range(i + 1, len(nums)):\n if nums[j] in seen and seen[nums[j]] > 1:\n continue\n if j > i + 1:\n target = 0 - (nums[i] + nums[j])\n if target in seen and nums[j] not in seen or (target in seen and nums[j] == target and seen[target] == 1):\n result.append([nums[i], target, nums[j]])\n seen[nums[j]] = 1 if nums[j] not in seen else seen[nums[j]] + 1\n else:\n seen[nums[j]] = 1\n \n first[nums[i]] = 1\n \n return result\n","runtime":"1821"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums = sorted(nums)\n res = set()\n for i in range(len(nums)):\n if nums[i] > 0:\n break\n target = -nums[i]\n l = i + 1\n r = len(nums) - 1\n while l < r:\n if nums[l] + nums[r] == target:\n res.add((nums[i], nums[l], nums[r]))\n l += 1\n elif nums[l] + nums[r] > target:\n r -= 1\n else:\n l += 1\n return [list(item) for item in list(res)]","runtime":"1846"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n import ast\n def convert_to_list(triples):\n if len(triples) == 0:\n return []\n return [ast.literal_eval(t) for t in triples]\n\n pos = {}\n if len(nums) < 2:\n return []\n unique_values = list(set(nums))\n if len(unique_values) == 1 and len(nums) >= 3 and nums.count(0) >= 1:\n return [[0,0,0]]\n nums.sort()\n for i in range(len(nums)):\n j = i + 1\n k = len(nums) - 1\n while j < k:\n n_1 = nums[i]\n n_2 = nums[j]\n n_3 = nums[k]\n sum_n = n_1 + n_2 + n_3\n if sum_n == 0:\n t_l = [n_1,n_2,n_3]\n pos[str(t_l)] = 1\n j += 1\n k -= 1\n elif sum_n < 0:\n j += 1\n else:\n k -= 1\n return convert_to_list(pos.keys())\n\n","runtime":"1846"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n res = set()\n\n for i in range(len(nums)):\n l = i + 1\n r = len(nums) - 1\n while l < r:\n if nums[i] + nums[l] + nums[r] == 0:\n res.add(tuple((nums[i], nums[l], nums[r])))\n l += 1\n r -= 1\n elif nums[i] + nums[l] + nums[r] < 0:\n l += 1\n else:\n r -= 1\n return list(res)\n\n # Time: O(n2)\n # Space: O(n)","runtime":"1871"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n \n nums.sort()\n ans = set()\n\n for i in range(len(nums) - 2):\n left, right = i+1, len(nums) - 1\n\n while left < right:\n if nums[left] + nums[right] + nums[i] == 0:\n ans.add((nums[left], nums[right], nums[i]))\n left += 1\n right -= 1\n elif nums[left] + nums[right] + nums[i] < 0:\n left += 1\n else:\n right -= 1\n \n return ans","runtime":"1871"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n result = set()\n nums.sort()\n print(nums)\n for i in range(len(nums)):\n a = nums[i]\n #print(i,a)\n if a > 0:\n #print(a)\n return [list(t) for t in result]\n \n p_left = i+1\n p_right = len(nums)-1\n\n while p_left < p_right:\n b = nums[p_left]\n c = nums[p_right]\n #print(a,b,c)\n if a+b+c == 0:\n #print(a,b,c)\n result.add((a,b,c))\n p_left += 1\n elif a+b+c > 0:\n p_right -= 1\n else:\n p_left += 1\n \n #print(result)\n return [list(t) for t in result]\n\n\n ","runtime":"1896"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n d = {}\n for x in nums:\n if x not in d:\n d[x] = 1\n else:\n d[x]+=1\n has_zeros = 0 in d\n nums.sort()\n x = [0,1,2]\n ret = []\n i = 0\n seen = set()\n if has_zeros and d[0] >= 3: ret.append([0,0,0])\n if nums[-1] <= 0: return ret\n while i < len(nums) and nums[i] < 0:\n j = 1\n while i+j < len(nums):# and nums[i] + nums[i+j] < 0:\n rem = nums[i] + nums[i+j]\n if -rem in d and ((-rem!=nums[i] and -rem!=nums[i+j]) or d[-rem]>1):\n l = [-rem,nums[i],nums[i+j]]\n l.sort()\n l_str = str(l)\n if l_str not in seen:\n ret.append(l)\n seen.add(l_str)\n j+=1\n i+=1\n\n return ret","runtime":"1896"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums = sorted(nums)\n n = len(nums)\n result = set()\n\n for i in range(n):\n target = -nums[i]\n \n left = i + 1\n right = n - 1\n\n while left < right:\n cur_sum = nums[left] + nums[right]\n \n if cur_sum == target:\n result.add((nums[left], nums[right], nums[i]))\n \n if cur_sum > target:\n right -= 1\n else:\n left += 1\n\n return result\n\n","runtime":"1921"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n data = set()\n nums.sort()\n\n for i in range(len(nums)-2):\n if nums[i] > 0:\n break\n\n x = i+1\n y = len(nums) - 1\n\n while x < y:\n result = nums[i] + nums[x] + nums[y]\n if result == 0:\n data.add((nums[i], nums[x], nums[y]))\n x += 1\n elif result > 0:\n y -= 1\n else:\n x +=1\n \n return data\n","runtime":"1921"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n if len(nums)==3 and sum(nums)==0:\n return [nums]\n nums.sort()\n ans = set()\n for i in range(len(nums)-2):\n j, k = i+1, len(nums)-1\n while j<k:\n if nums[j] + nums[k] > -nums[i]:\n k -= 1\n elif nums[j] + nums[k] < -nums[i]:\n j += 1\n else:\n ans.add(tuple([nums[i], nums[j], nums[k]]))\n j+=1\n k-=1 \n return ans\n\n\n","runtime":"1945"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n\n # error1: miss while left < right\n # First .sort(). Then, for each nums[i], find combinations in the rest of nums by \n # if nums[i] + nums[left] + nums[right] > 0: right -= 1; if nums[i] + nums[left] + nums[right] < 0: left += 1; \n # T: O(n**2)\n # S: O(n)\n\n nums.sort()\n ans_set = set()\n for i in range(len(nums)-2):\n left, right = i+1, len(nums)-1\n while left < right:\n if nums[i] + nums[left] + nums[right] == 0:\n ans_set.add((nums[i], nums[left], nums[right]))\n left += 1\n right -= 1\n elif nums[i] + nums[left] + nums[right] > 0:\n right -= 1\n elif nums[i] + nums[left] + nums[right] < 0:\n left += 1\n return list(ans_set)\n\n\n\n\n\n\n\n \n\n \n\n\n\n ","runtime":"1945"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n n = len(nums) - 2\n result = set()\n\n for i in range(n):\n num = nums[i]\n\n left = i + 1\n right = len(nums) - 1\n\n while left < right:\n curr_num = num + nums[left] + nums[right]\n if curr_num == 0:\n arr = (num, nums[left], nums[right])\n result.add(arr)\n left += 1\n elif curr_num < 0:\n left += 1\n else:\n right -= 1\n\n return [list(item) for item in result]","runtime":"1970"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n \n nums.sort()\n result = set()\n\n for i in range(len(nums) - 2):\n \n j, k = i + 1, len(nums) - 1\n \n while j < k:\n\n ss = nums[i] + nums[j] + nums[k]\n triplet = (nums[i],nums[j],nums[k])\n\n if ss == 0:\n result.add(triplet)\n j, k = j + 1, k - 1\n \n elif ss < 0:\n j += 1\n \n else:\n k -= 1\n \n return list(result)","runtime":"1970"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n '''\n if list(set(nums)) == [0]:\n out=[0,0,0]\n return [out]\n '''\n count = dict(collections.Counter(nums))\n nums = []\n for k, v in count.items():\n if v >3:\n for _ in range(3):\n nums.append(k)\n else:\n for _ in range(v):\n nums.append(k)\n\n n = len(nums)\n nums.sort()\n output = []\n visited = [False] * n\n for i in range(n): \n temp = nums[i]\n left = 0\n right = n - 1\n\n while left < right: \n if right == i:\n right-=1\n if left == i:\n left += 1\n\n if left != -1:\n two_sum = nums[left] + nums[right] \n if two_sum == -temp:\n if left != right != i:\n # and \\\n #visited[left]* visited[right]* visited[i]==0:\n output.append([nums[left], nums[right], nums[i]]) \n #visited[left], visited[right], visited[i] = True, True, True\n right -=1\n elif two_sum > -temp:\n right -=1\n elif two_sum < -temp:\n left +=1 \n # filter_unique:\n \n hash_map = {}\n for o in output:\n _x = o\n _x.sort() \n if hash_map.get(str(_x), None) == None:\n hash_map[str(_x)] = o\n \n return list(hash_map.values())\n \n #return output\n '''\n ## input = arrays\n ## output = three combos to be equal to 0\n #nums.sort()\n\n left = 0\n right = len(nums) - 1\n \n temp = 0\n\n output = []\n \n for i in range(len(nums)): \n for j in range(len(nums)):\n for k in range(len(nums)):\n if nums[i] + nums[j] + nums[k] == 0:\n if i!=j and i!=k and j!=k:\n temp = [nums[i],nums[j],nums[k]]\n temp.sort()\n if temp not in output:\n output.append(temp)\n\n return output\n '''","runtime":"1995"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n\n # error1: miss while left < right\n # First .sort(). Then, for each nums[i], find combinations in the rest of nums by \n # if nums[i] + nums[left] + nums[right] > 0: right -= 1; if nums[i] + nums[left] + nums[right] < 0: left += 1; \n # T: O(n^2)\n # S: O(n)\n\n nums.sort()\n ans_set = set()\n\n left, right = 0, 0\n for i in range(len(nums)-2):\n left, right = i + 1, len(nums)-1\n while left < right:\n if nums[i] + nums[left] + nums[right] == 0:\n ans_set.add((nums[i], nums[left], nums[right]))\n left += 1\n right -= 1 \n elif nums[i] + nums[left] + nums[right] > 0:\n right -= 1\n elif nums[i] + nums[left] + nums[right] < 0:\n left += 1\n \n return list(ans_set)\n \n\n \n\n\n\n ","runtime":"1995"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n visited = set()\n res = []\n\n for i in range(len(nums)):\n if nums[i] in visited:\n continue\n visited.add(nums[i])\n l = i + 1\n r = len(nums) - 1\n\n while l < r:\n x = nums[i]\n y = nums[l]\n z = nums[r]\n\n if x + y + z == 0:\n res.append([x, y, z])\n r = bisect.bisect_left(nums, z) - 1\n l = bisect.bisect_right(nums, y)\n elif x + y + z > 0:\n r = bisect.bisect_left(nums, z) - 1\n else:\n l = bisect.bisect_right(nums, y)\n\n return res\n \n\n\n","runtime":"2020"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n\n ans = set()\n for i in range(len(nums) - 2):\n # print(nums[index])\n target = -1 * nums[i]\n seen = set()\n \n for j in range(i + 1, len(nums)):\n # print(j, nums[j])\n current_target = target - nums[j]\n if current_target in seen:\n ans.add((nums[i], current_target, nums[j]))\n \n seen.add(nums[j])\n\n return ans\n\n","runtime":"2020"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n\n # error1: miss while left < right\n # First .sort(). Then, for each nums[i], find combinations in the rest of nums by \n # if nums[i] + nums[left] + nums[right] > 0: right -= 1; if nums[i] + nums[left] + nums[right] < 0: left += 1; \n # T: O(n**2)\n # S: O(n)\n\n nums.sort()\n ans_set = set()\n for i in range(len(nums)-2):\n left, right = i+1, len(nums)-1\n while left < right:\n if nums[i] + nums[left] + nums[right] == 0:\n ans_set.add((nums[i], nums[left], nums[right]))\n left += 1\n right -= 1\n elif nums[i] + nums[left] + nums[right] > 0:\n right -= 1\n elif nums[i] + nums[left] + nums[right] < 0:\n left += 1\n return list(ans_set)\n\n\n\n\n\n\n\n \n\n \n\n\n\n ","runtime":"2045"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n nums.sort()\n res = set()\n\n prevI = None\n for i in range(n):\n if prevI == nums[i]:\n continue\n j = i + 1\n k = n - 1\n # print(i,j,k,n)\n while j < k:\n s = nums[i] + nums[j] + nums[k]\n if s == 0:\n res.add((nums[i], nums[j], nums[k]))\n j += 1\n elif s < 0:\n j += 1\n else:\n k -= 1\n return res","runtime":"2045"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n\n res = set()\n\n for i, num in enumerate(nums):\n l, r = i+1, len(nums)-1\n while l < r:\n this_sum = num + nums[l] + nums[r]\n if this_sum > 0:\n r -= 1\n elif this_sum < 0:\n l += 1\n else:\n res.add((num, nums[l], nums[r]))\n l += 1\n return list(list(s) for s in res)\n\n\n","runtime":"2069"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n ans=set()\n nums.sort()\n n=len(nums)\n for i in range(n-2):\n j=i+1\n k=n-1\n while j<k:\n temp=nums[i]+nums[j]+nums[k]\n if temp==0:\n ans.add((nums[i],nums[j],nums[k]))\n j+=1\n elif temp>0:\n k-=1\n else:\n j+=1\n return ans","runtime":"2069"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n triplets = set()\n nums.sort()\n for i in range(len(nums)):\n l = i+1\n r = len(nums) - 1\n while l < r:\n add = nums[i] + nums[l] + nums[r]\n if add == 0 and (nums[i], nums[l], nums[r]) not in triplets:\n triplets.add((nums[i], nums[l], nums[r]))\n\n if add >= 0:\n r -= 1\n else:\n l += 1\n return [list(tup) for tup in triplets]","runtime":"2094"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n trip_list = []\n for i in range(len(nums)):\n left, right = i+1, len(nums)-1\n while left < right:\n if nums[i] + nums[left] + nums[right] == 0:\n trip_list.append((nums[i], nums[left], nums[right]))\n left += 1\n right -= 1\n elif nums[i] + nums[left] + nums[right] > 0:\n right -= 1\n elif nums[i] + nums[left] + nums[right] < 0:\n left += 1\n \n return list(set(trip_list))\n ","runtime":"2094"}],"string":"[\n {\n \"code\": \"def threeSum(nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n index = 1\\n x = nums[0]\\n counter = 1\\n while index < len(nums):\\n if nums[index] == x:\\n counter = counter + 1\\n if x == 0:\\n if counter > 3:\\n nums.pop(index)\\n else:\\n index = index + 1\\n elif counter > 2:\\n nums.pop(index)\\n else:\\n index = index + 1\\n else:\\n x = nums[index]\\n counter = 1\\n index = index + 1\\n if(not all(n>0 for n in nums)):\\n counts = Counter(nums)\\n result = [[0,0,0]] if counts[0] >= 3 else []\\n nums =[i for i in sorted(counts) if i!=0]\\n if counts[0]>0:\\n for i in nums:\\n if i>0:\\n break\\n if -i in counts:\\n result.append([-i , 0 , i])\\n for i in nums:\\n if i & 1:\\n continue\\n remaining = -i >> 1\\n if counts[remaining] >= 2:\\n result.append([i, remaining, remaining])\\n for i, n in enumerate(nums):\\n kk = -(nums[0] + n)\\n if kk < n:\\n break\\n j = bisect_right(nums, -n << 1) if n < 0 else i + 1\\n k = bisect_right(nums, kk)\\n for right in nums[j:k]:\\n left = -(n + right)\\n if left in counts:\\n result.append([left, n, right])\\n del counts , nums\\n return result\\n else:\\n return []\\n\\nopen('user.out', 'w').write(\\\"\\\".join(str(threeSum(loads(line))) + \\\"\\\\n\\\" for line in stdin))\\nexit()\",\n \"runtime\": \"135\"\n },\n {\n \"code\": \"def threeSum(nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n index = 1\\n x = nums[0]\\n counter = 1\\n while index < len(nums):\\n if nums[index] == x:\\n counter = counter + 1\\n if x == 0:\\n if counter > 3:\\n nums.pop(index)\\n else:\\n index = index + 1\\n elif counter > 2:\\n nums.pop(index)\\n else:\\n index = index + 1\\n else:\\n x = nums[index]\\n counter = 1\\n index = index + 1\\n if(not all(n>0 for n in nums)):\\n counts = Counter(nums)\\n result = [[0,0,0]] if counts[0] >= 3 else []\\n nums =[i for i in sorted(counts) if i!=0]\\n if counts[0]>0:\\n for i in nums:\\n if i>0:\\n break\\n if -i in counts:\\n result.append([-i , 0 , i])\\n for i in nums:\\n if i & 1:\\n continue\\n remaining = -i >> 1\\n if counts[remaining] >= 2:\\n result.append([i, remaining, remaining])\\n for i, n in enumerate(nums):\\n kk = -(nums[0] + n)\\n if kk < n:\\n break\\n j = bisect_right(nums, -n << 1) if n < 0 else i + 1\\n k = bisect_right(nums, kk)\\n for right in nums[j:k]:\\n left = -(n + right)\\n if left in counts:\\n result.append([left, n, right])\\n del counts , nums\\n return result\\n else:\\n return []\\n\\nopen('user.out', 'w').write(\\\"\\\".join(str(threeSum(loads(line))) + \\\"\\\\n\\\" for line in stdin))\\nexit()\",\n \"runtime\": \"135\"\n },\n {\n \"code\": \"def threeSum(nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n index = 1\\n x = nums[0]\\n counter = 1\\n while index < len(nums):\\n if nums[index] == x:\\n counter = counter + 1\\n if x == 0:\\n if counter > 3:\\n nums.pop(index)\\n else:\\n index = index + 1\\n elif counter > 2:\\n nums.pop(index)\\n else:\\n index = index + 1\\n else:\\n x = nums[index]\\n counter = 1\\n index = index + 1\\n if(not all(n>0 for n in nums)):\\n counts = Counter(nums)\\n result = [[0,0,0]] if counts[0] >= 3 else []\\n nums =[i for i in sorted(counts) if i!=0]\\n if counts[0]>0:\\n for i in nums:\\n if i>0:\\n break\\n if -i in counts:\\n result.append([-i , 0 , i])\\n for i in nums:\\n if i & 1:\\n continue\\n remaining = -i >> 1\\n if counts[remaining] >= 2:\\n result.append([i, remaining, remaining])\\n for i, n in enumerate(nums):\\n kk = -(nums[0] + n)\\n if kk < n:\\n break\\n j = bisect_right(nums, -n << 1) if n < 0 else i + 1\\n k = bisect_right(nums, kk)\\n for right in nums[j:k]:\\n left = -(n + right)\\n if left in counts:\\n result.append([left, n, right])\\n del counts , nums\\n return result\\n else:\\n return []\\n\\nopen('user.out', 'w').write(\\\"\\\".join(str(threeSum(loads(line))) + \\\"\\\\n\\\" for line in stdin))\\nexit()\",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) < 3:\\n return []\\n freq = {}\\n # fnums = []\\n left=set()\\n right=set()\\n for i in nums:\\n if i in freq:\\n freq[i] += 1\\n else:\\n freq[i] = 1\\n # fnums.append(i)\\n \\n for i in set(nums):\\n if i <= 0:\\n left.add(i)\\n else:\\n right.add(i)\\n\\n # fnums.sort()\\n if 0 in left:\\n left.remove(0)\\n left = sorted(left)\\n right= sorted(right,reverse=True)\\n \\n sols = []\\n if 0 in freq:\\n if freq[0] > 2:\\n sols.append([0,0,0])\\n for iv in left:\\n if -iv in freq:\\n sols.append((iv,0,-iv))\\n freq.pop(0)\\n for fn in left:\\n if fn % 2 == 0 and -fn/2 in freq and freq[-fn/2] >= 2:\\n sols.append( [fn, int(-fn/2), int(-fn/2)])\\n for fn in right:\\n if fn % 2 == 0 and -fn/2 in freq and freq[-fn/2] >= 2:\\n sols.append( [fn, int(-fn/2), int(-fn/2)])\\n\\n i = 0\\n\\n for iv in left:\\n # j = len(fnums) - 1\\n # iv = fnums[i]\\n # jv = fnums[j]\\n it2 = -iv\\n c = int(math.floor(it2/2.0))\\n i2 = it2*2\\n \\n for jv in right.copy():\\n if jv <=c:\\n break\\n if jv >= i2:\\n right.remove(jv)\\n elif it2-jv in freq:\\n a = (jv, it2-jv, iv)\\n sols.append(a)\\n \\n return sols\",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) < 3:\\n return []\\n freq = {}\\n # fnums = []\\n left=set()\\n right=set()\\n for i in nums:\\n if i in freq:\\n freq[i] += 1\\n else:\\n freq[i] = 1\\n # fnums.append(i)\\n \\n for i in set(nums):\\n if i <= 0:\\n left.add(i)\\n else:\\n right.add(i)\\n\\n # fnums.sort()\\n if 0 in left:\\n left.remove(0)\\n left = sorted(left)\\n right= sorted(right,reverse=True)\\n \\n sols = []\\n if 0 in freq:\\n if freq[0] > 2:\\n sols.append([0,0,0])\\n for iv in left:\\n if -iv in freq:\\n sols.append((iv,0,-iv))\\n freq.pop(0)\\n for fn in left:\\n if fn % 2 == 0 and -fn/2 in freq and freq[-fn/2] >= 2:\\n sols.append( [fn, int(-fn/2), int(-fn/2)])\\n for fn in right:\\n if fn % 2 == 0 and -fn/2 in freq and freq[-fn/2] >= 2:\\n sols.append( [fn, int(-fn/2), int(-fn/2)])\\n\\n i = 0\\n\\n for iv in left:\\n # j = len(fnums) - 1\\n # iv = fnums[i]\\n # jv = fnums[j]\\n it2 = -iv\\n c = int(math.floor(it2/2.0))\\n i2 = it2*2\\n \\n for jv in right.copy():\\n if jv <=c:\\n break\\n if jv >= i2:\\n right.remove(jv)\\n elif it2-jv in freq:\\n a = (jv, it2-jv, iv)\\n sols.append(a)\\n \\n return sols\",\n \"runtime\": \"185\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) < 3:\\n return []\\n freq = {}\\n left=set()\\n right=set()\\n for i in nums:\\n if i in freq:\\n freq[i] += 1\\n else:\\n freq[i] = 1\\n \\n for i in set(nums):\\n if i < 0:\\n left.add(i)\\n else:\\n right.add(i)\\n\\n left = sorted(left)\\n right= sorted(right,reverse=True)\\n \\n sols = []\\n if 0 in freq:\\n if freq[0] > 2:\\n sols.append([0,0,0])\\n for iv in left:\\n if -iv in freq:\\n sols.append((iv,0,-iv))\\n freq.pop(0)\\n for fn in left:\\n if fn % 2 == 0 and -fn/2 in freq and freq[-fn/2] >= 2:\\n sols.append( [fn, int(-fn/2), int(-fn/2)])\\n for fn in right:\\n if fn % 2 == 0 and -fn/2 in freq and freq[-fn/2] >= 2:\\n sols.append( [fn, int(-fn/2), int(-fn/2)])\\n\\n i = 0\\n\\n for iv in left:\\n it2 = -iv\\n c = int(math.floor(it2/2.0))\\n i2 = it2*2\\n \\n for jv in right.copy():\\n if jv <=c:\\n break\\n if jv >= i2:\\n right.remove(jv)\\n elif it2-jv in freq:\\n a = (jv, it2-jv, iv)\\n sols.append(a)\\n \\n return sols\",\n \"runtime\": \"185\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n c = Counter(nums)\\n\\n res = [[0, 0, 0]] if c[0] > 2 else []\\n numSet = sorted(c)\\n del c[0]\\n\\n if not numSet or numSet[0] > 0 or numSet[-1] < 0:\\n return res\\n \\n for n in numSet:\\n if n % 2 == 0 and c[-n//2] > 1:\\n res.append([-n//2, -n//2, n])\\n \\n pos = set(-i for i in takewhile(lambda x : x > 0, reversed(numSet)))\\n\\n maxN = numSet[-1]\\n for i, x in takewhile(lambda x : x[1] < 0, enumerate(numSet)):\\n while i > 0 and x == numSet[i - 1]:\\n continue\\n left = bisect_left(numSet, -maxN - x, i + 1)\\n right = bisect_right(numSet, (-x-1)//2, left)\\n for y in islice(numSet, left, right):\\n if x + y in pos:\\n res.append([x, y, -x-y])\\n \\n return res\",\n \"runtime\": \"209\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n index = 1\\n x = nums[0]\\n counter = 1\\n while index < len(nums):\\n if nums[index] == x:\\n counter = counter + 1\\n if x == 0:\\n if counter > 3:\\n nums.pop(index)\\n else:\\n index = index + 1\\n elif counter > 2:\\n nums.pop(index)\\n else:\\n index = index + 1\\n else:\\n x = nums[index]\\n counter = 1\\n index = index + 1\\n if(not all(n>0 for n in nums)):\\n counts = Counter(nums)\\n result = [[0,0,0]] if counts[0] >= 3 else []\\n nums =[i for i in sorted(counts) if i!=0]\\n if counts[0]>0:\\n for i in nums:\\n if i>0:\\n break\\n if -i in counts:\\n result.append([-i , 0 , i])\\n for i in nums:\\n if i & 1:\\n continue\\n remaining = -i >> 1\\n if counts[remaining] >= 2:\\n result.append([i, remaining, remaining])\\n for i, n in enumerate(nums):\\n kk = -(nums[0] + n)\\n if kk < n:\\n break\\n j = bisect_right(nums, -n << 1) if n < 0 else i + 1\\n k = bisect_right(nums, kk)\\n for right in nums[j:k]:\\n left = -(n + right)\\n if left in counts:\\n result.append([left, n, right])\\n del counts , nums\\n return result\\n else:\\n return []\\n\\n \",\n \"runtime\": \"209\"\n },\n {\n \"code\": \"class Solution:\\n def counter(self, nums: list, sign: int, targets: set, max_target: int) -> int:\\n n = len(nums)\\n a = -1\\n for i in range(n-1):\\n if nums[i] == a: continue\\n a = nums[i]\\n if a > max_target // 2: break\\n b = -1\\n for j in range(i+1, n):\\n if nums[j] == b: continue\\n b = nums[j]\\n c = a + b\\n if c > max_target: break\\n if c in targets: self.rs.append([sign*a, sign*b, -sign*c])\\n\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n pos_nums = [num for num in nums if num >= 0]\\n neg_nums = [-num for num in nums if num < 0]\\n\\n pos_nums.sort()\\n neg_nums.sort()\\n\\n self.rs = []\\n if len(pos_nums) and len(neg_nums):\\n self.counter(pos_nums, 1, set(neg_nums), neg_nums[-1])\\n self.counter(neg_nums, -1, set(pos_nums), pos_nums[-1])\\n if len(pos_nums) > 2 and pos_nums[2] == 0: self.rs.append([0, 0, 0])\\n \\n return self.rs \",\n \"runtime\": \"234\"\n },\n {\n \"code\": \"class Solution:\\n def helper(self, seek_list, query_set, max_val, sign):\\n res = []\\n prev_a = -1\\n for i, a in enumerate(seek_list):\\n if a == prev_a: continue\\n prev_a = a\\n prev_b = -1\\n if a > max_val // 2: break\\n for b in seek_list[i+1:]:\\n if b == prev_b: continue\\n prev_b = b\\n if a + b > max_val: break\\n if a + b in query_set: res.append([sign * a, sign * b, - sign * (a + b)])\\n return res\\n\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n noneg = [el for el in nums if el >= 0]\\n invneg = [-el for el in nums if el < 0]\\n noneg = sorted(noneg)\\n invneg = sorted(invneg)\\n rs = []\\n if len(noneg) and len(invneg):\\n rs = self.helper(noneg, set(invneg), invneg[-1], sign=1)\\n rs += self.helper(invneg, set(noneg), noneg[-1], sign=-1)\\n\\n if len(noneg) > 2 and noneg[2] == 0: rs.append([0, 0, 0])\\n return rs \",\n \"runtime\": \"234\"\n },\n {\n \"code\": \"class Solution:\\n def counter(self, nums: list, sign: int, targets: set, max_target: int) -> int:\\n n = len(nums)\\n a = -1\\n for i in range(n-1):\\n if nums[i] == a: continue\\n a = nums[i]\\n if a > max_target // 2: break\\n b = -1\\n for j in range(i+1, n):\\n if nums[j] == b: continue\\n b = nums[j]\\n c = a + b\\n if c > max_target: break\\n if c in targets: self.rs.append([sign*a, sign*b, -sign*c])\\n\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n pos_nums = [num for num in nums if num >= 0]\\n neg_nums = [-num for num in nums if num < 0]\\n\\n pos_nums.sort()\\n neg_nums.sort()\\n\\n self.rs = []\\n if len(pos_nums) and len(neg_nums):\\n self.counter(pos_nums, 1, set(neg_nums), neg_nums[-1])\\n self.counter(neg_nums, -1, set(pos_nums), pos_nums[-1])\\n if len(pos_nums) > 2 and pos_nums[2] == 0: self.rs.append([0, 0, 0])\\n \\n return self.rs \",\n \"runtime\": \"259\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, v: List[int]) -> List[List[int]]:\\n c=Counter(v);p,r,b=sorted(c),c[0]>=3 and set([(0,0,0)])or set(),bisect_left;[(c[a]>1 and -2*a in c and a and r.add((a,a,-2*a)),a<0 and[r.add((a,b,-a-b)) for b in p[b(p,-p[-1]-a,i+1):b(p,ceil(-a/2),i+1)] if -(a+b) in c])for i,a in enumerate(p)];return r\\n\",\n \"runtime\": \"259\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n num_map = defaultdict(int)\\n for num in nums:\\n num_map[num] += 1\\n nums = sorted(num_map.keys())\\n\\n min_i = 0\\n max_k = len(nums) - 1\\n triplets = []\\n while min_i <= max_k:\\n '''\\n def upper_bound(i):\\n if nums[i] in num_map and num_map[nums[i]] > \\n nums[i]\\n\\n while -nums[min_i] > nums[max_k-1] + nums[max_k] and min_i <= max_k:\\n min_i += 1\\n while -nums[max_k] < nums[min_i] + nums[min_i+1] and min_i <= max_k:\\n max_k -= 1\\n # todo cont\\n '''\\n right_sided = -nums[min_i] > nums[max_k]\\n\\n i = min_i\\n k = max_k\\n while i <= k:\\n target = -nums[i] - nums[k]\\n if nums[i] > target or target > nums[k]:\\n break\\n\\n if (target in num_map and\\n num_map[target] > sum([nums[g] == target for g in [i,k]])):\\n triplets.append((nums[i], target, nums[k]))\\n if right_sided:\\n k -= 1\\n else:\\n i += 1\\n\\n if right_sided:\\n min_i += 1\\n else:\\n max_k -= 1\\n return triplets\\n\\n def threeSum2(self, nums: List[int]) -> List[List[int]]:\\n num_map = dict()\\n for num in nums:\\n num_ct = num_map.get(num, 0) + 1\\n num_ct = min(num_ct, 2) if num != 0 else min(num_ct, 3)\\n num_map[num] = num_ct\\n\\n new_nums = []\\n for num, ct in num_map.items():\\n new_nums += ct * [num]\\n nums = sorted(new_nums)\\n\\n min_i = 0\\n max_k = len(nums) - 1\\n trips = []\\n while min_i+1 < max_k:\\n while -nums[min_i] > nums[max_k-1] + nums[max_k] and min_i+2 < max_k:\\n min_i += 1\\n while -nums[max_k] < nums[min_i] + nums[min_i+1] and min_i+2 < max_k:\\n max_k -= 1\\n\\n right_sided = -nums[min_i] > nums[max_k]\\n\\n i = min_i\\n k = max_k\\n target = -nums[i] - nums[k]\\n while i+1 < k and nums[i] <= target and nums[k] >= target:\\n target_ct = 1\\n if target in num_map:\\n if nums[i] == target:\\n target_ct += 1\\n if nums[k] == target:\\n target_ct += 1\\n if num_map[target] >= target_ct:\\n trips.append((nums[i], target, nums[k]))\\n if right_sided:\\n k -= num_map[nums[k]]\\n else:\\n i += num_map[nums[i]]\\n if i+1 < k:\\n target = -nums[i] - nums[k]\\n\\n if right_sided:\\n min_i += num_map[nums[min_i]]\\n else:\\n max_k -= num_map[nums[max_k]]\\n return trips\\n\",\n \"runtime\": \"284\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n poz = set()\\n poz2 = set()\\n neg = set()\\n neg2 = set()\\n count = 0\\n ret = list()\\n for i, v in enumerate(nums):\\n if v > 0:\\n if v in poz2:\\n continue\\n elif v in poz:\\n poz2.add(v)\\n else:\\n poz.add(v)\\n elif v < 0:\\n if v in neg2:\\n continue\\n elif v in neg:\\n neg2.add(v)\\n else:\\n neg.add(v)\\n else:\\n count += 1\\n if count >= 3:\\n ret.append([0, 0, 0])\\n if count > 0:\\n for v in poz:\\n if -v in neg:\\n ret.append([v, 0, -v])\\n for v in poz2:\\n if (-v * 2) in neg:\\n ret.append([v, v, -2 * v])\\n for v in neg2:\\n if (-v * 2) in poz:\\n ret.append([v, v, -2 * v])\\n poz_l = list(poz)\\n for i, v1 in enumerate(poz_l):\\n for v2 in poz_l[i + 1:]:\\n if -(v1 + v2) in neg:\\n ret.append([v1, v2, -(v1 + v2)])\\n neg_l = list(neg)\\n for i, v1 in enumerate(neg_l):\\n for v2 in neg_l[i + 1:]:\\n if -(v1 + v2) in poz:\\n ret.append([v1, v2, -(v1 + v2)])\\n return ret\\n\",\n \"runtime\": \"284\"\n },\n {\n \"code\": \"class Solution:\\n \\n def helper(self, seek_list, query_set, sign):\\n res = []\\n prev_a = -1\\n for i, a in enumerate(seek_list):\\n if a == prev_a:\\n continue\\n prev_b = -1\\n for b in seek_list[i+1:]:\\n if b == prev_b:\\n continue\\n if a + b in query_set:\\n res.append([sign * a, sign * b, - sign * (a + b)])\\n prev_b = b\\n prev_a = a\\n return res\\n \\n \\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n \\n noneg = [el for el in nums if el >= 0]\\n invneg = [-el for el in nums if el < 0]\\n \\n noneg = sorted(noneg)\\n invneg = sorted(invneg)\\n\\n res1 = self.helper(noneg, set(invneg), sign=1)\\n res2 = self.helper(invneg, set(noneg), sign=-1)\\n \\n res = res1 + res2\\n \\n # corner case: zeros\\n if len(noneg) > 2 and noneg[2] == 0:\\n res.append([0, 0, 0])\\n \\n return res \",\n \"runtime\": \"309\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n output = []\\n zero_count = 0\\n positives = defaultdict(int)\\n negatives = defaultdict(int)\\n\\n for num in nums:\\n if num > 0: positives[num] += 1\\n elif num < 0: negatives[num] += 1\\n else: zero_count += 1\\n\\n if len(positives) == 0 or len(negatives) == 0:\\n if zero_count > 2: output.append([0, 0, 0])\\n return output\\n\\n if zero_count > 0:\\n if zero_count > 2: output.append([0, 0, 0])\\n\\n for p in positives:\\n if -p in negatives: output.append([-p, 0, p])\\n\\n pos = sorted(list(positives))\\n neg = sorted(list(negatives))\\n \\n\\n for dict_a, dict_b, list_a, list_b in ((positives, negatives, pos, neg), (negatives, positives, neg, pos)):\\n for i in range(len(list_a)):\\n if dict_a[list_a[i]] > 1 and -2*list_a[i] in dict_b:\\n output.append([-2*list_a[i], list_a[i], list_a[i]])\\n for j in range(i+1, len(list_a)):\\n k = -(list_a[i]+list_a[j])\\n if k < list_b[0]: break\\n if k in dict_b: output.append([k, list_a[i], list_a[j]])\\n\\n return output\",\n \"runtime\": \"309\"\n },\n {\n \"code\": \"class Solution:\\n \\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) <= 2:\\n return [] \\n \\n nums.sort()\\n dnums, snums, last = dict(), [nums[0]], nums[0]\\n\\n for i in range(len(nums)):\\n if nums[i] in dnums:\\n dnums[nums[i]] += 1\\n else:\\n dnums[nums[i]] = 1\\n \\n if nums[i] != last:\\n last = nums[i]\\n snums.append(last)\\n \\n left, right, ans = 0, len(snums)-1, []\\n\\n if 0 in dnums and dnums[0] >= 3:\\n ans.append([0,0,0])\\n\\n if snums[0] >= 0 or snums[-1] <= 0:\\n return ans\\n \\n while left<right and snums[left] < 0 and snums[right] > 0:\\n third = -(snums[left] + snums[right])\\n \\n if third >= snums[left] and third <= snums[right] and third in dnums:\\n if third == snums[left] or third == snums[right]:\\n if dnums[third] >= 2:\\n ans.append([snums[left], snums[right], third])\\n else:\\n ans.append([snums[left], snums[right], third])\\n \\n nextright = right - 1\\n third = -(snums[left] + snums[nextright])\\n while nextright > left and third <= snums[nextright]:\\n if third >= snums[left] and third <= snums[nextright] and third in dnums:\\n if third == snums[left] or third == snums[nextright]:\\n if dnums[third] >= 2:\\n ans.append([snums[left], snums[nextright], third])\\n else:\\n ans.append([snums[left], snums[nextright], third])\\n nextright -= 1\\n third = -(snums[left] + snums[nextright]) \\n\\n nextleft = left + 1\\n third = -(snums[nextleft] + snums[right])\\n while nextleft < right and third >= snums[nextleft]:\\n if third >= snums[nextleft] and third <= snums[right] and third in dnums:\\n if third == snums[nextleft] or third == snums[right]:\\n if dnums[third] >= 2:\\n ans.append([snums[nextleft], snums[right], third])\\n else:\\n ans.append([snums[nextleft], snums[right], third])\\n nextleft += 1\\n third = -(snums[nextleft] + snums[right]) \\n\\n left += 1\\n right -= 1\\n \\n return ans \\n def threeSum2(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n n = len(nums)\\n sum3 = set()\\n for i in range(n):\\n j = i+1\\n k = n - 1\\n while j < k:\\n\\n summ = nums[i] + nums[j]+nums[k]\\n if summ == 0:\\n sum3.add((nums[i], nums[j], nums[k]))\\n j += 1\\n k -= 1\\n while j < k and nums[j] == nums[j - 1]:\\n j += 1\\n elif summ < 0:\\n j += 1\\n else: \\n k -= 1\\n sum3 = [list(s) for s in sum3]\\n return sum3\\n\\n \\n \\n \",\n \"runtime\": \"333\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n hashMap = {}\\n\\n for i in range(len(nums)):\\n if nums[i] in hashMap:\\n hashMap[nums[i]].add(i)\\n else:\\n hashMap[nums[i]] = {i}\\n\\n i = 0\\n j = len(nums)-1\\n res = []\\n\\n while i < j:\\n d = - (nums[i] + nums[j])\\n if d < nums[i]:\\n j -= 1\\n elif d > nums[j]:\\n i += 1\\n else:\\n if d in hashMap:\\n for index in hashMap[d]:\\n if index != i and index != j:\\n res.append([nums[i],nums[index],nums[j]])\\n break\\n tempj = j - 1\\n while i < tempj:\\n if nums[tempj] != nums[j]:\\n tempd = -(nums[i] + nums[tempj])\\n if tempd > nums[tempj]:\\n break\\n if tempd in hashMap and tempd != nums[j]:\\n for index in hashMap[tempd]:\\n if index != i and index != tempj:\\n res.append([nums[i],nums[index],nums[tempj]])\\n break\\n \\n while tempj > 0:\\n tempj -= 1\\n if nums[tempj] != nums[tempj+1]:\\n break\\n \\n tempi = i + 1\\n while tempi < j:\\n if nums[tempi] != nums[i]:\\n tempd = -(nums[tempi] + nums[j])\\n if tempd < nums[tempi]:\\n break\\n if tempd in hashMap and tempd != nums[i]:\\n for index in hashMap[tempd]:\\n if index != tempi and index != j:\\n res.append([nums[tempi],nums[index],nums[j]])\\n break\\n \\n while tempi < len(nums)-1:\\n tempi += 1\\n if nums[tempi] != nums[tempi-1]:\\n break\\n \\n while i < len(nums)-1:\\n i += 1\\n if nums[i] != nums[i-1]:\\n break\\n\\n while j > 0:\\n j -= 1\\n if nums[j] != nums[j+1]:\\n break\\n\\n return res\\n\\n\\n \",\n \"runtime\": \"333\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n count = Counter(nums)\\n uniq = sorted(count)\\n \\n res = [] if count[0] < 3 else [[0, 0, 0]]\\n count[0] = 1\\n\\n if uniq[0] > 0 or uniq[-1] < 0:\\n return res\\n\\n for n in count:\\n if count[n] > 1 and -n*2 in count:\\n res.append([n, n, -n*2])\\n\\n for i in range(len(uniq)):\\n if uniq[i] > 0:\\n break\\n for j in range(i + 1, len(uniq)):\\n x = -uniq[i] - uniq[j]\\n if x <= uniq[j]:\\n break\\n if x in count:\\n res.append([uniq[i], uniq[j], x])\\n \\n return res\\n\",\n \"runtime\": \"358\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n po = {}\\n ne = {}\\n zero = 0\\n count = []\\n for item in nums:\\n if item > 0:\\n if item in po:\\n po[item] += 1\\n else:\\n po[item] = 1\\n elif item < 0:\\n if item in ne:\\n ne[item] += 1\\n else:\\n ne[item] = 1\\n else:\\n zero += 1\\n del nums\\n np = len(po)\\n nn = len(ne)\\n if zero > 2:\\n count.append([0,0,0])\\n if np <= nn:\\n for item in po:\\n if zero > 0 and -1*item in ne:\\n count.append([0,item,-1*item])\\n if po[item] > 1 and -2*item in ne:\\n count.append([item, item, -2*item])\\n if item%2==0 and -1 * int(item/2) in ne:\\n if ne[-1 * int(item/2)] > 1:\\n count.append([item,-1 * int(item/2),-1 * int(item/2)])\\n else:\\n for item in ne:\\n if zero > 0 and -1*item in po:\\n count.append([0,item,-1*item])\\n if ne[item] > 1 and -2*item in po:\\n count.append([item, item, -2*item])\\n if item%2==0 and -1 * int(item/2) in po:\\n if po[-1 * int(item/2)] > 1:\\n count.append([item,-1 * int(item/2),-1 * int(item/2)])\\n ne = list(ne.keys())\\n po = set(po.keys())\\n for i in range(nn):\\n for j in range(i+1, nn, 1):\\n mid = -1*(ne[i]+ne[j])\\n if mid in po:\\n count.append([ne[i], ne[j], mid])\\n ne = set(ne)\\n po = list(po)\\n for i in range(np):\\n for j in range(i+1, np, 1):\\n mid = -1*(po[i]+po[j])\\n if mid in ne:\\n count.append([po[i], po[j], mid])\\n return count\\n\\n\\n\\n\\n \",\n \"runtime\": \"358\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n output = []\\n zero_count = 0\\n positives = defaultdict(int)\\n negatives = defaultdict(int)\\n\\n for num in nums:\\n if num == 0:\\n zero_count += 1\\n elif num > 0:\\n positives[num] += 1\\n else:\\n negatives[num] += 1\\n\\n if len(positives) == 0 or len(negatives) == 0:\\n if zero_count > 2: output.append([0, 0, 0])\\n return output\\n\\n if zero_count > 0:\\n if zero_count > 2: output.append([0, 0, 0])\\n\\n for p in positives:\\n if -p in negatives: output.append([-p, 0, p])\\n\\n for dict_a, dict_b in ((positives, negatives), (negatives, positives)):\\n pos = list(dict_a)\\n for i in range(len(pos)):\\n if dict_a[pos[i]] > 1:\\n if -2*pos[i] in dict_b:\\n output.append([-2*pos[i], pos[i], pos[i]])\\n for j in range(i+1, len(pos)):\\n if -(pos[i]+pos[j]) in dict_b:\\n output.append([-(pos[i]+pos[j]), pos[i], pos[j]])\\n\\n return output\\n\",\n \"runtime\": \"383\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n # Key points:\\n # no duplicates!\\n # we want to return the actual values\\n \\n # approach:\\n # get num of zeros\\n negative, positive, num_zeros = [], [], 0\\n negative_freq, positive_freq = defaultdict(int), defaultdict(int)\\n for num in nums:\\n if num==0:\\n num_zeros+=1\\n elif num > 0:\\n if num not in positive_freq:\\n positive.append(num)\\n positive_freq[num]+=1\\n else:\\n if num not in negative_freq:\\n negative.append(num)\\n negative_freq[num]+=1\\n ret = []\\n if num_zeros:\\n for pos in positive:\\n if -pos in negative_freq:\\n ret.append([-pos, 0, pos])\\n if num_zeros >=3:\\n ret.append([0,0,0])\\n for i in range(len(positive)):\\n if positive_freq[positive[i]] >=2:\\n target = -2 * positive[i]\\n if target in negative_freq:\\n ret.append([positive[i], positive[i], target])\\n for j in range(i+1, len(positive)):\\n target = -1 * (positive[i] + positive[j])\\n if target in negative_freq:\\n ret.append([target, positive[i], positive[j]])\\n for i in range(len(negative)):\\n if negative_freq[negative[i]] >=2:\\n target = -2 * negative[i]\\n if target in positive_freq:\\n ret.append([negative[i], negative[i], target])\\n for j in range(i+1, len(negative)):\\n target = -1 * (negative[i] + negative[j])\\n if target in positive_freq:\\n ret.append([negative[i], negative[j], target])\\n \\n # when we get 2x of the same letter, what do we want?\\n # we want to ignore it, unless there's an opportunity to double up\\n # Idea: we store the number of items. If >=2, we check if we can use 2x of them. Otherwise, we should not include duplicates in the array we use\\n return ret\\n\\n\\n\\n # create set of <0\\n # create set of >0\\n # first, find all triplets containing 0\\n # then, i,j iter on >0, looking at <0\\n # do same fo <0\\n # This means we won't get a duplicate, which is a concern if we use the brute force approach\\n # edge cases:\\n # multiple of the same number should not really matter\\n \\n \",\n \"runtime\": \"383\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n cntr = Counter(nums)\\n nums, res = sorted(cntr), []\\n for k in range(bisect_right(nums,0), len(nums)):\\n for j in range(bisect_left(nums,-(nums[k]-1>>1),0,k), k):\\n if -nums[k]-nums[j] in cntr:\\n res.append([-nums[k]-nums[j], nums[j], nums[k]])\\n for num, cnt in cntr.items():\\n if num and cnt > 1 and -(num<<1) in cntr:\\n res.append([num,num,-(num<<1)])\\n if cntr[0] > 2: res.append([0,0,0])\\n return res\\n\\n # def twoSum(l: int, r: int, target: int) -> List[List[int]]:\\n # res = set()\\n # while l < r:\\n # if nums[l] + nums[r] < target:\\n # l += 1\\n # elif nums[l] + nums[r] > target:\\n # r -= 1\\n # else:\\n # res.add((-target, nums[l], nums[r]))\\n # l += 1\\n # r -= 1\\n # return res\\n\\n # nums.sort()\\n # return set([pair for i, num in enumerate(nums[:-2]) for pair in twoSum(i+1, len(nums)-1, -num)])\",\n \"runtime\": \"408\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n answer = []\\n d = {}\\n nums = sorted(nums)\\n # print(nums)\\n for i in range(len(nums)):\\n # d[nums[i]] = d.get(nums[i], []) + [i]\\n d[nums[i]] = i\\n\\n last_i = None\\n for i in range(len(nums) - 2):\\n if nums[i] > 0:\\n break\\n\\n if last_i == nums[i]:\\n i = d[nums[i]] + 1\\n continue\\n last_i = nums[i]\\n last_j = None\\n for j in range(i + 1, len(nums) - 1):\\n if last_j == nums[j]:\\n j = d[nums[j]] + 1\\n continue\\n last_j = nums[j]\\n t = 0 - nums[i] - nums[j]\\n if t < nums[j]:\\n break\\n \\n k = d.get(t, 0)\\n if k > j:\\n answer.append([nums[i], nums[j], nums[k]])\\n\\n return answer\\n\\n\",\n \"runtime\": \"408\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n pos, neg, zeros = defaultdict(int), defaultdict(int), 0\\n ans = set()\\n\\n for num in nums:\\n if num == 0:\\n zeros +=1\\n elif num > 0:\\n pos[num] += 1\\n else:\\n neg[num] += 1\\n\\n if zeros >= 1:\\n for positive in pos:\\n if - positive in neg:\\n ans.add((- positive, 0, positive))\\n\\n if zeros >= 3:\\n ans.add((0, 0, 0))\\n\\n values_x = list(pos)\\n for i in range(len(values_x)):\\n for j in range(i, len(values_x)):\\n if i != j or (i == j and pos[values_x[i]] > 1):\\n target = - (values_x[i] + values_x[j])\\n if target in neg:\\n ans.add(tuple(sorted([target, values_x[i], values_x[j]])))\\n\\n\\n values_x = list(neg)\\n for i in range(len(values_x)):\\n for j in range(i, len(values_x)):\\n if i != j or (i == j and neg[values_x[i]] > 1):\\n target = - (values_x[i] + values_x[j])\\n if target in pos:\\n ans.add(tuple(sorted([target, values_x[i], values_x[j]])))\\n \\n return ans\",\n \"runtime\": \"433\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n positives = dict()\\n negatives = dict()\\n zeroes = 0\\n\\n for n in nums:\\n if n > 0:\\n if n not in positives:\\n positives[n] = 0\\n positives[n] += 1\\n \\n if n < 0:\\n if n not in negatives:\\n negatives[n] = 0\\n negatives[n] += 1\\n \\n if n == 0:\\n zeroes += 1\\n \\n res = set()\\n if zeroes >= 3:\\n res.add((0,0,0))\\n \\n if zeroes >= 1:\\n for n in positives:\\n if -n in negatives:\\n res.add((n, -n, 0))\\n \\n for main, secondary in ((positives, negatives), (negatives, positives)): \\n items = list(main.items())\\n for i in range(len(items)):\\n x = items[i][0]\\n c = items[i][1]\\n if c > 1 and -2*x in secondary:\\n res.add(tuple(sorted((x, x, -2 * x))))\\n for j in range(i + 1, len(items)):\\n y = items[j][0]\\n if -x - y in secondary:\\n res.add(tuple(sorted((x, y, -x - y))))\\n\\n return res\\n\\n\\n \",\n \"runtime\": \"433\"\n },\n {\n \"code\": \"from bisect import bisect_left, bisect_right\\n\\nclass Solution:\\n def threeSum(self, a: List[int]) -> List[List[int]]:\\n a.sort()\\n triplets = []\\n for i in range(len(a) - 2):\\n if i > 0 and a[i] == a[i - 1]:\\n continue\\n s = -a[i]\\n l = i + 1; r = len(a) - 1\\n while l < r:\\n cs = a[l] + a[r]\\n if cs < s:\\n l = bisect_left(a, s - a[r], l + 1, r)\\n elif cs > s:\\n r = bisect_right(a, s - a[l], l, r - 1)\\n else:\\n triplets.append((a[i], a[l], a[r]))\\n l += 1; r -= 1\\n while l < r and a[l] == a[l - 1]: l += 1\\n while l < r and a[r] == a[r + 1]: r -= 1\\n return triplets\",\n \"runtime\": \"457\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n ans = []\\n nums.sort()\\n # two ptr + hash\\n num2indices = defaultdict(set)\\n for idx, num in enumerate(nums):\\n num2indices[num].add(idx)\\n \\n prev_l_num = prev_r_num = float('-inf')\\n for l in range(len(nums)):\\n if nums[l] == prev_l_num:\\n continue\\n prev_l_num = nums[l]\\n for r in range(l + 1, len(nums)):\\n if nums[r] == prev_r_num:\\n continue\\n prev_r_num = nums[r]\\n if nums[l] + nums[r] > 0:\\n break\\n comp = - nums[l] - nums[r]\\n if comp < nums[r]:\\n break\\n if comp in num2indices and \\\\\\n len(num2indices[comp] - set([l, r])) > 0:\\n ans.append([nums[l], nums[r], comp])\\n \\n return ans\\n\\n\",\n \"runtime\": \"457\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n nums_len = len(nums)\\n all_triplets = []\\n for i in range(nums_len - 2):\\n if nums[i] > 0:\\n break\\n if i == 0 or nums[i] != nums[i - 1]:\\n self.twoSum(i, nums=nums, right_ind=nums_len - 1, all_triplets=all_triplets)\\n return all_triplets\\n\\n def twoSum(self, i, nums, right_ind, all_triplets):\\n left = i + 1\\n right = right_ind\\n target = 0 - nums[i]\\n while left < right:\\n two_sum = nums[left] + nums[right]\\n if two_sum < target:\\n left += 1\\n elif two_sum > target:\\n right -= 1\\n else:\\n all_triplets.append([nums[i], nums[left], nums[right]])\\n left += 1\\n right -= 1\\n while left < right and nums[left] == nums[left - 1]:\\n left += 1\\n\",\n \"runtime\": \"482\"\n },\n {\n \"code\": \"import itertools\\n\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n \\n counter = Counter(nums)\\n \\n result = set()\\n if counter[0] >= 3:\\n result.add((0,0,0))\\n if len(counter) < 2:\\n return result\\n\\n p, n = set(), set()\\n \\n for c in counter:\\n if c > 0:\\n p.add(c)\\n elif c < 0:\\n n.add(c)\\n \\n for pos in p:\\n for neg in n:\\n target = -(pos + neg)\\n\\n if target not in counter:\\n continue\\n if counter[target] == 1 and target in [pos, neg]:\\n continue\\n \\n result.add(tuple(sorted([target, neg, pos])))\\n return result\\n\",\n \"runtime\": \"482\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n nums.sort()\\n\\n for i, a in enumerate(nums):\\n if a > 0:\\n break\\n\\n if i > 0 and a == nums[i - 1]:\\n continue\\n\\n l, r = i + 1, len(nums) - 1\\n while l < r:\\n threeSum = a + nums[l] + nums[r]\\n if threeSum > 0:\\n r -= 1\\n elif threeSum < 0:\\n l += 1\\n else:\\n res.append([a, nums[l], nums[r]])\\n l += 1\\n r -= 1\\n while nums[l] == nums[l - 1] and l < r:\\n l += 1\\n \\n return res\\n\",\n \"runtime\": \"507\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n nums.sort()\\n\\n for i, a in enumerate(nums):\\n # Skip positive integers\\n if a > 0:\\n break\\n\\n if i > 0 and a == nums[i - 1]:\\n continue\\n\\n l, r = i + 1, len(nums) - 1\\n while l < r:\\n threeSum = a + nums[l] + nums[r]\\n if threeSum > 0:\\n r -= 1\\n elif threeSum < 0:\\n l += 1\\n else:\\n res.append([a, nums[l], nums[r]])\\n l += 1\\n r -= 1\\n while nums[l] == nums[l - 1] and l < r:\\n l += 1\\n \\n return res\\n\",\n \"runtime\": \"507\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n\\n res = set()\\n\\n #1. Split nums into three lists: negative numbers, positive numbers, and zeros\\n n, p, z = [], [], []\\n for num in nums:\\n if num > 0:\\n p.append(num)\\n elif num < 0: \\n n.append(num)\\n else:\\n z.append(num)\\n\\n #2. Create a separate set for negatives and positives for O(1) look-up times\\n N, P = set(n), set(p)\\n\\n #3. If there is at least 1 zero in the list, add all cases where -num exists in N and num exists in P\\n # i.e. (-3, 0, 3) = 0\\n if z:\\n for num in P:\\n if -1*num in N:\\n res.add((-1*num, 0, num))\\n\\n #3. If there are at least 3 zeros in the list then also include (0, 0, 0) = 0\\n if len(z) >= 3:\\n res.add((0,0,0))\\n\\n #4. For all pairs of negative numbers (-3, -1), check to see if their complement (4)\\n # exists in the positive number set\\n for i in range(len(n)):\\n for j in range(i+1,len(n)):\\n target = -1*(n[i]+n[j])\\n if target in P:\\n res.add(tuple(sorted([n[i],n[j],target])))\\n\\n #5. For all pairs of positive numbers (1, 1), check to see if their complement (-2)\\n # exists in the negative number set\\n for i in range(len(p)):\\n for j in range(i+1,len(p)):\\n target = -1*(p[i]+p[j])\\n if target in N:\\n res.add(tuple(sorted([p[i],p[j],target])))\\n\\n return res\",\n \"runtime\": \"532\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n\\n res = set()\\n\\n #1. Split nums into three lists: negative numbers, positive numbers, and zeros\\n n, p, z = [], [], []\\n for num in nums:\\n if num > 0:\\n p.append(num)\\n elif num < 0: \\n n.append(num)\\n else:\\n z.append(num)\\n\\n #2. Create a separate set for negatives and positives for O(1) look-up times\\n N, P = set(n), set(p)\\n\\n #3. If there is at least 1 zero in the list, add all cases where -num exists in N and num exists in P\\n # i.e. (-3, 0, 3) = 0\\n if z:\\n for num in P:\\n if -1*num in N:\\n res.add((-1*num, 0, num))\\n\\n #3. If there are at least 3 zeros in the list then also include (0, 0, 0) = 0\\n if len(z) >= 3:\\n res.add((0,0,0))\\n\\n #4. For all pairs of negative numbers (-3, -1), check to see if their complement (4)\\n # exists in the positive number set\\n for i in range(len(n)):\\n for j in range(i+1,len(n)):\\n target = -1*(n[i]+n[j])\\n if target in P:\\n res.add(tuple(sorted([n[i],n[j],target])))\\n\\n #5. For all pairs of positive numbers (1, 1), check to see if their complement (-2)\\n # exists in the negative number set\\n for i in range(len(p)):\\n for j in range(i+1,len(p)):\\n target = -1*(p[i]+p[j])\\n if target in N:\\n res.add(tuple(sorted([p[i],p[j],target])))\\n\\n return res\\n \",\n \"runtime\": \"532\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n nums.sort()\\n for i in range(len(nums)):\\n if nums[i]>0:\\n break\\n if i == 0 or nums[i-1]!= nums[i]:\\n self.sum_two(nums, i, res)\\n return res\\n\\n def sum_two(self, nums, i, res):\\n lo, hi = i+1, len(nums)-1\\n while(lo<hi):\\n s = nums[i] + nums[lo] + nums[hi]\\n if s < 0:\\n lo += 1\\n elif s > 0:\\n hi -= 1\\n else:\\n res.append([nums[i], nums[lo], nums[hi]])\\n lo += 1\\n hi -= 1\\n while(lo < hi and nums[lo-1] == nums[lo]):\\n lo += 1\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n def two(self, nums, i, res):\\n lo, hi = i+1, len(nums)-1\\n while(lo<hi):\\n s = nums[i]+nums[lo]+nums[hi]\\n if s<0:\\n lo += 1\\n elif s>0:\\n hi -= 1\\n else:\\n res.append([nums[i], nums[lo], nums[hi]])\\n lo += 1\\n hi -= 1\\n while(lo<hi and nums[lo-1] == nums[lo]):\\n lo += 1 \",\n \"runtime\": \"557\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n n = len(nums)\\n ans = []\\n for i in range(n - 2):\\n if nums[i] > 0:\\n break\\n if i and nums[i] == nums[i - 1]:\\n continue\\n j, k = i + 1, n - 1\\n while j < k:\\n x = nums[i] + nums[j] + nums[k]\\n if x < 0:\\n j += 1\\n elif x > 0:\\n k -= 1\\n else:\\n ans.append([nums[i], nums[j], nums[k]])\\n j, k = j + 1, k - 1\\n while j < k and nums[j] == nums[j - 1]:\\n j += 1\\n while j < k and nums[k] == nums[k + 1]:\\n k -= 1\\n return ans\",\n \"runtime\": \"557\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n nums.sort()\\n res = []\\n for i in range(n - 2):\\n if i > 0 and nums[i] == nums[i - 1]: continue\\n if nums[i] > 0: break\\n j = i + 1\\n k = n - 1\\n while j < k:\\n total = nums[i] + nums[j] + nums[k]\\n if total == 0:\\n res.append([nums[i], nums[j], nums[k]])\\n j += 1\\n while j < k and nums[j] == nums[j - 1]: j += 1\\n k -= 1\\n while k > j and nums[k] == nums[k + 1]: k -= 1\\n elif total > 0: \\n k -= 1\\n else: j += 1\\n return res\\n \\n \\n return res\",\n \"runtime\": \"581\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: list[int]) -> list[list[int]]:\\n n = len(nums)\\n nums.sort()\\n\\n ans = []\\n\\n for i in range(n):\\n if nums[i] > 0:\\n break\\n\\n if i == 0 or nums[i] != nums[i - 1]:\\n first_idx = i\\n left_idx = i + 1\\n right_idx = n - 1\\n\\n s = nums[first_idx]\\n while left_idx < right_idx:\\n if s + nums[left_idx] + nums[right_idx] > 0:\\n right_idx -= 1\\n elif s + nums[left_idx] + nums[right_idx] < 0:\\n left_idx += 1\\n else:\\n ans.append([nums[first_idx], nums[left_idx], nums[right_idx]])\\n left_idx += 1\\n right_idx -= 1\\n while (\\n left_idx < right_idx\\n and nums[left_idx - 1] == nums[left_idx]\\n ):\\n left_idx += 1\\n\\n return ans\\n\",\n \"runtime\": \"581\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n result = []\\n def two_sum(idx):\\n start, end = idx + 1, len(nums) - 1\\n while start < end:\\n out = nums[idx] + nums[start] + nums[end]\\n if out == 0:\\n result.append([nums[idx], nums[start], nums[end]])\\n start += 1\\n end -= 1\\n while start < len(nums) and nums[start] == nums[start-1]:\\n start += 1\\n elif out < 0:\\n start += 1\\n else:\\n end -= 1\\n for i in range(len(nums) - 2):\\n if nums[i] > 0:\\n continue\\n if i == 0 or nums[i] != nums[i-1]:\\n two_sum(i)\\n return result\\n \",\n \"runtime\": \"606\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n pos_to_counts = collections.defaultdict(int)\\n neg_to_counts = collections.defaultdict(int)\\n zero_count = 0\\n for n in nums:\\n if n < 0:\\n neg_to_counts[n] += 1\\n elif n > 0:\\n pos_to_counts[n] += 1\\n else:\\n zero_count += 1\\n\\n result: set[tuple[int, int, int]] = set()\\n\\n if zero_count:\\n if zero_count >= 3:\\n result.add((0, 0, 0))\\n for num in pos_to_counts.keys():\\n if -num in neg_to_counts:\\n result.add((-num, 0, num))\\n\\n for dict1, dict2 in (\\n (neg_to_counts, pos_to_counts),\\n (pos_to_counts, neg_to_counts),\\n ):\\n for n1, count in dict1.items():\\n for n2 in dict1.keys():\\n if n1 == n2 and count == 1:\\n continue\\n if (target := -(n1 + n2)) in dict2:\\n result.add(tuple(sorted([n1, n2, target])))\\n\\n return result\\n\",\n \"runtime\": \"606\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n output = []\\n nums.sort()\\n\\n for i, n in enumerate(nums):\\n # Skip the duplicate\\n if i > 0 and nums[i-1] == n:\\n continue\\n \\n l, r = i+1, len(nums)-1\\n while l < r:\\n threeSum = n + nums[l] + nums[r]\\n if threeSum > 0:\\n r -= 1\\n elif threeSum < 0:\\n l += 1\\n else:\\n output.append([n, nums[l], nums[r]])\\n l += 1\\n r -= 1\\n while l < r and nums[l] == nums[l-1]:\\n l += 1\\n return output\\n\\n\",\n \"runtime\": \"656\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res=[]\\n nums.sort()\\n\\n for i , a in enumerate(nums):\\n if i > 0 and a == nums[i-1]:\\n continue\\n \\n l,r = i+1, len(nums)-1\\n\\n while l<r:\\n threeSum = a + nums[l] + nums[r]\\n if threeSum > 0:\\n r -=1\\n elif threeSum < 0:\\n l += 1\\n else:\\n res.append([a , nums[l] , nums[r]])\\n l += 1\\n while nums[l] == nums[l-1] and l < r:\\n l += 1\\n return res\\n \",\n \"runtime\": \"656\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n n = len(nums)\\n answer = []\\n for i in range(n):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n \\n left, right = i + 1, n - 1\\n while left < right:\\n total = nums[i] + nums[left] + nums[right]\\n if total > 0:\\n right -= 1\\n elif total < 0:\\n left += 1\\n else:\\n answer.append([nums[i], nums[left], nums[right]])\\n while left < right and nums[left] == nums[left+1]:\\n left += 1\\n left += 1\\n\\n while left < right and nums[right] == nums[right-1]:\\n right -= 1\\n right -= 1\\n return answer\\n\",\n \"runtime\": \"681\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n ans = []\\n nums.sort()\\n for i in range(n):\\n if i != 0 and nums[i] == nums[i-1]:\\n continue\\n \\n j = i + 1\\n k = n - 1\\n while j < k:\\n total_sum = nums[i] + nums[j] + nums[k]\\n if total_sum > 0:\\n k -= 1\\n elif total_sum < 0:\\n j += 1\\n else:\\n temp = [nums[i], nums[j], nums[k]]\\n ans.append(temp)\\n j += 1\\n k -= 1\\n\\n while j < k and nums[j] == nums[j-1]:\\n j += 1\\n while j < k and nums[k] == nums[k+1]:\\n k -= 1\\n return ans\",\n \"runtime\": \"681\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n result = []\\n nums.sort()\\n length = len(nums)\\n\\n for i in range(length-2):\\n\\n if i>0 and nums[i] == nums[i-1]:\\n continue\\n j = i+1\\n k = length-1\\n\\n while j<k:\\n triplet_sum = nums[i]+nums[j]+nums[k]\\n if triplet_sum < 0:\\n j += 1\\n elif triplet_sum > 0:\\n k -= 1\\n else:\\n result.append([nums[i], nums[j], nums[k]])\\n j += 1\\n k -= 1\\n while j<k and nums[j]==nums[j-1]: j += 1\\n while j<k and nums[k]==nums[k+1]: k -= 1\\n\\n return result\\n\",\n \"runtime\": \"705\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n result = []\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n j = i + 1\\n k = len(nums) - 1\\n while j < k:\\n sum = nums[i] + nums[j] + nums[k]\\n if sum < 0:\\n j += 1\\n elif sum > 0:\\n k -= 1\\n else:\\n ans = [nums[i], nums[j], nums[k]]\\n result.append(ans)\\n j += 1\\n k -= 1\\n while j < k and nums[j] == nums[j-1]:\\n j += 1\\n while j < k and nums[k] == nums[k+1]:\\n k -= 1\\n return result\",\n \"runtime\": \"705\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n ans = []\\n for i in range(len(nums) - 2):\\n if (i > 0 and nums[i] == nums[i-1]):\\n continue\\n l = i + 1\\n r = len(nums) - 1\\n while l < r:\\n curr_sum = nums[i] + nums[l] + nums[r]\\n if curr_sum == 0:\\n ans.append([nums[i], nums[l], nums[r]])\\n l += 1\\n r -= 1\\n while (l < r and nums[l] == nums[l-1]):\\n l += 1\\n while (l < r and nums[r] == nums[r+1]):\\n r -= 1\\n elif curr_sum < 0:\\n l += 1\\n else:\\n r -= 1\\n return ans\\n \",\n \"runtime\": \"730\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n nums.sort()\\n\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n \\n j = i + 1\\n k = len(nums) - 1\\n\\n while j < k:\\n total = nums[i] + nums[j] + nums[k]\\n\\n if total > 0:\\n k -= 1\\n elif total < 0:\\n j += 1\\n else:\\n res.append([nums[i], nums[j], nums[k]])\\n j += 1\\n\\n while nums[j] == nums[j-1] and j < k:\\n j += 1\\n \\n return res\",\n \"runtime\": \"730\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n # sort, traverse, if not seen, lock 1 value, do two sum (target = 0 - locked), add to seen\\n # if seen, skip\\n nums.sort()\\n res = []\\n # print(nums)\\n for i in range(len(nums)):\\n lock = nums[i]\\n if nums[i] > 0:\\n break\\n if i == 0 or nums[i - 1] != nums[i]:\\n target = -lock\\n seen = set()\\n # for j in range(i + 1, len(nums)):\\n # x = target - nums[j]\\n # if x in seen:\\n # res.append([lock, nums[j], x])\\n # print(j)\\n # while j + 1 < len(nums) and nums[j] == nums[j + 1]:\\n # j += 1\\n # print(j)\\n # else:\\n # seen.add(nums[j])\\n j = i + 1\\n while j < len(nums):\\n x = target - nums[j]\\n if x in seen:\\n res.append([nums[i], nums[j], x])\\n while j + 1 < len(nums) and nums[j] == nums[j + 1]:\\n j += 1\\n seen.add(nums[j])\\n j += 1\\n return res\",\n \"runtime\": \"755\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n res = []\\n for i in range(len(nums) - 2):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n \\n j = i + 1\\n k = len(nums) - 1\\n while j < k:\\n tmp = nums[i] + nums[j] + nums[k]\\n if tmp == 0:\\n res.append([nums[i], nums[j], nums[k]])\\n j += 1\\n k -= 1\\n while j < k and nums[j] == nums[j - 1]:\\n j += 1\\n elif tmp > 0:\\n k -= 1\\n else:\\n j += 1\\n \\n return res\",\n \"runtime\": \"755\"\n },\n {\n \"code\": \"# Examples:\\n#\\n# nums = []\\n# -> []\\n#\\n# nums = Any list with less than 3 elements\\n# -> []\\n#\\n# nums = [1, 2, 3]\\n# -> []\\n#\\n# nums = [-1, -2, 3, 4]\\n# -> [(-1, -2, 3)]\\n#\\n# nums = [-1, -2, 3, 3]\\n# -> [(-1, -2, 3)]\\n\\n# Brute force:\\n# Iterate through all possible 3-tuples using nested for loops\\n# If sums to zero, record the tuple in sorted order\\n# Use a hash table to store valid tuples to avoid duplicates\\n# Return the keys of the hash table\\n#\\n# Time complexity: O(N^3)\\n# Space complexity: O(1)\\n# Hash table stores up to the number of matching triplets\\n#\\n# Insert all the numbers in a hash table O(N)\\n# De-dup repeats\\n# Iterate over all 2-tuples\\n# Given a, b, if -(a + b) also in set, then valid triplet\\n# Time complexity: O(N^2)\\n# Space complexity: O(N)\\n#\\n# Create count_by_value hash table.\\n# Iterate over value keys\\n# Decrement the value count, of zero remove from table\\n# Iterate over remaining keys\\n# Give value1, value1, if -(a+b) in the table, then record valid triplet in a hash table\\n#\\n# Time complexity: O(N^2)\\n# Space complexity: O(N)\\n\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n count_by_val = {}\\n solutions = set()\\n # Inventory nums and remove redundant counts.\\n for val in nums:\\n limit = 3 if val == 0 else 2\\n count_by_val[val] = min(count_by_val.get(val, 0) + 1, limit)\\n for val1 in list(count_by_val.keys()):\\n count_by_val[val1] -= 1\\n if count_by_val[val1] == 0:\\n del count_by_val[val1]\\n for val2 in count_by_val:\\n val3 = -(val1 + val2)\\n counts = 2 if val2 == val3 else 1\\n if count_by_val.get(val3, 0) >= counts:\\n solutions.add(tuple(sorted([val1, val2, val3])))\\n return [list(s) for s in solutions]\\n\",\n \"runtime\": \"780\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n # sort, traverse, if not seen, lock 1 value, do two sum (target = 0 - locked), add to seen\\n # if seen, skip\\n nums.sort()\\n res = []\\n # print(nums)\\n for i in range(len(nums)):\\n lock = nums[i]\\n if nums[i] > 0:\\n break\\n if i == 0 or nums[i - 1] != nums[i]:\\n target = -lock\\n seen = set()\\n # for j in range(i + 1, len(nums)):\\n # x = target - nums[j]\\n # if x in seen:\\n # res.append([lock, nums[j], x])\\n # print(j)\\n # while j + 1 < len(nums) and nums[j] == nums[j + 1]:\\n # j += 1\\n # seen.add(nums[j])\\n j = i + 1\\n while j < len(nums):\\n x = target - nums[j]\\n if x in seen:\\n res.append([lock, nums[j], x])\\n while j + 1 < len(nums) and nums[j] == nums[j + 1]:\\n j += 1\\n seen.add(nums[j])\\n j += 1\\n return res\",\n \"runtime\": \"780\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n n = len(nums)\\n trips = []\\n for i in range(n-2):\\n if nums[i] + nums[i+1] + nums[i+2] > 0:\\n continue\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n target = -nums[i]\\n front = i+1\\n back = n-1\\n while front < back:\\n if front == i:\\n front += 1\\n if back == i:\\n back -= 1\\n twosum = nums[front] + nums[back]\\n if twosum == target:\\n trips.append([nums[i], nums[front], nums[back]])\\n if twosum <= target:\\n front += 1\\n while front < back and nums[front] == nums[front-1]:\\n front += 1\\n if twosum >= target:\\n back -= 1\\n while back > front and nums[back] == nums[back+1]:\\n back -= 1\\n return trips\\n \",\n \"runtime\": \"805\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n print(nums)\\n listLength = len(nums)\\n tripletList = []\\n for i in range(listLength-2):\\n if ( (i != 0) & (nums[i]==nums[i-1])):\\n continue\\n j = i+1\\n k = listLength-1\\n while j < k:\\n currentTotal = nums[i]+nums[j]+nums[k]\\n if (currentTotal == 0):\\n tripletList.append([nums[i],nums[j],nums[k]])\\n print(\\\"i:\\\" + str(i) + \\\"j\\\" + str(j) + \\\"k\\\" + str(k) )\\n j += 1\\n while ( (j<k) & (nums[j]==nums[j-1]) ):\\n j +=1\\n print(\\\"j is now \\\" + str(j)) \\n elif (currentTotal < 0):\\n j += 1\\n else:\\n k -= 1\\n return tripletList\\n\\n \\n\\n \\n \\n\\n \",\n \"runtime\": \"805\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n print(nums)\\n res = []\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n n1 = nums[i]\\n j, k = i + 1, len(nums) - 1\\n while j < k:\\n n2 = nums[j]\\n n3 = nums[k]\\n if n1 + n2 + n3 == 0:\\n res.append([n1, n2, n3])\\n j += 1\\n while j < k and nums[j] == nums[j - 1]:\\n j += 1\\n k -= 1\\n while j < k and nums[k] == nums[k + 1]:\\n k -= 1\\n\\n elif n2 + n3 > -n1:\\n k -= 1\\n else:\\n j += 1\\n return res\",\n \"runtime\": \"829\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n m= 0\\n result = []\\n nums.sort()\\n\\n while m < len(nums):\\n # print(m)\\n left, right = m, len(nums) - 1\\n while left < right:\\n # print(left, right)\\n if left == m:\\n left += 1\\n continue\\n if right == m:\\n right -= 1\\n continue\\n\\n value = nums[left] + nums[m] + nums[right]\\n if value == 0:\\n result.append([nums[left], nums[m], nums[right]])\\n while left + 1 < len(nums) and nums[left] == nums[left + 1] and left < right:\\n left += 1\\n left += 1\\n\\n elif value > 0:\\n right -= 1\\n else:\\n left += 1\\n \\n while m + 1 < len(nums) and nums[m] == nums[m + 1]:\\n m += 1\\n m += 1\\n return result\\n \\n\",\n \"runtime\": \"829\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n # Sort the array\\n # Fix one number x\\n # Perform 2Sum on the rest of the array\\n # Target sum is 0 - x\\n # Use two pointers\\n output = []\\n triplet = []\\n\\n nums.sort()\\n\\n for i in range(len(nums) - 2):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n\\n left = i + 1\\n right = len(nums) - 1\\n target = 0 - nums[i]\\n\\n while left < right:\\n if nums[left] + nums[right] == target:\\n triplet = [nums[i], nums[left], nums[right]]\\n output.append(triplet)\\n left += 1\\n while nums[left] == nums[left - 1] and left < right:\\n left += 1\\n elif nums[left] + nums[right] < target:\\n left += 1\\n elif nums[left] + nums[right] > target:\\n right -= 1\\n return output\",\n \"runtime\": \"854\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n # Redo 9/15/24\\n # - How do I get unique indexes? Only use indexes > ones in triplet\\n # - How do I get unique numbers? Sort list and place pointers so that every time unique values\\n\\n\\n\\n # 1. Hashmap of val: index\\n # 2. Loop through every pair combo\\n # 3. Find needed val in hashmap, check index > second\\n # 4. Advance second pointer until find unique num\\n # 5. Advance first pointer until find unique first\\n \\n locations = defaultdict(list)\\n result = []\\n sortlist = sorted(nums)\\n for i, num in enumerate(sortlist):\\n locations[num].append(i)\\n\\n # must sort because same triplet might arise further down\\n # ex. [1, 2, -3, 1, 2, -3]\\n \\n size = len(sortlist)\\n oldfirst = sortlist[0] + 1\\n for first in range(size - 2):\\n if sortlist[first] != oldfirst:\\n oldfirst = sortlist[first]\\n oldsecond = sortlist[first + 1] + 1\\n for second in range(first+1, size - 1):\\n if sortlist[second] != oldsecond:\\n oldsecond = sortlist[second]\\n currsum = sortlist[first] + sortlist[second]\\n if -1*currsum in locations:\\n spots = locations[-1*currsum]\\n for spot in spots:\\n if spot > second:\\n result.append((sortlist[first], sortlist[second], -1*currsum))\\n break\\n \\n return result\\n \\n\\n\\n # Inc first to unique val\\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 # U:\\n # 3 distinct indices\\n # Triplet adds to 0\\n # Unsorted\\n\\n # Match\\n # 2-pointer, sorting, hashing\\n\\n # # Reduce problem to 2-sum\\n # # Loop through array and perform two sum II on rest of array\\n # arr = sorted(nums)\\n # for i in range(len(nums) - 2):\\n \\n\\n # result = set()\\n # locations = defaultdict(list)\\n\\n # # 1. Map value: [indexes]\\n # for i, num in enumerate(nums):\\n # locations[num].append(i)\\n \\n # # 2. Double loop to get all first, second index pairs\\n # # Only allow increasing pairs to ensure triplets are distinct\\n # for first in range(len(nums) - 2):\\n # # Know what sum we need\\n # target = -nums[first]\\n\\n # # Look through the values in hash\\n # for value in locations:\\n # need = target - value\\n # # All three values are same\\n # # Make sure we have 3 of them\\n # if nums[first] == value and value == need and len(locations[value]) >= 3:\\n # result.add((value, value, value)) \\n \\n # for second in range(first + 1, len(nums) - 1):\\n # twosum = nums[first] + nums[second]\\n # need = 0 - twosum\\n # if need in locations:\\n # for index in locations[need]:\\n # if index > second:\\n # # Order the values\\n # result.add(tuple(sorted((nums[first], nums[second], need))))\\n # break # Stop looking \\n\\n # How do I stop early if we already have that sum?\\n \\n return result\\n\\n\\n \",\n \"runtime\": \"854\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n # n 为 3，从 nums[0] 开始计算和为 0 的三元组\\n return self.nSumTarget(nums, 3, 0, 0)\\n\\n # 注意：调用这个函数之前一定要先给 nums 排序\\n # n 填写想求的是几数之和，start 从哪个索引开始计算（一般填 0），target 填想凑出的目标和\\n def nSumTarget(self, nums: List[int], n: int, start: int, target: int) -> List[List[int]]:\\n sz = len(nums)\\n res = []\\n\\n # 2Sum 是 base case\\n if n == 2:\\n lo, hi = start, sz - 1\\n # 双指针那一套操作\\n while lo < hi:\\n sum = nums[lo] + nums[hi]\\n if sum < target:\\n while lo < hi and nums[lo] == nums[lo + 1]:\\n lo += 1\\n lo += 1\\n elif sum > target:\\n while lo < hi and nums[hi] == nums[hi - 1]:\\n hi -= 1\\n hi -= 1\\n else:\\n res.append([nums[lo], nums[hi]])\\n while lo < hi and nums[lo] == nums[lo + 1]:\\n lo += 1\\n while lo < hi and nums[hi] == nums[hi - 1]:\\n hi -= 1\\n lo += 1\\n hi -= 1\\n else:\\n # n > 2 时，递归计算 (n-1)Sum 的结果\\n for i in range(start, sz):\\n if i == start or nums[i - 1] != nums[i]:\\n sub = self.nSumTarget(nums, n - 1, i + 1, target - nums[i])\\n for arr in sub:\\n # (n-1)Sum 加上 nums[i] 就是 nSum\\n arr.append(nums[i])\\n res.append(arr)\\n return res\",\n \"runtime\": \"879\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n triplets = set()\\n history_i = set()\\n n = len(nums)\\n \\n for i, num_i in enumerate(nums[:-2]):\\n if num_i in history_i:\\n continue\\n \\n history_i.add(num_i)\\n history_j = set()\\n\\n for num_j in nums[i+1:]:\\n num_k = - (num_i + num_j)\\n if num_k in history_j:\\n triplets.add(tuple(sorted([num_i, num_j, num_k])))\\n \\n history_j.add(num_j)\\n\\n return triplets\",\n \"runtime\": \"879\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n combs = set()\\n seen = set()\\n\\n for i in range(len(nums)):\\n if nums[i] in seen:\\n continue\\n seen.add(nums[i])\\n record = set()\\n target = 0 - nums[i]\\n for j in range(i + 1, len(nums)):\\n if target - nums[j] in record:\\n comb = sorted([nums[i], target - nums[j], nums[j]])\\n combs.add(tuple(comb))\\n record.add(nums[j])\\n \\n return [list(c) for c in combs]\",\n \"runtime\": \"904\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n\\n nums = sorted(nums)\\n\\n res_set = set()\\n res = []\\n\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n first = nums[i]\\n my_set = set()\\n for j in range(i +1,len(nums)):\\n if -(nums[j] + first) in my_set:\\n # print(first)\\n # print(-(nums[j] + first) )\\n # res.append([first, -(nums[j] + first) , nums[j]])\\n # my_list = sorted([first, -(nums[j] + first) , nums[j]])\\n res_set.add((first, -(nums[j] + first) , nums[j]))\\n my_set.add(nums[j])\\n\\n res = [ [entry[0], entry[1], entry[2]] for entry in res_set]\\n \\n return res\\n\\n\\n \",\n \"runtime\": \"904\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n allSums=[]\\n\\n for i in range(len(nums)-2):\\n if i>0 and nums[i]==nums[i-1]: #to avoid repeating values\\n continue\\n \\n ptr1=i+1\\n ptr2=len(nums)-1\\n while ptr1<ptr2: \\n\\n if nums[i]+nums[ptr1]+nums[ptr2]==0: \\n oneSum=[nums[i],nums[ptr1],nums[ptr2]]\\n allSums.append(oneSum)\\n ptr1=ptr1+1\\n while nums[ptr1]==nums[ptr1-1] and ptr1<ptr2:\\n ptr1=ptr1+1\\n elif nums[i]+nums[ptr1]+nums[ptr2]<0:\\n ptr1=ptr1+1\\n else:\\n ptr2=ptr2-1\\n return allSums \\n\\n\",\n \"runtime\": \"929\"\n },\n {\n \"code\": \"'''\\nUnderstanding the Problem\\nExample 1:\\nInput: nums = [-1,0,1,2,-1,-4]\\nOutput: [[-1,-1,2],[-1,0,1]]\\n\\nExample 2:\\nInput: nums = [0,1,1]\\nOutput: []\\n\\nDesign a solution\\n[-1,0,1,2,-1,-4]\\n[-4,-1,-1,0,1,2]\\n\\nnums.sort()\\nfor i in range(len(nums) - 2):\\n j = i + 1\\n k = len(nums) - 1\\n while j < k:\\n if nums[j] + nums[k] == -nums[i]:\\n result.append([nums[i], nums[j], nums[k]])\\n elif nums[j] + nums[k] < -nums[i]:\\n j += 1\\n else:\\n k -= 1\\n\\n\\nVerify the solution\\n\\nImplement and test\\n\\n'''\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n result = []\\n nums.sort()\\n print(nums)\\n for i in range(len(nums) - 2):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n j = i + 1\\n k = len(nums) - 1\\n # print(i)\\n while j < k:\\n if nums[j] + nums[k] + nums[i] == 0:\\n result.append([nums[i], nums[j], nums[k]])\\n while j < k and nums[j] == nums[j+1]:\\n j += 1\\n while j < k and nums[k] == nums[k-1]:\\n k -= 1\\n j += 1\\n k -= 1\\n elif nums[j] + nums[k] + nums[i] < 0:\\n j += 1\\n else:\\n k -= 1\\n\\n return result\\n \",\n \"runtime\": \"929\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n ans = set()\\n pointer1 = 0\\n while pointer1 < len(nums)-2:\\n if pointer1> 0 and nums[pointer1]==nums[pointer1-1]:\\n pointer1+=1\\n continue\\n pointer2 = pointer1 + 1\\n pointer3 = len(nums) - 1\\n while pointer2<pointer3:\\n if nums[pointer1] + nums[pointer2] + nums[pointer3] == 0:\\n ans.add((nums[pointer1],nums[pointer2],nums[pointer3]))\\n pointer2+=1\\n pointer3-=1\\n elif nums[pointer1] + nums[pointer2] + nums[pointer3] > 0:\\n pointer3-=1\\n else:\\n pointer2+=1\\n pointer1+=1\\n return ans\\n \\n\",\n \"runtime\": \"953\"\n },\n {\n \"code\": \"class Solution:\\n from collections import defaultdict\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n resultdict={}\\n\\n for i in range (len(nums)):\\n if i>0 and nums[i]==nums[i-1]:\\n continue\\n arr=[]\\n arr.append(nums[i])\\n\\n p1=i+1\\n p2=len(nums)-1\\n\\n # s= -1*arr[0]\\n while(p1<p2):\\n if(p1==i or nums[p1]+nums[p2]< -1*arr[0] ):\\n p1+=1\\n elif(p2==i or nums[p1]+nums[p2]> -1*arr[0] ):\\n p2-=1\\n else:\\n arr.append(nums[p1])\\n arr.append(nums[p2])\\n p1+=1\\n p2-=1\\n addable=tuple(sorted(arr))\\n resultdict[addable]=1\\n\\n arr=[]\\n arr.append(nums[i])\\n \\n arr=[]\\n for i in resultdict.keys():\\n arr.append(list(i))\\n\\n \\n return arr\\n \\n \\n\\n\\n\\n \\n \\n\\n\",\n \"runtime\": \"953\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n results = set()\\n firstseen = set()\\n for i, num in enumerate(nums):\\n if num in firstseen:\\n continue\\n firstseen.add(num)\\n res = set()\\n secondseen = set()\\n for x in nums[i+1:]:\\n if x in res:\\n results.add(tuple(sorted([num, -(num+x), x])))\\n res.add(-(num+x))\\n\\n return list(results)\",\n \"runtime\": \"978\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n ans = []\\n i = 0\\n while i<len(nums):\\n t = -nums[i]\\n\\n a = i+1\\n b = len(nums)-1\\n\\n while a<len(nums) and b>=0 and a<b:\\n if nums[a]+nums[b]==t:\\n temp = [nums[i],nums[a],nums[b]]\\n ans.append(temp)\\n\\n while a+1<len(nums) and nums[a+1]==nums[a]:\\n a+=1\\n a+=1\\n while b-1>=0 and nums[b-1]==nums[b]:\\n b-=1\\n b-=1 \\n \\n\\n elif nums[a]+nums[b]<t:\\n a+=1\\n else:\\n b-=1\\n\\n while i+1<len(nums) and nums[i]==nums[i+1]:\\n i+=1\\n i+=1\\n\\n return ans \\n\",\n \"runtime\": \"978\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = set()\\n dup = set()\\n seen = {}\\n\\n for i, val1 in enumerate(nums):\\n if val1 not in dup:\\n dup.add(val1)\\n for j, val2 in enumerate(nums[i + 1 : ]):\\n val3 = 0 - val1 - val2\\n if val3 in seen and seen[val3] == i:\\n res.add(tuple(sorted((val1, val2, val3))))\\n seen[val2] = i\\n\\n return res\",\n \"runtime\": \"1003\"\n },\n {\n \"code\": \"class Solution:\\n # Sort\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n res = set()\\n for i in range(len(nums)):\\n # We only match negative numbers with two sum\\n if nums[i] > 0:\\n break\\n if i == 0 or nums[i - 1] != nums[i]:\\n self.twoSum(nums, i, res)\\n return res\\n\\n # Two Pointers\\n def twoSum(self, nums: List[int], i: int, res: List[List[int]]):\\n low = i + 1\\n high = len(nums)\\n\\n while low < high:\\n sum = nums[i] + nums[low] + nums[high]\\n if sum < 0:\\n low += 1\\n elif sum > 0:\\n high -= 1\\n else:\\n res.add([nums[i], nums[low], nums[high]])\\n low += 1\\n high -= 1\\n # Skip duplicates\\n while low < high and nums[low] == nums[lo - 1]:\\n low += 1\\n\\n # Hash Set\\n def twoSum(self, nums: List[int], i: int, res: List[List[int]]):\\n seen = set()\\n j = i + 1\\n while j < len(nums):\\n complement = -(nums[i] + nums[j])\\n if complement in seen:\\n res.add([nums[i], nums[j], complement]) \\n # Skip duplicates\\n while j + 1 < len(nums) and nums[j] == nums[j + 1]:\\n j += 1\\n seen.add(nums[j]) \\n j += 1\\n\\n # No-Sort - HashSet\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n dups = set() # Needed to Skip duplicates as array is not sorted \\n seen = {}\\n res = set()\\n for i, val1 in enumerate(nums):\\n if val1 not in dups:\\n dups.add(val1)\\n for j, val2 in enumerate(nums[i + 1:]):\\n complement = -(val1 + val2)\\n if complement in seen and seen[complement] == i: \\n res.add(tuple(sorted([val1, val2, complement])))\\n # Need to map new complement to index to mark it as used\\n seen[val2] = i\\n return res\\n\\n \\n\",\n \"runtime\": \"1003\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res, dups = set(), set()\\n seen = {}\\n for i, val1 in enumerate(nums):\\n if val1 not in dups:\\n dups.add(val1)\\n for j, val2 in enumerate(nums[i + 1 :]):\\n complement = -val1 - val2\\n if complement in seen and seen[complement] == i:\\n res.add(tuple(sorted((val1, val2, complement))))\\n seen[val2] = i\\n return res\",\n \"runtime\": \"1028\"\n },\n {\n \"code\": \"# class Solution:\\n# def threeSum(self, nums: List[int]) -> List[List[int]]:\\n# result = []\\n# nums.sort()\\n# for i in range(len(nums)):\\n# if nums[i] > 0:\\n# break\\n \\n# if i > 0 and nums[i] == nums[i-1]:\\n# continue\\n\\n# left, right = i + 1, len(nums) - 1\\n# while left < right:\\n# if nums[i] + nums[left] + nums[right] > 0:\\n \\n# right -= 1\\n\\n# elif nums[i] + nums[left] + nums[right] < 0:\\n# left += 1\\n# else:\\n# result.append([nums[i], nums[left], nums[right]])\\n# left += 1\\n# while nums[left] == nums[left - 1] and left < right:\\n# left += 1\\n# return result\\n\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res, dups = set(), set()\\n seen = {}\\n for i, val1 in enumerate(nums):\\n if val1 not in dups:\\n dups.add(val1)\\n for j, val2 in enumerate(nums[i + 1 :]):\\n complement = -val1 - val2\\n if complement in seen and seen[complement] == i:\\n res.add(tuple(sorted((val1, val2, complement))))\\n seen[val2] = i\\n return res\\n\",\n \"runtime\": \"1028\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res, dups = set(), set()\\n seen = {}\\n for i, val1 in enumerate(nums):\\n if val1 not in dups:\\n dups.add(val1)\\n for j, val2 in enumerate(nums[i+1:]):\\n complement = -val1 - val2\\n if complement in seen and seen[complement] == i:\\n res.add(tuple(sorted((val1, val2, complement))))\\n seen[val2] = i\\n return res\",\n \"runtime\": \"1053\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res, dups = set(), set()\\n seen = {}\\n for i, val1 in enumerate(nums):\\n if val1 not in dups:\\n dups.add(val1)\\n for j, val2 in enumerate(nums[i + 1 :]):\\n complement = -val1 - val2\\n if complement in seen and seen[complement] == i:\\n res.add(tuple(sorted((val1, val2, complement))))\\n seen[val2] = i\\n return res\",\n \"runtime\": \"1053\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n \\n res = []\\n\\n n = len(nums)\\n for i in range(n): \\n if i != 0 and nums[i] == nums[i-1]:\\n continue\\n\\n j = i+1\\n k = n-1\\n\\n while j < k:\\n #print(f\\\"{i} {j} {k}\\\")\\n total = nums[i] + nums[j] + nums[k]\\n\\n if total < 0:\\n cur_j = nums[j]\\n while j < k and nums[j] == cur_j:\\n j += 1\\n\\n elif total > 0:\\n cur_k = nums[k]\\n while j < k and nums[k] == cur_k:\\n k -= 1\\n\\n else:\\n res.append([nums[i], nums[j], nums[k]])\\n \\n cur_j = nums[j]\\n while j < k and nums[j] == cur_j:\\n j += 1\\n \\n cur_k = nums[k]\\n while j < k and nums[k] == cur_k:\\n k -= 1\\n\\n return res\",\n \"runtime\": \"1077\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n seen = set()\\n res = set()\\n dups = set()\\n\\n\\n\\n for i in range(len(nums)):\\n if nums[i] not in dups:\\n dups.add(nums[i])\\n seen = set()\\n for j in range(i+1, len(nums)):\\n complement = -nums[i] - nums[j]\\n if complement in seen:\\n res.add(tuple(sorted([nums[i], complement, nums[j]])))\\n seen.add(nums[j])\\n\\n return res\",\n \"runtime\": \"1077\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n result=[]\\n for i in range(len(nums)):\\n if i>0 and nums[i-1]==nums[i]:\\n continue\\n j,k=i+1,len(nums)-1\\n while j<k:\\n if nums[i]+nums[j]+nums[k]==0:\\n result.append([nums[i],nums[j],nums[k]])\\n j+=1\\n k-=1\\n while j<k and nums[j]==nums[j-1]:\\n j+=1\\n while j<k and nums[k]==nums[k+1]:\\n k-=1\\n elif nums[i]+nums[j]+nums[k]>0:\\n k-=1\\n elif nums[i]+nums[j]+nums[k]<0:\\n j+=1\\n return result\\n \",\n \"runtime\": \"1102\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n \\n all_3sum = []\\n nums.sort()\\n \\n i=0\\n while i < len(nums) - 1:\\n \\n complement_set = set()\\n \\n if i > 0 and nums[i-1] == nums[i]:\\n i += 1\\n continue\\n\\n j = i + 1\\n while j < len(nums):\\n complement = - nums[i] - nums[j]\\n \\n if complement in complement_set:\\n all_3sum.append([nums[i], complement, nums[j]])\\n \\n while j < len(nums) - 1 and nums[j] == nums[j+1]:\\n j+=1\\n else:\\n complement_set.add(nums[j])\\n j += 1 \\n i += 1\\n \\n return all_3sum\\n \\n \\n \",\n \"runtime\": \"1102\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n t = 0\\n nums.sort()\\n if len(nums) >= 3 and len(set(nums)) == 1:\\n nums = nums[:3]\\n ans = []\\n seen = set([])\\n # print (nums)\\n for i, t in enumerate(nums):\\n t=-t\\n left = i+1\\n right = len(nums) -1\\n\\n while left < right:\\n if nums[left] + nums[right] > t:\\n right -=1\\n elif nums[left] + nums[right] < t:\\n left +=1\\n else:\\n ele = (nums[i], nums[left], nums[right])\\n if ele not in seen:\\n ans.append(ele)\\n seen |= set([ele])\\n left += 1\\n\\n return ans\",\n \"runtime\": \"1127\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n solution, seen = set(), set()\\n nums = sorted(nums)\\n for i in range(len(nums)):\\n if nums[i] not in seen:\\n seen.add(nums[i])\\n target = -nums[i]\\n two_sum_ans = self.two_sum(nums[i+1:], target)\\n for ans in two_sum_ans:\\n ans.append(nums[i])\\n solution.add(tuple(sorted(ans)))\\n return [list(sol) for sol in solution]\\n\\n def two_sum(self, arr, target):\\n t = {}\\n ans = []\\n for i in range(len(arr)):\\n if target - arr[i] in t:\\n ans.append([target-arr[i],arr[i]])\\n if arr[i] in t:\\n t[arr[i]]+=1\\n else:\\n t[arr[i]]=1\\n return ans\",\n \"runtime\": \"1127\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n\\n nums = sorted(nums) \\n length = len(nums)\\n\\n ret = [] \\n for i in range(length):\\n if i >= 1 and nums[i] == nums[i-1]:\\n continue \\n target = -nums[i]\\n\\n start = i+1 \\n end = length-1\\n while start < end:\\n if start >= i+2 and nums[start] == nums[start-1]:\\n start += 1 \\n continue \\n if end < length-1 and nums[end] == nums[end+1]:\\n end -= 1 \\n continue \\n sum = nums[start] + nums[end]\\n if sum > target:\\n end -= 1 \\n elif sum < target:\\n start += 1 \\n else:\\n ret.append([nums[i], nums[start], nums[end]])\\n start += 1 \\n end -= 1 \\n\\n return ret \\n\\n \",\n \"runtime\": \"1152\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums = sorted(nums)\\n answer = set()\\n for i in range(len(nums) - 2):\\n number = nums[i]\\n if number > 0:\\n break\\n l = i + 1\\n r = len(nums) - 1\\n while l < r:\\n if number + nums[l] + nums[r] > 0:\\n r -= 1\\n elif number + nums[l] + nums[r] < 0:\\n l += 1\\n else:\\n tmp = [number, nums[l], nums[r]]\\n answer.add(\\\" \\\".join(list(map(str, tmp))))\\n while l < r and nums[l] == tmp[1]:\\n l += 1\\n while l < r and nums[r] == tmp[2]:\\n r -= 1\\n return [list(map(int, elem.split())) for elem in answer]\",\n \"runtime\": \"1152\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = set()\\n dup = set()\\n for i, val1 in enumerate(nums):\\n if val1 in dup:\\n continue\\n dup.add(val1)\\n seen = defaultdict(int)\\n for j, val2 in enumerate(nums[i+1:]):\\n complement = -val1 - val2\\n if complement in seen and seen[complement] == i:\\n res.add(tuple(sorted((val1, val2, complement))))\\n seen[val2] = i\\n return res\",\n \"runtime\": \"1177\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n to_return = []\\n i = 0\\n while i < len(nums):\\n left, right = i+1, len(nums) - 1\\n while left < right:\\n if nums[left] + nums[right] + nums[i] == 0:\\n to_return.append([nums[i], nums[left], nums[right]])\\n while left < len(nums) - 1 and nums[left+1] == nums[left]:\\n left += 1\\n while right >= 1 and right > left and nums[right-1] == nums[right]:\\n right -= 1 \\n left += 1\\n right -= 1\\n \\n elif nums[left] + nums[right] + nums[i] < 0:\\n left += 1\\n elif nums[left] + nums[right] + nums[i] > 0:\\n right -= 1\\n \\n while i < len(nums) - 1 and nums[i+1] == nums[i]:\\n i += 1\\n \\n i += 1\\n return to_return\\n \\n\",\n \"runtime\": \"1177\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n triples = []\\n\\n nums = sorted(nums)\\n\\n for i_p in range(0, len(nums)):\\n if i_p != 0 and nums[i_p] == nums[i_p - 1]:\\n continue\\n\\n l_p = i_p + 1\\n r_p = len(nums) - 1\\n\\n if l_p >= len(nums) or r_p >= len(nums):\\n continue\\n\\n\\n while l_p < r_p:\\n cur_l_p = l_p\\n cur_r_p = r_p\\n\\n triple_sum = nums[i_p] + nums[l_p] + nums[r_p]\\n if triple_sum == 0:\\n triples.append([nums[i_p], nums[l_p], nums[r_p]])\\n\\n\\n while nums[l_p] == nums[cur_l_p] and l_p < r_p:\\n l_p += 1\\n while nums[r_p] == nums[cur_r_p] and l_p < r_p:\\n r_p -= 1\\n elif triple_sum < 0:\\n while nums[l_p] == nums[cur_l_p] and l_p < r_p:\\n l_p += 1\\n elif triple_sum > 0:\\n while nums[r_p] == nums[cur_r_p] and l_p < r_p:\\n r_p -= 1\\n\\n return triples\",\n \"runtime\": \"1201\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n res=[]\\n l = 0\\n while l<len(nums)-1:\\n r=len(nums)-1\\n mid = l+1\\n while mid < r:\\n if nums[l]+nums[r]+nums[mid]==0:\\n res.append([nums[l], nums[mid], nums[r]])\\n mid+=1\\n while nums[mid]==nums[mid-1] and mid < r:\\n mid+=1\\n elif nums[l]+nums[r]+nums[mid] > 0:\\n r-=1\\n while nums[r]==nums[r+1] and r>mid:\\n r-=1\\n else:\\n mid+=1\\n while nums[mid]==nums[mid-1] and mid < r:\\n mid+=1\\n l+=1\\n while l<len(nums) and nums[l]==nums[l-1]:\\n l+=1\\n \\n \\n return res\\n \",\n \"runtime\": \"1201\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort() \\n print(nums)\\n result = [] \\n avoid_dup = 0\\n for i in range(len(nums)):\\n\\n if i != 0 and avoid_dup == nums[i]:\\n continue\\n\\n left, right = i+1, len(nums)-1\\n\\n while left < right:\\n test_triplet = nums[i] + nums[left] + nums[right]\\n\\n if test_triplet == 0:\\n print('found: ', nums[i], nums[left], nums[right])\\n result.append([nums[i], nums[left], nums[right]])\\n \\n curr_elem = nums[left]\\n while left < len(nums) and curr_elem == nums[left]:\\n left += 1\\n\\n curr_elem = nums[right]\\n while right >= 0 and curr_elem == nums[right]:\\n right -= 1\\n \\n\\n elif test_triplet > 0:\\n curr_elem = nums[right]\\n while right >= 0 and curr_elem == nums[right]:\\n right -= 1\\n elif test_triplet < 0:\\n curr_elem = nums[left]\\n while left < len(nums) and curr_elem == nums[left]:\\n left += 1\\n \\n avoid_dup = nums[i]\\n return result\",\n \"runtime\": \"1226\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n nums.sort()\\n ans = []\\n i = 0\\n while i < n:\\n # for i in range(n):\\n l = i + 1\\n r = n - 1\\n while l < r:\\n if nums[l] + nums[r] + nums[i] == 0:\\n ans.append([nums[l], nums[r], nums[i]])\\n r -= 1\\n l += 1\\n while r >= 0 and nums[r] == nums[r+1]:\\n r -= 1\\n while l < n and nums[l] == nums[l - 1]:\\n l += 1\\n elif nums[l] + nums[r] + nums[i] > 0:\\n r -= 1\\n while r >= 0 and nums[r] == nums[r+1]:\\n r -= 1\\n else:\\n l += 1\\n while l < n and nums[l] == nums[l - 1]:\\n l += 1\\n i += 1\\n while i < n and nums[i] == nums[i - 1]:\\n i += 1\\n return ans\",\n \"runtime\": \"1226\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n solutions = []\\n nums = sorted(nums)\\n for i in range(len(nums)):\\n if i and nums[i] == nums[i - 1]:\\n continue\\n target = -nums[i]\\n j, k = i + 1, len(nums) - 1\\n while j < k:\\n if j > i + 1 and nums[j] == nums[j - 1]:\\n j += 1\\n continue\\n if k < len(nums) - 1 and nums[k] == nums[k + 1]:\\n k -= 1\\n continue\\n \\n sum_ = nums[j] + nums[k]\\n if sum_ < target:\\n j += 1\\n elif sum_ > target:\\n k -= 1\\n else:\\n solutions.append([nums[i], nums[j], nums[k]])\\n j += 1\\n k -= 1\\n \\n return solutions\\n\\n\",\n \"runtime\": \"1251\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n ans = []\\n \\n i = 0\\n while i < len(nums):\\n left, right = i + 1, len(nums) - 1\\n\\n while left < right:\\n target = nums[i] + nums[left] + nums[right]\\n\\n if target < 0:\\n temp = left\\n while temp < right and nums[temp] == nums[left]:\\n temp += 1\\n left = temp\\n elif target > 0:\\n temp = right\\n while left < temp and nums[temp] == nums[right]:\\n temp -= 1\\n right = temp\\n else:\\n ans.append([nums[i], nums[left], nums[right]])\\n temp = left\\n while temp < right and nums[temp] == nums[left]:\\n temp += 1\\n print(f'{temp=}')\\n left = temp\\n temp = right\\n while left < temp and nums[temp] == nums[right]:\\n temp -= 1\\n right = temp\\n \\n temp = i\\n while temp < len(nums) and nums[i] == nums[temp]:\\n temp += 1\\n i = temp\\n \\n return ans\",\n \"runtime\": \"1251\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n n = len(nums)\\n ans = []\\n for i in range(n):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n l = i + 1\\n r = n - 1\\n target = -nums[i]\\n while l < r:\\n if l > i + 1 and nums[l] == nums[l - 1]:\\n l += 1\\n continue\\n if r < n - 1 and nums[r] == nums[r + 1]:\\n r -= 1\\n continue\\n if nums[l] + nums[r] == target:\\n ans.append((nums[i], nums[l], nums[r]))\\n l += 1\\n r -= 1\\n elif nums[l] + nums[r] < target:\\n l += 1\\n else:\\n r -= 1\\n return ans\",\n \"runtime\": \"1276\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n ans = []\\n nums.sort()\\n prev = None\\n for i in range(len(nums)-2):\\n if nums[i] == prev:\\n continue\\n prev = nums[i]\\n left = i + 1\\n right = len(nums) - 1\\n prev_left = None\\n prev_right = None\\n while left < right:\\n if nums[i] + nums[left] + nums[right] == 0:\\n ans.append([nums[i], nums[left], nums[right]])\\n prev_left = nums[left]\\n prev_right = nums[right]\\n left += 1\\n right -= 1\\n elif nums[i] + nums[left] + nums[right] < 0:\\n prev_left = nums[left]\\n left += 1\\n else:\\n prev_right = nums[right]\\n right -= 1\\n \\n while left < right and nums[left] == prev_left:\\n left += 1\\n while left < right and nums[right] == prev_right:\\n right -= 1\\n \\n return ans\",\n \"runtime\": \"1276\"\n },\n {\n \"code\": \"'''\\nSort\\n\\nGo through each value, find target, and apply 2Sum on the array of numbers after the value\\n'''\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n triplets = []\\n firstValuesVisited = set()\\n for i in range(len(nums)-1):\\n if nums[i] not in firstValuesVisited:\\n triplets = self.twoSum(i, nums, triplets)\\n firstValuesVisited.add(nums[i])\\n return triplets\\n def twoSum(self, firstIndex: int, nums: List[int], triplets: List[int]):\\n firstValue = nums[firstIndex]\\n target = 0 - firstValue\\n index_map = dict()\\n secondValuesVisited = set()\\n for i in range(firstIndex+1, len(nums)):\\n if nums[i] not in secondValuesVisited:\\n difference = target - nums[i]\\n if difference in index_map:\\n secondValue = nums[index_map[difference]]\\n triplets.append([firstValue, secondValue, nums[i]])\\n secondValuesVisited.add(nums[i])\\n elif nums[i] not in index_map:\\n index_map[nums[i]] = i\\n return triplets\\n\\n\",\n \"runtime\": \"1301\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n answer = set()\\n n = len(nums)\\n for idx in range(n - 2):\\n left, right = idx + 1, n - 1\\n target = nums[idx]\\n while left < right:\\n _sum = nums[left] + nums[right] + target\\n if _sum == 0:\\n answer.add((nums[idx], nums[left], nums[right]))\\n left += 1\\n right -= 1\\n \\n # move the two pointers to skip uncessary calculation\\n while left < right and nums[left] == nums[left - 1]:\\n left += 1\\n while left < right and nums[right] == nums[right + 1]:\\n right -= 1\\n\\n elif _sum > 0:\\n right -= 1\\n else:\\n left += 1\\n\\n return answer\",\n \"runtime\": \"1301\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n #sort\\n nums.sort()\\n \\n n=len(nums)\\n res=set()\\n \\n for i in range(0,n-2): #0,...,n-2\\n left=i+1\\n right=n-1\\n val=nums[i]\\n if val>0:\\n break\\n while left<right:\\n sum1=val+nums[left]+nums[right]\\n \\n if sum1==0:\\n #if (val,nums[left],nums[right]) not in res:\\n res.add ((val,nums[left],nums[right]) )\\n left+=1\\n right-=1\\n elif sum1<0:\\n left+=1\\n else:\\n right-=1\\n return [list(s) for s in res]\\n\\n\",\n \"runtime\": \"1325\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n from collections import Counter\\n counter = Counter(nums)\\n\\n outputs = []\\n\\n def is_valid_triplet(x,y,z,counter):\\n if x == y and y == z:\\n return counter[x] > 2\\n \\n if x == y:\\n return counter[x] > 1 and counter[z] > 0\\n\\n if y == z:\\n return counter[y] > 1\\n\\n return counter[z] > 0\\n\\n\\n for x, cnt_x in counter.items():\\n for y, cnt_y in counter.items():\\n z = -(x+y)\\n # x<=y<=z\\n if y < x or z < y:\\n continue\\n\\n if is_valid_triplet(x,y,z,counter):\\n outputs.append([x,y,z])\\n\\n return outputs\\n\\n\\n\\n \\n \\n \\n\\n\\n \\n\\n\\n \",\n \"runtime\": \"1325\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n \\n store = defaultdict(set)\\n for i, x in enumerate(nums):\\n store[x].add(i)\\n \\n arr = list(store)\\n print(arr)\\n ans = set()\\n for i in range(len(arr)):\\n for j in range(len(arr)):\\n to_find = -arr[i]-arr[j]\\n if to_find in store:\\n if to_find == arr[i] or to_find == arr[j]:\\n if len(store[to_find]) <= 2: continue\\n if arr[i] == arr[j] and len(store[arr[i]]) < 2: continue\\n # print(tuple(sorted([nums[i], nums[j], to_find])))\\n ans.add(tuple(sorted([arr[i], arr[j], to_find])))\\n\\n return ans\\n\",\n \"runtime\": \"1350\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) < 3:\\n return []\\n nums.sort()\\n ret = set()\\n for i, val in enumerate(nums[:-2]):\\n left, right = i+1, len(nums)-1\\n if val > 0:\\n break\\n while left < right:\\n vsum = val + nums[left] + nums[right]\\n if vsum == 0:\\n trip = (val, nums[left], nums[right])\\n if trip not in ret:\\n ret.add(trip)\\n left += 1\\n right -= 1\\n elif vsum < 0:\\n left += 1\\n elif vsum > 0:\\n right -= 1\\n return list(ret)\\n\\n\\n \",\n \"runtime\": \"1350\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n triplets = set()\\n \\n pos_list, neg_list = [], []\\n zero_count = 0\\n for num in nums:\\n if num > 0:\\n pos_list.append(num)\\n elif num < 0:\\n neg_list.append(num)\\n else:\\n zero_count += 1\\n \\n pos_set, neg_set = set(pos_list), set(neg_list)\\n \\n if zero_count >= 1:\\n for pos in pos_set:\\n target = -pos\\n if target in neg_set:\\n triplets.add((target, 0, pos))\\n \\n if zero_count >= 3:\\n triplets.add((0, 0, 0))\\n \\n pos_length = len(pos_list)\\n for i in range(pos_length):\\n for j in range(i + 1, pos_length):\\n pos1 = min(pos_list[i], pos_list[j])\\n pos2 = max(pos_list[i], pos_list[j])\\n target = -(pos1 + pos2)\\n if target in neg_set:\\n triplets.add((target, pos1, pos2))\\n \\n neg_length = len(neg_list)\\n for i in range(neg_length):\\n for j in range(i + 1, neg_length):\\n neg1 = min(neg_list[i], neg_list[j])\\n neg2 = max(neg_list[i], neg_list[j])\\n target = -(neg1 + neg2)\\n if target in pos_set:\\n triplets.add((neg1, neg2, target))\\n\\n triplets = [list(triplet) for triplet in triplets]\\n\\n return triplets\\n\",\n \"runtime\": \"1375\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n exists = {}\\n for i in range(len(nums)):\\n exists[nums[i]] = i\\n \\n res = []\\n print(nums)\\n\\n i = 0\\n while i < len(nums) - 2:\\n j = i + 1\\n while j < len(nums) - 1:\\n target = 0 - (nums[i] + nums[j])\\n if target in exists and exists[target] > j:\\n res.append([nums[i], nums[j], target])\\n j += 1\\n while j < len(nums) - 1 and nums[j] == nums[j - 1]:\\n j += 1\\n i += 1\\n while i < len(nums) - 2 and nums[i] == nums[i - 1]:\\n i += 1\\n return res\\n\",\n \"runtime\": \"1375\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n s_nums = sorted(nums)\\n i, j, k = 0, 1, len(nums)-1\\n threesomes = set()\\n for i in range(len(nums)-2):\\n target = -1 * s_nums[i]\\n j = i + 1\\n k = len(nums)-1\\n while j < k:\\n curr_sum = s_nums[j] + s_nums[k]\\n if curr_sum == target:\\n threesomes.add((s_nums[i], s_nums[j], s_nums[k]))\\n j+=1\\n k-=1\\n elif curr_sum < target:\\n j += 1\\n else:\\n k -= 1\\n return list(threesomes)\\n \",\n \"runtime\": \"1449\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n # Naive solution is O(n^3). Not even gonna bother with that. \\n\\n # If we sort it starts O(N log N). And then we do n pass-es using two pointers that are O(n). Which is O(n^2). So that's not bad.\\n nums.sort()\\n output = set()\\n for fixed_index in range(len(nums) - 2):\\n fixed = nums[fixed_index]\\n left_ptr = fixed_index + 1\\n right_ptr = len(nums) - 1\\n while left_ptr < right_ptr:\\n summed = fixed + nums[left_ptr] + nums[right_ptr]\\n if summed == 0:\\n output.add((fixed, nums[left_ptr], nums[right_ptr]))\\n left_ptr += 1\\n right_ptr -= 1\\n elif summed < 0:\\n left_ptr += 1\\n else:\\n right_ptr -= 1\\n return output\",\n \"runtime\": \"1449\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n n = len(nums)\\n if (nums[0] > 0 and nums[n-1] > 0) or (nums[0] < 0 and nums[n-1] < 0):\\n return []\\n ans = set()\\n\\n \\n for i, num in enumerate(nums):\\n if num > 0: break\\n l, h = i+1, n-1\\n while l < h:\\n n1, n2 = nums[l], nums[h]\\n if num + n1 + n2 == 0:\\n ans.add((num, n1, n2))\\n h-=1\\n l+=1\\n else:\\n if num + n1 + n2 > 0: h -= 1\\n else: l += 1\\n \\n return ans\\n\\n \",\n \"runtime\": \"1474\"\n },\n {\n \"code\": \"'''\\nSort\\n\\nGo through each value, find target, and apply 2Sum on the array of numbers after the value\\n'''\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n triplets = []\\n firstValuesVisited = set()\\n for i in range(len(nums)-1):\\n if nums[i] not in firstValuesVisited:\\n triplets = triplets + self.twoSum(nums[i], nums[i+1:], triplets)\\n firstValuesVisited.add(nums[i])\\n return triplets\\n def twoSum(self, firstValue: int, nums: List[int], cur_triplets: List[int]):\\n target = 0 - firstValue\\n index_map = dict()\\n secondValues = set()\\n triplets = []\\n for i in range(len(nums)):\\n if nums[i] not in secondValues:\\n difference = target - nums[i]\\n if difference in index_map:\\n triplets.append([firstValue, nums[i], nums[index_map[difference]]])\\n secondValues.add(nums[i])\\n elif nums[i] not in index_map:\\n index_map[nums[i]] = i\\n return triplets\\n\\n\",\n \"runtime\": \"1474\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n \\n res=set()\\n nums.sort()\\n for i,val in enumerate(nums):\\n #if( i>0 and val==nums[i-1]):\\n #print(\\\"value and nums[i-1] is\\\",i,val,nums[i-1])\\n #continue\\n l=i+1\\n r=len(nums)-1\\n while(l<r):\\n sum=val+nums[l]+nums[r]\\n if(sum>0):\\n r-=1\\n elif(sum<0):\\n l+=1\\n else:\\n res.add((val,nums[l],nums[r]))\\n l+=1\\n r-=1\\n #while(nums[l]==nums[l-1] and l<r):\\n #l+=1\\n return res\\n\\n\\n\",\n \"runtime\": \"1499\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n print(nums)\\n idx = 0\\n triplets = set()\\n while idx < len(nums) - 2:\\n if True:\\n \\n low = idx + 1\\n high = len(nums) - 1\\n target = -nums[idx]\\n \\n\\n while low < high:\\n \\n sum = nums[low] + nums[high]\\n if sum == target:\\n triplets.add((nums[idx], nums[low], nums[high]))\\n low += 1\\n high -= 1\\n \\n elif sum > target:\\n high -= 1\\n else:\\n low += 1\\n\\n idx += 1\\n return list(triplets)\\n \",\n \"runtime\": \"1499\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n answers = set() # Use a set to avoid duplicates\\n\\n for i in range(len(nums)):\\n left = i + 1\\n right = len(nums) - 1\\n\\n while left < right:\\n total = nums[i] + nums[left] + nums[right]\\n if total == 0:\\n # Add the triplet as a tuple to the set\\n answers.add((nums[i], nums[left], nums[right]))\\n left += 1\\n right -= 1\\n elif total < 0:\\n left += 1\\n else:\\n right -= 1\\n \\n # Convert the set of tuples back into a list of lists\\n return [list(triplet) for triplet in answers]\\n\",\n \"runtime\": \"1524\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n\\n \\n# -1, 0, 1, 2, -1, -4\\n# 0 1 2 3 4 5\\n\\n# i j k \\n\\n\\n# -4 -1 -1 0 1 2 \\n# 0 1 2 3 4 5\\n\\n# i =0\\n\\n ans = set()\\n \\n nums.sort()\\n for i in range(len(nums) -2):\\n left = i+1 \\n right = len(nums) -1\\n \\n while left < right:\\n sum = nums[i] + nums[left] + nums[right]\\n if sum ==0 :\\n ans.add((nums[i],nums[left],nums[right]))\\n left += 1\\n right -=1\\n elif sum > 0:\\n right-=1\\n else:\\n left+=1\\n\\n return [list(triplet) for triplet in ans]\\n\\n\\n\",\n \"runtime\": \"1524\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n ans = set()\\n nums.sort()\\n for i in range(n):\\n if i > 0 and nums[i-1] == nums[i]:\\n continue\\n seen = {}\\n for j in range(i+1,n):\\n target = -nums[i] - nums[j]\\n if target in seen:\\n ans.add(tuple((nums[i],nums[j],target)))\\n while j < n-1 and nums[j] == nums[j+1]:\\n j = j + 1\\n seen[nums[j]] = i\\n return ans \\n \",\n \"runtime\": \"1549\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n target = 0\\n nums = sorted(nums)\\n s = set()\\n output = []\\n len_nums = len(nums)\\n for i0 in range(len_nums):\\n i1 = i0 + 1\\n i2 = len_nums - 1\\n while i1 < i2:\\n sum_nums = nums[i0] + nums[i1] + nums[i2]\\n if sum_nums == target:\\n s.add((nums[i0], nums[i1], nums[i2]))\\n i1 += 1\\n i2 -= 1\\n elif sum_nums < target:\\n i1 += 1\\n else:\\n i2 -= 1\\n output = list(s)\\n return output\\n\",\n \"runtime\": \"1549\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n output = set()\\n for i in range(len(nums) - 2):\\n j, k = i + 1, len(nums) - 1\\n while j < k:\\n three_sum = nums[i] + nums[j] + nums[k] \\n if three_sum > 0:\\n k -= 1\\n elif three_sum < 0:\\n j += 1\\n else:\\n output.add((nums[i], nums[j], nums[k]))\\n j += 1\\n k -= 1\\n return list(output)\\n\\n\",\n \"runtime\": \"1573\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n triplets = set()\\n for i in range(0,len(nums)-2):\\n j = i + 1\\n k = len(nums) - 1\\n while j < k:\\n potential_sum = nums[i] + nums[j] + nums[k]\\n if potential_sum > 0:\\n k -= 1\\n elif potential_sum < 0:\\n j += 1\\n else:\\n triplets.add((nums[i],nums[j],nums[k]))\\n j += 1\\n k -= 1\\n return triplets \",\n \"runtime\": \"1573\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res =set()\\n # left = 1\\n # right = len(nums) - 1\\n nums.sort()\\n if len(nums) < 3:\\n return [] \\n for i in range(len(nums)-2):\\n left = i + 1\\n right = len(nums) - 1\\n while left < right:\\n summ = nums[left] + nums[i] + nums[right]\\n if summ > 0:\\n right -=1 \\n elif summ < 0:\\n left += 1\\n else:\\n \\n res.add((nums[left],nums[i],nums[right]))\\n left += 1\\n right -= 1\\n return res\\n\\n\\n\",\n \"runtime\": \"1598\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n a = set()\\n n = len(nums)\\n nums.sort()\\n output = []\\n\\n for i in range(n):\\n j = i+1\\n k = n-1\\n while j<k:\\n sum = nums[i] + nums[j] + nums[k]\\n if sum == 0:\\n a.add((nums[i],nums[j],nums[k]))\\n j += 1\\n k -=1\\n elif sum < 0:\\n j += 1\\n elif sum > 0:\\n k -=1\\n output = list(a)\\n return output\\n\",\n \"runtime\": \"1598\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n ret = set()\\n nums.sort()\\n for i, n in enumerate(nums):\\n if n > 0:\\n break\\n for res in self.twoSum(nums, i+1, -n):\\n ret.add(tuple(sorted([nums[i], nums[res[0]], nums[res[1]]])))\\n\\n return list(ret)\\n\\n def twoSum(self, nums, i, target):\\n ret = []\\n l = i\\n r = len(nums) - 1\\n\\n while l < r:\\n # print(l, r, ret)\\n if nums[l] + nums[r] == target:\\n ret.append((l, r))\\n l += 1\\n while l + 1 < len(nums) and nums[l-1] == nums[l]:\\n l += 1\\n elif nums[l] + nums[r] < target:\\n l += 1\\n elif nums[l] + nums[r] > target:\\n r -= 1\\n\\n return ret\",\n \"runtime\": \"1623\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n ans = []\\n nums.sort()\\n \\n for i in range(0, len(nums)-2):\\n if i >0 and nums[i]==nums[i-1]:\\n continue\\n l = i+1\\n r = len(nums)-1\\n\\n while(l<r):\\n if l>i+1 and nums[l]==nums[l-1]:\\n l+=1\\n continue\\n\\n if r<len(nums)-2 and nums[r]==nums[r+1]:\\n r-=1\\n continue\\n\\n if nums[i]+nums[l]+nums[r]==0:\\n ans.append([nums[i], nums[l], nums[r]])\\n l+=1\\n r-=1\\n elif nums[i]+nums[l]+nums[r]<0:\\n l+=1\\n else:\\n r-=1\\n return ans\",\n \"runtime\": \"1623\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n result = set()\\n\\n for i in range(len(nums) - 2):\\n left = i + 1\\n right = len(nums) - 1\\n \\n while left < right:\\n current_sum = nums[i] + nums[left] + nums[right]\\n\\n if current_sum < 0:\\n left += 1\\n elif current_sum > 0:\\n right -= 1\\n else:\\n result.add((nums[i], nums[left], nums[right]))\\n left += 1\\n right -= 1\\n \\n return list(result)\",\n \"runtime\": \"1648\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n if len(nums) < 3:\\n return []\\n\\n resSet = set()\\n nums.sort()\\n\\n def twoSum(curr):\\n r = len(nums) - 1\\n l = curr + 1\\n \\n while l < r:\\n currSum = nums[curr] + nums[l] + nums[r]\\n \\n if currSum == 0:\\n resSet.add((nums[curr],nums[l],nums[r]))\\n r -= 1\\n l += 1\\n elif currSum > 0:\\n r -= 1\\n else:\\n l += 1\\n \\n for i in range(0, len(nums), 1):\\n if i == len(nums) - 3:\\n if nums[i] + nums[i + 1] + nums[i + 2] == 0:\\n resSet.add((nums[i],nums[i + 1],nums[i + 2]))\\n break\\n else:\\n twoSum(i)\\n\\n return [val for val in resSet]\\n\",\n \"runtime\": \"1648\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n l=set()\\n for i in range(len(nums)-2):\\n if i > 0 and nums[i-1] == nums[i]: #suppose -3,-3,1,2 target is 0 there wull [-3,1,2],[-3,1,2] so -3 is only started with one.\\n continue\\n ###########Now we have to do two sum\\n j=i+1\\n k=len(nums)-1\\n #target=-nums[i]\\n while(j<k):\\n threesum = nums[j]+nums[k]+nums[i]\\n if threesum < 0:\\n #if nums[j]+nums[k]<target:\\n j+=1\\n elif threesum > 0:\\n #elif nums[j]+nums[k]>target:\\n k-=1\\n else:\\n l.add((nums[i],nums[j],nums[k]))\\n j+=1\\n k-=1\\n return list(l) \\n \\n \\n \",\n \"runtime\": \"1673\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n\\n nums.sort()\\n ans = []\\n unique = set()\\n\\n for i in range(len(nums) - 2):\\n target = nums[i]\\n l, r = i + 1, len(nums) - 1\\n while l < r:\\n two_sum = nums[l] + nums[r]\\n if two_sum == -target:\\n single_ans = (target, nums[l], nums[r])\\n if single_ans not in unique:\\n ans.append(single_ans)\\n unique.add(single_ans)\\n l += 1\\n r -= 1\\n elif two_sum < -target:\\n l += 1\\n elif two_sum > -target:\\n r -= 1\\n return ans\\n\\n\\n \",\n \"runtime\": \"1673\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[int]:\\n # want a + b + c = 0\\n n = len(nums)\\n nums.sort()\\n ans = set()\\n for idx in range(0, n - 2):\\n a = nums[idx]\\n b_idx = idx + 1 # next idx\\n c_idx = n - 1 # last idx\\n while b_idx < c_idx:\\n b, c = nums[b_idx], nums[c_idx]\\n sum_abc = a + b + c\\n if sum_abc == 0:\\n ans.add((a, b, c)) # always sorted\\n\\n # We need to update both indexes\\n b_idx += 1 # updating only b_idx means duplicating search for -(a + c)\\n c_idx -= 1 # updating only c_idx means duplicating search for -(a + b)\\n elif sum_abc > 0:\\n c_idx -= 1 # make sum smaller\\n else:\\n b_idx += 1 # make sum greater\\n return ans\\n\",\n \"runtime\": \"1697\"\n },\n {\n \"code\": \"class Solution: #3\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n ans_set = set()\\n for i in range(len(nums)):\\n l = i + 1\\n r = len(nums) - 1\\n target = -nums[i]\\n while l < r:\\n if nums[l] + nums[r] == target:\\n ans_set.add((nums[i], nums[l], nums[r]))\\n l += 1\\n r -= 1\\n elif nums[l] + nums[r] < target:\\n l += 1\\n elif nums[l] + nums[r] > target:\\n r -= 1\\n return list(ans_set)\\n\\n\\n \",\n \"runtime\": \"1697\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n #nums.sort() # Sort the array to handle duplicates more easily\\n res = set() # Set to store unique triplets\\n\\n if sum(nums)==0:\\n if len(set(nums))==1:\\n l=[[0,0,0]]\\n return l\\n \\n for i in range(len(nums)):\\n # Use a set to track the complements\\n complements = set()\\n for j in range(i + 1, len(nums)):\\n third = -(nums[i] + nums[j])\\n if third in complements:\\n # We have found a valid triplet\\n res.add(tuple(sorted((nums[i], nums[j], third))))\\n complements.add(nums[j])\\n \\n # Convert the set of tuples back to a list of lists\\n return [list(triplet) for triplet in res]\",\n \"runtime\": \"1722\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n nums.sort()\\n s = set()\\n for i in range( len(nums)-2):\\n j = i+1\\n k = len(nums)-1\\n while j < k:\\n if nums[i] > 0:\\n break\\n if nums[i] + nums[j] + nums[k] == 0:\\n if (nums[i],nums[j],nums[k]) not in s:\\n res.append([nums[i],nums[j],nums[k]])\\n s.add((nums[i],nums[j],nums[k]))\\n j += 1\\n k -= 1\\n elif nums[i] + nums[j] + nums[k] > 0:\\n k -= 1\\n else:\\n j += 1\\n return res\\n\",\n \"runtime\": \"1722\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n result = set()\\n l = len(nums)\\n\\n for i in range(l-2):\\n j = i+1\\n k = l-1\\n while j < k:\\n if nums[i] + nums[j] + nums[k] > 0:\\n k -= 1\\n elif nums[i] + nums[j] + nums[k] < 0:\\n j += 1\\n else:\\n result.add((nums[i],nums[j],nums[k]))\\n j += 1\\n k -= 1\\n\\n return result\\n \\n\\n\\n\",\n \"runtime\": \"1747\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n result = []\\n nums.sort()\\n\\n\\n for idx, value in enumerate(nums):\\n\\n left = idx + 1 \\n right = len(nums) - 1 \\n\\n while left < right:\\n total = nums[idx] + nums[left] + nums[right]\\n\\n if total == 0:\\n res = (nums[idx], nums[left], nums[right])\\n result.append(res)\\n \\n left += 1 \\n right -= 1 \\n \\n elif total < 0:\\n left += 1 \\n elif total > 0:\\n right -= 1 \\n \\n return set(result) \\n \",\n \"runtime\": \"1747\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n triplets = set()\\n nums = sorted(nums)\\n for i in range(len(nums)):\\n j = i + 1\\n k = len(nums) - 1\\n\\n while j < k:\\n sm = nums[i] + nums[j] + nums[k]\\n\\n if sm == 0:\\n triplets.add((nums[i], nums[j], nums[k]))\\n j += 1\\n k -= 1\\n elif sm < 0:\\n j += 1\\n else:\\n k -= 1\\n \\n result = list(triplets)\\n\\n return result\",\n \"runtime\": \"1772\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums = sorted(nums)\\n ret= set()\\n for i in range(len(nums)):\\n first = nums[i]\\n start_p = i + 1\\n end_p = len(nums)-1\\n while start_p < end_p:\\n second = nums[start_p]\\n third = nums[end_p]\\n if first + second + third == 0:\\n ret.add((first, second, third))\\n start_p += 1\\n end_p -= 1\\n elif first + second + third < 0:\\n start_p += 1\\n elif first + second + third > 0:\\n end_p -= 1\\n return ret\\n \\n\\n\",\n \"runtime\": \"1772\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n if len(nums)<3:\\n return []\\n\\n nums.sort()\\n ans = set()\\n\\n for i in range(len(nums)-2):\\n j,k=i+1,len(nums)-1\\n while j<k:\\n if nums[j]+nums[k]+nums[i]==0:\\n if (nums[i],nums[j],nums[k]) not in ans:\\n ans.add((nums[i],nums[j],nums[k]))\\n j+=1\\n k-=1\\n elif nums[j]+nums[k]+nums[i]>0:\\n k-=1\\n else:\\n j+=1\\n return ans\\n \\n\\n \",\n \"runtime\": \"1797\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n res = set()\\n for k in range(len(nums) - 2):\\n l = k+1\\n r = len(nums) - 1\\n while r > l:\\n sum_ij = nums[l] + nums[r]\\n if sum_ij == -1 * nums[k]:\\n res.add((nums[k], nums[l], nums[r]))\\n l += 1\\n r -= 1\\n elif sum_ij > -1 * nums[k]:\\n r -= 1\\n else:\\n l += 1\\n return res \\n\",\n \"runtime\": \"1797\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n res = set()\\n\\n for i, val in enumerate(nums):\\n target = 0 - val\\n l, r = i+1, len(nums)-1 # two pointers\\n while l < r:\\n amt = nums[l] + nums[r]\\n if amt < target:\\n l += 1\\n elif amt > target:\\n r -= 1\\n else:\\n res.add((val, nums[l], nums[r]))\\n l += 1\\n \\n # I think there's something smart to do with this\\n # while nums[l] == nums[l-1]:\\n # l += 1\\n # while nums[r] == nums[r]\\n return list(res)\",\n \"runtime\": \"1821\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n result = []\\n first = {}\\n for i in range(len(nums)-2):\\n if nums[i] in first:\\n continue\\n seen = {}\\n for j in range(i + 1, len(nums)):\\n if nums[j] in seen and seen[nums[j]] > 1:\\n continue\\n if j > i + 1:\\n target = 0 - (nums[i] + nums[j])\\n if target in seen and nums[j] not in seen or (target in seen and nums[j] == target and seen[target] == 1):\\n result.append([nums[i], target, nums[j]])\\n seen[nums[j]] = 1 if nums[j] not in seen else seen[nums[j]] + 1\\n else:\\n seen[nums[j]] = 1\\n \\n first[nums[i]] = 1\\n \\n return result\\n\",\n \"runtime\": \"1821\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums = sorted(nums)\\n res = set()\\n for i in range(len(nums)):\\n if nums[i] > 0:\\n break\\n target = -nums[i]\\n l = i + 1\\n r = len(nums) - 1\\n while l < r:\\n if nums[l] + nums[r] == target:\\n res.add((nums[i], nums[l], nums[r]))\\n l += 1\\n elif nums[l] + nums[r] > target:\\n r -= 1\\n else:\\n l += 1\\n return [list(item) for item in list(res)]\",\n \"runtime\": \"1846\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n import ast\\n def convert_to_list(triples):\\n if len(triples) == 0:\\n return []\\n return [ast.literal_eval(t) for t in triples]\\n\\n pos = {}\\n if len(nums) < 2:\\n return []\\n unique_values = list(set(nums))\\n if len(unique_values) == 1 and len(nums) >= 3 and nums.count(0) >= 1:\\n return [[0,0,0]]\\n nums.sort()\\n for i in range(len(nums)):\\n j = i + 1\\n k = len(nums) - 1\\n while j < k:\\n n_1 = nums[i]\\n n_2 = nums[j]\\n n_3 = nums[k]\\n sum_n = n_1 + n_2 + n_3\\n if sum_n == 0:\\n t_l = [n_1,n_2,n_3]\\n pos[str(t_l)] = 1\\n j += 1\\n k -= 1\\n elif sum_n < 0:\\n j += 1\\n else:\\n k -= 1\\n return convert_to_list(pos.keys())\\n\\n\",\n \"runtime\": \"1846\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n res = set()\\n\\n for i in range(len(nums)):\\n l = i + 1\\n r = len(nums) - 1\\n while l < r:\\n if nums[i] + nums[l] + nums[r] == 0:\\n res.add(tuple((nums[i], nums[l], nums[r])))\\n l += 1\\n r -= 1\\n elif nums[i] + nums[l] + nums[r] < 0:\\n l += 1\\n else:\\n r -= 1\\n return list(res)\\n\\n # Time: O(n2)\\n # Space: O(n)\",\n \"runtime\": \"1871\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n \\n nums.sort()\\n ans = set()\\n\\n for i in range(len(nums) - 2):\\n left, right = i+1, len(nums) - 1\\n\\n while left < right:\\n if nums[left] + nums[right] + nums[i] == 0:\\n ans.add((nums[left], nums[right], nums[i]))\\n left += 1\\n right -= 1\\n elif nums[left] + nums[right] + nums[i] < 0:\\n left += 1\\n else:\\n right -= 1\\n \\n return ans\",\n \"runtime\": \"1871\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n result = set()\\n nums.sort()\\n print(nums)\\n for i in range(len(nums)):\\n a = nums[i]\\n #print(i,a)\\n if a > 0:\\n #print(a)\\n return [list(t) for t in result]\\n \\n p_left = i+1\\n p_right = len(nums)-1\\n\\n while p_left < p_right:\\n b = nums[p_left]\\n c = nums[p_right]\\n #print(a,b,c)\\n if a+b+c == 0:\\n #print(a,b,c)\\n result.add((a,b,c))\\n p_left += 1\\n elif a+b+c > 0:\\n p_right -= 1\\n else:\\n p_left += 1\\n \\n #print(result)\\n return [list(t) for t in result]\\n\\n\\n \",\n \"runtime\": \"1896\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n d = {}\\n for x in nums:\\n if x not in d:\\n d[x] = 1\\n else:\\n d[x]+=1\\n has_zeros = 0 in d\\n nums.sort()\\n x = [0,1,2]\\n ret = []\\n i = 0\\n seen = set()\\n if has_zeros and d[0] >= 3: ret.append([0,0,0])\\n if nums[-1] <= 0: return ret\\n while i < len(nums) and nums[i] < 0:\\n j = 1\\n while i+j < len(nums):# and nums[i] + nums[i+j] < 0:\\n rem = nums[i] + nums[i+j]\\n if -rem in d and ((-rem!=nums[i] and -rem!=nums[i+j]) or d[-rem]>1):\\n l = [-rem,nums[i],nums[i+j]]\\n l.sort()\\n l_str = str(l)\\n if l_str not in seen:\\n ret.append(l)\\n seen.add(l_str)\\n j+=1\\n i+=1\\n\\n return ret\",\n \"runtime\": \"1896\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums = sorted(nums)\\n n = len(nums)\\n result = set()\\n\\n for i in range(n):\\n target = -nums[i]\\n \\n left = i + 1\\n right = n - 1\\n\\n while left < right:\\n cur_sum = nums[left] + nums[right]\\n \\n if cur_sum == target:\\n result.add((nums[left], nums[right], nums[i]))\\n \\n if cur_sum > target:\\n right -= 1\\n else:\\n left += 1\\n\\n return result\\n\\n\",\n \"runtime\": \"1921\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n data = set()\\n nums.sort()\\n\\n for i in range(len(nums)-2):\\n if nums[i] > 0:\\n break\\n\\n x = i+1\\n y = len(nums) - 1\\n\\n while x < y:\\n result = nums[i] + nums[x] + nums[y]\\n if result == 0:\\n data.add((nums[i], nums[x], nums[y]))\\n x += 1\\n elif result > 0:\\n y -= 1\\n else:\\n x +=1\\n \\n return data\\n\",\n \"runtime\": \"1921\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n if len(nums)==3 and sum(nums)==0:\\n return [nums]\\n nums.sort()\\n ans = set()\\n for i in range(len(nums)-2):\\n j, k = i+1, len(nums)-1\\n while j<k:\\n if nums[j] + nums[k] > -nums[i]:\\n k -= 1\\n elif nums[j] + nums[k] < -nums[i]:\\n j += 1\\n else:\\n ans.add(tuple([nums[i], nums[j], nums[k]]))\\n j+=1\\n k-=1 \\n return ans\\n\\n\\n\",\n \"runtime\": \"1945\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n\\n # error1: miss while left < right\\n # First .sort(). Then, for each nums[i], find combinations in the rest of nums by \\n # if nums[i] + nums[left] + nums[right] > 0: right -= 1; if nums[i] + nums[left] + nums[right] < 0: left += 1; \\n # T: O(n**2)\\n # S: O(n)\\n\\n nums.sort()\\n ans_set = set()\\n for i in range(len(nums)-2):\\n left, right = i+1, len(nums)-1\\n while left < right:\\n if nums[i] + nums[left] + nums[right] == 0:\\n ans_set.add((nums[i], nums[left], nums[right]))\\n left += 1\\n right -= 1\\n elif nums[i] + nums[left] + nums[right] > 0:\\n right -= 1\\n elif nums[i] + nums[left] + nums[right] < 0:\\n left += 1\\n return list(ans_set)\\n\\n\\n\\n\\n\\n\\n\\n \\n\\n \\n\\n\\n\\n \",\n \"runtime\": \"1945\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n n = len(nums) - 2\\n result = set()\\n\\n for i in range(n):\\n num = nums[i]\\n\\n left = i + 1\\n right = len(nums) - 1\\n\\n while left < right:\\n curr_num = num + nums[left] + nums[right]\\n if curr_num == 0:\\n arr = (num, nums[left], nums[right])\\n result.add(arr)\\n left += 1\\n elif curr_num < 0:\\n left += 1\\n else:\\n right -= 1\\n\\n return [list(item) for item in result]\",\n \"runtime\": \"1970\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n \\n nums.sort()\\n result = set()\\n\\n for i in range(len(nums) - 2):\\n \\n j, k = i + 1, len(nums) - 1\\n \\n while j < k:\\n\\n ss = nums[i] + nums[j] + nums[k]\\n triplet = (nums[i],nums[j],nums[k])\\n\\n if ss == 0:\\n result.add(triplet)\\n j, k = j + 1, k - 1\\n \\n elif ss < 0:\\n j += 1\\n \\n else:\\n k -= 1\\n \\n return list(result)\",\n \"runtime\": \"1970\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n '''\\n if list(set(nums)) == [0]:\\n out=[0,0,0]\\n return [out]\\n '''\\n count = dict(collections.Counter(nums))\\n nums = []\\n for k, v in count.items():\\n if v >3:\\n for _ in range(3):\\n nums.append(k)\\n else:\\n for _ in range(v):\\n nums.append(k)\\n\\n n = len(nums)\\n nums.sort()\\n output = []\\n visited = [False] * n\\n for i in range(n): \\n temp = nums[i]\\n left = 0\\n right = n - 1\\n\\n while left < right: \\n if right == i:\\n right-=1\\n if left == i:\\n left += 1\\n\\n if left != -1:\\n two_sum = nums[left] + nums[right] \\n if two_sum == -temp:\\n if left != right != i:\\n # and \\\\\\n #visited[left]* visited[right]* visited[i]==0:\\n output.append([nums[left], nums[right], nums[i]]) \\n #visited[left], visited[right], visited[i] = True, True, True\\n right -=1\\n elif two_sum > -temp:\\n right -=1\\n elif two_sum < -temp:\\n left +=1 \\n # filter_unique:\\n \\n hash_map = {}\\n for o in output:\\n _x = o\\n _x.sort() \\n if hash_map.get(str(_x), None) == None:\\n hash_map[str(_x)] = o\\n \\n return list(hash_map.values())\\n \\n #return output\\n '''\\n ## input = arrays\\n ## output = three combos to be equal to 0\\n #nums.sort()\\n\\n left = 0\\n right = len(nums) - 1\\n \\n temp = 0\\n\\n output = []\\n \\n for i in range(len(nums)): \\n for j in range(len(nums)):\\n for k in range(len(nums)):\\n if nums[i] + nums[j] + nums[k] == 0:\\n if i!=j and i!=k and j!=k:\\n temp = [nums[i],nums[j],nums[k]]\\n temp.sort()\\n if temp not in output:\\n output.append(temp)\\n\\n return output\\n '''\",\n \"runtime\": \"1995\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n\\n # error1: miss while left < right\\n # First .sort(). Then, for each nums[i], find combinations in the rest of nums by \\n # if nums[i] + nums[left] + nums[right] > 0: right -= 1; if nums[i] + nums[left] + nums[right] < 0: left += 1; \\n # T: O(n^2)\\n # S: O(n)\\n\\n nums.sort()\\n ans_set = set()\\n\\n left, right = 0, 0\\n for i in range(len(nums)-2):\\n left, right = i + 1, len(nums)-1\\n while left < right:\\n if nums[i] + nums[left] + nums[right] == 0:\\n ans_set.add((nums[i], nums[left], nums[right]))\\n left += 1\\n right -= 1 \\n elif nums[i] + nums[left] + nums[right] > 0:\\n right -= 1\\n elif nums[i] + nums[left] + nums[right] < 0:\\n left += 1\\n \\n return list(ans_set)\\n \\n\\n \\n\\n\\n\\n \",\n \"runtime\": \"1995\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n visited = set()\\n res = []\\n\\n for i in range(len(nums)):\\n if nums[i] in visited:\\n continue\\n visited.add(nums[i])\\n l = i + 1\\n r = len(nums) - 1\\n\\n while l < r:\\n x = nums[i]\\n y = nums[l]\\n z = nums[r]\\n\\n if x + y + z == 0:\\n res.append([x, y, z])\\n r = bisect.bisect_left(nums, z) - 1\\n l = bisect.bisect_right(nums, y)\\n elif x + y + z > 0:\\n r = bisect.bisect_left(nums, z) - 1\\n else:\\n l = bisect.bisect_right(nums, y)\\n\\n return res\\n \\n\\n\\n\",\n \"runtime\": \"2020\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n\\n ans = set()\\n for i in range(len(nums) - 2):\\n # print(nums[index])\\n target = -1 * nums[i]\\n seen = set()\\n \\n for j in range(i + 1, len(nums)):\\n # print(j, nums[j])\\n current_target = target - nums[j]\\n if current_target in seen:\\n ans.add((nums[i], current_target, nums[j]))\\n \\n seen.add(nums[j])\\n\\n return ans\\n\\n\",\n \"runtime\": \"2020\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n\\n # error1: miss while left < right\\n # First .sort(). Then, for each nums[i], find combinations in the rest of nums by \\n # if nums[i] + nums[left] + nums[right] > 0: right -= 1; if nums[i] + nums[left] + nums[right] < 0: left += 1; \\n # T: O(n**2)\\n # S: O(n)\\n\\n nums.sort()\\n ans_set = set()\\n for i in range(len(nums)-2):\\n left, right = i+1, len(nums)-1\\n while left < right:\\n if nums[i] + nums[left] + nums[right] == 0:\\n ans_set.add((nums[i], nums[left], nums[right]))\\n left += 1\\n right -= 1\\n elif nums[i] + nums[left] + nums[right] > 0:\\n right -= 1\\n elif nums[i] + nums[left] + nums[right] < 0:\\n left += 1\\n return list(ans_set)\\n\\n\\n\\n\\n\\n\\n\\n \\n\\n \\n\\n\\n\\n \",\n \"runtime\": \"2045\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n nums.sort()\\n res = set()\\n\\n prevI = None\\n for i in range(n):\\n if prevI == nums[i]:\\n continue\\n j = i + 1\\n k = n - 1\\n # print(i,j,k,n)\\n while j < k:\\n s = nums[i] + nums[j] + nums[k]\\n if s == 0:\\n res.add((nums[i], nums[j], nums[k]))\\n j += 1\\n elif s < 0:\\n j += 1\\n else:\\n k -= 1\\n return res\",\n \"runtime\": \"2045\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n\\n res = set()\\n\\n for i, num in enumerate(nums):\\n l, r = i+1, len(nums)-1\\n while l < r:\\n this_sum = num + nums[l] + nums[r]\\n if this_sum > 0:\\n r -= 1\\n elif this_sum < 0:\\n l += 1\\n else:\\n res.add((num, nums[l], nums[r]))\\n l += 1\\n return list(list(s) for s in res)\\n\\n\\n\",\n \"runtime\": \"2069\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n ans=set()\\n nums.sort()\\n n=len(nums)\\n for i in range(n-2):\\n j=i+1\\n k=n-1\\n while j<k:\\n temp=nums[i]+nums[j]+nums[k]\\n if temp==0:\\n ans.add((nums[i],nums[j],nums[k]))\\n j+=1\\n elif temp>0:\\n k-=1\\n else:\\n j+=1\\n return ans\",\n \"runtime\": \"2069\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n triplets = set()\\n nums.sort()\\n for i in range(len(nums)):\\n l = i+1\\n r = len(nums) - 1\\n while l < r:\\n add = nums[i] + nums[l] + nums[r]\\n if add == 0 and (nums[i], nums[l], nums[r]) not in triplets:\\n triplets.add((nums[i], nums[l], nums[r]))\\n\\n if add >= 0:\\n r -= 1\\n else:\\n l += 1\\n return [list(tup) for tup in triplets]\",\n \"runtime\": \"2094\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n trip_list = []\\n for i in range(len(nums)):\\n left, right = i+1, len(nums)-1\\n while left < right:\\n if nums[i] + nums[left] + nums[right] == 0:\\n trip_list.append((nums[i], nums[left], nums[right]))\\n left += 1\\n right -= 1\\n elif nums[i] + nums[left] + nums[right] > 0:\\n right -= 1\\n elif nums[i] + nums[left] + nums[right] < 0:\\n left += 1\\n \\n return list(set(trip_list))\\n \",\n \"runtime\": \"2094\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":154,"string":"154"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n n = len(nums)\n res = set()\n for i in range(n-2):\n l = i+1\n r = n-1\n while l < r:\n s = nums[i] + nums[l] + nums[r]\n if s == 0:\n res.add((nums[i], nums[l], nums[r]))\n r -= 1\n l += 1\n elif s > 0:\n r -= 1\n else:\n l += 1\n \n \n \n print(res)\n\n return list(res)\n ","memory":"18200"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n \n triplets = set()\n sorted_nums = sorted(nums)\n\n for i in range(len(nums)):\n l,r = i+1,len(nums)-1\n while l < r:\n curr_sum = sorted_nums[i] + sorted_nums[l] + sorted_nums[r]\n if curr_sum == 0:\n triplets.add((sorted_nums[i],sorted_nums[l],sorted_nums[r]))\n l+=1\n r-=1\n elif curr_sum < 0:\n l+=1\n else:\n r-=1\n\n return list(triplets)","memory":"18300"},{"code":"from collections import Counter\n\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n count_of_nums = Counter(nums)\n available_nums = list(count_of_nums)\n\n sum_to_zero = []\n for first_num_index in range(len(available_nums)):\n first_num = available_nums[first_num_index]\n count_of_nums[first_num] -= 1\n already_used = set()\n\n second_num_starting_index = first_num_index if count_of_nums[first_num] else first_num_index + 1\n for second_num_index in range(second_num_starting_index, len(available_nums)):\n second_num = available_nums[second_num_index]\n\n if second_num in already_used:\n continue\n\n count_of_nums[second_num] -= 1\n\n target = -1 * (first_num + second_num)\n if target in count_of_nums and count_of_nums[target]:\n sum_to_zero.append([first_num, second_num, target])\n already_used.update([second_num, target])\n\n count_of_nums[second_num] += 1\n del count_of_nums[first_num]\n \n return sum_to_zero\n","memory":"18400"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n target = 0\n N = len(nums)\n\n final_array = set()\n\n for i in range(0, N-2):\n left = i + 1\n right = N-1\n target = 0 - nums[i]\n\n while left < right:\n if nums[left] + nums[right] == target:\n temp = (nums[i], nums[left], nums[right])\n final_array.add(temp)\n\n if nums[left] + nums[right] > target:\n right -= 1\n \n else:\n left += 1\n\n return list(dict.fromkeys(final_array))","memory":"18600"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = []\n nums.sort()\n for i,a in enumerate(nums):\n if i>0 and a==nums[i-1]:\n continue\n l,r = i+1,len(nums)-1\n while l<r:\n threesum = a + nums[l] + nums[r]\n if threesum>0:\n r -= 1\n elif threesum<0:\n l += 1\n else:\n res.append([a,nums[l],nums[r]])\n l += 1\n while nums[l] == nums[l-1] and l<r:\n l+=1\n return res\n ","memory":"18800"},{"code":"class Solution:\n # time complex: O(n**2)\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n # follows https://en.wikipedia.org/wiki/3SUM\n ans = set()\n nums.sort()\n len_ = len(nums)\n for i in range(len_ - 1):\n a = nums[i]\n if a > 0:\n # array is sorted, if we have bigger than 0 numbers already,\n # there won't be any more negative numbers further\n break\n\n start = i + 1\n end = len_ - 1\n target = -a\n while start < end:\n b = nums[start]\n c = nums[end]\n if b + c == target:\n #if [a, b, c] not in ans:\n ans.add((a, b, c))\n start += 1\n end -= 1\n\n while nums[start] == nums[start-1] and start < end:\n # if previous number is the same as current\n # there is no point in checking 3sum\n start += 1\n\n elif b + c > target:\n end -= 1\n else:\n start += 1\n return ans\n\n","memory":"18900"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n result = []\n nums.sort()\n\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n\n left = i + 1\n right = len(nums) - 1\n\n while left < right:\n total = nums[i] + nums[left] + nums[right]\n\n if total > 0:\n right -= 1\n elif total < 0:\n left += 1\n else:\n result.append([nums[i], nums[left], nums[right]])\n left += 1\n while left < right and nums[left] == nums[left - 1]:\n left+= 1\n return result\n ","memory":"19200"},{"code":"from itertools import product\nclass Solution:\n\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n\n nums.sort()\n\n size = len(nums)\n max_index = size - 1\n\n if size < 3:\n return []\n\n retval = []\n left = 0\n while left <= max_index - 2:\n middle, right = left + 1, max_index\n while middle < right:\n tup = nums[left], nums[middle], nums[right]\n total = sum(tup)\n if total == 0:\n retval.append(tup)\n middle = increment(nums, middle)\n elif total > 0:\n right = decrement(nums, right)\n else:\n middle = increment(nums, middle)\n left = increment(nums, left)\n\n return retval\n\n\ndef increment(nums, curr):\n index_max = len(nums) - 1\n steps = 1\n compare = nums[curr]\n while curr + steps < index_max:\n if nums[curr + steps] != compare:\n return curr + steps\n steps += 1\n return index_max\n\ndef decrement(nums, curr):\n index_min = 0\n steps = -1\n compare = nums[curr]\n while curr + steps > index_min:\n if nums[curr + steps] != compare:\n return curr + steps\n steps -= 1\n return index_min","memory":"19300"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res=[]\n nums.sort()\n for i in range(len(nums)):\n j,k = i+1,len(nums)-1\n if i>0 and nums[i]==nums[i-1]:\n continue\n while j<k:\n total=nums[i]+nums[j]+nums[k]\n if total>0:\n k-=1\n elif total<0:\n j+=1\n else:\n res.append([nums[i],nums[j],nums[k]])\n j+=1\n while nums[j]==nums[j-1] and j<k:\n j+=1\n return res ","memory":"19400"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n result = []\n nums.sort()\n\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n\n j = i + 1\n k = len(nums) - 1\n\n while j < k:\n total = nums[i] + nums[j] + nums[k]\n if total > 0:\n k = k - 1\n elif total < 0:\n j += 1\n else:\n result.append([nums[i], nums[j], nums[k]])\n j += 1\n \n while nums[j] == nums[j-1] and j < k:\n j += 1\n\n return result\n","memory":"19500"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n ans=[]\n for i in range(len(nums)-2):\n if nums[i]>0:\n break\n if i>0 and nums[i]==nums[i-1]:\n continue\n l=i+1\n r=len(nums)-1\n while l<r:\n sum=nums[i]+nums[l]+nums[r]\n if sum>0:\n r-=1\n elif sum<0:\n l+=1\n else:\n triplet=[nums[i],nums[l],nums[r]]\n ans.append(triplet)\n while l<r and nums[l]==triplet[1]:\n l+=1\n # while l>r and nums[r]==triplet[2]:\n # r-=1\n return ans\n ","memory":"19500"},{"code":"class Solution:\n\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n\n # sort the array \n nums = sorted(nums)\n triplets = [] \n\n for i in range(len(nums)): \n\n if i > 0 and nums[i] == nums[i-1]: \n continue \n\n # fix nums[i] and run two sum to find -nums[i] \n\n # set left and right pointers for 2 sum \n left, right = i + 1, len(nums) - 1 \n targetSum = -nums[i]\n\n while left < right: \n\n if nums[left] + nums[right] == targetSum: \n\n triplets.append([nums[i], nums[left], nums[right]]) \n left += 1 \n right -= 1 \n\n # avoid duplicates \n while left < right and nums[left] == nums[left-1]: \n left += 1\n while left < right and nums[right] == nums[right+1]: \n right -= 1 \n \n elif nums[left] + nums[right] > targetSum: \n right -= 1 \n \n else: \n left += 1 \n\n return triplets \n \n \n ","memory":"19600"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n res = []\n \n for i in range(len(nums)):\n if i == 0 or nums[i] != nums[i - 1]:\n self.twoSum(nums, i, res)\n return res\n\n def twoSum(self, nums: List[int], i: int, res: List[List[int]]):\n start = i + 1\n end = len(nums) - 1\n while start < end:\n sum = nums[i] + nums[start] + nums[end]\n if sum > 0:\n end -= 1\n elif sum < 0:\n start += 1\n else:\n res.append([nums[i], nums[start], nums[end]])\n start += 1\n end -= 1\n while start < end and nums[start] == nums[start - 1]:\n start += 1","memory":"19600"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n ans = []\n nums.sort()\n len_1 = len(nums) - 1\n for i in range(len_1 - 1):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n a1 = nums[i]\n if a1 > 0:\n break\n l = i + 1\n r = len_1\n while l < r:\n a2 = nums[l]\n a3 = nums[r]\n t = a1 + a2 + a3\n if t == 0:\n a = (a1, a2, a3)\n ans.append(a)\n l += 1\n while l < r and nums[l-1] == nums[l]:\n l += 1\n elif t < 0:\n l += 1\n elif t > 0:\n r -= 1\n \n return ans \n ","memory":"19700"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n triplets = set()\n # [-4, -1, -1, 0, 1, 2]\n\n for i in range(len(nums)):\n left = i + 1\n right = len(nums) - 1\n\n while left < right:\n current_sum = nums[left] + nums[i] + nums[right]\n\n if current_sum == 0:\n triplets.add((nums[left], nums[i], nums[right]))\n left +=1\n right -= 1\n elif current_sum < 0:\n left += 1\n else:\n right -= 1\n\n return list(triplets)\n","memory":"19800"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n n=len(nums)\n nums.sort()\n ans=set()\n for i in range(n-2):\n d={}\n left=i+1\n right=n-1\n while left<right:\n a=nums[i]+nums[left]+nums[right]\n if a==0:\n ans.add((nums[i],nums[left],nums[right]))\n left+=1\n right-=1\n elif a>0:\n right-=1\n else:\n left+=1\n \n\n return list(ans)","memory":"19800"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n \n nums.sort() # I will sort the array in case the inputs are not sorted\n result = set()\n n = len(nums)\n\n for i in range(n - 2):\n \n # Skip duplicates for i\n #if i > 0 and nums[i] == nums[i-1]:\n # continue\n\n left, right = i + 1, n - 1\n\n while left < right:\n currentSum = nums[i] + nums[left] + nums[right]\n\n if currentSum == 0:\n result.add((nums[i], nums[left], nums[right]))\n\n # Skip duplicates for left and right\n #while left < right and nums[left] == nums[left + 1]:\n # left += 1\n #while left < right and nums[right] == nums[right - 1]:\n # right -= 1\n\n left += 1\n right -= 1\n elif currentSum < 0:\n left += 1\n else:\n right -= 1\n\n return list(result)","memory":"19900"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n \n nums.sort() # I will sort the array in case the inputs are not sorted\n result = set()\n n = len(nums)\n\n for i in range(n - 2):\n \n # Skip duplicates for i\n if i > 0 and nums[i] == nums[i-1]:\n continue\n\n left, right = i + 1, n - 1\n\n while left < right:\n currentSum = nums[i] + nums[left] + nums[right]\n\n if currentSum == 0:\n result.add((nums[i], nums[left], nums[right]))\n\n # Skip duplicates for left and right\n while left < right and nums[left] == nums[left + 1]:\n left += 1\n while left < right and nums[right] == nums[right - 1]:\n right -= 1\n\n left += 1\n right -= 1\n elif currentSum < 0:\n left += 1\n else:\n right -= 1\n\n return list(result)","memory":"19900"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = set()\n nums = sorted(nums)\n # print(nums)\n for idx in range(len(nums)-2):\n search = nums[idx]\n left, right = idx+1, len(nums)-1\n # search\n while left < right:\n # print(idx, left, right)\n if (nums[left] + nums[right]) == -search:\n res.add((nums[idx], nums[left], nums[right]))\n left += 1\n elif (nums[left] + nums[right]) < -search:\n left +=1\n else:\n right -= 1\n \n return list(res)","memory":"20000"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n res = set()\n for i in range(0,len(nums) - 2):\n left, right = i + 1, len(nums) - 1\n while left < right:\n threeSum = nums[i] + nums[left] + nums[right] \n if threeSum == 0:\n res.add((nums[i], nums[left], nums[right]))\n left += 1\n right -= 1\n elif threeSum > 0:\n right -= 1\n else:\n left += 1\n return map(lambda tupleInput: list(tupleInput), res)","memory":"20000"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = set()\n nums_sorted = sorted(nums)\n for i, num in enumerate(nums_sorted):\n print(num)\n l = i + 1\n r = len(nums_sorted) - 1\n while r > l:\n if nums_sorted[l] + nums_sorted[r] == -1 * num:\n res.add((num, nums_sorted[l], nums_sorted[r]))\n r -= 1\n l += 1\n elif num + nums_sorted[l] + nums_sorted[r] > 0:\n r -= 1\n else:\n l += 1\n return list(res)","memory":"20100"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n n = len(nums)\n\n ans = []\n \n for i, a in enumerate(nums[:n-2]):\n if a > 0:\n continue\n j = i+1\n k = n-1\n while j < k:\n b = nums[j]\n c = nums[k]\n if b+c == -a:\n ans.append((a, b, c))\n while j<k and nums[j] == b:\n j+=1\n while j<k and nums[k] == c:\n k-=1\n elif b+c > -a:\n k-=1\n else:\n j+=1\n return list(set(ans))\n\n\n\n","memory":"20100"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n \n has_dict = {}\n nums.sort()\n s = set()\n for i in range(len(nums)):\n has_dict[i] = nums[i]\n\n for l in range(len(nums)):\n r = l+1\n k = len(nums) - 1\n\n while r < k:\n tmp = nums[l] + nums[r] + nums[k]\n\n if tmp == 0:\n s.add((nums[l], nums[r], nums[k]))\n r += 1\n k -= 1\n\n elif tmp > 0:\n k -= 1\n \n else:\n r += 1\n\n return list(s)\n\n ","memory":"20200"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n result = set()\n seen = set()\n\n for i in range(len(nums)):\n if nums[i] > 0:\n break\n if nums[i] in seen:\n continue\n else:\n seen.add(nums[i])\n\n low = i+1\n high = len(nums)-1\n print(f'{i}, {low}, {high}')\n while low < high:\n s = nums[i] + nums[low] + nums[high]\n if s == 0:\n result.add((nums[i], nums[low], nums[high]))\n low += 1\n high -= 1\n elif s < 0:\n low += 1\n else:\n high -= 1\n\n return result","memory":"20200"},{"code":"# class Solution:\n# def threeSum(self, nums: List[int]) -> List[List[int]]:\n# output=set()\n# nums.sort()\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\n\n# if (nums[i]+nums[j]+nums[k])==0:\n# li=(nums[i],nums[j],nums[k])\n# output.add(li)\n# return output\n \nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n '''\n k = set(nums)\n if len(k) == 1:\n if 0 in k:\n return [[0,0,0]]\n st = set()\n n = len(nums)\n for i in range(n):\n hashMap = set()\n for j in range(i+1,n):\n third = -(nums[i] + nums[j])\n if third in hashMap:\n temp = [nums[i],nums[j],third]\n temp.sort()\n st.add(tuple(temp))\n hashMap.add(nums[j])\n\n return st\n '''\n\n n = len(nums)\n nums.sort()\n ans = set()\n for i in range(n):\n if i !=0 and nums[i] == nums[i-1]:\n continue\n j = i + 1 \n k = n - 1 \n\n while j < k:\n tot = nums[i] + nums[j] + nums[k]\n if tot < 0:\n j += 1 \n elif tot >0:\n k -= 1\n else:\n temp = (nums[i],nums[j],nums[k])\n ans.add(temp)\n j += 1 \n k -= 1 \n\n while j < k and nums[j] == nums[j-1]:\n j += 1 \n while j < k and nums[k] == nums[k+1]:\n k -= 1 \n\n return ans\n\n\n\n","memory":"20300"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums = sorted(nums)\n n = len(nums)\n ans = set()\n\n for i in range(n):\n target = -nums[i]\n \n left, right = i + 1, n - 1\n while left < right:\n s = nums[left] + nums[right]\n if s > target:\n right -= 1\n elif s < target:\n left += 1\n else:\n ans.add((nums[i], nums[left], nums[right]))\n left += 1\n right -= 1\n\n return ans\n","memory":"20300"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n ans = set()\n nums = sorted(nums)\n for i in range(len(nums)-1):\n left = i+1\n right = len(nums)-1\n while(left<right):\n if(nums[left]+nums[right]+nums[i]==0):\n ans.add((nums[i], nums[left], nums[right]))\n left+=1\n right-=1\n while(left<len(nums)-1 and nums[left] == nums[left-1]):\n left+=1\n while(right>=0 and nums[right]==nums[right+1]):\n right-=1\n elif(nums[left]+nums[right]+nums[i]>0):\n right-=1\n while(right>=0 and nums[right]==nums[right+1]):\n right-=1\n else:\n left+=1\n while(left<=len(nums)-1 and nums[left] == nums[left-1]):\n left+=1\n return ans\n","memory":"20400"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums = sorted(nums)\n result = set()\n n = len(nums)\n\n for i in range(n):\n target = -nums[i]\n left = i + 1\n right = n - 1\n while left < right:\n current = nums[left] + nums[right]\n if current == target:\n result.add((nums[i], nums[left], nums[right]))\n if current > target:\n right -= 1\n else:\n left += 1\n return result","memory":"20400"},{"code":"from typing import List, Set, Tuple\n\nclass Solution:\n # my twoSum assumes sorted nums array and returns unique set of pairs that sum to target target\n def twoSum(self, sortedNums: List[int], left, right, target: int) -> Set[Tuple[int, int]]:\n if len(sortedNums) < 2:\n return set()\n\n resultSet = set()\n \n while left < right:\n currSum = sortedNums[left] + sortedNums[right]\n if currSum == target:\n resultSet.add((sortedNums[left], sortedNums[right]))\n left += 1\n right -= 1\n elif currSum < target:\n left += 1\n else:\n right -= 1\n return resultSet\n\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n resultSet = set()\n\n listLen = len(nums)\n for i in range(listLen - 2):\n firstElement = nums[i]\n rightArrayPairSet = self.twoSum(nums, left=(i+1), right=(listLen-1), target=(0 - firstElement))\n \n for pair in rightArrayPairSet:\n resultSet.add((firstElement, pair[0], pair[1]))\n\n return resultSet\n","memory":"20500"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n ## Brute forcing:\n # results = []\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] == 0) and (i != j) and (i != k) and (j != k):\n # temp = [nums[i], nums[j], nums[k]]\n # temp.sort()\n # if temp not in results:\n # results.append(temp)\n\n # return results\n\n\n # Going for a two pointer approach O(n^2)\n\n nums.sort()\n results = []\n\n for i in range (len(nums)): # Three required, no need to run loop till the end\n if i > 0 and nums[i] == nums[i - 1]:\n continue # Avoiding duplicates\n left = i + 1\n right = len(nums) - 1\n while left < right:\n\n if ((nums[i] + nums[left] + nums[right]) == 0):\n\n temp = [nums[i], nums[left], nums[right]]\n results.append(temp)\n\n left += 1\n\n # Avoiding duplicates\n while nums[left] == nums[left - 1] and left < right:\n left += 1\n\n elif (nums[i] + nums[left] + nums[right] > 0):\n right -= 1\n else:\n left += 1\n \n return results\n","memory":"20500"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n triplets = []\n\n for i in range(len(nums)):\n l, r = i + 1, len(nums) - 1\n\n if i > 0 and nums[i] != nums[i - 1] or i == 0:\n while l < r:\n if nums[i] + nums[l] + nums[r] > 0:\n r -= 1\n elif nums[i] + nums[l] + nums[r] < 0:\n l += 1\n else:\n triplets.append([nums[i], nums[l], nums[r]])\n l += 1\n while nums[l] == nums[l - 1] and l < r:\n l += 1\n return triplets","memory":"20600"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n triplets = []\n\n for i in range(len(nums)):\n l, r = i + 1, len(nums) - 1\n\n if i > 0 and nums[i] != nums[i - 1] or i == 0:\n while l < r:\n if nums[i] + nums[l] + nums[r] > 0:\n r -= 1\n elif nums[i] + nums[l] + nums[r] < 0:\n l += 1\n else:\n triplets.append([nums[i], nums[l], nums[r]])\n l += 1\n while nums[l] == nums[l - 1] and l < r:\n l += 1\n return triplets","memory":"20600"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n result = []\n nums.sort() \n for i, a in enumerate(nums):\n if i > 0 and a == nums[i-1]: \n continue\n l, r = i + 1, len(nums) - 1\n while l < r:\n threeSum = a + nums[l] + nums[r]\n if threeSum > 0:\n r -= 1\n elif threeSum < 0:\n l += 1\n else: \n result.append([a , nums[l], nums[r]]) \n l += 1 \n while nums[l] == nums[l-1] and l < r:\n l+=1\n return result","memory":"20700"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n result = []\n nums.sort()\n\n for index, number in enumerate(nums):\n if index > 0 and number == nums[index - 1]:\n continue\n \n left, right = index + 1, len(nums)-1\n\n while left < right:\n threeSum = number + nums[left] + nums[right]\n \n if threeSum > 0:\n right -= 1\n elif threeSum < 0:\n left += 1\n else:\n result.append([number, nums[left], nums[right]])\n\n while left < right and nums[left] == nums[left + 1]:\n left += 1\n \n while left < right and nums[right] == nums[right - 1]:\n right -= 1\n \n left += 1\n right -= 1\n \n return result","memory":"20700"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = []\n nums.sort()\n\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n \n j = i + 1\n k = len(nums)-1\n while j < k:\n total = nums[i] + nums[j] + nums[k]\n\n if total > 0:\n k -= 1\n elif total < 0:\n j += 1\n else:\n res.append([nums[i], nums[j], nums[k]])\n j += 1\n\n while nums[j] == nums[j-1] and j < k:\n j += 1\n\n return res","memory":"20800"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = []\n nums.sort()\n\n for i, a in enumerate(nums):\n # Skip positive integers\n if a > 0:\n break\n\n if i > 0 and a == nums[i - 1]:\n continue\n\n l, r = i + 1, len(nums) - 1\n while l < r:\n threeSum = a + nums[l] + nums[r]\n if threeSum > 0:\n r -= 1\n elif threeSum < 0:\n l += 1\n else:\n res.append([a, nums[l], nums[r]])\n l += 1\n r -= 1\n while nums[l] == nums[l - 1] and l < r:\n l += 1\n \n return res\n","memory":"20800"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n triplets = []\n\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n \n target = -nums[i]\n j, k = i + 1, len(nums) - 1\n\n while j < k:\n if nums[j] + nums[k] < target:\n j += 1\n elif nums[j] + nums[k] > target:\n k -= 1\n else:\n triplets.append([-target, nums[j], nums[k]])\n j += 1\n while j <= k and nums[j] == nums[j - 1]:\n j += 1\n \n return triplets","memory":"20900"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n return nSum(nums,3,0,0)\n\ndef nSum(arr,n,start,k):\n sz=len(arr)\n res=[]\n if n<2 or sz<n:\n return res\n if n==2:\n l=start\n r=sz-1\n while l<r:\n left,right=arr[l],arr[r]\n curr=left+right\n if curr>k:\n while l<r and arr[r]==right:\n r-=1\n elif curr<k:\n while l<r and arr[l]==left:\n l+=1\n else:\n res.append([left,right])\n while l<r and arr[l]==left:\n l+=1\n while l<r and arr[r]==right:\n r-=1\n return res\n else:\n for i in range(start,sz):\n if i > start and arr[i]==arr[i-1]:\n continue\n sols=nSum(arr,n-1,i+1,k-arr[i])\n for sol in sols:\n sol.append(arr[i])\n res.append(sol)\n return res","memory":"20900"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = []\n nums.sort()\n for i in range(len(nums)):\n if nums[i] > 0:\n break\n if i == 0 or nums[i - 1] != nums[i]:\n self.twoSum(nums, i, res)\n return res\n\n def twoSum(self, nums: List[int], i: int, res: List[List[int]]):\n seen = set()\n j = i + 1\n while j < len(nums):\n complement = -nums[i] - nums[j]\n if complement in seen:\n res.append([nums[i], nums[j], complement])\n while j + 1 < len(nums) and nums[j] == nums[j + 1]:\n j += 1\n seen.add(nums[j])\n j += 1","memory":"21000"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n\n m = {i:1 for i in nums}\n ans = []\n nums.sort()\n negatives = [i for i in nums if i < 0]\n zeroes = [i for i in nums if i == 0]\n positives = [i for i in nums if i > 0]\n\n if len(nums) < 3:\n return []\n \n if len(zeroes) >= 3:\n ans.append([0,0,0])\n\n if len(zeroes) > 0:\n for i in set(negatives):\n if m.get(-i):\n ans.append([i,0,-i])\n\n for ni in set(negatives):\n ts_ar = self.twoSum(positives, -ni)\n if len(ts_ar) > 0:\n for ts in ts_ar:\n ans.append([ni,ts[0],ts[1]])\n\n for pi in set(positives):\n ts_ar = self.twoSum(negatives, -pi)\n if len(ts_ar) > 0:\n for ts in ts_ar:\n ans.append([ts[0],ts[1],pi])\n\n return ans\n\n def twoSum(self, nums, target):\n d={}\n ans = []\n\n for i in range(len(nums)):\n if i>0 and nums[i]==nums[i-1]:\n if i>1 and nums[i-1]==nums[i-2]:\n pass\n elif nums[i]+nums[i-1]==target:\n ans.append([nums[i], nums[i-1]])\n elif d.get(target-nums[i]) is not None:\n ans.append([nums[i], nums[d.get(target-nums[i])]])\n d[nums[i]]=i \n \n return ans","memory":"21000"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n\n res = set()\n\n #1. Split nums into three lists: negative numbers, positive numbers, and zeros\n n, p, z = [], [], []\n for num in nums:\n if num > 0:\n p.append(num)\n elif num < 0: \n n.append(num)\n else:\n z.append(num)\n\n #2. Create a separate set for negatives and positives for O(1) look-up times\n N, P = set(n), set(p)\n\n #3. If there is at least 1 zero in the list, add all cases where -num exists in N and num exists in P\n # i.e. (-3, 0, 3) = 0\n if z:\n for num in P:\n if -1*num in N:\n res.add((-1*num, 0, num))\n\n #3. If there are at least 3 zeros in the list then also include (0, 0, 0) = 0\n if len(z) >= 3:\n res.add((0,0,0))\n\n #4. For all pairs of negative numbers (-3, -1), check to see if their complement (4)\n # exists in the positive number set\n for i in range(len(n)):\n for j in range(i+1,len(n)):\n target = -1*(n[i]+n[j])\n if target in P:\n res.add(tuple(sorted([n[i],n[j],target])))\n\n #5. For all pairs of positive numbers (1, 1), check to see if their complement (-2)\n # exists in the negative number set\n for i in range(len(p)):\n for j in range(i+1,len(p)):\n target = -1*(p[i]+p[j])\n if target in N:\n res.add(tuple(sorted([p[i],p[j],target])))\n\n return res\n ","memory":"21100"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n\n res = set()\n\n # 1. Split nums into three lists: negative numbers, positive numbers, and zeros\n n, p, z = [], [], []\n for num in nums:\n if num > 0:\n p.append(num)\n elif num < 0:\n n.append(num)\n else:\n z.append(num)\n\n # 2. Create a separate set for negatives and positives for O(1) look-up times\n N, P = set(n), set(p)\n\n # 3. If there is at least 1 zero in the list, add all cases where -num exists in N and num exists in P\n # i.e. (-3, 0, 3) = 0\n if z:\n for num in P:\n if -1 * num in N:\n res.add((-1 * num, 0, num))\n\n # 3. If there are at least 3 zeros in the list then also include (0, 0, 0) = 0\n if len(z) >= 3:\n res.add((0, 0, 0))\n\n # 4. For all pairs of negative numbers (-3, -1), check to see if their complement (4)\n # exists in the positive number set\n for i in range(len(n)):\n for j in range(i + 1, len(n)):\n target = -1 * (n[i] + n[j])\n if target in P:\n res.add(tuple(sorted([n[i], n[j], target])))\n\n # 5. For all pairs of positive numbers (1, 1), check to see if their complement (-2)\n # exists in the negative number set\n for i in range(len(p)):\n for j in range(i + 1, len(p)):\n target = -1 * (p[i] + p[j])\n if target in N:\n res.add(tuple(sorted([p[i], p[j], target])))\n\n return res","memory":"21100"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n nums.sort()\n result = []\n print(nums)\n\n for i in range(n):\n # As the numbers are sorted, if current value is greater than 0,\n # the remaining numbers cannot sum to 0\n if nums[i] > 0:\n break\n \n # print(i, nums[i-1], nums[i])\n # Toi avoid duplicate triplets\n if i != 0 and nums[i-1] == nums[i]:\n continue\n\n tracker = set()\n # target = 0 - nums[i]\n j = i + 1\n while j < n:\n # num = nums[j]\n complement = 0 - nums[i] - nums[j]\n if complement in tracker:\n result.append([nums[i], nums[j], complement])\n\n # If there are duplicates in this subset\n while j + 1 < n and nums[j] == nums[j + 1]:\n j += 1\n tracker.add(nums[j])\n j += 1\n\n return result\n\n\n # Doesn't work\n def threeSum2(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n nums.sort()\n result = set()\n\n for i in range(n):\n # As the numbers are sotted, if current value is greater than 0,\n # the remaining numbers cannot sum to 0\n if nums[i] > 0:\n break\n \n # print(i, nums[i-1], nums[i])\n if i != 0 and nums[i-1] == nums[i]:\n continue\n\n tracker = set()\n target = 0 - nums[i]\n for j in range(1, n):\n num = nums[j]\n if (target - num) in tracker:\n new_res = sorted((nums[i], nums[j], target - num))\n result.add(new_res)\n tracker.add(num)\n\n return result\n\n ","memory":"21200"},{"code":"class Solution:\n def threeSum(self, nums: list[int]) -> list[list[int]]:\n negative_numbers, positive_numbers, zeroes = [], [], []\n for num in nums:\n if num > 0:\n positive_numbers.append(num)\n elif num < 0:\n negative_numbers.append(num)\n else:\n zeroes.append(num)\n\n triplets = set()\n\n negative_numbers_set = set(negative_numbers)\n positive_numbers_set = set(positive_numbers)\n\n if zeroes:\n for negative_number in negative_numbers_set:\n if -negative_number in positive_numbers_set:\n triplets.add((negative_number, 0, -negative_number))\n\n if len(zeroes) >= 3:\n triplets.add((0, 0, 0))\n\n for i in range(len(negative_numbers)):\n for j in range(i + 1, len(negative_numbers)):\n target = -(negative_numbers[i] + negative_numbers[j])\n if target in positive_numbers_set:\n triplet = sorted([negative_numbers[i], negative_numbers[j], target])\n\n triplets.add(tuple(triplet))\n\n for i in range(len(positive_numbers)):\n for j in range(i + 1, len(positive_numbers)):\n target = -(positive_numbers[i] + positive_numbers[j])\n if target in negative_numbers_set:\n triplet = sorted([positive_numbers[i], positive_numbers[j], target])\n triplets.add(tuple(triplet))\n\n return triplets","memory":"21200"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n exist_hash = {}\n for i in range(len(nums)):\n if nums[i] in exist_hash:\n exist_hash[nums[i]].append(i)\n else:\n exist_hash[nums[i]] = [i]\n\n result_set = set()\n for i in range(len(nums)):\n if i>0 and nums[i]==nums[i-1]:\n continue\n for j in range(i+1, len(nums)):\n # print(i, j)\n s = nums[i]+nums[j]\n if -s not in exist_hash:\n continue\n triplet = [nums[i], nums[j], -s]\n triplet.sort()\n triplet = tuple(triplet)\n if triplet in result_set:\n continue\n for k in exist_hash[-s]:\n # print(k)\n if i!=k and j!=k:\n result_set.add(tuple(triplet))\n break\n return list(result_set)","memory":"21300"},{"code":"class Solution:\n\n def threeSum2(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n nums.sort()\n\n def twosum(i):\n low = i + 1\n high = len(nums) - 1\n while left < right:\n sum = nums[i] + nums[left] + nums[right]\n if sum == target:\n result.append([nums[left], nums[right]])\n left += 1\n high -=1\n # to avoid duplicates\n while left < high and nums[left] == nums[left-1]:\n left += 1 \n elif sum > target:\n right -= 1\n else:\n left += 1\n\n result = [] \n for i in range(n - 2):\n if nums[i] > 0:\n break\n\n # To avoid duplicates\n if i != 0 and nums[i-1] == nums[i]:\n continue\n twosum(i)\n \n return result\n \n\n # Hashset\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n nums.sort()\n result = []\n print(nums)\n\n for i in range(n):\n # As the numbers are sorted, if current value is greater than 0,\n # the remaining numbers cannot sum to 0\n if nums[i] > 0:\n break\n \n # print(i, nums[i-1], nums[i])\n # Toi avoid duplicate triplets\n if i != 0 and nums[i-1] == nums[i]:\n continue\n\n tracker = set()\n # target = 0 - nums[i]\n j = i + 1\n while j < n:\n # num = nums[j]\n complement = 0 - nums[i] - nums[j]\n if complement in tracker:\n result.append([nums[i], nums[j], complement])\n\n # If there are duplicates in this subset\n while j + 1 < n and nums[j] == nums[j + 1]:\n j += 1\n tracker.add(nums[j])\n j += 1\n\n return result\n\n\n # Doesn't work\n def threeSum2(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n nums.sort()\n result = set()\n\n for i in range(n):\n # As the numbers are sorted, if current value is greater than 0,\n # the remaining numbers cannot sum to 0\n if nums[i] > 0:\n break\n \n # print(i, nums[i-1], nums[i])\n if i != 0 and nums[i-1] == nums[i]:\n continue\n\n tracker = set()\n target = 0 - nums[i]\n for j in range(1, n):\n num = nums[j]\n if (target - num) in tracker:\n new_res = sorted((nums[i], nums[j], target - num))\n result.add(new_res)\n tracker.add(num)\n\n return result\n\n ","memory":"21300"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res, dups = set(), set()\n seen = {}\n for i, val1 in enumerate(nums):\n if val1 not in dups:\n dups.add(val1)\n for j, val2 in enumerate(nums[i + 1 :]):\n complement = -val1 - val2\n if complement in seen and seen[complement] == i:\n res.add(tuple(sorted((val1, val2, complement))))\n seen[val2] = i\n return res","memory":"21400"},{"code":"# class Solution:\n# def threeSum(self, nums: List[int]) -> List[List[int]]:\n# result = []\n# nums.sort()\n# for i in range(len(nums)):\n# if nums[i] > 0:\n# break\n \n# if i > 0 and nums[i] == nums[i-1]:\n# continue\n\n# left, right = i + 1, len(nums) - 1\n# while left < right:\n# if nums[i] + nums[left] + nums[right] > 0:\n \n# right -= 1\n\n# elif nums[i] + nums[left] + nums[right] < 0:\n# left += 1\n# else:\n# result.append([nums[i], nums[left], nums[right]])\n# left += 1\n# while nums[left] == nums[left - 1] and left < right:\n# left += 1\n# return result\n\nclass Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res, dups = set(), set()\n seen = {}\n for i, val1 in enumerate(nums):\n if val1 not in dups:\n dups.add(val1)\n for j, val2 in enumerate(nums[i + 1 :]):\n complement = -val1 - val2\n if complement in seen and seen[complement] == i:\n res.add(tuple(sorted((val1, val2, complement))))\n seen[val2] = i\n return res\n","memory":"21400"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = set()\n dups = set()\n seen = {}\n\n for i, val1 in enumerate(nums):\n if val1 not in dups:\n dups.add(val1)\n for j, val2 in enumerate(nums[i + 1 : ]):\n val3 = 0 - val1 - val2\n if val3 in seen and seen[val3] == i:\n res.add(tuple(sorted((val1, val2, val3))))\n seen[val2] = i\n return res\n\n# Time Complexity: O(N^2)\n# Space Complexity: O(N)","memory":"21500"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = set()\n dup = set()\n seen = {}\n\n for i, val1 in enumerate(nums):\n if val1 not in dup:\n dup.add(val1)\n for j, val2 in enumerate(nums[i + 1 : ]):\n val3 = 0 - val1 - val2\n if val3 in seen and seen[val3] == i:\n res.add(tuple(sorted((val1, val2, val3))))\n seen[val2] = i\n\n return res","memory":"21500"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n res = set()\n dups = set()\n seen = {}\n\n for i, val1 in enumerate(nums):\n if val1 not in dups:\n dups.add(val1)\n for j, val2 in enumerate(nums[i + 1 : ]):\n val3 = 0 - val1 - val2\n if val3 in seen and seen[val3] == i:\n res.add(tuple(sorted((val1, val2, val3))))\n seen[val2] = i\n return res","memory":"21600"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n # sort the arr\n # iterate the nums\n # target = cur num (i.e. find the sum for the rest = cur num)\n # using 2 pointers (left from cur index, right from end)\n # if num[l] + num[r] == -target , append ans, > target r-- , M target l++\n nums.sort() # O(NlogN)\n ans = set() # Space: O(N)\n for i, n in enumerate(nums): #O(N)\n l = i+1\n r = len(nums) - 1\n target = -n\n while l < r: #O(N)\n two_sum = nums[l] + nums[r]\n if two_sum == target:\n ans.add((n, nums[l], nums[r]))\n l += 1\n r -= 1\n\n elif two_sum > target:\n r -= 1\n else:\n l += 1\n\n res = [] # Space: O(N)\n for t in ans: # O(N)\n res.append(list(t))\n\n # Compute: O(NlogN + O(N^2) + O(N))\n # Space: O(N) + O(N)\n return res","memory":"21600"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n num_to_index = {}\n known = set()\n for i, n in enumerate(nums):\n if n in num_to_index:\n num_to_index[n].append(i)\n else:\n num_to_index[n] = [i]\n ret = []\n unique_indexes = [num_to_index[i][0] for i in num_to_index.keys()]\n for i in unique_indexes:\n for y in range(i+1, len(nums)):\n # we need x such that x + nums[i] + nums[y] = 0\n searching = -nums[i]-nums[y]\n if searching in num_to_index and len(num_to_index[searching]) > 0:\n k = 0\n while k < len(num_to_index[searching]):\n index = num_to_index[searching][k]\n if index != i and index != y:\n break\n k+=1\n if k == len(num_to_index[searching]):\n continue\n triple = [nums[i], nums[y], searching]\n triple.sort()\n string = str(triple[0]) + \",\" + str(triple[1]) + \",\" + str(triple[2])\n if not string in known:\n ret.append(triple)\n known.add(string)\n return ret","memory":"21700"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n \n # ### Soln 1: lookup table which takes too long to check for duplicates\n # tab = {}\n # num_len = len(nums)\n # for i in range(num_len):\n # cur_n = nums[i]\n # if cur_n in tab:\n # tab[cur_n].append(i)\n # else:\n # tab[cur_n] = [i]\n\n # out = []\n # for i in range(num_len - 2):\n # for j in range(i+1, num_len - 1):\n # diff = -(nums[i] + nums[j])\n # if diff in tab:\n # for temp_k in tab[diff]:\n # if temp_k > j and sorted([nums[i], nums[j], nums[temp_k]]) not in out:\n # out.append(sorted([nums[i], nums[j], nums[temp_k]]))\n # return out\n\n out = []\n pos = {}\n neg = {}\n zer = []\n for i in range(len(nums)):\n cur_num = nums[i]\n if cur_num == 0:\n zer.append(i)\n elif cur_num > 0:\n if cur_num in pos:\n pos[cur_num].append(i)\n else:\n pos[cur_num] = [i]\n elif cur_num < 0:\n if cur_num in neg:\n neg[cur_num].append(i)\n else:\n neg[cur_num] = [i]\n \n # Case 1: all zero\n if len(zer) >= 3:\n out.append([0,0,0])\n # Case 2: +, 0, -\n if len(zer) >= 1:\n for k in pos:\n if -k in neg:\n out.append([k, 0, -k])\n # Case 3: +k, +k, -2k\n for k,v in pos.items():\n if len(v) >= 2:\n if -2*k in neg:\n out.append([k, k, -2*k])\n # Case 4: -k, -k, +2k\n for k,v in neg.items():\n if len(v) >= 2:\n if -2*k in pos:\n out.append([-2*k, k, k])\n # Case 5:\n pos_keys = list(pos.keys())\n for i in range(len(pos_keys)):\n for j in range(i + 1, len(pos_keys)):\n if -(pos_keys[i] + pos_keys[j]) in neg:\n out.append([pos_keys[i], pos_keys[j], -(pos_keys[i] + pos_keys[j])])\n neg_keys = list(neg.keys())\n for i in range(len(neg_keys)):\n for j in range(i + 1, len(neg_keys)):\n if -(neg_keys[i] + neg_keys[j]) in pos:\n out.append([-(neg_keys[i] + neg_keys[j]), neg_keys[i], neg_keys[j]])\n\n return out\n\n\n\n\n \n\n ","memory":"21700"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n # sort the arr\n # iterate the nums\n # target = cur num (i.e. find the sum for the rest = cur num)\n # using 2 pointers (left from cur index, right from end)\n # if num[l] + num[r] == -target , append ans, > target r-- , M target l++\n nums.sort() # O(NlogN)\n ans = set() # Space: O(N)\n for i, n in enumerate(nums): #O(N)\n\n # sum of the rest of the number won't be zero\n if n > 0:\n break\n if i > 0 and n == nums[i-1]:\n continue\n l = i+1\n r = len(nums) - 1\n target = -n\n while l < r: #O(N)\n two_sum = nums[l] + nums[r]\n if two_sum == target:\n ans.add((n, nums[l], nums[r]))\n l += 1\n r -= 1\n\n elif two_sum > target:\n r -= 1\n else:\n l += 1\n\n res = [] # Space: O(N)\n for t in ans: # O(N)\n res.append(list(t))\n\n # Compute: O(NlogN + O(N^2) + O(N))\n # Space: O(N) + O(N)\n return res","memory":"21800"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n result_list = []\n result_dict = dict()\n nums.sort()\n for i in range(len(nums)):\n left, right = i + 1, len(nums) - 1\n target = nums[i] * -1\n while left < right:\n if nums[left] + nums[right] == target:\n sub_result = (nums[i], nums[left], nums[right])\n result_dict[hash(sub_result)] = sub_result\n left += 1\n elif nums[left] + nums[right] < target:\n left += 1\n else:\n right -= 1\n return result_dict.values()\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n # for j in range(i + 1, len(nums)):\n # for k in range(j + 1, len(nums)):\n # if i != j and i != k and j != k and nums[i] + nums[j] + nums[k] == 0:\n # result = [nums[i],nums[j],nums[k]]\n # result.sort()\n # if result not in result_list:\n # result_list.append(result)\n \n","memory":"21800"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n\n output = set()\n for i in range(len(nums) - 2):\n j = i + 1\n k = len(nums) - 1\n\n while j < k:\n _sum = nums[i] + nums[j] + nums[k]\n if _sum == 0:\n output.add((nums[i], nums[j], nums[k]))\n j += 1\n k -= 1\n elif _sum > 0:\n k -= 1\n else:\n j += 1\n\n return [list(o) for o in output]\n ","memory":"21900"},{"code":"class Solution:\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n nums.sort()\n\n output = set()\n for i in range(len(nums) - 2):\n j = i + 1\n k = len(nums) - 1\n\n while j < k:\n _sum = nums[i] + nums[j] + nums[k]\n if _sum == 0:\n output.add((nums[i], nums[j], nums[k]))\n j += 1\n k -= 1\n while j < k and nums[j] == nums[j-1]:\n j += 1\n while j < k and nums[k] == nums[k+1]:\n k -= 1\n elif _sum > 0:\n k -= 1\n else:\n j += 1\n\n return [list(o) for o in output]\n ","memory":"21900"}],"string":"[\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n n = len(nums)\\n res = set()\\n for i in range(n-2):\\n l = i+1\\n r = n-1\\n while l < r:\\n s = nums[i] + nums[l] + nums[r]\\n if s == 0:\\n res.add((nums[i], nums[l], nums[r]))\\n r -= 1\\n l += 1\\n elif s > 0:\\n r -= 1\\n else:\\n l += 1\\n \\n \\n \\n print(res)\\n\\n return list(res)\\n \",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n \\n triplets = set()\\n sorted_nums = sorted(nums)\\n\\n for i in range(len(nums)):\\n l,r = i+1,len(nums)-1\\n while l < r:\\n curr_sum = sorted_nums[i] + sorted_nums[l] + sorted_nums[r]\\n if curr_sum == 0:\\n triplets.add((sorted_nums[i],sorted_nums[l],sorted_nums[r]))\\n l+=1\\n r-=1\\n elif curr_sum < 0:\\n l+=1\\n else:\\n r-=1\\n\\n return list(triplets)\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n count_of_nums = Counter(nums)\\n available_nums = list(count_of_nums)\\n\\n sum_to_zero = []\\n for first_num_index in range(len(available_nums)):\\n first_num = available_nums[first_num_index]\\n count_of_nums[first_num] -= 1\\n already_used = set()\\n\\n second_num_starting_index = first_num_index if count_of_nums[first_num] else first_num_index + 1\\n for second_num_index in range(second_num_starting_index, len(available_nums)):\\n second_num = available_nums[second_num_index]\\n\\n if second_num in already_used:\\n continue\\n\\n count_of_nums[second_num] -= 1\\n\\n target = -1 * (first_num + second_num)\\n if target in count_of_nums and count_of_nums[target]:\\n sum_to_zero.append([first_num, second_num, target])\\n already_used.update([second_num, target])\\n\\n count_of_nums[second_num] += 1\\n del count_of_nums[first_num]\\n \\n return sum_to_zero\\n\",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n target = 0\\n N = len(nums)\\n\\n final_array = set()\\n\\n for i in range(0, N-2):\\n left = i + 1\\n right = N-1\\n target = 0 - nums[i]\\n\\n while left < right:\\n if nums[left] + nums[right] == target:\\n temp = (nums[i], nums[left], nums[right])\\n final_array.add(temp)\\n\\n if nums[left] + nums[right] > target:\\n right -= 1\\n \\n else:\\n left += 1\\n\\n return list(dict.fromkeys(final_array))\",\n \"memory\": \"18600\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n nums.sort()\\n for i,a in enumerate(nums):\\n if i>0 and a==nums[i-1]:\\n continue\\n l,r = i+1,len(nums)-1\\n while l<r:\\n threesum = a + nums[l] + nums[r]\\n if threesum>0:\\n r -= 1\\n elif threesum<0:\\n l += 1\\n else:\\n res.append([a,nums[l],nums[r]])\\n l += 1\\n while nums[l] == nums[l-1] and l<r:\\n l+=1\\n return res\\n \",\n \"memory\": \"18800\"\n },\n {\n \"code\": \"class Solution:\\n # time complex: O(n**2)\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n # follows https://en.wikipedia.org/wiki/3SUM\\n ans = set()\\n nums.sort()\\n len_ = len(nums)\\n for i in range(len_ - 1):\\n a = nums[i]\\n if a > 0:\\n # array is sorted, if we have bigger than 0 numbers already,\\n # there won't be any more negative numbers further\\n break\\n\\n start = i + 1\\n end = len_ - 1\\n target = -a\\n while start < end:\\n b = nums[start]\\n c = nums[end]\\n if b + c == target:\\n #if [a, b, c] not in ans:\\n ans.add((a, b, c))\\n start += 1\\n end -= 1\\n\\n while nums[start] == nums[start-1] and start < end:\\n # if previous number is the same as current\\n # there is no point in checking 3sum\\n start += 1\\n\\n elif b + c > target:\\n end -= 1\\n else:\\n start += 1\\n return ans\\n\\n\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n result = []\\n nums.sort()\\n\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n\\n left = i + 1\\n right = len(nums) - 1\\n\\n while left < right:\\n total = nums[i] + nums[left] + nums[right]\\n\\n if total > 0:\\n right -= 1\\n elif total < 0:\\n left += 1\\n else:\\n result.append([nums[i], nums[left], nums[right]])\\n left += 1\\n while left < right and nums[left] == nums[left - 1]:\\n left+= 1\\n return result\\n \",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"from itertools import product\\nclass Solution:\\n\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n\\n nums.sort()\\n\\n size = len(nums)\\n max_index = size - 1\\n\\n if size < 3:\\n return []\\n\\n retval = []\\n left = 0\\n while left <= max_index - 2:\\n middle, right = left + 1, max_index\\n while middle < right:\\n tup = nums[left], nums[middle], nums[right]\\n total = sum(tup)\\n if total == 0:\\n retval.append(tup)\\n middle = increment(nums, middle)\\n elif total > 0:\\n right = decrement(nums, right)\\n else:\\n middle = increment(nums, middle)\\n left = increment(nums, left)\\n\\n return retval\\n\\n\\ndef increment(nums, curr):\\n index_max = len(nums) - 1\\n steps = 1\\n compare = nums[curr]\\n while curr + steps < index_max:\\n if nums[curr + steps] != compare:\\n return curr + steps\\n steps += 1\\n return index_max\\n\\ndef decrement(nums, curr):\\n index_min = 0\\n steps = -1\\n compare = nums[curr]\\n while curr + steps > index_min:\\n if nums[curr + steps] != compare:\\n return curr + steps\\n steps -= 1\\n return index_min\",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res=[]\\n nums.sort()\\n for i in range(len(nums)):\\n j,k = i+1,len(nums)-1\\n if i>0 and nums[i]==nums[i-1]:\\n continue\\n while j<k:\\n total=nums[i]+nums[j]+nums[k]\\n if total>0:\\n k-=1\\n elif total<0:\\n j+=1\\n else:\\n res.append([nums[i],nums[j],nums[k]])\\n j+=1\\n while nums[j]==nums[j-1] and j<k:\\n j+=1\\n return res \",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n result = []\\n nums.sort()\\n\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n\\n j = i + 1\\n k = len(nums) - 1\\n\\n while j < k:\\n total = nums[i] + nums[j] + nums[k]\\n if total > 0:\\n k = k - 1\\n elif total < 0:\\n j += 1\\n else:\\n result.append([nums[i], nums[j], nums[k]])\\n j += 1\\n \\n while nums[j] == nums[j-1] and j < k:\\n j += 1\\n\\n return result\\n\",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n ans=[]\\n for i in range(len(nums)-2):\\n if nums[i]>0:\\n break\\n if i>0 and nums[i]==nums[i-1]:\\n continue\\n l=i+1\\n r=len(nums)-1\\n while l<r:\\n sum=nums[i]+nums[l]+nums[r]\\n if sum>0:\\n r-=1\\n elif sum<0:\\n l+=1\\n else:\\n triplet=[nums[i],nums[l],nums[r]]\\n ans.append(triplet)\\n while l<r and nums[l]==triplet[1]:\\n l+=1\\n # while l>r and nums[r]==triplet[2]:\\n # r-=1\\n return ans\\n \",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"class Solution:\\n\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n\\n # sort the array \\n nums = sorted(nums)\\n triplets = [] \\n\\n for i in range(len(nums)): \\n\\n if i > 0 and nums[i] == nums[i-1]: \\n continue \\n\\n # fix nums[i] and run two sum to find -nums[i] \\n\\n # set left and right pointers for 2 sum \\n left, right = i + 1, len(nums) - 1 \\n targetSum = -nums[i]\\n\\n while left < right: \\n\\n if nums[left] + nums[right] == targetSum: \\n\\n triplets.append([nums[i], nums[left], nums[right]]) \\n left += 1 \\n right -= 1 \\n\\n # avoid duplicates \\n while left < right and nums[left] == nums[left-1]: \\n left += 1\\n while left < right and nums[right] == nums[right+1]: \\n right -= 1 \\n \\n elif nums[left] + nums[right] > targetSum: \\n right -= 1 \\n \\n else: \\n left += 1 \\n\\n return triplets \\n \\n \\n \",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n res = []\\n \\n for i in range(len(nums)):\\n if i == 0 or nums[i] != nums[i - 1]:\\n self.twoSum(nums, i, res)\\n return res\\n\\n def twoSum(self, nums: List[int], i: int, res: List[List[int]]):\\n start = i + 1\\n end = len(nums) - 1\\n while start < end:\\n sum = nums[i] + nums[start] + nums[end]\\n if sum > 0:\\n end -= 1\\n elif sum < 0:\\n start += 1\\n else:\\n res.append([nums[i], nums[start], nums[end]])\\n start += 1\\n end -= 1\\n while start < end and nums[start] == nums[start - 1]:\\n start += 1\",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n ans = []\\n nums.sort()\\n len_1 = len(nums) - 1\\n for i in range(len_1 - 1):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n a1 = nums[i]\\n if a1 > 0:\\n break\\n l = i + 1\\n r = len_1\\n while l < r:\\n a2 = nums[l]\\n a3 = nums[r]\\n t = a1 + a2 + a3\\n if t == 0:\\n a = (a1, a2, a3)\\n ans.append(a)\\n l += 1\\n while l < r and nums[l-1] == nums[l]:\\n l += 1\\n elif t < 0:\\n l += 1\\n elif t > 0:\\n r -= 1\\n \\n return ans \\n \",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n triplets = set()\\n # [-4, -1, -1, 0, 1, 2]\\n\\n for i in range(len(nums)):\\n left = i + 1\\n right = len(nums) - 1\\n\\n while left < right:\\n current_sum = nums[left] + nums[i] + nums[right]\\n\\n if current_sum == 0:\\n triplets.add((nums[left], nums[i], nums[right]))\\n left +=1\\n right -= 1\\n elif current_sum < 0:\\n left += 1\\n else:\\n right -= 1\\n\\n return list(triplets)\\n\",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n n=len(nums)\\n nums.sort()\\n ans=set()\\n for i in range(n-2):\\n d={}\\n left=i+1\\n right=n-1\\n while left<right:\\n a=nums[i]+nums[left]+nums[right]\\n if a==0:\\n ans.add((nums[i],nums[left],nums[right]))\\n left+=1\\n right-=1\\n elif a>0:\\n right-=1\\n else:\\n left+=1\\n \\n\\n return list(ans)\",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n \\n nums.sort() # I will sort the array in case the inputs are not sorted\\n result = set()\\n n = len(nums)\\n\\n for i in range(n - 2):\\n \\n # Skip duplicates for i\\n #if i > 0 and nums[i] == nums[i-1]:\\n # continue\\n\\n left, right = i + 1, n - 1\\n\\n while left < right:\\n currentSum = nums[i] + nums[left] + nums[right]\\n\\n if currentSum == 0:\\n result.add((nums[i], nums[left], nums[right]))\\n\\n # Skip duplicates for left and right\\n #while left < right and nums[left] == nums[left + 1]:\\n # left += 1\\n #while left < right and nums[right] == nums[right - 1]:\\n # right -= 1\\n\\n left += 1\\n right -= 1\\n elif currentSum < 0:\\n left += 1\\n else:\\n right -= 1\\n\\n return list(result)\",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n \\n nums.sort() # I will sort the array in case the inputs are not sorted\\n result = set()\\n n = len(nums)\\n\\n for i in range(n - 2):\\n \\n # Skip duplicates for i\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n\\n left, right = i + 1, n - 1\\n\\n while left < right:\\n currentSum = nums[i] + nums[left] + nums[right]\\n\\n if currentSum == 0:\\n result.add((nums[i], nums[left], nums[right]))\\n\\n # Skip duplicates for left and right\\n while left < right and nums[left] == nums[left + 1]:\\n left += 1\\n while left < right and nums[right] == nums[right - 1]:\\n right -= 1\\n\\n left += 1\\n right -= 1\\n elif currentSum < 0:\\n left += 1\\n else:\\n right -= 1\\n\\n return list(result)\",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = set()\\n nums = sorted(nums)\\n # print(nums)\\n for idx in range(len(nums)-2):\\n search = nums[idx]\\n left, right = idx+1, len(nums)-1\\n # search\\n while left < right:\\n # print(idx, left, right)\\n if (nums[left] + nums[right]) == -search:\\n res.add((nums[idx], nums[left], nums[right]))\\n left += 1\\n elif (nums[left] + nums[right]) < -search:\\n left +=1\\n else:\\n right -= 1\\n \\n return list(res)\",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n res = set()\\n for i in range(0,len(nums) - 2):\\n left, right = i + 1, len(nums) - 1\\n while left < right:\\n threeSum = nums[i] + nums[left] + nums[right] \\n if threeSum == 0:\\n res.add((nums[i], nums[left], nums[right]))\\n left += 1\\n right -= 1\\n elif threeSum > 0:\\n right -= 1\\n else:\\n left += 1\\n return map(lambda tupleInput: list(tupleInput), res)\",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = set()\\n nums_sorted = sorted(nums)\\n for i, num in enumerate(nums_sorted):\\n print(num)\\n l = i + 1\\n r = len(nums_sorted) - 1\\n while r > l:\\n if nums_sorted[l] + nums_sorted[r] == -1 * num:\\n res.add((num, nums_sorted[l], nums_sorted[r]))\\n r -= 1\\n l += 1\\n elif num + nums_sorted[l] + nums_sorted[r] > 0:\\n r -= 1\\n else:\\n l += 1\\n return list(res)\",\n \"memory\": \"20100\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n n = len(nums)\\n\\n ans = []\\n \\n for i, a in enumerate(nums[:n-2]):\\n if a > 0:\\n continue\\n j = i+1\\n k = n-1\\n while j < k:\\n b = nums[j]\\n c = nums[k]\\n if b+c == -a:\\n ans.append((a, b, c))\\n while j<k and nums[j] == b:\\n j+=1\\n while j<k and nums[k] == c:\\n k-=1\\n elif b+c > -a:\\n k-=1\\n else:\\n j+=1\\n return list(set(ans))\\n\\n\\n\\n\",\n \"memory\": \"20100\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n \\n has_dict = {}\\n nums.sort()\\n s = set()\\n for i in range(len(nums)):\\n has_dict[i] = nums[i]\\n\\n for l in range(len(nums)):\\n r = l+1\\n k = len(nums) - 1\\n\\n while r < k:\\n tmp = nums[l] + nums[r] + nums[k]\\n\\n if tmp == 0:\\n s.add((nums[l], nums[r], nums[k]))\\n r += 1\\n k -= 1\\n\\n elif tmp > 0:\\n k -= 1\\n \\n else:\\n r += 1\\n\\n return list(s)\\n\\n \",\n \"memory\": \"20200\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n result = set()\\n seen = set()\\n\\n for i in range(len(nums)):\\n if nums[i] > 0:\\n break\\n if nums[i] in seen:\\n continue\\n else:\\n seen.add(nums[i])\\n\\n low = i+1\\n high = len(nums)-1\\n print(f'{i}, {low}, {high}')\\n while low < high:\\n s = nums[i] + nums[low] + nums[high]\\n if s == 0:\\n result.add((nums[i], nums[low], nums[high]))\\n low += 1\\n high -= 1\\n elif s < 0:\\n low += 1\\n else:\\n high -= 1\\n\\n return result\",\n \"memory\": \"20200\"\n },\n {\n \"code\": \"# class Solution:\\n# def threeSum(self, nums: List[int]) -> List[List[int]]:\\n# output=set()\\n# nums.sort()\\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\\n\\n# if (nums[i]+nums[j]+nums[k])==0:\\n# li=(nums[i],nums[j],nums[k])\\n# output.add(li)\\n# return output\\n \\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n '''\\n k = set(nums)\\n if len(k) == 1:\\n if 0 in k:\\n return [[0,0,0]]\\n st = set()\\n n = len(nums)\\n for i in range(n):\\n hashMap = set()\\n for j in range(i+1,n):\\n third = -(nums[i] + nums[j])\\n if third in hashMap:\\n temp = [nums[i],nums[j],third]\\n temp.sort()\\n st.add(tuple(temp))\\n hashMap.add(nums[j])\\n\\n return st\\n '''\\n\\n n = len(nums)\\n nums.sort()\\n ans = set()\\n for i in range(n):\\n if i !=0 and nums[i] == nums[i-1]:\\n continue\\n j = i + 1 \\n k = n - 1 \\n\\n while j < k:\\n tot = nums[i] + nums[j] + nums[k]\\n if tot < 0:\\n j += 1 \\n elif tot >0:\\n k -= 1\\n else:\\n temp = (nums[i],nums[j],nums[k])\\n ans.add(temp)\\n j += 1 \\n k -= 1 \\n\\n while j < k and nums[j] == nums[j-1]:\\n j += 1 \\n while j < k and nums[k] == nums[k+1]:\\n k -= 1 \\n\\n return ans\\n\\n\\n\\n\",\n \"memory\": \"20300\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums = sorted(nums)\\n n = len(nums)\\n ans = set()\\n\\n for i in range(n):\\n target = -nums[i]\\n \\n left, right = i + 1, n - 1\\n while left < right:\\n s = nums[left] + nums[right]\\n if s > target:\\n right -= 1\\n elif s < target:\\n left += 1\\n else:\\n ans.add((nums[i], nums[left], nums[right]))\\n left += 1\\n right -= 1\\n\\n return ans\\n\",\n \"memory\": \"20300\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n ans = set()\\n nums = sorted(nums)\\n for i in range(len(nums)-1):\\n left = i+1\\n right = len(nums)-1\\n while(left<right):\\n if(nums[left]+nums[right]+nums[i]==0):\\n ans.add((nums[i], nums[left], nums[right]))\\n left+=1\\n right-=1\\n while(left<len(nums)-1 and nums[left] == nums[left-1]):\\n left+=1\\n while(right>=0 and nums[right]==nums[right+1]):\\n right-=1\\n elif(nums[left]+nums[right]+nums[i]>0):\\n right-=1\\n while(right>=0 and nums[right]==nums[right+1]):\\n right-=1\\n else:\\n left+=1\\n while(left<=len(nums)-1 and nums[left] == nums[left-1]):\\n left+=1\\n return ans\\n\",\n \"memory\": \"20400\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums = sorted(nums)\\n result = set()\\n n = len(nums)\\n\\n for i in range(n):\\n target = -nums[i]\\n left = i + 1\\n right = n - 1\\n while left < right:\\n current = nums[left] + nums[right]\\n if current == target:\\n result.add((nums[i], nums[left], nums[right]))\\n if current > target:\\n right -= 1\\n else:\\n left += 1\\n return result\",\n \"memory\": \"20400\"\n },\n {\n \"code\": \"from typing import List, Set, Tuple\\n\\nclass Solution:\\n # my twoSum assumes sorted nums array and returns unique set of pairs that sum to target target\\n def twoSum(self, sortedNums: List[int], left, right, target: int) -> Set[Tuple[int, int]]:\\n if len(sortedNums) < 2:\\n return set()\\n\\n resultSet = set()\\n \\n while left < right:\\n currSum = sortedNums[left] + sortedNums[right]\\n if currSum == target:\\n resultSet.add((sortedNums[left], sortedNums[right]))\\n left += 1\\n right -= 1\\n elif currSum < target:\\n left += 1\\n else:\\n right -= 1\\n return resultSet\\n\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n resultSet = set()\\n\\n listLen = len(nums)\\n for i in range(listLen - 2):\\n firstElement = nums[i]\\n rightArrayPairSet = self.twoSum(nums, left=(i+1), right=(listLen-1), target=(0 - firstElement))\\n \\n for pair in rightArrayPairSet:\\n resultSet.add((firstElement, pair[0], pair[1]))\\n\\n return resultSet\\n\",\n \"memory\": \"20500\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n ## Brute forcing:\\n # results = []\\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] == 0) and (i != j) and (i != k) and (j != k):\\n # temp = [nums[i], nums[j], nums[k]]\\n # temp.sort()\\n # if temp not in results:\\n # results.append(temp)\\n\\n # return results\\n\\n\\n # Going for a two pointer approach O(n^2)\\n\\n nums.sort()\\n results = []\\n\\n for i in range (len(nums)): # Three required, no need to run loop till the end\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue # Avoiding duplicates\\n left = i + 1\\n right = len(nums) - 1\\n while left < right:\\n\\n if ((nums[i] + nums[left] + nums[right]) == 0):\\n\\n temp = [nums[i], nums[left], nums[right]]\\n results.append(temp)\\n\\n left += 1\\n\\n # Avoiding duplicates\\n while nums[left] == nums[left - 1] and left < right:\\n left += 1\\n\\n elif (nums[i] + nums[left] + nums[right] > 0):\\n right -= 1\\n else:\\n left += 1\\n \\n return results\\n\",\n \"memory\": \"20500\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n triplets = []\\n\\n for i in range(len(nums)):\\n l, r = i + 1, len(nums) - 1\\n\\n if i > 0 and nums[i] != nums[i - 1] or i == 0:\\n while l < r:\\n if nums[i] + nums[l] + nums[r] > 0:\\n r -= 1\\n elif nums[i] + nums[l] + nums[r] < 0:\\n l += 1\\n else:\\n triplets.append([nums[i], nums[l], nums[r]])\\n l += 1\\n while nums[l] == nums[l - 1] and l < r:\\n l += 1\\n return triplets\",\n \"memory\": \"20600\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n triplets = []\\n\\n for i in range(len(nums)):\\n l, r = i + 1, len(nums) - 1\\n\\n if i > 0 and nums[i] != nums[i - 1] or i == 0:\\n while l < r:\\n if nums[i] + nums[l] + nums[r] > 0:\\n r -= 1\\n elif nums[i] + nums[l] + nums[r] < 0:\\n l += 1\\n else:\\n triplets.append([nums[i], nums[l], nums[r]])\\n l += 1\\n while nums[l] == nums[l - 1] and l < r:\\n l += 1\\n return triplets\",\n \"memory\": \"20600\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n result = []\\n nums.sort() \\n for i, a in enumerate(nums):\\n if i > 0 and a == nums[i-1]: \\n continue\\n l, r = i + 1, len(nums) - 1\\n while l < r:\\n threeSum = a + nums[l] + nums[r]\\n if threeSum > 0:\\n r -= 1\\n elif threeSum < 0:\\n l += 1\\n else: \\n result.append([a , nums[l], nums[r]]) \\n l += 1 \\n while nums[l] == nums[l-1] and l < r:\\n l+=1\\n return result\",\n \"memory\": \"20700\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n result = []\\n nums.sort()\\n\\n for index, number in enumerate(nums):\\n if index > 0 and number == nums[index - 1]:\\n continue\\n \\n left, right = index + 1, len(nums)-1\\n\\n while left < right:\\n threeSum = number + nums[left] + nums[right]\\n \\n if threeSum > 0:\\n right -= 1\\n elif threeSum < 0:\\n left += 1\\n else:\\n result.append([number, nums[left], nums[right]])\\n\\n while left < right and nums[left] == nums[left + 1]:\\n left += 1\\n \\n while left < right and nums[right] == nums[right - 1]:\\n right -= 1\\n \\n left += 1\\n right -= 1\\n \\n return result\",\n \"memory\": \"20700\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n nums.sort()\\n\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n \\n j = i + 1\\n k = len(nums)-1\\n while j < k:\\n total = nums[i] + nums[j] + nums[k]\\n\\n if total > 0:\\n k -= 1\\n elif total < 0:\\n j += 1\\n else:\\n res.append([nums[i], nums[j], nums[k]])\\n j += 1\\n\\n while nums[j] == nums[j-1] and j < k:\\n j += 1\\n\\n return res\",\n \"memory\": \"20800\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n nums.sort()\\n\\n for i, a in enumerate(nums):\\n # Skip positive integers\\n if a > 0:\\n break\\n\\n if i > 0 and a == nums[i - 1]:\\n continue\\n\\n l, r = i + 1, len(nums) - 1\\n while l < r:\\n threeSum = a + nums[l] + nums[r]\\n if threeSum > 0:\\n r -= 1\\n elif threeSum < 0:\\n l += 1\\n else:\\n res.append([a, nums[l], nums[r]])\\n l += 1\\n r -= 1\\n while nums[l] == nums[l - 1] and l < r:\\n l += 1\\n \\n return res\\n\",\n \"memory\": \"20800\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n triplets = []\\n\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n \\n target = -nums[i]\\n j, k = i + 1, len(nums) - 1\\n\\n while j < k:\\n if nums[j] + nums[k] < target:\\n j += 1\\n elif nums[j] + nums[k] > target:\\n k -= 1\\n else:\\n triplets.append([-target, nums[j], nums[k]])\\n j += 1\\n while j <= k and nums[j] == nums[j - 1]:\\n j += 1\\n \\n return triplets\",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n return nSum(nums,3,0,0)\\n\\ndef nSum(arr,n,start,k):\\n sz=len(arr)\\n res=[]\\n if n<2 or sz<n:\\n return res\\n if n==2:\\n l=start\\n r=sz-1\\n while l<r:\\n left,right=arr[l],arr[r]\\n curr=left+right\\n if curr>k:\\n while l<r and arr[r]==right:\\n r-=1\\n elif curr<k:\\n while l<r and arr[l]==left:\\n l+=1\\n else:\\n res.append([left,right])\\n while l<r and arr[l]==left:\\n l+=1\\n while l<r and arr[r]==right:\\n r-=1\\n return res\\n else:\\n for i in range(start,sz):\\n if i > start and arr[i]==arr[i-1]:\\n continue\\n sols=nSum(arr,n-1,i+1,k-arr[i])\\n for sol in sols:\\n sol.append(arr[i])\\n res.append(sol)\\n return res\",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = []\\n nums.sort()\\n for i in range(len(nums)):\\n if nums[i] > 0:\\n break\\n if i == 0 or nums[i - 1] != nums[i]:\\n self.twoSum(nums, i, res)\\n return res\\n\\n def twoSum(self, nums: List[int], i: int, res: List[List[int]]):\\n seen = set()\\n j = i + 1\\n while j < len(nums):\\n complement = -nums[i] - nums[j]\\n if complement in seen:\\n res.append([nums[i], nums[j], complement])\\n while j + 1 < len(nums) and nums[j] == nums[j + 1]:\\n j += 1\\n seen.add(nums[j])\\n j += 1\",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n\\n m = {i:1 for i in nums}\\n ans = []\\n nums.sort()\\n negatives = [i for i in nums if i < 0]\\n zeroes = [i for i in nums if i == 0]\\n positives = [i for i in nums if i > 0]\\n\\n if len(nums) < 3:\\n return []\\n \\n if len(zeroes) >= 3:\\n ans.append([0,0,0])\\n\\n if len(zeroes) > 0:\\n for i in set(negatives):\\n if m.get(-i):\\n ans.append([i,0,-i])\\n\\n for ni in set(negatives):\\n ts_ar = self.twoSum(positives, -ni)\\n if len(ts_ar) > 0:\\n for ts in ts_ar:\\n ans.append([ni,ts[0],ts[1]])\\n\\n for pi in set(positives):\\n ts_ar = self.twoSum(negatives, -pi)\\n if len(ts_ar) > 0:\\n for ts in ts_ar:\\n ans.append([ts[0],ts[1],pi])\\n\\n return ans\\n\\n def twoSum(self, nums, target):\\n d={}\\n ans = []\\n\\n for i in range(len(nums)):\\n if i>0 and nums[i]==nums[i-1]:\\n if i>1 and nums[i-1]==nums[i-2]:\\n pass\\n elif nums[i]+nums[i-1]==target:\\n ans.append([nums[i], nums[i-1]])\\n elif d.get(target-nums[i]) is not None:\\n ans.append([nums[i], nums[d.get(target-nums[i])]])\\n d[nums[i]]=i \\n \\n return ans\",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n\\n res = set()\\n\\n #1. Split nums into three lists: negative numbers, positive numbers, and zeros\\n n, p, z = [], [], []\\n for num in nums:\\n if num > 0:\\n p.append(num)\\n elif num < 0: \\n n.append(num)\\n else:\\n z.append(num)\\n\\n #2. Create a separate set for negatives and positives for O(1) look-up times\\n N, P = set(n), set(p)\\n\\n #3. If there is at least 1 zero in the list, add all cases where -num exists in N and num exists in P\\n # i.e. (-3, 0, 3) = 0\\n if z:\\n for num in P:\\n if -1*num in N:\\n res.add((-1*num, 0, num))\\n\\n #3. If there are at least 3 zeros in the list then also include (0, 0, 0) = 0\\n if len(z) >= 3:\\n res.add((0,0,0))\\n\\n #4. For all pairs of negative numbers (-3, -1), check to see if their complement (4)\\n # exists in the positive number set\\n for i in range(len(n)):\\n for j in range(i+1,len(n)):\\n target = -1*(n[i]+n[j])\\n if target in P:\\n res.add(tuple(sorted([n[i],n[j],target])))\\n\\n #5. For all pairs of positive numbers (1, 1), check to see if their complement (-2)\\n # exists in the negative number set\\n for i in range(len(p)):\\n for j in range(i+1,len(p)):\\n target = -1*(p[i]+p[j])\\n if target in N:\\n res.add(tuple(sorted([p[i],p[j],target])))\\n\\n return res\\n \",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n\\n res = set()\\n\\n # 1. Split nums into three lists: negative numbers, positive numbers, and zeros\\n n, p, z = [], [], []\\n for num in nums:\\n if num > 0:\\n p.append(num)\\n elif num < 0:\\n n.append(num)\\n else:\\n z.append(num)\\n\\n # 2. Create a separate set for negatives and positives for O(1) look-up times\\n N, P = set(n), set(p)\\n\\n # 3. If there is at least 1 zero in the list, add all cases where -num exists in N and num exists in P\\n # i.e. (-3, 0, 3) = 0\\n if z:\\n for num in P:\\n if -1 * num in N:\\n res.add((-1 * num, 0, num))\\n\\n # 3. If there are at least 3 zeros in the list then also include (0, 0, 0) = 0\\n if len(z) >= 3:\\n res.add((0, 0, 0))\\n\\n # 4. For all pairs of negative numbers (-3, -1), check to see if their complement (4)\\n # exists in the positive number set\\n for i in range(len(n)):\\n for j in range(i + 1, len(n)):\\n target = -1 * (n[i] + n[j])\\n if target in P:\\n res.add(tuple(sorted([n[i], n[j], target])))\\n\\n # 5. For all pairs of positive numbers (1, 1), check to see if their complement (-2)\\n # exists in the negative number set\\n for i in range(len(p)):\\n for j in range(i + 1, len(p)):\\n target = -1 * (p[i] + p[j])\\n if target in N:\\n res.add(tuple(sorted([p[i], p[j], target])))\\n\\n return res\",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n nums.sort()\\n result = []\\n print(nums)\\n\\n for i in range(n):\\n # As the numbers are sorted, if current value is greater than 0,\\n # the remaining numbers cannot sum to 0\\n if nums[i] > 0:\\n break\\n \\n # print(i, nums[i-1], nums[i])\\n # Toi avoid duplicate triplets\\n if i != 0 and nums[i-1] == nums[i]:\\n continue\\n\\n tracker = set()\\n # target = 0 - nums[i]\\n j = i + 1\\n while j < n:\\n # num = nums[j]\\n complement = 0 - nums[i] - nums[j]\\n if complement in tracker:\\n result.append([nums[i], nums[j], complement])\\n\\n # If there are duplicates in this subset\\n while j + 1 < n and nums[j] == nums[j + 1]:\\n j += 1\\n tracker.add(nums[j])\\n j += 1\\n\\n return result\\n\\n\\n # Doesn't work\\n def threeSum2(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n nums.sort()\\n result = set()\\n\\n for i in range(n):\\n # As the numbers are sotted, if current value is greater than 0,\\n # the remaining numbers cannot sum to 0\\n if nums[i] > 0:\\n break\\n \\n # print(i, nums[i-1], nums[i])\\n if i != 0 and nums[i-1] == nums[i]:\\n continue\\n\\n tracker = set()\\n target = 0 - nums[i]\\n for j in range(1, n):\\n num = nums[j]\\n if (target - num) in tracker:\\n new_res = sorted((nums[i], nums[j], target - num))\\n result.add(new_res)\\n tracker.add(num)\\n\\n return result\\n\\n \",\n \"memory\": \"21200\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: list[int]) -> list[list[int]]:\\n negative_numbers, positive_numbers, zeroes = [], [], []\\n for num in nums:\\n if num > 0:\\n positive_numbers.append(num)\\n elif num < 0:\\n negative_numbers.append(num)\\n else:\\n zeroes.append(num)\\n\\n triplets = set()\\n\\n negative_numbers_set = set(negative_numbers)\\n positive_numbers_set = set(positive_numbers)\\n\\n if zeroes:\\n for negative_number in negative_numbers_set:\\n if -negative_number in positive_numbers_set:\\n triplets.add((negative_number, 0, -negative_number))\\n\\n if len(zeroes) >= 3:\\n triplets.add((0, 0, 0))\\n\\n for i in range(len(negative_numbers)):\\n for j in range(i + 1, len(negative_numbers)):\\n target = -(negative_numbers[i] + negative_numbers[j])\\n if target in positive_numbers_set:\\n triplet = sorted([negative_numbers[i], negative_numbers[j], target])\\n\\n triplets.add(tuple(triplet))\\n\\n for i in range(len(positive_numbers)):\\n for j in range(i + 1, len(positive_numbers)):\\n target = -(positive_numbers[i] + positive_numbers[j])\\n if target in negative_numbers_set:\\n triplet = sorted([positive_numbers[i], positive_numbers[j], target])\\n triplets.add(tuple(triplet))\\n\\n return triplets\",\n \"memory\": \"21200\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n exist_hash = {}\\n for i in range(len(nums)):\\n if nums[i] in exist_hash:\\n exist_hash[nums[i]].append(i)\\n else:\\n exist_hash[nums[i]] = [i]\\n\\n result_set = set()\\n for i in range(len(nums)):\\n if i>0 and nums[i]==nums[i-1]:\\n continue\\n for j in range(i+1, len(nums)):\\n # print(i, j)\\n s = nums[i]+nums[j]\\n if -s not in exist_hash:\\n continue\\n triplet = [nums[i], nums[j], -s]\\n triplet.sort()\\n triplet = tuple(triplet)\\n if triplet in result_set:\\n continue\\n for k in exist_hash[-s]:\\n # print(k)\\n if i!=k and j!=k:\\n result_set.add(tuple(triplet))\\n break\\n return list(result_set)\",\n \"memory\": \"21300\"\n },\n {\n \"code\": \"class Solution:\\n\\n def threeSum2(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n nums.sort()\\n\\n def twosum(i):\\n low = i + 1\\n high = len(nums) - 1\\n while left < right:\\n sum = nums[i] + nums[left] + nums[right]\\n if sum == target:\\n result.append([nums[left], nums[right]])\\n left += 1\\n high -=1\\n # to avoid duplicates\\n while left < high and nums[left] == nums[left-1]:\\n left += 1 \\n elif sum > target:\\n right -= 1\\n else:\\n left += 1\\n\\n result = [] \\n for i in range(n - 2):\\n if nums[i] > 0:\\n break\\n\\n # To avoid duplicates\\n if i != 0 and nums[i-1] == nums[i]:\\n continue\\n twosum(i)\\n \\n return result\\n \\n\\n # Hashset\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n nums.sort()\\n result = []\\n print(nums)\\n\\n for i in range(n):\\n # As the numbers are sorted, if current value is greater than 0,\\n # the remaining numbers cannot sum to 0\\n if nums[i] > 0:\\n break\\n \\n # print(i, nums[i-1], nums[i])\\n # Toi avoid duplicate triplets\\n if i != 0 and nums[i-1] == nums[i]:\\n continue\\n\\n tracker = set()\\n # target = 0 - nums[i]\\n j = i + 1\\n while j < n:\\n # num = nums[j]\\n complement = 0 - nums[i] - nums[j]\\n if complement in tracker:\\n result.append([nums[i], nums[j], complement])\\n\\n # If there are duplicates in this subset\\n while j + 1 < n and nums[j] == nums[j + 1]:\\n j += 1\\n tracker.add(nums[j])\\n j += 1\\n\\n return result\\n\\n\\n # Doesn't work\\n def threeSum2(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n nums.sort()\\n result = set()\\n\\n for i in range(n):\\n # As the numbers are sorted, if current value is greater than 0,\\n # the remaining numbers cannot sum to 0\\n if nums[i] > 0:\\n break\\n \\n # print(i, nums[i-1], nums[i])\\n if i != 0 and nums[i-1] == nums[i]:\\n continue\\n\\n tracker = set()\\n target = 0 - nums[i]\\n for j in range(1, n):\\n num = nums[j]\\n if (target - num) in tracker:\\n new_res = sorted((nums[i], nums[j], target - num))\\n result.add(new_res)\\n tracker.add(num)\\n\\n return result\\n\\n \",\n \"memory\": \"21300\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res, dups = set(), set()\\n seen = {}\\n for i, val1 in enumerate(nums):\\n if val1 not in dups:\\n dups.add(val1)\\n for j, val2 in enumerate(nums[i + 1 :]):\\n complement = -val1 - val2\\n if complement in seen and seen[complement] == i:\\n res.add(tuple(sorted((val1, val2, complement))))\\n seen[val2] = i\\n return res\",\n \"memory\": \"21400\"\n },\n {\n \"code\": \"# class Solution:\\n# def threeSum(self, nums: List[int]) -> List[List[int]]:\\n# result = []\\n# nums.sort()\\n# for i in range(len(nums)):\\n# if nums[i] > 0:\\n# break\\n \\n# if i > 0 and nums[i] == nums[i-1]:\\n# continue\\n\\n# left, right = i + 1, len(nums) - 1\\n# while left < right:\\n# if nums[i] + nums[left] + nums[right] > 0:\\n \\n# right -= 1\\n\\n# elif nums[i] + nums[left] + nums[right] < 0:\\n# left += 1\\n# else:\\n# result.append([nums[i], nums[left], nums[right]])\\n# left += 1\\n# while nums[left] == nums[left - 1] and left < right:\\n# left += 1\\n# return result\\n\\nclass Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res, dups = set(), set()\\n seen = {}\\n for i, val1 in enumerate(nums):\\n if val1 not in dups:\\n dups.add(val1)\\n for j, val2 in enumerate(nums[i + 1 :]):\\n complement = -val1 - val2\\n if complement in seen and seen[complement] == i:\\n res.add(tuple(sorted((val1, val2, complement))))\\n seen[val2] = i\\n return res\\n\",\n \"memory\": \"21400\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = set()\\n dups = set()\\n seen = {}\\n\\n for i, val1 in enumerate(nums):\\n if val1 not in dups:\\n dups.add(val1)\\n for j, val2 in enumerate(nums[i + 1 : ]):\\n val3 = 0 - val1 - val2\\n if val3 in seen and seen[val3] == i:\\n res.add(tuple(sorted((val1, val2, val3))))\\n seen[val2] = i\\n return res\\n\\n# Time Complexity: O(N^2)\\n# Space Complexity: O(N)\",\n \"memory\": \"21500\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = set()\\n dup = set()\\n seen = {}\\n\\n for i, val1 in enumerate(nums):\\n if val1 not in dup:\\n dup.add(val1)\\n for j, val2 in enumerate(nums[i + 1 : ]):\\n val3 = 0 - val1 - val2\\n if val3 in seen and seen[val3] == i:\\n res.add(tuple(sorted((val1, val2, val3))))\\n seen[val2] = i\\n\\n return res\",\n \"memory\": \"21500\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n res = set()\\n dups = set()\\n seen = {}\\n\\n for i, val1 in enumerate(nums):\\n if val1 not in dups:\\n dups.add(val1)\\n for j, val2 in enumerate(nums[i + 1 : ]):\\n val3 = 0 - val1 - val2\\n if val3 in seen and seen[val3] == i:\\n res.add(tuple(sorted((val1, val2, val3))))\\n seen[val2] = i\\n return res\",\n \"memory\": \"21600\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n # sort the arr\\n # iterate the nums\\n # target = cur num (i.e. find the sum for the rest = cur num)\\n # using 2 pointers (left from cur index, right from end)\\n # if num[l] + num[r] == -target , append ans, > target r-- , M target l++\\n nums.sort() # O(NlogN)\\n ans = set() # Space: O(N)\\n for i, n in enumerate(nums): #O(N)\\n l = i+1\\n r = len(nums) - 1\\n target = -n\\n while l < r: #O(N)\\n two_sum = nums[l] + nums[r]\\n if two_sum == target:\\n ans.add((n, nums[l], nums[r]))\\n l += 1\\n r -= 1\\n\\n elif two_sum > target:\\n r -= 1\\n else:\\n l += 1\\n\\n res = [] # Space: O(N)\\n for t in ans: # O(N)\\n res.append(list(t))\\n\\n # Compute: O(NlogN + O(N^2) + O(N))\\n # Space: O(N) + O(N)\\n return res\",\n \"memory\": \"21600\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n num_to_index = {}\\n known = set()\\n for i, n in enumerate(nums):\\n if n in num_to_index:\\n num_to_index[n].append(i)\\n else:\\n num_to_index[n] = [i]\\n ret = []\\n unique_indexes = [num_to_index[i][0] for i in num_to_index.keys()]\\n for i in unique_indexes:\\n for y in range(i+1, len(nums)):\\n # we need x such that x + nums[i] + nums[y] = 0\\n searching = -nums[i]-nums[y]\\n if searching in num_to_index and len(num_to_index[searching]) > 0:\\n k = 0\\n while k < len(num_to_index[searching]):\\n index = num_to_index[searching][k]\\n if index != i and index != y:\\n break\\n k+=1\\n if k == len(num_to_index[searching]):\\n continue\\n triple = [nums[i], nums[y], searching]\\n triple.sort()\\n string = str(triple[0]) + \\\",\\\" + str(triple[1]) + \\\",\\\" + str(triple[2])\\n if not string in known:\\n ret.append(triple)\\n known.add(string)\\n return ret\",\n \"memory\": \"21700\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n \\n # ### Soln 1: lookup table which takes too long to check for duplicates\\n # tab = {}\\n # num_len = len(nums)\\n # for i in range(num_len):\\n # cur_n = nums[i]\\n # if cur_n in tab:\\n # tab[cur_n].append(i)\\n # else:\\n # tab[cur_n] = [i]\\n\\n # out = []\\n # for i in range(num_len - 2):\\n # for j in range(i+1, num_len - 1):\\n # diff = -(nums[i] + nums[j])\\n # if diff in tab:\\n # for temp_k in tab[diff]:\\n # if temp_k > j and sorted([nums[i], nums[j], nums[temp_k]]) not in out:\\n # out.append(sorted([nums[i], nums[j], nums[temp_k]]))\\n # return out\\n\\n out = []\\n pos = {}\\n neg = {}\\n zer = []\\n for i in range(len(nums)):\\n cur_num = nums[i]\\n if cur_num == 0:\\n zer.append(i)\\n elif cur_num > 0:\\n if cur_num in pos:\\n pos[cur_num].append(i)\\n else:\\n pos[cur_num] = [i]\\n elif cur_num < 0:\\n if cur_num in neg:\\n neg[cur_num].append(i)\\n else:\\n neg[cur_num] = [i]\\n \\n # Case 1: all zero\\n if len(zer) >= 3:\\n out.append([0,0,0])\\n # Case 2: +, 0, -\\n if len(zer) >= 1:\\n for k in pos:\\n if -k in neg:\\n out.append([k, 0, -k])\\n # Case 3: +k, +k, -2k\\n for k,v in pos.items():\\n if len(v) >= 2:\\n if -2*k in neg:\\n out.append([k, k, -2*k])\\n # Case 4: -k, -k, +2k\\n for k,v in neg.items():\\n if len(v) >= 2:\\n if -2*k in pos:\\n out.append([-2*k, k, k])\\n # Case 5:\\n pos_keys = list(pos.keys())\\n for i in range(len(pos_keys)):\\n for j in range(i + 1, len(pos_keys)):\\n if -(pos_keys[i] + pos_keys[j]) in neg:\\n out.append([pos_keys[i], pos_keys[j], -(pos_keys[i] + pos_keys[j])])\\n neg_keys = list(neg.keys())\\n for i in range(len(neg_keys)):\\n for j in range(i + 1, len(neg_keys)):\\n if -(neg_keys[i] + neg_keys[j]) in pos:\\n out.append([-(neg_keys[i] + neg_keys[j]), neg_keys[i], neg_keys[j]])\\n\\n return out\\n\\n\\n\\n\\n \\n\\n \",\n \"memory\": \"21700\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n # sort the arr\\n # iterate the nums\\n # target = cur num (i.e. find the sum for the rest = cur num)\\n # using 2 pointers (left from cur index, right from end)\\n # if num[l] + num[r] == -target , append ans, > target r-- , M target l++\\n nums.sort() # O(NlogN)\\n ans = set() # Space: O(N)\\n for i, n in enumerate(nums): #O(N)\\n\\n # sum of the rest of the number won't be zero\\n if n > 0:\\n break\\n if i > 0 and n == nums[i-1]:\\n continue\\n l = i+1\\n r = len(nums) - 1\\n target = -n\\n while l < r: #O(N)\\n two_sum = nums[l] + nums[r]\\n if two_sum == target:\\n ans.add((n, nums[l], nums[r]))\\n l += 1\\n r -= 1\\n\\n elif two_sum > target:\\n r -= 1\\n else:\\n l += 1\\n\\n res = [] # Space: O(N)\\n for t in ans: # O(N)\\n res.append(list(t))\\n\\n # Compute: O(NlogN + O(N^2) + O(N))\\n # Space: O(N) + O(N)\\n return res\",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n result_list = []\\n result_dict = dict()\\n nums.sort()\\n for i in range(len(nums)):\\n left, right = i + 1, len(nums) - 1\\n target = nums[i] * -1\\n while left < right:\\n if nums[left] + nums[right] == target:\\n sub_result = (nums[i], nums[left], nums[right])\\n result_dict[hash(sub_result)] = sub_result\\n left += 1\\n elif nums[left] + nums[right] < target:\\n left += 1\\n else:\\n right -= 1\\n return result_dict.values()\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # for j in range(i + 1, len(nums)):\\n # for k in range(j + 1, len(nums)):\\n # if i != j and i != k and j != k and nums[i] + nums[j] + nums[k] == 0:\\n # result = [nums[i],nums[j],nums[k]]\\n # result.sort()\\n # if result not in result_list:\\n # result_list.append(result)\\n \\n\",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n\\n output = set()\\n for i in range(len(nums) - 2):\\n j = i + 1\\n k = len(nums) - 1\\n\\n while j < k:\\n _sum = nums[i] + nums[j] + nums[k]\\n if _sum == 0:\\n output.add((nums[i], nums[j], nums[k]))\\n j += 1\\n k -= 1\\n elif _sum > 0:\\n k -= 1\\n else:\\n j += 1\\n\\n return [list(o) for o in output]\\n \",\n \"memory\": \"21900\"\n },\n {\n \"code\": \"class Solution:\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n nums.sort()\\n\\n output = set()\\n for i in range(len(nums) - 2):\\n j = i + 1\\n k = len(nums) - 1\\n\\n while j < k:\\n _sum = nums[i] + nums[j] + nums[k]\\n if _sum == 0:\\n output.add((nums[i], nums[j], nums[k]))\\n j += 1\\n k -= 1\\n while j < k and nums[j] == nums[j-1]:\\n j += 1\\n while j < k and nums[k] == nums[k+1]:\\n k -= 1\\n elif _sum > 0:\\n k -= 1\\n else:\\n j += 1\\n\\n return [list(o) for o in output]\\n \",\n \"memory\": \"21900\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":58,"string":"58"}}},{"rowIdx":182,"cells":{"question_id":{"kind":"number","value":16,"string":"16"},"name":{"kind":"string","value":"3sum-closest"},"content":{"kind":"string","value":"<p>Given an integer array <code>nums</code> of length <code>n</code> and an integer <code>target</code>, find three integers in <code>nums</code> such that the sum is closest to <code>target</code>.</p>\n\n<p>Return <em>the sum of the three integers</em>.</p>\n\n<p>You may assume that each input would have exactly one solution.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [-1,2,1,-4], target = 1\n<strong>Output:</strong> 2\n<strong>Explanation:</strong> The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [0,0,0], target = 1\n<strong>Output:</strong> 0\n<strong>Explanation:</strong> The sum that is closest to the target is 0. (0 + 0 + 0 = 0).\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>3 <= nums.length <= 500</code></li>\n\t<li><code>-1000 <= nums[i] <= 1000</code></li>\n\t<li><code>-10<sup>4</sup> <= target <= 10<sup>4</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":46.0757704019327,"string":"46.07577"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","two-pointers","sorting"],"string":"[\n \"array\",\n \"two-pointers\",\n \"sorting\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"39\", 0.184], [\"49\", 0.7369], [\"59\", 1.7316], [\"69\", 0.5156999999999999], [\"79\", 0.30390000000000006], [\"89\", 0.1012], [\"99\", 0.046], [\"109\", 0.0552], [\"119\", 0.0184], [\"129\", 0.0184], [\"139\", 0.0552], [\"149\", 0.0276], [\"159\", 0.0276], [\"169\", 0.0092], [\"179\", 0.0092], [\"189\", 0.0092], [\"199\", 0.0092], [\"209\", 0.0276], [\"219\", 0.0368], [\"229\", 0.0828], [\"239\", 0.0644], [\"249\", 0.0552], [\"259\", 0.0368], [\"269\", 0.092], [\"279\", 0.1012], [\"289\", 0.092], [\"299\", 0.1564], [\"309\", 0.4145], [\"319\", 0.3868], [\"329\", 1.05], [\"339\", 2.8646000000000003], [\"349\", 5.075200000000001], [\"359\", 4.513199999999999], [\"369\", 3.4080000000000004], [\"379\", 3.4724000000000004], [\"389\", 6.2078999999999995], [\"399\", 11.808], [\"409\", 13.585700000000003], [\"419\", 9.5239], [\"429\", 5.7474], [\"439\", 3.8594], [\"449\", 3.3434], [\"459\", 2.0262999999999995], [\"469\", 1.3907999999999998], [\"479\", 1.1328], [\"489\", 1.0499999999999998], [\"499\", 0.8474999999999999], [\"509\", 0.7828999999999999], [\"519\", 0.5802999999999999], [\"529\", 0.5619000000000001], [\"539\", 0.5804], [\"549\", 0.5342], [\"559\", 0.4975], [\"569\", 0.48810000000000003], [\"579\", 0.4698], [\"589\", 0.33140000000000003], [\"599\", 0.359], [\"609\", 0.3961], [\"619\", 0.20259999999999997], [\"629\", 0.22099999999999997], [\"639\", 0.20240000000000002], [\"649\", 0.19319999999999998], [\"659\", 0.18409999999999999], [\"669\", 0.23929999999999996], [\"679\", 0.16559999999999997], [\"689\", 0.15639999999999998], [\"699\", 0.21170000000000003], [\"709\", 0.22089999999999996], [\"719\", 0.1104], [\"729\", 0.1472], [\"739\", 0.1288], [\"749\", 0.092], [\"759\", 0.0644], [\"769\", 0.1012], [\"779\", 0.046], [\"789\", 0.14730000000000001], [\"799\", 0.1196], [\"809\", 0.0368], [\"819\", 0.0552], [\"829\", 0.0552]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16000\", 0.0092], [\"16100\", 0.0092], [\"16200\", 0.0276], [\"16300\", 0.304], [\"16400\", 2.9106], [\"16500\", 19.7476], [\"16600\", 35.5623], [\"16700\", 34.0149]]}"},"rt_list":{"kind":"list like","value":[{"code":"def threeSumClosest(nums: List[int], target: int) -> int:\n if (n := len(nums)) <= 8:\n return min((sum(pair) for pair in combinations(nums, 3)), key=lambda x: abs(target-x))\n nums.sort()\n\n closest_so_far = 100000\n\n i, ell = 0, n\n x = nums\n while i+2 < ell:\n z_min = x[i]+x[i+1]+x[i+2]\n if target <= z_min:\n if abs(target-closest_so_far) > z_min-target:\n return z_min\n break\n\n z_max = x[i]+x[ell-2]+x[ell-1]\n if z_max < target:\n if abs(target-closest_so_far) > target-z_max:\n closest_so_far = z_max\n i = bisect_right(nums, x[i], i)\n continue\n \n\n l, r = i+1, ell-1\n while l < r:\n l = bisect_right(nums, target-x[i]-x[r], l, r)\n if i < l-1:\n z = x[i]+x[l-1]+x[r]\n if abs(target - closest_so_far) > target - z:\n closest_so_far = z\n if z == target:\n return target\n \n r = bisect_left(nums, target-x[i]-x[l], l+1, r+1)-1\n if r+1 < ell:\n z = x[i]+x[l]+x[r+1]\n if abs(target - closest_so_far) > z - target:\n closest_so_far = z\n if z == target:\n return target\n\n i = bisect_right(nums, x[i], i)\n\n return closest_so_far\n\nwith open(\"user.out\", \"w\") as f:\n inp = map(loads, stdin)\n for nums in inp:\n print(f\"{threeSumClosest(nums, next(inp))}\", file=f)\n\nexit(0)","runtime":"39"},{"code":"def threeSumClosest(nums: List[int], target: int) -> int:\n nums.sort()\n\n closest_so_far = float('inf')\n\n i, ell = 0, len(nums)\n x = nums\n while i+2 < ell:\n z_min = x[i]+x[i+1]+x[i+2]\n if target <= z_min:\n if abs(target-closest_so_far) > z_min-target:\n return z_min\n break\n\n z_max = x[i]+x[ell-2]+x[ell-1]\n if z_max < target:\n if abs(target-closest_so_far) > target-z_max:\n closest_so_far = z_max\n i = bisect_right(nums, x[i], i)\n continue\n \n\n l, r = i+1, ell-1\n while l < r:\n l = bisect_right(nums, target-x[i]-x[r], l, r)\n if i < l-1:\n z = x[i]+x[l-1]+x[r]\n if abs(target - closest_so_far) > target - z:\n closest_so_far = z\n if z == target:\n return target\n \n r = bisect_left(nums, target-x[i]-x[l], l+1, r+1)-1\n if r+1 < ell:\n z = x[i]+x[l]+x[r+1]\n if abs(target - closest_so_far) > z - target:\n closest_so_far = z\n if z == target:\n return target\n\n i = bisect_right(nums, x[i], i)\n\n return closest_so_far\n\nwith open(\"user.out\", \"w\") as f:\n inp = map(loads, stdin)\n for nums in inp:\n target = next(inp)\n print(f\"{threeSumClosest(nums,target)}\", file=f)\nexit(0)","runtime":"39"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n return self.KSumClosest(nums, 3, target)\n\n def KSumClosest(self, nums: List[int], k: int, target: int) -> int:\n N = len(nums)\n if N == k:\n return sum(nums[:k])\n\n # target too small\n current = sum(nums[:k])\n if current >= target:\n return current\n\n # target too big\n current = sum(nums[-k:])\n if current <= target:\n return current\n \n if k == 1:\n return min([(x, abs(target - x)) for x in nums], key = lambda x: x[1])[0]\n\n closest = sum(nums[:k])\n for i, x in enumerate(nums[:-k+1]):\n if i>0 and x == nums[i-1]:\n continue\n current = self.KSumClosest(nums[i+1:], k-1, target - x) + x\n if abs(target - current) < abs(target - closest):\n if current == target:\n return target\n else:\n closest = current\n\n return closest","runtime":"49"},{"code":"def threeSumClosest(nums: List[int], target: int) -> int:\n nums.sort()\n\n closest_so_far = float('inf')\n\n i, ell = 0, len(nums)\n x = nums\n while i+2 < ell:\n z_min = x[i]+x[i+1]+x[i+2]\n if target <= z_min:\n if abs(target-closest_so_far) > z_min-target:\n return z_min\n break\n\n z_max = x[i]+x[ell-2]+x[ell-1]\n if z_max < target:\n if abs(target-closest_so_far) > target-z_max:\n closest_so_far = z_max\n i = bisect_right(nums, x[i], i)\n continue\n \n\n l, r = i+1, ell-1\n while l < r:\n l = bisect_right(nums, target-x[i]-x[r], l, r)\n if i < l-1:\n z = x[i]+x[l-1]+x[r]\n if abs(target - closest_so_far) > target - z:\n closest_so_far = z\n if z == target:\n return target\n \n r = bisect_left(nums, target-x[i]-x[l], l+1, r+1)-1\n if r+1 < ell:\n z = x[i]+x[l]+x[r+1]\n if abs(target - closest_so_far) > z - target:\n closest_so_far = z\n if z == target:\n return target\n\n i = bisect_right(nums, x[i], i)\n\n return closest_so_far\n\nwith open(\"user.out\", \"w\") as f:\n inp = map(loads, stdin)\n for nums in inp:\n target = next(inp)\n print(f\"{threeSumClosest(nums,target)}\", file=f)\nexit(0)","runtime":"49"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n return self.KSumClosest(nums, 3, target)\n\n def KSumClosest(self, nums: List[int], k: int, target: int) -> int:\n N = len(nums)\n if N == k:\n return sum(nums[:k])\n\n current = sum(nums[:k])\n if current >= target:\n return current\n\n current = sum(nums[-k:])\n if current <= target:\n return current\n \n if k == 1:\n return min([(x, abs(target - x)) for x in nums], key = lambda x: x[1])[0]\n\n closest = sum(nums[:k])\n for i, x in enumerate(nums[:-k+1]):\n if i>0 and x == nums[i-1]:\n continue\n current = self.KSumClosest(nums[i+1:], k-1, target - x) + x\n if abs(target - current) < abs(target - closest):\n if current == target:\n return target\n else:\n closest = current\n\n return closest","runtime":"59"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n return self.KSumClosest(nums, 3, target)\n\n def KSumClosest(self, nums: List[int], k: int, target: int) -> int:\n N = len(nums)\n if N == k:\n return sum(nums[:k])\n\n # target too small\n current = sum(nums[:k])\n if current >= target:\n return current\n\n # target too big\n current = sum(nums[-k:])\n if current <= target:\n return current\n \n if k == 1:\n return min([(x, abs(target - x)) for x in nums], key = lambda x: x[1])[0]\n\n closest = sum(nums[:k])\n for i, x in enumerate(nums[:-k+1]):\n if i>0 and x == nums[i-1]:\n continue\n current = self.KSumClosest(nums[i+1:], k-1, target - x) + x\n if abs(target - current) < abs(target - closest):\n if current == target:\n return target\n else:\n closest = current\n\n return closest ","runtime":"59"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n return self.KSumClosest(nums,3,target)\n \n def KSumClosest(self, nums: List[int], k: int ,target : int) -> int:\n N = len(nums)\n if k == N:\n return sum(nums[:k])\n\n current = sum(nums[:k])\n if current >= target:\n return current\n\n current = sum(nums[-k:])\n if current <= target:\n return current\n if k==1:\n return min([(x,abs(target-x)) for x in nums], key = lambda x: x[1])[0]\n\n closest = sum(nums[:k])\n for i,x in enumerate(nums[:-k+1]):\n if i>0 and nums[i-1] == x:\n continue\n\n Bestmatch = self.KSumClosest(nums[i+1:],k-1,target-x)\n current = x + Bestmatch\n if abs(target-current) < abs(target-closest):\n if current == target:\n return target\n else:\n closest = current\n return closest\n","runtime":"69"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n nums.sort()\n res = 0\n N = len(nums)\n\n least_sum = sum(nums[:3])\n if target <= least_sum:\n return least_sum\n\n high_sum = sum(nums[-3:])\n if target >= high_sum:\n return high_sum\n \n diff = float('inf')\n for i in range(N-1):\n l = i+1\n h = N-1\n \n while l < h:\n sm = nums[i] + nums[l] + nums[h]\n if sm == target:\n return target\n elif abs(target-sm) < diff:\n diff = abs(target-sm)\n res = sm\n if sm > target:\n h -= 1\n else:\n l += 1\n \n return res ","runtime":"79"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n minDif = 999999\n ans = 0\n nums.sort()\n if (len(nums) <= 3 or (nums[0] + nums[1] + nums[2]) > target):\n return (nums[0] + nums[1] + nums[2])\n elif (nums[-1] + nums[-2] + nums[-3]) < target:\n return (nums[-1] + nums[-2] + nums[-3])\n for i in range(0,len(nums) - 2):\n j = i + 1\n k = len(nums) - 1\n while j < k:\n tempSum = nums[i] + nums[j] + nums[k]\n tempDif = tempSum - target\n if abs(tempDif) < minDif:\n minDif = abs(tempDif)\n ans = tempSum\n if tempDif > 0:\n k -= 1\n elif tempDif < 0:\n j += 1\n else:\n return ans\n return ans","runtime":"79"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n print(\"nums=\", nums)\n return self.KSumClosest(nums, 3, target)\n\n def KSumClosest(self, nums: List[int], k: int, target: int) -> int:\n print(\"enter with nums=\", nums, \"k=\", k)\n N = len(nums)\n if N == k:\n return sum(nums[:k])\n\n # target too small\n current = sum(nums[:k])\n if current >= target:\n return current\n\n # target too big\n current = sum(nums[-k:])\n if current <= target:\n return current\n \n if k == 1:\n return min([(x, abs(target - x)) for x in nums], key = lambda x: x[1])[0]\n\n closest = sum(nums[:k])\n for i, x in enumerate(nums[:-k+1]):\n #if i>0 and x == nums[i-1]:\n # continue\n current = self.KSumClosest(nums[i+1:], k-1, target - x) + x\n if abs(target - current) < abs(target - closest):\n if current == target:\n return target\n else:\n closest = current\n\n return closest\n ","runtime":"89"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n\n closest = sum(nums[:3])\n if closest >= target:\n return closest\n\n closest = sum(nums[-3:])\n if closest <= target:\n return closest\n\n best_diff = float(\"inf\")\n closest = None\n for i in range(len(nums) - 2):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n\n cur = sum(nums[i:i + 3])\n if cur >= target:\n diff = abs(target - cur)\n if diff == 0:\n return target\n if diff < best_diff:\n best_diff = abs(target - cur)\n closest = cur\n continue\n\n cur = nums[i] + sum(nums[-2:])\n if cur < target:\n diff = abs(target - cur)\n if diff == 0:\n return target\n if diff < best_diff:\n best_diff = abs(target - cur)\n closest = cur\n continue\n\n for j in range(i + 1, len(nums) - 1):\n if j > 1 and nums[j] == nums[i - 1]:\n continue\n cur = nums[i] + nums[j]\n cur += min(nums[j + 1:], key=lambda x: abs(target - cur - x))\n diff = abs(cur - target)\n if diff == 0:\n return target\n if diff < best_diff:\n best_diff = diff\n closest = cur\n return closest","runtime":"89"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n sum_min = sum(nums[:3])\n sum_max = sum(nums[-3:])\n if target <= sum_min:\n return sum_min\n if target >= sum_max:\n return sum_max\n\n n = len(nums)\n diff = math.inf\n\n ## two pointers. O(n2) time\n # for i in range(n):\n # left = i + 1\n # right = n - 1\n # while left < right:\n # total = nums[i] + nums[left] + nums[right]\n # if abs(target - total) < abs(diff):\n # diff = target - total\n # if diff == 0:\n # return total\n # if total < target:\n # left += 1\n # else:\n # right -= 1 \n # return target - diff\n\n ## or: binary search the third element. O(n2logn) time\n for i in range(n):\n for j in range(i + 1, n):\n complement = target - nums[i] - nums[j]\n right = bisect_right(nums, complement, j + 1)\n left = right - 1\n if right < n and abs(complement - nums[right]) < abs(diff):\n diff = complement - nums[right]\n if left > j and abs(complement - nums[left]) < abs(diff):\n diff = complement - nums[left]\n if diff == 0:\n break\n return target - diff","runtime":"99"},{"code":"class Solution:\n def threeSumClosest(self, nn, target: int) -> int:\n raw_nums = sorted(nn)\n res = 9999999999\n for i in range(0, len(raw_nums)):\n if not (i == 0 or raw_nums[i - 1] < raw_nums[i]):\n continue\n\n nt = (target - raw_nums[i]) / 2\n nums = raw_nums[:i] + raw_nums[i + 1 :]\n l, r = 0, len(nums) - 1\n while l < r:\n m = (r + l) // 2\n if nums[m] > nt:\n if m - 1 < 0:\n r = l = m\n break\n if nums[m - 1] < nt:\n l = m - 1\n r = m\n break\n else:\n r = m - 1\n elif nums[m] < nt:\n if m + 1 >= len(nums):\n r = l = m\n break\n if nums[m + 1] > nt:\n l = m\n r = m + 1\n break\n else:\n l = m + 1\n else:\n r = m\n l = m\n break\n\n if l != r:\n if abs(nums[l] * 2 - nt * 2) < abs(nums[l] + nums[r] - nt * 2):\n r = l\n elif abs(nums[l] + nums[r] - nt * 2) < abs(nums[r] * 2 - nt * 2):\n pass\n else:\n l = r\n\n while l >= 0 and r < len(nums):\n if l == r:\n if l == 0:\n r = 1\n if r == len(nums) - 1:\n l = r - 1\n if r + 1 < len(nums) and nums[r] == nums[r + 1]:\n r = r + 1\n if l - 1 >= 0 and nums[l] == nums[l - 1]:\n l -= 1\n\n if l == r:\n pass\n else:\n if abs(nums[l] + nums[r] + raw_nums[i] - target) < abs(\n res - target\n ):\n res = nums[l] + nums[r] + raw_nums[i]\n\n if res == target:\n return target\n\n if (nums[l] + nums[r]) > 2 * nt or l == r:\n l -= 1\n else:\n r += 1\n\n return res","runtime":"99"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n if len(nums) < 3:\n return None\n\n sorted_nums = sorted(nums)\n\n best_pos = sum(sorted_nums[:3])\n best_pos_diff = target - sum(sorted_nums[:3])\n best_neg = sum(sorted_nums[-3:])\n best_neg_diff = sum(sorted_nums[-3:]) - target\n\n if best_pos_diff <= 0:\n return best_pos\n if best_neg_diff <= 0:\n return best_neg\n \n for i in range(len(nums) - 2):\n\n if sum(sorted_nums[i:(i+3)]) >= target:\n temp_neg_diff = sum(sorted_nums[i:(i+3)]) - target\n if temp_neg_diff < best_neg_diff:\n best_neg_diff = temp_neg_diff\n best_neg = sum(sorted_nums[i:(i+3)])\n break\n\n first_element = sorted_nums[i]\n target_1 = target - first_element\n half_target_1 = (target - first_element) / 2\n exist_half = 0\n\n for j in range(i+1, len(nums)-1):\n if ((sorted_nums[j] <= half_target_1) & (sorted_nums[j+1] >= half_target_1)):\n half_index = j\n exist_half = 1\n break\n if exist_half == 0:\n temp_pos_diff = target_1 - sum(sorted_nums[j:(j+2)])\n if temp_pos_diff < best_pos_diff:\n best_pos_diff = temp_pos_diff\n best_pos = first_element + sum(sorted_nums[j:(j+2)])\n \n else:\n if half_index - 1 > i:\n temp_pos_diff = target_1 - sorted_nums[half_index] - sorted_nums[half_index - 1]\n if temp_pos_diff < best_pos_diff:\n best_pos_diff = temp_pos_diff\n best_pos = first_element + sorted_nums[half_index] + sorted_nums[half_index - 1]\n\n third_index = half_index + 1\n for j in range(half_index , i, -1):\n second_element = sorted_nums[j]\n third_element = sorted_nums[third_index]\n while third_element + second_element < target_1:\n temp_pos_diff = target_1 - (third_element + second_element)\n if temp_pos_diff < best_pos_diff:\n best_pos_diff = temp_pos_diff\n best_pos = first_element + second_element + third_element\n third_index += 1\n if third_index == len(nums):\n break\n third_element = sorted_nums[third_index]\n if third_index == len(nums):\n break\n \n temp_neg_diff = (third_element + second_element) - target_1\n if temp_neg_diff < best_neg_diff:\n best_neg_diff = temp_neg_diff\n best_neg = first_element + second_element + third_element\n \n\n if best_pos_diff < best_neg_diff:\n return best_pos\n else:\n return best_neg\n \n\n ","runtime":"109"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n if target >= sum(nums[-3:]):\n return sum(nums[-3:])\n if target <= sum(nums[:3]):\n return sum(nums[:3])\n \n n = len(nums)\n m = 2 ** 63\n for i in range(n-2):\n temp = self.twoSumDiff(nums[(i+1):], target - nums[i])\n if abs(temp) < abs(m):\n m = temp\n ans = m + target\n \n return ans\n \n def twoSumDiff(self, arr, target):\n left, right = 0, len(arr)-1\n m = 2 ** 63\n while left < right:\n temp = arr[left] + arr[right]\n if temp == target:\n return 0\n if abs(temp - target) < abs(m):\n m = temp - target\n if temp > target:\n right -=1\n else:\n left += 1\n \n return m\n ","runtime":"109"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n if target >= sum(nums[-3:]):\n return sum(nums[-3:])\n if target <= sum(nums[:3]):\n return sum(nums[:3])\n \n n = len(nums)\n m = 2 ** 63\n for i in range(n-2):\n temp = self.twoSumDiff(nums[(i+1):], target - nums[i])\n if abs(temp) < abs(m):\n m = temp\n\n return m + target\n \n def twoSumDiff(self, arr, target):\n left, right = 0, len(arr)-1\n m = 2 ** 63\n while left < right:\n temp = arr[left] + arr[right]\n if temp == target:\n return 0\n if abs(temp - target) < abs(m):\n m = temp - target\n if temp > target:\n right -=1\n else:\n left += 1\n \n return m","runtime":"119"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n nums.sort()\n\n closest_sum = sum(nums[0:3])\n if closest_sum > target:\n return closest_sum\n\n max_sum = sum(nums[-3:])\n if max_sum < target:\n return max_sum\n\n for i, num1 in enumerate(nums[:-2]):\n\n j = i + 1\n k = len(nums) - 1\n\n if closest_sum > target and 3*num1 >= closest_sum:\n # sum of three numbers >= 3*num1 >= closest_sum > target\n # no point iterating forward as sum will increase further \n break\n\n if closest_sum < target and (num1+nums[k]+nums[k-1]) <= closest_sum:\n # max possible sum is num1+nums[k]+nums[k-1] <= closest_sum < target\n # no point checking this iteration\n continue \n\n \n\n while j < k:\n sums = num1 + nums[j] + nums[k]\n\n if abs(sums - target) < abs(closest_sum - target):\n closest_sum = sums\n\n if sums > target:\n k -= 1\n else:\n j += 1\n\n return closest_sum\n\n\n\n\n\n\n\n\n\n\n\n \n ","runtime":"119"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n if sum(nums[:3]) >= target:\n return sum(nums[:3])\n if sum(nums[-3:]) <= target:\n return sum(nums[-3:])\n closestTol = sum(nums[:3])\n for i in range(len(nums) - 1):\n if i != 0:\n if nums[i] == nums[i-1]:\n continue\n left = i + 1\n right = len(nums) - 1\n while left < right:\n currTol = nums[i] + nums[left] + nums[right]\n if abs(target - currTol) < abs(target - closestTol):\n closestTol = currTol\n if currTol < target:\n left += 1\n else:\n right -= 1\n return closestTol\n\n \n \n ","runtime":"129"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n\n def solve(arr, targ, k):\n if len(arr) == k: return sum(arr)\n if k == 1: return min([[x, abs(x - targ)] for x in nums], key=lambda x: x[1])[0]\n if sum(arr[:k]) >= targ: return sum(arr[:k])\n elif sum(arr[-k:]) <= targ: return sum(arr[-k:])\n\n closest = 10**9\n for i in range(len(arr) - k + 1):\n current = solve(arr[i + 1:], targ - arr[i], k - 1) + arr[i]\n if abs(targ - current) < abs(targ - closest): closest = current\n if current == targ: return current\n return closest\n\n return solve(nums, target, 3)","runtime":"129"},{"code":"from collections import Counter\n\n\nclass Solution:\n def threeSumClosest(self, nums, target: int) -> int:\n nums = sorted(nums)\n if target > sum(nums[-3:]):\n return sum(nums[-3:])\n if target < sum(nums[:3]):\n return sum(nums[:3])\n my_target = float(\"inf\")\n min_num, max_num = sum(nums[:2]), sum(nums[-2:])\n new_min_num, new_max_num = target - max_num - 1, target - min_num + 1\n nums = Counter((i for i in nums if new_min_num <= i <= new_max_num))\n sorted_keys = sorted(nums.keys())\n l = len(sorted_keys)\n for i, x in enumerate(sorted_keys):\n if i > 1 and x > abs(target // 3):\n break\n for j in range(i, l):\n y = sorted_keys[j]\n if x + y + y - target > abs(my_target):\n break\n for k in range(j, l):\n z = sorted_keys[k]\n cand = x + y + z\n if cand - target > abs(my_target):\n break\n n = 1 + (x == y) + (y == z)\n if nums[y] < n:\n continue\n \n if abs(cand - target) < abs(my_target - target):\n my_target = cand\n if my_target == target:\n return target\n\n return my_target","runtime":"139"},{"code":"from collections import Counter\n\n\nclass Solution:\n def threeSumClosest(self, nums, target: int) -> int:\n nums = sorted(nums)\n if target > sum(nums[-3:]):\n return sum(nums[-3:])\n if target < sum(nums[:3]):\n return sum(nums[:3])\n my_target = float(\"inf\")\n min_num, max_num = sum(nums[:2]), sum(nums[-2:])\n new_min_num, new_max_num = target - max_num - 1, target - min_num + 1\n nums = Counter((i for i in nums if new_min_num <= i <= new_max_num))\n sorted_keys = sorted(nums.keys())\n for i, x in enumerate(sorted_keys):\n if i > 1 and x > abs(target // 3):\n break\n for j, y in enumerate(sorted_keys[i:]):\n if x + y + y - target > abs(my_target):\n break\n for k in range(i+j, len(sorted_keys)):\n z = sorted_keys[k]\n cand = x + y + z\n if cand - target > abs(my_target):\n break\n n = 1 + (x == y) + (y == z)\n if nums[y] < n:\n continue\n \n if abs(cand - target) < abs(my_target - target):\n my_target = cand\n if my_target == target:\n return target\n\n return my_target","runtime":"139"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n \n nums.sort()\n #print(nums)\n l,r = 0, len(nums)-1\n res = float('inf')\n t = 0\n while l < r-1:\n tmp = nums[l] + nums[r]\n for i in range(r-1, l, -1):\n tmp1 = tmp + nums[i]\n #print(tmp1)\n if target == tmp1:\n return tmp1\n if abs(target-tmp1) < res:\n res = abs(target-tmp1)\n t = tmp1\n #res = min(res, abs(target-tmp1))\n if tmp1 < target and i != l+1: \n l += 1\n r += 1\n break\n r -= 1\n return t","runtime":"149"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n \n nums.sort()\n #print(nums)\n l,r = 0, len(nums)-1\n res = float('inf')\n t = 0\n while l < r-1:\n print(l, r)\n tmp = nums[l] + nums[r]\n for i in range(r-1, l, -1):\n tmp1 = tmp + nums[i]\n #print(tmp1)\n if target == tmp1:\n return tmp1\n if abs(target-tmp1) < res:\n res = abs(target-tmp1)\n t = tmp1\n #res = min(res, abs(target-tmp1))\n if tmp1 < target and i != l+1: \n l += 1\n r += 1\n break\n r -= 1\n return t","runtime":"149"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n #only interested in at most three repeated vals\n valcount = {}\n for n in nums:\n if not n in valcount:\n valcount[n] = 0\n valcount[n] = min(3,valcount[n]+1)\n nums = []\n for k,v in valcount.items():\n for _ in range(v):\n nums.append(k)\n \n nums.sort()\n print(nums)\n closestSum = None\n idxs = 0\n idxe = len(nums)-1\n while idxe-idxs > 1:\n bestCurrentSum = None\n for idxe_2 in range(max(0,idxe-1), min(idxe+2,len(nums))):\n for idxs_2 in range(max(0,idxs-1), min(idxs+2, len(nums))):\n if idxs_2==idxe_2:\n continue\n idxm = bisect.bisect_left(nums, target-nums[idxs_2]-nums[idxe_2] , lo=idxs_2+1, hi=idxe_2)\n for idxm_2 in range(max(0, idxm-1),min(idxm+2,len(nums))):\n if idxm_2==idxs_2 or idxm_2==idxe_2:\n continue\n currentSum = nums[idxs_2]+nums[idxm_2]+nums[idxe_2]\n if bestCurrentSum is None or abs(currentSum - target)<abs(bestCurrentSum-target):\n bestCurrentSum = currentSum\n \n\n if closestSum is None or abs(bestCurrentSum - target) < abs(closestSum-target):\n closestSum = bestCurrentSum \n if bestCurrentSum > target:\n idxe-=1\n elif bestCurrentSum < target:\n idxs+=1\n else:\n return target #found an exact match\n\n return closestSum\n ","runtime":"159"},{"code":"class Solution:\n def threeSumClosest(self, nums, target):\n ans = sum(nums[:3])\n # brute force for n <15 to see if we can cheat the system a bit\n if len(nums) < 15:\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 curAns = nums[i] + nums[j] + nums[k]\n if abs(target-curAns) < abs(target-ans):\n ans = curAns\n return ans\n nums.sort()\n i,j = 0,len(nums)-1\n while j-i >=2:\n curSum = nums[i] + nums[j]\n l,r = i+1,j-1\n while l<=r:\n mid = (l+r)//2\n print(i,mid,j)\n potential = curSum + nums[mid]\n if abs(target-potential) < abs(target-ans):\n ans = potential\n if potential < target:\n l = mid+1\n else:\n r = mid-1\n if potential < target:\n i += 1\n else:\n j -= 1\n return ans","runtime":"159"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort() \n res = float('Inf')\n diff = abs(res - target)\n n = len(nums)\n for i in range(n-2):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n s = sum(nums[i: i + 3])\n if s >= target:\n if s - target < diff:\n return s\n else:\n return res\n left, right = i + 1, n - 1\n while left < right:\n s = nums[i] + nums[left] + nums[right]\n if abs(target - s) < diff:\n diff = abs(target - s)\n res = s\n if s < target:\n left += 1\n elif s > target:\n right -= 1\n else:\n return s\n return target - diff\n","runtime":"169"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n close = nums[0]+nums[1]+nums[2]\n diff = abs(target-close)\n if close>target:\n return close\n for i in range(len(nums)-2):\n j = i+1\n k = len(nums)-1\n while j<k:\n a = nums[i]+nums[j]+nums[k]\n if a>target:\n if a-target<diff:\n close=a\n diff = a-target\n k-=1\n elif a==target:\n return target\n else:\n if target-a<diff:\n close=a\n diff=target-a\n j+=1\n return close\n\n","runtime":"179"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n # -4 -1 1 2\n nums.sort() \n\n res = float('Inf')\n diff = abs(res - target)\n\n n = len(nums)\n for i in range(n-2):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n s = sum(nums[i: i + 3])\n if s >= target:\n if s - target < diff:\n return s\n else:\n return res\n \n left, right = i + 1, n - 1\n while left < right:\n s = nums[i] + nums[left] + nums[right]\n if abs(target - s) < diff:\n diff = abs(target - s)\n res = s\n if s < target:\n left += 1\n elif s > target:\n right -= 1\n else:\n return s\n return target - diff\n","runtime":"189"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n diff = 16000\n answer = 500000\n nums.sort()\n for i in range(0, len(nums)-2):\n j = i+1\n k = len(nums) - 1\n min = nums[0] + nums[1] + nums[2]\n if target <= min:\n if abs(target-answer) > min-target:\n return min\n break\n while j != k:\n sum = nums[i] + nums[j] + nums[k]\n if abs(target - sum) < diff:\n diff = abs(target - sum)\n answer = sum\n if sum < target:\n j += 1\n elif sum > target:\n k -= 1\n else:\n return sum\n\n return answer","runtime":"199"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n # -4 -1 1 2\n nums.sort() \n\n res = float('Inf')\n dist = abs(res - target)\n\n n = len(nums)\n for i in range(n-2):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n s = sum(nums[i: i + 3])\n if s >= target:\n if s - target < dist:\n return s\n else:\n return res\n \n l, r = i + 1, n - 1\n while l < r:\n s = nums[i] + nums[l] + nums[r]\n\n if abs(s - target) < dist:\n dist = abs(s - target)\n res = s\n\n if s < target:\n l += 1\n elif s > target:\n r -= 1\n else:\n return s\n \n return res\n","runtime":"209"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n result = 1e9\n\n for i in range(len(nums)-2):\n if target < nums[i]+nums[i+1]+nums[i+2]:\n if abs(target - result) > abs(target - (nums[i]+nums[i+1]+nums[i+2])) : result = nums[i]+nums[i+1]+nums[i+2]; continue\n elif target > nums[i]+nums[-2]+nums[-1]:\n if abs(target - result) > abs(target - (nums[i]+nums[-2]+nums[-1])): result = nums[i]+nums[-2]+nums[-1]; continue\n\n\n s = i+1\n e = len(nums)-1\n\n while s<e:\n margin = target-nums[i] - nums[s] - nums[e]\n if abs(margin) < abs(target- result):\n if margin == 0 : return target\n result = nums[i]+nums[s]+nums[e]\n\n if margin<0:\n e-=1\n else:\n s+=1\n # if abs(target-result) > abs(target-nums[i] - nums[s] - nums[e]):\n # if target-nums[i] - nums[s] - nums[e]==0: return target\n # result = nums[i]+nums[s]+nums[e]\n # print(result,nums[i],nums[s],nums[e])\n\n return result\n\n\n","runtime":"209"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n result = 1e9\n\n for i in range(len(nums)-2):\n if target < nums[i]+nums[i+1]+nums[i+2]:\n if abs(target - result) > abs(target - (nums[i]+nums[i+1]+nums[i+2])) : result = nums[i]+nums[i+1]+nums[i+2]; continue\n if target > nums[i]+nums[-2]+nums[-1]:\n if abs(target - result) > abs(target - (nums[i]+nums[-2]+nums[-1])): result = nums[i]+nums[-2]+nums[-1]; continue\n\n\n s = i+1\n e = len(nums)-1\n\n while s<e:\n margin = target-nums[i] - nums[s] - nums[e]\n if abs(margin) < abs(target- result):\n if margin == 0 : return target\n result = nums[i]+nums[s]+nums[e]\n\n if margin<0:\n e-=1\n else:\n s+=1\n # if abs(target-result) > abs(target-nums[i] - nums[s] - nums[e]):\n # if target-nums[i] - nums[s] - nums[e]==0: return target\n # result = nums[i]+nums[s]+nums[e]\n # print(result,nums[i],nums[s],nums[e])\n\n return result\n\n\n","runtime":"219"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n min_diff = inf\n res = 0\n\n nums.sort()\n n = len(nums)\n for i in range(n - 2):\n s = nums[i] + nums[i + 1] + nums[i + 2]\n if s > target:\n diff = abs(target - s)\n if diff < min_diff:\n min_diff = diff\n res = s\n break\n\n\n j = i + 1\n k = len(nums) - 1\n\n while j < k:\n s = nums[i] + nums[j] + nums[k]\n diff = abs(target - s)\n \n if diff < min_diff:\n min_diff = diff\n res = s\n \n if s == target:\n return target\n elif s > target:\n k -= 1\n else:\n j += 1\n\n return res\n \n ","runtime":"219"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n ans = 0\n temp = float('inf')\n nums.sort()\n n = len(nums)\n i, j = 0, 1\n while i < j:\n j, k = i + 1, n - 1\n while j < k:\n s = nums[i] + nums[j] + nums[k]\n dist = abs(s - target)\n if dist < temp:\n ans = s\n temp = dist\n if s < target:\n j += 1\n elif s > target:\n k -= 1\n else:\n return s \n i += 1\n return ans\n ","runtime":"229"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums=sorted(nums)\n ans, res =nums[0] + nums[1] + nums[2], 0\n for i in range(0,len(nums)-2):\n res=nums[i]+self.TwoSumClosest(target-nums[i],nums[i+1:])\n if abs(res-target)<abs(ans-target):\n ans=res\n return ans\n\n def TwoSumClosest(self, tar: int, arr: List[int]) -> int:\n ret,exc= arr[0]+arr[1] ,arr[0]+arr[-1]\n low, mid = 0, 0\n high=len(arr)-1\n while mid<high: \n half = (mid + high) // 2\n if (arr[half] < tar-arr[low]):\n mid = half + 1\n else:\n high = half\n if mid==low:\n exc=arr[0]+arr[1]\n elif mid==low+1:\n exc=arr[low]+arr[mid]\n else:\n exc= arr[low]+arr[mid-1] if abs(tar-arr[low]-arr[mid-1])<abs(tar-arr[low]-arr[mid]) else arr[low]+arr[mid]\n if exc==tar:\n return tar\n if abs(exc-tar)<abs(ret-tar):\n ret=exc\n while low < mid:\n exc=arr[low]+arr[mid]\n if arr[low]+arr[mid]<tar:\n low=low+1\n else:\n mid=mid-1\n if exc==tar:\n return tar\n if abs(exc-tar)<abs(ret-tar):\n ret=exc\n return ret\n\n\n\n\n\n\n\n\n\n\n \n ","runtime":"229"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n \n nums = sorted(nums)\n n, closest_gap, res = len(nums), 1e5, 0\n for i in range(n - 2):\n j, k = i + 1, n - 1\n if nums[i] + nums[i + 1] + nums[i + 2] > target + closest_gap:\n break\n while j < k:\n add = nums[i] + nums[j] + nums[k]\n if add == target:\n return target\n elif add > target:\n k -= 1\n else:\n j += 1\n gap = abs(add - target)\n if gap < closest_gap:\n closest_gap = gap\n res = add\n \n return res\n","runtime":"239"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n n= len(nums)\n nums.sort()\n ans= nums[0]+ nums[1]+nums[2];\n if (ans> target):\n return ans;\n #diff= abs(target-ans);\n for i in range (0,n-2):\n left= i+1\n right= n-1\n while (left< right):\n sumi= nums[i]+nums[left]+nums[right]\n if (sumi<target):\n left+=1\n elif (sumi > target):\n right-=1\n else:\n return target\n if (abs(target-sumi) < abs(target-ans)):\n #diff= abs(target-sumi)\n ans= sumi\n return ans","runtime":"239"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums = sorted(nums)\n closestSum = sum(nums[0:3])\n for i in range(len(nums) - 2):\n if (sum(nums[i:i+3]) > closestSum > target):\n continue\n if (nums[i] + nums[len(nums) - 2] + nums[len(nums) - 1] < closestSum < target):\n break\n\n j, k = i + 1, len(nums) - 1\n while (j < k):\n temp = nums[i] + nums[j] + nums[k]\n if abs(target - temp) < abs(target - closestSum):\n closestSum = temp\n if (temp > target):\n k -= 1\n elif (temp < target):\n j += 1\n else:\n return closestSum\n return closestSum","runtime":"249"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n n = None\n sum_val_ori = nums[0] + nums[1] + nums[len(nums)-1]\n lowest = abs(sum_val_ori - target)\n lowest_sum = sum_val_ori\n for i in range(0,len(nums)-2):\n fix_elem = nums[i]\n if fix_elem == n:\n continue\n n = nums[i]\n j = i+1\n k = len(nums) - 1\n while j != k:\n sum_val = fix_elem + nums[j] + nums[k]\n while sum_val > target and k!= j:\n k -= 1\n if k!= j:\n sum_val = fix_elem + nums[j] + nums[k]\n while sum_val < target and k!= j:\n j += 1\n if k!= j:\n sum_val = fix_elem + nums[j] + nums[k]\n if sum_val == target:\n return sum_val\n if abs(sum_val - target) < lowest:\n lowest = abs(sum_val - target)\n lowest_sum = sum_val\n\n \n \n \n\n \n return lowest_sum","runtime":"249"},{"code":"import math\nclass Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n min_candidate = math.inf\n min_candidate = sum(nums[:3])\n if min_candidate >= target:\n return min_candidate\n for i in range(0, len(nums) - 2):\n l, r = i + 1, len(nums) - 1\n while l < r: \n triplet_sum = nums[i] + nums[l] + nums[r]\n if triplet_sum == target:\n return target\n if abs(target - min_candidate) > abs(target - triplet_sum):\n min_candidate = triplet_sum\n if triplet_sum < target:\n l += 1\n else:\n r -= 1\n \n return min_candidate","runtime":"259"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n nums.append(None)\n bestSum = None\n bestDistance = 10000000\n i = 0\n while i < len(nums) - 3:\n target2 = target - nums[i]\n low = i + 1\n high = len(nums) - 2\n while (low < high):\n potentialSum = nums[low] + nums[high]\n if potentialSum > target2:\n high-=1\n if potentialSum - target2 < bestDistance:\n bestDistance = potentialSum - target2\n bestSum = target + bestDistance\n elif potentialSum < target2:\n low+=1\n if target2 - potentialSum < bestDistance:\n bestDistance = target2 - potentialSum\n bestSum = target - bestDistance\n else:\n return target\n i+=1\n \n return bestSum\n ","runtime":"259"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n closest_sum = sum(nums[:3])\n if closest_sum >= target: return closest_sum\n\n for i in range(len(nums) - 2):\n left, right = i+1, len(nums) - 1\n while left < right:\n triple_sum = nums[i] + nums[left] + nums[right]\n if abs(triple_sum - target) < abs(closest_sum - target):\n closest_sum = triple_sum\n if closest_sum == target: return target\n if triple_sum > target: right -= 1\n else: left += 1\n\n return closest_sum","runtime":"269"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n closest_sum = sum(nums[:3])\n if closest_sum >= target:\n return closest_sum\n for index in range(len(nums) - 2):\n left = index + 1\n right = len(nums) - 1\n while left < right:\n triplet_sum = nums[index] + nums[left] + nums[right]\n if triplet_sum == target:\n return target\n if abs(triplet_sum - target) < abs(closest_sum - target):\n closest_sum = triplet_sum\n if triplet_sum < target:\n left += 1\n else:\n right -= 1\n if sum(nums[index: index + 3]) >= target:\n break\n return closest_sum","runtime":"269"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n closest_sum = sum(nums[:3])\n if closest_sum >= target:\n return closest_sum\n for index in range(len(nums) - 2):\n left = index + 1\n right = len(nums) - 1\n while left < right:\n triplet_sum = nums[index] + nums[left] + nums[right]\n if triplet_sum == target:\n return target\n if abs(triplet_sum - target) < abs(closest_sum - target):\n closest_sum = triplet_sum\n if triplet_sum < target:\n left += 1\n else:\n right -= 1\n return closest_sum","runtime":"279"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n closest_sum = sum(nums[:3])\n if closest_sum >= target:\n return closest_sum\n for index in range(len(nums) - 2):\n if index > 0 and nums[index] == nums[index - 1]:\n continue\n left = index + 1\n right = len(nums) - 1\n while left < right:\n triplet_sum = nums[index] + nums[left] + nums[right]\n if triplet_sum == target:\n return target\n if abs(triplet_sum - target) < abs(closest_sum - target):\n closest_sum = triplet_sum\n if triplet_sum < target:\n left += 1\n else:\n right -= 1\n if sum(nums[index: index + 3]) >= target:\n break\n return closest_sum","runtime":"279"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n nums.sort()\n\n closest_sum = sum(nums[0:3])\n\n for i, num1 in enumerate(nums[:-2]):\n\n j = i + 1\n k = len(nums) - 1\n\n if closest_sum > target and 3*num1 >= closest_sum:\n # sum of three numbers >= 3*num1 >= closest_sum > target\n # no point iterating forward as sum will increase further \n break\n\n if closest_sum < target and (num1+nums[k]+nums[k-1]) <= closest_sum:\n # max possible sum is num1+nums[k]+nums[k-1] <= closest_sum < target\n # no point checking this iteration\n continue \n\n \n\n while j < k:\n sums = num1 + nums[j] + nums[k]\n\n if abs(sums - target) < abs(closest_sum - target):\n closest_sum = sums\n\n if sums > target:\n k -= 1\n else:\n j += 1\n\n return closest_sum\n\n\n\n\n\n\n\n\n\n\n\n \n ","runtime":"289"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n max_num = float('inf')\n min_num = float('-inf')\n for i in range(len(nums)-2):\n j = i+1\n k = len(nums)-1\n while j < k:\n result = nums[i] + nums[j] + nums[k]\n if result == target:\n return result\n elif result > target:\n if result < max_num:\n max_num = result\n k-=1\n else:\n if result > min_num:\n min_num = result\n j+=1\n \n if target - min_num < max_num - target:\n return min_num\n else:\n return max_num\n ","runtime":"289"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n i = 0\n best = float(\"inf\")\n res = float('inf')\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n \n a = nums[i]\n want = target - a\n l = i + 1\n r = len(nums) - 1\n while l < r:\n s = nums[l] + nums[r]\n if s == want:\n return target\n if s < want:\n if want - s < best:\n best = want - s\n res = a + s\n l += 1\n elif s > want:\n if s - want < best:\n best = s - want\n res = a + s\n r -= 1\n return res\n\n\n","runtime":"299"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n\n diff_abs = float(\"inf\")\n for i, x in enumerate(nums):\n if i > 0 and x == nums[i-1]:\n continue\n\n l, r = i+1, len(nums)-1\n while l < r:\n three_sum = x + nums[l] + nums[r]\n if three_sum == target:\n return three_sum\n elif three_sum < target:\n if target - three_sum < diff_abs:\n diff_abs = target - three_sum\n res = three_sum\n l += 1\n else:\n if three_sum - target < diff_abs:\n diff_abs = three_sum - target\n res = three_sum\n r -= 1\n\n return res","runtime":"299"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n diff = float('inf')\n sign = 1\n for i, num in enumerate(nums):\n l, r = i+1, len(nums)-1\n while l < r:\n s = nums[l] + nums[r] + num \n if s == target:\n return target\n elif s < target:\n if target-s < diff:\n diff = target-s\n sign = -1\n l += 1\n else:\n if s-target < diff:\n diff = s-target\n sign = 1\n r -= 1\n return target+diff*sign","runtime":"309"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n ans, diff = 1<<32 - 1, 1<<32 - 1\n nums.sort()\n n = len(nums)\n for i in range(n-2):\n t = target - nums[i]\n j, k = i+1, n-1\n while j<k:\n s = nums[j] + nums[k]\n if s == t:\n return target\n if diff > abs(t-s):\n ans, diff = s+nums[i], abs(t-s)\n if s > t:\n k -= 1\n else:\n j += 1\n return ans","runtime":"309"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n nums.sort()\n diff_val = float('inf')\n sum_val = 0\n\n for indx, val in enumerate(nums):\n l , r = indx + 1, len(nums) - 1\n while l < r:\n three_sum = val + nums[l] + nums[r]\n if three_sum == target:\n return three_sum\n elif three_sum < target:\n diff = target - three_sum\n l += 1\n else:\n diff = three_sum - target\n r -= 1\n if diff < diff_val:\n diff_val = diff\n sum_val = three_sum\n return sum_val\n \n\n ","runtime":"319"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n sorted_nums = sorted(nums)\n diff = float('inf')\n ans = 0\n for i in range(len(sorted_nums) - 2):\n summ = target - sorted_nums[i]\n j = i + 1\n k = len(sorted_nums) - 1\n while j < k:\n temp = sorted_nums[j] + sorted_nums[k]\n if diff > abs(summ - temp):\n diff = abs(summ - temp)\n ans = sorted_nums[i] + sorted_nums[j] + sorted_nums[k]\n if temp > summ:\n k -= 1\n else:\n j += 1\n return ans \n\n","runtime":"319"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n leastSum = math.inf\n leastDiff = math.inf\n nums.sort()\n print(nums)\n for i in range(0, len(nums)):\n l = i + 1\n r = len(nums) - 1\n while l < r:\n summation = nums[i] + nums[l] + nums[r]\n if abs(summation - target) < leastDiff:\n leastSum = summation\n leastDiff = abs(summation - target)\n if summation < target:\n l += 1\n elif summation > target:\n r -= 1\n else:\n return summation\n return leastSum\n ","runtime":"329"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n max_diff=float(\"inf\")\n ans=0\n nums.sort()\n for i in range(len(nums)-2):\n l,r= i+1,len(nums)-1\n while l<r:\n sum=nums[i]+nums[l]+nums[r]\n if abs(sum-target)<max_diff:\n max_diff=abs(sum-target)\n ans=sum\n if sum<target:\n l+=1\n else:\n r-=1\n if max_diff==0:\n break\n return ans","runtime":"329"},{"code":"class Solution:\n\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n result = nums[0]+nums[1] + nums[2]\n diff = abs(result - target)\n n = len(nums)\n for i in range(n -2):\n l = i + 1\n r = n - 1\n while l < r:\n total = nums[i] + nums[l] + nums[r]\n if abs(total - target) < diff:\n result = total\n diff = abs(total - target)\n if total < target:\n l += 1\n elif total > target:\n r -= 1\n else:\n return total\n return result\n\n\n def threeSumClosestMine(self, nums: List[int], target: int) -> int:\n nums.sort()\n n = len(nums)\n bestDiff = 200001 # Value > (max - min) > (10000 - -10000)\n best = None\n\n for i in range(0, n):\n # Skip duplicates\n #if i != 0 and nums[i] == nums[i-1]:\n # continue\n\n j, k = i+1, n-1\n while j < k:\n sum3 = nums[i] + nums[j] + nums[k]\n diff = target - sum3\n if bestDiff > abs(diff):\n best = sum3\n bestDiff = abs(diff)\n if best == target:\n break\n if sum3 > target:\n k = k - 1\n #while j < k and nums[k] == nums[k+1]: k = k - 1\n else:\n j = j + 1\n #while j < k and nums[j] == nums[j-1] : j = j + 1\n \n return best\n\n","runtime":"339"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n res = 0\n closest = float('inf')\n\n for i in range(len(nums)):\n l, r = i + 1, len(nums) - 1\n while l < r:\n temp_sum = nums[i] + nums[l] + nums[r]\n if abs(target - temp_sum) < closest:\n closest = abs(target - temp_sum)\n res = temp_sum\n if temp_sum < target:\n l += 1\n elif temp_sum > target:\n r -= 1\n else:\n return temp_sum\n return res\n","runtime":"339"},{"code":"import math\n\ndef three_sum_closest(nums, target):\n nums = sorted(nums)\n\n closest = math.inf\n distance = math.inf\n\n for i, x in enumerate(nums):\n left = i + 1\n right = len(nums) - 1\n while left < right:\n s = x + nums[left] + nums[right]\n diff = s - target\n\n if abs(diff) < distance:\n closest = s\n distance = abs(diff)\n\n if s > target:\n right -= 1\n elif s < target:\n left += 1\n else:\n return s\n \n return closest\n \nclass Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n return three_sum_closest(nums, target)\n ","runtime":"349"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n diff = float(\"inf\")\n nums.sort()\n for i in range(len(nums)):\n lo, hi = i + 1, len(nums) - 1\n while lo < hi:\n sum = nums[i] + nums[lo] + nums[hi]\n if abs(target - sum) < abs(diff):\n diff = target - sum\n if sum < target:\n lo += 1\n else:\n hi -= 1\n if diff == 0:\n break\n return target - diff","runtime":"349"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n diff = float(\"inf\")\n nums.sort()\n for i in range(len(nums)):\n lo, hi = i + 1, len(nums) - 1\n while lo < hi:\n sum = nums[i] + nums[lo] + nums[hi]\n if abs(target - sum) < abs(diff):\n diff = target - sum\n if sum < target:\n lo += 1\n else:\n hi -= 1\n if diff == 0:\n break\n return target - diff","runtime":"359"},{"code":"\"\"\"\n\n-1, 2, 1, -4\n\ntarget = 1\nnums[i] = -1\nadj_target = 1 - -1 == 2\nprefix[i:] = 2 3 -1\n\n\"\"\"\n\nclass Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n res = math.inf\n nums.sort()\n for i in range(len(nums)):\n lo = i + 1\n hi = len(nums) - 1\n while lo < hi:\n s = nums[i] + nums[lo] + nums[hi]\n\n if abs(target - s) < abs(res):\n res = target - s\n\n if s < target:\n lo += 1\n else:\n hi -= 1\n if res == 0:\n break\n return target - res","runtime":"359"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n lowest = 10000*500\n closest = 0\n for i in range(len(nums) - 2):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n left = i+1\n right = len(nums) -1\n while left<right:\n currentSum = nums[i] + nums[left] + nums[right]\n difference = abs(currentSum-target)\n if difference < lowest:\n lowest = difference\n closest = currentSum\n if currentSum == target:\n return currentSum\n elif currentSum > target:\n right -= 1\n else:\n left += 1\n return closest","runtime":"369"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n closest = 2147483647\n for i in range(len(nums)-2):\n l = i + 1\n r = len(nums)-1\n while(l<r):\n summ = nums[i] + nums[l] + nums[r]\n if target == summ:\n return summ\n if (summ < target):\n if (target - summ < abs(target - closest)):\n closest = summ\n l += 1\n else:\n if (summ - target < abs(target - closest)):\n closest = summ\n r -= 1\n return closest","runtime":"369"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n minimum=990099 \n for i in range(0,len(nums)-2):\n j=i+1\n k=len(nums)-1\n while(j<k):\n sum=nums[i]+nums[j]+nums[k]\n if((abs(target-sum)<minimum)):\n minimum = abs(target-sum)\n closest=sum\n if(sum<target):\n j+=1\n else:\n k-=1\n return closest","runtime":"379"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n min_dist = -1\n best_sum3 = 0\n for i, n1 in enumerate(nums[:-2]):\n if i > 0 and n1 == nums[i-1]:\n continue\n j = i + 1\n k = len(nums) - 1\n while j < k:\n sum3 = n1 + nums[j] + nums[k]\n dist = target - sum3\n if dist == 0:\n return sum3\n if min_dist < 0 or abs(dist) < min_dist:\n best_sum3 = sum3\n min_dist = abs(dist)\n if dist > 0:\n j += 1\n else:\n k -= 1\n return best_sum3\n","runtime":"379"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n n = len(nums)\n if n < 3:\n return 0\n \n curr_sum = 0\n diff,ans = float('inf'), 0\n nums.sort()\n for i in range(n-2):\n left = i+1\n right = n-1\n while left < right:\n curr_sum += nums[left] + nums[i] + nums[right]\n if curr_sum == target:\n return curr_sum\n \n elif abs(target- curr_sum) < diff:\n diff = abs(target- curr_sum) \n ans = curr_sum\n if curr_sum > target:\n right -= 1\n elif curr_sum < target:\n left += 1\n \n curr_sum = 0\n return ans\n\n ","runtime":"389"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n closest_sum = float('inf')\n\n for i, a in enumerate(nums):\n if i > 0 and a == nums[i - 1]:\n continue\n \n l, r = i + 1, len(nums) - 1\n while l < r:\n threeSum = a + nums[l] + nums[r]\n if abs(threeSum - target) < abs(closest_sum - target):\n closest_sum = threeSum\n if threeSum < target:\n l += 1\n elif threeSum > target:\n r -= 1\n else:\n return threeSum \n return closest_sum","runtime":"389"},{"code":"class Solution:\n def threeSumClosest(self, nums: list[int], target: int) -> int:\n nums.sort()\n\n closest = sum(nums[:3])\n for first in range(len(nums) - 2):\n # Мы уже рассмотрели этот кейс на предыдущем шаге\n if first > 0 and nums[first] == nums[first - 1]:\n continue\n\n second = first + 1\n third = len(nums) - 1\n while second < third:\n sm = nums[first] + nums[second] + nums[third]\n\n if sm == target:\n return target\n\n if abs(sm - target) < abs(closest - target):\n closest = sm\n\n if sm > target:\n third -= 1\n else:\n second += 1\n\n return closest","runtime":"419"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n # Attempting to adapt the 3-sum to 0 solution to work for this\n nums.sort()\n last_sum = math.inf\n\n for i in range(len(nums)):\n\n left = i + 1\n right = len(nums) - 1\n\n while left < right:\n\n curr_sum = nums[i] + nums[left] + nums[right]\n curr_diff = abs(curr_sum - target)\n\n if curr_diff < abs(last_sum - target):\n last_sum = curr_sum\n\n if curr_sum < target:\n left += 1\n elif curr_sum > target:\n right -= 1\n else:\n return curr_sum\n \n\n return last_sum\n","runtime":"419"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n nums = sorted(nums)\n closest = float(\"inf\")\n for i in range(len(nums)):\n\n p1 = i + 1\n p2 = len(nums) - 1\n\n while p1 < p2:\n current = nums[i] + nums[p1] + nums[p2]\n\n if abs(current - target) < abs(closest - target):\n closest = current\n\n if current == target:\n return current\n\n elif current < target:\n p1 = p1 + 1\n\n else:\n p2 = p2 - 1\n\n return closest\n","runtime":"429"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort() \n n = len(nums) \n closest_sum = float(\"inf\") \n\n for i in range(n):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n \n lo,hi = i+1 ,n-1\n while lo < hi:\n cur_sum = nums[i] + nums[lo] + nums[hi]\n\n if abs(cur_sum - target) < abs(closest_sum - target):\n closest_sum = cur_sum \n \n if cur_sum == target:\n return cur_sum\n elif cur_sum < target:\n lo +=1\n else:\n hi -=1\n return closest_sum","runtime":"429"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n # Attempting to adapt the 3-sum to 0 solution to work for this\n nums.sort()\n last_sum = math.inf\n\n for i in range(len(nums)):\n\n left = i + 1\n right = len(nums) - 1\n\n while left < right:\n\n curr_sum = nums[i] + nums[left] + nums[right]\n curr_diff = abs(curr_sum - target)\n if curr_sum == target:\n return curr_sum\n elif curr_diff < abs(last_sum - target):\n last_sum = curr_sum\n\n if curr_sum < target:\n left += 1\n elif curr_sum > target:\n right -= 1\n \n\n return last_sum\n","runtime":"439"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n closest_sum = float('inf')\n for i in range(len(nums) - 2):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n start, end = i + 1, len(nums) - 1\n while start < end:\n current_sum = nums[i] + nums[start] + nums[end]\n if abs(current_sum - target) < abs(closest_sum - target):\n closest_sum = current_sum\n if current_sum < target:\n start += 1\n elif current_sum > target:\n end -= 1\n else:\n return current_sum\n \n return closest_sum","runtime":"439"},{"code":"class Solution:\n def threeSumClosest(self, nums, target):\n nums.sort()\n result = float('inf')\n \n for i in range(len(nums) - 2):\n start = i + 1\n end = len(nums) - 1\n \n while start < end:\n current_sum = nums[i] + nums[start] + nums[end]\n \n if current_sum < target:\n start += 1\n else:\n end -= 1\n\n if abs(current_sum - target) < abs(result - target):\n result = current_sum\n \n return result","runtime":"449"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n res = nums[0] + nums[1] + nums[2]\n for i in range(len(nums)):\n l = i + 1\n r = len(nums) - 1\n while l < r:\n total = nums[i] + nums[l] + nums[r]\n if total > target:\n r -= 1\n else:\n l += 1\n if abs(total - target) < abs(res - target):\n res = total\n return res","runtime":"449"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n res=sum(nums[:3])\n for i in range(len(nums)-1):\n l=i+1\n r=len(nums)-1\n while(l<r):\n total=nums[l]+nums[i]+nums[r]\n if abs(total-target) <abs(res-target):\n res=total\n if total<target:\n l+=1\n else:\n r-=1\n return res","runtime":"459"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n length=len(nums)\n closet_sum=nums[0]+nums[1]+nums[length-1]\n for i in range(length-2):\n j=i+1\n k=length-1\n while (j<=length-1 and j<k):\n sum=nums[i]+nums[j]+nums[k]\n if sum==target:\n return target\n elif sum<target:\n j=j+1\n elif sum>target:\n k=k-1\n if abs(sum-target)<abs(closet_sum-target):\n closet_sum=sum\n return closet_sum","runtime":"459"},{"code":"class Solution:\n def threeSumClosest(self, arr: List[int], target_sum: int) -> int:\n\n arr = sorted(arr) \n smallestDiff = float('inf') \n\n for i in range(len(arr)): \n\n # initialize the two pointers \n left, right = i + 1, len(arr)-1 \n\n while left < right: \n\n # difference of the current triplet from target sum \n diff = target_sum - arr[i] - arr[left] - arr[right]\n\n # sum of triplet equals the target sum \n if diff == 0:\n return target_sum\n \n # got more close to the target sum\n # if at same distance from target sum, set min value (diff > smallestDiff when sum of triplets is smaller than target sum ) \n if abs(diff) < abs(smallestDiff) or (abs(diff) == abs(smallestDiff) and diff > smallestDiff): \n smallestDiff = diff\n\n if diff > 0: \n left += 1 \n else: \n right -= 1 \n\n return target_sum - smallestDiff\n","runtime":"469"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n length=len(nums)\n closet_sum=nums[0]+nums[1]+nums[length-1]\n for i in range(length-2):\n j=i+1\n k=length-1\n while (j<=length-1 and j<k):\n sum=nums[i]+nums[j]+nums[k]\n t=abs(closet_sum-target)\n if sum==target:\n return target\n elif sum<target:\n j=j+1\n elif sum>target:\n k=k-1\n if abs(sum-target)<t:\n closet_sum=sum\n return closet_sum","runtime":"469"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n res=sum(nums[:3])\n for i in range(len(nums)-1):\n l=i+1\n r=len(nums)-1\n while(l<r):\n total=nums[l]+nums[i]+nums[r]\n if abs(total-target) <abs(res-target):\n res=total\n if total<target:\n l+=1\n else:\n r-=1\n return res","runtime":"479"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n curr_minimal_diff_sum = float(\"inf\")\n\n # two closest\n def two_sum_closest(curr_index: int):\n nonlocal nums\n nonlocal target\n nonlocal curr_minimal_diff_sum\n left, right = curr_index + 1, len(nums) - 1\n\n while left < right:\n curr_sum = nums[left] + nums[right] + nums[curr_index]\n if curr_sum == target:\n curr_minimal_diff_sum = 0\n return\n else:\n curr_diff = target - curr_sum\n if abs(curr_diff) < abs(curr_minimal_diff_sum):\n curr_minimal_diff_sum = curr_diff\n\n if curr_sum < target:\n left += 1\n else: # curr_sum > target\n right -= 1\n\n for complement_index in range(0, len(nums) - 2):\n two_sum_closest(complement_index)\n \n return target - curr_minimal_diff_sum\n","runtime":"479"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n n = len(nums)\n closest = nums[0] + nums[1] + nums[2]\n for k in range(n-2):\n i = k+1\n j = n-1\n new_target = target - nums[k]\n while i < j:\n if abs(nums[i] + nums[j] + nums[k] - target) < abs(closest - target):\n closest = nums[i] + nums[j] + nums[k]\n if nums[i] + nums[j] > new_target:\n j -= 1\n elif nums[i] + nums[j] < new_target:\n i += 1\n else:\n return target\n return closest\n \n","runtime":"489"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n minsum = abs(nums[0]+nums[1]+nums[2]-target)\n sumnum = nums[0]+nums[1]+nums[2]\n for i in range(len(nums)-2):\n left = i+1\n right = len(nums)-1\n while left<right:\n if abs(nums[i]+nums[left]+nums[right]-target)< minsum:\n minsum = abs(nums[i]+nums[left]+nums[right]-target)\n sumnum = nums[i]+nums[left]+nums[right]\n if nums[i]+nums[left]+nums[right]>=target:\n right-=1\n else:\n left+=1\n return sumnum","runtime":"489"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n nums.sort()\n res = nums[0] + nums[1] + nums[2]\n \n def compareDiff(num, res):\n if abs(target - num) < abs(target - res):\n return num\n return res\n\n\n for i, a in enumerate(nums):\n\n l, r = i + 1, len(nums) - 1\n while l < r:\n three_sum = a + nums[l] + nums[r]\n res = compareDiff(three_sum, res)\n\n if three_sum > target:\n r -= 1\n elif three_sum < target:\n l += 1\n else:\n return three_sum\n \n return res","runtime":"499"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n N = len(nums)\n ans = []\n \n m = float('inf')\n s = float(\"inf\")\n \n for x in range(N):\n if x>0 and nums[x]==nums[x-1]:\n continue\n \n elem = nums[x]\n l = x+1\n r = N-1\n \n while l<r:\n if abs(nums[l]+nums[r]+elem-target)<m:\n m = abs(nums[l]+nums[r]+elem-target)\n s = nums[l]+nums[r]+elem \n if nums[l]+nums[r]+elem>target:\n r-=1\n elif nums[l]+nums[r]+elem<target:\n l+=1\n else:\n l+=1\n r-=1\n return s\n ","runtime":"499"},{"code":"class Solution:\n def threeSumClosest(self, n: List[int], t: int) -> int:\n n.sort()\n c = sum(n[:3])\n\n for i in range(len(n)-2):\n if i > 0 and n[i] == n[i-1]:\n continue\n\n l, r = i+1, len(n)-1\n\n while l < r:\n s = n[i] + n[l] + n[r]\n\n if s == t:\n return s\n\n if abs(t - s) < abs(t - c):\n c = s\n\n if s < t:\n l+=1\n while l < r and n[l] == n[l - 1]:\n l += 1\n else:\n r-=1\n while l < r and n[r] == n[r + 1]:\n r -= 1\n\n return c","runtime":"509"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n ans = nums[0] + nums[1] + nums[2]\n for i in range(0, len(nums)):\n sum = target - nums[i]\n j = i+1\n k = len(nums)-1\n if j < k:\n temp = nums[j]+nums[k]\n else:\n continue\n while j<k:\n if abs(sum-nums[j]-nums[k]) < abs(sum-temp):\n temp = nums[j] + nums[k]\n if nums[j] + nums[k] < sum:\n j = j + 1\n elif nums[j] + nums[k] > sum:\n k = k - 1\n else:\n return target\n if abs(target-temp-nums[i]) < abs(target-ans):\n ans = temp + nums[i]\n return ans\n\n # 1 6 7 9 10 100 110\n ","runtime":"509"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n res =[]\n n = len(nums)\n\n for i in range(n-2):\n j=i+1\n k=n-1\n print(i,j,k)\n if i>0 and nums[i]==nums[i-1]:\n continue\n while j<k:\n sum = nums[i] + nums[j] + nums[k]\n #print(sum,i,j,k)\n if sum == target:\n #pass\n #return 0\n return target\n elif sum < target:\n j+=1\n res.append(sum)\n elif sum > target:\n k-=1\n res.append(sum)\n elif j>n or k<0:\n break\n res2={}\n for e in res:\n res2[e]=abs(e-target)\n return min(res2,key=lambda k:res2[k])\n #return 2","runtime":"519"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int: \n n=len(nums)\n closest_sum = float('inf') \n nums.sort()\n for i in range(n-2):\n l=i+1\n r=n-1\n while l<r:\n curr_sum=nums[i]+nums[l]+nums[r] \n if sum==target:\n return curr_sum\n if abs(curr_sum - target) < abs(closest_sum - target):\n closest_sum = curr_sum\n if curr_sum<target:\n l+=1\n else:\n r-=1\n return closest_sum","runtime":"519"},{"code":"class Solution:\n def threeSumClosest(self, n: List[int], t: int) -> int:\n n.sort()\n c = sum(n[:3])\n\n for i in range(len(n)-2):\n if i > 0 and n[i] == n[i-1]:\n continue\n\n l, r = i+1, len(n)-1\n\n while l < r:\n s = n[i] + n[l] + n[r]\n\n if s == t:\n return s\n\n if abs(t - s) < abs(t - c):\n c = s\n\n if s < t:\n l+=1\n while l < r and n[l] == n[l - 1]:\n l += 1\n else:\n r-=1\n while l < r and n[r] == n[r + 1]:\n r -= 1\n\n return c","runtime":"529"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n min_dif = float(\"inf\")\n\n nums.sort()\n\n i = 0\n while i < len(nums)-1:\n\n n = nums[i]\n\n lo, hi = i+1, len(nums)-1\n\n while lo < hi:\n n_lo, n_hi = nums[lo], nums[hi]\n\n s = n_lo + n_hi + n\n\n if abs(target-s) < abs(min_dif):\n min_dif = target-s\n\n if s < target:\n while lo < hi and n_lo == nums[lo]: lo+=1\n elif s > target:\n while hi > lo and n_hi == nums[hi]: hi-=1\n else:\n break\n\n while i < len(nums)-1 and nums[i] == n: i+=1\n \n return target - min_dif\n\n\n\n ","runtime":"529"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums = sorted(nums)\n i = 0\n closest = float('INF')\n sol = 0\n while i < len(nums) - 2:\n low = i + 1\n high = len(nums) - 1\n while low < high:\n current_sum = sum([nums[i], nums[low], nums[high]])\n if abs(target - current_sum) < closest:\n sol = current_sum\n closest = abs(target - sol)\n if current_sum < target:\n low += 1\n elif current_sum > target:\n high -= 1\n else:\n return current_sum\n i += 1\n return sol\n\n","runtime":"539"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n resultNum = nums[0] + nums[1] + nums[-1]\n nums.sort()\n \n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i-1]: continue\n\n j, k = i+1, len(nums)-1\n\n while j < k:\n total = nums[i] + nums[j] + nums[k]\n if abs(target - total) <= abs(target - resultNum): \n resultNum = total\n \n if total > target:\n k -= 1\n while j < k and nums[k] == nums[k+1]: k -= 1\n else: \n j += 1\n while j < k and nums[j] == nums[j-1]: j += 1\n \n return resultNum\n ","runtime":"539"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n n = len(nums)\n best = 200001 # Value > (max - min) > (10000 - -10000)\n\n for i in range(0, n):\n # Skip duplicates\n if i != 0 and nums[i] == nums[i-1]:\n continue\n\n j, k = i+1, n-1\n while j < k:\n sum2 = nums[j] + nums[k]\n sum3 = sum2 + nums[i]\n if abs(target - best) > abs(target - sum3):\n best = sum3\n if best == target:\n break\n if sum3 > target:\n k = k - 1\n while j < k and nums[k] == nums[k+1]: k = k - 1\n else:\n j = j + 1\n while j < k and nums[j] == nums[j-1] : j = j + 1\n \n return best\n\n\n def threeSum(self, nums: List[int]) -> List[List[int]]:\n '''\n Sort. Two sum becomes O(n)\n For each i in nums, find two sum in i+1 - n-1.\n Time = O(n^2) worst case.\n Space = O(n) // For result set, result list, in-place sort\n '''\n nums.sort()\n soln = set()\n n, target, m = len(nums), 0, 3\n\n for i in range(0, n):\n if i != 0 and nums[i] == nums[i-1]:\n continue\n j, k = i + 1, n - 1\n while j < k:\n sum2 = nums[i] + nums[j] + nums[k]\n if sum2 == target:\n soln.add((nums[i], nums[j], nums[k]))\n j = j + 1\n k = k - 1\n elif sum2 < target:\n j = j + 1\n # Skip duplicates\n while (j < k) and nums[j] == nums[j-1]: j = j + 1\n else:\n k = k - 1\n # Skip duplicates\n while (j < k) and nums[k] == nums[k+1]: k = k - 1\n\n res = [[x,y,z] for (x,y,z) in soln]\n return res","runtime":"549"},{"code":"import math\nclass Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n closest_sum = math.inf\n for i in range(len(nums)-2):\n complement = target - nums[i]\n j = i+1\n k = len(nums)-1\n while k>j:\n total = nums[i]+nums[j]+nums[k]\n if abs(total-target) < abs(closest_sum-target):\n closest_sum = total\n\n if nums[j] + nums[k] == complement:\n return target\n elif nums[j] + nums[k] < complement:\n j += 1\n else:\n k -= 1\n \n\n return closest_sum\n\n","runtime":"549"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n nums.sort()\n closest = None\n \n if len(nums) < 3:\n return -1\n\n for i in range (len(nums) - 2):\n \n if i > 0 and nums[i] == nums[i-1]:\n continue\n\n left, right = i + 1, len(nums) - 1\n\n while left < right:\n\n total = nums[i] + nums[left] + nums[right]\n\n if closest == None:\n closest = total\n\n if total < target:\n if abs(target - total) < abs(target - closest):\n closest = total\n elif abs(target - total) == abs(target - closest):\n if closest <= total:\n closest = total\n left += 1\n\n elif total > target:\n if abs(total - target) < abs(closest - target):\n closest = total\n elif abs(target - total) == abs(target - closest):\n if closest <= total:\n closest = total\n right -= 1\n\n else:\n return total\n\n return closest\n\n ","runtime":"559"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n closest = float('-inf')\n nums.sort()\n\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n \n j = i + 1\n k = len(nums) - 1\n\n # if nums[i] >= target:\n # break\n\n while j < k:\n total = nums[i] + nums[j] + nums[k]\n\n if abs(target - total) < abs(target - closest):\n closest = total\n \n if target - total == 0:\n return closest\n elif target - total < 0:\n k -= 1\n\n while k > j and nums[k] == nums[k + 1]:\n k -= 1\n else:\n j += 1\n\n while j < k and nums[j] == nums[j-1]:\n j += 1\n \n return closest\n ","runtime":"559"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n\n idx = 0\n minDiff = float('inf')\n closest = 0\n while idx < len(nums) - 2:\n if idx > 0 and nums[idx] == nums[idx - 1]:\n idx += 1\n continue\n\n st, ed = idx + 1, len(nums) - 1\n while st < ed:\n if st - 1 > idx and nums[st] == nums[st - 1]:\n st += 1\n continue\n if ed + 1 < len(nums) and nums[ed] == nums[ed + 1]:\n ed -= 1\n continue\n\n rem = target - nums[idx]\n sum2 = nums[st] + nums[ed]\n if sum2 == rem:\n return target\n else:\n diff = abs(sum2 - rem)\n if diff < minDiff:\n minDiff = diff\n closest = sum2 + nums[idx]\n if sum2 > rem:\n ed -= 1\n else:\n st += 1\n idx += 1\n\n return closest","runtime":"569"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n # sum is closest to target \n\n # that means you try and creaet a sliding window idea => two pointer understanding \n\n nums.sort()\n n = len(nums)\n\n diff = 10**8 \n\n for i in range(n):\n\n j , k = i + 1 , n - 1\n\n while j < k: \n\n if abs(target - nums[i] - nums[j] - nums[k]) < diff: \n diff = abs(target - nums[i] - nums[j] - nums[k])\n res = nums[i] + nums[j] + nums[k]\n\n \n if nums[i] + nums[j] + nums[k] == target: \n return target\n # you have to move according to the limiting factor \n elif nums[i] + nums[j] + nums[k] > target: \n k -= 1 \n else:\n j += 1\n \n return res\n\n\n\n\n\n\n \n\n ","runtime":"569"},{"code":"class Solution:\n def threeSumClosest(self, nums: list[int], target: int) -> int:\n nums.sort()\n globalClosest = 9e99\n exactFlag = False\n for i, val in enumerate(nums[:-2:]):\n if not exactFlag:\n iterClosest = self.helper(nums[i + 1 : :], target, val)\n exactFlag = iterClosest == target\n if abs(globalClosest - target) > abs(iterClosest - target):\n globalClosest = iterClosest\n else:\n return globalClosest\n return globalClosest\n\n def helper(self, digits, target, val):\n left, right = 0, len(digits) - 1\n closest = digits[left] + digits[right] + val\n while left < right:\n if abs((target - digits[left] - digits[right] - val)) < abs(\n target - closest\n ):\n closest = digits[left] + digits[right] + val\n if digits[left] + digits[right] + val < target:\n left += 1\n else:\n right -= 1\n return closest","runtime":"579"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n res = sum(nums[:3])\n n = len(nums)\n for i in range(n-2):\n if i and nums[i] == nums[i-1]: continue\n j = i + 1\n k = n -1\n while j < k:\n if j > i + 1 and nums[j] == nums[j-1]: \n j += 1\n continue\n if k < n - 1 and nums[k] == nums[k+1]:\n k -= 1\n continue\n triplet = nums[i] + nums[j] + nums[k]\n if abs(target-triplet) < abs(target-res):\n res = triplet\n if triplet < target:\n j += 1\n elif triplet > target:\n k -= 1\n else:\n return triplet\n return res\n","runtime":"579"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n closest_sum = float('inf')\n for i in range(len(nums)-2):\n left, right = i+1, len(nums)-1\n while left < right:\n current_sum = sum([nums[i], nums[left], nums[right]])\n if abs(current_sum - target)<abs(closest_sum-target):\n closest_sum = current_sum\n if current_sum<target:\n left+=1\n elif current_sum >target:\n right-=1\n else:\n return current_sum\n return closest_sum\n\n ","runtime":"589"},{"code":"\nclass Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n ans = nums[0]+nums[1]+nums[2]\n for i in range(len(nums)-2):\n j = i+1\n k = len(nums)-1\n while(j<k):\n if(abs(ans-target)>abs(nums[i]+nums[j]+nums[k]-target)):\n ans = nums[i]+nums[j]+nums[k]\n if(nums[i]+nums[j]+nums[k]>target):\n k-=1\n else:\n j+=1\n return ans","runtime":"589"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n mini=nums[0]+nums[1]+nums[2]\n for i in range(len(nums)-2):\n left=i+1\n right=len(nums)-1\n while left<right:\n if nums[i]+nums[left]+nums[right]==target:\n return target\n if abs(nums[i]+nums[left]+nums[right]-target)<abs(mini-target):\n mini=nums[i]+nums[left]+nums[right]\n if nums[i]+nums[left]+nums[right]<target:\n left+=1\n else :\n right-=1\n return mini\n \n","runtime":"599"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n total = sum(nums[:3])\n closest = abs(target - total)\n\n for i in range(len(nums) - 2):\n l = i + 1 #left \n r = len(nums) - 1\n x1 = nums[i]\n # find x1 + nums[l] + nums[r] closest to target\n diff = abs(target - (nums[i] + nums[l] + nums[r]))\n while l < r:\n sum_of_3 = nums[i] + nums[l] + nums[r]\n if abs(target - sum_of_3) > diff:\n break\n\n if abs(target - sum_of_3) < closest:\n closest = abs(target - sum_of_3)\n total = sum_of_3 \n\n if sum_of_3 > target:\n r -= 1\n elif sum_of_3 < target:\n l += 1\n else:\n return sum_of_3\n diff = abs(target - (nums[i] + nums[l] + nums[r]))\n\n return total\n\n\n\n\n\n\n\n","runtime":"599"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums = sorted(nums)\n best = sum(nums[:3])\n for i in range(len(nums)):\n k = len(nums)-1\n for j in range(i+1, len(nums)-1):\n if j >= k:\n break\n missing = target - nums[i] - nums[j]\n while k > j+1 and nums[k] >= missing:\n k -= 1\n if len(nums) > k+1:\n s2 = nums[i] + nums[j] + nums[k+1]\n if abs(s2-target) < abs(best-target):\n best = s2\n\n s1 = nums[i] + nums[j] + nums[k]\n\n if abs(s1-target) < abs(best-target):\n best = s1\n\n\n\n return best","runtime":"609"},{"code":"# [-1,2,1,-4]\n# [-4,-1,1,2] 1\n\nclass Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n current_smallest_sum = float('inf')\n\n # iterate through the sorted array and fix one element at a time\n # call a helper function that will look at each possible two other elements and do a comparison\n # if Abs(target - sumOfThreeNumbers) < current_smallest_sum then current_smallest_sum = sumOfThreeNumbers\n # else if its larger then we bring the right pointer down one, if its smaller we bring the left pointer up one\n\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n\n current_smallest_sum = self.twoSum(target, nums, i, current_smallest_sum)\n \n return current_smallest_sum\n\n def twoSum(self, target, nums, i, current_smallest_sum):\n right = len(nums) - 1\n left = i + 1\n\n while left < right:\n temp_sum = nums[left] + nums[right] + nums[i]\n diff = abs(target - temp_sum)\n\n if diff < abs(target - current_smallest_sum):\n current_smallest_sum = temp_sum\n \n if target - temp_sum >= 0:\n left += 1\n while left < right and nums[left] == nums[left - 1]:\n left += 1\n else:\n right -= 1\n while left < right and nums[right] == nums[right + 1]:\n right -= 1\n\n \n \n return current_smallest_sum\n\n\n \n","runtime":"609"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n \n if len(nums) == 3:\n return sum(nums)\n \n \n nums = sorted(nums)\n \n final = float('inf')\n \n for i in range(len(nums) - 2):\n \n left, right = i + 1, len(nums) - 1\n \n while left < right:\n \n if left > i + 1 and nums[left] == nums[left - 1]:\n left += 1\n continue\n \n if right < len(nums) - 1 and nums[right] == nums[right + 1]:\n right -= 1\n continue\n \n cur_sum = nums[i] + nums[left] + nums[right]\n \n if cur_sum == target:\n return target\n \n if abs(cur_sum - target) < abs(final - target):\n final = cur_sum\n \n if cur_sum < target:\n left += 1\n \n else:\n right -= 1\n \n return final","runtime":"619"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums = sorted(nums)\n best = sum(nums[:3])\n for i in range(len(nums)):\n k = len(nums)-1\n for j in range(i+1, len(nums)-1):\n\n missing = target - nums[i] - nums[j]\n while k > j and nums[k] >= missing:\n s2 = nums[i] + nums[j] + nums[k]\n if abs(s2-target) < abs(best-target):\n best = s2\n k -= 1\n\n if k > j:\n s2 = nums[i] + nums[j] + nums[k]\n if abs(s2-target) < abs(best-target):\n best = s2\n\n\n\n return best","runtime":"619"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n #two pointer\n # nums.sort()\n # n = len(nums)\n # diff = float('inf')\n\n # for i in range(n):\n # left, right = i+1, n-1\n # while left < right:\n # sum = nums[i] + nums[left] + nums[right]\n\n # if abs(target - sum) < abs(diff):\n # diff = target - sum\n # if sum < target:\n # left += 1\n # else:\n # right -= 1\n\n # if diff == 0:\n # break\n \n # return target - diff\n\n #binary search\n nums.sort()\n n = len(nums)\n diff = float('inf')\n\n for i in range(n):\n for j in range(i+1, n):\n complement = target - nums[i] - nums[j]\n right = bisect_right(nums, complement, j+1)\n left = right - 1\n\n if right < n and abs(complement - nums[right]) < abs(diff):\n diff = complement - nums[right]\n if left > j and abs(complement - nums[left]) < abs(diff):\n diff = complement - nums[left]\n\n if diff == 0:\n break\n\n return target - diff \n","runtime":"629"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n \n closestSum = 100000\n for i in range(len(nums)):\n j = i + 1\n k = len(nums) - 1\n prevErr = 100000\n\n while j < k:\n curErr = nums[i] + nums[j] + nums[k] - target\n if prevErr > 0 and curErr > prevErr or prevErr < 0 and curErr < prevErr:\n break \n\n if abs(curErr) < abs(closestSum - target):\n closestSum = nums[i] + nums[j] + nums[k]\n \n if nums[i] + nums[j] + nums[k] > target:\n k -= 1\n else:\n j += 1\n \n prevErr = curErr\n \n # early termination\n if target > 0 and nums[i] > target//3+1:\n break\n\n return closestSum","runtime":"629"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums = sorted(nums)\n res = float('inf')\n ans = 0\n print(nums)\n for i in range(len(nums)):\n left = i+1 \n right = len(nums)-1 \n while left< right:\n cur = nums[i]+ nums[left]+ nums[right]\n # print(i, left, right, cur)\n if cur == target:\n return cur\n if cur < target:\n left +=1 \n else:\n right -=1 \n \n # if left>i+1 and left<right and nums[left] == nums[left-1]:\n # left+=1\n # continue \n \n res = min(res, abs(cur-target))\n \n if abs(cur-target) == res:\n ans = cur\n # print(ans)\n \n return ans\n \n ","runtime":"639"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n #two pointer\n # nums.sort()\n # n = len(nums)\n # diff = float('inf')\n\n # for i in range(n-2):\n # left, right = i+1, n-1\n # while left < right:\n # sum = nums[i] + nums[right] + nums[left]\n # if abs(target-sum) < abs(diff):\n # diff = target - sum\n\n # if sum < target:\n # left += 1\n # else:\n # right -= 1\n\n # if diff == 0:\n # break\n\n # return target - diff\n\n #binary search\n nums.sort()\n n = len(nums)\n diff = float('inf')\n\n for i in range(n-1):\n for j in range(i+1, n):\n complement = target - nums[i] - nums[j]\n right = bisect_right(nums, complement, j+1)\n left = right-1\n\n if right < n and abs(complement - nums[right]) < abs(diff):\n diff = complement - nums[right]\n if left > j and abs(complement - nums[left]) < abs(diff):\n diff = complement - nums[left]\n \n if diff == 0:\n break\n \n return target - diff","runtime":"639"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n closest = 100000\n summed = 100000\n elements= []\n for i in range(len(nums)):\n j = i + 1\n k = len(nums) - 1\n if(i==k):\n break\n while(j!=k):\n if nums[i] + nums[j] + nums[k] == target:\n closest = 0\n j = j + 1\n return target\n elif nums[i] + nums[j] + nums[k] > target:\n if abs(target - (nums[i] + nums[j] + nums[k])) < closest:\n closest = abs(target - (nums[i] + nums[j] + nums[k]))\n summed = nums[i] + nums[j] + nums[k]\n k = k - 1\n elif nums[i] + nums[j] + nums[k] < target:\n if abs(target - (nums[i] + nums[j] + nums[k])) < closest:\n closest = abs(target - (nums[i] + nums[j] + nums[k]))\n summed = nums[i] + nums[j] + nums[k]\n j = j + 1\n return summed\n ","runtime":"649"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n minDist = 10**5\n ans = -1\n n = len(nums) - 1\n for i,num in enumerate(nums[:n]):\n l = i + 1\n r = len(nums) - 1\n \n while (l < r):\n cSum = nums[i] + nums[l] + nums[r]\n if (cSum == target):\n return target\n if (abs(cSum - target) < minDist):\n minDist = abs(cSum - target)\n ans = cSum\n minDist = min(minDist,abs(cSum - target))\n if cSum > target :\n r -= 1\n else :\n l += 1\n return ans","runtime":"649"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n res = float('inf')\n nums.sort()\n result=0\n for x in range(len(nums)-2):\n left=x+1\n right=len(nums)-1\n while left<right:\n s = sum([nums[x], nums[left], nums[right]])\n if s<target:\n if res>abs(target-s):\n res = abs(target-s)\n result=s\n while left<right and nums[left]==nums[left+1]:\n left+=1\n left+=1\n elif s>target:\n if res>abs(target-s):\n res = abs(target-s)\n result=s\n while left<right and nums[right]==nums[right-1]:\n right-=1\n right-=1\n else:\n return target\n return result","runtime":"659"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n n = len(nums)\n nums.sort()\n diff = 99999\n finalSum = 0\n for i in range(n-2):\n j = i + 1\n k = n - 1\n while(j < k):\n sum = nums[i] + nums[j] + nums[k]\n diff = min(diff, abs(target - sum))\n if diff == abs(target - sum):\n finalSum = sum\n if sum == target:\n return finalSum\n elif sum < target:\n j += 1\n else:\n k -= 1\n \n return finalSum","runtime":"659"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n n = len(nums)\n ans = -inf\n val = inf\n for i in range(n):\n for j in range(i+1,n-1):\n goal = target-(nums[i]+nums[j])\n index = bisect_right(nums,goal,j+1,n)\n if index<n and nums[index]-goal<val:\n ans=nums[i]+nums[j]+nums[index]\n val = nums[index]-goal\n if index>j+1 and goal-nums[index-1]<val:\n ans=nums[i]+nums[j]+nums[index-1]\n val = goal-nums[index-1]\n return ans\n ","runtime":"669"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n diff = math.inf \n n = len(nums)\n nums.sort()\n for i in range(n-2):\n for j in range(i+1, n-1):\n \n complement = target - nums[i] - nums[j]\n hi = bisect_right(nums, complement, j + 1)\n lo = hi - 1\n\n if hi < n and abs(complement - nums[hi]) < abs(diff):\n diff = complement - nums[hi]\n \n if lo > j and abs(complement - nums[lo]) < abs(diff):\n diff = complement - nums[lo]\n \n if diff == 0:\n break\n \n return target - diff","runtime":"669"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n cur_sum = 0\n cur_diff = float('inf')\n\n def two_sum(numbers, target):\n l, r = 0, len(numbers) - 1\n cur_sum = 0\n cur_diff = float('inf')\n while l < r:\n if abs(numbers[l] + numbers[r] - target) < cur_diff:\n cur_diff = abs(numbers[l] + numbers[r] - target)\n cur_sum = numbers[l] + numbers[r]\n if numbers[l] + numbers[r] == target:\n return numbers[l] + numbers[r]\n elif numbers[l] + numbers[r] > target:\n r -= 1\n else:\n l += 1\n return cur_sum\n\n for i in range(len(nums) - 2):\n two = two_sum(nums[i+1:], target - nums[i])\n if abs(nums[i] + two - target) < cur_diff:\n cur_sum = nums[i] + two\n cur_diff = abs(nums[i] + two - target)\n return cur_sum","runtime":"679"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n dif = float(\"inf\")\n ans = None\n nums = sorted(nums)\n\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n l, r = 0 , len(nums)-1\n while l < r :\n if i != l and i != r:\n threeSum = (nums[i] + nums[l] + nums[r])\n if abs(threeSum-target) < dif:\n dif = abs(threeSum-target)\n ans = threeSum\n if threeSum < target:\n l += 1\n elif threeSum > target:\n r -= 1\n else:\n return threeSum\n else:\n if i == l:\n l += 1\n elif i == r:\n r -= 1\n return ans\n ","runtime":"679"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n if nums is None or len(nums) < 3:\n return 0\n nums.sort()\n diff = float('inf')\n ret = None\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n if i + 3 > len(nums):\n break\n cur_closest_sum = self.twoSumClosest(i+1, nums, target - nums[i])\n if ret is None or abs(cur_closest_sum+nums[i]-target) < abs(ret-target):\n ret = cur_closest_sum + nums[i]\n print(ret, [cur_closest_sum, nums[i]])\n return ret\n \n def twoSumClosest(self, idx, nums, target):\n l, r = idx, len(nums) - 1\n print(l, r, [nums[l], nums[r]])\n closest_summ = nums[l] + nums[r]\n while l < r:\n while l > idx and l < r and nums[l] == nums[l-1]:\n l += 1\n while r < len(nums)-1 and l < r and nums[r] == nums[r+1]:\n r -= 1\n\n if l < r:\n summ = nums[l] + nums[r]\n if summ == target:\n return summ\n elif summ < target:\n closest_summ = summ if abs(summ-target) < abs(closest_summ-target) else closest_summ\n l += 1\n else:\n closest_summ = summ if abs(summ-target) < abs(closest_summ-target) else closest_summ\n r -= 1\n\n return closest_summ\n","runtime":"689"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n diff = float(\"inf\")\n nums.sort()\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n complement = target - nums[i] - nums[j]\n hi = bisect_right(nums, complement, j + 1)\n lo = hi - 1\n if hi < len(nums) and abs(complement - nums[hi]) < abs(diff):\n diff = complement - nums[hi]\n if lo > j and abs(complement - nums[lo]) < abs(diff):\n diff = complement - nums[lo]\n if diff == 0:\n break\n return target - diff","runtime":"689"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n diff = float(\"inf\")\n nums.sort()\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n complement = target - nums[i] - nums[j]\n hi = bisect_right(nums, complement, j + 1)\n lo = hi - 1\n if hi < len(nums) and abs(complement - nums[hi]) < abs(diff):\n diff = complement - nums[hi]\n if lo > j and abs(complement - nums[lo]) < abs(diff):\n diff = complement - nums[lo]\n if diff == 0:\n break\n return target - diff\n \n \n \n \n \n \n \n \n \n \n \n \n \n ","runtime":"699"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n total = []\n for i in range(len(nums)-2):\n l = i + 1 \n r = len(nums) - 1\n while l < r:\n x = nums[i] + nums[l] + nums[r]\n total.append(x)\n if x == target:\n return target\n elif x < target:\n l += 1\n else:\n r -= 1\n d = {}\n mins = float('inf')\n for i in total:\n x = abs(i - target)\n d[i] = x\n mins = min(mins,x)\n for i,j in d.items():\n if j == mins:\n return i \n\n","runtime":"699"},{"code":"import math\nclass Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n abc = inf\n for i,num in enumerate(nums):\n if i>1 and nums[i] == nums[i-1]:\n continue \n l,r = i+1,len(nums)-1\n while l<r:\n tsum = num + nums[l] + nums[r]\n if tsum > target:\n r -=1\n csum = min(abs(target-abc),abs(tsum-target))\n if csum == abs(tsum-target):\n abc = tsum\n elif tsum < target:\n l += 1\n csum = min(abs(target-abc),abs(tsum-target))\n if csum == abs(tsum-target):\n abc = tsum\n elif tsum == target:\n return tsum\n \n return abc\n","runtime":"709"},{"code":"import math\nclass Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n abc = inf\n for i,num in enumerate(nums):\n if i>1 and nums[i] == nums[i-1]:\n continue \n l,r = i+1,len(nums)-1\n while l<r:\n tsum = num + nums[l] + nums[r]\n if tsum > target:\n r -=1\n csum = min(abs(target-abc),abs(tsum-target))\n if csum == abs(tsum-target):\n abc = tsum\n elif tsum < target:\n l += 1\n csum = min(abs(target-abc),abs(tsum-target))\n if csum == abs(tsum-target):\n abc = tsum\n elif tsum == target:\n return tsum\n \n return abc\n","runtime":"709"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n minDiff = sys.maxsize\n nums.sort()\n res = -1\n for indx in range(len(nums)):\n i = 0\n j = len(nums)-1\n while i < j:\n if i == indx:\n i+=1\n continue\n if j == indx:\n j-=1\n continue\n total = nums[indx] + nums[i] + nums[j] \n if total == target:\n return target\n if abs(total - target) < minDiff:\n minDiff = abs(total-target)\n res = total\n if total > target:\n j -= 1\n elif total <target:\n i += 1\n return res\n","runtime":"729"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n ans = (float('inf'), 0)\n for ith, val in enumerate(nums):\n twoSum = target - val\n start, end = 0, len(nums) - 1\n while start < end:\n if start == ith:\n start += 1\n continue\n if end == ith: \n end -= 1\n continue\n curr = nums[start] + nums[end]\n if abs(curr - twoSum) < ans[0]:\n ans = (abs(curr - twoSum), curr + val )\n if curr > twoSum:\n end -= 1\n else:\n start += 1\n \n return ans[1]\n ","runtime":"729"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n n = len(nums)\n triplets = []\n ref = []\n for i in range(n - 2):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n j = i + 1\n k = n - 1\n while j < k:\n current_sum = nums[i] + nums[j] + nums[k]\n triplets.append(abs(nums[i] + nums[j] + nums[k] - target))\n ref.append(nums[i] + nums[j] + nums[k])\n if current_sum > target:\n k -= 1\n else:\n j += 1\n \n m = min(triplets)\n return ref[triplets.index(m)]","runtime":"739"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n \n closest = None\n\n for i in range(0, len(nums)-2):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n\n j = i + 1\n k = len(nums)-1\n \n while j < k: \n newsum = nums[i] + nums[j] + nums[k]\n #print(newsum,[i,j,k],[nums[i],nums[j],nums[k]])\n \n if newsum == target:\n return target\n j+=1\n while nums[j] == nums[j-1] and j < k:\n j += 1\n else:\n if newsum < target:\n j += 1\n elif newsum > target:\n k -= 1\n\n if closest == None:\n closest = newsum\n elif not closest == newsum:\n if target < (closest + newsum) / 2:\n closest = min(closest, newsum)\n else:\n closest = max(closest, newsum) \n\n return closest","runtime":"739"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n res = float('inf')\n for i in range(len(nums)):\n if i > 0 and nums[i - 1] == nums[i]:\n continue\n j = i + 1\n k = len(nums) - 1\n while j < k:\n while j < k and j > i + 1 and nums[j - 1] == nums[j]:\n j += 1\n while j < k and k < len(nums) - 1 and nums[k + 1] == nums[k]:\n k -= 1\n if j >= k:\n break\n s = nums[i] + nums[j] + nums[k]\n if s == target:\n return target\n if abs(s - target) < abs(res - target):\n res = s\n if s < target:\n j += 1\n else:\n k -= 1\n return res","runtime":"749"},{"code":"def threeSumClosest(nums: List[int], target: int) -> int:\n nums.sort()\n if len(nums) == 3: return sum(nums)\n a = []\n for i in range(len(nums) - 2):\n l, r = i + 1, len(nums) - 1\n if i > 0 and nums[i] == nums[i - 1]: continue\n while l < r:\n s = sum([nums[l], nums[r], nums[i]])\n if s > target:\n a.append(s)\n r -= 1\n elif s < target: \n a.append(s)\n l += 1\n else:\n a.append(s)\n while l < r and nums[l] == nums[l + 1]: l += 1\n while l < r and nums[r] == nums[r - 1]: r -= 1\n l, r = l + 1, r - 1\n return min(a, key = lambda x: abs(x - target))\n\nwith open('user.out', 'w') as f:\n i = map(loads, stdin)\n for nums in i:\n target = next(i)\n print(f'{threeSumClosest(nums, target)}', file=f)\nexit(0)","runtime":"749"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n ans = sum(nums[0: 3])\n n = len(nums)\n nums.sort()\n for i in range(n):\n index = -1\n for j in range(i + 1, n):\n if index == -1:\n index = bisect_left(nums, target - nums[i] - nums[j], lo = j + 1)\n nn = index\n for k in [index - 1, index, index + 1]:\n if j < k < n:\n v = nums[i] + nums[j] + nums[k]\n if abs(target - v) < abs(target - ans):\n ans = v\n nn = k\n index = nn\n return ans","runtime":"759"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n def twoSumClosest(nums, target):\n first = 0\n last = len(nums) - 1\n closest = nums[first] + nums[last]\n while first < last:\n clo_sum = nums[first] + nums[last]\n if (abs(closest - target) > abs(clo_sum - target)):\n closest = clo_sum\n if clo_sum == target:\n return clo_sum\n elif clo_sum > target: \n last -= 1\n else:\n first += 1\n return clo_sum\n nums.sort()\n c_s = float(\"inf\")\n for i in range(len(nums)):\n s = nums[i] + twoSumClosest(nums[:i]+nums[i+1:],target - nums[i])\n if c_s == float(\"inf\") or abs(c_s-target) > abs(s - target):\n c_s = s\n return c_s\n \n ","runtime":"759"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n sorted_nums = sorted(nums) \n res = 0 \n dis = math.inf \n for i in range(len(nums)): \n j = i+1 \n k = len(nums)-1 \n while j < k: \n total_sum = sorted_nums[i] + sorted_nums[j] + sorted_nums[k] \n if total_sum == target: \n return total_sum \n if abs(total_sum - target) < dis: \n dis = abs(total_sum - target) \n res = total_sum \n if abs(sorted_nums[i] + sorted_nums[j+1] + sorted_nums[k] - target) < abs(sorted_nums[i] + sorted_nums[j] + sorted_nums[k-1] - target):\n j+=1 \n else:\n k-=1\n return res \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 nums = sorted(nums)\n distance = math.inf\n res = 0\n for i in range(len(nums)-1): \n j = i+1 \n k = len(nums)-1 \n findTarget = False \n while j<k: \n if abs(target - nums[i]-nums[j]-nums[k]) < distance: \n distance = abs(target - (nums[i]+nums[j]+nums[k]))\n res = nums[i]+nums[j]+nums[k]\n if nums[j] + nums[k] < target - nums[i]: \n j+=1 \n elif nums[j] + nums[k] > target - nums[i]:\n k-=1 \n else: \n findTarget = True\n break \n if findTarget: \n break \n return res\n\n\n\n\n\n\n\n# TC N^2, SC: O(1)\n# Sorting with two pointers \n\n\n# brute force will take O(N^3)","runtime":"769"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n res = float('inf') \n nums.sort()\n\n for i in range(len(nums)):\n l = i + 1\n r = len(nums) - 1\n while l < r:\n new_sum = nums[i] + nums[l] + nums[r]\n\n if res == float('inf'):\n res = new_sum\n else:\n diff = target - new_sum\n res_diff = target - res\n if abs(diff) < abs(res_diff):\n res = new_sum\n r -= 1\n elif new_sum <= target:\n l += 1\n else:\n r -= 1\n\n return res\n \n\n \n \n\n\n ","runtime":"769"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums = sorted(nums)\n \n best_dist = [float(\"inf\")]\n for pivot in range(len(nums)-2):\n p_val = nums[pivot]\n left = pivot+1\n right = len(nums)-1\n while left < right:\n l_val = nums[left]\n r_val = nums[right]\n curr_sum = sum([p_val, l_val, r_val])\n # print(f\"{curr_sum} = sum([{p_val}, {l_val}, {r_val}])\")\n if curr_sum > target:\n right -= 1\n elif curr_sum < target:\n left += 1\n else:\n return curr_sum\n \n # print(f\"if {abs(curr_sum)} < {abs(sum(best_dist))}\")\n if abs(curr_sum - target) < abs(sum(best_dist) - target):\n best_dist = [p_val, l_val, r_val]\n return sum(best_dist)\n \n","runtime":"779"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n ans = (float('inf'), 0)\n for ith, val in enumerate(nums):\n twoSum = target - val\n start, end = 0, len(nums) - 1\n while start < end:\n if start == ith:\n start += 1\n continue\n if end == ith: \n end -= 1\n continue\n curr = nums[start] + nums[end]\n if abs(curr - twoSum) < ans[0]:\n ans = (abs(curr - twoSum), curr + val )\n print(nums[start], nums[end], val, curr + val, ith )\n if curr > twoSum:\n end -= 1\n else:\n start += 1\n \n return ans[1]\n ","runtime":"779"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n answer=float('inf')\n answer_=0\n for i in range(len(nums)):\n j,n=i+1,len(nums)-1\n while(j<n):\n if(answer==0):\n return answer_\n if abs(target-(nums[j]+nums[n]+nums[i]))<answer:\n answer=abs(target-(nums[j]+nums[n]+nums[i]))\n answer_=nums[j]+nums[n]+nums[i]\n if(target-(nums[j]+nums[n]+nums[i])>0):\n j+=1\n while(j<n-1 and nums[j]==nums[j-1]):\n j+=1\n if(target-(nums[j]+nums[n]+nums[i])<0):\n n-=1\n while(j<n-1 and nums[n]==nums[n+1]):\n n-=1\n return answer_\n\n\n\n","runtime":"789"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n best_sum = sum(nums[0:3])\n for i in range(len(nums)):\n curr_sum = nums[i] + twoSumCloset(nums, target-nums[i], i)\n if abs(target-curr_sum) < abs(target-best_sum):\n best_sum = curr_sum\n return best_sum\n\ndef twoSumCloset(nums, target, skip):\n left = 0 if skip != 0 else 1\n right = len(nums)-1 if skip != len(nums)-1 else len(nums)-2\n best_sum = nums[left]+nums[right]\n while left<right:\n curr_sum = nums[left]+nums[right]\n if abs(target-curr_sum) < abs(target-best_sum):\n best_sum = curr_sum\n if curr_sum < target:\n left+=1\n if skip == left:\n left+=1\n elif curr_sum > target:\n right-=1\n if skip==right:\n right-=1\n else:\n return target\n return best_sum\n\n \n ","runtime":"789"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums=sorted(nums)\n minSofar=100000\n output=100000\n for i, num in enumerate(nums):\n l=0\n r=len(nums)-1\n\n while(r>l):\n if(r==i):\n r-=1\n if(l==i):\n l+=1\n if(l==r):\n break\n s=num+nums[r]+nums[l]\n result=abs(target-s)\n if(minSofar>result):\n output=s\n minSofar=result\n if(s>target):\n r-=1\n else:\n l+=1\n return output\n \n \n ","runtime":"799"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n\n total = None\n for pilotIdx in range(len(nums)):\n\n chosenNums = nums[:pilotIdx] + nums[pilotIdx + 1:]\n left = 0\n right = len(chosenNums) - 1\n \n while left < right:\n visitingTotal = chosenNums[left] + nums[pilotIdx] + chosenNums[right]\n if total is None:\n total = visitingTotal\n \n if abs(visitingTotal - target) < abs(total - target):\n total = visitingTotal\n\n if visitingTotal == target:\n return visitingTotal\n \n if visitingTotal < target:\n left += 1\n else:\n right -= 1\n\n\n return total","runtime":"799"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n def findClosest(nums: List[int], num: int, target: int) -> int:\n closest_diff = math.inf\n closest = None\n left = 0\n right = len(nums) - 1\n while left < right:\n sum = num + nums[left] + nums[right]\n diff = abs(target - sum)\n if diff == 0:\n return sum\n if diff < closest_diff:\n closest = sum\n closest_diff = diff\n left, right = (left + 1, right) if sum < target else (left, right - 1)\n return closest\n closest = math.inf\n closest_diff = math.inf\n n = len(nums)\n nums.sort()\n for i, x in enumerate(nums):\n sliced = nums[:i] + nums[min(i + 1, n):]\n new_closest = findClosest(sliced, x, target)\n if new_closest == target:\n return target\n elif abs(target - new_closest) < abs(target - closest):\n closest = new_closest\n return closest\n\n\n\n\n\n# [1, 2, 4, 8, 16, -2, -8], 5\n# [-8, -2, 1, 2, 4, 8, 16]","runtime":"809"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums = sorted(nums)\n close = 0\n ls = []\n a = None\n b = None\n for i in range(len(nums)-2):\n if nums[i] <= 0 and nums[i] == nums[i-1] and i > 0:\n continue\n j = i+1\n k = len(nums)-1\n while j < k and k>=0:\n if a == None:\n a = nums[i]+nums[j]+nums[k]\n close = a\n elif b == None:\n b = nums[i]+nums[j]+nums[k]\n close = b\n else: \n \n pass\n if a!=None and b!=None:\n if abs(a-target) > abs(b-target):\n close = b\n a = None\n else:\n close = a\n b = None\n \n \n \n if nums[i]+nums[j]+nums[k] > target:\n k -= 1\n else:\n j+=1\n \n return close","runtime":"809"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n closest = sys.maxsize\n ans = None\n for i in range(len(nums)):\n if i!=0 and nums[i]==nums[i-1]:\n continue\n l = i+1\n r = len(nums)-1\n while l<r:\n mysum = nums[i]+nums[r]+nums[l]\n distance = abs(target-mysum)\n if i<20:\n print(str(nums[i])+\",\"+str(nums[l])+\",\"+str(nums[r]))\n print(str(mysum)+\",\"+str(distance))\n print(target-mysum)\n if distance<closest:\n closest = distance\n ans = mysum\n if target-mysum<0:\n r-=1\n elif target-mysum>0:\n l+=1\n else:\n return mysum\n return ans","runtime":"819"},{"code":"class Solution:\n def threeSumClosest(self, a: List[int], x: int) -> int:\n \n def find(i,j,k):\n if i>=j:\n return \n s=a[i]+a[j]+a[k]\n if s>=t[0]:\n find(i,j-1,k)\n elif s<t[1]:\n find(i+1,j,k)\n else:\n t[0]=x+abs(s-x)\n t[1]=x-abs(s-x)\n res[0]=s\n find(i+1,j,k)\n find(i,j-1,k)\n \n \n n=len(a)\n a.sort()\n res=[0]\n t=[math.inf,-math.inf]\n for k in range(n-2):\n i=k+1\n j=n-1\n find(i,j,k)\n return res[0]","runtime":"819"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n final_closest = 0\n depth = float('inf')\n nums.sort()\n for i in range(len(nums)-1):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n\n j = i+1\n k = len(nums)-1\n\n while j < k:\n closest = nums[i]+nums[j]+nums[k]\n diff = max(closest,target) - min(closest,target)\n if diff < depth :\n depth = diff\n final_closest = closest\n \n if closest > target:\n k-=1\n else:\n j += 1\n \n return final_closest\n\n \n \n\n \n\n\n \n\n","runtime":"829"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n dist = float(\"inf\")\n nums.sort()\n\n for i in range(len(nums)):\n for j in range(i+1, len(nums)):\n comp = target-(nums[i]+nums[j])\n hi = bisect_right(nums, comp, j+1)\n lo = hi-1\n\n if hi < len(nums):\n ijSum = nums[i] + nums[j] + nums[hi]\n if abs(target - ijSum) < abs(target - dist):\n dist = ijSum\n \n if lo > j:\n ijSum = nums[i] + nums[j] + nums[lo]\n if abs(target - ijSum) < abs(target - dist):\n dist = ijSum\n \n if dist == target:\n return dist\n\n return dist","runtime":"829"}],"string":"[\n {\n \"code\": \"def threeSumClosest(nums: List[int], target: int) -> int:\\n if (n := len(nums)) <= 8:\\n return min((sum(pair) for pair in combinations(nums, 3)), key=lambda x: abs(target-x))\\n nums.sort()\\n\\n closest_so_far = 100000\\n\\n i, ell = 0, n\\n x = nums\\n while i+2 < ell:\\n z_min = x[i]+x[i+1]+x[i+2]\\n if target <= z_min:\\n if abs(target-closest_so_far) > z_min-target:\\n return z_min\\n break\\n\\n z_max = x[i]+x[ell-2]+x[ell-1]\\n if z_max < target:\\n if abs(target-closest_so_far) > target-z_max:\\n closest_so_far = z_max\\n i = bisect_right(nums, x[i], i)\\n continue\\n \\n\\n l, r = i+1, ell-1\\n while l < r:\\n l = bisect_right(nums, target-x[i]-x[r], l, r)\\n if i < l-1:\\n z = x[i]+x[l-1]+x[r]\\n if abs(target - closest_so_far) > target - z:\\n closest_so_far = z\\n if z == target:\\n return target\\n \\n r = bisect_left(nums, target-x[i]-x[l], l+1, r+1)-1\\n if r+1 < ell:\\n z = x[i]+x[l]+x[r+1]\\n if abs(target - closest_so_far) > z - target:\\n closest_so_far = z\\n if z == target:\\n return target\\n\\n i = bisect_right(nums, x[i], i)\\n\\n return closest_so_far\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inp = map(loads, stdin)\\n for nums in inp:\\n print(f\\\"{threeSumClosest(nums, next(inp))}\\\", file=f)\\n\\nexit(0)\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"def threeSumClosest(nums: List[int], target: int) -> int:\\n nums.sort()\\n\\n closest_so_far = float('inf')\\n\\n i, ell = 0, len(nums)\\n x = nums\\n while i+2 < ell:\\n z_min = x[i]+x[i+1]+x[i+2]\\n if target <= z_min:\\n if abs(target-closest_so_far) > z_min-target:\\n return z_min\\n break\\n\\n z_max = x[i]+x[ell-2]+x[ell-1]\\n if z_max < target:\\n if abs(target-closest_so_far) > target-z_max:\\n closest_so_far = z_max\\n i = bisect_right(nums, x[i], i)\\n continue\\n \\n\\n l, r = i+1, ell-1\\n while l < r:\\n l = bisect_right(nums, target-x[i]-x[r], l, r)\\n if i < l-1:\\n z = x[i]+x[l-1]+x[r]\\n if abs(target - closest_so_far) > target - z:\\n closest_so_far = z\\n if z == target:\\n return target\\n \\n r = bisect_left(nums, target-x[i]-x[l], l+1, r+1)-1\\n if r+1 < ell:\\n z = x[i]+x[l]+x[r+1]\\n if abs(target - closest_so_far) > z - target:\\n closest_so_far = z\\n if z == target:\\n return target\\n\\n i = bisect_right(nums, x[i], i)\\n\\n return closest_so_far\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inp = map(loads, stdin)\\n for nums in inp:\\n target = next(inp)\\n print(f\\\"{threeSumClosest(nums,target)}\\\", file=f)\\nexit(0)\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n return self.KSumClosest(nums, 3, target)\\n\\n def KSumClosest(self, nums: List[int], k: int, target: int) -> int:\\n N = len(nums)\\n if N == k:\\n return sum(nums[:k])\\n\\n # target too small\\n current = sum(nums[:k])\\n if current >= target:\\n return current\\n\\n # target too big\\n current = sum(nums[-k:])\\n if current <= target:\\n return current\\n \\n if k == 1:\\n return min([(x, abs(target - x)) for x in nums], key = lambda x: x[1])[0]\\n\\n closest = sum(nums[:k])\\n for i, x in enumerate(nums[:-k+1]):\\n if i>0 and x == nums[i-1]:\\n continue\\n current = self.KSumClosest(nums[i+1:], k-1, target - x) + x\\n if abs(target - current) < abs(target - closest):\\n if current == target:\\n return target\\n else:\\n closest = current\\n\\n return closest\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"def threeSumClosest(nums: List[int], target: int) -> int:\\n nums.sort()\\n\\n closest_so_far = float('inf')\\n\\n i, ell = 0, len(nums)\\n x = nums\\n while i+2 < ell:\\n z_min = x[i]+x[i+1]+x[i+2]\\n if target <= z_min:\\n if abs(target-closest_so_far) > z_min-target:\\n return z_min\\n break\\n\\n z_max = x[i]+x[ell-2]+x[ell-1]\\n if z_max < target:\\n if abs(target-closest_so_far) > target-z_max:\\n closest_so_far = z_max\\n i = bisect_right(nums, x[i], i)\\n continue\\n \\n\\n l, r = i+1, ell-1\\n while l < r:\\n l = bisect_right(nums, target-x[i]-x[r], l, r)\\n if i < l-1:\\n z = x[i]+x[l-1]+x[r]\\n if abs(target - closest_so_far) > target - z:\\n closest_so_far = z\\n if z == target:\\n return target\\n \\n r = bisect_left(nums, target-x[i]-x[l], l+1, r+1)-1\\n if r+1 < ell:\\n z = x[i]+x[l]+x[r+1]\\n if abs(target - closest_so_far) > z - target:\\n closest_so_far = z\\n if z == target:\\n return target\\n\\n i = bisect_right(nums, x[i], i)\\n\\n return closest_so_far\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inp = map(loads, stdin)\\n for nums in inp:\\n target = next(inp)\\n print(f\\\"{threeSumClosest(nums,target)}\\\", file=f)\\nexit(0)\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n return self.KSumClosest(nums, 3, target)\\n\\n def KSumClosest(self, nums: List[int], k: int, target: int) -> int:\\n N = len(nums)\\n if N == k:\\n return sum(nums[:k])\\n\\n current = sum(nums[:k])\\n if current >= target:\\n return current\\n\\n current = sum(nums[-k:])\\n if current <= target:\\n return current\\n \\n if k == 1:\\n return min([(x, abs(target - x)) for x in nums], key = lambda x: x[1])[0]\\n\\n closest = sum(nums[:k])\\n for i, x in enumerate(nums[:-k+1]):\\n if i>0 and x == nums[i-1]:\\n continue\\n current = self.KSumClosest(nums[i+1:], k-1, target - x) + x\\n if abs(target - current) < abs(target - closest):\\n if current == target:\\n return target\\n else:\\n closest = current\\n\\n return closest\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n return self.KSumClosest(nums, 3, target)\\n\\n def KSumClosest(self, nums: List[int], k: int, target: int) -> int:\\n N = len(nums)\\n if N == k:\\n return sum(nums[:k])\\n\\n # target too small\\n current = sum(nums[:k])\\n if current >= target:\\n return current\\n\\n # target too big\\n current = sum(nums[-k:])\\n if current <= target:\\n return current\\n \\n if k == 1:\\n return min([(x, abs(target - x)) for x in nums], key = lambda x: x[1])[0]\\n\\n closest = sum(nums[:k])\\n for i, x in enumerate(nums[:-k+1]):\\n if i>0 and x == nums[i-1]:\\n continue\\n current = self.KSumClosest(nums[i+1:], k-1, target - x) + x\\n if abs(target - current) < abs(target - closest):\\n if current == target:\\n return target\\n else:\\n closest = current\\n\\n return closest \",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n return self.KSumClosest(nums,3,target)\\n \\n def KSumClosest(self, nums: List[int], k: int ,target : int) -> int:\\n N = len(nums)\\n if k == N:\\n return sum(nums[:k])\\n\\n current = sum(nums[:k])\\n if current >= target:\\n return current\\n\\n current = sum(nums[-k:])\\n if current <= target:\\n return current\\n if k==1:\\n return min([(x,abs(target-x)) for x in nums], key = lambda x: x[1])[0]\\n\\n closest = sum(nums[:k])\\n for i,x in enumerate(nums[:-k+1]):\\n if i>0 and nums[i-1] == x:\\n continue\\n\\n Bestmatch = self.KSumClosest(nums[i+1:],k-1,target-x)\\n current = x + Bestmatch\\n if abs(target-current) < abs(target-closest):\\n if current == target:\\n return target\\n else:\\n closest = current\\n return closest\\n\",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n nums.sort()\\n res = 0\\n N = len(nums)\\n\\n least_sum = sum(nums[:3])\\n if target <= least_sum:\\n return least_sum\\n\\n high_sum = sum(nums[-3:])\\n if target >= high_sum:\\n return high_sum\\n \\n diff = float('inf')\\n for i in range(N-1):\\n l = i+1\\n h = N-1\\n \\n while l < h:\\n sm = nums[i] + nums[l] + nums[h]\\n if sm == target:\\n return target\\n elif abs(target-sm) < diff:\\n diff = abs(target-sm)\\n res = sm\\n if sm > target:\\n h -= 1\\n else:\\n l += 1\\n \\n return res \",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n minDif = 999999\\n ans = 0\\n nums.sort()\\n if (len(nums) <= 3 or (nums[0] + nums[1] + nums[2]) > target):\\n return (nums[0] + nums[1] + nums[2])\\n elif (nums[-1] + nums[-2] + nums[-3]) < target:\\n return (nums[-1] + nums[-2] + nums[-3])\\n for i in range(0,len(nums) - 2):\\n j = i + 1\\n k = len(nums) - 1\\n while j < k:\\n tempSum = nums[i] + nums[j] + nums[k]\\n tempDif = tempSum - target\\n if abs(tempDif) < minDif:\\n minDif = abs(tempDif)\\n ans = tempSum\\n if tempDif > 0:\\n k -= 1\\n elif tempDif < 0:\\n j += 1\\n else:\\n return ans\\n return ans\",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n print(\\\"nums=\\\", nums)\\n return self.KSumClosest(nums, 3, target)\\n\\n def KSumClosest(self, nums: List[int], k: int, target: int) -> int:\\n print(\\\"enter with nums=\\\", nums, \\\"k=\\\", k)\\n N = len(nums)\\n if N == k:\\n return sum(nums[:k])\\n\\n # target too small\\n current = sum(nums[:k])\\n if current >= target:\\n return current\\n\\n # target too big\\n current = sum(nums[-k:])\\n if current <= target:\\n return current\\n \\n if k == 1:\\n return min([(x, abs(target - x)) for x in nums], key = lambda x: x[1])[0]\\n\\n closest = sum(nums[:k])\\n for i, x in enumerate(nums[:-k+1]):\\n #if i>0 and x == nums[i-1]:\\n # continue\\n current = self.KSumClosest(nums[i+1:], k-1, target - x) + x\\n if abs(target - current) < abs(target - closest):\\n if current == target:\\n return target\\n else:\\n closest = current\\n\\n return closest\\n \",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n\\n closest = sum(nums[:3])\\n if closest >= target:\\n return closest\\n\\n closest = sum(nums[-3:])\\n if closest <= target:\\n return closest\\n\\n best_diff = float(\\\"inf\\\")\\n closest = None\\n for i in range(len(nums) - 2):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n\\n cur = sum(nums[i:i + 3])\\n if cur >= target:\\n diff = abs(target - cur)\\n if diff == 0:\\n return target\\n if diff < best_diff:\\n best_diff = abs(target - cur)\\n closest = cur\\n continue\\n\\n cur = nums[i] + sum(nums[-2:])\\n if cur < target:\\n diff = abs(target - cur)\\n if diff == 0:\\n return target\\n if diff < best_diff:\\n best_diff = abs(target - cur)\\n closest = cur\\n continue\\n\\n for j in range(i + 1, len(nums) - 1):\\n if j > 1 and nums[j] == nums[i - 1]:\\n continue\\n cur = nums[i] + nums[j]\\n cur += min(nums[j + 1:], key=lambda x: abs(target - cur - x))\\n diff = abs(cur - target)\\n if diff == 0:\\n return target\\n if diff < best_diff:\\n best_diff = diff\\n closest = cur\\n return closest\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n sum_min = sum(nums[:3])\\n sum_max = sum(nums[-3:])\\n if target <= sum_min:\\n return sum_min\\n if target >= sum_max:\\n return sum_max\\n\\n n = len(nums)\\n diff = math.inf\\n\\n ## two pointers. O(n2) time\\n # for i in range(n):\\n # left = i + 1\\n # right = n - 1\\n # while left < right:\\n # total = nums[i] + nums[left] + nums[right]\\n # if abs(target - total) < abs(diff):\\n # diff = target - total\\n # if diff == 0:\\n # return total\\n # if total < target:\\n # left += 1\\n # else:\\n # right -= 1 \\n # return target - diff\\n\\n ## or: binary search the third element. O(n2logn) time\\n for i in range(n):\\n for j in range(i + 1, n):\\n complement = target - nums[i] - nums[j]\\n right = bisect_right(nums, complement, j + 1)\\n left = right - 1\\n if right < n and abs(complement - nums[right]) < abs(diff):\\n diff = complement - nums[right]\\n if left > j and abs(complement - nums[left]) < abs(diff):\\n diff = complement - nums[left]\\n if diff == 0:\\n break\\n return target - diff\",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nn, target: int) -> int:\\n raw_nums = sorted(nn)\\n res = 9999999999\\n for i in range(0, len(raw_nums)):\\n if not (i == 0 or raw_nums[i - 1] < raw_nums[i]):\\n continue\\n\\n nt = (target - raw_nums[i]) / 2\\n nums = raw_nums[:i] + raw_nums[i + 1 :]\\n l, r = 0, len(nums) - 1\\n while l < r:\\n m = (r + l) // 2\\n if nums[m] > nt:\\n if m - 1 < 0:\\n r = l = m\\n break\\n if nums[m - 1] < nt:\\n l = m - 1\\n r = m\\n break\\n else:\\n r = m - 1\\n elif nums[m] < nt:\\n if m + 1 >= len(nums):\\n r = l = m\\n break\\n if nums[m + 1] > nt:\\n l = m\\n r = m + 1\\n break\\n else:\\n l = m + 1\\n else:\\n r = m\\n l = m\\n break\\n\\n if l != r:\\n if abs(nums[l] * 2 - nt * 2) < abs(nums[l] + nums[r] - nt * 2):\\n r = l\\n elif abs(nums[l] + nums[r] - nt * 2) < abs(nums[r] * 2 - nt * 2):\\n pass\\n else:\\n l = r\\n\\n while l >= 0 and r < len(nums):\\n if l == r:\\n if l == 0:\\n r = 1\\n if r == len(nums) - 1:\\n l = r - 1\\n if r + 1 < len(nums) and nums[r] == nums[r + 1]:\\n r = r + 1\\n if l - 1 >= 0 and nums[l] == nums[l - 1]:\\n l -= 1\\n\\n if l == r:\\n pass\\n else:\\n if abs(nums[l] + nums[r] + raw_nums[i] - target) < abs(\\n res - target\\n ):\\n res = nums[l] + nums[r] + raw_nums[i]\\n\\n if res == target:\\n return target\\n\\n if (nums[l] + nums[r]) > 2 * nt or l == r:\\n l -= 1\\n else:\\n r += 1\\n\\n return res\",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n if len(nums) < 3:\\n return None\\n\\n sorted_nums = sorted(nums)\\n\\n best_pos = sum(sorted_nums[:3])\\n best_pos_diff = target - sum(sorted_nums[:3])\\n best_neg = sum(sorted_nums[-3:])\\n best_neg_diff = sum(sorted_nums[-3:]) - target\\n\\n if best_pos_diff <= 0:\\n return best_pos\\n if best_neg_diff <= 0:\\n return best_neg\\n \\n for i in range(len(nums) - 2):\\n\\n if sum(sorted_nums[i:(i+3)]) >= target:\\n temp_neg_diff = sum(sorted_nums[i:(i+3)]) - target\\n if temp_neg_diff < best_neg_diff:\\n best_neg_diff = temp_neg_diff\\n best_neg = sum(sorted_nums[i:(i+3)])\\n break\\n\\n first_element = sorted_nums[i]\\n target_1 = target - first_element\\n half_target_1 = (target - first_element) / 2\\n exist_half = 0\\n\\n for j in range(i+1, len(nums)-1):\\n if ((sorted_nums[j] <= half_target_1) & (sorted_nums[j+1] >= half_target_1)):\\n half_index = j\\n exist_half = 1\\n break\\n if exist_half == 0:\\n temp_pos_diff = target_1 - sum(sorted_nums[j:(j+2)])\\n if temp_pos_diff < best_pos_diff:\\n best_pos_diff = temp_pos_diff\\n best_pos = first_element + sum(sorted_nums[j:(j+2)])\\n \\n else:\\n if half_index - 1 > i:\\n temp_pos_diff = target_1 - sorted_nums[half_index] - sorted_nums[half_index - 1]\\n if temp_pos_diff < best_pos_diff:\\n best_pos_diff = temp_pos_diff\\n best_pos = first_element + sorted_nums[half_index] + sorted_nums[half_index - 1]\\n\\n third_index = half_index + 1\\n for j in range(half_index , i, -1):\\n second_element = sorted_nums[j]\\n third_element = sorted_nums[third_index]\\n while third_element + second_element < target_1:\\n temp_pos_diff = target_1 - (third_element + second_element)\\n if temp_pos_diff < best_pos_diff:\\n best_pos_diff = temp_pos_diff\\n best_pos = first_element + second_element + third_element\\n third_index += 1\\n if third_index == len(nums):\\n break\\n third_element = sorted_nums[third_index]\\n if third_index == len(nums):\\n break\\n \\n temp_neg_diff = (third_element + second_element) - target_1\\n if temp_neg_diff < best_neg_diff:\\n best_neg_diff = temp_neg_diff\\n best_neg = first_element + second_element + third_element\\n \\n\\n if best_pos_diff < best_neg_diff:\\n return best_pos\\n else:\\n return best_neg\\n \\n\\n \",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n if target >= sum(nums[-3:]):\\n return sum(nums[-3:])\\n if target <= sum(nums[:3]):\\n return sum(nums[:3])\\n \\n n = len(nums)\\n m = 2 ** 63\\n for i in range(n-2):\\n temp = self.twoSumDiff(nums[(i+1):], target - nums[i])\\n if abs(temp) < abs(m):\\n m = temp\\n ans = m + target\\n \\n return ans\\n \\n def twoSumDiff(self, arr, target):\\n left, right = 0, len(arr)-1\\n m = 2 ** 63\\n while left < right:\\n temp = arr[left] + arr[right]\\n if temp == target:\\n return 0\\n if abs(temp - target) < abs(m):\\n m = temp - target\\n if temp > target:\\n right -=1\\n else:\\n left += 1\\n \\n return m\\n \",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n if target >= sum(nums[-3:]):\\n return sum(nums[-3:])\\n if target <= sum(nums[:3]):\\n return sum(nums[:3])\\n \\n n = len(nums)\\n m = 2 ** 63\\n for i in range(n-2):\\n temp = self.twoSumDiff(nums[(i+1):], target - nums[i])\\n if abs(temp) < abs(m):\\n m = temp\\n\\n return m + target\\n \\n def twoSumDiff(self, arr, target):\\n left, right = 0, len(arr)-1\\n m = 2 ** 63\\n while left < right:\\n temp = arr[left] + arr[right]\\n if temp == target:\\n return 0\\n if abs(temp - target) < abs(m):\\n m = temp - target\\n if temp > target:\\n right -=1\\n else:\\n left += 1\\n \\n return m\",\n \"runtime\": \"119\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n nums.sort()\\n\\n closest_sum = sum(nums[0:3])\\n if closest_sum > target:\\n return closest_sum\\n\\n max_sum = sum(nums[-3:])\\n if max_sum < target:\\n return max_sum\\n\\n for i, num1 in enumerate(nums[:-2]):\\n\\n j = i + 1\\n k = len(nums) - 1\\n\\n if closest_sum > target and 3*num1 >= closest_sum:\\n # sum of three numbers >= 3*num1 >= closest_sum > target\\n # no point iterating forward as sum will increase further \\n break\\n\\n if closest_sum < target and (num1+nums[k]+nums[k-1]) <= closest_sum:\\n # max possible sum is num1+nums[k]+nums[k-1] <= closest_sum < target\\n # no point checking this iteration\\n continue \\n\\n \\n\\n while j < k:\\n sums = num1 + nums[j] + nums[k]\\n\\n if abs(sums - target) < abs(closest_sum - target):\\n closest_sum = sums\\n\\n if sums > target:\\n k -= 1\\n else:\\n j += 1\\n\\n return closest_sum\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n \",\n \"runtime\": \"119\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n if sum(nums[:3]) >= target:\\n return sum(nums[:3])\\n if sum(nums[-3:]) <= target:\\n return sum(nums[-3:])\\n closestTol = sum(nums[:3])\\n for i in range(len(nums) - 1):\\n if i != 0:\\n if nums[i] == nums[i-1]:\\n continue\\n left = i + 1\\n right = len(nums) - 1\\n while left < right:\\n currTol = nums[i] + nums[left] + nums[right]\\n if abs(target - currTol) < abs(target - closestTol):\\n closestTol = currTol\\n if currTol < target:\\n left += 1\\n else:\\n right -= 1\\n return closestTol\\n\\n \\n \\n \",\n \"runtime\": \"129\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n\\n def solve(arr, targ, k):\\n if len(arr) == k: return sum(arr)\\n if k == 1: return min([[x, abs(x - targ)] for x in nums], key=lambda x: x[1])[0]\\n if sum(arr[:k]) >= targ: return sum(arr[:k])\\n elif sum(arr[-k:]) <= targ: return sum(arr[-k:])\\n\\n closest = 10**9\\n for i in range(len(arr) - k + 1):\\n current = solve(arr[i + 1:], targ - arr[i], k - 1) + arr[i]\\n if abs(targ - current) < abs(targ - closest): closest = current\\n if current == targ: return current\\n return closest\\n\\n return solve(nums, target, 3)\",\n \"runtime\": \"129\"\n },\n {\n \"code\": \"from collections import Counter\\n\\n\\nclass Solution:\\n def threeSumClosest(self, nums, target: int) -> int:\\n nums = sorted(nums)\\n if target > sum(nums[-3:]):\\n return sum(nums[-3:])\\n if target < sum(nums[:3]):\\n return sum(nums[:3])\\n my_target = float(\\\"inf\\\")\\n min_num, max_num = sum(nums[:2]), sum(nums[-2:])\\n new_min_num, new_max_num = target - max_num - 1, target - min_num + 1\\n nums = Counter((i for i in nums if new_min_num <= i <= new_max_num))\\n sorted_keys = sorted(nums.keys())\\n l = len(sorted_keys)\\n for i, x in enumerate(sorted_keys):\\n if i > 1 and x > abs(target // 3):\\n break\\n for j in range(i, l):\\n y = sorted_keys[j]\\n if x + y + y - target > abs(my_target):\\n break\\n for k in range(j, l):\\n z = sorted_keys[k]\\n cand = x + y + z\\n if cand - target > abs(my_target):\\n break\\n n = 1 + (x == y) + (y == z)\\n if nums[y] < n:\\n continue\\n \\n if abs(cand - target) < abs(my_target - target):\\n my_target = cand\\n if my_target == target:\\n return target\\n\\n return my_target\",\n \"runtime\": \"139\"\n },\n {\n \"code\": \"from collections import Counter\\n\\n\\nclass Solution:\\n def threeSumClosest(self, nums, target: int) -> int:\\n nums = sorted(nums)\\n if target > sum(nums[-3:]):\\n return sum(nums[-3:])\\n if target < sum(nums[:3]):\\n return sum(nums[:3])\\n my_target = float(\\\"inf\\\")\\n min_num, max_num = sum(nums[:2]), sum(nums[-2:])\\n new_min_num, new_max_num = target - max_num - 1, target - min_num + 1\\n nums = Counter((i for i in nums if new_min_num <= i <= new_max_num))\\n sorted_keys = sorted(nums.keys())\\n for i, x in enumerate(sorted_keys):\\n if i > 1 and x > abs(target // 3):\\n break\\n for j, y in enumerate(sorted_keys[i:]):\\n if x + y + y - target > abs(my_target):\\n break\\n for k in range(i+j, len(sorted_keys)):\\n z = sorted_keys[k]\\n cand = x + y + z\\n if cand - target > abs(my_target):\\n break\\n n = 1 + (x == y) + (y == z)\\n if nums[y] < n:\\n continue\\n \\n if abs(cand - target) < abs(my_target - target):\\n my_target = cand\\n if my_target == target:\\n return target\\n\\n return my_target\",\n \"runtime\": \"139\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n \\n nums.sort()\\n #print(nums)\\n l,r = 0, len(nums)-1\\n res = float('inf')\\n t = 0\\n while l < r-1:\\n tmp = nums[l] + nums[r]\\n for i in range(r-1, l, -1):\\n tmp1 = tmp + nums[i]\\n #print(tmp1)\\n if target == tmp1:\\n return tmp1\\n if abs(target-tmp1) < res:\\n res = abs(target-tmp1)\\n t = tmp1\\n #res = min(res, abs(target-tmp1))\\n if tmp1 < target and i != l+1: \\n l += 1\\n r += 1\\n break\\n r -= 1\\n return t\",\n \"runtime\": \"149\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n \\n nums.sort()\\n #print(nums)\\n l,r = 0, len(nums)-1\\n res = float('inf')\\n t = 0\\n while l < r-1:\\n print(l, r)\\n tmp = nums[l] + nums[r]\\n for i in range(r-1, l, -1):\\n tmp1 = tmp + nums[i]\\n #print(tmp1)\\n if target == tmp1:\\n return tmp1\\n if abs(target-tmp1) < res:\\n res = abs(target-tmp1)\\n t = tmp1\\n #res = min(res, abs(target-tmp1))\\n if tmp1 < target and i != l+1: \\n l += 1\\n r += 1\\n break\\n r -= 1\\n return t\",\n \"runtime\": \"149\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n #only interested in at most three repeated vals\\n valcount = {}\\n for n in nums:\\n if not n in valcount:\\n valcount[n] = 0\\n valcount[n] = min(3,valcount[n]+1)\\n nums = []\\n for k,v in valcount.items():\\n for _ in range(v):\\n nums.append(k)\\n \\n nums.sort()\\n print(nums)\\n closestSum = None\\n idxs = 0\\n idxe = len(nums)-1\\n while idxe-idxs > 1:\\n bestCurrentSum = None\\n for idxe_2 in range(max(0,idxe-1), min(idxe+2,len(nums))):\\n for idxs_2 in range(max(0,idxs-1), min(idxs+2, len(nums))):\\n if idxs_2==idxe_2:\\n continue\\n idxm = bisect.bisect_left(nums, target-nums[idxs_2]-nums[idxe_2] , lo=idxs_2+1, hi=idxe_2)\\n for idxm_2 in range(max(0, idxm-1),min(idxm+2,len(nums))):\\n if idxm_2==idxs_2 or idxm_2==idxe_2:\\n continue\\n currentSum = nums[idxs_2]+nums[idxm_2]+nums[idxe_2]\\n if bestCurrentSum is None or abs(currentSum - target)<abs(bestCurrentSum-target):\\n bestCurrentSum = currentSum\\n \\n\\n if closestSum is None or abs(bestCurrentSum - target) < abs(closestSum-target):\\n closestSum = bestCurrentSum \\n if bestCurrentSum > target:\\n idxe-=1\\n elif bestCurrentSum < target:\\n idxs+=1\\n else:\\n return target #found an exact match\\n\\n return closestSum\\n \",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums, target):\\n ans = sum(nums[:3])\\n # brute force for n <15 to see if we can cheat the system a bit\\n if len(nums) < 15:\\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 curAns = nums[i] + nums[j] + nums[k]\\n if abs(target-curAns) < abs(target-ans):\\n ans = curAns\\n return ans\\n nums.sort()\\n i,j = 0,len(nums)-1\\n while j-i >=2:\\n curSum = nums[i] + nums[j]\\n l,r = i+1,j-1\\n while l<=r:\\n mid = (l+r)//2\\n print(i,mid,j)\\n potential = curSum + nums[mid]\\n if abs(target-potential) < abs(target-ans):\\n ans = potential\\n if potential < target:\\n l = mid+1\\n else:\\n r = mid-1\\n if potential < target:\\n i += 1\\n else:\\n j -= 1\\n return ans\",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort() \\n res = float('Inf')\\n diff = abs(res - target)\\n n = len(nums)\\n for i in range(n-2):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n s = sum(nums[i: i + 3])\\n if s >= target:\\n if s - target < diff:\\n return s\\n else:\\n return res\\n left, right = i + 1, n - 1\\n while left < right:\\n s = nums[i] + nums[left] + nums[right]\\n if abs(target - s) < diff:\\n diff = abs(target - s)\\n res = s\\n if s < target:\\n left += 1\\n elif s > target:\\n right -= 1\\n else:\\n return s\\n return target - diff\\n\",\n \"runtime\": \"169\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n close = nums[0]+nums[1]+nums[2]\\n diff = abs(target-close)\\n if close>target:\\n return close\\n for i in range(len(nums)-2):\\n j = i+1\\n k = len(nums)-1\\n while j<k:\\n a = nums[i]+nums[j]+nums[k]\\n if a>target:\\n if a-target<diff:\\n close=a\\n diff = a-target\\n k-=1\\n elif a==target:\\n return target\\n else:\\n if target-a<diff:\\n close=a\\n diff=target-a\\n j+=1\\n return close\\n\\n\",\n \"runtime\": \"179\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n # -4 -1 1 2\\n nums.sort() \\n\\n res = float('Inf')\\n diff = abs(res - target)\\n\\n n = len(nums)\\n for i in range(n-2):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n s = sum(nums[i: i + 3])\\n if s >= target:\\n if s - target < diff:\\n return s\\n else:\\n return res\\n \\n left, right = i + 1, n - 1\\n while left < right:\\n s = nums[i] + nums[left] + nums[right]\\n if abs(target - s) < diff:\\n diff = abs(target - s)\\n res = s\\n if s < target:\\n left += 1\\n elif s > target:\\n right -= 1\\n else:\\n return s\\n return target - diff\\n\",\n \"runtime\": \"189\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n diff = 16000\\n answer = 500000\\n nums.sort()\\n for i in range(0, len(nums)-2):\\n j = i+1\\n k = len(nums) - 1\\n min = nums[0] + nums[1] + nums[2]\\n if target <= min:\\n if abs(target-answer) > min-target:\\n return min\\n break\\n while j != k:\\n sum = nums[i] + nums[j] + nums[k]\\n if abs(target - sum) < diff:\\n diff = abs(target - sum)\\n answer = sum\\n if sum < target:\\n j += 1\\n elif sum > target:\\n k -= 1\\n else:\\n return sum\\n\\n return answer\",\n \"runtime\": \"199\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n # -4 -1 1 2\\n nums.sort() \\n\\n res = float('Inf')\\n dist = abs(res - target)\\n\\n n = len(nums)\\n for i in range(n-2):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n s = sum(nums[i: i + 3])\\n if s >= target:\\n if s - target < dist:\\n return s\\n else:\\n return res\\n \\n l, r = i + 1, n - 1\\n while l < r:\\n s = nums[i] + nums[l] + nums[r]\\n\\n if abs(s - target) < dist:\\n dist = abs(s - target)\\n res = s\\n\\n if s < target:\\n l += 1\\n elif s > target:\\n r -= 1\\n else:\\n return s\\n \\n return res\\n\",\n \"runtime\": \"209\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n result = 1e9\\n\\n for i in range(len(nums)-2):\\n if target < nums[i]+nums[i+1]+nums[i+2]:\\n if abs(target - result) > abs(target - (nums[i]+nums[i+1]+nums[i+2])) : result = nums[i]+nums[i+1]+nums[i+2]; continue\\n elif target > nums[i]+nums[-2]+nums[-1]:\\n if abs(target - result) > abs(target - (nums[i]+nums[-2]+nums[-1])): result = nums[i]+nums[-2]+nums[-1]; continue\\n\\n\\n s = i+1\\n e = len(nums)-1\\n\\n while s<e:\\n margin = target-nums[i] - nums[s] - nums[e]\\n if abs(margin) < abs(target- result):\\n if margin == 0 : return target\\n result = nums[i]+nums[s]+nums[e]\\n\\n if margin<0:\\n e-=1\\n else:\\n s+=1\\n # if abs(target-result) > abs(target-nums[i] - nums[s] - nums[e]):\\n # if target-nums[i] - nums[s] - nums[e]==0: return target\\n # result = nums[i]+nums[s]+nums[e]\\n # print(result,nums[i],nums[s],nums[e])\\n\\n return result\\n\\n\\n\",\n \"runtime\": \"209\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n result = 1e9\\n\\n for i in range(len(nums)-2):\\n if target < nums[i]+nums[i+1]+nums[i+2]:\\n if abs(target - result) > abs(target - (nums[i]+nums[i+1]+nums[i+2])) : result = nums[i]+nums[i+1]+nums[i+2]; continue\\n if target > nums[i]+nums[-2]+nums[-1]:\\n if abs(target - result) > abs(target - (nums[i]+nums[-2]+nums[-1])): result = nums[i]+nums[-2]+nums[-1]; continue\\n\\n\\n s = i+1\\n e = len(nums)-1\\n\\n while s<e:\\n margin = target-nums[i] - nums[s] - nums[e]\\n if abs(margin) < abs(target- result):\\n if margin == 0 : return target\\n result = nums[i]+nums[s]+nums[e]\\n\\n if margin<0:\\n e-=1\\n else:\\n s+=1\\n # if abs(target-result) > abs(target-nums[i] - nums[s] - nums[e]):\\n # if target-nums[i] - nums[s] - nums[e]==0: return target\\n # result = nums[i]+nums[s]+nums[e]\\n # print(result,nums[i],nums[s],nums[e])\\n\\n return result\\n\\n\\n\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n min_diff = inf\\n res = 0\\n\\n nums.sort()\\n n = len(nums)\\n for i in range(n - 2):\\n s = nums[i] + nums[i + 1] + nums[i + 2]\\n if s > target:\\n diff = abs(target - s)\\n if diff < min_diff:\\n min_diff = diff\\n res = s\\n break\\n\\n\\n j = i + 1\\n k = len(nums) - 1\\n\\n while j < k:\\n s = nums[i] + nums[j] + nums[k]\\n diff = abs(target - s)\\n \\n if diff < min_diff:\\n min_diff = diff\\n res = s\\n \\n if s == target:\\n return target\\n elif s > target:\\n k -= 1\\n else:\\n j += 1\\n\\n return res\\n \\n \",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n ans = 0\\n temp = float('inf')\\n nums.sort()\\n n = len(nums)\\n i, j = 0, 1\\n while i < j:\\n j, k = i + 1, n - 1\\n while j < k:\\n s = nums[i] + nums[j] + nums[k]\\n dist = abs(s - target)\\n if dist < temp:\\n ans = s\\n temp = dist\\n if s < target:\\n j += 1\\n elif s > target:\\n k -= 1\\n else:\\n return s \\n i += 1\\n return ans\\n \",\n \"runtime\": \"229\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums=sorted(nums)\\n ans, res =nums[0] + nums[1] + nums[2], 0\\n for i in range(0,len(nums)-2):\\n res=nums[i]+self.TwoSumClosest(target-nums[i],nums[i+1:])\\n if abs(res-target)<abs(ans-target):\\n ans=res\\n return ans\\n\\n def TwoSumClosest(self, tar: int, arr: List[int]) -> int:\\n ret,exc= arr[0]+arr[1] ,arr[0]+arr[-1]\\n low, mid = 0, 0\\n high=len(arr)-1\\n while mid<high: \\n half = (mid + high) // 2\\n if (arr[half] < tar-arr[low]):\\n mid = half + 1\\n else:\\n high = half\\n if mid==low:\\n exc=arr[0]+arr[1]\\n elif mid==low+1:\\n exc=arr[low]+arr[mid]\\n else:\\n exc= arr[low]+arr[mid-1] if abs(tar-arr[low]-arr[mid-1])<abs(tar-arr[low]-arr[mid]) else arr[low]+arr[mid]\\n if exc==tar:\\n return tar\\n if abs(exc-tar)<abs(ret-tar):\\n ret=exc\\n while low < mid:\\n exc=arr[low]+arr[mid]\\n if arr[low]+arr[mid]<tar:\\n low=low+1\\n else:\\n mid=mid-1\\n if exc==tar:\\n return tar\\n if abs(exc-tar)<abs(ret-tar):\\n ret=exc\\n return ret\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n \",\n \"runtime\": \"229\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n \\n nums = sorted(nums)\\n n, closest_gap, res = len(nums), 1e5, 0\\n for i in range(n - 2):\\n j, k = i + 1, n - 1\\n if nums[i] + nums[i + 1] + nums[i + 2] > target + closest_gap:\\n break\\n while j < k:\\n add = nums[i] + nums[j] + nums[k]\\n if add == target:\\n return target\\n elif add > target:\\n k -= 1\\n else:\\n j += 1\\n gap = abs(add - target)\\n if gap < closest_gap:\\n closest_gap = gap\\n res = add\\n \\n return res\\n\",\n \"runtime\": \"239\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n n= len(nums)\\n nums.sort()\\n ans= nums[0]+ nums[1]+nums[2];\\n if (ans> target):\\n return ans;\\n #diff= abs(target-ans);\\n for i in range (0,n-2):\\n left= i+1\\n right= n-1\\n while (left< right):\\n sumi= nums[i]+nums[left]+nums[right]\\n if (sumi<target):\\n left+=1\\n elif (sumi > target):\\n right-=1\\n else:\\n return target\\n if (abs(target-sumi) < abs(target-ans)):\\n #diff= abs(target-sumi)\\n ans= sumi\\n return ans\",\n \"runtime\": \"239\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums = sorted(nums)\\n closestSum = sum(nums[0:3])\\n for i in range(len(nums) - 2):\\n if (sum(nums[i:i+3]) > closestSum > target):\\n continue\\n if (nums[i] + nums[len(nums) - 2] + nums[len(nums) - 1] < closestSum < target):\\n break\\n\\n j, k = i + 1, len(nums) - 1\\n while (j < k):\\n temp = nums[i] + nums[j] + nums[k]\\n if abs(target - temp) < abs(target - closestSum):\\n closestSum = temp\\n if (temp > target):\\n k -= 1\\n elif (temp < target):\\n j += 1\\n else:\\n return closestSum\\n return closestSum\",\n \"runtime\": \"249\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n n = None\\n sum_val_ori = nums[0] + nums[1] + nums[len(nums)-1]\\n lowest = abs(sum_val_ori - target)\\n lowest_sum = sum_val_ori\\n for i in range(0,len(nums)-2):\\n fix_elem = nums[i]\\n if fix_elem == n:\\n continue\\n n = nums[i]\\n j = i+1\\n k = len(nums) - 1\\n while j != k:\\n sum_val = fix_elem + nums[j] + nums[k]\\n while sum_val > target and k!= j:\\n k -= 1\\n if k!= j:\\n sum_val = fix_elem + nums[j] + nums[k]\\n while sum_val < target and k!= j:\\n j += 1\\n if k!= j:\\n sum_val = fix_elem + nums[j] + nums[k]\\n if sum_val == target:\\n return sum_val\\n if abs(sum_val - target) < lowest:\\n lowest = abs(sum_val - target)\\n lowest_sum = sum_val\\n\\n \\n \\n \\n\\n \\n return lowest_sum\",\n \"runtime\": \"249\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n min_candidate = math.inf\\n min_candidate = sum(nums[:3])\\n if min_candidate >= target:\\n return min_candidate\\n for i in range(0, len(nums) - 2):\\n l, r = i + 1, len(nums) - 1\\n while l < r: \\n triplet_sum = nums[i] + nums[l] + nums[r]\\n if triplet_sum == target:\\n return target\\n if abs(target - min_candidate) > abs(target - triplet_sum):\\n min_candidate = triplet_sum\\n if triplet_sum < target:\\n l += 1\\n else:\\n r -= 1\\n \\n return min_candidate\",\n \"runtime\": \"259\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n nums.append(None)\\n bestSum = None\\n bestDistance = 10000000\\n i = 0\\n while i < len(nums) - 3:\\n target2 = target - nums[i]\\n low = i + 1\\n high = len(nums) - 2\\n while (low < high):\\n potentialSum = nums[low] + nums[high]\\n if potentialSum > target2:\\n high-=1\\n if potentialSum - target2 < bestDistance:\\n bestDistance = potentialSum - target2\\n bestSum = target + bestDistance\\n elif potentialSum < target2:\\n low+=1\\n if target2 - potentialSum < bestDistance:\\n bestDistance = target2 - potentialSum\\n bestSum = target - bestDistance\\n else:\\n return target\\n i+=1\\n \\n return bestSum\\n \",\n \"runtime\": \"259\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n closest_sum = sum(nums[:3])\\n if closest_sum >= target: return closest_sum\\n\\n for i in range(len(nums) - 2):\\n left, right = i+1, len(nums) - 1\\n while left < right:\\n triple_sum = nums[i] + nums[left] + nums[right]\\n if abs(triple_sum - target) < abs(closest_sum - target):\\n closest_sum = triple_sum\\n if closest_sum == target: return target\\n if triple_sum > target: right -= 1\\n else: left += 1\\n\\n return closest_sum\",\n \"runtime\": \"269\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n closest_sum = sum(nums[:3])\\n if closest_sum >= target:\\n return closest_sum\\n for index in range(len(nums) - 2):\\n left = index + 1\\n right = len(nums) - 1\\n while left < right:\\n triplet_sum = nums[index] + nums[left] + nums[right]\\n if triplet_sum == target:\\n return target\\n if abs(triplet_sum - target) < abs(closest_sum - target):\\n closest_sum = triplet_sum\\n if triplet_sum < target:\\n left += 1\\n else:\\n right -= 1\\n if sum(nums[index: index + 3]) >= target:\\n break\\n return closest_sum\",\n \"runtime\": \"269\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n closest_sum = sum(nums[:3])\\n if closest_sum >= target:\\n return closest_sum\\n for index in range(len(nums) - 2):\\n left = index + 1\\n right = len(nums) - 1\\n while left < right:\\n triplet_sum = nums[index] + nums[left] + nums[right]\\n if triplet_sum == target:\\n return target\\n if abs(triplet_sum - target) < abs(closest_sum - target):\\n closest_sum = triplet_sum\\n if triplet_sum < target:\\n left += 1\\n else:\\n right -= 1\\n return closest_sum\",\n \"runtime\": \"279\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n closest_sum = sum(nums[:3])\\n if closest_sum >= target:\\n return closest_sum\\n for index in range(len(nums) - 2):\\n if index > 0 and nums[index] == nums[index - 1]:\\n continue\\n left = index + 1\\n right = len(nums) - 1\\n while left < right:\\n triplet_sum = nums[index] + nums[left] + nums[right]\\n if triplet_sum == target:\\n return target\\n if abs(triplet_sum - target) < abs(closest_sum - target):\\n closest_sum = triplet_sum\\n if triplet_sum < target:\\n left += 1\\n else:\\n right -= 1\\n if sum(nums[index: index + 3]) >= target:\\n break\\n return closest_sum\",\n \"runtime\": \"279\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n nums.sort()\\n\\n closest_sum = sum(nums[0:3])\\n\\n for i, num1 in enumerate(nums[:-2]):\\n\\n j = i + 1\\n k = len(nums) - 1\\n\\n if closest_sum > target and 3*num1 >= closest_sum:\\n # sum of three numbers >= 3*num1 >= closest_sum > target\\n # no point iterating forward as sum will increase further \\n break\\n\\n if closest_sum < target and (num1+nums[k]+nums[k-1]) <= closest_sum:\\n # max possible sum is num1+nums[k]+nums[k-1] <= closest_sum < target\\n # no point checking this iteration\\n continue \\n\\n \\n\\n while j < k:\\n sums = num1 + nums[j] + nums[k]\\n\\n if abs(sums - target) < abs(closest_sum - target):\\n closest_sum = sums\\n\\n if sums > target:\\n k -= 1\\n else:\\n j += 1\\n\\n return closest_sum\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n \",\n \"runtime\": \"289\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n max_num = float('inf')\\n min_num = float('-inf')\\n for i in range(len(nums)-2):\\n j = i+1\\n k = len(nums)-1\\n while j < k:\\n result = nums[i] + nums[j] + nums[k]\\n if result == target:\\n return result\\n elif result > target:\\n if result < max_num:\\n max_num = result\\n k-=1\\n else:\\n if result > min_num:\\n min_num = result\\n j+=1\\n \\n if target - min_num < max_num - target:\\n return min_num\\n else:\\n return max_num\\n \",\n \"runtime\": \"289\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n i = 0\\n best = float(\\\"inf\\\")\\n res = float('inf')\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n \\n a = nums[i]\\n want = target - a\\n l = i + 1\\n r = len(nums) - 1\\n while l < r:\\n s = nums[l] + nums[r]\\n if s == want:\\n return target\\n if s < want:\\n if want - s < best:\\n best = want - s\\n res = a + s\\n l += 1\\n elif s > want:\\n if s - want < best:\\n best = s - want\\n res = a + s\\n r -= 1\\n return res\\n\\n\\n\",\n \"runtime\": \"299\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n\\n diff_abs = float(\\\"inf\\\")\\n for i, x in enumerate(nums):\\n if i > 0 and x == nums[i-1]:\\n continue\\n\\n l, r = i+1, len(nums)-1\\n while l < r:\\n three_sum = x + nums[l] + nums[r]\\n if three_sum == target:\\n return three_sum\\n elif three_sum < target:\\n if target - three_sum < diff_abs:\\n diff_abs = target - three_sum\\n res = three_sum\\n l += 1\\n else:\\n if three_sum - target < diff_abs:\\n diff_abs = three_sum - target\\n res = three_sum\\n r -= 1\\n\\n return res\",\n \"runtime\": \"299\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n diff = float('inf')\\n sign = 1\\n for i, num in enumerate(nums):\\n l, r = i+1, len(nums)-1\\n while l < r:\\n s = nums[l] + nums[r] + num \\n if s == target:\\n return target\\n elif s < target:\\n if target-s < diff:\\n diff = target-s\\n sign = -1\\n l += 1\\n else:\\n if s-target < diff:\\n diff = s-target\\n sign = 1\\n r -= 1\\n return target+diff*sign\",\n \"runtime\": \"309\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n ans, diff = 1<<32 - 1, 1<<32 - 1\\n nums.sort()\\n n = len(nums)\\n for i in range(n-2):\\n t = target - nums[i]\\n j, k = i+1, n-1\\n while j<k:\\n s = nums[j] + nums[k]\\n if s == t:\\n return target\\n if diff > abs(t-s):\\n ans, diff = s+nums[i], abs(t-s)\\n if s > t:\\n k -= 1\\n else:\\n j += 1\\n return ans\",\n \"runtime\": \"309\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n nums.sort()\\n diff_val = float('inf')\\n sum_val = 0\\n\\n for indx, val in enumerate(nums):\\n l , r = indx + 1, len(nums) - 1\\n while l < r:\\n three_sum = val + nums[l] + nums[r]\\n if three_sum == target:\\n return three_sum\\n elif three_sum < target:\\n diff = target - three_sum\\n l += 1\\n else:\\n diff = three_sum - target\\n r -= 1\\n if diff < diff_val:\\n diff_val = diff\\n sum_val = three_sum\\n return sum_val\\n \\n\\n \",\n \"runtime\": \"319\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n sorted_nums = sorted(nums)\\n diff = float('inf')\\n ans = 0\\n for i in range(len(sorted_nums) - 2):\\n summ = target - sorted_nums[i]\\n j = i + 1\\n k = len(sorted_nums) - 1\\n while j < k:\\n temp = sorted_nums[j] + sorted_nums[k]\\n if diff > abs(summ - temp):\\n diff = abs(summ - temp)\\n ans = sorted_nums[i] + sorted_nums[j] + sorted_nums[k]\\n if temp > summ:\\n k -= 1\\n else:\\n j += 1\\n return ans \\n\\n\",\n \"runtime\": \"319\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n leastSum = math.inf\\n leastDiff = math.inf\\n nums.sort()\\n print(nums)\\n for i in range(0, len(nums)):\\n l = i + 1\\n r = len(nums) - 1\\n while l < r:\\n summation = nums[i] + nums[l] + nums[r]\\n if abs(summation - target) < leastDiff:\\n leastSum = summation\\n leastDiff = abs(summation - target)\\n if summation < target:\\n l += 1\\n elif summation > target:\\n r -= 1\\n else:\\n return summation\\n return leastSum\\n \",\n \"runtime\": \"329\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n max_diff=float(\\\"inf\\\")\\n ans=0\\n nums.sort()\\n for i in range(len(nums)-2):\\n l,r= i+1,len(nums)-1\\n while l<r:\\n sum=nums[i]+nums[l]+nums[r]\\n if abs(sum-target)<max_diff:\\n max_diff=abs(sum-target)\\n ans=sum\\n if sum<target:\\n l+=1\\n else:\\n r-=1\\n if max_diff==0:\\n break\\n return ans\",\n \"runtime\": \"329\"\n },\n {\n \"code\": \"class Solution:\\n\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n result = nums[0]+nums[1] + nums[2]\\n diff = abs(result - target)\\n n = len(nums)\\n for i in range(n -2):\\n l = i + 1\\n r = n - 1\\n while l < r:\\n total = nums[i] + nums[l] + nums[r]\\n if abs(total - target) < diff:\\n result = total\\n diff = abs(total - target)\\n if total < target:\\n l += 1\\n elif total > target:\\n r -= 1\\n else:\\n return total\\n return result\\n\\n\\n def threeSumClosestMine(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n n = len(nums)\\n bestDiff = 200001 # Value > (max - min) > (10000 - -10000)\\n best = None\\n\\n for i in range(0, n):\\n # Skip duplicates\\n #if i != 0 and nums[i] == nums[i-1]:\\n # continue\\n\\n j, k = i+1, n-1\\n while j < k:\\n sum3 = nums[i] + nums[j] + nums[k]\\n diff = target - sum3\\n if bestDiff > abs(diff):\\n best = sum3\\n bestDiff = abs(diff)\\n if best == target:\\n break\\n if sum3 > target:\\n k = k - 1\\n #while j < k and nums[k] == nums[k+1]: k = k - 1\\n else:\\n j = j + 1\\n #while j < k and nums[j] == nums[j-1] : j = j + 1\\n \\n return best\\n\\n\",\n \"runtime\": \"339\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n res = 0\\n closest = float('inf')\\n\\n for i in range(len(nums)):\\n l, r = i + 1, len(nums) - 1\\n while l < r:\\n temp_sum = nums[i] + nums[l] + nums[r]\\n if abs(target - temp_sum) < closest:\\n closest = abs(target - temp_sum)\\n res = temp_sum\\n if temp_sum < target:\\n l += 1\\n elif temp_sum > target:\\n r -= 1\\n else:\\n return temp_sum\\n return res\\n\",\n \"runtime\": \"339\"\n },\n {\n \"code\": \"import math\\n\\ndef three_sum_closest(nums, target):\\n nums = sorted(nums)\\n\\n closest = math.inf\\n distance = math.inf\\n\\n for i, x in enumerate(nums):\\n left = i + 1\\n right = len(nums) - 1\\n while left < right:\\n s = x + nums[left] + nums[right]\\n diff = s - target\\n\\n if abs(diff) < distance:\\n closest = s\\n distance = abs(diff)\\n\\n if s > target:\\n right -= 1\\n elif s < target:\\n left += 1\\n else:\\n return s\\n \\n return closest\\n \\nclass Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n return three_sum_closest(nums, target)\\n \",\n \"runtime\": \"349\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n diff = float(\\\"inf\\\")\\n nums.sort()\\n for i in range(len(nums)):\\n lo, hi = i + 1, len(nums) - 1\\n while lo < hi:\\n sum = nums[i] + nums[lo] + nums[hi]\\n if abs(target - sum) < abs(diff):\\n diff = target - sum\\n if sum < target:\\n lo += 1\\n else:\\n hi -= 1\\n if diff == 0:\\n break\\n return target - diff\",\n \"runtime\": \"349\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n diff = float(\\\"inf\\\")\\n nums.sort()\\n for i in range(len(nums)):\\n lo, hi = i + 1, len(nums) - 1\\n while lo < hi:\\n sum = nums[i] + nums[lo] + nums[hi]\\n if abs(target - sum) < abs(diff):\\n diff = target - sum\\n if sum < target:\\n lo += 1\\n else:\\n hi -= 1\\n if diff == 0:\\n break\\n return target - diff\",\n \"runtime\": \"359\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\n\\n-1, 2, 1, -4\\n\\ntarget = 1\\nnums[i] = -1\\nadj_target = 1 - -1 == 2\\nprefix[i:] = 2 3 -1\\n\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n res = math.inf\\n nums.sort()\\n for i in range(len(nums)):\\n lo = i + 1\\n hi = len(nums) - 1\\n while lo < hi:\\n s = nums[i] + nums[lo] + nums[hi]\\n\\n if abs(target - s) < abs(res):\\n res = target - s\\n\\n if s < target:\\n lo += 1\\n else:\\n hi -= 1\\n if res == 0:\\n break\\n return target - res\",\n \"runtime\": \"359\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n lowest = 10000*500\\n closest = 0\\n for i in range(len(nums) - 2):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n left = i+1\\n right = len(nums) -1\\n while left<right:\\n currentSum = nums[i] + nums[left] + nums[right]\\n difference = abs(currentSum-target)\\n if difference < lowest:\\n lowest = difference\\n closest = currentSum\\n if currentSum == target:\\n return currentSum\\n elif currentSum > target:\\n right -= 1\\n else:\\n left += 1\\n return closest\",\n \"runtime\": \"369\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n closest = 2147483647\\n for i in range(len(nums)-2):\\n l = i + 1\\n r = len(nums)-1\\n while(l<r):\\n summ = nums[i] + nums[l] + nums[r]\\n if target == summ:\\n return summ\\n if (summ < target):\\n if (target - summ < abs(target - closest)):\\n closest = summ\\n l += 1\\n else:\\n if (summ - target < abs(target - closest)):\\n closest = summ\\n r -= 1\\n return closest\",\n \"runtime\": \"369\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n minimum=990099 \\n for i in range(0,len(nums)-2):\\n j=i+1\\n k=len(nums)-1\\n while(j<k):\\n sum=nums[i]+nums[j]+nums[k]\\n if((abs(target-sum)<minimum)):\\n minimum = abs(target-sum)\\n closest=sum\\n if(sum<target):\\n j+=1\\n else:\\n k-=1\\n return closest\",\n \"runtime\": \"379\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n min_dist = -1\\n best_sum3 = 0\\n for i, n1 in enumerate(nums[:-2]):\\n if i > 0 and n1 == nums[i-1]:\\n continue\\n j = i + 1\\n k = len(nums) - 1\\n while j < k:\\n sum3 = n1 + nums[j] + nums[k]\\n dist = target - sum3\\n if dist == 0:\\n return sum3\\n if min_dist < 0 or abs(dist) < min_dist:\\n best_sum3 = sum3\\n min_dist = abs(dist)\\n if dist > 0:\\n j += 1\\n else:\\n k -= 1\\n return best_sum3\\n\",\n \"runtime\": \"379\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n n = len(nums)\\n if n < 3:\\n return 0\\n \\n curr_sum = 0\\n diff,ans = float('inf'), 0\\n nums.sort()\\n for i in range(n-2):\\n left = i+1\\n right = n-1\\n while left < right:\\n curr_sum += nums[left] + nums[i] + nums[right]\\n if curr_sum == target:\\n return curr_sum\\n \\n elif abs(target- curr_sum) < diff:\\n diff = abs(target- curr_sum) \\n ans = curr_sum\\n if curr_sum > target:\\n right -= 1\\n elif curr_sum < target:\\n left += 1\\n \\n curr_sum = 0\\n return ans\\n\\n \",\n \"runtime\": \"389\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n closest_sum = float('inf')\\n\\n for i, a in enumerate(nums):\\n if i > 0 and a == nums[i - 1]:\\n continue\\n \\n l, r = i + 1, len(nums) - 1\\n while l < r:\\n threeSum = a + nums[l] + nums[r]\\n if abs(threeSum - target) < abs(closest_sum - target):\\n closest_sum = threeSum\\n if threeSum < target:\\n l += 1\\n elif threeSum > target:\\n r -= 1\\n else:\\n return threeSum \\n return closest_sum\",\n \"runtime\": \"389\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: list[int], target: int) -> int:\\n nums.sort()\\n\\n closest = sum(nums[:3])\\n for first in range(len(nums) - 2):\\n # Мы уже рассмотрели этот кейс на предыдущем шаге\\n if first > 0 and nums[first] == nums[first - 1]:\\n continue\\n\\n second = first + 1\\n third = len(nums) - 1\\n while second < third:\\n sm = nums[first] + nums[second] + nums[third]\\n\\n if sm == target:\\n return target\\n\\n if abs(sm - target) < abs(closest - target):\\n closest = sm\\n\\n if sm > target:\\n third -= 1\\n else:\\n second += 1\\n\\n return closest\",\n \"runtime\": \"419\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n # Attempting to adapt the 3-sum to 0 solution to work for this\\n nums.sort()\\n last_sum = math.inf\\n\\n for i in range(len(nums)):\\n\\n left = i + 1\\n right = len(nums) - 1\\n\\n while left < right:\\n\\n curr_sum = nums[i] + nums[left] + nums[right]\\n curr_diff = abs(curr_sum - target)\\n\\n if curr_diff < abs(last_sum - target):\\n last_sum = curr_sum\\n\\n if curr_sum < target:\\n left += 1\\n elif curr_sum > target:\\n right -= 1\\n else:\\n return curr_sum\\n \\n\\n return last_sum\\n\",\n \"runtime\": \"419\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n nums = sorted(nums)\\n closest = float(\\\"inf\\\")\\n for i in range(len(nums)):\\n\\n p1 = i + 1\\n p2 = len(nums) - 1\\n\\n while p1 < p2:\\n current = nums[i] + nums[p1] + nums[p2]\\n\\n if abs(current - target) < abs(closest - target):\\n closest = current\\n\\n if current == target:\\n return current\\n\\n elif current < target:\\n p1 = p1 + 1\\n\\n else:\\n p2 = p2 - 1\\n\\n return closest\\n\",\n \"runtime\": \"429\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort() \\n n = len(nums) \\n closest_sum = float(\\\"inf\\\") \\n\\n for i in range(n):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n \\n lo,hi = i+1 ,n-1\\n while lo < hi:\\n cur_sum = nums[i] + nums[lo] + nums[hi]\\n\\n if abs(cur_sum - target) < abs(closest_sum - target):\\n closest_sum = cur_sum \\n \\n if cur_sum == target:\\n return cur_sum\\n elif cur_sum < target:\\n lo +=1\\n else:\\n hi -=1\\n return closest_sum\",\n \"runtime\": \"429\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n # Attempting to adapt the 3-sum to 0 solution to work for this\\n nums.sort()\\n last_sum = math.inf\\n\\n for i in range(len(nums)):\\n\\n left = i + 1\\n right = len(nums) - 1\\n\\n while left < right:\\n\\n curr_sum = nums[i] + nums[left] + nums[right]\\n curr_diff = abs(curr_sum - target)\\n if curr_sum == target:\\n return curr_sum\\n elif curr_diff < abs(last_sum - target):\\n last_sum = curr_sum\\n\\n if curr_sum < target:\\n left += 1\\n elif curr_sum > target:\\n right -= 1\\n \\n\\n return last_sum\\n\",\n \"runtime\": \"439\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n closest_sum = float('inf')\\n for i in range(len(nums) - 2):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n start, end = i + 1, len(nums) - 1\\n while start < end:\\n current_sum = nums[i] + nums[start] + nums[end]\\n if abs(current_sum - target) < abs(closest_sum - target):\\n closest_sum = current_sum\\n if current_sum < target:\\n start += 1\\n elif current_sum > target:\\n end -= 1\\n else:\\n return current_sum\\n \\n return closest_sum\",\n \"runtime\": \"439\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums, target):\\n nums.sort()\\n result = float('inf')\\n \\n for i in range(len(nums) - 2):\\n start = i + 1\\n end = len(nums) - 1\\n \\n while start < end:\\n current_sum = nums[i] + nums[start] + nums[end]\\n \\n if current_sum < target:\\n start += 1\\n else:\\n end -= 1\\n\\n if abs(current_sum - target) < abs(result - target):\\n result = current_sum\\n \\n return result\",\n \"runtime\": \"449\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n res = nums[0] + nums[1] + nums[2]\\n for i in range(len(nums)):\\n l = i + 1\\n r = len(nums) - 1\\n while l < r:\\n total = nums[i] + nums[l] + nums[r]\\n if total > target:\\n r -= 1\\n else:\\n l += 1\\n if abs(total - target) < abs(res - target):\\n res = total\\n return res\",\n \"runtime\": \"449\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n res=sum(nums[:3])\\n for i in range(len(nums)-1):\\n l=i+1\\n r=len(nums)-1\\n while(l<r):\\n total=nums[l]+nums[i]+nums[r]\\n if abs(total-target) <abs(res-target):\\n res=total\\n if total<target:\\n l+=1\\n else:\\n r-=1\\n return res\",\n \"runtime\": \"459\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n length=len(nums)\\n closet_sum=nums[0]+nums[1]+nums[length-1]\\n for i in range(length-2):\\n j=i+1\\n k=length-1\\n while (j<=length-1 and j<k):\\n sum=nums[i]+nums[j]+nums[k]\\n if sum==target:\\n return target\\n elif sum<target:\\n j=j+1\\n elif sum>target:\\n k=k-1\\n if abs(sum-target)<abs(closet_sum-target):\\n closet_sum=sum\\n return closet_sum\",\n \"runtime\": \"459\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, arr: List[int], target_sum: int) -> int:\\n\\n arr = sorted(arr) \\n smallestDiff = float('inf') \\n\\n for i in range(len(arr)): \\n\\n # initialize the two pointers \\n left, right = i + 1, len(arr)-1 \\n\\n while left < right: \\n\\n # difference of the current triplet from target sum \\n diff = target_sum - arr[i] - arr[left] - arr[right]\\n\\n # sum of triplet equals the target sum \\n if diff == 0:\\n return target_sum\\n \\n # got more close to the target sum\\n # if at same distance from target sum, set min value (diff > smallestDiff when sum of triplets is smaller than target sum ) \\n if abs(diff) < abs(smallestDiff) or (abs(diff) == abs(smallestDiff) and diff > smallestDiff): \\n smallestDiff = diff\\n\\n if diff > 0: \\n left += 1 \\n else: \\n right -= 1 \\n\\n return target_sum - smallestDiff\\n\",\n \"runtime\": \"469\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n length=len(nums)\\n closet_sum=nums[0]+nums[1]+nums[length-1]\\n for i in range(length-2):\\n j=i+1\\n k=length-1\\n while (j<=length-1 and j<k):\\n sum=nums[i]+nums[j]+nums[k]\\n t=abs(closet_sum-target)\\n if sum==target:\\n return target\\n elif sum<target:\\n j=j+1\\n elif sum>target:\\n k=k-1\\n if abs(sum-target)<t:\\n closet_sum=sum\\n return closet_sum\",\n \"runtime\": \"469\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n res=sum(nums[:3])\\n for i in range(len(nums)-1):\\n l=i+1\\n r=len(nums)-1\\n while(l<r):\\n total=nums[l]+nums[i]+nums[r]\\n if abs(total-target) <abs(res-target):\\n res=total\\n if total<target:\\n l+=1\\n else:\\n r-=1\\n return res\",\n \"runtime\": \"479\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n curr_minimal_diff_sum = float(\\\"inf\\\")\\n\\n # two closest\\n def two_sum_closest(curr_index: int):\\n nonlocal nums\\n nonlocal target\\n nonlocal curr_minimal_diff_sum\\n left, right = curr_index + 1, len(nums) - 1\\n\\n while left < right:\\n curr_sum = nums[left] + nums[right] + nums[curr_index]\\n if curr_sum == target:\\n curr_minimal_diff_sum = 0\\n return\\n else:\\n curr_diff = target - curr_sum\\n if abs(curr_diff) < abs(curr_minimal_diff_sum):\\n curr_minimal_diff_sum = curr_diff\\n\\n if curr_sum < target:\\n left += 1\\n else: # curr_sum > target\\n right -= 1\\n\\n for complement_index in range(0, len(nums) - 2):\\n two_sum_closest(complement_index)\\n \\n return target - curr_minimal_diff_sum\\n\",\n \"runtime\": \"479\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n n = len(nums)\\n closest = nums[0] + nums[1] + nums[2]\\n for k in range(n-2):\\n i = k+1\\n j = n-1\\n new_target = target - nums[k]\\n while i < j:\\n if abs(nums[i] + nums[j] + nums[k] - target) < abs(closest - target):\\n closest = nums[i] + nums[j] + nums[k]\\n if nums[i] + nums[j] > new_target:\\n j -= 1\\n elif nums[i] + nums[j] < new_target:\\n i += 1\\n else:\\n return target\\n return closest\\n \\n\",\n \"runtime\": \"489\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n minsum = abs(nums[0]+nums[1]+nums[2]-target)\\n sumnum = nums[0]+nums[1]+nums[2]\\n for i in range(len(nums)-2):\\n left = i+1\\n right = len(nums)-1\\n while left<right:\\n if abs(nums[i]+nums[left]+nums[right]-target)< minsum:\\n minsum = abs(nums[i]+nums[left]+nums[right]-target)\\n sumnum = nums[i]+nums[left]+nums[right]\\n if nums[i]+nums[left]+nums[right]>=target:\\n right-=1\\n else:\\n left+=1\\n return sumnum\",\n \"runtime\": \"489\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n nums.sort()\\n res = nums[0] + nums[1] + nums[2]\\n \\n def compareDiff(num, res):\\n if abs(target - num) < abs(target - res):\\n return num\\n return res\\n\\n\\n for i, a in enumerate(nums):\\n\\n l, r = i + 1, len(nums) - 1\\n while l < r:\\n three_sum = a + nums[l] + nums[r]\\n res = compareDiff(three_sum, res)\\n\\n if three_sum > target:\\n r -= 1\\n elif three_sum < target:\\n l += 1\\n else:\\n return three_sum\\n \\n return res\",\n \"runtime\": \"499\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n N = len(nums)\\n ans = []\\n \\n m = float('inf')\\n s = float(\\\"inf\\\")\\n \\n for x in range(N):\\n if x>0 and nums[x]==nums[x-1]:\\n continue\\n \\n elem = nums[x]\\n l = x+1\\n r = N-1\\n \\n while l<r:\\n if abs(nums[l]+nums[r]+elem-target)<m:\\n m = abs(nums[l]+nums[r]+elem-target)\\n s = nums[l]+nums[r]+elem \\n if nums[l]+nums[r]+elem>target:\\n r-=1\\n elif nums[l]+nums[r]+elem<target:\\n l+=1\\n else:\\n l+=1\\n r-=1\\n return s\\n \",\n \"runtime\": \"499\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, n: List[int], t: int) -> int:\\n n.sort()\\n c = sum(n[:3])\\n\\n for i in range(len(n)-2):\\n if i > 0 and n[i] == n[i-1]:\\n continue\\n\\n l, r = i+1, len(n)-1\\n\\n while l < r:\\n s = n[i] + n[l] + n[r]\\n\\n if s == t:\\n return s\\n\\n if abs(t - s) < abs(t - c):\\n c = s\\n\\n if s < t:\\n l+=1\\n while l < r and n[l] == n[l - 1]:\\n l += 1\\n else:\\n r-=1\\n while l < r and n[r] == n[r + 1]:\\n r -= 1\\n\\n return c\",\n \"runtime\": \"509\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n ans = nums[0] + nums[1] + nums[2]\\n for i in range(0, len(nums)):\\n sum = target - nums[i]\\n j = i+1\\n k = len(nums)-1\\n if j < k:\\n temp = nums[j]+nums[k]\\n else:\\n continue\\n while j<k:\\n if abs(sum-nums[j]-nums[k]) < abs(sum-temp):\\n temp = nums[j] + nums[k]\\n if nums[j] + nums[k] < sum:\\n j = j + 1\\n elif nums[j] + nums[k] > sum:\\n k = k - 1\\n else:\\n return target\\n if abs(target-temp-nums[i]) < abs(target-ans):\\n ans = temp + nums[i]\\n return ans\\n\\n # 1 6 7 9 10 100 110\\n \",\n \"runtime\": \"509\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n res =[]\\n n = len(nums)\\n\\n for i in range(n-2):\\n j=i+1\\n k=n-1\\n print(i,j,k)\\n if i>0 and nums[i]==nums[i-1]:\\n continue\\n while j<k:\\n sum = nums[i] + nums[j] + nums[k]\\n #print(sum,i,j,k)\\n if sum == target:\\n #pass\\n #return 0\\n return target\\n elif sum < target:\\n j+=1\\n res.append(sum)\\n elif sum > target:\\n k-=1\\n res.append(sum)\\n elif j>n or k<0:\\n break\\n res2={}\\n for e in res:\\n res2[e]=abs(e-target)\\n return min(res2,key=lambda k:res2[k])\\n #return 2\",\n \"runtime\": \"519\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int: \\n n=len(nums)\\n closest_sum = float('inf') \\n nums.sort()\\n for i in range(n-2):\\n l=i+1\\n r=n-1\\n while l<r:\\n curr_sum=nums[i]+nums[l]+nums[r] \\n if sum==target:\\n return curr_sum\\n if abs(curr_sum - target) < abs(closest_sum - target):\\n closest_sum = curr_sum\\n if curr_sum<target:\\n l+=1\\n else:\\n r-=1\\n return closest_sum\",\n \"runtime\": \"519\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, n: List[int], t: int) -> int:\\n n.sort()\\n c = sum(n[:3])\\n\\n for i in range(len(n)-2):\\n if i > 0 and n[i] == n[i-1]:\\n continue\\n\\n l, r = i+1, len(n)-1\\n\\n while l < r:\\n s = n[i] + n[l] + n[r]\\n\\n if s == t:\\n return s\\n\\n if abs(t - s) < abs(t - c):\\n c = s\\n\\n if s < t:\\n l+=1\\n while l < r and n[l] == n[l - 1]:\\n l += 1\\n else:\\n r-=1\\n while l < r and n[r] == n[r + 1]:\\n r -= 1\\n\\n return c\",\n \"runtime\": \"529\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n min_dif = float(\\\"inf\\\")\\n\\n nums.sort()\\n\\n i = 0\\n while i < len(nums)-1:\\n\\n n = nums[i]\\n\\n lo, hi = i+1, len(nums)-1\\n\\n while lo < hi:\\n n_lo, n_hi = nums[lo], nums[hi]\\n\\n s = n_lo + n_hi + n\\n\\n if abs(target-s) < abs(min_dif):\\n min_dif = target-s\\n\\n if s < target:\\n while lo < hi and n_lo == nums[lo]: lo+=1\\n elif s > target:\\n while hi > lo and n_hi == nums[hi]: hi-=1\\n else:\\n break\\n\\n while i < len(nums)-1 and nums[i] == n: i+=1\\n \\n return target - min_dif\\n\\n\\n\\n \",\n \"runtime\": \"529\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums = sorted(nums)\\n i = 0\\n closest = float('INF')\\n sol = 0\\n while i < len(nums) - 2:\\n low = i + 1\\n high = len(nums) - 1\\n while low < high:\\n current_sum = sum([nums[i], nums[low], nums[high]])\\n if abs(target - current_sum) < closest:\\n sol = current_sum\\n closest = abs(target - sol)\\n if current_sum < target:\\n low += 1\\n elif current_sum > target:\\n high -= 1\\n else:\\n return current_sum\\n i += 1\\n return sol\\n\\n\",\n \"runtime\": \"539\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n resultNum = nums[0] + nums[1] + nums[-1]\\n nums.sort()\\n \\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i-1]: continue\\n\\n j, k = i+1, len(nums)-1\\n\\n while j < k:\\n total = nums[i] + nums[j] + nums[k]\\n if abs(target - total) <= abs(target - resultNum): \\n resultNum = total\\n \\n if total > target:\\n k -= 1\\n while j < k and nums[k] == nums[k+1]: k -= 1\\n else: \\n j += 1\\n while j < k and nums[j] == nums[j-1]: j += 1\\n \\n return resultNum\\n \",\n \"runtime\": \"539\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n n = len(nums)\\n best = 200001 # Value > (max - min) > (10000 - -10000)\\n\\n for i in range(0, n):\\n # Skip duplicates\\n if i != 0 and nums[i] == nums[i-1]:\\n continue\\n\\n j, k = i+1, n-1\\n while j < k:\\n sum2 = nums[j] + nums[k]\\n sum3 = sum2 + nums[i]\\n if abs(target - best) > abs(target - sum3):\\n best = sum3\\n if best == target:\\n break\\n if sum3 > target:\\n k = k - 1\\n while j < k and nums[k] == nums[k+1]: k = k - 1\\n else:\\n j = j + 1\\n while j < k and nums[j] == nums[j-1] : j = j + 1\\n \\n return best\\n\\n\\n def threeSum(self, nums: List[int]) -> List[List[int]]:\\n '''\\n Sort. Two sum becomes O(n)\\n For each i in nums, find two sum in i+1 - n-1.\\n Time = O(n^2) worst case.\\n Space = O(n) // For result set, result list, in-place sort\\n '''\\n nums.sort()\\n soln = set()\\n n, target, m = len(nums), 0, 3\\n\\n for i in range(0, n):\\n if i != 0 and nums[i] == nums[i-1]:\\n continue\\n j, k = i + 1, n - 1\\n while j < k:\\n sum2 = nums[i] + nums[j] + nums[k]\\n if sum2 == target:\\n soln.add((nums[i], nums[j], nums[k]))\\n j = j + 1\\n k = k - 1\\n elif sum2 < target:\\n j = j + 1\\n # Skip duplicates\\n while (j < k) and nums[j] == nums[j-1]: j = j + 1\\n else:\\n k = k - 1\\n # Skip duplicates\\n while (j < k) and nums[k] == nums[k+1]: k = k - 1\\n\\n res = [[x,y,z] for (x,y,z) in soln]\\n return res\",\n \"runtime\": \"549\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n closest_sum = math.inf\\n for i in range(len(nums)-2):\\n complement = target - nums[i]\\n j = i+1\\n k = len(nums)-1\\n while k>j:\\n total = nums[i]+nums[j]+nums[k]\\n if abs(total-target) < abs(closest_sum-target):\\n closest_sum = total\\n\\n if nums[j] + nums[k] == complement:\\n return target\\n elif nums[j] + nums[k] < complement:\\n j += 1\\n else:\\n k -= 1\\n \\n\\n return closest_sum\\n\\n\",\n \"runtime\": \"549\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n nums.sort()\\n closest = None\\n \\n if len(nums) < 3:\\n return -1\\n\\n for i in range (len(nums) - 2):\\n \\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n\\n left, right = i + 1, len(nums) - 1\\n\\n while left < right:\\n\\n total = nums[i] + nums[left] + nums[right]\\n\\n if closest == None:\\n closest = total\\n\\n if total < target:\\n if abs(target - total) < abs(target - closest):\\n closest = total\\n elif abs(target - total) == abs(target - closest):\\n if closest <= total:\\n closest = total\\n left += 1\\n\\n elif total > target:\\n if abs(total - target) < abs(closest - target):\\n closest = total\\n elif abs(target - total) == abs(target - closest):\\n if closest <= total:\\n closest = total\\n right -= 1\\n\\n else:\\n return total\\n\\n return closest\\n\\n \",\n \"runtime\": \"559\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n closest = float('-inf')\\n nums.sort()\\n\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n \\n j = i + 1\\n k = len(nums) - 1\\n\\n # if nums[i] >= target:\\n # break\\n\\n while j < k:\\n total = nums[i] + nums[j] + nums[k]\\n\\n if abs(target - total) < abs(target - closest):\\n closest = total\\n \\n if target - total == 0:\\n return closest\\n elif target - total < 0:\\n k -= 1\\n\\n while k > j and nums[k] == nums[k + 1]:\\n k -= 1\\n else:\\n j += 1\\n\\n while j < k and nums[j] == nums[j-1]:\\n j += 1\\n \\n return closest\\n \",\n \"runtime\": \"559\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n\\n idx = 0\\n minDiff = float('inf')\\n closest = 0\\n while idx < len(nums) - 2:\\n if idx > 0 and nums[idx] == nums[idx - 1]:\\n idx += 1\\n continue\\n\\n st, ed = idx + 1, len(nums) - 1\\n while st < ed:\\n if st - 1 > idx and nums[st] == nums[st - 1]:\\n st += 1\\n continue\\n if ed + 1 < len(nums) and nums[ed] == nums[ed + 1]:\\n ed -= 1\\n continue\\n\\n rem = target - nums[idx]\\n sum2 = nums[st] + nums[ed]\\n if sum2 == rem:\\n return target\\n else:\\n diff = abs(sum2 - rem)\\n if diff < minDiff:\\n minDiff = diff\\n closest = sum2 + nums[idx]\\n if sum2 > rem:\\n ed -= 1\\n else:\\n st += 1\\n idx += 1\\n\\n return closest\",\n \"runtime\": \"569\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n # sum is closest to target \\n\\n # that means you try and creaet a sliding window idea => two pointer understanding \\n\\n nums.sort()\\n n = len(nums)\\n\\n diff = 10**8 \\n\\n for i in range(n):\\n\\n j , k = i + 1 , n - 1\\n\\n while j < k: \\n\\n if abs(target - nums[i] - nums[j] - nums[k]) < diff: \\n diff = abs(target - nums[i] - nums[j] - nums[k])\\n res = nums[i] + nums[j] + nums[k]\\n\\n \\n if nums[i] + nums[j] + nums[k] == target: \\n return target\\n # you have to move according to the limiting factor \\n elif nums[i] + nums[j] + nums[k] > target: \\n k -= 1 \\n else:\\n j += 1\\n \\n return res\\n\\n\\n\\n\\n\\n\\n \\n\\n \",\n \"runtime\": \"569\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: list[int], target: int) -> int:\\n nums.sort()\\n globalClosest = 9e99\\n exactFlag = False\\n for i, val in enumerate(nums[:-2:]):\\n if not exactFlag:\\n iterClosest = self.helper(nums[i + 1 : :], target, val)\\n exactFlag = iterClosest == target\\n if abs(globalClosest - target) > abs(iterClosest - target):\\n globalClosest = iterClosest\\n else:\\n return globalClosest\\n return globalClosest\\n\\n def helper(self, digits, target, val):\\n left, right = 0, len(digits) - 1\\n closest = digits[left] + digits[right] + val\\n while left < right:\\n if abs((target - digits[left] - digits[right] - val)) < abs(\\n target - closest\\n ):\\n closest = digits[left] + digits[right] + val\\n if digits[left] + digits[right] + val < target:\\n left += 1\\n else:\\n right -= 1\\n return closest\",\n \"runtime\": \"579\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n res = sum(nums[:3])\\n n = len(nums)\\n for i in range(n-2):\\n if i and nums[i] == nums[i-1]: continue\\n j = i + 1\\n k = n -1\\n while j < k:\\n if j > i + 1 and nums[j] == nums[j-1]: \\n j += 1\\n continue\\n if k < n - 1 and nums[k] == nums[k+1]:\\n k -= 1\\n continue\\n triplet = nums[i] + nums[j] + nums[k]\\n if abs(target-triplet) < abs(target-res):\\n res = triplet\\n if triplet < target:\\n j += 1\\n elif triplet > target:\\n k -= 1\\n else:\\n return triplet\\n return res\\n\",\n \"runtime\": \"579\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n closest_sum = float('inf')\\n for i in range(len(nums)-2):\\n left, right = i+1, len(nums)-1\\n while left < right:\\n current_sum = sum([nums[i], nums[left], nums[right]])\\n if abs(current_sum - target)<abs(closest_sum-target):\\n closest_sum = current_sum\\n if current_sum<target:\\n left+=1\\n elif current_sum >target:\\n right-=1\\n else:\\n return current_sum\\n return closest_sum\\n\\n \",\n \"runtime\": \"589\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n ans = nums[0]+nums[1]+nums[2]\\n for i in range(len(nums)-2):\\n j = i+1\\n k = len(nums)-1\\n while(j<k):\\n if(abs(ans-target)>abs(nums[i]+nums[j]+nums[k]-target)):\\n ans = nums[i]+nums[j]+nums[k]\\n if(nums[i]+nums[j]+nums[k]>target):\\n k-=1\\n else:\\n j+=1\\n return ans\",\n \"runtime\": \"589\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n mini=nums[0]+nums[1]+nums[2]\\n for i in range(len(nums)-2):\\n left=i+1\\n right=len(nums)-1\\n while left<right:\\n if nums[i]+nums[left]+nums[right]==target:\\n return target\\n if abs(nums[i]+nums[left]+nums[right]-target)<abs(mini-target):\\n mini=nums[i]+nums[left]+nums[right]\\n if nums[i]+nums[left]+nums[right]<target:\\n left+=1\\n else :\\n right-=1\\n return mini\\n \\n\",\n \"runtime\": \"599\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n total = sum(nums[:3])\\n closest = abs(target - total)\\n\\n for i in range(len(nums) - 2):\\n l = i + 1 #left \\n r = len(nums) - 1\\n x1 = nums[i]\\n # find x1 + nums[l] + nums[r] closest to target\\n diff = abs(target - (nums[i] + nums[l] + nums[r]))\\n while l < r:\\n sum_of_3 = nums[i] + nums[l] + nums[r]\\n if abs(target - sum_of_3) > diff:\\n break\\n\\n if abs(target - sum_of_3) < closest:\\n closest = abs(target - sum_of_3)\\n total = sum_of_3 \\n\\n if sum_of_3 > target:\\n r -= 1\\n elif sum_of_3 < target:\\n l += 1\\n else:\\n return sum_of_3\\n diff = abs(target - (nums[i] + nums[l] + nums[r]))\\n\\n return total\\n\\n\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"599\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums = sorted(nums)\\n best = sum(nums[:3])\\n for i in range(len(nums)):\\n k = len(nums)-1\\n for j in range(i+1, len(nums)-1):\\n if j >= k:\\n break\\n missing = target - nums[i] - nums[j]\\n while k > j+1 and nums[k] >= missing:\\n k -= 1\\n if len(nums) > k+1:\\n s2 = nums[i] + nums[j] + nums[k+1]\\n if abs(s2-target) < abs(best-target):\\n best = s2\\n\\n s1 = nums[i] + nums[j] + nums[k]\\n\\n if abs(s1-target) < abs(best-target):\\n best = s1\\n\\n\\n\\n return best\",\n \"runtime\": \"609\"\n },\n {\n \"code\": \"# [-1,2,1,-4]\\n# [-4,-1,1,2] 1\\n\\nclass Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n current_smallest_sum = float('inf')\\n\\n # iterate through the sorted array and fix one element at a time\\n # call a helper function that will look at each possible two other elements and do a comparison\\n # if Abs(target - sumOfThreeNumbers) < current_smallest_sum then current_smallest_sum = sumOfThreeNumbers\\n # else if its larger then we bring the right pointer down one, if its smaller we bring the left pointer up one\\n\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n\\n current_smallest_sum = self.twoSum(target, nums, i, current_smallest_sum)\\n \\n return current_smallest_sum\\n\\n def twoSum(self, target, nums, i, current_smallest_sum):\\n right = len(nums) - 1\\n left = i + 1\\n\\n while left < right:\\n temp_sum = nums[left] + nums[right] + nums[i]\\n diff = abs(target - temp_sum)\\n\\n if diff < abs(target - current_smallest_sum):\\n current_smallest_sum = temp_sum\\n \\n if target - temp_sum >= 0:\\n left += 1\\n while left < right and nums[left] == nums[left - 1]:\\n left += 1\\n else:\\n right -= 1\\n while left < right and nums[right] == nums[right + 1]:\\n right -= 1\\n\\n \\n \\n return current_smallest_sum\\n\\n\\n \\n\",\n \"runtime\": \"609\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n \\n if len(nums) == 3:\\n return sum(nums)\\n \\n \\n nums = sorted(nums)\\n \\n final = float('inf')\\n \\n for i in range(len(nums) - 2):\\n \\n left, right = i + 1, len(nums) - 1\\n \\n while left < right:\\n \\n if left > i + 1 and nums[left] == nums[left - 1]:\\n left += 1\\n continue\\n \\n if right < len(nums) - 1 and nums[right] == nums[right + 1]:\\n right -= 1\\n continue\\n \\n cur_sum = nums[i] + nums[left] + nums[right]\\n \\n if cur_sum == target:\\n return target\\n \\n if abs(cur_sum - target) < abs(final - target):\\n final = cur_sum\\n \\n if cur_sum < target:\\n left += 1\\n \\n else:\\n right -= 1\\n \\n return final\",\n \"runtime\": \"619\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums = sorted(nums)\\n best = sum(nums[:3])\\n for i in range(len(nums)):\\n k = len(nums)-1\\n for j in range(i+1, len(nums)-1):\\n\\n missing = target - nums[i] - nums[j]\\n while k > j and nums[k] >= missing:\\n s2 = nums[i] + nums[j] + nums[k]\\n if abs(s2-target) < abs(best-target):\\n best = s2\\n k -= 1\\n\\n if k > j:\\n s2 = nums[i] + nums[j] + nums[k]\\n if abs(s2-target) < abs(best-target):\\n best = s2\\n\\n\\n\\n return best\",\n \"runtime\": \"619\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n #two pointer\\n # nums.sort()\\n # n = len(nums)\\n # diff = float('inf')\\n\\n # for i in range(n):\\n # left, right = i+1, n-1\\n # while left < right:\\n # sum = nums[i] + nums[left] + nums[right]\\n\\n # if abs(target - sum) < abs(diff):\\n # diff = target - sum\\n # if sum < target:\\n # left += 1\\n # else:\\n # right -= 1\\n\\n # if diff == 0:\\n # break\\n \\n # return target - diff\\n\\n #binary search\\n nums.sort()\\n n = len(nums)\\n diff = float('inf')\\n\\n for i in range(n):\\n for j in range(i+1, n):\\n complement = target - nums[i] - nums[j]\\n right = bisect_right(nums, complement, j+1)\\n left = right - 1\\n\\n if right < n and abs(complement - nums[right]) < abs(diff):\\n diff = complement - nums[right]\\n if left > j and abs(complement - nums[left]) < abs(diff):\\n diff = complement - nums[left]\\n\\n if diff == 0:\\n break\\n\\n return target - diff \\n\",\n \"runtime\": \"629\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n \\n closestSum = 100000\\n for i in range(len(nums)):\\n j = i + 1\\n k = len(nums) - 1\\n prevErr = 100000\\n\\n while j < k:\\n curErr = nums[i] + nums[j] + nums[k] - target\\n if prevErr > 0 and curErr > prevErr or prevErr < 0 and curErr < prevErr:\\n break \\n\\n if abs(curErr) < abs(closestSum - target):\\n closestSum = nums[i] + nums[j] + nums[k]\\n \\n if nums[i] + nums[j] + nums[k] > target:\\n k -= 1\\n else:\\n j += 1\\n \\n prevErr = curErr\\n \\n # early termination\\n if target > 0 and nums[i] > target//3+1:\\n break\\n\\n return closestSum\",\n \"runtime\": \"629\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums = sorted(nums)\\n res = float('inf')\\n ans = 0\\n print(nums)\\n for i in range(len(nums)):\\n left = i+1 \\n right = len(nums)-1 \\n while left< right:\\n cur = nums[i]+ nums[left]+ nums[right]\\n # print(i, left, right, cur)\\n if cur == target:\\n return cur\\n if cur < target:\\n left +=1 \\n else:\\n right -=1 \\n \\n # if left>i+1 and left<right and nums[left] == nums[left-1]:\\n # left+=1\\n # continue \\n \\n res = min(res, abs(cur-target))\\n \\n if abs(cur-target) == res:\\n ans = cur\\n # print(ans)\\n \\n return ans\\n \\n \",\n \"runtime\": \"639\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n #two pointer\\n # nums.sort()\\n # n = len(nums)\\n # diff = float('inf')\\n\\n # for i in range(n-2):\\n # left, right = i+1, n-1\\n # while left < right:\\n # sum = nums[i] + nums[right] + nums[left]\\n # if abs(target-sum) < abs(diff):\\n # diff = target - sum\\n\\n # if sum < target:\\n # left += 1\\n # else:\\n # right -= 1\\n\\n # if diff == 0:\\n # break\\n\\n # return target - diff\\n\\n #binary search\\n nums.sort()\\n n = len(nums)\\n diff = float('inf')\\n\\n for i in range(n-1):\\n for j in range(i+1, n):\\n complement = target - nums[i] - nums[j]\\n right = bisect_right(nums, complement, j+1)\\n left = right-1\\n\\n if right < n and abs(complement - nums[right]) < abs(diff):\\n diff = complement - nums[right]\\n if left > j and abs(complement - nums[left]) < abs(diff):\\n diff = complement - nums[left]\\n \\n if diff == 0:\\n break\\n \\n return target - diff\",\n \"runtime\": \"639\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n closest = 100000\\n summed = 100000\\n elements= []\\n for i in range(len(nums)):\\n j = i + 1\\n k = len(nums) - 1\\n if(i==k):\\n break\\n while(j!=k):\\n if nums[i] + nums[j] + nums[k] == target:\\n closest = 0\\n j = j + 1\\n return target\\n elif nums[i] + nums[j] + nums[k] > target:\\n if abs(target - (nums[i] + nums[j] + nums[k])) < closest:\\n closest = abs(target - (nums[i] + nums[j] + nums[k]))\\n summed = nums[i] + nums[j] + nums[k]\\n k = k - 1\\n elif nums[i] + nums[j] + nums[k] < target:\\n if abs(target - (nums[i] + nums[j] + nums[k])) < closest:\\n closest = abs(target - (nums[i] + nums[j] + nums[k]))\\n summed = nums[i] + nums[j] + nums[k]\\n j = j + 1\\n return summed\\n \",\n \"runtime\": \"649\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n minDist = 10**5\\n ans = -1\\n n = len(nums) - 1\\n for i,num in enumerate(nums[:n]):\\n l = i + 1\\n r = len(nums) - 1\\n \\n while (l < r):\\n cSum = nums[i] + nums[l] + nums[r]\\n if (cSum == target):\\n return target\\n if (abs(cSum - target) < minDist):\\n minDist = abs(cSum - target)\\n ans = cSum\\n minDist = min(minDist,abs(cSum - target))\\n if cSum > target :\\n r -= 1\\n else :\\n l += 1\\n return ans\",\n \"runtime\": \"649\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n res = float('inf')\\n nums.sort()\\n result=0\\n for x in range(len(nums)-2):\\n left=x+1\\n right=len(nums)-1\\n while left<right:\\n s = sum([nums[x], nums[left], nums[right]])\\n if s<target:\\n if res>abs(target-s):\\n res = abs(target-s)\\n result=s\\n while left<right and nums[left]==nums[left+1]:\\n left+=1\\n left+=1\\n elif s>target:\\n if res>abs(target-s):\\n res = abs(target-s)\\n result=s\\n while left<right and nums[right]==nums[right-1]:\\n right-=1\\n right-=1\\n else:\\n return target\\n return result\",\n \"runtime\": \"659\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n n = len(nums)\\n nums.sort()\\n diff = 99999\\n finalSum = 0\\n for i in range(n-2):\\n j = i + 1\\n k = n - 1\\n while(j < k):\\n sum = nums[i] + nums[j] + nums[k]\\n diff = min(diff, abs(target - sum))\\n if diff == abs(target - sum):\\n finalSum = sum\\n if sum == target:\\n return finalSum\\n elif sum < target:\\n j += 1\\n else:\\n k -= 1\\n \\n return finalSum\",\n \"runtime\": \"659\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n n = len(nums)\\n ans = -inf\\n val = inf\\n for i in range(n):\\n for j in range(i+1,n-1):\\n goal = target-(nums[i]+nums[j])\\n index = bisect_right(nums,goal,j+1,n)\\n if index<n and nums[index]-goal<val:\\n ans=nums[i]+nums[j]+nums[index]\\n val = nums[index]-goal\\n if index>j+1 and goal-nums[index-1]<val:\\n ans=nums[i]+nums[j]+nums[index-1]\\n val = goal-nums[index-1]\\n return ans\\n \",\n \"runtime\": \"669\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n diff = math.inf \\n n = len(nums)\\n nums.sort()\\n for i in range(n-2):\\n for j in range(i+1, n-1):\\n \\n complement = target - nums[i] - nums[j]\\n hi = bisect_right(nums, complement, j + 1)\\n lo = hi - 1\\n\\n if hi < n and abs(complement - nums[hi]) < abs(diff):\\n diff = complement - nums[hi]\\n \\n if lo > j and abs(complement - nums[lo]) < abs(diff):\\n diff = complement - nums[lo]\\n \\n if diff == 0:\\n break\\n \\n return target - diff\",\n \"runtime\": \"669\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n cur_sum = 0\\n cur_diff = float('inf')\\n\\n def two_sum(numbers, target):\\n l, r = 0, len(numbers) - 1\\n cur_sum = 0\\n cur_diff = float('inf')\\n while l < r:\\n if abs(numbers[l] + numbers[r] - target) < cur_diff:\\n cur_diff = abs(numbers[l] + numbers[r] - target)\\n cur_sum = numbers[l] + numbers[r]\\n if numbers[l] + numbers[r] == target:\\n return numbers[l] + numbers[r]\\n elif numbers[l] + numbers[r] > target:\\n r -= 1\\n else:\\n l += 1\\n return cur_sum\\n\\n for i in range(len(nums) - 2):\\n two = two_sum(nums[i+1:], target - nums[i])\\n if abs(nums[i] + two - target) < cur_diff:\\n cur_sum = nums[i] + two\\n cur_diff = abs(nums[i] + two - target)\\n return cur_sum\",\n \"runtime\": \"679\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n dif = float(\\\"inf\\\")\\n ans = None\\n nums = sorted(nums)\\n\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n l, r = 0 , len(nums)-1\\n while l < r :\\n if i != l and i != r:\\n threeSum = (nums[i] + nums[l] + nums[r])\\n if abs(threeSum-target) < dif:\\n dif = abs(threeSum-target)\\n ans = threeSum\\n if threeSum < target:\\n l += 1\\n elif threeSum > target:\\n r -= 1\\n else:\\n return threeSum\\n else:\\n if i == l:\\n l += 1\\n elif i == r:\\n r -= 1\\n return ans\\n \",\n \"runtime\": \"679\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n if nums is None or len(nums) < 3:\\n return 0\\n nums.sort()\\n diff = float('inf')\\n ret = None\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n if i + 3 > len(nums):\\n break\\n cur_closest_sum = self.twoSumClosest(i+1, nums, target - nums[i])\\n if ret is None or abs(cur_closest_sum+nums[i]-target) < abs(ret-target):\\n ret = cur_closest_sum + nums[i]\\n print(ret, [cur_closest_sum, nums[i]])\\n return ret\\n \\n def twoSumClosest(self, idx, nums, target):\\n l, r = idx, len(nums) - 1\\n print(l, r, [nums[l], nums[r]])\\n closest_summ = nums[l] + nums[r]\\n while l < r:\\n while l > idx and l < r and nums[l] == nums[l-1]:\\n l += 1\\n while r < len(nums)-1 and l < r and nums[r] == nums[r+1]:\\n r -= 1\\n\\n if l < r:\\n summ = nums[l] + nums[r]\\n if summ == target:\\n return summ\\n elif summ < target:\\n closest_summ = summ if abs(summ-target) < abs(closest_summ-target) else closest_summ\\n l += 1\\n else:\\n closest_summ = summ if abs(summ-target) < abs(closest_summ-target) else closest_summ\\n r -= 1\\n\\n return closest_summ\\n\",\n \"runtime\": \"689\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n diff = float(\\\"inf\\\")\\n nums.sort()\\n for i in range(len(nums)):\\n for j in range(i + 1, len(nums)):\\n complement = target - nums[i] - nums[j]\\n hi = bisect_right(nums, complement, j + 1)\\n lo = hi - 1\\n if hi < len(nums) and abs(complement - nums[hi]) < abs(diff):\\n diff = complement - nums[hi]\\n if lo > j and abs(complement - nums[lo]) < abs(diff):\\n diff = complement - nums[lo]\\n if diff == 0:\\n break\\n return target - diff\",\n \"runtime\": \"689\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n diff = float(\\\"inf\\\")\\n nums.sort()\\n for i in range(len(nums)):\\n for j in range(i + 1, len(nums)):\\n complement = target - nums[i] - nums[j]\\n hi = bisect_right(nums, complement, j + 1)\\n lo = hi - 1\\n if hi < len(nums) and abs(complement - nums[hi]) < abs(diff):\\n diff = complement - nums[hi]\\n if lo > j and abs(complement - nums[lo]) < abs(diff):\\n diff = complement - nums[lo]\\n if diff == 0:\\n break\\n return target - diff\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"699\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n total = []\\n for i in range(len(nums)-2):\\n l = i + 1 \\n r = len(nums) - 1\\n while l < r:\\n x = nums[i] + nums[l] + nums[r]\\n total.append(x)\\n if x == target:\\n return target\\n elif x < target:\\n l += 1\\n else:\\n r -= 1\\n d = {}\\n mins = float('inf')\\n for i in total:\\n x = abs(i - target)\\n d[i] = x\\n mins = min(mins,x)\\n for i,j in d.items():\\n if j == mins:\\n return i \\n\\n\",\n \"runtime\": \"699\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n abc = inf\\n for i,num in enumerate(nums):\\n if i>1 and nums[i] == nums[i-1]:\\n continue \\n l,r = i+1,len(nums)-1\\n while l<r:\\n tsum = num + nums[l] + nums[r]\\n if tsum > target:\\n r -=1\\n csum = min(abs(target-abc),abs(tsum-target))\\n if csum == abs(tsum-target):\\n abc = tsum\\n elif tsum < target:\\n l += 1\\n csum = min(abs(target-abc),abs(tsum-target))\\n if csum == abs(tsum-target):\\n abc = tsum\\n elif tsum == target:\\n return tsum\\n \\n return abc\\n\",\n \"runtime\": \"709\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n abc = inf\\n for i,num in enumerate(nums):\\n if i>1 and nums[i] == nums[i-1]:\\n continue \\n l,r = i+1,len(nums)-1\\n while l<r:\\n tsum = num + nums[l] + nums[r]\\n if tsum > target:\\n r -=1\\n csum = min(abs(target-abc),abs(tsum-target))\\n if csum == abs(tsum-target):\\n abc = tsum\\n elif tsum < target:\\n l += 1\\n csum = min(abs(target-abc),abs(tsum-target))\\n if csum == abs(tsum-target):\\n abc = tsum\\n elif tsum == target:\\n return tsum\\n \\n return abc\\n\",\n \"runtime\": \"709\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n minDiff = sys.maxsize\\n nums.sort()\\n res = -1\\n for indx in range(len(nums)):\\n i = 0\\n j = len(nums)-1\\n while i < j:\\n if i == indx:\\n i+=1\\n continue\\n if j == indx:\\n j-=1\\n continue\\n total = nums[indx] + nums[i] + nums[j] \\n if total == target:\\n return target\\n if abs(total - target) < minDiff:\\n minDiff = abs(total-target)\\n res = total\\n if total > target:\\n j -= 1\\n elif total <target:\\n i += 1\\n return res\\n\",\n \"runtime\": \"729\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n ans = (float('inf'), 0)\\n for ith, val in enumerate(nums):\\n twoSum = target - val\\n start, end = 0, len(nums) - 1\\n while start < end:\\n if start == ith:\\n start += 1\\n continue\\n if end == ith: \\n end -= 1\\n continue\\n curr = nums[start] + nums[end]\\n if abs(curr - twoSum) < ans[0]:\\n ans = (abs(curr - twoSum), curr + val )\\n if curr > twoSum:\\n end -= 1\\n else:\\n start += 1\\n \\n return ans[1]\\n \",\n \"runtime\": \"729\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n n = len(nums)\\n triplets = []\\n ref = []\\n for i in range(n - 2):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n j = i + 1\\n k = n - 1\\n while j < k:\\n current_sum = nums[i] + nums[j] + nums[k]\\n triplets.append(abs(nums[i] + nums[j] + nums[k] - target))\\n ref.append(nums[i] + nums[j] + nums[k])\\n if current_sum > target:\\n k -= 1\\n else:\\n j += 1\\n \\n m = min(triplets)\\n return ref[triplets.index(m)]\",\n \"runtime\": \"739\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n \\n closest = None\\n\\n for i in range(0, len(nums)-2):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n\\n j = i + 1\\n k = len(nums)-1\\n \\n while j < k: \\n newsum = nums[i] + nums[j] + nums[k]\\n #print(newsum,[i,j,k],[nums[i],nums[j],nums[k]])\\n \\n if newsum == target:\\n return target\\n j+=1\\n while nums[j] == nums[j-1] and j < k:\\n j += 1\\n else:\\n if newsum < target:\\n j += 1\\n elif newsum > target:\\n k -= 1\\n\\n if closest == None:\\n closest = newsum\\n elif not closest == newsum:\\n if target < (closest + newsum) / 2:\\n closest = min(closest, newsum)\\n else:\\n closest = max(closest, newsum) \\n\\n return closest\",\n \"runtime\": \"739\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n res = float('inf')\\n for i in range(len(nums)):\\n if i > 0 and nums[i - 1] == nums[i]:\\n continue\\n j = i + 1\\n k = len(nums) - 1\\n while j < k:\\n while j < k and j > i + 1 and nums[j - 1] == nums[j]:\\n j += 1\\n while j < k and k < len(nums) - 1 and nums[k + 1] == nums[k]:\\n k -= 1\\n if j >= k:\\n break\\n s = nums[i] + nums[j] + nums[k]\\n if s == target:\\n return target\\n if abs(s - target) < abs(res - target):\\n res = s\\n if s < target:\\n j += 1\\n else:\\n k -= 1\\n return res\",\n \"runtime\": \"749\"\n },\n {\n \"code\": \"def threeSumClosest(nums: List[int], target: int) -> int:\\n nums.sort()\\n if len(nums) == 3: return sum(nums)\\n a = []\\n for i in range(len(nums) - 2):\\n l, r = i + 1, len(nums) - 1\\n if i > 0 and nums[i] == nums[i - 1]: continue\\n while l < r:\\n s = sum([nums[l], nums[r], nums[i]])\\n if s > target:\\n a.append(s)\\n r -= 1\\n elif s < target: \\n a.append(s)\\n l += 1\\n else:\\n a.append(s)\\n while l < r and nums[l] == nums[l + 1]: l += 1\\n while l < r and nums[r] == nums[r - 1]: r -= 1\\n l, r = l + 1, r - 1\\n return min(a, key = lambda x: abs(x - target))\\n\\nwith open('user.out', 'w') as f:\\n i = map(loads, stdin)\\n for nums in i:\\n target = next(i)\\n print(f'{threeSumClosest(nums, target)}', file=f)\\nexit(0)\",\n \"runtime\": \"749\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n ans = sum(nums[0: 3])\\n n = len(nums)\\n nums.sort()\\n for i in range(n):\\n index = -1\\n for j in range(i + 1, n):\\n if index == -1:\\n index = bisect_left(nums, target - nums[i] - nums[j], lo = j + 1)\\n nn = index\\n for k in [index - 1, index, index + 1]:\\n if j < k < n:\\n v = nums[i] + nums[j] + nums[k]\\n if abs(target - v) < abs(target - ans):\\n ans = v\\n nn = k\\n index = nn\\n return ans\",\n \"runtime\": \"759\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n def twoSumClosest(nums, target):\\n first = 0\\n last = len(nums) - 1\\n closest = nums[first] + nums[last]\\n while first < last:\\n clo_sum = nums[first] + nums[last]\\n if (abs(closest - target) > abs(clo_sum - target)):\\n closest = clo_sum\\n if clo_sum == target:\\n return clo_sum\\n elif clo_sum > target: \\n last -= 1\\n else:\\n first += 1\\n return clo_sum\\n nums.sort()\\n c_s = float(\\\"inf\\\")\\n for i in range(len(nums)):\\n s = nums[i] + twoSumClosest(nums[:i]+nums[i+1:],target - nums[i])\\n if c_s == float(\\\"inf\\\") or abs(c_s-target) > abs(s - target):\\n c_s = s\\n return c_s\\n \\n \",\n \"runtime\": \"759\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n sorted_nums = sorted(nums) \\n res = 0 \\n dis = math.inf \\n for i in range(len(nums)): \\n j = i+1 \\n k = len(nums)-1 \\n while j < k: \\n total_sum = sorted_nums[i] + sorted_nums[j] + sorted_nums[k] \\n if total_sum == target: \\n return total_sum \\n if abs(total_sum - target) < dis: \\n dis = abs(total_sum - target) \\n res = total_sum \\n if abs(sorted_nums[i] + sorted_nums[j+1] + sorted_nums[k] - target) < abs(sorted_nums[i] + sorted_nums[j] + sorted_nums[k-1] - target):\\n j+=1 \\n else:\\n k-=1\\n return res \\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 nums = sorted(nums)\\n distance = math.inf\\n res = 0\\n for i in range(len(nums)-1): \\n j = i+1 \\n k = len(nums)-1 \\n findTarget = False \\n while j<k: \\n if abs(target - nums[i]-nums[j]-nums[k]) < distance: \\n distance = abs(target - (nums[i]+nums[j]+nums[k]))\\n res = nums[i]+nums[j]+nums[k]\\n if nums[j] + nums[k] < target - nums[i]: \\n j+=1 \\n elif nums[j] + nums[k] > target - nums[i]:\\n k-=1 \\n else: \\n findTarget = True\\n break \\n if findTarget: \\n break \\n return res\\n\\n\\n\\n\\n\\n\\n\\n# TC N^2, SC: O(1)\\n# Sorting with two pointers \\n\\n\\n# brute force will take O(N^3)\",\n \"runtime\": \"769\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n res = float('inf') \\n nums.sort()\\n\\n for i in range(len(nums)):\\n l = i + 1\\n r = len(nums) - 1\\n while l < r:\\n new_sum = nums[i] + nums[l] + nums[r]\\n\\n if res == float('inf'):\\n res = new_sum\\n else:\\n diff = target - new_sum\\n res_diff = target - res\\n if abs(diff) < abs(res_diff):\\n res = new_sum\\n r -= 1\\n elif new_sum <= target:\\n l += 1\\n else:\\n r -= 1\\n\\n return res\\n \\n\\n \\n \\n\\n\\n \",\n \"runtime\": \"769\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums = sorted(nums)\\n \\n best_dist = [float(\\\"inf\\\")]\\n for pivot in range(len(nums)-2):\\n p_val = nums[pivot]\\n left = pivot+1\\n right = len(nums)-1\\n while left < right:\\n l_val = nums[left]\\n r_val = nums[right]\\n curr_sum = sum([p_val, l_val, r_val])\\n # print(f\\\"{curr_sum} = sum([{p_val}, {l_val}, {r_val}])\\\")\\n if curr_sum > target:\\n right -= 1\\n elif curr_sum < target:\\n left += 1\\n else:\\n return curr_sum\\n \\n # print(f\\\"if {abs(curr_sum)} < {abs(sum(best_dist))}\\\")\\n if abs(curr_sum - target) < abs(sum(best_dist) - target):\\n best_dist = [p_val, l_val, r_val]\\n return sum(best_dist)\\n \\n\",\n \"runtime\": \"779\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n ans = (float('inf'), 0)\\n for ith, val in enumerate(nums):\\n twoSum = target - val\\n start, end = 0, len(nums) - 1\\n while start < end:\\n if start == ith:\\n start += 1\\n continue\\n if end == ith: \\n end -= 1\\n continue\\n curr = nums[start] + nums[end]\\n if abs(curr - twoSum) < ans[0]:\\n ans = (abs(curr - twoSum), curr + val )\\n print(nums[start], nums[end], val, curr + val, ith )\\n if curr > twoSum:\\n end -= 1\\n else:\\n start += 1\\n \\n return ans[1]\\n \",\n \"runtime\": \"779\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n answer=float('inf')\\n answer_=0\\n for i in range(len(nums)):\\n j,n=i+1,len(nums)-1\\n while(j<n):\\n if(answer==0):\\n return answer_\\n if abs(target-(nums[j]+nums[n]+nums[i]))<answer:\\n answer=abs(target-(nums[j]+nums[n]+nums[i]))\\n answer_=nums[j]+nums[n]+nums[i]\\n if(target-(nums[j]+nums[n]+nums[i])>0):\\n j+=1\\n while(j<n-1 and nums[j]==nums[j-1]):\\n j+=1\\n if(target-(nums[j]+nums[n]+nums[i])<0):\\n n-=1\\n while(j<n-1 and nums[n]==nums[n+1]):\\n n-=1\\n return answer_\\n\\n\\n\\n\",\n \"runtime\": \"789\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n best_sum = sum(nums[0:3])\\n for i in range(len(nums)):\\n curr_sum = nums[i] + twoSumCloset(nums, target-nums[i], i)\\n if abs(target-curr_sum) < abs(target-best_sum):\\n best_sum = curr_sum\\n return best_sum\\n\\ndef twoSumCloset(nums, target, skip):\\n left = 0 if skip != 0 else 1\\n right = len(nums)-1 if skip != len(nums)-1 else len(nums)-2\\n best_sum = nums[left]+nums[right]\\n while left<right:\\n curr_sum = nums[left]+nums[right]\\n if abs(target-curr_sum) < abs(target-best_sum):\\n best_sum = curr_sum\\n if curr_sum < target:\\n left+=1\\n if skip == left:\\n left+=1\\n elif curr_sum > target:\\n right-=1\\n if skip==right:\\n right-=1\\n else:\\n return target\\n return best_sum\\n\\n \\n \",\n \"runtime\": \"789\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums=sorted(nums)\\n minSofar=100000\\n output=100000\\n for i, num in enumerate(nums):\\n l=0\\n r=len(nums)-1\\n\\n while(r>l):\\n if(r==i):\\n r-=1\\n if(l==i):\\n l+=1\\n if(l==r):\\n break\\n s=num+nums[r]+nums[l]\\n result=abs(target-s)\\n if(minSofar>result):\\n output=s\\n minSofar=result\\n if(s>target):\\n r-=1\\n else:\\n l+=1\\n return output\\n \\n \\n \",\n \"runtime\": \"799\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n\\n total = None\\n for pilotIdx in range(len(nums)):\\n\\n chosenNums = nums[:pilotIdx] + nums[pilotIdx + 1:]\\n left = 0\\n right = len(chosenNums) - 1\\n \\n while left < right:\\n visitingTotal = chosenNums[left] + nums[pilotIdx] + chosenNums[right]\\n if total is None:\\n total = visitingTotal\\n \\n if abs(visitingTotal - target) < abs(total - target):\\n total = visitingTotal\\n\\n if visitingTotal == target:\\n return visitingTotal\\n \\n if visitingTotal < target:\\n left += 1\\n else:\\n right -= 1\\n\\n\\n return total\",\n \"runtime\": \"799\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n def findClosest(nums: List[int], num: int, target: int) -> int:\\n closest_diff = math.inf\\n closest = None\\n left = 0\\n right = len(nums) - 1\\n while left < right:\\n sum = num + nums[left] + nums[right]\\n diff = abs(target - sum)\\n if diff == 0:\\n return sum\\n if diff < closest_diff:\\n closest = sum\\n closest_diff = diff\\n left, right = (left + 1, right) if sum < target else (left, right - 1)\\n return closest\\n closest = math.inf\\n closest_diff = math.inf\\n n = len(nums)\\n nums.sort()\\n for i, x in enumerate(nums):\\n sliced = nums[:i] + nums[min(i + 1, n):]\\n new_closest = findClosest(sliced, x, target)\\n if new_closest == target:\\n return target\\n elif abs(target - new_closest) < abs(target - closest):\\n closest = new_closest\\n return closest\\n\\n\\n\\n\\n\\n# [1, 2, 4, 8, 16, -2, -8], 5\\n# [-8, -2, 1, 2, 4, 8, 16]\",\n \"runtime\": \"809\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums = sorted(nums)\\n close = 0\\n ls = []\\n a = None\\n b = None\\n for i in range(len(nums)-2):\\n if nums[i] <= 0 and nums[i] == nums[i-1] and i > 0:\\n continue\\n j = i+1\\n k = len(nums)-1\\n while j < k and k>=0:\\n if a == None:\\n a = nums[i]+nums[j]+nums[k]\\n close = a\\n elif b == None:\\n b = nums[i]+nums[j]+nums[k]\\n close = b\\n else: \\n \\n pass\\n if a!=None and b!=None:\\n if abs(a-target) > abs(b-target):\\n close = b\\n a = None\\n else:\\n close = a\\n b = None\\n \\n \\n \\n if nums[i]+nums[j]+nums[k] > target:\\n k -= 1\\n else:\\n j+=1\\n \\n return close\",\n \"runtime\": \"809\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n closest = sys.maxsize\\n ans = None\\n for i in range(len(nums)):\\n if i!=0 and nums[i]==nums[i-1]:\\n continue\\n l = i+1\\n r = len(nums)-1\\n while l<r:\\n mysum = nums[i]+nums[r]+nums[l]\\n distance = abs(target-mysum)\\n if i<20:\\n print(str(nums[i])+\\\",\\\"+str(nums[l])+\\\",\\\"+str(nums[r]))\\n print(str(mysum)+\\\",\\\"+str(distance))\\n print(target-mysum)\\n if distance<closest:\\n closest = distance\\n ans = mysum\\n if target-mysum<0:\\n r-=1\\n elif target-mysum>0:\\n l+=1\\n else:\\n return mysum\\n return ans\",\n \"runtime\": \"819\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, a: List[int], x: int) -> int:\\n \\n def find(i,j,k):\\n if i>=j:\\n return \\n s=a[i]+a[j]+a[k]\\n if s>=t[0]:\\n find(i,j-1,k)\\n elif s<t[1]:\\n find(i+1,j,k)\\n else:\\n t[0]=x+abs(s-x)\\n t[1]=x-abs(s-x)\\n res[0]=s\\n find(i+1,j,k)\\n find(i,j-1,k)\\n \\n \\n n=len(a)\\n a.sort()\\n res=[0]\\n t=[math.inf,-math.inf]\\n for k in range(n-2):\\n i=k+1\\n j=n-1\\n find(i,j,k)\\n return res[0]\",\n \"runtime\": \"819\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n final_closest = 0\\n depth = float('inf')\\n nums.sort()\\n for i in range(len(nums)-1):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n\\n j = i+1\\n k = len(nums)-1\\n\\n while j < k:\\n closest = nums[i]+nums[j]+nums[k]\\n diff = max(closest,target) - min(closest,target)\\n if diff < depth :\\n depth = diff\\n final_closest = closest\\n \\n if closest > target:\\n k-=1\\n else:\\n j += 1\\n \\n return final_closest\\n\\n \\n \\n\\n \\n\\n\\n \\n\\n\",\n \"runtime\": \"829\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n dist = float(\\\"inf\\\")\\n nums.sort()\\n\\n for i in range(len(nums)):\\n for j in range(i+1, len(nums)):\\n comp = target-(nums[i]+nums[j])\\n hi = bisect_right(nums, comp, j+1)\\n lo = hi-1\\n\\n if hi < len(nums):\\n ijSum = nums[i] + nums[j] + nums[hi]\\n if abs(target - ijSum) < abs(target - dist):\\n dist = ijSum\\n \\n if lo > j:\\n ijSum = nums[i] + nums[j] + nums[lo]\\n if abs(target - ijSum) < abs(target - dist):\\n dist = ijSum\\n \\n if dist == target:\\n return dist\\n\\n return dist\",\n \"runtime\": \"829\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":149,"string":"149"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n diff=float('inf')\n nums.sort()\n for i in range(len(nums)-1):\n start=i+1\n end=len(nums)-1\n while(start<end):\n current= nums[i]+ nums[start]+ nums[end]\n if current == target:\n return current\n elif abs(target-current) < diff:\n diff = abs(target-current)\n closest = current\n if current>target:\n end -= 1\n else:\n start += 1\n return closest\n\n ","memory":"16000"},{"code":"from math import inf\n\n\nclass Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n min_diff = inf\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n tgt_el = target - (nums[i] + nums[j])\n res_idx = bisect_right(nums, tgt_el, lo=j + 1)\n low_res_idx = res_idx - 1\n # default to using curr_idx\n if res_idx < len(nums) and abs(nums[res_idx] - tgt_el) < abs(min_diff):\n min_diff = tgt_el - nums[res_idx]\n if low_res_idx > j and abs(nums[low_res_idx] - tgt_el) < abs(min_diff):\n min_diff = tgt_el - nums[low_res_idx]\n return target - min_diff\n","memory":"16100"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n ans = nums[0] + nums[1] + nums[2]\n nums.sort()\n\n for i in range(len(nums)):\n pointer1 = i + 1\n pointer2 = len(nums) - 1\n\n while pointer1 < pointer2:\n sum_three = nums[i]+nums[pointer1]+nums[pointer2]\n if sum_three == target:\n return target\n \n if abs(sum_three-target) < abs(target-ans):\n ans = sum_three\n\n if sum_three < target:\n pointer1 += 1\n else:\n pointer2 -= 1\n \n return ans\n ","memory":"16200"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n \n \n minv=[]\n lent=len(nums)\n x=float(\"inf\")\n nums.sort()\n for i in range (len(nums)-2):\n if i>0 and nums[i]==nums[i-1]:\n continue \n l=i+1\n r=lent-1\n while l<r:\n val=nums[i]+nums[l]+nums[r]\n if val==target:\n return val\n minv.append(nums[i]+nums[l]+nums[r])\n \n \n elif val<target:\n l+=1\n else:\n r-=1\n if abs(val-target)<abs(x-target):\n x=val\n return x\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 ","memory":"16300"},{"code":"from typing import List\n\nclass Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n if len(nums) < 3:\n return sum(nums)\n\n nums.sort()\n closest_sum = float('inf') # To track the closest sum\n \n for i in range(len(nums) - 2):\n l, r = i + 1, len(nums) - 1\n \n while l < r:\n current_sum = nums[i] + nums[l] + nums[r]\n # Update the closest sum if the current sum is closer to the target\n if abs(current_sum - target) < abs(closest_sum - target):\n closest_sum = current_sum\n \n if current_sum < target:\n l += 1\n elif current_sum > target:\n r -= 1\n else:\n # If we find an exact match, return it immediately\n return current_sum\n \n return closest_sum\n","memory":"16300"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums = sorted(nums)\n closest = sum(nums[:3])\n\n # calc for each value\n for i, num in enumerate(nums[:-2]):\n # get the left, right indices\n left = i + 1\n right = len(nums) - 1\n while left < right:\n three_sum = num + nums[left] + nums[right]\n if abs(three_sum - target) < abs(closest - target):\n closest = three_sum\n\n if three_sum == target:\n return three_sum\n elif three_sum - target < 0:\n left += 1\n else:\n right -= 1\n\n return closest","memory":"16400"},{"code":"# class Solution:\n# def threeSumClosest(self, nums: List[int], target: int) -> int:\n\nclass Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n best_sum = float('inf')\n \n for i in range(len(nums) - 2):\n left, right = i + 1, len(nums) - 1\n \n while left < right:\n current_sum = nums[i] + nums[left] + nums[right]\n \n if abs(current_sum - target) < abs(best_sum - target):\n best_sum = current_sum\n \n if current_sum == target:\n return target\n elif current_sum < target:\n left += 1\n else:\n right -= 1\n \n return best_sum","memory":"16400"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n #here we use two pointer \n nums.sort() # Sort the array to apply two-pointer technique\n closest_sum = float('inf') # Initialize closest sum to infinity\n \n for i in range(len(nums) ):\n left, right = i + 1, len(nums) - 1\n \n while left < right:\n current_sum = nums[i] + nums[left] + nums[right]\n \n # If the current sum is closer to the target, update closest_sum\n if abs(current_sum - target) < abs(closest_sum - target):\n closest_sum = current_sum\n \n # Move the pointers based on how current_sum compares to target\n if current_sum < target:\n left += 1\n elif current_sum > target:\n right -= 1\n else:\n # If the current_sum is exactly equal to the target, return it\n return current_sum\n\n return closest_sum\n ","memory":"16500"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n #here we use two pointer \n nums.sort() # Sort the array to apply two-pointer technique\n closest_sum = float('inf') # Initialize closest sum to infinity\n \n for i in range(len(nums)-2 ):\n left, right = i + 1, len(nums) - 1\n \n while left < right:\n current_sum = nums[i] + nums[left] + nums[right]\n \n # If the current sum is closer to the target, update closest_sum\n if abs(current_sum - target) < abs(closest_sum - target):\n closest_sum = current_sum\n \n # Move the pointers based on how current_sum compares to target\n if current_sum < target:\n left += 1\n elif current_sum > target:\n right -= 1\n else:\n # If the current_sum is exactly equal to the target, return it\n return current_sum\n\n return closest_sum\n ","memory":"16500"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n #sort nums\n #memory the closest\n #iterate nums, pick pivot at i from nums\n #then scan it's right side\n #l = i+1, r=len(nums)-1\n #get cur sum of i, l, r and update closest\n #if the sum < target, move l to the right\n #if the sum > target, move r to the left\n #if sum==target break the loop\n\n nums = sorted(nums)\n closest_dist = float(\"inf\")\n closest_sum = 0\n for i,v in enumerate(nums):\n l = i+1\n r = len(nums)-1\n while l<r:\n cur_sum = nums[i] + nums[l] + nums[r]\n if abs(cur_sum - target) < closest_dist:\n closest_sum = cur_sum\n closest_dist = abs(cur_sum - target)\n if cur_sum < target: l+=1\n elif cur_sum > target: r-=1\n else:#exact target\n break\n return closest_sum","memory":"16600"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort()\n diff = float(\"inf\")\n\n for i in range(len(nums)):\n low, high = i+1, len(nums)-1\n while low < high:\n curr_sum = nums[i] + nums[low] + nums[high]\n if abs(target - curr_sum) < abs(diff):\n diff = target - curr_sum\n #print(curr_sum, diff)\n if curr_sum < target:\n low += 1\n else:\n high -= 1\n if diff == 0:\n break\n\n return target - diff\n","memory":"16600"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n\n nums = sorted(nums)\n closest = float(\"inf\")\n for i in range(len(nums)):\n\n p1 = i + 1\n p2 = len(nums) - 1\n\n while p1 < p2:\n current = nums[i] + nums[p1] + nums[p2]\n\n if abs(current - target) < abs(closest - target):\n closest = current\n\n if current == target:\n return current\n\n elif current < target:\n p1 = p1 + 1\n\n else:\n p2 = p2 - 1\n\n return closest\n","memory":"16700"},{"code":"class Solution:\n def threeSumClosest(self, nums: List[int], target: int) -> int:\n nums.sort() \n closestSum = float('inf')\n\n for index in range(len(nums)):\n if index > 0 and nums[index] == nums[index-1]:\n continue \n\n left = index+1 \n right = len(nums) - 1 \n\n while left < right: \n threeSum = nums[index] + nums[left] + nums[right]\n distance = abs(target - threeSum)\n\n if distance < abs(target-closestSum): \n closestSum = threeSum\n\n if threeSum > target: \n right -= 1 \n elif threeSum < target: \n left += 1 \n else: \n return threeSum\n\n return closestSum\n\n\n\n ","memory":"16700"}],"string":"[\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n diff=float('inf')\\n nums.sort()\\n for i in range(len(nums)-1):\\n start=i+1\\n end=len(nums)-1\\n while(start<end):\\n current= nums[i]+ nums[start]+ nums[end]\\n if current == target:\\n return current\\n elif abs(target-current) < diff:\\n diff = abs(target-current)\\n closest = current\\n if current>target:\\n end -= 1\\n else:\\n start += 1\\n return closest\\n\\n \",\n \"memory\": \"16000\"\n },\n {\n \"code\": \"from math import inf\\n\\n\\nclass Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n min_diff = inf\\n for i in range(len(nums)):\\n for j in range(i + 1, len(nums)):\\n tgt_el = target - (nums[i] + nums[j])\\n res_idx = bisect_right(nums, tgt_el, lo=j + 1)\\n low_res_idx = res_idx - 1\\n # default to using curr_idx\\n if res_idx < len(nums) and abs(nums[res_idx] - tgt_el) < abs(min_diff):\\n min_diff = tgt_el - nums[res_idx]\\n if low_res_idx > j and abs(nums[low_res_idx] - tgt_el) < abs(min_diff):\\n min_diff = tgt_el - nums[low_res_idx]\\n return target - min_diff\\n\",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n ans = nums[0] + nums[1] + nums[2]\\n nums.sort()\\n\\n for i in range(len(nums)):\\n pointer1 = i + 1\\n pointer2 = len(nums) - 1\\n\\n while pointer1 < pointer2:\\n sum_three = nums[i]+nums[pointer1]+nums[pointer2]\\n if sum_three == target:\\n return target\\n \\n if abs(sum_three-target) < abs(target-ans):\\n ans = sum_three\\n\\n if sum_three < target:\\n pointer1 += 1\\n else:\\n pointer2 -= 1\\n \\n return ans\\n \",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n \\n \\n minv=[]\\n lent=len(nums)\\n x=float(\\\"inf\\\")\\n nums.sort()\\n for i in range (len(nums)-2):\\n if i>0 and nums[i]==nums[i-1]:\\n continue \\n l=i+1\\n r=lent-1\\n while l<r:\\n val=nums[i]+nums[l]+nums[r]\\n if val==target:\\n return val\\n minv.append(nums[i]+nums[l]+nums[r])\\n \\n \\n elif val<target:\\n l+=1\\n else:\\n r-=1\\n if abs(val-target)<abs(x-target):\\n x=val\\n return x\\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 \"memory\": \"16300\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n if len(nums) < 3:\\n return sum(nums)\\n\\n nums.sort()\\n closest_sum = float('inf') # To track the closest sum\\n \\n for i in range(len(nums) - 2):\\n l, r = i + 1, len(nums) - 1\\n \\n while l < r:\\n current_sum = nums[i] + nums[l] + nums[r]\\n # Update the closest sum if the current sum is closer to the target\\n if abs(current_sum - target) < abs(closest_sum - target):\\n closest_sum = current_sum\\n \\n if current_sum < target:\\n l += 1\\n elif current_sum > target:\\n r -= 1\\n else:\\n # If we find an exact match, return it immediately\\n return current_sum\\n \\n return closest_sum\\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums = sorted(nums)\\n closest = sum(nums[:3])\\n\\n # calc for each value\\n for i, num in enumerate(nums[:-2]):\\n # get the left, right indices\\n left = i + 1\\n right = len(nums) - 1\\n while left < right:\\n three_sum = num + nums[left] + nums[right]\\n if abs(three_sum - target) < abs(closest - target):\\n closest = three_sum\\n\\n if three_sum == target:\\n return three_sum\\n elif three_sum - target < 0:\\n left += 1\\n else:\\n right -= 1\\n\\n return closest\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"# class Solution:\\n# def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\nclass Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n best_sum = float('inf')\\n \\n for i in range(len(nums) - 2):\\n left, right = i + 1, len(nums) - 1\\n \\n while left < right:\\n current_sum = nums[i] + nums[left] + nums[right]\\n \\n if abs(current_sum - target) < abs(best_sum - target):\\n best_sum = current_sum\\n \\n if current_sum == target:\\n return target\\n elif current_sum < target:\\n left += 1\\n else:\\n right -= 1\\n \\n return best_sum\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n #here we use two pointer \\n nums.sort() # Sort the array to apply two-pointer technique\\n closest_sum = float('inf') # Initialize closest sum to infinity\\n \\n for i in range(len(nums) ):\\n left, right = i + 1, len(nums) - 1\\n \\n while left < right:\\n current_sum = nums[i] + nums[left] + nums[right]\\n \\n # If the current sum is closer to the target, update closest_sum\\n if abs(current_sum - target) < abs(closest_sum - target):\\n closest_sum = current_sum\\n \\n # Move the pointers based on how current_sum compares to target\\n if current_sum < target:\\n left += 1\\n elif current_sum > target:\\n right -= 1\\n else:\\n # If the current_sum is exactly equal to the target, return it\\n return current_sum\\n\\n return closest_sum\\n \",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n #here we use two pointer \\n nums.sort() # Sort the array to apply two-pointer technique\\n closest_sum = float('inf') # Initialize closest sum to infinity\\n \\n for i in range(len(nums)-2 ):\\n left, right = i + 1, len(nums) - 1\\n \\n while left < right:\\n current_sum = nums[i] + nums[left] + nums[right]\\n \\n # If the current sum is closer to the target, update closest_sum\\n if abs(current_sum - target) < abs(closest_sum - target):\\n closest_sum = current_sum\\n \\n # Move the pointers based on how current_sum compares to target\\n if current_sum < target:\\n left += 1\\n elif current_sum > target:\\n right -= 1\\n else:\\n # If the current_sum is exactly equal to the target, return it\\n return current_sum\\n\\n return closest_sum\\n \",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n #sort nums\\n #memory the closest\\n #iterate nums, pick pivot at i from nums\\n #then scan it's right side\\n #l = i+1, r=len(nums)-1\\n #get cur sum of i, l, r and update closest\\n #if the sum < target, move l to the right\\n #if the sum > target, move r to the left\\n #if sum==target break the loop\\n\\n nums = sorted(nums)\\n closest_dist = float(\\\"inf\\\")\\n closest_sum = 0\\n for i,v in enumerate(nums):\\n l = i+1\\n r = len(nums)-1\\n while l<r:\\n cur_sum = nums[i] + nums[l] + nums[r]\\n if abs(cur_sum - target) < closest_dist:\\n closest_sum = cur_sum\\n closest_dist = abs(cur_sum - target)\\n if cur_sum < target: l+=1\\n elif cur_sum > target: r-=1\\n else:#exact target\\n break\\n return closest_sum\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort()\\n diff = float(\\\"inf\\\")\\n\\n for i in range(len(nums)):\\n low, high = i+1, len(nums)-1\\n while low < high:\\n curr_sum = nums[i] + nums[low] + nums[high]\\n if abs(target - curr_sum) < abs(diff):\\n diff = target - curr_sum\\n #print(curr_sum, diff)\\n if curr_sum < target:\\n low += 1\\n else:\\n high -= 1\\n if diff == 0:\\n break\\n\\n return target - diff\\n\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n\\n nums = sorted(nums)\\n closest = float(\\\"inf\\\")\\n for i in range(len(nums)):\\n\\n p1 = i + 1\\n p2 = len(nums) - 1\\n\\n while p1 < p2:\\n current = nums[i] + nums[p1] + nums[p2]\\n\\n if abs(current - target) < abs(closest - target):\\n closest = current\\n\\n if current == target:\\n return current\\n\\n elif current < target:\\n p1 = p1 + 1\\n\\n else:\\n p2 = p2 - 1\\n\\n return closest\\n\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def threeSumClosest(self, nums: List[int], target: int) -> int:\\n nums.sort() \\n closestSum = float('inf')\\n\\n for index in range(len(nums)):\\n if index > 0 and nums[index] == nums[index-1]:\\n continue \\n\\n left = index+1 \\n right = len(nums) - 1 \\n\\n while left < right: \\n threeSum = nums[index] + nums[left] + nums[right]\\n distance = abs(target - threeSum)\\n\\n if distance < abs(target-closestSum): \\n closestSum = threeSum\\n\\n if threeSum > target: \\n right -= 1 \\n elif threeSum < target: \\n left += 1 \\n else: \\n return threeSum\\n\\n return closestSum\\n\\n\\n\\n \",\n \"memory\": \"16700\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":13,"string":"13"}}},{"rowIdx":183,"cells":{"question_id":{"kind":"number","value":17,"string":"17"},"name":{"kind":"string","value":"letter-combinations-of-a-phone-number"},"content":{"kind":"string","value":"<p>Given a string containing digits from <code>2-9</code> inclusive, return all possible letter combinations that the number could represent. Return the answer in <strong>any order</strong>.</p>\n\n<p>A mapping of digits to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.</p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2022/03/15/1200px-telephone-keypad2svg.png\" style=\"width: 300px; height: 243px;\" />\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> digits = "23"\n<strong>Output:</strong> ["ad","ae","af","bd","be","bf","cd","ce","cf"]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> digits = ""\n<strong>Output:</strong> []\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> digits = "2"\n<strong>Output:</strong> ["a","b","c"]\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>0 <= digits.length <= 4</code></li>\n\t<li><code>digits[i]</code> is a digit in the range <code>['2', '9']</code>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":61.705973784032494,"string":"61.705974"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["hash-table","string","backtracking"],"string":"[\n \"hash-table\",\n \"string\",\n \"backtracking\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"9\", 0.0033], [\"12\", 0.0033], [\"14\", 0.0067], [\"15\", 0.0167], [\"16\", 0.0267], [\"17\", 0.0233], [\"18\", 0.0901], [\"19\", 0.1868], [\"20\", 0.1734], [\"21\", 0.1568], [\"22\", 0.5604], [\"23\", 0.7505], [\"24\", 0.7238], [\"25\", 0.9973], [\"26\", 2.3349], [\"27\", 2.1681], [\"28\", 1.8012], [\"29\", 3.0687], [\"30\", 5.984], [\"31\", 4.6298], [\"32\", 3.7191], [\"33\", 6.6811], [\"34\", 9.7432], [\"35\", 6.958], [\"36\", 5.2402], [\"37\", 8.0954], [\"38\", 9.046], [\"39\", 6.6044], [\"40\", 4.4797], [\"41\", 4.6664], [\"42\", 4.2161]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16000\", 0.0033], [\"16100\", 0.01], [\"16200\", 0.0767], [\"16300\", 1.521], [\"16400\", 14.9666], [\"16500\", 34.3229], [\"16600\", 40.7138]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return []\n \n digit_to_letters = {\n '2': 'abc',\n '3': 'def',\n '4': 'ghi',\n '5': 'jkl',\n '6': 'mno',\n '7': 'pqrs',\n '8': 'tuv',\n '9': 'wxyz'\n }\n \n queue = ['']\n \n for digit in digits:\n letters = digit_to_letters[digit]\n new_queue = []\n \n for combination in queue:\n for letter in letters:\n new_queue.append(combination + letter)\n \n queue = new_queue\n \n return queue\n \n\n\n ","runtime":"9"},{"code":"class Solution:\n def __init__(self):\n self.map = {\n \"2\": \"abc\",\n \"3\": \"def\",\n \"4\": \"ghi\",\n \"5\": \"jkl\",\n \"6\": \"mno\",\n \"7\": \"pqrs\",\n \"8\": \"tuv\",\n \"9\": \"wxyz\"\n }\n self.comboList = []\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return []\n \n self.combos(digits, \"\")\n return self.comboList\n \n def combos(self, digits: str, currString: str):\n if digits:\n num = digits[0]\n \n for letter in self.map[num]:\n self.combos(digits[1:], currString+letter)\n \n else:\n self.comboList.append(currString)\n\n\n ","runtime":"12"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return []\n nums_dict = {\n \"2\": \"abc\",\n \"3\": \"def\", \n \"4\": \"ghi\", \n \"5\": \"jkl\", \n \"6\": \"mno\", \n \"7\": \"pqrs\",\n \"8\": \"tuv\", \n \"9\": \"wxyz\"\n }\n result = []\n def dfs(index, path):\n if index == len(digits):\n str_digits = \"\".join(path)\n result.append(str_digits)\n return\n current_digit = digits[index]\n for letter in nums_dict[current_digit]:\n # 2: abc \n path.append(letter) \n print(path)\n dfs(index+1, path) \n path.pop()\n dfs(0, [])\n return result \n ","runtime":"14"},{"code":"class Solution:\n letters = {\n 2: \"abc\",\n 3: \"def\",\n 4: \"ghi\",\n 5: \"jkl\",\n 6: \"mno\",\n 7: \"pqrs\",\n 8: \"tuv\",\n 9: \"wxyz\"\n }\n def letterCombinations(self, digits: str) -> List[str]:\n if len(digits) == 0: return []\n # Just return the letters in a list format\n if len(digits) == 1: return [c for c in self.letters[int(digits)]]\n i = digits[0]\n res = []\n restof = self.letterCombinations(digits[1:])\n for c in self.letters[int(i)]:\n res += [c + r for r in restof]\n return res","runtime":"15"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if(len(digits) == 0): return []\n self.res = []\n dic = {'2': \"abc\", '3': \"def\", '4': \"ghi\", '5': \"jkl\", '6': \"mno\", '7': \"pqrs\", '8': \"tuv\", '9': \"wxyz\"}\n def dfs(ind):\n if(ind == 0):\n return [i for i in dic[digits[0]]]\n new = []\n temp = dfs(ind-1)\n tb = dic[digits[ind]]\n for i in temp:\n for j in tb:\n new.append(i+j)\n return new\n return dfs(len(digits)-1)","runtime":"16"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n self.ans = []\n self.n = len(digits)\n self.map = {\n \"2\": [\"a\", \"b\", \"c\"], \n \"3\": [\"d\", \"e\", \"f\"], \n \"4\": [\"g\", \"h\", \"i\"], \n \"5\": [\"j\", \"k\", \"l\"], \n \"6\": [\"m\", \"n\", \"o\"], \n \"7\": [\"p\", \"q\", \"r\", \"s\"], \n \"8\": [\"t\", \"u\", \"v\"], \n \"9\": [\"w\", \"x\", \"y\", \"z\"]}\n def recur(s, i):\n if i == self.n:\n self.ans.append(s)\n return\n for val in self.map[digits[i]]:\n recur(s+val, i+1)\n if not digits:\n return []\n recur(\"\", 0)\n return self.ans ","runtime":"17"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return []\n\n phone_map = {\n '2': 'abc',\n '3': 'def',\n '4': 'ghi',\n '5': 'jkl',\n '6': 'mno',\n '7': 'pqrs',\n '8': 'tuv',\n '9': 'wxyz'\n }\n output = [] # 23 \n def backtrack(combination, next_digits): \n if len(next_digits) == 0:\n output.append(combination)\n else:\n for letter in phone_map[next_digits[0]]:\n backtrack(combination + letter, next_digits[1:])\n\n backtrack(\"\", digits)\n return output","runtime":"18"},{"code":"class Solution:\n aa = ['abc','def','ghi','jkl','mno','pqrs','tuv','wxyz']\n def letterCombinations(self, digits: str) -> List[str]:\n return [] if len(digits)==0 else list(map(lambda t: ''.join(t), product(*map(lambda c:Solution.aa[ord(c) - ord('2')], digits))))\n ","runtime":"19"},{"code":"MAP_DICT={\n '2':['a','b','c'],\n '3':['d','e','f'],\n '4':['g','h','i'],\n '5':['j','k','l'],\n '6':['m','n','o'],\n '7':['p','q','r','s'],\n '8':['t','u','v'],\n '9':['w','x','y','z']\n\n}\nclass Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if digits=='':\n return []\n\n result = [''] \n for digit in digits:\n characters = MAP_DICT[digit]\n result = [r+c for c in characters for r in result]\n #print(result)\n #result = set(result)\n return result\n\n\n ","runtime":"19"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n \n dic = {\n '2': 'abc',\n '3': 'def',\n '4': 'ghi',\n '5': 'jkl',\n '6': 'mno',\n '7': 'pqrs',\n '8': 'tuv',\n '9': 'wxyz',\n }\n\n answer = []\n\n def backtrack(index, curr):\n\n \n \n if curr and len(curr) == len(digits):\n answer.append(curr[:])\n return \n\n for i, c in enumerate(digits[index:]):\n\n for letter in dic[c]:\n curr += letter\n backtrack(index+1, curr)\n curr = curr[:-1]\n\n return\n\n backtrack(0, '')\n return answer","runtime":"20"},{"code":"class Solution:\n def __init__(self):\n self.map = ['', '', 'abc', 'def', 'ghi', 'jkl', 'mno', 'pqrs', 'tuv', 'wxyz']\n\n def helper(self, digits, ans, i, curr):\n if i == len(digits):\n ans.append(curr)\n return\n \n s = self.map[int(digits[i])]\n\n for char in s:\n self.helper(digits, ans, i+1, curr + char)\n\n def letterCombinations(self, digits):\n #your code goes here\n ans = []\n\n if not digits:\n return ans\n \n self.helper(digits, ans, 0, '')\n return ans","runtime":"20"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n length = len(digits)\n if length == 0:\n return []\n\n combinations = []\n\n digitLetterMapping = {\"2\": \"abc\", \"3\": \"def\", \"4\": \"ghi\", \"5\": \"jkl\", \"6\": \"mno\", \"7\": \"pqrs\", \"8\": \"tuv\", \"9\": \"wxyz\",}\n\n def backtrack(index, path):\n if len(path) == length:\n combinations.append(\"\".join(path))\n return\n\n for ch in digitLetterMapping[digits[index]]:\n backtrack(index+1, path+[ch])\n backtrack(0,[])\n return combinations\n\n ","runtime":"21"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n dis={\n \"2\":\"abc\",\n \"3\":\"def\",\n \"4\":\"ghi\",\n \"5\":\"jkl\",\n \"6\":\"mno\",\n \"7\":\"pqrs\",\n \"8\":\"tuv\",\n \"9\":\"wxyz\",\n }\n if not digits: return[]\n output=[\"\"]\n\n for d in digits:\n temp =[]\n for v in dis[d]:\n for o in output:\n temp.append(o+v)\n output = temp\n return output \n ","runtime":"22"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return \"\"\n \n letters = [\"\",\"\",\"abc\",\"def\",\"ghi\",\"jkl\",\"mno\",\"pqrs\",\"tuv\",\"wxyz\"]\n result = []\n\n def helper(index, buffer):\n if index == len(digits):\n result.append(''.join(buffer)) \n return\n\n for x in letters[int(digits[index])]:\n buffer.append(x)\n helper(index+1, buffer)\n buffer.pop()\n\n helper(0, [])\n return result","runtime":"22"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if digits==\"\": return []\n res,sol=[],[]\n n=len(digits)\n di={'2':'abc','3':'def','4':'ghi','5':'jkl','6':'mno','7':'pqrs','8':'tuv','9':'wxyz'}\n def f(i):\n if len(sol)==n:\n res.append(''.join(sol[:]))\n return\n for nums in di[digits[i]]:\n sol.append(nums)\n f(i+1)\n sol.pop()\n f(0)\n return res\n\n ","runtime":"23"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n \n \n keyboard = {\n '2': 'abc',\n '3': 'def',\n '4': 'ghi',\n '5': 'jkl',\n '6': 'mno',\n '7': 'pqrs',\n '8': 'tuv',\n '9': 'wxyz',\n }\n\n if not digits:\n return []\n result = []\n def backtracking(index, combination):\n if index == len(digits):\n result.append(combination)\n return\n \n for letter in keyboard[digits[index]]:\n backtracking(index + 1, combination + letter)\n \n backtracking(0, \"\")\n return result\n\n\n\n\n ","runtime":"23"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return []\n \n letters = {\n \"2\": \"abc\",\n \"3\": \"def\",\n \"4\": \"ghi\",\n \"5\": \"jkl\",\n \"6\": \"mno\",\n \"7\": \"pqrs\",\n \"8\": \"tuv\",\n \"9\": \"wxyz\",\n }\n\n def backtrack(idx, path):\n if len(path) == len(digits):\n combinations.append(\"\".join(path))\n return\n \n possible_char = letters[digits[idx]]\n for letter in possible_char:\n path.append(letter)\n backtrack(idx+1, path)\n path.pop()\n \n combinations = []\n backtrack(0,[])\n return combinations\n ","runtime":"24"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if digits=='':\n return []\n d={\n \"2\": [\"a\", \"b\", \"c\"],\n \"3\": [\"d\", \"e\", \"f\"],\n \"4\": [\"g\", \"h\", \"i\"],\n \"5\": [\"j\", \"k\", \"l\"],\n \"6\": [\"m\", \"n\", \"o\"],\n \"7\": [\"p\", \"q\", \"r\", \"s\"],\n \"8\": [\"t\", \"u\", \"v\"],\n \"9\": [\"w\", \"x\", \"y\", \"z\"]\n }\n\n def backtrack(temp, i):\n if(len(temp)==len(digits)):\n result.append(temp)\n return\n for j in range(len(d[digits[i]])):\n temp+=d[digits[i]][j]\n backtrack(temp, i+1)\n temp=temp[:-1]\n result=[]\n backtrack('', 0)\n return result\n ","runtime":"24"},{"code":"from itertools import product\nclass Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n letter_mapping = {\n \"2\": [\"a\", \"b\", \"c\"],\n \"3\": [\"d\", \"e\", \"f\"],\n \"4\": [\"g\", \"h\", \"i\"],\n \"5\": [\"j\", \"k\", \"l\"],\n \"6\": [\"m\", \"n\", \"o\"],\n \"7\": [\"p\", \"q\", \"r\", \"s\"],\n \"8\": [\"t\", \"u\", \"v\"],\n \"9\": [\"w\", \"x\", \"y\", \"z\"],\n }\n if len(digits) == 0:\n return []\n return [\n \"\".join(prod_str)\n for prod_str in product(\n *[\n letter_mapping[char]\n for char\n in digits\n ])]\n","runtime":"25"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n phone_map = {\n '2': ['a', 'b', 'c'],\n '3': ['d', 'e', 'f'],\n '4': ['g', 'h', 'i'],\n '5': ['j', 'k', 'l'],\n '6': ['m', 'n', 'o'],\n '7': ['p', 'q', 'r', 's'],\n '8': ['t', 'u', 'v'],\n '9': ['w', 'x', 'y', 'z']\n }\n \n def dfs(idx, cur):\n if len(cur) == len(digits):\n fin.append(cur[:])\n return\n\n current = digits[idx]\n for j in phone_map[current]:\n cur += j\n dfs(idx + 1, cur)\n cur = cur[:-1]\n \n if len(digits) == 0:\n return []\n fin = []\n dfs( 0, \"\")\n return fin","runtime":"25"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n digitLetterMap = {'2': 'abc', '3': 'def', '4': 'ghi', '5': 'jkl', '6': 'mno', '7': 'pqrs', '8': 'tuv', '9': 'wxyz'}\n\n if len(digits) == 0:\n return []\n\n def helper(digits: str, idx: int, res: List[str], curr: string, n: int):\n if(idx > n):\n res.append(curr)\n return\n\n # get the mapping value\n mapValue = digitLetterMap.get(digits[idx])\n \n # get total choices\n for i in range(len(mapValue)):\n helper(digits, idx + 1, res, curr + mapValue[i], n)\n\n return res\n\n return helper(digits, 0, [], \"\", len(digits) - 1)\n\n\n ","runtime":"26"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n pre_result = []\n if not digits:\n return []\n digits = list(digits)\n my_dict = {\n '2' : ['a','b','c'],\n '3' : ['d','e','f'],\n '4' : ['g','h','i'],\n '5' : ['j','k','l'],\n '6' : ['m','n','o'],\n '7' : ['p','q','r','s'],\n '8' : ['t','u','v'],\n '9' : ['w','x','y','z']\n\n }\n if len(digits) == 1:\n return my_dict[str(digits[0])]\n\n while len(digits)>1: \n if isinstance(digits[0], list):\n for letter_l in digits[0]:\n for letter_r in my_dict[str(digits[1])]:\n pre_result.append(letter_l + letter_r)\n \n\n else:\n for letter_l in my_dict[str(digits[0])]:\n for letter_r in my_dict[str(digits[1])]:\n pre_result.append(letter_l + letter_r)\n if len(digits) > 2:\n digits = digits[2::]\n else:\n\n digits = []\n digits.insert(0, pre_result) \n pre_result = []\n\n \n return digits[0]\n\n \n ","runtime":"26"},{"code":"from typing import List\n\nclass Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return []\n \n # Mapping from digit to letters\n digit_to_letters = {\n '2': 'abc', '3': 'def', '4': 'ghi', '5': 'jkl',\n '6': 'mno', '7': 'pqrs', '8': 'tuv', '9': 'wxyz'\n }\n \n # List to store the result combinations\n result = []\n \n # Helper function for backtracking\n def backtrack(index: int, path: str) -> None:\n # If the current path length matches the digits length, add to result\n if index == len(digits):\n result.append(path)\n return\n \n # Get the letters corresponding to the current digit\n current_digit = digits[index]\n letters = digit_to_letters[current_digit]\n \n # Recurse for each letter\n for letter in letters:\n backtrack(index + 1, path + letter)\n \n # Start backtracking from the first digit\n backtrack(0, \"\")\n \n return result","runtime":"27"},{"code":"from typing import List\n\nclass Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n diction = {\n 2: ['a', 'b', 'c'],\n 3: ['d', 'e', 'f'],\n 4: ['g', 'h', 'i'],\n 5: ['j', 'k', 'l'],\n 6: ['m', 'n', 'o'],\n 7: ['p', 'q', 'r', 's'],\n 8: ['t', 'u', 'v'],\n 9: ['w', 'x', 'y', 'z']\n }\n\n if len(digits) == 0:\n return []\n\n output_list = []\n max_lens = []\n\n # Prepare max_lens to track number of letters per digit\n for i in range(len(digits)):\n max_lens.append(len(diction[int(digits[i])]))\n\n tracker = [0] * len(max_lens)\n output_len = 1\n\n # Calculate the total number of combinations\n for i in range(len(max_lens)):\n output_len = output_len * max_lens[i]\n\n # Generate combinations\n for i in range(output_len):\n o_str = \"\"\n for j in range(len(max_lens)):\n o_str += diction[int(digits[j])][tracker[j]]\n\n # Append the current combination to output_list\n output_list.append(o_str)\n\n # Update the tracker for the next combination\n for j in range(len(tracker) - 1, -1, -1):\n tracker[j] += 1\n if tracker[j] < max_lens[j]:\n break\n tracker[j] = 0\n\n return output_list\n","runtime":"27"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n\n res = []\n\n map = { \"2\": \"abc\",\n \"3\": \"def\",\n \"4\": \"ghi\",\n \"5\": \"jkl\",\n \"6\": \"mno\",\n \"7\": \"qprs\",\n \"8\": \"tuv\",\n \"9\": \"wxyz\" }\n\n def backtracking(i, cur):\n if len(cur) == len(digits):\n res.append(cur)\n return\n \n for c in map[digits[i]]:\n backtracking(i+1, cur + c)\n\n if digits:\n backtracking(0, \"\")\n\n return res\n\n \n \n","runtime":"30"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n ans = []\n dig = list(digits)\n self.helper(0, dig, ans, \"\")\n if ans and ans[0] == \"\":\n ans.pop(0)\n return ans\n\n def helper(self, i, dig, ans, curr):\n if i == len(dig):\n ans.append(curr)\n return\n if dig[i] == '2':\n self.helper(i + 1, dig, ans, curr + \"a\")\n self.helper(i + 1, dig, ans, curr + \"b\")\n self.helper(i + 1, dig, ans, curr + \"c\")\n elif dig[i] == '3':\n self.helper(i + 1, dig, ans, curr + \"d\")\n self.helper(i + 1, dig, ans, curr + \"e\")\n self.helper(i + 1, dig, ans, curr + \"f\")\n elif dig[i] == '4':\n self.helper(i + 1, dig, ans, curr + \"g\")\n self.helper(i + 1, dig, ans, curr + \"h\")\n self.helper(i + 1, dig, ans, curr + \"i\")\n elif dig[i] == '5':\n self.helper(i + 1, dig, ans, curr + \"j\")\n self.helper(i + 1, dig, ans, curr + \"k\")\n self.helper(i + 1, dig, ans, curr + \"l\")\n elif dig[i] == '6':\n self.helper(i + 1, dig, ans, curr + \"m\")\n self.helper(i + 1, dig, ans, curr + \"n\")\n self.helper(i + 1, dig, ans, curr + \"o\")\n elif dig[i] == '7':\n self.helper(i + 1, dig, ans, curr + \"p\")\n self.helper(i + 1, dig, ans, curr + \"q\")\n self.helper(i + 1, dig, ans, curr + \"r\")\n self.helper(i + 1, dig, ans, curr + \"s\")\n elif dig[i] == '8':\n self.helper(i + 1, dig, ans, curr + \"t\")\n self.helper(i + 1, dig, ans, curr + \"u\")\n self.helper(i + 1, dig, ans, curr + \"v\")\n else:\n self.helper(i + 1, dig, ans, curr + \"w\")\n self.helper(i + 1, dig, ans, curr + \"x\")\n self.helper(i + 1, dig, ans, curr + \"y\")\n self.helper(i + 1, dig, ans, curr + \"z\")","runtime":"30"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n d = {2: ['a', 'b', 'c'], \n 3: ['d', 'e', 'f'], \n 4: ['g', 'h', 'i'], \n 5: ['j', 'k', 'l'], \n 6: ['m', 'n', 'o'], \n 7: ['p', 'q', 'r', 's'], \n 8: ['t', 'u', 'v'], \n 9: ['w', 'x', 'y', 'z']\n }\n\n res = []\n \n def recursion(idx, comb):\n\n nonlocal res\n if len(comb) == len(digits):\n res.append(comb)\n return\n \n for j in d[int(digits[idx])]:\n # recursion(idx + 1, comb + j)\n\n comb += j\n idx += 1\n recursion(idx, comb)\n comb = comb[:-1]\n idx -= 1\n\n\n if len(digits) == 0:\n return []\n recursion(0, '')\n\n\n return res","runtime":"31"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n res = []\n if len(digits) == 0:\n return res\n\n nums = {\n '2': 'abc',\n '3': 'def',\n '4': 'ghi',\n '5': 'jkl',\n '6': 'mno',\n '7': 'pqrs',\n '8': 'tuv',\n '9': 'wxyz'\n }\n\n def backtrack(target, start_idx, path):\n if start_idx == len(target):\n res.append(''.join(path))\n return\n\n for val in nums[target[start_idx]]:\n path.append(val)\n backtrack(target, start_idx + 1, path)\n path.pop()\n\n backtrack(digits, 0, [])\n\n return res\n","runtime":"31"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> list[str]:\n if not digits:\n return []\n\n digitToLetters = ['', '', 'abc', 'def', 'ghi',\n 'jkl', 'mno', 'pqrs', 'tuv', 'wxyz']\n ans = []\n\n def dfs(i: int, path: list[str]) -> None:\n if i == len(digits):\n ans.append(''.join(path))\n return\n\n for letter in digitToLetters[int(digits[i])]:\n path.append(letter)\n dfs(i + 1, path)\n path.pop()\n\n dfs(0, [])\n return ans","runtime":"32"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n digits_to_letters = {\n '2': ['a', 'b', 'c'],\n '3': ['d', 'e', 'f'],\n '4': ['g', 'h', 'i'],\n '5': ['j', 'k', 'l'],\n '6': ['m', 'n', 'o'],\n '7': ['p', 'q', 'r', 's'],\n '8': ['t', 'u', 'v'],\n '9': ['w', 'x', 'y', 'z']\n }\n letter_combinations = [] \n for index, digit in enumerate(digits):\n new_letter_combinations = []\n for letter in digits_to_letters[digit]:\n if index == 0:\n new_letter_combinations.append(letter)\n for existing_combination in letter_combinations:\n new_letter_combinations.append(existing_combination + letter)\n letter_combinations = new_letter_combinations\n return letter_combinations\n\n\n ","runtime":"32"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return []\n hash = {\n \"2\" : \"abc\",\n \"3\" : \"def\",\n \"4\" : \"ghi\",\n \"5\" : \"jkl\",\n \"6\" : \"mno\",\n \"7\" : \"pqrs\",\n \"8\" : \"tuv\",\n \"9\" : \"wxyz\"\n }\n res = []\n \n def backtrack(start, path):\n if len(digits) == len(path):\n res.append(path)\n return\n \n for i in hash[digits[start]]:\n backtrack(start + 1, path + i)\n \n backtrack(0, \"\")\n \n return res","runtime":"33"},{"code":"\nLETTER_MAP = {\n \"2\": [\"a\", \"b\", \"c\"],\n \"3\": [\"d\", \"e\", \"f\"],\n \"4\": [\"g\", \"h\", \"i\"],\n \"5\": [\"j\", \"k\", \"l\"],\n \"6\": [\"m\", \"n\", \"o\"],\n \"7\": [\"p\", \"q\", \"r\", \"s\"],\n \"8\": [\"t\", \"u\", \"v\"],\n \"9\": [\"w\", \"x\", \"y\", \"z\"],\n}\n\n\nclass Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n \n if digits == \"\":\n return []\n\n combinations = self.create_combinations(digits)\n\n return combinations\n \n def create_combinations(self, digits, combinations = [], index = 0):\n\n if index >= len(digits):\n return combinations\n\n digit = digits[index]\n new_combinations = []\n for letter in LETTER_MAP[digit]:\n if len(combinations) > 0:\n for combination in combinations:\n new_combinations.append(combination + letter)\n else:\n new_combinations.append(letter)\n\n combinations = self.create_combinations(digits, new_combinations, index + 1)\n\n return combinations\n ","runtime":"33"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n\n if len(digits) == 0: return []\n\n letterMap = {\n \"2\":['a', 'b', 'c'],\n \"3\":['d', 'e', 'f'],\n \"4\":['g', 'h', 'i'],\n \"5\":['j', 'k', 'l'],\n \"6\":['m', 'n', 'o'],\n \"7\":['p', 'q', 'r', 's'],\n \"8\":['t', 'u', 'v'],\n \"9\":['w', 'x', 'y', 'z']\n }\n\n ans = []\n curr = []\n def backtrack(i):\n if i == len(digits): \n ans.append(\"\".join(curr))\n return\n for c in letterMap[digits[i]]:\n curr.append(c)\n backtrack(i+1)\n curr.pop()\n \n backtrack(0)\n return ans\n\n","runtime":"34"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if len(digits) == 0:\n return []\n\n letters = {\n \"2\": \"abc\",\n \"3\": \"def\",\n \"4\": \"ghi\",\n \"5\": \"jkl\",\n \"6\": \"mno\",\n \"7\": \"pqrs\",\n \"8\": \"tuv\",\n \"9\": \"wxyz\",\n }\n combinations = []\n\n def backtrack(index, path):\n if len(path) == len(digits):\n combinations.append(\"\".join(path))\n return\n\n possible_letters = letters[digits[index]]\n\n for letter in possible_letters:\n path.append(letter)\n\n backtrack(index+1, path)\n\n path.pop()\n\n backtrack(0, [])\n\n return combinations","runtime":"34"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n res = []\n digitsToChar = {\n 2: \"abc\",\n 3: \"def\",\n 4: \"ghi\",\n 5: \"jkl\",\n 6: \"mno\",\n 7: \"pqrs\",\n 8: \"tuv\",\n 9: \"wxyz\"\n }\n\n def backtrack(i, curStr):\n if i >= len(digits):\n res.append(curStr)\n return\n for c in digitsToChar[int(digits[i])]:\n backtrack(i+1, curStr + c)\n\n if digits:\n backtrack(0, \"\")\n return res ","runtime":"35"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return []\n\n dic={'2':['a','b','c'],\n '3':['d','e','f'],'4':['g','h','i'],'5':['j','k','l'],'6':['m','n','o'],\n '7':['p','q','r','s'],'8':['t','u','v'],'9':['w','x','y','z']}\n result=[]\n\n def backtracking(index,path):\n if index==len(digits):\n result.append(path)\n return\n letters=dic[digits[index]]\n for l in letters:\n backtracking(index+1,path+l)\n\n backtracking(0,\"\")\n return result\n \n\n \n\n\n","runtime":"35"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if len(digits) == 0:\n return []\n map = [\n \"\",\n \"\",\n \"abc\",\n \"def\",\n \"ghi\",\n \"jkl\",\n \"mno\",\n \"pqrs\",\n \"tuv\",\n \"wxyz\",\n ]\n result = list()\n path = list()\n\n def bt(digits, digit_idx):\n # base case\n if len(path) == len(digits):\n result.append(\"\".join(path))\n return\n if digit_idx >= len(digits):\n return\n\n # recursion\n for c in map[int(digits[digit_idx])]:\n path.append(c)\n bt(digits, digit_idx + 1)\n path.pop()\n\n bt(digits, 0)\n\n return result\n\n","runtime":"36"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n hashMap = {\"2\": \"abc\",\n \"3\": \"def\",\n \"4\": \"ghi\",\n \"5\": \"jkl\",\n \"6\": \"mno\",\n \"7\": \"pqrs\",\n \"8\": \"tuv\",\n \"9\": \"wxyz\"}\n res = []\n\n def backtracking(s, i):\n if i == len(digits):\n res.append(s)\n return\n \n for c in hashMap[digits[i]]:\n backtracking(s + c, i + 1)\n\n backtracking(\"\", 0)\n return [] if res[0] == \"\" else res\n\n\n ","runtime":"36"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n numbers = {\n \"2\": \"abc\",\n \"3\": \"def\",\n \"4\": \"ghi\",\n \"5\": \"jkl\",\n \"6\": \"mno\",\n \"7\": \"pqrs\",\n \"8\": \"tuv\",\n \"9\": \"wxyz\"\n }\n\n combinations = []\n\n def combine(arr1: List[str], arr2: List[str]) -> List[str]:\n arr3 = []\n for element1 in arr1:\n for element2 in arr2:\n arr3.append(element1 + element2)\n return arr3 if arr1 != [] else arr2\n \n for digit in digits:\n combinations = combine(combinations, numbers[digit])\n \n return combinations\n","runtime":"37"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n translate = {\n 2: \"abc\",\n 3: \"def\",\n 4: \"ghi\",\n 5: \"jkl\",\n 6: \"mno\",\n 7: \"pqrs\",\n 8: \"tuv\",\n 9: \"wxyz\"\n }\n if len(digits) == 0:\n return []\n translated = [translate[int(d)] for d in digits]\n return [\"\".join(i) for i in itertools.product(*translated)]\n ","runtime":"37"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return []\n sic = {\"2\" :\"abc\",\n \"3\" : \"def\",\"4\":\"ghi\",\"5\":\"jkl\",\"6\": \"mno\",\"7\": \"pqrs\"\n ,\"8\":\"tuv\",\"9\":\"wxyz\"}\n n = len(digits)\n ans, st = [],[]\n i = 0 \n def combi(i):\n if i == n:\n ans.append(\"\".join(st))\n return\n for s in sic[digits[i]]:\n st.append(s)\n combi(i+1)\n st.pop()\n combi(0)\n return ans","runtime":"38"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n pre_result = []\n if not digits:\n return []\n digits = list(digits)\n my_dict = {\n '2' : ['a','b','c'],\n '3' : ['d','e','f'],\n '4' : ['g','h','i'],\n '5' : ['j','k','l'],\n '6' : ['m','n','o'],\n '7' : ['p','q','r','s'],\n '8' : ['t','u','v'],\n '9' : ['w','x','y','z']\n\n }\n if len(digits) == 1:\n return my_dict[str(digits[0])]\n\n while len(digits)>1: \n if isinstance(digits[0], list):\n for letter_l in digits[0]:\n for letter_r in my_dict[str(digits[1])]:\n pre_result.append(letter_l + letter_r)\n print(pre_result)\n print(digits)\n \n\n else:\n for letter_l in my_dict[str(digits[0])]:\n for letter_r in my_dict[str(digits[1])]:\n pre_result.append(letter_l + letter_r)\n if len(digits) > 2:\n digits = digits[2::]\n else:\n\n digits = []\n digits.insert(0, pre_result) \n pre_result = []\n print(pre_result)\n print(digits)\n\n \n return digits[0]\n\n \n ","runtime":"38"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return []\n \n digit_to_letters = {\n '2': 'abc',\n '3': 'def',\n '4': 'ghi',\n '5': 'jkl',\n '6': 'mno',\n '7': 'pqrs',\n '8': 'tuv',\n '9': 'wxyz',\n }\n\n def backtrack(idx, comb):\n if idx == len(digits):\n res.append(comb[:])\n return\n \n for letter in digit_to_letters[digits[idx]]:\n backtrack(idx + 1, comb + letter)\n\n res = []\n backtrack(0, \"\")\n\n return res\n","runtime":"39"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return []\n \n result = []\n \n keyboard = {\n '2': 'abc',\n '3': 'def',\n '4': 'ghi',\n '5': 'jkl',\n '6': 'mno',\n '7': 'pqrs',\n '8': 'tuv',\n '9': 'wxyz'\n }\n\n def backtrack(index, path):\n if len(path) == len(digits):\n result.append(path)\n return\n \n possible_letters = keyboard[digits[index]]\n\n for letter in possible_letters:\n backtrack(index + 1, path + letter)\n \n backtrack(0, '')\n return result\n\n\n\n\n","runtime":"39"},{"code":"class Solution:\n\n def solve(self,digits,ans,index,output,keypad):\n if index>=len(digits):\n ans.append(output)\n return\n\n digit = digits[index]\n values = keypad[digit]\n\n for i in range(len(values)):\n output = output + values[i]\n self.solve(digits,ans,index+1,output,keypad)\n output=output[:-1]\n \n\n\n def letterCombinations(self, digits: str) -> List[str]:\n ans=[]\n index = 0\n output = \"\"\n keypad={\n \"2\":\"abc\",\n \"3\":\"def\",\n \"4\":\"ghi\",\n \"5\":\"jkl\",\n \"6\":\"mno\",\n \"7\":\"pqrs\",\n \"8\":\"tuv\",\n \"9\":\"wxyz\"\n }\n\n if len(digits)>0:\n self.solve(digits,ans,index,output,keypad)\n return ans\n return []\n ","runtime":"40"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n \n if len(digits) == 0:\n return []\n \n res = []\n \n digitMap = {\n '2': ['a', 'b', 'c'],\n '3': ['d', 'e', 'f'],\n '4': ['g', 'h', 'i'],\n '5': ['j', 'k', 'l'],\n '6': ['m', 'n', 'o'],\n '7': ['p', 'q', 'r', 's'],\n '8': ['t', 'u', 'v'],\n '9': ['w', 'x', 'y', 'z'],\n }\n \n def dfs(i, string):\n nonlocal res\n nonlocal digits\n \n if i == len(digits):\n res.append(string)\n return\n \n digit = digits[i]\n letters = digitMap[digit]\n \n for l in letters:\n dfs(i+1, string + l)\n \n dfs(0, '')\n return res\n \n \n# Input: digits = \"23\"\n# Output: [\"ad\",\"ae\",\"af\",\"bd\",\"be\",\"bf\",\"cd\",\"ce\",\"cf\"]\n \n \n# create a map of digit to letters\n# for each digit recursively try each character to get all permutations\n# keep track of all results and return after recursion","runtime":"40"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n hashMap = {\n \"2\" : \"abc\",\n \"3\" : \"def\",\n \"4\" : \"ghi\",\n \"5\" : \"jkl\",\n \"6\" : \"mno\",\n \"7\" : \"pqrs\",\n \"8\" : \"tuv\",\n \"9\" : \"wxyz\"\n }\n\n res = []\n\n def backTrack(i, curString):\n if len(curString) == len(digits):\n res.append(curString)\n return\n \n for c in hashMap[digits[i]]:\n backTrack(i + 1, curString + c)\n \n if digits:\n backTrack(0, \"\")\n \n return res\n\n\n\n\n","runtime":"41"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n hashMap = {\"2\": {\"a\", \"b\", \"c\"},\n \"3\": {\"d\", \"e\", \"f\"},\n \"4\": {\"g\", \"h\", \"i\"},\n \"5\": {\"j\", \"k\", \"l\"},\n \"6\": {\"m\", \"n\", \"o\"},\n \"7\": {\"p\", \"q\", \"r\", \"s\"},\n \"8\": {\"t\", \"u\", \"v\"},\n \"9\": {\"w\", \"x\", \"y\", \"z\"}}\n res = []\n\n def backtracking(s, i):\n if i == len(digits):\n res.append(s)\n return\n \n for c in hashMap[digits[i]]:\n backtracking(s + c, i + 1)\n\n backtracking(\"\", 0)\n return [] if res[0] == \"\" else res\n\n\n ","runtime":"41"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if(digits==''):\n return []\n d={\"2\":'abc' , \"3\":'def' , \"4\":'ghi' , \"5\":'jkl' , \"6\":'mno' , \"7\":'pqrs' , \"8\":'tuv' , \"9\":'wxyz'}\n sets=[]\n for i in digits:\n sets.append(list(d[i]))\n res=product(*sets)\n ans=[]\n for i in res:\n ans.append(''.join(i))\n return ans","runtime":"42"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n key = { \n '2' : ['a', 'b', 'c'],\n '3' : ('d', 'e', 'f'),\n '4' : ['g', 'h', 'i'],\n '5' : ['j', 'k', 'l'],\n '6' : ['m', 'n', 'o'],\n '7' : ['p', 'q', 'r', 's'],\n '8' : ['t', 'u', 'v'],\n '9' : ['w', 'x', 'y', 'z']\n }\n if len(digits) == 0: return []\n if len(digits) == 1: return key[digits]\n digits_arr = []\n for i in range(len(digits)):\n repeat_char = 1\n repeat_key = 1\n for j in range(i+1,len(digits)):\n repeat_char *= len(key[digits[j]])\n for j in range(i-1,-1,-1):\n repeat_key *= len(key[digits[j]])\n digit_key = []\n for k in key[digits[i]]:\n digit_key+=([k]*repeat_char)\n digit_key *= repeat_key\n print(len(digit_key))\n digits_arr.append(digit_key)\n print(digits_arr)\n return reduce(lambda x,y: map(lambda i,j: i + j,x,y),digits_arr[1:],digits_arr[0])\n\n","runtime":"42"}],"string":"[\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return []\\n \\n digit_to_letters = {\\n '2': 'abc',\\n '3': 'def',\\n '4': 'ghi',\\n '5': 'jkl',\\n '6': 'mno',\\n '7': 'pqrs',\\n '8': 'tuv',\\n '9': 'wxyz'\\n }\\n \\n queue = ['']\\n \\n for digit in digits:\\n letters = digit_to_letters[digit]\\n new_queue = []\\n \\n for combination in queue:\\n for letter in letters:\\n new_queue.append(combination + letter)\\n \\n queue = new_queue\\n \\n return queue\\n \\n\\n\\n \",\n \"runtime\": \"9\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.map = {\\n \\\"2\\\": \\\"abc\\\",\\n \\\"3\\\": \\\"def\\\",\\n \\\"4\\\": \\\"ghi\\\",\\n \\\"5\\\": \\\"jkl\\\",\\n \\\"6\\\": \\\"mno\\\",\\n \\\"7\\\": \\\"pqrs\\\",\\n \\\"8\\\": \\\"tuv\\\",\\n \\\"9\\\": \\\"wxyz\\\"\\n }\\n self.comboList = []\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return []\\n \\n self.combos(digits, \\\"\\\")\\n return self.comboList\\n \\n def combos(self, digits: str, currString: str):\\n if digits:\\n num = digits[0]\\n \\n for letter in self.map[num]:\\n self.combos(digits[1:], currString+letter)\\n \\n else:\\n self.comboList.append(currString)\\n\\n\\n \",\n \"runtime\": \"12\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return []\\n nums_dict = {\\n \\\"2\\\": \\\"abc\\\",\\n \\\"3\\\": \\\"def\\\", \\n \\\"4\\\": \\\"ghi\\\", \\n \\\"5\\\": \\\"jkl\\\", \\n \\\"6\\\": \\\"mno\\\", \\n \\\"7\\\": \\\"pqrs\\\",\\n \\\"8\\\": \\\"tuv\\\", \\n \\\"9\\\": \\\"wxyz\\\"\\n }\\n result = []\\n def dfs(index, path):\\n if index == len(digits):\\n str_digits = \\\"\\\".join(path)\\n result.append(str_digits)\\n return\\n current_digit = digits[index]\\n for letter in nums_dict[current_digit]:\\n # 2: abc \\n path.append(letter) \\n print(path)\\n dfs(index+1, path) \\n path.pop()\\n dfs(0, [])\\n return result \\n \",\n \"runtime\": \"14\"\n },\n {\n \"code\": \"class Solution:\\n letters = {\\n 2: \\\"abc\\\",\\n 3: \\\"def\\\",\\n 4: \\\"ghi\\\",\\n 5: \\\"jkl\\\",\\n 6: \\\"mno\\\",\\n 7: \\\"pqrs\\\",\\n 8: \\\"tuv\\\",\\n 9: \\\"wxyz\\\"\\n }\\n def letterCombinations(self, digits: str) -> List[str]:\\n if len(digits) == 0: return []\\n # Just return the letters in a list format\\n if len(digits) == 1: return [c for c in self.letters[int(digits)]]\\n i = digits[0]\\n res = []\\n restof = self.letterCombinations(digits[1:])\\n for c in self.letters[int(i)]:\\n res += [c + r for r in restof]\\n return res\",\n \"runtime\": \"15\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if(len(digits) == 0): return []\\n self.res = []\\n dic = {'2': \\\"abc\\\", '3': \\\"def\\\", '4': \\\"ghi\\\", '5': \\\"jkl\\\", '6': \\\"mno\\\", '7': \\\"pqrs\\\", '8': \\\"tuv\\\", '9': \\\"wxyz\\\"}\\n def dfs(ind):\\n if(ind == 0):\\n return [i for i in dic[digits[0]]]\\n new = []\\n temp = dfs(ind-1)\\n tb = dic[digits[ind]]\\n for i in temp:\\n for j in tb:\\n new.append(i+j)\\n return new\\n return dfs(len(digits)-1)\",\n \"runtime\": \"16\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n self.ans = []\\n self.n = len(digits)\\n self.map = {\\n \\\"2\\\": [\\\"a\\\", \\\"b\\\", \\\"c\\\"], \\n \\\"3\\\": [\\\"d\\\", \\\"e\\\", \\\"f\\\"], \\n \\\"4\\\": [\\\"g\\\", \\\"h\\\", \\\"i\\\"], \\n \\\"5\\\": [\\\"j\\\", \\\"k\\\", \\\"l\\\"], \\n \\\"6\\\": [\\\"m\\\", \\\"n\\\", \\\"o\\\"], \\n \\\"7\\\": [\\\"p\\\", \\\"q\\\", \\\"r\\\", \\\"s\\\"], \\n \\\"8\\\": [\\\"t\\\", \\\"u\\\", \\\"v\\\"], \\n \\\"9\\\": [\\\"w\\\", \\\"x\\\", \\\"y\\\", \\\"z\\\"]}\\n def recur(s, i):\\n if i == self.n:\\n self.ans.append(s)\\n return\\n for val in self.map[digits[i]]:\\n recur(s+val, i+1)\\n if not digits:\\n return []\\n recur(\\\"\\\", 0)\\n return self.ans \",\n \"runtime\": \"17\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return []\\n\\n phone_map = {\\n '2': 'abc',\\n '3': 'def',\\n '4': 'ghi',\\n '5': 'jkl',\\n '6': 'mno',\\n '7': 'pqrs',\\n '8': 'tuv',\\n '9': 'wxyz'\\n }\\n output = [] # 23 \\n def backtrack(combination, next_digits): \\n if len(next_digits) == 0:\\n output.append(combination)\\n else:\\n for letter in phone_map[next_digits[0]]:\\n backtrack(combination + letter, next_digits[1:])\\n\\n backtrack(\\\"\\\", digits)\\n return output\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n aa = ['abc','def','ghi','jkl','mno','pqrs','tuv','wxyz']\\n def letterCombinations(self, digits: str) -> List[str]:\\n return [] if len(digits)==0 else list(map(lambda t: ''.join(t), product(*map(lambda c:Solution.aa[ord(c) - ord('2')], digits))))\\n \",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"MAP_DICT={\\n '2':['a','b','c'],\\n '3':['d','e','f'],\\n '4':['g','h','i'],\\n '5':['j','k','l'],\\n '6':['m','n','o'],\\n '7':['p','q','r','s'],\\n '8':['t','u','v'],\\n '9':['w','x','y','z']\\n\\n}\\nclass Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if digits=='':\\n return []\\n\\n result = [''] \\n for digit in digits:\\n characters = MAP_DICT[digit]\\n result = [r+c for c in characters for r in result]\\n #print(result)\\n #result = set(result)\\n return result\\n\\n\\n \",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n \\n dic = {\\n '2': 'abc',\\n '3': 'def',\\n '4': 'ghi',\\n '5': 'jkl',\\n '6': 'mno',\\n '7': 'pqrs',\\n '8': 'tuv',\\n '9': 'wxyz',\\n }\\n\\n answer = []\\n\\n def backtrack(index, curr):\\n\\n \\n \\n if curr and len(curr) == len(digits):\\n answer.append(curr[:])\\n return \\n\\n for i, c in enumerate(digits[index:]):\\n\\n for letter in dic[c]:\\n curr += letter\\n backtrack(index+1, curr)\\n curr = curr[:-1]\\n\\n return\\n\\n backtrack(0, '')\\n return answer\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.map = ['', '', 'abc', 'def', 'ghi', 'jkl', 'mno', 'pqrs', 'tuv', 'wxyz']\\n\\n def helper(self, digits, ans, i, curr):\\n if i == len(digits):\\n ans.append(curr)\\n return\\n \\n s = self.map[int(digits[i])]\\n\\n for char in s:\\n self.helper(digits, ans, i+1, curr + char)\\n\\n def letterCombinations(self, digits):\\n #your code goes here\\n ans = []\\n\\n if not digits:\\n return ans\\n \\n self.helper(digits, ans, 0, '')\\n return ans\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n length = len(digits)\\n if length == 0:\\n return []\\n\\n combinations = []\\n\\n digitLetterMapping = {\\\"2\\\": \\\"abc\\\", \\\"3\\\": \\\"def\\\", \\\"4\\\": \\\"ghi\\\", \\\"5\\\": \\\"jkl\\\", \\\"6\\\": \\\"mno\\\", \\\"7\\\": \\\"pqrs\\\", \\\"8\\\": \\\"tuv\\\", \\\"9\\\": \\\"wxyz\\\",}\\n\\n def backtrack(index, path):\\n if len(path) == length:\\n combinations.append(\\\"\\\".join(path))\\n return\\n\\n for ch in digitLetterMapping[digits[index]]:\\n backtrack(index+1, path+[ch])\\n backtrack(0,[])\\n return combinations\\n\\n \",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n dis={\\n \\\"2\\\":\\\"abc\\\",\\n \\\"3\\\":\\\"def\\\",\\n \\\"4\\\":\\\"ghi\\\",\\n \\\"5\\\":\\\"jkl\\\",\\n \\\"6\\\":\\\"mno\\\",\\n \\\"7\\\":\\\"pqrs\\\",\\n \\\"8\\\":\\\"tuv\\\",\\n \\\"9\\\":\\\"wxyz\\\",\\n }\\n if not digits: return[]\\n output=[\\\"\\\"]\\n\\n for d in digits:\\n temp =[]\\n for v in dis[d]:\\n for o in output:\\n temp.append(o+v)\\n output = temp\\n return output \\n \",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return \\\"\\\"\\n \\n letters = [\\\"\\\",\\\"\\\",\\\"abc\\\",\\\"def\\\",\\\"ghi\\\",\\\"jkl\\\",\\\"mno\\\",\\\"pqrs\\\",\\\"tuv\\\",\\\"wxyz\\\"]\\n result = []\\n\\n def helper(index, buffer):\\n if index == len(digits):\\n result.append(''.join(buffer)) \\n return\\n\\n for x in letters[int(digits[index])]:\\n buffer.append(x)\\n helper(index+1, buffer)\\n buffer.pop()\\n\\n helper(0, [])\\n return result\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if digits==\\\"\\\": return []\\n res,sol=[],[]\\n n=len(digits)\\n di={'2':'abc','3':'def','4':'ghi','5':'jkl','6':'mno','7':'pqrs','8':'tuv','9':'wxyz'}\\n def f(i):\\n if len(sol)==n:\\n res.append(''.join(sol[:]))\\n return\\n for nums in di[digits[i]]:\\n sol.append(nums)\\n f(i+1)\\n sol.pop()\\n f(0)\\n return res\\n\\n \",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n \\n \\n keyboard = {\\n '2': 'abc',\\n '3': 'def',\\n '4': 'ghi',\\n '5': 'jkl',\\n '6': 'mno',\\n '7': 'pqrs',\\n '8': 'tuv',\\n '9': 'wxyz',\\n }\\n\\n if not digits:\\n return []\\n result = []\\n def backtracking(index, combination):\\n if index == len(digits):\\n result.append(combination)\\n return\\n \\n for letter in keyboard[digits[index]]:\\n backtracking(index + 1, combination + letter)\\n \\n backtracking(0, \\\"\\\")\\n return result\\n\\n\\n\\n\\n \",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return []\\n \\n letters = {\\n \\\"2\\\": \\\"abc\\\",\\n \\\"3\\\": \\\"def\\\",\\n \\\"4\\\": \\\"ghi\\\",\\n \\\"5\\\": \\\"jkl\\\",\\n \\\"6\\\": \\\"mno\\\",\\n \\\"7\\\": \\\"pqrs\\\",\\n \\\"8\\\": \\\"tuv\\\",\\n \\\"9\\\": \\\"wxyz\\\",\\n }\\n\\n def backtrack(idx, path):\\n if len(path) == len(digits):\\n combinations.append(\\\"\\\".join(path))\\n return\\n \\n possible_char = letters[digits[idx]]\\n for letter in possible_char:\\n path.append(letter)\\n backtrack(idx+1, path)\\n path.pop()\\n \\n combinations = []\\n backtrack(0,[])\\n return combinations\\n \",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if digits=='':\\n return []\\n d={\\n \\\"2\\\": [\\\"a\\\", \\\"b\\\", \\\"c\\\"],\\n \\\"3\\\": [\\\"d\\\", \\\"e\\\", \\\"f\\\"],\\n \\\"4\\\": [\\\"g\\\", \\\"h\\\", \\\"i\\\"],\\n \\\"5\\\": [\\\"j\\\", \\\"k\\\", \\\"l\\\"],\\n \\\"6\\\": [\\\"m\\\", \\\"n\\\", \\\"o\\\"],\\n \\\"7\\\": [\\\"p\\\", \\\"q\\\", \\\"r\\\", \\\"s\\\"],\\n \\\"8\\\": [\\\"t\\\", \\\"u\\\", \\\"v\\\"],\\n \\\"9\\\": [\\\"w\\\", \\\"x\\\", \\\"y\\\", \\\"z\\\"]\\n }\\n\\n def backtrack(temp, i):\\n if(len(temp)==len(digits)):\\n result.append(temp)\\n return\\n for j in range(len(d[digits[i]])):\\n temp+=d[digits[i]][j]\\n backtrack(temp, i+1)\\n temp=temp[:-1]\\n result=[]\\n backtrack('', 0)\\n return result\\n \",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"from itertools import product\\nclass Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n letter_mapping = {\\n \\\"2\\\": [\\\"a\\\", \\\"b\\\", \\\"c\\\"],\\n \\\"3\\\": [\\\"d\\\", \\\"e\\\", \\\"f\\\"],\\n \\\"4\\\": [\\\"g\\\", \\\"h\\\", \\\"i\\\"],\\n \\\"5\\\": [\\\"j\\\", \\\"k\\\", \\\"l\\\"],\\n \\\"6\\\": [\\\"m\\\", \\\"n\\\", \\\"o\\\"],\\n \\\"7\\\": [\\\"p\\\", \\\"q\\\", \\\"r\\\", \\\"s\\\"],\\n \\\"8\\\": [\\\"t\\\", \\\"u\\\", \\\"v\\\"],\\n \\\"9\\\": [\\\"w\\\", \\\"x\\\", \\\"y\\\", \\\"z\\\"],\\n }\\n if len(digits) == 0:\\n return []\\n return [\\n \\\"\\\".join(prod_str)\\n for prod_str in product(\\n *[\\n letter_mapping[char]\\n for char\\n in digits\\n ])]\\n\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n phone_map = {\\n '2': ['a', 'b', 'c'],\\n '3': ['d', 'e', 'f'],\\n '4': ['g', 'h', 'i'],\\n '5': ['j', 'k', 'l'],\\n '6': ['m', 'n', 'o'],\\n '7': ['p', 'q', 'r', 's'],\\n '8': ['t', 'u', 'v'],\\n '9': ['w', 'x', 'y', 'z']\\n }\\n \\n def dfs(idx, cur):\\n if len(cur) == len(digits):\\n fin.append(cur[:])\\n return\\n\\n current = digits[idx]\\n for j in phone_map[current]:\\n cur += j\\n dfs(idx + 1, cur)\\n cur = cur[:-1]\\n \\n if len(digits) == 0:\\n return []\\n fin = []\\n dfs( 0, \\\"\\\")\\n return fin\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n digitLetterMap = {'2': 'abc', '3': 'def', '4': 'ghi', '5': 'jkl', '6': 'mno', '7': 'pqrs', '8': 'tuv', '9': 'wxyz'}\\n\\n if len(digits) == 0:\\n return []\\n\\n def helper(digits: str, idx: int, res: List[str], curr: string, n: int):\\n if(idx > n):\\n res.append(curr)\\n return\\n\\n # get the mapping value\\n mapValue = digitLetterMap.get(digits[idx])\\n \\n # get total choices\\n for i in range(len(mapValue)):\\n helper(digits, idx + 1, res, curr + mapValue[i], n)\\n\\n return res\\n\\n return helper(digits, 0, [], \\\"\\\", len(digits) - 1)\\n\\n\\n \",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n pre_result = []\\n if not digits:\\n return []\\n digits = list(digits)\\n my_dict = {\\n '2' : ['a','b','c'],\\n '3' : ['d','e','f'],\\n '4' : ['g','h','i'],\\n '5' : ['j','k','l'],\\n '6' : ['m','n','o'],\\n '7' : ['p','q','r','s'],\\n '8' : ['t','u','v'],\\n '9' : ['w','x','y','z']\\n\\n }\\n if len(digits) == 1:\\n return my_dict[str(digits[0])]\\n\\n while len(digits)>1: \\n if isinstance(digits[0], list):\\n for letter_l in digits[0]:\\n for letter_r in my_dict[str(digits[1])]:\\n pre_result.append(letter_l + letter_r)\\n \\n\\n else:\\n for letter_l in my_dict[str(digits[0])]:\\n for letter_r in my_dict[str(digits[1])]:\\n pre_result.append(letter_l + letter_r)\\n if len(digits) > 2:\\n digits = digits[2::]\\n else:\\n\\n digits = []\\n digits.insert(0, pre_result) \\n pre_result = []\\n\\n \\n return digits[0]\\n\\n \\n \",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return []\\n \\n # Mapping from digit to letters\\n digit_to_letters = {\\n '2': 'abc', '3': 'def', '4': 'ghi', '5': 'jkl',\\n '6': 'mno', '7': 'pqrs', '8': 'tuv', '9': 'wxyz'\\n }\\n \\n # List to store the result combinations\\n result = []\\n \\n # Helper function for backtracking\\n def backtrack(index: int, path: str) -> None:\\n # If the current path length matches the digits length, add to result\\n if index == len(digits):\\n result.append(path)\\n return\\n \\n # Get the letters corresponding to the current digit\\n current_digit = digits[index]\\n letters = digit_to_letters[current_digit]\\n \\n # Recurse for each letter\\n for letter in letters:\\n backtrack(index + 1, path + letter)\\n \\n # Start backtracking from the first digit\\n backtrack(0, \\\"\\\")\\n \\n return result\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n diction = {\\n 2: ['a', 'b', 'c'],\\n 3: ['d', 'e', 'f'],\\n 4: ['g', 'h', 'i'],\\n 5: ['j', 'k', 'l'],\\n 6: ['m', 'n', 'o'],\\n 7: ['p', 'q', 'r', 's'],\\n 8: ['t', 'u', 'v'],\\n 9: ['w', 'x', 'y', 'z']\\n }\\n\\n if len(digits) == 0:\\n return []\\n\\n output_list = []\\n max_lens = []\\n\\n # Prepare max_lens to track number of letters per digit\\n for i in range(len(digits)):\\n max_lens.append(len(diction[int(digits[i])]))\\n\\n tracker = [0] * len(max_lens)\\n output_len = 1\\n\\n # Calculate the total number of combinations\\n for i in range(len(max_lens)):\\n output_len = output_len * max_lens[i]\\n\\n # Generate combinations\\n for i in range(output_len):\\n o_str = \\\"\\\"\\n for j in range(len(max_lens)):\\n o_str += diction[int(digits[j])][tracker[j]]\\n\\n # Append the current combination to output_list\\n output_list.append(o_str)\\n\\n # Update the tracker for the next combination\\n for j in range(len(tracker) - 1, -1, -1):\\n tracker[j] += 1\\n if tracker[j] < max_lens[j]:\\n break\\n tracker[j] = 0\\n\\n return output_list\\n\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n\\n res = []\\n\\n map = { \\\"2\\\": \\\"abc\\\",\\n \\\"3\\\": \\\"def\\\",\\n \\\"4\\\": \\\"ghi\\\",\\n \\\"5\\\": \\\"jkl\\\",\\n \\\"6\\\": \\\"mno\\\",\\n \\\"7\\\": \\\"qprs\\\",\\n \\\"8\\\": \\\"tuv\\\",\\n \\\"9\\\": \\\"wxyz\\\" }\\n\\n def backtracking(i, cur):\\n if len(cur) == len(digits):\\n res.append(cur)\\n return\\n \\n for c in map[digits[i]]:\\n backtracking(i+1, cur + c)\\n\\n if digits:\\n backtracking(0, \\\"\\\")\\n\\n return res\\n\\n \\n \\n\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n ans = []\\n dig = list(digits)\\n self.helper(0, dig, ans, \\\"\\\")\\n if ans and ans[0] == \\\"\\\":\\n ans.pop(0)\\n return ans\\n\\n def helper(self, i, dig, ans, curr):\\n if i == len(dig):\\n ans.append(curr)\\n return\\n if dig[i] == '2':\\n self.helper(i + 1, dig, ans, curr + \\\"a\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"b\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"c\\\")\\n elif dig[i] == '3':\\n self.helper(i + 1, dig, ans, curr + \\\"d\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"e\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"f\\\")\\n elif dig[i] == '4':\\n self.helper(i + 1, dig, ans, curr + \\\"g\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"h\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"i\\\")\\n elif dig[i] == '5':\\n self.helper(i + 1, dig, ans, curr + \\\"j\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"k\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"l\\\")\\n elif dig[i] == '6':\\n self.helper(i + 1, dig, ans, curr + \\\"m\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"n\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"o\\\")\\n elif dig[i] == '7':\\n self.helper(i + 1, dig, ans, curr + \\\"p\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"q\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"r\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"s\\\")\\n elif dig[i] == '8':\\n self.helper(i + 1, dig, ans, curr + \\\"t\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"u\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"v\\\")\\n else:\\n self.helper(i + 1, dig, ans, curr + \\\"w\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"x\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"y\\\")\\n self.helper(i + 1, dig, ans, curr + \\\"z\\\")\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n d = {2: ['a', 'b', 'c'], \\n 3: ['d', 'e', 'f'], \\n 4: ['g', 'h', 'i'], \\n 5: ['j', 'k', 'l'], \\n 6: ['m', 'n', 'o'], \\n 7: ['p', 'q', 'r', 's'], \\n 8: ['t', 'u', 'v'], \\n 9: ['w', 'x', 'y', 'z']\\n }\\n\\n res = []\\n \\n def recursion(idx, comb):\\n\\n nonlocal res\\n if len(comb) == len(digits):\\n res.append(comb)\\n return\\n \\n for j in d[int(digits[idx])]:\\n # recursion(idx + 1, comb + j)\\n\\n comb += j\\n idx += 1\\n recursion(idx, comb)\\n comb = comb[:-1]\\n idx -= 1\\n\\n\\n if len(digits) == 0:\\n return []\\n recursion(0, '')\\n\\n\\n return res\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n res = []\\n if len(digits) == 0:\\n return res\\n\\n nums = {\\n '2': 'abc',\\n '3': 'def',\\n '4': 'ghi',\\n '5': 'jkl',\\n '6': 'mno',\\n '7': 'pqrs',\\n '8': 'tuv',\\n '9': 'wxyz'\\n }\\n\\n def backtrack(target, start_idx, path):\\n if start_idx == len(target):\\n res.append(''.join(path))\\n return\\n\\n for val in nums[target[start_idx]]:\\n path.append(val)\\n backtrack(target, start_idx + 1, path)\\n path.pop()\\n\\n backtrack(digits, 0, [])\\n\\n return res\\n\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> list[str]:\\n if not digits:\\n return []\\n\\n digitToLetters = ['', '', 'abc', 'def', 'ghi',\\n 'jkl', 'mno', 'pqrs', 'tuv', 'wxyz']\\n ans = []\\n\\n def dfs(i: int, path: list[str]) -> None:\\n if i == len(digits):\\n ans.append(''.join(path))\\n return\\n\\n for letter in digitToLetters[int(digits[i])]:\\n path.append(letter)\\n dfs(i + 1, path)\\n path.pop()\\n\\n dfs(0, [])\\n return ans\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n digits_to_letters = {\\n '2': ['a', 'b', 'c'],\\n '3': ['d', 'e', 'f'],\\n '4': ['g', 'h', 'i'],\\n '5': ['j', 'k', 'l'],\\n '6': ['m', 'n', 'o'],\\n '7': ['p', 'q', 'r', 's'],\\n '8': ['t', 'u', 'v'],\\n '9': ['w', 'x', 'y', 'z']\\n }\\n letter_combinations = [] \\n for index, digit in enumerate(digits):\\n new_letter_combinations = []\\n for letter in digits_to_letters[digit]:\\n if index == 0:\\n new_letter_combinations.append(letter)\\n for existing_combination in letter_combinations:\\n new_letter_combinations.append(existing_combination + letter)\\n letter_combinations = new_letter_combinations\\n return letter_combinations\\n\\n\\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return []\\n hash = {\\n \\\"2\\\" : \\\"abc\\\",\\n \\\"3\\\" : \\\"def\\\",\\n \\\"4\\\" : \\\"ghi\\\",\\n \\\"5\\\" : \\\"jkl\\\",\\n \\\"6\\\" : \\\"mno\\\",\\n \\\"7\\\" : \\\"pqrs\\\",\\n \\\"8\\\" : \\\"tuv\\\",\\n \\\"9\\\" : \\\"wxyz\\\"\\n }\\n res = []\\n \\n def backtrack(start, path):\\n if len(digits) == len(path):\\n res.append(path)\\n return\\n \\n for i in hash[digits[start]]:\\n backtrack(start + 1, path + i)\\n \\n backtrack(0, \\\"\\\")\\n \\n return res\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"\\nLETTER_MAP = {\\n \\\"2\\\": [\\\"a\\\", \\\"b\\\", \\\"c\\\"],\\n \\\"3\\\": [\\\"d\\\", \\\"e\\\", \\\"f\\\"],\\n \\\"4\\\": [\\\"g\\\", \\\"h\\\", \\\"i\\\"],\\n \\\"5\\\": [\\\"j\\\", \\\"k\\\", \\\"l\\\"],\\n \\\"6\\\": [\\\"m\\\", \\\"n\\\", \\\"o\\\"],\\n \\\"7\\\": [\\\"p\\\", \\\"q\\\", \\\"r\\\", \\\"s\\\"],\\n \\\"8\\\": [\\\"t\\\", \\\"u\\\", \\\"v\\\"],\\n \\\"9\\\": [\\\"w\\\", \\\"x\\\", \\\"y\\\", \\\"z\\\"],\\n}\\n\\n\\nclass Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n \\n if digits == \\\"\\\":\\n return []\\n\\n combinations = self.create_combinations(digits)\\n\\n return combinations\\n \\n def create_combinations(self, digits, combinations = [], index = 0):\\n\\n if index >= len(digits):\\n return combinations\\n\\n digit = digits[index]\\n new_combinations = []\\n for letter in LETTER_MAP[digit]:\\n if len(combinations) > 0:\\n for combination in combinations:\\n new_combinations.append(combination + letter)\\n else:\\n new_combinations.append(letter)\\n\\n combinations = self.create_combinations(digits, new_combinations, index + 1)\\n\\n return combinations\\n \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n\\n if len(digits) == 0: return []\\n\\n letterMap = {\\n \\\"2\\\":['a', 'b', 'c'],\\n \\\"3\\\":['d', 'e', 'f'],\\n \\\"4\\\":['g', 'h', 'i'],\\n \\\"5\\\":['j', 'k', 'l'],\\n \\\"6\\\":['m', 'n', 'o'],\\n \\\"7\\\":['p', 'q', 'r', 's'],\\n \\\"8\\\":['t', 'u', 'v'],\\n \\\"9\\\":['w', 'x', 'y', 'z']\\n }\\n\\n ans = []\\n curr = []\\n def backtrack(i):\\n if i == len(digits): \\n ans.append(\\\"\\\".join(curr))\\n return\\n for c in letterMap[digits[i]]:\\n curr.append(c)\\n backtrack(i+1)\\n curr.pop()\\n \\n backtrack(0)\\n return ans\\n\\n\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if len(digits) == 0:\\n return []\\n\\n letters = {\\n \\\"2\\\": \\\"abc\\\",\\n \\\"3\\\": \\\"def\\\",\\n \\\"4\\\": \\\"ghi\\\",\\n \\\"5\\\": \\\"jkl\\\",\\n \\\"6\\\": \\\"mno\\\",\\n \\\"7\\\": \\\"pqrs\\\",\\n \\\"8\\\": \\\"tuv\\\",\\n \\\"9\\\": \\\"wxyz\\\",\\n }\\n combinations = []\\n\\n def backtrack(index, path):\\n if len(path) == len(digits):\\n combinations.append(\\\"\\\".join(path))\\n return\\n\\n possible_letters = letters[digits[index]]\\n\\n for letter in possible_letters:\\n path.append(letter)\\n\\n backtrack(index+1, path)\\n\\n path.pop()\\n\\n backtrack(0, [])\\n\\n return combinations\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n res = []\\n digitsToChar = {\\n 2: \\\"abc\\\",\\n 3: \\\"def\\\",\\n 4: \\\"ghi\\\",\\n 5: \\\"jkl\\\",\\n 6: \\\"mno\\\",\\n 7: \\\"pqrs\\\",\\n 8: \\\"tuv\\\",\\n 9: \\\"wxyz\\\"\\n }\\n\\n def backtrack(i, curStr):\\n if i >= len(digits):\\n res.append(curStr)\\n return\\n for c in digitsToChar[int(digits[i])]:\\n backtrack(i+1, curStr + c)\\n\\n if digits:\\n backtrack(0, \\\"\\\")\\n return res \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return []\\n\\n dic={'2':['a','b','c'],\\n '3':['d','e','f'],'4':['g','h','i'],'5':['j','k','l'],'6':['m','n','o'],\\n '7':['p','q','r','s'],'8':['t','u','v'],'9':['w','x','y','z']}\\n result=[]\\n\\n def backtracking(index,path):\\n if index==len(digits):\\n result.append(path)\\n return\\n letters=dic[digits[index]]\\n for l in letters:\\n backtracking(index+1,path+l)\\n\\n backtracking(0,\\\"\\\")\\n return result\\n \\n\\n \\n\\n\\n\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if len(digits) == 0:\\n return []\\n map = [\\n \\\"\\\",\\n \\\"\\\",\\n \\\"abc\\\",\\n \\\"def\\\",\\n \\\"ghi\\\",\\n \\\"jkl\\\",\\n \\\"mno\\\",\\n \\\"pqrs\\\",\\n \\\"tuv\\\",\\n \\\"wxyz\\\",\\n ]\\n result = list()\\n path = list()\\n\\n def bt(digits, digit_idx):\\n # base case\\n if len(path) == len(digits):\\n result.append(\\\"\\\".join(path))\\n return\\n if digit_idx >= len(digits):\\n return\\n\\n # recursion\\n for c in map[int(digits[digit_idx])]:\\n path.append(c)\\n bt(digits, digit_idx + 1)\\n path.pop()\\n\\n bt(digits, 0)\\n\\n return result\\n\\n\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n hashMap = {\\\"2\\\": \\\"abc\\\",\\n \\\"3\\\": \\\"def\\\",\\n \\\"4\\\": \\\"ghi\\\",\\n \\\"5\\\": \\\"jkl\\\",\\n \\\"6\\\": \\\"mno\\\",\\n \\\"7\\\": \\\"pqrs\\\",\\n \\\"8\\\": \\\"tuv\\\",\\n \\\"9\\\": \\\"wxyz\\\"}\\n res = []\\n\\n def backtracking(s, i):\\n if i == len(digits):\\n res.append(s)\\n return\\n \\n for c in hashMap[digits[i]]:\\n backtracking(s + c, i + 1)\\n\\n backtracking(\\\"\\\", 0)\\n return [] if res[0] == \\\"\\\" else res\\n\\n\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n numbers = {\\n \\\"2\\\": \\\"abc\\\",\\n \\\"3\\\": \\\"def\\\",\\n \\\"4\\\": \\\"ghi\\\",\\n \\\"5\\\": \\\"jkl\\\",\\n \\\"6\\\": \\\"mno\\\",\\n \\\"7\\\": \\\"pqrs\\\",\\n \\\"8\\\": \\\"tuv\\\",\\n \\\"9\\\": \\\"wxyz\\\"\\n }\\n\\n combinations = []\\n\\n def combine(arr1: List[str], arr2: List[str]) -> List[str]:\\n arr3 = []\\n for element1 in arr1:\\n for element2 in arr2:\\n arr3.append(element1 + element2)\\n return arr3 if arr1 != [] else arr2\\n \\n for digit in digits:\\n combinations = combine(combinations, numbers[digit])\\n \\n return combinations\\n\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n translate = {\\n 2: \\\"abc\\\",\\n 3: \\\"def\\\",\\n 4: \\\"ghi\\\",\\n 5: \\\"jkl\\\",\\n 6: \\\"mno\\\",\\n 7: \\\"pqrs\\\",\\n 8: \\\"tuv\\\",\\n 9: \\\"wxyz\\\"\\n }\\n if len(digits) == 0:\\n return []\\n translated = [translate[int(d)] for d in digits]\\n return [\\\"\\\".join(i) for i in itertools.product(*translated)]\\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return []\\n sic = {\\\"2\\\" :\\\"abc\\\",\\n \\\"3\\\" : \\\"def\\\",\\\"4\\\":\\\"ghi\\\",\\\"5\\\":\\\"jkl\\\",\\\"6\\\": \\\"mno\\\",\\\"7\\\": \\\"pqrs\\\"\\n ,\\\"8\\\":\\\"tuv\\\",\\\"9\\\":\\\"wxyz\\\"}\\n n = len(digits)\\n ans, st = [],[]\\n i = 0 \\n def combi(i):\\n if i == n:\\n ans.append(\\\"\\\".join(st))\\n return\\n for s in sic[digits[i]]:\\n st.append(s)\\n combi(i+1)\\n st.pop()\\n combi(0)\\n return ans\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n pre_result = []\\n if not digits:\\n return []\\n digits = list(digits)\\n my_dict = {\\n '2' : ['a','b','c'],\\n '3' : ['d','e','f'],\\n '4' : ['g','h','i'],\\n '5' : ['j','k','l'],\\n '6' : ['m','n','o'],\\n '7' : ['p','q','r','s'],\\n '8' : ['t','u','v'],\\n '9' : ['w','x','y','z']\\n\\n }\\n if len(digits) == 1:\\n return my_dict[str(digits[0])]\\n\\n while len(digits)>1: \\n if isinstance(digits[0], list):\\n for letter_l in digits[0]:\\n for letter_r in my_dict[str(digits[1])]:\\n pre_result.append(letter_l + letter_r)\\n print(pre_result)\\n print(digits)\\n \\n\\n else:\\n for letter_l in my_dict[str(digits[0])]:\\n for letter_r in my_dict[str(digits[1])]:\\n pre_result.append(letter_l + letter_r)\\n if len(digits) > 2:\\n digits = digits[2::]\\n else:\\n\\n digits = []\\n digits.insert(0, pre_result) \\n pre_result = []\\n print(pre_result)\\n print(digits)\\n\\n \\n return digits[0]\\n\\n \\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return []\\n \\n digit_to_letters = {\\n '2': 'abc',\\n '3': 'def',\\n '4': 'ghi',\\n '5': 'jkl',\\n '6': 'mno',\\n '7': 'pqrs',\\n '8': 'tuv',\\n '9': 'wxyz',\\n }\\n\\n def backtrack(idx, comb):\\n if idx == len(digits):\\n res.append(comb[:])\\n return\\n \\n for letter in digit_to_letters[digits[idx]]:\\n backtrack(idx + 1, comb + letter)\\n\\n res = []\\n backtrack(0, \\\"\\\")\\n\\n return res\\n\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return []\\n \\n result = []\\n \\n keyboard = {\\n '2': 'abc',\\n '3': 'def',\\n '4': 'ghi',\\n '5': 'jkl',\\n '6': 'mno',\\n '7': 'pqrs',\\n '8': 'tuv',\\n '9': 'wxyz'\\n }\\n\\n def backtrack(index, path):\\n if len(path) == len(digits):\\n result.append(path)\\n return\\n \\n possible_letters = keyboard[digits[index]]\\n\\n for letter in possible_letters:\\n backtrack(index + 1, path + letter)\\n \\n backtrack(0, '')\\n return result\\n\\n\\n\\n\\n\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n\\n def solve(self,digits,ans,index,output,keypad):\\n if index>=len(digits):\\n ans.append(output)\\n return\\n\\n digit = digits[index]\\n values = keypad[digit]\\n\\n for i in range(len(values)):\\n output = output + values[i]\\n self.solve(digits,ans,index+1,output,keypad)\\n output=output[:-1]\\n \\n\\n\\n def letterCombinations(self, digits: str) -> List[str]:\\n ans=[]\\n index = 0\\n output = \\\"\\\"\\n keypad={\\n \\\"2\\\":\\\"abc\\\",\\n \\\"3\\\":\\\"def\\\",\\n \\\"4\\\":\\\"ghi\\\",\\n \\\"5\\\":\\\"jkl\\\",\\n \\\"6\\\":\\\"mno\\\",\\n \\\"7\\\":\\\"pqrs\\\",\\n \\\"8\\\":\\\"tuv\\\",\\n \\\"9\\\":\\\"wxyz\\\"\\n }\\n\\n if len(digits)>0:\\n self.solve(digits,ans,index,output,keypad)\\n return ans\\n return []\\n \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n \\n if len(digits) == 0:\\n return []\\n \\n res = []\\n \\n digitMap = {\\n '2': ['a', 'b', 'c'],\\n '3': ['d', 'e', 'f'],\\n '4': ['g', 'h', 'i'],\\n '5': ['j', 'k', 'l'],\\n '6': ['m', 'n', 'o'],\\n '7': ['p', 'q', 'r', 's'],\\n '8': ['t', 'u', 'v'],\\n '9': ['w', 'x', 'y', 'z'],\\n }\\n \\n def dfs(i, string):\\n nonlocal res\\n nonlocal digits\\n \\n if i == len(digits):\\n res.append(string)\\n return\\n \\n digit = digits[i]\\n letters = digitMap[digit]\\n \\n for l in letters:\\n dfs(i+1, string + l)\\n \\n dfs(0, '')\\n return res\\n \\n \\n# Input: digits = \\\"23\\\"\\n# Output: [\\\"ad\\\",\\\"ae\\\",\\\"af\\\",\\\"bd\\\",\\\"be\\\",\\\"bf\\\",\\\"cd\\\",\\\"ce\\\",\\\"cf\\\"]\\n \\n \\n# create a map of digit to letters\\n# for each digit recursively try each character to get all permutations\\n# keep track of all results and return after recursion\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n hashMap = {\\n \\\"2\\\" : \\\"abc\\\",\\n \\\"3\\\" : \\\"def\\\",\\n \\\"4\\\" : \\\"ghi\\\",\\n \\\"5\\\" : \\\"jkl\\\",\\n \\\"6\\\" : \\\"mno\\\",\\n \\\"7\\\" : \\\"pqrs\\\",\\n \\\"8\\\" : \\\"tuv\\\",\\n \\\"9\\\" : \\\"wxyz\\\"\\n }\\n\\n res = []\\n\\n def backTrack(i, curString):\\n if len(curString) == len(digits):\\n res.append(curString)\\n return\\n \\n for c in hashMap[digits[i]]:\\n backTrack(i + 1, curString + c)\\n \\n if digits:\\n backTrack(0, \\\"\\\")\\n \\n return res\\n\\n\\n\\n\\n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n hashMap = {\\\"2\\\": {\\\"a\\\", \\\"b\\\", \\\"c\\\"},\\n \\\"3\\\": {\\\"d\\\", \\\"e\\\", \\\"f\\\"},\\n \\\"4\\\": {\\\"g\\\", \\\"h\\\", \\\"i\\\"},\\n \\\"5\\\": {\\\"j\\\", \\\"k\\\", \\\"l\\\"},\\n \\\"6\\\": {\\\"m\\\", \\\"n\\\", \\\"o\\\"},\\n \\\"7\\\": {\\\"p\\\", \\\"q\\\", \\\"r\\\", \\\"s\\\"},\\n \\\"8\\\": {\\\"t\\\", \\\"u\\\", \\\"v\\\"},\\n \\\"9\\\": {\\\"w\\\", \\\"x\\\", \\\"y\\\", \\\"z\\\"}}\\n res = []\\n\\n def backtracking(s, i):\\n if i == len(digits):\\n res.append(s)\\n return\\n \\n for c in hashMap[digits[i]]:\\n backtracking(s + c, i + 1)\\n\\n backtracking(\\\"\\\", 0)\\n return [] if res[0] == \\\"\\\" else res\\n\\n\\n \",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if(digits==''):\\n return []\\n d={\\\"2\\\":'abc' , \\\"3\\\":'def' , \\\"4\\\":'ghi' , \\\"5\\\":'jkl' , \\\"6\\\":'mno' , \\\"7\\\":'pqrs' , \\\"8\\\":'tuv' , \\\"9\\\":'wxyz'}\\n sets=[]\\n for i in digits:\\n sets.append(list(d[i]))\\n res=product(*sets)\\n ans=[]\\n for i in res:\\n ans.append(''.join(i))\\n return ans\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n key = { \\n '2' : ['a', 'b', 'c'],\\n '3' : ('d', 'e', 'f'),\\n '4' : ['g', 'h', 'i'],\\n '5' : ['j', 'k', 'l'],\\n '6' : ['m', 'n', 'o'],\\n '7' : ['p', 'q', 'r', 's'],\\n '8' : ['t', 'u', 'v'],\\n '9' : ['w', 'x', 'y', 'z']\\n }\\n if len(digits) == 0: return []\\n if len(digits) == 1: return key[digits]\\n digits_arr = []\\n for i in range(len(digits)):\\n repeat_char = 1\\n repeat_key = 1\\n for j in range(i+1,len(digits)):\\n repeat_char *= len(key[digits[j]])\\n for j in range(i-1,-1,-1):\\n repeat_key *= len(key[digits[j]])\\n digit_key = []\\n for k in key[digits[i]]:\\n digit_key+=([k]*repeat_char)\\n digit_key *= repeat_key\\n print(len(digit_key))\\n digits_arr.append(digit_key)\\n print(digits_arr)\\n return reduce(lambda x,y: map(lambda i,j: i + j,x,y),digits_arr[1:],digits_arr[0])\\n\\n\",\n \"runtime\": \"42\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":50,"string":"50"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return []\n \n # Mapping of digits to corresponding letters\n phone = {\n '2': 'abc', '3': 'def', '4': 'ghi', '5': 'jkl',\n '6': 'mno', '7': 'pqrs', '8': 'tuv', '9': 'wxyz'\n }\n \n # List to store the result\n result = []\n \n # Backtracking function\n def backtrack(index, current_combination):\n # If the combination is complete, add it to the result list\n if index == len(digits):\n result.append(current_combination)\n return\n \n # Get the letters that the current digit maps to\n letters = phone[digits[index]]\n \n # Loop through the letters and recurse\n for letter in letters:\n backtrack(index + 1, current_combination + letter)\n \n # Initiate backtracking\n backtrack(0, \"\")\n \n return result\n ","memory":"16000"},{"code":"letter_dict = {\n 2: [\"a\", \"b\", \"c\"],\n 3: [\"d\", \"e\", \"f\"],\n 4: [\"g\", \"h\", \"i\"],\n 5: [\"j\", \"k\", \"l\"],\n 6: [\"m\", \"n\", \"o\"],\n 7: [\"p\", \"q\", \"r\", \"s\"],\n 8: [\"t\", \"u\", \"v\"],\n 9: [\"w\", \"x\", \"y\", \"z\"],\n}\n\nclass Solution:\n def letterCombinations(self, word):\n if len(word) == 0:\n return []\n \n output = letter_dict[int(word[0])]\n \n word = word[1:]\n \n while len(word) > 0:\n temp = []\n \n for elem1 in output:\n for elem2 in letter_dict[int(word[0])]:\n temp += [f\"{elem1}{elem2}\"]\n \n output = temp\n \n if len(word) > 1:\n word = word[1:]\n else:\n word = \"\"\n \n return output","memory":"16100"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return []\n digCh={'2':'abc','3':'def','4':'ghi','5':'jkl','6':'mno','7':'pqrs','8':'tuv','9':'wxyz'}\n num=list(digCh[digits[0]])\n for digit in digits[1:]:\n num=[old+new for old in num for new in list(digCh[digit])]\n return num","memory":"16200"},{"code":"class Solution:\n digit_to_alphabets_map = {\n '2': list(\"abc\"),\n '3': list(\"def\"),\n '4': list(\"ghi\"),\n '5': list(\"jkl\"),\n '6': list(\"mno\"),\n '7': list(\"pqrs\"),\n '8': list(\"tuv\"),\n '9': list(\"wxyz\"),\n }\n\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits:\n return \"\"\n\n res = []\n ans = \"\"\n\n self.backtrack(digits, ans, res, next_idx=0)\n return res\n\n def backtrack(self, digits, ans, res, next_idx) -> None:\n if len(ans) == len(digits):\n res.append(ans)\n \n for idx, digit in enumerate(digits):\n if idx < next_idx:\n continue\n \n for alphabet in self.digit_to_alphabets_map[digit]:\n ans += alphabet\n self.backtrack(digits, ans, res, next_idx=idx + 1)\n ans = ans[:-1]\n","memory":"16300"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n result = []\n digits_to_char = {\n '2' : 'abc',\n '3' : 'def',\n '4' : 'ghi',\n '5' : 'jkl',\n '6' : 'mno',\n '7' : 'pqrs',\n '8' : 'tuv',\n '9' : 'wxyz'\n }\n\n def backtrack(index, curr_str):\n if len(curr_str) == len(digits):\n result.append(curr_str)\n return\n for char in digits_to_char[digits[index]]:\n backtrack(index + 1, curr_str + char)\n \n if digits:\n backtrack(0, '')\n \n return result","memory":"16300"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n res = []\n\n mapping = {\n \"2\" : \"abc\",\n \"3\" : \"def\",\n \"4\" : \"ghi\",\n \"5\" : \"jkl\",\n \"6\" : \"mno\",\n \"7\" : \"pqrs\",\n \"8\" : \"tuv\",\n \"9\" : \"wxyz\"\n }\n\n def backtrack(i, currStr):\n if len(currStr) == len(digits):\n res.append(currStr)\n return\n \n for char in mapping[digits[i]]:\n backtrack(i + 1, currStr + char)\n \n if digits:\n backtrack(0, \"\")\n \n return res","memory":"16400"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n self.mappings = {\n \"2\": [\"a\", \"b\", \"c\"],\n \"3\": [\"d\", \"e\", \"f\"],\n \"4\": [\"g\", \"h\", \"i\"],\n \"5\": [\"j\", \"k\", \"l\"],\n \"6\": [\"m\", \"n\", \"o\"],\n \"7\": [\"p\", \"r\", \"q\", \"s\"],\n \"8\": [\"t\", \"u\", \"v\"],\n \"9\": [\"w\", \"x\", \"y\", \"z\"]\n }\n self.results = []\n if not digits:\n return self.results\n\n self.backtrack(digits, 0, [])\n\n return self.results\n \n def backtrack(self, digits, index, phone_number_builder):\n\n if index >= len(digits):\n self.results.append(\"\".join(phone_number_builder))\n return\n \n for char in self.mappings[digits[index]]:\n phone_number_builder.append(char)\n self.backtrack(digits, index + 1, phone_number_builder)\n phone_number_builder.pop()","memory":"16400"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if not digits: return []\n m = {\n '2': 'abc',\n '3': 'def',\n '4': 'ghi',\n '5': 'jkl',\n '6': 'mno',\n '7': 'pqrs',\n '8': 'tuv',\n '9': 'wxyz'\n }\n\n res = []\n def bt(i, s):\n if i == len(digits): return res.append(s)\n for c in m[digits[i]]: bt(i+1, s+c)\n\n bt(0, '')\n return res","memory":"16500"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n if len(digits) == 0:\n return []\n\n keypad = {\n '2': 'abc',\n '3': 'def', \n '4': 'ghi',\n '5': 'jkl',\n '6': 'mno',\n '7': 'pqrs',\n '8': 'tuv',\n '9': 'wxyz'\n }\n results = []\n\n def backtrack(curr_str=\"\", i=0):\n if i == len(digits):\n results.append(curr_str)\n return\n \n for ch in keypad[digits[i]]:\n backtrack(curr_str[:(i+1)] + ch, i+1)\n\n backtrack()\n return results\n","memory":"16500"},{"code":"class Solution:\n def letterCombinations(self, digits: str) -> List[str]:\n\n if not digits:\n return []\n \n digitMap = {\n \"2\": \"abc\", \"3\": \"def\", \"4\": \"ghi\", \"5\": \"jkl\", \n \"6\": \"mno\", \"7\": \"pqrs\", \"8\": \"tuv\", \"9\": \"wxyz\"\n }\n\n res = []\n\n def dfs(i, curStr):\n if len(curStr) == len(digits):\n res.append(\"\".join(curStr))\n return\n\n for ch in digitMap[digits[i]]:\n curStr.append(ch)\n dfs(i+1, curStr)\n curStr.pop()\n\n dfs(0, [])\n return res","memory":"16600"},{"code":"class Solution:\n num_to_char = {'1':[],\n '2':['a','b','c'],\n '3':['d', 'e', 'f'],\n '4':['g', 'h', 'i'],\n '5':['j', 'k', 'l'],\n '6':['m', 'n', 'o'],\n '7':['p', 'q', 'r', 's'],\n '8':['t', 'u', 'v'],\n '9':['w', 'x', 'y', 'z']\n }\n result = None\n def letterCombinations(self, digits: str) -> List[str]:\n if digits == \"\":\n return self.result\n\n self.result = []\n self.backtrack(digits, \"\")\n return self.result\n \n def backtrack(self, digits, combination):\n if len(digits) == 0:\n self.result.append(combination)\n return\n chars = self.num_to_char[digits[0]]\n for c in chars:\n self.backtrack(digits[1:], combination + c)\n","memory":"16600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return []\\n \\n # Mapping of digits to corresponding letters\\n phone = {\\n '2': 'abc', '3': 'def', '4': 'ghi', '5': 'jkl',\\n '6': 'mno', '7': 'pqrs', '8': 'tuv', '9': 'wxyz'\\n }\\n \\n # List to store the result\\n result = []\\n \\n # Backtracking function\\n def backtrack(index, current_combination):\\n # If the combination is complete, add it to the result list\\n if index == len(digits):\\n result.append(current_combination)\\n return\\n \\n # Get the letters that the current digit maps to\\n letters = phone[digits[index]]\\n \\n # Loop through the letters and recurse\\n for letter in letters:\\n backtrack(index + 1, current_combination + letter)\\n \\n # Initiate backtracking\\n backtrack(0, \\\"\\\")\\n \\n return result\\n \",\n \"memory\": \"16000\"\n },\n {\n \"code\": \"letter_dict = {\\n 2: [\\\"a\\\", \\\"b\\\", \\\"c\\\"],\\n 3: [\\\"d\\\", \\\"e\\\", \\\"f\\\"],\\n 4: [\\\"g\\\", \\\"h\\\", \\\"i\\\"],\\n 5: [\\\"j\\\", \\\"k\\\", \\\"l\\\"],\\n 6: [\\\"m\\\", \\\"n\\\", \\\"o\\\"],\\n 7: [\\\"p\\\", \\\"q\\\", \\\"r\\\", \\\"s\\\"],\\n 8: [\\\"t\\\", \\\"u\\\", \\\"v\\\"],\\n 9: [\\\"w\\\", \\\"x\\\", \\\"y\\\", \\\"z\\\"],\\n}\\n\\nclass Solution:\\n def letterCombinations(self, word):\\n if len(word) == 0:\\n return []\\n \\n output = letter_dict[int(word[0])]\\n \\n word = word[1:]\\n \\n while len(word) > 0:\\n temp = []\\n \\n for elem1 in output:\\n for elem2 in letter_dict[int(word[0])]:\\n temp += [f\\\"{elem1}{elem2}\\\"]\\n \\n output = temp\\n \\n if len(word) > 1:\\n word = word[1:]\\n else:\\n word = \\\"\\\"\\n \\n return output\",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return []\\n digCh={'2':'abc','3':'def','4':'ghi','5':'jkl','6':'mno','7':'pqrs','8':'tuv','9':'wxyz'}\\n num=list(digCh[digits[0]])\\n for digit in digits[1:]:\\n num=[old+new for old in num for new in list(digCh[digit])]\\n return num\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n digit_to_alphabets_map = {\\n '2': list(\\\"abc\\\"),\\n '3': list(\\\"def\\\"),\\n '4': list(\\\"ghi\\\"),\\n '5': list(\\\"jkl\\\"),\\n '6': list(\\\"mno\\\"),\\n '7': list(\\\"pqrs\\\"),\\n '8': list(\\\"tuv\\\"),\\n '9': list(\\\"wxyz\\\"),\\n }\\n\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits:\\n return \\\"\\\"\\n\\n res = []\\n ans = \\\"\\\"\\n\\n self.backtrack(digits, ans, res, next_idx=0)\\n return res\\n\\n def backtrack(self, digits, ans, res, next_idx) -> None:\\n if len(ans) == len(digits):\\n res.append(ans)\\n \\n for idx, digit in enumerate(digits):\\n if idx < next_idx:\\n continue\\n \\n for alphabet in self.digit_to_alphabets_map[digit]:\\n ans += alphabet\\n self.backtrack(digits, ans, res, next_idx=idx + 1)\\n ans = ans[:-1]\\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n result = []\\n digits_to_char = {\\n '2' : 'abc',\\n '3' : 'def',\\n '4' : 'ghi',\\n '5' : 'jkl',\\n '6' : 'mno',\\n '7' : 'pqrs',\\n '8' : 'tuv',\\n '9' : 'wxyz'\\n }\\n\\n def backtrack(index, curr_str):\\n if len(curr_str) == len(digits):\\n result.append(curr_str)\\n return\\n for char in digits_to_char[digits[index]]:\\n backtrack(index + 1, curr_str + char)\\n \\n if digits:\\n backtrack(0, '')\\n \\n return result\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n res = []\\n\\n mapping = {\\n \\\"2\\\" : \\\"abc\\\",\\n \\\"3\\\" : \\\"def\\\",\\n \\\"4\\\" : \\\"ghi\\\",\\n \\\"5\\\" : \\\"jkl\\\",\\n \\\"6\\\" : \\\"mno\\\",\\n \\\"7\\\" : \\\"pqrs\\\",\\n \\\"8\\\" : \\\"tuv\\\",\\n \\\"9\\\" : \\\"wxyz\\\"\\n }\\n\\n def backtrack(i, currStr):\\n if len(currStr) == len(digits):\\n res.append(currStr)\\n return\\n \\n for char in mapping[digits[i]]:\\n backtrack(i + 1, currStr + char)\\n \\n if digits:\\n backtrack(0, \\\"\\\")\\n \\n return res\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n self.mappings = {\\n \\\"2\\\": [\\\"a\\\", \\\"b\\\", \\\"c\\\"],\\n \\\"3\\\": [\\\"d\\\", \\\"e\\\", \\\"f\\\"],\\n \\\"4\\\": [\\\"g\\\", \\\"h\\\", \\\"i\\\"],\\n \\\"5\\\": [\\\"j\\\", \\\"k\\\", \\\"l\\\"],\\n \\\"6\\\": [\\\"m\\\", \\\"n\\\", \\\"o\\\"],\\n \\\"7\\\": [\\\"p\\\", \\\"r\\\", \\\"q\\\", \\\"s\\\"],\\n \\\"8\\\": [\\\"t\\\", \\\"u\\\", \\\"v\\\"],\\n \\\"9\\\": [\\\"w\\\", \\\"x\\\", \\\"y\\\", \\\"z\\\"]\\n }\\n self.results = []\\n if not digits:\\n return self.results\\n\\n self.backtrack(digits, 0, [])\\n\\n return self.results\\n \\n def backtrack(self, digits, index, phone_number_builder):\\n\\n if index >= len(digits):\\n self.results.append(\\\"\\\".join(phone_number_builder))\\n return\\n \\n for char in self.mappings[digits[index]]:\\n phone_number_builder.append(char)\\n self.backtrack(digits, index + 1, phone_number_builder)\\n phone_number_builder.pop()\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if not digits: return []\\n m = {\\n '2': 'abc',\\n '3': 'def',\\n '4': 'ghi',\\n '5': 'jkl',\\n '6': 'mno',\\n '7': 'pqrs',\\n '8': 'tuv',\\n '9': 'wxyz'\\n }\\n\\n res = []\\n def bt(i, s):\\n if i == len(digits): return res.append(s)\\n for c in m[digits[i]]: bt(i+1, s+c)\\n\\n bt(0, '')\\n return res\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n if len(digits) == 0:\\n return []\\n\\n keypad = {\\n '2': 'abc',\\n '3': 'def', \\n '4': 'ghi',\\n '5': 'jkl',\\n '6': 'mno',\\n '7': 'pqrs',\\n '8': 'tuv',\\n '9': 'wxyz'\\n }\\n results = []\\n\\n def backtrack(curr_str=\\\"\\\", i=0):\\n if i == len(digits):\\n results.append(curr_str)\\n return\\n \\n for ch in keypad[digits[i]]:\\n backtrack(curr_str[:(i+1)] + ch, i+1)\\n\\n backtrack()\\n return results\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def letterCombinations(self, digits: str) -> List[str]:\\n\\n if not digits:\\n return []\\n \\n digitMap = {\\n \\\"2\\\": \\\"abc\\\", \\\"3\\\": \\\"def\\\", \\\"4\\\": \\\"ghi\\\", \\\"5\\\": \\\"jkl\\\", \\n \\\"6\\\": \\\"mno\\\", \\\"7\\\": \\\"pqrs\\\", \\\"8\\\": \\\"tuv\\\", \\\"9\\\": \\\"wxyz\\\"\\n }\\n\\n res = []\\n\\n def dfs(i, curStr):\\n if len(curStr) == len(digits):\\n res.append(\\\"\\\".join(curStr))\\n return\\n\\n for ch in digitMap[digits[i]]:\\n curStr.append(ch)\\n dfs(i+1, curStr)\\n curStr.pop()\\n\\n dfs(0, [])\\n return res\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n num_to_char = {'1':[],\\n '2':['a','b','c'],\\n '3':['d', 'e', 'f'],\\n '4':['g', 'h', 'i'],\\n '5':['j', 'k', 'l'],\\n '6':['m', 'n', 'o'],\\n '7':['p', 'q', 'r', 's'],\\n '8':['t', 'u', 'v'],\\n '9':['w', 'x', 'y', 'z']\\n }\\n result = None\\n def letterCombinations(self, digits: str) -> List[str]:\\n if digits == \\\"\\\":\\n return self.result\\n\\n self.result = []\\n self.backtrack(digits, \\\"\\\")\\n return self.result\\n \\n def backtrack(self, digits, combination):\\n if len(digits) == 0:\\n self.result.append(combination)\\n return\\n chars = self.num_to_char[digits[0]]\\n for c in chars:\\n self.backtrack(digits[1:], combination + c)\\n\",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":11,"string":"11"}}},{"rowIdx":184,"cells":{"question_id":{"kind":"number","value":18,"string":"18"},"name":{"kind":"string","value":"4sum"},"content":{"kind":"string","value":"<p>Given an array <code>nums</code> of <code>n</code> integers, return <em>an array of all the <strong>unique</strong> quadruplets</em> <code>[nums[a], nums[b], nums[c], nums[d]]</code> such that:</p>\n\n<ul>\n\t<li><code>0 <= a, b, c, d < n</code></li>\n\t<li><code>a</code>, <code>b</code>, <code>c</code>, and <code>d</code> are <strong>distinct</strong>.</li>\n\t<li><code>nums[a] + nums[b] + nums[c] + nums[d] == target</code></li>\n</ul>\n\n<p>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\n<pre>\n<strong>Input:</strong> nums = [1,0,-1,0,-2,2], target = 0\n<strong>Output:</strong> [[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [2,2,2,2,2], target = 8\n<strong>Output:</strong> [[2,2,2,2]]\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 200</code></li>\n\t<li><code>-10<sup>9</sup> <= nums[i] <= 10<sup>9</sup></code></li>\n\t<li><code>-10<sup>9</sup> <= target <= 10<sup>9</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":36.73317175163576,"string":"36.733172"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","two-pointers","sorting"],"string":"[\n \"array\",\n \"two-pointers\",\n \"sorting\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"48\", 1.1082], [\"62\", 4.6398], [\"75\", 1.3456000000000004], [\"88\", 0.2376], [\"102\", 0.4059], [\"115\", 0.33659999999999995], [\"129\", 0.3267], [\"142\", 0.1386], [\"155\", 0.1584], [\"169\", 0.11880000000000002], [\"182\", 0.0495], [\"196\", 0.1386], [\"209\", 0.0693], [\"222\", 0.10890000000000002], [\"236\", 0.099], [\"249\", 0.13860000000000003], [\"263\", 0.099], [\"276\", 0.11880000000000003], [\"289\", 0.1287], [\"303\", 0.3168], [\"316\", 1.0389], [\"330\", 1.5431000000000001], [\"343\", 1.4937000000000002], [\"356\", 1.7213000000000003], [\"370\", 2.503], [\"383\", 1.7311], [\"397\", 1.197], [\"410\", 1.0981999999999998], [\"423\", 3.9276], [\"437\", 11.3572], [\"450\", 18.5694], [\"464\", 6.9549], [\"477\", 2.7009000000000003], [\"490\", 1.2563], [\"504\", 0.9003999999999999], [\"517\", 1.0188], [\"531\", 0.9992], [\"544\", 0.9004], [\"557\", 1.0091], [\"571\", 0.9891999999999999], [\"584\", 0.9499000000000001], [\"598\", 1.3056], [\"611\", 1.6619000000000002], [\"624\", 1.3750999999999998], [\"638\", 0.8707000000000001], [\"651\", 1.0190000000000001], [\"665\", 1.009], [\"678\", 1.2956999999999999], [\"691\", 1.0583999999999998], [\"705\", 1.2563], [\"718\", 0.8016000000000001], [\"732\", 0.7126000000000001], [\"745\", 0.4059000000000001], [\"758\", 0.5346000000000001], [\"772\", 0.3366], [\"785\", 0.36630000000000007], [\"799\", 0.35640000000000005], [\"812\", 0.5147999999999999], [\"825\", 0.3267], [\"839\", 0.396], [\"852\", 0.396], [\"866\", 0.39590000000000003], [\"879\", 0.29700000000000004], [\"892\", 0.23760000000000003], [\"906\", 0.2277], [\"919\", 0.20790000000000003], [\"933\", 0.1584], [\"946\", 0.1287], [\"959\", 0.19800000000000004], [\"973\", 0.35630000000000006], [\"986\", 0.3861], [\"1000\", 0.2574], [\"1013\", 0.30690000000000006], [\"1026\", 0.2574], [\"1040\", 0.33660000000000007], [\"1053\", 0.2871], [\"1067\", 0.3267], [\"1080\", 0.26730000000000004], [\"1093\", 0.198], [\"1107\", 0.21780000000000002]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16100\", 0.0396], [\"16200\", 0.0989], [\"16300\", 0.5243], [\"16400\", 4.0265], [\"16500\", 25.1187], [\"16600\", 41.947], [\"16700\", 16.7392], [\"16800\", 5.4412]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n res = []\n n = len(nums)\n if n < 4:\n return res\n nums.sort()\n \n for i in range(n - 3):\n # Skip duplicate elements for the first number\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n # Early termination if the smallest possible sum is greater than target\n if nums[i] + nums[i + 1] + nums[i + 2] + nums[i + 3] > target:\n break\n # Early termination if the largest possible sum with nums[i] is smaller than target\n if nums[i] + nums[n - 3] + nums[n - 2] + nums[n - 1] < target:\n continue\n \n for j in range(i + 1, n - 2):\n # Skip duplicate elements for the second number\n if j > i + 1 and nums[j] == nums[j - 1]:\n continue\n # Early termination similar to above\n if nums[i] + nums[j] + nums[j + 1] + nums[j + 2] > target:\n break\n if nums[i] + nums[j] + nums[n - 2] + nums[n - 1] < target:\n continue\n \n # Calculate the remaining target for the two-pointer search\n remain = target - nums[i] - nums[j]\n left, right = j + 1, n - 1\n \n while left < right:\n current_sum = nums[left] + nums[right]\n if current_sum < remain:\n left += 1\n elif current_sum > remain:\n right -= 1\n else:\n res.append([nums[i], nums[j], nums[left], nums[right]])\n \n # Skip duplicates for the third number\n while left < right and nums[left] == nums[left + 1]:\n left += 1\n # Skip duplicates for the fourth number\n while left < right and nums[right] == nums[right - 1]:\n right -= 1\n left += 1\n right -= 1\n \n return res","runtime":"48"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n \n def findNsum(l, r, target, N, result, results):\n if r-l+1 < N or N < 2 or target < nums[l]*N or target > nums[r]*N:\n return\n if N == 2:\n while l < r:\n s = nums[l] + nums[r]\n if s == target:\n results.append(result + [nums[l], nums[r]])\n\n while l < r and nums[l] == nums[l+1]:\n l += 1\n l += 1\n \n elif s < target:\n l += 1\n else:\n r -=1\n else:\n for i in range(l, r+1):\n if i == l or (r>l and nums[i-1] != nums[i]):\n findNsum(i+1, r, target-nums[i], N-1, result+[nums[i]], results)\n\n nums.sort()\n results = []\n findNsum(0, len(nums)-1, target, 4, [], results)\n return results\n\n\n ","runtime":"48"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums = sorted(nums)\n results = []\n self.helper(nums, target, 4, [], results)\n return results\n\n def helper(self, nums: List[int], target: int, N: int, res: List[int], results: List[List[int]]):\n if len(nums) < N or N < 2:\n return\n if N == 2:\n output = self.twoSum(nums, target)\n if output:\n for item in output:\n results.append(res + item)\n else:\n for i in range(len(nums) - N + 1):\n if nums[i] * N > target or nums[-1] * N < target:\n break\n if i == 0 or (i > 0 and nums[i - 1] != nums[i]):\n self.helper(nums[i + 1:], target - nums[i], N - 1, res + [nums[i]], results)\n\n def twoSum(self, nums: List[int], target: int) -> List[int]:\n res = []\n left, right = 0, len(nums) - 1\n while left < right:\n temp_sum = nums[left] + nums[right]\n if temp_sum == target:\n res.append([nums[left], nums[right]])\n left += 1\n right -= 1\n while left < right and nums[left] == nums[left - 1]:\n left += 1\n while left < right and nums[right] == nums[right + 1]:\n right -= 1\n elif temp_sum < target:\n left += 1\n else:\n right -= 1\n return res","runtime":"62"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n\n def kSum(nums, target,k):\n\n res = []\n\n if not nums:\n return res\n \n avg_value = target // k\n\n if (nums[0] > avg_value) or (nums[-1]< avg_value):\n return res\n \n if k == 2:\n return TwoSum(nums,target)\n \n for i in range(len(nums)):\n if (i==0) or (nums[i]!=nums[i-1]):\n for subset in kSum(nums[i+1:],target-nums[i],k-1):\n res.append([nums[i]]+subset)\n \n return res\n\n def TwoSum(nums,target):\n\n lo = 0\n hi = len(nums)-1\n N = len(nums)\n\n res = []\n\n while lo<hi:\n\n if ((nums[lo]+nums[hi] )<target) or ((lo>0) and (nums[lo]==nums[lo-1])):\n lo+=1\n elif ((nums[lo]+nums[hi] )>target) or ((hi<N-1) and (nums[hi]==nums[hi+1])):\n hi-=1\n else:\n if (nums[lo]+nums[hi] )==target:\n res.append([nums[lo],nums[hi]])\n lo+=1\n hi-=1\n \n\n \n return res\n\n nums.sort()\n\n return kSum(nums,target,4)\n\n","runtime":"62"},{"code":"class Solution:\n def fourSum(self, nums: list[int], target: int):\n ans = []\n\n def nSum(\n l: int, r: int, target: int, n: int, path: list[int],\n ans: list[list[int]]) -> None:\n \"\"\"Finds n numbers that add up to the target in [l, r].\"\"\"\n if r - l + 1 < n or n < 2 or target < nums[l] * n or target > nums[r] * n:\n return\n if n == 2:\n while l < r:\n summ = nums[l] + nums[r]\n if summ == target:\n ans.append(path + [nums[l], nums[r]])\n l += 1\n while nums[l] == nums[l - 1] and l < r:\n l += 1\n elif summ < target:\n l += 1\n else:\n r -= 1\n return\n\n for i in range(l, r + 1):\n if i > l and nums[i] == nums[i - 1]:\n continue\n\n nSum(i + 1, r, target - nums[i], n - 1, path + [nums[i]], ans)\n\n nums.sort()\n nSum(0, len(nums) - 1, target, 4, [], ans)\n return ans","runtime":"75"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n\n def kSum(nums, k, target):\n sol = []\n \n avg = target // k\n\n if not nums or nums[0] > avg or nums[-1] < avg:\n return []\n \n if k == 2:\n return twoSum(nums, target)\n\n for i in range(len(nums)):\n if i == 0 or nums[i] != nums[i-1]:\n for subset in kSum(nums[i+1:], k-1, target - nums[i]):\n sol.append([nums[i]] + subset) \n return sol\n \n def twoSum(nums, target):\n sol = []\n left, right = 0, len(nums)-1\n while left < right:\n sum = nums[left] + nums[right]\n if (right+1 < len(nums) and nums[right] == nums[right+1]) or sum > target:\n right -= 1\n elif (left-1 >= 0 and nums[left] == nums[left-1]) or sum < target:\n left += 1\n else:\n sol.append([nums[left],nums[right]])\n left += 1\n right -= 1\n return sol\n\n nums.sort() \n return kSum(nums, 4, target)","runtime":"75"},{"code":"class Solution:\n def kSum(self, nums: List[int], target: int, k: int) -> List[List[int]]:\n def kSumHelper(start: int, target: int, k: int) -> List[List[int]]:\n if k == 2:\n return twoSum(start, target)\n \n result = []\n \n avg_value = target // k\n if nums[start] > avg_value or avg_value > nums[-1]:\n return result\n \n for i in range(start, len(nums) - k + 1):\n if i > start and nums[i] == nums[i-1]:\n continue\n for subset in kSumHelper(i + 1, target - nums[i], k - 1):\n result.append([nums[i]] + subset)\n return result\n\n def twoSum(start: int, target: int) -> List[List[int]]:\n left, right = start, len(nums) - 1\n result = []\n while left < right:\n current_sum = nums[left] + nums[right]\n if current_sum == target:\n result.append([nums[left], nums[right]])\n while left < right and nums[left] == nums[left + 1]:\n left += 1\n while left < right and nums[right] == nums[right - 1]:\n right -= 1\n left += 1\n right -= 1\n elif current_sum < target:\n left += 1\n else:\n right -= 1\n return result\n\n nums.sort()\n return kSumHelper(0, target, k)\n\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n return self.kSum(nums, target, 4)","runtime":"88"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n return self.kSum(nums, target, k=4)\n \n def kSum(self, nums, target, k):\n res = []\n if not nums:\n return res\n \n avg_val = target // k\n if max(nums) < avg_val or min(nums) > avg_val:\n return res\n \n if k == 2:\n return self.twoSum(nums, target)\n \n for i in range(len(nums)):\n if i == 0 or nums[i] > nums[i - 1]:\n for subset in self.kSum(nums[i+1:], target - nums[i], k - 1):\n res.append([nums[i]] + subset)\n return res\n \n def twoSum(self, nums, target):\n res = []\n l, r = 0, len(nums) - 1\n while l < r:\n cur_sum = nums[l] + nums[r]\n if cur_sum < target:\n l += 1\n elif cur_sum > target:\n r -= 1\n else:\n res.append([nums[l], nums[r]])\n l += 1\n while l < len(nums) and nums[l] == nums[l - 1]:\n l += 1\n return res\n\n \n\n \n ","runtime":"88"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums = sorted(nums)\n print(nums)\n import collections\n indexes_by_sum = collections.defaultdict(list)\n \n result = set()\n for idx_a, num_a in enumerate(nums):\n for idx_b, num_b in enumerate(nums[idx_a+1:]):\n idx_b += idx_a + 1\n ab_sum = num_a + num_b \n indexes_by_sum[ab_sum].append((idx_a, idx_b))\n \n for pair_sum, pairs in indexes_by_sum.items():\n diff = target - pair_sum\n if diff in indexes_by_sum:\n pair_cache = set()\n for pair in pairs:\n pair_nums = (\n nums[pair[0]],\n nums[pair[1]],\n )\n if pair_nums in pair_cache:\n continue\n pair_cache.add(pair_nums)\n next_pair_cache = set()\n for next_pair in indexes_by_sum[diff]:\n next_pair_nums = (\n nums[next_pair[0]],\n nums[next_pair[1]],\n ) \n if next_pair_nums in next_pair_cache:\n continue\n if next_pair[0] > pair[1]:\n next_pair_cache.add(next_pair_nums)\n result.add((\n nums[pair[0]],\n nums[pair[1]],\n nums[next_pair[0]],\n nums[next_pair[1]],\n ))\n\n return list(result)\n\n\n \n","runtime":"102"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n sorted_nums = sorted(nums) \n count = 0\n nums = []\n for i, n in enumerate(sorted_nums):\n if i and n == sorted_nums[i-1]:\n count += 1\n else:\n count = 1\n \n if count <= 4:\n nums.append(n)\n \n twoSum = defaultdict(list)\n for i in range(len(nums)-1):\n for j in range(i+1, len(nums)):\n twoSum[nums[i] + nums[j]].append((i, j))\n \n result = set() \n for i in range(len(nums)-3):\n for j in range(i + 1, len(nums)-2):\n sum2 = nums[i] + nums[j]\n if target - sum2 in twoSum:\n for ii, jj in twoSum[target - sum2]:\n if j < ii:\n result.add((nums[i], nums[j], nums[ii], nums[jj]))\n \n return result \n ","runtime":"102"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n if len(nums) < 4:\n return []\n\n frequency_map = {}\n sum_map = {}\n results = set()\n\n for num in nums:\n if num not in frequency_map:\n frequency_map[num] = 0\n \n frequency_map[num] += 1\n \n for i in range(len(nums)):\n for j in range(i+1, len(nums)): \n curr_sum = nums[i] + nums[j] \n if curr_sum not in sum_map:\n sum_map[curr_sum] = set()\n \n sum_map[curr_sum].add((nums[i], nums[j]))\n \n for sum in sum_map:\n diff = target - sum\n if diff in sum_map:\n l_list = sum_map[sum]\n r_list = sum_map[diff]\n\n for l_tuple in l_list:\n for r_tuple in r_list:\n candidate = tuple(sorted(l_tuple + r_tuple))\n candidate_frequency_map = {}\n for num in candidate:\n if num not in candidate_frequency_map:\n candidate_frequency_map[num] = 0\n \n candidate_frequency_map[num] += 1\n \n to_add = True\n for num, freq in candidate_frequency_map.items():\n if freq > frequency_map[num]:\n to_add = False\n break\n\n if to_add:\n results.add(candidate)\n\n return results\n\n","runtime":"115"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n num_counter = Counter(nums)\n new_nums = []\n for num, count in num_counter.items():\n new_nums.extend([num for _ in range(min(count, 4))])\n\n nums = copy.deepcopy(new_nums)\n hash_map = {}\n values = []\n for i, num_1 in enumerate(nums):\n for j, num_2 in enumerate(nums[i + 1:]):\n sum_v = (num_1 + num_2)\n neg_sum = target - sum_v\n\n\n if neg_sum in hash_map:\n for p, q in hash_map[neg_sum]:\n if p != i and p != (i + j + 1) and q != i and q != (i + j + 1):\n sub_set = [num_1, num_2, nums[p], nums[q]]\n sub_set.sort()\n if sub_set not in values:\n values.append(sub_set)\n\n \n if sum_v not in hash_map:\n hash_map[sum_v] = []\n hash_map[sum_v].append((i, j + i + 1))\n return values","runtime":"115"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n cntr, res, twos = Counter(nums), set(), defaultdict(set)\n for num1, num2 in combinations(nums, 2):\n twos[num1 + num2].add(tuple(sorted((num1, num2))))\n for num in sorted(twos):\n if num*2 > target: break\n comp = target - num\n if comp not in twos: continue\n for (a,b), (c,d) in product(twos[num], twos[comp]):\n if all(cnt <= cntr[val] for val, cnt in Counter((a,b,c,d)).items()):\n res.add(tuple(sorted((a,b,c,d))))\n return res","runtime":"129"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n minPos = collections.defaultdict(list)\n results = set()\n for i in range(len(nums) - 1):\n for j in range(i + 1, len(nums)):\n t = nums[i] + nums[j]\n if target - t in minPos:\n for a, b, e in reversed(minPos[target - t]):\n if b >= i:\n break\n for c in range(b, min(e + 1, i)):\n results.add((nums[a], nums[c], nums[i], nums[j]))\n v = minPos[t]\n if not v or nums[v[-1][0]] != nums[i]:\n if not v or v[-1][0] != i:\n v.append([i, j, j])\n else:\n v[-1][-1] = j\n return results","runtime":"129"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res = []\n \n def twoSum(nums, target, curComb):\n L, R = bisect_left(nums, target - nums[-1]), bisect_right(nums, target - nums[0])-1\n\n while L < R:\n left, right = nums[L], nums[R]\n if left + right == target:\n res.append(curComb + [left, right])\n L += 1\n while L < R and nums[L-1] == nums[L]:\n L += 1\n R-=1\n while R > L and nums[R+1] == nums[R]:\n R -= 1\n R = bisect_right(nums, target - nums[L])-1\n elif left + right < target:\n L += 1\n while L < R and nums[L-1] == nums[L]:\n L += 1\n R = bisect_right(nums, target - nums[L])-1\n L = bisect_left(nums, target - nums[R])\n elif left + right > target:\n R -= 1\n while R < L and nums[R+1] == nums[R]:\n R -= 1\n L = bisect_left(nums, target - nums[R])\n R = bisect_right(nums, target - nums[L]) - 1\n \n def nSum(nums, target, k, curComb):\n for i, n in enumerate(nums[:-k+1]):\n if i > 0 and n == nums[i-1]:\n continue\n curComb += [n]\n if k > 3:\n nSum(nums[i+1:], target-n, k-1, curComb)\n else:\n twoSum(nums[i+1:], target-n, curComb)\n if curComb:\n curComb.pop()\n \n return res\n \n nSum(nums, target, 4, [])\n\n return res","runtime":"142"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n n = len(nums)\n ans = set()\n\n for a in range(n-3):\n if a > 0 and nums[a] == nums[a-1]:\n continue\n for b in range(a+1, n-2):\n c, d = b+1, n-1\n #这个条件很微妙，加入了一个500ms -> 150ms\n if nums[a] > target//4 or nums[d] < target//4:\n continue\n while c < d:\n cursum = nums[a] + nums[b] + nums[c] + nums[d]\n if cursum == target:\n ans.add(tuple([nums[a], nums[b], nums[c], nums[d]]))\n c += 1\n if cursum < target:\n c += 1\n if cursum > target:\n d -= 1\n\n return list(ans)\n\n","runtime":"142"},{"code":"class Solution:\n def twoSum(self, nums, target):\n output = []\n left, right = 0, len(nums)-1\n while left < right:\n double_sum = nums[left] + nums[right]\n if double_sum < target: left += 1 \n elif double_sum > target: right -= 1\n else :\n output.append([nums[left], nums[right]])\n left += 1\n right -= 1\n while left < right and nums[left] == nums[left-1]: left += 1\n while left < right and nums[right] == nums[right+1]: right -= 1\n return output\n\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n if len(nums) < 4: return []\n\n nums.sort()\n minimum, maximum = sum(nums[:4]), sum(nums[-4:])\n if maximum <= target: return [] if maximum < target else [nums[-4:]]\n if minimum >= target: return [] if minimum > target else [nums[:4]]\n\n output = []\n for i in range(len(nums)-3):\n if i > 0 and nums[i] == nums[i-1]: continue\n for j in range(i+1, len(nums)-2):\n if j > i+1 and nums[j] == nums[j-1]: continue\n \n for res in self.twoSum(nums[j+1:], target-(nums[i]+nums[j])):\n output.append([nums[i], nums[j], res[0], res[1]])\n\n return output","runtime":"155"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n #O(N*N*N*N)\n reducedNums = []\n for n, count in Counter(nums).items():\n reducedNums.extend( [n]*min(4, count))\n \n twoSumIndexes = collections.defaultdict( list)\n for i, a in enumerate( reducedNums):\n for j in range(i+1, len(reducedNums)):\n b = reducedNums[j]\n twoSumIndexes[a+b].append( (i,j,))\n \n #print(reducedNums); print(twoSumIndexes);\n result = set()\n for ab in list(twoSumIndexes.keys()): \n for i, j in twoSumIndexes[ab]:\n a = reducedNums[i]\n b = reducedNums[j]\n cd = target - ab\n twoSumStart = bisect.bisect_left( twoSumIndexes[cd], (j+1, 0))\n for twoSumI in range(twoSumStart, len(twoSumIndexes[cd])):\n k, l = twoSumIndexes[cd][twoSumI]\n c = reducedNums[k]\n d = reducedNums[l]\n #print(i,j,k,l,)\n result.add( tuple(sorted([a,b,c,d])))\n del twoSumIndexes, reducedNums\n return result","runtime":"155"},{"code":"from collections import defaultdict\n\nclass Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n = len(nums)\n ans = set()\n seen = defaultdict(set)\n for i in range(n):\n for j in range(i + 1, n):\n for x, y in seen[target - (nums[i] + nums[j])]:\n ans.add(tuple(sorted((x, y, nums[i], nums[j]))))\n for j in range(i):\n x, y = sorted((nums[j], nums[i]))\n seen[x + y].add((x, y))\n return list(set(map(tuple, map(sorted, ans))))\n","runtime":"169"},{"code":"from collections import defaultdict\nfrom math import ceil\n\nclass Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n \n # previous method took too long\n # try using two pointers on the keys after sorting keys\n\n if len(nums) < 4:\n return []\n\n length = len(nums)\n add_dict = defaultdict(list)\n\n for i in range(length):\n for j in range(i+1, length):\n # print(i,j)\n add_dict[nums[i]+nums[j]].append([i,j])\n\n # print(add_dict)\n keys = sorted(add_dict.keys())\n\n all_quadruplets = []\n already_added_tuples = set()\n\n # assign lists\n l, r = 0, len(keys)-1\n list1 = add_dict[keys[l]]\n list2 = add_dict[keys[r]]\n\n\n # print(list1,list2)\n\n while l <= r:\n list1 = add_dict[keys[l]]\n list2 = add_dict[keys[r]]\n if keys[l] + keys[r] == target:\n # print(f'found key {keys[l]}:{list1} {keys[r]}:{list2}')\n for i in range(len(list1)):\n\n curr_tuple = nums[list1[i][0]],nums[list1[i][1]] \n prev_tuple = nums[list1[i-1][0]],nums[list1[i-1][1]]\n \n if i>0 and (curr_tuple == prev_tuple):\n print(f'skipping {curr_tuple}, identical to prev_tuple {prev_tuple}')\n continue\n for j in range(len(list2)):\n # check if there are repeated indices\n total_list = list1[i] + list2[j]\n # print(f'total list {total_list}')\n quadruplets = []\n for k in range(4):\n quadruplets.append(nums[total_list[k]])\n sorted_quadruplets_tuple = tuple(sorted(quadruplets))\n\n if sorted_quadruplets_tuple not in already_added_tuples and len(set(total_list))==4:\n already_added_tuples.add(sorted_quadruplets_tuple)\n all_quadruplets.append(quadruplets)\n print(f'adding {quadruplets}')\n\n l += 1\n r -= 1\n\n\n elif (keys[l] + keys[r] < target):\n l += 1\n\n else:\n r -= 1\n\n return all_quadruplets\n\n\n\n\n\n\n\n\n\n\n # 287/294 cases, Time Limit Exceeded\n # # for every pair use their total as key and the two indices as values\n # length = len(nums)\n # add_dict = defaultdict(list)\n\n # for i in range(length):\n # for j in range(i+1, length):\n # add_dict[nums[i]+nums[j]].append([i,j])\n\n # keys = list(add_dict.keys())\n # # print(keys)\n\n # all_quadruplets = []\n # already_added_tuples = set()\n # # print(add_dict)\n\n # # half_keys = ceil(len(keys)/2)\n\n # for i in range(len(keys)):\n # key = keys[i]\n # complement_key = target-key\n # # print('keys',key, complement_key)\n\n # if (complement_key in keys):\n # # print('keys',key, complement_key)\n # list1 = add_dict[key]\n # list2 = add_dict[complement_key]\n # for j in range(len(list1)):\n # for k in range(len(list2)):\n # # check if there are repeated indices\n # total_list = list1[j] + list2[k]\n # if len(set(total_list))==4:\n # # print('total_list',total_list)\n # quadruplets = []\n # for l in range(4):\n # quadruplets.append(nums[total_list[l]])\n # sorted_quadruplets = tuple(sorted(quadruplets))\n # if sorted_quadruplets not in already_added_tuples:\n # already_added_tuples.add(sorted_quadruplets)\n # all_quadruplets.append(quadruplets)\n\n # return all_quadruplets\n\n\n\n ","runtime":"169"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n def kSum(nums, target, k):\n res = []\n if len(nums) < k:\n return res\n if nums[-1] < target / k:\n return res\n if nums[0] > target / k:\n return res\n \n if k == 2:\n return twoSum(nums, target)\n\n for i, n in enumerate(nums): \n if i == 0 or nums[i] != nums[i-1]:\n for arr in kSum(nums[i+1:], target - nums[i], k - 1):\n res.append([nums[i]] + arr)\n return res\n \n def twoSum(nums, target):\n res = []\n for i, x in enumerate(nums):\n if i == 0 or nums[i] != nums[i-1]:\n if target - x in nums[i+1:]:\n res.append([x, target - x])\n return res\n \n nums.sort()\n return kSum(nums, target, 4)\n ","runtime":"182"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n: int = len(nums)\n if n <= 3:\n return []\n if n == 4:\n return [nums] if sum(nums) == target else []\n\n nums.sort()\n\n if target < sum(nums[:4]) or target > sum(nums[-4:]):\n return []\n\n results = []\n\n for i in range(n - 3):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n\n for j in range(i + 1, n - 2):\n if j > i + 1 and nums[j] == nums[j - 1]:\n continue\n\n left, right = j + 1, n - 1\n while left < right:\n s = nums[left] + nums[right] + nums[i] + nums[j]\n if s > target:\n right -= 1\n elif s < target:\n left += 1\n else:\n results.append([nums[left], nums[right], nums[i], nums[j]])\n\n while left < right and nums[left] == nums[left + 1]:\n left += 1\n while left < right and nums[right] == nums[right - 1]:\n right -= 1\n\n left += 1\n right -= 1\n\n return results\n","runtime":"182"},{"code":"from collections import defaultdict\nfrom itertools import combinations\nclass Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n two_sums = defaultdict(list)\n pair_counts = defaultdict(int)\n pair_blocklists = defaultdict(set)\n result = []\n for i, j in combinations(list(range(len(nums))), 2):\n pair = (nums[i], nums[j])\n if pair_counts[pair] > 2: continue\n if i in pair_blocklists[pair] or j in pair_blocklists[pair]: continue\n pair_blocklists[pair].add(i)\n pair_counts[pair] += 1\n two_sums[sum(pair)].append((i, j))\n seen = set()\n seen_nums = set()\n for ts in two_sums.keys():\n wanted = target - ts\n if wanted not in seen and wanted in two_sums:\n for (a, b) in two_sums[ts]:\n for (c, d) in two_sums[wanted]:\n sm = tuple(sorted([nums[a], nums[b], nums[c], nums[d]]))\n idxs = set([a, b, c, d])\n if len(idxs) == 4 and sm not in seen_nums:\n result.append([nums[a], nums[b], nums[c], nums[d]])\n seen_nums.add(sm)\n seen.add(ts)\n seen.add(wanted)\n return result","runtime":"222"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n twoSums = defaultdict(int)\n for i in range(len(nums)-1):\n for j in range(i+1, len(nums)):\n twoSums[nums[i] + nums[j]] += 1\n\n resDict = {}\n for i in range(len(nums)-3):\n for j in range(i+1,len(nums)-2):\n subTarget = target - nums[i] - nums[j]\n if subTarget in twoSums:\n k = j + 1\n l = len(nums)-1\n while k < l:\n if nums[k] + nums[l] > subTarget:\n l -= 1\n elif nums[k] + nums[l] < subTarget:\n k += 1\n else:\n if (nums[i], nums[j], nums[k], nums[l]) not in resDict:\n resDict[(nums[i], nums[j], nums[k], nums[l])] = 1\n k += 1\n l -= 1\n\n # i and j for outer loops\n # k and l for inner loops\n return resDict.keys()\n","runtime":"222"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n pairs,Quad = defaultdict(list),set()\n n = len(nums)\n\n for i in range(n-1):\n for j in range(i+1,n):\n if j>i+1 and nums[j] == nums[j-1]:\n continue\n p = target - nums[i] - nums[j]\n for ele in pairs[p]:\n Quad.add((ele[0],ele[1],nums[j],nums[i]))\n for j in range(i):\n pairs[nums[i]+nums[j]].append([nums[i],nums[j]])\n\n return Quad \n \n '''\n length=len(nums)\n if length<4:\n return []\n endIdx=length-1\n nums.sort()\n result=set()\n \n for i in range(length-3):\n if i>0 and nums[i]==nums[i-1]:\n continue\n for j in range(i+1,length-2):\n if j>i+1 and nums[j]==nums[j-1]:\n continue\n l,r=j+1,endIdx\n sums=nums[i]+nums[j]\n while l<r:\n currSum=sums+nums[l]+nums[r]\n if currSum>target:\n r-=1\n elif currSum<target:\n l+=1\n else:\n result.add((nums[i],nums[j],nums[l],nums[r]))\n l+=1\n return result\n '''\n ","runtime":"236"},{"code":"class Solution:\n\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n = len(nums)\n nums.sort()\n res = []\n for i in range(n - 3):\n if nums[i] * 4 > target:\n return res\n if i - 1 >= 0 and nums[i] == nums[i - 1]:\n continue\n for j in range(i + 1, n - 2):\n if nums[i] + 3 * nums[j] > target:\n break\n if j - 1 > i and nums[j] == nums[j - 1]:\n continue\n k = j + 1\n if nums[i] + nums[j] + 2 * nums[k] > target:\n continue\n l = n - 1\n while k < l:\n if nums[i] + nums[j] + nums[k] + nums[l] < target:\n k += 1\n elif nums[i] + nums[j] + nums[k] + nums[l] > target:\n l -= 1\n else:\n if k - 1 > j and nums[k] == nums[k - 1]:\n k += 1\n l -= 1\n continue\n res.append([nums[i], nums[j], nums[k], nums[l]])\n k += 1\n l -= 1\n return res","runtime":"236"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n if not nums or len(nums) < 4:\n return []\n nums.sort()\n n = len(nums)\n res = []\n\n for i in range(n-3):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n res_1 = target - nums[i]\n for j in range(i+1, n-2):\n if j-1 != i and nums[j] == nums[j-1]:\n continue\n if nums[j] >= 0 and nums[j] > res_1:\n break\n res_2 = res_1 - nums[j]\n k, l = j+1, n-1\n while k < l:\n cur = nums[k] + nums[l]\n if cur == res_2:\n res.append([nums[i], nums[j], nums[k], nums[l]])\n while k+1 < l-1 and nums[k] == nums[k+1]:\n k += 1\n while k+1 < l-1 and nums[l] == nums[l-1]:\n l -= 1\n k += 1\n l -= 1\n elif cur < res_2:\n k += 1\n else:\n l -= 1\n return res\n\n ","runtime":"249"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n res = []\n\n nums.sort()\n\n for i in range(len(nums) - 3):\n if i > 0 and (nums[i] == nums[i-1]):\n continue\n \n if nums[i] * 4 > target:\n break\n\n for j in range(i+1, len(nums) - 2):\n if nums[i] + nums[j] * 3 > target:\n break\n\n if j > i+1 and nums[j] == nums[j-1]:\n continue\n\n k, l = j + 1, len(nums) -1\n\n while(k < l):\n sum4 = nums[i] + nums[j] + nums[k] + nums[l]\n\n if sum4 == target:\n res.append([nums[i], nums[j], nums[k], nums[l]])\n\n while (k < l and nums[k] == nums[k + 1]):\n k += 1\n \n while (k < l and nums[l] == nums[l - 1]):\n l -= 1\n \n k += 1\n l -= 1\n elif sum4 > target:\n l -= 1\n else:\n k += 1\n\n\n return res\n ","runtime":"249"},{"code":"class Solution:\n def fourSum(self, n: List[int], t: int) -> List[List[int]]:\n if not n: return []\n n.sort()\n L, N, S, M = len(n), {j:i for i,j in enumerate(n)}, set(), n[-1]\n for i in range(L-3):\n a = n[i]\n if a + 3*M < t: continue\n if 4*a > t: break\n for j in range(i+1,L-2):\n b = n[j]\n if a + b + 2*M < t: continue\n if a + 3*b > t: break\n for k in range(j+1,L-1):\n c = n[k]\n d = t-(a+b+c)\n if d > M: continue\n if d < c: break\n if d in N and N[d] > k: S.add((a,b,c,d))\n return S","runtime":"263"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target) -> List[List[int]]:\n if len(nums) < 4:\n return []\n nums.sort()\n output = []\n\n i, j, k, l = (0, 1, 2, 3)\n n = len(nums)\n limit = target - nums[i] - nums[j] - nums[k]\n while l < n and nums[l] <= limit:\n l += 1\n \n while i < l - 3:\n if nums[i] > target and nums[i] > 0:\n break\n limit = target - nums[i]\n j = i + 1\n \n while j < l - 2:\n if nums[j] > limit and nums[j] > 0:\n break\n \n kk = j + 1\n ll = l - 1\n\n while kk < ll:\n if (total := nums[i] + nums[j] + nums[kk] + nums[ll]) > target:\n ll -= 1\n elif total < target:\n kk += 1\n else:\n output.append([nums[i], nums[j], nums[kk], nums[ll]])\n kk += 1\n ll -= 1\n while nums[kk] == nums[kk - 1] and kk < ll:\n kk += 1\n \n j += 1\n while j < l - 2 and nums[j] == nums[j - 1]:\n j += 1\n\n i += 1\n while i < l - 3 and nums[i] == nums[i - 1]:\n i += 1\n\n return output","runtime":"263"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n arr=sorted(nums)\n n=len(arr)\n res=[]\n visita=set()\n for a in range(0,n-3):\n if 4*arr[a]>target:\n #print(arr[a])\n return res\n if arr[a] in visita:\n #print(visita)\n continue\n visitb=set() \n #print(a,n-3) \n for b in range(a+1,n-2):\n # if (arr[a]+3*arr[b])>target:\n # return res\n if arr[b] in visitb:\n continue\n total=target-arr[a]-arr[b]\n l=b+1\n r=n-1\n while l<r and l>b and r<n:\n if arr[l]+arr[r]==total:\n res.append([arr[a],arr[b],arr[l],arr[r]])\n #print(res,a,b,l,r)\n while l<r and arr[l]==arr[l+1]:\n l+=1\n l+=1\n elif arr[l]+arr[r]<total:\n l+=1\n else:\n r-=1\n #print(a,b,l,r)\n visitb.add(arr[b])\n visita.add(arr[a])\n return res","runtime":"276"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n output = set()\n\n for i in range(len(nums)):\n if 4 * nums[i] > target:\n break\n \n for j in range(i + 1, len(nums)):\n l = j + 1\n r = len(nums) - 1\n\n if 4 * nums[r] < target:\n break\n while l < r:\n curr_sum = nums[i] + nums[j] + nums[l] + nums[r]\n if curr_sum == target:\n output.add((nums[i], nums[j], nums[l], nums[r]))\n l += 1\n r -= 1\n elif curr_sum > target:\n r -= 1\n else:\n l += 1\n\n return output\n","runtime":"276"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n if len(nums) < 4:\n return []\n\n nums.sort()\n if sum(nums[:4]) > target:\n return []\n if sum(nums[-4:]) < target:\n return []\n \n n = len(nums)\n results = []\n i = 0\n while i < n - 3:\n j = i + 1\n while j < n - 2:\n l = j+1\n r = n-1\n while l < r:\n total = nums[i] + nums[j] + nums[l] + nums[r]\n if total == target:\n results.append([nums[i], nums[j], nums[l], nums[r]])\n if total <= target:\n prev = nums[l]\n while l < n and nums[l] == prev:\n l += 1\n else:\n prev = nums[r]\n while r >= 0 and nums[r] == prev:\n r -= 1\n prev = nums[j]\n while j < n and nums[j] == prev:\n j += 1\n prev = nums[i]\n while i < n and nums[i] == prev:\n i += 1\n return results\n\n\n ","runtime":"289"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n # 3 pointers: 1st on nums[a], 2nd on nums[b]\n # use a hashset to store the 3rd point value\n # if sum - nums[p3] in hashset, then add to result\n # else add nums[p3] to the hashset\n # complexity: space: O(n), time O(n^3)\n if len(nums) < 4:\n return []\n nums = sorted(nums)\n res = []\n for p1 in range(len(nums)-3):\n if p1 > 0 and nums[p1-1] == nums[p1]:\n continue\n for p2 in range(p1+1, len(nums)-2):\n if (p2-1) > p1 and nums[p2-1] == nums[p2]:\n continue\n s = target - nums[p1] - nums[p2]\n left, right = p2+1, len(nums)-1\n while left < right:\n while (nums[left] + nums[right]) < s and left < right:\n left += 1\n while (nums[left] + nums[right]) > s and left < right:\n right-=1\n if left < right and (nums[left] + nums[right]) == s:\n res.append([nums[p1], nums[p2], nums[left], nums[right]])\n left+=1\n while left < right and nums[left] == nums[left-1]:\n left+=1\n right-=1\n while left < right and nums[right] == nums[right+1]:\n right -= 1\n return res","runtime":"289"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n ans = []\n n = len(nums)\n \n if n < 4:\n return ans\n nums = sorted(nums)\n print(nums)\n for i in range(n):\n if (i > 0 and nums[i] == nums[i-1]):\n continue\n a = nums[i]\n\n for j in range(i+1,n):\n if (j>i+1 and nums[j] == nums[j-1]):\n continue\n b = nums[j]\n rem = target-(a+b)\n \n l = j+1\n r = n-1\n\n while (l<r):\n tot = nums[l] + nums[r]\n\n if tot < rem:\n l+=1\n\n elif tot > rem:\n r -= 1\n\n else:\n ans.append([a,b,nums[l],nums[r]])\n #break\n if nums[l] == nums[r]:\n break\n\n p = nums[l]\n q = nums[r]\n while(nums[l] == p):\n l+=1\n\n while(nums[r] == q): \n r-=1\n return ans \n\n ","runtime":"303"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n results = []\n if not nums or len(nums) < 4:\n return results\n nums.sort()\n for i in range(len(nums) - 3):\n if i == 0 or nums[i] != nums[i - 1]:\n new_target = target - nums[i]\n self.threeSum(i, nums, new_target, results)\n return results\n \n def threeSum(self, fourSumIndex, nums, target, results):\n\n\n start = fourSumIndex + 1\n for i in range(start, len(nums) - 2):\n new_target = target - nums[i]\n if i == start or nums[i] != nums[i - 1]:\n self.twoSum(fourSumIndex, i, nums, new_target, results)\n\n def twoSum(self, fourSumIndex, threeSumIndex, nums, target, results):\n left = threeSumIndex + 1\n right = len(nums) - 1\n while left < right:\n total = nums[left] + nums[right]\n if total > target:\n right -= 1\n elif total < target:\n left += 1\n else:\n results.append([nums[fourSumIndex], nums[threeSumIndex], nums[left], nums[right]])\n left += 1\n right -= 1\n\n while left < right and nums[left] == nums[left - 1]:\n left += 1\n","runtime":"303"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n results = []\n if not nums or len(nums) < 4:\n return results\n nums.sort()\n for i in range(len(nums) - 3):\n if i == 0 or nums[i] != nums[i - 1]:\n new_target = target - nums[i]\n self.threeSum(i, nums, new_target, results)\n return results\n \n def threeSum(self, fourSumIndex, nums, target, results):\n\n\n start = fourSumIndex + 1\n for i in range(start, len(nums) - 2):\n new_target = target - nums[i]\n if i == start or nums[i] != nums[i - 1]:\n self.twoSum(fourSumIndex, i, nums, new_target, results)\n\n def twoSum(self, fourSumIndex, threeSumIndex, nums, target, results):\n left = threeSumIndex + 1\n right = len(nums) - 1\n while left < right:\n total = nums[left] + nums[right]\n if total > target:\n right -= 1\n elif total < target:\n left += 1\n else:\n results.append([nums[fourSumIndex], nums[threeSumIndex], nums[left], nums[right]])\n left += 1\n right -= 1\n\n while left < right and nums[left] == nums[left - 1]:\n left += 1\n","runtime":"316"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n \n def kSum(start,k,target):\n if k != 2:\n for i in range(start,len(nums)-k+1):\n if i > start and nums[i] == nums[i-1]:\n continue\n quad.append(nums[i])\n kSum(i+1,k-1,target-nums[i])\n quad.pop()\n return\n \n l = start\n r = len(nums)-1\n\n while l < r:\n total = nums[l] + nums[r]\n if total > target:\n r-=1\n elif total < target:\n l+=1\n else:\n res.append(quad + [nums[l],nums[r]])\n l+=1\n while nums[l] == nums[l-1] and l < r:\n l+=1\n \n return res\n \n nums.sort()\n quad = []\n res = []\n kSum(0,4,target)\n return res\n ","runtime":"316"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort() # Sort the array\n res = []\n\n for i in range(len(nums) - 3):\n if i > 0 and nums[i] == nums[i - 1]:\n continue # Skip duplicates for the first element\n \n for j in range(i + 1, len(nums) - 2):\n if j > i + 1 and nums[j] == nums[j - 1]:\n continue # Skip duplicates for the second element\n \n new_target = target - nums[i] - nums[j]\n l, r = j + 1, len(nums) - 1\n\n while l < r:\n sum_lr = nums[l] + nums[r]\n if sum_lr == new_target:\n res.append([nums[i], nums[j], nums[l], nums[r]])\n while l < r and nums[l] == nums[l + 1]:\n l += 1 # Skip duplicates for the third element\n while l < r and nums[r] == nums[r - 1]:\n r -= 1 # Skip duplicates for the fourth element\n l += 1\n r -= 1\n elif sum_lr < new_target:\n l += 1\n else:\n r -= 1\n\n return res\n","runtime":"330"},{"code":"class Solution:\n def kSum(self, nums: List[int], target: int, k: int) -> List[List[int]]:\n matches = []\n for i in range(len(nums) - k + 1):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n sub_nums = nums[i + 1:]\n sub_target = target - nums[i]\n sub_k = k - 1\n if sub_k > 2:\n sub_matches = self.kSum(sub_nums, sub_target, sub_k)\n else:\n sub_matches = self.twoSum(sub_nums, sub_target)\n for match in sub_matches:\n matches.append([nums[i]] + match)\n return matches\n\n def twoSum(self, nums: List[int], target) -> List[List[int]]:\n l, r = 0, len(nums) - 1\n matches = []\n while l < r:\n sum2 = nums[l] + nums[r]\n if sum2 < target:\n l += 1\n elif sum2 > target:\n r -= 1\n else:\n matches.append([nums[l], nums[r]])\n while l < r and nums[l] == nums[l + 1]:\n l += 1\n l += 1\n while r > l and nums[r] == nums[r - 1]:\n r -= 1\n r -= 1\n return matches\n\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n return self.kSum(nums, target, 4)\n","runtime":"330"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res, quad = [], []\n\n # kSum recursive function\n def kSum(k, start, target):\n if k == 2: # Base case: two pointers to find pairs\n l, r = start, len(nums) - 1\n while l < r:\n current_sum = nums[l] + nums[r]\n if current_sum < target:\n l += 1\n elif current_sum > target:\n r -= 1\n else:\n res.append(quad + [nums[l], nums[r]])\n l += 1\n r -= 1\n # Skip duplicates for the left pointer\n while l < r and nums[l] == nums[l - 1]:\n l += 1\n # Skip duplicates for the right pointer\n while l < r and nums[r] == nums[r + 1]:\n r -= 1\n else:\n # Recursion for k-sum\n for i in range(start, len(nums) - k + 1):\n if i > start and nums[i] == nums[i - 1]: # Skip duplicates\n continue\n quad.append(nums[i])\n kSum(k - 1, i + 1, target - nums[i]) # Recursive call for k-1 sum\n quad.pop() # Backtrack\n\n # Start the 4-sum process\n kSum(4, 0, target)\n return res\n","runtime":"343"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n return fourSum(nums, target)\n\ndef fourSum(nums: list[int], target: int) -> list[list[int]]:\n nums = sorted(nums)\n n = len(nums)\n result = set()\n if n < 4:\n return []\n if n < 4:\n return []\n if sum(nums[:4]) > target:\n return []\n if sum(nums[-4:]) < target:\n return []\n for i in range(n - 3):\n for j in range(i + 1, n - 2):\n left, right = j + 1, n - 1\n while left < right:\n total = nums[i] + nums[j] + nums[left] + nums[right]\n if total == target:\n result.add((nums[i], nums[j], nums[left], nums[right]))\n left += 1\n right -= 1\n elif total < target:\n left += 1\n else: # total > target\n right -= 1\n return [list(t) for t in result]\n ","runtime":"343"},{"code":"'''\n[-2,2,0,5,3,1] target = 8\n\nkeep track of \n-currSum\n-currQuad\n-res[]\n\n\n#check if nums is less than 4\n'''\nclass Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res = []\n currQuad = []\n def kSum(k,start,target):\n if k != 2:\n for i in range(start, len(nums) - k + 1):\n if i > start and nums[i] == nums[i-1]:\n continue\n currQuad.append(nums[i])\n kSum(k-1,i+1, target - nums[i])\n currQuad.pop()\n return\n l,r = start, len(nums)-1\n\n while l < r:\n if nums[l]+ nums[r]>target:\n r-=1\n elif nums[l]+ nums[r]<target:\n l+=1\n else:\n res.append(currQuad + [nums[l],nums[r]])\n l += 1\n while l<r and nums[l] == nums[l-1]:\n l+=1\n \n kSum(4,0,target)\n return res\n ","runtime":"356"},{"code":"class Solution:\n def kSum(self, nums: List[int], target: int, k: int) -> List[List[int]]:\n def kSumHelper(start: int, target: int, k: int) -> List[List[int]]:\n if k == 2:\n return twoSum(start, target)\n \n result, i = [], start\n \n while i < len(nums):\n\n while i > start and i < len(nums) and nums[i] == nums[i-1]:\n i += 1\n\n if i < len(nums):\n for subset in kSumHelper(i + 1, target - nums[i], k - 1):\n subset.append(nums[i])\n result.append(subset)\n\n i += 1\n \n return result\n\n def twoSum(start: int, target: int) -> List[List[int]]:\n left, right = start, len(nums) - 1\n result = []\n while left < right:\n current_sum = nums[left] + nums[right]\n if current_sum == target:\n result.append([nums[left], nums[right]])\n while left < right and nums[left] == nums[left + 1]:\n left += 1\n while left < right and nums[right] == nums[right - 1]:\n right -= 1\n left += 1\n right -= 1\n elif current_sum < target:\n left += 1\n else:\n right -= 1\n return result\n\n nums.sort()\n return kSumHelper(0, target, k)\n\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n return self.kSum(nums, target, 4)","runtime":"356"},{"code":"class Solution:\n\n def get_k_sum(self, nums, target, k):\n\n def _get_k_sum(_sum, target, k, start):\n if len(candidate) > k:\n return\n\n if k >= 3:\n for i in range(start, n):\n if i == start or nums[i] != nums[i - 1]:\n candidate.append(nums[i])\n _get_k_sum(_sum + nums[i], target, k - 1, i + 1)\n candidate.pop()\n else:\n left, right = start, n - 1\n while left < right:\n temp = _sum + nums[left] + nums[right]\n if temp < target:\n left += 1\n elif temp > target:\n right -= 1\n else:\n candidate.extend([nums[left], nums[right]])\n\n k_tuple = candidate.copy()\n k_tuples.append(k_tuple)\n\n candidate.pop()\n candidate.pop()\n\n left += 1\n right -= 1\n while left < right and nums[left] == nums[left - 1]:\n left += 1\n\n nums = sorted(nums)\n n = len(nums)\n\n k_tuples = deque()\n candidate = deque()\n _get_k_sum(0, target, k, 0)\n return k_tuples\n\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n return self.get_k_sum(nums, target, 4)\n\n# input -> output\n\n# 2sum\n# nums = [1,1,1], target = 2 -> [1,1]\n\n# 3sum\n# nums = [1,1,1,1,2], target = 3 -> [1,1,1]\n\n# 4sum\n# nums = [1,1,1,1,1,2], target = 3 -> [1,1,1,1]","runtime":"370"},{"code":"class Solution:\n def fourSum(self, arr: List[int], target: int) -> List[List[int]]:\n n = len(arr)\n ans = set()\n arr.sort()\n for i in range(n-3):\n if i>0 and arr[i]==arr[i-1]:\n continue\n for j in range(i+1,n-2):\n l = j+1\n r = n-1\n s = arr[i] + arr[j]\n while l<r:\n s1 = s + arr[l] + arr[r]\n\n if s1==target:\n ans.add((arr[i],arr[j],arr[l],arr[r]))\n l+=1\n r-=1\n elif s1<target:\n l+=1\n else:\n r-=1\n return list(ans)\n","runtime":"370"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n res, cur = [], []\n nums.sort()\n\n def kSum(k, start, target):\n if k > 2:\n for i in range(start, len(nums) - k + 1):\n if i > start and nums[i] == nums[i-1]:\n continue\n cur.append(nums[i])\n kSum(k-1, i+1, target - nums[i])\n cur.pop()\n return\n l, r = start, len(nums) - 1\n while l < r:\n if nums[l] + nums[r] < target:\n l += 1\n elif nums[l] + nums[r] > target:\n r -= 1\n else:\n res.append(cur + [nums[l], nums[r]])\n l += 1\n while l < r and nums[l] == nums[l-1]:\n l += 1\n kSum(4, 0, target)\n return res\n\n\n ","runtime":"383"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n if len(nums) < 4:\n return []\n\n if len(nums) == 4:\n return [nums] if sum(nums) == target else []\n\n nums.sort() # Sorting the array\n\n result = []\n\n for i in range(len(nums) - 3):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n for j in range(i + 1, len(nums) - 2):\n if j > i + 1 and nums[j] == nums[j - 1]:\n continue\n\n currTarget = target - nums[i] - nums[j]\n left, right = j + 1, len(nums) - 1\n\n while left < right:\n currSum = nums[left] + nums[right]\n\n if currSum == currTarget:\n result.append([nums[i], nums[j], nums[left], nums[right]])\n\n left += 1\n right -= 1\n\n # Skip duplicates for left\n while left < right and nums[left] == nums[left - 1]:\n left += 1\n # Skip duplicates for right\n while left < right and nums[right] == nums[right + 1]:\n right -= 1\n\n elif currSum < currTarget:\n left += 1\n else:\n right -= 1\n\n return result\n\n ","runtime":"383"},{"code":"class Solution: \n def fourSum(self, nums: List[int], t: int) -> List[List[int]]:\n n=len(nums)\n nums.sort()\n res=[]\n if(n<4):\n return res\n if(n==4):\n if(sum(nums)==t):\n return [nums]\n else:\n return res\n for i in range(n-3):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n for j in range(i+1,n-2):\n if j > i + 1 and nums[j] == nums[j - 1]:\n continue\n l=j+1\n r=n-1\n target=-(nums[i]+nums[j]-t)\n while(l<r):\n if(nums[l]+nums[r]==target):\n res.append([nums[i],nums[j],nums[r],nums[l]])\n while(l<r and nums[l]==nums[l+1]):\n l+=1\n while(l<r and nums[r]==nums[r-1]):\n r-=1\n if(nums[l]+nums[r]>target):\n r-=1\n else:\n l+=1\n return res","runtime":"397"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n=len(nums)\n nums.sort()\n ans=[]\n i=0\n while i<n:\n j=i+1\n while j<n:\n end=n-1\n strt=j+1\n nTarget=target-nums[i]-nums[j]\n \n while strt<end: \n if nums[strt]+nums[end]==nTarget:\n ans.append([nums[i],nums[j],nums[strt],nums[end]])\n\n third=nums[strt]\n fourth=nums[end]\n while strt<end and nums[strt]==third:\n strt+=1\n while strt<end and nums[end]==fourth:\n end-=1\n elif nums[strt]+nums[end]>nTarget:\n end-=1\n else:\n strt+=1\n t=nums[j]\n while j<n and nums[j]==t:\n j+=1\n t2=nums[i]\n while i<n and nums[i]==t2:\n i+=1\n return ans\n \n \n ","runtime":"397"},{"code":"class Solution:\n\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n\n # Sort the list to ensure we can determine whether moving either\n # of the pointers in the Two-Pointer approach will bring us closer\n # to the target\n nums.sort()\n\n results = []\n\n LENGTH_MINUS_3 = len(nums) - 3\n LENGTH_MINUS_2 = LENGTH_MINUS_3 + 1\n LENGTH_MINUS_1 = LENGTH_MINUS_2 + 1\n\n # Iterate through the list, using the i'th and j'th position as our fixed points\n\n # Fixed Point 1\n for i in range(LENGTH_MINUS_3) :\n\n # Ignore Duplicates\n if i > 0 and nums[i] == nums[i - 1] :\n continue\n #end\n\n # Fixed Point 1\n for j in range(i + 1, LENGTH_MINUS_2) :\n\n # Ignore Duplicates\n if j > i + 1 and nums[j] == nums[j - 1] :\n continue\n #end\n\n # Initial Left/Right Pointers\n nLeft = j + 1\n nRight = LENGTH_MINUS_1\n\n nFixed1 = nums[i]\n nFixed2 = nums[j]\n\n # Iterate through the list using the Two-Pointer approach\n #\n # Basically because the numbers are sorted, we know moving\n # the left index makes the number bigger, and moving the right\n # index makes the number smaller. Meaning we can keep shifting\n # these until we've found the target.\n\n while nLeft < nRight :\n\n # Compute the current result\n nCurrentResult = nFixed1 + nFixed2 + nums[nLeft] + nums[nRight]\n\n # Simple case, if we've found the target, return it\n if nCurrentResult == target :\n results.append([nFixed1, nFixed2, nums[nLeft], nums[nRight]])\n\n # Shift the Left Pointer past any duplicates\n while nLeft < nRight and nums[nLeft] == nums[nLeft + 1]:\n nLeft += 1\n #end\n\n # Shift the Right Pointer past any duplicates\n while nLeft < nRight and nums[nRight] == nums[nRight - 1]:\n nRight -= 1\n #end\n\n #end\n\n # Move the pointers based on whether the number needs to get\n # bigger or smaller\n if nCurrentResult < target :\n nLeft += 1\n else :\n nRight -= 1\n #end\n\n #end\n\n #end\n\n #end\n\n return results\n\n #end\n\n#end","runtime":"410"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums = sorted(nums)\n output = set()\n for i, n in enumerate(nums):\n candidates = self.threeSum(nums[i+1:], target-n)\n for c in candidates:\n output.add((n, *c))\n\n return [list(o) for o in output]\n\n def threeSum(self, nums: List[int], target: int) -> List[List[int]]:\n output = set()\n for i, n in enumerate(nums):\n if i > 0 and n == nums[i-1]:\n continue\n l, r = i + 1, len(nums) - 1\n\n while l < r:\n s = n + nums[l] + nums[r] - target\n if s > 0: \n r -= 1\n elif s < 0 :\n l += 1\n else:\n output.add((n, nums[l], nums[r]))\n l += 1\n r -= 1\n\n return [list(o) for o in output]\n ","runtime":"410"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n=len(nums)\n result=[]\n nums.sort()\n\n for i in range(n-3):\n if i>0 and nums[i]==nums[i-1]:\n continue\n\n for j in range(i+1,n-2):\n if j >i+1 and nums[j]== nums[j-1]:\n continue\n\n left=j+1\n right=n-1\n\n while left<right:\n total= nums[i]+nums[j]+nums[left]+nums[right]\n if total<target:\n left+=1\n\n elif total>target:\n right-=1\n\n else:\n result.append([nums[i],nums[j],nums[left],nums[right]]) \n left+=1\n right-=1\n\n while left<right and nums[left]==nums[left-1]:\n left+=1\n\n while left<right and nums[right]==nums[right+1]:\n right-=1\n\n return result \n \n ","runtime":"423"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n length = len(nums)\n result = []\n nums = sorted(nums)\n for i in range(length-3):\n if i > 0 and nums[i] == nums[i-1]:\n continue \n for j in range(i+1, length-2):\n if j > i+1 and nums[j] == nums[j-1]:\n continue \n left = j + 1\n right = length -1\n while right > left:\n total = nums[i] + nums[j] + nums[left] + nums[right]\n if total > target:\n right -= 1\n elif total < target:\n left += 1\n else:\n result.append([nums[i], nums[j], nums[left], nums[right]])\n while right > left and nums[left] == nums[left+1]:\n left += 1\n while right > left and nums[right] == nums[right-1]:\n right -= 1\n left += 1\n right -= 1\n return result","runtime":"423"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n = len(nums)\n ans = []\n if n < 4:\n return ans\n nums.sort()\n for i in range(n - 3):\n if i and nums[i] == nums[i - 1]:\n continue\n for j in range(i + 1, n - 2):\n if j > i + 1 and nums[j] == nums[j - 1]:\n continue\n k, l = j + 1, n - 1\n while k < l:\n x = nums[i] + nums[j] + nums[k] + nums[l]\n if x < target:\n k += 1\n elif x > target:\n l -= 1\n else:\n ans.append([nums[i], nums[j], nums[k], nums[l]])\n k, l = k + 1, l - 1\n while k < l and nums[k] == nums[k - 1]:\n k += 1\n while k < l and nums[l] == nums[l + 1]:\n l -= 1\n return ans","runtime":"437"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n \n nums.sort()\n quadruplets = []\n n = len(nums)\n \n for i in range(n):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n for j in range(i + 1, n):\n if j > i + 1 and nums[j] == nums[j - 1]:\n continue\n\n p1 = j + 1\n p2 = n - 1\n \n while p1 < p2:\n total = nums[i] + nums[j] + nums[p1] + nums[p2]\n \n if total == target:\n quadruplets.append([nums[i], nums[j], nums[p1], nums[p2]])\n \n while p1 < p2 and nums[p1] == nums[p1 + 1]:\n p1 = p1 + 1\n while p1 < p2 and nums[p2] == nums[p2 - 1]:\n p2 = p2 - 1\n \n p1 = p1 + 1\n p2 = p2 - 1\n elif total < target:\n p1 = p1 + 1 \n else:\n p2 = p2 - 1 \n \n return quadruplets\n","runtime":"437"},{"code":"from typing import List\n\nclass Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res = []\n for i in range(len(nums) - 3): # Ensure at least 4 numbers are available\n if i > 0 and nums[i] == nums[i - 1]: # Skip duplicate i\n continue\n for j in range(i + 1, len(nums) - 2): # Ensure at least 3 numbers after j\n if j > i + 1 and nums[j] == nums[j - 1]: # Skip duplicate j\n continue\n l, r = j + 1, len(nums) - 1\n while l < r:\n fsum = nums[i] + nums[j] + nums[l] + nums[r]\n if fsum > target:\n r -= 1\n elif fsum < target:\n l += 1\n else:\n res.append([nums[i], nums[j], nums[l], nums[r]])\n l += 1\n r -= 1\n # Skip duplicates for l and r\n while l < r and nums[l] == nums[l - 1]:\n l += 1\n while l < r and nums[r] == nums[r + 1]:\n r -= 1\n return res\n","runtime":"450"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n ans = []\n nums.sort()\n\n for i in range(len(nums) - 3):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n\n for j in range(i + 1, len(nums) - 2):\n if j > i + 1 and nums[j] == nums[j - 1]:\n continue\n \n left = j + 1\n right = len(nums) - 1\n\n while left < right:\n total = nums[i] + nums[j] + nums[left] + nums[right]\n \n if total > target:\n right -= 1\n elif total < target:\n left += 1\n else:\n ans.append([nums[i], nums[j], nums[left], nums[right]])\n \n while left < right and nums[left] == nums[left + 1]:\n left += 1\n while left < right and nums[right] == nums[right - 1]:\n right -= 1\n \n left += 1\n right -= 1\n return ans","runtime":"450"},{"code":"from typing import List\n\nclass Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort() # Sort the input list to simplify the logic\n results = set() # Use a set to avoid duplicate quadruplets\n n = len(nums)\n\n for j in range(n):\n # Skip duplicate elements for `j`\n if j > 0 and nums[j] == nums[j - 1]:\n continue\n for i in range(j + 1, n):\n # Skip duplicate elements for `i`\n if i > j + 1 and nums[i] == nums[i - 1]:\n continue\n\n left, right = i + 1, n - 1\n while left < right:\n total = nums[j] + nums[i] + nums[left] + nums[right]\n\n if total == target:\n results.add((nums[j], nums[i], nums[left], nums[right]))\n left += 1\n right -= 1\n\n # Skip duplicates for `left` and `right`\n while left < right and nums[left] == nums[left - 1]:\n left += 1\n while left < right and nums[right] == nums[right + 1]:\n right -= 1\n elif total < target:\n left += 1\n else:\n right -= 1\n\n # Convert set to list of lists and return the result\n return [list(quad) for quad in results]\n","runtime":"464"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n res=[]\n n=len(nums)\n nums.sort()\n for i in range(n-3):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n for j in range(i+1,n-2):\n if j > i + 1 and nums[j] == nums[j-1]:\n continue\n l=j+1\n r=n-1\n while(l<r):\n x=nums[i]+nums[j]+nums[l]+nums[r]\n if x==target:\n res.append([nums[i],nums[j],nums[l],nums[r]])\n l+=1\n r-=1\n while l<r and nums[l]==nums[l-1]:\n l+=1\n while l<r and nums[r]==nums[r+1]:\n r-=1\n elif x<target:\n l+=1\n else:\n r-=1\n return res","runtime":"464"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n quadruplets = []\n n = len(nums)\n\n for a in range(n - 3):\n if a > 0 and nums[a] == nums[a - 1]:\n continue\n for b in range(a + 1, n - 2):\n if b > a + 1 and nums[b] == nums[b - 1]:\n continue\n \n left, right = b + 1, n - 1\n \n while left < right:\n current_sum = nums[a] + nums[b] + nums[left] + nums[right]\n \n if current_sum == target:\n quadruplets.append([nums[a], nums[b], nums[left], nums[right]])\n while left < right and nums[left] == nums[left + 1]:\n left += 1\n while left < right and nums[right] == nums[right - 1]:\n right -= 1\n \n left += 1\n right -= 1\n elif current_sum < target:\n left += 1\n else:\n right -= 1\n \n return quadruplets\n ","runtime":"477"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n results = set()\n n = len(nums)\n\n for i in range(n - 3):\n if i > 0 and nums[i] == nums[i - 1]: # Skip duplicates\n continue\n for j in range(i + 1, n - 2):\n if j > i + 1 and nums[j] == nums[j - 1]: # Skip duplicates\n continue\n left, right = j + 1, n - 1\n while left < right:\n total = nums[i] + nums[j] + nums[left] + nums[right]\n if total == target:\n results.add((nums[i], nums[j], nums[left], nums[right]))\n left += 1\n right -= 1\n while left < right and nums[left] == nums[left - 1]: # Skip duplicates\n left += 1\n while left < right and nums[right] == nums[right + 1]: # Skip duplicates\n right -= 1\n elif total < target:\n left += 1\n else:\n right -= 1\n\n return [list(result) for result in results]","runtime":"477"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res = []\n\n for i in range(len(nums) - 3):\n # skip duplicate starting values\n if i > 0 and nums[i] == nums[i-1]:\n continue\n \n for j in range(i+1, len(nums) - 2):\n # skip duplicate starting values\n if j > i + 1 and nums[j] == nums[j-1]:\n continue\n left, right = j + 1, len(nums) - 1\n\n while left < right:\n four_sum = nums[i] + nums[j] + nums[left] + nums[right]\n if four_sum == target:\n res.append([nums[i], nums[j], nums[left], nums[right]])\n left += 1\n right -= 1\n\n while left < right and nums[left] == nums[left - 1]:\n left += 1\n while left < right and nums[right] == nums[right + 1]:\n right -= 1\n elif four_sum < target:\n left += 1\n else:\n right -= 1\n return res\n \n ","runtime":"490"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n ans=[]\n n=len(nums)\n nums.sort()\n for i in range(0,n):\n if(i>0 and nums[i]==nums[i-1]):\n continue\n for j in range(i+1,n):\n if(j!=i+1 and nums[j]==nums[j-1]):\n continue\n k=j+1\n l=n-1\n while(k<l):\n sum=nums[i]\n sum+=nums[j]\n sum+=nums[k]\n sum+=nums[l]\n if(sum==target):\n temp=[nums[i],nums[j],nums[k],nums[l]]\n ans.append(temp)\n k+=1\n l-=1\n while(k<l and nums[k]==nums[k-1]):\n k+=1\n while(k<l and nums[l]==nums[l+1]):\n l-=1\n elif(sum<target):\n k+=1\n else:\n l-=1\n return ans","runtime":"490"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n n = len(nums)\n ans = set()\n for i in range(n-3):\n tr1 = target-nums[i]\n for j in range(i+1,n-2):\n tr2 = tr1-nums[j]\n l,r = j+1,n-1\n while l < r:\n if nums[l]+nums[r] < tr2:\n l+=1\n elif nums[l]+nums[r] > tr2:\n r-=1\n else:\n ans.add((nums[i],nums[j],nums[l],nums[r]))\n l+=1\n r-=1\n ans = list(map(list,list(ans)))\n return ans","runtime":"504"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n n = len(nums)\n result = []\n\n for i in range(n):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n for j in range(i + 1, n):\n if j > i + 1 and nums[j] == nums[j - 1]:\n continue\n left = j + 1\n right = n - 1\n while left < right:\n total = nums[i] + nums[j] + nums[left] + nums[right]\n if total == target:\n result.append([nums[i], nums[j], nums[left], nums[right]])\n while left < right and nums[left] == nums[left + 1]:\n left += 1\n while left < right and nums[right] == nums[right - 1]:\n right -= 1\n left += 1\n right -= 1\n elif total < target:\n left += 1\n else:\n right -= 1\n\n return result\n","runtime":"504"},{"code":"class Solution:\n def fourSum(self, arr: List[int], target: int) -> List[List[int]]:\n n = len(arr)\n ans = []\n arr.sort()\n for i in range(n-3):\n if i>0 and arr[i]==arr[i-1]:\n continue\n for j in range(i+1,n-2):\n if j>i+1 and arr[j]==arr[j-1]:\n continue\n l = j+1\n r = n-1\n s = arr[i] + arr[j]\n while l<r:\n s1 = s + arr[l] + arr[r]\n\n if s1==target:\n ans.append((arr[i],arr[j],arr[l],arr[r]))\n l+=1\n while l<r and arr[l]==arr[l-1]:\n l+=1\n r-=1\n while l<r and arr[r]==arr[r+1]:\n r-=1\n elif s1<target:\n l+=1\n while l<r and arr[l]==arr[l-1]:\n l+=1\n else:\n r-=1\n while l<r and arr[r]==arr[r+1]:\n r-=1\n return list(ans)\n","runtime":"517"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort() # O(nlogn) which is fine since code complexity will be O(n^2)\n res = []\n for j in range(len(nums)-3):\n #print(nums[j], nums[j - 1])\n if j > 0 and nums[j] == nums[j - 1]: continue\n for i in range(j + 1, len(nums)-2):\n if i > j + 1 and nums[i] == nums[i-1]: # avoid duplicates\n continue\n left = i + 1\n right = len(nums) - 1\n #print(j, i, left, right)\n while left < right:\n if nums[i] + nums[j] + nums[left] + nums[right] > target:\n right -= 1\n elif nums[i] + nums[j] + nums[left] + nums[right] < target:\n left += 1\n else:\n #print('else')\n res.append([nums[i], nums[j], nums[left], nums[right]])\n left += 1\n while nums[left] == nums[left - 1] and left < right: # avoid duplicates\n left += 1\n return res","runtime":"517"},{"code":"class Solution: \n def fourSum(self, nums: List[int], t: int) -> List[List[int]]:\n n=len(nums)\n nums.sort()\n res=[]\n if(n<4):\n return res\n if(n==4):\n if(sum(nums)==t):\n return [nums]\n else:\n return res\n for i in range(n-3):\n for j in range(i+1,n-2):\n l=j+1\n r=n-1\n target=-(nums[i]+nums[j]-t)\n while(l<r):\n if(nums[l]+nums[r]==target):\n lst=[nums[i],nums[j],nums[r],nums[l]]\n lst.sort()\n if(lst not in res):\n res.append(lst)\n while(l<r and nums[l]==nums[l+1] and nums[r]==nums[r-1]):\n l+=1\n r-=1\n if(nums[l]+nums[r]>target):\n r-=1\n else:\n l+=1\n return res","runtime":"531"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n result = set()\n\n n = len(nums)\n for i in range(n - 3):\n for j in range(i + 1, n - 2):\n remain = target - (nums[i] + nums[j])\n left, right = j + 1, n - 1\n while left < right:\n if nums[left] + nums[right] == remain:\n result.add((nums[i], nums[j], nums[left], nums[right]))\n left += 1\n right -= 1\n elif nums[left] + nums[right] < remain:\n left += 1\n else:\n right -= 1\n\n return [list(ans) for ans in result]","runtime":"531"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n return nSum(nums,4,0,target)\n\ndef nSum(arr,n,start,k):\n sz=len(arr)\n res=[]\n if n<2 or sz<n:\n return res\n if n==2:\n l=start\n r=sz-1\n \n while l<r:\n left,right=arr[l],arr[r]\n curr=left+right\n if curr > k:\n while l<r and arr[r]==right:\n r-=1\n elif curr < k:\n while l<r and arr[l]==left:\n l+=1\n else:\n res.append([left,right])\n while l<r and arr[l]==left:\n l+=1\n while l<r and arr[r]==right:\n r-=1\n return res\n else:\n for i in range(start,sz):\n if i > start and arr[i]==arr[i-1]:\n continue\n sols=nSum(arr,n-1,i+1,k-arr[i])\n for sol in sols:\n sol.append(arr[i])\n res.append(sol)\n return res","runtime":"544"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n res = set()\n nums.sort()\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n l = j + 1\n r = len(nums) - 1\n cur_target = target - (nums[i] + nums[j])\n while l < r:\n if nums[l] + nums[r] == cur_target:\n res.add((nums[i], nums[j], nums[r], nums[l]))\n l += 1\n r -= 1\n elif nums[l] + nums[r] > cur_target:\n r -= 1\n else:\n l += 1\n\n # for l in range(k + 1, len(nums)):\n # if nums[i] + nums[j] + nums[k] + nums[l] == target:\n # res.add((nums[i], nums[j], nums[k], nums[l]))\n return [list(el) for el in res]\n","runtime":"544"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n \n res = set()\n n = len(nums)\n nums.sort()\n print(nums)\n\n # l1 = 0\n # r1 = n - 1\n\n # while l1 < r1:\n \n # outerSum = nums[l1] + nums[r1]\n # remaining = target - outerSum\n\n # l2 = l1 + 1\n # r2 = r1 - 1\n\n # while l2 < r2:\n\n # innerSum = nums[l2] + nums[r2]\n\n # if innerSum < remaining:\n # l2 += 1 \n\n # if innerSum > remaining:\n # r2 -= 1\n \n # if innerSum == remaining:\n # res.add((nums[l1], nums[l2], nums[r2], nums[r1]))\n # l2 += 1\n \n # if outerSum < target:\n # l1 += 1\n # else:\n # r1 -= 1\n\n for first in range(n):\n\n second = first + 1 \n\n while second < n - 2:\n \n l = second + 1\n r = n - 1 \n remainingSum = target - nums[first] - nums[second] \n \n while l < r:\n\n innerSum = nums[l] + nums[r]\n\n if innerSum == remainingSum:\n res.add((nums[first], nums[second], nums[l], nums[r]))\n r -= 1\n\n if innerSum < remainingSum:\n l += 1\n \n if innerSum > remainingSum:\n r -= 1\n\n second += 1\n\n\n return sorted([list(tup) for tup in res])\n\n","runtime":"557"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n r = []\n nums.sort()\n for i in range(len(nums)-3):\n t = target - nums[i]\n for j in range(i+1, len(nums)-2):\n lo, hi = j+1, len(nums)-1\n while lo < hi:\n s = nums[j] + nums[lo] + nums[hi]\n if s > t:\n hi -= 1\n elif s < t:\n lo += 1\n else:\n ans = [nums[i], nums[j], nums[lo], nums[hi]]\n lo += 1\n hi -= 1\n ans.sort()\n if ans not in r: r.append(ans)\n return r\n \n\n\n ","runtime":"557"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n res=[]\n length=len(nums)\n dictionary={}\n for num in range(length):\n if nums[num] in dictionary:\n dictionary[nums[num]].append(num)\n else:\n dictionary[nums[num]]=[num]\n one={}\n for i in range(0,length):\n if(nums[i]in one):\n continue\n else:\n one[nums[i]]=True\n for j in range(i+1,length):\n for k in range(j+1,length):\n temp_sum=nums[i]+nums[j]+nums[k]\n required=target-temp_sum\n temp_list=[]\n if(required in dictionary and dictionary[required][-1]>k):\n temp_list.extend([nums[i],nums[j],nums[k],required])\n temp_list.sort()\n if(temp_list not in res):\n res.append(temp_list)\n return res\n ","runtime":"571"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res = set()\n for i in range(len(nums) - 3):\n for j in range(i + 1, len(nums) - 2):\n left, right = j + 1, len(nums) - 1\n\n while left < right:\n s = nums[i] + nums[j] + nums[left] + nums[right]\n\n if target == s:\n res.add((nums[i], nums[j], nums[left], nums[right]))\n while left < right and nums[left] == nums[left + 1]:\n left += 1\n while left < right and nums[right] == nums[right - 1]:\n right -= 1\n \n left += 1\n right -= 1\n elif s > target:\n right -= 1\n else:\n left += 1\n \n return [list(tup) for tup in res]\n","runtime":"571"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n \n def ksum(nums,target,k):\n res = []\n if not nums:\n return res\n \n # average_value = target//k\n # if average_value < nums[0] or nums[-1] < average_value:\n # return res\n\n if k==2:\n return twosum(nums,target)\n for i in range(len(nums)):\n if i == 0 or nums[i - 1] != nums[i]:\n for subset in ksum(nums[i+1:],target-nums[i],k-1):\n res.append([nums[i]]+subset)\n return res\n\n def twosum(nums,target):\n # print(nums,target)\n\n res = []\n s = set()\n for i in range(len(nums)):\n if len(res) == 0 or res[-1][1] != nums[i]:\n if target - nums[i] in s:\n res.append([target - nums[i], nums[i]])\n s.add(nums[i])\n # print(res)\n return res\n \n nums.sort()\n x =ksum(nums,target,4)\n # print(x)\n return x","runtime":"584"},{"code":"from collections import defaultdict, Counter\nclass Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n i, n = 0, len(nums)\n results = []\n while i < n-3:\n j = i + 1\n while j < n-2:\n l, r = j+1, n-1\n while l < r:\n s = nums[i] + nums[j] + nums[l] + nums[r]\n if s < target:\n l += 1\n while l < r and nums[l] == nums[l-1]:\n l += 1\n elif s > target:\n r -= 1\n while l < r and nums[r] == nums[r+1]:\n r -= 1\n else:\n results.append([nums[i], nums[j], nums[l], nums[r]])\n l += 1\n r -= 1\n while l < r and nums[r] == nums[r+1]:\n r -=1\n while l < r and nums[l] == nums[l-1]:\n l += 1\n j += 1\n while j < n-2 and nums[j] == nums[j-1]:\n j += 1\n i += 1\n while i<n-3 and nums[i] == nums[i-1]:\n i += 1\n return results\n\n\n return result\n \n ","runtime":"584"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n re = []\n nums.sort()\n ln = len(nums)\n for i in range(ln):\n for j in range(i + 1, ln):\n left, right = j + 1, ln -1\n while left < right:\n s = nums[i] + nums[j] + nums[right] + nums[left]\n if s == target:\n lst = [nums[i], nums[j], nums[right], nums[left]]\n if lst not in re:\n re.append(lst)\n\n while right > left and nums[right] == nums[right - 1]:\n right -= 1\n while right > left and nums[left] == nums[left + 1]:\n left += 1\n\n right -= 1\n left += 1\n\n elif s > target:\n right -= 1\n else:\n left += 1\n return re","runtime":"598"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n \n nums.sort()\n def two_sum(target, lst):\n d = set()\n out = []\n dup = set()\n for i in lst:\n if i * 2 == target:\n if i in d:\n dup.add(i)\n else:\n d.add(i)\n else:\n if i in d:\n continue\n if target - i in d:\n out.append([target-i, i])\n d.add(i)\n for i in dup:\n out.append([i,i])\n return out\n\n l = len(nums)\n out = []\n d = collections.defaultdict(set)\n for i in range(l-3):\n for j in range(i+1,l-2):\n a,b = nums[i], nums[j]\n if b in d[a]:\n continue\n d[a].add(b)\n for k in two_sum(target-a-b, nums[j+1:]):\n out.append([a,b] + k)\n return out","runtime":"598"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n=len(nums)\n nums.sort()\n result=set()\n for i in range(n-3):\n for j in range(i+1,n-2):\n l=j+1\n r=n-1\n while (l<r):\n add=nums[i]+nums[j]+nums[l]+nums[r]\n if add==target:\n result.add((nums[i],nums[j],nums[l],nums[r]))\n l+=1\n r-=1\n elif add<target:\n l+=1\n else:\n r-=1\n result=list(result)\n return result","runtime":"611"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n res=set()\n n=len(nums)\n nums.sort()\n for i in range(n-3):\n for j in range(i+1,n-2):\n left,right=j+1,n-1\n while left<right:\n sum=nums[i]+nums[j]+nums[left]+nums[right]\n if sum==target:\n res.add((nums[i],nums[j],nums[left],nums[right]))\n left+=1\n right-=1\n elif sum<target:\n left+=1\n else:\n right-=1\n result=[list(fours) for fours in res] \n return result ","runtime":"611"},{"code":"class Solution:\n def __init__(self):\n self.nums, self.result, self.len = None, set(), 0\n\n \n def twoSum(self, start, target, idxList):\n left, right = start, self.len - 1\n\n while left < right:\n total = self.nums[left] + self.nums[right]\n\n if total == target:\n res = (self.nums[idxList[0]], self.nums[idxList[1]], self.nums[left] ,self.nums[right])\n self.result.add(res)\n \n if total > target:\n right -= 1\n else:\n left += 1\n\n \n def threeSum(self, start, target, idxList):\n for idx, num in enumerate(self.nums[start:-2]):\n self.twoSum(start + idx + 1, target - num, idxList + [start + idx])\n\n\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n self.nums, self.len = nums, len(nums)\n nums.sort()\n\n for idx, num in enumerate(nums[:-3]):\n self.threeSum(idx + 1, target - num, [idx])\n\n return self.result\n ","runtime":"651"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n if len(nums) < 4:\n return []\n\n nums.sort()\n n = len(nums)\n results = []\n i = 0\n while i < n - 3:\n j = i + 1\n while j < n - 2:\n l = j+1\n r = n-1\n while l < r:\n total = nums[i] + nums[j] + nums[l] + nums[r]\n if total == target:\n results.append([nums[i], nums[j], nums[l], nums[r]])\n if total <= target:\n prev = nums[l]\n while l < n and nums[l] == prev:\n l += 1\n else:\n prev = nums[r]\n while r >= 0 and nums[r] == prev:\n r -= 1\n prev = nums[j]\n while j < n and nums[j] == prev:\n j += 1\n prev = nums[i]\n while i < n and nums[i] == prev:\n i += 1\n return results\n\n\n ","runtime":"651"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n = len(nums)\n nums.sort()\n ans = []\n res = set()\n for i in range(n):\n for j in range(i+1,n):\n k = j+1\n l = n-1\n while k<l:\n sum = nums[i]+nums[j]+nums[k]+nums[l]\n if sum == target:\n temp = [nums[i],nums[j],nums[k],nums[l]]\n res.add(tuple(temp))\n k += 1\n l -= 1\n elif sum<target:\n k += 1\n elif sum>target:\n l -= 1\n ans = list(res)\n return ans\n \n \n \n ","runtime":"665"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums = sorted(nums)\n len_nums = len(nums)\n ans = set()\n for a in range(len_nums):\n for b in range(a+1, len_nums):\n c, d = b+1, len_nums - 1\n while c < d:\n curr = nums[a] + nums[b] + nums[c] + nums[d]\n\n if curr < target:\n c += 1\n elif curr > target:\n d -= 1\n else:\n ans.add((nums[a], nums[b], nums[c], nums[d]))\n c += 1\n return list(ans)","runtime":"665"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n t=[]\n for i in range(len(nums)):\n if i>0 and nums[i]==nums[i-1]:\n continue\n for j in range(i+1,len(nums)):\n if j>i+1 and nums[j]==nums[j-1]:\n continue\n l=j+1\n r=len(nums)-1\n while l<r:\n s=nums[i]+nums[j]+nums[l]+nums[r]\n a=[nums[i],nums[j],nums[l],nums[r]]\n if s==target:\n \n t.append(a)\n l+=1\n r-=1\n while l<r and nums[l]==nums[l-1]:\n l+=1\n while l<r and nums[r]==nums[r+1]:\n r-=1\n elif s<target:\n l+=1\n else:\n r-=1\n return t\n ","runtime":"678"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n n = len(nums)\n if n < 4:\n return []\n\n n = len(nums)\n quadruplets = [] \n seen = set()\n for i in range(n):\n for j in range(i+1,n):\n left,right = j+1,n-1\n cnt_target = target - nums[i] - nums[j]\n while left<right:\n if nums[left] + nums[right] == cnt_target and tuple([nums[i],nums[j],nums[left],nums[right]]) not in seen:\n quadruplets.append([nums[i],nums[j],nums[left],nums[right]])\n seen.add(tuple([nums[i],nums[j],nums[left],nums[right]]))\n left+=1\n right-=1\n elif nums[left] + nums[right]<cnt_target:\n left+=1\n else:\n right-=1\n return quadruplets","runtime":"678"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n ans = set()\n\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n\n for j in range(i + 1, len(nums)-2):\n k = j + 1\n m = len(nums) - 1\n while k < m:\n if nums[i] + nums[j] + nums[k] + nums[m] == target:\n ans.add((nums[i], nums[j], nums[k], nums[m]))\n k += 1\n m -= 1\n elif nums[i] + nums[j] + nums[k] + nums[m] < target:\n k += 1\n else:\n m -= 1\n return ans\n\n","runtime":"691"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n allSums=[]\n length=len(nums)\n\n for x in range(length-3):\n if x>0 and nums[x]==nums[x-1]: #to avoid repeating values\n continue\n for i in range(x+1,length-2):\n if i>x+1 and nums[i]==nums[i-1]: #to avoid repeating values\n continue\n \n ptr1=i+1\n ptr2=len(nums)-1\n while ptr1<ptr2: \n\n if nums[i]+nums[ptr1]+nums[ptr2]+nums[x]==target: \n oneSum=[nums[x],nums[i],nums[ptr1],nums[ptr2]]\n allSums.append(oneSum)\n ptr1=ptr1+1\n while nums[ptr1]==nums[ptr1-1] and ptr1<ptr2:\n ptr1=ptr1+1\n elif nums[i]+nums[ptr1]+nums[ptr2]+nums[x]<target:\n ptr1=ptr1+1\n else:\n ptr2=ptr2-1\n return allSums \n\n","runtime":"691"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n ans = set()\n n = len(nums)\n nums.sort()\n\n for i in range(n):\n for j in range(i+1, n):\n k = j + 1\n l = n - 1\n\n while k < l:\n sums = nums[i] + nums[j] + nums[k] + nums[l]\n if sums == target:\n ans.add((nums[i],nums[j],nums[k],nums[l]))\n k += 1\n elif sums < target:\n k += 1\n else:\n l -= 1\n return ans","runtime":"705"},{"code":"#use hashmap to store the sum of two elements as the value, the sum as the key.\n#for each value under the key, we stored it in the hashset. \n#then loop all keys in the hashmap to see if thye sume of two keys are the target and recor dthew corresponding values(two sets)\nclass Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n if nums == [2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2]:\n return [ [2,2,2,2] ]\n if len(nums) <4:\n return None\n #initalization:\n # #avoid duplicate; always small to larger!\n # nums.sort()\n #create a hashmap!\n hashmap = {}\n for i in range(len(nums)):\n for j in range(i+1,len(nums)):\n if nums[i]+nums[j] not in hashmap:\n hashmap[nums[i]+nums[j]] = set()\n hashmap[nums[i]+nums[j]].add((i,j))\n #extract all keys:\n #print(hashmap)\n keys = list(hashmap.keys())\n res = set()\n #print(keys)\n #check all keys:\n for key in keys:\n if key in hashmap and target-key in hashmap:\n #check every possible pairs:\n sets1 = list(hashmap[key])\n sets2 = list(hashmap[target-key])\n for i in range(len(sets1)):\n for j in range(len(sets2)):\n if len(set(sets1[i]+sets2[j])) == 4:\n ii,jj = sets1[i]\n kk,zz = sets2[j]\n res.add( tuple(sorted([nums[ii],nums[jj],nums[kk],nums[zz]])) )\n return list(res)\n\n#method 2: loop & two pointer!\nclass Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n #sort the array: to help with the duplicates and two pointer:\n nums.sort()\n res = []\n #traverse the array:\n #the first element:\n for i in range(len(nums)):\n #skip the duplicate for the first element:\n if i > 0 and nums[i] == nums[i-1]:\n continue\n #second elment:\n for j in range(i+1,len(nums)-4+2):\n #skip the second elment if we have duplicates:\n if j > i+1 and nums[j] == nums[j-1]:\n continue\n #last two elements:\n l,r = j+1,len(nums)-1\n while l < r:\n if nums[l]+nums[r]+ nums[i]+nums[j] == target:\n res.append([nums[i],nums[j],nums[l],nums[r]])\n #update pointer:\n #left:\n l += 1\n while l < r and nums[l] == nums[l-1]:\n l += 1\n #right:\n r -= 1\n while r >l and nums[r] == nums[r+1]:\n r -= 1\n elif nums[l]+nums[r]+ nums[i]+nums[j] < target:\n l += 1\n else:\n r -= 1\n return res\n\n\n","runtime":"705"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n \n \"\"\"\n First I thing in a n^3 solution in time and n memory solution\n\n i do triple nested loop , make the sume and next i check if exit -sum\n\n \"\"\"\n\n output = []\n\n #1: sort array\n nums = sorted(nums)\n memo = {}\n used = {}\n n = len(nums)\n #2: memorize the position of the nums\n for i in range(n):\n memo[nums[i]] = i\n\n #3: nested loop\n\n for i in range(n):\n for j in range(i+1,n):\n for k in range(j+1,n):\n\n sum = target - (nums[i] + nums[j] + nums[k]) \n #print(sum,nums[i],nums[j],nums[k],target)\n #4: validate and append num\n if sum in memo and memo[sum]>k and not (nums[i],nums[j],nums[k],sum)in used:\n #print(\"xx\")\n used[(nums[i],nums[j],nums[k],sum)] = True\n output.append([nums[i],nums[j],nums[k],sum])\n\n \n\n return output\n","runtime":"718"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n list1=[]\n for i in range(len(nums)):\n if i>0 and nums[i]==nums[i-1]:\n continue\n for j in range(i+1,len(nums)):\n if j>i+1 and nums[j]==nums[j-1]:\n continue\n k=j+1\n l=len(nums)-1\n while(k<l):\n if(nums[i]+nums[j]+nums[k]+nums[l]==target):\n a=[]\n a.append(nums[i])\n a.append(nums[j])\n a.append(nums[k])\n a.append(nums[l])\n list1.append(a)\n k+=1\n l-=1\n while(k<l and nums[k]==nums[k-1]):\n k=k+1\n while(k<l and nums[l]==nums[l+1]):\n l=l-1\n elif nums[i]+nums[j]+nums[k]+nums[l]>target:\n l-=1\n else:\n k+=1\n return list1\n\n ","runtime":"718"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n = len(nums)\n nums.sort()\n res=[]\n s=set()\n for i in range(n-3):\n for j in range(i+1,n-1):\n k=j+1\n l=n-1\n while k<l:\n total = nums[i]+nums[j]+nums[k]+nums[l]\n if total < target:\n k=k+1\n if total > target:\n l=l-1\n if total==target:\n s.add((nums[i],nums[j],nums[k],nums[l]))\n k=k+1\n l=l-1\n while k<n and nums[k]==nums[k-1]:\n k=k+1\n while l>0 and nums[l]==nums[l+1]:\n l=l-1\n res = list(s)\n return res","runtime":"732"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n result = []\n nums.sort()\n for i in range(len(nums) - 3):\n for j in range(i + 1, len(nums) - 2):\n k = j + 1\n l = len(nums) - 1\n while k < l:\n total = nums[i] + nums[j] + nums[k] + nums[l]\n if total == target:\n if ([nums[i], nums[j], nums[k], nums[l]] not in result):\n result.append([nums[i], nums[j], nums[k], nums[l]])\n k += 1\n elif total < target:\n k += 1\n elif total > target:\n l -= 1\n return result\n ","runtime":"732"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n if len(nums) < 4:\n return []\n \n nums.sort()\n result = set()\n \n for i in range(len(nums) - 3):\n for j in range(i + 1, len(nums) - 2):\n now = nums[i] + nums[j]\n l = j + 1\n r = len(nums) - 1\n while l < r:\n if nums[l] + nums[r] + now == target:\n if (nums[i], nums[j], nums[l], nums[r]) not in result:\n result.add((nums[i], nums[j], nums[l], nums[r]))\n if nums[l] + nums[r] + now > target:\n r -= 1\n else:\n l += 1\n \n return list(result)","runtime":"745"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n res = []\n nums.sort()\n second, s, e = None, None, None\n for i in range(0, len(nums) - 3):\n second = i + 1\n while second < len(nums) - 2:\n s = second + 1\n e = len(nums) - 1\n while s < e:\n sum = nums[i] + nums[second] + nums[s] + nums[e]\n if sum == target:\n if not [nums[i], nums[second], nums[s], nums[e]] in res:\n res.append([nums[i], nums[second], nums[s], nums[e]])\n if sum > target:\n e-=1\n else:\n s+=1\n second+=1\n return res\n \n ","runtime":"745"},{"code":"\"\"\"\nNaive approach\n\n> Try all combinations until you find one that sums to target\n\n[1,2,3,4,5]\n^ ^ ^l ^r\nadjust l, r till a+b+l+r == target\n- none found\n- incr b\n\n- when b reaches end - 1\n> increment a and start again\n\nTime complexity:\n\nO(n^2 * n * nlogn) => O(n^3logn)\n\"\"\"\n\nclass Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n = len(nums)\n quadruplets = []\n\n # Sort the array\n nums.sort()\n for a in range(n-1):\n for b in range(a+1, n-2):\n left = b+1\n right = n-1\n while left < right:\n total = nums[a] + nums[b] + nums[left] + nums[right]\n if total == target:\n entry = [nums[a], nums[b], nums[left], nums[right]]\n if entry not in quadruplets:\n quadruplets.append([nums[a], nums[b], nums[left], nums[right]])\n \n if total < target:\n left += 1\n else:\n right -= 1\n \n return quadruplets","runtime":"758"},{"code":"import sys\nclass Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n quads = set()\n nums.sort()\n n = len(nums)\n for i in range(n-3):\n for j in range(i+1, n-2):\n l, r = j+1, n-1\n while l < r:\n curr_sum = nums[i] + nums[j] + nums[l] + nums[r]\n\n if curr_sum < target:\n l += 1\n elif curr_sum > target:\n r -= 1\n else:\n quads.add((nums[i], nums[j], nums[l], nums[r]))\n l += 1\n return [list(q) for q in quads]","runtime":"758"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n ans = []\n if len(nums) < 4:\n return ans\n nums.sort()\n for i in range(len(nums)-3):\n for j in range(i+1, len(nums)-2):\n l, r = j+1, len(nums)-1\n while l < r:\n s = nums[i] + nums[j] + nums[l] + nums[r]\n if s == target:\n m = [nums[i], nums[j], nums[l], nums[r]]\n if m not in ans:\n ans.append(m)\n if s <= target:\n l += 1\n elif s > target:\n r -= 1\n return ans","runtime":"772"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n res=set()\n n=len(nums)\n nums.sort()\n for i in range(n-3):\n for j in range(i+1,n-2):\n l, r = j + 1, len(nums) - 1\n while l < r:\n s = nums[i] + nums[l] + nums[r] + nums[j]\n if s == target:\n res.add((nums[i],nums[j], nums[l], nums[r]))\n l += 1\n r -= 1\n while l < r and nums[l] == nums[l - 1]:\n l += 1\n while l < r and nums[r] == nums[r + 1]:\n r -= 1\n elif s < target:\n l += 1\n elif s > target:\n r -= 1\n return [list(triplet) for triplet in res]\n ","runtime":"772"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n l=[]\n for i in range(len(nums)):\n for j in range(i+1,len(nums)):\n current_sum=nums[i]+nums[j]\n left=j+1\n right=len(nums)-1\n while left<right:\n if nums[left]+nums[right]==target-current_sum:\n if [nums[i],nums[j],nums[left],nums[right]] not in l:\n l.append([nums[i],nums[j],nums[left],nums[right]])\n\n if nums[left]+nums[right]>target-current_sum:\n right-=1\n else:\n left+=1\n return l","runtime":"785"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n # nums.sort()\n # res, quad = [] , []\n\n # def kSum(k, start, target):\n # if k != 2 :\n # for i in range(start,len(nums)-k+1):\n # if i > start and nums[i] == nums[i-1]:\n # continue\n # quad.append(nums[i])\n # kSum(k-1, i+1, target-nums[i])\n # quad.pop()\n # return\n \n \n # l , r = start, len(nums) - 1\n # while l < r:\n # if nums[l] + nums[r] > target:\n # r -= 1\n # elif nums[l] + nums[r] < target:\n # l += 1\n # else:\n # res.append(quad + [nums[l], nums[r]])\n # l += 1\n # while nums[l] == nums[l-1] and l < r:\n # l += 1\n \n # kSum(4,0,target)\n # return res \n\n #抄的solutions\n nums.sort()\n s = set()\n for i in range(len(nums)):\n for j in range(i+1,len(nums)):\n l = j+1\n r = len(nums)-1\n while l<r:\n if nums[i] + nums[j] + nums[l] + nums[r]<target:\n l+=1\n elif nums[i] + nums[j] + nums[l] + nums[r]>target:\n r-=1\n elif nums[i] + nums[j] + nums[l] + nums[r]==target:\n s.add((nums[i],nums[j],nums[l],nums[r]))\n l+=1\n r-=1\n return s\n\n","runtime":"785"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n values_from_prefix = set()\n n = len(nums)\n quadruplets = set()\n\n for i in range(n):\n for j in range(i + 1, n):\n for k in range(j + 1, n):\n remainder = target - nums[i] - nums[j] - nums[k]\n if remainder in values_from_prefix:\n quadruplet = tuple(sorted([remainder, nums[i], nums[j], nums[k]]))\n quadruplets.add(quadruplet)\n values_from_prefix.add(nums[i])\n\n results = [list(quadruplet) for quadruplet in quadruplets]\n\n return results","runtime":"799"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n nums_len = len(nums)\n quad_list = []\n for i in range(nums_len-3):\n if nums[i] == nums[i-1] and i>0:\n continue\n\n target_3sum = target - nums[i]\n for j in range(i+1, nums_len-2):\n \n if nums[j]==nums[j-1] and j-1>i:\n continue\n k = j + 1\n mem = {}\n while k < nums_len:\n if nums[k] == nums[k-1] == nums[k-2] and k-2>j:\n k+=1\n continue\n diff = target_3sum - nums[j] - nums[k]\n if diff in mem:\n quad_list.append([nums[i], nums[j], nums[k], diff])\n mem.pop(diff)\n k += 1\n continue\n else:\n mem[nums[k]] = k\n k += 1\n continue\n return quad_list\n\n ","runtime":"799"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n def twosum(lowbound,t):\n seen = set()\n viable = []\n for k in range(lowbound,len(nums)):\n c = nums[k]\n if t-c in seen:\n viable.append((t-c,c))\n seen.add(c)\n return viable\n\n ans = set()\n nums.sort()\n for i in range(len(nums)-3):\n a = nums[i]\n for j in range(i+1,len(nums)-2):\n b = nums[j]\n ans.update((a,b,c,d) for c,d in twosum(j+1,target-nums[i]-nums[j]))\n return ans\n\n \n ","runtime":"812"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n def twosum(lowbound,t):\n seen = set()\n viable = []\n for k in range(lowbound,len(nums)):\n c = nums[k]\n if t-c in seen:\n viable.append((t-c,c))\n seen.add(c)\n return viable\n\n ans = set()\n nums.sort()\n for i in range(len(nums)-3):\n a = nums[i]\n for j in range(i+1,len(nums)-2):\n b = nums[j]\n ans.update((a,b,c,d) for c,d in twosum(j+1,target-nums[i]-nums[j]))\n return ans\n\n \n ","runtime":"812"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res = []\n for i in range(len(nums)):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n for j in range(i+1, len(nums)):\n if j> i+1 and nums[j] == nums[j-1]:\n continue\n print(nums[i],nums[j])\n self.twoSum( nums[j+1:], target-nums[i]-nums[j], res,nums[i] , nums[j]) \n return res\n\n def twoSum(self, nums, target, res, num1, num2):\n left, right = 0, len(nums)-1\n while left < right:\n if left > 0 and nums[left] == nums[left-1]:\n left +=1\n continue\n if right < len(nums) - 1 and nums[right] == nums[right+1]:\n right -= 1\n continue\n if nums[left] + nums[right] == target:\n res.append([num1,num2, nums[left], nums[right]])\n left += 1\n right -= 1\n elif nums[left] + nums[right] < target:\n left += 1\n elif nums[left] + nums[right] > target:\n right -= 1 \n \n\n \n\n ","runtime":"825"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n\n res = []\n n = len(nums)\n if n < 4:\n return res\n a = 0\n while a < n - 3:\n b = a + 1\n while b < n - 2:\n c = b + 1\n d = n - 1\n while c < d:\n if nums[a] + nums[b] + nums[c] + nums[d] == target:\n res.append([nums[a], nums[b], nums[c], nums[d]])\n c += 1\n while c < d and nums[c] == nums[c - 1]:\n c += 1\n elif nums[a] + nums[b] + nums[c] + nums[d] < target:\n c += 1\n while c < d and nums[c] == nums[c - 1]:\n c += 1\n else:\n d -= 1\n while c < d and nums[d] == nums[d + 1]:\n d -= 1\n b += 1\n while b < n - 2 and nums[b] == nums[b - 1]:\n b += 1\n a += 1\n while a < n - 3 and nums[a] == nums[a - 1]:\n a += 1\n return res\n ","runtime":"825"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n = len(nums)\n res = []\n nums.sort()\n\n for a in range(n):\n if a > 0 and nums[a - 1] == nums[a]:\n continue \n for b in range(a + 1, n):\n if b > a + 1 and nums[b - 1] == nums[b]:\n continue\n tot = nums[a] + nums[b]\n right = n - 1\n left = b + 1\n while left < right:\n while right >= 0 and right < n - 1 and nums[right] == nums[right + 1]:\n right -= 1\n while left < n and left > b + 1 and nums[left] == nums[left - 1]:\n left += 1\n if left < right and tot + nums[right] + nums[left] == target:\n res.append([nums[a], nums[b], nums[left], nums[right]])\n left += 1\n right -= 1\n elif left < right and tot + nums[right] + nums[left] > target:\n right -= 1\n else:\n left += 1\n\n return res","runtime":"839"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n values_from_prefix = set()\n n = len(nums)\n quadruplets = set()\n\n for i in range(n):\n for j in range(i + 1, n):\n for k in range(j + 1, n):\n remainder = target - nums[i] - nums[j] - nums[k]\n if remainder in values_from_prefix:\n quadruplet = tuple(sorted([remainder, nums[i], nums[j], nums[k]]))\n quadruplets.add(quadruplet)\n values_from_prefix.add(nums[i])\n\n quadruplets = [list(quadruplet) for quadruplet in quadruplets]\n\n return quadruplets","runtime":"839"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res = set()\n for i in range(len(nums)-3):\n for j in range(i+1,len(nums)-2):\n m = j+1\n n = len(nums) - 1\n while m < n:\n if nums[m] + nums[n] == target - (nums[i] + nums[j]):\n res.add((nums[i],nums[j],nums[m],nums[n]))\n m+=1\n n-=1\n elif target - (nums[i] + nums[j]) > (nums[m] + nums[n]):\n m+=1\n else:\n n-=1\n \n return [list(t) for t in res]\n\n ","runtime":"852"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res = []\n for a in range(len(nums)-3):\n for b in range(a+1, len(nums)-2):\n c = b + 1\n d = len(nums) - 1\n\n while c < d:\n if nums[a] + nums[b] + nums[c] + nums[d] == target:\n res.append((nums[a], nums[b], nums[c], nums[d]))\n c += 1\n d -= 1\n elif nums[a] + nums[b] + nums[c] + nums[d] > target:\n d -= 1\n else:\n c += 1\n \n return list(set(res))\n","runtime":"852"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res = []\n for a in range(len(nums)-3):\n for b in range(a+1, len(nums)-2):\n c = b + 1\n d = len(nums) - 1\n\n while c < d:\n if nums[a] + nums[b] + nums[c] + nums[d] == target:\n res.append((nums[a], nums[b], nums[c], nums[d]))\n c += 1\n d -= 1\n elif nums[a] + nums[b] + nums[c] + nums[d] > target:\n d -= 1\n else:\n c += 1\n \n return list(set(res))\n","runtime":"866"},{"code":"class Solution(object):\n def fourSum(self, nums, target):\n output=[]\n if len(nums)>=4:\n nums=sorted(nums)\n for i in range(len(nums)-3):\n for j in range(i+1, len(nums)-2):\n head=j+1\n tail=len(nums)-1\n while tail>head:\n if nums[i]+nums[j]+nums[head]+nums[tail]==target:\n if [nums[i],nums[j],nums[head],nums[tail]] not in output:\n output.append([nums[i],nums[j],nums[head],nums[tail]])\n head+=1\n tail-=1\n elif nums[i]+nums[j]+nums[head]+nums[tail]>target:\n tail-=1\n else:\n head+=1\n \n \n \n return output\n ","runtime":"866"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n\n quadruplets = []\n nums.sort()\n for i,num1 in enumerate(nums):\n if not (i != 0 and nums[i] == nums[i-1]):\n for j in range(i+1,len(nums)):\n if not (j != (i+1) and nums[j] == nums[j-1]):\n left = j + 1\n right = len(nums)-1\n print(\"left : \", left, \"j : \", j)\n while left < right:\n\n if nums[left] + nums[right] + num1 + nums[j] == target:\n quadruplets.append([nums[left],nums[right],num1,nums[j]])\n left = left + 1\n while left < len(nums) and nums[left] == nums[left-1]:\n left = left + 1\n continue\n if nums[left] + nums[right] + num1 + nums[j] < target:\n left = left + 1\n continue\n if nums[left] + nums[right] + num1 + nums[j] > target:\n right = right - 1\n return quadruplets\n \n \n \n \n\n \n\n\n ","runtime":"879"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n ans = set()\n n = len(nums)\n nums.sort()\n\n for i in range(n):\n for j in range(i+1, n):\n k = j + 1\n l = n - 1\n\n while k < l:\n sums = nums[i] + nums[j] + nums[k] + nums[l]\n if sums == target:\n ans.add(tuple(sorted((nums[i], nums[j], nums[k], nums[l]))))\n k += 1\n elif sums < target:\n k += 1\n else:\n l -= 1\n return ans","runtime":"879"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n \n # optimized solution to be O(n^3)\n quads = set()\n n = len(nums)\n for a in range(n - 3):\n for b in range(a + 1, n - 2):\n # start two pointer here at the 3rd index\n left = b + 1\n right = n - 1\n while left < right:\n if nums[a] + nums[b] + nums[left] + nums[right] > target:\n right -= 1\n elif nums[a] + nums[b] + nums[left] + nums[right] < target:\n left += 1\n else: # they equal target, add the quadruplet to the asnwer set\n quads.add((nums[a], nums[b], nums[left], nums[right]))\n left += 1\n return list(quads)","runtime":"892"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n res = []\n a = 0\n nums = sorted(nums)\n while a < len(nums):\n b = a + 1\n while b < len(nums):\n c = b + 1\n d = len(nums)-1\n while c < d:\n total = nums[a] + nums[b] + nums[c] + nums[d]\n if total > target:\n d-=1\n if total < target:\n c+=1\n if total == target:\n if sorted([nums[a] ,nums[b] ,nums[c] , nums[d]]) not in res:\n res.append(sorted([nums[a] ,nums[b] ,nums[c] , nums[d]]))\n # print(a,b,c,d)\n c+=1\n b+=1\n a+=1\n return res","runtime":"892"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n = len(nums)\n res = set()\n nums.sort()\n def twoSum(j, target):\n dic = {}\n res = []\n for i in range(j, n):\n if target - nums[i] in dic:\n res.append((nums[i], target - nums[i]))\n dic[nums[i]] = i\n return res\n\n\n for i in range(n):\n for j in range(i + 1, n):\n tmp = twoSum(j + 1, target - nums[i] - nums[j])\n for op in tmp:\n res.add((nums[i], nums[j], *op))\n\n return res\n","runtime":"906"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n if len(nums) < 4:\n return []\n nums = sorted(nums)\n res = set()\n for p1 in range(len(nums) - 3):\n for p2 in range(p1+1, len(nums) - 2):\n p4 = len(nums) - 1\n p3 = p4 - 1\n max_sum = sum([nums[x] for x in [p1, p2, p3, p4]])\n p3 = p2 + 1\n p4 = p3 + 1\n min_sum = sum([nums[x] for x in [p1, p2, p3, p4]])\n if min_sum <= target and max_sum >= target:\n p3 = p2 + 1\n p4 = len(nums) - 1\n while p3 < p4:\n candidate = [nums[x] for x in [p1, p2, p3, p4]]\n cand_sum = sum(candidate)\n if cand_sum == target and tuple(candidate) not in res:\n res.add(tuple(candidate))\n if cand_sum > target:\n p4 -= 1\n else:\n p3 += 1\n return res","runtime":"906"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res = set()\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n aim = target - nums[i] - nums[j]\n seen = set()\n for k in range(j + 1, len(nums)):\n if aim - nums[k] in seen:\n res.add(tuple(sorted([nums[i], nums[j], aim - nums[k], nums[k]])))\n seen.add(nums[k])\n \n return res\n\n\n\n ","runtime":"919"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n res = []\n length = len(nums)\n nums = sorted(nums)\n\n last_i = \"nan\"\n last_j = \"nan\"\n\n for i in range(length):\n if last_i == nums[i]:\n continue\n \n last_i = nums[i]\n last_j = \"nan\"\n for j in range(length):\n if i >= j or last_j == nums[j]:\n continue\n else:\n last_j = nums[j]\n k = j+1\n l = length - 1\n\n while k < l:\n cand = [nums[i], nums[j], nums[k], nums[l]]\n total = sum(cand)\n\n if total < target:\n k += 1\n while k < length and nums[k] == nums[k-1]:\n k += 1\n elif total > target:\n l -= 1\n while l > 0 and nums[l] == nums[l+1]:\n l -= 1\n else:\n res.append(cand)\n k += 1\n while k < length and nums[k] == nums[k-1]:\n k += 1\n \n return res","runtime":"919"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n out = set()\n nums.sort()\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n f, l = j + 1, len(nums) - 1\n while f < l:\n if nums[i] + nums[j] + nums[f] + nums[l] == target:\n out.add((nums[i], nums[j], nums[f], nums[l]))\n f += 1\n elif nums[i] + nums[j] + nums[f] + nums[l] < target:\n f += 1\n else:\n l -= 1\n return out","runtime":"933"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n res = []\n length = len(nums)\n nums = sorted(nums)\n\n last_i = \"nan\"\n last_j = \"nan\"\n\n for i in range(length):\n if last_i == nums[i]:\n continue\n \n last_i = nums[i]\n last_j = \"nan\"\n for j in range(length):\n if i >= j or last_j == nums[j]:\n continue\n else:\n last_j = nums[j]\n k = j+1\n l = length - 1\n\n while k < l:\n cand = [nums[i], nums[j], nums[k], nums[l]]\n total = sum(cand)\n\n if total < target:\n k += 1\n while k < l and nums[k] == nums[k-1]:\n k += 1\n elif total > target:\n l -= 1\n while k < l and nums[l] == nums[l+1]:\n l -= 1\n else:\n res.append(cand)\n k += 1\n while k < l and nums[k] == nums[k-1]:\n k += 1\n \n return res","runtime":"933"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n=len(nums)\n nums.sort()\n print(nums)\n res=[]\n for i in range(0,n-3):\n for j in range(i+1,n-2):\n l=j+1\n r=n-1\n while(l<r):\n if nums[i]+nums[j]+nums[l]+nums[r] == target:\n if [nums[i],nums[j],nums[l], nums[r]] not in res:\n res.append([nums[i],nums[j],nums[l], nums[r]])\n l+=1\n elif nums[i]+nums[j]+nums[l]+nums[r] > target:\n r-=1\n else:\n l+=1\n return res\n\n\n\n \n\n\n ","runtime":"946"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res = set()\n for i in range(len(nums)):\n for j in range(i+1,len(nums)):\n m = j+1\n n = len(nums) - 1\n while m < n:\n if nums[m] + nums[n] == target - (nums[i] + nums[j]):\n res.add((nums[i],nums[j],nums[m],nums[n]))\n m+=1\n elif target - (nums[i] + nums[j]) > (nums[m] + nums[n]):\n m+=1\n else:\n n-=1\n \n return [list(t) for t in res]\n\n ","runtime":"946"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n mp ={}\n nums.sort()\n ans=set()\n n=len(nums)\n for i in range(n-2):\n for j in range(i+1,n-1):\n mp = {}\n for k in range(j+1,n):\n sum = nums[i]+nums[j]+nums[k]\n if target-sum in mp:\n ans.add((nums[i],nums[j],nums[k],target-sum))\n \n mp[nums[k]]=1\n \n return ans\n\n\n\n\n\n ","runtime":"959"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n qples=[]\n for i in range(len(nums)):\n # if i>0 and nums[i]==nums[i-1]:\n # continue\n for j in range(i+1,len(nums)):\n # if j>i+1 and nums[j]==nums[j-1] :\n # continue\n ptr1 = j+1\n ptr2 = len(nums)-1\n while(ptr1<ptr2):\n qple = [nums[i],nums[j],nums[ptr1],nums[ptr2]]\n qsum = sum(qple)\n if qsum<target:\n ptr1+=1\n elif qsum>target:\n ptr2-=1\n else:\n if qple not in qples:\n qples.append(qple)\n ptr1+=1\n ptr2-=1\n # while ptr1<ptr2 and nums[ptr1]==nums[ptr2-1]:\n # ptr1+=1\n # while ptr1<ptr2 and nums[ptr1]==nums[ptr2+1]:\n # pt2-=1\n return qples\n ","runtime":"959"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n i = 0\n nums.sort()\n result = []\n while(i<len(nums)-3):\n j=i+1\n while(j<len(nums)-2):\n existingnumber = nums[i] + nums[j]\n left_ptr = j+1\n right_ptr = len(nums)-1\n while(left_ptr<right_ptr):\n totalsum = existingnumber + nums[left_ptr] + nums[right_ptr]\n if(totalsum==target):\n result.append([nums[i],nums[j],nums[left_ptr],nums[right_ptr]])\n left_ptr+=1\n elif(totalsum<target):\n left_ptr+=1\n elif(totalsum>target):\n right_ptr-=1\n \n j+=1\n i+=1\n \n unique_result = []\n result.sort()\n for r in result:\n if not unique_result or unique_result[-1]!=r:\n unique_result.append(r)\n return unique_result\n ","runtime":"973"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n=len(nums)\n \n st=set()\n total=0\n for i in range(n):\n for j in range(i+1,n):\n hashset=set()\n for k in range(j+1,n):\n fourth=target-(nums[i]+nums[j]+nums[k])\n \n if fourth in hashset:\n temp=[nums[i],nums[j],nums[k],fourth]\n temp.sort()\n st.add(tuple(temp))\n else:\n hashset.add(nums[k])\n \n \n \n \n ans=[list(x) for x in st]\n return ans\n ","runtime":"973"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n # n = len(nums)\n # nums.sort()\n # ans = []\n # for i in range(n):\n # if i>0 and nums[i]==nums[i-1]:\n # continue\n # for j in range(i+1,n):\n # if j!=i+1 and nums[j]==nums[j-1]:\n # continue\n # k = j+1\n # l = n-1\n # while k<l:\n # s = nums[i] + nums[j] + nums[k] + nums[l]\n # if s==target:\n # ans.append([nums[i],nums[j],nums[k],nums[l]])\n # k = k+1\n # l = l-1\n # while k<l and nums[k]==nums[k-1]:\n # k = k+1\n # while k<l and nums[l] == nums[l+1]:\n # l = l-1\n # elif s<target:\n # k = k+1\n # else:\n # l = l-1\n # return ans\n\n n = len(nums)\n ans = []\n for i in range(n):\n for j in range(i+1,n):\n temp = set()\n for k in range(j+1,n):\n fourth = target - (nums[i]+nums[j]+nums[k])\n if fourth in temp:\n quad = [nums[i],nums[j],nums[k],fourth]\n quad.sort()\n if quad not in ans:\n ans.append(quad)\n temp.add(nums[k])\n return ans","runtime":"986"},{"code":"# Better\nclass Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n\n arr=set()\n nums.sort()\n n=len(nums)\n\n for i in range(n):\n for j in range(i+1,n):\n # Take a hash set\n hashset=set()\n for k in range(j+1,n):\n\n sum=nums[i]+nums[j]+nums[k]\n fourth=target-sum\n # check if fourth elem exist in hashset\n #if so add that to result ie arr\n\n if fourth in hashset:\n temp=[nums[i],nums[j],nums[k],fourth]\n arr.add(tuple(temp))\n # at the end push the elem in hashset\n hashset.add(nums[k])\n\n \n return list(arr)\n \n\n \n\n\n\n\n ","runtime":"986"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n=len(nums)\n myset=set()\n ans=[]\n for i in range(n):\n for j in range(i+1,n):\n st=set()\n for k in range(j+1,n):\n fourth=target-(nums[i]+nums[j]+nums[k])\n if fourth in st:\n temp=[nums[i],nums[j],nums[k],fourth]\n temp.sort()\n myset.add(tuple(temp))\n st.add(nums[k]) \n\n for i in myset:\n ans.append(list(i))\n return ans \n ","runtime":"1000"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n length = len(nums)\n result = []\n dup_check = set()\n for a_idx in range(length-3):\n a = nums[a_idx]\n for b_idx in range(a_idx+2, length-1):\n b = nums[b_idx]\n left = b_idx-1\n right = b_idx+1\n while left > a_idx and right < length:\n c = nums[left]\n d = nums[right]\n if a+b+c+d == target and tuple([a, b, c, d]) not in dup_check:\n result.append([a,b,c,d])\n dup_check.add(tuple([a,b,c,d]))\n if a+b+c+d < target:\n right += 1\n else:\n left -= 1\n return result","runtime":"1000"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n left = 0\n right = len(nums) -1\n result = set()\n move = 0\n\n for i in range(len(nums) - 3):\n for j in range(i + 3, len(nums)):\n left = i + 1\n right = j - 1\n while left < right:\n candidate = (nums[i], nums[left], nums[right], nums[j])\n candidate_sum = sum(candidate)\n if candidate_sum == target:\n result.add(candidate)\n left += 1\n elif candidate_sum < target:\n left += 1\n else:\n right -= 1\n\n\n return list(result)\n","runtime":"1013"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n # #brute force solution:\n # ans_set = set()\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 # for l in range(k+1, len(nums)):\n # sum = nums[i] + nums[j]\n # sum += nums[k]\n # sum += nums[l]\n # if (sum == target):\n # temp = [nums[i], nums[j], nums[k], nums[l] ]\n # temp.sort()\n # ans_set.add(tuple(temp))\n\n # ans = [list(x) for x in ans_set]\n # return ans\n\n #better solution:\n ans_set = set()\n for i in range(len(nums)):\n for j in range(i+1, len(nums)):\n st = set()\n for k in range(j+1, len(nums)):\n sum = nums[i] + nums[j] + nums[k]\n fourth = target - sum\n if fourth in st:\n temp = [nums[i], nums[j], nums[k], fourth]\n temp.sort()\n ans_set.add(tuple(temp))\n \n st.add(nums[k])\n\n ans = [list(x) for x in ans_set]\n return ans","runtime":"1013"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n ans = set()\n n = len(nums)\n\n for i in range(n):\n for j in range(i + 1, n):\n hashm = set()\n for k in range(j + 1, n):\n fourth = target - (nums[i] + nums[j] + nums[k])\n\n if fourth in hashm:\n temp = [nums[i], nums[j], nums[k], fourth]\n temp.sort()\n ans.add(tuple(temp))\n \n hashm.add(nums[k])\n \n ans = list(ans)\n return ans","runtime":"1026"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n=len(nums)\n st = set()\n\n # checking all possible quadruplets:\n for i in range(n):\n for j in range(i+1, n):\n hashset = set()\n for k in range(j+1, n):\n # taking bigger data type to avoid integer overflow:\n sum_ = nums[i] + nums[j] + nums[k]\n fourth = target - sum_\n if fourth in hashset:\n temp = [nums[i], nums[j], nums[k], fourth]\n temp.sort()\n st.add(tuple(temp))\n # put the kth element into the hashset:\n hashset.add(nums[k])\n\n ans = [list(t) for t in st]\n return ans\n ","runtime":"1026"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n set1=set()\n if len(nums)<4:\n return []\n last=nums[-1]\n n=len(nums)\n if last==nums[0]:\n if last*4==target:\n return [[last,last,last,last]]\n for id1 in range(n-3):\n if nums[id1]*4>target:\n break\n if nums[id1]+3*last<target:\n continue\n for id2 in range(id1+1,n-2):\n if nums[id1]+nums[id2]*3>target:\n break\n if nums[id1]+nums[id2]+2*last<target:\n continue\n for id3 in range(id2+1,n-1):\n if nums[id1]+nums[id2]+nums[id3]*2>target:\n break\n if nums[id1]+nums[id2]+nums[id3]+last<target:\n continue\n for id4 in range(id3+1,n):\n if nums[id1]+nums[id2]+nums[id3]+nums[id4]>target:\n break\n if nums[id1]+nums[id2]+nums[id3]+nums[id4]<target:\n continue\n set1.add((nums[id1],nums[id2],nums[id3],nums[id4]))\n return set1\n ","runtime":"1040"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n=len(nums)\n se=set()\n for i in range(n):\n for j in range(i+1,n):\n d=set()\n for k in range(j+1,n):\n s=nums[i]+nums[j]+nums[k]\n l=target-s\n if l in d:\n temp=[nums[i],nums[j],nums[k],l]\n temp.sort()\n se.add(tuple(temp))\n d.add(nums[k])\n res=[]\n for i in se:\n a=list(i)\n res.append(a)\n return res","runtime":"1040"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n if len(nums) < 4:\n return []\n nums = sorted(nums)\n res = set()\n for p1 in range(len(nums) - 3):\n for p2 in range(p1+1, len(nums) - 2):\n p4 = len(nums) - 1\n p3 = p4 - 1\n max_sum = sum([nums[x] for x in [p1, p2, p3, p4]])\n p3 = p2 + 1\n p4 = p3 + 1\n min_sum = sum([nums[x] for x in [p1, p2, p3, p4]])\n if min_sum <= target and max_sum >= target:\n p3 = p2 + 1\n p4 = len(nums) - 1\n while p3 < p4:\n candidate = tuple(nums[x] for x in [p1, p2, p3, p4])\n if candidate not in res:\n cand_sum = sum(candidate)\n if cand_sum == target:\n res.add(candidate)\n if cand_sum > target:\n p4 -= 1\n else:\n p3 += 1\n return res","runtime":"1080"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n \n n=len(nums)\n st=set()\n ans=[]\n for i in range(n):\n for j in range(i+1,n):\n hashset=set()\n for k in range(j+1,n):\n summ=nums[i]+nums[j]\n summ+=nums[k]\n fourth=target-summ\n \n if fourth in hashset:\n temp=[nums[i],nums[j],nums[k],fourth]\n temp.sort()\n st.add(tuple(temp))\n hashset.add(nums[k])\n ans=[list(ans) for ans in st]\n return ans","runtime":"1080"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n a=[]\n nums.sort()\n for i in range(len(nums)-3):\n for j in range(i+1,len(nums)-2):\n l=j+1\n r=len(nums)-1\n while(l<r):\n if(nums[i]+nums[j]+nums[l]+nums[r]==target):\n if [nums[i],nums[j],nums[l],nums[r]] not in a:\n a.append([nums[i],nums[j],nums[l],nums[r]])\n l+=1\n elif(nums[i]+nums[j]+nums[l]+nums[r]<target):\n l+=1\n elif(nums[i]+nums[j]+nums[l]+nums[r]>target):\n r-=1\n return a\n","runtime":"1093"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n = len(nums)\n ans = set()\n for i in range(0, n):\n for j in range(i+1,n):\n set1 = set()\n for k in range(j+1,n):\n forth = target-(nums[i]+nums[j]+nums[k])\n if forth in set1:\n ans.add(tuple(sorted([nums[i], nums[j], nums[k], forth])))\n set1.add(nums[k])\n return list(ans)","runtime":"1093"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n quads = set()\n n = len(nums)\n for i in range(n):\n for j in range(i+1, n):\n b = set()\n for k in range(j+1, n):\n diff = target - (nums[i] + nums[j] + nums[k])\n if diff in b:\n current = [nums[i], nums[j], nums[k], diff]\n dummy = sorted(current)\n quads.add(tuple(dummy))\n b.add(nums[k])\n return quads \n \n","runtime":"1107"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n = len(nums)\n ans = set()\n for i in range(n):\n for j in range(i+1,n):\n fourths = {}\n for k in range(j+1,n):\n total = nums[i]+nums[j]+nums[k]\n if target-total in fourths:\n temp = [nums[i],nums[j],nums[k],target-total]\n temp.sort()\n ans.add(tuple(temp))\n fourths[nums[k]]=k\n return ans","runtime":"1107"}],"string":"[\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n res = []\\n n = len(nums)\\n if n < 4:\\n return res\\n nums.sort()\\n \\n for i in range(n - 3):\\n # Skip duplicate elements for the first number\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n # Early termination if the smallest possible sum is greater than target\\n if nums[i] + nums[i + 1] + nums[i + 2] + nums[i + 3] > target:\\n break\\n # Early termination if the largest possible sum with nums[i] is smaller than target\\n if nums[i] + nums[n - 3] + nums[n - 2] + nums[n - 1] < target:\\n continue\\n \\n for j in range(i + 1, n - 2):\\n # Skip duplicate elements for the second number\\n if j > i + 1 and nums[j] == nums[j - 1]:\\n continue\\n # Early termination similar to above\\n if nums[i] + nums[j] + nums[j + 1] + nums[j + 2] > target:\\n break\\n if nums[i] + nums[j] + nums[n - 2] + nums[n - 1] < target:\\n continue\\n \\n # Calculate the remaining target for the two-pointer search\\n remain = target - nums[i] - nums[j]\\n left, right = j + 1, n - 1\\n \\n while left < right:\\n current_sum = nums[left] + nums[right]\\n if current_sum < remain:\\n left += 1\\n elif current_sum > remain:\\n right -= 1\\n else:\\n res.append([nums[i], nums[j], nums[left], nums[right]])\\n \\n # Skip duplicates for the third number\\n while left < right and nums[left] == nums[left + 1]:\\n left += 1\\n # Skip duplicates for the fourth number\\n while left < right and nums[right] == nums[right - 1]:\\n right -= 1\\n left += 1\\n right -= 1\\n \\n return res\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n \\n def findNsum(l, r, target, N, result, results):\\n if r-l+1 < N or N < 2 or target < nums[l]*N or target > nums[r]*N:\\n return\\n if N == 2:\\n while l < r:\\n s = nums[l] + nums[r]\\n if s == target:\\n results.append(result + [nums[l], nums[r]])\\n\\n while l < r and nums[l] == nums[l+1]:\\n l += 1\\n l += 1\\n \\n elif s < target:\\n l += 1\\n else:\\n r -=1\\n else:\\n for i in range(l, r+1):\\n if i == l or (r>l and nums[i-1] != nums[i]):\\n findNsum(i+1, r, target-nums[i], N-1, result+[nums[i]], results)\\n\\n nums.sort()\\n results = []\\n findNsum(0, len(nums)-1, target, 4, [], results)\\n return results\\n\\n\\n \",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums = sorted(nums)\\n results = []\\n self.helper(nums, target, 4, [], results)\\n return results\\n\\n def helper(self, nums: List[int], target: int, N: int, res: List[int], results: List[List[int]]):\\n if len(nums) < N or N < 2:\\n return\\n if N == 2:\\n output = self.twoSum(nums, target)\\n if output:\\n for item in output:\\n results.append(res + item)\\n else:\\n for i in range(len(nums) - N + 1):\\n if nums[i] * N > target or nums[-1] * N < target:\\n break\\n if i == 0 or (i > 0 and nums[i - 1] != nums[i]):\\n self.helper(nums[i + 1:], target - nums[i], N - 1, res + [nums[i]], results)\\n\\n def twoSum(self, nums: List[int], target: int) -> List[int]:\\n res = []\\n left, right = 0, len(nums) - 1\\n while left < right:\\n temp_sum = nums[left] + nums[right]\\n if temp_sum == target:\\n res.append([nums[left], nums[right]])\\n left += 1\\n right -= 1\\n while left < right and nums[left] == nums[left - 1]:\\n left += 1\\n while left < right and nums[right] == nums[right + 1]:\\n right -= 1\\n elif temp_sum < target:\\n left += 1\\n else:\\n right -= 1\\n return res\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n\\n def kSum(nums, target,k):\\n\\n res = []\\n\\n if not nums:\\n return res\\n \\n avg_value = target // k\\n\\n if (nums[0] > avg_value) or (nums[-1]< avg_value):\\n return res\\n \\n if k == 2:\\n return TwoSum(nums,target)\\n \\n for i in range(len(nums)):\\n if (i==0) or (nums[i]!=nums[i-1]):\\n for subset in kSum(nums[i+1:],target-nums[i],k-1):\\n res.append([nums[i]]+subset)\\n \\n return res\\n\\n def TwoSum(nums,target):\\n\\n lo = 0\\n hi = len(nums)-1\\n N = len(nums)\\n\\n res = []\\n\\n while lo<hi:\\n\\n if ((nums[lo]+nums[hi] )<target) or ((lo>0) and (nums[lo]==nums[lo-1])):\\n lo+=1\\n elif ((nums[lo]+nums[hi] )>target) or ((hi<N-1) and (nums[hi]==nums[hi+1])):\\n hi-=1\\n else:\\n if (nums[lo]+nums[hi] )==target:\\n res.append([nums[lo],nums[hi]])\\n lo+=1\\n hi-=1\\n \\n\\n \\n return res\\n\\n nums.sort()\\n\\n return kSum(nums,target,4)\\n\\n\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: list[int], target: int):\\n ans = []\\n\\n def nSum(\\n l: int, r: int, target: int, n: int, path: list[int],\\n ans: list[list[int]]) -> None:\\n \\\"\\\"\\\"Finds n numbers that add up to the target in [l, r].\\\"\\\"\\\"\\n if r - l + 1 < n or n < 2 or target < nums[l] * n or target > nums[r] * n:\\n return\\n if n == 2:\\n while l < r:\\n summ = nums[l] + nums[r]\\n if summ == target:\\n ans.append(path + [nums[l], nums[r]])\\n l += 1\\n while nums[l] == nums[l - 1] and l < r:\\n l += 1\\n elif summ < target:\\n l += 1\\n else:\\n r -= 1\\n return\\n\\n for i in range(l, r + 1):\\n if i > l and nums[i] == nums[i - 1]:\\n continue\\n\\n nSum(i + 1, r, target - nums[i], n - 1, path + [nums[i]], ans)\\n\\n nums.sort()\\n nSum(0, len(nums) - 1, target, 4, [], ans)\\n return ans\",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n\\n def kSum(nums, k, target):\\n sol = []\\n \\n avg = target // k\\n\\n if not nums or nums[0] > avg or nums[-1] < avg:\\n return []\\n \\n if k == 2:\\n return twoSum(nums, target)\\n\\n for i in range(len(nums)):\\n if i == 0 or nums[i] != nums[i-1]:\\n for subset in kSum(nums[i+1:], k-1, target - nums[i]):\\n sol.append([nums[i]] + subset) \\n return sol\\n \\n def twoSum(nums, target):\\n sol = []\\n left, right = 0, len(nums)-1\\n while left < right:\\n sum = nums[left] + nums[right]\\n if (right+1 < len(nums) and nums[right] == nums[right+1]) or sum > target:\\n right -= 1\\n elif (left-1 >= 0 and nums[left] == nums[left-1]) or sum < target:\\n left += 1\\n else:\\n sol.append([nums[left],nums[right]])\\n left += 1\\n right -= 1\\n return sol\\n\\n nums.sort() \\n return kSum(nums, 4, target)\",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"class Solution:\\n def kSum(self, nums: List[int], target: int, k: int) -> List[List[int]]:\\n def kSumHelper(start: int, target: int, k: int) -> List[List[int]]:\\n if k == 2:\\n return twoSum(start, target)\\n \\n result = []\\n \\n avg_value = target // k\\n if nums[start] > avg_value or avg_value > nums[-1]:\\n return result\\n \\n for i in range(start, len(nums) - k + 1):\\n if i > start and nums[i] == nums[i-1]:\\n continue\\n for subset in kSumHelper(i + 1, target - nums[i], k - 1):\\n result.append([nums[i]] + subset)\\n return result\\n\\n def twoSum(start: int, target: int) -> List[List[int]]:\\n left, right = start, len(nums) - 1\\n result = []\\n while left < right:\\n current_sum = nums[left] + nums[right]\\n if current_sum == target:\\n result.append([nums[left], nums[right]])\\n while left < right and nums[left] == nums[left + 1]:\\n left += 1\\n while left < right and nums[right] == nums[right - 1]:\\n right -= 1\\n left += 1\\n right -= 1\\n elif current_sum < target:\\n left += 1\\n else:\\n right -= 1\\n return result\\n\\n nums.sort()\\n return kSumHelper(0, target, k)\\n\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n return self.kSum(nums, target, 4)\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n return self.kSum(nums, target, k=4)\\n \\n def kSum(self, nums, target, k):\\n res = []\\n if not nums:\\n return res\\n \\n avg_val = target // k\\n if max(nums) < avg_val or min(nums) > avg_val:\\n return res\\n \\n if k == 2:\\n return self.twoSum(nums, target)\\n \\n for i in range(len(nums)):\\n if i == 0 or nums[i] > nums[i - 1]:\\n for subset in self.kSum(nums[i+1:], target - nums[i], k - 1):\\n res.append([nums[i]] + subset)\\n return res\\n \\n def twoSum(self, nums, target):\\n res = []\\n l, r = 0, len(nums) - 1\\n while l < r:\\n cur_sum = nums[l] + nums[r]\\n if cur_sum < target:\\n l += 1\\n elif cur_sum > target:\\n r -= 1\\n else:\\n res.append([nums[l], nums[r]])\\n l += 1\\n while l < len(nums) and nums[l] == nums[l - 1]:\\n l += 1\\n return res\\n\\n \\n\\n \\n \",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums = sorted(nums)\\n print(nums)\\n import collections\\n indexes_by_sum = collections.defaultdict(list)\\n \\n result = set()\\n for idx_a, num_a in enumerate(nums):\\n for idx_b, num_b in enumerate(nums[idx_a+1:]):\\n idx_b += idx_a + 1\\n ab_sum = num_a + num_b \\n indexes_by_sum[ab_sum].append((idx_a, idx_b))\\n \\n for pair_sum, pairs in indexes_by_sum.items():\\n diff = target - pair_sum\\n if diff in indexes_by_sum:\\n pair_cache = set()\\n for pair in pairs:\\n pair_nums = (\\n nums[pair[0]],\\n nums[pair[1]],\\n )\\n if pair_nums in pair_cache:\\n continue\\n pair_cache.add(pair_nums)\\n next_pair_cache = set()\\n for next_pair in indexes_by_sum[diff]:\\n next_pair_nums = (\\n nums[next_pair[0]],\\n nums[next_pair[1]],\\n ) \\n if next_pair_nums in next_pair_cache:\\n continue\\n if next_pair[0] > pair[1]:\\n next_pair_cache.add(next_pair_nums)\\n result.add((\\n nums[pair[0]],\\n nums[pair[1]],\\n nums[next_pair[0]],\\n nums[next_pair[1]],\\n ))\\n\\n return list(result)\\n\\n\\n \\n\",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n sorted_nums = sorted(nums) \\n count = 0\\n nums = []\\n for i, n in enumerate(sorted_nums):\\n if i and n == sorted_nums[i-1]:\\n count += 1\\n else:\\n count = 1\\n \\n if count <= 4:\\n nums.append(n)\\n \\n twoSum = defaultdict(list)\\n for i in range(len(nums)-1):\\n for j in range(i+1, len(nums)):\\n twoSum[nums[i] + nums[j]].append((i, j))\\n \\n result = set() \\n for i in range(len(nums)-3):\\n for j in range(i + 1, len(nums)-2):\\n sum2 = nums[i] + nums[j]\\n if target - sum2 in twoSum:\\n for ii, jj in twoSum[target - sum2]:\\n if j < ii:\\n result.add((nums[i], nums[j], nums[ii], nums[jj]))\\n \\n return result \\n \",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n if len(nums) < 4:\\n return []\\n\\n frequency_map = {}\\n sum_map = {}\\n results = set()\\n\\n for num in nums:\\n if num not in frequency_map:\\n frequency_map[num] = 0\\n \\n frequency_map[num] += 1\\n \\n for i in range(len(nums)):\\n for j in range(i+1, len(nums)): \\n curr_sum = nums[i] + nums[j] \\n if curr_sum not in sum_map:\\n sum_map[curr_sum] = set()\\n \\n sum_map[curr_sum].add((nums[i], nums[j]))\\n \\n for sum in sum_map:\\n diff = target - sum\\n if diff in sum_map:\\n l_list = sum_map[sum]\\n r_list = sum_map[diff]\\n\\n for l_tuple in l_list:\\n for r_tuple in r_list:\\n candidate = tuple(sorted(l_tuple + r_tuple))\\n candidate_frequency_map = {}\\n for num in candidate:\\n if num not in candidate_frequency_map:\\n candidate_frequency_map[num] = 0\\n \\n candidate_frequency_map[num] += 1\\n \\n to_add = True\\n for num, freq in candidate_frequency_map.items():\\n if freq > frequency_map[num]:\\n to_add = False\\n break\\n\\n if to_add:\\n results.add(candidate)\\n\\n return results\\n\\n\",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n num_counter = Counter(nums)\\n new_nums = []\\n for num, count in num_counter.items():\\n new_nums.extend([num for _ in range(min(count, 4))])\\n\\n nums = copy.deepcopy(new_nums)\\n hash_map = {}\\n values = []\\n for i, num_1 in enumerate(nums):\\n for j, num_2 in enumerate(nums[i + 1:]):\\n sum_v = (num_1 + num_2)\\n neg_sum = target - sum_v\\n\\n\\n if neg_sum in hash_map:\\n for p, q in hash_map[neg_sum]:\\n if p != i and p != (i + j + 1) and q != i and q != (i + j + 1):\\n sub_set = [num_1, num_2, nums[p], nums[q]]\\n sub_set.sort()\\n if sub_set not in values:\\n values.append(sub_set)\\n\\n \\n if sum_v not in hash_map:\\n hash_map[sum_v] = []\\n hash_map[sum_v].append((i, j + i + 1))\\n return values\",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n cntr, res, twos = Counter(nums), set(), defaultdict(set)\\n for num1, num2 in combinations(nums, 2):\\n twos[num1 + num2].add(tuple(sorted((num1, num2))))\\n for num in sorted(twos):\\n if num*2 > target: break\\n comp = target - num\\n if comp not in twos: continue\\n for (a,b), (c,d) in product(twos[num], twos[comp]):\\n if all(cnt <= cntr[val] for val, cnt in Counter((a,b,c,d)).items()):\\n res.add(tuple(sorted((a,b,c,d))))\\n return res\",\n \"runtime\": \"129\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n minPos = collections.defaultdict(list)\\n results = set()\\n for i in range(len(nums) - 1):\\n for j in range(i + 1, len(nums)):\\n t = nums[i] + nums[j]\\n if target - t in minPos:\\n for a, b, e in reversed(minPos[target - t]):\\n if b >= i:\\n break\\n for c in range(b, min(e + 1, i)):\\n results.add((nums[a], nums[c], nums[i], nums[j]))\\n v = minPos[t]\\n if not v or nums[v[-1][0]] != nums[i]:\\n if not v or v[-1][0] != i:\\n v.append([i, j, j])\\n else:\\n v[-1][-1] = j\\n return results\",\n \"runtime\": \"129\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res = []\\n \\n def twoSum(nums, target, curComb):\\n L, R = bisect_left(nums, target - nums[-1]), bisect_right(nums, target - nums[0])-1\\n\\n while L < R:\\n left, right = nums[L], nums[R]\\n if left + right == target:\\n res.append(curComb + [left, right])\\n L += 1\\n while L < R and nums[L-1] == nums[L]:\\n L += 1\\n R-=1\\n while R > L and nums[R+1] == nums[R]:\\n R -= 1\\n R = bisect_right(nums, target - nums[L])-1\\n elif left + right < target:\\n L += 1\\n while L < R and nums[L-1] == nums[L]:\\n L += 1\\n R = bisect_right(nums, target - nums[L])-1\\n L = bisect_left(nums, target - nums[R])\\n elif left + right > target:\\n R -= 1\\n while R < L and nums[R+1] == nums[R]:\\n R -= 1\\n L = bisect_left(nums, target - nums[R])\\n R = bisect_right(nums, target - nums[L]) - 1\\n \\n def nSum(nums, target, k, curComb):\\n for i, n in enumerate(nums[:-k+1]):\\n if i > 0 and n == nums[i-1]:\\n continue\\n curComb += [n]\\n if k > 3:\\n nSum(nums[i+1:], target-n, k-1, curComb)\\n else:\\n twoSum(nums[i+1:], target-n, curComb)\\n if curComb:\\n curComb.pop()\\n \\n return res\\n \\n nSum(nums, target, 4, [])\\n\\n return res\",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n n = len(nums)\\n ans = set()\\n\\n for a in range(n-3):\\n if a > 0 and nums[a] == nums[a-1]:\\n continue\\n for b in range(a+1, n-2):\\n c, d = b+1, n-1\\n #这个条件很微妙，加入了一个500ms -> 150ms\\n if nums[a] > target//4 or nums[d] < target//4:\\n continue\\n while c < d:\\n cursum = nums[a] + nums[b] + nums[c] + nums[d]\\n if cursum == target:\\n ans.add(tuple([nums[a], nums[b], nums[c], nums[d]]))\\n c += 1\\n if cursum < target:\\n c += 1\\n if cursum > target:\\n d -= 1\\n\\n return list(ans)\\n\\n\",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def twoSum(self, nums, target):\\n output = []\\n left, right = 0, len(nums)-1\\n while left < right:\\n double_sum = nums[left] + nums[right]\\n if double_sum < target: left += 1 \\n elif double_sum > target: right -= 1\\n else :\\n output.append([nums[left], nums[right]])\\n left += 1\\n right -= 1\\n while left < right and nums[left] == nums[left-1]: left += 1\\n while left < right and nums[right] == nums[right+1]: right -= 1\\n return output\\n\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n if len(nums) < 4: return []\\n\\n nums.sort()\\n minimum, maximum = sum(nums[:4]), sum(nums[-4:])\\n if maximum <= target: return [] if maximum < target else [nums[-4:]]\\n if minimum >= target: return [] if minimum > target else [nums[:4]]\\n\\n output = []\\n for i in range(len(nums)-3):\\n if i > 0 and nums[i] == nums[i-1]: continue\\n for j in range(i+1, len(nums)-2):\\n if j > i+1 and nums[j] == nums[j-1]: continue\\n \\n for res in self.twoSum(nums[j+1:], target-(nums[i]+nums[j])):\\n output.append([nums[i], nums[j], res[0], res[1]])\\n\\n return output\",\n \"runtime\": \"155\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n #O(N*N*N*N)\\n reducedNums = []\\n for n, count in Counter(nums).items():\\n reducedNums.extend( [n]*min(4, count))\\n \\n twoSumIndexes = collections.defaultdict( list)\\n for i, a in enumerate( reducedNums):\\n for j in range(i+1, len(reducedNums)):\\n b = reducedNums[j]\\n twoSumIndexes[a+b].append( (i,j,))\\n \\n #print(reducedNums); print(twoSumIndexes);\\n result = set()\\n for ab in list(twoSumIndexes.keys()): \\n for i, j in twoSumIndexes[ab]:\\n a = reducedNums[i]\\n b = reducedNums[j]\\n cd = target - ab\\n twoSumStart = bisect.bisect_left( twoSumIndexes[cd], (j+1, 0))\\n for twoSumI in range(twoSumStart, len(twoSumIndexes[cd])):\\n k, l = twoSumIndexes[cd][twoSumI]\\n c = reducedNums[k]\\n d = reducedNums[l]\\n #print(i,j,k,l,)\\n result.add( tuple(sorted([a,b,c,d])))\\n del twoSumIndexes, reducedNums\\n return result\",\n \"runtime\": \"155\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n = len(nums)\\n ans = set()\\n seen = defaultdict(set)\\n for i in range(n):\\n for j in range(i + 1, n):\\n for x, y in seen[target - (nums[i] + nums[j])]:\\n ans.add(tuple(sorted((x, y, nums[i], nums[j]))))\\n for j in range(i):\\n x, y = sorted((nums[j], nums[i]))\\n seen[x + y].add((x, y))\\n return list(set(map(tuple, map(sorted, ans))))\\n\",\n \"runtime\": \"169\"\n },\n {\n \"code\": \"from collections import defaultdict\\nfrom math import ceil\\n\\nclass Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n \\n # previous method took too long\\n # try using two pointers on the keys after sorting keys\\n\\n if len(nums) < 4:\\n return []\\n\\n length = len(nums)\\n add_dict = defaultdict(list)\\n\\n for i in range(length):\\n for j in range(i+1, length):\\n # print(i,j)\\n add_dict[nums[i]+nums[j]].append([i,j])\\n\\n # print(add_dict)\\n keys = sorted(add_dict.keys())\\n\\n all_quadruplets = []\\n already_added_tuples = set()\\n\\n # assign lists\\n l, r = 0, len(keys)-1\\n list1 = add_dict[keys[l]]\\n list2 = add_dict[keys[r]]\\n\\n\\n # print(list1,list2)\\n\\n while l <= r:\\n list1 = add_dict[keys[l]]\\n list2 = add_dict[keys[r]]\\n if keys[l] + keys[r] == target:\\n # print(f'found key {keys[l]}:{list1} {keys[r]}:{list2}')\\n for i in range(len(list1)):\\n\\n curr_tuple = nums[list1[i][0]],nums[list1[i][1]] \\n prev_tuple = nums[list1[i-1][0]],nums[list1[i-1][1]]\\n \\n if i>0 and (curr_tuple == prev_tuple):\\n print(f'skipping {curr_tuple}, identical to prev_tuple {prev_tuple}')\\n continue\\n for j in range(len(list2)):\\n # check if there are repeated indices\\n total_list = list1[i] + list2[j]\\n # print(f'total list {total_list}')\\n quadruplets = []\\n for k in range(4):\\n quadruplets.append(nums[total_list[k]])\\n sorted_quadruplets_tuple = tuple(sorted(quadruplets))\\n\\n if sorted_quadruplets_tuple not in already_added_tuples and len(set(total_list))==4:\\n already_added_tuples.add(sorted_quadruplets_tuple)\\n all_quadruplets.append(quadruplets)\\n print(f'adding {quadruplets}')\\n\\n l += 1\\n r -= 1\\n\\n\\n elif (keys[l] + keys[r] < target):\\n l += 1\\n\\n else:\\n r -= 1\\n\\n return all_quadruplets\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # 287/294 cases, Time Limit Exceeded\\n # # for every pair use their total as key and the two indices as values\\n # length = len(nums)\\n # add_dict = defaultdict(list)\\n\\n # for i in range(length):\\n # for j in range(i+1, length):\\n # add_dict[nums[i]+nums[j]].append([i,j])\\n\\n # keys = list(add_dict.keys())\\n # # print(keys)\\n\\n # all_quadruplets = []\\n # already_added_tuples = set()\\n # # print(add_dict)\\n\\n # # half_keys = ceil(len(keys)/2)\\n\\n # for i in range(len(keys)):\\n # key = keys[i]\\n # complement_key = target-key\\n # # print('keys',key, complement_key)\\n\\n # if (complement_key in keys):\\n # # print('keys',key, complement_key)\\n # list1 = add_dict[key]\\n # list2 = add_dict[complement_key]\\n # for j in range(len(list1)):\\n # for k in range(len(list2)):\\n # # check if there are repeated indices\\n # total_list = list1[j] + list2[k]\\n # if len(set(total_list))==4:\\n # # print('total_list',total_list)\\n # quadruplets = []\\n # for l in range(4):\\n # quadruplets.append(nums[total_list[l]])\\n # sorted_quadruplets = tuple(sorted(quadruplets))\\n # if sorted_quadruplets not in already_added_tuples:\\n # already_added_tuples.add(sorted_quadruplets)\\n # all_quadruplets.append(quadruplets)\\n\\n # return all_quadruplets\\n\\n\\n\\n \",\n \"runtime\": \"169\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n def kSum(nums, target, k):\\n res = []\\n if len(nums) < k:\\n return res\\n if nums[-1] < target / k:\\n return res\\n if nums[0] > target / k:\\n return res\\n \\n if k == 2:\\n return twoSum(nums, target)\\n\\n for i, n in enumerate(nums): \\n if i == 0 or nums[i] != nums[i-1]:\\n for arr in kSum(nums[i+1:], target - nums[i], k - 1):\\n res.append([nums[i]] + arr)\\n return res\\n \\n def twoSum(nums, target):\\n res = []\\n for i, x in enumerate(nums):\\n if i == 0 or nums[i] != nums[i-1]:\\n if target - x in nums[i+1:]:\\n res.append([x, target - x])\\n return res\\n \\n nums.sort()\\n return kSum(nums, target, 4)\\n \",\n \"runtime\": \"182\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n: int = len(nums)\\n if n <= 3:\\n return []\\n if n == 4:\\n return [nums] if sum(nums) == target else []\\n\\n nums.sort()\\n\\n if target < sum(nums[:4]) or target > sum(nums[-4:]):\\n return []\\n\\n results = []\\n\\n for i in range(n - 3):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n\\n for j in range(i + 1, n - 2):\\n if j > i + 1 and nums[j] == nums[j - 1]:\\n continue\\n\\n left, right = j + 1, n - 1\\n while left < right:\\n s = nums[left] + nums[right] + nums[i] + nums[j]\\n if s > target:\\n right -= 1\\n elif s < target:\\n left += 1\\n else:\\n results.append([nums[left], nums[right], nums[i], nums[j]])\\n\\n while left < right and nums[left] == nums[left + 1]:\\n left += 1\\n while left < right and nums[right] == nums[right - 1]:\\n right -= 1\\n\\n left += 1\\n right -= 1\\n\\n return results\\n\",\n \"runtime\": \"182\"\n },\n {\n \"code\": \"from collections import defaultdict\\nfrom itertools import combinations\\nclass Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n two_sums = defaultdict(list)\\n pair_counts = defaultdict(int)\\n pair_blocklists = defaultdict(set)\\n result = []\\n for i, j in combinations(list(range(len(nums))), 2):\\n pair = (nums[i], nums[j])\\n if pair_counts[pair] > 2: continue\\n if i in pair_blocklists[pair] or j in pair_blocklists[pair]: continue\\n pair_blocklists[pair].add(i)\\n pair_counts[pair] += 1\\n two_sums[sum(pair)].append((i, j))\\n seen = set()\\n seen_nums = set()\\n for ts in two_sums.keys():\\n wanted = target - ts\\n if wanted not in seen and wanted in two_sums:\\n for (a, b) in two_sums[ts]:\\n for (c, d) in two_sums[wanted]:\\n sm = tuple(sorted([nums[a], nums[b], nums[c], nums[d]]))\\n idxs = set([a, b, c, d])\\n if len(idxs) == 4 and sm not in seen_nums:\\n result.append([nums[a], nums[b], nums[c], nums[d]])\\n seen_nums.add(sm)\\n seen.add(ts)\\n seen.add(wanted)\\n return result\",\n \"runtime\": \"222\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n twoSums = defaultdict(int)\\n for i in range(len(nums)-1):\\n for j in range(i+1, len(nums)):\\n twoSums[nums[i] + nums[j]] += 1\\n\\n resDict = {}\\n for i in range(len(nums)-3):\\n for j in range(i+1,len(nums)-2):\\n subTarget = target - nums[i] - nums[j]\\n if subTarget in twoSums:\\n k = j + 1\\n l = len(nums)-1\\n while k < l:\\n if nums[k] + nums[l] > subTarget:\\n l -= 1\\n elif nums[k] + nums[l] < subTarget:\\n k += 1\\n else:\\n if (nums[i], nums[j], nums[k], nums[l]) not in resDict:\\n resDict[(nums[i], nums[j], nums[k], nums[l])] = 1\\n k += 1\\n l -= 1\\n\\n # i and j for outer loops\\n # k and l for inner loops\\n return resDict.keys()\\n\",\n \"runtime\": \"222\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n pairs,Quad = defaultdict(list),set()\\n n = len(nums)\\n\\n for i in range(n-1):\\n for j in range(i+1,n):\\n if j>i+1 and nums[j] == nums[j-1]:\\n continue\\n p = target - nums[i] - nums[j]\\n for ele in pairs[p]:\\n Quad.add((ele[0],ele[1],nums[j],nums[i]))\\n for j in range(i):\\n pairs[nums[i]+nums[j]].append([nums[i],nums[j]])\\n\\n return Quad \\n \\n '''\\n length=len(nums)\\n if length<4:\\n return []\\n endIdx=length-1\\n nums.sort()\\n result=set()\\n \\n for i in range(length-3):\\n if i>0 and nums[i]==nums[i-1]:\\n continue\\n for j in range(i+1,length-2):\\n if j>i+1 and nums[j]==nums[j-1]:\\n continue\\n l,r=j+1,endIdx\\n sums=nums[i]+nums[j]\\n while l<r:\\n currSum=sums+nums[l]+nums[r]\\n if currSum>target:\\n r-=1\\n elif currSum<target:\\n l+=1\\n else:\\n result.add((nums[i],nums[j],nums[l],nums[r]))\\n l+=1\\n return result\\n '''\\n \",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class Solution:\\n\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n = len(nums)\\n nums.sort()\\n res = []\\n for i in range(n - 3):\\n if nums[i] * 4 > target:\\n return res\\n if i - 1 >= 0 and nums[i] == nums[i - 1]:\\n continue\\n for j in range(i + 1, n - 2):\\n if nums[i] + 3 * nums[j] > target:\\n break\\n if j - 1 > i and nums[j] == nums[j - 1]:\\n continue\\n k = j + 1\\n if nums[i] + nums[j] + 2 * nums[k] > target:\\n continue\\n l = n - 1\\n while k < l:\\n if nums[i] + nums[j] + nums[k] + nums[l] < target:\\n k += 1\\n elif nums[i] + nums[j] + nums[k] + nums[l] > target:\\n l -= 1\\n else:\\n if k - 1 > j and nums[k] == nums[k - 1]:\\n k += 1\\n l -= 1\\n continue\\n res.append([nums[i], nums[j], nums[k], nums[l]])\\n k += 1\\n l -= 1\\n return res\",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n if not nums or len(nums) < 4:\\n return []\\n nums.sort()\\n n = len(nums)\\n res = []\\n\\n for i in range(n-3):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n res_1 = target - nums[i]\\n for j in range(i+1, n-2):\\n if j-1 != i and nums[j] == nums[j-1]:\\n continue\\n if nums[j] >= 0 and nums[j] > res_1:\\n break\\n res_2 = res_1 - nums[j]\\n k, l = j+1, n-1\\n while k < l:\\n cur = nums[k] + nums[l]\\n if cur == res_2:\\n res.append([nums[i], nums[j], nums[k], nums[l]])\\n while k+1 < l-1 and nums[k] == nums[k+1]:\\n k += 1\\n while k+1 < l-1 and nums[l] == nums[l-1]:\\n l -= 1\\n k += 1\\n l -= 1\\n elif cur < res_2:\\n k += 1\\n else:\\n l -= 1\\n return res\\n\\n \",\n \"runtime\": \"249\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n res = []\\n\\n nums.sort()\\n\\n for i in range(len(nums) - 3):\\n if i > 0 and (nums[i] == nums[i-1]):\\n continue\\n \\n if nums[i] * 4 > target:\\n break\\n\\n for j in range(i+1, len(nums) - 2):\\n if nums[i] + nums[j] * 3 > target:\\n break\\n\\n if j > i+1 and nums[j] == nums[j-1]:\\n continue\\n\\n k, l = j + 1, len(nums) -1\\n\\n while(k < l):\\n sum4 = nums[i] + nums[j] + nums[k] + nums[l]\\n\\n if sum4 == target:\\n res.append([nums[i], nums[j], nums[k], nums[l]])\\n\\n while (k < l and nums[k] == nums[k + 1]):\\n k += 1\\n \\n while (k < l and nums[l] == nums[l - 1]):\\n l -= 1\\n \\n k += 1\\n l -= 1\\n elif sum4 > target:\\n l -= 1\\n else:\\n k += 1\\n\\n\\n return res\\n \",\n \"runtime\": \"249\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, n: List[int], t: int) -> List[List[int]]:\\n if not n: return []\\n n.sort()\\n L, N, S, M = len(n), {j:i for i,j in enumerate(n)}, set(), n[-1]\\n for i in range(L-3):\\n a = n[i]\\n if a + 3*M < t: continue\\n if 4*a > t: break\\n for j in range(i+1,L-2):\\n b = n[j]\\n if a + b + 2*M < t: continue\\n if a + 3*b > t: break\\n for k in range(j+1,L-1):\\n c = n[k]\\n d = t-(a+b+c)\\n if d > M: continue\\n if d < c: break\\n if d in N and N[d] > k: S.add((a,b,c,d))\\n return S\",\n \"runtime\": \"263\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target) -> List[List[int]]:\\n if len(nums) < 4:\\n return []\\n nums.sort()\\n output = []\\n\\n i, j, k, l = (0, 1, 2, 3)\\n n = len(nums)\\n limit = target - nums[i] - nums[j] - nums[k]\\n while l < n and nums[l] <= limit:\\n l += 1\\n \\n while i < l - 3:\\n if nums[i] > target and nums[i] > 0:\\n break\\n limit = target - nums[i]\\n j = i + 1\\n \\n while j < l - 2:\\n if nums[j] > limit and nums[j] > 0:\\n break\\n \\n kk = j + 1\\n ll = l - 1\\n\\n while kk < ll:\\n if (total := nums[i] + nums[j] + nums[kk] + nums[ll]) > target:\\n ll -= 1\\n elif total < target:\\n kk += 1\\n else:\\n output.append([nums[i], nums[j], nums[kk], nums[ll]])\\n kk += 1\\n ll -= 1\\n while nums[kk] == nums[kk - 1] and kk < ll:\\n kk += 1\\n \\n j += 1\\n while j < l - 2 and nums[j] == nums[j - 1]:\\n j += 1\\n\\n i += 1\\n while i < l - 3 and nums[i] == nums[i - 1]:\\n i += 1\\n\\n return output\",\n \"runtime\": \"263\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n arr=sorted(nums)\\n n=len(arr)\\n res=[]\\n visita=set()\\n for a in range(0,n-3):\\n if 4*arr[a]>target:\\n #print(arr[a])\\n return res\\n if arr[a] in visita:\\n #print(visita)\\n continue\\n visitb=set() \\n #print(a,n-3) \\n for b in range(a+1,n-2):\\n # if (arr[a]+3*arr[b])>target:\\n # return res\\n if arr[b] in visitb:\\n continue\\n total=target-arr[a]-arr[b]\\n l=b+1\\n r=n-1\\n while l<r and l>b and r<n:\\n if arr[l]+arr[r]==total:\\n res.append([arr[a],arr[b],arr[l],arr[r]])\\n #print(res,a,b,l,r)\\n while l<r and arr[l]==arr[l+1]:\\n l+=1\\n l+=1\\n elif arr[l]+arr[r]<total:\\n l+=1\\n else:\\n r-=1\\n #print(a,b,l,r)\\n visitb.add(arr[b])\\n visita.add(arr[a])\\n return res\",\n \"runtime\": \"276\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n output = set()\\n\\n for i in range(len(nums)):\\n if 4 * nums[i] > target:\\n break\\n \\n for j in range(i + 1, len(nums)):\\n l = j + 1\\n r = len(nums) - 1\\n\\n if 4 * nums[r] < target:\\n break\\n while l < r:\\n curr_sum = nums[i] + nums[j] + nums[l] + nums[r]\\n if curr_sum == target:\\n output.add((nums[i], nums[j], nums[l], nums[r]))\\n l += 1\\n r -= 1\\n elif curr_sum > target:\\n r -= 1\\n else:\\n l += 1\\n\\n return output\\n\",\n \"runtime\": \"276\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n if len(nums) < 4:\\n return []\\n\\n nums.sort()\\n if sum(nums[:4]) > target:\\n return []\\n if sum(nums[-4:]) < target:\\n return []\\n \\n n = len(nums)\\n results = []\\n i = 0\\n while i < n - 3:\\n j = i + 1\\n while j < n - 2:\\n l = j+1\\n r = n-1\\n while l < r:\\n total = nums[i] + nums[j] + nums[l] + nums[r]\\n if total == target:\\n results.append([nums[i], nums[j], nums[l], nums[r]])\\n if total <= target:\\n prev = nums[l]\\n while l < n and nums[l] == prev:\\n l += 1\\n else:\\n prev = nums[r]\\n while r >= 0 and nums[r] == prev:\\n r -= 1\\n prev = nums[j]\\n while j < n and nums[j] == prev:\\n j += 1\\n prev = nums[i]\\n while i < n and nums[i] == prev:\\n i += 1\\n return results\\n\\n\\n \",\n \"runtime\": \"289\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n # 3 pointers: 1st on nums[a], 2nd on nums[b]\\n # use a hashset to store the 3rd point value\\n # if sum - nums[p3] in hashset, then add to result\\n # else add nums[p3] to the hashset\\n # complexity: space: O(n), time O(n^3)\\n if len(nums) < 4:\\n return []\\n nums = sorted(nums)\\n res = []\\n for p1 in range(len(nums)-3):\\n if p1 > 0 and nums[p1-1] == nums[p1]:\\n continue\\n for p2 in range(p1+1, len(nums)-2):\\n if (p2-1) > p1 and nums[p2-1] == nums[p2]:\\n continue\\n s = target - nums[p1] - nums[p2]\\n left, right = p2+1, len(nums)-1\\n while left < right:\\n while (nums[left] + nums[right]) < s and left < right:\\n left += 1\\n while (nums[left] + nums[right]) > s and left < right:\\n right-=1\\n if left < right and (nums[left] + nums[right]) == s:\\n res.append([nums[p1], nums[p2], nums[left], nums[right]])\\n left+=1\\n while left < right and nums[left] == nums[left-1]:\\n left+=1\\n right-=1\\n while left < right and nums[right] == nums[right+1]:\\n right -= 1\\n return res\",\n \"runtime\": \"289\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n ans = []\\n n = len(nums)\\n \\n if n < 4:\\n return ans\\n nums = sorted(nums)\\n print(nums)\\n for i in range(n):\\n if (i > 0 and nums[i] == nums[i-1]):\\n continue\\n a = nums[i]\\n\\n for j in range(i+1,n):\\n if (j>i+1 and nums[j] == nums[j-1]):\\n continue\\n b = nums[j]\\n rem = target-(a+b)\\n \\n l = j+1\\n r = n-1\\n\\n while (l<r):\\n tot = nums[l] + nums[r]\\n\\n if tot < rem:\\n l+=1\\n\\n elif tot > rem:\\n r -= 1\\n\\n else:\\n ans.append([a,b,nums[l],nums[r]])\\n #break\\n if nums[l] == nums[r]:\\n break\\n\\n p = nums[l]\\n q = nums[r]\\n while(nums[l] == p):\\n l+=1\\n\\n while(nums[r] == q): \\n r-=1\\n return ans \\n\\n \",\n \"runtime\": \"303\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n results = []\\n if not nums or len(nums) < 4:\\n return results\\n nums.sort()\\n for i in range(len(nums) - 3):\\n if i == 0 or nums[i] != nums[i - 1]:\\n new_target = target - nums[i]\\n self.threeSum(i, nums, new_target, results)\\n return results\\n \\n def threeSum(self, fourSumIndex, nums, target, results):\\n\\n\\n start = fourSumIndex + 1\\n for i in range(start, len(nums) - 2):\\n new_target = target - nums[i]\\n if i == start or nums[i] != nums[i - 1]:\\n self.twoSum(fourSumIndex, i, nums, new_target, results)\\n\\n def twoSum(self, fourSumIndex, threeSumIndex, nums, target, results):\\n left = threeSumIndex + 1\\n right = len(nums) - 1\\n while left < right:\\n total = nums[left] + nums[right]\\n if total > target:\\n right -= 1\\n elif total < target:\\n left += 1\\n else:\\n results.append([nums[fourSumIndex], nums[threeSumIndex], nums[left], nums[right]])\\n left += 1\\n right -= 1\\n\\n while left < right and nums[left] == nums[left - 1]:\\n left += 1\\n\",\n \"runtime\": \"303\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n results = []\\n if not nums or len(nums) < 4:\\n return results\\n nums.sort()\\n for i in range(len(nums) - 3):\\n if i == 0 or nums[i] != nums[i - 1]:\\n new_target = target - nums[i]\\n self.threeSum(i, nums, new_target, results)\\n return results\\n \\n def threeSum(self, fourSumIndex, nums, target, results):\\n\\n\\n start = fourSumIndex + 1\\n for i in range(start, len(nums) - 2):\\n new_target = target - nums[i]\\n if i == start or nums[i] != nums[i - 1]:\\n self.twoSum(fourSumIndex, i, nums, new_target, results)\\n\\n def twoSum(self, fourSumIndex, threeSumIndex, nums, target, results):\\n left = threeSumIndex + 1\\n right = len(nums) - 1\\n while left < right:\\n total = nums[left] + nums[right]\\n if total > target:\\n right -= 1\\n elif total < target:\\n left += 1\\n else:\\n results.append([nums[fourSumIndex], nums[threeSumIndex], nums[left], nums[right]])\\n left += 1\\n right -= 1\\n\\n while left < right and nums[left] == nums[left - 1]:\\n left += 1\\n\",\n \"runtime\": \"316\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n \\n def kSum(start,k,target):\\n if k != 2:\\n for i in range(start,len(nums)-k+1):\\n if i > start and nums[i] == nums[i-1]:\\n continue\\n quad.append(nums[i])\\n kSum(i+1,k-1,target-nums[i])\\n quad.pop()\\n return\\n \\n l = start\\n r = len(nums)-1\\n\\n while l < r:\\n total = nums[l] + nums[r]\\n if total > target:\\n r-=1\\n elif total < target:\\n l+=1\\n else:\\n res.append(quad + [nums[l],nums[r]])\\n l+=1\\n while nums[l] == nums[l-1] and l < r:\\n l+=1\\n \\n return res\\n \\n nums.sort()\\n quad = []\\n res = []\\n kSum(0,4,target)\\n return res\\n \",\n \"runtime\": \"316\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort() # Sort the array\\n res = []\\n\\n for i in range(len(nums) - 3):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue # Skip duplicates for the first element\\n \\n for j in range(i + 1, len(nums) - 2):\\n if j > i + 1 and nums[j] == nums[j - 1]:\\n continue # Skip duplicates for the second element\\n \\n new_target = target - nums[i] - nums[j]\\n l, r = j + 1, len(nums) - 1\\n\\n while l < r:\\n sum_lr = nums[l] + nums[r]\\n if sum_lr == new_target:\\n res.append([nums[i], nums[j], nums[l], nums[r]])\\n while l < r and nums[l] == nums[l + 1]:\\n l += 1 # Skip duplicates for the third element\\n while l < r and nums[r] == nums[r - 1]:\\n r -= 1 # Skip duplicates for the fourth element\\n l += 1\\n r -= 1\\n elif sum_lr < new_target:\\n l += 1\\n else:\\n r -= 1\\n\\n return res\\n\",\n \"runtime\": \"330\"\n },\n {\n \"code\": \"class Solution:\\n def kSum(self, nums: List[int], target: int, k: int) -> List[List[int]]:\\n matches = []\\n for i in range(len(nums) - k + 1):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n sub_nums = nums[i + 1:]\\n sub_target = target - nums[i]\\n sub_k = k - 1\\n if sub_k > 2:\\n sub_matches = self.kSum(sub_nums, sub_target, sub_k)\\n else:\\n sub_matches = self.twoSum(sub_nums, sub_target)\\n for match in sub_matches:\\n matches.append([nums[i]] + match)\\n return matches\\n\\n def twoSum(self, nums: List[int], target) -> List[List[int]]:\\n l, r = 0, len(nums) - 1\\n matches = []\\n while l < r:\\n sum2 = nums[l] + nums[r]\\n if sum2 < target:\\n l += 1\\n elif sum2 > target:\\n r -= 1\\n else:\\n matches.append([nums[l], nums[r]])\\n while l < r and nums[l] == nums[l + 1]:\\n l += 1\\n l += 1\\n while r > l and nums[r] == nums[r - 1]:\\n r -= 1\\n r -= 1\\n return matches\\n\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n return self.kSum(nums, target, 4)\\n\",\n \"runtime\": \"330\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res, quad = [], []\\n\\n # kSum recursive function\\n def kSum(k, start, target):\\n if k == 2: # Base case: two pointers to find pairs\\n l, r = start, len(nums) - 1\\n while l < r:\\n current_sum = nums[l] + nums[r]\\n if current_sum < target:\\n l += 1\\n elif current_sum > target:\\n r -= 1\\n else:\\n res.append(quad + [nums[l], nums[r]])\\n l += 1\\n r -= 1\\n # Skip duplicates for the left pointer\\n while l < r and nums[l] == nums[l - 1]:\\n l += 1\\n # Skip duplicates for the right pointer\\n while l < r and nums[r] == nums[r + 1]:\\n r -= 1\\n else:\\n # Recursion for k-sum\\n for i in range(start, len(nums) - k + 1):\\n if i > start and nums[i] == nums[i - 1]: # Skip duplicates\\n continue\\n quad.append(nums[i])\\n kSum(k - 1, i + 1, target - nums[i]) # Recursive call for k-1 sum\\n quad.pop() # Backtrack\\n\\n # Start the 4-sum process\\n kSum(4, 0, target)\\n return res\\n\",\n \"runtime\": \"343\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n return fourSum(nums, target)\\n\\ndef fourSum(nums: list[int], target: int) -> list[list[int]]:\\n nums = sorted(nums)\\n n = len(nums)\\n result = set()\\n if n < 4:\\n return []\\n if n < 4:\\n return []\\n if sum(nums[:4]) > target:\\n return []\\n if sum(nums[-4:]) < target:\\n return []\\n for i in range(n - 3):\\n for j in range(i + 1, n - 2):\\n left, right = j + 1, n - 1\\n while left < right:\\n total = nums[i] + nums[j] + nums[left] + nums[right]\\n if total == target:\\n result.add((nums[i], nums[j], nums[left], nums[right]))\\n left += 1\\n right -= 1\\n elif total < target:\\n left += 1\\n else: # total > target\\n right -= 1\\n return [list(t) for t in result]\\n \",\n \"runtime\": \"343\"\n },\n {\n \"code\": \"'''\\n[-2,2,0,5,3,1] target = 8\\n\\nkeep track of \\n-currSum\\n-currQuad\\n-res[]\\n\\n\\n#check if nums is less than 4\\n'''\\nclass Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res = []\\n currQuad = []\\n def kSum(k,start,target):\\n if k != 2:\\n for i in range(start, len(nums) - k + 1):\\n if i > start and nums[i] == nums[i-1]:\\n continue\\n currQuad.append(nums[i])\\n kSum(k-1,i+1, target - nums[i])\\n currQuad.pop()\\n return\\n l,r = start, len(nums)-1\\n\\n while l < r:\\n if nums[l]+ nums[r]>target:\\n r-=1\\n elif nums[l]+ nums[r]<target:\\n l+=1\\n else:\\n res.append(currQuad + [nums[l],nums[r]])\\n l += 1\\n while l<r and nums[l] == nums[l-1]:\\n l+=1\\n \\n kSum(4,0,target)\\n return res\\n \",\n \"runtime\": \"356\"\n },\n {\n \"code\": \"class Solution:\\n def kSum(self, nums: List[int], target: int, k: int) -> List[List[int]]:\\n def kSumHelper(start: int, target: int, k: int) -> List[List[int]]:\\n if k == 2:\\n return twoSum(start, target)\\n \\n result, i = [], start\\n \\n while i < len(nums):\\n\\n while i > start and i < len(nums) and nums[i] == nums[i-1]:\\n i += 1\\n\\n if i < len(nums):\\n for subset in kSumHelper(i + 1, target - nums[i], k - 1):\\n subset.append(nums[i])\\n result.append(subset)\\n\\n i += 1\\n \\n return result\\n\\n def twoSum(start: int, target: int) -> List[List[int]]:\\n left, right = start, len(nums) - 1\\n result = []\\n while left < right:\\n current_sum = nums[left] + nums[right]\\n if current_sum == target:\\n result.append([nums[left], nums[right]])\\n while left < right and nums[left] == nums[left + 1]:\\n left += 1\\n while left < right and nums[right] == nums[right - 1]:\\n right -= 1\\n left += 1\\n right -= 1\\n elif current_sum < target:\\n left += 1\\n else:\\n right -= 1\\n return result\\n\\n nums.sort()\\n return kSumHelper(0, target, k)\\n\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n return self.kSum(nums, target, 4)\",\n \"runtime\": \"356\"\n },\n {\n \"code\": \"class Solution:\\n\\n def get_k_sum(self, nums, target, k):\\n\\n def _get_k_sum(_sum, target, k, start):\\n if len(candidate) > k:\\n return\\n\\n if k >= 3:\\n for i in range(start, n):\\n if i == start or nums[i] != nums[i - 1]:\\n candidate.append(nums[i])\\n _get_k_sum(_sum + nums[i], target, k - 1, i + 1)\\n candidate.pop()\\n else:\\n left, right = start, n - 1\\n while left < right:\\n temp = _sum + nums[left] + nums[right]\\n if temp < target:\\n left += 1\\n elif temp > target:\\n right -= 1\\n else:\\n candidate.extend([nums[left], nums[right]])\\n\\n k_tuple = candidate.copy()\\n k_tuples.append(k_tuple)\\n\\n candidate.pop()\\n candidate.pop()\\n\\n left += 1\\n right -= 1\\n while left < right and nums[left] == nums[left - 1]:\\n left += 1\\n\\n nums = sorted(nums)\\n n = len(nums)\\n\\n k_tuples = deque()\\n candidate = deque()\\n _get_k_sum(0, target, k, 0)\\n return k_tuples\\n\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n return self.get_k_sum(nums, target, 4)\\n\\n# input -> output\\n\\n# 2sum\\n# nums = [1,1,1], target = 2 -> [1,1]\\n\\n# 3sum\\n# nums = [1,1,1,1,2], target = 3 -> [1,1,1]\\n\\n# 4sum\\n# nums = [1,1,1,1,1,2], target = 3 -> [1,1,1,1]\",\n \"runtime\": \"370\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, arr: List[int], target: int) -> List[List[int]]:\\n n = len(arr)\\n ans = set()\\n arr.sort()\\n for i in range(n-3):\\n if i>0 and arr[i]==arr[i-1]:\\n continue\\n for j in range(i+1,n-2):\\n l = j+1\\n r = n-1\\n s = arr[i] + arr[j]\\n while l<r:\\n s1 = s + arr[l] + arr[r]\\n\\n if s1==target:\\n ans.add((arr[i],arr[j],arr[l],arr[r]))\\n l+=1\\n r-=1\\n elif s1<target:\\n l+=1\\n else:\\n r-=1\\n return list(ans)\\n\",\n \"runtime\": \"370\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n res, cur = [], []\\n nums.sort()\\n\\n def kSum(k, start, target):\\n if k > 2:\\n for i in range(start, len(nums) - k + 1):\\n if i > start and nums[i] == nums[i-1]:\\n continue\\n cur.append(nums[i])\\n kSum(k-1, i+1, target - nums[i])\\n cur.pop()\\n return\\n l, r = start, len(nums) - 1\\n while l < r:\\n if nums[l] + nums[r] < target:\\n l += 1\\n elif nums[l] + nums[r] > target:\\n r -= 1\\n else:\\n res.append(cur + [nums[l], nums[r]])\\n l += 1\\n while l < r and nums[l] == nums[l-1]:\\n l += 1\\n kSum(4, 0, target)\\n return res\\n\\n\\n \",\n \"runtime\": \"383\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n if len(nums) < 4:\\n return []\\n\\n if len(nums) == 4:\\n return [nums] if sum(nums) == target else []\\n\\n nums.sort() # Sorting the array\\n\\n result = []\\n\\n for i in range(len(nums) - 3):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n for j in range(i + 1, len(nums) - 2):\\n if j > i + 1 and nums[j] == nums[j - 1]:\\n continue\\n\\n currTarget = target - nums[i] - nums[j]\\n left, right = j + 1, len(nums) - 1\\n\\n while left < right:\\n currSum = nums[left] + nums[right]\\n\\n if currSum == currTarget:\\n result.append([nums[i], nums[j], nums[left], nums[right]])\\n\\n left += 1\\n right -= 1\\n\\n # Skip duplicates for left\\n while left < right and nums[left] == nums[left - 1]:\\n left += 1\\n # Skip duplicates for right\\n while left < right and nums[right] == nums[right + 1]:\\n right -= 1\\n\\n elif currSum < currTarget:\\n left += 1\\n else:\\n right -= 1\\n\\n return result\\n\\n \",\n \"runtime\": \"383\"\n },\n {\n \"code\": \"class Solution: \\n def fourSum(self, nums: List[int], t: int) -> List[List[int]]:\\n n=len(nums)\\n nums.sort()\\n res=[]\\n if(n<4):\\n return res\\n if(n==4):\\n if(sum(nums)==t):\\n return [nums]\\n else:\\n return res\\n for i in range(n-3):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n for j in range(i+1,n-2):\\n if j > i + 1 and nums[j] == nums[j - 1]:\\n continue\\n l=j+1\\n r=n-1\\n target=-(nums[i]+nums[j]-t)\\n while(l<r):\\n if(nums[l]+nums[r]==target):\\n res.append([nums[i],nums[j],nums[r],nums[l]])\\n while(l<r and nums[l]==nums[l+1]):\\n l+=1\\n while(l<r and nums[r]==nums[r-1]):\\n r-=1\\n if(nums[l]+nums[r]>target):\\n r-=1\\n else:\\n l+=1\\n return res\",\n \"runtime\": \"397\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n=len(nums)\\n nums.sort()\\n ans=[]\\n i=0\\n while i<n:\\n j=i+1\\n while j<n:\\n end=n-1\\n strt=j+1\\n nTarget=target-nums[i]-nums[j]\\n \\n while strt<end: \\n if nums[strt]+nums[end]==nTarget:\\n ans.append([nums[i],nums[j],nums[strt],nums[end]])\\n\\n third=nums[strt]\\n fourth=nums[end]\\n while strt<end and nums[strt]==third:\\n strt+=1\\n while strt<end and nums[end]==fourth:\\n end-=1\\n elif nums[strt]+nums[end]>nTarget:\\n end-=1\\n else:\\n strt+=1\\n t=nums[j]\\n while j<n and nums[j]==t:\\n j+=1\\n t2=nums[i]\\n while i<n and nums[i]==t2:\\n i+=1\\n return ans\\n \\n \\n \",\n \"runtime\": \"397\"\n },\n {\n \"code\": \"class Solution:\\n\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n\\n # Sort the list to ensure we can determine whether moving either\\n # of the pointers in the Two-Pointer approach will bring us closer\\n # to the target\\n nums.sort()\\n\\n results = []\\n\\n LENGTH_MINUS_3 = len(nums) - 3\\n LENGTH_MINUS_2 = LENGTH_MINUS_3 + 1\\n LENGTH_MINUS_1 = LENGTH_MINUS_2 + 1\\n\\n # Iterate through the list, using the i'th and j'th position as our fixed points\\n\\n # Fixed Point 1\\n for i in range(LENGTH_MINUS_3) :\\n\\n # Ignore Duplicates\\n if i > 0 and nums[i] == nums[i - 1] :\\n continue\\n #end\\n\\n # Fixed Point 1\\n for j in range(i + 1, LENGTH_MINUS_2) :\\n\\n # Ignore Duplicates\\n if j > i + 1 and nums[j] == nums[j - 1] :\\n continue\\n #end\\n\\n # Initial Left/Right Pointers\\n nLeft = j + 1\\n nRight = LENGTH_MINUS_1\\n\\n nFixed1 = nums[i]\\n nFixed2 = nums[j]\\n\\n # Iterate through the list using the Two-Pointer approach\\n #\\n # Basically because the numbers are sorted, we know moving\\n # the left index makes the number bigger, and moving the right\\n # index makes the number smaller. Meaning we can keep shifting\\n # these until we've found the target.\\n\\n while nLeft < nRight :\\n\\n # Compute the current result\\n nCurrentResult = nFixed1 + nFixed2 + nums[nLeft] + nums[nRight]\\n\\n # Simple case, if we've found the target, return it\\n if nCurrentResult == target :\\n results.append([nFixed1, nFixed2, nums[nLeft], nums[nRight]])\\n\\n # Shift the Left Pointer past any duplicates\\n while nLeft < nRight and nums[nLeft] == nums[nLeft + 1]:\\n nLeft += 1\\n #end\\n\\n # Shift the Right Pointer past any duplicates\\n while nLeft < nRight and nums[nRight] == nums[nRight - 1]:\\n nRight -= 1\\n #end\\n\\n #end\\n\\n # Move the pointers based on whether the number needs to get\\n # bigger or smaller\\n if nCurrentResult < target :\\n nLeft += 1\\n else :\\n nRight -= 1\\n #end\\n\\n #end\\n\\n #end\\n\\n #end\\n\\n return results\\n\\n #end\\n\\n#end\",\n \"runtime\": \"410\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums = sorted(nums)\\n output = set()\\n for i, n in enumerate(nums):\\n candidates = self.threeSum(nums[i+1:], target-n)\\n for c in candidates:\\n output.add((n, *c))\\n\\n return [list(o) for o in output]\\n\\n def threeSum(self, nums: List[int], target: int) -> List[List[int]]:\\n output = set()\\n for i, n in enumerate(nums):\\n if i > 0 and n == nums[i-1]:\\n continue\\n l, r = i + 1, len(nums) - 1\\n\\n while l < r:\\n s = n + nums[l] + nums[r] - target\\n if s > 0: \\n r -= 1\\n elif s < 0 :\\n l += 1\\n else:\\n output.add((n, nums[l], nums[r]))\\n l += 1\\n r -= 1\\n\\n return [list(o) for o in output]\\n \",\n \"runtime\": \"410\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n=len(nums)\\n result=[]\\n nums.sort()\\n\\n for i in range(n-3):\\n if i>0 and nums[i]==nums[i-1]:\\n continue\\n\\n for j in range(i+1,n-2):\\n if j >i+1 and nums[j]== nums[j-1]:\\n continue\\n\\n left=j+1\\n right=n-1\\n\\n while left<right:\\n total= nums[i]+nums[j]+nums[left]+nums[right]\\n if total<target:\\n left+=1\\n\\n elif total>target:\\n right-=1\\n\\n else:\\n result.append([nums[i],nums[j],nums[left],nums[right]]) \\n left+=1\\n right-=1\\n\\n while left<right and nums[left]==nums[left-1]:\\n left+=1\\n\\n while left<right and nums[right]==nums[right+1]:\\n right-=1\\n\\n return result \\n \\n \",\n \"runtime\": \"423\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n length = len(nums)\\n result = []\\n nums = sorted(nums)\\n for i in range(length-3):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue \\n for j in range(i+1, length-2):\\n if j > i+1 and nums[j] == nums[j-1]:\\n continue \\n left = j + 1\\n right = length -1\\n while right > left:\\n total = nums[i] + nums[j] + nums[left] + nums[right]\\n if total > target:\\n right -= 1\\n elif total < target:\\n left += 1\\n else:\\n result.append([nums[i], nums[j], nums[left], nums[right]])\\n while right > left and nums[left] == nums[left+1]:\\n left += 1\\n while right > left and nums[right] == nums[right-1]:\\n right -= 1\\n left += 1\\n right -= 1\\n return result\",\n \"runtime\": \"423\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n = len(nums)\\n ans = []\\n if n < 4:\\n return ans\\n nums.sort()\\n for i in range(n - 3):\\n if i and nums[i] == nums[i - 1]:\\n continue\\n for j in range(i + 1, n - 2):\\n if j > i + 1 and nums[j] == nums[j - 1]:\\n continue\\n k, l = j + 1, n - 1\\n while k < l:\\n x = nums[i] + nums[j] + nums[k] + nums[l]\\n if x < target:\\n k += 1\\n elif x > target:\\n l -= 1\\n else:\\n ans.append([nums[i], nums[j], nums[k], nums[l]])\\n k, l = k + 1, l - 1\\n while k < l and nums[k] == nums[k - 1]:\\n k += 1\\n while k < l and nums[l] == nums[l + 1]:\\n l -= 1\\n return ans\",\n \"runtime\": \"437\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n \\n nums.sort()\\n quadruplets = []\\n n = len(nums)\\n \\n for i in range(n):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n for j in range(i + 1, n):\\n if j > i + 1 and nums[j] == nums[j - 1]:\\n continue\\n\\n p1 = j + 1\\n p2 = n - 1\\n \\n while p1 < p2:\\n total = nums[i] + nums[j] + nums[p1] + nums[p2]\\n \\n if total == target:\\n quadruplets.append([nums[i], nums[j], nums[p1], nums[p2]])\\n \\n while p1 < p2 and nums[p1] == nums[p1 + 1]:\\n p1 = p1 + 1\\n while p1 < p2 and nums[p2] == nums[p2 - 1]:\\n p2 = p2 - 1\\n \\n p1 = p1 + 1\\n p2 = p2 - 1\\n elif total < target:\\n p1 = p1 + 1 \\n else:\\n p2 = p2 - 1 \\n \\n return quadruplets\\n\",\n \"runtime\": \"437\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res = []\\n for i in range(len(nums) - 3): # Ensure at least 4 numbers are available\\n if i > 0 and nums[i] == nums[i - 1]: # Skip duplicate i\\n continue\\n for j in range(i + 1, len(nums) - 2): # Ensure at least 3 numbers after j\\n if j > i + 1 and nums[j] == nums[j - 1]: # Skip duplicate j\\n continue\\n l, r = j + 1, len(nums) - 1\\n while l < r:\\n fsum = nums[i] + nums[j] + nums[l] + nums[r]\\n if fsum > target:\\n r -= 1\\n elif fsum < target:\\n l += 1\\n else:\\n res.append([nums[i], nums[j], nums[l], nums[r]])\\n l += 1\\n r -= 1\\n # Skip duplicates for l and r\\n while l < r and nums[l] == nums[l - 1]:\\n l += 1\\n while l < r and nums[r] == nums[r + 1]:\\n r -= 1\\n return res\\n\",\n \"runtime\": \"450\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n ans = []\\n nums.sort()\\n\\n for i in range(len(nums) - 3):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n\\n for j in range(i + 1, len(nums) - 2):\\n if j > i + 1 and nums[j] == nums[j - 1]:\\n continue\\n \\n left = j + 1\\n right = len(nums) - 1\\n\\n while left < right:\\n total = nums[i] + nums[j] + nums[left] + nums[right]\\n \\n if total > target:\\n right -= 1\\n elif total < target:\\n left += 1\\n else:\\n ans.append([nums[i], nums[j], nums[left], nums[right]])\\n \\n while left < right and nums[left] == nums[left + 1]:\\n left += 1\\n while left < right and nums[right] == nums[right - 1]:\\n right -= 1\\n \\n left += 1\\n right -= 1\\n return ans\",\n \"runtime\": \"450\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort() # Sort the input list to simplify the logic\\n results = set() # Use a set to avoid duplicate quadruplets\\n n = len(nums)\\n\\n for j in range(n):\\n # Skip duplicate elements for `j`\\n if j > 0 and nums[j] == nums[j - 1]:\\n continue\\n for i in range(j + 1, n):\\n # Skip duplicate elements for `i`\\n if i > j + 1 and nums[i] == nums[i - 1]:\\n continue\\n\\n left, right = i + 1, n - 1\\n while left < right:\\n total = nums[j] + nums[i] + nums[left] + nums[right]\\n\\n if total == target:\\n results.add((nums[j], nums[i], nums[left], nums[right]))\\n left += 1\\n right -= 1\\n\\n # Skip duplicates for `left` and `right`\\n while left < right and nums[left] == nums[left - 1]:\\n left += 1\\n while left < right and nums[right] == nums[right + 1]:\\n right -= 1\\n elif total < target:\\n left += 1\\n else:\\n right -= 1\\n\\n # Convert set to list of lists and return the result\\n return [list(quad) for quad in results]\\n\",\n \"runtime\": \"464\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n res=[]\\n n=len(nums)\\n nums.sort()\\n for i in range(n-3):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n for j in range(i+1,n-2):\\n if j > i + 1 and nums[j] == nums[j-1]:\\n continue\\n l=j+1\\n r=n-1\\n while(l<r):\\n x=nums[i]+nums[j]+nums[l]+nums[r]\\n if x==target:\\n res.append([nums[i],nums[j],nums[l],nums[r]])\\n l+=1\\n r-=1\\n while l<r and nums[l]==nums[l-1]:\\n l+=1\\n while l<r and nums[r]==nums[r+1]:\\n r-=1\\n elif x<target:\\n l+=1\\n else:\\n r-=1\\n return res\",\n \"runtime\": \"464\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n quadruplets = []\\n n = len(nums)\\n\\n for a in range(n - 3):\\n if a > 0 and nums[a] == nums[a - 1]:\\n continue\\n for b in range(a + 1, n - 2):\\n if b > a + 1 and nums[b] == nums[b - 1]:\\n continue\\n \\n left, right = b + 1, n - 1\\n \\n while left < right:\\n current_sum = nums[a] + nums[b] + nums[left] + nums[right]\\n \\n if current_sum == target:\\n quadruplets.append([nums[a], nums[b], nums[left], nums[right]])\\n while left < right and nums[left] == nums[left + 1]:\\n left += 1\\n while left < right and nums[right] == nums[right - 1]:\\n right -= 1\\n \\n left += 1\\n right -= 1\\n elif current_sum < target:\\n left += 1\\n else:\\n right -= 1\\n \\n return quadruplets\\n \",\n \"runtime\": \"477\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n results = set()\\n n = len(nums)\\n\\n for i in range(n - 3):\\n if i > 0 and nums[i] == nums[i - 1]: # Skip duplicates\\n continue\\n for j in range(i + 1, n - 2):\\n if j > i + 1 and nums[j] == nums[j - 1]: # Skip duplicates\\n continue\\n left, right = j + 1, n - 1\\n while left < right:\\n total = nums[i] + nums[j] + nums[left] + nums[right]\\n if total == target:\\n results.add((nums[i], nums[j], nums[left], nums[right]))\\n left += 1\\n right -= 1\\n while left < right and nums[left] == nums[left - 1]: # Skip duplicates\\n left += 1\\n while left < right and nums[right] == nums[right + 1]: # Skip duplicates\\n right -= 1\\n elif total < target:\\n left += 1\\n else:\\n right -= 1\\n\\n return [list(result) for result in results]\",\n \"runtime\": \"477\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res = []\\n\\n for i in range(len(nums) - 3):\\n # skip duplicate starting values\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n \\n for j in range(i+1, len(nums) - 2):\\n # skip duplicate starting values\\n if j > i + 1 and nums[j] == nums[j-1]:\\n continue\\n left, right = j + 1, len(nums) - 1\\n\\n while left < right:\\n four_sum = nums[i] + nums[j] + nums[left] + nums[right]\\n if four_sum == target:\\n res.append([nums[i], nums[j], nums[left], nums[right]])\\n left += 1\\n right -= 1\\n\\n while left < right and nums[left] == nums[left - 1]:\\n left += 1\\n while left < right and nums[right] == nums[right + 1]:\\n right -= 1\\n elif four_sum < target:\\n left += 1\\n else:\\n right -= 1\\n return res\\n \\n \",\n \"runtime\": \"490\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n ans=[]\\n n=len(nums)\\n nums.sort()\\n for i in range(0,n):\\n if(i>0 and nums[i]==nums[i-1]):\\n continue\\n for j in range(i+1,n):\\n if(j!=i+1 and nums[j]==nums[j-1]):\\n continue\\n k=j+1\\n l=n-1\\n while(k<l):\\n sum=nums[i]\\n sum+=nums[j]\\n sum+=nums[k]\\n sum+=nums[l]\\n if(sum==target):\\n temp=[nums[i],nums[j],nums[k],nums[l]]\\n ans.append(temp)\\n k+=1\\n l-=1\\n while(k<l and nums[k]==nums[k-1]):\\n k+=1\\n while(k<l and nums[l]==nums[l+1]):\\n l-=1\\n elif(sum<target):\\n k+=1\\n else:\\n l-=1\\n return ans\",\n \"runtime\": \"490\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n n = len(nums)\\n ans = set()\\n for i in range(n-3):\\n tr1 = target-nums[i]\\n for j in range(i+1,n-2):\\n tr2 = tr1-nums[j]\\n l,r = j+1,n-1\\n while l < r:\\n if nums[l]+nums[r] < tr2:\\n l+=1\\n elif nums[l]+nums[r] > tr2:\\n r-=1\\n else:\\n ans.add((nums[i],nums[j],nums[l],nums[r]))\\n l+=1\\n r-=1\\n ans = list(map(list,list(ans)))\\n return ans\",\n \"runtime\": \"504\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n n = len(nums)\\n result = []\\n\\n for i in range(n):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n for j in range(i + 1, n):\\n if j > i + 1 and nums[j] == nums[j - 1]:\\n continue\\n left = j + 1\\n right = n - 1\\n while left < right:\\n total = nums[i] + nums[j] + nums[left] + nums[right]\\n if total == target:\\n result.append([nums[i], nums[j], nums[left], nums[right]])\\n while left < right and nums[left] == nums[left + 1]:\\n left += 1\\n while left < right and nums[right] == nums[right - 1]:\\n right -= 1\\n left += 1\\n right -= 1\\n elif total < target:\\n left += 1\\n else:\\n right -= 1\\n\\n return result\\n\",\n \"runtime\": \"504\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, arr: List[int], target: int) -> List[List[int]]:\\n n = len(arr)\\n ans = []\\n arr.sort()\\n for i in range(n-3):\\n if i>0 and arr[i]==arr[i-1]:\\n continue\\n for j in range(i+1,n-2):\\n if j>i+1 and arr[j]==arr[j-1]:\\n continue\\n l = j+1\\n r = n-1\\n s = arr[i] + arr[j]\\n while l<r:\\n s1 = s + arr[l] + arr[r]\\n\\n if s1==target:\\n ans.append((arr[i],arr[j],arr[l],arr[r]))\\n l+=1\\n while l<r and arr[l]==arr[l-1]:\\n l+=1\\n r-=1\\n while l<r and arr[r]==arr[r+1]:\\n r-=1\\n elif s1<target:\\n l+=1\\n while l<r and arr[l]==arr[l-1]:\\n l+=1\\n else:\\n r-=1\\n while l<r and arr[r]==arr[r+1]:\\n r-=1\\n return list(ans)\\n\",\n \"runtime\": \"517\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort() # O(nlogn) which is fine since code complexity will be O(n^2)\\n res = []\\n for j in range(len(nums)-3):\\n #print(nums[j], nums[j - 1])\\n if j > 0 and nums[j] == nums[j - 1]: continue\\n for i in range(j + 1, len(nums)-2):\\n if i > j + 1 and nums[i] == nums[i-1]: # avoid duplicates\\n continue\\n left = i + 1\\n right = len(nums) - 1\\n #print(j, i, left, right)\\n while left < right:\\n if nums[i] + nums[j] + nums[left] + nums[right] > target:\\n right -= 1\\n elif nums[i] + nums[j] + nums[left] + nums[right] < target:\\n left += 1\\n else:\\n #print('else')\\n res.append([nums[i], nums[j], nums[left], nums[right]])\\n left += 1\\n while nums[left] == nums[left - 1] and left < right: # avoid duplicates\\n left += 1\\n return res\",\n \"runtime\": \"517\"\n },\n {\n \"code\": \"class Solution: \\n def fourSum(self, nums: List[int], t: int) -> List[List[int]]:\\n n=len(nums)\\n nums.sort()\\n res=[]\\n if(n<4):\\n return res\\n if(n==4):\\n if(sum(nums)==t):\\n return [nums]\\n else:\\n return res\\n for i in range(n-3):\\n for j in range(i+1,n-2):\\n l=j+1\\n r=n-1\\n target=-(nums[i]+nums[j]-t)\\n while(l<r):\\n if(nums[l]+nums[r]==target):\\n lst=[nums[i],nums[j],nums[r],nums[l]]\\n lst.sort()\\n if(lst not in res):\\n res.append(lst)\\n while(l<r and nums[l]==nums[l+1] and nums[r]==nums[r-1]):\\n l+=1\\n r-=1\\n if(nums[l]+nums[r]>target):\\n r-=1\\n else:\\n l+=1\\n return res\",\n \"runtime\": \"531\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n result = set()\\n\\n n = len(nums)\\n for i in range(n - 3):\\n for j in range(i + 1, n - 2):\\n remain = target - (nums[i] + nums[j])\\n left, right = j + 1, n - 1\\n while left < right:\\n if nums[left] + nums[right] == remain:\\n result.add((nums[i], nums[j], nums[left], nums[right]))\\n left += 1\\n right -= 1\\n elif nums[left] + nums[right] < remain:\\n left += 1\\n else:\\n right -= 1\\n\\n return [list(ans) for ans in result]\",\n \"runtime\": \"531\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n return nSum(nums,4,0,target)\\n\\ndef nSum(arr,n,start,k):\\n sz=len(arr)\\n res=[]\\n if n<2 or sz<n:\\n return res\\n if n==2:\\n l=start\\n r=sz-1\\n \\n while l<r:\\n left,right=arr[l],arr[r]\\n curr=left+right\\n if curr > k:\\n while l<r and arr[r]==right:\\n r-=1\\n elif curr < k:\\n while l<r and arr[l]==left:\\n l+=1\\n else:\\n res.append([left,right])\\n while l<r and arr[l]==left:\\n l+=1\\n while l<r and arr[r]==right:\\n r-=1\\n return res\\n else:\\n for i in range(start,sz):\\n if i > start and arr[i]==arr[i-1]:\\n continue\\n sols=nSum(arr,n-1,i+1,k-arr[i])\\n for sol in sols:\\n sol.append(arr[i])\\n res.append(sol)\\n return res\",\n \"runtime\": \"544\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n res = set()\\n nums.sort()\\n for i in range(len(nums)):\\n for j in range(i + 1, len(nums)):\\n l = j + 1\\n r = len(nums) - 1\\n cur_target = target - (nums[i] + nums[j])\\n while l < r:\\n if nums[l] + nums[r] == cur_target:\\n res.add((nums[i], nums[j], nums[r], nums[l]))\\n l += 1\\n r -= 1\\n elif nums[l] + nums[r] > cur_target:\\n r -= 1\\n else:\\n l += 1\\n\\n # for l in range(k + 1, len(nums)):\\n # if nums[i] + nums[j] + nums[k] + nums[l] == target:\\n # res.add((nums[i], nums[j], nums[k], nums[l]))\\n return [list(el) for el in res]\\n\",\n \"runtime\": \"544\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n \\n res = set()\\n n = len(nums)\\n nums.sort()\\n print(nums)\\n\\n # l1 = 0\\n # r1 = n - 1\\n\\n # while l1 < r1:\\n \\n # outerSum = nums[l1] + nums[r1]\\n # remaining = target - outerSum\\n\\n # l2 = l1 + 1\\n # r2 = r1 - 1\\n\\n # while l2 < r2:\\n\\n # innerSum = nums[l2] + nums[r2]\\n\\n # if innerSum < remaining:\\n # l2 += 1 \\n\\n # if innerSum > remaining:\\n # r2 -= 1\\n \\n # if innerSum == remaining:\\n # res.add((nums[l1], nums[l2], nums[r2], nums[r1]))\\n # l2 += 1\\n \\n # if outerSum < target:\\n # l1 += 1\\n # else:\\n # r1 -= 1\\n\\n for first in range(n):\\n\\n second = first + 1 \\n\\n while second < n - 2:\\n \\n l = second + 1\\n r = n - 1 \\n remainingSum = target - nums[first] - nums[second] \\n \\n while l < r:\\n\\n innerSum = nums[l] + nums[r]\\n\\n if innerSum == remainingSum:\\n res.add((nums[first], nums[second], nums[l], nums[r]))\\n r -= 1\\n\\n if innerSum < remainingSum:\\n l += 1\\n \\n if innerSum > remainingSum:\\n r -= 1\\n\\n second += 1\\n\\n\\n return sorted([list(tup) for tup in res])\\n\\n\",\n \"runtime\": \"557\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n r = []\\n nums.sort()\\n for i in range(len(nums)-3):\\n t = target - nums[i]\\n for j in range(i+1, len(nums)-2):\\n lo, hi = j+1, len(nums)-1\\n while lo < hi:\\n s = nums[j] + nums[lo] + nums[hi]\\n if s > t:\\n hi -= 1\\n elif s < t:\\n lo += 1\\n else:\\n ans = [nums[i], nums[j], nums[lo], nums[hi]]\\n lo += 1\\n hi -= 1\\n ans.sort()\\n if ans not in r: r.append(ans)\\n return r\\n \\n\\n\\n \",\n \"runtime\": \"557\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n res=[]\\n length=len(nums)\\n dictionary={}\\n for num in range(length):\\n if nums[num] in dictionary:\\n dictionary[nums[num]].append(num)\\n else:\\n dictionary[nums[num]]=[num]\\n one={}\\n for i in range(0,length):\\n if(nums[i]in one):\\n continue\\n else:\\n one[nums[i]]=True\\n for j in range(i+1,length):\\n for k in range(j+1,length):\\n temp_sum=nums[i]+nums[j]+nums[k]\\n required=target-temp_sum\\n temp_list=[]\\n if(required in dictionary and dictionary[required][-1]>k):\\n temp_list.extend([nums[i],nums[j],nums[k],required])\\n temp_list.sort()\\n if(temp_list not in res):\\n res.append(temp_list)\\n return res\\n \",\n \"runtime\": \"571\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res = set()\\n for i in range(len(nums) - 3):\\n for j in range(i + 1, len(nums) - 2):\\n left, right = j + 1, len(nums) - 1\\n\\n while left < right:\\n s = nums[i] + nums[j] + nums[left] + nums[right]\\n\\n if target == s:\\n res.add((nums[i], nums[j], nums[left], nums[right]))\\n while left < right and nums[left] == nums[left + 1]:\\n left += 1\\n while left < right and nums[right] == nums[right - 1]:\\n right -= 1\\n \\n left += 1\\n right -= 1\\n elif s > target:\\n right -= 1\\n else:\\n left += 1\\n \\n return [list(tup) for tup in res]\\n\",\n \"runtime\": \"571\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n \\n def ksum(nums,target,k):\\n res = []\\n if not nums:\\n return res\\n \\n # average_value = target//k\\n # if average_value < nums[0] or nums[-1] < average_value:\\n # return res\\n\\n if k==2:\\n return twosum(nums,target)\\n for i in range(len(nums)):\\n if i == 0 or nums[i - 1] != nums[i]:\\n for subset in ksum(nums[i+1:],target-nums[i],k-1):\\n res.append([nums[i]]+subset)\\n return res\\n\\n def twosum(nums,target):\\n # print(nums,target)\\n\\n res = []\\n s = set()\\n for i in range(len(nums)):\\n if len(res) == 0 or res[-1][1] != nums[i]:\\n if target - nums[i] in s:\\n res.append([target - nums[i], nums[i]])\\n s.add(nums[i])\\n # print(res)\\n return res\\n \\n nums.sort()\\n x =ksum(nums,target,4)\\n # print(x)\\n return x\",\n \"runtime\": \"584\"\n },\n {\n \"code\": \"from collections import defaultdict, Counter\\nclass Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n i, n = 0, len(nums)\\n results = []\\n while i < n-3:\\n j = i + 1\\n while j < n-2:\\n l, r = j+1, n-1\\n while l < r:\\n s = nums[i] + nums[j] + nums[l] + nums[r]\\n if s < target:\\n l += 1\\n while l < r and nums[l] == nums[l-1]:\\n l += 1\\n elif s > target:\\n r -= 1\\n while l < r and nums[r] == nums[r+1]:\\n r -= 1\\n else:\\n results.append([nums[i], nums[j], nums[l], nums[r]])\\n l += 1\\n r -= 1\\n while l < r and nums[r] == nums[r+1]:\\n r -=1\\n while l < r and nums[l] == nums[l-1]:\\n l += 1\\n j += 1\\n while j < n-2 and nums[j] == nums[j-1]:\\n j += 1\\n i += 1\\n while i<n-3 and nums[i] == nums[i-1]:\\n i += 1\\n return results\\n\\n\\n return result\\n \\n \",\n \"runtime\": \"584\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n re = []\\n nums.sort()\\n ln = len(nums)\\n for i in range(ln):\\n for j in range(i + 1, ln):\\n left, right = j + 1, ln -1\\n while left < right:\\n s = nums[i] + nums[j] + nums[right] + nums[left]\\n if s == target:\\n lst = [nums[i], nums[j], nums[right], nums[left]]\\n if lst not in re:\\n re.append(lst)\\n\\n while right > left and nums[right] == nums[right - 1]:\\n right -= 1\\n while right > left and nums[left] == nums[left + 1]:\\n left += 1\\n\\n right -= 1\\n left += 1\\n\\n elif s > target:\\n right -= 1\\n else:\\n left += 1\\n return re\",\n \"runtime\": \"598\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n \\n nums.sort()\\n def two_sum(target, lst):\\n d = set()\\n out = []\\n dup = set()\\n for i in lst:\\n if i * 2 == target:\\n if i in d:\\n dup.add(i)\\n else:\\n d.add(i)\\n else:\\n if i in d:\\n continue\\n if target - i in d:\\n out.append([target-i, i])\\n d.add(i)\\n for i in dup:\\n out.append([i,i])\\n return out\\n\\n l = len(nums)\\n out = []\\n d = collections.defaultdict(set)\\n for i in range(l-3):\\n for j in range(i+1,l-2):\\n a,b = nums[i], nums[j]\\n if b in d[a]:\\n continue\\n d[a].add(b)\\n for k in two_sum(target-a-b, nums[j+1:]):\\n out.append([a,b] + k)\\n return out\",\n \"runtime\": \"598\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n=len(nums)\\n nums.sort()\\n result=set()\\n for i in range(n-3):\\n for j in range(i+1,n-2):\\n l=j+1\\n r=n-1\\n while (l<r):\\n add=nums[i]+nums[j]+nums[l]+nums[r]\\n if add==target:\\n result.add((nums[i],nums[j],nums[l],nums[r]))\\n l+=1\\n r-=1\\n elif add<target:\\n l+=1\\n else:\\n r-=1\\n result=list(result)\\n return result\",\n \"runtime\": \"611\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n res=set()\\n n=len(nums)\\n nums.sort()\\n for i in range(n-3):\\n for j in range(i+1,n-2):\\n left,right=j+1,n-1\\n while left<right:\\n sum=nums[i]+nums[j]+nums[left]+nums[right]\\n if sum==target:\\n res.add((nums[i],nums[j],nums[left],nums[right]))\\n left+=1\\n right-=1\\n elif sum<target:\\n left+=1\\n else:\\n right-=1\\n result=[list(fours) for fours in res] \\n return result \",\n \"runtime\": \"611\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.nums, self.result, self.len = None, set(), 0\\n\\n \\n def twoSum(self, start, target, idxList):\\n left, right = start, self.len - 1\\n\\n while left < right:\\n total = self.nums[left] + self.nums[right]\\n\\n if total == target:\\n res = (self.nums[idxList[0]], self.nums[idxList[1]], self.nums[left] ,self.nums[right])\\n self.result.add(res)\\n \\n if total > target:\\n right -= 1\\n else:\\n left += 1\\n\\n \\n def threeSum(self, start, target, idxList):\\n for idx, num in enumerate(self.nums[start:-2]):\\n self.twoSum(start + idx + 1, target - num, idxList + [start + idx])\\n\\n\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n self.nums, self.len = nums, len(nums)\\n nums.sort()\\n\\n for idx, num in enumerate(nums[:-3]):\\n self.threeSum(idx + 1, target - num, [idx])\\n\\n return self.result\\n \",\n \"runtime\": \"651\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n if len(nums) < 4:\\n return []\\n\\n nums.sort()\\n n = len(nums)\\n results = []\\n i = 0\\n while i < n - 3:\\n j = i + 1\\n while j < n - 2:\\n l = j+1\\n r = n-1\\n while l < r:\\n total = nums[i] + nums[j] + nums[l] + nums[r]\\n if total == target:\\n results.append([nums[i], nums[j], nums[l], nums[r]])\\n if total <= target:\\n prev = nums[l]\\n while l < n and nums[l] == prev:\\n l += 1\\n else:\\n prev = nums[r]\\n while r >= 0 and nums[r] == prev:\\n r -= 1\\n prev = nums[j]\\n while j < n and nums[j] == prev:\\n j += 1\\n prev = nums[i]\\n while i < n and nums[i] == prev:\\n i += 1\\n return results\\n\\n\\n \",\n \"runtime\": \"651\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n = len(nums)\\n nums.sort()\\n ans = []\\n res = set()\\n for i in range(n):\\n for j in range(i+1,n):\\n k = j+1\\n l = n-1\\n while k<l:\\n sum = nums[i]+nums[j]+nums[k]+nums[l]\\n if sum == target:\\n temp = [nums[i],nums[j],nums[k],nums[l]]\\n res.add(tuple(temp))\\n k += 1\\n l -= 1\\n elif sum<target:\\n k += 1\\n elif sum>target:\\n l -= 1\\n ans = list(res)\\n return ans\\n \\n \\n \\n \",\n \"runtime\": \"665\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums = sorted(nums)\\n len_nums = len(nums)\\n ans = set()\\n for a in range(len_nums):\\n for b in range(a+1, len_nums):\\n c, d = b+1, len_nums - 1\\n while c < d:\\n curr = nums[a] + nums[b] + nums[c] + nums[d]\\n\\n if curr < target:\\n c += 1\\n elif curr > target:\\n d -= 1\\n else:\\n ans.add((nums[a], nums[b], nums[c], nums[d]))\\n c += 1\\n return list(ans)\",\n \"runtime\": \"665\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n t=[]\\n for i in range(len(nums)):\\n if i>0 and nums[i]==nums[i-1]:\\n continue\\n for j in range(i+1,len(nums)):\\n if j>i+1 and nums[j]==nums[j-1]:\\n continue\\n l=j+1\\n r=len(nums)-1\\n while l<r:\\n s=nums[i]+nums[j]+nums[l]+nums[r]\\n a=[nums[i],nums[j],nums[l],nums[r]]\\n if s==target:\\n \\n t.append(a)\\n l+=1\\n r-=1\\n while l<r and nums[l]==nums[l-1]:\\n l+=1\\n while l<r and nums[r]==nums[r+1]:\\n r-=1\\n elif s<target:\\n l+=1\\n else:\\n r-=1\\n return t\\n \",\n \"runtime\": \"678\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n n = len(nums)\\n if n < 4:\\n return []\\n\\n n = len(nums)\\n quadruplets = [] \\n seen = set()\\n for i in range(n):\\n for j in range(i+1,n):\\n left,right = j+1,n-1\\n cnt_target = target - nums[i] - nums[j]\\n while left<right:\\n if nums[left] + nums[right] == cnt_target and tuple([nums[i],nums[j],nums[left],nums[right]]) not in seen:\\n quadruplets.append([nums[i],nums[j],nums[left],nums[right]])\\n seen.add(tuple([nums[i],nums[j],nums[left],nums[right]]))\\n left+=1\\n right-=1\\n elif nums[left] + nums[right]<cnt_target:\\n left+=1\\n else:\\n right-=1\\n return quadruplets\",\n \"runtime\": \"678\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n ans = set()\\n\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n\\n for j in range(i + 1, len(nums)-2):\\n k = j + 1\\n m = len(nums) - 1\\n while k < m:\\n if nums[i] + nums[j] + nums[k] + nums[m] == target:\\n ans.add((nums[i], nums[j], nums[k], nums[m]))\\n k += 1\\n m -= 1\\n elif nums[i] + nums[j] + nums[k] + nums[m] < target:\\n k += 1\\n else:\\n m -= 1\\n return ans\\n\\n\",\n \"runtime\": \"691\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n allSums=[]\\n length=len(nums)\\n\\n for x in range(length-3):\\n if x>0 and nums[x]==nums[x-1]: #to avoid repeating values\\n continue\\n for i in range(x+1,length-2):\\n if i>x+1 and nums[i]==nums[i-1]: #to avoid repeating values\\n continue\\n \\n ptr1=i+1\\n ptr2=len(nums)-1\\n while ptr1<ptr2: \\n\\n if nums[i]+nums[ptr1]+nums[ptr2]+nums[x]==target: \\n oneSum=[nums[x],nums[i],nums[ptr1],nums[ptr2]]\\n allSums.append(oneSum)\\n ptr1=ptr1+1\\n while nums[ptr1]==nums[ptr1-1] and ptr1<ptr2:\\n ptr1=ptr1+1\\n elif nums[i]+nums[ptr1]+nums[ptr2]+nums[x]<target:\\n ptr1=ptr1+1\\n else:\\n ptr2=ptr2-1\\n return allSums \\n\\n\",\n \"runtime\": \"691\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n ans = set()\\n n = len(nums)\\n nums.sort()\\n\\n for i in range(n):\\n for j in range(i+1, n):\\n k = j + 1\\n l = n - 1\\n\\n while k < l:\\n sums = nums[i] + nums[j] + nums[k] + nums[l]\\n if sums == target:\\n ans.add((nums[i],nums[j],nums[k],nums[l]))\\n k += 1\\n elif sums < target:\\n k += 1\\n else:\\n l -= 1\\n return ans\",\n \"runtime\": \"705\"\n },\n {\n \"code\": \"#use hashmap to store the sum of two elements as the value, the sum as the key.\\n#for each value under the key, we stored it in the hashset. \\n#then loop all keys in the hashmap to see if thye sume of two keys are the target and recor dthew corresponding values(two sets)\\nclass Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n if nums == [2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2]:\\n return [ [2,2,2,2] ]\\n if len(nums) <4:\\n return None\\n #initalization:\\n # #avoid duplicate; always small to larger!\\n # nums.sort()\\n #create a hashmap!\\n hashmap = {}\\n for i in range(len(nums)):\\n for j in range(i+1,len(nums)):\\n if nums[i]+nums[j] not in hashmap:\\n hashmap[nums[i]+nums[j]] = set()\\n hashmap[nums[i]+nums[j]].add((i,j))\\n #extract all keys:\\n #print(hashmap)\\n keys = list(hashmap.keys())\\n res = set()\\n #print(keys)\\n #check all keys:\\n for key in keys:\\n if key in hashmap and target-key in hashmap:\\n #check every possible pairs:\\n sets1 = list(hashmap[key])\\n sets2 = list(hashmap[target-key])\\n for i in range(len(sets1)):\\n for j in range(len(sets2)):\\n if len(set(sets1[i]+sets2[j])) == 4:\\n ii,jj = sets1[i]\\n kk,zz = sets2[j]\\n res.add( tuple(sorted([nums[ii],nums[jj],nums[kk],nums[zz]])) )\\n return list(res)\\n\\n#method 2: loop & two pointer!\\nclass Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n #sort the array: to help with the duplicates and two pointer:\\n nums.sort()\\n res = []\\n #traverse the array:\\n #the first element:\\n for i in range(len(nums)):\\n #skip the duplicate for the first element:\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n #second elment:\\n for j in range(i+1,len(nums)-4+2):\\n #skip the second elment if we have duplicates:\\n if j > i+1 and nums[j] == nums[j-1]:\\n continue\\n #last two elements:\\n l,r = j+1,len(nums)-1\\n while l < r:\\n if nums[l]+nums[r]+ nums[i]+nums[j] == target:\\n res.append([nums[i],nums[j],nums[l],nums[r]])\\n #update pointer:\\n #left:\\n l += 1\\n while l < r and nums[l] == nums[l-1]:\\n l += 1\\n #right:\\n r -= 1\\n while r >l and nums[r] == nums[r+1]:\\n r -= 1\\n elif nums[l]+nums[r]+ nums[i]+nums[j] < target:\\n l += 1\\n else:\\n r -= 1\\n return res\\n\\n\\n\",\n \"runtime\": \"705\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n \\n \\\"\\\"\\\"\\n First I thing in a n^3 solution in time and n memory solution\\n\\n i do triple nested loop , make the sume and next i check if exit -sum\\n\\n \\\"\\\"\\\"\\n\\n output = []\\n\\n #1: sort array\\n nums = sorted(nums)\\n memo = {}\\n used = {}\\n n = len(nums)\\n #2: memorize the position of the nums\\n for i in range(n):\\n memo[nums[i]] = i\\n\\n #3: nested loop\\n\\n for i in range(n):\\n for j in range(i+1,n):\\n for k in range(j+1,n):\\n\\n sum = target - (nums[i] + nums[j] + nums[k]) \\n #print(sum,nums[i],nums[j],nums[k],target)\\n #4: validate and append num\\n if sum in memo and memo[sum]>k and not (nums[i],nums[j],nums[k],sum)in used:\\n #print(\\\"xx\\\")\\n used[(nums[i],nums[j],nums[k],sum)] = True\\n output.append([nums[i],nums[j],nums[k],sum])\\n\\n \\n\\n return output\\n\",\n \"runtime\": \"718\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n list1=[]\\n for i in range(len(nums)):\\n if i>0 and nums[i]==nums[i-1]:\\n continue\\n for j in range(i+1,len(nums)):\\n if j>i+1 and nums[j]==nums[j-1]:\\n continue\\n k=j+1\\n l=len(nums)-1\\n while(k<l):\\n if(nums[i]+nums[j]+nums[k]+nums[l]==target):\\n a=[]\\n a.append(nums[i])\\n a.append(nums[j])\\n a.append(nums[k])\\n a.append(nums[l])\\n list1.append(a)\\n k+=1\\n l-=1\\n while(k<l and nums[k]==nums[k-1]):\\n k=k+1\\n while(k<l and nums[l]==nums[l+1]):\\n l=l-1\\n elif nums[i]+nums[j]+nums[k]+nums[l]>target:\\n l-=1\\n else:\\n k+=1\\n return list1\\n\\n \",\n \"runtime\": \"718\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n = len(nums)\\n nums.sort()\\n res=[]\\n s=set()\\n for i in range(n-3):\\n for j in range(i+1,n-1):\\n k=j+1\\n l=n-1\\n while k<l:\\n total = nums[i]+nums[j]+nums[k]+nums[l]\\n if total < target:\\n k=k+1\\n if total > target:\\n l=l-1\\n if total==target:\\n s.add((nums[i],nums[j],nums[k],nums[l]))\\n k=k+1\\n l=l-1\\n while k<n and nums[k]==nums[k-1]:\\n k=k+1\\n while l>0 and nums[l]==nums[l+1]:\\n l=l-1\\n res = list(s)\\n return res\",\n \"runtime\": \"732\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n result = []\\n nums.sort()\\n for i in range(len(nums) - 3):\\n for j in range(i + 1, len(nums) - 2):\\n k = j + 1\\n l = len(nums) - 1\\n while k < l:\\n total = nums[i] + nums[j] + nums[k] + nums[l]\\n if total == target:\\n if ([nums[i], nums[j], nums[k], nums[l]] not in result):\\n result.append([nums[i], nums[j], nums[k], nums[l]])\\n k += 1\\n elif total < target:\\n k += 1\\n elif total > target:\\n l -= 1\\n return result\\n \",\n \"runtime\": \"732\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n if len(nums) < 4:\\n return []\\n \\n nums.sort()\\n result = set()\\n \\n for i in range(len(nums) - 3):\\n for j in range(i + 1, len(nums) - 2):\\n now = nums[i] + nums[j]\\n l = j + 1\\n r = len(nums) - 1\\n while l < r:\\n if nums[l] + nums[r] + now == target:\\n if (nums[i], nums[j], nums[l], nums[r]) not in result:\\n result.add((nums[i], nums[j], nums[l], nums[r]))\\n if nums[l] + nums[r] + now > target:\\n r -= 1\\n else:\\n l += 1\\n \\n return list(result)\",\n \"runtime\": \"745\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n res = []\\n nums.sort()\\n second, s, e = None, None, None\\n for i in range(0, len(nums) - 3):\\n second = i + 1\\n while second < len(nums) - 2:\\n s = second + 1\\n e = len(nums) - 1\\n while s < e:\\n sum = nums[i] + nums[second] + nums[s] + nums[e]\\n if sum == target:\\n if not [nums[i], nums[second], nums[s], nums[e]] in res:\\n res.append([nums[i], nums[second], nums[s], nums[e]])\\n if sum > target:\\n e-=1\\n else:\\n s+=1\\n second+=1\\n return res\\n \\n \",\n \"runtime\": \"745\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nNaive approach\\n\\n> Try all combinations until you find one that sums to target\\n\\n[1,2,3,4,5]\\n^ ^ ^l ^r\\nadjust l, r till a+b+l+r == target\\n- none found\\n- incr b\\n\\n- when b reaches end - 1\\n> increment a and start again\\n\\nTime complexity:\\n\\nO(n^2 * n * nlogn) => O(n^3logn)\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n = len(nums)\\n quadruplets = []\\n\\n # Sort the array\\n nums.sort()\\n for a in range(n-1):\\n for b in range(a+1, n-2):\\n left = b+1\\n right = n-1\\n while left < right:\\n total = nums[a] + nums[b] + nums[left] + nums[right]\\n if total == target:\\n entry = [nums[a], nums[b], nums[left], nums[right]]\\n if entry not in quadruplets:\\n quadruplets.append([nums[a], nums[b], nums[left], nums[right]])\\n \\n if total < target:\\n left += 1\\n else:\\n right -= 1\\n \\n return quadruplets\",\n \"runtime\": \"758\"\n },\n {\n \"code\": \"import sys\\nclass Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n quads = set()\\n nums.sort()\\n n = len(nums)\\n for i in range(n-3):\\n for j in range(i+1, n-2):\\n l, r = j+1, n-1\\n while l < r:\\n curr_sum = nums[i] + nums[j] + nums[l] + nums[r]\\n\\n if curr_sum < target:\\n l += 1\\n elif curr_sum > target:\\n r -= 1\\n else:\\n quads.add((nums[i], nums[j], nums[l], nums[r]))\\n l += 1\\n return [list(q) for q in quads]\",\n \"runtime\": \"758\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n ans = []\\n if len(nums) < 4:\\n return ans\\n nums.sort()\\n for i in range(len(nums)-3):\\n for j in range(i+1, len(nums)-2):\\n l, r = j+1, len(nums)-1\\n while l < r:\\n s = nums[i] + nums[j] + nums[l] + nums[r]\\n if s == target:\\n m = [nums[i], nums[j], nums[l], nums[r]]\\n if m not in ans:\\n ans.append(m)\\n if s <= target:\\n l += 1\\n elif s > target:\\n r -= 1\\n return ans\",\n \"runtime\": \"772\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n res=set()\\n n=len(nums)\\n nums.sort()\\n for i in range(n-3):\\n for j in range(i+1,n-2):\\n l, r = j + 1, len(nums) - 1\\n while l < r:\\n s = nums[i] + nums[l] + nums[r] + nums[j]\\n if s == target:\\n res.add((nums[i],nums[j], nums[l], nums[r]))\\n l += 1\\n r -= 1\\n while l < r and nums[l] == nums[l - 1]:\\n l += 1\\n while l < r and nums[r] == nums[r + 1]:\\n r -= 1\\n elif s < target:\\n l += 1\\n elif s > target:\\n r -= 1\\n return [list(triplet) for triplet in res]\\n \",\n \"runtime\": \"772\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n l=[]\\n for i in range(len(nums)):\\n for j in range(i+1,len(nums)):\\n current_sum=nums[i]+nums[j]\\n left=j+1\\n right=len(nums)-1\\n while left<right:\\n if nums[left]+nums[right]==target-current_sum:\\n if [nums[i],nums[j],nums[left],nums[right]] not in l:\\n l.append([nums[i],nums[j],nums[left],nums[right]])\\n\\n if nums[left]+nums[right]>target-current_sum:\\n right-=1\\n else:\\n left+=1\\n return l\",\n \"runtime\": \"785\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n # nums.sort()\\n # res, quad = [] , []\\n\\n # def kSum(k, start, target):\\n # if k != 2 :\\n # for i in range(start,len(nums)-k+1):\\n # if i > start and nums[i] == nums[i-1]:\\n # continue\\n # quad.append(nums[i])\\n # kSum(k-1, i+1, target-nums[i])\\n # quad.pop()\\n # return\\n \\n \\n # l , r = start, len(nums) - 1\\n # while l < r:\\n # if nums[l] + nums[r] > target:\\n # r -= 1\\n # elif nums[l] + nums[r] < target:\\n # l += 1\\n # else:\\n # res.append(quad + [nums[l], nums[r]])\\n # l += 1\\n # while nums[l] == nums[l-1] and l < r:\\n # l += 1\\n \\n # kSum(4,0,target)\\n # return res \\n\\n #抄的solutions\\n nums.sort()\\n s = set()\\n for i in range(len(nums)):\\n for j in range(i+1,len(nums)):\\n l = j+1\\n r = len(nums)-1\\n while l<r:\\n if nums[i] + nums[j] + nums[l] + nums[r]<target:\\n l+=1\\n elif nums[i] + nums[j] + nums[l] + nums[r]>target:\\n r-=1\\n elif nums[i] + nums[j] + nums[l] + nums[r]==target:\\n s.add((nums[i],nums[j],nums[l],nums[r]))\\n l+=1\\n r-=1\\n return s\\n\\n\",\n \"runtime\": \"785\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n values_from_prefix = set()\\n n = len(nums)\\n quadruplets = set()\\n\\n for i in range(n):\\n for j in range(i + 1, n):\\n for k in range(j + 1, n):\\n remainder = target - nums[i] - nums[j] - nums[k]\\n if remainder in values_from_prefix:\\n quadruplet = tuple(sorted([remainder, nums[i], nums[j], nums[k]]))\\n quadruplets.add(quadruplet)\\n values_from_prefix.add(nums[i])\\n\\n results = [list(quadruplet) for quadruplet in quadruplets]\\n\\n return results\",\n \"runtime\": \"799\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n nums_len = len(nums)\\n quad_list = []\\n for i in range(nums_len-3):\\n if nums[i] == nums[i-1] and i>0:\\n continue\\n\\n target_3sum = target - nums[i]\\n for j in range(i+1, nums_len-2):\\n \\n if nums[j]==nums[j-1] and j-1>i:\\n continue\\n k = j + 1\\n mem = {}\\n while k < nums_len:\\n if nums[k] == nums[k-1] == nums[k-2] and k-2>j:\\n k+=1\\n continue\\n diff = target_3sum - nums[j] - nums[k]\\n if diff in mem:\\n quad_list.append([nums[i], nums[j], nums[k], diff])\\n mem.pop(diff)\\n k += 1\\n continue\\n else:\\n mem[nums[k]] = k\\n k += 1\\n continue\\n return quad_list\\n\\n \",\n \"runtime\": \"799\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n def twosum(lowbound,t):\\n seen = set()\\n viable = []\\n for k in range(lowbound,len(nums)):\\n c = nums[k]\\n if t-c in seen:\\n viable.append((t-c,c))\\n seen.add(c)\\n return viable\\n\\n ans = set()\\n nums.sort()\\n for i in range(len(nums)-3):\\n a = nums[i]\\n for j in range(i+1,len(nums)-2):\\n b = nums[j]\\n ans.update((a,b,c,d) for c,d in twosum(j+1,target-nums[i]-nums[j]))\\n return ans\\n\\n \\n \",\n \"runtime\": \"812\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n def twosum(lowbound,t):\\n seen = set()\\n viable = []\\n for k in range(lowbound,len(nums)):\\n c = nums[k]\\n if t-c in seen:\\n viable.append((t-c,c))\\n seen.add(c)\\n return viable\\n\\n ans = set()\\n nums.sort()\\n for i in range(len(nums)-3):\\n a = nums[i]\\n for j in range(i+1,len(nums)-2):\\n b = nums[j]\\n ans.update((a,b,c,d) for c,d in twosum(j+1,target-nums[i]-nums[j]))\\n return ans\\n\\n \\n \",\n \"runtime\": \"812\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res = []\\n for i in range(len(nums)):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n for j in range(i+1, len(nums)):\\n if j> i+1 and nums[j] == nums[j-1]:\\n continue\\n print(nums[i],nums[j])\\n self.twoSum( nums[j+1:], target-nums[i]-nums[j], res,nums[i] , nums[j]) \\n return res\\n\\n def twoSum(self, nums, target, res, num1, num2):\\n left, right = 0, len(nums)-1\\n while left < right:\\n if left > 0 and nums[left] == nums[left-1]:\\n left +=1\\n continue\\n if right < len(nums) - 1 and nums[right] == nums[right+1]:\\n right -= 1\\n continue\\n if nums[left] + nums[right] == target:\\n res.append([num1,num2, nums[left], nums[right]])\\n left += 1\\n right -= 1\\n elif nums[left] + nums[right] < target:\\n left += 1\\n elif nums[left] + nums[right] > target:\\n right -= 1 \\n \\n\\n \\n\\n \",\n \"runtime\": \"825\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n\\n res = []\\n n = len(nums)\\n if n < 4:\\n return res\\n a = 0\\n while a < n - 3:\\n b = a + 1\\n while b < n - 2:\\n c = b + 1\\n d = n - 1\\n while c < d:\\n if nums[a] + nums[b] + nums[c] + nums[d] == target:\\n res.append([nums[a], nums[b], nums[c], nums[d]])\\n c += 1\\n while c < d and nums[c] == nums[c - 1]:\\n c += 1\\n elif nums[a] + nums[b] + nums[c] + nums[d] < target:\\n c += 1\\n while c < d and nums[c] == nums[c - 1]:\\n c += 1\\n else:\\n d -= 1\\n while c < d and nums[d] == nums[d + 1]:\\n d -= 1\\n b += 1\\n while b < n - 2 and nums[b] == nums[b - 1]:\\n b += 1\\n a += 1\\n while a < n - 3 and nums[a] == nums[a - 1]:\\n a += 1\\n return res\\n \",\n \"runtime\": \"825\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n = len(nums)\\n res = []\\n nums.sort()\\n\\n for a in range(n):\\n if a > 0 and nums[a - 1] == nums[a]:\\n continue \\n for b in range(a + 1, n):\\n if b > a + 1 and nums[b - 1] == nums[b]:\\n continue\\n tot = nums[a] + nums[b]\\n right = n - 1\\n left = b + 1\\n while left < right:\\n while right >= 0 and right < n - 1 and nums[right] == nums[right + 1]:\\n right -= 1\\n while left < n and left > b + 1 and nums[left] == nums[left - 1]:\\n left += 1\\n if left < right and tot + nums[right] + nums[left] == target:\\n res.append([nums[a], nums[b], nums[left], nums[right]])\\n left += 1\\n right -= 1\\n elif left < right and tot + nums[right] + nums[left] > target:\\n right -= 1\\n else:\\n left += 1\\n\\n return res\",\n \"runtime\": \"839\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n values_from_prefix = set()\\n n = len(nums)\\n quadruplets = set()\\n\\n for i in range(n):\\n for j in range(i + 1, n):\\n for k in range(j + 1, n):\\n remainder = target - nums[i] - nums[j] - nums[k]\\n if remainder in values_from_prefix:\\n quadruplet = tuple(sorted([remainder, nums[i], nums[j], nums[k]]))\\n quadruplets.add(quadruplet)\\n values_from_prefix.add(nums[i])\\n\\n quadruplets = [list(quadruplet) for quadruplet in quadruplets]\\n\\n return quadruplets\",\n \"runtime\": \"839\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res = set()\\n for i in range(len(nums)-3):\\n for j in range(i+1,len(nums)-2):\\n m = j+1\\n n = len(nums) - 1\\n while m < n:\\n if nums[m] + nums[n] == target - (nums[i] + nums[j]):\\n res.add((nums[i],nums[j],nums[m],nums[n]))\\n m+=1\\n n-=1\\n elif target - (nums[i] + nums[j]) > (nums[m] + nums[n]):\\n m+=1\\n else:\\n n-=1\\n \\n return [list(t) for t in res]\\n\\n \",\n \"runtime\": \"852\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res = []\\n for a in range(len(nums)-3):\\n for b in range(a+1, len(nums)-2):\\n c = b + 1\\n d = len(nums) - 1\\n\\n while c < d:\\n if nums[a] + nums[b] + nums[c] + nums[d] == target:\\n res.append((nums[a], nums[b], nums[c], nums[d]))\\n c += 1\\n d -= 1\\n elif nums[a] + nums[b] + nums[c] + nums[d] > target:\\n d -= 1\\n else:\\n c += 1\\n \\n return list(set(res))\\n\",\n \"runtime\": \"852\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res = []\\n for a in range(len(nums)-3):\\n for b in range(a+1, len(nums)-2):\\n c = b + 1\\n d = len(nums) - 1\\n\\n while c < d:\\n if nums[a] + nums[b] + nums[c] + nums[d] == target:\\n res.append((nums[a], nums[b], nums[c], nums[d]))\\n c += 1\\n d -= 1\\n elif nums[a] + nums[b] + nums[c] + nums[d] > target:\\n d -= 1\\n else:\\n c += 1\\n \\n return list(set(res))\\n\",\n \"runtime\": \"866\"\n },\n {\n \"code\": \"class Solution(object):\\n def fourSum(self, nums, target):\\n output=[]\\n if len(nums)>=4:\\n nums=sorted(nums)\\n for i in range(len(nums)-3):\\n for j in range(i+1, len(nums)-2):\\n head=j+1\\n tail=len(nums)-1\\n while tail>head:\\n if nums[i]+nums[j]+nums[head]+nums[tail]==target:\\n if [nums[i],nums[j],nums[head],nums[tail]] not in output:\\n output.append([nums[i],nums[j],nums[head],nums[tail]])\\n head+=1\\n tail-=1\\n elif nums[i]+nums[j]+nums[head]+nums[tail]>target:\\n tail-=1\\n else:\\n head+=1\\n \\n \\n \\n return output\\n \",\n \"runtime\": \"866\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n\\n quadruplets = []\\n nums.sort()\\n for i,num1 in enumerate(nums):\\n if not (i != 0 and nums[i] == nums[i-1]):\\n for j in range(i+1,len(nums)):\\n if not (j != (i+1) and nums[j] == nums[j-1]):\\n left = j + 1\\n right = len(nums)-1\\n print(\\\"left : \\\", left, \\\"j : \\\", j)\\n while left < right:\\n\\n if nums[left] + nums[right] + num1 + nums[j] == target:\\n quadruplets.append([nums[left],nums[right],num1,nums[j]])\\n left = left + 1\\n while left < len(nums) and nums[left] == nums[left-1]:\\n left = left + 1\\n continue\\n if nums[left] + nums[right] + num1 + nums[j] < target:\\n left = left + 1\\n continue\\n if nums[left] + nums[right] + num1 + nums[j] > target:\\n right = right - 1\\n return quadruplets\\n \\n \\n \\n \\n\\n \\n\\n\\n \",\n \"runtime\": \"879\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n ans = set()\\n n = len(nums)\\n nums.sort()\\n\\n for i in range(n):\\n for j in range(i+1, n):\\n k = j + 1\\n l = n - 1\\n\\n while k < l:\\n sums = nums[i] + nums[j] + nums[k] + nums[l]\\n if sums == target:\\n ans.add(tuple(sorted((nums[i], nums[j], nums[k], nums[l]))))\\n k += 1\\n elif sums < target:\\n k += 1\\n else:\\n l -= 1\\n return ans\",\n \"runtime\": \"879\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n \\n # optimized solution to be O(n^3)\\n quads = set()\\n n = len(nums)\\n for a in range(n - 3):\\n for b in range(a + 1, n - 2):\\n # start two pointer here at the 3rd index\\n left = b + 1\\n right = n - 1\\n while left < right:\\n if nums[a] + nums[b] + nums[left] + nums[right] > target:\\n right -= 1\\n elif nums[a] + nums[b] + nums[left] + nums[right] < target:\\n left += 1\\n else: # they equal target, add the quadruplet to the asnwer set\\n quads.add((nums[a], nums[b], nums[left], nums[right]))\\n left += 1\\n return list(quads)\",\n \"runtime\": \"892\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n res = []\\n a = 0\\n nums = sorted(nums)\\n while a < len(nums):\\n b = a + 1\\n while b < len(nums):\\n c = b + 1\\n d = len(nums)-1\\n while c < d:\\n total = nums[a] + nums[b] + nums[c] + nums[d]\\n if total > target:\\n d-=1\\n if total < target:\\n c+=1\\n if total == target:\\n if sorted([nums[a] ,nums[b] ,nums[c] , nums[d]]) not in res:\\n res.append(sorted([nums[a] ,nums[b] ,nums[c] , nums[d]]))\\n # print(a,b,c,d)\\n c+=1\\n b+=1\\n a+=1\\n return res\",\n \"runtime\": \"892\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n = len(nums)\\n res = set()\\n nums.sort()\\n def twoSum(j, target):\\n dic = {}\\n res = []\\n for i in range(j, n):\\n if target - nums[i] in dic:\\n res.append((nums[i], target - nums[i]))\\n dic[nums[i]] = i\\n return res\\n\\n\\n for i in range(n):\\n for j in range(i + 1, n):\\n tmp = twoSum(j + 1, target - nums[i] - nums[j])\\n for op in tmp:\\n res.add((nums[i], nums[j], *op))\\n\\n return res\\n\",\n \"runtime\": \"906\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n if len(nums) < 4:\\n return []\\n nums = sorted(nums)\\n res = set()\\n for p1 in range(len(nums) - 3):\\n for p2 in range(p1+1, len(nums) - 2):\\n p4 = len(nums) - 1\\n p3 = p4 - 1\\n max_sum = sum([nums[x] for x in [p1, p2, p3, p4]])\\n p3 = p2 + 1\\n p4 = p3 + 1\\n min_sum = sum([nums[x] for x in [p1, p2, p3, p4]])\\n if min_sum <= target and max_sum >= target:\\n p3 = p2 + 1\\n p4 = len(nums) - 1\\n while p3 < p4:\\n candidate = [nums[x] for x in [p1, p2, p3, p4]]\\n cand_sum = sum(candidate)\\n if cand_sum == target and tuple(candidate) not in res:\\n res.add(tuple(candidate))\\n if cand_sum > target:\\n p4 -= 1\\n else:\\n p3 += 1\\n return res\",\n \"runtime\": \"906\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res = set()\\n for i in range(len(nums)):\\n for j in range(i + 1, len(nums)):\\n aim = target - nums[i] - nums[j]\\n seen = set()\\n for k in range(j + 1, len(nums)):\\n if aim - nums[k] in seen:\\n res.add(tuple(sorted([nums[i], nums[j], aim - nums[k], nums[k]])))\\n seen.add(nums[k])\\n \\n return res\\n\\n\\n\\n \",\n \"runtime\": \"919\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n res = []\\n length = len(nums)\\n nums = sorted(nums)\\n\\n last_i = \\\"nan\\\"\\n last_j = \\\"nan\\\"\\n\\n for i in range(length):\\n if last_i == nums[i]:\\n continue\\n \\n last_i = nums[i]\\n last_j = \\\"nan\\\"\\n for j in range(length):\\n if i >= j or last_j == nums[j]:\\n continue\\n else:\\n last_j = nums[j]\\n k = j+1\\n l = length - 1\\n\\n while k < l:\\n cand = [nums[i], nums[j], nums[k], nums[l]]\\n total = sum(cand)\\n\\n if total < target:\\n k += 1\\n while k < length and nums[k] == nums[k-1]:\\n k += 1\\n elif total > target:\\n l -= 1\\n while l > 0 and nums[l] == nums[l+1]:\\n l -= 1\\n else:\\n res.append(cand)\\n k += 1\\n while k < length and nums[k] == nums[k-1]:\\n k += 1\\n \\n return res\",\n \"runtime\": \"919\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n out = set()\\n nums.sort()\\n for i in range(len(nums)):\\n for j in range(i + 1, len(nums)):\\n f, l = j + 1, len(nums) - 1\\n while f < l:\\n if nums[i] + nums[j] + nums[f] + nums[l] == target:\\n out.add((nums[i], nums[j], nums[f], nums[l]))\\n f += 1\\n elif nums[i] + nums[j] + nums[f] + nums[l] < target:\\n f += 1\\n else:\\n l -= 1\\n return out\",\n \"runtime\": \"933\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n res = []\\n length = len(nums)\\n nums = sorted(nums)\\n\\n last_i = \\\"nan\\\"\\n last_j = \\\"nan\\\"\\n\\n for i in range(length):\\n if last_i == nums[i]:\\n continue\\n \\n last_i = nums[i]\\n last_j = \\\"nan\\\"\\n for j in range(length):\\n if i >= j or last_j == nums[j]:\\n continue\\n else:\\n last_j = nums[j]\\n k = j+1\\n l = length - 1\\n\\n while k < l:\\n cand = [nums[i], nums[j], nums[k], nums[l]]\\n total = sum(cand)\\n\\n if total < target:\\n k += 1\\n while k < l and nums[k] == nums[k-1]:\\n k += 1\\n elif total > target:\\n l -= 1\\n while k < l and nums[l] == nums[l+1]:\\n l -= 1\\n else:\\n res.append(cand)\\n k += 1\\n while k < l and nums[k] == nums[k-1]:\\n k += 1\\n \\n return res\",\n \"runtime\": \"933\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n=len(nums)\\n nums.sort()\\n print(nums)\\n res=[]\\n for i in range(0,n-3):\\n for j in range(i+1,n-2):\\n l=j+1\\n r=n-1\\n while(l<r):\\n if nums[i]+nums[j]+nums[l]+nums[r] == target:\\n if [nums[i],nums[j],nums[l], nums[r]] not in res:\\n res.append([nums[i],nums[j],nums[l], nums[r]])\\n l+=1\\n elif nums[i]+nums[j]+nums[l]+nums[r] > target:\\n r-=1\\n else:\\n l+=1\\n return res\\n\\n\\n\\n \\n\\n\\n \",\n \"runtime\": \"946\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res = set()\\n for i in range(len(nums)):\\n for j in range(i+1,len(nums)):\\n m = j+1\\n n = len(nums) - 1\\n while m < n:\\n if nums[m] + nums[n] == target - (nums[i] + nums[j]):\\n res.add((nums[i],nums[j],nums[m],nums[n]))\\n m+=1\\n elif target - (nums[i] + nums[j]) > (nums[m] + nums[n]):\\n m+=1\\n else:\\n n-=1\\n \\n return [list(t) for t in res]\\n\\n \",\n \"runtime\": \"946\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n mp ={}\\n nums.sort()\\n ans=set()\\n n=len(nums)\\n for i in range(n-2):\\n for j in range(i+1,n-1):\\n mp = {}\\n for k in range(j+1,n):\\n sum = nums[i]+nums[j]+nums[k]\\n if target-sum in mp:\\n ans.add((nums[i],nums[j],nums[k],target-sum))\\n \\n mp[nums[k]]=1\\n \\n return ans\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"959\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n qples=[]\\n for i in range(len(nums)):\\n # if i>0 and nums[i]==nums[i-1]:\\n # continue\\n for j in range(i+1,len(nums)):\\n # if j>i+1 and nums[j]==nums[j-1] :\\n # continue\\n ptr1 = j+1\\n ptr2 = len(nums)-1\\n while(ptr1<ptr2):\\n qple = [nums[i],nums[j],nums[ptr1],nums[ptr2]]\\n qsum = sum(qple)\\n if qsum<target:\\n ptr1+=1\\n elif qsum>target:\\n ptr2-=1\\n else:\\n if qple not in qples:\\n qples.append(qple)\\n ptr1+=1\\n ptr2-=1\\n # while ptr1<ptr2 and nums[ptr1]==nums[ptr2-1]:\\n # ptr1+=1\\n # while ptr1<ptr2 and nums[ptr1]==nums[ptr2+1]:\\n # pt2-=1\\n return qples\\n \",\n \"runtime\": \"959\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n i = 0\\n nums.sort()\\n result = []\\n while(i<len(nums)-3):\\n j=i+1\\n while(j<len(nums)-2):\\n existingnumber = nums[i] + nums[j]\\n left_ptr = j+1\\n right_ptr = len(nums)-1\\n while(left_ptr<right_ptr):\\n totalsum = existingnumber + nums[left_ptr] + nums[right_ptr]\\n if(totalsum==target):\\n result.append([nums[i],nums[j],nums[left_ptr],nums[right_ptr]])\\n left_ptr+=1\\n elif(totalsum<target):\\n left_ptr+=1\\n elif(totalsum>target):\\n right_ptr-=1\\n \\n j+=1\\n i+=1\\n \\n unique_result = []\\n result.sort()\\n for r in result:\\n if not unique_result or unique_result[-1]!=r:\\n unique_result.append(r)\\n return unique_result\\n \",\n \"runtime\": \"973\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n=len(nums)\\n \\n st=set()\\n total=0\\n for i in range(n):\\n for j in range(i+1,n):\\n hashset=set()\\n for k in range(j+1,n):\\n fourth=target-(nums[i]+nums[j]+nums[k])\\n \\n if fourth in hashset:\\n temp=[nums[i],nums[j],nums[k],fourth]\\n temp.sort()\\n st.add(tuple(temp))\\n else:\\n hashset.add(nums[k])\\n \\n \\n \\n \\n ans=[list(x) for x in st]\\n return ans\\n \",\n \"runtime\": \"973\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n # n = len(nums)\\n # nums.sort()\\n # ans = []\\n # for i in range(n):\\n # if i>0 and nums[i]==nums[i-1]:\\n # continue\\n # for j in range(i+1,n):\\n # if j!=i+1 and nums[j]==nums[j-1]:\\n # continue\\n # k = j+1\\n # l = n-1\\n # while k<l:\\n # s = nums[i] + nums[j] + nums[k] + nums[l]\\n # if s==target:\\n # ans.append([nums[i],nums[j],nums[k],nums[l]])\\n # k = k+1\\n # l = l-1\\n # while k<l and nums[k]==nums[k-1]:\\n # k = k+1\\n # while k<l and nums[l] == nums[l+1]:\\n # l = l-1\\n # elif s<target:\\n # k = k+1\\n # else:\\n # l = l-1\\n # return ans\\n\\n n = len(nums)\\n ans = []\\n for i in range(n):\\n for j in range(i+1,n):\\n temp = set()\\n for k in range(j+1,n):\\n fourth = target - (nums[i]+nums[j]+nums[k])\\n if fourth in temp:\\n quad = [nums[i],nums[j],nums[k],fourth]\\n quad.sort()\\n if quad not in ans:\\n ans.append(quad)\\n temp.add(nums[k])\\n return ans\",\n \"runtime\": \"986\"\n },\n {\n \"code\": \"# Better\\nclass Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n\\n arr=set()\\n nums.sort()\\n n=len(nums)\\n\\n for i in range(n):\\n for j in range(i+1,n):\\n # Take a hash set\\n hashset=set()\\n for k in range(j+1,n):\\n\\n sum=nums[i]+nums[j]+nums[k]\\n fourth=target-sum\\n # check if fourth elem exist in hashset\\n #if so add that to result ie arr\\n\\n if fourth in hashset:\\n temp=[nums[i],nums[j],nums[k],fourth]\\n arr.add(tuple(temp))\\n # at the end push the elem in hashset\\n hashset.add(nums[k])\\n\\n \\n return list(arr)\\n \\n\\n \\n\\n\\n\\n\\n \",\n \"runtime\": \"986\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n=len(nums)\\n myset=set()\\n ans=[]\\n for i in range(n):\\n for j in range(i+1,n):\\n st=set()\\n for k in range(j+1,n):\\n fourth=target-(nums[i]+nums[j]+nums[k])\\n if fourth in st:\\n temp=[nums[i],nums[j],nums[k],fourth]\\n temp.sort()\\n myset.add(tuple(temp))\\n st.add(nums[k]) \\n\\n for i in myset:\\n ans.append(list(i))\\n return ans \\n \",\n \"runtime\": \"1000\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n length = len(nums)\\n result = []\\n dup_check = set()\\n for a_idx in range(length-3):\\n a = nums[a_idx]\\n for b_idx in range(a_idx+2, length-1):\\n b = nums[b_idx]\\n left = b_idx-1\\n right = b_idx+1\\n while left > a_idx and right < length:\\n c = nums[left]\\n d = nums[right]\\n if a+b+c+d == target and tuple([a, b, c, d]) not in dup_check:\\n result.append([a,b,c,d])\\n dup_check.add(tuple([a,b,c,d]))\\n if a+b+c+d < target:\\n right += 1\\n else:\\n left -= 1\\n return result\",\n \"runtime\": \"1000\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n left = 0\\n right = len(nums) -1\\n result = set()\\n move = 0\\n\\n for i in range(len(nums) - 3):\\n for j in range(i + 3, len(nums)):\\n left = i + 1\\n right = j - 1\\n while left < right:\\n candidate = (nums[i], nums[left], nums[right], nums[j])\\n candidate_sum = sum(candidate)\\n if candidate_sum == target:\\n result.add(candidate)\\n left += 1\\n elif candidate_sum < target:\\n left += 1\\n else:\\n right -= 1\\n\\n\\n return list(result)\\n\",\n \"runtime\": \"1013\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n # #brute force solution:\\n # ans_set = set()\\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 # for l in range(k+1, len(nums)):\\n # sum = nums[i] + nums[j]\\n # sum += nums[k]\\n # sum += nums[l]\\n # if (sum == target):\\n # temp = [nums[i], nums[j], nums[k], nums[l] ]\\n # temp.sort()\\n # ans_set.add(tuple(temp))\\n\\n # ans = [list(x) for x in ans_set]\\n # return ans\\n\\n #better solution:\\n ans_set = set()\\n for i in range(len(nums)):\\n for j in range(i+1, len(nums)):\\n st = set()\\n for k in range(j+1, len(nums)):\\n sum = nums[i] + nums[j] + nums[k]\\n fourth = target - sum\\n if fourth in st:\\n temp = [nums[i], nums[j], nums[k], fourth]\\n temp.sort()\\n ans_set.add(tuple(temp))\\n \\n st.add(nums[k])\\n\\n ans = [list(x) for x in ans_set]\\n return ans\",\n \"runtime\": \"1013\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n ans = set()\\n n = len(nums)\\n\\n for i in range(n):\\n for j in range(i + 1, n):\\n hashm = set()\\n for k in range(j + 1, n):\\n fourth = target - (nums[i] + nums[j] + nums[k])\\n\\n if fourth in hashm:\\n temp = [nums[i], nums[j], nums[k], fourth]\\n temp.sort()\\n ans.add(tuple(temp))\\n \\n hashm.add(nums[k])\\n \\n ans = list(ans)\\n return ans\",\n \"runtime\": \"1026\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n=len(nums)\\n st = set()\\n\\n # checking all possible quadruplets:\\n for i in range(n):\\n for j in range(i+1, n):\\n hashset = set()\\n for k in range(j+1, n):\\n # taking bigger data type to avoid integer overflow:\\n sum_ = nums[i] + nums[j] + nums[k]\\n fourth = target - sum_\\n if fourth in hashset:\\n temp = [nums[i], nums[j], nums[k], fourth]\\n temp.sort()\\n st.add(tuple(temp))\\n # put the kth element into the hashset:\\n hashset.add(nums[k])\\n\\n ans = [list(t) for t in st]\\n return ans\\n \",\n \"runtime\": \"1026\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n set1=set()\\n if len(nums)<4:\\n return []\\n last=nums[-1]\\n n=len(nums)\\n if last==nums[0]:\\n if last*4==target:\\n return [[last,last,last,last]]\\n for id1 in range(n-3):\\n if nums[id1]*4>target:\\n break\\n if nums[id1]+3*last<target:\\n continue\\n for id2 in range(id1+1,n-2):\\n if nums[id1]+nums[id2]*3>target:\\n break\\n if nums[id1]+nums[id2]+2*last<target:\\n continue\\n for id3 in range(id2+1,n-1):\\n if nums[id1]+nums[id2]+nums[id3]*2>target:\\n break\\n if nums[id1]+nums[id2]+nums[id3]+last<target:\\n continue\\n for id4 in range(id3+1,n):\\n if nums[id1]+nums[id2]+nums[id3]+nums[id4]>target:\\n break\\n if nums[id1]+nums[id2]+nums[id3]+nums[id4]<target:\\n continue\\n set1.add((nums[id1],nums[id2],nums[id3],nums[id4]))\\n return set1\\n \",\n \"runtime\": \"1040\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n=len(nums)\\n se=set()\\n for i in range(n):\\n for j in range(i+1,n):\\n d=set()\\n for k in range(j+1,n):\\n s=nums[i]+nums[j]+nums[k]\\n l=target-s\\n if l in d:\\n temp=[nums[i],nums[j],nums[k],l]\\n temp.sort()\\n se.add(tuple(temp))\\n d.add(nums[k])\\n res=[]\\n for i in se:\\n a=list(i)\\n res.append(a)\\n return res\",\n \"runtime\": \"1040\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n if len(nums) < 4:\\n return []\\n nums = sorted(nums)\\n res = set()\\n for p1 in range(len(nums) - 3):\\n for p2 in range(p1+1, len(nums) - 2):\\n p4 = len(nums) - 1\\n p3 = p4 - 1\\n max_sum = sum([nums[x] for x in [p1, p2, p3, p4]])\\n p3 = p2 + 1\\n p4 = p3 + 1\\n min_sum = sum([nums[x] for x in [p1, p2, p3, p4]])\\n if min_sum <= target and max_sum >= target:\\n p3 = p2 + 1\\n p4 = len(nums) - 1\\n while p3 < p4:\\n candidate = tuple(nums[x] for x in [p1, p2, p3, p4])\\n if candidate not in res:\\n cand_sum = sum(candidate)\\n if cand_sum == target:\\n res.add(candidate)\\n if cand_sum > target:\\n p4 -= 1\\n else:\\n p3 += 1\\n return res\",\n \"runtime\": \"1080\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n \\n n=len(nums)\\n st=set()\\n ans=[]\\n for i in range(n):\\n for j in range(i+1,n):\\n hashset=set()\\n for k in range(j+1,n):\\n summ=nums[i]+nums[j]\\n summ+=nums[k]\\n fourth=target-summ\\n \\n if fourth in hashset:\\n temp=[nums[i],nums[j],nums[k],fourth]\\n temp.sort()\\n st.add(tuple(temp))\\n hashset.add(nums[k])\\n ans=[list(ans) for ans in st]\\n return ans\",\n \"runtime\": \"1080\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n a=[]\\n nums.sort()\\n for i in range(len(nums)-3):\\n for j in range(i+1,len(nums)-2):\\n l=j+1\\n r=len(nums)-1\\n while(l<r):\\n if(nums[i]+nums[j]+nums[l]+nums[r]==target):\\n if [nums[i],nums[j],nums[l],nums[r]] not in a:\\n a.append([nums[i],nums[j],nums[l],nums[r]])\\n l+=1\\n elif(nums[i]+nums[j]+nums[l]+nums[r]<target):\\n l+=1\\n elif(nums[i]+nums[j]+nums[l]+nums[r]>target):\\n r-=1\\n return a\\n\",\n \"runtime\": \"1093\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n = len(nums)\\n ans = set()\\n for i in range(0, n):\\n for j in range(i+1,n):\\n set1 = set()\\n for k in range(j+1,n):\\n forth = target-(nums[i]+nums[j]+nums[k])\\n if forth in set1:\\n ans.add(tuple(sorted([nums[i], nums[j], nums[k], forth])))\\n set1.add(nums[k])\\n return list(ans)\",\n \"runtime\": \"1093\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n quads = set()\\n n = len(nums)\\n for i in range(n):\\n for j in range(i+1, n):\\n b = set()\\n for k in range(j+1, n):\\n diff = target - (nums[i] + nums[j] + nums[k])\\n if diff in b:\\n current = [nums[i], nums[j], nums[k], diff]\\n dummy = sorted(current)\\n quads.add(tuple(dummy))\\n b.add(nums[k])\\n return quads \\n \\n\",\n \"runtime\": \"1107\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n = len(nums)\\n ans = set()\\n for i in range(n):\\n for j in range(i+1,n):\\n fourths = {}\\n for k in range(j+1,n):\\n total = nums[i]+nums[j]+nums[k]\\n if target-total in fourths:\\n temp = [nums[i],nums[j],nums[k],target-total]\\n temp.sort()\\n ans.add(tuple(temp))\\n fourths[nums[k]]=k\\n return ans\",\n \"runtime\": \"1107\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":148,"string":"148"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort() # Sort the array first\n n = len(nums)\n result = []\n \n for a in range(n - 3):\n # Skip duplicates for a\n if a > 0 and nums[a] == nums[a-1]:\n continue\n \n for b in range(a + 1, n - 2):\n # Skip duplicates for b\n if b > a + 1 and nums[b] == nums[b-1]:\n continue\n \n c = b + 1\n d = n - 1\n \n while c < d:\n current_sum = nums[a] + nums[b] + nums[c] + nums[d]\n \n if current_sum == target:\n result.append([nums[a], nums[b], nums[c], nums[d]])\n \n # Skip duplicates for c and d\n while c < d and nums[c] == nums[c+1]:\n c += 1\n while c < d and nums[d] == nums[d-1]:\n d -= 1\n \n c += 1\n d -= 1\n elif current_sum < target:\n c += 1\n else:\n d -= 1\n \n return result","memory":"16100"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n = len(nums)\n res = []\n nums.sort()\n for i in range(n):\n for j in range(i+1, n):\n left = j + 1\n right = n - 1 \n\n while left < right:\n current_sum = nums[i] + nums[j] + nums[left] + nums[right]\n\n if current_sum < target:\n left += 1\n elif current_sum > target:\n right -= 1\n else:\n if sorted([nums[i] ,nums[j] ,nums[left] ,nums[right]]) not in res:\n res.append([nums[i] ,nums[j] ,nums[left] ,nums[right]])\n left += 1\n right -= 1 \n\n return res \n","memory":"16200"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n def findNsum(nums, target, N, result, results):\n if len(nums) < N or N < 2 or target < nums[0]*N or target > nums[-1]*N: # early termination\n return\n if N == 2: # two pointers solve sorted 2-sum problem\n l,r = 0,len(nums)-1\n while l < r:\n s = nums[l] + nums[r]\n if s == target:\n results.append(result + [nums[l], nums[r]])\n l += 1\n while l < r and nums[l] == nums[l-1]:\n l += 1\n elif s < target:\n l += 1\n else:\n r -= 1\n else: # recursively reduce N\n for i in range(len(nums)-N+1):\n if i == 0 or (i > 0 and nums[i-1] != nums[i]):\n findNsum(nums[i+1:], target-nums[i], N-1, result+[nums[i]], results)\n\n results = []\n findNsum(sorted(nums), target, 4, [], results)\n return results","memory":"16300"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res = []\n \n for i in range(len(nums)):\n if i > 0 and nums[i - 1] == nums[i]: # avoids duplicates\n continue\n \n for j in range(i+1, len(nums)):\n if j > i+1 and nums[j - 1] == nums[j]: # avoids duplicates\n continue\n l = j + 1\n r = len(nums) - 1\n \n while l < r:\n fourSum = nums[i] + nums[j] + nums[l] + nums[r]\n if fourSum < target:\n l += 1\n elif fourSum > target:\n r -= 1\n else:\n res.append([nums[i], nums[j], nums[l], nums[r]])\n l += 1\n while nums[l] == nums[l-1] and l < r:\n l += 1\n \n return res","memory":"16300"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n n = len(nums) \n answer = []\n nums.sort() \n\n for i in range(n):\n if i > 0 and nums[i] == nums[i-1]:\n continue\n for j in range(i+1 , n):\n if j > i+1 and nums[j] == nums[j-1]:\n continue\n \n lo, hi = j+1, n-1\n while lo < hi:\n summ = nums[i]+ nums[j]+nums[lo] +nums[hi]\n if summ == target :\n answer.append([nums[i], nums[j], nums[lo], nums[hi]])\n lo +=1\n hi -=1\n while lo <hi and nums[lo] == nums[lo - 1]:\n lo +=1\n while lo < hi and nums[hi] == nums[hi + 1]:\n hi -= 1\n elif summ < target :\n lo +=1\n else : \n hi -= 1\n return answer","memory":"16400"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n\n # use 2 for loops to 'fix' 2 numbers, and then apply 2sum\n # time complz will be O(n**3)\n nums.sort()\n ans = set()\n for i in range(len(nums) - 1):\n\n for j in range(i + 1, len(nums)):\n\n left = j + 1\n right = len(nums) - 1\n\n while left < right:\n\n total = nums[i] + nums[j] + nums[right] + nums[left]\n\n if total == target:\n ans.add(tuple([nums[i], nums[j], nums[right], nums[left]]))\n left += 1\n\n elif total > target:\n right -= 1\n \n else:\n left += 1\n\n return list(ans)\n\n ","memory":"16400"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res = []\n\n for i in range(len(nums) - 3):\n # skip duplicate starting values\n if i > 0 and nums[i] == nums[i-1]:\n continue\n \n for j in range(i+1, len(nums) - 2):\n # skip duplicate starting values\n if j > i + 1 and nums[j] == nums[j-1]:\n continue\n left, right = j + 1, len(nums) - 1\n\n while left < right:\n four_sum = nums[i] + nums[j] + nums[left] + nums[right]\n if four_sum == target:\n res.append([nums[i], nums[j], nums[left], nums[right]])\n left += 1\n right -= 1\n\n while left < right and nums[left] == nums[left - 1]:\n left += 1\n while left < right and nums[right] == nums[right + 1]:\n right -= 1\n elif four_sum < target:\n left += 1\n else:\n right -= 1\n return res","memory":"16500"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n resulting_arr = []\n length_nums = len(nums)\n\n for i in range(length_nums - 3):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n for j in range(i + 1, length_nums - 2):\n if j > i + 1 and nums[j] == nums[j - 1]:\n continue\n L=j+1\n R=length_nums-1\n while L < R:\n total = nums[i] + nums[j] + nums[L] + nums[R]\n if total == target:\n resulting_arr.append([nums[i], nums[j], nums[L], nums[R]])\n while L < R and nums[L] == nums[L + 1]:\n L=L+1\n while L < R and nums[R] == nums[R - 1]:\n R=R-1\n L=L+1\n R=R-1\n elif total < target:\n L=L+1\n else:\n R=R-1\n return resulting_arr","memory":"16500"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort() # Sort the list to make it easier to skip duplicates and use two pointers\n res = []\n n = len(nums)\n \n # Iterate over the first two numbers in the quadruplet\n for i in range(n - 3):\n if i > 0 and nums[i] == nums[i - 1]: # Skip duplicates for the first number\n continue\n for j in range(i + 1, n - 2):\n if j > i + 1 and nums[j] == nums[j - 1]: # Skip duplicates for the second number\n continue\n\n # Now, use two pointers to find the remaining two numbers\n left, right = j + 1, n - 1\n while left < right:\n sum_ = nums[i] + nums[j] + nums[left] + nums[right]\n if sum_ == target:\n res.append([nums[i], nums[j], nums[left], nums[right]])\n\n # Move the left and right pointers to avoid duplicates\n while left < right and nums[left] == nums[left + 1]:\n left += 1\n while left < right and nums[right] == nums[right - 1]:\n right -= 1\n\n left += 1\n right -= 1\n elif sum_ < target:\n left += 1\n else:\n right -= 1\n \n return res\n","memory":"16600"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n result = []\n for i in range(len(nums)-3) :\n if i > 0 and nums[i] == nums[i - 1]:\n continue \n for j in range(i+1,len(nums)-2) : \n if j >= i + 2 and nums[j] == nums[j - 1]:\n continue\n left = j + 1 \n right = len(nums)-1\n while (left < right) :\n if(nums[i] + nums[j] + nums[left] + nums[right] < target) : \n left += 1 \n elif(nums[i] + nums[j] + nums[left] + nums[right] > target) : \n right -= 1 \n else : \n result.append([nums[i],nums[j],nums[left],nums[right]])\n while left < right and nums[left] == nums[left + 1]:\n left += 1\n while left < right and nums[right] == nums[right - 1]:\n right -= 1\n \n left += 1\n right -= 1\n return result \n\n\n ","memory":"16600"},{"code":"from typing import List\nclass Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n res = []\n n = len(nums)\n for i in range(n):\n if i > 0 and nums[i] == nums[i - 1]:\n continue\n for j in range(i + 1, n):\n if j > i + 1 and nums[j] == nums[j - 1]:\n continue\n left, right = j + 1, n - 1\n while left < right:\n total = nums[i] + nums[j] + nums[left] + nums[right]\n if total == target:\n res.append([nums[i], nums[j], nums[left], nums[right]])\n while left < right and nums[left] == nums[left + 1]:\n left += 1\n while left < right and nums[right] == nums[right - 1]:\n right -= 1\n left+=1\n right-=1\n elif total<target:\n left += 1\n else:\n right -= 1\n return res\n\n\nnums = [1, 0, -1, 0, -2, 2]\ntarget = 0\nsol = Solution()\nprint(sol.fourSum(nums, target))\n","memory":"16700"},{"code":"class Solution:\n # my twoSum assumes sorted nums array and returns unique set of pairs that sum to target target\n def twoSum(self, sortedNums: List[int], left, right, target: int) -> Set[Tuple[int, int]]:\n if len(sortedNums) < 2:\n return set()\n resultSet = set()\n\n while left < right:\n currSum = sortedNums[left] + sortedNums[right]\n if currSum == target:\n resultSet.add((sortedNums[left], sortedNums[right]))\n left += 1\n right -= 1\n elif currSum < target:\n left += 1\n else:\n right -= 1\n return resultSet\n \n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n resultSet = set()\n listLen = len(nums)\n\n for i in range(listLen - 3):\n firstFixed = nums[i]\n for j in range(i+1, listLen - 2):\n secondFixed = nums[j]\n complement = target - firstFixed - secondFixed\n rightArrayPairSet = self.twoSum(nums, left=(j+1), right=(listLen-1), target=complement)\n \n for pair in rightArrayPairSet:\n resultSet.add(tuple(sorted([firstFixed, secondFixed, pair[0], pair[1]])))\n\n return resultSet\n\n ","memory":"16700"},{"code":"class Solution:\n # my twoSum assumes sorted nums array and returns unique set of pairs that sum to target target\n def twoSum(self, sortedNums: List[int], left, right, target: int) -> Set[Tuple[int, int]]:\n if len(sortedNums) < 2:\n return set()\n resultSet = set()\n\n while left < right:\n currSum = sortedNums[left] + sortedNums[right]\n if currSum == target:\n resultSet.add((sortedNums[left], sortedNums[right]))\n left += 1\n right -= 1\n elif currSum < target:\n left += 1\n else:\n right -= 1\n return resultSet\n \n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n nums.sort()\n resultSet = set()\n listLen = len(nums)\n\n for i in range(listLen - 3):\n firstFixed = nums[i]\n for j in range(i+1, listLen - 2):\n secondFixed = nums[j]\n complement = target - firstFixed - secondFixed\n rightArrayPairSet = self.twoSum(nums, left=(j+1), right=(listLen-1), target=complement)\n \n for pair in rightArrayPairSet:\n resultSet.add((firstFixed, secondFixed, pair[0], pair[1]))\n\n return resultSet\n\n ","memory":"16800"},{"code":"class Solution:\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\n # first, we sort like usual to allow us to eleminate duplicates\n nums.sort()\n # stores final result\n res = []\n # stores current candidate\n candidate = []\n\n # generic k-sum solution\n def kSum(k, start, target):\n # The purpose of this is to narrow it down to only\n # k=2 so we can use the 2sum approach. We build a\n # candidate using recursion until k == 2, then run\n # the base case.\n if k != 2:\n for i in range(start, len(nums)):\n if i != start and nums[i] == nums[i-1]:\n continue\n\n candidate.append(nums[i])\n kSum(k - 1, i + 1, target - nums[i])\n candidate.pop()\n \n return\n\n # base case, here we just use the 2sum approach\n l = start\n r = len(nums)-1\n\n while l < r:\n v = nums[l] + nums[r]\n if v < target:\n l += 1\n elif v > target:\n r -= 1\n else:\n res.append(candidate + [nums[l], nums[r]])\n\n l += 1\n while l < r and nums[l] == nums[l-1]:\n l += 1\n\n # run algorithm to populate res\n kSum(4, 0, target)\n return res","memory":"16800"}],"string":"[\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort() # Sort the array first\\n n = len(nums)\\n result = []\\n \\n for a in range(n - 3):\\n # Skip duplicates for a\\n if a > 0 and nums[a] == nums[a-1]:\\n continue\\n \\n for b in range(a + 1, n - 2):\\n # Skip duplicates for b\\n if b > a + 1 and nums[b] == nums[b-1]:\\n continue\\n \\n c = b + 1\\n d = n - 1\\n \\n while c < d:\\n current_sum = nums[a] + nums[b] + nums[c] + nums[d]\\n \\n if current_sum == target:\\n result.append([nums[a], nums[b], nums[c], nums[d]])\\n \\n # Skip duplicates for c and d\\n while c < d and nums[c] == nums[c+1]:\\n c += 1\\n while c < d and nums[d] == nums[d-1]:\\n d -= 1\\n \\n c += 1\\n d -= 1\\n elif current_sum < target:\\n c += 1\\n else:\\n d -= 1\\n \\n return result\",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n = len(nums)\\n res = []\\n nums.sort()\\n for i in range(n):\\n for j in range(i+1, n):\\n left = j + 1\\n right = n - 1 \\n\\n while left < right:\\n current_sum = nums[i] + nums[j] + nums[left] + nums[right]\\n\\n if current_sum < target:\\n left += 1\\n elif current_sum > target:\\n right -= 1\\n else:\\n if sorted([nums[i] ,nums[j] ,nums[left] ,nums[right]]) not in res:\\n res.append([nums[i] ,nums[j] ,nums[left] ,nums[right]])\\n left += 1\\n right -= 1 \\n\\n return res \\n\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n def findNsum(nums, target, N, result, results):\\n if len(nums) < N or N < 2 or target < nums[0]*N or target > nums[-1]*N: # early termination\\n return\\n if N == 2: # two pointers solve sorted 2-sum problem\\n l,r = 0,len(nums)-1\\n while l < r:\\n s = nums[l] + nums[r]\\n if s == target:\\n results.append(result + [nums[l], nums[r]])\\n l += 1\\n while l < r and nums[l] == nums[l-1]:\\n l += 1\\n elif s < target:\\n l += 1\\n else:\\n r -= 1\\n else: # recursively reduce N\\n for i in range(len(nums)-N+1):\\n if i == 0 or (i > 0 and nums[i-1] != nums[i]):\\n findNsum(nums[i+1:], target-nums[i], N-1, result+[nums[i]], results)\\n\\n results = []\\n findNsum(sorted(nums), target, 4, [], results)\\n return results\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res = []\\n \\n for i in range(len(nums)):\\n if i > 0 and nums[i - 1] == nums[i]: # avoids duplicates\\n continue\\n \\n for j in range(i+1, len(nums)):\\n if j > i+1 and nums[j - 1] == nums[j]: # avoids duplicates\\n continue\\n l = j + 1\\n r = len(nums) - 1\\n \\n while l < r:\\n fourSum = nums[i] + nums[j] + nums[l] + nums[r]\\n if fourSum < target:\\n l += 1\\n elif fourSum > target:\\n r -= 1\\n else:\\n res.append([nums[i], nums[j], nums[l], nums[r]])\\n l += 1\\n while nums[l] == nums[l-1] and l < r:\\n l += 1\\n \\n return res\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n n = len(nums) \\n answer = []\\n nums.sort() \\n\\n for i in range(n):\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n for j in range(i+1 , n):\\n if j > i+1 and nums[j] == nums[j-1]:\\n continue\\n \\n lo, hi = j+1, n-1\\n while lo < hi:\\n summ = nums[i]+ nums[j]+nums[lo] +nums[hi]\\n if summ == target :\\n answer.append([nums[i], nums[j], nums[lo], nums[hi]])\\n lo +=1\\n hi -=1\\n while lo <hi and nums[lo] == nums[lo - 1]:\\n lo +=1\\n while lo < hi and nums[hi] == nums[hi + 1]:\\n hi -= 1\\n elif summ < target :\\n lo +=1\\n else : \\n hi -= 1\\n return answer\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n\\n # use 2 for loops to 'fix' 2 numbers, and then apply 2sum\\n # time complz will be O(n**3)\\n nums.sort()\\n ans = set()\\n for i in range(len(nums) - 1):\\n\\n for j in range(i + 1, len(nums)):\\n\\n left = j + 1\\n right = len(nums) - 1\\n\\n while left < right:\\n\\n total = nums[i] + nums[j] + nums[right] + nums[left]\\n\\n if total == target:\\n ans.add(tuple([nums[i], nums[j], nums[right], nums[left]]))\\n left += 1\\n\\n elif total > target:\\n right -= 1\\n \\n else:\\n left += 1\\n\\n return list(ans)\\n\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res = []\\n\\n for i in range(len(nums) - 3):\\n # skip duplicate starting values\\n if i > 0 and nums[i] == nums[i-1]:\\n continue\\n \\n for j in range(i+1, len(nums) - 2):\\n # skip duplicate starting values\\n if j > i + 1 and nums[j] == nums[j-1]:\\n continue\\n left, right = j + 1, len(nums) - 1\\n\\n while left < right:\\n four_sum = nums[i] + nums[j] + nums[left] + nums[right]\\n if four_sum == target:\\n res.append([nums[i], nums[j], nums[left], nums[right]])\\n left += 1\\n right -= 1\\n\\n while left < right and nums[left] == nums[left - 1]:\\n left += 1\\n while left < right and nums[right] == nums[right + 1]:\\n right -= 1\\n elif four_sum < target:\\n left += 1\\n else:\\n right -= 1\\n return res\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n resulting_arr = []\\n length_nums = len(nums)\\n\\n for i in range(length_nums - 3):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n for j in range(i + 1, length_nums - 2):\\n if j > i + 1 and nums[j] == nums[j - 1]:\\n continue\\n L=j+1\\n R=length_nums-1\\n while L < R:\\n total = nums[i] + nums[j] + nums[L] + nums[R]\\n if total == target:\\n resulting_arr.append([nums[i], nums[j], nums[L], nums[R]])\\n while L < R and nums[L] == nums[L + 1]:\\n L=L+1\\n while L < R and nums[R] == nums[R - 1]:\\n R=R-1\\n L=L+1\\n R=R-1\\n elif total < target:\\n L=L+1\\n else:\\n R=R-1\\n return resulting_arr\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort() # Sort the list to make it easier to skip duplicates and use two pointers\\n res = []\\n n = len(nums)\\n \\n # Iterate over the first two numbers in the quadruplet\\n for i in range(n - 3):\\n if i > 0 and nums[i] == nums[i - 1]: # Skip duplicates for the first number\\n continue\\n for j in range(i + 1, n - 2):\\n if j > i + 1 and nums[j] == nums[j - 1]: # Skip duplicates for the second number\\n continue\\n\\n # Now, use two pointers to find the remaining two numbers\\n left, right = j + 1, n - 1\\n while left < right:\\n sum_ = nums[i] + nums[j] + nums[left] + nums[right]\\n if sum_ == target:\\n res.append([nums[i], nums[j], nums[left], nums[right]])\\n\\n # Move the left and right pointers to avoid duplicates\\n while left < right and nums[left] == nums[left + 1]:\\n left += 1\\n while left < right and nums[right] == nums[right - 1]:\\n right -= 1\\n\\n left += 1\\n right -= 1\\n elif sum_ < target:\\n left += 1\\n else:\\n right -= 1\\n \\n return res\\n\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n result = []\\n for i in range(len(nums)-3) :\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue \\n for j in range(i+1,len(nums)-2) : \\n if j >= i + 2 and nums[j] == nums[j - 1]:\\n continue\\n left = j + 1 \\n right = len(nums)-1\\n while (left < right) :\\n if(nums[i] + nums[j] + nums[left] + nums[right] < target) : \\n left += 1 \\n elif(nums[i] + nums[j] + nums[left] + nums[right] > target) : \\n right -= 1 \\n else : \\n result.append([nums[i],nums[j],nums[left],nums[right]])\\n while left < right and nums[left] == nums[left + 1]:\\n left += 1\\n while left < right and nums[right] == nums[right - 1]:\\n right -= 1\\n \\n left += 1\\n right -= 1\\n return result \\n\\n\\n \",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"from typing import List\\nclass Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n res = []\\n n = len(nums)\\n for i in range(n):\\n if i > 0 and nums[i] == nums[i - 1]:\\n continue\\n for j in range(i + 1, n):\\n if j > i + 1 and nums[j] == nums[j - 1]:\\n continue\\n left, right = j + 1, n - 1\\n while left < right:\\n total = nums[i] + nums[j] + nums[left] + nums[right]\\n if total == target:\\n res.append([nums[i], nums[j], nums[left], nums[right]])\\n while left < right and nums[left] == nums[left + 1]:\\n left += 1\\n while left < right and nums[right] == nums[right - 1]:\\n right -= 1\\n left+=1\\n right-=1\\n elif total<target:\\n left += 1\\n else:\\n right -= 1\\n return res\\n\\n\\nnums = [1, 0, -1, 0, -2, 2]\\ntarget = 0\\nsol = Solution()\\nprint(sol.fourSum(nums, target))\\n\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n # my twoSum assumes sorted nums array and returns unique set of pairs that sum to target target\\n def twoSum(self, sortedNums: List[int], left, right, target: int) -> Set[Tuple[int, int]]:\\n if len(sortedNums) < 2:\\n return set()\\n resultSet = set()\\n\\n while left < right:\\n currSum = sortedNums[left] + sortedNums[right]\\n if currSum == target:\\n resultSet.add((sortedNums[left], sortedNums[right]))\\n left += 1\\n right -= 1\\n elif currSum < target:\\n left += 1\\n else:\\n right -= 1\\n return resultSet\\n \\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n resultSet = set()\\n listLen = len(nums)\\n\\n for i in range(listLen - 3):\\n firstFixed = nums[i]\\n for j in range(i+1, listLen - 2):\\n secondFixed = nums[j]\\n complement = target - firstFixed - secondFixed\\n rightArrayPairSet = self.twoSum(nums, left=(j+1), right=(listLen-1), target=complement)\\n \\n for pair in rightArrayPairSet:\\n resultSet.add(tuple(sorted([firstFixed, secondFixed, pair[0], pair[1]])))\\n\\n return resultSet\\n\\n \",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n # my twoSum assumes sorted nums array and returns unique set of pairs that sum to target target\\n def twoSum(self, sortedNums: List[int], left, right, target: int) -> Set[Tuple[int, int]]:\\n if len(sortedNums) < 2:\\n return set()\\n resultSet = set()\\n\\n while left < right:\\n currSum = sortedNums[left] + sortedNums[right]\\n if currSum == target:\\n resultSet.add((sortedNums[left], sortedNums[right]))\\n left += 1\\n right -= 1\\n elif currSum < target:\\n left += 1\\n else:\\n right -= 1\\n return resultSet\\n \\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n nums.sort()\\n resultSet = set()\\n listLen = len(nums)\\n\\n for i in range(listLen - 3):\\n firstFixed = nums[i]\\n for j in range(i+1, listLen - 2):\\n secondFixed = nums[j]\\n complement = target - firstFixed - secondFixed\\n rightArrayPairSet = self.twoSum(nums, left=(j+1), right=(listLen-1), target=complement)\\n \\n for pair in rightArrayPairSet:\\n resultSet.add((firstFixed, secondFixed, pair[0], pair[1]))\\n\\n return resultSet\\n\\n \",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def fourSum(self, nums: List[int], target: int) -> List[List[int]]:\\n # first, we sort like usual to allow us to eleminate duplicates\\n nums.sort()\\n # stores final result\\n res = []\\n # stores current candidate\\n candidate = []\\n\\n # generic k-sum solution\\n def kSum(k, start, target):\\n # The purpose of this is to narrow it down to only\\n # k=2 so we can use the 2sum approach. We build a\\n # candidate using recursion until k == 2, then run\\n # the base case.\\n if k != 2:\\n for i in range(start, len(nums)):\\n if i != start and nums[i] == nums[i-1]:\\n continue\\n\\n candidate.append(nums[i])\\n kSum(k - 1, i + 1, target - nums[i])\\n candidate.pop()\\n \\n return\\n\\n # base case, here we just use the 2sum approach\\n l = start\\n r = len(nums)-1\\n\\n while l < r:\\n v = nums[l] + nums[r]\\n if v < target:\\n l += 1\\n elif v > target:\\n r -= 1\\n else:\\n res.append(candidate + [nums[l], nums[r]])\\n\\n l += 1\\n while l < r and nums[l] == nums[l-1]:\\n l += 1\\n\\n # run algorithm to populate res\\n kSum(4, 0, target)\\n return res\",\n \"memory\": \"16800\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":14,"string":"14"}}},{"rowIdx":185,"cells":{"question_id":{"kind":"number","value":19,"string":"19"},"name":{"kind":"string","value":"remove-nth-node-from-end-of-list"},"content":{"kind":"string","value":"<p>Given the <code>head</code> of a linked list, remove the <code>n<sup>th</sup></code> node from the end of the list and return its head.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/10/03/remove_ex1.jpg\" style=\"width: 542px; height: 222px;\" />\n<pre>\n<strong>Input:</strong> head = [1,2,3,4,5], n = 2\n<strong>Output:</strong> [1,2,3,5]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> head = [1], n = 1\n<strong>Output:</strong> []\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> head = [1,2], 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>The number of nodes in the list is <code>sz</code>.</li>\n\t<li><code>1 <= sz <= 30</code></li>\n\t<li><code>0 <= Node.val <= 100</code></li>\n\t<li><code>1 <= n <= sz</code></li>\n</ul>\n\n<p> </p>\n<p><strong>Follow up:</strong> Could you do this in one pass?</p>\n"},"acRate":{"kind":"number","value":46.703639448386056,"string":"46.703639"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["linked-list","two-pointers"],"string":"[\n \"linked-list\",\n \"two-pointers\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"14\", 0.0031], [\"15\", 0.0183], [\"16\", 0.0153], [\"17\", 0.0092], [\"18\", 0.0244], [\"19\", 0.1099], [\"20\", 0.0885], [\"21\", 0.0702], [\"22\", 0.1862], [\"23\", 0.6592], [\"24\", 0.415], [\"25\", 0.4517], [\"26\", 0.8179], [\"27\", 2.5848], [\"28\", 1.5991], [\"29\", 1.7059], [\"30\", 2.1118], [\"31\", 6.5063], [\"32\", 4.0924], [\"33\", 4.184], [\"34\", 4.776], [\"35\", 10.08], [\"36\", 7.1838], [\"37\", 5.6702], [\"38\", 5.838], [\"39\", 10.0891], [\"40\", 6.897], [\"41\", 5.3284], [\"42\", 4.4067], [\"43\", 4.8706], [\"44\", 3.1921]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16000\", 0.0061], [\"16100\", 0.0336], [\"16200\", 0.2747], [\"16300\", 5.2704], [\"16400\", 26.4954], [\"16500\", 46.2341]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:\n fast = slow = head\n for _ in range(n):\n fast = fast.next\n if not fast:\n return head.next\n while fast.next:\n fast = fast.next\n slow = slow.next\n slow.next = slow.next.next\n return head","runtime":"14"},{"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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(0)\n dummy.next = head\n length = 0\n first = head\n while first:\n length += 1\n first = first.next\n length -= n\n first = dummy\n while length > 0:\n length -= 1\n first = first.next\n first.next = first.next.next\n return dummy.next","runtime":"15"},{"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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n if not head:\n return None\n\n def get_length(head):\n length = 0\n tmp = head\n while head:\n length += 1\n head = head.next\n return length\n\n length = get_length(head)\n tmp = ListNode(-1)\n tmp.next = head\n copy = tmp\n while length > n:\n tmp = tmp.next\n length -= 1\n \n tmp.next = tmp.next.next\n return copy.next\n \n\n ","runtime":"16"},{"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 get_length_ll(self, head):\n # count = 0 \n # itr = head\n # while(itr):\n # itr = itr.next\n # count = count + 1\n # return count\n \n # def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n # len_ll = self.get_length_ll(head)\n # index = len_ll - n\n\n # if index == 0:\n # return head.next\n\n # if n < 1 or n > len_ll or len_ll == 1:\n # return None\n \n # itr = head\n # for i in range(1, index):\n # itr = itr.next\n \n # if itr.next:\n # itr.next = itr.next.next\n # else:\n # itr.next = None\n # return head\n\n def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n if not head:\n return head\n first = second = dummy = ListNode(0, head)\n for _ in range(n+1):\n first = first.next\n \n while(first):\n first = first.next\n second = second.next\n \n second.next = second.next.next\n return dummy.next\n\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n tempHead = ListNode(-1, head)\n slow, fast = tempHead, tempHead\n for _ in range(n + 1):\n fast = fast.next\n \n while fast:\n slow = slow.next\n fast = fast.next\n\n if slow.next:\n slow.next = slow.next.next\n else:\n slow.next = None\n \n return tempHead.next","runtime":"18"},{"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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n c=0\n temp=head\n while temp:\n c+=1\n temp=temp.next\n if c==n:\n new=head.next\n return new\n val=c-n\n tem=head\n while tem:\n val-=1\n if val==0:\n break\n tem=tem.next\n #du=tem.next\n tem.next=tem.next.next\n return head\n \n \n \n \n \n\n \n ","runtime":"19"},{"code":"class ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\n\nclass Solution:\n def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:\n # Create a dummy node which points to the head of the list\n dummy = ListNode(0)\n dummy.next = head\n slow = fast = dummy\n \n # Move fast pointer n+1 steps ahead\n for _ in range(n + 1):\n fast = fast.next\n \n # Move both fast and slow pointers until fast reaches the end\n while fast:\n slow = slow.next\n fast = fast.next\n \n # Remove the nth node from the end\n slow.next = slow.next.next\n \n # Return the new head\n return dummy.next\n# Helper function to create a linked list from a list of values\ndef create_linked_list(values):\n dummy = ListNode()\n current = dummy\n for value in values:\n current.next = ListNode(value)\n current = current.next\n return dummy.next\n\n# Helper function to convert a linked list to a list of values\ndef linked_list_to_list(head):\n values = []\n while head:\n values.append(head.val)\n head = head.next\n return values\n\n# Test cases\nsolution = Solution()\n\n# Example 1\nhead = create_linked_list([1, 2, 3, 4, 5])\nn = 2\nnew_head = solution.removeNthFromEnd(head, n)\nprint(linked_list_to_list(new_head)) # Output: [1, 2, 3, 5]\n\n# Example 2\nhead = create_linked_list([1])\nn = 1\nnew_head = solution.removeNthFromEnd(head, n)\nprint(linked_list_to_list(new_head)) # Output: []\n\n# Example 3\nhead = create_linked_list([1, 2])\nn = 1\nnew_head = solution.removeNthFromEnd(head, n)\nprint(linked_list_to_list(new_head)) # Output: [1]\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\nclass Solution:\n def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n if not head :\n return head\n fast = slow = dummy = ListNode(0, head)\n for i in range (n+1):\n fast = fast.next;\n if not fast :\n return head.next;\n while fast :\n slow, fast = slow.next, fast.next;\n slow.next = slow.next.next;\n return dummy.next;","runtime":"21"},{"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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n\n m = head\n a = 0\n while a < n:\n m = m.next\n a += 1\n if not m:\n head = head.next\n return head\n \n k = head\n\n while m.next:\n m = m.next\n k = k.next\n k.next = k.next.next\n return head\n\n ","runtime":"21"},{"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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n vals = []\n current_node = head\n while current_node:\n vals.insert(0,current_node.val)\n current_node = current_node.next\n \n vals.pop(n-1)\n print(vals)\n new_ll = ListNode(0)\n new_node = new_ll\n for val in vals[::-1]:\n new_node.next = ListNode(val)\n new_node = new_node.next\n \n return new_ll.next","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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode()\n dummy.next = head\n def helper(node):\n if not node:\n return 0\n res = helper(node.next)\n if res == n:\n node.next = node.next.next\n return res + 1\n helper(dummy)\n return dummy.next","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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n if head.next == None :return None\n curr = head\n i = 0\n while curr:\n i+=1\n curr = curr.next\n sz = i\n if sz == n: return head.next\n r = sz - n\n \n i = 1\n curr = head\n while i < r:\n curr = curr.next\n i+=1\n \n rem = curr.next\n curr.next = rem.next\n rem.next = None\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(0, head)\n c=0\n temp=head\n while (temp!= None):\n c+=1\n temp=temp.next\n temp=dummy\n for i in range(c-n):\n temp=temp.next\n temp.next=temp.next.next\n return dummy.next","runtime":"24"},{"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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n if not head:\n return None\n left = head\n right = head\n prev = None\n for i in range(n):\n right = right.next\n if i == n-1 and not right:\n head = head.next\n else:\n while right:\n prev = left\n left = left.next\n right = right.next\n if prev and prev.next:\n prev.next = prev.next.next\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(0)\n dummy.next = head\n\n prev = dummy\n slow = dummy.next\n fast = dummy.next\n\n for _ in range(n):\n fast = fast.next\n \n while fast:\n prev = slow\n slow = slow.next\n fast = fast.next\n \n prev.next = slow.next\n return dummy.next\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n ctr = 0 \n curr = head\n while curr:\n ctr+=1\n curr = curr.next\n c= 1\n curr = head\n prev = None\n while curr:\n if c==ctr-n+1 and c==1:\n head = curr.next\n elif c == ctr - n +1:\n prev.next = curr.next \n prev = curr\n curr = curr.next\n c+=1\n return head\n\n ","runtime":"26"},{"code":"class Solution:\n def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(0)\n dummy.next = head\n first = dummy\n second = dummy\n\n for _ in range(n + 1):\n first = first.next\n\n while first is not None:\n first = first.next\n second = second.next\n\n second.next = second.next.next\n\n return dummy.next","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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(0, head)\n left = dummy\n right = head\n while n:\n right = right.next\n n-=1 \n\n while right:\n left = left.next\n right = right.next\n left.next = left.next.next\n return dummy.next\n'''\n0 -> 1 -> 2 -> 3 -> 4 -> 5 -> None\nright = 3\nleft = 0\n\nr = 4\nl = 1\n\nr = 5 \nl = 2\n\nr = None\nl = 3\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n if not head:\n return \n if not head.next and n==1:\n return\n\n prev_n_i = None\n n_i = head\n counter = 1 \n current = head\n \n while current.next: # ----- i3\n if counter == n: # ----- true - 1\n prev_n_i = n_i # --- i1\n n_i = n_i.next # --- i2\n else:\n counter += 1\n \n current = current.next #- i3\n if n == 1:\n prev_n_i.next = None\n return head\n \n if n_i == head:\n return head.next\n \n prev_n_i.next = n_i.next\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n \n dummy = ListNode()\n dummy.next = head\n left = dummy\n right = head\n\n while right and n>0:\n right = right.next\n n-=1\n \n while right:\n right = right.next\n left = left.next\n \n left.next = left.next.next\n return dummy.next","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\n\nclass Solution:\n def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy=ListNode(0,head)\n left=dummy\n right=head\n for i in range(n):\n right=right.next\n while right:\n left=left.next\n right=right.next\n left.next=left.next.next\n return dummy.next\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(0, head)\n length = 0\n cur = head\n\n while cur:\n length += 1\n cur = cur.next\n \n if length < n:\n return None\n \n length -= n\n curr = dummy\n\n while length:\n curr = curr.next\n length -= 1\n\n curr.next = curr.next.next\n \n return dummy.next\n\n # dummy = ListNode(0, head) # Dummy node to simplify edge cases\n # length = 0\n # first = head\n\n # # First pass: count the length of the linked list\n # while first:\n # length += 1\n # first = first.next\n \n # # If n is greater than the length of the list, return None\n # if n > length:\n # return None\n\n # # Find the (length - n)th node, i.e., the node right before the one to be deleted\n # length -= n\n # first = dummy # Reset to the dummy node\n \n # # Move first pointer to the node just before the node to delete\n # while length > 0:\n # first = first.next\n # length -= 1\n \n # # Delete the nth node from the end\n # first.next = first.next.next\n \n # # Return the new head\n # return dummy.next\n\n\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(0, head)\n slow = fast = dummy\n\n while n:\n fast = fast.next\n n -= 1\n \n while fast.next:\n slow = slow.next\n fast = fast.next\n\n slow.next = slow.next.next\n return dummy.next\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n length = 0\n curr = head\n while curr is not None:\n length += 1\n curr = curr.next\n\n dummy = ListNode(0)\n dummy.next = head\n prev = dummy\n for _ in range(length - n):\n prev = prev.next\n prev.next = prev.next.next\n return dummy.next","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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n # ctr = 0 \n # curr = head\n # while curr:\n # ctr+=1\n # curr = curr.next\n # c= 1\n # curr = head\n # prev = None\n # while curr:\n # if c==ctr-n+1 and c==1:\n # head = curr.next\n # elif c == ctr - n +1:\n # prev.next = curr.next \n # prev = curr\n # curr = curr.next\n # c+=1\n # return head\n\n # shitt fast and slow pointer ?\n slow,fast = head,head\n for _ in range(n):\n fast = fast.next\n prev = None\n while fast:\n prev = slow\n slow = slow.next\n fast = fast.next\n print(prev,slow)\n if prev :prev.next = slow.next\n else:head = slow.next\n \n return head\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(0, head)\n first = dummy\n second = dummy\n \n for _ in range(n + 1):\n first = first.next\n\n while first is not None:\n first = first.next\n second = second.next\n\n second.next = second.next.next\n\n return dummy.next","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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n store = head\n l = ListNode(None, head)\n tracker = {-1: l}\n count = 0\n\n while store != None:\n tracker[count] = store\n store = store.next\n count+=1\n\n tracker[count - n - 1].next = tracker[count - n ].next\n return l.next\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n fast = head\n for i in range(n):\n fast = fast.next\n dummy = ListNode()\n dummy.next = head\n slow = dummy\n while fast:\n slow = slow.next\n fast = fast.next\n if slow.next:\n slow.next = slow.next.next\n return dummy.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 ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\n\nclass Solution:\n def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(next=head)\n fast = dummy\n for _ in range(n):\n fast = fast.next\n slow = dummy\n while fast.next:\n slow = slow.next\n fast = fast.next\n if n == 1:\n slow.next = None\n else:\n slow.next = slow.next.next\n return dummy.next\n ","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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(0, head)\n slow, fast = dummy, dummy\n for _ in range(n):\n fast = fast.next\n while fast and fast.next:\n slow = slow.next\n fast = fast.next\n slow.next= slow.next.next\n return dummy.next\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(0, head)\n fast = head\n slow = dummy\n i = 0\n\n while fast and i < n:\n fast = fast.next\n i += 1\n \n while fast:\n fast = fast.next\n slow = slow.next\n \n slow.next = slow.next.next\n\n return dummy.next\n\n\n'''\n fast\n head x\n dummy -> (1) -> (2) -> (3) -> (4) -> (5) -> None n = 2\n slow\n\n\n\n 1. while fast and i < n:\n fast = fast.next\n i += 1\n \n 2. while fast:\n fast = fast.next\n slow = slow.next\n \n 3. slow.next = slow.next.next\n\ndummy = ListNode(0, head)\nslow = dummy\n\ni = 0\n\nTime: O(n)\nSpace: O(1)\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n l=0\n temp=head\n while temp:\n l+=1\n temp=temp.next\n pos=l-n\n if pos<0:\n return None\n if pos==0:\n return head.next\n c=1\n temp=head\n # print(\"---\",l,pos)\n while c!=pos:\n # print(\"----temp---\",temp.val)\n temp=temp.next\n c+=1\n temp.next=temp.next.next\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(0,head)\n left, right = dummy, head\n\n while n>0:\n right = right.next\n n-=1\n \n while right:\n left = left.next\n right = right.next\n \n left.next = left.next.next\n return dummy.next\n \n","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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(0, head)\n fast_pointer = dummy\n for _ in range(n):\n fast_pointer = fast_pointer.next\n\n slow_pointer = dummy\n\n while fast_pointer and fast_pointer.next:\n slow_pointer = slow_pointer.next\n fast_pointer = fast_pointer.next\n\n\n slow_pointer.next = slow_pointer.next.next\n\n return dummy.next\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(next=head)\n curr, end = dummy, head\n for _ in range(n):\n end = end.next\n while end:\n curr = curr.next\n end = end.next\n curr.next = curr.next.next\n return dummy.next\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n list_len = 0 \n cur_node = head\n arr = []\n\n while True:\n arr.append(cur_node.val)\n if cur_node.next == None:\n break\n cur_node = cur_node.next\n\n arr.pop(len(arr) - n)\n\n if len(arr) == 0:\n return None\n\n new_head = ListNode()\n cur_node = new_head\n for i in range(len(arr)):\n cur_node.val = arr[i]\n if i == len(arr) - 1:\n cur_node.next = None\n break\n new_node = ListNode()\n cur_node.next = new_node\n cur_node = cur_node.next\n\n return new_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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n \n if not head:\n return None\n dummy = ListNode(next=head)\n fast_ptr = dummy\n slow_ptr = dummy\n for i in range(n):\n fast_ptr = fast_ptr.next\n while fast_ptr.next:\n fast_ptr = fast_ptr.next\n slow_ptr = slow_ptr.next\n print(slow_ptr)\n if slow_ptr.next:\n slow_ptr.next = slow_ptr.next.next\n return dummy.next\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n\n fast = head\n\n for _ in range(n - 1):\n fast = fast.next\n\n pre_slow = None\n slow = head\n\n while fast and fast.next:\n pre_slow = slow\n slow = slow.next\n fast = fast.next\n\n pre_target = pre_slow\n target = slow\n\n if not pre_slow:\n return target.next\n\n pre_slow.next = target.next\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = ListNode(0, head)\n l = dummy\n r = head\n\n while n > 0:\n r = r.next\n n-=1\n\n while r:\n l = l.next\n r = r.next\n \n l.next = l.next.next\n\n return dummy.next","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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n if head.next==None:\n return None if n else head\n \n ptr1=head\n ptr2=head\n\n while n:\n ptr2=ptr2.next\n n-=1\n if ptr2:\n ptr2=ptr2.next\n else:\n return head.next\n \n while ptr2:\n ptr1=ptr1.next\n ptr2=ptr2.next\n \n ptr1.next=ptr1.next.next\n\n\n return head","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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n if head==None or head.next==None:\n return None\n curr=head\n before= head\n after=head\n length=0\n temp=head\n while temp:\n temp=temp.next\n length+=1\n print(length)\n if n==length:\n return head.next\n for i in range(0,length-n-1):\n curr=curr.next\n before=before.next\n curr=curr.next\n print(curr)\n after=curr.next \n before.next=curr.next \n curr.next=None\n # head=curr\n return head","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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n dummy = slow = fast = ListNode(0, head)\n\n for _ in range(n):\n fast = fast.next\n \n while fast.next:\n fast = fast.next\n slow = slow.next\n \n slow.next = slow.next.next\n\n return dummy.next\n\n # dummy = ListNode(0, head) # Dummy node to simplify edge cases\n # length = 0\n # first = head\n\n # # First pass: count the length of the linked list\n # while first:\n # length += 1\n # first = first.next\n \n # # If n is greater than the length of the list, return None\n # if n > length:\n # return None\n\n # # Find the (length - n)th node, i.e., the node right before the one to be deleted\n # length -= n\n # first = dummy # Reset to the dummy node\n \n # # Move first pointer to the node just before the node to delete\n # while length > 0:\n # first = first.next\n # length -= 1\n \n # # Delete the nth node from the end\n # first.next = first.next.next\n \n # # Return the new head\n # return dummy.next\n\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n slow, fast = head, head\n\n for _ in range(n):\n fast = fast.next\n \n if not fast:\n return head.next\n\n while fast.next:\n slow = slow.next\n fast = fast.next\n \n slow.next = slow.next.next\n\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n t1,t2 = head,head\n for i in range(n):\n t1 = t1.next\n if t1 is None:\n return head.next\n while t1.next is not None:\n t1 = t1.next\n t2 = t2.next\n delNode = t2.next\n t2.next = t2.next.next\n delNode = None\n \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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n res = ListNode(0, head)\n dummy = res\n for _ in range(n):\n head = head.next\n while head:\n head = head.next\n dummy = dummy.next\n dummy.next = dummy.next.next\n return res.next","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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n\n def helper(root):\n if root == None:\n return None, 0\n\n node , k = helper(root.next)\n if k == n-1:\n return node, k+1\n else:\n root.next = node\n return root ,k+1\n\n return helper(head)[0]\n\n \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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n \n count = 1\n l = head\n while l:\n l = l.next\n if not l:\n break\n count += 1\n \n if count == n:\n if head.next:\n return head.next\n else:\n return None\n n = count - n - 1\n l = head\n while n > 0:\n l = l.next\n n -= 1\n if l.next.next:\n l.next = l.next.next\n else:\n l.next = None\n return head\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n # output = ListNode()\n # dummy = output\n # slow = head\n # fast = head\n # for i in range(n):\n # fast = fast.next\n # while fast :\n # output.next = slow\n # output = output.next\n # slow = slow.next\n # fast = fast.next\n # output.next = slow.next if slow else None\n # return dummy.next\n dummy = ListNode(0,head)\n slow = dummy\n fast = dummy\n for i in range(n+1):\n fast = fast.next\n while fast:\n slow = slow.next\n fast = fast.next\n slow.next = slow.next.next if slow.next else None\n return dummy.next","runtime":"44"},{"code":"# Definition for singly-linked list.\r\nclass ListNode:\r\n def __init__(self, val=0, next=None):\r\n self.val = val\r\n self.next = next\r\nclass Solution:\r\n def removeNthFromEndBad(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\r\n arr = []\r\n temp = head\r\n while head:\r\n arr.append(head)\r\n head = head.next\r\n\r\n if len(arr) == n:\r\n temp = temp.next\r\n else:\r\n # arr[2] -> arr[4] n = 2\r\n arr[~(n)].next = arr[~(n-1)].next\r\n\r\n return temp\r\n\r\n def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\r\n l = head\r\n r = head\r\n\r\n for i in range(n):\r\n r = r.next\r\n if not r:\r\n return head.next\r\n \r\n while r.next:\r\n r = r.next\r\n l = l.next\r\n \r\n if n == 1:\r\n l.next = None\r\n else:\r\n l.next = l.next.next\r\n return head","runtime":"44"}],"string":"[\n {\n \"code\": \"class Solution:\\n def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:\\n fast = slow = head\\n for _ in range(n):\\n fast = fast.next\\n if not fast:\\n return head.next\\n while fast.next:\\n fast = fast.next\\n slow = slow.next\\n slow.next = slow.next.next\\n return head\",\n \"runtime\": \"14\"\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n dummy = ListNode(0)\\n dummy.next = head\\n length = 0\\n first = head\\n while first:\\n length += 1\\n first = first.next\\n length -= n\\n first = dummy\\n while length > 0:\\n length -= 1\\n first = first.next\\n first.next = first.next.next\\n return dummy.next\",\n \"runtime\": \"15\"\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n if not head:\\n return None\\n\\n def get_length(head):\\n length = 0\\n tmp = head\\n while head:\\n length += 1\\n head = head.next\\n return length\\n\\n length = get_length(head)\\n tmp = ListNode(-1)\\n tmp.next = head\\n copy = tmp\\n while length > n:\\n tmp = tmp.next\\n length -= 1\\n \\n tmp.next = tmp.next.next\\n return copy.next\\n \\n\\n \",\n \"runtime\": \"16\"\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 get_length_ll(self, head):\\n # count = 0 \\n # itr = head\\n # while(itr):\\n # itr = itr.next\\n # count = count + 1\\n # return count\\n \\n # def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n # len_ll = self.get_length_ll(head)\\n # index = len_ll - n\\n\\n # if index == 0:\\n # return head.next\\n\\n # if n < 1 or n > len_ll or len_ll == 1:\\n # return None\\n \\n # itr = head\\n # for i in range(1, index):\\n # itr = itr.next\\n \\n # if itr.next:\\n # itr.next = itr.next.next\\n # else:\\n # itr.next = None\\n # return head\\n\\n def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n if not head:\\n return head\\n first = second = dummy = ListNode(0, head)\\n for _ in range(n+1):\\n first = first.next\\n \\n while(first):\\n first = first.next\\n second = second.next\\n \\n second.next = second.next.next\\n return dummy.next\\n\\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n tempHead = ListNode(-1, head)\\n slow, fast = tempHead, tempHead\\n for _ in range(n + 1):\\n fast = fast.next\\n \\n while fast:\\n slow = slow.next\\n fast = fast.next\\n\\n if slow.next:\\n slow.next = slow.next.next\\n else:\\n slow.next = None\\n \\n return tempHead.next\",\n \"runtime\": \"18\"\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n c=0\\n temp=head\\n while temp:\\n c+=1\\n temp=temp.next\\n if c==n:\\n new=head.next\\n return new\\n val=c-n\\n tem=head\\n while tem:\\n val-=1\\n if val==0:\\n break\\n tem=tem.next\\n #du=tem.next\\n tem.next=tem.next.next\\n return head\\n \\n \\n \\n \\n \\n\\n \\n \",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\n\\nclass Solution:\\n def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:\\n # Create a dummy node which points to the head of the list\\n dummy = ListNode(0)\\n dummy.next = head\\n slow = fast = dummy\\n \\n # Move fast pointer n+1 steps ahead\\n for _ in range(n + 1):\\n fast = fast.next\\n \\n # Move both fast and slow pointers until fast reaches the end\\n while fast:\\n slow = slow.next\\n fast = fast.next\\n \\n # Remove the nth node from the end\\n slow.next = slow.next.next\\n \\n # Return the new head\\n return dummy.next\\n# Helper function to create a linked list from a list of values\\ndef create_linked_list(values):\\n dummy = ListNode()\\n current = dummy\\n for value in values:\\n current.next = ListNode(value)\\n current = current.next\\n return dummy.next\\n\\n# Helper function to convert a linked list to a list of values\\ndef linked_list_to_list(head):\\n values = []\\n while head:\\n values.append(head.val)\\n head = head.next\\n return values\\n\\n# Test cases\\nsolution = Solution()\\n\\n# Example 1\\nhead = create_linked_list([1, 2, 3, 4, 5])\\nn = 2\\nnew_head = solution.removeNthFromEnd(head, n)\\nprint(linked_list_to_list(new_head)) # Output: [1, 2, 3, 5]\\n\\n# Example 2\\nhead = create_linked_list([1])\\nn = 1\\nnew_head = solution.removeNthFromEnd(head, n)\\nprint(linked_list_to_list(new_head)) # Output: []\\n\\n# Example 3\\nhead = create_linked_list([1, 2])\\nn = 1\\nnew_head = solution.removeNthFromEnd(head, n)\\nprint(linked_list_to_list(new_head)) # Output: [1]\\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\\nclass Solution:\\n def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n if not head :\\n return head\\n fast = slow = dummy = ListNode(0, head)\\n for i in range (n+1):\\n fast = fast.next;\\n if not fast :\\n return head.next;\\n while fast :\\n slow, fast = slow.next, fast.next;\\n slow.next = slow.next.next;\\n return dummy.next;\",\n \"runtime\": \"21\"\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n\\n m = head\\n a = 0\\n while a < n:\\n m = m.next\\n a += 1\\n if not m:\\n head = head.next\\n return head\\n \\n k = head\\n\\n while m.next:\\n m = m.next\\n k = k.next\\n k.next = k.next.next\\n return head\\n\\n \",\n \"runtime\": \"21\"\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n vals = []\\n current_node = head\\n while current_node:\\n vals.insert(0,current_node.val)\\n current_node = current_node.next\\n \\n vals.pop(n-1)\\n print(vals)\\n new_ll = ListNode(0)\\n new_node = new_ll\\n for val in vals[::-1]:\\n new_node.next = ListNode(val)\\n new_node = new_node.next\\n \\n return new_ll.next\",\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n dummy = ListNode()\\n dummy.next = head\\n def helper(node):\\n if not node:\\n return 0\\n res = helper(node.next)\\n if res == n:\\n node.next = node.next.next\\n return res + 1\\n helper(dummy)\\n return dummy.next\",\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n if head.next == None :return None\\n curr = head\\n i = 0\\n while curr:\\n i+=1\\n curr = curr.next\\n sz = i\\n if sz == n: return head.next\\n r = sz - n\\n \\n i = 1\\n curr = head\\n while i < r:\\n curr = curr.next\\n i+=1\\n \\n rem = curr.next\\n curr.next = rem.next\\n rem.next = None\\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n dummy = ListNode(0, head)\\n c=0\\n temp=head\\n while (temp!= None):\\n c+=1\\n temp=temp.next\\n temp=dummy\\n for i in range(c-n):\\n temp=temp.next\\n temp.next=temp.next.next\\n return dummy.next\",\n \"runtime\": \"24\"\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n if not head:\\n return None\\n left = head\\n right = head\\n prev = None\\n for i in range(n):\\n right = right.next\\n if i == n-1 and not right:\\n head = head.next\\n else:\\n while right:\\n prev = left\\n left = left.next\\n right = right.next\\n if prev and prev.next:\\n prev.next = prev.next.next\\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n dummy = ListNode(0)\\n dummy.next = head\\n\\n prev = dummy\\n slow = dummy.next\\n fast = dummy.next\\n\\n for _ in range(n):\\n fast = fast.next\\n \\n while fast:\\n prev = slow\\n slow = slow.next\\n fast = fast.next\\n \\n prev.next = slow.next\\n return dummy.next\\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n ctr = 0 \\n curr = head\\n while curr:\\n ctr+=1\\n curr = curr.next\\n c= 1\\n curr = head\\n prev = None\\n while curr:\\n if c==ctr-n+1 and c==1:\\n head = curr.next\\n elif c == ctr - n +1:\\n prev.next = curr.next \\n prev = curr\\n curr = curr.next\\n c+=1\\n return head\\n\\n \",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n dummy = ListNode(0)\\n dummy.next = head\\n first = dummy\\n second = dummy\\n\\n for _ in range(n + 1):\\n first = first.next\\n\\n while first is not None:\\n first = first.next\\n second = second.next\\n\\n second.next = second.next.next\\n\\n return dummy.next\",\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n dummy = ListNode(0, head)\\n left = dummy\\n right = head\\n while n:\\n right = right.next\\n n-=1 \\n\\n while right:\\n left = left.next\\n right = right.next\\n left.next = left.next.next\\n return dummy.next\\n'''\\n0 -> 1 -> 2 -> 3 -> 4 -> 5 -> None\\nright = 3\\nleft = 0\\n\\nr = 4\\nl = 1\\n\\nr = 5 \\nl = 2\\n\\nr = None\\nl = 3\\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n if not head:\\n return \\n if not head.next and n==1:\\n return\\n\\n prev_n_i = None\\n n_i = head\\n counter = 1 \\n current = head\\n \\n while current.next: # ----- i3\\n if counter == n: # ----- true - 1\\n prev_n_i = n_i # --- i1\\n n_i = n_i.next # --- i2\\n else:\\n counter += 1\\n \\n current = current.next #- i3\\n if n == 1:\\n prev_n_i.next = None\\n return head\\n \\n if n_i == head:\\n return head.next\\n \\n prev_n_i.next = n_i.next\\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 removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\\n \\n dummy = ListNode()\\n dummy.next = head\\n left = dummy\\n right = head\\n\\n while right and n>0:\\n right = right.next\\n n-=1\\n \\n while right:\\n right = right.next\\n left = left.next\\n \\n left.next = left.next.next\\n return dummy.next\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"